@article {847, title = {A Brief Review of the Automation of Dependency Satisfaction With in Microservices Architectures}, journal = {Journal of Digital information Management}, volume = {22}, year = {2024}, month = {09/2024}, pages = {99-107}, type = {Research}, chapter = {99}, abstract = {

Accelerated advances in network speed, re- liability, and security have increased the demand for soft- ware and services to move from being stored and pro- cessed locally on users{\textquoteright} devices to being managed by third parties that can be accessed through the network. This has led to the need to develop new software archi- tectures and software architectures that meet these new requirements. One example of software architecture is the recent emergence of a microservices architecture to meet online service providers{\textquoteright} maintenance and scalability requirements. Microservices is an architecture style that focuses on breaking down a system into small, lightweight services that are intentionally created to perform a highly cohesive business function, and it is an evolution of the traditional service-oriented architecture style. The practi- cal projection of microservices architecture in informa- tion engineering is several small applications that work together to provide an integrated service that appears to the external medium as a single application. Each of these applications has its own independent source code and deals with data sources that are different from the rest. As a result, it has an independent development team. Partial applications depend on each other to accomplish their functions, and therefore, any modification to one of the services will affect the work of the rest of the ser- vices; in large applications that require keeping the sys- tem always available, we must perform the process of publishing updates for parts of the system without stop- ping it completely, so we must monitor the impact of modi- fications and forecast system status before new updates are deployed. In achieving this prediction, we must know the dependencies between different services to arrive at a cognitive model representing the dependencies between services or applications.

}, doi = {http://www.dline.info/jdim/wp-content/uploads/3.pdf}, url = {https://10.0.23.137/jdim/2024/22/3/99-107}, author = {Ammar Esrawi and Bassel Alkhatib} } @article {846, title = {Can ChatGPT Predict Stock Market Price Movements?}, journal = {Journal of Digital Information Management}, volume = {22}, year = {2024}, month = {09/2024}, pages = {91-98}, type = {Research}, chapter = {91}, abstract = {

Accelerated advances in network speed, re- liability, and security have increased the demand for soft- ware and services to move from being stored and pro- cessed locally on users{\textquoteright} devices to being managed by third parties that can be accessed through the network. This has led to the need to develop new software archi- tectures and software architectures that meet these new requirements. One example of software architecture is the recent emergence of a microservices architecture to meet online service providers{\textquoteright} maintenance and scalability requirements. Microservices is an architecture style that focuses on breaking down a system into small, lightweight services that are intentionally created to perform a highly cohesive business function, and it is an evolution of the traditional service-oriented architecture style. The practi- cal projection of microservices architecture in informa- tion engineering is several small applications that work together to provide an integrated service that appears to the external medium as a single application. Each of these applications has its own independent source code and deals with data sources that are different from the rest. As a result, it has an independent development team. Partial applications depend on each other to accomplish their functions, and therefore, any modification to one of the services will affect the work of the rest of the ser- vices; in large applications that require keeping the sys- tem always available, we must perform the process of publishing updates for parts of the system without stop- ping it completely, so we must monitor the impact of modi- fications and forecast system status before new updates are deployed. In achieving this prediction, we must know the dependencies between different services to arrive at a cognitive model representing the dependencies between services or applications.

}, doi = {https://10.0.23.137/jdim/2024/22/3/91-98}, url = {http://www.dline.info/jdim/wp-content/uploads/2.pdf}, author = {Ammar Esrawi and Bassel Alkhatib} } @article {738, title = {Evaluation of Local Green Supply Chain Performance Using a Three-Phase Data Envelopment Analysis (DEA) Model and Malmquist Efficiency Framework}, journal = {Journal of Digital Information Management}, volume = {22}, year = {2024}, month = {06/2024}, pages = {63-73}, chapter = {63}, abstract = {

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

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

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

}, doi = {https://doi.org/10.6025/jdim/2024/22/17-32}, url = {https://www.dline.info/fpaper/jdim/v22i1/jdimv22i1_3.pdf}, author = {Maysam Shafiee and Parasto Iranpak and Mohammad Zand} } @article {736, title = {Predicting the Productivity of China{\textquoteright}s Building Sector and the Elements that Affect it Using the DEA-Tobit Framework}, journal = {Journal of Digital InformationManagement}, volume = {22}, year = {2024}, month = {06/2024}, pages = {46-55}, type = {Research}, chapter = {46}, abstract = {

The total output value of the construction industry, a pillar industry of China, is continuously growing with the expansion of the production and operation scale of Chinese construction enterprises. The extensive high-input mode has promoted the economic growth of the construction industry. Despite the fruitful and outstanding results, production inefficiency has become especially prominent. Though developing rapidly, China{\textquoteright}s construction industry possesses fewer ecological investments, accompanied by low environmental awareness and little importance to environmental protection, constantly failing to eliminate high energy consumption, high investments, and high emissions. In addition, the contradiction between the economic growth of the construction industry and the ecological environment remains evident. In this paper, the production efficiency of China{\textquoteright}s construction industry was transversely and longitudinally measured using the DEA-Malmquist index method, followed by a further analysis of the factors influencing the production efficiency of China{\textquoteright}s construction industry based on the Tobit regression model. The results show that the average production efficiency of China{\textquoteright}s construction industry is the highest in the East, moderate in the West, and lowest in the centre. The number of construction enterprises, per capita capital, industrial structure, the proportion of state-owned capitals, and GDP are significant at 1\%, 10\%, 1\%, 1\%, and 1\%, respectively. The research results can provide theoretical reference for reasonably establishing an ecological efficiency evaluation system for the construction industry to analyze the differences in environmental efficiency among different provinces and regions, further find out the key factors influencing ecological efficiency, propose the corresponding pertinent policy suggestions, and ultimately improve the ecological efficiency of China{\textquoteright}s construction industry.

}, doi = {https://10.6025/jdim/2024/22/2/46-55}, url = {http://www.dline.info/download.php?sn=4053}, author = {Guang Cheng} } @article {845, title = {Predictive Modeling of Stock Price Trends Using Machine Learning and Deep Learning Techniques-}, journal = {Journal of digital information management}, volume = {22}, year = {2024}, month = {09/2024}, pages = {83-90}, type = {Research}, chapter = {83}, abstract = {

:Predicting stock price movements has been challenging yet crucial for investors and financial ana- lysts. Fluctuations in stock prices are valuable economic indicators, providing insights into overall economic well- being, consumer confidence, and market sentiment. In this study, we evaluate the efficacy of three different ma- chine and deep learning algorithms in anticipating stock price trends. We assess the performance of Logistic Re- gression, Random Forest Regression, and Long Short- Term Memory (LSTM) algorithms in forecasting whether a stock{\textquoteright}s price will rise or fall in the upcoming period, utilising historical stock price data as input features. Our findings demonstrate that while each algorithm exhibits varying degrees of predictive accuracy, LSTM networks stand out as they generally outperform Logistic Regression and Random Forest Regression in capturing the complex tem- poral dependencies inherent in stock price data. This suggests that LSTM networks, with their superior perfor- mance, hold significant promise as effective tools for stock price trend prediction, particularly in volatile and non-lin- ear financial markets. This could be a game-changer in stock price prediction, instilling optimism about the fu- ture of stock market analysis..

}, doi = {https://10.0.23.137/jdim/2024/22/3/83-90}, url = {http://www.dline.info/jdim/wp-content/uploads/1.pdf}, author = {K. Kiruthika and E.S. Samundeeswari} } @article {739, title = {A Recognition Learning System Based on Poetry Database and Text Pattern Function}, journal = {Journal of Digital Information Management}, volume = {22}, year = {2024}, month = {03/2024}, pages = {1-7}, chapter = {1}, abstract = {

This article introduces a recognition learning system based on a poetry database and text pattern function. The system aims to help students better understand and remember poetry and improve the efficiency of Chinese language learning. The system{\textquoteright}s core components include a poetry database, text pattern recognition, and personalized learning modules. The poetry database contains a wealth of poetry works, providing students with rich learning resources. The text pattern recognition module can automatically recognize patterns in poetry, such as rhyme and contrast, to help students understand the structural characteristics of poetry. The personalized learning module provides suggestions and exercises based on students{\textquoteright} learning progress and abilities to achieve precise teaching.

}, doi = {https://doi.org/10.6025/jdim/2024/22/1/1-7}, url = {https://www.dline.info/fpaper/jdim/v22i1/jdimv22i1_1.pdf}, author = {Youyu Hu} } @article {740, title = {Study to Analyze the Effect of Online Reviews and Smart Phone Buying Behaviour of Customers}, journal = {Journal of Digital Information Management}, volume = {22}, year = {2024}, month = {03/2024}, pages = {8-16}, chapter = {8}, abstract = {

Consumer behaviour towards mobile phones is increasingly becoming a focus of marketing research. In particular, consumer buying behaviour in the mobile phones industry, and online reviews of the existing customers from adoption motivation to post-usage behaviour has become a significant focus of research in the field of marketing. The results of the research confirm that online reviews play a vital role and influence consumer behaviour towards mobile phone purchase decisions by affecting their perception, motivation, and lifestyle. India is one of the fastest-growing economies in the world, and the mobile phone industry is growing very fast. For consumers, mobile phones have become essential parts of personal and business life. There is a continuous increase in disposable income; there has been a major shift in the attitude and aspirations of consumers. This research analyses the influence of online reviews and buying behaviour in mobile phone purchases. The recent growth of mobile phone usage is an observable fact that crosses all age and gender boundaries. Hence, this research explores through quantitative analysis some of the key factors believed to affect consumers{\textquoteright} attitudes and behaviours towards mobile phone purchases.

}, doi = {https://doi.org/10.6025/jdim/2024/22/1/8-16}, url = {https://www.dline.info/fpaper/jdim/v22i1/jdimv22i1_2.pdf}, author = {Nitesh Kanojiya and Pooja Sharma} } @article {737, title = {Urban Rainwater Management and Protection Through Optimization for Multiple Goals}, journal = {Journal of Digital Information Management}, volume = {22}, year = {2024}, month = {06/2024}, pages = {56-62}, type = {Research}, chapter = {56}, abstract = {

With the continuous acceleration of urbanization, urban rainwater management has become an increasingly important issue. In the process of urbanization, the increase in impervious area and insufficient drainage systems have led to an increase in rainwater runoff and a risk of water quality deterioration. This article explores the application of multi-objective optimization in landscape urban rainwater design and defense. Against the backdrop of accelerating urbanization, rainwater management has become an important issue. By introducing multi-objective optimization methods, the aim is to seek a more comprehensive and effective rainwater design solution to address the impact of urbanization on rainwater.

}, doi = {https://doi.org/10.6025/jdim/2024/22/2/56-62}, url = {https://www.dline.info/fpaper/jdim/v22i2/jdimv22i2_2.pdf}, author = {L Yong} } @article {751, title = {An Algorithm of Wavelet Data Compression Based on Wireless Sensor Network}, journal = {Journal of Digital Information Management}, volume = {21}, year = {2023}, month = {03-2023}, pages = {1-8}, type = {Research}, chapter = {1}, abstract = {

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

}, doi = {https://doi.org/10.6025/jdim/2023/21/1/1-8}, url = {http://www.dline.info/download.php?sn=3681}, author = {Luo Xiao} } @article {750, title = {Analysis of ChatGPT as a Question-Answering Tool}, journal = {Journal of Digital Information Management}, volume = {21}, year = {2023}, month = {06/2023}, pages = {50-61}, type = {Research}, chapter = {50}, abstract = {

\ ChatGPT, in recent months, has made a significant impact and exposure in the information world. Many studies have been conducted within a shorter timeframe about its efficiency, reliability, ethics, accuracy and acceptance. Besides, hundreds of opinions and perception-based analyses have also emerged. In this work, we look at the ChatGPT as a question-answering tool. We have used randomly generated prompts to solicit answers and analysed the results from a text analysis angle. The answers are compared with text analysers both manually and statistically. ChatGPT still needs more precision for linguistic effects and fails to meet comprehensive users{\textquoteright} requirements.

}, doi = {https://doi.org/10.6025/jdim/2023/21/2/50-61}, url = {http://www.dline.info/download.php?sn=3758}, author = {Pit Pichappan and M. Krishnamurthy and P. Vijayakumar} } @article {747, title = {Analysis of the Growth of Medical Information Systems-}, journal = {Journal of Digital Information Management}, volume = {21}, year = {2023}, month = {09/2023}, pages = {88-95}, type = {Research}, chapter = {88}, abstract = {

\ Information Systems and Technologies (IST) in healthcare have evolved gradually, and theories about adopting and maturing information systems and technologies are sufficiently established in organisational management literature. In this paper, we approach the evolution of IST in healthcare, introducing the concepts associated with maturity models, addressing the generic maturity model for IST management, and explicitly presenting the main maturity models focusing on the management of IST in healthcare. Relatively to the last ones, we conclude that there is still a way to go in having widespread and detailed maturity models available.

}, doi = {https://doi.org/10.6025/jdim/2023/21/3/88-95}, url = {http://www.dline.info/download.php?sn=3838}, author = {{\'A}lvaro Rocha} } @article {749, title = {ASR Features Extraction Using MFCC And LPC: A Comparative Study-}, journal = {Journal of Digital Information Management}, volume = {21}, year = {2023}, month = {06/2023}, pages = {39-49}, type = {Research}, chapter = {39}, abstract = {

The field of Automatic Speaker Recognition (ASR) is an important and open field for researchers and scientists, especially as it has become essential in facilitating the work we do in our daily lives. Such as digital authentication and electronic transactions, and consider It as a secure environment to authenticate users{\textquoteright} access to their accounts. Many technologies have been developed in the field of recognition but so far, there is no complete tool or method for speaker identification, the most important step in ASR is the extraction of voice features. Many methods and tools can be used to extract the speaker{\textquoteright}s vocal characteristics (voice features), which in turn will identify the user and recognize his voice spectrum through the phonetic linguistic message. In this paper, two methods will be studied, each using a different technique MFCC, which uses a logarithmic scale, and LPC, which uses a linear scale. The method used in ASR should have minimal error because it is an important authentication technology like a fingerprint, where two different people cannot have the same voice spectral range (voiceprint).

}, doi = {https://doi.org/10.6025/jdim/2023/21/2/39-49}, url = {http://www.dline.info/download.php?sn=3757}, author = {Bassel Alkhatib and Mohammad Madian Kamal Eddin} } @article {734, title = {Convolutional Neural Networks for Handwritten Text Recognition of Medical Prescription-}, journal = { Journal of Digital Information Management}, volume = {21}, year = {2023}, month = {12/2023}, pages = {117--124}, chapter = {117}, abstract = {

Converting handwritten prescriptions into electronic format offers several advantages and is crucial for modern healthcare systems. It is essential nowadays because of some factors such as {\textendash} Legibility and Accuracy: Handwritten prescriptions can be challenging to read and interpret; accessibility and Portability: Electronic prescriptions can be easily stored; Decision Support Systems: By digitising prescriptions, healthcare systems can integrate them with electronic health records (EHRs) and utilise decision support systems. Convolutional neural networks (CNNs) are a class of deep learning algorithms that have proven effective in extracting handwritten text from various documents, including medical prescriptions. By leveraging CNNs for handwritten text extraction, healthcare systems can automate the process of digitising prescriptions, reducing manual effort and potential human errors. This enables seamless integration with electronic systems, facilitating better patient care and overall healthcare management. In this paper, we have trained the CNN model for different parameters and observed the accuracy and loss for various parameters. We got a maximum training accuracy of 89\% and a maximum testing accuracy of 70\%.

}, doi = {https://doi.org/10.6025/jdim/2023/21/4/117-124}, url = {https://www.dline.info/fpaper/jdim/v21i4/jdimv21i4_3.pdf}, author = {Makarand Shahade and Mayuri Kulkarni and Vivek Pawar and Jatin Chaudhari and Yash Lakade and Darshan Kotkar} } @article {744, title = {Convolutional Neural Networks for Handwritten Text Recognition of Medical Prescription-}, journal = {Journal of Digital Information Management}, volume = {21}, year = {2023}, month = {12/2023}, pages = {117-124}, type = {Research}, chapter = {117}, abstract = {

Converting handwritten prescriptions into electronic format offers several advantages and is crucial for modern healthcare systems. It is essential nowadays because of some factors such as {\textendash} Legibility and Accuracy: Handwritten prescriptions can be challenging to read and interpret; accessibility and Portability: Electronic prescriptions can be easily stored; Decision Support Systems: By digitising prescriptions, healthcare systems can integrate them with electronic health records (EHRs) and utilise decision support systems. Convolutional neural networks (CNNs) are a class of deep learning algorithms that have proven effective in extracting handwritten text from various documents, including medical prescriptions. By leveraging CNNs for handwritten text extraction, healthcare systems can automate the process of digitising prescriptions, reducing manual effort and potential human errors. This enables seamless integration with electronic systems, facilitating better patient care and overall healthcare management. In this paper, we have trained the CNN model for different parameters and observed the accuracy and loss for various parameters. We got a maximum training accuracy of 89\% and a maximum testing accuracy of 70\%.

}, doi = {https://doi.org/10.6025/jdim/2023/21/4/117-124}, url = {http://www.dline.info/download.php?sn=3899}, author = {Makarand Shahade and Mayuri Kulkarni and Vivek Pawar and Jatin Chaudhari and Yash Lakade and Darshan Kotkar} } @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 {753, title = {How Much Difference in Earthquake Risk among China{\textquoteright}s Areas: A Study based on Pricing a Seismic Catastrophe Bond}, journal = {Journal of Digital Information Management}, volume = {21}, year = {2023}, month = {03/2023}, pages = {18-23}, type = {Research}, chapter = {18}, abstract = {

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

}, doi = {https://doi.org/10.6025/jdim/2023/21/1/18-23}, url = {http://www.dline.info/download.php?sn=3683}, author = {Yong Zhang and Wei Liu} } @article {746, title = {Improvement of English-Chinese Translation Method by Feature Reduction and Rule Optimization Based on Rough Set Theory-}, journal = {Journal of Digital Information Management}, volume = {21}, year = {2023}, month = {09-2023}, pages = {83-87}, type = {Research}, chapter = {83}, abstract = {

The traditional machine translation algorithm faces low efficiency and low accuracy due to complex grammar and multiple rules of English noun phrases. A kind of noun phrase identification method based on a rough set was proposed to improve the accuracy of English noun phrases. The rough set method regarded the identification of English noun phrases as a decision problem. We used rough set theory to reduce features, optimize rules for English noun phrases, and finally identify them. Then, a simulation experiment was carried out on an English noun phrase sample on the Wall Street Journal (WSJ) using rough set theory. The stimulation demonstrated that the accuracy of the noun phrase improved by the rough set was higher than another translation method; therefore, it is an effective machine identification method for English noun phrases, providing a basis for practical design.

}, doi = {https://doi.org/10.6025/jdim/2023/21/3/83-87}, url = {http://www.dline.info/download.php?sn=3837}, author = {Hongxia Wei} } @article {742, title = {Recruitment Management System Design and Deployment-Based on PHP Analysis}, journal = {Journal of Digital Information Management}, volume = {21}, year = {2023}, month = {11/2023}, pages = {101-109}, type = {Research}, chapter = {101}, abstract = {

\ This article aims to create a three-level architecture based on PHP to implement a company{\textquoteright}s recruitment management system. This architecture will be combined with the new features in the existing recruitment work, considering their understanding of the recruitment process and the recruitment system they have designed and implemented. This article will analyze the benefits and drawbacks of PHP language, discuss the system design and implementation method based on analysing the advantages and disadvantages of the threelevel architecture of PHP and various driver model research. Based on this analysis, choose the most appropriate design drive method for the design of a recruitment management system. Based on the features of the existing recruitment company, the system will be designed to implement company recruitment management. The actual recruitment work, divided into four parts, will be discussed in this article. The realization and function of these four modules, and their realization and function, will help standardize and systematize the recruitment process. In this article, we will discuss how the four modules of the Access control system are realized and how they work, and how the following modules are realized and function to standardize and standardize the recruitment process and significantly reduce staff recruitment workload, improve the efficiency of the transfer of recruitment, shorten the hiring process, and reduce recruitment management work costs.

}, doi = {https://doi.org/10.6025/jdim/2023/21/4/101-109}, url = {http://www.dline.info/download.php?sn=3897}, author = {Youyu Hu} } @article {732, title = {Recruitment Management System Design and Deployment-Based on PHPAnalysis}, journal = {Journal of Digital Information Management}, volume = {21}, year = {2023}, month = {12/2023}, pages = {101-109}, chapter = {101}, abstract = {

This article aims to create a three-level architecture based on PHP to implement a company{\textquoteright}s recruitment management system. This architecture will be combined with the new features in the existing recruitment work, considering their understanding of the recruitment process and the recruitment system they have designed and implemented. This article will analyze the benefits and drawbacks of PHP language, discuss the system design and implementation method based on analysing the advantages and disadvantages of the threelevel architecture of PHP and various driver model research. Based on this analysis, choose the most appropriate design drive method for the design of a recruitment management system. Based on the features of the existing recruitment company, the system will be designed to implement company recruitment management. The actual recruitment work, divided into four parts, will be discussed in this article. The realization and function of these four modules, and their realization and function, will help standardize and systematize the recruitment process. In this article, we will discuss how the four modules of the Access control system are realized and how they work, and how the following modules are realized and function to standardize and standardize the recruitment process and significantly reduce staff recruitment workload, improve the efficiency of the transfer of recruitment, shorten the hiring process, and reduce recruitment management work costs.

}, doi = {10.6025/jdim/2023/21/4/101-109}, url = {https://www.dline.info/fpaper/jdim/v21i4/jdimv21i4_1.pdf}, author = {Youyu Hu} } @article {748, title = {A Step towards Semantic Digital Library in the Arabic Region-}, journal = {Journal of Digital Information Management}, volume = {21}, year = {2023}, month = {06/2023}, pages = {29-38}, chapter = {29}, abstract = {

The use of semantic web technologies is very limited in Arab libraries, even with the existence of important historical and literary documents, and the great digitization movement now, the documents are still trapped within the databases of the separated libraries and are not visible to search engines. The research aims to Study the applications of semantic web technologies in catalogs of digital, hybrid libraries and catalogs of public libraries, exploring the main ontologies and conceptual Data models used in the field, and the possibilities of reusing them with Arab libraries, or the need to build new ontologies, studying the necessary steps, tools, and best practices, define the difficulties and challenges facing the Arabic semantic library and searching for possible technical solutions, our experiments target the heterogeneous databases of small, medium or large libraries, considering that some Arabic library catalogs are not following a standard Data Model, to contribute to the research and development of integrating bibliographic data of Arab libraries and moving towards the Semantic web and Linked Open Data.

}, doi = {https://doi.org/10.6025/jdim/2023/21/2/29-38}, url = {http://www.dline.info/download.php?sn=3756}, author = {Maysah Alsahar and Bassel Alkhatib} } @article {745, title = {Wireless Sensor Networks: New Deployment Topology and DV-hop Algorithm Improvement-}, journal = {Journal of Digital Information Management}, volume = {21}, year = {2023}, month = {09/2023}, pages = {71-82}, type = {Research}, chapter = {71}, abstract = {

Wireless sensor networks (WSN) have become an integral part of our daily lives due to their small size, smart technology, lower cost, and wireless communication capabilities. In this paper, we propose a new WSN topology based on a hierarchical routing protocol. Additionally, we propose an enhancement to the DV-hop algorithm. Our proposed topology differs from existing approaches, and our enhanced algorithm improves upon the original DV-hop algorithm. The performance evaluations are globally satisfactory.

}, doi = {https://doi.org/10.6025/jdim/2023/21/3/71-82}, url = {http://www.dline.info/download.php?sn=3836}, author = {Rania ROUAM and Mouna HAMID and Mourad Amad} } @article {757, title = {ASR Features Extraction Using MFCC and LPC: A Comparative Study-}, journal = {Journal of Digital Information Management}, volume = {20}, year = {2022}, month = {09-2022}, pages = {79-89}, type = {Research}, chapter = {79}, abstract = {

The field of Automatic Speaker Recognition (ASR) is an important and open field for researchers and scientists, especially as it has become essential in facilitating the work we do in our daily lives. Many technologies have been developed in the recognition field. Such as digital authentication and electronic transactions; consider It a secure environment to authenticate user{\textquoteright}s access to their accounts. Still, so far, there is no complete tool or method for speaker identification, the most crucial step in ASR is the extraction of voice features. Many techniques and tools can extract the speaker{\textquoteright}s vocal characteristics (voice features), identifying the user and recognising his voice spectrum through the phonetic and linguistic message. In this paper, two methods will be studied, each using a different technique MFCC, which uses a logarithmic scale, and LPC, which uses a linear scale. The method used in ASR should have a minimal error because it is a crucial authentication technology like a fingerprint, where two different people cannot have the same voice spectral range (voiceprint).

}, doi = {https://doi.org/10.6025/jdim/2022/20/3/79-89}, url = {http://www.dline.info/download.php?sn=3566}, author = {Mohammad Madian Kamal Eddin and Bassel Alkhatib} } @article {754, title = {COVID- 19 pandemic {\textendash} An Empirical Study on the Cybersecurity Behaviour of Healthcare Sectors and Employees}, journal = {Journal of Digital Information Management}, volume = {20}, year = {2022}, month = {12/2022}, pages = {115-130}, type = {Research}, chapter = {115}, abstract = {

Earlier research by our team have focussed the multilayer SAM spiking neural network using training algorithms for implementing FPGA. In the current work we have outlined the utilization of SAM-based network for developing function approximation. We have deployed the spike coding model for the work. In the testing we have proved that the {\^a}{\texteuro}{\oe}interpolated XOR{\^a}{\texteuro} and 3-polynominal function approximation of this SAM network. We found that the SAM network has the ability to perform these function approximations to high accuracy.

}, doi = {https://doi.org/10.6025/jdim/2022/20/4/115-130}, url = {http://www.dline.info/download.php?sn=3617}, author = {Harrison Stewart} } @article {755, title = {Deep Learning Model CNN With LSTM For Speaker Recognition}, journal = {Journal of Digital Information Management}, volume = {20}, year = {2022}, month = {12/2022}, pages = {131-147}, type = {Research}, chapter = {131}, abstract = {

Speech recognition is one of the most important research fields nowadays because of its necessity in our daily lives and to raise the fields of security to the highest level, It{\^a}{\texteuro}{\texttrademark}s a task of speech processing, and our main scope in this paper is on speaker verification, which is to identify persons from their voices where the process depends on digitizing the sound waves into a form that allows the system to deal with it. The verification process is based on the characteristics of the speaker{\textquoteright}s voice (voice biometrics) and sends it to a further process to extract the features of that voice using the feature extraction method and using AI techniques to perform the task of identification. MFCC is used for the task of features extraction and obtains the spectrogram of a given voice signal where it represents a bank of information about the voice and sends it to the CNN model for further processing for training the model on that signal to verify if the voice belongs to a user in the system or it{\^a}{\texteuro}{\texttrademark}s a new enrollment.

}, author = {Bassel Alkhatib and Mohammad Madian and Kamal Eddin} } @article {844, title = {A Design of Chao Phraya Express Boat Route and Tourist Attraction Application On Android-}, journal = {Journal of Digital Information Management}, volume = {20}, year = {2022}, month = {06/2022}, pages = {67-74}, type = {Research}, chapter = {67}, abstract = {

This paper aims to develop a design for the Chao Phraya Express Boat application and evaluate users{\textquoteright} satisfaction with the Chao Phraya Express Boat application. In this paper, the Chao Phraya Express Boat application is developed to search the Chao Phraya Express Boat route, tourist attractions, and travel guide information. This application has been designed to present travel information, route map, timetable and emergency call. The results show that the users can search Chao Phraya Express Boat trip information using the pier{\textquoteright}s name or map. The application can display Chao Phraya Express Boat trip information such as the flag type, the distance between the starting point and the endpoint, timetable, transfer connection, fares and tourist attractions. The conclusion of the assessment of user satisfaction on the Chao Phraya Express Boat application for all the environments, the users have been highly satisfied.

}, doi = {https://doi.org/10.6025/jdim/2022/20/2/67-74}, url = {http://www.dline.info/download.php?sn=3513}, author = {Hathairat Ketmaneechairat and Supakit Thurapan and Sireethorn Phadlom} } @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 {759, title = {Impact of Digital Leadership on Kuwaiti hospitals{\textquoteright} Employees{\textquoteright} Performance-}, journal = {Journal of Digital Information Management}, volume = {20}, year = {2022}, month = {09/2022}, pages = {104-110}, type = {Research}, chapter = {104}, abstract = {

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

}, doi = {https://doi.org/10.6025/jdim/2022/20/3/104-110}, url = {http://www.dline.info/download.php?sn=3568}, author = {Esraa Omran and Salah Al Sharhan and Tyrone Grandison} } @article {762, title = {Public Key Cryptosystem and Binary Edwards Curves on the Ring}, journal = {Journal of Digital Information Management}, volume = {20}, year = {2022}, month = {03/2022}, pages = {25-30}, type = {Research}, chapter = {25}, abstract = {

\ Let be a finite ring of characteristic 2, where e2 = e and n is a positive integer. Let (a, d) 2 ( )2, such that a and d + a2 + a are invertible in , we study the binary Edwards curve over this ring, denoted by and we give a bijection between this curve and produces two binary Edwards curves defined on the finite field . Afterthat we study the addition law of binary Edwards curves over the ring . We end this work with cryptography applications, ElGamal twisted Edwards curve cryptosystem and Cramer-Shoup twisted Edwards curve cryptosystem.

}, doi = {https://doi.org/10.6025/jdim/2022/20/1/25-30}, url = {http://www.dline.info/download.php?sn=3450}, author = {Moha ben taleb Elhamam} } @article {761, title = {A Survey of Sentiment Analysis in the Arabic Language}, journal = {Journal of Digital Information Management}, volume = {20}, year = {2022}, month = {03/2022}, pages = {10-24}, type = {Research}, chapter = {10}, abstract = {

\ {\^a}{\texteuro}{\oe}What the others think?{\^a}{\texteuro} is an essential question for individuals, companies, and governments. All need to know the public opinions to make their decisions wisely. In the last decade, sentiment analysis and opinion mining have become one of the growing research areas. This paper presents the current state of sentiment analysis and opinion mining research. In particular, researches those deals with the Arabic language. We tried to cover the techniques and methods in sentiment analysis and the challenges in the field. We described the leading methods and approaches that have been introduced in the literature for Arabic Sentiment analysis and opinion mining. The main contributions of this paper include the sophisticated categorizations of a large number of recent articles about Arabic Sentiment analysis. These articles are categorized according to their contributions in the various sentiment analysis techniques.

}, doi = {https://doi.org/10.6025/jdim/2022/20/1/10-24}, url = {http://www.dline.info/download.php?sn=3449}, author = {Kamel JAFAR and Bassel Alkhatib and Hazem WANNOUS} } @article {760, title = {A Systematic Review of Serious Games Relating to Cognitive Impairment and Dementia}, journal = {https://www.dline.info/jdim}, volume = {20}, year = {2022}, month = {03/2022}, pages = {1-9}, type = {Research}, chapter = {1}, abstract = {

\ Assessment, diagnosis, and cognitive stimulation of patients with different stages of cognitive impairment, including mild cognitive impairment (MCI) and Alzheimer{\^a}{\texteuro}{\texttrademark}s disease, has become a growing area of research. Recently, there has been an increase in interest in applying serious games for older people with neurodegenerative diseases. The present systematic review aims to investigate and classify serious games for detecting cognitive impairment in the elderly. In this review, searches focused on studies conducted between 2014 and 2021, of which twenty-four studies met the inclusion criteria. In this regard, we identified a few categories for the collective classification of serious games. We chose taxonomy of five classes to classify serious games dedicated to cognitive training and diagnosis among seniors: cognitive skills, objectives, game elements, motivation, and validation. We conclude that gamified techniques prove to be a valuable complement to traditional treatments because of the increased patient engagement.

}, doi = {https://doi.org/10.6025/jdim/2022/20/1/1-9}, url = {http://www.dline.info/download.php?sn=3448}, author = {Samiha Mezrar and Fatima Bendella} } @article {756, title = {Utilization of SAM-based network for developing function approximation}, journal = {Journal of Digital Information Management}, volume = {20}, year = {2022}, month = {12/2022}, pages = {148-155}, type = {Research}, chapter = {148}, abstract = {

We have previously reported progress in developing a multilayer SAM spiking neural network and a training algorithm, suitable for implementation on an FPGA with {\^a}{\texteuro}{\oe}On- Chip Learning{\^a}{\texteuro}. Here we report on utilization of a SAM -based network for continuous function approximation, which to date has proved difficult to achieve on a LIF type spiking neural network, by using a spike coding approach called {\^a}{\texteuro}\~{}NFR-coding{\^a}{\texteuro}{\texttrademark}. We demonstrate {\^a}{\texteuro}{\oe}interpolated XOR{\^a}{\texteuro} and 3-polynominal function approximation of this SAM network in computational experiments. It is demonstrated that the SAM network has the capability to perform these function approximations to high accuracy.

}, doi = {https://doi.org/10.6025/jdim/2022/20/4/148-155}, url = {http://www.dline.info/download.php?sn=3619}, author = {Minoru Motoki and Hirohito Shintani and Kazunori Matsuo and Thomas Martin McGinnity} } @article {758, title = {Why ISO27001 Certified Organizations Still Experience Data Leakage?}, journal = {Journal of Digital Information Management}, volume = {20}, year = {2022}, month = {09/2022}, pages = {90-103}, type = {Research}, chapter = {90}, abstract = {

The increases in mobile applications, IoT, and cloud technology have recently witnessed massive data leaks, ranging from personally identifiable information to corporate secrets. Despite numerous standards and frameworks, human errors that cause information security breaches have not yet been managed. This study contributes to the ISMS literature regarding the processing and operating of an ISMS concept based on the new comprehensive measures of information security management. The study uses exploratory surveys to determine significant differences in the fifty financial institutes. The study confirmed that the primary root cause of information security incidents is the interrelationship between humans and technology. The results of this study show that the NFC principle can assist in the enhancement and ability to monitor the performance of these interconnections compared to other recognized standalone ISMS standards.

}, author = {Harrison Stewart} } @article {771, title = { Automated Management of Computer Management Procedure of Critical Control Point Information on HACCP System-}, journal = {Journal of Digital Information Management}, volume = {19}, year = {2021}, month = {03/2021}, pages = {27-30}, type = {Research}, chapter = {27}, abstract = {

Aiming to solve the management and decision- making problems occurring in food production field at present, this study strives to build an accurate and effective hazard analysis and critical control point (HACCP) computer automated management system combined with computer management programs by taking the HACCP system as standard. This system is able to be integrated into the overall framework of the system applying case-based reasoning (CBR) technology combined with ontological content and extended content, and emphasizes on exploring knowledge representation of HACCP system and computing method of similar cases, which improves the safety and order of food production.

}, doi = {https://doi.org/110.6025/jdim/2021/19/1/27-30}, url = {http://www.dline.info/download.php?sn=3173}, author = {Yongmei Li and Yang Zhao and Lingjun Wang and Ying Wang} } @article {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 {764, title = {The Imperialist Competitive Algorithm for Automated Mining of Association Rules-}, journal = {Journal of Digital Information Management}, volume = {19}, year = {2021}, month = {12/2021}, pages = {135-143}, type = {Research}, chapter = {135}, abstract = {

\ Association rule mining is an optimization problem because of several limitations. Recently, the imperialist competitive algorithm (ICA) has been submitted for solving different optimization problems. This algorithm is based on the socio-political competition among empires. This paper proposes a novel ICA algorithm for automated mining of the exciting and readable association rules without considering the minimum support and confidence thresholds. The convergence rate and computational efficiency of ICA have been improved. This study shows that ICA is combined with some operators of genetic algorithms. The experimental results show that this algorithm is more efficient than the methods of mining association rules based on the basic ICA and the genetic algorithm. These modifications are not only valid for association rule mining but also have extensions to other optimization problems.

}, doi = {https://doi.org/10.6025/jdim/2021/19/4/135-143}, url = {http://www.dline.info/download.php?sn=3369}, author = {Fariba Khademolghorani} } @article {767, title = { Incorporating Quality Measurement into Scientific Document Retrieval {\textendash}}, journal = {Journal of Digital Information Management}, volume = {19}, year = {2021}, month = {06/2021}, pages = {47-58}, type = {Research}, chapter = {47}, abstract = {

\ One of the challenges facing today{\textquoteright}s researchers is how to find qualitative information that meets their needs. In scientific research, the quality of information is very important for institution quality improvement and research validation. The main purpose of the paper is the proposal of a scientometric annotation approach to improve retrieval system performance and meet researchers{\^a}{\texteuro}{\texttrademark} needs. In this work, we discuss how to use scientometrics in document annotation to improve information quality. One possible solution to this problem is to automate and facilitate the selection of qualitative scientific documents by enriching the document annotation process with scientometric criterion. Our approach provided better performance for retrieval system compared to BM25 retrieval model. The best performance was supplied by the integration of document citation number and journal or conference ranking. The best improvement rate was 34.21\% in F-measure, 52.22\% in nDCG, 27.45\% in MAP and 83.33\% in P(k). An important implication of this finding is the existence of correlation between research paper quality and paper relevance.

}, doi = {https://doi.org/10.6025/jdim/2021/19/2/47-58}, url = {http://www.dline.info/download.php?sn=3259}, author = {Nedra Ibrahim and Anja Habacha Chaibi and Henda Ben Gh{\'e}zala} } @article {769, title = {Information Organization Activities in the Knowledge Management Setting-}, journal = {Journal of Digital Information Management}, volume = {19}, year = {2021}, month = {03/2021}, pages = {1-9}, type = {Research}, chapter = {1}, abstract = {

\ This study examines information organization activities in the knowledge management environment. The investigation commences with the long-drawn debate on the concept of Knowledge Management and the literature that has hitherto reviewed it. Furthermore, the study delves into how conventional bibliographic information retrieval techniques and expert search systems have heretofore been applied in the organization and retrieval of digital resources and if they can be employed in the Knowledge management setting. It is contended that though the procedures, tools, and techniques are effectual and productive, they cannot be utilized in a knowledge intensive environment. Accordingly, the study puts forth a generic knowledge management framework that can be applied in a knowledge management setting. In addition, it proposes novel research gaps in the context of information organization.

}, doi = {https://doi.org/110.6025/jdim/2021/19/1/1-9}, url = {http://www.dline.info/download.php?sn=3171}, author = {Johnson Mulongo Masinde and Otuoma Sanya} } @article {763, title = {Learning from Web Searching: Enhancing Users{\textquoteright} Experiences with NaviWeb Mobile System-}, journal = {https://www.dline.info/jdim}, volume = {19}, year = {2021}, month = {12/2021}, pages = {113-124}, type = {Research}, chapter = {113}, doi = {https://doi.org/10.6025/jdim/2021/19/4/113-124}, url = {http://www.dline.info/download.php?sn=3367}, author = {Shaden Al Marshad and Jawad Berri} } @article {768, title = {Migration Intelligence: AI and Bio-surveillance of Migration Flows-}, journal = {Journal of Digital Information Management}, volume = {19}, year = {2021}, month = {06/2021}, pages = {59-64}, type = {Research}, chapter = {59}, abstract = {

\ The Coronavirus pandemic has made the use of artificial intelligence even more pervasive. States have decided to initiate bio-surveillance, through automated drones and other types of technologies such as GPS in mobile phones, to track COVID-19 positive individuals through apps or smart thermal cameras to control the spread of the virus. The current health crisis is making us deal with the dilemma regarding {\^a}{\texteuro}\~{}invisible populations{\^a}{\texteuro}{\texttrademark}, and migrants in particular, which involves a number of social and technological problems. On the one hand, lack of visibility is a systematic aspect of population management that can benefit both governments and the people concerned. The illusion of a {\^a}{\texteuro}\~{}data panoptic{\^a}{\texteuro}{\texttrademark} does not take into account the conditions under which data are collected, the gaps or limitations of an interoperable system: in any system, not everything is counted, and not in the same way. This invisibility can come in handy for shadowy economies and unscrupulous politicians ready to sound Security alarms. On the flip side, for categories such as the homeless, prisoners, migrants and sex workers, invisibility can be a defence against attention that too often resembles control and surveillance. The technodigital management of migratory flows and migrants{\^a}{\texteuro}{\texttrademark} data clashes with ethical-legal issues that are still open, and which concern all those sectors that involve the massive use of technology. Issues that in this case have become the two big questions of the current research: does data monitoring risk becoming a control mechanism that hinders the recognition of fundamental human rights? Is it currently possible to predict the real risks and harms of the technologies used to digitally manage migration? The central thesis presented in this article aims to high as a result of neural network training actions) can significantly influence the management of migration flows in the (post)pandemic society. The methodology adopted is based on an in-depth study of legal, socio-political and technological academic literature and a comparison of different sources. It examines current trends in the development of digital tools and the consequences these may have for international migration and the individual lives of migrants in the host country. It is believed that this reflection, although mainly theoretical, can contribute to the debate on the future of digital management of international migration, inviting policy makers and experts in this field to reflect on the complexity of the relationship between AI and migrants, in order to develop an open, secure, ethical and shared data system as soon as possible. Furthermore, a new concept, called {\^a}{\texteuro}\~{}Migration Intelligence{\^a}{\texteuro}{\texttrademark} will be introduced, and it is understood here as a set of specific activities concerning identity checks, border security and management, and analysis of biometric data on migrants, refugees and asylum seekers. and the consequences these may have for international migration and the individual lives of migrants in the host country. It is believed that this reflection, although mainly theoretical, can contribute to the debate on the future of digital management of international migration, inviting policy makers and experts in this field to reflect on the complexity of the relationship between AI and migrants, in order to develop an open, secure, ethical and shared data system as soon as possible. Furthermore, a new concept, called {\^a}{\texteuro}\~{}Migration Intelligence{\^a}{\texteuro}{\texttrademark} will be introduced, and it is understood here as a set of specific activities concerning identity checks, border security and management, and analysis of biometric data on migrants, refugees and asylum seekers.

}, doi = {https://doi.org/10.6025/jdim/2021/19/2/59-64}, url = {http://www.dline.info/download.php?sn=3260}, author = {Giacomo Buoncompagni} } @article {766, title = {Retrieving and Processing Images from the Pages of a Historical Newspaper and Modeling the Text Topics-}, journal = {Journal of Digital Information Management}, volume = {19}, year = {2021}, month = {06/2021}, pages = {41-46}, type = {Research}, chapter = {41}, abstract = {

Historical newspapers are a source of research for the human and social sciences. However, these image collections are difficult to read by machine due to the low quality of the print, the lack of standardization of the pages in addition to the low quality photograph of some files. This paper presents the processing model of a topic navigation system in historical newspaper page images. The general procedure consists of four modules which are: segmentation of text sub-images and text extraction, preprocessing and representation, induced topic extraction and representation, and document viewing and retrieval interface. The algorithmic and technological approaches of each module are described and the initial test results about a collection covering a range of 28 years are presented.

}, doi = {https://doi.org/10.6025/jdim/2021/19/2/41-46}, url = {http://www.dline.info/download.php?sn=3258}, author = {Gild{\'a}cio J. de A. S{\'a} and Jos{\'e} E. B. Maia} } @article {770, title = {TSV2RDF: Generating RDF Data Model from TSV File Format using Semantic Web Technologies-}, journal = {Journal of Digital Information Management}, volume = {19}, year = {2021}, month = {03/2021}, pages = {10-26}, type = {Research}, chapter = {10}, doi = {https://doi.org/110.6025/jdim/2021/19/1/10-26}, url = {http://www.dline.info/download.php?sn=3172}, author = {Mammadov Hasan and Yan Li and Muhammad Waqas Ahmad} } @article {785, title = { Automatic Marching Cubes for Improving 3D Medical Images Reconstruction-}, journal = {Journal of Digital Information Management}, volume = {18}, year = {2020}, month = {02/2020}, pages = {1-10}, type = {Research}, chapter = {1}, abstract = {

The Marching Cubes algorithm is based on the estimate of the isovalue in order to determine all the pixels that are belonging to the volume to be reconstructed. This estimation is done by the user in an interactive and way without any orientation; this is no longer an intuitive process. Solutions are proposed to detect more than one isovalue and have been used to display multiple isosurfaces and not to adjust or automatically determine isovalue. Other solutions propose to explore histogram to estimate isovalue automatically; those remain insufficient because they still require user intervention. The proposed method acts directly in the isovalue estimation phase. In fact, we propose to make this estimate by using automatic methods of sampling, which have shown their performance in estimating a threshold in several works. This paper proposes to make the use of existing automated isovalue selection methods that take into account histogram and the dynamics of the image. The automatic Marching Cubes algorithm reduces user interaction and makes the selection process more intuitive. The obtained results will show that this adaptation minimizes the computing time and that the obtained volumes are of better quality than those obtained by the classical Marching Cubes algorithm.

}, doi = {https://doi.org/10.6025/jdim/2020/18/1/1-10}, url = {http://dline.info/fpaper/jdim/v18i1/jdimv18i1_1.pdf}, author = {Farah Fekraoui and Mohamed Chaouki Babahenini} } @article {783, title = {Is the Binary Search Faster when Two Variables are Added in the Middle of the Data?-}, journal = {Journal of Digital Information Management}, volume = {18}, year = {2020}, month = {04/2020}, pages = {57-64}, type = {Research}, chapter = {57}, abstract = {

\ Modern architecture has developed new algorithms for large and distributed data, In this digital era, algorithms which intended to quickly process, search, and sort data are very much needed by IT developers. This research will discuss the modification of Binary Search Algorithm, which is previously known for its existing low, mid, and high variables. This research will discuss how we can modify the binary search algorithm by adding two variables- the variable mid-low and mid-high. It will show how by adding two variables between the mid variable could improve the performance of the Binary Search Algorithm.

}, doi = {https://doi.org/10.6025/jdim/2020/18/2/57-64}, url = {http://dline.info/fpaper/jdim/v18i2/jdimv18i2_2.pdf}, author = {Djasen Tjendry and Wirawan Istiono} } @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 {772, title = {Data Mining Applications for Banks{\textquoteright} Business Intelligence Maturity-}, journal = {Journal of Digital Information Management}, volume = {18}, year = {2020}, month = {10/2020,12/2020}, pages = {153-172}, type = {Research}, chapter = {153}, abstract = {

There are many researches that applied data mining in banking. However, one may be countered the lack of suitable data as a serious obstacle to employ data mining techniques for the banks. This paper examines previous data mining researches carried out for banking, integrates them, extracts all served entities and attributes which are needed for analytical purposes, categorizes them and ultimately presents a suitable data model for analytical purpose. After analysis of a wide range of data mining application in banking, 28 entities with 423 attributes were identified in conclusion and the final proposed entity-relationship diagram was created. Also a checklist was provided based on the model for auditing data gap in banks and applied in a real case. The results of this paper can be regarded as a supportive tool for increasing banks{\^a}{\texteuro}{\texttrademark} business intelligence maturity from the data perspective and enable managers in requirement analysis of information systems.

}, doi = {https://doi.org/10.6025/jdim/2020/18/5-6/163-172}, url = {http://www.dline.info/download.php?sn=3103}, author = {Mina Ranjbarfard and Shahideh Ahmadi} } @article {773, title = { Formation Mechanism of Knowledge Stickiness in the Collaborative Innovation of Industry{\textendash}University{\textendash}Research-}, journal = {Journal of Digital Information Management}, volume = {18}, year = {2020}, month = {10/2020,12/2020}, pages = {173-183}, type = {Research}, chapter = {173}, abstract = {

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

}, doi = {https://doi.org/10.6025/jdim/2020/18/5-6/173-183}, url = {http://www.dline.info/download.php?sn=3104}, author = {Zhang Feng, and Liu Guoxin} } @article {780, title = {A Graph-Based Approach for Aspect Extraction from Online Customer Reviews-}, journal = {Journal of Digital Information Management}, volume = {18}, year = {2020}, month = {06/2022}, pages = {99-108}, type = {Research}, chapter = {99}, abstract = {

\ E-commerce websites have become main market players in the 21st century due to advancement in the internet technology. Apart from buying products online, customers are also providing reviews on the products purchased by them. These reviews help new customers to buy various products according to their needs, liking, and preferences. However, millions of reviews are added by the customer on a daily basis. To extract meaningful information manually from these huge amounts of reviews is a tough task. So, it is required to develop an automatic analytics tool for the review sentences. Aspect extraction is one of the vital tasks in the process of meaningful information extraction from the products having various entities. In this work, a novel product aspect extraction approach has been proposed which utilize a graphbased technique with the integration of statistical and semantic information. The analysis of experimental results shows that the proposed approach is efficient and effective in comparison to the state of art methods.

}, doi = {https://doi.org/10.6025/jdim/2020/18/3/99-108}, url = {http://dline.info/fpaper/jdim/v18i3/jdimv18i3_2.pdf}, author = {Rakesh Kumar and Aditi Sharan} } @article {788, title = {Improved Face and Facial Expression Recognition Based on a Novel Local Gradient Neighborhood-}, journal = {Journal of Digital Information Management}, volume = {18}, year = {2020}, month = {02/2020}, pages = {33-42}, type = {Research}, chapter = {33}, abstract = {

Computing efficiency is a key in biometric identification systems for automatic facial expression recognition. It was integrated within advanced pattern recognition as an excellent paradigm while users shifted towards underlying patterns. Most existing face recognition models suffer from a low recognition rate and significant execution time. To overcome these drawbacks, we propose a new Local Gradient Neighborhood (LGN) descriptor for effective face and facial expression recognition. Firstly, the LGN components obtained by applying LGN for each block of the face image which is represented by 9-size vector. Secondly, the system concatenates features vectors of different blocks to obtain the final feature vector for the face image. Finally, it applies SVM and KNN techniques to classify the input images. Unlike other similar works, the new proposed descriptor is evaluated on two benchmarks, for face recognition and facial expression recognition respectively. The experimental results show an excellent recognition rate and fast execution time. The recognition rate for the ORL face database is 98.50\% and the recognition rate for the JAFEE database is 84.28\%.

}, doi = {https://doi.org/10.6025/jdim/2020/18/1/33-42}, url = {http://dline.info/fpaper/jdim/v18i1/jdimv18i1_4.pdf}, author = {Farid AYECHE and Adel ALTI and Abdallah BOUKERRAM} } @article {774, title = {Incentive Mechanism of Innovation Failure Knowledge Sharing of Virtual Research Organization-}, journal = {Journal of Digital Information Management}, volume = {18}, year = {2020}, month = {10/2020,12/2020}, pages = {194}, type = {Research}, chapter = {184}, abstract = {

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

}, doi = {https://doi.org/10.6025/jdim/2020/18/5-6/184-194}, url = {http://www.dline.info/download.php?sn=3105}, author = {Xiong Zhuang and Wang Pengju} } @article {779, title = {Knowledge-Intensive Decision Support System for Manufacturing Equipment Maintenance}, journal = {Journal of Digital Information Management}, volume = {18}, year = {2020}, month = {06/2020}, pages = {85-98}, type = {Research}, chapter = {85}, abstract = {

To ensure continuous production in industrial plants, the high valued manufacturing eqipments should be kept in good working conditions. This brings plants to search for means to control and reduce equipment failures. When faults emerge in plants, appropriate actions for fault diagnosis and reparation must be executed promptly and effectively to prevent large costs due to breakdowns. To provide reliable and effective maintenance support, the aid of advanced decision support technology utilizing previous repair experience is of crucial importance for the expert operators as it provides them valuable troubleshooting clues for new faults. Artificial intelligence (AI) technology, particularly, knowledge-based approach is promising for this domain. It captures efficiency of problem solving expertise from the domain experts; guides the expert operators in rapid fault detection and maintenance. This paper focuses on the design and development of a Knowledge-Intensive Decision Support System (KI-DSS) for Manufacturing Equipment Maintenance in industrial plants to support better maintenance decision and improve maintenance efficiency. With integration of case based Reasoning and ontology, the Ki-DSS not only carries out data matching retrieval, but also performs semantic associated data access which is important for intelligent knowledge retrieval in decision support system. A case is executed to illustrate the use of the proposed KI-DSS to show the feasibility of our approach and the benefit of the ontology support.

}, doi = {https://doi.org/10.6025/jdim/2020/18/3/85-98}, url = {http://dline.info/fpaper/jdim/v18i3/jdimv18i3_1.pdf}, author = {Djamila Bouhalouan and Bakhta Nachet and Abdelkader Adla} } @article {777, title = {LCHREP: Layer and Cluster based Hierarchical Routing and Energy Optimization Protocol in Wireless Sensor Networks-}, journal = {Journal of Digital Information Management}, volume = {18}, year = {2020}, month = {08/2020}, pages = {139-150}, type = {Research}, chapter = {139}, abstract = {

\ In this work, we propose a new hierarchical routing protocol called LCHREP (Layer and Cluster based Hierarchical Routing and Energy Optimization Protocol) that aims to minimizing energy consumption for wireless sensors network. LCHREP uses clusters formed on a layers and also uses multihop between these different layers. Results of simulations indicate that the proposed protocol allows better remaining energy after clusters heads selection, less amount of energy consumed in terms of sending packets. It allows also to reduce the number of nodes failed, and therefore to keep more nodes alive after sending packets.

}, doi = {https://doi.org/10.6025/jdim/2020/18/4/139-150}, url = {http://dline.info/fpaper/jdim/v18i4/jdimv18i4_2.pdf}, author = {Akli ABBAS and Mourad Amad and Fatma AMOKRANE} } @article {775, title = {A New Approach Based Symbiotic Organism Search using Data Mining for Medical Decision-}, journal = {Journal of Digital Information Management}, volume = {18}, year = {2020}, month = {10/2020,12/2020}, pages = {195-209}, type = {Research}, chapter = {195}, abstract = {

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

}, doi = {https://doi.org/10.6025/jdim/2020/18/5-6/195-209}, url = {http://www.dline.info/download.php?sn=3104}, author = {Samia Nouredine and Abida Toumi and Baarir Zineeddine} } @article {786, title = { New Measures of Journal Impact Based on the Number of Citations and PageRank-}, journal = {Journal of Digital Information Management}, volume = {18}, year = {2020}, month = {02/2020}, pages = {11-20}, type = {Research}, chapter = {11}, abstract = {

The number of citations has been used for measuring the significance of a paper. Moreover, we have the following question: which paper is the most important if there are some papers with the same number of citations? Some measures have been introduced to answer this question: one of them is PageRank. We use the Science Citation Index Expanded from 1981 to 2015 to calculate the number of citations and the Google number in the citation network consisting of 34,666,719 papers and 591,321,826 citations. We clarify the positive linear relationship between the number of citations and the Google number, as well as extract some outliers from this positive linear relationship. These outliers are considered to be extremely prestige papers. Furthermore, we calculate the mean values of the number of citations and the Google number for all journals, construct a new measure of journal influence, and extract extremely prestige journals. This new measure has a positive and medium correlation with the impact factor, Eigenfactor score, and SCImago Journal Rank.

}, doi = {https://doi.org/10.6025/jdim/2020/18/1/11-20}, url = {http://dline.info/fpaper/jdim/v18i1/jdimv18i1_2.pdf}, author = {Wataru Souma and Irena Vodenska and Lou Chitkushev} } @article {778, title = {A Novel Algorithm for Generating pseudo Random Number-}, journal = {Journal of Digital Information Management}, volume = {18}, year = {2020}, month = {08/2020}, pages = {151-156}, type = {Research}, chapter = {151}, abstract = {

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

}, doi = {https://doi.org/10.6025/jdim/2020/18/4/151-156}, url = {http://dline.info/fpaper/jdim/v18i4/jdimv18i4_3.pdf}, author = {Gangyi Hu and Weili Kou and Sumeth Yuenyong and Jian Qu} } @article {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 {784, title = { Real Estate Loan Knowledge-Based Recommender System-}, journal = {Journal of Digital Information Management}, volume = {18}, year = {2020}, month = {04/2020}, pages = {65-77}, type = {Research}, chapter = {65}, abstract = {

\ In decision making, the decision-makers frequently employ and perform routine tasks. These processes normally are time-intensive, complex, and in most cases occur regularly. To address this challenge decision makers reuse the already successful decisions. During difficult times, such actions may lead to save time, energy and man-hours, and also result in effective decision making. Memory building depends on how we successfully store earlier knowledge. We through this work introduce a recommender system which is names as BLKBRS which utilized the earlier successful models. In this work we use a case of bank loan and experimented using a semi-structured multiple attribute recommendation environment, and equate the RL-KBRS with a conventional case based reasoning system. RL-KBRS will compensate for lack of experience of young bank consultants, which permits the spread of knowledge distribution to other banks.

}, doi = {https://doi.org/10.6025/jdim/2020/18/2/65-77}, url = {http://dline.info/fpaper/jdim/v18i2/jdimv18i2_3.pdf}, author = {Abdelkader Adla} } @article {776, title = {Reviewing the Concept of Enterprise Content Management (ECM)-}, journal = {Journal of Digital Information Management}, volume = {18}, year = {2020}, month = {08/2020}, pages = {125-138}, type = {Research}, chapter = {125}, abstract = {

Content is simply information that is put to use through the process of repackaging and is then published for a specific purpose (i.e. text, image, 3D data, video, etc.). Organisations deal with various information assets, also known as {\^a}{\texteuro}\~{}content{\^a}{\texteuro}{\texttrademark}, to run their business operations and make important decisions. Managing content is always a challenge for an organisation. More content, particularly in digital form, that goes beyond the control of organisations is being produced. Enterprise Content Management (ECM) was initiated to help organisations manage their information assets. Over a period of 25 years, ECM has intermittently been the focus of attention due to difficulties in setting a solid research framework and the vagueness of the term ECM. Therefore, this research aims to provide a comprehensive analysis of the ECM literature to identify the current state of knowledge and future research directions. An ECM research framework is proposed to guide the literature review analysis. Based on the analysis, several important observations are highlighted and practical implications for further research are proposed.

}, doi = {https://doi.org/10.6025/jdim/2020/18/4/125-138}, url = {http://dline.info/fpaper/jdim/v18i4/jdimv18i4_1.pdf}, author = {Mohamad Rahimi Mohamad Rosman} } @article {787, title = {Rumor Retransmission on Twitter: Message Characteristics, user Characteristics and 21 Retransmission Outcomes-}, journal = {Journal of Digital Information Management}, volume = {18}, year = {2020}, month = {02/2020}, pages = {21-32}, type = {Research}, chapter = {21}, abstract = {

This paper seeks to depict online rumor retransmission using three main constructs, namely, message characteristics, user characteristics and retransmission outcomes. In particular, it teases retransmission outcomes into volume, immediacy and lifespan of rumor tweets. The dataset was drawn from 322 original Twitter messages which generated some 5,700 retweets about the rumored death of Lee Kuan Yew (LKY). Content analysis and statistical tests were conducted. The results confirm the robustness of the research model. Specifically, rumor message characteristics affect retransmission in terms of volume, immediacy and lifespan. Additionally, user characteristics are positively related to volume and immediacy. Finally, user characteristics have a moderating effect on the relationships between rumor message characteristics and retransmission outcomes. This paper illustrates the applicability of the information diffusion model on online rumor retransmission which hitherto has yet to be attempted. Moreover, it granularizes the concept of online rumor retransmission into three important outcomes, namely, volume, immediacy and lifespan. On the practical front, this paper has implications for organizations seeking to combat rumors.

}, doi = {https://doi.org/10.6025/jdim/2020/18/1/21-32}, url = {http://dline.info/fpaper/jdim/v18i1/jdimv18i1_3.pdf}, author = {Alton Chua and Xiaoyu Chen} } @article {781, title = {A Study of Data Requirements for Data Mining Applications in Banking-}, journal = {Journal of Digital Information Management}, volume = {18}, year = {2020}, month = {06/2022}, pages = {109-117}, type = {Research}, chapter = {109}, abstract = {

There are many studies that have applied data mining to banking. However, the lack of proper data mounts a serious obstacle to the employment of data mining techniques by banks. This paper examines previous data mining research in the field of banking to extract all served entities and attributes required for analytical purposes, categorize these attributes and ultimately present a data model for analysis. After analyzing a wide range of data mining applications in banking, 28 entities with 423 attributes were identified and the final proposed entity-relationship model was drawn. Also, a checklist was provided based on the model for auditing data gap in banks and applied to a real case. The results of this paper can be seen as a supportive tool for improving bank{\^a}{\texteuro}\~{}s business intelligence maturity from the data perspective and enabling managers for analyzing data requirement of information systems.

}, doi = {https://doi.org/10.6025/jdim/2020/18/3/109-117}, url = {http://dline.info/fpaper/jdim/v18i3/jdimv18i3_3.pdf}, author = {Mina Ranjbarfard and Shahideh Ahmadi} } @article {793, title = {An Agent-Based Approach for Extracting Business Association Rules from Centralized Databases Systems-}, journal = {Journal of Digital Information Management}, volume = {17}, year = {2019}, month = {10/2019}, pages = {270-288}, type = {Research}, chapter = {270}, abstract = {

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

}, doi = {https://doi.org/10.6025/jdim/2019/17/5/270-288}, url = {http://dline.info/fpaper/jdim/v17i5/jdimv17i5_2.pdf}, author = {Nadjib Mesbahi and Merouane Zoubeidi and Abdelhak Merizig and Okba Kazar} } @article {807, title = {A CBR Decision Support System for Loan Evaluation-}, journal = {Journal of Digital Information Management}, volume = {17}, year = {2019}, month = {04/2019}, pages = {75-86}, type = {Research}, chapter = {75}, abstract = {

Group decision making is time-consuming, complex, critical and recurring in nature. In group decision making, the decision-makers often perform periodic and repetitive activities. This prompts the decision makers to store their knowledge and their experience invoked in prior problem solving sessions. The development of this group knowledge clearly assists in similar later decision-making activities and reduces the time required to come to a decision, particularly, in a critical situation. This shared knowledge constitutes the group memory. In this paper, we develop a Case-Based Reasoning Decision Support System called CBR-DSS that makes use of the rules, policies and standard procedures of prior groups embedded in the group memory. The CBR process is evolved by using the Analytic Hierarchy Process (AHP). In an effort to enhance utility and show the feasibility, we experiment our approach in a bank loan analysis domain, a semi-structured multiple attributes decision-making environment, and compare CBR-DSS with a conventional case based reasoning system. CBR-DSS will compensate for lack of experience of young bank consultants, and allow disseminating and distributing available experience to different bank sites.

}, doi = {https://doi.org/10.6025/jdim/2019/17/2/75-86}, url = {http://dline.info/fpaper/jdim/v17i2/jdimv17i2_3.pdf}, author = {Abdelkader Adla and Noureddine Benmessaoud} } @article {712, title = {A CBR Decision Support System for Loan Evaluation}, journal = {Journal of Digital Information Management}, volume = {17}, year = {2019}, month = {04/2019}, pages = {75-86}, type = {Research}, chapter = {75}, abstract = {

Group decision making is time-consuming, complex, critical and recurring in nature. In group decision making, the decision-makers often perform periodic and repetitive activities. This prompts the decision makers to store their knowledge and their experience invoked in prior problem solving sessions. The development of this group knowledge clearly assists in similar later decision-making activities and reduces the time required to come to a decision, particularly, in a critical situation. This shared knowledge constitutes the group memory. In this paper, we develop a Case-Based Reasoning Decision Support System called CBR-DSS that makes use of the rules, policies and standard procedures of prior groups embedded in the group memory. The CBR process is evolved by using the Analytic Hierarchy Process (AHP). In an effort to enhance utility and show the feasibility, we experiment our approach in a bank loan analysis domain, a semi-structured multiple attributes decision-making environment, and compare CBR-DSS with a conventional case based reasoning system. CBR-DSS will compensate for lack of experience of young bank consultants, and allow disseminating and distributing available experience to different bank sites.

}, keywords = {Case-based Reasoning, Group Decision Making, Group Memory, Information retrieval, Recommender system}, url = {https://doi.org/10.6025/jdim/2019/17/2/75-86}, author = {Abdelkader Adla and Noureddine Benmessaoud} } @article {716, title = {Computer and Network Security: Ontological and Multi-agent System for Intrusion Detection}, journal = {Journal of Digital Information Management}, volume = {17}, year = {2019}, month = {06/2019}, pages = {133-144}, type = {Research}, chapter = {133}, doi = {https://doi.org/10.6025/jdim/2019/17/3/133-144}, url = {http://dline.info/fpaper/jdim/v17i3/jdimv17i3_3.pdf}, author = {Samir Bourekkache and Okba Kazar and Ahmed Aloui} } @article {801, title = {Computer and Network Security: Ontological and Multi-agent System for Intrusion Detection-}, journal = {Journal of Digital Information Management}, volume = {17}, year = {2019}, month = {06/2019}, pages = {133-144}, type = {Research}, chapter = {133}, abstract = {

Today the security aspect is a backbone of every computer system, particularly when this system contains sensitive information. When we use our computers and connect to the network or use web services, we trust that our personal and sensitive information (images, passwords, credit card number {\textellipsis}etc) are confidential and well secured by the used security system. Unfortunately, the hackers may succeed to gain access to the system and misuse our information. Generally, the aim of the intrusion is to find new ways to annoy, steal and harm parts of computer systems. Moreover, with the possibility of connecting several computers and networks, the necessity of protecting the whole data and machines from attackers (hackers) that try to get some confident information to use for their own benefit or just destroy or modify valuable information was born. At this point IDS appears to help users, companies or institutions to detect when they are getting compromised. In this paper, we develop an intrusion detection system using multi agent system, ontological techniques (IDSMAO) and misuse method.

}, doi = {https://doi.org/10.6025/jdim/2019/17/3/133-144}, url = {http://dline.info/fpaper/jdim/v17i3/jdimv17i3_3.pdf}, author = {Samir Bourekkache and Okba Kazar and Ahmed Aloui} } @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 {710, title = {Crawling the Dark Web: A Conceptual Perspective, Challenges and Implementation}, journal = {Journal of Digital Information Management}, volume = {17}, year = {2019}, month = {04/2019}, pages = {51-60}, type = {Research}, chapter = {51}, doi = {https://doi.org/10.6025/jdim/2019/17/2/51-60}, url = {http://dline.info/fpaper/jdim/v17i2/jdimv17i2_1.pdf}, author = {Bassel Alkhatib and Randa Basheer} } @article {805, title = {Crawling the Dark Web: A Conceptual Perspective, Challenges and Implementation{\textendash}}, journal = {Journal of Digital Information Management}, volume = {17}, year = {2019}, month = {04/2019}, pages = {51-60}, type = {Research}, chapter = {51}, abstract = {

\ Internet and network technologies have evolved dramatically in the last two decades, with rising users{\textquoteright} demands to preserve their identities and privacy. Researchers have developed approaches to achieve users{\textquoteright} demands, where the biggest part of the internet has formed, the Deep Web. However, as the Deep Web provides the resort for many benign users who desire to preserve their privacy, it also became the perfect floor for hosting illicit activities, which generated the Dark Web. This leads to the necessity of finding automated solutions to support law and security agencies in collecting information from the Dark Web to disclose such activities. In this paper, we illustrate the concepts needed for the development of a crawler that collects information from a dark website. We start from discussing the three layers of the Internet, the characteristics of the hidden and private networks, and the technical features of Tor network. We also addressed the challenges facing the dark web crawler. Finally, we presented our experimental system that fetches data from a dark market. This approach helps in putting a single dark website under investigation, and can be a seed for future research and development.

}, doi = {https://doi.org/10.6025/jdim/2019/17/2/51-60}, url = {http://dline.info/fpaper/jdim/v17i2/jdimv17i2_1.pdf}, author = {Bassel Alkhatib and Randa Basheer} } @article {718, title = {Developing a Framework for Testing Android Applications based on Reverse Engineering Techniques-}, journal = {Journal of Digital Information Management }, volume = {17}, year = {2019}, month = {08/2019}, pages = {189-200}, chapter = {189}, doi = {https://doi.org/10.6025/jdim/2019/17/4/189-200}, author = {Noor Jamal Alkhateeb and Mohammad Saeed AbouTrab} } @article {796, title = {Developing a Framework for Testing Android Applications based on Reverse Engineering Techniques-}, journal = {Journal of Digital Information Management}, volume = {17}, year = {2019}, month = {08/2019}, pages = {189-200}, type = {Research}, chapter = {189}, abstract = {

\ It has been recognized that mobile platforms continue to prevail in all aspects of human activity. However, mobile applications might suffer from improper behavior just like other software types. Consequently, there is a growing need for testing mobile applications thoroughly. Model-based testing is one of the popular testing approaches, which depends on having a functional model of system specification to generate and evaluate test cases. In most cases, the specification model is not available, suffers from an unsatisfactory quality, or does not represent all business rules and functional requirements. That would lead to increase in the difficulties in testing, modifying and maintaining mobile applications. Reverse engineering can be used to reveal application{\textquoteright}s designs, architecture and knowledge and extract models to represent them.

}, doi = {https://doi.org/10.6025/jdim/2019/17/4/189-200}, url = {http://dline.info/fpaper/jdim/v17i4/jdimv17i4_1.pdf}, author = {Noor Jamal Alkhateeb and Mohammad Saeed AbouTrab} } @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 {791, title = {Fault Prediction in Fuzzy Discrete Event Systems: A Diagnoser Approach-}, journal = {Journal of Digital Information Management}, volume = {17}, year = {2019}, month = {12/2019}, pages = {337-345}, type = {Research}, chapter = {337}, abstract = {

\ In this workm we study the fault prediction in fuzzy discrete event systems. Fuzzy discrete event systems are proposed to deal with vagueness, impreciseness, and subjectivity in real-world problems. The verification is divided into two steps. In the first step, we give a method to construct a Diagnoser. And in the second step, based on the structure of diagnoser we give the necessary and sufficient conditions to verify the future occurrence of the fault. The newly proposed approach allows us to deal with the problem of fault prediction for both crisp DESs and FDESs. Finally, an example is provided to illustrate the efficiency of the proposed approach.

}, doi = {https://doi.org/10.6025/jdim/2019/17/6/337-345}, url = {http://dline.info/fpaper/jdim/v17i6/jdimv17i6_3.pdf}, author = {Bilal Benmessahel and Farid Nouioua and Mohamed Touahria and Abderrahim Chariete} } @article {810, title = {Hybrid Force-Based Model to Simulate Behavior of Human Crowd in Panic Situations-}, journal = {Journal of Digital Information Management}, volume = {17}, year = {2019}, month = {02/2019}, pages = {25-33}, type = {Research}, chapter = {25}, abstract = {

\ Modelling human behavior is important as it helps preparing for the situation of emergency to save lives. In this paper we present new methods to simulate crowd evacuation phenomena by using a physical model. We focus on applying more effective forces focusing on Spring-Force as general forces affecting agents as well as repulsive danger-force, in addition, we propose a new algorithm for an interaction behavior. We implement our algorithm in a real-world application which shows that our model provides results approaching reality and is promising compared to the other models.

}, doi = {https://doi.org/10.6025/jdim/2019/17/1/25-33}, url = {http://dline.info/fpaper/jdim/v17i1/jdimv17i1_3.pdf}, author = {Ammar Alnahhas and ElisaarBarri} } @article {707, title = {Hybrid Force-Based Model to Simulate Behavior of Human Crowd in Panic Situations}, journal = {Journal of Digital Information Management}, volume = {19}, year = {2019}, month = {02/2019}, type = {Research}, chapter = {25-33}, doi = {https://doi.org/10.6025/jdim/2019/1/25-33}, author = {Ammar Alnahhas and ElisaarBarri} } @article {713, title = {Hybrid SVR-ACNN Model: Proposed Video Super-Resolution Method for Video Enhancement}, journal = {Journal of Digital Information Management}, volume = {17}, year = {2019}, month = {04/2019}, pages = {87-103}, type = {Research}, chapter = {87}, doi = {https://doi.org/10.6025/jdim/2019/17/2/87-103}, author = {Padma Reddy A. M and Udayarani} } @article {790, title = {Information Security Risk Management of Research Information Systems: A hybrid approach of Fuzzy FMEA, AHP, TOPSIS and Shannon Entropy-}, journal = {Journal of Digital Information Management}, volume = {17}, year = {2019}, month = {12/2019}, pages = {321-336}, type = {Research}, chapter = {321}, abstract = {

The purpose of this paper is to implement information security risk management (ISRM) in research information systems (RIS). Appropriate identification and assessment of risks in different aspects such as software, communications, and human resources for RIS{\textquoteright}s besides providing efficient and effective preventive and corrective actions are other aims of this study. Furthermore, continual improvement of risk response processes in information technology environment is another aim of this study.\  In this study, potential risks of information security are identified using failure mode and effects analysis (FMEA). Also, detected failure modes are evaluated by multi-criteria decision-making method (MCDM) using a hybrid method of fuzzy logic, analytic hierarchy process (AHP), Shannon entropy scoring method, and technique for order preference by similarity to the ideal solution (TOPSIS). The result of this paper shows that information security software potential risks assessment by the proposed model is more accurate and reliable than non-fuzzy models. Unauthorized access to view or change the stored information of the server is the risk with the most important priority identified by MCDM approach. Confidentiality of information is more important than other information security criteria. Furthermore, failure modes in the category of the main server and internet have more priority in comparison to others.

}, doi = {https://doi.org/10.6025/jdim/2019/17/6/321-336}, url = {http://dline.info/fpaper/jdim/v17i6/jdimv17i6_2.pdf}, author = {M. J. Ershadi and Mehrdad Forouzandeh} } @article {806, title = {Introducing a Personal Semantics in the User Profile Modeling for a Personalized Information Retrieval-}, journal = {Journal of Digital Information Management}, volume = {17}, year = {2019}, month = {04/2019}, pages = {61-74}, type = {Research}, chapter = {61}, abstract = {

\ The objective of personalized information retrieval systems is to infer the real user information need hidden behind his query, and then tailor the search results to this need. The user information need may be relative to one of the user{\textquoteright}s multiple search contexts, such as user current location, user social context or an important event that occupies the public opinion of the user community. In this paper we present a new personalized information retrieval approach in which we design and use a user profile. This profile takes into account the different social, situational and temporal contexts of the user previous searches, and we introduced a personal semantics in the representation of these search contexts. The introduced personal semantics is interested by the identification and the valorization of the different cooccurrence relationships between the different relevant components of the user search history. The user profile, boasting its semantic vision, is used to infer the user current information need by the enrichment of the initial user query without going beyond the user current interest.

}, doi = {https://doi.org/10.6025/jdim/2019/17/2/61-74}, url = {http://dline.info/fpaper/jdim/v17i2/jdimv17i2_2.pdf}, author = {Tahar RAFA and Samir KECHID} } @article {711, title = {Introducing a Personal Semantics in the User Profile Modeling for a Personalized Information Retrieval}, journal = {Journal of Digital Information Management}, volume = {17}, year = {2019}, month = {04/2019}, pages = {61-75}, type = {Research}, chapter = {61}, doi = {https://doi.org/10.6025/jdim/2019/17/2/61-74}, author = {Tahar RAFA and Samir KECHID} } @article {798, title = {Investigating the Determinant and Impact of Digital Library Engagement: A Conceptual Framework {\textendash}}, journal = {Journal of Digital Information Management}, volume = {17}, year = {2019}, month = {08/2019}, pages = {214-226}, type = {Research}, chapter = {214}, abstract = {

\ Facing an unprecedented explosion and growth of Information and Communication Technology (ICT) signal the overwhelming dependency on the digital library (DL). Over the years, libraries spent a great amount of investment to subscribe to various digital resources such as online databases, electronic journals, electronic books and other digital resources. However, previous studies reported that the use of DL is underutilized; hence undermining its original purposes and making it harder for the libraries to justify their investment on DL resources. It is reported that users prefer to use free online resources compared to the DL resources. The lack of DL usage is credited to the lack of DL engagement and the impact of contextual factors leading to DL engagement. Yet, not much is known about the contributing factors of DL engagement as well as its impacts. Therefore, the purpose of this paper is twofold: (1) to introduce the concept of Digital Library Engagement, and (2) to discuss at the conceptual level on the determinants and impacts of digital library engagement and development of a conceptual framework. In order to develop the conceptual framework, the study adopted a systematic literature review approach of over 100 papers. Grounded in previous literature on DL, the contributions of this paper are as follows: first, the paper provides insight on the new concept of digital library engagement; second, the paper proposes\ 

}, doi = {https://doi.org/10.6025/jdim/2019/17/4/214-226}, url = {http://dline.info/fpaper/jdim/v17i4/jdimv17i4_3.pdf}, author = {Mohamad Rahimi Mohamad Rosman and Mohd Nasir Ismail and Mohamad Noorman Masrek} } @article {720, title = {Investigating the Determinant and Impact of Digital Library Engagement: A Conceptual Framework}, journal = {Journal of Digital Information Management}, volume = {17}, year = {2019}, month = {08/2019}, pages = {214-226}, chapter = {214}, doi = {https://doi.org/10.6025/jdim/2019/17/4/214-226}, author = {Mohamad Rahimi Mohamad Rosman and Mohd Nasir Ismail and Mohamad Noorman Masrek} } @article {719, title = {A New Design for Smart and Decentralized Approach for Resource Allocation in Cloud Computing using CSP Model}, journal = {Journal of Digital Information Management}, volume = {17}, year = {2019}, month = {08/2019}, pages = {201-213}, chapter = {201}, doi = {https://doi.org/10.6025/jdim/2019/17/4/201-213}, author = {Almutawakel Abdallah and Kazar Okba and Bali Mouadh} } @article {797, title = {A New Design for Smart and Decentralized Approach for Resource Allocation in Cloud Computing using CSP Model-}, journal = {Journal of Digital Information Management}, volume = {17}, year = {2019}, month = {08/2019}, pages = {201-213}, type = {Research}, chapter = {201}, abstract = {

\ Cloud computing is the latest technology in both hardware and software. The cloud computing architecture offers a number of services including the SAAS, PAAS and IAAS. When customers specify their technical and economic needs, cloud computing helps them satisfy their request at the lowest possible cost and the best quality of resources. This paper presents a new approach for resource allocation (RA) in cloud computing. Its architecture is based on multi-agent system (MAS) and distributed constraint satisfaction problems (DCSP) where variables and constraints are distributed among multiple agents. In MAS, each agent makes his choice via a distributed negotiation to satisfy the global objective which is looking for the best solution to the users{\textquoteright} needs. The present work highlights a new approach that is based on hybridizing (DCSP) and (MAS). This decentralized approach is designed to solve a number of problems such as resource allocation and planning cloud-computing systems.

}, doi = {https://doi.org/10.6025/jdim/2019/17/4/201-213}, url = {http://dline.info/fpaper/jdim/v17i4/jdimv17i4_2.pdf}, author = {Almutawakel Abdallah and Kazar Okba and Bali Mouadh} } @article {717, title = {Ontological Approach Based on Multi-Agent System for Indexing and Filtering Arabic Documents}, journal = {Journal of Digital Information Management}, volume = {17}, year = {2019}, month = {06/2019}, pages = {145-163}, type = {Research}, chapter = {145}, doi = {https://doi.org/10.6025/jdim/2019/17/3/145-163}, url = {http://dline.info/fpaper/jdim/v17i3/jdimv17i3_4.pdf}, author = {Samia Zouaoui and Khaled Rezeg} } @article {803, title = {Ontological Approach Based on Multi-Agent System for Indexing and Filtering Arabic Documents-}, journal = {Journal of Digital Information Management}, volume = {17}, year = {2019}, month = {06/2019}, pages = {145-163}, type = {Research}, chapter = {145}, abstract = {

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

}, doi = {https://doi.org/10.6025/jdim/2019/17/3/145-163}, url = {http://dline.info/fpaper/jdim/v17i3/jdimv17i3_4.pdf}, author = {Samia Zouaoui and Khaled Rezeg} } @article {792, title = {Optimization of Topic Recognition Model for News Texts Based on LDA-}, journal = {Journal of Digital Information Management}, volume = {17}, year = {2019}, month = {10/2019}, pages = {257-269}, type = {Research}, chapter = {257}, abstract = {

\ Latent Dirichlet Allocation (LDA) is the technique most commonly used in topic modeling methods, but it requires the number of topics generated by LDA to be specified for topic recognition modeling. Except the main iterative methods based on perplexity and nonparametric methods, recent research has no simple way to select the optimal number of topics in the model. Aiming at appropriately determining the number of topics and then optimizing the LDA topic model, this paper proposes a non-iterative method for automatically determining the number of topics. The clustering method is based on fast seeking and locating density peaks. This method transforms the traditional topic cluster number selection problem into clustering problem and thus can be used to optimize the topic recognition model for news texts. It does not need iterative optimization and can simplify model development. This method uses Word2Vec for word embedding on corpus text to explore the superior performance of word-related relationships and to express the implicit semantic relationship between topic corpora. Then, using a clustering algorithm that quickly searches for and finds the cluster peaks; the word vectors after word embedding are clustered to obtain the number of word vector clusters after word embedding. The number of clusters is used as the number of topics in the text. Finally, the experimental results show that the proposed method enjoys better precision and F1 value than the perplexitybased method, and is suitable for the identification of the number of topics in corpora in different sizes. This method can effectively find the appropriate number of topics from the news text dataset and improve the accuracy of the LDA theme model.

}, doi = {https://doi.org/10.6025/jdim/2019/17/5/257-269}, url = {http://dline.info/fpaper/jdim/v17i5/jdimv17i5_1.pdf}, author = {Hongbin Wang and Jianxiong Wang and Yafei Zhang and Meng Wang and Cunli Mao} } @article {804, title = {Prediction of Reviews Rating: A Survey of Methods, Techniques and Hybrid Architectures-}, journal = {Journal of Digital Information Management}, volume = {17}, year = {2019}, month = {06/2019}, pages = {164-178}, type = {Research}, chapter = {164}, abstract = {

\ In the last recent years, the customer reviews has attracted an increasing interest by researchers and companies thanks to the advancement in E commerce and business applications. The ability to successfully decide whether a review will be helpful to other customers and thus give the product more exposure is vital to companies that support these reviews, companies like Google, Amazon and Yelp! The problem is that some customers are giving rating in conflict with their comments obliging other reviewers to read the comments to understand the reason of this contradiction. Sentiment analysis is the process of automatically identifying opinions expressed in text on certain subjects. The accuracy of sentiment analysis has a direct effect on decision making in both business and government. Also, recommender system is one of the hot topics in the field of big data, especially with the development and growth of the World Wide Web.

}, doi = {https://doi.org/10.6025/jdim/2019/17/3/164-178}, url = {http://dline.info/fpaper/jdim/v17i3/jdimv17i3_5.pdf}, author = {Fouzi Harrag and Abdulmalik Alsalman and Alaa Alqahtani} } @article {794, title = {Subjective Sentiment Analysis for Arabic Newswire Comments-}, journal = {Journal of Digital Information Management}, volume = {17}, year = {2019}, month = {10/2019}, pages = {289-295}, type = {Research}, chapter = {289}, abstract = {

This paper presents an approach based on supervised machine learning methods to discriminate between positive, negative and neutral Arabic reviews in online newswire. The corpus is labeled for subjectivity and sentiment analysis (SSA) at the sentence-level. The model uses both count and TF-IDF representations and apply six machine learning algorithms; Multinomial Na{\"\i}ve Bayes, Support Vector Machines (SVM), Random Forest, Logistic Regression, Multi-layer perceptron and k-nearest neighbors using uni-grams, bi-grams features. With the goal of extracting users{\textquoteright} sentiment from written text. Experimental results showed that n-gram features could substantially improve performance; and showed that the Multinomial Na{\"\i}ve Bayes approach is the most accurate in predicting topic polarity. Best results were achieved using count vectors trained by combination of word-based uni-gramsand bi-grams with an overall accuracy of 85.57\% over two classes and 65.64\% over three classes.

}, doi = {https://doi.org/10.6025/jdim/2019/17/5/289-295}, url = {http://dline.info/fpaper/jdim/v17i5/jdimv17i5_3.pdf}, author = {Sadik Bessou and Rania Aberkane} } @article {721, title = {A Survey on Vehicular Ad-Hoc Networks Routing Protocols: Classification and Challenges}, journal = {Journal of Digital Information Management }, volume = {17}, year = {2019}, month = {08/2019}, pages = {227-244}, chapter = {227}, doi = {https://doi.org/10.6025/jdim/2019/17/4/227-244}, author = {TASSOULT Nadia and MAD Mourad and MOUMEN Hamouma and KALLA Hamoudi} } @article {799, title = {A Survey on Vehicular Ad-Hoc Networks Routing Protocols: Classification and Challenges-}, journal = {Journal of Digital Information Management}, volume = {17}, year = {2019}, month = {08/2019}, pages = {227-244}, type = {Research}, chapter = {227}, abstract = {

The Vehicle ad hoc Networks (VANET) are attracting more and more manufacturers and researchers{\textquoteright} attention. Many challenges must be addressed before VANETs can be successfully deployed. The most challenging issue in VANETs is designing of routing mechanisms and efficient medium access control protocols so that safety related and other application messages can be timely and reliably disseminated through VANETs. The aim of VANET routing protocols is establishing of an efficient route between network nodes that should adapt to the rapid changes in the network topology. However, routing protocols in VANET is a challenging issue, mainly due to the rapidly changing topology of vehicles and frequent fragmentation in the network. In this work, we review the most frequent routing protocols for VANETs and then we provide a taxonomy of these protocols based on the used relay selection technique. We compare and discuss these routing protocols according to different criteria. Moreover, we discuss several issues and prerequisite that should be considered when designing VANETs routing. Finally, we highlight the most important aspects and future directions that could be explored in the design of a new Geocast routing solution for vehicular routing algorithms as a contribution for further work.

}, doi = {https://doi.org/10.6025/jdim/2019/17/4/227-244}, url = {http://dline.info/fpaper/jdim/v17i4/jdimv17i4_4.pdf}, author = {TASSOULT Nadia and AMAD Mourad and MOUMEN Hamouma and KALLA Hamoudi} } @article {802, title = {Temporal Trends Analysis for Dengue Outbreak and Network Threats Severity Prediction Accuracy Improvement-}, journal = {Journal of Digital Information Management}, volume = {17}, year = {2019}, month = {06/2019}, pages = {122-132}, type = {Research}, chapter = {122}, abstract = {

Time series analysis is one of the major techniques in capturing trends and pattern of the occurrence for future forecasting. Existing but scarce works have developed temporal-based techniques which target to either predict movement (increase or decrease) or quantify the possibility of the predicted event to happen. Many of these techniques focus on the values of the time series attribute but there is no available work on dengue or intrusion logs that focus on temporal trend analysis-based on temporal relations mining. In this work the proposed technique utilize the temporal trends analysis of the observational attributes towards the pattern of the target{\textquoteright}s attribute values. In this work, we propose a new temporal trends analysis approach that uses temporal relation mining in forecasting dengue outbreak and cyber intrusion. We leverage the temporal abstractions and temporal logic to define patterns with the goal to optimize prediction accuracy. From the experiment conducted, the results showed that the proposed approach has better prediction as compared to the baseline.

}, doi = {https://doi.org/10.6025/jdim/2019/17/3/122-132}, url = {http://dline.info/fpaper/jdim/v17i3/jdimv17i3_2.pdf}, author = {Nurfadhlina Mohd Sharef and Nor Azura Husin and Khairul Azhar Kasmiran and Mohd Izuan Ninggal} } @article {715, title = {Temporal Trends Analysis for Dengue Outbreak and Network Threats Severity Prediction Accuracy Improvement-}, journal = {Journal of Digital Information Management}, volume = {17}, year = {2019}, month = {06/2019}, pages = {132}, type = {Research}, chapter = {122}, doi = {https://doi.org/10.6025/jdim/2019/17/3/122-132}, url = {http://dline.info/fpaper/jdim/v17i3/jdimv17i3_2.pdf}, author = {Nurfadhlina Mohd Sharef and Nor Azura Husin and Khairul Azhar Kasmiran and Mohd Izuan Ninggal} } @article {706, title = {Viscovery: Trend Tracking in Opinion Forums based on Dynamic Topic Models}, journal = {Journal of Digital Information Management}, volume = {19}, year = {2019}, month = {02/2019}, type = {Research}, chapter = {13-24}, doi = {https://doi.org/10.6025/jdim/2019/1/13-24}, author = {Ignacio Espinoza and Marcelo Mendoza and Pablo Ortega and Daniel Rivera and Fernanda Weiss} } @article {809, title = {Viscovery: Trend Tracking in Opinion Forums based on Dynamic Topic Models-}, journal = {Journal of Digital Information Management}, volume = {17}, year = {2019}, month = {02/2019}, pages = {13-24}, type = {Research}, chapter = {13}, abstract = {

Opinions in forums and social networks are released by millions of people due to the increasing number of users that use Web 2.0 platforms to opine about brands and organizations. For enterprises or government agencies it is almost impossible to track what people say producing a gap between user needs/ expectations and organizations actions.

}, doi = {https://doi.org/10.6025/jdim/2019/17/1/13-24}, url = {http://dline.info/fpaper/jdim/v17i1/jdimv17i1_2.pdf}, author = {Ignacio Espinoza and Marcelo Mendoza, and Pablo Ortega and Daniel Rivera, and Fernanda Weiss} } @article {705, title = {Web Service Selection Approach Based on Agent and Fuzzy Logic}, journal = {Journal of Digital Information Management}, volume = {19}, year = {2019}, month = {02/2019}, type = {Research}, chapter = {1-13}, doi = {https://doi.org/10.6025/jdim/2019/1/1-12}, author = {Houcine Belouaar and Okba Kazar and Nadia Kabachi} } @article {808, title = {Web Service Selection Approach Based on Agent and Fuzzy Logic-}, journal = {Journal of Digital Information Management}, volume = {17}, year = {2019}, month = {02/2019}, pages = {1-12}, type = {Research}, chapter = {1}, abstract = {

The context of this work is the selection of the services among a list of similar services. To differentiate between similar web services, the best approach to use is the one based on service quality (QoS) criteria. However, these criteria most of the time are imprecise and sometimes uncertain and ambiguous because they are based on discrete numerical data. In some situation, we need to apply the concept of partial truth, where the partial truth values are between two numerical values. The fuzzy logic can be applied to support the representation of imprecise, uncertain and ambiguous representation. It is based on the observation that people make decisions based on imprecise and nonnumerical information. In this work, we propose an approach for selecting web services based on the fuzzy logic. Indeed, we use fuzzy logic by translating the QoS values that are attributed to services into linguistic terms. In addition, we also allow the service client to formulate its requests in the form of linguistic terms. In this process, the system selects and render the desired web service to the client. Our solution is represented as three layers, i) User Layer, that receives functional or fuzzy requests from clients which treats and forward them to the next layer, ii) Basic Layer that implements the service-oriented architecture and also, obtains the QoS values from service repository; and iii) Fuzzy Layer that takes as input the quality criteria of each web service then proceeds to their fuzzification, ranking and finally assign the scores to the different web services. To validate our solution, we implemented it as a multi-agent system.

}, doi = {https://doi.org/10.6025/jdim/2019/17/1/1-12}, url = {http://dline.info/fpaper/jdim/v17i1/jdimv17i1_1.pdf}, author = {Houcine Belouaar and Okba Kazar and Nadia Kabachi} } @article {708, title = {Website Localisation in the Corporate Context: A Spanish Perspective}, journal = {Journal of Digital Information Management}, volume = {19}, year = {2019}, month = {02/2019}, type = {Research}, chapter = {34-43}, doi = {https://doi.org/10.6025/jdim/2019/1/34-43}, author = {Mar{\'\i}a Dolores Olvera-Lobo and Celia Castillo-Rodr{\'\i}guez} } @article {811, title = {Website Localisation in the Corporate Context: A Spanish Perspective-}, journal = {Journal of Digital Information Management}, volume = {17}, year = {2019}, month = {02/2019}, pages = {34-43}, type = {Research}, chapter = {34}, abstract = {

\ Diverse factors such as the development of globalisation processes and an ever-changing economic environment are encouraging companies to access external markets. Localisation, the activity that makes a certain product {\textendash}for example, a websitelinguistically and culturally appropriate for a particular country and language, is an extremely valuable tool for companies who want to pursue internationalisation strategies. In Spain, small and medium enterprises (SMEs) make up over 99\% of the country{\textquoteright}s business structure. However, the localisation of their websites is often deficient. An analysis of 70 Spanish SME corporate websites was performed with the purpose of assessing the degree and characteristics of website localisation in the SME sector in Spain. It was found out that the web presence of Spanish SMEs presents serious deficiencies and that the contents offered on their websites are often poorly localised, if at all. The information gathered enabled us to put forward a series of practical recommendations for SME corporate website localisation.

}, doi = {https://doi.org/10.6025/jdim/2019/17/1/34-43}, url = {http://dline.info/fpaper/jdim/v17i1/jdimv17i1_4.pdf}, author = {Mar{\'\i}a Dolores Olvera-Lobo and Celia Castillo-Rodr{\'\i}guez} } @article {673, title = {Anomaly Based Worm Detection Using Deterministic Finite Automata and Efficient Keygraph Technique}, journal = {Journal of Data Processing}, volume = {8}, year = {2018}, month = {06/2018}, pages = {63-73}, type = {Research}, author = {Leelavathi. B and Rajesh Babu. M} } @article {622, title = {Application of the Fiber Image Detection Algorithm Based on the Grey System Theory and Directed Graph}, journal = {Journal of Multimedia Processing and Technologies}, volume = {9}, year = {2018}, pages = {8-15}, author = {Xiaodong Wang and Jianhui Yang} } @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 {835, title = {Assimilation of Business Intelligence (BI) and Big Data Analytics (BDA) Towards Establishing Organizational Strategic Performance Management Diagnostics Framework: A Case Study-}, journal = {Journal of Digital Information Management}, volume = {16}, year = {2018}, month = {02/2018}, pages = {22-32}, type = {Research}, chapter = {22}, abstract = {

\ In this research paper, we had observed and proposed the characteristic of Big Data Analytics (BDA) and Business Intelligence (BI) in observing the voluminous picture of organizational strategic performance management diagnostics framework. In our study, we are interested in handling BDA and BI as a dynamic research that had enabled organizations to invade and generate greater knowledge formation and decision-making. Our research goal is to advance a real world understanding of emerging knowledge derived from organizing big data scenarios and BI framework development. In order, to overcome the ambiguity scenarios of BDA, we propose a framework that involve the present BDA and BI stages with their analytic features in designing the organizational strategic performance management framework. The outcome will be a design of a typical strategic performance management application {\textendash} the organizational strategic diagnostic dashboard.

}, doi = {http://dline.info/fpaper/jdim/v16i1/jdimv16i1_3.pdf}, author = {Mailasan Jayakrishnan and Abdul Karim Mohamad, and Mokhtar Mohd Yusof} } @article {616, title = {Assimilation of Business Intelligence (BI) and Big Data Analytics (BDA) Towards Establishing Organizational Strategic Performance Management Diagnostics Framework: A Case Study}, journal = {Journal of Digital Information Management}, volume = {16}, year = {2018}, month = {02/2018}, pages = {32}, type = {Research}, chapter = {22}, url = {http://dline.info/fpaper/jdim/v16i1/jdimv16i1_3.pdf}, author = {Mailasan Jayakrishnan and Abdul Karim Mohamad and Mokhtar Mohd Yusof} } @article {695, title = {Automatic Verification of Communicative Commitments using Reduction}, journal = {Journal of Intelligent Computing}, volume = {9}, year = {2018}, month = {09/2018}, pages = {114-128}, type = {Research}, author = {Mofleh Al-diabat and Faisal Al-saqqar and Ashraf Al-saqqar} } @article {638, title = {BIG DATA: Balancing between Risks and opportunities {\textendash} UAE Perspective}, journal = {Progress in Machines and Systems}, volume = {7}, year = {2018}, pages = {37-44}, type = {Research}, author = {Firas Habbal} } @article {676, title = {Building a Herbal Medicine Ontology Aligned with Symptoms and Diseases Ontologies}, journal = {Journal of Digital Information Management}, volume = {16}, year = {2018}, month = {06/2018}, pages = {114-126}, type = {Research}, author = {Bassel Alkhatib and Dania Briman} } @article {826, title = {Building a Herbal Medicine Ontology Aligned with Symptoms and Diseases Ontologies {\textendash}}, journal = {Journal of Digital Information Management}, volume = {16}, year = {2018}, month = {06/2018}, pages = {114-126}, type = {Research}, chapter = {114}, abstract = {

The use of traditional medicine is increasing rapidly in many societies due to its efficiency and affordability. The locally available herbs are basically used in the treatment of symptoms and diseases. Herbal Medicines have proved effective in many cases and outperformed the chemical drugs.

}, doi = {https://doi.org/10.6025/jdim/2018/16/3/114-126}, url = {http://dline.info/fpaper/jdim/v16i3/jdimv16i3_2.pdf}, author = {Bassel Alkhatib and Dania Briman} } @article {689, title = {Cloud Computing Intrusion Detection Using Artificial Bee Colony-BP Network Algorithm}, journal = {Journal of Digital Information Management}, volume = {16}, year = {2018}, month = {08/2018}, pages = {203-209}, type = {Research}, author = {Yang Hui} } @article {825, title = {Cloud Computing Intrusion Detection Using Artificial Bee Colony-BP Network Algorithm-}, journal = {Journal of Digital Information Management}, volume = {16}, year = {2018}, month = {08/2018}, pages = {203-209}, type = {Research}, chapter = {203}, abstract = {

\ Cloud computing characterizes a methodology for computing communications in a much effective manner, and a business paradigm for trading computing resources and services. Alternatively, these difficult and distributed planning{\textquoteright}s turn a striking objective for intruders. Cloud computing provides huge latent for enhancing production and decrease expenditures. However it simultaneously acquires several novel security risks. Intrusion Detection Systems (IDS) have been employed broadly for identifying malicious actions in network communication and hosts. In this work, an artificial bee colony-BP neural network algorithm is applied to the detection module, in order to detect the complicated aggressive behaviors. Through example verification, the artificial bee colony-BP network algorithm has improved intrusion detection efficiency and classification precision, and can effectively guarantee the safety of the cloud computing environment.

}, doi = {https://doi.org/10.6025/jdim/2018/16/4/203-209}, url = {http://dline.info/fpaper/jdim/v16i4/jdimv16i4_5.pdf}, author = {Yang Hui} } @article {623, title = {A Comparative Analysis of the Efficiency of Video Reader Object for Frame Extraction in MATLAB}, journal = {Journal of Multimedia Processing and Technologies}, volume = {9}, year = {2018}, pages = {16-21}, author = {M Nachamai and Joy Paulose and Samuel Marandi} } @article {828, title = {Content Based Text Information Search and Retrieval in Document Images for Digital Library-}, journal = {Journal of Digital Information Management}, volume = {16}, year = {2018}, month = {06/2018}, pages = {136-151}, type = {Research}, chapter = {136}, abstract = {

\ The main objective of this research work is to find the keywords in the captured/scanned print document images in the image database. Document images are becoming more popular in today{\textquoteright}s world and these are used in paperless offices and digital libraries. Information retrieval from the document images is a very challenging task. Hence, there is a need for developing searching strategies to find the required information from these document images as per user{\textquoteright}s needs, becomes very essential in nowadays. Traditionally Optical Character Recognition (OCR) tools are used for information retrieval from the document images, but it{\textquoteright}s not an efficient method. Word spotting is an inventive method for searching the document images and to retrieve relevant information without any conversion. In this work an algorithm Enhanced Dynamic Time Warping was proposed to for finding keywords from document images, it is based on word spotting technique.

}, author = {A. Sakila and S. Vijayarani} } @article {678, title = {Content Based Text Information Search and Retrieval in Document Images for Digital Library}, journal = {Journal of Digital Information Management}, volume = {16}, year = {2018}, month = {06/2018}, pages = {136-151}, type = {Research}, author = {A. Sakila, and S. Vijayarani} } @article {667, title = {A Cross-Layered Approach for Improving Quality of Service of Video Transmission in Ad-hoc Networks}, journal = {Journal of Networking Technology}, volume = {9}, year = {2018}, month = {06/2018}, pages = {48-55}, type = {Research}, author = {Mohammed Yasin Ali and Syed Musthak Ahmed} } @article {666, title = {Data Fusion Techniques in Wireless Sensor Networks: Structured Vs. Structure-Free Approaches}, journal = {Journal of Networking Technology}, volume = {9}, year = {2018}, month = {06/2018}, pages = {41-47}, type = {Research}, author = {Mahnaz Koupaee and Mohammad Reza} } @article {834, title = {Data Quality Measures and Data Cleansing for Research Information Systems-}, journal = {Journal of Digital Information Management}, volume = {16}, year = {2018}, month = {02/2018}, pages = {21}, type = {Research}, chapter = {12}, abstract = {

The collection, transfer and integration of research information into different research information systems can result in different data errors that can have a variety of negative effects on data quality. In order to detect errors at an early stage and treat them efficiently, it is necessary to determine the clean-up measures and the new techniques of data cleansing for quality improvement in research institutions. Thereby an adequate and reliable basis for decision-making using an RIS is provided, and confidence in a given dataset increased.

}, url = {http://dline.info/fpaper/jdim/v16i1/jdimv16i1_2.pdf}, author = {Otmane Azeroual and Gunter Saake and Mohammad Abuosba} } @article {615, title = {Data Quality Measures and Data Cleansing for Research Information Systems}, journal = {Journal of Digital Information Management}, volume = {16}, year = {2018}, month = {02/2018}, pages = {21}, type = {Research}, chapter = {12}, url = {http://dline.info/fpaper/jdim/v16i1/jdimv16i1_2.pdf}, author = {Otmane Azeroual and Gunter Saake and Mohammad Abuosba} } @article {633, title = {Design and Development of Bi-Directional IoT Gateway using ZigBee and Wi-Fi Technologies with MQTT Protocol}, journal = {Journal of Electronic Systems}, volume = {8}, year = {2018}, month = {03/2018}, pages = {1-11}, type = {Research}, author = {Gopi Krishna Popuri and Srinivasa Ravi Kavuluri and Krishnaveni Kommuri} } @article {680, title = {Design and Development of IoT enabled Multi Robot System for Search and Rescue Mission}, journal = {International Journal of Web Applications}, volume = {10}, year = {2018}, month = {06/2018}, pages = {51-63}, type = {Research}, author = {Rajesh Singh and Rohit Samkaria and Anita Gehlot and Sushabhan Choudhary} } @article {465, title = {Developing Mobile Apps to Protect Environment}, journal = {Journal of E-Technology}, volume = {9}, year = {2018}, month = {01/2018}, pages = {10}, chapter = {1}, abstract = {

The widely dependence on mobility has became nowadays a priority for people. The automotive industry has lately grown impressively a lot. Most of the people give cars an important place in ranking their priorities, and this is the reason of developing an Android application for mobile phone, to help resolve certain car problems, which often occur. This application is divided into three categories that facilitate the elimination of car damages. The first part is composed of symptoms, which users visual or auditory notice (observing a particular engine noise, unusual smoke detection). This part helps the car owner to repair the vehicle with only basic information in this domain. The second part is composed of a Google Map, which shows all the car services in a specific area. This part of the application is dedicated to serious problems of the vehicle, which cannot be detected and which can damage the car. The third part consists of connecting the phone to the onboard computer through a device OBD II ELM-327 Bluetooth that allows certain functions to appear on the mobile screen display (speed, air intake, fuel level). In conclusion, we believe that this application is useful, because it helps to clarify car key issues, contributing in this way also to solving the environmental problems regarding pollution.

}, url = {http://www.dline.info/jet/fulltext/v9n1/jetv9n1_1.pdf}, author = {Iulia Georgiana Rinea and Delilah Florea and Adrian Florea} } @article {827, title = {Development of an Adaptive Collaborative Serious Game Based on Learning Style, Using Trace and Agent Technology-}, journal = {Journal of Digital Information Management}, volume = {16}, year = {2018}, month = {06/2018}, pages = {127-135}, type = {Research}, chapter = {127}, abstract = {

: In the collaborative serious game, adaptation is one of the main factors could be considered in the phase of conception since they can contribute to improve learning performance. Learning styles present one of the most factors that affect learning outcomes. Game-based learning (GBL) that takes into account learning styles in the process of adaptation, it furnishes to learners a greater benefit owing in the personalization of learning and contents materials according to their proper learning styles. cepted 6 January 2018 Journal of Digital Information Management DOI: 10.6025/jdim/2018/16/3/127-135 1. Introduction In this paper, Adaptive system that personalize a collaborative serious game based on learning style proposed by Felder and Silverman is described. This system used trace and agent technology. A model of trace and group model are developed to extract adaptation knowledge in order to form plan that will be executed by Npc player. To evaluate a system, an experiment has been conducted on group of students. From the experimental results, it is concluded that the adaptive collaborative serious game based on learning style improve learning outcomes and effectiveness, and promote learning motivation.

}, doi = {https://doi.org/10.6025/jdim/2018/16/3/127-135}, url = {http://dline.info/fpaper/jdim/v16i3/jdimv16i3_3.pdf}, author = {Hadya Boufera and Fatima Bendella and Karim sehaba} } @article {677, title = {Development of an Adaptive Collaborative Serious Game Based on Learning Style, Using Trace and Agent Technology}, journal = {Journal of Digital Information Management}, volume = {16}, year = {2018}, month = {06/2018}, pages = {127-135}, type = {Research}, author = {Hadya Boufera and Fatima Bendella and Karim sehaba} } @article {636, title = {Development of an Integrated Model for Successful Adoption of Management Information Systems in Organizations}, journal = {Progress in Machines and Systems}, volume = {7}, year = {2018}, pages = {1-27}, type = {Research}, author = {Yaser Al-Mamary and Murad Al-nashmi and Alina Shamsuddin and Yahya Abdul Ghaffar Hassan} } @article {672, title = {Dimensions of Changeability of Futuristic Organizations: Need of Organizations in Change Environment}, journal = {Journal of Data Processing}, volume = {8}, year = {2018}, month = {06/2018}, pages = {51-62}, type = {Research}, author = {Najme Jalalian and Masoud Gramipour} } @article {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 {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 {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 {625, title = {A Framework for Big Data Pre-processing and Search Optimization Using Hmga-aco: A Hierarchical Optimization Approach-}, journal = {Progress in Computing Applications}, volume = {7}, year = {2018}, pages = {10-25}, author = {K. V. Rama Satish and N. P Kavya} } @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 {658, title = {Future Reference Sentence Extraction in Support of Future Event Prediction-}, journal = {International Journal of Computational Linguistics Research}, volume = {9}, year = {2018}, month = {03/2018}, pages = {27-41}, type = {Research}, author = {Yoko Nakajima and Michal Ptaszynski and Hirotoshi Honma and Fumito Masui} } @article {639, title = {GAIT Biometric Recognition Using Direct Classification, TSVM, SVM \& Neural Network}, journal = {Journal of Information Organization}, volume = {8}, year = {2018}, month = {03/2018}, pages = {1-7}, author = {S Senthil Kumar and V Kathiresan} } @article {671, title = {Green Practices for Sustainable Development: A Study on Readymade Garment (RMG) Industries of Bangladesh}, journal = {Journal of Information Organization}, volume = {8}, year = {2018}, month = {06/2018}, pages = {70-75}, type = {Research}, author = {Bijeta Saha and Md. RakibulHoque} } @article {661, title = {Health Care Monitoring Using Wifi Through Mobile Devices}, journal = {Journal of Information Technology Review}, volume = {9}, year = {2018}, month = {02/2018}, pages = {18-25}, type = {Research}, author = {Krishna Chaitanya Gogineni and Lakshmi Soundharya Uppuluri} } @article {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 {648, title = {Hybrid Multi-Criteria Decision Making Approach for Product Ranking Using Customers Reviews}, journal = {Journal of Data Processing}, volume = {8}, year = {2018}, month = {03/2018}, pages = {1-17}, type = {Research}, author = {Rakesh Kumar and Aditi Sharan} } @article {681, title = {ICT Green Alignment: New Generation Model Based on Corporate Social Responsibility and Green IT}, journal = {International Journal of Web Applications}, volume = {10}, year = {2018}, month = {06/2018}, pages = {64-73}, type = {Research}, author = {Rachid Hba and Abdellah El Manouar} } @article {692, title = {Identification of Sunspots on SODISM Full-Disk Solar Images}, journal = {Journal of Multimedia Processing and Technologies}, volume = {9}, year = {2018}, month = {09/2018}, pages = {102-111}, type = {Research}, author = {Amro F. Alasta and Abdulrazag Algamudi and RamiQahwaji and Stan Ipson} } @article {631, title = {Implement Efficient Route Discovery of Broadcasting Technique in Moving Object Detection and Tracking}, journal = {Signals and Telecommunication Journal}, volume = {7}, year = {2018}, month = {03/2018}, pages = {8-16}, type = {Research}, author = {Mahalingam Thangaraj} } @article {641, title = {Informative Frame Automated Extraction from Colonoscopy Videos}, journal = {Journal of Information Organization}, volume = {8}, year = {2018}, month = {03/2018}, pages = {15-26}, type = {Research}, author = {Juan C. Arcila-Diaz and Victor Tuesta-Monteza and Heber I. Mejia-Cabrera and Maria P. Trujillo-Uribe} } @article {645, title = {Inmate OS and VMM based Secured Virtualization for Cloud Encompassment}, journal = {International Journal of Web Applications}, volume = {10}, year = {2018}, month = {03/2018}, pages = {1-7}, type = {Research} } @article {824, title = { Intellectual Capital as a Core Competency for Competitive Advantage: A Case Study-}, journal = {Journal of Digital Information Management}, volume = {16}, year = {2018}, month = {08/2018}, pages = {192-202}, type = {Research}, chapter = {192}, abstract = {

This paper aimed to study intellectual capital as a core competency for competitive advantage at pharmaceutical companies in Jordan. To complete the study, a case study was instituted by analyzing the responses of the pharmaceutical companies; the data collected were analyzed with a statistical package. The study concluded some results, the most appearing were; pharmaceutical companies depend on intellectual capital at a high level, competitive advantage also high, and there is a significant statistical effect of intellectual capital on competitive advantage as a whole and on all its indicators (leadership, human recourse, innovation, processes, and financial excellence) at (α <= 0.00). Researchers recommend pharmaceutical companies management and staff to reinforce using intellectual capital at all levels and functions and use it as a main source for competitive advantage in all its areas.

}, doi = {https://doi.org/10.6025/jdim/2018/16/4/192-202}, url = {http://dline.info/fpaper/jdim/v16i4/jdimv16i4_4.pdf}, author = {Nazem M.M. Malkawi and Kalid Al Omari and AzmiHalasa} } @article {688, title = {Intellectual Capital as a Core Competency for Competitive Advantage: A Case Study}, journal = {Journal of Digital Information Management}, volume = {16}, year = {2018}, pages = {192-202}, type = {Research}, author = {Nazem M.M. Malkawi and Kalid Al Omari and AzmiHalasa} } @article {829, title = {Intelligent Semantic Case Based Reasoning System for Fault Diagnosis {\textendash}}, journal = {Journal of Digital Information Management}, volume = {16}, year = {2018}, month = {04/2018}, pages = {53-63}, type = {Research}, chapter = {53}, abstract = {

Case-Based Reasoning (CBR) often shows significant promise for improving the effectiveness of decision support systems. Previous research in decision making has proposed the use of a CBR approach to accumulate, organize, preserve, link and share diverse knowledge coming from past experiences. However, existing CBR systems lack semantic understanding, which is important for intelligent knowledge retrieval in decision support systems. In order to overcome the limitation of existing CBR and develop an intelligent CBR system which can not only carry out data matching retrieval, but also perform semantic associated data access, and improve the traditional keyword-based search, this paper integrates ontology technology into a CBR system and proposes to combine semantic retrieval method and numerical measurement in case retrieval. Ontology technology is an ideal selection for realizing our system thanks to the good semantic understanding offered by ontology. The resulting ontology based CBR system is applied in fault diagnosis of industrial machines, a semi-structured decision-making environment involving multiple attributes. The case illustrates the use of proposed semantic CBR system, and shows the feasibility of our approach and the benefit of the ontology support.

}, url = {http://dline.info/fpaper/jdim/v16i2/jdimv16i2_1.pdf}, author = {Abdelkader Adla and Ahmed Ben Bella} } @article {651, title = {Intelligent Semantic Case Based Reasoning System for Fault Diagnosis}, journal = {Journal of Digital Information Management}, volume = {16}, year = {2018}, month = {042018}, pages = {53-63}, type = {Research}, author = {Abdelkader Adla and Ahmed Ben Bella} } @article {635, title = {Intention to use Mobile Wallet: Extension of TAM Model}, journal = {Journal of Electronic Systems}, volume = {8}, year = {2018}, month = {03/2018}, pages = {27-34}, type = {Research}, author = {S Krishna Kumar and C Sivashanmugam and Ajay Venkataraman} } @article {694, title = {Interval Intuitionistic Trapezoidal Fuzzy Prioritized Aggregating Operators and their Application to Multiple Attribute Decision Making}, journal = {Journal of Intelligent Computing}, volume = {9}, year = {2018}, month = {09/2018}, pages = {102-113}, type = {Research}, author = {Xian-Ping Jiang} } @article {637, title = {Knowledge Management: Tool for Enhancing HRM Practices and Organizational Innovation}, journal = {Progress in Machines and Systems}, volume = {7}, year = {2018}, pages = {28-36}, type = {Research}, author = {Mueen Uddin} } @article {698, title = {A Log Based Update of Replicated Profiles in Decentralized Social Networks}, journal = {Journal of Digital Information Management}, volume = {16}, year = {2018}, month = {10/2018}, pages = {230-245}, type = {Research}, chapter = {230}, doi = {https://doi.org/10.6025/jdim/2018/5/230-245}, author = {Lyes Badis and Mourad Amad and Djamil A{\"\i}ssani} } @article {818, title = {A Log Based Update of Replicated Profiles in Decentralized Social Networks-}, journal = {Journal of Digital Information Management}, volume = {16}, year = {2018}, month = {10/2018}, pages = {230-245}, type = {Research}, chapter = {230}, abstract = {

Decentralized Social Networks are proposed to provide more privacy guarantee\  to the users. They avoid storing data in central servers. The profiles are important and critical objects of this type of network. They are stored in the user{\textquoteright}s devices. In order to ensure more availability, every profile is replicated in several devices. The different copies of any given profile stored in different devices are correctly updated with all the writes that happened in any single copy. Since the profiles undergo frequent writes, an important network load is generated during the update process. In this paper, we propose an update model based on the use of a log file to store the writ s. This reduces the size of the data exchanged between the devices storing the same profiles. Simulation results show that the proposed model is globally satisfactory.

}, doi = {https://doi.org/10.6025/jdim/2018/16/5/230-245}, url = {http://dline.info/fpaper/jdim/v16i5/jdimv16i5_3.pdf}, author = {Lyes Badis, and Mourad Amad and Djamil A{\"\i}ssani} } @article {814, title = {Machine Learning in Predicting the Appropriate Model of Software Process Models Deviation-}, journal = {Journal of Digital Information Management}, volume = {16}, year = {2018}, month = {12/.2018}, pages = {308-323}, type = {Research}, chapter = {308}, abstract = {

\ Software Process Model deviation management allows to supervise process model execution and its adaptation when an inconsisteny is detected. The process model should be adjusted based on specified rules in order to ensure the continuity of\  the process model execution. Journal of Digital Information Management {\textquotedblleft}priority and dependency of sub-activities {\textquotedblleft} and data from previous executions to predict the appropriate software process model. Subject Categories and Descriptors D.2.3 [Software Coding Tools and Techniques]; F.1.1 Models of Computation Some works attempted to handle process model deviation by adjusting fragments and considering some rules to ensure that all constraints are met. Other studies considered only critical constraints in order to avoid cost/ schedule overrun: rules considering the criticality of the activities and their order. However, it is still generating uncertain executions with no mastery on the final result

}, doi = {https://doi.org/10.6025/jdim/2018/6/289-307}, url = {http://dline.info/fpaper/jdim/v16i6/jdimv16i6_3.pdf}, author = {Tarik Chaghrouchni and Issam Mohammed Kabbaj and Zohra Bakkoury} } @article {703, title = {Machine Learning in Predicting the Appropriate Model of Software Process Models Deviation}, journal = {Journal of Digital Information Management}, volume = {16}, year = {2018}, month = {12/2018}, pages = {308-323}, type = {Research}, chapter = {308}, doi = {https://doi.org/10.6025/jdim/2018/6/308-323}, url = {http://dline.info/fpaper/jdim/v16i6/jdimv16i6_3.pdf}, author = {Tarik Chaghrouchni and Issam Mohammed Kabbaj and Zohra Bakkoury} } @article {687, title = {Major Issues in Adoption of Electronic Health Records}, journal = {Journal of Digital Information Management}, volume = {16}, year = {2018}, month = {08/2018}, pages = {180-191}, type = {Research}, author = {Myongho Yi} } @article {823, title = {Major Issues in Adoption of Electronic Health Records-}, journal = {Journal of Digital Information Management}, volume = {16}, year = {2018}, month = {08/2018}, pages = {180-191}, type = {Research}, chapter = {180}, abstract = {

The use of Electronic Health Records (EHRs) is not new, but the implementation and provision of their services are. Despite the positive aspects and promising features of EHRs use in medical and healthcare practices, there are many issues that need to be identified and addressed to expedite the adoption rate of EHRs. The objective of the study is to examine major issues which hinder EHR adoption and to present identified solutions.

}, doi = {https://doi.org/10.6025/jdim/2018/16/4/180-191}, url = {http://dline.info/fpaper/jdim/v16i4/jdimv16i4_3.pdf}, author = {Myongho Yi} } @article {649, title = {Mashup Service Implementation on Multi-cloud Environment Using Map Reduction Approach}, journal = {Journal of Data Processing}, volume = {8}, year = {2018}, month = {03/2018}, pages = {18-26}, type = {Research}, author = {Venkateswara Rao Peddada and Ali Hussain Mohd} } @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 {626, title = {MCWDF - Micro-chunk based Web Delivery Framework}, journal = {Progress in Computing Applications}, volume = {7}, year = {2018}, pages = {26-40}, author = {Shailesh Shivakumar and P.V Suresh} } @article {663, title = {Measuring Software Architecture Stability Evolution in Object-oriented Open Source Systems}, journal = {Journal of Information Technology Review}, volume = {9}, year = {2018}, month = {06/2018}, pages = {35-48}, type = {Research}, author = {Hassan Almousa and Mamdouh Alenezi} } @article {833, title = {Mining of Social Networks from Classic Books and Visualization-}, journal = {Journal of Digital Information Management}, volume = {16}, year = {2018}, month = {02/2018}, pages = {1-11}, type = {Research}, chapter = {1}, abstract = {

\ While modern online social networks offer unprecedented amount of data and opportunities for mining, we acknowledge that other forms of social networks have been around throughout human history. In particular, we recognize the classic books as valuable sources for the analysis of interpersonal interactions as they have had positive influence on human mind and continue to enlighten the human race.

}, url = {http://dline.info/fpaper/jdim/v16i1/jdimv16i1_1.pdf}, author = {SeungJin Lim} } @article {614, title = {Mining of Social Networks from Classic Books and Visualization}, journal = {Journal of Digital Information Management }, volume = {16}, year = {2018}, month = {02/2018}, pages = {12}, chapter = {1}, url = {http://dline.info/fpaper/jdim/v16i1/jdimv16i1_1.pdf}, author = {Seung Jin Lim} } @article {691, title = {A Mixed Chaotic-cellular Automata Based Encryption Scheme for Compressed Jpeg Images}, journal = {Journal of Multimedia Processing and Technologies}, volume = {9}, year = {2018}, month = {09/2018}, pages = {88-101}, type = {Research}, author = {Rabab Beniani and Kamel Mohamed FARAOUN} } @article {702, title = {Model Integration Approach from SysML to MATLAB/Simulink-}, journal = {Journal of Digital Information Management}, volume = {16}, year = {2018}, month = {12/2018}, pages = {289-307}, type = {Research}, chapter = {289}, doi = { https://doi.org/10.6025/jdim/2018/6/289-307}, url = {http://dline.info/fpaper/jdim/v16i6/jdimv16i6_2.pdf}, author = {Bassim CHABIBI and Adil ANWAR and Mahmoud NASSAR} } @article {813, title = {Model Integration Approach from SysML to MATLAB/Simulink-}, journal = {Journal of Digital Information Management}, volume = {16}, year = {2018}, month = {12/2018}, pages = {289-307}, type = {Research}, chapter = {289}, abstract = {

In system engineering process, descriptive system models seem to be insufficient in order to perform a system verification which fulfils various stakeholders{\textquoteright} requirements. This aspect is well handled by simulation process through the use of several simulation techniques or algorithms. As a consequence, design process efficiency is considerably reduced by the fact that both system modeling and simulation tools are often used separately. This study introduces an integration process to unify the potential provided by systems modeling languages and simulation environments, through the definition of a Domain Specific Language, namely Simulation Modeling Language, that is built on the basis ofa deep study of common constructs, semantics and modeling methodologies of several simulation environments, in addition to the specification of a model transformation between this language and a simulation environment (MATLAB/SImulink) in order to illustrate both its importance et its efficiency in our integration approach. Through the specification of its syntaxes and semantics, the defined intermediate modeling language allows modeling systems by using common constructs and modeling methodologies of simulation process in order to ensure their modeling with simulation environments\ 

}, doi = {https://doi.org/10.6025/jdim/2018/6/289-307}, url = {http://dline.info/fpaper/jdim/v16i6/jdimv16i6_2.pdf}, author = {Bassim CHABIBI and Adil ANWAR and Mahmoud NASSAR} } @article {624, title = {Model of {\textquotedblleft}International Megalesson{\textquotedblright} of Learning Programming in Schools of Russia and Kazakhstan}, journal = {Progress in Computing Applications}, volume = {7}, year = {2018}, pages = {1-9}, author = {Zhamilya Akkassynova and Nikolay Pak and Liubov Ivkina}, editor = {Dmitry Romanov} } @article {642, title = {A MultiCriteria Spatial WEB Decision Support System for Hazardous Materials Road Transport}, journal = {Transactions on Machine Design}, volume = {6}, year = {2018}, month = {02/2018}, pages = {1-20}, type = {Research}, author = {Djamila Hamdadou and Emdjed Alnafie and Karim Bouamrane and Ikram Behilil} } @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 {629, title = {Network Intrusion Detection by using Particle Swarm Optimization and Neural Network}, journal = {Journal of Networking Technology}, volume = {9}, year = {2018}, pages = {22-30}, abstract = {

In order to improve the effectiveness of network intrusion detection, a network intrusion detection model based on particle swarm optimization algorithm and neural network is proposed. Firstly, the feature of network intrusion detection is collected, and important features are selected by using particle swarm optimization algorithm to effectively remove the invalid feature; then BP neural network is used to build intrusion detection classifier, finally KDD 99 data is used to analyze performance of the model. The results show that the proposed model can improve accuracy of network intrusion detection, and the detection speed can meet the practical requirements of network security.

}, author = {Xiang Changsheng} } @article {820, title = {New approach for intrusion detection in Big Data as a service in the Cloud-}, journal = {Journal of Digital Information Management}, volume = {16}, year = {2018}, month = {10/12}, pages = {258-270}, type = {Research}, chapter = {258}, abstract = {

\ Nowadays, Big Data has reached every area of our lives because it covers many tasks in different operation. This new technique forces the cloud computing to use it as a layer, for this reason cloud technology embraces it as Big Data as a service (BDAAS). After solving the problem of storing huge volumes of information circulating on the Internet, remains to us how we can protect and ensure that this information are stored\  without loss or distortion. The aim of this paper is to study the problem of safety in BDAAS, inparticularly we will cover the problem of Intrusion detection system (IDS). In order to solve the problems tackled in this paper, we have proposed a Self-Learning Autonomous Intrusion Detection system (SLA-IDS) which is based on the architecture ofautonomic system to detect the anomaly data. In this approach, to add the autonomy aspect to the proposed system we have used mobile and situated agents. The implementation of this model has been provided to evaluate our system. The obtained findings show the effectiveness of our proposed model. We validate our proposition using Hadoop as Big Data Platform and CloudSim, machine learning Weka with java to create Model of detection.

}, doi = {https://doi.org/10.6025/jdim/2018/16/5/258-270}, url = {http://dline.info/fpaper/jdim/v16i5/jdimv16i5_5.pdf}, author = {Dounya Kassimi and Okba Kazar and Omar Boussaid and Abdelhak Merizig} } @article {700, title = {New approach for intrusion detection in Big Data as a service in the Cloud}, journal = {Journal of Digital Information Management}, volume = {16}, year = {2018}, month = {10/2018}, pages = {258-271}, type = {Research}, chapter = {258}, doi = {https://doi.org/10.6025/jdim/2018/5/258-270}, author = {Dounya Kassimi and Okba Kazar and Omar Boussaid and Abdelhak Merizig} } @article {674, title = {New Ideas for Applying Ant Colony Optimization to the Protein Function}, journal = {Journal of Data Processing}, volume = {8}, year = {2018}, month = {06/2018}, pages = {74-81}, type = {Research}, author = {Mohana Prabha. G and Chitra. S} } @article {697, title = {A New Look at the TOR Anonymous Communication System}, journal = {Journal of Digital Information Management}, volume = {16}, year = {2018}, month = {10/2018}, pages = {223-229}, type = {Research}, chapter = {223}, doi = {https://doi.org/10.6025/jdim/2018/5/223-229}, author = {Imran Ahmad and M. Saddique and U. Pirzada and M. Zohaib and A. Ali and M. Khan} } @article {817, title = {A New Look at the TOR Anonymous Communication System-}, journal = {Journal of Digital Information Management}, volume = {16}, year = {2018}, month = {10/2018}, pages = {223-229}, type = {Research}, chapter = {223}, abstract = {

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

}, doi = {https://doi.org/10.6025/jdim/2018/16/5/223-229}, url = {http://dline.info/fpaper/jdim/v16i5/jdimv16i5_2.pdf}, author = {Imran Ahmad and M. Saddique, and U. Pirzada, and M. Zohaib and A. Ali, and M. Khan} } @article {699, title = {A Noise-Robust Image Encryption Algorithm Based on Hyper Chaotic Cellular Neural Network}, journal = {Journal of Digital Information Management}, volume = {16}, year = {2018}, pages = {246-257}, chapter = {246}, doi = {https://doi.org/10.6025/jdim/2018/5/246-257}, author = {Gangyi Hu and Sumeth Yuenyong and Jian Qu and Jian Rong and Weili Kou} } @article {819, title = {A Noise-Robust Image Encryption Algorithm Based on Hyper Chaotic Cellular Neural Network-}, journal = {Journal of Digital Information Management}, volume = {15}, year = {2018}, month = {10/2018}, pages = {246-257}, type = {Research}, chapter = {246}, abstract = {

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

}, doi = {http://dline.info/fpaper/jdim/v16i5/jdimv16i5_4.pdf}, url = {https://doi.org/10.6025/jdim/2018/16/5/246-257}, author = {Gangyi Hu and Sumeth Yuenyong and Jian Qu and Jian Rong, and Weili Kou} } @article {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 {830, title = { Non-words Spell Corrector of Social Media Data in Message Filtering Systems {\textendash}}, journal = {Journal of Digital Information Management}, volume = {16}, year = {2018}, month = {04/2018}, pages = {64-75}, type = {Research}, chapter = {64}, abstract = {

We develop an extended version of spell checker and corrector to check non-word errors in social media datasets, which will be used in message filtering systems especially for cyberbullying detection. We use the dictionary techniques to check words, twelve-word spell error checking and correction approaches to correct the non-word errors, and n-gram and Levenshtein distance to select the most suitable word among corrected words. If there is more than one corrected word we get from each approach, we use n-gram techniques to choose the corrected and reasonable word from the words in n-gram database. When we used the Levenshtein distance in our previous work, we found that it selected the first corrected word and it was not a reasonable one in some sentences. Therefore, we use the n-gram database in this paper.

}, url = {http://dline.info/fpaper/jdim/v16i2/jdimv16i2_2.pdf}, 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 {632, title = {A Novel Node Integrity Based Authentication Model For Dynamic Wireless Communication Networks}, journal = {Signals and Telecommunication Journal}, volume = {7}, year = {2018}, month = {03/2018}, pages = {17-33}, type = {Research}, author = {Madhuravani Bandanatham and DSR Murthy} } @article {683, title = {One-layer Neural Network for Solving Least Absolute Deviation Problems with Box and Equality Constraints}, journal = {Journal of Electronic Systems}, volume = {8}, year = {2018}, month = {06/2018}, pages = {57-71}, type = {Research}, author = {Cuiping Li} } @article {836, title = {Ontology Matching as Regression Problem-}, journal = {Journal of Digital Information Management}, volume = {16}, year = {2018}, month = {02/2018}, pages = {33-42}, type = {Research}, chapter = {33}, abstract = {

\ Ontology matching is one of the most important works to achieve the goal of the semantic web. To fulfill this task, element-level matching is an indispensable step to obtain the fundamental alignment. In element-level matching process, previous work generally utilizes multiple measures to compute the similarities among elements, and then combine these similarities using a weighted sum formula to determine later the semantic correspondences. The proper selection and combination of these similarities strongly influence the final quality of the matching system.

}, url = {http://dline.info/fpaper/jdim/v16i1/jdimv16i1_4.pdf}, author = {Nadia Alboukaey and Ammar Joukhadar} } @article {617, title = {Ontology Matching as Regression Problem}, journal = {Journal of Digital Information Management}, volume = {16}, year = {2018}, month = {02/2018}, pages = {42}, type = {Research}, chapter = {33}, url = {http://dline.info/fpaper/jdim/v16i1/jdimv16i1_4.pdf}, author = {Nadia Alboukaey and Ammar Joukhadar} } @article {685, title = {Optimal Web Service Selection Model using Fuzzy Extended AHP and Weighted Sum Method}, journal = {Journal of Digital Information Management}, volume = {16}, year = {2018}, month = {08/2018}, pages = {157-168}, type = {Research}, author = {Rachna Kohar} } @article {821, title = {Optimal Web Service Selection Model using Fuzzy Extended AHP and Weighted Sum Method-}, journal = {Journal of Digital Information Management}, volume = {16}, year = {2018}, month = {08/2018}, pages = {157-168}, type = {Research}, chapter = {157}, abstract = {

\ Different services have different values for their different properties (functional and non-functional). Moreover, consumers have different preferences for these properties. Since these preferences may be incomplete/ vague/imprecise, this inevitably can in turn cause selection of a non-optimal service for the consumer which may not have the desired value for these properties for the consumer. Therefore optimal web service selection based on the consumer{\textquoteright}s preferences is a challenging task. In this paper, a new service selection model is proposed which considers consumer preferences for different service properties as well as the actual values of its properties. Services are evaluated and priority weights are computed separately for functional and non-functional properties using modified Fuzzy Extended Analytic Hierarchy Process (FEAHP) and Weighted Sum Method (WSM) respectively. Real time data is used to conduct experiments.

}, doi = {https://doi.org/10.6025/jdim/2018/16/4/157-168}, url = {http://dline.info/fpaper/jdim/v16i4/jdimv16i4_1.pdf}, author = {Rachna Kohar} } @article {701, title = {Parking System Development Using Extreme Programming Method}, journal = {Journal of Digital Information Management}, volume = {16}, year = {2018}, month = {122018}, pages = {288}, type = {Research}, chapter = {279}, doi = {https://doi.org/10.6025/jdim/2018/6/279-288}, url = {http://dline.info/fpaper/jdim/v16i6/jdimv16i6_1.pdf}, author = {Johannes Fernandes Andry and Gary Juliawan and Yosua Christian and Jeffry Leonardo and Nicolas} } @article {812, title = {Parking System Development Using Extreme Programming Method-}, journal = {Journal of Digital Information Management}, volume = {16}, year = {2018}, month = {12/2018}, pages = {279-288}, type = {Research}, chapter = {279}, abstract = {

\ In developing cities such as in Jakarta, there are a lot of vehicle parking locations that still use conventional methods, which can harm drivers and also parking area owners alike, the process is slow and unsafe, making many people around feel afraid to use parking locations that are still conventional, the conventional parking lots in Jakarta is too many, sometimes also make people have no other choice but to use unsecured parking lots, theft is the main factor that is difficult to avoid, especially in developing countries like Indonesia, which are not safe, and the location of the parking lot that is very open, makes a lot of opportunities which of course can be used by thieves or irresponsible people. Not only thieves, drivers who do not want to pay for parking, are also a problem for owners of parking lots. With the problems of these users, we plan to make modular parking applications that can be installed easily and cheaply, but because our group is not so large, there are several challenges that we face, such as time and requirements that can increase later, with thus we plan to make this parking application using the Extreme Programming method, which is possible and very suitable for the problems that our group is facing. The use of Extreme Programming turned out to be very helpful, and can also produce an application that matches the existing user stories.

}, doi = {https://doi.org/10.6025/jdim/2018/6/279-288}, url = {http://dline.info/fpaper/jdim/v16i6/jdimv16i6_1.pdf}, author = {Johannes Fernandes Andry and Gary Juliawan and Yosua Christian and Jeffry Leonardo and Nicolas} } @article {668, title = {Performance Measure and Analysis of MPLS and conventional IP network through VoIP: Effect in Video and Audio transmission}, journal = {Journal of Networking Technology}, volume = {9}, year = {2018}, month = {06/2018}, pages = {56-65}, type = {Research}, author = {Jawad Oubaha and Abderrahmane Ez-zahout} } @article {640, title = {Play-driven Design: Model for Engaging Person as in Content Sites}, journal = {Journal of Information Organization}, volume = {8}, year = {2018}, month = {03/2018}, pages = {7-15}, type = {Research}, author = {Angelo P{\'u}blio and Sergio Nesteriuk} } @article {660, title = {Private Cloud for College: Architecture and Possibility}, journal = {Journal of Information Technology Review}, volume = {9}, year = {2018}, month = {02/2018}, pages = {13-17}, type = {Research}, author = {Saif Alnuaimi} } @article {654, title = {Query Expansion with Enhanced-BM25 Approach for Improving the Search Query Performance on Clustered Biomedical Literature Retrieval}, journal = {Journal of Digital Information Management}, volume = {16}, year = {2018}, month = {04/2018}, pages = {85-98}, type = {Research}, author = {ThayyabaKhatoon MD and A. Govardhan} } @article {832, title = {Query Expansion with Enhanced-BM25 Approach for Improving the Search Query Performance on Clustered Biomedical Literature Retrieval {\textendash}}, journal = {Journal of Digital Information Management}, volume = {16}, year = {2018}, month = {04/2018}, pages = {86-98}, type = {Research}, chapter = {85}, abstract = {

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

}, url = {http://dline.info/fpaper/jdim/v16i2/jdimv16i2_4.pdf}, author = {ThayyabaKhatoon MD and A. Govardhan} } @article {675, title = {Query Optimization on Distributed Health Database DBD by Minimizing Attribute Involvement}, journal = {Journal of Digital Information Management}, volume = {16}, year = {2018}, month = {06/2018}, pages = {105-113}, type = {Research}, author = {Slamet Sudaryanto N and Sudaryanto and Maryani S} } @article {643, title = {Rain Water Harvesting Basic Need of Present Urban Sector {\textendash} Use of Digital Technology for Rain Water Harvesting}, journal = {Transactions on Machine Design}, volume = {6}, year = {2018}, month = {02/2018}, pages = {21-25}, type = {Research}, author = {Anil Gaikwad} } @article {628, title = {Reliability, Neighborhood Discovery and Active Node Selection in Wireless Sensor Networks}, journal = {Journal of Networking Technology}, volume = {9}, year = {2018}, pages = {13-21}, abstract = {

In the present computer world Wireless Sensor Networks are playing a major role in sensing environment, health care and embedded systems category. In WSNs sensors are the nodes which are deployed randomly and in a wide spread manner. Data can be transmitted to the controller by the sensors at periodic intervals. As the network is dynamic the number and behavior of nodes vary randomly and identifies the nodes which are active are selected and the nodes which are idle are neglected. In WSN, the topology of the network is dynamic, it is necessary to identify the neighbors in the proximity and coordinate data acquisition at the controller. In any network reliability is an important issue which deals with stability under mobility, low delay, more life time, optimal route and other optimizations.

}, author = {Bhargavi Mopuru and M Naga Bhushana Rao} } @article {682, title = {Round Instrumentation for Aerospace Application}, journal = {Journal of Electronic Systems}, volume = {8}, year = {2018}, month = {06/2018}, pages = {45-56}, type = {Research}, author = {Srinivas Bachu and B. Supriya} } @article {664, title = {SA-min: An Efficient Algorithm for Minimizing the Spread of Influence in a Social Network}, journal = {Journal of Information Technology Review}, volume = {9}, year = {2018}, month = {06/2018}, pages = {48-59}, type = {Research}, author = {Yong Liu and Shengnan Xie and Wei Zhang and QianqianRen} } @article {621, title = {Satellite Image Compression Technique Using Noise Bit Removal and Discrete Wavelet Transform}, journal = {Journal of Multimedia Processing and Technologies}, volume = {9}, year = {2018}, pages = {1-7}, author = {Khaled Sahnoun} } @article {690, title = {Secured Multimodal Biometric System}, journal = {Journal of Multimedia Processing and Technologies}, volume = {9}, year = {2018}, month = {09/2018}, pages = {77-87}, type = {Research}, author = {Bedad Fatima and Adjoudj R{\'e}da} } @article {815, title = {Sentiment Analysis of Arabic Tweets: Opinion Target Extraction-}, journal = {Journal of Digital Information Management}, volume = {16}, year = {2018}, month = {12/2018}, pages = {324-331}, type = {Research}, chapter = {324}, abstract = {

\ Due to the increased volume of Arabic opinionated posts on different social media, Arabic sentiment analysis is viewed as an important research field. Identifying the target or the topic on which opinion has been expressed is the aim of this work. Opinion target identification is a problem that was generally very little treated in Arabic text. In this paper, an opinion target extraction method from Arabic tweets is proposed. First, as a preprocessing phase, several feature forms from tweets are extracted to be examined. The aim of these forms is to evaluate their impacts on accuracy. Then, two classifiers, SVM and Na{\"\i}ve Bayes are trained. The experiment results show that, with 500 tweets collected and manually tagged, SVM gives the highest precision and recall (86\%).

}, doi = {https://doi.org/10.6025/jdim/2018/6/324-331}, url = {http://dline.info/fpaper/jdim/v16i6/jdimv16i6_4.pdf}, author = {Salima BEHDENNA and Fatiha Barigou and Ghalem Belalem} } @article {704, title = {Sentiment Analysis of Arabic Tweets: Opinion Target Extraction}, journal = {Journal of Digital Information Management}, volume = {16}, year = {2018}, month = {12/2018}, pages = {324-331}, type = {Research}, chapter = {324}, doi = {https://doi.org/10.6025/jdim/2018/6/324-331}, url = {http://dline.info/fpaper/jdim/v16i6/jdimv16i6_4.pdf}, author = {Salima BEHDENNA and Fatiha Barigou and Ghalem Belalem} } @article {634, title = {Solution to Harmonics Interference on Track Circuit Based on ZFFT Algorithm with Multiple Modulation}, journal = {Journal of Electronic Systems}, volume = {8}, year = {2018}, month = {03/2018}, pages = {12-26}, type = {Research}, author = {Xiaochun Wu and Guanggang Ji} } @article {619, title = {Stock Price Prediction Using Multilayer Perceptron Neural Network by Monitoring Frog Leaping Algorithm}, journal = {Journal of Intelligent Computing}, volume = {9}, year = {2018}, month = {3/2018}, pages = {15-23}, url = {http://www.dline.info/jic/fulltext/v9n1/jicv9n1_2.pdf}, author = {Ahdieh Rahimi Garakani} } @article {618, title = {Study on the Task Scheduling Problem of Complicated Products{\textquoteright} Design}, journal = {Journal of Intelligent Computing}, volume = {9}, year = {2018}, month = {3/2018}, chapter = {1-14}, url = {http://www.dline.info/jic/fulltext/v9n1/jicv9n1_1.pdf}, author = {Xiao Bo Cao and Cheng Dong Xu and Guo Chao Fan} } @article {669, title = {A Survey and Analysis of Techniques and Tools for Web Performance Optimization}, journal = {Journal of Information Organization}, volume = {8}, year = {2018}, month = {06/2018}, pages = {31-57}, type = {Research}, author = {Shailesh Shivakumar and P. V Suresh} } @article {659, title = {Team Capacity Evaluation and Scheduling Model for Collaborative Product Design}, journal = {Journal of Information Technology Review}, volume = {9}, year = {2018}, month = {02/2018}, pages = {1-12}, type = {Research}, author = {Xiaolei Wang} } @article {656, title = {Text Classification for Arabic Words Using BPSO/REP-Tree}, journal = {International Journal of Computational Linguistics Research}, volume = {9}, year = {2018}, month = {03/2018}, pages = {1-9}, type = {Research}, author = {Hamza Naji and Wesam Ashour and Mohammed Al Hanjouri} } @article {655, title = {Text Classification for Arabic Words Using BPSO/REP-Tree}, journal = {International Journal of Computational Linguistics Research}, volume = {9}, year = {2018}, month = {03/2018}, pages = {1-9}, type = {Research}, author = {Hamza Naji and Wesam Ashour and Mohammed Al Hanjouri} } @article {646, title = {Time Optimal Profit Maximization in a Social Network}, journal = {International Journal of Web Applications}, volume = {10}, year = {2018}, month = {03/2018}, pages = {8-22}, type = {Research}, author = {Yong Liu and Wei Zhang} } @article {644, title = {Uniform Design Research for Maintenance Strategy of Automatic Production Line}, journal = {Transactions on Machine Design}, volume = {6}, year = {2018}, month = {02/2018}, pages = {26-33}, type = {Research}, author = {Guofa Li and Chao Hou and Guofei Liu and Yuhui Jia} } @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 {496, title = {Automatic detection of nutritional deficiencies in coffee tree leaves through shape and texture descriptors}, journal = {Journal of Digital Information Management}, volume = {15}, year = {2017}, note = {Export Date: 22 February 2018}, month = {2017}, pages = {7 - 18}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85016474670\&partnerID=40\&md5=98af0aca341a806d62107e81ef5988db}, author = {Vassallo-Barco, M. and Vives-Garnique, L. and Tuesta-Monteza, V. and Mej{\'\i}a-Cabrera, H.I. and Toledo, R.Y.} } @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 {480, title = {Comparing network centrality measures as tools for identifying key concepts in complex networks: A case of wikipedia}, journal = {Journal of Digital Information Management}, volume = {15}, year = {2017}, note = {Export Date: 22 February 2018}, month = {2017}, pages = {203 - 213}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85026636099\&partnerID=40\&md5=50c7ab8bd294001879ffef604b1bc961}, author = {Matas, N. and Martinci{\'c}-Ip{\v s}i{\'c}, S. and Me{\v s}trovi{\'c}, A.} } @article {487, title = {Computer aided fire safety engineering model based on shortest path algorithm}, journal = {Journal of Digital Information Management}, volume = {15}, year = {2017}, note = {Export Date: 22 February 2018}, month = {2017}, pages = {106 - 114}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85021799816\&partnerID=40\&md5=d6600cfbe468d44ff4fc46e50a018498}, author = {Gao, Y. and Zhao, J.} } @article {490, title = {Data visualization and retrieval based Convenience store location model of fresh products}, journal = {Journal of Digital Information Management}, volume = {15}, year = {2017}, note = {Export Date: 22 February 2018}, month = {2017}, pages = {125 - 134}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85021797683\&partnerID=40\&md5=72826fd437fd6316cc4864bd8051ea42}, author = {Li, L.} } @article {481, title = {Design of access control system for hangul document system}, journal = {Journal of Digital Information Management}, volume = {15}, year = {2017}, note = {Export Date: 22 February 2018}, month = {2017}, pages = {170 - 178}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85026624734\&partnerID=40\&md5=bb4ae16f5a7688c1f24708dffb410430}, author = {Jang, S.J.} } @article {471, title = {The design research of intelligent suitcase}, journal = {Journal of Digital Information Management}, volume = {15}, year = {2017}, note = {Export Date: 22 February 2018}, month = {2017}, pages = {320 - 330}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85041078765\&partnerID=40\&md5=cda32c09d5cee78942c927272781aca9}, author = {Li, Y.} } @article {839, title = {The Design Research of Intelligent Suitcase-}, journal = {Journal of Digital Information Management}, volume = {15}, year = {2017}, month = {12/2017}, pages = {330}, type = {Research}, chapter = {320}, abstract = {

\ By means of advanced mobile internet technology and combining with practical problem in use of suitcase, the smart suitcase is researched and developed to meet users{\textquoteright} demands for safety, carrying and entertainment, so as to provide users{\textquoteright} trip with intelligent solution. Meanwhile, the innovation of core functional units of smart suitcase is proposed to implement intelligent design of traditional suitcase, research suitcase relevant elements repeatedly, improve function, shape, structure, material, technology as well as color, and enhance product quality via design. On the one hand, the topic research refreshes traditional trip mode so that people can experience the convenience of smart trip; on the other hand, it provides people with faster use mode and meets users{\textquoteright} demands for personalized as well as high-tech products. Nowadays, the design of smart products under the era of internet of things has become a new trend, which meets users{\textquoteright} demand for suitcase, enables users to control smart suitcase easily with enjoying the comfort brought by the product, and keeps creating benefits for users and society.

}, url = {http://dline.info/fpaper/jdim/v15i6/jdimv15i6_3.pdf}, author = {Yongchuan Li} } @article {473, title = {Dynamic parse approach of ladder diagram based on binary logic tree on the soft PLC system}, journal = {Journal of Digital Information Management}, volume = {15}, year = {2017}, note = {Export Date: 22 February 2018}, month = {2017}, pages = {241 - 250}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85036640871\&partnerID=40\&md5=dd38e211439845519d63791a2429f227}, author = {Yang, G. and Yang, J. and Li, S.} } @article {485, title = {Dynamic tree based classification of Web Queries using B-tree and Simple Ordinal classification algorithm}, journal = {Journal of Digital Information Management}, volume = {15}, year = {2017}, note = {Export Date: 22 February 2018}, month = {2017}, pages = {115 - 124}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85021837013\&partnerID=40\&md5=280f7a24fdb61ddeedd93f8c2b398dc0}, author = {Lakshmi, L. and Reddy, P.B. and Bindu, C.S.} } @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 {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 {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 {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 {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 {470, title = {A fast algorithm for plagiarism detection in large-scale data}, journal = {Journal of Digital Information Management}, volume = {15}, year = {2017}, note = {Export Date: 22 February 2018}, month = {2017}, pages = {331 - 338}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85041038008\&partnerID=40\&md5=38c22942ab3fd6e44bbc8fbb62ea25bd}, author = {Baba, K.} } @article {840, title = {A Fast Algorithm for Plagiarism Detection in Large-scale Data-}, journal = {Journal of Digital Information Management}, volume = {15}, year = {2017}, month = {12/2017}, pages = {331-338}, type = {Research}, chapter = {331}, abstract = {

This paper proposes a fast plagiarism detection algorithm in large-scale data. Plagiarisms of superficial descriptions, such as {\textquotedblleft}copy and paste{\textquotedblright}, can be detected using a simple document similarity based on string matching. The algorithm reduces the effort for computing the document similarity by approximating the similarity. The effects of the approximation on the processing time and accuracy are evaluated by conducting experiments with a data set generated from practical scholarly documents. The experimental results show that the algorithm based on the approximated similarity can reduce the processing time of the straightforward algorithm based on the exact similarity to less than one-third in exchange for a slight decrease of the accuracy.

}, url = {http://dline.info/fpaper/jdim/v15i6/jdimv15i6_4.pdf}, author = {Kensuke Baba} } @article {499, title = {Feasibility of digital forensic examination and analysis of a cloud based storage snapshot}, journal = {Journal of Digital Information Management}, volume = {15}, year = {2017}, note = {Export Date: 22 February 2018}, month = {2017}, pages = {19 - 29}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85016449099\&partnerID=40\&md5=febcecad98f7a471162d3ecc0750e113}, author = {Almulla, S. and Iraqi, Y. and Jones, A.} } @article {498, title = {Formal transformation of spatiotemporal data from object-oriented database to XML}, journal = {Journal of Digital Information Management}, volume = {15}, year = {2017}, note = {Export Date: 22 February 2018}, month = {2017}, pages = {1 - 6}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85016500198\&partnerID=40\&md5=5fffc49e324bc3aea22d6f102ff4b293}, author = {Bai, L. and Jia, Z. and Liu, J.} } @article {486, title = {Geographic information system-based PROMETHEE II method: An approach for ranking industrial zones}, journal = {Journal of Digital Information Management}, volume = {15}, year = {2017}, note = {Export Date: 22 February 2018}, month = {2017}, pages = {148 - 158}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85021814656\&partnerID=40\&md5=69585f0d707204894044047cb634edaf}, author = {Taibi, A. and Atmani, B.} } @article {476, title = {High level mammographic information fusion for real world ontology population}, journal = {Journal of Digital Information Management}, volume = {15}, year = {2017}, note = {Export Date: 22 February 2018}, month = {2017}, pages = {259 - 271}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85036660676\&partnerID=40\&md5=8f5bfd1dfc3fb6b38f1340484f42e5a9}, author = {Salem, Y.B. and Idodi, R. and Ettabaa, K.S. and Hamrouni, K. and Solaiman, B.} } @article {482, title = {An improved K-means algorithm application in evaluating interactive mechanism of airline industry ecosystem stability}, journal = {Journal of Digital Information Management}, volume = {15}, year = {2017}, note = {Export Date: 22 February 2018}, month = {2017}, pages = {214 - 223}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85026645185\&partnerID=40\&md5=69b9fbf1add6f0310ff1a27d886a6d63}, author = {Liu, Q.} } @article {467, title = {Multicast optimization and node fast location search method for wireless sensor networks based on ant colony algorithm}, journal = {Journal of Digital Information Management}, volume = {15}, year = {2017}, note = {Export Date: 22 February 2018}, month = {2017}, pages = {303 - 311}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85041033655\&partnerID=40\&md5=96fc8eeac1d35f0e46d39f00d5a8e7f2}, author = {Wang, R. and He, G. and Wu, X. and Wang, F. and Hu, Y.} } @article {837, title = {Multicast Optimization and Node Fast Location Search Method for Wireless Sensor Networks Based on Ant Colony Algorithm-}, journal = {Journal of Digital Information Management}, volume = {15}, year = {2017}, month = {12/2017}, pages = {303-311}, type = {Research}, chapter = {303}, abstract = {

\ Wireless sensor network is a new information acquisition and processing technology. A large number of sensor nodes form a network through self-organization including each node integrates sensing unit, processing unit, communication unit and energy supply. The protocol multicast technology of wireless sensor network routing is a means of group communication, which requires information from the source node at the same time sent to multiple destination nodes, routing as the core technology of multimedia networks, its scope of study is extensive, including routing protocols, routing strategy and routing algorithms. In this paper, we mainly study the multicast routing algorithm which is based on Quality of Service (QoS), and introduce the search strategy which is based on the shortest path of pheromone in the process of ant colony feeding. MATLAB ant colony algorithm is also used in the WSN routing protocol multicast problem in the application of the problem solving for local optimization. The result of computer simulation shows that the ant colony algorithm has a better effect on solving the multicast protocol of WSN, and the algorithm can realize the fast positioning and query of wireless sensor network routing nodes.

}, doi = {http://dline.info/fpaper/jdim/v15i6/jdimv15i6_1.pdf}, author = {Ruiying Wang, Guoping He and Xiaoming Wu and Fuqiang Wang and Yifan Hu} } @article {491, title = {A network traffic classification method using support vector machine with feature weighted-degree}, journal = {Journal of Digital Information Management}, volume = {15}, year = {2017}, note = {Cited By :1Export Date: 22 February 2018}, month = {2017}, pages = {76 - 83}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85020185401\&partnerID=40\&md5=5b2daddc8a3004dd4eeab5a04b22b6b4}, author = {He, H.} } @article {494, title = {A new maturity model for the implementation of software process improvement in web-based projects}, journal = {Journal of Digital Information Management}, volume = {15}, year = {2017}, note = {Export Date: 22 February 2018}, month = {2017}, pages = {66 - 75}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85020164708\&partnerID=40\&md5=203c9c8ccf66da88bffbe4fdcb405e66}, author = {Al-Rousan, T. and Al-Shargabi, B.} } @article {497, title = {A novel approach for regularization of convolutional neural network}, journal = {Journal of Digital Information Management}, volume = {15}, year = {2017}, note = {Export Date: 22 February 2018}, month = {2017}, pages = {30 - 36}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85016461859\&partnerID=40\&md5=546e0229eda800292c211f2c58adf7b5}, author = {Zhang, Y. and Shi, B.} } @article {478, title = {OCC-mix approach for concurrent mixture of fixed and mobile transactions}, journal = {Journal of Digital Information Management}, volume = {15}, year = {2017}, note = {Export Date: 22 February 2018}, month = {2017}, pages = {272 - 288}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85036609704\&partnerID=40\&md5=302cae68771bb14fc6e5fdb2bfea7cbb}, author = {Al-Qerem, A. and Hamarsheh, A. and Nashwan, S.} } @article {466, title = {Research on flexible customization of business function for intelligent traffic cloud platform}, journal = {Journal of Digital Information Management}, volume = {15}, year = {2017}, note = {Export Date: 22 February 2018}, month = {2017}, pages = {312 - 319}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85041029410\&partnerID=40\&md5=4bd92bd9fccdbba84441a3fd6d5cfca8}, author = {Pan, H. and Huang, Z. and He, Z.} } @article {838, title = {Research on Flexible Customization of Business Function for Intelligent Traffic Cloud Platform-}, journal = {Journal of Digital Information Management}, volume = {15}, year = {2017}, month = {12/2017}, pages = {319}, type = {Research}, chapter = {312}, abstract = {

\ According to the flexible customization requirements of Intelligent Traffic Cloud Platform business function, this paper proposed the flexible customized solutions of Intelligent Traffic Cloud Platform based on the business function framework of the existing Intelligent Traffic Cloud Platform. The plan regards the platform business function design and implementation of flexible customization model as the core. The storage of business function customization model is realized based on XML technology. It designs the driving strategy of flexible customization model and realizes the flexible customization of platform business functions. Finally, the feasibility and effectiveness of the proposed scheme is verified by a specific service function on the Intelligent Traffic Cloud Platform.

}, doi = {http://dline.info/fpaper/jdim/v15i6/jdimv15i6_2.pdf}, author = {Hua Pan and Zhongxiang Huang and Zengzhen He} } @article {479, title = {Research on the building of emotion metaphor corpus based on machine translation}, journal = {Journal of Digital Information Management}, volume = {15}, year = {2017}, note = {Export Date: 22 February 2018}, month = {2017}, pages = {224 - 229}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85026655786\&partnerID=40\&md5=7cbd7dc7d8602ee1b00eeba25a5aaff4}, author = {Jiang, X.} } @article {475, title = {Study on digital image inpainting method based on multispectral image texture synthesis}, journal = {Journal of Digital Information Management}, volume = {15}, year = {2017}, note = {Export Date: 22 February 2018}, month = {2017}, pages = {251 - 258}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85036655486\&partnerID=40\&md5=87cd3fb02681716474621172e64e05b9}, author = {Zhaoyang, J. and Guangxue, C.} } @article {492, title = {Teaching the microprocessors systems focused on societal challenges: Designing of performant cache replacement algorithms as green information technology (IT) solution}, journal = {Journal of Digital Information Management}, volume = {15}, year = {2017}, note = {Export Date: 22 February 2018}, month = {2017}, pages = {50 - 65}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85020164372\&partnerID=40\&md5=5ca281296ef54d45e85776b0e48b0ee9}, author = {Florea, A.} } @article {483, title = {Temporal JSON schema versioning in the TJSchema framework}, journal = {Journal of Digital Information Management}, volume = {15}, year = {2017}, note = {Export Date: 22 February 2018}, month = {2017}, pages = {179 - 202}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85026631105\&partnerID=40\&md5=857d828ea22094d110f2391a970dc431}, author = {Brahmia, S. and Brahmia, Z. and Grandi, F. and Bouaziz, R.} } @article {842, title = {Three-stage Short Text Language Identification Algorithm-}, journal = {Journal of Digital Information Management}, volume = {16}, year = {2017}, month = {12/2017}, pages = {354-372}, type = {Research}, chapter = {354}, abstract = {

Text on the internet is written in different languages and scripts, and a language identification system is used to analyze and identify them. To improve the performance of text language identification, this paper proposes a three-stage short text language identification algorithm. The script of a given text is identified in the first stage of the algorithm. The language group to which it belongs, consisting of languages written in the same script, is identified in the second stage. In the third stage, the specific language of the given text is recognized from within the language group. Experimental results showed that our proposed method improves the accuracy of text language identification systems stage by stage, reduces the time and the size of the feature set needed to make a prediction, and achieves optimal accuracy.

}, author = {Maimaitiyiming Hasimu and Wushour Silamu} } @article {468, title = {Three-stage short text language identification algorithm}, journal = {Journal of Digital Information Management}, volume = {15}, year = {2017}, note = {Export Date: 22 February 2018}, month = {2017}, pages = {354 - 371}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85041035271\&partnerID=40\&md5=b3b2585d7913f83defb20aecb4f1cbbb}, author = {Hasimu, M. and Silamu, W.} } @article {841, title = {Using Temporal Bayesian Networks to Model user Profile Evolution}, journal = {Journal of Digital Information Management}, volume = {15}, year = {2017}, month = {12/2017}, pages = {339-353}, type = {Research}, chapter = {339}, abstract = {

Modeling the user profile can be the first step towards personalization of information search. The user profile refers to his/her interests built across his/her interactions with the information retrieval system. It could be inferred from the recent search history limited to a single search session, during a short period of time to model short term user interests. On the other hand, from the whole search history, to model long term ones stable for a long time. In this paper, we present a personalized information retrieval approach for building and updating the user profile, based on Temporal Bayesian network. The theoretical framework provided by these networks allows better capturing and exploiting the change of user interests over time. Experiments carried out on TREC-1 ad hoc and TREC 2011 session Track collections show that our approach achieves significant improvements over a personalized search approach described in the state of the art and also to a baseline search information process that do not consider the user profile.

}, url = {http://dline.info/fpaper/jdim/v15i6/jdimv15i6_5.pdf}, author = {Farida Achemoukh and Rachid Ahmed-Ouamer} } @article {472, title = {Using temporal Bayesian networks to model user profile evolution}, journal = {Journal of Digital Information Management}, volume = {15}, year = {2017}, note = {Export Date: 22 February 2018}, month = {2017}, pages = {339 - 353}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85041072700\&partnerID=40\&md5=46aee7b47be825e91bb8678ff17ee3d5}, author = {Achemoukh, F. and Ahmed-Ouamer, R.} } @article {515, title = {Algorithm for coding unit partition in 3D animation using high efficiency video coding based on Canny operator segment}, journal = {Journal of Digital Information Management}, volume = {14}, year = {2016}, note = {Cited By :2Export Date: 22 February 2018}, month = {2016}, pages = {237 - 245}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84991688577\&partnerID=40\&md5=e79dd6271010e213a188565709bc9824}, author = {Zhao, H. and Li, J.-B. and Zeng, X.-Y.} } @article {501, title = {Analysis on cloud data service platform for digital oilfields}, journal = {Journal of Digital Information Management}, volume = {14}, year = {2016}, note = {Export Date: 22 February 2018}, month = {2016}, pages = {413 - 422}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85011003724\&partnerID=40\&md5=b4b0c49bf0677be5bce7f05b7c7bc5ae}, author = {Zhu, Z.-P. and Pan, R.-F. and Chen, Z. and Li, G.-Q. and Zheng, G.-S.} } @article {536, title = {Application of K-means algorithm to web text mining based on average density optimization}, journal = {Journal of Digital Information Management}, volume = {14}, year = {2016}, note = {Cited By :1Export Date: 22 February 2018}, month = {2016}, pages = {41 - 46}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84969799196\&partnerID=40\&md5=94816cbcc150372d5cf67b43d1d23d52}, author = {Fan, G.-L. and Liu, Y.-W. and Tong, J.-Q. and Zhao, S.-H. and Nie, Z.-Q.} } @article {531, title = {Application of the codes of a polynomial residue number system, aimed at reducing the effects of failures in the AES cipher}, journal = {Journal of Digital Information Management}, volume = {14}, year = {2016}, note = {Cited By :3Export Date: 22 February 2018}, month = {2016}, pages = {114 - 123}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84974777732\&partnerID=40\&md5=9ab931f59e7bead6ed7bd8b898956624}, author = {Stepanova, E.P. and Kalmykov, I.A. and Toporkova, E.V. and Rezenkov, D.N.} } @article {504, title = {Applying the multi-objective optimization techniques in the design of suspension systems}, journal = {Journal of Digital Information Management}, volume = {14}, year = {2016}, note = {Cited By :1Export Date: 22 February 2018}, month = {2016}, pages = {351 - 367}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85010992362\&partnerID=40\&md5=c5723e86407f60eee4bf2019fcd66358}, author = {Florea, A. and Cofaru, I.I. and Roman, L. and Cofaru, N.} } @article {524, title = {Blind identification algorithm of photorealistic computer grapic based on weber local features}, journal = {Journal of Digital Information Management}, volume = {14}, year = {2016}, note = {Export Date: 22 February 2018}, month = {2016}, pages = {210 - 217}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84982833343\&partnerID=40\&md5=2f16ed2cb0851344b87d839654337da6}, author = {Xicheng, L. and Jianzhong, X.} } @article {507, title = {A cloud-assisted architecture for content distribution in mobile peer to peer networks}, journal = {Journal of Digital Information Management}, volume = {14}, year = {2016}, note = {Cited By :1Export Date: 22 February 2018}, month = {2016}, pages = {403 - 412}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85010972068\&partnerID=40\&md5=478dd69ec164325e2daff594a03ec7d0}, author = {Liu, Y.-N. and Chen, H.-Y. and Gilani, S.M.M.} } @article {521, title = {A clustering with slope algorithm based on mapreduce}, journal = {Journal of Digital Information Management}, volume = {14}, year = {2016}, note = {Export Date: 22 February 2018}, month = {2016}, pages = {168 - 176}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84982801686\&partnerID=40\&md5=59c334c0b1dd3e8b94a3cc75d5785e89}, author = {Wang, Y. and Wu, H. and Liang, J. and Ou, J. and Huang, Y.} } @article {509, title = {A combination indexing for image social bookmarking system to improve search results}, journal = {Journal of Digital Information Management}, volume = {14}, year = {2016}, note = {Export Date: 22 February 2018}, month = {2016}, pages = {423 - 431}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85010950546\&partnerID=40\&md5=b3aac0163118ba5aa45d79a62ae9fd25}, author = {Jomsri, P.} } @article {519, title = {Construction of trust based dynamic access control model in P2P network environment}, journal = {Journal of Digital Information Management}, volume = {14}, year = {2016}, note = {Export Date: 22 February 2018}, month = {2016}, pages = {194 - 198}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84982850708\&partnerID=40\&md5=d1a82b733bccde27611b24bd80b75668}, author = {Han, Y. and Cui, X.} } @article {538, title = {Data and text mining techniques for classifying Arabic tweet polarity}, journal = {Journal of Digital Information Management}, volume = {14}, year = {2016}, note = {Cited By :4Export Date: 22 February 2018}, month = {2016}, pages = {15 - 25}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84969780164\&partnerID=40\&md5=57719abacdba72ad8002405b928bfc8b}, author = {Brahimi, B. and Touahria, M. and Tari, A.} } @article {510, title = {Development of the method for integration of mobile applications and corporate information systems}, journal = {Journal of Digital Information Management}, volume = {14}, year = {2016}, note = {Export Date: 22 February 2018}, month = {2016}, pages = {322 - 332}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85006152467\&partnerID=40\&md5=89b1522129dfd8af6d4064d4d5346f53}, author = {Ptitsyn, P.S. and Radko, D.V. and Skrypnikov, A.V.} } @article {542, title = {Digital image clustering algorithm based on multi-agent center optimization}, journal = {Journal of Digital Information Management}, volume = {14}, year = {2016}, note = {Cited By :1Export Date: 22 February 2018}, month = {2016}, pages = {8 - 14}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84969758522\&partnerID=40\&md5=3b83fba746d28c99ce7100ced473ba0d}, author = {Pan, X. and Sagan, H.} } @article {547, title = {Digital Information Research Foundation: 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-85006862423\&partnerID=40\&md5=537a5ec9b4885f0aef8f74a9635587cb} } @article {505, title = {DVM-based topic detection for microblog}, journal = {Journal of Digital Information Management}, volume = {14}, year = {2016}, note = {Export Date: 22 February 2018}, month = {2016}, pages = {383 - 391}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85010949216\&partnerID=40\&md5=25b19644aeefdf985af20e330561f8dd}, author = {Lv, J.-G. and Jiang, X.-Y. and Chi, Q.-Y. and Wei, Z. and Jocshi, 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 {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 {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 {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 {518, title = {High-performance computer system based on CPU/GPU isomeric architecture parallel algorithm}, journal = {Journal of Digital Information Management}, volume = {14}, year = {2016}, note = {Export Date: 22 February 2018}, month = {2016}, pages = {218 - 223}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84982812315\&partnerID=40\&md5=30bd9688e827a922977566f2a2b0344d}, author = {Jiang, H.} } @article {520, title = {Hot topic extraction and public opinion classification of tibetan texts}, journal = {Journal of Digital Information Management}, volume = {14}, year = {2016}, note = {Export Date: 22 February 2018}, month = {2016}, pages = {160 - 167}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84982786667\&partnerID=40\&md5=65894d6a0354bc43e13d953109c62b93}, author = {Xu, G. and Qiu, L. and Peng, X.} } @article {525, title = {Image fusion based on WRV and NHM rules for medical digital image in contourlet domain}, journal = {Journal of Digital Information Management}, volume = {14}, year = {2016}, note = {Cited By :1Export Date: 22 February 2018}, month = {2016}, pages = {151 - 159}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84982840475\&partnerID=40\&md5=9ce1fb8c2ef06112889a547afa917d4e}, author = {Wang, J. and Lai, S. and Borjer, T.H.} } @article {502, title = {Improved Convolutional Neural Network for biomedical word sense disambiguation with enhanced context feature modeling}, journal = {Journal of Digital Information Management}, volume = {14}, year = {2016}, note = {Export Date: 22 February 2018}, month = {2016}, pages = {342 - 350}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85010950516\&partnerID=40\&md5=976019ac152af0c2f33880cb6ca688a6}, author = {Ren, K. and Wang, S.-W.} } @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 {533, title = {An improved SMOTE algorithm based on genetic algorithm for imbalanced data classification}, journal = {Journal of Digital Information Management}, volume = {14}, year = {2016}, note = {Cited By :2Export Date: 22 February 2018}, month = {2016}, pages = {92 - 103}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84974814392\&partnerID=40\&md5=8541ce719ff30daad12313b47f996454}, author = {Gu, Q. and Wang, X.-M. and Wu, Z. and Ning, B. and Xin, C.-S.} } @article {535, title = {Intuitionistic fuzzy Petri nets for knowledge representation and reasoning}, journal = {Journal of Digital Information Management}, volume = {14}, year = {2016}, note = {Cited By :2Export Date: 22 February 2018}, month = {2016}, pages = {104 - 113}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84974817409\&partnerID=40\&md5=d032ac3e4f411c8d29c603f648b24755}, author = {Meng, F.-X. and Lei, Y.-J. and Zhang, B. and Shen, X.-Y. and Zhao, J.-Y.} } @article {543, title = {Journal of Digital Information Management: 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-84969812410\&partnerID=40\&md5=1a3b50b24491f1db8e8249b5f937c410} } @article {523, title = {Keyword extraction from Chinese text based on multidimensional weighted features}, journal = {Journal of Digital Information Management}, volume = {14}, year = {2016}, note = {Cited By :1Export Date: 22 February 2018}, month = {2016}, pages = {177 - 183}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84982833307\&partnerID=40\&md5=21b1c4d3d08f73e83fe646df1ec10e91}, author = {Jian, Y.} } @article {546, title = {Model of e-commerce cloud warehouse grading based on mass simulation data}, journal = {Journal of Digital Information Management}, volume = {14}, year = {2016}, note = {Export Date: 22 February 2018}, month = {2016}, pages = {311 - 321}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85006846917\&partnerID=40\&md5=31b0b8c45c1082ef2e532a89c8699927}, author = {Wang, F. and Wang, Y.-L. and Liu, Z.-J. and Cui, X. and Zhang, P.} } @article {512, title = {Modeling the evolution of collaboration network and knowledge network and their effects on knowledge flow through social network analysis}, journal = {Journal of Digital Information Management}, volume = {14}, year = {2016}, note = {Cited By :4Export Date: 22 February 2018}, month = {2016}, pages = {246 - 254}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84991694298\&partnerID=40\&md5=427e307104a58f9c53dfc82d364d3a94}, author = {Zhang, Y.-R. and Ma, D.} } @article {517, title = {New clustering algorithm for multidimensional data}, journal = {Journal of Digital Information Management}, volume = {14}, year = {2016}, note = {Export Date: 22 February 2018}, month = {2016}, pages = {255 - 262}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84991716924\&partnerID=40\&md5=4ea7d8f5df341e1c97837cd8fa674428}, author = {Fan, L. and Zhong, J.} } @article {548, title = {A new method of simulating swarms and herds using PSO and other additions: A social behavior approach}, journal = {Journal of Digital Information Management}, volume = {14}, year = {2016}, note = {Export Date: 22 February 2018}, month = {2016}, pages = {333 - 339}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85006846869\&partnerID=40\&md5=d0a08fd6cea0256498921702606dafb0}, author = {Alnahhas, A. and Al-Kabbani, A. and Alshami, E. and Alkhous, A.} } @article {529, title = {A novel algorithm for classification rule discovery based on concept granule structure}, journal = {Journal of Digital Information Management}, volume = {14}, year = {2016}, note = {Export Date: 22 February 2018}, month = {2016}, pages = {73 - 80}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84974822488\&partnerID=40\&md5=7219cd436198c3dcaeb1e0b7914d411e}, author = {Jian, Z. and Kong, L.} } @article {514, title = {A novel digital image classification algorithm via low-rank sparse bag-of-features model}, journal = {Journal of Digital Information Management}, volume = {14}, year = {2016}, note = {Export Date: 22 February 2018}, month = {2016}, pages = {227 - 236}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84991711411\&partnerID=40\&md5=4cf33f1f8c9b9d91db67d686facdeffd}, author = {Zou, X.-M. and Sun, H.-J. and Yang, S. and Zhu, Y.} } @article {534, title = {A novel recommendation strategy for user-based collaborative filtering in intelligent marketing}, journal = {Journal of Digital Information Management}, volume = {14}, year = {2016}, note = {Export Date: 22 February 2018}, month = {2016}, pages = {81 - 91}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84974784671\&partnerID=40\&md5=a48f248084cf977768be0931a9ac4d89}, author = {Yi, J. and Zhang, L. and Phelan, C.A.} } @article {528, title = {Plagiarism detection in Arabic documents: Approaches, architecture and systems}, journal = {Journal of Digital Information Management}, volume = {14}, year = {2016}, note = {Cited By :1Export Date: 22 February 2018}, month = {2016}, pages = {124 - 135}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84974801172\&partnerID=40\&md5=5284a71ab939f31aa1edb2b12f371134}, author = {Kahloula, B. and Berri, J.} } @article {537, title = {Research on power dispatching automation system for data management of power plant substation}, journal = {Journal of Digital Information Management}, volume = {14}, year = {2016}, note = {Cited By :1Export Date: 22 February 2018}, month = {2016}, pages = {47 - 51}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84969771426\&partnerID=40\&md5=0a06da909e6eb87ef97d087705a699c9}, author = {Li, H. and Zhu, Q. and Yang, F.} } @article {527, title = {Risk evaluation of information exchange among nodes under P2P net work environment}, journal = {Journal of Digital Information Management}, volume = {14}, year = {2016}, note = {Export Date: 22 February 2018}, month = {2016}, pages = {199 - 203}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84982861472\&partnerID=40\&md5=2afb4669d2ac571cc863d12802023a6b}, author = {Yingjun, H. and Xiaoyang, W.} } @article {508, title = {Selection problem of Cloud solution for big data accessing: Fuzzy AHP-PROMETHEE as a proposed methodology}, journal = {Journal of Digital Information Management}, volume = {14}, year = {2016}, note = {Export Date: 22 February 2018}, month = {2016}, pages = {368 - 382}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85010966355\&partnerID=40\&md5=4f3167a86b6e54545dc4826982f49ca6}, author = {Boutkhoum, O. and Hanine, M. and Agouti, T. and Tikniouine, A.} } @article {544, title = {Sentence-level opinion analysis for Chinese news documents based on sentiment information of social tags}, journal = {Journal of Digital Information Management}, volume = {14}, year = {2016}, note = {Export Date: 22 February 2018}, month = {2016}, pages = {52 - 62}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84969813520\&partnerID=40\&md5=48d1a14dad93d4235d4983212eabb14c}, author = {Yeh, J.-Y. and Chen, S.-Y.} } @article {532, title = {Study on the classification of negative sentiment Weibo messages in the post-disaster situation}, journal = {Journal of Digital Information Management}, volume = {14}, year = {2016}, note = {Cited By :1Export Date: 22 February 2018}, month = {2016}, pages = {136 - 142}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84974844215\&partnerID=40\&md5=6406c8db9847b799a50f4615768557f6}, author = {Bai, H. and Yu, G. and Tian, X.Y.} } @article {526, title = {Study on the training system of legal on proceeding business based the prototyping method and object-oriented systematic analysis method}, journal = {Journal of Digital Information Management}, volume = {14}, year = {2016}, note = {Export Date: 22 February 2018}, month = {2016}, pages = {204 - 209}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84982791250\&partnerID=40\&md5=ec943f5ffc22d260f5d11a043a258106}, author = {Fan, G. and Liu, Y.} } @article {545, title = {A systematic approach for changing XML namespaces in XML schemas and managing their effects on associated XML documents under schema versioning}, journal = {Journal of Digital Information Management}, volume = {14}, year = {2016}, note = {Export Date: 22 February 2018}, month = {2016}, pages = {275 - 289}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85006957183\&partnerID=40\&md5=86f720e96986f3731d3e5138d1ad8ff9}, author = {Brahmia, Z. and Grandi, F. and Bouaziz, R.} } @article {541, title = {Technological relatedness based on co-classification network analysis: A case study on electricity sector}, journal = {Journal of Digital Information Management}, volume = {14}, year = {2016}, note = {Export Date: 22 February 2018}, month = {2016}, pages = {26 - 32}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84969776908\&partnerID=40\&md5=6479b8e4f2d84118e5b1591e47ca376a}, author = {Wen, F.-F.} } @article {522, title = {A three-tier model for structuring of scientific and technical information}, journal = {Journal of Digital Information Management}, volume = {14}, year = {2016}, note = {Export Date: 22 February 2018}, month = {2016}, pages = {184 - 193}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84982841003\&partnerID=40\&md5=103a8995f5b0a7da7a0a3ddad3e28ca7}, author = {Artamonov, A.A. and Ananieva, A.G. and Tretyakov, E.S. and Kshnyakov, D.O. and Onykiy, B.N. and Pronicheva, L.V.} } @article {540, title = {Trajectory prediction of vessels based on data mining and machine learning}, journal = {Journal of Digital Information Management}, volume = {14}, year = {2016}, note = {Cited By :3Export Date: 22 February 2018}, month = {2016}, pages = {33 - 40}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84969857942\&partnerID=40\&md5=e96a78463c16dcccf34d6c8b1511f98b}, author = {Qi, L. and Zheng, Z.} } @article {513, title = {The use of the streaming data transmission from a Web browser to enhance the work efficiency of the contact center operators}, journal = {Journal of Digital Information Management}, volume = {14}, year = {2016}, note = {Export Date: 22 February 2018}, month = {2016}, pages = {263 - 268}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84991677478\&partnerID=40\&md5=64f220c683cc032b6d2a2a63f73efb87}, author = {Teykhrib, A.P.} } @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 {554, title = {Adoption of management information systems in context of yemeni organizations: A structural equation modeling approach}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Export Date: 22 February 2018}, month = {2015}, pages = {429 - 444}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84959206334\&partnerID=40\&md5=afff15087d94541bc0e6a6237a44dfb7}, author = {Al-Mamary, Y.H. and Shamsuddin, A. and Hamid, N.A.A. and Al-Maamari, M.H.} } @article {587, title = {Advances in secure communication and information processing systems}, 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-84942531727\&partnerID=40\&md5=ec068ff353213713be8f563709ba559c}, author = {Xhafa, F. and Li, J.} } @article {570, title = {Algorithm on Evaluation of Atmospheric Inhalable Particles in Beijing based on Extension Neural Network}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Cited By :2Export Date: 22 February 2018}, month = {2015}, pages = {361 - 366}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84959857928\&partnerID=40\&md5=34cd3000e93aaa6ed0b53b165ad43dfa}, author = {Chen, M.} } @article {561, title = {Application of a NewmAnt-MinerPRAlgorithm in Classification Rule Mining}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Export Date: 22 February 2018}, month = {2015}, pages = {311 - 320}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84959855322\&partnerID=40\&md5=063496b12a1e92c72d123e5a9f9044f3}, author = {Yang, L. and Li, K.S. and Zhang, W.S. and Wang, Y. and Ke, Z.X.} } @article {550, title = {Application of radio frequency identification devices technology in vehicle logistics electronic transfer system and logistics management data errors}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Export Date: 22 February 2018}, month = {2015}, pages = {467 - 471}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84959212045\&partnerID=40\&md5=7b08e570be9c82b3c1d9b2df635f8a0c}, author = {Liang, Y.} } @article {563, title = {Application of Word Embeddings in Biomedical Named Entity Recognition Tasks}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Cited By :3Export Date: 22 February 2018}, month = {2015}, pages = {321 - 327}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84959857144\&partnerID=40\&md5=efd3cf470dbf495aa4ca4561b2af31b8}, author = {Chang, F.X. and Guo, J. and Xu, W.R. and Chung, S.R.} } @article {572, title = {Automated DD-path Testing and its Significance in SDLC Phases}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Export Date: 22 February 2018}, month = {2015}, pages = {337 - 345}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84959857875\&partnerID=40\&md5=24005bd30448b154b2db6221bfadc4e1}, author = {Sattar, H. and Bajwa, I.S. and Shafi, U.F.} } @article {601, title = {A basic comparative framework for evaluation of digital identifier systems}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Cited By :5Export Date: 22 February 2018}, month = {2015}, pages = {190 - 197}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84938569694\&partnerID=40\&md5=abbe6643b61fe841d85b77249398dc00}, author = {Khedmatgozar, H.R. and Alipour-Hafezi, M.} } @article {597, title = {Cloud-based government procurement information integration platform}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Cited By :2Export Date: 22 February 2018}, month = {2015}, pages = {147 - 155}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84938587940\&partnerID=40\&md5=a0687e73f079a9f60c27328d138c7b97}, author = {Wang, P.Y. and Shen, J. and Guo, W.Q. and Zhang, C. and Zhang, B.} } @article {606, title = {Clustering research across Tibetan and Chinese texts}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Export Date: 22 February 2018}, month = {2015}, pages = {162 - 168}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84938597690\&partnerID=40\&md5=a971739a5ed7e44e809f090f4dd4ade8}, author = {Xu, G.X. and Sun, W. and Peng, X.P.} } @article {578, title = {Collection and selection based relevant degrees of documents}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Cited By :1Export Date: 22 February 2018}, month = {2015}, pages = {110 - 119}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84930388004\&partnerID=40\&md5=d5169e26b597ad1d23dfecfc8ece9fe3}, author = {Kheira, M. and Lougmiri, Z. and Kamel, A.M.} } @article {577, title = {Computer graphics algorithm based on visualization teaching theory}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Cited By :1Export Date: 22 February 2018}, month = {2015}, pages = {137 - 141}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84938590017\&partnerID=40\&md5=7ae622ba1163d0246f51519817a5ff89}, author = {Wang, 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 {566, title = {Construction of a Port Logistics Information Platform Based on J2EE: Taking Dushan Port of Jiaxing as an Example}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Export Date: 22 February 2018}, month = {2015}, pages = {328 - 336}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84959855788\&partnerID=40\&md5=f78c983c5c37a00819a1a87b052b4c6f}, author = {Shen, Y.Y. and He, A.T.} } @article {613, title = {Cooperation based on decode-and-forward plus cooperative jamming for wireless physical layer security}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Cited By :1Export Date: 22 February 2018}, month = {2015}, pages = {92 - 100}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84930397335\&partnerID=40\&md5=2c00e27b64c466fff5637cf109a53174}, author = {Huang, S. and Tan, J. and Jiang, R.} } @article {607, title = {Denoising and segmentation of digital feather image using mean shift algorithm}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Cited By :2Export Date: 22 February 2018}, month = {2015}, pages = {25 - 30}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84930363955\&partnerID=40\&md5=d65edfcff5e6774e9248ab177dbaed8d}, author = {Yue, H. and Cai, K. and Luo, B. and Jin, Y. and Zeng, Z.} } @article {593, title = {Differential evolution enhanced with composite population information based mutation operators}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Cited By :3Export Date: 22 February 2018}, month = {2015}, pages = {210 - 223}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84942511121\&partnerID=40\&md5=7309be081ccccb38955635c7e2c213ec}, author = {Liao, J. and Cai, Y. and Chen, Y. and Wang, T. and Tian, H.} } @article {600, title = {Digital audio resampling detection based on sparse representation classifier and periodicity of second derivative}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Export Date: 22 February 2018}, month = {2015}, pages = {101 - 109}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84930410136\&partnerID=40\&md5=cf411bb3b2ebf1796aab9b51593c4cb5}, author = {Xu, J. and Xia, J.} } @article {580, title = {Do online recommendations matter? - A multimodal investigation of Amazon{\textquoteright}s co-purchase network}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Export Date: 22 February 2018}, month = {2015}, pages = {176 - 184}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84938565677\&partnerID=40\&md5=a31c53e7ea274946578bb61428ef1ce9}, author = {Chen, H.M.} } @article {605, title = {DTLS for lightweight secure data streaming in the Internet of Things}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Cited By :1Export Date: 22 February 2018}, month = {2015}, pages = {247 - 255}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84942524746\&partnerID=40\&md5=744b96bc706ffe05ed4bd97951bf457b}, author = {Fisher, R. and Hancke, G.} } @article {598, title = {DynMapNoCSIM: A dynamic mapping SIMULATOR for network on chip based MPSoC}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Cited By :1Export Date: 22 February 2018}, month = {2015}, pages = {45 - 54}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84930319582\&partnerID=40\&md5=7b17f99ca500531c41690cd57bb94e25}, author = {Benhaoua, M.K. and Singh, A.K. and Benyamina, A.E.H. and Boulet, P.} } @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 {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 {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 {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 {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 {585, title = {A feature selection method to handle imbalanced data in text classification}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Cited By :1Export Date: 22 February 2018}, month = {2015}, pages = {169 - 175}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84938570184\&partnerID=40\&md5=ae4937f9352d817db15e4e6609735561}, author = {Chang, F. and Guo, J. and Xu, W. and Yao, K.} } @article {553, title = {Hybrid approach for project portfolio selection taking account of resources management and interactions between projects}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Export Date: 22 February 2018}, month = {2015}, pages = {451 - 461}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84959232725\&partnerID=40\&md5=dfb8c730a2a801c9e09550897ae0f3d3}, author = {Benaija, K. and Kjiri, L.} } @article {576, title = {A hybrid method to extract triggers in biomedical events}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Cited By :1Export Date: 22 February 2018}, month = {2015}, pages = {300 - 305}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84942513410\&partnerID=40\&md5=2e0586033f81cb3990ed8b5f9af40cb4}, author = {Wei, X. and Zhu, Q. and Lyu, C. and Ren, K. and Chen, B.} } @article {599, title = {Implementation and evaluation of division-based broadcasting system for webcast}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Cited By :4Export Date: 22 February 2018}, month = {2015}, pages = {234 - 246}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84942508437\&partnerID=40\&md5=36e8b45c02dd6dc84df523639afa8527}, author = {Gotoh, Y. and Kimura, A.} } @article {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 {584, title = {Influence of information technology on college piano course teaching model}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Export Date: 22 February 2018}, month = {2015}, pages = {185 - 189}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84938594099\&partnerID=40\&md5=427e01b0cae258db68fe5029db676c1d}, author = {Jin, Y.} } @article {582, title = {Intelligent embedded health care seat cushion of vision robot design by fuzzy neural network}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Export Date: 22 February 2018}, month = {2015}, pages = {120 - 125}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84930401978\&partnerID=40\&md5=bc2d96d93cfdaf239d1843e2b41e6cfe}, author = {Mon, Y.-J.} } @article {557, title = {Kernel fuzzy C-means clustering for word sense disambiguation in biomedical texts}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Cited By :5Export Date: 22 February 2018}, month = {2015}, pages = {411 - 420}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84959203977\&partnerID=40\&md5=9bc27e007ec898b6bf5ebe7335ceb612}, author = {Ren, K. and Ren, Y.F.} } @article {589, title = {A malicious peers detection framework for peer-to-peer systems}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Cited By :1Export Date: 22 February 2018}, month = {2015}, pages = {224 - 233}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84942519413\&partnerID=40\&md5=fc3039a25dbc94ef9afe8a2afb325e1b}, author = {Wei, X. and Fan, J. and Wang, T. and Wang, Q.} } @article {560, title = {Medical image retrieval based on an improved non-negative matrix factorization algorithm}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Export Date: 22 February 2018}, month = {2015}, pages = {421 - 428}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84959237960\&partnerID=40\&md5=ee501167cf7cb57cf0c511a61603a1a2}, author = {Wang, J. and Lai, S.Y. and Li, M.D. and Lies, D.H.} } @article {592, title = {Mining Frequent patterns through microaggregation in differential privacy}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Export Date: 22 February 2018}, month = {2015}, pages = {126 - 131}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84930403398\&partnerID=40\&md5=c7f34a551be4df7b2da2a9b9464c607b}, author = {Ni, Z. and Li, Q.M. and Liu, X.Q. and Li, T. and Hou, R.} } @article {568, title = {Model Computing System for Emergent Infectious Disease Prevention and Control Ability Evaluation of Medical Building Network}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Export Date: 22 February 2018}, month = {2015}, pages = {373 - 380}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84959857446\&partnerID=40\&md5=ad80f478bba0d7ef819f61056d0d1d02}, author = {Zhang, H. and Zhang, S. and Liu, N.} } @article {556, title = {A new color descriptor for content-based image retrieval: Application to COIL-100}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Export Date: 22 February 2018}, month = {2015}, pages = {472 - 479}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84959251166\&partnerID=40\&md5=71c911c1ef2325b8357c7a9122d8d329}, author = {El Asnaoui, K. and Chawki, Y. and Aksasse, B. and Ouanan, M.} } @article {594, title = {A new recognition approach for logical link blocks in webpages}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Export Date: 22 February 2018}, month = {2015}, pages = {76 - 85}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84930396310\&partnerID=40\&md5=4d563f444bd172f8c11110f370212a2a}, author = {Wang, X.M. and Wu, Z.D. and Huang, Y.N. and Gu, Q.} } @article {555, title = {A novel defect tracking algorithm for ink-jet printing video based on particle filter framework}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Export Date: 22 February 2018}, month = {2015}, pages = {405 - 410}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84959201190\&partnerID=40\&md5=5a43eb9e5b049c7ccbe814100c4f200c}, author = {Zhou, J.-N. and Feng, Z.-L. and Lin, Z.-H.} } @article {604, title = {A novel particle swarm optimization algorithm for network clustering}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Cited By :1Export Date: 22 February 2018}, month = {2015}, pages = {1 - 9}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84930347581\&partnerID=40\&md5=b7f3efd86055985fab003c63b133e03a}, author = {Li, Z. and He, L. and Li, Z. and Li, Y.} } @article {591, title = {Optimization of reconstruction of 2D medical images based on computer 3D reconstruction technology}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Cited By :2Export Date: 22 February 2018}, month = {2015}, pages = {142 - 146}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84938604272\&partnerID=40\&md5=1f0030c870b50621048bce878bc27d66}, author = {Liu, S. and Peng, J.} } @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 {565, title = {Recognizing Discrepant Traffic Data Based on Least Square Support Vector Machine}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Export Date: 22 February 2018}, month = {2015}, pages = {381 - 384}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84959856888\&partnerID=40\&md5=7cb3fbd419b2490aba4f5c026628003f}, author = {Yao, C. and Gu, J.} } @article {574, title = {The research of scale-free sensor network topology evolution based on cloud computing}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Cited By :1Export Date: 22 February 2018}, month = {2015}, pages = {266 - 275}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84942511265\&partnerID=40\&md5=9a5bc2cf6892f518d2988276246f2859}, author = {He, Y. and Zhang, W. and Jiang, N. and Li, L. and Luo, X.} } @article {569, title = {Research on Application of Digital Literature Archives Management Based on XML Database System}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Export Date: 22 February 2018}, month = {2015}, pages = {367 - 372}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84959853519\&partnerID=40\&md5=7889c5ca766e50d35f6bdcfec6fe6780}, author = {Yang, Y.} } @article {562, title = {Resource Allocation with Exponential Model Prediction for Server Virtualization}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Cited By :1Export Date: 22 February 2018}, month = {2015}, pages = {385 - 398}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84959858800\&partnerID=40\&md5=c2071f7fd5a13a3d062e5f6fe50386fe}, author = {Prangchumpol, D. and Sophatsathit, P. and Lursinsap, C. and Tantasanawong, P.} } @article {581, title = {An RFID Data cleaning strategy based on maximum entropy feature selection}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Export Date: 22 February 2018}, month = {2015}, pages = {86 - 91}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84930392305\&partnerID=40\&md5=9d8f3ec32b78855920a893ba7854bec2}, author = {Liu, Y. and Liu, Y.Z. and Zhang, H. and Li, T.} } @article {575, title = {A semantic approach to enhance HITS algorithm for extracting associated concepts using ConceptNet}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Cited By :1Export Date: 22 February 2018}, month = {2015}, pages = {55 - 62}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84930359429\&partnerID=40\&md5=627ea17640f272c8144f60205cfa14e4}, author = {Alsoos, M. and Kheirbek, A.} } @article {552, title = {Simulation study on the effect of employee mobility on the spreading of tacit knowledge among industrial enterprises based on the knowledge spreading model}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Cited By :2Export Date: 22 February 2018}, month = {2015}, pages = {445 - 450}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84959184125\&partnerID=40\&md5=8d279888fcea216ca2346d99c18ce71a}, author = {Zhu, H.M. and Zhang, S.T. and Lang, Y.J.} } @article {611, title = {Sina weibo incident monitor and Chinese disaster microblogging classification}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Cited By :3Export Date: 22 February 2018}, month = {2015}, pages = {156 - 161}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84938605096\&partnerID=40\&md5=0295a6e5d147150bd11644b6a64fd134}, author = {Bai, H. and Lin, X. and Robinsion, B. and Power, R.} } @article {595, title = {An SMS - Based one - Time - Password scheme with client - Side validation}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Export Date: 22 February 2018}, month = {2015}, pages = {69 - 75}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84930396014\&partnerID=40\&md5=25262d5aa35b7270c00ed1be30ba1565}, author = {Hwang, J.-J. and Hsu, Y.-C. and Liao, G.-Y.} } @article {583, title = {Study on the 3D information reconstruction and management of cultural relics based on the articulated arm scanner}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Cited By :1Export Date: 22 February 2018}, month = {2015}, pages = {31 - 38}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84930349218\&partnerID=40\&md5=53aa49c6b138faae7f80780d39bb0fde}, author = {Zhang, X.-D. and Hou, M.-L. and Hu, Y.-Y. and Zhang, X.-Q. and Wu, Y.-H.} } @article {610, title = {Tacit knowledge spreading based on knowledge spreading model on networks with consideration of intention mechanism}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Cited By :4Export Date: 22 February 2018}, month = {2015}, pages = {293 - 299}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84942525245\&partnerID=40\&md5=49327da3411a33f3822677a64952560c}, author = {Zhu, H.-M. and Zhang, S.-T. and Zhang, Y.-Y. and Wang, F. and Liu, K.} } @article {551, title = {Three-dimensional reconstruction of binocular stereo vision based on improved surf algorithm and KD-Tree matching algorithm}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Cited By :1Export Date: 22 February 2018}, month = {2015}, pages = {462 - 466}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84959226715\&partnerID=40\&md5=c7814fee292ae675ed8df9aa27700f4a}, author = {Cheng, J.} } @article {564, title = {Tibetan Word Sense Disambiguation Based on a Semantic knowledge Network Diagram}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Export Date: 22 February 2018}, month = {2015}, pages = {346 - 353}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84959854282\&partnerID=40\&md5=6ebfa5c50654802f8807568584d3d3e6}, author = {Qiu, L. and Jiang, X. and Ling, R.} } @article {567, title = {Understanding Geographical Space with Big Data: A Network Perspective}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Export Date: 22 February 2018}, month = {2015}, pages = {354 - 360}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84959853984\&partnerID=40\&md5=e14d86c5b381ac06445461758f94aef8}, author = {Mao, L. and Zheng, B. and Zhao, G. and Liu, L.} } @article {586, title = {The wavelength division multiplexing passive optical network breakpoint precision detection system based broadband chaos light}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Cited By :1Export Date: 22 February 2018}, month = {2015}, pages = {276 - 285}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84942510569\&partnerID=40\&md5=5c796d62fc66eaece2d1ef7fd3501ee7}, author = {Zou, D. and Zhang, Y.J.} } @article {608, title = {WSN-Based indoor location identification system (LIS) applied to vision robot designed by fuzzy neural network}, journal = {Journal of Digital Information Management}, volume = {13}, year = {2015}, note = {Cited By :1Export Date: 22 February 2018}, month = {2015}, pages = {39 - 44}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84930336145\&partnerID=40\&md5=41376161b34353ac9ef5039b0169fe76}, author = {Mon, Y.-J.} } @article {439, title = {Acupuncture system based on computer techniques and database diagnosis}, journal = {Journal of Digital Information Management}, volume = {12}, year = {2014}, note = {Export Date: 10 July 2014}, month = {2014}, pages = {93 - 101}, abstract = {The paper introduces the EA (electric acupuncture) treatment system based on expert database diagnosis technique. The system is a expert database of automatic reasoning diagnosis by the combining the maximum likelihood method and relation database. It integrates symbolic measurement theory, computer technology and electronic technology, which develops EA needling method by imitating classical acupuncture techniques. The system effectively achieves the integration of diagnosis and treatment.}, keywords = {Acupuncture, Content processing, EA (Electric acupuncture), Expert database, The maximum likelihood method, Video frame processing}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84903169031\&partnerID=40\&md5=043e6726f6964463af5cf04005a78a3d}, author = {Pei, S.-L.} } @article {447, title = {Adaptive fuzzy PID control for servo motor direct-drive pump control system}, journal = {Journal of Digital Information Management}, volume = {12}, year = {2014}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2014}, pages = {1 - 7}, abstract = {The direct-drive pump control system has been gradually applied to the industrial control field due to its high control precision, fast response, small throttle loss and compact structure. This paper adopts the fuzzy PID control method to resolve the hydraulic cylinder position servo control of direct-drive pump control system. The system model and fuzzy PID control algorithm was established by using AMEsim/Simulink joint simulation platform. The step response and Sine tracking performance of the system with PID and fuzzy PID control algorithms was investigated by simulation. At the same time, the performance of PID and fuzzy PID control was studied on the self-developed electro-hydraulic servo control experiment table. The results show that the adaptive fuzzy PID control can greatly improve the performance of the PID control, and has the characteristics of fast response, short rise time, small time delay and overshoot.}, keywords = {Adaptive fuzzy PID control, AMESim/simulink, Direct-drive pump control system, Labview, Position servo control}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84900429525\&partnerID=40\&md5=987ea43b8cb58e566d21061a4b7a3558}, author = {Zheng, J.-M. and He, M.-J. and Liu, E.-D. and Yuan, Q.-L. and Xiao, J.-M. and Tang, A.-F.} } @article {451, title = {Analysis of information management and scheduling technology in hadoop}, journal = {Journal of Digital Information Management}, volume = {12}, year = {2014}, note = {Export Date: 10 July 2014}, month = {2014}, pages = {133 - 138}, abstract = {Development of big data computing has brought many changes to society and social life is constantly digitized. {\textquoteright}How to handle vast amounts of data{\textquoteright} has become a more and more fashionable topic. Hadoop is a distributed computing software framework, which includes HDFS and MapReduce distributed computing method, make distributed processing huge amounts of data possible. Then job scheduler determines the efficiency of Hadoop clusters and user experience. Under the premise of familiar with the mechanism of Hadoop{\textquoteright}s running tasks, make a full analysis of the existing Hadoop task scheduling algorithm, such as FIFO-Scheduler, Capacity-Scheduler, FairShare-Scheduler and LATE-Scheduler, found that the existing scheduling algorithms do not perceive the performance of the computing node, so that it cannot assign different tasks depending on the machine performance in heterogeneous Hadoop cluster.}, keywords = {Cloud computing, Hadoop, Map Reduce, Task Scheduling}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84903118321\&partnerID=40\&md5=9c6201daf048bd5fc8d52c577eeb6126}, author = {Weihua, M. and Hong, Z. and Qianmu, L. and Bin, X.} } @article {455, title = {Campsna: A cloud assisted mobile peer to peer social network architecture}, journal = {Journal of Digital Information Management}, volume = {12}, year = {2014}, note = {Export Date: 10 July 2014}, month = {2014}, pages = {126 - 132}, abstract = {In the social network, people with same interest construct a group, where people can share their interesting contents. With the popularity of the mobile devices, mobile users can connect to the internet for services such as downloading videos, music and pictures anywhere at any time, which may cause heavy traffic burden on the core network. The service content (eg. video, picture, music) downloaded and shared in the same social network interest group may always be similar, which may lead to repeated traffic transmitted in a short time period; on the other hand, the size of the service content may be very large for a single user, which will take it along time and spend much money to finish a complete service request or sharing. It is necessary to study how to reduce the requests in internet from the mobile users to reduce the flow on the core network, as well as reducing the economic cost and the service time, which is the main motivation of our research. Based on the universal mobile social network architecture, this paper proposed CAMPSNA: a cloud assisted mobile peer to peer social network architecture. In which, the cloud center is introduced to help the mobile devices offloading complex tasks to the cloud. The end devices in the architecture construct a local mobile peer to peer network to share their existing content based on their social relationships to reduce the burden of the cloud center.}, keywords = {Data exchange, Mobile Cloud, Mobile peer to peer Network, Network Architecture, Social Network}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84903137451\&partnerID=40\&md5=eeaa0a8cdbbd54b68c6c7fb395d21692}, author = {Liu, Y.-N. and Tang, H. and Zhao, G.-F.} } @article {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 {448, title = {Implementing and evaluating a smart-M3 platform-based multi-vendor micropayment system pilot in the context of small business}, journal = {Journal of Digital Information Management}, volume = {12}, year = {2014}, note = {Export Date: 10 July 2014}, month = {2014}, pages = {44 - 51}, abstract = {Today, micropayment systems usage is highly topical. For example, applications of mobile micropayment systems are widely used and are well known by the public. The objective of this study was to implement a micropayment system pilot based on an interoperability enabling platform (in this case, Smart-M3) for small businesses with restricted resources, scarce labor force, and a growing number of products and vendors. In these small and medium-sized enterprise (SME) contexts, piloting systems of this kind is usually problematic because of its immediate impact on the core business and monetary transactions that are essential for SMEs. An account-based system was considered an appropriate starting point for the micropayment system pilot. The applicability of the Smart-M3 platform was then validated by the implementation of the system. Lastly, a summative evaluation was carried out by interviewing direct stakeholders, to enrich the observations from the validation. The results of the study show that the implemented system provides small businesses with opportunities to reduce costs and more efficiently use resources, adding new devices and systems, new ways to produce services, andreal-time tracking of the sales process, as well as utilization of the data collected from the system. From the customers{\textquoteright} point of view, the efficient use of resources may lead to more competitive prices of the products and services. Micropayment system usage can also be seen as a starting point for improved user experience, includingsafety, efficiency, and ease of use.}, keywords = {Electronic payment system, Micropayment, Multi-vendor, Smart-M3 platform}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84900390339\&partnerID=40\&md5=0dbddde65f1c4cabb8e7e74284b24fe5}, author = {Rohunen, A. and Etel{\"a}per{\"a}, M. and Liukkunen, K. and Tulppo, T. and Chan, K.W.} } @article {457, title = {An indirect security trust method based on credibility evaluation}, journal = {Journal of Digital Information Management}, volume = {12}, year = {2014}, note = {Export Date: 10 July 2014}, month = {2014}, pages = {139 - 150}, abstract = {In existing trust models, the recommending services often provide a single trust value (computed by them during their interaction with the unknown entity in question) as a recommendation. However, a single trust value recommended by a recommender represents its subjective opinion about the unknown entity and cannot depict the real trust level very well under certain circumstances. To solve this problem, a fuzzy based credibility evaluation method for indirect trust computation is proposed. The calculation method cannot just incorporate a mechanism to determine the weight each valid recommendation should carry on aggregation process, but also distinguish between honest and dishonest recommendations in the meantime.}, keywords = {Credibility Evaluation, Fuzzy based Evaluation, Indirect Recommendation, Reputation, Security Evaluation, Trust Mechanism}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84903216443\&partnerID=40\&md5=a59d1e2ce7d032c7b4f8031b81f95742}, author = {Xianghe, W. and Hong, Z. and Zhen, L. and Qianmu, L. and Bin, X.} } @article {442, title = {The influence of government intervention on logistics enterprise{\textquoteright}s adoption of information technology}, journal = {Journal of Digital Information Management}, volume = {12}, year = {2014}, note = {Export Date: 10 July 2014}, month = {2014}, pages = {8 - 17}, abstract = {With emphasizing the process of innovation, this paper classifies government intervention focused on innovation adoption into three dimensionalities: information support, financial support and personnel support. It also refines technological cognition into two aspects: perceived benefits including functional benefits and social benefits, and perceived costs including financial cost and risk. This paper develops an information technology adoption model of logistic enterprise for the context of government intervention, which based on the technology adoption theories of behavior perspective and follows the corresponding basic principle that government intervention affects adoption intention indirectly via technological cognition. Then, the study takes standard TMS and investigates some logistic enterprises in Zhejiang province to conduct empirical research. With collected 113 valid data, the author tests the model by regression analysis. The results demonstrate that adoption intention is affected by government intervention through technological cognition, and reveals the path in which different kinds of government intervention affect technological cognition.}, keywords = {Government intervention, Innovation policy, Logistics enterprise, Technology adoption}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84900452701\&partnerID=40\&md5=112750f1b798a63b5af1ec6502ed603a}, author = {Xiao, L. and Ma, X.} } @article {453, title = {The performance evaluation of university scientific research project management based on the FAHP}, journal = {Journal of Digital Information Management}, volume = {12}, year = {2014}, note = {Export Date: 10 July 2014}, month = {2014}, pages = {18 - 25}, abstract = {Along with the advance of scientific powers strategic of our country, all types and levels funding limit and quantity of college scientific research project have also increased constantly. It is very important to have complete, accurate and fair evaluations for university scientific research project management performance. Fuzzy analytic hierarchy process (FAHP) as a qualitative, a quantitative and comprehensive evaluation method can be able to evaluate the university scientific research project management performance effectively.}, keywords = {College research, Fuzzy analytic hierarchy process (FAHP), Fuzzy judgment matrix, Management performance evaluation}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84900456922\&partnerID=40\&md5=ce39e1cb0f995af4ded628027c5968ea}, author = {Wang, B. and Liu, D.} } @article {452, title = {Research on analysis of factors influencing terrestrial transmission efficiency of satellite data files}, journal = {Journal of Digital Information Management}, volume = {12}, year = {2014}, note = {Export Date: 10 July 2014}, month = {2014}, pages = {120 - 125}, abstract = {The paper firstly proposes two factors influencing transmission rate of satellite data file, the number of files and threads. The paper uses the control variate method to design the test scheme of the transmitting satellite data file, and changes the values of variables for lots of repeated tests to achieve the mean transmission time. And the paper compared the file transmission rate under three different variables, which draws the conclusion that the transmission efficiency of using single-file and multi-thread variable combination is the best. And the paper makes deep study on the selection of the number of threads. In the test environment of network delay of 50ms, the transmission time of using 3 or 4 threads to transmit data files is short, which proves that the number of threads transmitting files needs to be determined by the network environment.}, keywords = {Number of Files, Number of Threads, Satellite Data, Transmission, Transmission Efficiency, Transmission Time}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84903203624\&partnerID=40\&md5=f19f3afd8384101a14eb338817baff3c}, author = {Jing, Z.} } @article {454, title = {Research on application of image encryption technology based on chaotic of cellular neural network}, journal = {Journal of Digital Information Management}, volume = {12}, year = {2014}, note = {Export Date: 10 July 2014}, month = {2014}, pages = {151 - 158}, abstract = {This paper gives a brief introduction of the basic knowledge of Cellular Neural Networks and proposes an image encryption algorithm based on Cellular Neural Networks. The algorithm is based on the unique characteristics of Cellular Neural Networks by using a chaotic system of 5-D CNN as the key source. On this basis, The paper puts forward an image pixel scrambling algorithm based on Logistic chaotic sequence, which realize the image encryption. In this paper, encryption algorithms are programmed and stimulated. The results show that encryption image is the characters of higher pixels{\textquoteright} scrambling degree, small correlation between adjacent pixels, strong anti attack, higher security.}, keywords = {Cellular Neural Network (CNN), Chaotic System, Image Encryption}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84903142349\&partnerID=40\&md5=c7341677c7c2ee9af614f1ed54e5a66c}, author = {Li, G.-D. and Zhao, G.-M. and Xu, W.-X. and Yao, S.-Z.} } @article {456, title = {Research on ontology construction and information extraction technology based on wordnet}, journal = {Journal of Digital Information Management}, volume = {12}, year = {2014}, note = {Export Date: 10 July 2014}, month = {2014}, pages = {114 - 119}, abstract = {Introducing ontology in the field of information extraction can effectively improve the performance of information extraction. Ontology of college teachers{\textquoteright} resumes are constructed in the form three layers of ontology framework structure on the basis of exploring the related technologies and criterion for building ontology, the Racer inference engine is used for realizing the consistency and accuracy detection. WordNet similarity calculation method is improved on the basis of this, so that manual collection method can be integrated into WordNet semantic similarity, thus substantially improving this method. The test shows that the result precisions based on WordNet ontology construction and information extraction both see significant improvement, which sufficiently shows the feasibility and validity of the method.}, keywords = {Information processing, Ontology construction, Ontotology construction, Similarity calculation, Word net}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84903142066\&partnerID=40\&md5=34f76335049f1f44a30d7889f3b2dfd6}, author = {Hua, H.} } @article {445, title = {Research on the Application of SIFT Algorithm in UAV remote sensing image feature extraction}, journal = {Journal of Digital Information Management}, volume = {12}, year = {2014}, note = {Export Date: 10 July 2014}, month = {2014}, pages = {67 - 72}, abstract = {UAV remote sensing is characterized by fast speed and flexibility and applied widely. The extraction and matching for feature point of UAV image is a foundational work in the application of UAV remote sensing. SIFT is a currently widely used feature point extraction algorithm that keeps invariant as the scale changes. It is also invariant as image changes in other aspects. Meanwhile it maintains certain stability to noise and light changes. SIFT is a kind of compute-intensive mission and usually takes much time. The author made parallel processing for SIFT algorithm and good accelerator ratio has been achieved on the premise of ensuring good result of feature point extraction and matching.}, keywords = {Content processing, Feature point extraction, SIFT, UAV, Video frame processing}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84903184144\&partnerID=40\&md5=bddf4902f4b44d9155c7e7ef6b18bbbc}, author = {Yuan, D. and Cui, X. and Xu, W. and Hong, X. and Yu, S.} } @article {441, title = {Resolving rule conflicts based on Na{\"\i}ve Bayesian model for associative classification}, journal = {Journal of Digital Information Management}, volume = {12}, year = {2014}, note = {Export Date: 10 July 2014}, month = {2014}, pages = {36 - 43}, abstract = {The rule conflict is an important issue for associative classification due to a large set of rules. In this paper, a new approach called Associative Classification with Bayes (AC-Bayes) is proposed. To address rule conflicts, AC-Bayes has two distinguished features: (1) Associative classification is improved. (2) Na{\"\i}ve Bayesian model is applied in process of classification. A small set of high quality rules is generated by discovering not only frequent but mutual associated itemsets. Therefore, it will reduce the opportunities of rule conflicts. AC-Bayes also selects the best n rules to predict the class value of new instances. When rule conflicts are occurred, we collect those instances covered by these matched rules to form a new training set. Then, it scans new training set to compute the posterior probabilities of each class conditioned on the test instance. The class value that maximizes the posterior probability is assigned to the test instance. The experiments{\textquoteright} results show that the improved associative classification decreases significantly the number of rules and AC-Bayes has better average classification accuracy in comparison with associative classification and Na{\"\i}ve Bayesian classification.}, keywords = {Associative classification, Bayes, Data mining, Rule conflicts}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84900460217\&partnerID=40\&md5=bec565675923a67f04838dadf519210d}, author = {Huang, Z. and Zhou, Z. and He, T.} } @article {446, title = {A SEIR model epidemic of virus on the online social network}, journal = {Journal of Digital Information Management}, volume = {12}, year = {2014}, note = {Export Date: 10 July 2014}, month = {2014}, pages = {102 - 107}, abstract = {Vigorous development of computer technology has made computers play an integral role in people{\textquoteright}s lives, but at the same time propagation of the virus on a computer network also cost a great loss to the people. So the research on the mechanism of computer virus propagation and pointing out the key factors in the propagation of the virus has a significant influence on the prevention of computer virus and can also promote the development of relevant policies. The paper researched the influence of the user re-login frequency, the average number of friends on the user{\textquoteright}s friend list and the initial spread rate of the virus on the social networks during the epidemic of the propagation of the computer virus. By the means of mathematical analysis, an SEIR model to describe the epidemic of the virus on the online social network is established in this paper. The research shows that the re-login frequency of the user and the average friend number of the user would make a significant influence on the virus propagation. The two factors enhance the risk of a virus outbreak in the social network, at the same time.}, keywords = {Complex network, Computer virus, Epidemic spreading, Social Network, Social networks, Transmission factor, Virus propagation}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84903186303\&partnerID=40\&md5=6a9d4aa50e806dcc14698506b1e5b115}, author = {Min, Y. and Qianmu, L. and Yaoliang, S.} } @article {440, title = {Soft-404 pages, a crawling problem}, journal = {Journal of Digital Information Management}, volume = {12}, year = {2014}, note = {Export Date: 10 July 2014}, month = {2014}, pages = {73 - 92}, abstract = {During its traversal of the Web, crawler systems have to deal with multiple challenges. Some of them are related with detecting garbage content to avoid wasting resources processing it. Soft-404 pages are a type of garbage content generated when some web servers do not use the appropriate HTTP response code for death links making them to be incorrectly identified. Our analysis of the Web has revealed that 7.35\% of web servers send a 200 HTTP code when a request for an unknown document is received, instead of a 404 code, which indicates that the document is not found. This paper presents a system called Soft404Detector, based on web content analysis to identify web pages that are Soft-404 pages. Our system uses a set of content-based heuristics and combines them with a C4.5 classifier. For testing purposes, we built a Soft-404 pages dataset. Our experiments indicate that our system is very effective, achieving a precision of 0.992 and a recall of 0.980 at Soft-404 pages.}, keywords = {Algorithms, Data mining, Design, Link analysis, Performance, Soft-404 error, Statistical properties of the web, Web decay, Web spam}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84903202899\&partnerID=40\&md5=fa1bd1e59e4da6c413c6527da17e6e6b}, author = {Prieto, V.M. and {\'A}lvarez, M. and Cacheda, F.} } @article {450, title = {Study on college student credit evaluation and prediction based on RF algorithm}, journal = {Journal of Digital Information Management}, volume = {12}, year = {2014}, note = {Export Date: 10 July 2014}, month = {2014}, pages = {26 - 30}, abstract = {In the increasingly serious environment of employment of college students, the college student credit evaluation model taking into account of the "basic personal situation", "on-campus situation" and "economic situation" is employed in this paper for the purpose of improving the quality of college student credit education more efficiently, and in addition, a college student credit prediction mechanism based on the improved RF algorithm is put forward, seen from the test result, the accuracy of college student credit prediction of the algorithm is relatively high, and capable to make student credit education more targeted.}, keywords = {Credit evaluation, Prediction mode, Random forest algorithm}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84900433117\&partnerID=40\&md5=50b322efa1e0fc719d4244f770e8918a}, author = {Mu, J. and Xu, L. and Pu, H.} } @article {444, title = {Tensor graph-optimized linear discriminant analysis}, journal = {Journal of Digital Information Management}, volume = {12}, year = {2014}, note = {Export Date: 10 July 2014}, month = {2014}, pages = {31 - 35}, abstract = {Graph-based Fisher Analysis (GbFA) is proposed recently for dimensionality reduction, which has the powerful discriminant ability. However, GbFA is based on the matrix-to-vector way, which not only costs much but also loses spatial relations of pixels in images. Therefore, Tensor Graph-based Linear Discriminant Analysis (TGbLDA) is proposed in the paper. TGbLDA regards samples as data in tensor space and gets projection matrixes through the iteration way. Besides, TGbLDA inherits merits of GbFA. Experiments on Yale and YaleB face datasets demonstrate the effectiveness of our proposed algorithm.}, keywords = {Dimensionality reduction, Face recognition, Graph-based fisher discriminant analysis, Tensor data}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84900431732\&partnerID=40\&md5=cbccd93685522d83cd7e46df5728b797}, author = {Chen, J.} } @article {395, title = {Algorithm of distributed mining community structure used in sports psychology based on local information}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {248 - 255}, abstract = {The paper is studying and implementing a mining algorithm of community structure based on local information. When compared with the algorithm based on global information, our algorithm has a better performance on efficiency which only looses just a little accuracy. Firstly, we analyze the basic feature of community structure of complex network, then, lead to the character of community structure of complex network. Secondly, we introduce some previous work on complex networks and analyze some algorithms of community structure. Finally, we raise a new function to decide a certain node belongs to which community which based on the local modality raised by Clauset. We use the new function to improve the Bagrow algorithm and get a better result on accuracy and also get a new algorithm named Bagrow - β. After that we define two heuristic methods. According to the heuristic methods we created a new algorithm which called BLC algorithm. The new algorithm improves the speed of Bagrow-{\^a} algorithm while keeping the accuracy. Then we implement the algorithm with the model of MapReduce, and run the program on the Hadoop platform.}, keywords = {Community structure, Distributed mining, Local information, Sports psychology}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84880793261\&partnerID=40\&md5=88f2eaba1351c936f816b0f0b67ac7b4}, author = {Sidong, C.} } @article {376, title = {An algorithm of wavelet data compression based on wireless sensor network}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {54 - 61}, abstract = {Firstly, this paper gives a data aggregation algorithm based on learning automata to solve the problem that the existing data aggregation algorithm can{\textquoteright}t solve, the uneven energy cost, and the existing algorithm can{\textquoteright}t change the gathering path dynamically existing the overhead environment. In the proposed method, nodes can change its gathering path to adjust the overhead environment. All the nodes of WSN equipped with a learning automata. These leaning automata learn all the gathering path of the nodes. In the process of transmit information two kinds of data are transmitted, including data packet, knowledge packet .When the information of the nodes changes, according to the feedback of the nods, the learning automata gives the reward or punish to the current gathering path, which help to find the best gathering path. Secondly, this paper improved the wavelet data compression algorithm, which was brought out as the correlation between different data. The algorithm do not reduce much of the data relate to the original data. After the wavelet data compression, Huffman coding compression algorithm will improve the data compression ratio.}, keywords = {Data compression, Gatherting path, Hot node, Learning automata, Wavelet Transform}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84879075413\&partnerID=40\&md5=96bdcc7d815f35b35316761219475c3d}, author = {Luo, X.} } @article {390, title = {Algorithm research for supply chain demand prediction - Taking fresh agricultural product enterprises as example}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {160 - 164}, abstract = {Supply chain demand prediction plays a very important role for enterprises to realize sales and markets management target effectively, especially for fresh agricultural product enterprises. A new model for supply chain demand prediction for fresh agricultural product enterprises is presented based on improved BP neural network. First the advantages and disadvantages of BP neural network algorithm are analyzed when it is used in supply chain demand prediction; Second, Legendre wavelets algorithm is used to speed up the convergence and improve the prediction accuracy of original BP neural network algorithm and based on this the paper advances a new supply chain demand prediction model for fresh agricultural product enterprises. Finally, certain fresh agricultural product enterprise is taken for example to verify the validity and feasibility of the model and the experimental results show that the model can improve prediction accuracy and decrease the calculation time and can be used for supply chain demand prediction practically.}, keywords = {BP Neural Network, Legendre wavelets, Markets management, Supply chain demand prediction}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84879120765\&partnerID=40\&md5=78a05f213a7f4f86b41f6e014b4c897b}, author = {Wang, H.} } @article {410, title = {The analysis of network structure model and innovation network characteristics for industrial cluster: Using complicated network perspective}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {277 - 283}, abstract = {

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

}, keywords = {Industry cluster, Innovation network, Network structure model}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84888314006\&partnerID=40\&md5=b983e8753037ff953c725592163f7847}, author = {Qi, W.} } @article {414, title = {Application of finite volume method for solving two-dimensional Navier Stokes equations}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {321 - 326}, abstract = {The finite volume method combines the advantage of the finite element method and the finite difference method, while overcoming their shortcomings. This paper describes the development of the finite volume method and the process of using finite volume method for fluid calculations. Finally, this paper introduces the process of using improved finite volume method for solving the flow equations of NS.}, keywords = {Finite volume method, NS equations, Riemann}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84890477987\&partnerID=40\&md5=7acba40f69d1d5d175c6bb896216f1c4}, author = {Ni, J. and Wei, X.} } @article {372, title = {Approach to cultivate talents of information management under the combination of information and industrialization}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {25 - 32}, abstract = {High quality and multiplex talents of information management will be the key to decide the success of the combination of information and industrialization. In this paper, the connotation of Information and Industrialization Combination, which requirements to China{\textquoteright}s talents of information management was analyzed, and based on that, we suggested the talents training mode.}, keywords = {Information and industrialization, Information management, Talent cultivation mode}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84879088342\&partnerID=40\&md5=febc7bd890d5a8b95f7dc5834bb8aa76}, author = {Fen, L.} } @article {396, title = {Augmented broadcaster identity-based broadcast encryption}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {227 - 234}, abstract = {Identity-based Broadcast Encryption (IBBE) has the inherent key escrow problem that Private Key Generator (PKG) can fully determine the user{\textquoteright}s private key, which is an obstacle of the application of IBBE. The existing approaches to solving key escrow problem need the user to submit identity to multiple PKGs or interactions between PKG and the user in the private key extraction phase. For Point-to-Multipoint Identity-based Broadcast Encryption (P2MIBBE) that the computing capabilities of receiver are limited, these approaches are impracticable. We propose a new approach what we call Augmented Broadcaster Identity-based Broadcast Encryption (ABIBBE). It requires neither multiple PKGs nor calculation of receiver in the private key extraction phase. We construct a universal scheme to realize AB-IBBE, such that any IND-ID-CPA secure IBBE scheme can be extended to an IND-ID-CPA secure AB-IBBE scheme.}, keywords = {Identity-based broadcast encryption, Key escrow}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84880816896\&partnerID=40\&md5=1b3634203833f7e75593ce577d867ca5}, author = {Zhang, J. and Xu, Y. and Chen, Z.} } @article {429, title = {Bibliometrical analysis on the big data research in China}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {383 - 390}, abstract = {The author investigated the big data papers included China Academic Journal Network Publishing Database of CNKI from 2002 to 2012, with the help of multivariate statistical analysis tools SPSS17.0 of cluster analysis, multidimensional scaling analysis and visualization tools Ucinet6 from posting growth law, distribution of authors, research institutes distribution, periodical distribution, and high-frequency words such as multiple perspectives bibliometrical analysis and visualization analysis, the data reveal a large field of research status, and summarizes research characteristics,in order to study big data in-depth development and the future development of big data provide reference information.}, keywords = {Big Data, Cluster Analysis, Co-word analysis, Multidimensional Analysis, Visualization}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84892171702\&partnerID=40\&md5=aeba904bd887d86dc21fc4991f64a215}, author = {Ruixian, Y.} } @article {401, title = {The computer design of practical filter}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {175 - 178}, abstract = {This paper discussed how to use computer to directly transfer the simulative low pass prototype design to all kinds of needed principles and design methods. This method{\textquoteright}s advantage is that it is very direct, and universal. So, this method is simple, convenient, practical and fast.}, keywords = {Filter, Polynomial shift, Transform matrix}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84880791462\&partnerID=40\&md5=b00b61c35f2558a8a5cc5066cdb53b3d}, author = {Li, Z. and Weixi, Z.} } @article {406, title = {The design and implementation of library{\textquoteright}s user training system based on moodle}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {298 - 306}, abstract = {A personalized online library user training system is built. Users can do self-training, group discussions, self-testing, personal views etc in the system. To make a friendly interface of the system, users will get interested in learning various retrieval skills and other resources. Taking the Library of Mudanjiang Medical University as the example, we build a user training system based on Moodle. The framework of the system consists of three parts: system module, resource module and activity modules. By using the system, users can more effectively improve the user{\textquoteright}s information retrieval ability, better use of library resources, especially databases; libraries can expand the scope of user training, and enhance the communication between the users and the libraries.}, keywords = {Medical university library, Moodle, User training system}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84888380258\&partnerID=40\&md5=3c85e26ff123a30bec20f0933de4f6b3}, author = {Sun, Y. and Liu, C. and Cui, X.} } @article {394, title = {Design of a teaching robot based on fischertechnik model}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {190 - 193}, abstract = {This paper designed and developed a teaching robot - three degrees of freedom manipulator based on Fischer creative combination model platform. Firstly, the overall structure of the robot was analyzed to determine the drive programs, and then the manipulator structure was assembled and established in accordance with the modular design approach. Finally, the robot control system was studied. This paper focuses on the hardware design and control system of the robot. Practice has proved that the teaching robot we designed has the advantages of low cost, easy to regulation, good repeatability and it has good promotion and application prospects in the teaching field.}, keywords = {Fischechnik model, PLC control system, Teaching robot}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84880818201\&partnerID=40\&md5=ee65643ea046ef1e8cf9d62466a1f2b1}, author = {Li, Z. and Huang, Z.} } @article {435, title = {Differential evolution for rule extraction and its application in recognizing oil reservoir}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {435 - 440}, abstract = {The method of rule extraction based on differential evolution (DE-Rule) is proposed in this paper. The style of rule is IF-THEN. Connection word is AND in the antecedent of rule. The consequence of rule is class label. The above rule is encoded and expressed to individual in population of differential evolution. Then the population is iterated through differential mutation and binomial crossover. Optimal rule set is obtained after decoding the optimal individual. Finally, DE-Rule, RS-Rule and ANN-GA-Cascades-Rule are used to recognize oil reservoir (dry layer, water layer, inferiority layer and oil layer) in the Jianghan oil field. Data of well oilsk81 is training data and data of well oilsk83 is testing data. The results show that performance of accuracy and interpretability in DE-Rule is the best.}, keywords = {Differential Evolution, Oil Reservoir, Rule Extraction}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84892182107\&partnerID=40\&md5=822605bef25e5d8a1d8382dfd3d0fb86}, author = {Li, J.-L. and Guo, H.-X. and Zhu, K.-J. and Wang, D.-Y. and Hu, J.-L.} } @article {416, title = {Digital information facial recognition based on PCA and its improved algorithm}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {390 - 395}, abstract = {Face recognition (PCA algorithm) based on principal component analysis method is a classic algorithm of digital information face recognition. This paper first analyzes the PCA algorithm and its basic principles. And in view of the shortage that it is affected by its subject facial expression changes and other factors, it designs the improved PCA algorithm, namely adding the image enhancement processing method, such as the local mean and standard deviation, to the original algorithm to increase the robustness of human face illumination and facial expression change during recognition. In addition, verify it on ORL face database and the results show that the improved PCA algorithm can get a higher resolution of the human face and up to 81.59\% accuracy rate. The average growth of time-consuming is 0.378 seconds compared to traditional algorithms, and it is a fruitful improved algorithm.}, keywords = {Digital information, Face recognition, Image enhancement processing method, Principal component analysis}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84890454789\&partnerID=40\&md5=9180e88599a60f794e63948a9a7036db}, author = {Zhu, H.-F.} } @article {404, title = {A diversity-based multi-antenna cooperative detection model in cognitive radio network}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {220 - 226}, abstract = {Spectrum sensing is a key technology in the study of cognitive radios, but its attributes are easily influenced by the channel fading. Compared with singleuser spectrum sensing, multiple-user spectrum sensing can overcome the impacts caused by the fading environment of cognitive radio. Since diversity technology has been proved to provide the system high transmission rate and high link reliability, we propose a diversity-based multi-antenna cooperative detection model based on the original cooperative detecting model. By introducing the antenna technology, sensing users are equipped with a multi-antenna system. Simulations show that the performance of our proposal is better than that of detection based on single-antenna in cognitive radio network. What{\textquoteright}s more, performance of cooperative detection based on multi-antenna is even better than that of cooperative detection based on single-antenna cognitive radio network.}, keywords = {Cooperative detection, Diversity technique, Multi-antenna technology, Spectrum sensing}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84880787172\&partnerID=40\&md5=c40e6173f1ef81d864ae8908b3329067}, author = {Zhenquan, Q. and Wenjing, L. and Huizhen, J. and Weifeng, S.} } @article {374, title = {Duopoly game models of water supply in the presence of market power}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {1 - 7}, abstract = {The purpose of this paper is to investigate the allocation of output and the water supply for two firms to produce differentiated product in two oligopoly game models established under the settings of complete information and incomplete information respectively. By solving a linear demand system model, this paper obtains the corresponding allocation results of output and the water supply for two firms under the condition that the market power exists and the information on the marginal costs is complete. Furthermore, the relation between the allocation result of output and the equilibrium price of water markets in the framework of complete information is analyzed. The study result shows that when the equilibrium price of water markets raises, the total equilibrium output will decrease, while the change rule of the individual output is complicated. Under the condition that water consumption parameters in model are different, and the other parameters in model satisfy suitable conditions, the market shares of output due to the change of the equilibrium price of water markets transforms from the firm who requires more water quantity to the firm who requires less water quantity. Finally, this paper compares the allocation results obtained under the setting of incomplete information on marginal cost with that obtained under the setting of complete information on marginal cost.}, keywords = {Oligopoly game, Strategic interaction, Water market, Water supply allocation}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84879120120\&partnerID=40\&md5=1e1dbd82eabe910e261c6c005e21bd98}, author = {Lu, H.} } @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 {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 {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 {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 {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 {391, title = {Fair virtual bandwidth allocation model in virtual data centers}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {179 - 183}, abstract = {Network virtualization opens a promising way to support diverse applications over a shared substrate by running multiple virtual networks. Current virtual data centers in cloud computing have flexible mechanisms to partition compute resources but provide little control over how tenants share the network. This paper proposes a utility-maximization model for bandwidth sharing between virtual networks in the same substrate network. The aim is to improve the fairness of virtual bandwidth allocation for multi tenants, especially for virtual links which share the same physical link and carry nonfriendly traffic. We first given a basic model and then proved the model can be split into many sub models which can run on each rack-switch port. In the sub model, every physical link is associated with a fairness index constraint in maximize utility calculating. The goal is to limit the differences among the bandwidth allocation of the virtual links which share the same physical link. Experimental results show that the virtual bandwidth allocation between tenants is more reasonable.}, keywords = {Bandwidth allocation, Multi-tenant, Network virtualization, Virtual data centers}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84880784551\&partnerID=40\&md5=592719b8e0f5ff76a5dbdb85fdbe06e3}, author = {Yuan, Y. and Wang, C.-R. and Wang, C.} } @article {399, title = {Fault prediction of nonlinear system using time series novelty estimation}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {207 - 212}, abstract = {Many complex nonlinear systems have the characteristics such as difficult modeling, dangerous testing, and high cost to experiment with fault. Aim at these points, a new kind of novelty estimation method based on an on-line Least Square Support Vector Regression (LS-SVR) algorithm is presented for fault prediction of nonlinear system in this paper. Firstly, a set of characteristic token values, which represent normal state of time series at the beginning, are selected as the training data to establish the on-line LS-SVR model. Then, the output values of the on-line model are analyzed to estimate novel pattern. Once the novel pattern is affirmed, the fault of system is forecasted immediately. The proposed method needs neither the math model of system nor the fault training data and primary knowledge, and it is believed with good real-time capability. The results of simulation on Continuous Stirred Tank Reactor (CSTR) show the efficiency.}, keywords = {Fault prediction, Nonlinear system, Novelty estimation, Time series}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84880818113\&partnerID=40\&md5=5fe267d630eb652afa900d99483c0dcf}, author = {Su, S. and Zhang, W.} } @article {366, title = {Hierarchical clustering analysis method based on the grid with obstacle space}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {76 - 82}, abstract = {The advantage of grid-based clustering method is its fast processing speed. The speed of clustering algorithm and the number of data objects is unrelated. To discover any size and shape of the cluster{\"y}it is by the number of units on each dimension in the data space. In this method, the amount of data and computation time does not matter, calculations and data entry of the order does not matter, does not require the number of k-means algorithm to pre-specified cluster and so on. Clustering problem with obstacle constraints has very strong practical value in the spatial clustering analysis, and has become a research hotspot in recent years. Under the condition of existing obstacles constraints, the vast majority of the spatial clustering algorithm can{\textquoteright}t effectively solve the problem of irregular obstructions. Thus it has a greater impact on the accuracy of the algorithm clustering results, and reduces the efficiency of the algorithm. To solve this problem, an obstacle constraint space grid-based hierarchical clustering algorithm, which is GSHCO algorithm, is proposed. The algorithm inherits the advantages of gridbased clustering algorithm, by defining the concept of barriers to grid to deal effectively with the obstacles of arbitrary shape, to achieve the purpose of found clusters of arbitrary shape; At the same time, the algorithm uses a hierarchical strategy which can effectively reduce the complexity of the algorithm with obstacles clustering and the algorithm is improved operating efficiency. The experimental results show that the GSHCO algorithm can deal with obstacles constrained clustering, and with higher performance and better clustering quality.}, keywords = {Cluster ensemble, Grid spatial clustering, Multi-scale clustering, Spatial cluster analysis}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84879084446\&partnerID=40\&md5=8173c506959188548e2182b57f3f31c2}, author = {Shan, D. and Yang, Z.} } @article {387, title = {High points recognition method of scraped surface based on background Subtraction}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {115 - 119}, abstract = {Using computer vision library OpenCV, a method of automatic recognition high points of scraped workpiece surface is presented. The image is dealt with by background subtraction, Median filtering, morphological processing, image negates, contour finding and drawing contours. In order to accurately and efficiently recognize the high-point contours and mark its center positions, mathematical morphology and specific processing function were used.}, keywords = {Background subtraction, Contour analysis, High points recognition, Image processing, Scrapping}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84879125674\&partnerID=40\&md5=593c3c4ffe380889b98f09f916fa0b8c}, author = {Li, X. and Sun, L. and Liu, Y.} } @article {381, title = {A hybrid method to deformation force of high-speed cold roll-beating forming}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2013}, pages = {146 - 153}, abstract = {High-speed cold roll-beating forming technique is a new near-net plastic forming method that the intermittent high-speed roll-beating is used to achieve dynamic impact local loading, and that is fast, transient, high impact, large deformation of the complex forming process. For this forming process, the main stress method is employed to derive an analytic formula for the deformation force. Taking into account the main stress method can not reflect impact factors such as high-speed transient roll beating in process of this analytic solution, then the ABAQUS/Explicit is applied to simulate for highspeed cold roll- beating. The regression analysis is used to correct for the analytic formula based on simulation results, which makes the analytic formula more accurate reflection of deformation force of the different technological parameters of high-speed cold roll-beating. The forming experiments are carried out with self developed high-speed cold roll-beating experimental equipment and the experimental of deformation force is measured to verify the correctness of the corrected analytic formula.}, keywords = {Cold roll-beating, Deformation force, Experimental verification, Slab method}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84879119848\&partnerID=40\&md5=beed77f3dd930748bf1900ffca1e5ad0}, author = {Yang, M.-S. and Li, Y. and Yuan, Q.-L.} } @article {415, title = {Improved image fusion algorithm for detecting obstacles in forests}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {378 - 384}, abstract = {The harvester has been widely used in forestry operations. However the existence of obstacles in forests, such as stones, animals, human and clustered trees, may leads to safety accident and decreases the operating efficiency of the harvester. Therefore it becomes vital to show the obstacles accurately to provide guidance for the harvester. In this paper, an improved image fusion algorithm based on Contourlet transform and pulse coupled neural network (PCNN) is proposed to enhance the fused images{\textquoteright} clarity and capture more abundant information of the reality. As for comparison, algorithms, such as wavelet transform, Principal Component Analysis (PCA) and PCNN are simulated to evaluate the proposed algorithm. Visible and infrared thermal image are captured in forest in this experiment. The experimental results demonstrate that the proposed algorithm outperform the mentioned methods by the objective criteria of Entropy, Average gradient and Standard deviation.}, keywords = {Contourlet transform, Image fusion, Improved algorithm, Obstacles in forests, Pulse coupled neural network}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84890541561\&partnerID=40\&md5=16f7eefad0eaee5c1b654f4eb9b1a1ba}, author = {Yan, L. and Yu, Z. and Han, N. and Liu, J.} } @article {377, title = {Information sharing in supply chain: A review}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {125 - 130}, abstract = {The importance of information sharing in supply chain management is a matter of consensus between practitioners and researchers. Information sharing can increase supply chain efficiency by reducing inventories and smoothing production. Studies from different and recognised authors are reviewed, compiled and analyzed in three aspects. First, the types of shared information in supply chain are summarized. After, the value of different shared information and the factors which affect its value are presented. Moreover, the methodologies used in literature are detailed. The paper concludes with some future directions for theory construction and empirical research.}, keywords = {Information sharing, Literature review, Supply chain network, Supply chains management}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84879070693\&partnerID=40\&md5=492576360136fd7384f5e3b18e51a4d1}, author = {Yang, Z. and Zhang, L.} } @article {412, title = {The integration of PCA, FLD and gabor two-dimensional wavelet transformation using facial expression feature extraction}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {284 - 289}, abstract = {In order to improve the rate of facial expression recognition. The Gabor wavelet fusion PCA+FLD method is proposed as a new method this paper. Firstly, face image preprocessing, and then carries on the two-dimensional wavelet transform Gabor, first constructed five scale eight directional wavelet filter, through the PCA+FLD method for dimensionality reduction, and finally obtaining an optimum expression a projection subspace classifier in all the optimal subspace. The experiment proves, fusion PCA, FLD and Gabor wavelet transform two-dimensional facial expression feature extraction for classifier design, facial expression recognition rate is high. The experiment proves that the new method of Gabor wavelet fusion PCA+FLD is perfect.}, keywords = {Facial expression recognition, PCA+FLD, Two dimensional gabor wavelet}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84888357193\&partnerID=40\&md5=4efdf9679a3c503ac68ea63914484966}, author = {Ni, J. and Li, Y.} } @article {419, title = {Investigating a new design pattern for efficient implementation of prediction algorithms}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {366 - 377}, abstract = {In our previously published researches we used different prediction algorithms to solve several problems in computer architecture and ubiquitous computing. During the time, we observed what is common among different solutions and also what can differentiate these solutions. Therefore, due to our experience in designing predictors, we are able now to propose a simple and efficient general solution for any problem that implies prediction. Since prediction is a widely used technique in many fields, our proposed design pattern can be very useful for software developers.}, keywords = {Design patterns, Markov Chain, Multi-layer perceptron, Predictor, Reusable object-oriented software}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84890511699\&partnerID=40\&md5=d755a7c4e09429fec9144a9ed21aa353}, author = {Gellert, A. and Florea, A.} } @article {438, title = {A leakage monitoring system of pipeline in heating network}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {462 - 469}, abstract = {Supervisory control and data acquisition system (SCADA) is used to monitor the operating data of heating network. But it can do data acquisition and some simple operations only. So in this paper with the data collected by SCADA a leakage monitoring system of pipeline in heating network is designed by the Matble graphical user interface program (GUI). The theoretical basis of this monitoring is the heating network pressure graph theory and the theory of genetic algorithm. With the theory of genetic algorithm the data col-lected by SCADA could be optimized. The optimization avoid the erroneous data which due to measurement error. With the heating network graph theory the leakage monitoring system of pipeline could identify if there is a leakage in the operating conditions in heating pipe network. In the leakage monitoring system, the first step is to collect the initial data which optimized by genetic algorithm as a standard data and these data are stored as a fixed value. After that this system collects the real-time data of heating network and optimizes these data. Finally, the system compares the optimizing real-time data and the fixed value to determine whether there is a leakage. With the experiment the monitoring system which designed in this paper is proved to be very useful in leakage discrimination.}, keywords = {Genetic Algorithm, Heating Network, MATLAB, Pressure Graph}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84892175513\&partnerID=40\&md5=1c08ed8b399411798f88e31b5dd14cec}, author = {Xianliang, Y. and Lianlian, J. and Songling, W.} } @article {420, title = {Modeling and simulation of DIGSILENT-based micro-grid system}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {342 - 351}, abstract = {The accurate modeling of micro-grid access to power system planning and design stage needs is the primary problem to solve. This paper modeled the micro grid photovoltaic power generation system, including silicon solar cell, photovoltaic inverters, battery energy storage system, and the micro power distribution system. In the use of power system analysis software (DIGSILENT) of actual power system simulation, the simulation results verify the model{\textquoteright}s correctness. In the power grid fault disturbance, the light intensity of disturbance and the load disturbances, the simulation results show that the optical storage combined with micro network has fast dynamic response characteristics, and its network of grid-connected voltage influenced by the changes of the light and load is little, while more affected by the network fault influence.}, keywords = {Battery energy storage system, Micro grid, Photovoltaic inverter, Silicon solar cell}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84890522361\&partnerID=40\&md5=6ae6926a5a8e9c87e46f14f7d564b0cc}, author = {Zhang, Y. and Zhu, X. and Li, Q. and Liu, T.} } @article {425, title = {The modeling of genetic and Tabu search algorithm based BP neural network in the risk analysis of investment}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Cited By (since 1996):2Export Date: 10 July 2014}, month = {2013}, pages = {391 - 399}, abstract = {There are many parameters which affect the economic benefit indicators for evaluation and they are all uncertain. Because of the parameters{\textquoteright} uncertainty, evaluation indicators values of economic benefit in project investment are also uncertain. In these years, more and more BP Neural network based models are established to evaluate the risk of investment for its characters of wide information distribution and strong fault tolerance. However, the internal defect of local minima problem in this model will greatly discount the effects of evaluation if the training data are not proposed selected. To solve this problem of traditional BP neural network, an optimization algorithm that combines the advantages of genetic algorithm (GA) and Tabu Search (TS) is proposed. The training process is divided into two phases in order to search promising parameters of the BP neural network in favor of better evaluation and analysis of the investment. In the first phase, the initial parameters are first searched by GA algorithm by taking advantage of its various searches of the solutions, and the best parameters are selected by Tabu search algorithm in the second phases. After calculation of practical data, it proves that the new algorithm has better convergence rate and predictive accuracy, which make the evaluation and risk analysis of the investment faster and more accurate.}, keywords = {BP Neural Network, Genetic Algorithm, Investment Evaluation, Risk Analysis, Tabu Search Algorithm}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84892147727\&partnerID=40\&md5=33572128b86e13bfcb8fb0b8e2c32994}, author = {Yang, L. and Yunlong, D.} } @article {379, title = {Modeling resource-constrained project scheduling problem and its solution by genetic algorithm}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2013}, pages = {87 - 96}, abstract = {The optimization of the resource-constrained project scheduling is an NP-hard problem. Complexity of the algorithm for solving this problem increases exponentially with the increase of resource constraints. Therefore, traditional optimization methods based on Excel tables cannot calculate the efficient allocation of resources, which will affect the scheduling of project management resources. The optimization problem like multiple resource-constrained project scheduling demands an optimization method based on genetic algorithm, which adopts the decimal encoding based on activity priority combined with the storage of the adjacency matrix in order to effectively solve unauthorized phenomenon in activity scheduling. It also adopts preemption mode of allocation of resources in activities to avoid conflict in resource allocation. Besides, we designs C language program that realizes heuristic genetic algorithm, which can find out the most excellent duration that meets the resource constraints through multiple iterations. Finally, the practical results indicate that genetic algorithm can quickly and efficiently solve this problem.}, keywords = {Genetic Algorithm, NP-hard problem, Project scheduling, Resource constraints}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84879108012\&partnerID=40\&md5=6b5486fdec78b400439deebbf407f5b0}, author = {Chai, C.} } @article {424, title = {A new shuffled frog leaping algorithm with space zoomed factor and gravity attractor}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {352 - 358}, abstract = {Shuffled frog leaping algorithm is a new kind of swarm intelligence optimization algorithm. Due to the local search of the basic shuffled frog leaping algorithm which is the only by the worst frog to search and jump, searching ability of which was limited; therefore it had the low precision, slow convergence speed and easy premature convergence etc. Therefore, in order to enhance the ability of the local searching, this paper presented a gravity attractor, all the frogs in the same memeplexe could find the best position under its guidance. Considering the transboundary problems in the frog searching for food process, we introduced a space zoomed factor which made the frog out of the searching space could also be put into the searching space, and the social position relation was not changed, thus it improve the search ability of the SFLA. Through the standard function for testing, and compared with the standard SFLA algorithm and szAPSO algorithm, the experimental results show that the improved algorithm not only improves the convergence speed of the algorithm, enhance the searching capability of the algorithm, but also has better stability.}, keywords = {Gravity attractor, Search strategy, Shuffled frogleaping algorithm, Space zoomed factor, Swarm intelligence optimization}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84890525256\&partnerID=40\&md5=78a3eaab0aabe647fea2933aa34ed254}, author = {Tang, D. and Yang, J.} } @article {400, title = {A novel fault identifying method with supervised classification and unsupervised clustering}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {184 - 189}, abstract = {To satisfy the robust requirement when designing fault identifying method, this paper proposes a novel method to identify sensor fault. Conventional fault identifying method could only classify fault into explicit set. Yet, when a novel faulty pattern occurs, the conventional method can not identify this new pattern and will classify it into a set known ahead of time. For the purpose of robustness of fault identifying method, the supervised classification and the unsupervised clustering are integrated together. Faulty features are extracted with wavelet package decomposition to train the supervised classification algorithm and the unsupervised clustering algorithm. As the supervised classification method, Support Vector Machine (SVM) is utilized to classify those faulty patterns known ahead of time into explicit set for the purpose of identifying faulty pattern. As the unsupervised clustering method, subtractive clustering method is utilized to identify the novel fault pattern. Therefore, SVM and subtractive clustering are integrated to identify sensor fault pattern even when novel faulty pattern emerges. The applicability and effectiveness of the proposed method is illustrated by flow sensor data in an engine fuel providing system. The result shows that the method adopted provides better performance compared with conventional method while satisfying the robust requirement of fault identifying method.}, keywords = {Fault identify, Subtractive clustering, Supervised classification, Support vector machine, Unsupervised clustering}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84880836927\&partnerID=40\&md5=9f7c84bdac0bd7c607dac64aa37c7362}, author = {Xu, T.} } @article {431, title = {A novel RFID authentication protocol with ownership transfer}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {476 - 481}, abstract = {During recent years,RFID technology has a wide applications in many fields.Since singnal transmit by the radio frequency, it raises many security and privacy concerns. Ownership transfer of RFID tags is another requriement for RFID systems. During the life of tag, it may pass from manufacutrer to commercial agent, the ownership of tag need change correspondingly.Taking into account the natural security flaws in RFID systems, it is a challenge to design an authentication protocol with ownership transfer. In this paper, we propose an RFID security method that achieves all requirements based on xor and Public Key Infrastructure (PKI). In addition, we prove it with BAN logic.}, keywords = {Authentication, BAN, Public Key Infrastructure, Radio Frequency, RFID, Security and Privacy}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84892150043\&partnerID=40\&md5=b783572fda084b8e9a02a980716334aa}, author = {Sun, D. and Liu, D.} } @article {384, title = {Optimization and application of support vector machine based on SVM algorithm parameters}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {165 - 169}, abstract = {The hospital customer classification is very important for the integration and allocation of hospital resources, can greatly enhance the market competitiveness of the hospital. Support Vector Machine (SVM) is an approach to solve classification problem by using optimization method. Selecting different kernel parameters can construct different classifiers, meanwhile parameters decide their learning and generalization ability. In order to solve the limitation of selecting parameters by experience, so the particle swarm (PSO) pattern search algorithm is proposed to search optimal parameters and take them into the practice of hospital customer classification; The PSO mode search algorithm is to combine the advantages of PSO algorithm and pattern search algorithm, PSO mode search algorithm has strong global search capability and good advantage of local convergence. The result of experiment shows that this method is not only efficient, but also to search the optimal parameters achieving a high accuracy, which is an effective method of SVM parameter optimization.}, keywords = {Customer data classification, Kernel parameters selection, Particle swarm pattern search, Support vector machine}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84879098093\&partnerID=40\&md5=aa26078b417c2386e1244d36d3bacb09}, author = {Yan, H.-F. and Wang, W.-F. and Liu, J.} } @article {418, title = {Orchestrating the natural language processing software in the cloud computing environment}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {396 - 399}, abstract = {The most of natural language processing problems are data-intensive. An important step in the distributed orchestration of natural language processing software is a rational choice of the specific middleware. The middleware should solve the presented problem with minimal deployment, support and usage costs. It is necessary to run and use that software in the distributed cloud computing environment to achieve such advantages such as consolidation, isolation, and efficient use of the existent infrastructure. It is often impossible to modify the existent natural language processing software to integrate it into the cloud computing environment because of licensing or organizational issues. This paper studies various popular distributed data processing tools and evaluates the selected natural language processing tools on a relatively large document collection in distributed way using the Gearman framework. The document collection is a 10{\textquoteright}000 sentences from the Russian news subcorpus of the Leipzig corpora. The benchmarks are presented and discussed.}, keywords = {Cloud computing, Data-intensive computing, Distributed computing, Natural Language Processing, Service orchestration}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84890443570\&partnerID=40\&md5=80168707d25eb1e8a3acabfb35fdf93f}, author = {Ustalov, D. and Goldshtein, M.} } @article {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 {388, title = {Production line production planning model of iron and steel enterprise}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {131 - 135}, abstract = {At present, iron and steel enterprise develops towards the direction with many procedure, many process, many variety and many specification, and reaches hundreds and thousands of product series and product mix, how to plan, organize and control steel production, production schedule of its product line are key issues. According to the main characteristics of production line of iron and steel enterprise, how to make aggregate production planning of iron and steel enterprise are analyzed. An aggregate production plan model of product line of iron and steel enterprise is proposed, which is calculated by using standard library function of the Matlab7.0 genetic algorithm toolbox to program. Penalty function was adopted in the course of getting solution. These parameters of scale of father population, crossover probability, mutation probability and penalty factor were combined and optimized. The result obtained is in accordance with the actual conditions of this enterprise basically that the optimization solution to production plans of real iron and steel enterprise by using the algorithm.}, keywords = {Aggregate production plan model, Genetic Algorithm, Index terms -iron and steel enterprise, MATLAB, Production line}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84879110969\&partnerID=40\&md5=f4274b55fafe675f163de08cb3f49a87}, author = {Jiang, G. and He, E. and Li, G. and Kong, J. and Xie, L.} } @article {382, title = {Regularized orthogonal local fisher discriminant analysis}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {154 - 159}, abstract = {Aiming at deficiencies of the ability for preserving local nonlinear structure of recently proposed Regularized Orthogonal Linear Discriminant Analysis (ROLDA) for dimensionality reduction, a kind of dimensionality reduction algorithm named Regularized Orthogonal Local Fisher Discriminant Analysis (ROLFDA) is proposed in the paper, which is originated from ROLDA. The algorithm introduce the idea of local structure preserving in Local Fisher Discriminant Analysis (LFDA) on the basic of ROLDA, following properties of ROLDA and strengthening the ability for capturing local structure information of data with nonlinear structures. Experiments on real face datasets demonstrate the effectiveness of our proposed algorithm.}, keywords = {Dimensionality reduction, Local fisher discriminant analysis, Local nonlinear structure, Regularized orthogonal linear discriminant analysis}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84879121480\&partnerID=40\&md5=294ec31f3b8631180e347dff9cae6b78}, author = {Xu, S.} } @article {369, title = {The research and realization of wireless energy consumption detector based on the internet of things}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2013}, pages = {62 - 68}, abstract = {Intelligent power consumption detection device is an important part in Smart Home system, which can intelligent identification , positioning , tracking, monitoring and management the household electrical parameters, enabling users to keep abreast of household electricity consumption. This paper is mainly about the design of a Wireless Energy Consumption Detector (WECD) based on the Internet of Things, combine with the IEEE802.15.4E wireless protocol. The whole system includes hardware and software parts, the choice of MCU chip, RF chip and power measurement chip for WECD, the design of each module circuit based on the chip working principle, the paper also make a key analysis of device driver module, wireless data forwarding module and wireless data showing module of indoor terminal. After a series of rigorous testing, the result indicates a high reliability and accuracy of the WECD.}, keywords = {IEEE802.15.4E, Smart home, Wireless energy consumption detector}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84879106063\&partnerID=40\&md5=32877c7463cacdf6d4cc123f5922c0a9}, author = {Fu, W. and Shui, M. and Chen, Y. and Chen, L.} } @article {421, title = {The research of algorithm for data mining based on fuzzy theory}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {327 - 334}, abstract = {Data Mining is a new filed in data processing research. Support Vector Machine (SVM) is one of the new methods using in data mining, which has gained great applicable success. However, there are still plenty of limitations in SVM. For example, SVM won{\textquoteright}t work if its training set contains uncertain information. In order to solve the problem presented above, this paper discusses the constraining programming of fuzzy chance and the characteristic of fuzzy classification as well as its expression methods. The algorithm for classifying Support Vector Machine is also included in this paper.}, keywords = {Algorithm, Data mining, Fuzzy classification, Fuzzy linear separable, Fuzzy programming}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84890455119\&partnerID=40\&md5=cafd40536136512fd2e0485a0240a565}, author = {Wang, A. and Li, J.} } @article {432, title = {Research on an adaptive algorithm of service selection in pervasive computing}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {482 - 488}, abstract = {An adaptive genetic algorithm of service selection in pervasive computing is presented in this paper. By means of matrix encoding, this algorithm carries out selection, crossover and mutation operations of genetic algorithm, with matrix as individual chromosome and matrix array as gene. Based on the elitism selection strategy and adaptive strategy, this algorithm replicates the optimal individual of every generation to the next generation, and adaptively adjusts crossover and mutation probabilities according to the fitness value of individual, which is aimed at protecting the individuals with high fitness and weeding out those with low fitness. Simulated comparison proves that this algorithm is of good convergence, which also shows more stable optimization ability, compared with ordinary genetic algorithm and random selection algorithm.}, keywords = {Adaptive Algorithm, Elitism Selection, Pervasive computing, Service Selection}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84892166746\&partnerID=40\&md5=ea96f5d6b9c178bdf71b3822a053afae}, author = {Wei, L. and Lanfei, Z. and Jianqiang, D.} } @article {423, title = {Research on cluster analysis of high dimensional space based on fuzzy extension}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {359 - 365}, abstract = {Traditional spatial data are generally high dimensional features, and in the clustering of high dimensional data can be directly applied to data processing because of Dimension effect and the data sparseness problem. For CLIQUE algorithm, which usually have the problem such as prone to non-axis direction of over-clustering, boundary judgment of fuzzy clustering and smoothing clustering. In this paper, a fuzzy clustering algorithm based on fuzzy extension of the high-dimensional spatial data is proposed. This algorithm not only considers effect of adjacent grid of data points in the sparse grid, but also extending the sparse grid region to avoid smoothing clustering phenomenon occurs. What{\textquoteright}s more, it can alleviate the problem of over-clustering and clustering fuzzy boundaries. Firstly, this passage gives a brief introduction to the characteristics of high dimensional spatial data as well as the Clustering methods. Based on the fuzzy extension a high-dimensional space data clustering analysis algorithms is put forward. The impact of the data samples around the point on the data points within the investigated grid is considered, sparse grid fuzzy extension, and at last, the problems of clustering fuzzy boundaries and to avoid excessive clustering produce meaningless clustering are solved.}, keywords = {Clustering integration, Fuzzy extension, Multi-scale clustering, Spatial clustering of high dimensional}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84890448809\&partnerID=40\&md5=ad16385737a42e682c93f28740cee12a}, author = {Shan, D. and Li, W.Y.} } @article {364, title = {Research on digital library personalized information service model based on agent model}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {418 - 422}, abstract = {Taking the personalized information needs of users as the research object, this article introduced the individualized service process of digital library, established the Agent model, built multivariate function by combining with the user preference model, and expounded the process of personalized information acquisition, analysis and push. We could conclude that digital library personalized information service system operated coordinately between each module, and had a complete chain of relationships. It could discovery and track information resources independently, effectively solve the problem of information overload, and realize the optimization of user information needs.}, keywords = {Digital Library, Information Service}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84892164200\&partnerID=40\&md5=5b059b6ec77bef4ae78981c43fbfa23f}, author = {Cao, J. and Liu, M. and Cao, L.} } @article {370, title = {Research on factors affecting farmers{\textquoteright} network information consumption}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {33 - 38}, abstract = {Research on farmers{\textquoteright} network information consumption behavior is an important issue, which cannot be avoided in Chinese rural informatization construction. Logit model is used to research the factors affecting farmers{\textquoteright} network information consumption, and the conclusions are as follows: 1) there are a number of factors affecting farmers{\textquoteright} consumption by using modern network information media; 2) environmental characteristics is the main factor affecting farmers{\textquoteright} information consumption via modern network information; 3) younger farmers more often use modern network information media; 4) farmers have a clear purpose by using modern network information media in information consumption, that is, to gain benefits by the use of information. The conclusions of this study will provide a reference for the government to solve the problem in the current informatization construction.}, keywords = {Consumption behavior, Farmers, Information consumption, Network}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84879070031\&partnerID=40\&md5=afb20649e0143ffa20b16c6c7f385bb8}, author = {Meng, H. and Ge, X. and Xie, M.} } @article {422, title = {The research on giant complex system using intelligent decision support system}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {335 - 341}, abstract = {Mankind is confronted with an increasingly complex system, especially the major decision issues, such as organization and management, coordination, planning, forecasting, controlling and so on. Due to the complexity of the system, many fuzzy factors and the limitations of the existing complex giant system theory, there are still many problems to be solved. The research on the giant complex system based on the theory of fuzzy decision theory theoretically had been proving the reliability of the group decision and has established "the multijudgments information" fuzzy synthesis computational method. It has designed the corresponding multipurpose intelligent decision support system IDSS.}, keywords = {Artificial intelligence, Decision support system, Fuzzy processing, Giant complex system}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84890477476\&partnerID=40\&md5=62072c647fcaedfc91f59a55e1124f4d}, author = {Li, J. and Wang, A.} } @article {409, title = {Research on management of mobile communication network centralized alarm}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {261 - 266}, abstract = {This paper, starting from the level of mobile communication network alarm management, comes up with the alarm types and the six-stage model. The paper also discusses the step of recessive maintenance and management from the perspective of mobile communication in terms of the effective control of network alarms, and also extends the network equipment alarm logic correlation to the logical level of network equipment alarm correlation, at the same time, discusses the study and application of data mining algorithms in alarm correlation. Finally, the paper provides the plan for construction steps and function for stage target for the intelligent alarm analysis system.}, keywords = {Alarm correlation, Alarm management, Centralized monitoring, Mobile communication network}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84888333439\&partnerID=40\&md5=95535069f8aee6f6ca3093cd7ac4d8c0}, author = {Wang, Y. and Zhang, R.} } @article {397, title = {Research on the anti-perspective correction algorithm of QR barcode}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {202 - 206}, abstract = {2-D (2-dimension) bar code has many advantages compared with 1-D bar code, so it has many prevalent applications in recent days. However, there{\textquoteright}re several factors that affecting the sampling process, they lead to a certain degree of deformation towards the 2-D bar code. Furthermore, this deformation may too severe for 2-D bar code to be recognized. Generally, the main stream of twisted image correcting is based on the approach of control-point transformation. So how to locate the control point accurately becomes a key factor in 2-D bar code correcting. This paper develops a QR barcode searching graph and gets the precise location of control point. Experiment shows that our algorithm has good efficiency and accuracy.}, keywords = {Image correction, Line fitting, Perspective transformation, QR code, Searching graphics}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84880830674\&partnerID=40\&md5=4b80f450374df6601877d816dd4cc9af}, author = {Li, J. and Wang, Y.-W. and Wang, Y. and Chen, Y. and Wang, G.} } @article {383, title = {Research on the e-commerce of agricultural products in Sichuan province}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {97 - 101}, abstract = {A detailed investigation on the production, processing and sales of Sichuan agricultural products was made. Issues like how to bring into full play the regional advantages of Sichuan agricultural products and how to promote the advantageous resource allocation and competitiveness of agricultural products in market economy were also probed. Suggestions and schemes for the e-commerce service system of Sichuan agricultural products were proposed through the analysis framework of fuzzy comprehensive evaluation method and improved D\&M model.}, keywords = {Agricultural products, E - commerce, Logistics information platform}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84879093653\&partnerID=40\&md5=a6a6161eb5e909e880cfcdfd360a539c}, author = {Jiong, M. and Xu, L. and Huang, Q. and Li, C.} } @article {363, title = {Research on the service modeling method of information management software based on the petri net model}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {430 - 434}, abstract = {With the continuous development of science and technology, the development of the enterprise also requires the agility of enterprises. At present,SOA is one of the most popular means of achieving enterprise{\textquoteright}s agility.This article embarks on the Petri net model to study the service modeling method of information management software. Firstly, it introduces service-oriented architecture SOA and the methodology of service modeling SOMA, it has been understood its theoretical basis.Secondly, it expounds the structure and characteristics of Petri net. And then it introduces the PN -SM modeling process and the basic structure of the model. Finally, it draws the conclusion: Petri net is a kind of system model that suitable for describing concurrent characteristic.}, keywords = {Petri Net, PN-SM, SOA, SOMA}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84892141654\&partnerID=40\&md5=9aefdc360773763828cb2e16117ebeed}, author = {Rui, S. and Xiaoyan, W.} } @article {437, title = {Research on transmission based on collaboration coding in WSNs}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {441 - 445}, abstract = {In order to reduce the increase of network delay and excessive energy consumption, which are caused by network code in WSNs, a fast random linear mechanism of network coding based on nodes collaboration is introduced. Energy consumption of nodes is reduced by transmitting the initial code of the node, and transmitting linear independent packets received merely. After gathering node coding, ACK return along the best path to reduce the network delay. Simulation results show that delay of data transmission is reduced greatly by introducing random linear network coding for sensor network, and the improved coded mode balances the network load.}, keywords = {Nodes Collaboration, Random Linear Network Coding, Wireless sensor network}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84892145435\&partnerID=40\&md5=2d72868947bda082492e18284f12ea5b}, author = {Xiao-Xing, L.V. and Bai-Hai, Z.} } @article {398, title = {Robust zero-watermarking algorithm for CAD models}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {240 - 243}, abstract = {Copyright protection and authentication of digital contents have become a significant issue in the current digital epoch with efficient communication mediums such as Internet. Digital watermarking technique is now one of the hot research fields of copyright protection for CAD graphic data under the network environment. But there are very limited techniques available for that because of its high shape-preserving demand. Zero-watermarking is such a good means to deal with it and it has lots of advantages such as high capacity, good robustness and various functions. In this paper, we will discuss zerowatermarking algorithm for CAD models and eventually propose a watermarking-based digital rights management system that would test our techniques.}, keywords = {CAD, Chaos, Copyright, Embedded design, NURBS, Zero-watermarking}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84880814416\&partnerID=40\&md5=7e8682b26931ad23644dd6e4bbbd6318}, author = {Liu, N. and Zhang, S. and Zhang, Y.} } @article {426, title = {Robustness analysis of social network based on a dynamic model}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {453 - 461}, abstract = {Due to the high vulnerability of today{\textquoteright}s social systems against disruptions, it has become critical to measure and manage the robustness of social networks. In this study the relationship between social network{\textquoteright}s topology and its robustness in the presence of cascading failures is examined. In the attempt to help practice in increasing the robustness of social systems, the concept of the robustness of social systems is discussed and defined first. And then we propose a new dynamic model of social systems to investigate the robustness of social systems. We theorize that network characteristics such as average path length, node degree, and size of the largest connected component in social networks and so on. Based on the model, a good evaluation method is proposed to investigate the robustness of social networks against the cascading failures of component nodes. Finally, the damage degree of social networks considering cascading failures is investigated through our model. The simulation results confirm that there is a positive relationship between the robustness of social systems and social system performance, while a negative relationship between the topology structure and the robustness of social systems. By the dynamic model, we not only identify the potential key nodes, but also obtain the parameter value which can make the social network reach strongest robustness level. Our work develops a new methodology to the real world application. This research is helpful to increase the robustness of such complex systems and tackle the optimization problem of them.}, keywords = {Disruptions, Graph Theory, Network Damage Degree, Robustness, Social Network Analysis}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84892163854\&partnerID=40\&md5=861e44abb43f2d1f64ca3d9c26ee9c4f}, author = {Wu, H. and Ying, S. and Jia, X. and Zhang, L. and Chen, X.} } @article {428, title = {Rotation invariant texture image retrieval based on log-polar and NSCT}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {470 - 475}, abstract = {In order to solve the problem of rotation invariant texture image retrieval, an image retrieval algorithm based on Log-Polar and nonsubsampled contourlet transform (NSCT) is proposed. Log-Polar transform was first applied to texture image to convert the rotation to translation. Then, translation invariant NSCT was employed to decompose the transformed images. Standard deviations, energies and entropies of the different directional subbands features were calculated to make up a 45-dimension feature vector. Finally, Canberra distance was used to compute the comparability of this feature vector to retrieval images. The experiment results showed that the proposed algorithm was able to obtain a higher recall rate.}, keywords = {Image Retrieval, Log-Polar Transform, Nonsubsampled Contourlet Transform (NSCT), Rotation Invariant}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84892172030\&partnerID=40\&md5=1266a1090a336e697f9579c13ca705a6}, author = {Xu, B. and Li, Z. and Xie, S.} } @article {434, title = {Secure digital certificate design based on the RSA algorithm}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {423 - 429}, abstract = {With the popularity of the Internet, people can purchase and sell goods and services online just staying at home, and this trend is becoming increasingly apparent. The Internet, as a global computer network, has to provide the following five services: security, data integrity, authentication, usability, and reliable information. In case of lack of safety measures, Internet trading risk is very high. Digital certificates can provide proof of identity in Internet transactions, so that we can greatly reduce transaction risk. This paper describes an approach based on the X.509 standard for digital certificates, using the C language generate public key algorithm RSA, enabling digital certificate generation and signature verification process, the identity of certification users can be verified.}, keywords = {Authentication, Digital Certificates, Internet, RSA}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84892153961\&partnerID=40\&md5=9398ee5232d46b8d829b73ca5dbee714}, author = {Zhong, Y.} } @article {433, title = {Security analysis and evaluation of random linear network coding under wiretapping attack}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {446 - 452}, abstract = {This paper discussed the weak security of random linear network coding in wireless network in view of network coding weak security theory where the wiretapper can successfully obtain initial data and conditions threatening transmission security by decoding. The experiment results displayed, in wireless network, the relationship between decodes success probability of multi-node co-wiretapping, the decodes time of destination node and the node number in round and network, the number of data packet which source node sends every time, Galois field size and transmission radius of each node.}, keywords = {Multinode Co-wiretapping, Random Linear Network Coding, Security}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84892157046\&partnerID=40\&md5=987b97220d343f2739f129f050e6b5ef}, author = {Xiaoxing, L.V. and Baihai, Z.} } @article {427, title = {Segmentation strategies for passage retrieval from internet video using speech transcripts}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {400 - 408}, abstract = {We compare the effect of different segmentation strategies for passage retrieval of user generated internet video. We consider retrieval of passages for rather abstract and complex queries that go beyond finding a certain object or constellation of objects in the visual channel. Hence the retrieval methods have to rely heavily on the recognized speech. Passage retrieval has mainly been studied to improve document retrieval and to enable question answering. In these domains best results were obtained using passages defined by the paragraph structure of the source documents or by using arbitrary overlapping passages. For the retrieval of relevant passages in a video no author defined paragraph structure is available. We compare retrieval results from 5 different types of segments: segments defined by shot boundaries, prosodic segments, fixed length segments, a sliding window and semantically coherent segments based on speech transcripts. We evaluated the methods on the corpus of the MediaEval 2011 Rich Speech Retrieval task. Our main conclusions are (1) that fixed length and coherent segments are clearly superior to segments based on speaker turns or shot boundaries; (2) that the retrieval results highly depend on the right choice for the segment length; and (3) that results using the segmentation into semantically coherent parts depend much less on the segment length. Especially, the quality of fixed length and sliding window segmentation drops fast when the segment length increases, while quality of the semantically coherent segments is much more stable. Thus, if coherent segments are defined, longer segments can be used and consequently fewer segments have to be considered at retrieval time.}, keywords = {Multimedia Retrieval, Text Segmentation, User Generated Content, Video Segmentation}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84892167136\&partnerID=40\&md5=41e146d1a72335b63599072284ec5b9e}, author = {Wartena, C.} } @article {373, title = {The short-term wind power forecast based on phase-space reconstruction and neural networks}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2013}, pages = {40 - 45}, abstract = {The short-term forecast of the wind power of a wind farm is of great significance for the security and stability of a grid-connected generation system. An accurate forecast may reduce the spinning reserve of a grid while providing reliable references for operation dispatch of a wind farm. In order to improve the accuracy of short-term forecasts, introducing the phase-space reconstruction technique of the chaos theory, this paper was established forecasting models by reconstructing the historical time-series data of the wind power of a single unit based on the dynamical properties of chaos sequences, choosing the best delay time with the mutual information method, determining the best combination of embedding dimensions with the Cao algorithm, as well as utilizing the Elman recurrent neural network and others like the BP. As comparative case analysis shows, the forecasts of Elman model are more accurate than that of the others, exhibiting a positive prospect of utilizing this combined model of phase-space reconstruction and neural network in wind power forecasting of a single unit.}, keywords = {BP Neural Network, Delay time, Elman neural network, Embedding dimensions, Phase-space reconstruction, The short-term wind power forecasts}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84879073309\&partnerID=40\&md5=fdd64e3c0ae9db677a30cd0fc318f9ba}, author = {Zhang, J.-H. and Liu, Y.-Q. and Tian, D.} } @article {402, title = {Spanning tree method for minimum communication costs in grouped virtual mapreduce cluster}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {213 - 219}, abstract = {Today, MapReduce and virtual cluster are sharp swords for this big data and cloud computing era. To combine these two emerging technologies, it brings feasible-scalability, easy-management, fast-deployment and high-efficiency with the system. As every sword has two sides, the I/O bottleneck of virtualization technologies may seriously impacts on the performance of MapReduce cluster which deals with I/O-intensive applications. In this paper, we analyze the combination advantages and disadvantages of virtualization technology of MapReduce cluster. We also analyze the communication model for both of them and build a communication costs model. Then, we propose a novel algorithm of minimum-weight spanning tree to construct a lower communication costs virtual MapReduce cluster. With the help of constructing minimum-weight spanning tree, we find out a method to select local-master and group the cluster. Theoretical simulation and experiment results demonstrate that our method can greatly reduce communication costs. The performance improvement is up to ~40.4\% respectively.}, keywords = {Cloud computing, Mapreduce, Spanning tree, Virtual machine}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84880774380\&partnerID=40\&md5=a8db5f920e0bbee748a4977aecbefdf2}, author = {Yang, Y. and Long, X. and Shi, B.} } @article {392, title = {The statistical analysis of family names of donators for wenchuan}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {235 - 239}, abstract = {It is analyzed that the family names of personal donators who donated through China Construction Bank Corporation to Chinese Red Cross Foundation for the WenChuan earthquake. The distribution of family names, the first 100 family names and their shares, the probability of the same family names as well as the Gini coefficient are all given in this paper. A heavy disproportion is showed in the distribution, that is to say a small part of family names occupy the absolutely large proportion while most of them are rare. This character is similar to power-law that has been observed in many demonstrations about family names. However, the Kolmogorov-Smirnov test fails to support the hypothesis. Instead, part of the data shows an exponential characteristic. As an innovative sampling method, the discussion may help to know the family name{\textquoteright}s distribution of China.}, keywords = {Distribution, Exponential, Powerlaw, The family name}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84880773341\&partnerID=40\&md5=5ab1d739ad89b517599a75710dec963b}, author = {Yufan, L. and Qinghua, C.} } @article {385, title = {Structure optimization of ladle bottom based on finite element method}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {120 - 124}, abstract = {Ladle is an important container in metallurgy industry, and its lifetime is very important for the natural production of enterprise. The stand or fall of refractory lining of ladle decides its lifetime, yet thermal stress is the direct reason of causing refractory lining breakage. In this paper the structure of ladle mainly by changing the structure of bottom with finite element method is designed, and three scheme models are put forward. By analyzing and comparing stress field of the three ladle models, finally an optimization scheme is put forward. The experiment results indicate that the lifetime of ladle gains obvious increasement, and the rationality and practicability of the scheme have been proved. The method is feasible to improve ladle{\textquoteright}s lifetime.}, keywords = {Equivalent stress, Finite element method, Ladle bottom, Stress field, Structure optimization}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84879119261\&partnerID=40\&md5=b9bc4b165b18d48acae83fe0d659cc3e}, author = {Li, G. and Li, Z. and Kong, J. and Jiang, G. and Xie, L.} } @article {393, title = {Study of methods for constructing families of odd-periodic perfect complementary sequence pairs}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {194 - 196}, abstract = {Some characteristics of the families of oddperiodic perfect complementary sequence pairs (OPCSPF) are discussed. The methods for constructing an OPCSPF are given and proved. The families of periodic perfect complementary sequence pairs can be constructed correspondingly by using the equivalent relationships, which further expanded the existence space of the complementary sequence.}, keywords = {Odd-periodic complementary sequence, Perfect signal theory, Sequence pairs}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84880828927\&partnerID=40\&md5=e9791258f96791c503bea170292e04cb}, author = {Jin, H.-L. and Chen, J.-X.} } @article {368, title = {Study on a robot 3D laser radar information collection system}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {69 - 75}, abstract = {This paper studies a low-cost computerbased 3D laser radar collection system. First, the control of actuator is realized by serial communication and the 2D image is captured from lines to surface, then denoise processing calibration is carried out by using Open CV. By using Irrlicht3D engine, the point cloud data is to be rendered to convert the 2D images to the 3D effect. Robot{\textquoteright}s collection on external image is achieved through the study of Open CV learning that combined with VC2008.}, keywords = {3D laser radar, Information collection, Low-cost}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84879113061\&partnerID=40\&md5=7941cc253a0c68dabc5b5f89de60ee27}, author = {Chen, W. and Shen, J. and Xue, J.} } @article {436, title = {Study on computer audit based on OLAP technology}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {409 - 417}, abstract = {It has become increasingly difficult for the traditional audit information system to find out the necessary audit information from the mass data generated in the large scale application of accounting computerization and ERP software, etc. For the current massive financial and operation information data of enterprises, a new audit model is necessarily explored to satisfy the requirements on massive information audit. Dynamic on-line analysis and audit information system can provide a brand new train of thought to conduct rapid and efficient audit in mass data. Under such a backdrop, selective introduction of the computer audit mode based on OLAP from Western Countries has become the necessity for the current audit development of our country. The computer audit based on OLAP technology mainly conducts multi-angle data observation, finding suspicious audit data, and create an audit data model in advance; it mainly includes five parts, i.e. data model subsystem, audit online analysis processing subsystem, auditing business management subsystem, expertise experience library subsystem and audit alarm subsystem.}, keywords = {Computer Audit, Data model, OLAP, Subsystem CLC Number, TP311.13 F239}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84892159745\&partnerID=40\&md5=73e06eabfb56e4cc5549342fff805b9c}, author = {Yanjun, T.} } @article {371, title = {Study on current protection in distribution network with distributed generation}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {46 - 53}, abstract = {Running with distributed generation, configuration of distribution network will be changed, that influences strength, flowing direction and duration of fault current. It analysed influence on current protection in main feeder, recloser and conventional branch line protection through the calculation formula of fault current before and after distributed generation synchronization development. In Matlab/Simulink, it constructed distribution network model with distributed generation, used simulation examples to prove influence on current protection and put forward improvement measures which can meet requirements of relay protection in distribution network.}, keywords = {Current protection, Distributed generation, Distribution network, Fault current}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84879100407\&partnerID=40\&md5=c313cd9e2a75b7b6bd904c992a809445}, author = {Zhu, X.-L. and Liu, J. and Han, F.} } @article {386, title = {Study on fuzzy evaluation of credit risk of corporate bond}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {102 - 107}, abstract = {The credit risk evaluation of corporate bond is one of the difficult and hot research fields in the related research and plays a key role for corporate financing. Based on the fuzzy theory and analytic hierarchy process, a new credit risk evaluation model of corporate bond is presented. First an evaluation indicator system of credit risk of corporate bond is designed through analyzing the characteristics of the evaluation indicator with more details; Second, analytic hierarchy process is used to determine the level of different indicators and multistage comprehensive fuzzy evaluation is used to evaluate the credit risk of corporate bond. Finally, corporate bond of 10 enterprises are taken for examples to evaluate the credit risk and verify the validity and feasibility of the model and the experimental results show that the model can evaluate the credit risk of different corporate bond of different enterprises practically.}, keywords = {Analytic hierarchy process, Credit risk evaluation, Evaluation indicator system, Multistage comprehensive fuzzy evaluation}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84879107489\&partnerID=40\&md5=5ed9e7ced58f7b1babf82aed43c4db90}, author = {Jiazhong, O. and Min, L.} } @article {407, title = {The study on information characteristics analysis using information diffusion method}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {290 - 297}, abstract = {A new kind of comprehensive evaluation method is proposed through analyzing the characteristics of the source of information. We use of three kinds of information transmission network performance report of the son from a source for information. Exploring the effective information diffusion characteristics, we analyzed the characteristics. The results in these characteristics have different characteristics, often preferred different types of information sources, such as a news conference or columns.}, keywords = {Blog, Information diffusion, Network analysis, Ranking}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84888365071\&partnerID=40\&md5=fac2b10e3f70e9d408611eb7bb0b9451}, author = {Huang, L.-D. and Shen, X.-C.} } @article {375, title = {The study on pendubot control linear quadratic regulator and particle swarm optimization}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {16 - 24}, abstract = {In this paper, a new algorithm to optimize the state feedback linearization matrix of two-link PenduBot control system. Mature method of comparison, the best of the simulation results of the particle swarm optimization algorithm can make the object more stable. Obviously, the particle swarm algorithm is introduced to the angular displacement and speed of smaller each link, less overshoot and a relatively short period of time to adjust. The algorithm through the control control ability proves two-link PenduBot. However, it needs modification parameter and run the program several times, so the need of further research for further improvement.}, keywords = {LQR, Pendubot, PSO, State-feedback}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84879114013\&partnerID=40\&md5=b4f25efc7f371dde9d9d28828f6856e7}, author = {Jianfeng, X. and Huzhen, S.} } @article {413, title = {Tuning of PID controller for air conditioning unit based on adaptive genetic algorithm}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {385 - 389}, abstract = {PID control is widely used in air conditioning system. The algorithm is simple but has a long response time, and the adjustment is not flexible. In this paper, we propose a method of optimizing PID controller parameters based on adaptive genetic algorithm. Specifically, the fitness function with penalty terms is added to the classical genetic algorithm and adaptive crossover and mutation factor genes to make the PID parameters converge to global optimum quickly. In addition, the method can prevent overshoot and improve stability effectively. Simulation results indicate that our method achieved a 83\% reduction in regulation time of response of an airconditioning unit compared with the original PID system . The method can be used for online tuning of PID parameters as well.}, keywords = {Adaptive genetic, Air-conditioning unit, Control system, Penalty factor, PID parameter optimizatio}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84890505004\&partnerID=40\&md5=0eb209969776e5c94c3b9272214e4d6f}, author = {Zhou, Y.-T. and Nie, J.-B. and Han, N. and Li, D. and Chen, C.} } @article {380, title = {Vehicle routing optimization problem with time-windows and its solution by genetic algorithm}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {136 - 145}, abstract = {Vehicle Routing Problem (VRP) is a hot issue in the field of logistics. Furthermore, the Vehicle Routing Problem with Time-Windows (VRPTW) is an additional constraint of the customer access time windows based on the VRP. It becomes a noticeable problem with the development of logistics distribution and the just-intime distribution demand from customers, which increases a visiting window to traditional VRP. This paper firstly analyzes the distribution vehicle scheduling optimization problem with time-windows. Subsequently, through transforming the capacity and soft time-windows constraint into objective constraint, the authors establish a non-full loaded VSP model. Moreover, genetic algorithm is used to solve this problem, where natural number is adopted to realize problem coding and the maximum reservation crossover and improved inverse mutation technology are used to generate new individuals. Finally through the simulation experiment, the results verify its feasibility and effectiveness.}, keywords = {Genetic Algorithm, Logistics distribution, Time-windows, Vehicle routing optimization}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84879123858\&partnerID=40\&md5=7522f4b2d16a9e979a5ea8b102a48e5a}, author = {Chen, T. and Zhou, G.} } @article {367, title = {A web-based virtual lab for accounting skills practice}, journal = {Journal of Digital Information Management}, volume = {11}, year = {2013}, note = {Export Date: 10 July 2014}, month = {2013}, pages = {8 - 14}, abstract = {With the advances in internet technology, the educational instruction mode has greatly been improved, which is beneficial to accounting education. Practical accounting skill is difficult to learn in the classroom with traditional forms of accounting education. In this paper, the authors described a web-based virtual accounting lab that has been developed to provide simulation in accounting practical skills, reported empirical findings of the application of the lab, evaluated its effectiveness based on questionnaire to students participated in the lab. The study has proved the value of education technology in providing real life experience for accounting students. Further implications and conclusions on technology application in accounting lab were also given. Categories and Subject Descriptors: K. 3.1 [Computer Uses in Education]; J.1 [Administrative Data Processing]; D.4.8 [Performance] General Terms: Management, Performance, Simulation software, Virtual lab.}, keywords = {Accounting skills practice, Educational technology, Virtual lab, Web based lab}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84879082631\&partnerID=40\&md5=bb326c958ec9343412074107e37686f9}, author = {Xiaomei, G. and Lihuang, C.} } @article {360, title = {Application study on visual discussion technique in group decision making of sudden disasters}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Export Date: 10 July 2014}, month = {2012}, pages = {373 - 378}, abstract = {Emergency management of sudden disasters needs a quick and efficient decision made by a group. The authors propose a visual discussion technique in group decision making of sudden disasters and construct the main technique process based on visualization theory. Based on this, Through the key techniques are researched and implemented. As for Multiagents in the discussion, they can obtain more accurate cognition of current sudden disaster situation and form efficient emergency predetermined plan by discussion and analysis in the short time.}, keywords = {Emergency Management of Sudden Disasters, Group Decision Making, Semantic Cluster Analysis, Visual Discussion Technique}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84874910051\&partnerID=40\&md5=0a893329cccfb221cc012d5e9b72840e}, author = {Tao, F. and Wang, H. and Liu, G.} } @article {344, title = {Applications of numerical calculation in engineering design}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2012}, pages = {308 - 311}, abstract = {Such problems are often encountered in engineering designs: drawing moving targets orbits, however either there is no analytical formula of the orbit equation, or the derivation of getting a track equation is cumbersome; designing size of an equipment requires solving a complex transcendental equation. In order to address these matters, here were cited three instances, plotting the trajectory of a charged particle in a non-uniform magnetic field; drawing the spacecraft{\textquoteright}s orbit; designing the central axis size of an electrostatic precipitator cylinder. Through introduction of numerical calculation, the derivations of the orbits equations were avoided and the trajectories of a charged particle and the spacecraft were plotted respectively; solution of transcendental equation was found and the required dimension of an electrostatic precipitator cylinder in the design was got. So the numerical calculation plays a huge supporting role in engineering design.}, keywords = {Electrostatic precipitator, Numerical calculation, Orbit equation, Spacecraft, Transcendental equation}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84870802969\&partnerID=40\&md5=2de3ed3efc1aa45fdb83fa6b27b27ef0}, author = {Lei, Q.} } @article {337, title = {A clustering based forecast engine for retail sales}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Export Date: 10 July 2014}, month = {2012}, pages = {219 - 229}, abstract = {Efficient and accurate sales forecasting is a vital part of creating an efficient supply chain in enterprises. Times series methods are a popular choice for forecasting demand sales. A major challenge is to develop a relatively inexpensive and automated forecasting engine that guarantees a desired forecasting accuracy. Times series decomposition and Forecast combination have been two classes of methods that have attracted the interest of recent researchers. One solution has been to use decomposition followed by recombining to form a very large number of forecasting models Further many recent papers present Data Mining based methods to intelligently discover a subset of methods from a large list that can be used in combination for sales demand forecasting. These methods are computationally expensive and prohibitive if they are applied to each individual time series in a retail organization. In this paper we present a novel technique to identify similar sales series and efficiently use the best combination of methods learnt for one series to forecast for the entire set of similar series.}, keywords = {Bad experts, Combining, Decomposition, Frequent pattern mining, Good experts, Hierarchical clustering, Sales forecasting, Times series}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84866437246\&partnerID=40\&md5=483d9ce78ec38199f57ebcb1bca8dc64}, author = {Murlidhar, V. and Menezes, B. and Sathe, M. and Murlidhar, G.} } @article {323, title = {CMCCR: Classification based on multiple class-correlation rules}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Export Date: 10 July 2014}, month = {2012}, pages = {64 - 70}, abstract = {Previous studies show that associative classification achieves higher classification accuracy than traditional classification approaches. However, associative classification suffers from two major deficiencies and thus sometimes has lower classification accuracy. First, it often generates a large number of rules when the minimum support is set to be low. It is not only time consuming to discover so many itemsets, but also very difficult to select high quality rules from a huge set of rules. Second, the association measure confidence does not reflect correlation relationships between itemsets and the class label. To deal these problems, in this paper, we propose a new classification approach called classification based on multiple class-correlation rules (CMCCR). First, we use both support and all-confidence to mine not only frequent but also mutually associated itemsets. This method not only saves the running time but as well considerably reduces the number of itemsets generated, and thus sharply decreases the number of class-correlation rules produced. Second, we use a new correlation measure correlation confidence to discover class-correlation rules. The measure correlation confidence has two bounds:- 1and 1. It is easy to control the correlation degree of the class-correlation rules found. Finally, we use multiple class-correlation rules and average correlation degree to measure the combined effect of group rules. Experimental results on the mushroom data set show that CMCCR has higher and more stable accuracy than associative classification and decision tree method.}, keywords = {All-confidence, Class-correlation rule, Classification, Correlation confidence}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84866448185\&partnerID=40\&md5=10fb4c8ff12d02f2555fb4ba4c8f5d04}, author = {Zhou, Z. and Wang, X. and Pan, G.} } @article {320, title = {A comparison of pattern classification approaches for structural damage identification}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Export Date: 10 July 2014}, month = {2012}, pages = {126 - 130}, abstract = {A structural damage identification approach based on wavelet packet decomposition (WPD) and random forests (RF) was proposed and compared with other pattern classification approachs. The main procedure involves extracting energy features from vibration acceleration data through wavelet packet decomposition and then using these features as input for a RF classifier. The experiment was carried on an 8-storey steel shear building model in the case verification. The results show that the proposed method is effective for structure damage detection and can achieve a higher accuracy than other commonly used methods.}, keywords = {Extraction algorithms, Pattern matching, Sensor identificaiton, Wavelet packet decomposition}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84866443034\&partnerID=40\&md5=17335eb07404e2de90828f9bb812e1da}, author = {Qingqing, Z. and Qifeng, Z. and Yongpeng, N. and Fan, Y. and Jiayan, L. and Run, T. and Minda, L.} } @article {318, title = {A constrained optimization evolutionary algorithm based on membrane computing}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2012}, pages = {121 - 125}, abstract = {Based on membrane computing (MCCOP for short), a constrained optimization evolutionary algorithm is proposed with the evolutionary operations and strategies designed. In MCCOP, a membrane is associated with a constraint and the tentative solutions evolved according to the rules in the membrane. And it is evaluated by the constraint function value as the fitness. The subpopulations can communicate efficiently during the evolution process by making use of the structure of P systems and the communication mechanism among the membranes. The computational experiments show that MCCOP can converge to optimal or close to optimal solutions efficiently and that MCCOP outperforms or performs similarly to the other techniques referred to in terms of the quality of the resulting solutions.}, keywords = {Constrained optimization, Membrane computing, Optimization algorithm, P system}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84866465380\&partnerID=40\&md5=f4dc024e4e87df897034039972862ac9}, author = {Chen, H. and Lu, J.} } @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 {358, title = {D3-P2P: Managing distributed and replicated database in P2P environment by using quorum system}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Export Date: 10 July 2014}, month = {2012}, pages = {351 - 364}, abstract = {The need for large-scale data sharing between autonomous and possibly heterogeneous decentralized systems on the Web led to the concept of P2P database systems. In this paper, we present D3- P2P a new architecture which allows to manage a distributed and replicated database, in Peer-To-Peer (P2P) system with high node dynamicity. This architecture is based on a quorum system to solve problems of concurrent update and nodes failure. The proposed architecture allows assigning a unique timestamp to each distributed transaction in order to build a local precedence order graph in each peer, to select the server replicas and to coordinate the distributed execution of the transaction. To avoid deadlock between nodes, we propose a fully distributed algorithm.}, keywords = {Database, Deadlock, Failure, Node Dynamicity, P2P, Partial Replication, Quorum System}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84874883777\&partnerID=40\&md5=d05a262f0b42b99fd75e7a6488bc8fd4}, author = {Mounine, H.S. and Walid, H.K.} } @article {347, title = {Design of the fuzzy intelligent controller of air compressor}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Export Date: 10 July 2014}, month = {2012}, pages = {320 - 323}, abstract = {The air compressor plays an extremely important role in the production of air separation. It provides the required specifications of compressed air for the follow-up air separation processes. It is difficult for an air compressor system to achieve the on-site production requirements because it is a time-varying, delay and nonlinear complex system. Articles for air compressor control system designed air compressor controller based on fuzzy control provided details of air compressor control strategies. The simulation experiments results showed that air compressor control requirements can be completed very well by controllers.}, keywords = {Air compressor, Fuzzy intelligent control, Fuzzy pid controller, Pressure fuzzy controller, Time-varying system}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84870779991\&partnerID=40\&md5=084b1bca94ceece320d2c7dc345dff40}, author = {Li, G.-F. and He, Y.} } @article {341, title = {Developing and deploying cloud services based on abstraction approach}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Export Date: 10 July 2014}, month = {2012}, pages = {254 - 261}, abstract = {With the advance of cloud computing, the trend of developing and deploying applications on cloud environment also has appeared recently. There are economic as well as technological reasons why an application should be developed and deployed on the cloud. Reducing costs and business agility are typical business factors for cloud-based applications. Cloud computing can provide significant cost savings because of the increased utilization resulting from the pooling of resources. In addition, this technology enables rapid delivery of IT services, which also improves business efficiency. On the operational side, manageability, performance, and scalability are the typical reasons why application developers consider cloud computing. However, cloud computing is still considerable complex to use. Not only the migration between clouds is difficult - but also the development and deployment of a new, complex service from the beginning could be quite a challenge using today{\textquoteright}s cloud computing. In this paper, novel high-level abstraction layers for cloud computing is presented. The abstraction layers will allow users to manage cloud resources form various clouds and simplify the process of developing and deploying services into those clouds. This approach will also solve absolutely the interoperability issue, thus improving the flexibility of cloud computing.}, keywords = {Abstraction, Cloud computing, Cloud-based application, Interoperability, Object-oriented programming}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84866463483\&partnerID=40\&md5=2567e71dfda85333923569e2cdf21fc4}, author = {Nguyen, B.M. and Tran, V. and Hluchy, L.} } @article {328, title = {The development and application of learning support service system for normal students{\textquoteright} work placement}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Export Date: 10 July 2014}, month = {2012}, pages = {168 - 173}, abstract = {The model of normal students work placement has been a significant measure for the reform of teacher{\textquoteright}s education and with the development of distant education theory; thus the education model of networked learning activities arouses major concern. On the basis of new horizons of learning support service in this paper, it will start from three aspects which are the model of learning support service, the design of learning support service system and the application of learning support service accomplished in Work placement to provide an new and effective interactive model to normal students{\textquoteright} work placement activities.}, keywords = {Interactivit, Learning support service, System, Work-placement normal students}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84866468116\&partnerID=40\&md5=4a2a2c97005fa059d75d8f361db5a836}, author = {Shibo, Z. and Xuer, S.} } @article {359, title = {Distributed weighted clustering of evolving sensor data streams with noise}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Export Date: 10 July 2014}, month = {2012}, pages = {410 - 420}, abstract = {Collecting data from sensor nodes is the ultimate goal of Wireless Sensor Networks. This is performed by transmitting the sensed measurements to some data collecting station. In sensor nodes, radio communication is the dominating consumer of the energy resources which are usually limited. Summarizing the sensed data internally on sensor nodes and sending only the summaries will considerably save energy. Clustering is an established data mining technique for grouping objects based on similarity. For sensor networks, k-center clustering aims at grouping sensor measurements in groups, each contains similar measurements. In this paper we propose a novel resource-aware -center clustering algorithm called: SenClu. Our algorithm immediately detects new trends in the drifting sensor data stream and follows them. SenClu powerfully uses a lightweighted decaying technique that gives lower influence to old data. As sensor data are usually noisy, our algorithm is also outlier-aware. In thorough experiments on drifting synthetic and real world data sets, we show that SenClu outperforms two state-of-the-art algorithms by producing higher clustering quality and following trends in the stream, while consuming nearly the same amount of energy.}, keywords = {Algorithm, Data clustering, Data Processing, Wireless Sensor Nodes}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84874869330\&partnerID=40\&md5=29927101aa08b9c82193c09bb9c50304}, author = {Hassani, M. and Seidl, T.} } @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 {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 {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 {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 {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 {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 {315, title = {A feature points matching algorithm based on wavelet analysis}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Export Date: 10 July 2014}, month = {2012}, pages = {94 - 98}, abstract = {In this paper, we present an application of wavelet analysis on feature points matching. Wavelet coefficients which produced by wavelet transform can best display part character of the image. Through the new feature description and feature matching method, we can build a feature point database for each image and improve the efficiency of feature points matching. The experimental results show that this method is practicability, feasibility, good precision and fast speed.}, keywords = {Coefficients, Feature points matching, Wavelet analysis, Weighted statistics}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84866439147\&partnerID=40\&md5=94422ee81166dc1c5a0b1ffc243d1686}, author = {Lijun, W. and Xin, X. and Guang, X.} } @article {332, title = {From a system dynamics causal loop diagram to an object-role model: A stepwise approach}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2012}, pages = {174 - 186}, abstract = {Two diagrams are most commonly used in System Dynamics (SD); Causal Loop Diagrams (CLDs) and Stock and Flow Diagrams (SFDs). CLDs are qualitative in nature while SFDs are quantitative. In this paper we draw our attention to CLDs. CLDs are visual representation of dynamic influences with inter-relationships amongst a collection of SD variables. They are used to qualitatively capture structures and interactions of feedback loops. CLDs however, have been found to be ambiguous, lack detail and not easy to conceptualize. In this paper therefore, we come up with steps on how to transfer information from a CLD into an Object Role Modeling (ORM) model. We carry out this study to improve CLD model conceptualization, make CLD variables explicit and to reduce on CLD model ambiguity. To achieve this we use ORM, a fact oriented method whose focus is on domain conceptualization through data modeling because of its conceptual focus and roots in verbalization, graphical expressiveness and well defined semantics. To apply and validate these steps, we use a case as an example in focus session setting. From these focus sessions, evaluations and discussion of results are made and finally conclusions are drawn.}, keywords = {Causal loop diagram, Object role model, Object-role modeling, System dynamics}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84866459829\&partnerID=40\&md5=128968f0bcab0a3bc3ebee5e3d62926e}, author = {Tulinayo, F.P.F. and Van Bommel, P.P. and Proper, H.A.E.} } @article {346, title = {Functional requirements analysis-based method for product platform design in axiomatic design}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2012}, pages = {312 - 319}, abstract = {Today{\textquoteright}s companies are increasingly being challenged to develop platform-based product families to increase variety of products, while keeping production costs low. In order to provide effective platform-based method and systematically analyzing the customer needs on product design, the functional requirements are classified into basic functional requirements, expectable functional requirements and adjunctive functional requirements. Axiomatic design theory was applied to zigzagging mapping between functional requirements and design parameters, and a new decomposition method to link design matrix and design structure matrix was proposed based on the functional requirements. The common parameters were determined through analyzing the sensitivity of functional requirements to design parameters and the relation degree among design parameters. By way of illustration, a family of drum brake was designed and its results demonstrated the effectiveness and practical value of the method.}, keywords = {Axiomatic design, Functional requirements analysis, Product platform, Relation degree}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84870774667\&partnerID=40\&md5=83472ec4b196c7698750567c7989da49}, author = {Cheng, X.} } @article {307, title = {Image tamper detection and recovery based on dual watermarks sharing strategy}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2012}, pages = {39 - 49}, abstract = {Recently, verifiable secret sharing schemes have been proposed to keep participants from providing fake or illegal stego-images. However, the schemes do not consider the recovery mechanism when parts of the information in stego-images are lost or incidentally modified during the transmission process. This paper presents a novel verifiable and reversible secret sharing scheme based on Shamir{\textquoteright}s scheme, which can authenticate the shares in advance and then recover the inauthentic parts to reconstruct the original secret image. The experimental results provided positive results for the feasibility of the proposed scheme.}, keywords = {Authentication, Recovery, Secret sharing, Steganography}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84863269265\&partnerID=40\&md5=941cf4b613804091a5e3d1ea5d154fa5}, author = {Chen, Y.-H. and Chang, C.-C.} } @article {349, title = {An intelligent communication path planning method of metallurgical equipment multi-dimensional information space}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2012}, pages = {295 - 300}, abstract = {With the development of ubiquitous information environment in metallurgical industry, driving type of metallurgical equipment systems is changing from energy-driven to information-driven. The problems of the metallurgical equipment information communication path intelligent planning are taken as the research object. Based on the cellular automata theory, the integrated framework of metallurgical equipment information space is built. Information communication path intelligent planning method of metallurgical equipment based on ant colony algorithm is explored. The practicality and effectiveness of the divided information spaces and designed algorithms are verified by simulation, which provides theoretical support to enhance the level of metallurgical equipment.}, keywords = {Ant colony algorithm, Cellular automata, Intelligent planning of the communication path, Metallurgical equipments}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84870775516\&partnerID=40\&md5=662c43d3290cf4324b438895204b0c6b}, author = {Liu, J. and Kong, J. and Zhou, M. and Wang, X.} } @article {355, title = {Investigating factors influencing non-use and abandonment of microblogging services}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Export Date: 10 July 2014}, month = {2012}, pages = {421 - 429}, abstract = {This study explores the reason for non-usage and abandonment of microblogging. While previous studies mainly focused on individual behaviors associated with the use of social media, this research identifies why people do not use, or terminate their microblogging accounts. Studying the reasons for non-usage and abandonment is important as it helps organizations devise strategies to counteract this behavior by addressing nonusers{\textquoteright} concerns. First, focus group interviews were conducted to uncover non-usage reasons. The elicited reasons were then used to construct a survey instrument and administered. Our results suggests that preference for other technologies, privacy concern and time constraints are the top three reasons contributing to the non-use and abandonment of microblogging accounts. The paper also proposes potential improvements to microblogs to attract more users.}, keywords = {Abandonment, Focus Group, Microblogging, Non-use, Social media, Social networks, Survey}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84874905735\&partnerID=40\&md5=087e167bd1bd9f4c37ad9988561e5f69}, author = {Guo, Y. and Goh, D.H.-L. and Ilangovan, K. and Jiao, S. and Yang, X.} } @article {324, title = {Low overhead geometric on-demand routing protocol for mobile ad hoc networks}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2012}, pages = {114 - 120}, abstract = {At present, Mobile Ad Hoc Networks (MANET) have become a hot research field, in view that the mobile nodes have the characteristics of mobility, limited energy, limited storage space and so on. Thus to design a simple and high-efficiency routing protocol is an important issue. AODV routing protocol can resolve the routing problem of Mobile Ad Hoc Networks, but it still has many shortcomings, such that it uses flooding method to broadcast messages and finds the route, which cause heavy network overhead and other problems. In this paper, in order to resolve the low efficiency of simple flooding, we first analyze AODV routing protocol briefly. After that we propose an improved routing broadcast algorithm-GAODV, which aims to restrict the forwarding nodes within a local area through the geometrical routing, and prevent from flooding the control packet in the whole network. Simulation results show that the G-AODV effectively reduces network overhead and the end to end delay. Moreover, it also significantly improves the effectiveness of protocol and the overall performance of the network.}, keywords = {AODV, Flooding, Geometrical routing, Mobile ad hoc network}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84866448629\&partnerID=40\&md5=1ddb21882f2996c7fdd5e7fbfd1511cb}, author = {Su, C. and Zheng, L. and Si, X. and Shang, F.} } @article {314, title = {Mechanism analysis of protocols based on the FPCPN model}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Export Date: 10 July 2014}, month = {2012}, pages = {86 - 93}, abstract = {Focusing on the protection of privacy and non- publicity of special networks, the CPN model is extended to PCPN by the protocol factor and the formal model. The FPCPN (Formal Protocol Colored Petri Net) is presented to analyze the operation mechanism of protocols. It is introduced by four steps, such as the whole structure, the network element conversion, the conditions of transition triggers/executions and sub-system partitions. Finally, the feasibility and efficiency of FPCPN is validated by an example.}, keywords = {CPN, FPCPN, Mechanism of protocol, Petrinet}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84866451164\&partnerID=40\&md5=eb201b179c8b50ddc41f54eabc15fec2}, author = {Wang, W.} } @article {304, title = {Middleware model for adapting dynamic requirements}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Export Date: 10 July 2014}, month = {2012}, pages = {20 - 28}, abstract = {Making a distributed system adaptable to the dynamic variations in the user requirements is a big challenge in software industries. It is identified that the solution for the adaptability of such dynamic variations can be achieved through reflective middleware. In this paper an efficient solution is proposed by combining aspect oriented approach with reflective middleware. The significant feature of the proposed aspect oriented reflective middleware model is capturing the dynamic variations in the functionalities of the system as aspects. The three major components defined in this model to implement dynamic adaptability are Aspect Generator, Aspect Weaver and Remote Method Invoker. Aspect Generator component is used to define dynamic requirements as aspects. Aspect Weaver provides service to weave the dynamic requirements with the application components associated with that requirement. Remote Method Invoker is the meta layer component, which provides the platform for the Aspect Weaver to execute its service. The metric to measure the efficiency of the system adaptability has also been proposed here. The adaptability approach implemented through this model has been evaluated and proved as an efficient solution using this metric. This model has also been evaluated at an architectural level using formal analysis to prove that the dynamic requirements can be incorporated without affecting the existing functionalities of the system.}, keywords = {Adaptability Metric, Aspect-Oriented Approach, Aspect-Oriented Reflective Middleware, Dynamic Adaptation, Dynamic Requirements, Reflective Middleware}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84857583024\&partnerID=40\&md5=38c4e35715ea15a7d59be1dfde2d18d1}, author = {Suganthi, S. and Nadarajan, R.} } @article {335, title = {Modeling push-based live P2P streaming by stochastic activity networks}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2012}, pages = {236 - 244}, abstract = {Live P2P streaming has been widely used in recent years because of its scalability and low costs. At the same time, it meets some new challenges that centralized systems never faced, for example, churn and content pollution. It is the first paper which uses stochastic activity networks (SANs) to model and analyze pushbased live P2P streaming systems from the users{\textquoteright} point of view. The model provides a new line of thinking to model push-based live P2P streaming, which enables the effect of churn, pollution and buffer size to be studied simultaneously. It explains why there is a gap between theoretical results in previous studies of content pollution in P2P streaming and the observed effect. It also points out the threshold of buffer size for non-significant QoS improvement.}, keywords = {Modeling, P2P streaming, Pollution, QoS, Stochastic activity networks(SAN)}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84866465492\&partnerID=40\&md5=34d4755b1ae344b34d02b8146fa92325}, author = {Zhang, P. and Helvik, B.E.} } @article {343, title = {A new customer classification algorithm for electronic commerce enterprises}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Export Date: 10 July 2014}, month = {2012}, pages = {284 - 288}, abstract = {Correctly and effectively customer classification according to their characteristics and behaviors will be the most important resource for electronic marketing and online trading of network enterprises. A new customer classification algorithm for electronic commerce enterprises is advanced based on analyzing customer characteristics and behaviors. First, based on consumer characteristics and behavior analysis, 21 customer classification indicators, including customer characteristics type variables and customer behavior type variables, are designed, Second, aiming at the shortages of the existing BP neural network algorithm of data-mining for customer classification, the immune-genetic algorithm is used to correct BP neural network to speed up the convergence of the model. Finally the experimental results verify that the new algorithm can improve customer classification accuracy and can guarantee the effectiveness and validity of customer classification for electronic commerce enterprises in its engineering application.}, keywords = {BP Neural Network, Customer classification, Electronic commerce, Immune genetics}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84870801373\&partnerID=40\&md5=e0e9cd1f8a408b64aa0f9dc6037ec8e6}, author = {Li, X.} } @article {306, title = {A new range-free localization algorithm in wireless sensor networks based on improved genetic algorithm by control on adrenaline levels}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2012}, pages = {50 - 54}, abstract = {In this paper, a new method is proposed to improve genetic algorithm (GA) based on control on adrenaline levels and a new range-free localization algorithm is designed based on the new method to increase the accuracy of the localization in wireless sensor networks (WSN). We choose the classic localization algorithm{\"y} Centroid Algorithm, to perform experiments to demonstrate the localization accuracy of the new algorithm. The result shows that the new algorithm we proposed provides better localization accuracy and it can optimize the localization algorithm in WSN.}, keywords = {Control on Adrenaline Levels, Genetic Algorithm, Localization Accuracy, Wireless sensor networks}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84863283296\&partnerID=40\&md5=8d2ce76d7be6aef5a62301c217b62a78}, author = {Liu, Z. and Fang, Z.} } @article {356, title = {NL2 Alloy: A tool to generate alloy from NL constraints}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Export Date: 10 July 2014}, month = {2012}, pages = {365 - 372}, abstract = {In this paper, we present a novel approach to generate Alloy code from Natural Language (NL) constraints. The proposed research is basically an extension of two projects, NL2OCL and UML2Alloy.Our method uses Natural Language Processing (NLP) and Model Transformation (MT) to transform constraints expressed in NL to Alloy. We do not directly transform NL to Alloy, instead we use multiple intermediate translations such as NL2SBVR and SBVR2OCL and finally OCL2Alloy. Such intermediate translations help us to monitor the whole process of translation and produce intermediate artifacts such as OCL constraints, which can be used for documentation purposes. and ensure that actual semantics of NL have been transformed to Alloy. The generated Alloy code can then be used to check if the original NL constraints are consistent. We also introduce the use of OMG{\textquoteright}s standard SBVR in translation of NL to formal languages. The NL2Alloy approach is also implemented as an Eclipse plugin.}, keywords = {Alloy, Natural language, NL2OCL, SBVR, UML}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84874825931\&partnerID=40\&md5=a6062c119677b77912bbf70d219d1132}, author = {Bajwa, I.S. and Bordbar, B. and Lee, M. and Anastasakis, K.} } @article {345, title = {A novel method of data stream classification based on incremental storage tree}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Export Date: 10 July 2014}, month = {2012}, pages = {301 - 307}, abstract = {For the characteristics of large number, fast change, high cost of random access of data stream, this paper proposes a Bayesian classification data mining algorithm based on incremental storage tree to handle the problems. Use sliding window to process data stream and divide it into several basic units, apply Principal component analysis (PCA) to compress the data from window and produce dynamic incremental storage tree, use the second power strategy to continuously update several incremental storage tree. Then use multi-classifier integration technology combines with Bayesian classification to produce Bayesian classifier. At last, adjust the weight of classifier by cyclic test, and get high classification accuracy. Detailed simulation analysis demonstrates that the presented algorithm is of high efficiency of space and time and is more stable.}, keywords = {Bayesian classification, Data stream, Incremental storage tree, Principal component analysis, Sliding window}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84870803724\&partnerID=40\&md5=ee151686cdc13a9a1a785eb65f87d467}, author = {Xu, C.} } @article {338, title = {A novel RDB-SW approach for commodities price dynamic trend analysis based on web mining}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Cited By (since 1996):5Export Date: 10 July 2014}, month = {2012}, pages = {230 - 235}, abstract = {In order to improve the accuracy of price forecasting for dynamic trend analysis on imperfect data by web extracting, a novel repair data algorithm based on dichotomy backfilling is proposed in this paper. The price forecasting algorithm based on the Sliding Window (SW) is utilized to verify the validity of Repair Dichotomy Backfilling (RDB) algorithm. Experiments demonstrated that the mean absolute errors can be achieved to 5.31 percent average. Furthermore, the price forecasting algorithm based on original data and that based on RDB data are explored to compare their accuracy. Experiments demonstrated the reduction of mean absolute errors in the price dynamic trend analysis verification model. The average MAE on original data is 2.38 percent when the average MAE on RDB data is 2.31 percent. Experiment results proved that the proposed RDB-SW approach is meaningful and useful to analyze and to research the price market on imperfect data by Web extracting.}, keywords = {Dichotomy backfilling, Disturbance factor, Imperfect data, Price forecast algorithm, Sliding window}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84866463450\&partnerID=40\&md5=5874dc4739d723f46728438c22a52b9a}, author = {Zhu, Q. and Zhou, P. and Cao, S. and Yan, Y. and Ding, J.} } @article {309, title = {A Personalization layer for mediation systems}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2012}, pages = {29 - 38}, abstract = {Mediation systems allow integration of disparate and heterogeneous data sources. Unfortunately, with the increasing number of integrated sources, especially in the context of web, mediator{\textquoteright}s responses time increases considerably while the answers are not adapted to users profiles. In this paper, we present a personalization layer that makes the mediation system more sensitive to user{\textquoteright}s preferences. The layer sits between the user and the mediation system. It captures the user profile and performs a smart source selection according to user{\textquoteright}s interests and quality preferences. Selection is based on similarity measurement between users and sources models. Our solution for personalizing data source selection provides the mediator with a set of relevant data sources. These are then involved in the rewriting process to give more satisfying response.}, keywords = {Mediation systems, Personalization, Source selection, User profile}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84857594503\&partnerID=40\&md5=345cb9fd1cebc3bd1598d806adb3d012}, author = {Zaoui, I. and Wadjinny, F. and Chiadmi, D. and Benhlima, L.} } @article {310, title = {Playing games with information: Investigating perceptions of a mobile content sharing game}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Export Date: 10 July 2014}, month = {2012}, pages = {10 - 19}, abstract = {We introduce Indagator (Latin for explorer), an application which incorporates multiplayer, pervasive gaming elements into mobile content sharing. Indagator allows users to annotate real world locations with multimedia content, and concurrently, provides opportunities for play through engaging interactive game elements. A study of Indagator was conducted to obtain usability feedback, and to examine the impact of the usability of its content sharing and gaming features on participants{\textquoteright} intention to use it. Participants used the software to complete a set of tasks and subsequently completed a questionnaire and attended an interview, both of which were to elicit their opinions on the usability of the system. Participants felt that the features in Indagator were able to support the objectives of content sharing and gaming, and that idea of gaming could be a motivator for content sharing. In terms of intention to use, usability of Indagator{\textquoteright}s gaming features emerged as significant predictors.}, keywords = {Mobile Content Sharing Game, Social Computing, Usability, User Evaluation}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84863281265\&partnerID=40\&md5=41c91a3b7957ec0b637c641bf9ba9a6e}, author = {Goh, D.H.-L. and Lee, C.S. and Chua, A.Y.K.} } @article {342, title = {Real-time fault-tolerant scheduling algorithm for distributed computing systems}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Export Date: 10 July 2014}, month = {2012}, pages = {289 - 294}, abstract = {This article proposes a Distributed Realtime Fault-tolerant model, priority Real-time Fault-tolerant algorithm and computational architecture of Distributed Real-time Fault-tolerant. According to this model, the problem of how to schedule a weighted Directed Acyclic Graph (DAG) in Distributed computing system for high reliability can be solved in the presence of multiprocessors faults. When some tasks in a DAG have dependence on each other, a task must be scheduled to make sure that maximum communication efficiency and high reliability can be guaranteed due to a processor failure. Firstly, this paper propose task model, communication model and reliability model for evaluating fault-tolerant performance of the system, and define the priority of a task so that a critical task is defined as one with the highest priority. To add some constrained conditions that do not influence the earliest start time of its successors in the process of scheduling task, The Distributed Realtime Fault-tolerant Scheduling Algorithm (DRFACS) targets maximizing reliability to dynamically schedule dependent, non-preemptive, non-periodic real-time tasks to improve the quality of service through scheduling in the case of arising massive resource failures. Finally, Experimental results demonstrate the feasibility of the proposed algorithm.}, keywords = {Communication reliabiity, Directed acyclic graph (DAG), Fault-tolerant scheduling algorithm}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84870824298\&partnerID=40\&md5=b2233dbb54c6e75335831b70d22145e8}, author = {Ling, Y. and Ouyang, Y.} } @article {311, title = {Research and analysis of improved extraction based on information processing technology}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Export Date: 10 July 2014}, month = {2012}, pages = {142 - 146}, abstract = {This paper analyzes the problem of research topics. The key words are extracted from the academic papers published in the key journals based on information processing technology, and these words have the cooccurrence relationship between clustered. Research topics in the academic field analysis applications, researchers can provide a clear outline; in the information retrieval process, you can help clarify the information needs. We will apply the proposed method to ROCLING seminar papers on the data to extract the important field of computational linguistics research topics. The results show that this method can be applied to the special circumstances of domestic academic field, while taking out the key words in English and Chinese. the word has been said that the field of cluster results can also be an important research topic. These results in a preliminary validation of the method proposed in this paper the feasibility. It can also be found that application of computational linguistics research and practice are closely related, taking out many of the words in the cluster and machine translation, speech processing and information retrieval related to the calculation model in the language, grammar patterns and analysis, broken words and statistical language model type is the calculation is the subject of interest to linguists.}, keywords = {Analysis, Natural language, Seminar}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84866466102\&partnerID=40\&md5=408ac5cc2bfbffd4fed15d3005d825c2}, author = {Wei, Y. and Guo, Y.} } @article {313, title = {Research and practice of characteristic teaching resources sharing and interactive platform}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Export Date: 10 July 2014}, month = {2012}, pages = {59 - 63}, abstract = {By using advanced cloud computing, virtualization and distributed video load balance technology, the paper constructs an interactive platform which shares the teaching resources. On the one hand it provides a beyond time and space, free and equal interactive teaching and learning platform for the teachers and students. On the other hand it offers teaching resources Networked storage, utilization, communication and show space. Dispersive resources will be classified automatically and integrated modularly in order to perform Characteristic and high-quality multimedia resource database and media teaching characteristic of material database.}, keywords = {Characteristic teaching resource, Interactive platform, Sharing}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84866460216\&partnerID=40\&md5=4feb99d8b6bba4b616f6710a86bd53c2}, author = {Yun, W.} } @article {316, title = {Research on face recognition based on wavelet transform and PCA-ANN}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Export Date: 10 July 2014}, month = {2012}, pages = {136 - 141}, abstract = {This paper mainly studies the basic theory and technology on the identification of people{\textquoteright}s faces. The better methods are chosen and a new method is proposed. It integrates three elements (Wavelet Transform, Principal Component Analysis, Artificial Neural Networks), and the method can recognize faces more effectively. Meanwhile, this method lessens the effect of light on face appearance. Experimental result indicates that our new face recognition system is effective in the aspects of both correct ratio and speed of distinguishing.}, keywords = {Face recognition, Feature extraction, Principal component analysis, Radial basis function neural network}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84866450615\&partnerID=40\&md5=f0bb715fcc45b0395a7a2fee9540fdb9}, author = {Yuanzhi, W. and Xiao, L.} } @article {308, title = {A retrieval method based on language model considering neighboring contents}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Export Date: 10 July 2014}, month = {2012}, pages = {1 - 9}, abstract = {The World Wide Web (WWW) has a massive number of Web pages, so that it is difficult for users to get useful information. In recent years, however, it is said that the probabilistic language model can help to improve retrieval accuracies of some kinds of search engines. The probabilistic language model has statistical background and can adapt previous text information retrieval model. However, we cannot directly adapt the probabilistic language model to Web search engines, because data on the Web has a hyperlink environment while the probabilistic language model can only text information on it. In this paper, we propose a novel approach for searching Web pages considering a Web page as well as its neighboring oneson the hyperlink environment.}, keywords = {Hyperlink Analysis, Language Model, Web search}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84857609599\&partnerID=40\&md5=78bc4a283c5231cf36f479f17c8ab0e5}, author = {Tamura, K. and Hatano, K. and Yadohisa, H.} } @article {319, title = {Review on virtual Human{\textquoteright}s affective model and related applied algorithm}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Export Date: 10 July 2014}, month = {2012}, pages = {71 - 78}, abstract = {The artificial intelligence simulation with virtual humans in virtual environment is considered as a research focus after movement simulation in field of artificial intelligence and simulation with virtual human include affective model and influence of affection to movement planning of virtual human. It{\textquoteright}s necessary to review on virtual human{\textquoteright}s affective model and related applied algorithm. A* algorithm is the main heuristic algorithm in artificial intelligence to search for the optimal solution of embodiment{\textquoteright}s path planning. In miscellaneous ergodic algorithms and heuristic search algorithms A* algorithm both has its own advantages. But facing more intricate virtual environment A* algorithm need to be improved by effective affective evaluation to get more flexible, comprehensive and humanized optimal path.}, keywords = {A* algorithm, Affective model, Movement planning, Optimal path, Virtual Human}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84866463534\&partnerID=40\&md5=9d6a46a01aa39f2875b7e69bd67a41e5}, author = {Liang, Z.} } @article {351, title = {Risk evaluation of rural financial organization operation based on the BP}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Export Date: 10 July 2014}, month = {2012}, pages = {341 - 346}, abstract = {The rural financial organization plays an important role in promoting the healthy development of the national economy especially the development of the rural economy. However, the rural financial organization risk especially the operating risk is still an outstanding problem. It has become a big obstacle in new countryside development. In this paper we analyzes the rural financial organization operational risk index firstly, then use these index as the input data for the BP neural network. After that we modeling rural financial organization operational risk early warning based the BP neural network. At last we take an experiment on a rural somewhere, the result shows that the BP neural network can reflect of the operation risk of the rural financial organization quickly and accurately.}, keywords = {BP Neural Network, Risk early warning, Risk evaluation, Rural finanical}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84870856910\&partnerID=40\&md5=85d32baadc606adc5051d555a7003b8a}, author = {Fan, S. and Zhao, Y. and Xie, H. and Li, C.} } @article {322, title = {Semantic-oriented integration and simulation-based analysis approach for healthcare information systems (HIS)}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Export Date: 10 July 2014}, month = {2012}, pages = {131 - 135}, abstract = {According to the unsystematic state of current health information systems integration and aiming to improve semantic interoperability, the approach for health information systems under SOA is studied in detailed. As for the system engineering, the concept of HIS integration is discussed. After that, a SOA-based health information system architecture and MDA-based modeling and simulation analysis approach are explored. Finally, a service-oriented integrated environment is designed.}, keywords = {Healthcare information system, MDA, Simulation analysis, SOA}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84866469913\&partnerID=40\&md5=59195f9ddbbe9698b622a0623d81497d}, author = {Song, L.-L. and Xie, J. and Huang, Z.-D.} } @article {325, title = {SERCID: A secure mechanism for data collection in wireless sensor networks}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Export Date: 10 July 2014}, month = {2012}, pages = {79 - 85}, abstract = {The unattended nature of wireless sensor networks makes them very vulnerable to malicious attacks. An adversary can physically compromise a subset of sensor nodes in a wireless sensor network to eavesdrop information. Due to some intrinsic features of wireless sensor network, it is difficult to perform efficient intrusion detection against malicious nodes in such a resource-restricted environment. In this paper, we propose a novel secure mechanism, SERCID for wireless sensor networks. The mechanism consists of a key-based secure routing algorithm and a counter-based intrusion detection algorithm. The approach is able to protect the data collection in a wireless sensor network even if there are malicious nodes in the network. The major contribution of our work is that we present an original approach to defend wireless sensor networks against both tampering and packet-dropping attacks, for the first time. We provide a relatively simple but reliable approach to support secure data collection in wireless sensor networks. Compared with existing research efforts, the proposed approach is easy to be implemented and performed in resourceconstrained wireless sensor networks.}, keywords = {Attack, Data collection, Encryption, Intrusion detection, Security, Wireless sensor network}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84866465185\&partnerID=40\&md5=ba314ed11d14004232b2fddcd4fa4ee8}, author = {Mao, Y.} } @article {357, title = {Snippets and component-based authoring tools for reusing and connecting documents}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Export Date: 10 July 2014}, month = {2012}, pages = {399 - 409}, abstract = {This paper presents the Snippet System, a new operating system environment that aims at providing enhanced document management facilities. For this, the proposed system utilizes a novel document model based on finer-grained entities, so-called Snippets. These support Relations, which capture the context of individual document excerpts. Snippets furthermore enable a flexible reuse of documents, i.e., user-defined excerpts can be included in several other documents with only selected properties remaining synchronized between different instances. Moreover, dedicated mechanisms allow for the efficient retrieval of these instances and thus support the user in keeping track of reused excerpts and synced properties. The Snippet System relies on a component-based authoring tool architecture that enables different authoring tools to collaborate for handling documents. This allows for combining the contents created by various tools in a single document, independently of the type of content and tools involved, thus making possible the reuse of documents and the definition of Relations across tool boundaries.}, keywords = {Applied computing, Authoring tools, Document management, Document management and text processing, Human-centered computing}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84874892012\&partnerID=40\&md5=559724084cafa42bb9580bae7e030bbe}, author = {Kirsch, L. and Botev, J. and Rothkugel, S.} } @article {317, title = {Special issue 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-84866449547\&partnerID=40\&md5=28d7bd0880f0712f199dfb5a32a06088}, author = {Tian, W. and Xie, M.} } @article {327, title = {Story segmentation of xinwenlianbo based on three-level criterion of content analysis}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Export Date: 10 July 2014}, month = {2012}, pages = {104 - 108}, abstract = {To detect the story boundary (SB) of Xinwenlianbo precisely, this paper proposes a method of three-level criterion story segmentation (SS) based on content analysis. For the story with anchorperson, this paper uses penny distance to judge whether the anchorperson gotten by video feature is true or not to look for SB; for the story without anchorperson, this paper looks for the SB by judging the shot change point occurs in the silence region. The experiment results show that the method can improve 6.98\% precision comparing with only using video feature in anchor detection and the error range can be decreased from 1.5 ~2.5 seconds to 0 ~0.5 second in SB without anchor by silence detection, which settles the problem of no precision boundary and video frame lost corresponding to silence for only using silence .The final precision of SS reaches 93.12\%.}, keywords = {Content analysis, Penalty distance, Story segmentation, Three-level criterion, Xinwenlianbo}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84866436585\&partnerID=40\&md5=4769d7d15e1441698955b8a3e0da0541}, author = {Yang, J.-C.} } @article {331, title = {A strategic search method for requirement-aware functional-block selection and composition in a flexible network}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Export Date: 10 July 2014}, month = {2012}, pages = {194 - 201}, abstract = {Internet applications have reached such a high complexity that the network stack concept introduced decades ago is not suitable anymore. Future Internet research activities try to increase the flexibility of the Internet in order to allow the network to adapt to present and future requirements and applications. A well known approach is to build protocol graphs, which will be used instead of inflexible network stacks, by connecting functional blocks together. A functional block encapsulates a particular network function. The protocol graph that should be used is the one most suitable to the application{\textquoteright}s requirements. To find the most suitable graph, all possible protocol graphs must be evaluated. However, the number of possible protocol graphs increases exponentially as the number of functional blocks increases. This article presents a method of modeling the protocol graph search space as a set of search trees and then using search strategies to manage the inherent complexity of the search process. We evaluate our proposed method by simulation.}, keywords = {Complexity, Composition, Flexible networks, Future internet, Protocol graph, Selection}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84866463034\&partnerID=40\&md5=b30673b530b454aa1a7fead4a7f771ad}, author = {G{\"u}nther, D. and Kerr, N. and M{\"u}ller, P.} } @article {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 {352, title = {Swarm-robot system based on wireless sensor network}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Cited By (since 1996):4Export Date: 10 July 2014}, month = {2012}, pages = {277 - 283}, abstract = {The study about the swarm-robot system is one of the most important directions of multitudinous robots system. It is an extraordinary challenged issue which how to communicate with each swarm-robot to cooperate together to accomplish a mission in numerous units. The swarm-robot system, which is based on CC2510 wireless sensor network, with the Radio Frequency of FHSS as the communication mode, has realized the swarm-robot unit sensor organ information coordination alternately fleet that improving the stability, interference immunity and transferability. The coordinating scheme possesses availability and practicability has been proved.}, keywords = {CC2510, Coordination, FHSS, Swarm-robot}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84870787456\&partnerID=40\&md5=1543551d520c6b04bd2a82a95ffe8283}, author = {Peng, J.-S. and Li, X. and Qin, Z.-Q. and Li, W.} } @article {326, title = {A taxonomic relationship learning approach for log ontology content event}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Export Date: 10 July 2014}, month = {2012}, pages = {109 - 113}, abstract = {To construct the log ontology is one of the main tasks of semantic Web usage mining. In order to discover the hierarchy of users{\textquoteright} visit interesting for web sites, we propose a taxonomic relationship learning approach for content events on log ontology. In this method, event is used to express the users{\textquoteright} visiting action, and content event is the semantic behavior of users{\textquoteright} visiting to the page content of sites. This method extracts the taxonomic relationship of content event by web document cluster based on swarm intelligence, which combines web content mining and web usage mining. This method improves the results of semantic Web usage mining and provides more decision-making for optimizing the structure of Web sites. The simulation experimental results show that this method is effective and quite feasible to solve practical problems.}, keywords = {Content event taxonomic relationship, Log ontology, Semantic web mining, Swarm intelligence}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84866440989\&partnerID=40\&md5=9e0960d7e083c77e4cd41cbb915068b6}, author = {Ming, S. and Qinghong, S. and Bo, C.} } @article {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 {339, title = {Webbing semantified scholarly communication datasets for improved resource discovery}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Export Date: 10 July 2014}, month = {2012}, pages = {245 - 253}, abstract = {The success of Linked Data project has played a vital role in the realization of the Semantic Web on a global stage. It has motivated people to publish datasets which are important for information linking, resource discovery and can further make contributions in shaping the Web as a single connected data space. This effort has successfully amassed a variety of Linked Data and has introduced many novel ways for the publishing of data. As a result, putting Linked Data online has become rather easy, but actually linking the data with already existing data in the cloud and further on presentation of post-interlinking data are still researchable challenges. The search and identification of relevant datasets as well as devising a strategy for linking to these datasets with post-organization of interlinked data for human perceivable presentation is still a difficult task. In this paper, a novel approach is presented which 1) highlights and implements the steps involved in the interlinking process and 2) proposed a proof of concept application for automatic generation of an organized profile for post interlinked data presentation. These approaches are applied and presented as a case study focusing on interlinking scholarly communication datasets and highlighting the potential benefits of Linked Data. This study has interlinked two semantified scholarly datasets and was successfully able to discover new resources which were further organized into profile for showcasing potentials of Linked Data.}, keywords = {Case study, Interlinking scholarly datasets, Linked Open Data (LOD), Semantic web}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84866447762\&partnerID=40\&md5=15e762eee3e9e8e6b5060785d45a923c}, author = {Latif, A. and Tochtermann, K.} } @article {333, title = {Word combination kernel for text categorization}, journal = {Journal of Digital Information Management}, volume = {10}, year = {2012}, note = {Export Date: 10 July 2014}, month = {2012}, pages = {202 - 211}, abstract = {We proposed a novel kernel for text categorization. This kernel is an inner product in the feature space generated by all word combinations of specified length. A word combination is a collection of different words co-occurring in the same sentence. The word combination of length k is weighted by the k-th root of the product of the inverse document frequencies (IDF) of its words. A computationally simple and efficient algorithm was proposed to calculate this kernel. By restricting the words of a word combination to the same sentence and considering multi-word combinations, the word combination features can capture similarity at a more specific level than single words. By discarding word order, the word combination features are more compatible with the flexibility of natural language and the dimensionality this kernel can be reduced significantly compared to the word-sequence kernel. We conducted a series of experiments on the Reuters-21578 dataset and 20 Newsgroups dataset. This kernel consistently achieves better performance than the classical word kernel and word-sequence kernel on the two datasets. We also assessed the impact of word combination length on performance and compared the computing efficiency of this kernel to those of the word kernel and word-sequence kernel.}, keywords = {Kernel methods, Machine learning, Support vector machine, Text classification, Word-combination kernel}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84866439932\&partnerID=40\&md5=8649dfc8c1ee23ca70f2b137a74a19e4}, author = {Zhang, L. and Hu, X. and Qin, S.} } @article {261, title = {Application of Esscher transformed Laplace distribution in Web server data}, journal = {Journal of Digital Information Management}, volume = {9}, year = {2011}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2011}, pages = {19 - 26}, abstract = {In this article, we introduce an alternative distribution, namely Esscher transformed Laplace distribution good enough to model the fle size distribution of Web servers. It exhibits asymmetry, peakedness and tail heaviness, which are common features of fle size data. Esscher transformed Laplace distribution belongs to one parameter regular exponential family. We derive their representations and obtain explicit forms for their densities, distribution functions and quantile functions. Also the probability R = P(X > Y) and an asymptotic confdence interval for R, when X and Y are two independent but not identically distributed Esscher transformed Laplace variables are estimated and its application in the service performance of a Web server is discussed. Extensive simulation studies are carried out to study the performance of these estimators. Finally using real data, we established the goodness of ft of the proposed distribution to the fle size distribution of a Web server data.}, keywords = {Asymptotic confdence interval, Esscher transformation, Esscher transformed Laplace distribution, File size distribution, Heavy tail distribution}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-79960684244\&partnerID=40\&md5=df49fdec131cd1ab8f2b958022b553e6}, author = {George, D. and George, S.} } @article {300, title = {Application research on bp neural network pid control of the belt conveyor}, journal = {Journal of Digital Information Management}, volume = {9}, year = {2011}, note = {Export Date: 10 July 2014}, month = {2011}, pages = {266 - 270}, abstract = {In order to control reasonably the acceleration and dynamic tension in full-load starting process of conveyor system, accurate design techniques should be adopted. This paper selects the viscoelasticity model suiting to the belt by comparing dynamic performance of some kinds of models, and develops simulation model of driving device with feedback control, which indicating that motor rotation speed and its output torque vary with load and time. For belt conveyors, it has high nonlinear trait, PID controller with fixed parameter can not achieve good performance index. So the PID controller based on neural network is proposed. This design regards belt conveyors as a control object, by analyzing danamic model of belt conveyors, the design of related neural network PID control system based on BP neural network is provided. The BP-ANN is designed with three layers which are input-layer, hidden-layer and output layer in consideration of the control system real time requirement. The results show that the controller based on the neural networks can improve the robustness of the system and has better adaptabilities to the model and environments, compared with the classical PID control, therefore the simulation results are more close to practice.}, keywords = {Belt Conveyor, BP Neural Network, Dynamic model, PID controller}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84855380085\&partnerID=40\&md5=8f75d8ae8fabd7ffd683a7b47b40c795}, author = {Xi, P. and Song, Y.} } @article {296, title = {Application-level solution for data integration in ubiquitous computing environment}, journal = {Journal of Digital Information Management}, volume = {9}, year = {2011}, note = {Export Date: 10 July 2014}, month = {2011}, pages = {233 - 241}, abstract = {The Ubiquitous Computing envisions a world of communicating mobile devices and sensors. Advances in wireless communications raise users{\textquoteright} expectations about the accessibility of information in Ubiquitous Computing environments. Getting meaningful information from disparate sensor nodes and/or mobile devices spread in Ubiquitous Computing environment is an urgent task. On the one hand, the heterogeneity of the sensor nodes makes share and finding data at the mobile devices and sink nodes much harder. On the other hand, nodes in Ubiquitous Computing environment are highly dynamic which means query planning in Ubiquitous Computing environment should be able to dynamically re-make their plan when the network conditions change due to intermittent connectivity. To address these two issues, this paper proposes a new service-oriented framework(called UCDS, standing for Ubiquitous Computing Data Services ) at application-level, which supports for semantic integration and querying of heterogeneous data sets distributed over the Ubiquitous Computing environment. We propose a RDF-View-based approach for mobile data mediation, and describe the service-composition-based query planning algorithm implemented in UCDS. We explore an ontology based approach to, mapping mobile data to data services (DS for short), publishing DS with the shared domain ontology. We also explore dynamically evolving service interface enabled by richly service description capability using the semantic web languages, and answering queries through DS composition. Experimental results show that the approach adopted by UCDS provides a better performance compared with the conventional approach.}, keywords = {Data integration, Query processing, Service composition, Ubiquitous Computing Data Services}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84855403966\&partnerID=40\&md5=c0fbe9d31dec46666f6361a5d9fb7a72}, author = {Zhou, L. and Zhang, Y. and Guan, B.} } @article {293, title = {Applications classification and scheduling on heterogeneous hpc systems using experimental research}, journal = {Journal of Digital Information Management}, volume = {9}, year = {2011}, note = {Export Date: 10 July 2014}, month = {2011}, pages = {227 - 232}, abstract = {Heterogeneous high-performance computing (HPC) systems have been proposed as a power efficient alternative to traditional homogeneous systems. In heterogeneous HPC system, fast CPUs which have complex pipelines, high clock frequencies as well as high power consumption are combined with slow ones which have simple pipelines, low clock frequencies as well as low power consumption. Different types of applications should be distributed to run on different type of CPUs, in order to achieve a trade-off between energy and performance. In this paper, we use experimental research to investigate the applications classifications which categorize each application as the CPU-intensive, memory-intensive, or phase-change application. We also conduct some experiments to measure the current, power, and energy of different types of applications. Afterwards, a scheduling method for applications on heterogeneous HPC systems is proposed. The experiment shows that the scheduling method can trade off the latency and energy consumption based on the applications classification and measurement.}, keywords = {Applications Classification, Heterogeneous Systems, High Performance Computing, Scheduling}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84855410151\&partnerID=40\&md5=442c0fa54ceef88eed0bc85373d116ff}, author = {Xia, Y. and Zhu, M. and Kuang, L. and Ma, X.} } @article {281, title = {B-mail: A brain-controlled mail client}, journal = {Journal of Digital Information Management}, volume = {9}, year = {2011}, note = {Export Date: 10 July 2014}, month = {2011}, pages = {167 - 170}, abstract = {For centuries, humans fantasized about the idea of controlling objects only by thoughts. In the last decade, this idea has shifted from fantasy or science fiction to reality. Brain Computer Interfaces (BCI) have made this a reality. A BCI is a communication channel between the brain and a computer program or application. It allows the development of new applications that provide assistance to people with disabilities in regular everyday activities, making them accessible and easy to perform. We present in this paper a simple yet efficient email client which enables severely motor-disabled people to open, compose, send, reply and forward emails. It performs a real-time classification of user{\textquoteright}s brain activity signals using the P300 technique and performs the appropriate corresponding actions.}, keywords = {Assistive technology, Brain computer interface, Mail client, P300-Technique, People with disabilities}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-80053115577\&partnerID=40\&md5=a1ba320d72ea04d8618894cb42e306fb}, author = {Gannouni, S. and Alrayes, N. and Alsaudi, A.A.A. and Alabdulkareem, A.} } @article {285, title = {A combined measure of semantic web and meta tag technology for web retrieval}, journal = {Journal of Digital Information Management}, volume = {9}, year = {2011}, note = {Export Date: 10 July 2014}, month = {2011}, pages = {219 - 222}, abstract = {Increasingly web is used for tracking numerous information pieces of large and complex data. Normal way of accessing these sources using web search engines has many limitations and we have enough literature to document them. This study is an enhancement to trap the discovery of targeted information pieces which are normally failed cases in search engines. We use an integrated approach of conventional web search and semantic web by carefully constructed algorithms. The algorithms are tested to track data about the gulf institutions. The experiments provide encouraging results and enable us to draw future directions of research in this domain.}, keywords = {Gulf institutions, Institutions profiles, Semantic web, Web construct data}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84855373332\&partnerID=40\&md5=941434981b3a9f7b76faa977d407fee3}, author = {Al Reyaee, S.} } @article {301, title = {Construction of a teaching resources sharing platform based on campus network}, journal = {Journal of Digital Information Management}, volume = {9}, year = {2011}, note = {Export Date: 10 July 2014}, month = {2011}, pages = {261 - 265}, abstract = {This paper constructs a teaching resources sharing platform based on campus network, which has integrated the existing digital teaching resources, and collected the scattered resources together and improved the whole unreasonable resources layout, repetitive construction and so on. Since the network is convenient and real-time, it is suited to be applied to the traditional classroom teaching. The teaching resources share platform can not only help students to make full use of information technology tools for the realization of personalized learning, but also can strengthen the learning interests and enthusiasms of the students.}, keywords = {Campus Network, Sharing Platform, Teaching Resources}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84855387451\&partnerID=40\&md5=689dd41b71fa90672a3a7e7a46026765}, author = {Tian, W.} } @article {297, title = {The design and challenges of online reprogramming system for wireless sensor networks}, journal = {Journal of Digital Information Management}, volume = {9}, year = {2011}, note = {Cited By (since 1996):2Export Date: 10 July 2014}, month = {2011}, pages = {255 - 260}, abstract = {At present, the online network reprogramming faces two challenges: 1) How to save the energy consumed during the code dissemination; and 2) How to enhance the security of online network reprogramming. In this paper, we modify the work flow of online reprogramming system and separates an alone reprogramming component from the whole program image which need not be transmitted in order to reduce the energy consumption. According to the security vulnerabilities in the image management aspects of code dissemination, acipher puzzle-based image management algorithm is proposed. According to the based-request attacks, several counter measures are introduced in our online reprogramming system, such as secure broadcast authentication based on cluster keys and the request count technique. By integrating several key techniques, our online reprogramming system can securely and energy-efficiently disseminate the new program image into the whole WSNs.}, keywords = {Authentication, Hash Key Chain, Online Network Reprogramming, Wireless sensor networks}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84855387891\&partnerID=40\&md5=a4ce74298f75f1a849cd6ed7c203d24f}, author = {Xie, M. and Zhang, G.} } @article {303, title = {The design and implementation of the digital down converter based on the improved dds and dspbuilder techniques}, journal = {Journal of Digital Information Management}, volume = {9}, year = {2011}, note = {Export Date: 10 July 2014}, month = {2011}, pages = {281 - 286}, abstract = {DDC (Digital Down Converter), as a key part of digital receivers, aims to get low-speed digital baseband signals by extracting and filtering the digital signals transformed by high-speed ADC (Analog Digital Conversion). This paper employs the multi-rate process technique to design the DDC, i.e. firstly conducting data CIC (Cascade Integrator Comb) extraction, then HBF (Half-Band Filtering) and at last low pass filtering. CIC, which doesn{\textquoteright}t need multiplication, can realize high speed filtering and the HBF has high operation efficiency and good realtime performance. FPGA realization is taken into full consideration during the project design of the top. In the end, this paper adopts the Simulink instrument in MATLAB and combines Altera{\textquoteright}s signal processing toolbox-DSPBuilder to implement the design scheme by the FPGA. It focuses on the description of FPGA implementation of the digitally controlled oscillator, CIC filter, half-band extracting filter and the low pass filter.}, keywords = {Digital Down Converter, Direct Digital Synthesizer, DSPBuilder}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84855395419\&partnerID=40\&md5=64afa914e4030e52506b12f1d4b5d816}, author = {Zhang, G. and Xie, M.} } @article {290, title = {Detecting human sentiment from text using a proximity-based approach}, journal = {Journal of Digital Information Management}, volume = {9}, year = {2011}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2011}, pages = {206 - 212}, abstract = {Sentiment analysis seeks to characterize opinionated or evaluative aspects of natural language text thus helping people to discover valuable information from large amounts of unstructured data. Sentiment analysis can be used for grouping search engine results, analyzing news content, reviews for books, movie, sports, blogs, web forums, etc. Several methods have been proposed for sentiment analysis at word, sentence, and document levels mostly based on common machine learning techniques. In this paper we explore a new methodology for sentiment analysis by considering a new set of features based on word proximities in a written text. We propose three proximity-based features, namely, proximity distribution, mutual information between proximity types, and proximity patterns. We applied this approach to the analysis of movie reviews, drug reviews, and music reviews. Our experimental results show that proximity-based sentiment analysis is able to extract sentiments from a specific domain, with performance comparable to the state-of-the-art. To the best of our knowledge, this is the first attempt at focusing on only proximity-based features as the primary cues in sentiment analysis.}, keywords = {Machine learning, Movie reviews, Proximity analysis, Sentiment analysis, Text mining}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84855397249\&partnerID=40\&md5=a009c46b7b54e127e88ca882940b9767}, author = {Hasan, S.M.S. and Adjeroh, D.A.} } @article {294, title = {A dynamic role-based authorization model in grid environment}, journal = {Journal of Digital Information Management}, volume = {9}, year = {2011}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2011}, pages = {242 - 248}, abstract = {In large-scale grid environment, the authorization plays a vital role in access control to resources. For the demand of higher dynamicity, complexity and granularity on grid environment, a novel model named dynamic role-based access control (DRBAC) based on RBAC model is presented. DRBAC introduces conceptions of several objects such as rolegraph initial structure, atom role and middle role, and it can automatically adjust the role-graph{\textquoteright}s structure through dynamically adding new roles or deleting original roles. The authorization mechanism which combines DRBAC model and CAS servers provides an effective method to solve loading and security problems. Theoretical analyses and example demonstrate that it is of high safety and has good time and space complexity when authorizing.}, keywords = {CAS server, DRBAC, Dynamic role}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84855373392\&partnerID=40\&md5=1f10e75d6a2d4f01105000efde1e9fdc}, author = {Sun, W. and Guo, C. and Zhang, P. and Zhang, N. and Wang, H.} } @article {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 {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 {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 {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 {266, title = {Fast remote user authentication scheme with smart card based on quadratic residue}, journal = {Journal of Digital Information Management}, volume = {9}, year = {2011}, note = {Export Date: 10 July 2014}, month = {2011}, pages = {51 - 54}, abstract = {There are many kinds of online services in our daily life, such as e-mail and messenger. When we link to a remote host, we are required to login first, supplying a username and the corresponding password, and then obtain the resources or have services. Most commonly, we might use a smart card to assistant us to login a remote site. In 1981, Lamport proposed a remote authentication scheme for communication through insecure channels. Lu and Cao further proposed an efficient scheme based on quadratic residue in 2005. In the Lu-Cao scheme, it is unnecessary for the server to store the verification table. However, some obvious drawbacks are that users cannot freely choose their own passwords and their scheme is inefficient due to complex computations. In this paper, we proposed an improvement of the Lu-Cao scheme to make it more efficient and secure.}, keywords = {Password authentication, Quadratic residue, Smart card, Verification table}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-79960674401\&partnerID=40\&md5=9e6a08e95cf41ee5f01ee9be34b06573}, author = {Wu, T.-S. and Lin, H.-Y. and Lee, M.-L. and Chen, W.-Y.} } @article {280, title = {Froglingo, a programming language empowered by a total-recursive-equivalent data model}, journal = {Journal of Digital Information Management}, volume = {9}, year = {2011}, note = {Export Date: 10 July 2014}, month = {2011}, pages = {134 - 146}, abstract = {The EP (Enterprise-Participant) data model is a language homomorphic to and semantically equivalent to a class of total recursive functions. It takes a unique position in the fields of programming languages and database management. Mathematically, it enables a programming language to achieve the greatest possible ease of use in software development and maintenance. (This assumes that a programming language incorporated with a higher expressive data model was easier than another one with a lower expressive data model, or no data model at all.) Practically, Froglingo - a programming language incorporated with the EP data model is a monolith that consolidates multiple software components of traditional software architecture. In addition, Froglingo is untyped, i.e., programmers write application programs without a necessity of user-defined types. Finally, Froglingo is a novel approach to many challenges facing traditional technologies, including feature scalability, user interface flexibility, and similarity. In this paper, we show with further clarity the concept of ease of use by proposing a mathematical definition for the concept of data models and by relating Froglingo with other programming language through the analysis of types and higher-order functions.}, keywords = {EP data model, Froglingo programming langauge, Higher-order functions, Knowledge management, Total-recursive equivalence}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-80053114137\&partnerID=40\&md5=1d550173b3aa984474c5a8e1930a465a}, author = {Xu, K. and Zhang, J. and Gao, S.} } @article {298, title = {Fusion user browsing behavior and user interests autonomous control of personalized search results sort}, journal = {Journal of Digital Information Management}, volume = {9}, year = {2011}, note = {Export Date: 10 July 2014}, month = {2011}, pages = {271 - 275}, abstract = {Reference simplifies the ODP concept, establish a user hierarchical structure can be controlled autonomously interest preference expression of use interests model. Meanwhile, from the user{\textquoteright}s browsing behavior can reflect the user{\textquoteright}s interest in starting, this paper analyzes the relationship between the user{\textquoteright}s browsing behavior and user interest. Considering both the times of page visiting and the browsing speed for the degree of use interest, as well as the similarity of the page keywords and a single user interest point, the index can be obtained for evaluating whether a page meets the user interest preference. Utilizing it as search results of evaluation indexes, search results sorting. Further analysis under different integrity of user interests of description and different results processing under the way of sorting effect, through individual apiration is decided according to user{\textquoteright}spersonal interest in server-side describe file integrity of, will be willing to disclosure of personal information stored in the search engine server in order to improve the quality of the search results, sensitive personal information retained in local client, reach users privacy protection effect.}, keywords = {Degree of User Interest, Personalized Search, Privacy protection, Sort Search Results, User Interest Model, User{\textquoteright}s Browsing Behaviors}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84855413177\&partnerID=40\&md5=42962ce43dcfb6f7b617b32ec5cecdcd}, author = {Li, J. and Wang, H. and Guo, Y.} } @article {272, title = {Improving data management in a distributed environment}, journal = {Journal of Digital Information Management}, volume = {9}, year = {2011}, note = {Export Date: 10 July 2014}, month = {2011}, pages = {122 - 125}, abstract = {Users of distributed systems often detect performance problems of different types and sources which can sometimes be difficult to trace down to aspecific cause due to the complex structure of distributed systems. However, determining the source of the performance problem is highly critical in finding an efficient solution. Managing data fragments on different nodes is one of the major sources of such a problem and is considered as a big challenge facing system developers and designers in a distributed environment.}, keywords = {Distributed Database System, Distribution, Fragmentation, Query}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-80052973755\&partnerID=40\&md5=d554854694c349305ec91c3b7ac7585f}, author = {Abdalla, H.I.} } @article {277, title = {In this issue}, 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-80053021313\&partnerID=40\&md5=e40f73bbb38dd7a90bd87090e7b864b8} } @article {269, title = {In this issue}, 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-79960689567\&partnerID=40\&md5=6c6fae2483a2f61a738518e0e1e6a5e2} } @article {264, title = {In this issue}, 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-79960685616\&partnerID=40\&md5=ddd0379845a601b346b8e9e4029418ea} } @article {274, title = {Information system decomposition quality}, journal = {Journal of Digital Information Management}, volume = {9}, year = {2011}, note = {Export Date: 10 July 2014}, month = {2011}, pages = {106 - 110}, abstract = {Object-oriented design is becoming very popular in today{\textquoteright}s software development. An object-oriented information system is decomposed into subjects, each subject is decomposed into classes of objects. Good object-oriented system design should exhibit high cohesion inside subjects and low coupling among subjects. Yet, few quantitative studies of the actual use of cohesion and coupling have been conducted at the system level. These two concepts are defined qualitatively, and only at the class level, not at the system level. In this work, metrics are introduced for cohesion and coupling and used to define a quality metric at the system level. The feasibility of the approach is demonstrated by an example using a real information system.}, keywords = {Object oriented information systems, System architecture, Systems quality}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-80053018512\&partnerID=40\&md5=2c5417786ce4b94abbf252ab4ac6f666}, author = {Tagoug, N.} } @article {286, title = {Locality preserving scheme of text databases representative in distributed information retrieval systems}, journal = {Journal of Digital Information Management}, volume = {9}, year = {2011}, note = {Export Date: 10 July 2014}, month = {2011}, pages = {193 - 198}, abstract = {This paper proposes an efficient and effective "Locality Preserving Mapping" scheme that allows text databases representatives to be mapped onto a global information retrieval system such as Peer-to-Peer Information Retrieval Systems (P2PIR). The proposed approach depends on using Locality Sensitive Hash functions (LSH), and approximate min-wise independent permutations to achieve such task. Experimental evaluation over real data, along with comparison between different proposed schemes (with different parameters) will be presented in order to show the performance advantages of such schemes.}, keywords = {Locality preserving mapping, Peer-to-Peer systems, Text analysis}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84855374323\&partnerID=40\&md5=f56ad390368eb3d75500b51f46ddceb5}, author = {Hassan, M. and Al-Lahham, Y.A.} } @article {260, title = {LTSC-128: Stream cipher based on the intractable Shortest Vector Problem in Lattice}, journal = {Journal of Digital Information Management}, volume = {9}, year = {2011}, note = {Export Date: 10 July 2014}, month = {2011}, pages = {27 - 32}, abstract = {LTSC-128 is a high secure stream cipher based on the hardness of the Shortest Vector Problem in Lattice space. The cipher is based on vectors multiplication over finite fieldo, wnhoetrerea these vectors are represented by polynomials to enhance the performance of keystream generation. The key size is 128 bits and there is no attack faster than exhaustive key search has been identified. The experimental results showed that the encryption rate of LTSC-128 is about 50Mbit/second. LTSC-128 cTipher co has additional feature that its performance can be inpcrroecaesdedure by applying multithreading technique on multi-core processors. The multithreaded version of LTSC-128 has achieved better encryption rate of 71Mbit/second on dual-core processor.}, keywords = {Encryption, Lattice, Multithreading, NP-hard problem, Shortest Vector Problem, Stream cipher}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-79960657199\&partnerID=40\&md5=b4fe242766b77ba21be7e3f6815f31d7}, author = {Suwais, K. and Samsudin, A.} } @article {279, title = {New technique to deal with dynamic data mining in the database}, journal = {Journal of Digital Information Management}, volume = {9}, year = {2011}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2011}, pages = {147 - 152}, abstract = {Data mining is a part of a process called KDDKnowledge Discovery in Databases. This process consists basically of steps that are performed before carrying out data mining, such as data selection, data cleaning, pre-processing, and data transformation [1, 2]. There may be thousands or millions of records that have to be read and to extract the rules for, but the question is what will happen if there is new data, or there is a need to modify or delete some or all the existing set of data during the process of data mining. Also real-world databases are highly susceptible to noise, missing, and inconsistent data due to their typically huge size, often several gigabytes or more. The questions here are; how can the data be preprocessed in order to help improve the quality of the data, and consequently the mining results? How can the new updated data be preprocessed in order to help improve the quality of the data, efficiency, and simplify of the mining process? Therefore the purpose of this study is to find solutions (Item-summation) for dynamic data mining process that is able to take into considerations all updates (insert, update, and delete problems) into account.}, keywords = {Data mining process, Itemsummation, Static Data Mining}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-80053118883\&partnerID=40\&md5=c7d5459975035a08f96fa6900e7ba739}, author = {Abdalla, H.I.} } @article {271, title = {Novel scanned beam millimeter-wave antenna using micromachined variable capacitors on coplanar structures}, journal = {Journal of Digital Information Management}, volume = {9}, year = {2011}, note = {Export Date: 10 July 2014}, month = {2011}, pages = {117 - 121}, abstract = {This paper presents a new approach of modelling, design, and characteristics of variable radio frequency microelectromechanical system (RF-MEMS) capacitor integrated on leaky wave antenna (LWA) operating at 94 GHz. This antenna was implemented on grounded coplanar waveguide (CPW). A 2D distributed mathematical model for the capacitor has been developed alongthis paper; we formulate and solve the static and dynamic problems associated with the proposed RF-MEMS capacitor. The obtained results are in good agreement with the ANSYS simulations. A full-wave simulation was used to investigate the microwave performances of the proposed antenna. This prototype exhibits continuous tuning radiation angle and beamwidth capability by tuning bias voltages from 0 V to 60 V. The proposed antenna presents flexibility, high directivity, compact size, and low-cost characteristics. The LWA can be used in applications which require high-performance such as imaging arrays and collision-avoidance radars.}, keywords = {CPW, DQM, LWA, MEMS, Millimeter-waves, Surface micromachining}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-80053034494\&partnerID=40\&md5=86725cbb55db5daaeae532550fd98ef2}, author = {Hamdi, A. and Samet, A.} } @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 {267, title = {Password based anonymous authentication with private information retrieval}, journal = {Journal of Digital Information Management}, volume = {9}, year = {2011}, note = {Export Date: 10 July 2014}, month = {2011}, pages = {72 - 78}, abstract = {This paper focuses on authentication with three types of entities: a user who sends an authentication request, a service provider who receives and verifies the request, and a database who supplies the service provider with information for verifying the request. This paper presents novel authentication protocols that satisfy the following important properties: (1) secure against replay attacks and (2) the database cannot identify which user is authenticating. First, we show a protocol which satisfies Properties (2). Second, we show a protocol which satisfies Properties (1) and (2). A key idea of our authentication protocols is to use private information retrieval (PIR) [Chor et al. J. ACM, 1998].}, keywords = {Anonymity, Authentication, Privacy protection, Private information retrieval}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-79960675855\&partnerID=40\&md5=0726c99925b632851b1817cb7859e931}, author = {Nakamura, T. and Inenaga, S. and Ikeda, D. and Baba, K. and Yasuura, H.} } @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 {259, title = {A practical and secure buyer-seller watermarking protocol}, journal = {Journal of Digital Information Management}, volume = {9}, year = {2011}, note = {Cited By (since 1996):2Export Date: 10 July 2014}, month = {2011}, pages = {43 - 47}, abstract = {Digital watermarking is an emerging technology for combating copyright piracy. In real applications, the transaction between a buyer and a seller is done through a specific watermarking protocol, which enables the seller to successfully identify a traitor from a pirated copy, while preventing the dishonest seller from framing an inno cent buyer. In this paper, we propose a new buyer-seller watermarking protocol. Compared to the previous works, it makes two improvements, which make it more practi cal. First, no third party is introduced and hence, the problem of the seller (or buyer) colludes with a third party to cheat the buyer (or seller) is solved. Second,a double watermark insertion is avoided, and then the final quality of the watermarked content is higher and the result of the watermark detection is more accurate.}, keywords = {Copy deterrence, Digital copyright protection, Digital watermarking, Watermarking protocol}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-79960684787\&partnerID=40\&md5=2a64f864f0b47aac9775c3f7d261c7e0}, author = {Hu, D. and Li, Q.} } @article {270, title = {A practical U-healthcare network with security and QoS}, journal = {Journal of Digital Information Management}, volume = {9}, year = {2011}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2011}, pages = {87 - 94}, abstract = {As a consequence of rapid technological development, the normally isolated medical sensor platform is gradually being integrated into networks. However, most ubiquitous or mobile health systems are lacking a system that combines both network security and QoS (Quality of Service). This paper investigates the possible security and QoS methods of a ubiquitous healthcare network platform in OSI (Open System Interconnections)-layers. This network platform is based on the Wireless Overlay Networks (WON) Bluetooth, 802.11 and 802.16 over IPv6 network, and provides a secure and stable U-healthcare platform by including the application of healthcare sensors with RFID, U-healthcare PDA, VoIPv6, falling detection, and patient orientation.}, keywords = {Healthcare, IPv6 network, QoS, Security, Ubiquitous}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-79960689974\&partnerID=40\&md5=ac1cfe986d44de663237d411cebdc5cc}, author = {Huang, S.-Y. and Hung, C.-C. and Lee, C.-C.} } @article {288, title = {Querying and ranking xml documents based on data synopses}, journal = {Journal of Digital Information Management}, volume = {9}, year = {2011}, note = {Export Date: 10 July 2014}, month = {2011}, pages = {199 - 205}, abstract = {There is an increasing interest in recent years for querying and ranking XML documents. In this paper, we present a new framework for querying and ranking schema-less XML documents based on concise summaries of their structural and textual content. We introduce a novel data synopsis structure to summarize the textual content of an XML document for efficient indexing. More importantly, we extend the traditional vector space model to effectively rank XML documents over the proposed data synopses. We conduct extensive experiments over XML benchmark data to demonstrate the advantages of the indexing scheme and the effectiveness of our ranking scheme. We also compare our framework with Lucene to demonstrate our extended TF*IDF scoring function is effective.}, keywords = {Document ranking, Query processing, Query synopses, XML}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84855362331\&partnerID=40\&md5=85a8a3de60a877da1d0a3495eaf27e22}, author = {He, W. and Lv, T.} } @article {295, title = {Reasoning on context satisfiability for service recommendation in mobilenetwork}, journal = {Journal of Digital Information Management}, volume = {9}, year = {2011}, note = {Export Date: 10 July 2014}, month = {2011}, pages = {249 - 254}, abstract = {The Ubiquitous Computing envisions a world of communicating mobile devices. As mobile devices usually have limited resources, it brings up the challenge to search and invoke services at any time and any place in an accurate, efficient and adaptive way. In this paper, we propose to filter services by matchmaking the precondition of service invocation and the context information of service consumer, in order to increase the accuracy and adaptivity of service discovery and recommendation in mobile environment. We construct context ontology to describe the environment when a service consumer submits service request first. And then, we propose to formalize the precondition of a successful service invocation based on a lightweight DL theory. Finally, reasoning on context satisfiability can be used for service recommendation. A case study shows our approach works well.}, keywords = {Context Satisfiability, Precondition Formalization, Service Reasoning, Service Recommendation}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84855397903\&partnerID=40\&md5=409b304a3bf247ee3b6d37e361841e41}, author = {Kuang, L. and Chen, L. and Xia, Y.} } @article {289, title = {Reconfiguration of graphical user interface}, journal = {Journal of Digital Information Management}, volume = {9}, year = {2011}, note = {Export Date: 10 July 2014}, month = {2011}, pages = {213 - 218}, abstract = {The usability and the prime value of a software product increases proportionately with the number of different types of users supported and the number of different types of services provided at any one time by the product. The user interface for the product plays a critical role in this context. In this paper, the authors describe a dynamically reconfigurable graphical user interface for a web-based application. The user interface for this application is designed as a collection of controls. The users will not only be able to view selective information from the user interface, but also will be able to rearrange the controls on the user interface. In addition, users will also be able to introduce new controls and modify existing controls on the user interface without manually recompiling the original code thus achieving greater flexibility and saving time. The paper illustrates this dynamic reconfiguration of user interface through a case study on a health care application.}, keywords = {Dynamic reconfiguration, Graphical user interface}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84855393429\&partnerID=40\&md5=b5e09662f0a73d94b82934fd0f54d7df}, author = {Periyasamy, K. and Perkinian, V.} } @article {268, title = {A refined methodology for automatic keyphrase assignment to digital documents}, journal = {Journal of Digital Information Management}, volume = {9}, year = {2011}, note = {Export Date: 10 July 2014}, month = {2011}, pages = {55 - 63}, abstract = {Keyphrases precisely express the primary topics and themes of documents and are valuable for cataloging and classification. Manually assigning keyphrases to existing documents is a tedious task; therefore, automatic keyphrase generation has been extensively used to classify digital documents. Existing automatic keyphrase generation algorithms are limited in assigning semantically relevant keyphrases to documents. In this paper we have proposed a methodology to refine the result set of automatically generated keyphrases by Keyphrase Extraction Algorithm (KEA++), so that the keyphrases accurately and precisely represent the content of the document. Our approach is an additional layer at the top of KEA++ and exploits semantic relationships and hierarchical structure of the controlled vocabulary to filter out irrelevant keyphrases from the result set generated by KEA++. The methodology was applied on different sets of academic publications for evaluation. Evaluation demonstrates that the proposed refinement methodology improves the quality of generated keyphrases.}, keywords = {Automatic indexing, Keyphrase assignment, Vocabulary}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-79960690550\&partnerID=40\&md5=aeb220f4fd01fa335a93432979341abe}, author = {Khan, S. and Fatima, I. and Irfan, R. and Latif, K.} } @article {302, title = {Research on color consistency for color marketing in network transactionsystem based on color management}, journal = {Journal of Digital Information Management}, volume = {9}, year = {2011}, note = {Export Date: 10 July 2014}, month = {2011}, pages = {276 - 280}, abstract = {Color consistency is one of the key techniques for color marketing in color reproduction in network transaction system. A new color management method is presented based on analyzing the color rendering principles of scanned input images. Firstly, the method substitutes color blocks in color shade district in standard color target for complete color space to solve the difficulties of color sample selection. Secondly, contraction-expansion curve fitting algorithm is improved to improve its search efficiency and decrease its calculation. Thirdly, parameters of Yule-Nielson equation are reinterpreted, making them applied for non-printing dot image which only can be used for printed dot image originally and then the color conversion model for scanned images is deduced gradually though single color, double color and tricolor conversion correction. Finally the experimental results show that the model can improve scanner color conversion accuracy and can guarantee color consistency in color marketing in electronic business system in practice.}, keywords = {Color Management, Color Reproduction, Contraction-expansion Curve Fitting, Yule-Nielson Equation}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84855376957\&partnerID=40\&md5=0b49993c20664cc749d00431998517a2}, author = {Li, X.} } @article {283, title = {Role of segment progressive filter in dynamic data mining}, journal = {Journal of Digital Information Management}, volume = {9}, year = {2011}, note = {Export Date: 10 July 2014}, month = {2011}, pages = {171 - 175}, abstract = {Association rule mining perhaps the most widely described technique among the minding paradigms. The temporal association rule mining in the association rule mining tries to find relations among items in datasets. The temporal association mining has strength in detecting the dynamic nature of databases. Unfortunately the current mining methods ignore the consideration of database content updates. In the current research we have introduced the Incremental Standing method for Segment Progressive Filter (ISPF). The proposed technique can support the database update and mine updated datasets. We prove that the proposed algorithm is an optimal way of mining. We have applied the scan reduction technique to generate all candidate k-item sets to form 2-candidate item sets directly. We also bring good experimentation to validate and document clearly the algorithm with good examples.}, keywords = {Mining algorithms, Segment Progressive Filter, Temporal association rules}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-80053099423\&partnerID=40\&md5=e113d860dc0339efdd1f9af97d9c9121}, author = {Naqvi, M. and Hussain, K. and Asghar, S. and Fong, S.} } @article {284, title = {Route maintenance using link state prediction for dense mobile Ad hoc networks}, journal = {Journal of Digital Information Management}, volume = {9}, year = {2011}, note = {Export Date: 10 July 2014}, month = {2011}, pages = {153 - 158}, abstract = {An ad hoc network is a multi-hop wireless network formed by a collection of mobile nodes without the intervention of fixed infrastructure. Limited bandwidth and a high degree of mobility require that routing protocols for ad hoc networks be robust and simple. In mobile ad hoc networks (MANETs), node mobility causes network topologies to change dynamically over time, which complicates the important tasks such as route discovery and maintenance. Most of the routing algorithms usually focus on how to discover a stable route, but rarely considers the adaptability of constructed route to the change of node{\textquoteright}s motion. This paper proposes a new ad hoc route maintenance protocol called Route Maintenance using Link State Prediction (RM-LSP). RM-LSP utilizes node locality to enhance resilience against mobility and hence the throughput. RM-LSP reduces the overhead of route failure recovery in source end and attempts to improve route efficiency and network throughput. Our simulation results show that RM-LSP delivers packets efficiently while substantially reducing control overhead in various environments. Simulation study of the algorithm proves it to offer significant benefits in dense scenarios.}, keywords = {Handoff, Promiscuous mode, RCPI, RM-LSP}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-80053097391\&partnerID=40\&md5=c78b385ffa38ed082a3ca58d4fdd388f}, author = {Sankar, S. and Sankaranarayanan, V.} } @article {273, title = {Scanning-beam antenna on metamaterials coplanar structure for wireless applications}, journal = {Journal of Digital Information Management}, volume = {9}, year = {2011}, note = {Export Date: 10 July 2014}, month = {2011}, pages = {111 - 116}, abstract = {A scanning-beam antenna on metamaterial coplanar structures is presented. The proposed antenna is, in essence, a composite of Right/Left-Handed (CRLH) coplanar waveguide (CPW) structure incorporating distributed periodic structures with L-C high-pass filter topology which support left-handed (LH) waves. The negative refractive index (NRI) properties of these structures are shown theoretically, numerically and validated by full-wave simulations. The supported LH wave is fully characterized and based on the composite right/left-handed transmission-line (CRLH-TL) theory; and the dispersion characteristics, refractive indexes and Bloch impedance are derived theoretically. In addition, formulas to extract equivalent-circuit parameters from full-wave simulation are given. Since the distance d between adjacent cells of the array is small, d \< \< λo and the array becomes a uniform leaky-wave antenna (LWA) for a 10-cell operating near 10 GHz. Simulated radiation pattern, gain, and associated loss budget are presented. The results of LWA exhibit scanning-beam capability from backfire-to-endfire direction and accord well with the theoretical analysis. The antenna is printed on thin and flexible substrate (h = 25 μm). Furthermore, since the antenna is implemented with low-cost and CPW technology, it is a good candidate for integrated RF/microwave systems that can be used in digital wireless communications and radars.}, keywords = {Coplanar Structure, Microwave systems, Scanning-Beam Antenna}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-80053027377\&partnerID=40\&md5=64150e3e06edecef1c364f45804780d2}, author = {Hamdi, A.} } @article {276, title = {A secure and efficient authentication protocol for mobile RFID systems}, journal = {Journal of Digital Information Management}, volume = {9}, year = {2011}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2011}, pages = {99 - 105}, abstract = {The design of a secure communication scheme for Radio Frequency Identification (RFID) systems has been extensively studied in recent years in view of the awareness of individual privacy and the requirement of robust system security. Most of previous works assume the communication channel between an RFID reader and its backend server is secure and concentrate on the security enhancement between an RFID tag and an RFID reader. However, once RFID reader modules are extensively deployed in consumer{\textquoteright}s handheld devices, the security violation problems at reader side will be deeply concerned by individuals and organizations. In this paper, it is assumed that the future communication environment for RFID systems will be all wireless and insecure. Under such infrastructure, handheld device suchas mobile phone, embedded with RFID reader modules will be situated everywhere and operated with many RFID tags in various RFID application systems. Hence in this paper, an authentication protocol in mobile RFID environment is proposed which effectively achieves forward security with preventing replay, eavesdropping, and counterfeit tag attacks. Based on the security analyses, it has been shown that the scheme can enhance data security and provide privacy protection at reader side even in the presence of an active adversary under insecure mobile RFID environment.}, keywords = {Eavesdropping, Forward security, Mobile RFID, RFID}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-80053013286\&partnerID=40\&md5=1de54a3906933fffce15a15339f4b55c}, author = {Sandhya, M. and Rangaswamy, T.R.} } @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 {275, title = {Semantic resource discovery in large scale environments}, journal = {Journal of Digital Information Management}, volume = {9}, year = {2011}, note = {Export Date: 10 July 2014}, month = {2011}, pages = {126 - 131}, abstract = {In biosciences, data mining is concerned with processing large amount of data which is characterized by heterogeneity, ever changing and spread in different complex environments. Resource discovery from massive data poses a formidable task for many newer as well as routine applications. The issues addressed in the massive data environments so far are the heterogeneityissues and the semantic focus is less. In the current work, we deal with the resource discovery in large-scale environments (as data grid systems) considering data semantic heterogeneity of biomedical sources. There are many benefits such as-(i) allowing a permanent access, through an addressing system, from any domain ontology DO i to another DO j (inter-domain discovery) despite peers{\textquoteright} dynamicity, (ii) reducing the maintenance cost and (iii) taking into account the semantic heterogeneity.}, keywords = {Biomedical Data Sources, Resource Discovery, Semantic Grid}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-80052989830\&partnerID=40\&md5=60069a9a9d80afc6bcdc3332e86f2c86}, author = {Ketata, I. and Mokadem, R. and Morvan, F.} } @article {258, title = {Task-oriented dialogue agent architecture}, journal = {Journal of Digital Information Management}, volume = {9}, year = {2011}, note = {Export Date: 10 July 2014}, month = {2011}, pages = {1 - 8}, abstract = {This paper focuses our agent-based approach to dialogue management equipped with a deliberation mechanism further extensible with additional features. The aim of this study has been to create a manager which can exhibit complex behaviour from two points of view - the development and runtime ones. To support the first case, the domain developer needs to provide a set of plans which tell the agent how to cope with particular tasks. Then during the runtime, the agent processes these plans to manage the dialogu e in accordance with an optimization criterion specifed. This paper summarizes our effort and gives an overview about our architecture.}, keywords = {Agent-based dialogue management, Artifcial intelligence, Dialogue systems, System adaptability}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-79960683406\&partnerID=40\&md5=8d1dcf9d4272619ff036cd94546c40cb}, author = {Nestorovi{\v c}, T.} } @article {246, title = {An AODV based QoS routing protocol for delay sensitive applications in mobile Ad Hoc networks}, journal = {Journal of Digital Information Management}, volume = {8}, year = {2010}, note = {Cited By (since 1996):2Export Date: 10 July 2014}, month = {2010}, pages = {303 - 314}, abstract = {In order to provide quality delivery to delay sensitive applications such as voice and video, it is extremely important that mobile Ad Hoc networks provide quality of service (QoS) support in terms of bandwidth and delay. Most existing routing protocols for mobile Ad Hoc networks (MANETs) are designed to search for the shortest path with minimum hop counts. However, the shortest routes do not always provide the best performance, especially when there are congested nodes along these routes. In this paper, we propose an on demand delay based quality of service routing protocol (AODV-D) to ensure that delay does not exceed a maximum value. First in this paper, we compare the performance of two prominent on demand routing protocols AODV and DSR in stressful situation. As the performance of AODV has been found better in our simulation than DSR, we decided to modify AODV routing protocol to provide quality-ofservice. This protocol takes into consideration MAC layer channel contention information and number of packets in the interface queue in addition to minimum hops. The protocol is implemented and simulated using GlomoSim simulator. Performance comparisons of the proposed AODV-D protocol against AODV, and QoS-AODV is presented and shown that the proposed protocol outperforms existing ones.}, keywords = {AODV, GloMoSim, MAC, Mobile ad hoc networks (MANETs), Performance evaluation, QoS}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-79960677246\&partnerID=40\&md5=b4b3c7a8accf3bb3de65c75a752e8915}, author = {Kumar, R. and Sarje, A.K. and Misra, M.} } @article {240, title = {An approach for matching schemas of heterogeneous relational databases}, journal = {Journal of Digital Information Management}, volume = {8}, year = {2010}, note = {Export Date: 10 July 2014}, month = {2010}, pages = {260 - 269}, abstract = {Schema matching is a basic problem in many database application domains, such as data integration. The problem of schema matching can be formulated as follows, "given two schemas, Si and Sj, find the most plausible correspondences between the elements of Si and S j, exploiting all available information, such as the schemas, instance data, and auxiliary sources" [24]. Given the rapidly increasing number of data sources to integrate and due to database heterogeneities, manually identifying schema matches is a tedious, time consuming, error-prone, and therefore expensive process. As systems become able to handle more complex databases and applications, their schemas become large, further increasing the number of matches to be performed. Thus, automating this process, which attempts to achieve faster and less labor-intensive, has been one of the main tasks in data integration. However, it is not possible to determine fully automatically the different correspondences between schemas, primarily because of the differing and often not explicated or documented semantics of the schemas. Several solutions in solving the issues of schema matching have been proposed. Nevertheless, these solutions are still limited, as they do not explore most of the available information related to schemas and thus affect the result of integration. This paper presents an approach for matching schemas of heterogeneous relational databases that utilizes most of the information related to schemas, which indirectly explores the implicit semantics of the schemas, that further improves the results of the integration.}, keywords = {Biomedical database, Database integration, Heterogeneous, Schema matching}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-79960671688\&partnerID=40\&md5=6ff8c1cb0997d2a66db189af36cbfb1c}, author = {Karasneh, Y. and Ibrahim, H. and Othman, M. and Yaakob, R.} } @article {252, title = {On Arabic texts compression and searching}, journal = {Journal of Digital Information Management}, volume = {8}, year = {2010}, note = {Export Date: 10 July 2014}, month = {2010}, pages = {355 - 361}, abstract = {With the dramatic increasing of electronic Arabic content, the text compression techniques will play a major role in several domains and applications such as search engines, data archiving, searching and retrieval from huge databases. Mainly the combination of compression and indexing techniques allows the interesting possibility to work directly on the compressed textual files or databases, which results saving time and resources. The existing compression techniques and tools are generic and do not consider the specific characteristics of the Arabic language such as its derivative nature. Mainly compression techniques should be based on the morphology characteristics of the Arabic language, its grammatical characteristics, the texts subject, and their statistical characteristics. The paper surveys the state of the art of the Arabic texts compression techniques and tools and identifies some research tracks that should be explored in future. It presents also some dedicated Arabic text compression algorithms which save more physical space and speed up the data retrieval text files by searching in their compressed form.}, keywords = {Arabic language, Data compression, Searching in compressed files}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-79960677042\&partnerID=40\&md5=e14b05b52c375cabf39af4b4801c5c91}, author = {Sallay, H.} } @article {254, title = {Augmenting digital libraries with web-based visualizations}, journal = {Journal of Digital Information Management}, volume = {8}, year = {2010}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2010}, pages = {377 - 386}, abstract = {Digital libraries in their current form are bounded by their ineffcient webpage-based user interface paradigm, and even the most knowledgeable researchers can get lost in the large amount of published material available. A paper and its immediate references are displayed on a single webpage. Unfortunately, it is not readily apparent where the paper belongs in the greater context of a research field. Our goal was to develop, test, and iteratively improve the effectiveness of a web-based application, PaperCube, designed to augment and enhance a researcher{\textquoteright}s interaction with digital libraries through the use of interactive visualizations of bibliographic meta data. The visualizations set out to show different levels of detail and aspects of a paper{\textquoteright}s citation network. A primary concern was to ensure that while switching visualizations, the viewed paper or author remained focused at all times. PaperCube was validated through a user study that showed that it helped users who are trying to explore a field of research. In particular, PaperCube was shown to reduce the "cognitive load" put on a researcher and aid the "discoverability" of new research material.}, keywords = {Digital libraries, Graphical user interfaces, Navigation, PaperCube, Web-based visualization}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-79960682007\&partnerID=40\&md5=746cf2e1545b3dd8f0d1697f5673e6e8}, author = {Bergstr{\"o}m, P. and Atkinson, D.C.} } @article {208, title = {An authoring system for interactive mobile TV services using MPEG-7 and MPEG-4 LASeR}, journal = {Journal of Digital Information Management}, volume = {8}, year = {2010}, note = {Export Date: 10 July 2014}, month = {2010}, pages = {37 - 46}, abstract = {Consuming mobile TV services is becoming increasingly popular. As hand held devices are personal and used in a "lean-forward" mode, they are well suited for interactive TV. The porTiVity system provides authoring tools for mobile interactive content that allow attaching interactivity to moving objects in a TV program. We describe automatic and semi-automatic annotation tools that create content descriptions represented as MPEG-7 documents. The descriptions of moving objects are then transformed into MPEG-4 LASeR, which is a suitable lightweight format for visualization and interactivity on the mobile device. Since mobile devices are well suited for consuming personalized services we describe different personalization aspects. We show the use of the authoring components of porTiVity in two example scenarios.}, keywords = {Mobile Applications, Multimedia applications, User Evaluation}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-77958062610\&partnerID=40\&md5=09822f4813deb4b9ba70a5e3a45a02fe}, author = {Hofmann, A. and Kriechbaum, A. and Bailer, W.} } @article {253, title = {Automatic segmentation, aggregation and indexing of multimodal news information from television and the Internet}, journal = {Journal of Digital Information Management}, volume = {8}, year = {2010}, note = {Cited By (since 1996):2Export Date: 10 July 2014}, month = {2010}, pages = {387 - 395}, abstract = {The global diffusion of the Internet has enabled the distribution of informative content through dynamic media such as RSS feeds and video blogs. At the same time, the decreasing cost of electronic devices has increased the pervasive availability of the same informative content in the form of digital audiovisual data. This article presents a system for the large-scale unsupervised acquisition, segmentation and indexing of TV newscasts. In particular, it discusses the principles and performance of the parts of the system dedicated to the detection and segmentation of programmes from the acquired stream. In addition to the core technology, we also introduce and discuss a novel method for assessing the results of story boundaries segmentation algorithms, based on a user-validated measurement. Due to the heterogeneity of current news distribution channels, a further innovative aspect of this article is the description of a framework for multimodal information aggregation. The core of this framework is a cross-modal clustering process for which a novel, asymmetric similarity measure is provided. The implemented prototype uses online news articles and TV news programmes as information sources, and provides a multimodal service integrating both contributions. Experimental evaluation of the system proves the effectiveness of the method in the studied case.}, keywords = {Content segmentation, Multimedia annotation, Multimodal aggregation, Semantic enrichment}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-79960677245\&partnerID=40\&md5=7e687d0db3f4300e8eef4114759a01c6}, author = {Montagnuolo, M. and Messina, A. and Borgotallo, R.} } @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 {217, title = {Building context-awareness models for mobile applications}, journal = {Journal of Digital Information Management}, volume = {8}, year = {2010}, note = {Cited By (since 1996):6Export Date: 10 July 2014}, month = {2010}, pages = {78 - 87}, abstract = {The design process followed to produce traditional applications needs to be enhanced to cope with new context-aware ubiquitous application requirements. With the popularity of ubiquitous computing, context-aware applications become clearly necessary. This new kind of applications allows mobile users to universally access services in respect to any context including his computing environment. Challenges for the design of such applications are to easily define context collection requirements, context analysis and adaptations of the applications due to changes in its environment. To face these issues, we propose, in this article, a generic and extensible way to model context-awareness of any application using the model-driven engineering (MDE) approach. For this purpose, we add a context-awareness aspect to application model views. We illustrate our solution by modeling a context-aware e-commerce application. The addition of a context-awareness aspect, should ease the definition of mobile applications. Furthermore, context-awareness models open the way to automate context-awareness code production.}, keywords = {Context-awareness, Model driven engineering, Ubiquitous computing}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-79960676592\&partnerID=40\&md5=bec59c3aa9c877ef871154ab0b7c4a0c}, author = {Taconet, C. and Kazi-Aoul, Z.} } @article {209, title = {Case studies on context-aware mobile multimedia services}, journal = {Journal of Digital Information Management}, volume = {8}, year = {2010}, note = {Cited By (since 1996):3Export Date: 10 July 2014}, month = {2010}, pages = {4 - 15}, abstract = {This paper explores the design, implementation and evaluation of context-aware mobile multimedia services by presenting six case studies on different application domains. The case studies highlight the opportunities that mobile devices equipped with wireless data transmission provide for contextaware and ubiquitous computing. Special emphasis is placed on empirical evaluation of the services in the field in form of a user evaluation with genuine end users in real environment of use. The paper concludes with a discussion on some important lessons learned from the case studies.}, keywords = {Context-aware system, GPRS network, Mobile advertising, Mobile multimedia, SmartRotuaari, WLAN}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-77958049730\&partnerID=40\&md5=d237bec84fe18702a28d433ba8d5ce47}, author = {Ojala, T.} } @article {218, title = {Cellular DBMS: An attempt towards biologically-inspired data management}, journal = {Journal of Digital Information Management}, volume = {8}, year = {2010}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2010}, pages = {117 - 128}, abstract = {Existing database management systems (DBMS) are complex and less predictable (i.e., the consistency of performance with the increase of functionality and the data growth is not certain). Database researchers acknowledge the need for revisiting DBMS architectures to fulfill the needs of new hardware and application trends. We propose a biologically inspired DBMS architecture called "Cellular DBMS". The Cellular DBMS architecture promises development of highly customizable and autonomous DBMS. This paper explains in detail the design principles for Cellular DBMS architecture. It also explains an aspect-oriented programming based model to equip Cellular DBMS architecture with autonomy. Finally, it presents an extension to decomposed storage model (DSM) for use in Cellular DBMS.}, keywords = {Adaptability, Biological-inspiration, Customization, Data management, DBMS architectures, Embedded databases}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-79952576380\&partnerID=40\&md5=ec9e6d57f05cbabf1fcc0934eb815963}, author = {Ur Rahman, S.S. and K{\"o}ppen, V. and Saake, G.} } @article {212, title = {Content-based image retrieval systems-reviewing and benchmarking}, journal = {Journal of Digital Information Management}, volume = {8}, year = {2010}, note = {Cited By (since 1996):2Export Date: 10 July 2014}, month = {2010}, pages = {54 - 64}, abstract = {The last detailed review of Content-based Image Retrieval Systems (CBIRS) is that from Veltkamp and Tanase [VT02], updated in 2002. Since then, many new systems emerged, other systems were improved, but many systems are no longer supported. This paper reconsiders the systems described by Veltkamp and Tanase and proposes in addition for a selection of existing CBIRS a quantitative comparison. For this purpose we developed a benchmarking system for CBIRS based on how accurate they could match ideal (ground truth) results. As measure we introduced the RankWRN , which we developed based on the Normalized Avarage Rank. Our measure allows fair and accurate comparisons (due to multiple similarity values) of different CBIRS with respect to different queries. None of the other benchmarks allow this comparison. The choice for a system to be compared quantitatively was motivated by availability of the source or runtime code and the liveness (i.e., active development on the CBIRS). The benchmarked systems were SIMBA, SIMPLIcity, PictureFinder, ImageFinder, Caliph\&, VIPER/GIFT and Oracle Intermedia. Results show that VIPER/GIFT performs best in the settings of our benchmark, Caliph\& is second and SIMBA third. The default parameter settings of the systems tend to show the best results. MPEG-7 descriptors, which are used in Caliph\&, show a good performance in the benchmarking.}, keywords = {Image ranking, MPEG-7 descriptors}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-77958035095\&partnerID=40\&md5=3332d95bebdc7fdabeda9f57902ea608}, author = {Kosch, H. and Maier, P.} } @article {219, title = {A deadline-driven probabilistic quality of service routing for mobile ad hoc networks}, journal = {Journal of Digital Information Management}, volume = {8}, year = {2010}, note = {Cited By (since 1996):3Export Date: 10 July 2014}, month = {2010}, pages = {129 - 135}, abstract = {Provision of quality of service (QoS) in an ad hoc network is a challenging task due to their inherent characteristics. In this paper, we present a routing protocol for QoS provisioning in mobile ad hoc networks. Our protocol tries to discover multiple node-disjoint paths between a given source and a destination that are able to satisfy QoS requirements in terms of bandwidth required by a fow of packets. We discuss how one can have probabilistic QoS guarantees using a protocol where nodes are aware of their neighbors that may interfere with them while relaying packets to other nodes along the paths towards the destination. We analyze the probability that the packets arrive at the destination before their respective deadlines.}, keywords = {Nodedisjoint mulipath routing, Path independence, Probabilistic QoS guarantees, Quality of service}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-77958573455\&partnerID=40\&md5=3979494bcea959e4e5267076e4538fb5}, author = {Abbas, A.M. and Kure, {\O}.} } @article {227, title = {A dynamic load distribution algorithm for virtual worlds}, journal = {Journal of Digital Information Management}, volume = {8}, year = {2010}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2010}, pages = {181 - 189}, abstract = {The introduction of modern communication and computation technologies has greatly changed the traditional approaches processing computationally intensive applications such as Virtual Environments (VEs). Distributed and multi-server architectures are scalable and exploit the concepts of spatial and temporal locality for handling massive Distributed VEs (DVEs). However, using these environments require special attention for scalability, consistency, load balancing, and latency. The existing mechanisms primarily developed for games have key performance issues in managing large scale virtual worlds. In our previous work (Farooq and Glauert, 2009a), we have proposed a hierarchical infrastructure named JoHNUM for the development of scalable and consistent virtual worlds. Further, we have introduced the concept of aggregate region assignment to minimise resource utilisation and distribute the load as balanced as possible among servers (Farooq and Glauert, 2009a, 2009b). This paper presents our proposed load distribution algorithm that yields regular and contiguous areas for assignment. It examines possible combinations of regions based on proposed strategies but greatly reduces the aggregation process by using different filters. It also presents a simple communication model justifying the proposed strategies and load distribution algorithm. Simulation results with an extended set of experiments show that the proposed algorithm obtains fair distribution of load and has the capability to cope with small, medium and large scale environments while minimising communication and implementation cost.}, keywords = {Consistency, Load balancing, Scalability, Second life, Virtual Environment, Virtual world}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-79960667976\&partnerID=40\&md5=0447704980b109c746d050be6818c613}, author = {Farooq, U. and Glauert, J.} } @article {224, title = {Editorial preface: Special issue on context-aware and mobile multimedia databases and services}, journal = {Journal of Digital Information Management}, volume = {8}, year = {2010}, note = {Export Date: 10 July 2014}, month = {2010}, pages = {2 - 3}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84861465089\&partnerID=40\&md5=7b82f006c7ffa103ca31e784f7cd8bf8}, author = {Grigoras, R. and Charvillat, V. and Chbeir, R. and Kosch, H. and Bailer, W. and Boll, S. and Brunie, L. and Cao, Y. and Delgado, J. and Granitzer, M. and Hausenblas, M. and Eidenberger, H. and Klamma, R. and Lux, M. and Marques, O. and Oria, V. and Plesca, C. and Pr{\'e}teux, F. and Sedes, F. and Spaniol, M. and Ternier, S. and Wolpers, M.} } @article {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 {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 {225, title = {Fault-tolerant meta-scheduler for price-based job scheduling by applying multi-reservation method}, journal = {Journal of Digital Information Management}, volume = {8}, year = {2010}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2010}, pages = {213 - 218}, abstract = {In market-like grids, applying an economical method for providing fault-tolerant job scheduling is necessary. Since we have to pay cost for job execution in economic grids, consumers tend to execute their jobs on a grid with minimum cost and acceptable completion time. To do this, many approaches have been proposed, but they unilaterally consider either time/cost or consumer/provider profit. Based on current research, a new approach has been proposed; the approach is an optimized, fault-tolerant method for meta-scheduler that considers bilateral satisfaction for consumer/provider and a tolerable completion time. We suppose that, if one of the provider nodes fails, there would not be enough time to start a task on a new node from the beginning. The experimental results show a promising improvement in job scheduling with less computation cost, better fault-tolerance, and an acceptable completion time.}, keywords = {Check-pointing, Fault tolerance, Replication, Rough set}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-79960679148\&partnerID=40\&md5=e30a655c66545df2023a714a92a03da8}, author = {Bouyer, A. and Abdullah, A.H.} } @article {241, title = {File replication method based on demand forecasting of file download in P2P networks}, journal = {Journal of Digital Information Management}, volume = {8}, year = {2010}, note = {Export Date: 10 July 2014}, month = {2010}, pages = {247 - 253}, abstract = {In peer-to-peer (P2P) networks that support file-sharing services, the level of access demand can vary widely between different files. Since fewer nodes store files for which there is a lower demand, these files are more likely to be lost from the P2P networks if users leave the network or delete the files. File loss can cause users to seek alternatives to P2P services, and lead to degradation in service quality. We propose and evaluate a replication method based on demand forecasting that aims to prevent the loss of low-demand files. In this method, the number of file replicas to be placed is determined based on the forecast demand for the file, so that the loss of low-demand files is likely prevented by placing replicas at nodes that frequently use P2P services. Based on simulation results, we compared our proposed method with basic replication methods in terms of the number of files and the amount of storage used. Our experimental results show that the proposed method prevents file loss by preserving lowdemand files over extended periods of time. We also confirmed that the node storage resources consumed by this method are efficiently used.}, keywords = {P2P file sharing, P2P networks, Replication}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-79960687658\&partnerID=40\&md5=3db4c30b2db7743416ab3f4cb69524b3}, author = {Kobayashi, M. and Kageyama, J. and Shibusawa, S. and Yonekura, T.} } @article {226, title = {A framework for enhancing non context-driven XML search}, journal = {Journal of Digital Information Management}, volume = {8}, year = {2010}, note = {Export Date: 10 July 2014}, month = {2010}, pages = {167 - 174}, abstract = {A data element specifies one of the characteristics of its parent element. Therefore, the context of a data element is determined by its parent. Non context driven search engines build relationships between data nodes based solely on their labels and proximity to one another while overlooking their contexts. Therefore, they may return faulty answers. This paper investigates the pitfalls and limitations of non context-driven XML search engines, which caused by overlooking elements{\textquoteright} contexts. We propose a generic context-driven search framework, which could be used as a layer on top of the frameworks of non context-driven search systems.}, keywords = {Contextdriven search system, Keyword search, XML, XML search engine}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-79960686613\&partnerID=40\&md5=a8d61dbc9c63c15c9ce19f500d97fabe}, author = {Taha, K. and Elmasri, R.} } @article {256, title = {Framework for mixed entity resolving system using unsupervised clustering}, journal = {Journal of Digital Information Management}, volume = {8}, year = {2010}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2010}, pages = {362 - 368}, abstract = {During web search, confusion can happen due to homonym when users use non-unique values as a search term of an entity. Especially, when parts of names of an entity were used as its identifier, we call a mixed entity resolution problem whose goal is to clear out the erroneous entities. For example, if only last name is used as an identifier, we cannot distinguish "Vannessa Bush" from "George Bush." Mixed entity resolution problem is common among Web pages data. In this paper, to resolve aforementioned mixed entities on the Web, we propose a prototypical system which includes a web service based interface, unsupervised clustering scheme, and cluster ranking algorithms. In particular, since the correct number of clusters is often unknown, we study a state-of-the-art unsupervised clustering solution based on propagation of pairwise similarities of entities. Experimental results show that our approach outperforms main competing solution.}, keywords = {Mixed entity resolution, Unsupervised clustering}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-79960657815\&partnerID=40\&md5=b7024f58cda537138350a05e3d88ac8c}, author = {On, B.-W. and Lee, I.} } @article {237, title = {A fuzzy grassroots ontology for improving weblog extraction}, journal = {Journal of Digital Information Management}, volume = {8}, year = {2010}, note = {Cited By (since 1996):3Export Date: 10 July 2014}, month = {2010}, pages = {276 - 284}, abstract = {This paper presents fuzzy clustering algorithms to establish a grassroots ontology - a machine-generated weak ontology - based on folksonomies. Furthermore, it describes a search engine for vaguely associated terms and aggregates them into several meaningful cluster categories, based on the introduced weak grassroots ontology. A potential application of this ontology, weblog extraction, is illustrated using a simple example. Added value and possible future studies are discussed in the conclusion.}, keywords = {Fuzzy data clustering, Information retrieval, Ontology, Search engine, Semantic web, Weblog}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-77955703451\&partnerID=40\&md5=e96f607ac097bae04e70c3dc44c841f3}, author = {Portmann, E. and Meier, A.} } @article {247, title = {Generalization of multiple key agreement protocol based on bilinear pairings}, journal = {Journal of Digital Information Management}, volume = {8}, year = {2010}, note = {Export Date: 10 July 2014}, month = {2010}, pages = {298 - 302}, abstract = {In practice, we usually require a key agreement protocol to establish a common secret key for enciphering/deciphering messages. Now, most protocols can establish n2 common secret keys in a single round of messages exchange. In this paper, we shall propose an extended proto col to establish 2n2 common secret keys in a single round. The proposed protocol is based on bilinear pairings. Moreover, the correctness, security, and efficiency of our proposed protocol are presented.}, keywords = {Bilinear pairing, Data encryption, Key agreement, Key exchange, MQV}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-79960675856\&partnerID=40\&md5=75cd9ae7824ee7748fc6d102330d630d}, author = {Lee, C.-C. and Cheng, T.-Y. and Chen, T.-Y.} } @article {215, title = {A grayscale image steganography based upon discrete cosine transformation}, journal = {Journal of Digital Information Management}, volume = {8}, year = {2010}, note = {Cited By (since 1996):2Export Date: 10 July 2014}, month = {2010}, pages = {88 - 94}, abstract = {In this paper, a simple image steganography for secure communication is proposed. Our scheme is based on the discrete cosine transformation (DCT) technique. By using DCT, the most significant information of each DCT secret block can be embedded into the non-significant parts of each DCT cover block. To improve the image quality of the cover image, a quantization factor is used. According to our experiments, the proposed method outperforms the VQ-Based and the HVS-Based image hiding schemes in terms of the image quality of the stego image and the extracted secret image.}, keywords = {Discrete cosine transformation, Human visual system, Information systems, Steganography}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-79960667544\&partnerID=40\&md5=50ebade6fc46d74174983072f0b6f5e8}, author = {Chang, C.-C. and Lin, P.-Y. and Chuang, J.-C.} } @article {234, title = {Harvesting pertinent resources from Linked Open Data}, journal = {Journal of Digital Information Management}, volume = {8}, year = {2010}, note = {Cited By (since 1996):5Export Date: 10 July 2014}, month = {2010}, pages = {205 - 212}, abstract = {Linked Open Data (LOD) is becoming an essential part of the Semantic Web. Although LOD has amassed large quantities of structured data from diverse, openly available data sources, there is still a lack of user-friendly interfaces and mechanisms for exploring this huge resource. In this paper, we describe a methodology for harvesting relevant information from the gigantic LOD cloud. The methodology is based on combination of information: identification, extraction, integration and presentation. Relevant information is identified by using a set of heuristics. The identified information resource is extracted by employing an intelligent URI discovery technique. The extracted information is further integrated with the help of a Concept Aggregation Framework. Then the information is presented to end users in logical informational aspects. Thereby, the proposed system is capable of hiding complex underlying semantic mechanics from end users and reducing the users{\textquoteright} cognitive load in locating relevant information. In this paper, we describe the methodology and its implementation in the CAF-SIAL system, and compare it with the state of the art.}, keywords = {CAF-SIAL, Information presentation, Information retrieval, Linked Open Data (LOD), Semantic web, URI, User interfaces}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-79960685735\&partnerID=40\&md5=cc886d4db44fdc4f20722b7621aca818}, author = {Latif, A. and Afzal, M.T. and Saeed, A.U. and Hoefler, P. and Tochtermann, K.} } @article {221, title = {Hierarchical clustering in medical document collections: The BIC-means method}, journal = {Journal of Digital Information Management}, volume = {8}, year = {2010}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2010}, pages = {71 - 77}, abstract = {Hierarchical clustering of text collections is a key problem in document management and retrieval. In partitional hierarchical clustering, which is more efficient than its agglomerative counterpart, the entire collection is split into clusters and the individual clusters are further split until a heuristicallymotivated termination criterion is met. In this paper, we define the BIC-means algorithm, which applies the Bayesian Information Criterion (BIC) as a domain independent termination criterion for partitional hierarchical clustering. We evaluate the effectiveness of BIC-means in clustering and retrieval on medical document collections and we propose a dynamic version of the BIC-Means algorithm for adapting an existing clustering solution to document additions.}, keywords = {Bayesian information criterion (BIC), Document clustering, Document retrieval, Dynamic clustering, Performance, Termination criterion}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-79960667355\&partnerID=40\&md5=87c5599ab55c27b1d1ae1f1f2e76cd6b}, author = {Hourdakis, N. and Argyriou, M. and Petrakis, E.G.M. and Milios, E.E.} } @article {239, title = {Improving Arabic text categorization using Neural Network with SVD}, journal = {Journal of Digital Information Management}, volume = {8}, year = {2010}, note = {Cited By (since 1996):3Export Date: 10 July 2014}, month = {2010}, pages = {233 - 239}, abstract = {In this paper, we present a model based on the Neural Network (NN) for classifying Arabic texts. We propose the use of Singular Value Decomposition (SVD) as a preprocessor of NN to reduce the data in terms of both size as well as dimensionality so that the input data become more classifiable and faster for the convergence of the training process used in the NN model. To test the effectiveness of the proposed model, experiments were conducted using an in-house collected Arabic corpus for text categorization. The results showed that the proposed model was able to achieve high categorization effectiveness as measured by precision, recall and F-measure. Experimental result shows that the ANN model using SVD is better than the basic ANN on Arabic text classification.}, keywords = {Arabic language, MLP, Neural network, Singular Value Decomposition, Text categorization}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-79960685734\&partnerID=40\&md5=231f569e3eb222816e6af0bb1e4a5cc4}, author = {Harrag, F. and Al-Qawasmah, E.} } @article {251, title = {In this issue}, journal = {Journal of Digital Information Management}, volume = {8}, year = {2010}, note = {Export Date: 10 July 2014}, month = {2010}, pages = { - }, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-79960663855\&partnerID=40\&md5=372c45972c74319be5ec570016fa54c7} } @article {249, title = {In this issue}, journal = {Journal of Digital Information Management}, volume = {8}, year = {2010}, note = {Export Date: 10 July 2014}, month = {2010}, pages = { - }, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-79960681866\&partnerID=40\&md5=be81ddd041d7fc3802f56551ac48e57b} } @article {238, title = {Knowledge management of 1D SDS PAGE gel protein image information}, journal = {Journal of Digital Information Management}, volume = {8}, year = {2010}, note = {Export Date: 10 July 2014}, month = {2010}, pages = {223 - 232}, abstract = {Computational management and analysis of proteomics data is providing important insights into the biological and clinical sciences. In this research study, a knowledge management strategy for 1D SDS PAGE gel protein image information has been developed and implemented in the New Vision to Protein intensity Analysis System (NeVPAS) application. This application focused on the analysis of skin mucus protein changes during a key developmental stage of Atlantic salmon (Salmo salar), the smoltification period. It includes a database to archive proteomics data. In this paper, knowledge management is expressed in terms of data acquisition, hierarchical organisation of data, knowledge retrieval by means of an information retrieval technique and knowledge presentation using text and graphics. This application of proteomics knowledge management in the marine field may also be extended to clinical analysis and environmental monitoring.}, keywords = {1D SDS PAGE protein gel image, Atlantic salmon, Gel image analysis, Knowledge management}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-79960692176\&partnerID=40\&md5=be17770f0ee0ad9cba603f903cdd0aee}, author = {Ramaswamy, G. and Wu, B. and Macevilly, U.} } @article {255, title = {Mining the blogosphere to generate cuisine hotspot maps}, journal = {Journal of Digital Information Management}, volume = {8}, year = {2010}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2010}, pages = {396 - 401}, abstract = {Choosing a restaurant is one of the most frequent decisions faced in modern daily life; however, it is difficult for consumers to choose between food/restaurant by reading large amounts of reviews. This study attempts to generate cuisine hotspot maps through blog content mining to help consumers make restaurant decisions by specialties. The main obstacle in doing this involves recognizing and extracting restaurants and essentialrestaurant information (i.e., restaurant dishes) in unstructured content. In contrast to traditional Named Entity Recognition (NER) targets, dish name is a promising target that received little attention in previous studies. This study develops methods for recognizing and extracting restaurant names and dish names from review postsin the blogosphere and achieves satisfactory performance. Based on the method, we processed more than 12,000 Chinese blog posts and generated a cuisine hotspot map. The map shows the most popular dishes of restaurants in a map-view to help consumers make restaurant decisions. A prototype of cuisine hotspot map, named CuisineGuide, is implemented and available as an iPhone application.}, keywords = {Blog analysis, Hotspots, Name entity recognition, Web content, Web search}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-79960266928\&partnerID=40\&md5=4f85ee81adec856534db4c96673f0dbe}, author = {Shih, C.-C. and Peng, T.-C. and Lai, W.-S.} } @article {210, title = {A MPEG-based architecture for generic distributed multimedia scenarios}, journal = {Journal of Digital Information Management}, volume = {8}, year = {2010}, note = {Export Date: 10 July 2014}, month = {2010}, pages = {47 - 53}, abstract = {This paper presents a standards-based architecture for a complex and generic distributed multimedia scenario, which combines content search and retrieval, DRM, and context-based content adaptation together. It is an innovative and totally generic approach trying to narrow the semantic-gap by integrating a fl exible language for multimedia search based on MPEG Query Format (MPQF) standard with the application of video analysis algorithms for the automatic extraction of low level features and with the use of contextual information.}, keywords = {Context-based adaptation, Digital Rights Management-Rights Expression Language, Features extraction, MPEG query format}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-77958070468\&partnerID=40\&md5=fccf7895a6f9802b4adb6febe511be2f}, author = {Carreras, A. and Tous, R. and Rodr{\'\i}guez, E. and Delgado, J. and Cordara, G. and Francini, G. and Gibellino, D.} } @article {235, title = {Multi-objective optimization in service systems}, journal = {Journal of Digital Information Management}, volume = {8}, year = {2010}, note = {Export Date: 10 July 2014}, month = {2010}, pages = {254 - 259}, abstract = {Muti-objective optimization deals with the simultaneous optimization of two or more conficting objective functions in real-life systems. This paper deals with the multi-objective optimization in service systems. The goal of service systems is to provide cost-efficient service to customers, while at the same time, reducing the customer waiting time for service. In general, a low cost in system operation leads to longer waiting times, while a higher cost in system operation leads to shorter waiting times. The two objectives - service cost (operational cost) and waiting time (customer satisfaction) are, therefore, conficting in nature. We use the novel Multi-Objective Particle Swarm Optimization (MOPSO) algorithm to optimize the two conficting objective functions simultaneously. MOPSO is a fairly recent swarm intelligence meta-heuristic algorithm known for its simplicity in programming and its rapid convergence. The multi-objective optimization procedure is illustrated with the example of a practical service system. MOPSO produces a family of well-spread Pareto fronts for the two objective functions in the practical service system.}, keywords = {Multi-Objective Particle Swarm Optimization, Service cost, Service systems, Simulation optimization}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-79960666260\&partnerID=40\&md5=6941ee36882d582a6672bdc8a5f37555}, author = {Gonsalves, T. and Yamagishi, K. and Itoh, K.} } @article {248, title = {A novel access control strategy for distributed data systems}, journal = {Journal of Digital Information Management}, volume = {8}, year = {2010}, note = {Cited By (since 1996):3Export Date: 10 July 2014}, month = {2010}, pages = {291 - 297}, abstract = {It is one of the most important challenges to balance between security and scalability in large distributed data systems. In this paper, we introduce a new data distribution model, which is a generalized tree structure called as multitree. And its access control strategy is investigated. In our multitree data model, the database schema is expressed as a schema graph, and a database instance is imagined as a data graph. It is different from the traditional hierarchical data model, since a node in our multitree model can have many parent nodes. All the data graphs or schema are transformed into multitrees. The complex data relation of the distributed data systems is reduced based on graph theory. The complexity of distribution is decreased significantly. In the multitree model, each user has a maximum access range corresponding to its multitree. It is integrated naturally with security. We use organization structure to bound the data range that a user can access, and use roles to restrict the operations that the user can perform. The scalability of data distribution and access control administration are evaluated through the instance adapted from the TPC-C database. The results illustrates our data distribution model is helpful for the system to be resilient and scalable. It is suitable for large distributed system and cloud relational database.}, keywords = {Access control, Cloud database, Data distribution, Multi-hierarchical model, Multitree}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-79960669952\&partnerID=40\&md5=82211ced06d718d2f20daa5dfc146798}, author = {Zhang, J. and Wang, X. and Liu, H. and Meng, J.} } @article {232, title = {Performance evaluation of fixed and mobile relay in WiMAX system}, journal = {Journal of Digital Information Management}, volume = {8}, year = {2010}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2010}, pages = {190 - 195}, abstract = {Future wireless communication systems are expected to provide more stable and higher data rate transmissions in the whole network. WiMAX is one of the technologies to cover diverse geographic regions. WiMAX covers the high dense urban areas and provide access over large geographic regions in remote rural area. However, in both scenarios it is challenging to cover the entire service area. In both cases relays are foreseen to extend the range of the BS and to increase the system throughput allowing for a cost-efficient deployment and service. As multi-hop/relay has complex interactions between the routing and medium access control decisions, the extent to which analytical expressions can be used to explore its benefits are limited. Consequently simulations tend to be the preferred way of assessing the performance of relays. In this paper, we explain, how to deploy fixed-relay and mobile relay by using computer simulation in WiMAX system and we consistently observed that the throughput is increased and the outage is decreased in the relay-augmented WiMAX network, which is converted to range extension without any capacity penalty, for the realistic range of values of the propagation and other system parameters investigated.}, keywords = {Coverage area, Fixed relay, Throughput, WiMAX}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-79960663765\&partnerID=40\&md5=08f3181dd0a1828512060fb801f8eadc}, author = {Mumtaz, S. and Tu, L.T. and Sadeghi, R. and Gameiro, A.} } @article {229, title = {Qos-aware selection of web service compositions using Harmony Search algorithm}, journal = {Journal of Digital Information Management}, volume = {8}, year = {2010}, note = {Cited By (since 1996):4Export Date: 10 July 2014}, month = {2010}, pages = {160 - 166}, abstract = {Extensive use of web services has lead to introduce web service compositions to execute business workfiows. Since several function equivalent services, provided by different service providers, may be available in the Web, the problem of selection of web service compositions arises. QoS aware selection means considering the quality of the service composition in choosing constituent services. So a method is needed for computing the quality of a composition and determining the composition with the (almost) best quality. The resulting composite has optimal quality and satisfies user{\textquoteright}s quality constraints. In this paper, the problem of QoS aware selection of web service composition is modeled as an optimization problem. Then a variation of Harmony Search algorithm is used to find a near optimal composition. Harmony Search is a recently developed optimization algorithm that mimics the improvisation process. The proposed method based on Harmony Search has been applied to a large variety of composition schemas, generated by a simulation software, and the results show that the proposed method works faster, compared with other approaches.}, keywords = {Global optimization, Harmony Search algorithm, Quality-of-service, Web service composition, Workflow}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-79960212292\&partnerID=40\&md5=8b2aa95f15cbf2d77baea346d4870d04}, author = {Jafarpour, N. and Khayyambashi, M.R.} } @article {228, title = {A query-oriented XML fragment search approach on a relational database system}, journal = {Journal of Digital Information Management}, volume = {8}, year = {2010}, note = {Cited By (since 1996):2Export Date: 10 July 2014}, month = {2010}, pages = {175 - 180}, abstract = {In this paper, we propose a query-oriented fragment search approach for efficient and effective XML search engines on relational database systems. Conventional approaches for XML fragment search have only considered statistics of XML documents stored in a database system to rank a search result. As a result, almost all XML fragment search engines have attained negative results in the research field of information retrieval (IR). To cope with this problem, considering not only statistics in the database system but also ones extracted from a query helps to improve retrieval accuracy of XML fragment search engines; however, it is also faced with a problem related with their efficiencies. Therefore, we have to devise ways of achieving both highly-relevant search results and efficient query processing. We implemented our XML search engine adopting the query-oriented fragment search approach, and found that it allows users to search XML fragments more accurately and effectively than conventional ones on our XML search engine.}, keywords = {Efficient and effective, RDB, Scoring method for XML fragments, XML search engine}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-79956028452\&partnerID=40\&md5=42415d9f4c5aca4c312c791ecc719adb}, author = {Keyaki, A. and Hatano, K. and Miyazaki, J.} } @article {231, title = {Rule based autonomous citation mining with tierl}, journal = {Journal of Digital Information Management}, volume = {8}, year = {2010}, note = {Cited By (since 1996):9Export Date: 10 July 2014}, month = {2010}, pages = {196 - 204}, abstract = {Citations management is an important task in managing digital libraries. Citations provide valuable information e.g., used in evaluating an author{\textquoteright}s influences or scholarly quality (the impact factor of research journals). But although a reliable and effective autonomous citation management is essential, manual citation management can be extremely costly. Automatic citation mining on the other hand is a non-trivial task mainly due to non-conforming citation styles, spelling errors and the difficulty of reliably extracting text from PDF documents. In this paper we propose a novel rule-based autonomous citation mining technique, to address this important task. We define a set of common heuristics that together allow to improve the state of the art in automatic citation mining. Moreover, by first disambiguating citations based on venues, our technique significantly enhances the correct discovery of citations. Our experiments show that the proposed approach is indeed able to overcome limitations of current leading citation indexes such as ISI Web of Knowledge, Citeseer and Google Scholar.}, keywords = {Citation index, Citation mining, Digital libraries, Information extraction}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-79951786283\&partnerID=40\&md5=4fbea6129a6c4c727c3c0618ccbe6087}, author = {Afzal, M.T. and Maurer, H. and Balke, W.-T. and Kulathuramaiyer, N.} } @article {223, title = {Spam blog filtering with bipartite graph clustering and mutual detection between spam blogs and words}, journal = {Journal of Digital Information Management}, volume = {8}, year = {2010}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2010}, pages = {108 - 116}, abstract = {This paper proposes a mutual detection mechanism between spam blogs and words with bipartite graph clustering for filtering spam blogs from updated blog data. Spam blogs are problematic in extracting useful marketing information from the blogosphere; they often appear to be rich sources of information based on individual opinion and social reputation. One characteristic of spam blogs is copied-and-pasted articles based on normal blogs and news articles. Another is multiple postings of the same article to increase the chances of exposure and income from advertising. Because of these characteristics, spam blogs share common words, and such blogs and words can form large spam bi-clusters. This paper explains how to detect spam blogs and spam words with mutual filtering based on such clusters. It reports that the maximum precision, or F-measure, of the filtering is 95\%, based on a preliminary experiment with approximately six months{\textquoteright} updated blog data and a more detailed experiment with one day{\textquoteright}s data. An advantage of this method for spam blog filtering, as compared to a machine learning approach, is also supported by experiments with SVM.}, keywords = {Bipartite graph, Clustering, Filtering, Mutual detection, Spam blog, Spam word}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-79960276152\&partnerID=40\&md5=575c9621399a49b24a9d7c264810d304}, author = {Ishida, K.} } @article {220, title = {A specification model for temporal and spatial relations of segments in multimedia presentations}, journal = {Journal of Digital Information Management}, volume = {8}, year = {2010}, note = {Cited By (since 1996):2Export Date: 10 July 2014}, month = {2010}, pages = {136 - 146}, abstract = {In this paper, we introduce a conceptual tuplebased model for specification of spatial, temporal and semantic relationships among media segments in a multimedia presentation. A multimedia presentation contains various kinds of multimedia objects such as audio, video, images, text media types and so on. The organization of a presentation is a complex task in that the display order of presentation content (in time and space) must be specified. The critical decisions for presentation construction include content selection, content organization, and content delivery. Once the decision is made on the organization of the content of the presentation, it must be conveyed to the end user in the correct organizational order and in a timely fashion. Assuming that a set of multimedia segments gets organized into a presentation graph, this conceptual model formalizes a complete presentation using event-points for these segments. Three possible end-user environments of multimedia presentation are considered for presentation playout as (i) the one without any constraint, (ii) another one with a single constraint, and (iii) the third one with multiple constraints (one constraint for each type of multimedia segments in the organized presentation). In accordance with these limitations (i.e., without violating any of the end-user specified constraints), we give three methods for constructed presentations to be presented at the presentation terminal.}, keywords = {Bayesian information criterion (BIC), Document clustering, Document retrieval, Dynamic clustering, Performance, Termination criterion}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-79960249136\&partnerID=40\&md5=da73c8932dcd46bf41b98910c87b5916}, author = {Hakkoymaz, V.} } @article {213, title = {A survey on delivery context description formats - A comparison and mapping model}, journal = {Journal of Digital Information Management}, volume = {8}, year = {2010}, note = {Cited By (since 1996):2Export Date: 10 July 2014}, month = {2010}, pages = {16 - 27}, abstract = {Nowadays, mobile devices have implemented several transmission technologies which enable access to the Internet and increase the bit rate for data exchange. Despite modern mobile processors and high-resolution displays, mobile devices will never reach the stage of a powerful notebook or desktop system (for example, due to the fact of battery powered CPUs or just concerning the small-sized displays). Due to these limitations, the deliverable content for these devices should be adapted based on their capabilities including a variety of aspects (e.g., from terminal to network characteristics). These capabilities should be described in an interoperable way. In practice, however, there are many standards available and a common mapping model between these standards is not in place. Therefore, in this paper we describe such a mapping model and its implementation aspects. In particular, we focus on the whole delivery context (i.e., terminal capabilities, network characteristics, user preferences, etc.) and investigated the two most prominent state-of-the-art description schemes, namely User Agent Profi le (UAProf) and Usage Environment Description (UED).}, keywords = {CC/PP, DCO, Delivery Context, Metadata, UAProf, UED.t}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-77958067245\&partnerID=40\&md5=4ec9bec6bf35fd2f1a58a4be7f5ec64a}, author = {Timmerer, C. and Jabornig, J. and Hellwagner, H.} } @article {230, title = {System of boosting voting with multiple learning algorithms}, journal = {Journal of Digital Information Management}, volume = {8}, year = {2010}, note = {Export Date: 10 July 2014}, month = {2010}, pages = {153 - 159}, abstract = {The Ensemble classifier has been an active research topic in the area of machine learning. In a classification task, the ensemble scheme determines a final class label from several individual results which are usually generated by several individual classifiers according to two major principles. The first is to use multiple learning algorithms to form the set of individual outcomes, and the second is to train a set of data fractions, which are generated from a given training dataset, with a weak learning algorithm to generate the set of results. The advantage of the first principle is on classification stability, whereas that of the second principle is on the accuracy improvement in terms of classification accuracy. Thus far, most studies in the literature have been based on either a study of the two principles of ensemble. In this paper we propose a new ensemble scheme to combine the two principles simultaneously. We evaluate the performance on a classification task. Experimental results on several UCI benchmark datasets demonstrate that the proposed framework achieves improved performance in terms of classification accuracy compared to the conventional approaches.}, keywords = {Boosting voting, Classification, Ensemble classifier, Majority voting}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-79960667758\&partnerID=40\&md5=c1ce08210de8719732261454255800d9}, author = {Chen, C.-H. and Hsu, C.-C.} } @article {250, title = {Towards building ranking models with annual reports}, journal = {Journal of Digital Information Management}, volume = {8}, year = {2010}, note = {Cited By (since 1996):2Export Date: 10 July 2014}, month = {2010}, pages = {338 - 343}, abstract = {The textual content of company annual reports has proven to contain predictive indicators for the company future performance. This paper addresses the general re search question of evaluating the effectiveness of applying machine learning and text mining techniques to building predictive models with annual reports. More specifically, we focus on these two questions: 1) the feasibility of build ing ranking models with annual reports to rank future firm performance and 2) the effect of integrating meta seman tic features to help improve and support our prediction. We compare models built with different ranking algorithms and document models. We evaluate our models with a simulated portfolio. Our results show significantly positive average returns over 5 years with a power law trend as we increase the ranking threshold. Adding meta features to document model has shown to improve ranking performance. The SVR \& Meta-augemented model outperforms the others and pro vides potential for explaining the textual factors behind the prediction.}, keywords = {Annual reports, Documentation models, Information retrieval, Ranking models}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-79960663639\&partnerID=40\&md5=391fa47605e7e864c26988ad0b95ab63}, author = {Qiu, X.Y.} } @article {222, title = {V-isoNet: A virtualised and isolated network using open source technologies}, journal = {Journal of Digital Information Management}, volume = {8}, year = {2010}, note = {Export Date: 10 July 2014}, month = {2010}, pages = {95 - 100}, abstract = {Computer Security and Forensics is an emerging academic discipline in which there are many challenges facing educational institutions in teaching, from both an educational and technical perspective. The School of Computing in Dublin Institute of Technology offers two Security and Forensic Computing modules, a 4th year BSc (Hons) module and an MSc module. Currently the BSc module requires a practical section to the course while the MSc module does not require practical work. In order to aid teaching during the next semester, both sets of students will be exposed to a Security and Forensics practical laboratory. This series of research proposes a phased approach to design and establish a suitable overall environment to provide a comprehensive Computer Security and Forensics practical laboratory. The three identifiable components are (1) an isolated networked environment, (2) an exposed repository to be used to demonstrate vulnerabilities and (3) the formation of a Security and Forensics toolkit to be used in conjunction with the isolated network environment and the exposed repository. This first paper, in a series of three, will introduce the reader to the overall research objective. It will then focus on research and development of the first identified component, namely an isolated network environment.}, keywords = {Education, Forensics, Isolated, Network, Open source, Security, Virtualization}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-79960692758\&partnerID=40\&md5=67245f8ace4f0dc027e9fdd56f9771d2}, author = {Gleeson, M. and Markey, D. and Mtenzi, F.} } @article {244, title = {Web Architectural-Inducing Model (WA-IM) for Information Architecture in cultural context: An empirical investigation}, journal = {Journal of Digital Information Management}, volume = {8}, year = {2010}, note = {Export Date: 10 July 2014}, month = {2010}, pages = {330 - 337}, abstract = {Website Information Architecture (IA) is primarily treated as a new discipline that is concerned with design principles and architecture of information in digital landscape. Proliferation of revolutionary models for interdisciplinary applications of IA, however lack theoretical perspectives, empirical evidence and cultural context. Here, we proposed a new model called Web Architectural-Inducing Model (WA-IM). The model was developed based from existing literature and available architectural proposition from prior work. We tested the model suggesting that website IA being conceptualized as multidimensional constructs by exploring the applicability of WA-IM to web localization process from a socio-cognitive cultural perspective. The research methodology involves a web-based survey on Muslim online user as the cultural case study where 427 usable international responses were accumulated. The construct validation of the multifactor structure of website IA was assessed via confirmatory factor analysis (CFA) by using structural equation modeling. AMOS 7.0 was used to evaluate the five factor hypothesis goodness fit model. The result revealed that website IA is indeed a multidimensional construct composed of five factors: content-information, content-trust, navigation-traits, navigation-wayfindings and context. We conclude our study by providing empirical evidence for WA-IM in a form of goodness-fit-structure as part of the localization process towards the creation of cultural information structure.}, keywords = {Human computer interaction, Information architecture, Information structure, Website information architecture}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-79960696381\&partnerID=40\&md5=3f95a28698acba915c51fe96df49d297}, author = {Mohd Isa, W.A.R.W. and Md Noor, N.L. and Mehad, S.} } @article {216, title = {A Web-based surveillance system for traffic behavior and its application for practical recommendation of crosswalk installation}, journal = {Journal of Digital Information Management}, volume = {8}, year = {2010}, note = {Export Date: 10 July 2014}, month = {2010}, pages = {101 - 107}, abstract = {A Web-based surveillance system has been developed to observe some intrusion into dangerous and security area. It is designed based on a Linux PC with Web services, Open CV engine, remote monitoring camera, remote controlling sub-server and other facilities. It supports users of mobile phones. Its image understanding facility by Open CV engine gives us information about intruders{\textquoteright} tracks at the monitored places. As the result, it is beneficial that we can exactly know moving direction of intruders. Traffic security is one of the most important problems to be improved for our daily environment. In order to monitor traffic behavior, the surveillance system has been customized and applied to monitor traffic behavior about a specific area. It can acquire data about intruders{\textquoteright} tracks when they go across relatively narrow streets. Such data provide information about suitable place to realize a necessary crosswalk which will comply with silent but real intruder{\textquoteright}s requests. Its monitoring function and image processing one are not so excellent but there are significant results for surveillance by means of limited adoption and adjustment. And we can recommend installation of Crosswalk based on intruders{\textquoteright} tracks with image processing function of the surveillance system. It is concluded that our surveillance system is efficient enough to observe a specific place, compute image understanding about it and mine some kind of useful information of intruder{\textquoteright}s periodical behaviors.}, keywords = {Evidence-based recommendation, Image understanding, Mobile computing, Surveillance system}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-79960688256\&partnerID=40\&md5=5ad95a8727255298e88fb69f8b4cffd7}, author = {Imai, Y. and Hori, Y. and Masuda, S.} } @article {182, title = {About the reusable software remote laboratories have in common}, journal = {Journal of Digital Information Management}, volume = {7}, year = {2009}, note = {Export Date: 10 July 2014}, month = {2009}, pages = {166 - 172}, abstract = {In this paper, we present a new device brought online thanks to our Collaborative Remote Laboratories framework. Whereas previous devices integrated in our remote laboratory belongs to the domain of electronics, such as Vector Network Analyzers, the device at the concern in this paper is an antenna workbench. Because the middleware and framework for our environment were designed to be reusable, we wanted to illustrate these qualities by providing a completely new device in our Online Engineering catalog. After presenting the device to be put online, we will expose the software development efforts required in regards to the reusability of the solution.}, keywords = {Interoperability, Middleware, Online laboratories, Ontologies, Remote laboratories, Remote systems}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-73249142470\&partnerID=40\&md5=639fc7fb80ea23878b67430f914497fe}, author = {Gravier, C. and Fayolle, J. and Lardon, J. and Bayard, B.} } @article {201, title = {Addressing the challenge of managing large-scale digital multimedia libraries}, journal = {Journal of Digital Information Management}, volume = {7}, year = {2009}, note = {Export Date: 10 July 2014}, month = {2009}, pages = {261 - 269}, abstract = {Traditional Digital Libraries require human editorial control over the lifecycles of digital objects contained therein. This imposes an inherent (human) overhead on the maintenance of these digital libraries, which becomes unwieldy once the number of important information units in the digital library becomes too large. A revised framework is needed for digital libraries that takes the onus off the editor and allows the digital library to directly control digital object lifecycles, by employing a set of transformation rules that operate directly on the digital objects themselves. In this paper we motivate and describe a revised digital library framework that utilises transformation rules to automatically optimise system resources. We evaluate this library in three scenarios and also outline how we could apply concepts from this revised framework to address other challenges for digital libraries and digital information access in general.}, keywords = {Design, Digital objects, Experimentation, Human factors, Video objects}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-77953277044\&partnerID=40\&md5=75419cab710ca0152f89b3a277933c71}, author = {Gurrin, C. and Aarflot, T. and Sav, S. and Johansen, D.} } @article {207, title = {On automated generation of Diagnosers in fault tolerant Service Oriented Architectures}, journal = {Journal of Digital Information Management}, volume = {7}, year = {2009}, note = {Export Date: 10 July 2014}, month = {2009}, pages = {336 - 342}, abstract = {One of the key stages of the development of a fault tolerant Service Oriented Architecture is the creation of Diagnosers, which monitors the system{\textquoteright}s behavior to identify the occurrence of failure. This paper presents a Model Driven Development (MDD) approach to the automated creation of the Diagnosing Services and integrating them into the system. The outline of the method is as follows. BPEL models of the services are transformed to Deterministic Automaton with Unobservable Event representations using the MDD transformations. Then, relying on Discrete Event System techniques Diagnosers Automaton for the Deterministic Automaton representations are created automatically. Finally, the Diagnosers Automaton is transformed into a new BPEL representation, which is integrated into the original architecture. The proposed approach is implemented as an Oracle JDevlopers plugin. To evaluate the presented method, a case study involving a Right-First-Time failure scenario motivated by telecom application is used.}, keywords = {Business process execution language, Oracle JDevlopers, Web services}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-79960673085\&partnerID=40\&md5=01e27ad877cad334f9f50bb5f59cbeff}, author = {Alodib, M. and Bordbar, B. and Majeed, B.} } @article {173, title = {Biorthogonal matrix dirty paper coding for information hiding in still images}, journal = {Journal of Digital Information Management}, volume = {7}, year = {2009}, note = {Export Date: 10 July 2014}, month = {2009}, pages = {96 - 105}, abstract = {In this paper, a new method of dirty paper code design is investigated, namely the biorthogonal matrix. The error probability is analysed for the code design. Since the code has the maximum d min{\textquoteright}, the robustness of this code is optimal. However, due to the limited availability of the codewords, the performance is restricted. Superior coding and binning methods are derived from the in-depth analysis of the simulation results. Simulation results identify this restriction and solutions are discussed. Comparisons are made with non-orthogonal codes showing the robustness advantage of biorthogonal codes.}, keywords = {Biorthogonal matrix coding, Digital content security, Digital watermarking, Dirty paper coding, Document authentication, Goppa codes}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-70350666671\&partnerID=40\&md5=1a086001e3b504ed05b908e929fd00e1}, author = {Xu, X. and Tomlinson, M. and Ambroze, M. and Ahmed, M.} } @article {180, title = {Cache Pre-fetching and Replacement strategies for location dependent data in mobile environments}, journal = {Journal of Digital Information Management}, volume = {7}, year = {2009}, note = {Export Date: 10 July 2014}, month = {2009}, pages = {185 - 190}, abstract = {In this paper, new strategies for prefetching and cache replacement are proposed. The proposed pre-fetching algorithm considers the geographical and semantic adjacency between queried items. The strategy is to pre-fetch the most probable secondary service as a by-product of the execution of a query to a primary service. Association rule mining is used for determining the secondary item that should be pre-fetched. The latter part of the paper deals with a cache replacement algorithm PAID+ (Probability Area Inverse Distance +) which takes into account the access probability and distance between the mobile client and the service item which suits a pre-fetching environment. The experimental evaluations using synthetic datasets show the cache pre-fetch and replacement policy PAID+ are effective in improving the system performance in terms of the cache hit ratio of mobile clients.}, keywords = {Cache replacement, Location dependent data, Prefetching algorithm}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-73249124769\&partnerID=40\&md5=c2445ecd7a2b48db9d0be250bd2dc45e}, author = {Mary Magdalene Jane, F. and Ilayaraja, N. and Nadarajan, R.} } @article {189, title = {CUDL language semantics: Conditions}, journal = {Journal of Digital Information Management}, volume = {7}, year = {2009}, note = {Export Date: 10 July 2014}, month = {2009}, pages = {244 - 251}, abstract = {Conceptual Universal Database Language (CUDL) is a new language designed to manage dynamic database environments, which conform to the Frame DataBase model (FDB). FDB is a generic database model (oversubscribe both the Entity-Attribute-Value and the Nested Relational). CUDL is not only an FDB database language but it is mainly an agent that provides an abstraction level superior to the logical level. CUDL permits the users to conceive a database schema where single fields (tags) accept repetitions (list of values), entertain subfields and also permit to entertain an entire table in the place of a single field. In this paper we investigate the conditions, used in both retrieval and update CUDL statements, and focalize especially on the range of affection of the update statements. This becomes necessary since the CUDL abstraction level reveals the differentiation between frame objects, tag repetitions and subfield repetitions and consequently the update statements should clearly define where the data modifications occur. This need becomes heavier where some frame object verifies two (or more) disjunctive conditions and these conditions specify different range of affection inside the frame. We provide two solutions where the second one is an improvement of the first one but it demands more refined statements and more instructed / skilled users. Some constructive discussion is also provided.}, keywords = {Conditions, Database languages, Dynamically evolving database environments}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-77953258890\&partnerID=40\&md5=6ee88af2dfa44c5427dc14e26dbc6d40}, author = {Karanikolas, N.N.} } @article {202, title = {Deriving the impact of scientific publications by mining citation opinion terms}, journal = {Journal of Digital Information Management}, volume = {7}, year = {2009}, note = {Export Date: 10 July 2014}, month = {2009}, pages = {282 - 288}, abstract = {One of the most important measures for estimating the impact of scientific publications is the number of citations they have received. To day, there exist several tools and metrics to evaluate the relative importance of individual papers and publication venues based on their citation distribution. Despite their acknowledged usefulness, most of the existing techniques rely on quantitative rather than qualitative aspects of the citation analysis and thus they are inherently limited in conveying any specific information about the author opinions to wards the papers they cite. In this paper, we introduce a method that combines text mining and lexical analysis in order to elucidate the authors{\textquoteright} attitude towards the works they cite in their publications. We have applied our method on a set of 4,520 citations that span to 40 publications and tried to shed some light on the following issues. How often authors express an opinion about the papers they cite? Do all authors who cite the same publication share a common understanding on that publication{\textquoteright}s impact? Does the citations{\textquoteright} context influence people{\textquoteright}s perception of the referred papers and how we can take context into consideration? Can we define a qualitative measure for esti mating the impact of scientific publications? Our evaluation shows that although authors do not always express their personal opinions about the papers they cite, their judgments (when articulated) have a great influence on the papers{\textquoteright} perceived importance.}, keywords = {Citation impact, Opinion mining, Sentiment analysis, Text mining}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-77953259909\&partnerID=40\&md5=29f4612a2a8b6038c4d5f5e37fcbd67b}, author = {Stamou, S. and Mpouloumpasis, N. and Kozanidis, L.} } @article {166, title = {Design and development of a Query Graph Visualization system}, journal = {Journal of Digital Information Management}, volume = {7}, year = {2009}, note = {Export Date: 10 July 2014}, month = {2009}, pages = {21 - 29}, abstract = {Collaborative querying is a technique that harnesses the collective search experiences of users to assist in query formulation. We present the Query Graph Visualizer (QGV), a visual collaborative querying system that recommends related queries to a user{\textquoteright}s submitted query through a network visualization scheme. Users are able to explore the query network and select queries for execution on an information retrieval (IR) system. the QGV is not meant to be a replacement for IR systems but as a value-added module to help users search more effectively. Consequently, the QGV is not an IR system but works in tandem with existing IR systems. the design of the QGV is discussed, focusing on its architecture, the interaction between the QGV{\textquoteright}s main components and the implementation of the user interface. An evaluation of the QGV was also conducted to assess the performance of the system against to a conventional search engine. Results indicate that the evaluators who used the QGV completed their tasks much faster compared to those using a search engine alone. A usability evaluation also showed that the system complied with standard user interface heuristics.}, keywords = {Collaborative querying, Information retrieval, Query Graph Visualize, Query network}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-70350660828\&partnerID=40\&md5=33ccaf28cf0dad32e0b47d01f84a8707}, author = {Goh, D.H.-L. and Lee, C.S. and Chua, A.Y.K. and Luyt, B.} } @article {177, title = {Design and development of the dynamic DRBAC model using PMI and xacml-based authorization}, journal = {Journal of Digital Information Management}, volume = {7}, year = {2009}, note = {Export Date: 10 July 2014}, month = {2009}, pages = {63 - 73}, abstract = {In the distributed computing environment, collaboration and resource sharing among several organizations are subjects of concern. Well-established authentication and authorization are thus vital. This paper proposes a novel design and implementation of Distributed RBAC (DRBAC) and Single Sign-On (SSO) system that spans over multiple administrative domains. Our key idea is based on Multi-Agent Systems (MAS) technique owing to its modularity, autonomy, distributedness, flexibility, and scalability. All agents serve their specific purposes. We use PKI technology to secure both intra- and interdomain agents communication as well as to establish trust relationships. The Security Assertion Markup Language (SAML) is adopted to support the exchange of authentication and authorization information in the architecture. The authorization scheme is based on the Privilege Management Infrastructure (PMI). In addition, we incorporate the XACML authorization concept into the MAS engine to support the relying parties or organizations whose their access control systems are written in XACML policy. Finally, we reported our extended implementation status and introduce the multi-instance processing technique to enhance the performance of the overall system.}, keywords = {Drbac authorization, Privilege Management Infrastructure, SAML, X.509 public key certificate, XACML}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-70350666673\&partnerID=40\&md5=f54e5a65269f08ac0f6dda7b45a823c1}, author = {Fugkeaw, S. and Manpanpanich, P. and Juntapremjitt, S.} } @article {178, title = {Design and implementation of the Fast Send Protocol}, journal = {Journal of Digital Information Management}, volume = {7}, year = {2009}, note = {Cited By (since 1996):2Export Date: 10 July 2014}, month = {2009}, pages = {120 - 127}, abstract = {Over the last decades Internet traffic has grown dramatically. Besides the number of transfers, data sizes have risen as well. Traditional transfer protocols do not adapt to this evolution. Largescale computational applications running on expensive parallel computers produce large amounts of data which often have to be transferred to weaker machines at the clients{\textquoteright} premises. As parallel computers are frequently charged by the minute, it is indispensable to minimize the transfer time after computation succeeded to keep down costs. Consequently, the economic focus lies on minimizing the time to move away all data from the parallel computer whereas the actual time to arrival remains less (but still) important. This paper describes the design and implementation of a new transfer protocol, the Fast Send Protocol (FSP), which employs striping to intermediate nodes in order to minimize sending time and to utilize the sender{\textquoteright}s resources to a high extent.}, keywords = {Bulk-data transfer, Fast Send Protocol, FSP, FTP, GridFTP, High performance networking, Meridian, Striping, TCP tuning, Two staged transfer}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-70350639599\&partnerID=40\&md5=5f9011b915c84a15c0c366695d8c57e2}, author = {Rabl, T. and Koch, C. and H{\"o}lbling, G. and Kosch, H.} } @article {195, title = {Detecting phishing websites: On the effectiveness of users{\textquoteright} tips}, journal = {Journal of Digital Information Management}, volume = {7}, year = {2009}, note = {Export Date: 10 July 2014}, month = {2009}, pages = {276 - 281}, abstract = {Phishing attacks have become a serious problem for users of online banking and e-commerce websites. Many anti-Phishing approaches have been proposed to detect and prevent Phishing. One such approach is the anti-Phishing tips published by many governmental and private organizations to help users themselves to detect and prevent the attacks. This paper examines the effectiveness of the most common of the many different tips for detecting Phishing websites. A novel effectiveness criteria is proposed and used to examine each tip and to rank it based on its effectiveness score, thus revealing the most effective tips to enable users to detect Phishing attacks. Thus, proponents of anti-Phishing tips can focus on those tips which are most helpful to users in detecting Phishing attacks.}, keywords = {Effectiveness, Internet fraud, Phishing, Phishing detection, Ranking}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-77953240881\&partnerID=40\&md5=1c3c56a578107f812828ab410ac41cba}, author = {Alnajim, A. and Munro, M.} } @article {175, title = {Distributed Web 2.0 crawling for ontology evolution}, journal = {Journal of Digital Information Management}, volume = {7}, year = {2009}, note = {Export Date: 10 July 2014}, month = {2009}, pages = {114 - 119}, abstract = {The World Wide Web as a social network reflects changes of interest in certain domains. It has been shown that free online content available through blogs, wikis, news media and online forums is a valuable source of information to identify trends in certain domains. Utilizing this data, one can construct ontologies that describe this information and provide a semantically correct overview of a domain. Tracked over time this also enables a user to identify trends and hypes. The decentralised structure of the Internet, the huge amount of data and upcoming Web2.0 technologies pose several challenges to a crawling system for ontology learning, evolution and trend analysis. This paper presents a distributed crawling system with browser integration for Web2.0. The proposed crawler is a high performance Web data retrieval system aimed to gather browser-equivalent textual Web content and prepare it for ontology learning.}, keywords = {Distributed crawling, Executed crawling, Ontology evolution, Ontology learning, Web 2.0 crawling}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-70350630600\&partnerID=40\&md5=7b88c38575eca72b620a0a6e113a8f55}, author = {Juffinger, A. and Neidhart, T. and Granitzer, M. and Kern, R. and Weichselbraun, A. and Wohlgenannt, G. and Scharl, A.} } @article {165, title = {Dual watermarking scheme for copyright protection and authentication}, journal = {Journal of Digital Information Management}, volume = {7}, year = {2009}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2009}, pages = {1 - 7}, abstract = {Digital Watermarking is used for copyright protection and authentication of digital media-image/audio/video data. In this paper, a novel dual watermarking scheme is described based on Discrete Wavelet Transforms (DWT) and Singular Value Decompositions (SVD). Unlike the existing dual watermarking schemes, both the watermark embedded using DWT and SVD are invisible in the proposed scheme. For embedding, both the images are transformed into Wavelet domain and SVD is performed further on both the images. Subsequently the singular values are summed up to find the new set of singular values. Both the watermarks get embedded in the same manner. A reliable watermark extraction scheme has been developed for the extraction of the watermarks from the distorted image. Experimental evaluation demonstrates that the proposed scheme is capable of withstanding variety of attacks.}, keywords = {Digital dual watermarking, Gray-scale logo, Multiresolution analysis, Singular Value Decomposition, Wavelet Transform, Zig-zag sequence}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-70350656255\&partnerID=40\&md5=31754c14c6a8a23bba58615c2b8ff02a}, author = {Bhatnagar, G. and Raman, B. and Swaminathan, K.} } @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 {206, title = {GA and PSO-based resource scheduling for orchestrated, distributed computing}, journal = {Journal of Digital Information Management}, volume = {7}, year = {2009}, note = {Export Date: 10 July 2014}, month = {2009}, pages = {343 - 351}, abstract = {A new distributed computing architecture, Dynamic Virtual Private Network (DVPN), is introduced. The DVM (Dynamic VPN Manager) works as the Autonomous System (AS) administrator in the DVPN system to perform resource scheduling and liaise with the underlying connection management. The approach combines on-demand reservation of both the communications infrastructure and various higherlevel processing facilities. This enables support of orchestrated computing where a complex job can be considered to be a VPN community. This job may be decomposed into tasks to be located at various distributed processing sites. Data can flow between them rather like a production line, in order to deliver the finished "product" to chosen end hosts. Two variants of a resource-scheduling algorithm are proposed for job scheduling in the DVPN system. Genetic Algorithm (GA) and Particle Swarm Optimisation (PSO) mechanisms are considered for use within the optimization process. Simulation results show that both approaches are feasible. The authors then compare the performance of GA against PSO in this dynamic VPN environment to compare their suitability.}, keywords = {GA, Grid computing, Inter-domain, PSO, Resource scheduling, VPN}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-79960659450\&partnerID=40\&md5=d9ea15f86f2d90b8c89711571dc61514}, author = {Gao, Y. and Phillips, C. and He, L.} } @article {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 {192, title = {HGOAAM: Facial analysis by active appearance model optimized by hybrid genetic algorithm}, journal = {Journal of Digital Information Management}, volume = {7}, year = {2009}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2009}, pages = {193 - 201}, abstract = {Facial analysis is one of the challenges of a Human Machine Interactive (HMI) system. It includes face alignment, pose estimation, face recognition, facial expression detection etc. This paper proposes an efficient optimization technique by the hybridization of genetic algorithm (GA) with gradient descent (GD) to make a robust, efficient and real time face alignment system. It employs 2.5D Active Appearance Model (AAM) for the face search, in which the face model is generated by taking 3D landmarks and 2D texture of the facial image. Facial large lateral movements requires to optimize 6DOF (Degrees of Freedom) pose parameters which make the facial search space of AAM nonconvex. This nonconvex multidimensional search space requires an efficient optimization methodology. Gradient descent also known as deterministic optimization method can optimize the parameters as long as the search space remains convex. However in non-convex search space GA is able search face globally while GD can help GA to search face locally. In other words exploitation property of GD and exploration property of GA are combined to make an efficient optimization method. For this hybrid optimization we propose a gradient operator in GA, which functions in conjunction with the existing genetic operator of mutation. Thus it does not increase the computational cost of the system. We compare it with classical search algorithm by gradient descent and the hybrid optimization of GA with Simplex. Facial databases of SUPELEC{\textquoteright}08, Pointing{\textquoteright}04 and synthetic characters comprising of different facial poses are analyzed. Simulation results validate the efficiency, accuracy and robustness achieved.}, keywords = {Active appearance model (AAM), Facial analysis, Facial databases, Gradient descent, Hybrid genetic algorithm}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-77953263109\&partnerID=40\&md5=6f400ca83dfd110454d823df512347c5}, author = {Sattar, A. and Seguier, R.} } @article {203, title = {An image copyright protection scheme using DCT and a table look-up technique}, journal = {Journal of Digital Information Management}, volume = {7}, year = {2009}, note = {Export Date: 10 July 2014}, month = {2009}, pages = {358 - 364}, abstract = {In this paper, an image copyright protection scheme was proposed which will not involve watermark embedment in the host image. The proposed scheme is suitable for protecting precious image work where the host image should not be altered. Multiple copies of unruly black and white binary images were created by the XORed entwinement with the binary copyright logo (i.e., the watermark) and the binary characteristic extraction of host image{\textquoteright}s DCT-coefficients. The multiple copies of unruly binary images were then time-stamped with a digital signature and registered with a certified authority for protecting the rightful ownership. A giveup-table was employed to contain possible attacked host image locations and a simple table look-up operation was applied to select better candidates from the multiple copies of unruly binary images for recovering the watermark. Experimental testing will be conducted on attacks such as blurring, rescale, cropping, sharpening, noise, rotation, and JPEG lossy compression. Results showed that the watermark for proof of rightful ownership can be recovered at a high NC > 0.95 and is visually undistorted.}, keywords = {Copyright protection, Discrete cosine transform (DCT), Table look-up, Watermark}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-79960672480\&partnerID=40\&md5=d3494694cccbe120402c83a50046601c}, author = {Lin, C.-N. and Chang, C.-C. and Tsai, M.-T.} } @article {181, title = {Image recognition of occluded objects based on improved curve moment invariants}, journal = {Journal of Digital Information Management}, volume = {7}, year = {2009}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2009}, pages = {152 - 158}, abstract = {This paper presents some fundamental knowledge of image recognition of partially occluded objects, and brings forward an improved set of curve moment invariants to recognize occluded objects in images. Occluded objects in an image are not rich in information, while the improved curve moment invariants can represent those objects in a unique way. Therefore, the occluded objects can be efficiently recognized through their shape representation by the set of curve moment invariants as their features. A number of model objects are predefined in the experiments to build the prior knowledge database for the sake of matching and recognizing unknown objects in future input images. Image pre-processing is employed for both model objects and unknown input objects to obtain their boundary and partition it into subparts. Corner points along the boundary are detected after image pre-processing so that the objects can be described by the curve moment invariants of each subpart. Finally, the matching of curve moment invariants between model object and unknown object is carried on to recognize the unknown object in the input scene image. The results of experiments show that this method is robust and efficient to recognize partially occluded objects in 2D images; furthermore, the invariance to the affine transformation of objects in images are also proved in the paper.}, keywords = {Curve moment invariants, Image recogniton, Object recognition, Occluded object}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-73249137091\&partnerID=40\&md5=f19ee8c05f39dc1d26d8fca6dbc9e111}, author = {Lichun, K. and Bin, L.K. and Jin, Y.} } @article {199, title = {Image-based technique to select visually salient pages in large documents}, journal = {Journal of Digital Information Management}, volume = {7}, year = {2009}, note = {Export Date: 10 July 2014}, month = {2009}, pages = {313 - 317}, abstract = {The presentation of a book or a digital document is an important factor when designing the interface of a digital catalogue or an online bookstore. One way to attract readers and customers is to show a thumbnail or a preview of the book cover, a feature that can be extended to include a selection of the book{\textquoteright}s most appealing pages as well. If the number of documents handled by the system is large then the need to automatise the page selection task arises. This paper details an efficient and easily implementable image-based technique to choose a given number of pages to appear as thumbnails on a document list interface. The algorithm is based on a combination of rudimentary layout analysis and colour saliency computation in order to extract pages with attractive features such as large, colourful images and text elements. An arbitrary amount of spread can be injected in the selection process through an iterative filter function. A preliminary user study of the algorithm shows that its results are satisfying and provides insight as to how the technique can be improved.}, keywords = {Digital documents, Image data analysis}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-77953245612\&partnerID=40\&md5=48492271587c1f8b79e6cc6f66f74599}, author = {Matulic, F.} } @article {198, title = {Implementation of a chain ontology based approach in the health care sector}, journal = {Journal of Digital Information Management}, volume = {7}, year = {2009}, note = {Export Date: 10 July 2014}, month = {2009}, pages = {270 - 275}, abstract = {Preserving privacy and managing data access have become crucial requirements for enterprises who deal with personal data. Hippocratic databases (Agrawal et al, 2002) and the Chain method (Fedaghi, 2007) have been proposed to support this through candid database design that includes responsibility for the privacy of data as a founding tenet. We identify, study, and implement several privacy-preserving features that extend the previous work on Limiting Disclosure in the Chain method. These features include the support of Ontology in the database design, Ontology design in OWL and applying a hybrid approach of Chains and Ontologies to a Health-care use case. The proposed approach tries to bring the Chain method one step closer to fitting real-world scenarios. We present the design and implementation guidelines of each of the proposed features. The evaluation of the design shows how the ontology has simplified the complicated work of designing the traditional Hippocratic and chain methods for real databases.}, keywords = {Chain ontology, Health care, Personal databases, Personal ontology, Privacy management}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-77953238906\&partnerID=40\&md5=a47b3ef0a48f1d46ac87ecbf451089d8}, author = {Omran, E. and Bokma, A. and Al-Maati, S.A. and Nelson, D.} } @article {169, title = {Improving user{\textquoteright}s Web search experience by interactive re-ranking and zooming interfaces}, journal = {Journal of Digital Information Management}, volume = {7}, year = {2009}, note = {Export Date: 10 July 2014}, month = {2009}, pages = {35 - 43}, abstract = {The well-known search engines such as Google, Yahoo! and MSN, are not enough for the advanced users who require user experience, for instance, much more correlative words, or interactive operations applied to returned results such as re-ranking and zooming. To focus on this idea of interactivity, we proposed and implemented interactive interfaces to improve user experience for supporting Web search. they are nice interfaces supporting dynamically changing re-ranking, related word zooming, and related word emphasizing and deemphasizing. It has been served as online search service recently. Our experimental evaluations confirm their convenience and good online performance.}, keywords = {Interactive search, Online web search, Re-ranking, Zooming interfaces}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-70350657173\&partnerID=40\&md5=1b8f312e46399e7ccb384b0f2b26c92a}, author = {Liu, J. and Chen, H. and Furuse, K. and Ohbo, N.} } @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 {205, title = {Maximizing mobile multimedia adhoc networks lifetime using a distributed cooperation mechanism}, journal = {Journal of Digital Information Management}, volume = {7}, year = {2009}, note = {Export Date: 10 July 2014}, month = {2009}, pages = {352 - 357}, abstract = {Energy conservation is a critical issue in wireless mul tihop ad-hoc networks, which have nodes powered by batteries only. One major metric for energy conservation is that all nodes participate in relaying requests which may be opposite to its interest but can be a solution for extending the network lifetime. We proposed a distributed algorithm which gurabtuees a cooperation between the nodes in func tion of their energy provision. We focus in this paper on the exploitation of nodes mobility. Experiments results show the impact of nodes mobility on the behavior of our proposed algorithm.}, keywords = {Distributed algorithm, Mobile ad hoc network, Nodes mobility}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-79960685343\&partnerID=40\&md5=e4fa9baab9e0df89a5c694d24960476e}, author = {Bahi, J.M. and Eskandar, M. and Mostefaoui, A.} } @article {183, title = {Mobile lab clients for testing application specific integrated circuits in education}, journal = {Journal of Digital Information Management}, volume = {7}, year = {2009}, note = {Export Date: 10 July 2014}, month = {2009}, pages = {181 - 184}, abstract = {The aim of this work is to develop a simultaneous multi user access system - READ (Remote ASIC Design and Test) that allows users to perform test and measurements remotely via clients running on mobile devices as well as on PCs. The system also facilitates the remote design of circuits with the PAC - Designer The system is controlled by LabVIEW and was implemented using a Data Acquisition Card from National instruments. Such systems are specially suited for manufacturing process monitoring and control. The performance of the simultaneous access was tested under load with a variable number of users. The server implements a queue that processes user{\textquoteright}s commands upon request.}, keywords = {ASICs, Mobile devices, Mobile labs, Online laboratories, Remote systems, Server-client communication}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-73249148043\&partnerID=40\&md5=22ca5f36d66213765126ebee1739ec06}, author = {Auer, M.E. and Zutin, D.G.} } @article {168, title = {Nanotechnology development and sub-technologies effect}, journal = {Journal of Digital Information Management}, volume = {7}, year = {2009}, note = {Export Date: 10 July 2014}, month = {2009}, pages = {44 - 52}, abstract = {The purpose of this paper is to examine the evolution of biotechnology systems to nanotechnology systems. This in turn explains how three sub-technologies under the umbrella of biotechnology (therapeutics, platform and bioinformatics) are determining its evolution and subsequent contribution to nanotechnology. A large sample was used to test three propositions for the three technologies. the findings indicate that only platform technology is positively significantly related. This implies that therapeutics and bioinformatics are less likely to co-evolve with nanotechnology. Accordingly, firms in platform technologies are likely to perform in the economies where there is greatest focus on nanotechnology development.}, keywords = {Biotechnology, High-tech institutional capitalism, Innovation system, Nanotechnology, Technological system}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-70350627566\&partnerID=40\&md5=831142db0c5083b6af6583cedbe4b288}, author = {Al-Tameem, A.A.} } @article {186, title = {A new authentication scheme for session initiation protocol}, journal = {Journal of Digital Information Management}, volume = {7}, year = {2009}, note = {Cited By (since 1996):2Export Date: 10 July 2014}, month = {2009}, pages = {133 - 136}, abstract = {he Session Initiation Protocol (SIP) is a signaling protocol that controls communication sessions such as conferencing, telephony, and instant messaging in the Internet community (RFC2543). Before a user gets to use an SIP service provided by a server, an authentication process must be finished. However, there are some security problems with SIP authentication yet to be solved, such as server spoofing, off-line password guessing attacks, and the use of the password table. In this article, we shall propose a new authentication scheme for SIP that does not need the password table.}, keywords = {Authentication, Security, Session initiation protocol}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-73249123219\&partnerID=40\&md5=c652e0ae0a489db32f8bdd813fcac57f}, author = {Lee, C.-C. and Yang, C.-C. and Huang, S.Y.} } @article {171, title = {The NEWER system: How to exploit a neuro-fuzzy strategy for Web recommendation}, journal = {Journal of Digital Information Management}, volume = {7}, year = {2009}, note = {Export Date: 10 July 2014}, month = {2009}, pages = {8 - 14}, abstract = {Web recommendation is a promising technology aimed to predict the needs of users by suggesting them information or services retained interesting according to their preferences. Web recommendation finds in Soft Computing techniques a valid tool to handle with the uncertainty and the ambiguity characterizing the Web and all phases of user interactions with Web sites. the main rationale behind this success seems to be the complementary nature of Soft Computing paradigms that properly combined enable the development of hybrid schemes exploiting the potential of each single paradigm. In this paper, we present NEWER, a neuro-fuzzy Web recommendation system that dynamically suggests interesting pages to the current user. NEWER employs a neuro-fuzzy approach in order to determine categories of users sharing similar interests and to extract a recommendation model in the form of fuzzy rules expressing associations between user categories and relevances of pages. the derived model is used by an online recommendation module to dynamically suggest interesting links. Comparative accuracy results show the effectiveness of NEWER.}, keywords = {Neuro-fuzzy systems, Soft computing, Web personalization, Web recommendation}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-70350623232\&partnerID=40\&md5=082ad7746b5c22f000652fb4261cfdc9}, author = {Castellano, G. and Fanelli, A.M. and Torsello, M.A.} } @article {185, title = {A novel graph containment query algorithm on graph databases}, journal = {Journal of Digital Information Management}, volume = {7}, year = {2009}, note = {Export Date: 10 July 2014}, month = {2009}, pages = {143 - 151}, abstract = {Nowadays, efficient graph query processing method is coming more and more important along with the structured data accumulating. Given a graph database, a graph containment query retrieves the graphs from the database that are subgraphs of the query graph. In this paper, an algorithm is proposed, which is founded on a CFG (Closed Frequent subgraph) based index, to answer graph containment query. CFG is a set of special frequent subgraph of a graph database. When query processes through this index, it gets back a smaller candidate answer set than other methods which means much less subgraph isomorphism calculation. Both theoretical analysis and experimental evaluation result shows that the proposed method not only efficiently prunes the search branches in the feature index, but also effectively reduces the subgraph isomorphism test between the query graph and the indexed features.}, keywords = {Frequent subgraphs, Graph databases, Graph indexing, Graph querying}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-73249130115\&partnerID=40\&md5=c53fbe52cb4f2481146df6768914245f}, author = {Li, X. and Zhang, W. and Li, J.} } @article {204, title = {Optimizing Heating system management using an activity-based pervasive application}, journal = {Journal of Digital Information Management}, volume = {7}, year = {2009}, note = {Export Date: 10 July 2014}, month = {2009}, pages = {327 - 335}, abstract = {The greenhouse gas effect has become a major preoccupation worldwide. Heating of buildings and houses is one of the major sources of this effect. We propose to optimize heating control systems by directly integrating the recognition of people{\textquoteright}s activities and context in the process of temperature regulation. We introduce the concept of kinetic-awareness as a way of making a heating control system aware of a user{\textquoteright}s motion in physical space in order to adjust temperature according to their current activities.}, keywords = {Context awareness, Heat control systems, Heating system management}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-79960692759\&partnerID=40\&md5=2401f279d8595a2a81a6c410b1bb3ae4}, author = {Bruegger, P. and Pallotta, V. and Hirsbrunner, B.} } @article {167, title = {A query answering surveillance system for detecting and tracking moving objects using bounding rectangles}, journal = {Journal of Digital Information Management}, volume = {7}, year = {2009}, note = {Export Date: 10 July 2014}, month = {2009}, pages = {15 - 20}, abstract = {In many computer vision applications such as surveillance systems, detecting moving objects is the first step of information extraction. This paper introduces a query answering system that aims at responding to user queries without the need to scan the whole video tape. the proposed system is based on finding the minimum boundary rectangles (MBRs) of moving objects which appear in the video. It detects moving objects in the video frame set, keeps track of those objects, and saves information to answer future queries.}, keywords = {Background subtraction, MBR, Object tracking, Rgb difference, Surveillance system}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-70350676981\&partnerID=40\&md5=bf39ff54dd637a3f58625643a68ed65a}, author = {Sleit, A. and Almobaideen, W. and Qatawneh, M. and Barakat, A. and Saadeh, H.} } @article {188, title = {Query-by-multiple-examples using support vector machines}, journal = {Journal of Digital Information Management}, volume = {7}, year = {2009}, note = {Cited By (since 1996):2Export Date: 10 July 2014}, month = {2009}, pages = {202 - 210}, abstract = {We identify and explore an Information Retrieval paradigm called Query-By-Multiple-Examples (QBME) where the information need is described not by a set of terms but by a set of documents. Intuitive ideas for QBME include using the centroid of these documents or the well-known Rocchio algorithm to construct the query vector. We consider this problem from the perspective of text classification, and find that a better query vector can be obtained through learning with Support Vector Machines (SVMs). For online queries, we show how SVMs can be learned from one-class examples in linear time. For offline queries, we show how SVMs can be learned from positive and unlabeled examples together in linear or polynomial time, optimising some meaningful multivariate performance measures. The effectiveness and efficiency of the proposed approaches have been confirmed by our experiments on four real-world datasets.}, keywords = {Information retrieval, Machine learning, Supportvector machine, Text classification}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-77953247724\&partnerID=40\&md5=8fea0823a5d70e478bf228f315a5ef89}, author = {Zhang, D. and Lee, W.S.} } @article {190, title = {The role of interoperability in egovernment applications: An investigation of critical factors}, journal = {Journal of Digital Information Management}, volume = {7}, year = {2009}, note = {Cited By (since 1996):2Export Date: 10 July 2014}, month = {2009}, pages = {235 - 243}, abstract = {The aim of this paper is to provide a better understanding on the role of interoperability in eGovernment applications. The focus of interest is on eGovernment applications involving more than one agency or heterogeneous technical infrastructures. The main research objective is to identify a set of critical factors that influence eGovernment interoperability. To fulfil this objective we reviewed the relevant literature and examined 18 case studies of European eGovernment applications where interoperability has a significant role. The results enabled us to identify a number of critical factors categorized as technical, semantic, organizational, political, legal, managerial and economic. We believe that the results of this research can be used by practitioners and researchers alike. Practitioners may use the results as guidance when developing their own applications. Researchers can further extend these results, for example, by attempting to better understand current trends, by identifying additional critical factors and by investigating the relationships between factors.}, keywords = {Critical factors, Interoperability, Public service}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-77953270343\&partnerID=40\&md5=c3757c55a2892aedc09fa0f7b0d14650}, author = {Tambouris, E. and Loutas, N. and Peristeras, V. and Tarabanis, K.} } @article {187, title = {A secondary storage scheme for multidimensional data preserving proximity}, journal = {Journal of Digital Information Management}, volume = {7}, year = {2009}, note = {Export Date: 10 July 2014}, month = {2009}, pages = {227 - 234}, abstract = {Multidimensional arrays storing multidimensional data in MOLAP are usually very sparse. They also suffer from the problem that the time consumed in sequential access to array elements heavily depends on the dimension along which elements are accessed. This dimension dependency would be caused by arranging multidimensional data in linear order on secondary storage and the logical proximity among the multidimensional data would be lost in physical storage. This situation can be alleviated by dividing the whole array into the set of subarrays called "chunks". However, further dimension dependency would be caused, unless the compressed chunks are arranged judiciously in the page buffer. The difference among the dimension cardinalities could also cause dimension dependency; slice operation along a dimension of large cardinality tends to consume much time. We will alleviate these two kinds of dimension dependency by introducing the notion of an "extended chunk". Extended chunks can contribute to preserve the logical proximity by adapting flexibly to the usual situation where data densities are very low and are not uniformly distributed. Based on extended chunks, we will propose secondary storage schemes for multidimensional datasets using a space-filling curve such as Z-curve. The evaluation result shows that the proposed storage schemes exhibit better performance while alleviating the dimension dependency.}, keywords = {Chunk, MOLAP, Multidimensional array, Z-ordering}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-77953264906\&partnerID=40\&md5=267ce77ab223e1b13bb8dbb5b851b85d}, author = {Shimada, T. and Tsuji, T. and Higuchi, K.} } @article {174, title = {Signing digital documents in hostile environments}, journal = {Journal of Digital Information Management}, volume = {7}, year = {2009}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2009}, pages = {106 - 113}, abstract = {Digital signature is nowadays a consolidated machinery allowing the management of electronic documents with full legal power. In this scenario, digital signature represents thus the key issue on every process of document dematerialization toward which both private and public organizations, as well as simple citizens, are moving quickly. Unfortunately, digital signature suffers from a severe vulnerability, directly deriving from the potential untrustworthiness of the platform where the signature generation process runs, enabling a set of possible dangerous attacks. The basic reason of this vulnerability is that an even secure smart card is anyway a handicapped computer, since it misses I/O devices so that there is no trusted control about the link between the document to sign and the digest received from the smart card. Exploiting such a weakness, the attacker can intrude in order to obtain signed documents with no intention from the subscriber. The problem is inherently unsolvable, provided that the current signature infrastructure, as well as its legal value, are maintained. In this paper we propose a new approach to contrasting the above problem, from which we derive two techniques with different features in terms of efficiency and robustness. The nice feature of our proposal, beside its effectiveness, is that it totally preserves the current software and legal infrastructure.}, keywords = {Digital signature, Legal issues in digital signature, Non-repudiation, Security and identity management in e-activities}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-70350635834\&partnerID=40\&md5=5181ea4d5763adab38c1aa2e6e360ecb}, author = {Buccafurri, F. and Lax, G.} } @article {200, title = {Smart electronic visitor information management system with biometric verification}, journal = {Journal of Digital Information Management}, volume = {7}, year = {2009}, note = {Cited By (since 1996):2Export Date: 10 July 2014}, month = {2009}, pages = {318 - 325}, abstract = {Smart Electronic Visitor Information System (SEVIMS) is an application to replace traditional visitor registration and information management activities. SEVIMS able to record visitor information during visitor registration by using visitor{\textquoteright}s Malaysia Government Multipurpose Card (MyKad). An implementation of mobile smart card reader with biometric verification has increase the high level of security and access control. With additional features, the identity of visitor can be verify based on matching of his/her thumbprint with the thumbprint image stored in MyKad. The benefits of sophisticated SEVIMS are enhancing the level of security enforced in premises, providing an organized view of visitor records and reducing the time spent on managing visitor information.}, keywords = {Biometric, Fingerprint, MyKad, SEVIMS, Smart card}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-77953251164\&partnerID=40\&md5=c75349813dbd8d0247a33bb80770adc0}, author = {Noraziah, A. and Noorhuzaimi, M.N. and Junaida, S.} } @article {179, title = {Students{\textquoteright} review of acceptance, usability and usefulness of WebLab-Deusto}, journal = {Journal of Digital Information Management}, volume = {7}, year = {2009}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2009}, pages = {173 - 180}, abstract = {The paper shows the results of the evaluation of three remote labs implemented at the University of Deusto -WebLab-Deusto- as a learning tool. The paper presents the results of the surveys done by students since 2004. This survey consists of some questions and its main objective is to measure the acceptance, usability and usefulness of the remote laboratory developed at University of Deusto. To the best of our knowledge, this survey is the largest one in terms of number of academic years and total number of students involved.}, keywords = {Computing architecture, Hardware, Remote laboratories, Web laboratories}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-73249122403\&partnerID=40\&md5=ca83df5c2e11b7b56703ac6f3c0f0669}, author = {Garc{\'\i}a-Zubia, J. and Ordu{\~n}a, P. and Hern{\'a}ndez, U. and Angulo, I. and Irurzun, J.} } @article {176, title = {SVD-based image water marking}, journal = {Journal of Digital Information Management}, volume = {7}, year = {2009}, note = {Export Date: 10 July 2014}, month = {2009}, pages = {83 - 89}, abstract = {Advances in Internet technology have considerably facilitated the acquisition, representation, storage and distribution of images in digital format. These advances, however, made the unauthorized manipulation and reproduction of original digital images an easy process. Consequently, the design and development of effective digital image copyright protection methods have become necessary. Recently, digital image watermarking has emerged as a major technology to prevent illegal and malicious copying and distribution of digital images by embedding an unnoticeable information into the image content. In this paper, we propose an imperceptible and robust digital image watermarking algorithm. The algorithm is based on cascading two powerful mathematical transforms; the Discrete Wavelet Transform (DWT) and the Singular Value Decomposition (SVD). Combining the two transforms compensates for the drawbacks of each other, resulting in a very effective watermarking. Simulation results demonstrated the effectiveness of our proposed algorithm.}, keywords = {Digital image watermarking, Discrete Wavelet Transform (DWT), Frequency-domain watermarking, Image copyright protection, Non-invertible watermarking algorithm, Singular Value Decomposition (SVD)}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-70350657176\&partnerID=40\&md5=f1e603314fd32dcb9a0c53258db06232}, author = {Al-Haj, A. and Manasrah, T.} } @article {193, title = {Towards awareness of privacy and quality of context in context-based access control for ubiquitous applications}, journal = {Journal of Digital Information Management}, volume = {7}, year = {2009}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2009}, pages = {219 - 226}, abstract = {The growing advancement of wireless communication technologies, mobiles devices, and sensors enable new oportunities for users to share resources anytime and anywhere, making access control a critical concern. Such sensor-rich environments should be able to offer distributed and dynamic access to resources according to context information, such as user{\textquoteright}s location and time. In this scenario, the access control decisions should be based also on context information. However, as context information represents real-world situations, it is associated with certain quality indicators, such as up-to-dateness and precision, which can directly affect the access control decisions. Furthermore, enforcing user{\textquoteright}s privacy policies on context information can decrease the quality of context (QoC) information used for making access control decisions. Quality of context has in fact a strong impact on the suitable behavior of contextbased access control models. Using context information with inadequate quality may increase the probability of incorrect access control decisions. Therefore, it is important to take into account also the QoC while enforcing context-based access control policies. This paper proposes a Context-Based Access Control Model that takes into account context information and its QoC indicators to grant and to adapt access permissions on resources for Ubiquitous Computing Environments. A new module to evaluate QoC indicators was integrated in our context management architecture that is being used by proposed access control model. Moreover, we present an application called PhotoMap that uses the proposed model for controlling access to photos.}, keywords = {Access control model, Context-aware, Privacy, Quality of context, Ubiquitous computing}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-77953237856\&partnerID=40\&md5=ea8d4b294375a77ff9f0320a1f0d098a}, author = {Filho, J.B. and Martin, H.} } @article {170, title = {Upper and lower bounds on the pagenumber of the book embedding of the k-ary hypercube}, journal = {Journal of Digital Information Management}, volume = {7}, year = {2009}, note = {Cited By (since 1996):2Export Date: 10 July 2014}, month = {2009}, pages = {30 - 34}, abstract = {Graph embeddings play an important role in interconnection network and VLSI design. Determining the number of layers required to build a VLSI chip is just one of the many areas in which graph embeddings are used. A type of embedding that is helpful in determining the number of layers is a book embedding. We develop upper and lower bounds on the pagenumber of a book embedding of the k-ary hypercube along with an upper bound on the cumulative pagewidth.}, keywords = {Book embedding, Graph embedding, Hypercube}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-70350635831\&partnerID=40\&md5=91db3d618f5fa9711898a49d98f347a1}, author = {Bettayeb, S. and Hoelzeman, D.} } @article {172, title = {Vector maps compression for progressive transmission over the Internet}, journal = {Journal of Digital Information Management}, volume = {7}, year = {2009}, note = {Export Date: 10 July 2014}, month = {2009}, pages = {90 - 95}, abstract = {A problem of progressive transmission of the large vector maps from spatial information systems to the clients over the Internet or by channels with narrow bandwidth is considered. First, a simplified version of the vector map is sent to a client. The client can manipulate with the data at the coarse resolution level and request finer version of the map or of a part of the map. The proposed algorithm includes optimal multiresolution polygonal approximation used jointly with multiresolution quantization and compression of the quantized data with arithmetic codes. The proposed approach demonstrates a high compression performance with optimal and heuristic algorithms for polygonal approximation.}, keywords = {Map server; Gis, Multi-resolution polygonal approximation, Progressive transmission, Quantization, Vector maps compression}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-70350649032\&partnerID=40\&md5=062e8eba1305927bde4445dff5809733}, author = {Kolesnikov, A.} } @article {196, title = {Web architectural-inducing model (WA-IM) for information architecture in cultural context: An empirical investigation}, journal = {Journal of Digital Information Management}, volume = {7}, year = {2009}, note = {Cited By (since 1996):3Export Date: 10 July 2014}, month = {2009}, pages = {297 - 304}, abstract = {Website Information Architecture (IA) is primarily treated as a new discipline that is concerned with design principles and architecture of information in digital landscape. Proliferation of revolutionary models for interdisciplinary applications of IA, however lack theoretical perspectives, empirical evidence and cultural context. Here, we proposed a new model called Web Architectural-Inducing Model (WA-IM). The model was developed based from existing literature and available architectural proposition from prior work. We tested the model suggesting that website IA being conceptualized as multidimensional constructs by exploring the applicability of WA-IM to web localization process from a socio-cognitive cultural perspective. The research methodology involves a web-based survey on Muslim online user as the cultural case study where 427 usable international responses were accumulated. The construct validation of the multifactor structure of website IA was assessed via confirmatory factor analysis (CFA) by using structural equation modeling. AMOS 7.0 was used to evaluate the five factor hypothesis goodness fit model. The result revealed that website IA is indeed a multidimensional construct composed of five factors: content-information, content-trust, navigation-traits, navigation-wayfindings and context. We conclude our study by providing empirical evidence for WA-IM in a form of goodness-fit-structure as part of the localization process towards the creation of cultural information structure.}, keywords = {Human computer interaction, Information architecture, Information structure, Website information architecture}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-77953257765\&partnerID=40\&md5=744aea135f4ac60f3dfdcc5443c61f90}, author = {Wan Abdul Rahim, W.M.I. and Nor Laila, M.N. and Shafie, M.} } @article {191, title = {Where do the authors come from?}, journal = {Journal of Digital Information Management}, volume = {7}, year = {2009}, note = {Export Date: 10 July 2014}, month = {2009}, pages = {211 - 218}, abstract = {Permanent growth of scientific publications makes bibliographic databases and digital libraries widespread. At the same time they are an object of research in their own right. In this paper we address the question of "where do the authors come from?" via language identification of the author names. This is a two-steps process which involves primary classification based on the statistical models of languages, and classification refinement achieved with the analysis of the co-author network built from the bibliographic records. A system for automatic language identification presented here handles 14 different languages and requires no dictionary of names for traing. The statistical models are built from the general purpose corpora for all Western European, Chinese, Japanese and Turkish languages. The system is fine tuned to achieve precision and recall above 90\% for many languages, and provides better performance than some other systems aiming at the language identification of personal names. Tests on the DBLP data set have shown that the extension of the language model with the co-author network helps to improve classification results, especially in cases of closely related languages and mixed names. They have also demonstrated the usability of the system in applications such as data cleaning and trends detection.}, keywords = {Co-author network, DBLP database, Digital libraries, Language classification, Scientific publications}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-77953242477\&partnerID=40\&md5=d76b422a52e3bdf48f54dbd4ba5cd9c1}, author = {Biryukov, M.} } @article {155, title = {Accessing heritage documents according to space criteria within digital libraries}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Export Date: 10 July 2014}, month = {2008}, pages = {102 - 117}, abstract = {Local cultural heritage document collections are characterized by contents strongly attached to a territory and its associated land history. Our contribution aims at enhancing such a content retrieval process efficiently each time a query includes geographic criteria. We propose a unified model for a formal representation of geographic information. This geographic model allows space features to be described independently of their representation mode (text, graphics) in the documents. We have developed a prototype implementing geographic Information Extraction (IE) and geographic Information Retrieval (IR) processes. We process geographic IE with semantic techniques combined to classic IE approaches. Then, we implement geographic IR with intersections researching algorithms: these algorithms search for all geocoded entities in the documents collections indexes which intersect any entity in the user{\textquoteright}s query. This paper focuses on IR and Visualization proposals relying on the geospatial characteristics of cultural heritage corpora.}, keywords = {Cultural heritage, Digital libraries, Geographic information retrieval and visualization, Geographic model, Non-structured documents}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-56849092298\&partnerID=40\&md5=199c3f9b17bf1a325e0c3fcc90160b17}, author = {Marquesuza{\`a}, C. and Etcheverry, P. and Sallaberry, C. and Baziz, M.} } @article {115, title = {An actor like data model for a parallel DBMS}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2008}, pages = {262 - 271}, abstract = {We present in this paper the new concept of "actor databases" (DB-Act) being studied at the INI institute (Act21 project) where we are developing a parallel main memory database system based on an actor like data model. To achieve data distribution we use a Scalable Distributed Data Structures (SDDS) called "distributed Compact Trie Hashing" (CTH*) currently in development at the same project. Transaction management and recovery techniques are adapted for the combination of actors and SDDS in Act21. An adaptation of the nested transaction model to the actor paradigm is presented, as well as a recovery techniques using a fuzzy checkpointing tailored to the SDDS needs.}, keywords = {Actor paradigm, Parallel DBMS, Recovery, Scalable distributed data structures}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-70449395027\&partnerID=40\&md5=62e63e876a6d33c10455c63bda2b977e}, author = {Hidouchi, W.K. and Ezegour, D.} } @article {164, title = {Analysis of the association between bioinformatics and biotechnological development}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Export Date: 10 July 2014}, month = {2008}, pages = {128 - 135}, abstract = {Generally, the literature tends to either subsume bioinformatics under the general sector of biotechnology or it uses it as an explanatory dimension because it provides knowledge sources for biotechnology activities. In this study, the researcher attempt to reverse this relationship, for under the assumption of co-evolution of technology and institutions, both shape each other rather than one alone shaping the other. In testing the relationships between the biotechnology firms and bioinformatics firms of the most active countries in these sectors, the logistic regression results produce three groups of countries: (a) those that significantly positively influence bioinformatics because of biotechnology activity, (b) those that significantly negatively influence bioinformatics because of biotechnology activity, and (c) those that remain indifferent.}, keywords = {Bioinformatics growth, Computational techniques}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-56849106044\&partnerID=40\&md5=8de93884e0b90b4cb04af4dbef44126b}, author = {Al-Tameem, A.A.} } @article {159, title = {AnT\&CoW: Share, classify and elaborate documents by means of annotation}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2008}, pages = {61 - 70}, abstract = {As collective and mediated work spread out, digital data, and particularly documents, become predominant, In this paper, we describe how to support document management and especially document classification within a mechanical engineering design team working in an asynchronous and distributed way. The team members exchange comments to plan their project, to share documents, and to elaborate new documents. These comments are annotations linked together and linked to document(s). Annotations enable users to understand who is playing which role in the project and how collaborators understand a document and classify it. Observing this team led us to design an annotation tool (AnT\&CoW) that we have implemented to support its collective activity. We conclude this article by focusing on the classification building functionality, based on the use of Natural Language Processing tools.}, keywords = {Annotation, Document, Multi-viewpoint classification, Natural Language Processing, Thesauri}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-56849132057\&partnerID=40\&md5=8195cee5570fdfc7541bbf7254f465cb}, author = {Lortal, G. and Todirascu-Courtier, A. and Lewkowicz, M.} } @article {151, title = {Application schema mapping based on ontology: An approach for geospatial data storage}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Export Date: 10 July 2014}, month = {2008}, pages = {51 - 60}, abstract = {The heterogeneous nature of geospatial data makes the sharing of it across organizations a complex issue. As a standard means of geospatial data encoding, Geography Markup Language (GML) has been proposed by Open Geospatial Consortium (OGC), which facilitates sharing and exchange of geospatial information. With the proliferation of GML in many geospatial applications and storage support from the standard DBMS, the need arises for the efficient storage mechanism of GML data. This paper analyses. approaches for XML data storage in traditional DBMS and proposes alternative solutions for GML. Every GML document structure is defined in an application schema. We propose an approach for GML storage based on the analysis of the underlying application schema. A semi-automatic mapping mechanism has been proposed for the application schema to relational schemas of standard database with the utilization of the domain ontology. A set of relational schema is presumed to exist for different geospatial features. The proposed ontology based schema-matching approach for GML storage enhances the mapping process, thus facilitates sharing of heterogeneous data repositories.}, keywords = {GML storage, OGC Standards, Ontology, Schema Mapping, Spatial Data Interoperability}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-56849122330\&partnerID=40\&md5=d3859ad1904574ca7d3094b2262d4952}, author = {Manoj, P. and Ghosh, S.K.} } @article {158, title = {Automating the management of scientific conferences using information mining techniques}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Cited By (since 1996):2Export Date: 10 July 2014}, month = {2008}, pages = {3 - 11}, abstract = {Conference management systems, which help organizers in carrying out tasks in the workflow, of scientific events are widely used in the academic world. In this paper we focus on tasks where methods from the domain of information retrieval, information management and information organization can assist the organizer, the program committee members and the participants. We present a method for the creation of an improved review process by better matching the reviewers expertise with the paper topics, which can to increase the quality of the conference. Furthermore the conference participants benefit from better access to the wealth of information accumulated throughout a conference series. The Conference organizers profit from the reduced workload because of the partial automating of tedious tasks, such as the review assignment, the compilation of the conference program and the creation of poster setup plans. We report on case studies from a small-sized (around 200 participants), a medium-sized (around 400 participants) as well as a large (more than 700 participants) conference in the computer science as well as the medical domains.}, keywords = {Assignment problem, Automation, Clustering, Information visualization, Self-organizing maps}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-56849090253\&partnerID=40\&md5=bcbf62b3dabc739191df5c6d0fcdad50}, author = {Pesenhofer, A. and Mayer, R. and Rauber, A.} } @article {137, title = {Behavioral similarities for collaborative recommendations}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Cited By (since 1996):4Export Date: 10 July 2014}, month = {2008}, pages = {442 - 448}, abstract = {Recommender systems contribute to the personalization of resources on web sites and information retrieval systems. These systems use different mining techniques to generate predictions corresponding to the needs of users. In this paper, we present a hybrid recommender system using a userbased approach, that combines predictions based on web usage patterns and rating data. We suggest a new technique that takes into account common usage patterns in order to compute correlations between users and select neighborhoods, without using any rating data. Unlike classical predictive systems that use directly mining techniques in order to suggest recommendations (like the Longest Common Subsequences technique or the frequent sequential patterns mining), the originality of our usage based technique is not to harness the discovered patterns to recommend resources, but to assess similarities of navigational users profiles. Recommendations are performed in a following step. The performance of our system is tested without and by combining predictions of both navigational based technique and classical collaborative filtering, in terms of accuracy and robustness. The experimentation put forward the impact of the navigational based technique on the performance of the hybrid recommender system in terms of precision and robustness. The tests show that the more the navigational based technique is involved in the recommendation process, the more the best predictions are accurate.}, keywords = {Collaborative filtering system, Recommender system}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-77955227289\&partnerID=40\&md5=c1516b14dc70e7dac89d3e8bef4af7a1}, author = {Esslimani, I. and Brun, A. and Boyer, A.} } @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 {153, title = {Classification of digital libraries - An e-business model-based approach}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2008}, pages = {71 - 80}, abstract = {The impact of digital libraries on information processes steadily increases. Today, users may choose from a rapidly increasing number of digital libraries with various characteristics. Business models for digital libraries evolve from mere content providers to sophisticated service suppliers They offer a rich variety of information services combined with collaboration, e-learning and portal features. Traditional classification schemes for digital libraries do not sufficiently take this development into account or fail to meet it at all. In this paper we present a novel approach to the classification of digital libraries. It is based on business model characteristics with special emphasis on the evolution of digital libraries from content to information service providers. Our classification approach helps suppliers to communicate benefits and features of their libraries more effectively. It also supports customers when selecting an appropriate digital library.}, keywords = {Digital libraries, Digital libraries evaluation, Information processing}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-56849121020\&partnerID=40\&md5=5183b0da70e4e961e3e8e1e49f3af703}, author = {Markscheffel, B. and Fischer, D. and Stelzer, D.} } @article {120, title = {Classification of geographic web services for building an efficient geographic information system offering profitable value added services}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Export Date: 10 July 2014}, month = {2008}, pages = {396 - 404}, abstract = {In this paper we present best practices in implementing a geographic information system that may be used as a foundation for commercial geographic web services. On one hand we explain important rules to be followed during the design of the information system itself, e.g. the data supplyment process. On the other hand we introduce different categories for potential geographic web services and analyze these categories according to several properties. From some of those properties rules can be extracted on how well every kind of service is suited for commercial use and which technical context (e.g. security) has to be observed to be able to offer it. The whole article is based on a case study and prototype where we implemented a geographic database and geographic web services from each of the different categories in the domain of hydrology.}, keywords = {Case study, Commercial web service, Geo web service, Geographic services, GIS, Hydrology, Web service}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84865525965\&partnerID=40\&md5=11ac40933f4282aacc48cbc4550b85c4}, author = {Kleiner, C. and Aliste, A.G.} } @article {162, title = {Cluster based mixed coding schemes for inverted file index compression}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Export Date: 10 July 2014}, month = {2008}, pages = {30 - 37}, abstract = {The cluster property of document collections in today{\textquoteright}s search engines provides valuable information for index compression. By clustering d-gaps of an inverted list based on a threshold, and then encoding clustered and non-clustered d-gaps using different methods, we can tailor to the specific properties of different d-gaps and achieve better compression ratio. Based on this idea, in this paper we propose a cluster based approach and presents two new codes for inverted file index compression: mixed gamma/flat binary code and mixed delta/flat binary code, Experiment results show that the two new codes achieve better or equal performance in terms of compression ratio comparing to interpolative code which is considered as the most efficient bitwise code at present Besides, the two new codes have much lower complexity comparing to interpolative code and therefore enable faster encoding and decoding. By adjusting the parameters for the mixed codes, even better results may be achieved. Experiments show promising results with our approaches.}, keywords = {d-gap, Index compression, Inverted file, Inverted list}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-56849117299\&partnerID=40\&md5=e6f756f0e7e96db7d5c31eadd73799d6}, author = {Chen, J. and Zhong, P. and Cook, T.} } @article {144, title = {Commius - An email based interoperability solution tailored for SMEs}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Cited By (since 1996):5Export Date: 10 July 2014}, month = {2008}, pages = {430 - 433}, abstract = {More than 99\% of European enterprises are SMEs (Small and Medium-sized Enterprises). While in the current market situation collaboration is evolving to an indispensable key factor of success, research is yet to produce results which can be used by SMEs. This paper introduces an interoperability approach in the context of the European Commius Project which enables SMEs collaborate easily on the level of process interoperability. The Commius solution will dock onto existing E-Mail structures and enrich incoming E-Mails with additional information dependant upon its content and provide recommendations of expedient further steps to process the E-Mail. A first picture of the Commius process interoperability layer architecture will be drawn. Furthermore proposals to adapt Commius to the specific processes every SME has, in a simple way, are being exposed.}, keywords = {Business process, Collaboration, Email, Interoperability, SME}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-70449333910\&partnerID=40\&md5=5e75b584683eae1a1025309705abc10f}, author = {Burkhart, T. and Werth, D. and Loos, P.} } @article {163, title = {Complex query processing on Web graph: A social network perspective}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Cited By (since 1996):2Export Date: 10 July 2014}, month = {2008}, pages = {12 - 20}, abstract = {A social network represents a social community as a directed graph. Communication on the Web has given rise to social network formation like, Web Community, Referral System etc. An earlier effort has proposed a data model for such Web-based social network. Present paper discusses the relevant index structures for processing queries on a social network schema based upon the proposed data model. The paper has also provided evaluation of the structural operators proposed in the data model and discussed their efficacy with query examples.}, keywords = {Operator Evaluation, Query processing, Social Network, Web Graph, XB-tree}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-56849104350\&partnerID=40\&md5=3a2ecc369cf5c3b535859eeb8d73c2e0}, author = {Mitra, S. and Bagchi, A. and Bandyopadhyay, A.K.} } @article {135, title = {Co-training for search-based automatic image annotation}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2008}, pages = {214 - 218}, abstract = {Search-based automatic image annotation is an effective technology to enhance the performance of annotation. By integrating the co-training technique, this paper addresses on a novel scheme for search-based image annotation, in which two classifiers can contribute to each other during the training phase. Since each classifier can select some most confident images to enhance the generalization ability of the other one, the co-training learning algorithm is triggered out for automatically mining more and more relevant images, which improve the annotation performance greatly. To characterize the various contribution of each relevant image, the probability output of the classification is taken as the corresponding weight. Moreover, the histogram of retrieved keywords is proposed to re-rank the final reliability of the keywords to be annotated, which can also guarantee the scalability property of annotation to some extent. With the promoted search precision on the basis of co-training strategy, the experimental results demonstrate the improvement of annotation performance.}, keywords = {Automatic image annotation, Bayesian classifier, Co-training, SVM}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-72449186106\&partnerID=40\&md5=73219b4c7b5383b4a06f69f6ba3903d1}, author = {Zhao, Y. and Zhao, Y. and Zhu, Z.} } @article {140, title = {Discriminant parallel feature fusion based on maximum margin criterion for pattern classification}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2008}, pages = {203 - 207}, abstract = {In this paper, we propose a novel parallel feature fusion based maximum margin criterion, namely discriminant parallel feature fusion, for pattern classification. The advantage of algorithm lies in: 1) A constrained optimization problem based on maximum margin criterion is created to solve the optimal fusion coefficients, which causes that fused data has the largest class discriminant in the fused feature space. 2) An unique solution of optimization problem is transformed to an eigenvalue problem, which causes the proposed fusion strategy to perform a consistent performance. Besides of the detailed theory derivation, many experimental evaluations also are presented in this paper.}, keywords = {Discriminant parallel feature fusion, Maximum margin criterion, Parallel feature fusion}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-72449120326\&partnerID=40\&md5=45d5e7fee23074133279fb977574a551}, author = {Li, J.-B. and Chu, S.-C. and Pan, J.-S.} } @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 {134, title = {A forum-based organizational memory as organizational learning support}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Cited By (since 1996):2Export Date: 10 July 2014}, month = {2008}, pages = {303 - 306}, abstract = {Information and Communication Technologies have transformed the way people work and have a growing impact on long life learning. Organizational Learning is an increasingly important area of research that concerns the way organizations learn and thus augment their competitive advantage, innovativeness, and effectiveness. Within the project MEMORAe2.0, we are interested by the capitalization of knowledge in the context of an organization and by organizational learning. We developed the EMEMORAe2.0 environment which is based on the concept of learning organizational memory. In this paper, we present the organizational learning approach; we stress the role of an organizational memory in this approach; we define the concept of learning organizational memory; and we specify the use of a forum concept in such a context. Then we present the approach MEMORAe, the environment E-MEMORAe2.0 we developed and its evaluation.}, keywords = {Community of practice, Forum, Learning organizational memory, Ontology, Organizational learning}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-70349980893\&partnerID=40\&md5=91b22b845ffabe4a466a7a6fb88cce89}, author = {Leblanc, A. and Abel, M.-H.} } @article {130, title = {A framework for web content management system operations and maintenance}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Cited By (since 1996):5Export Date: 10 July 2014}, month = {2008}, pages = {342 - 347}, abstract = {Organizations increasingly utilize Web Content Management Systems (WCMS) to improve development speed, online flexibility and cost effectiveness for web applications. However, organizations lack the organizational processes and structure to effectively maintain WCMS. We propose a WCMS Process Framework for the operation and maintenance phase of Web Engineering. In this paper we elaborate on the construction of the framework. It encompasses the description of a generic IT Management framework and the inclusion of Web Content Management processes into a strategic, tactical, and operational level. The framework is validated through an expert validation consisting of three industry experts and a case study at a large Dutch telecommunications services provider. The case study substantiates our vision that the WCMS Process Framework contains a set of process descriptions that effectively supports the operations and maintenance of web applications.}, keywords = {Content management, Information systems maintenance, Web application, Web content management system}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-70350000617\&partnerID=40\&md5=06dc0f7329e75809c5441e53f7b39427}, author = {Souer, J. and Honders, P. and Versendaal, J. and Brinkkemper, S.} } @article {147, title = {A generic framework for visualizing the news article domain and its application to real-world data}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Cited By (since 1996):3Export Date: 10 July 2014}, month = {2008}, pages = {434 - 441}, abstract = {In this work we present APA Labs, a generic framework for visualizing the news article domain. APA Labs is a web-based platform enabling retrieval and analysis of news repositories provided by the Austrian Press Agency. APA Labs is designed as a rich internet application combined with a modular system of interactive visualizations. News articles are analyzed using domain specific named entity extraction methods combined with language specific heuristics. The proposed methods were subject to an evaluation procedure outlined in this contribution. This article illustrates the domain, the underlying concepts and implementation details. Several visualization modules are presented and an outlook on planned modules is given. Being online for around six months the community feedback as well as the easy integration of new modules shows the success of the underlying concept and the platform itself.}, keywords = {Business process, Collaboration, Email, Interoperability, SME}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-77950335223\&partnerID=40\&md5=e07a8280eb1e93146ec05ab62b545f5a}, author = {Lex, E. and Seifert, C. and Kienreich, W. and Granitzer, M.} } @article {116, title = {Hybrid clustering approach for term partitioning in document data sets}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Export Date: 10 July 2014}, month = {2008}, pages = {272 - 277}, abstract = {Information retrieval is one of the major research areas due to accumulation of huge information in digital form. Various techniques of Information retrieval are based on the fact that terms contained in a document along with their frequency of occurrence signify the semantics of the document. Recent attempts to find the relevant document for a context represents documents in a vector space model as document-term vector containing term weights for every index term in that document. As there will be enormous number of index terms this leads to high dimensionality problem. We can reduce the dimensionality based on the observation that groups of terms associated with related concepts occur together or do not occur in a document based on whether the document is relevant or not to that concept. Such a group of terms Is identified as an equivalence class and can be viewed as a single dimension in a Rough set based information retrieval system. In this paper we present a hybrid clustering approach for the formation of equivalence classes of terms associated with related concepts. It uses the outcome of hierarchical clustering to provide seed points for implementing Incremental K-means algorithm. Due to the sparsity of the term vector the cosine similarity estimate was found to be ineffective for term clustering. Another promising measure of proximity estimate used in information retrieval namely Euclidian distance has a drawback that It is biased towards changes in the term frequencies in larger documents when the term weights are represented by tf-ldf estimates. Hence we propose normalization for tf-idf estimates while representing a term as a vector in a document space before clustering the terms.}, keywords = {Dimensionality reduction, Hierarchical clustering, K means algorithm, Partitional clustering, Text mining}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-70350735762\&partnerID=40\&md5=911fe260f9a7d869bf7ee8660851cdac}, author = {Reddy, K.T. and Shashi, M. and Reddy, L.P.} } @article {129, title = {An improved biometric template protection method based on non-uniform quantization}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Cited By (since 1996):5Export Date: 10 July 2014}, month = {2008}, pages = {169 - 174}, abstract = {In recent literature, the issue of biometric template protection was raised. Some schemes were proposed to solve the contradiction between the fuzzy biometric information and accurate cryptography functions to achieve the protection of biometric template via cryptography method. In this paper, a novel methodology to achieve the security of the biometric templates in biometric systems is proposed. An adaptive non-uniform quantization (ANUQ) algorithm is introduced to eliminate the contradiction between the fuzziness of the biometric information and the sensitive of the Hash function. The ANUQ algorithm maps different biometric feature vectors from the same individual to a unique quantized feature vector. Then the quantized feature vector can be saved and identified by its hash and the biometric system can be free from the risk of the leakage of users{\textquoteright} privacy information. Based on the ANUQ algorithm, two biometric template protection scheme are designed to meet different applications. Scheme-I involved a single quantizing template while scheme-II use a quantizing template array. The comparison of the two schemes are raised. Further, the testing of these schemes are carried out on an iris recognition algorithm. The results show the feasibility of the ANUQ-based schemes.}, keywords = {Biometrics template, Non-uniform quantization, Privacy security, Quantizing template}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-67449162388\&partnerID=40\&md5=2c7c418154a7c1360f7d9e69ff418824}, author = {Han, Q. and Wang, Z. and Niu, X.} } @article {143, title = {In this issue}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Export Date: 10 July 2014}, month = {2008}, pages = {429}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84865485798\&partnerID=40\&md5=870e1831d3dff4f4d1cdbe08687846b5}, author = {Pichappan, P.} } @article {149, title = {Information hiding and multimedia signal processing}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Export Date: 10 July 2014}, month = {2008}, pages = {140 - 142}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-72449205976\&partnerID=40\&md5=cf60ca8c2c2cff6aee125963a9d4800c}, author = {Pan, J.-S. and Abraham, A.} } @article {127, title = {Information hiding on lossless data compression}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2008}, pages = {151 - 156}, abstract = {We address a new class of Information hiding on lossless data compression. In our model, secret information is embedded into a compressed data (e.g. ZIP) in a way that the compressed data can still be decompressed by regular decompression process (e.g. UNZIP). The entity with secret key can extract the secret information from the compressed data. In this paper, we formally define the above model of information hiding on lossless data compression. Then, we focus on a particular compression method, namely LZSS, which is used in ZIP/LHA. We propose a new method, called IH-LZSS, which controls the trade-off between the maximum embeddable data size and compression rate. Some experimental results are also shown.}, keywords = {Information hiding, Lossless data compression, LZSS, Tamper detection, ZIP}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-72449125165\&partnerID=40\&md5=eca05f3963e0a10ea67d3f0d70e77c76}, author = {Yoshioka, K. and Sonoda, K. and Takizawa, O. and Matsumoto, T.} } @article {117, title = {Journal of Digital Information Management: In this issue}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Export Date: 10 July 2014}, month = {2008}, pages = {235}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-70350725976\&partnerID=40\&md5=2ab88ac93de55c834aae9f68ac1d2af1}, author = {Pichappan, P.} } @article {150, title = {Learning transfer rules for machine translation from parallel corpora}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Cited By (since 1996):2Export Date: 10 July 2014}, month = {2008}, pages = {285 - 293}, abstract = {In this paper we present JETCAT, a Japanese-English transfer-based machine translation system. Our main research contribution is that the transfer rules are not handcrafted but are learnt automatically from a parallel corpus. The system has been implemented in Amzi! Prolog, which offers scalability for large rule bases, full Unicode support for Japanese characters, and several APIs for the seamless integration of the translation functionality into common office environments. As a first user interface we have developed a translation environment under Microsoft Word. The dynamic nature of our system allows for an easy customization of the rule base according to the user{\textquoteright}s personal preferences by simply post-editing the translation results, which leads to an automatic update. The user interface for Microsoft Word also provides the possibility for the user to display token lists, parse trees, and transfer rules, which makes JETCAT also a very useful tool for language students.}, keywords = {Japanese-English translation, Language transfer rules}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-70349984013\&partnerID=40\&md5=b27c9c795bbe154aace0b228c131a68e}, author = {Winiwarter, W.} } @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 {141, title = {Map-based interfaces for information management in large text collections}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Cited By (since 1996):2Export Date: 10 July 2014}, month = {2008}, pages = {294 - 302}, abstract = {The Self-Organising Map (SOM) has been proposed as an alternative interface for exploring Digital Libraries or other big document collections, in addition to conventional search and browsing. With advanced visualisations assisting the user in understanding the contents of the map and its structure, as well as advanced interaction modes as zooming, panning and area selection, the SOM becomes a feasible alternative to classical search interfaces. Several applications show the SOM{\textquoteright}s utility for this task. However, there are still shortcomings in helping the user understanding the ma, which is essential to fully exploit the SOM{\textquoteright}s potential as an Information Management tool. There are insufficient methods developed for describing the map to support the user in the analysis of the map contents. In this paper, we give an overview of existing techniques and applications of SOMs in Digital Libraries, and present recent work in assisting the user in exploring the map by automatically describing maps using advanced labelling and summarisation of map regions, focusing on text collections. Therewith, the SOM becomes an attractive tool for Information Management in large corpora.}, keywords = {Map interfaces, Text collection}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-70349977818\&partnerID=40\&md5=0a5cd581dabcf26526b1e0ca5ed375bb}, author = {Mayer, R. and Roiger, A. and Rauber, A.} } @article {154, title = {Model-driven development of content-based image retrieval systems}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2008}, pages = {81 - 91}, abstract = {Generic systems for content-based image retrieval (CBIR), such as QBIC [7] cannot be used to solve domain-specific image retrieval problems, as for example, the identification of manuscript writers based on the visual characteristics of their handwriting. Domain-specific CBIR systems currently have to be implemented bottom up, i.e. almost from scratch, each time a new domain-specific solution is sought. Inspired by the recognition, that CBIR systems, although developed for different domain-problems, comprise similar-building blocks and architecture, the idea of adopting model-driven development techniques for generating CBIR systems was elaborated. To support the design of domain-specific CBIR-Systems on a conceptual level by reusing data structure and functional interfaces a framework model is developed, which can be used to derive concrete domain-specific CBIR models. A transformation approach for the generation of a platform-specific implementation on top of an object-relational database from the concrete conceptual model is proposed. Finally, how these techniques can be applied for the design of a CBIR system for the identification of music manuscript writers based on the visual characteristics of their handwriting is demonstrated.}, keywords = {Content-based image retrieval, Model-driven development}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-56849098357\&partnerID=40\&md5=3b61ca364dee9f708c17826e51dca87a}, author = {Ignatova, T. and Heuer, A.} } @article {138, title = {Multiple description coding of an audio stream by optimum recovery transforms}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2008}, pages = {189 - 195}, abstract = {In this paper, we discuss a method of splitting one audio stream into two equal-quality streams and recover the original audio stream from only one of the split streams. From a mathematical consideration, it is found that the sum of errors of two recovered signals is equal to the power of the original signal if simple recovery is carried out. Next, we describe the optimum recovery transform. This method utilizes the covariance matrix of the signal to minimize the error of the recovered signal. We carried out several experiments to recover a signal from one of the split signals. The result showed that the optimum recovery transform gave better results than the simple recovery, while the best splitting transform differed according to the signal to be processed.}, keywords = {Audio coding, Audio signal, Multiple description coding, Optimum recovery transform}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-72449178373\&partnerID=40\&md5=fa0b212006f85c8502fb726c829bd02f}, author = {Ito, A. and Makino, S.} } @article {124, title = {The OntoNL semantic relatedness measure for OWL ontologies}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Export Date: 10 July 2014}, month = {2008}, pages = {366 - 374}, abstract = {An effect of the growing importance of the Semantic Web used for sharing knowledge over the Internet was the development and publishing of many ontologies in different domains. This led to the need of developing mechanisms for capturing the semantics of the ontologies. In this paper, we introduce the OntoNL Semantic Relatedness Measure, a fully automated way of measuring, in an asymmetric way, semantic relatedness between concepts of domain ontologies. We have developed metrics to guide the automation of the procedure by using feedback from an extensive evaluation with human subjects. We conclude with an application based evaluation using the OntoNL Framework as the application platform, a Natural Language Interface Generator for Knowledge Repositories.}, keywords = {Domain ontology, Knowledge Repositories, OntoNL Framework}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-84865464416\&partnerID=40\&md5=b36024693390715e4aab217ee0f62b12}, author = {Karanastasi, A. and Christodoulakis, S.} } @article {131, title = {Optimal two-pass frame-layer bit allocation for H.264 Video}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2008}, pages = {174 - 179}, abstract = {In this work, the frame-layer bit allocation problem is studied for H.264 video. We first impose a GOP (Group of Pictures) structure on the underlying H.264 video, and then develop a two-pass rate control algorithm based on the Lagrange optimization framework. The proposed algorithm estimates the rates and the distortions of all frames in a GOP by preencoding them using a constant quantization parameter (QP) in the first pass. The target number of bits of each frame is determined by searching the Lagrange multiplier that meets the bit budget constraint for the GOP. The proposed algorithm is useful for nonconversational applications such as video streaming where video sources can be encoded off-line. Experimental results demonstrate that the proposed algorithm achieves substantially higher picture quality than the rate control algorithm in the H.264 reference encoder.}, keywords = {Bit allocation, H.264, Rate control, Rate-distortion optimization}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-72449209699\&partnerID=40\&md5=c41f97ca2d0ee3770b908360518c3556}, author = {Kwon, D.-K. and Shen, M.-Y. and Kuo, C.-C.J.} } @article {122, title = {Personalized document ranking: Exploiting evidence from multiple user interests for profiling and retrieval}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Cited By (since 1996):14Export Date: 10 July 2014}, month = {2008}, pages = {354 - 365}, abstract = {The goal of personalization in information retrieval is to tailor the search engine results to the specific goals, preferences and general interests of the users. We propose a novel model for both user profiling and document ranking that consider the user interests as sources of evidence in order to tune the accuracy of the documents returned in response to the user query. User profiling is performed by managing the user search history using statistical based operators in order to highlight the user short-term interests seen as surrogates for building the long-term ones. The document ranking model{\textquoteright}s foundation comes from influence diagrams which are extension of Bayesian graphs, dedicated to decision-making problems. Hence, query evaluation is carried out as an inference process that aims at computing an aggregated utility of a document by considering its relevance to the query but also the corresponding utility with regard to the user{\textquoteright}s topics of interest. Experimental results using enhanced TREC collections indicate that our personalized retrieval model is effective.}, keywords = {Data Quality, Grammar Formalism, Integrity Constraint Checking, Spatial Consistency, Topological Relationships, Visual Language Parsing}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-70349921290\&partnerID=40\&md5=8adac2115f775267c564b7fcb8a379f1}, author = {Tamine-Lechani, L. and Boughanem, M. and Zemirli, N.} } @article {145, title = {Query planning in the PORDaS P2P database system}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Export Date: 10 July 2014}, month = {2008}, pages = {307 - 314}, abstract = {Computational science is a rapidly growing multidisciplinary field that has a need for scalable, distributed, and efficient data management. In our research, we see the peer-to-peer (P2P) paradigm a possible solution to some of the problems in distributed data management. P2P has already proved to be suitable in contexts like file sharing, distributed computations, and distributed search. In our research we are aiming at using P2P to solve some problems in the domain of distributed databases. In this paper we 1) present PORDaS, a distributed DBMS based on P2P techniques, 2) describe query processing and query planning in PORDaS, and 3) present results from an experimental evaluation of different query planning variants.}, keywords = {Data grid, Distributed databases, Peer-to-peer, Query processing}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-70349991902\&partnerID=40\&md5=ac29e0f628f2878d089fa8c43f3eb0de}, author = {N{\o}rv{\r a}g, K. and Eide, E. and Standal, O.H.} } @article {139, title = {Rate control scheme based on cauchy R-D optimization model for H.264/AVC under low delay constraint}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2008}, pages = {180 - 188}, abstract = {The motivation of this work is based on the observation that Cauchy distribution provides more accurate estimates of rate and distortion characteristics of video sequences than the previously used distribution such as Laplacian distribution. In this paper, we propose a new rate control scheme for H.264 low-delay video transmission using Cauchy rate-distortion optimization model. Our proposed method uses the Lagrange Multiplier technique to optimize the cost function, and be able to find the rate and distortion model subject to the target bit rate constraint resulting in the optimum choice of quantization step sizes. Model parameters are estimated using statistical linear regression analysis. The target number of bits for each frame is determined according to their buffer status, the number of bits use in the previous frame, and basic unit complexity. The proposed scheme has been implemented on H.264 video coder. Simulation results show that the proposed rate control algorithm achieves, on the average, an improvement in PSNR for up to 1.68dB with lesser number of frames skipped as compared with the default H.264 JM8.6 rate control scheme.}, keywords = {Cauchy distribution, Lagrange multiplier technique, Linear regression analysis, Low delay, Rate control}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-72449205119\&partnerID=40\&md5=60340eb5bbe6774b89e2d6c72f1c7181}, author = {Eiamjumrus, N. and Aramvith, S.} } @article {114, title = {A recommendation model based on site semantics and usage mining}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Export Date: 10 July 2014}, month = {2008}, pages = {244 - 255}, abstract = {The explosive growth of online data and the diversity of goals that may be pursued over the web have significantly increased the monetary value of the web traffic. To tap into this accelerating market, web site operators try to increase their traffic by customizing their sites to the needs of specific users. Web site customization Involves three great challenges: (I) the accurate identification of the user Interests in the sites{\textquoteright} content (II) the detection of the user goals in their site visits and (III) the encapsulation of the user interests and goals into the sites{\textquoteright} presentation and content. In this paper, we study how we can effectively identify the user interests and goals in their site visits and we evaluate their correlation as this is exemplified in the users{\textquoteright} navigational patterns and the site{\textquoteright}s semantic content and structure. Based on our findings we propose a novel recommendation mechanism that employs web mining techniques for suggesting customized site views that satisfy both the user preferences and goals. Our experimental evaluation shows that the user site interests and interaction goals can be accurately detected from the users{\textquoteright} navigational behavior and that our recommendation model, which uses the identified user preferences and goals yields significant improvements in the sites{\textquoteright} usability.}, keywords = {Recommendations, Subject hierarchy, User profiles, Web site customization, Web usage mining}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-70350741026\&partnerID=40\&md5=9afb2fa2b33a9de355f329041b572518}, author = {Stamou, S. and Kozanidis, L. and Tzekou, P. and Zotos, N.} } @article {161, title = {Restricted continuous KNN queries on road networks with caching enhancement}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Cited By (since 1996):2Export Date: 10 July 2014}, month = {2008}, pages = {38 - 50}, abstract = {Using a Global Positioning System (GPS) in the car navigation system enables the driver to perform a wide range of queries, from locating the car position, to finding a route from a source to a destination, or dynamically selecting the best route in real time. With spatial network databases (SNDB), objects are restricted to move on pre-defined paths (e.g., roads) that are specified by an underlying network. In our previous work, we proposed a novel approach, termed Progressive incremental Network Expansion (PINE), to efficiently Support several spatial queries. In this work, we utilize our developed PINE system to efficiently support Restricted Continuous K Nearest Neighbors (RCKNNs) queries. RCKNN continously finds the K nearest objects to a query point an a given path that are within a specified distance bound. Our solution addresses a new type of query that is plausible to many applications where the answer to the query not only depends an the distances of the nearest neighbors, but also on the user ar application needs. By distinguishing between two types of split points, we reduce the number of computations required to retreive the RCKNNs of moving object. We futher define a caching model to expedite RCKNN query response time.}, keywords = {Navigation system, Network databases, Spatial databases}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-56849106703\&partnerID=40\&md5=cc8d24f89ed2e864614cd064ddf33afc}, author = {Safar, M. and Ebrahimi, D. and Jane, M.M.F. and Nadarajan, R.} } @article {148, title = {Reversible data embedding for color images}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2008}, pages = {143 - 150}, abstract = {The data hiding technique is used to hide a secret message into a cover image which is then sent to a receiver without raising any suspicions. With a reversible (lossless) data hiding method, a receiver can extract a secret message and exactly restore an original cover image from an embedded image. This paper presents a novel reversible data embedding scheme for color images. The proposed scheme mostly embeds two secret bits into one cover pixel by replacing the cover pixel with its permutation whose Euclidean distance is closest to the cover pixel. The experimental results show that the proposed scheme can achieve a high embedding rate while maintaining the visual quality of stego color images in comparison with other methods.}, keywords = {Color image, Data hiding, Reversible data embedding, Steganography}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-72449195742\&partnerID=40\&md5=1b853cfe31f8ca5c0628ba531a66fd92}, author = {Chang, C.-C. and Kieu, T.D. and Chou, Y.-C.} } @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 {132, title = {Route navigation method for disabled access GIS in consideration of abilities and psychologies}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2008}, pages = {348 - 352}, abstract = {This paper aims to propose a route navigation method for disabled access GIS. We focused the disabled{\textquoteright}s psychologies as well as their physical conditions. This paper represents quantization of physical and psychological burden of the disabled persons inflicted by various barrier factors. Also it represents estimation of total burden of a route to determine the optimum route. The route is represent ed by graph theory and route navigation method which is based on Dijkstra algorithm is applied. We extend the algorithm to make it possible to provide information on obstacles even when there are no accessible routes available to destination. The result of this study is being implemented and published as 3D Web Disabled Access GIS.}, keywords = {Dijkstra algorithm, Disabled GIS access, Route navigation}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-70349999422\&partnerID=40\&md5=4e6caeba1ef58b3c7c8a134d5f996e57}, author = {Izumi, S. and Kobayashi, G. and Yoshida, T.} } @article {156, title = {Service-oriented workflow}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2008}, pages = {118 - 127}, abstract = {The advantages of Information and Communication Technologies (ICT) have forced many enterprises to reconsider the way their business processes are undertaken. Among various Information Technologies, the Workflow Management System greatly improves the efficiency of business processes. The challenge for Workflow Systems relies on their ability to align ICT and the processes of production and business. They should support the strategic policy of the enterprise and quickly respond to on-demand business and opportunities. Unfortunately, they suffer from some lacks and limitations due to their monolithic architectures. Most Workflow Management Systems are dependent on technology platforms and partially conform to standards. We attempt throughout the present paper to propose the next generation of Workflow architectures. We conceive workflow systems as a set of services, which are generic and platform-independent. Services are self-contained and fully-customized. Workflow services are assembled from computational components (i.e. web services), which are loosely coupled. The new architecture is split into layers to guarantee a high level of abstraction, each of which is managed by a crucial Web Service known as the orchestrator service.}, keywords = {Design tools and techniques, Integrated environment, Interoperability, Software architectures, Standards, Workflow management}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-56849115934\&partnerID=40\&md5=00c78de5d2932b1fff3748d5f1636974}, author = {Badr, Y.} } @article {119, title = {A smart card based remote user authentication scheme}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2008}, pages = {256 - 261}, abstract = {Password based authentication schemes are commonly used to authenticate remote users. Many schemes have been proposed both with and without smart cards but each have Its own merits and demerits. This paper analyzes the security of an enhanced Dynamic ID based remote user authentication scheme and shows that the enhanced scheme has major security weaknesses. The paper also presents a new scheme which overcomes the weaknesses and provides better security strength.}, keywords = {Smart cards, User authentication, User passowords}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-70350745322\&partnerID=40\&md5=472b89ddad64850ae41b20e57c01c3b9}, author = {Misbahuddin, M. and Premchand, P. and Govardhan, A.} } @article {146, title = {Smoke detection for early fire-alarming system based on video processing}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Cited By (since 1996):3Export Date: 10 July 2014}, month = {2008}, pages = {196 - 202}, abstract = {The paper presents a smoke-detection method for early fire-alarming system based on video processing. The basic strategy of smoke-pixel judgment is composed of two decision functions: a chromaticitybased decision function in static characteristic and a diffusion-based decision function in dynamic characteristic. The chromatic decision rule is deduced by grayish color of smoke and the dynamic decision rule is dependent on the diffusion attribute of smoke. To give an appropriate alarm, a fuzzy scheme is introduced to enhance the reliability of alarming by checking if the quantity of smoke extracted increases with the checking time. Experimental results show that the proposed method can provide an early alarm at a lower false alarm rate before the fire burns up, and hence is very attractive for the important places, social security, commercial applications, and so on.}, keywords = {Fire-alarming, Fuzzy scheme, Image processing, Smoke detection, Smoke pixels}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-72449134788\&partnerID=40\&md5=1d71de0f8f9dde2103aa7102bd316fc3}, author = {Wang, D.-J. and Chen, T.-H. and Yin, Y.-H. and Chen, T.-Y.} } @article {128, title = {Special issue on digital information management}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Export Date: 10 July 2014}, month = {2008}, pages = {281 - 284}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-70349983276\&partnerID=40\&md5=3307d00e9cbb24d7342a1b1218e9ac20}, author = {Badr, Y. and Chbeir, R.} } @article {152, title = {Special issue on digital information management}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Export Date: 10 July 2014}, month = {2008}, pages = {1 - 2}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-56849108171\&partnerID=40\&md5=967301b4d0cf740733a20c27b70edde4}, author = {Chbeir, R. and Pichappan, P. and Abraham, A.} } @article {133, title = {Standardized multimedia retrieval based on web service technologies and the MPEG query format}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Cited By (since 1996):6Export Date: 10 July 2014}, month = {2008}, pages = {315 - 331}, abstract = {In recent years, the growing number of digital audiovisual media files available over the internet or even on users hard discs is overwhelming. In order to support efficient storage and retrieval of those data, several comprehensive and rich multimedia retrieval systems (MMRS) have been introduced. Unfortunately, a standardized query format does not yet exist and almost every retrieval framework provides its own proprietary solution. Therefore, the ISO/IEC SC29 WG11 committee decided to contribute to this application by establishing the MPEG Query Format (MPQF). The MPQF is currently in Final Committee Draft (FCD) status and provides besides the standardization of messages from and to multimedia services also functionalities for service discovery, aggregated services and definition of service capability descriptions. In this context, the paper briefly introduces the MPQF and concentrates thereby on the management part. Based on this, a Web Service based framework is presented that realizes the management functionalities of MPQF. One of its central novel features is the distribution of a MPQF request to multiple multimedia services and the aggregation of individual result sets.}, keywords = {Audio visual media, ISO multimedia standards, MPEG query format}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-67650583071\&partnerID=40\&md5=ad0ab700b7cdca43c561426ac442090a}, author = {D{\textquoteright}Oller, M. and Bauer, K. and Kosch, H. and Gruhne, M.} } @article {160, title = {Topic maps management in spatial-temporal multimedia blogs}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Export Date: 10 July 2014}, month = {2008}, pages = {92 - 99}, abstract = {Web-based blogging has entered the mainstream of society as an easy way to publish information, and it is exponentially increasing the data volume and its related complexity. Spatial-temporal information (Where and When contexts) contained inside multimedia postings needs to be better semantically handled by search engines or by end-users as current web blogs still lack semantic support. The semantic web community has promoted Topic Maps as a technology that reduces the lack of semantics regarding optimization of information creation, exchange, navigation, merging, and dissemination. This paper introduces a new layer that combines blogging standards (e.g. RSS and Atom) with the Topic Maps data model for semantic-augmented and interoperable information exchange support. In addition, the paper includes examples from the Isfahan Islamic Architecture DataBase (IIADB) project, the pilot user of the topic maps layer bridging the semantic gap of multimedia postings in a historical and architectural context.}, keywords = {Multimedia blogs, Topic maps, Web based blogs}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-56849111393\&partnerID=40\&md5=8bf91066001e7e131a7ed018919772f3}, author = {Rajbhandari, S. and Andres, F. and Naito, M. and Wuwongse, V.} } @article {123, title = {Towards an on- Line semantic information retrieval system based on Fuzzy Ontologies}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Cited By (since 1996):7Export Date: 10 July 2014}, month = {2008}, pages = {375 - 385}, abstract = {The huge number of available documents on the Web makes finding relevant ones a challenge. Thus, searching for information becomes more and more complex because of the growing volume of data and of its lack of structure. The quality of results that traditional full-text search engines provide is still not optimal for many types of user queries. Especially, the ambiguities of natural languages and abstract concepts are handled inadequately by full-text search engines. Ontologies provide a solution to these problems. They can help a user to find documents related to a specific domain. This paper proposes a new retrieval system based on ontologies. This system integrates results from traditional full-text engines, and thus supports a gradual transition from classical full-text search engines to ontology-based ones.}, keywords = {Fuzzy ontologies, In formation retrieval, Ontologies, Semantic web}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-79952825348\&partnerID=40\&md5=8f3f224f39ca945c15dffeedf6099fad}, author = {Baazaoui, H. and Aufaure, M.-A. and Soussi, R.} } @article {125, title = {A trust-based virtual collaborative environment}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2008}, pages = {405 - 413}, abstract = {The concept of Virtual Organisation (VO) is a natural outcome of networks evolution and collaborative work tools growth. In the VIVACE and TSCP projects, we have studied the different issues when setting VOs up. In this paper, we expose requirements and characteristics of VOs through a use case, which was proposed by these two consortiums. Then, we present a secured collaborative environment, which combines attribute based access control models, privilege management infrastructure and identity federation, we have deployed to deal with VO security constraints. This architecture allows organisations to externalise processes such as authenticating remote users to their partners (the users{\textquoteright} home organisations). The establishment of such a decentralised management solution implies these organisations to be sufficiently mature to deal with such delegated tasks. We consider the maturity of the security practices deployed within each organisation to choose the trustee organisations between the potential partners. We provide a tool that helps organisations to evaluate their maturity.}, keywords = {ABAC, Identity federation, ISO/IEC 27000, Maturity level, PMI, Virtual Organisation}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-70449694381\&partnerID=40\&md5=b483d2e5359ab72eb596dab3a424963f}, author = {Kamel, M. and Laborde, R. and Barr{\`e}re, F. and Benzekri, A.} } @article {118, title = {Web information extraction using web-specific features}, journal = {Journal of Digital Information Management}, volume = {6}, year = {2008}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2008}, pages = {235 - 243}, abstract = {Several problems exist with traditional HMM based approaches for Web information extraction (IE) due to the lack of consideration on Web-specific features. To address this Issue we present a Generalized Hidden Markov Model (GHMM) that extends HMMs by making use of Web-specific Information for Web IE. In GHMMbased approach, Web content blocks instead of terms are used as basic extraction unit. Besides, instead of using the traditional sequential state transition order, GHMM decides the state transition order based on layout structure of the corresponding web page. Furthermore, GHMM uses multiple emission features derived from Web information instead of single emission feature. Experimental study shows that GHMM based approach can effectively improve Web IE comparing to traditional HMM based approaches.}, keywords = {Hidden, Information extraction, Markov model}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-70350728184\&partnerID=40\&md5=f0b7ac3e808f4c890768399e96e15bca}, author = {Chen, J. and Zhong, P.} } @article {112, title = {Adaptive turbo coded OFDM}, journal = {Journal of Digital Information Management}, volume = {5}, year = {2007}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2007}, pages = {364 - 367}, abstract = {In this paper the system throughput of an OFDM system is enhanced by adding turbo coding and adaptive modulation (AD). Simulation is done over a time varying Raleigh fading channel. Each OFDM block is individually modulated according to channel state information acquired during the previous burst. The system automatically switches from higher to lower order modulation in order to maintain a constant bit error rate. Turbo codes are added for forward error correction, in addition to adaptive modulation. The end goal is to increase the system throughput while maintaining a bit error rate (BER) of 10-2.}, keywords = {Adaptive modulation, OFDM, Turbo coding}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-49149125188\&partnerID=40\&md5=a098b6218fe0034c544bfe24d2b8e4aa}, author = {Haider, S.A. and Noori, K.} } @article {90, title = {An algorithm for generating the design matrix for multivariate polynomial least squares fitting}, journal = {Journal of Digital Information Management}, volume = {5}, year = {2007}, note = {Export Date: 10 July 2014}, month = {2007}, pages = {225 - 230}, abstract = {This paper presents an algorithm for generating the design matrix that is usually used for multivariate polynomial least square fitting. The design matrix is used in least squares fitting algorithm to construct a set of linear equations whose solution is the required polynomial coefficients. The developed algorithm was coded in MATLAB. The coded function named mv∝lyfit(X,Y,ord) accepts as inputs two matrices: the first argument is a 2D matrix of the independent variable X, the second argument is the dependent variable vector Y, and the last argument is the required degree of the fitting polynomial. The function returns the coefficient vector C and the design matrix A. Number of data points (k) needed for the function should be large enough for the solution of the set of linear equations to exist.}, keywords = {Curve fitting, MATLAB, Multivariate polynomial fitting, Numerical algorithms}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-44949259846\&partnerID=40\&md5=70df949826a1c381c4c629a148ad7e1e}, author = {Al-Hamdan, S.F.} } @article {74, title = {Analysis of the data quality of audio descriptions of environmental sounds}, journal = {Journal of Digital Information Management}, volume = {5}, year = {2007}, note = {Cited By (since 1996):9Export Date: 10 July 2014}, month = {2007}, pages = {48 - 54}, abstract = {In this paper we perform statistical data analysis of a broad set of state-of-the-art audio features and low-level MPEG-7 audio descriptors. The investigation comprises data analysis to reveal redundancies between state-of-the-art audio features and MPEG-7 audio descriptors. We introduce a novel measure to evaluate the information content of a descriptor in terms of variance. Statistical data analysis reveals the amount of variance contained in a feature. It enables identification of independent and redundant features. This approach assists in efficient selection of orthogonal features for content-based retrieval. We believe that a good feature should provide descriptions with high variance for the underlying data. Combinations of features should consist of decorrelated features in order to increase expressiveness of the descriptions. Although MPEG-7 is a popular and widely used standard for multimedia description, only few investigations do exist that address analysis of the data quality of low-level MPEG-7 descriptions.}, keywords = {Audio descriptors, Audio features, MPEG-7 descriptors, Multimedia content retrieval}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-44849119790\&partnerID=40\&md5=8ed62cb5e71bdeccf00462d93d30e2db}, author = {Mitrovic, D. and Zeppelzauer, M. and Eidenberger, H.} } @article {97, title = {Anomaly detection through quasi-functional dependency analysis}, journal = {Journal of Digital Information Management}, volume = {5}, year = {2007}, note = {Cited By (since 1996):5Export Date: 10 July 2014}, month = {2007}, pages = {191 - 200}, abstract = {Anomaly detection problems have been investigated in several research areas such as database, machine learning, knowledge discovery, and logic programming, with the main goal of identifying objects of a given population whose behavior is anomalous with respect to a set of commonly accepted rules that are part of the knowledge base. In this paper we focus our attention on the analysis of anomaly detection in databases. We propose a method, based on data mining algorithms, which allows one to infer the "normal behavior" of objects, by extracting frequent "rules" from a given dataset. These rules are described in the form of quasi-functional dependencies and mined from the dataset by using association rules. Our approach allows us to consequently analyze anomalies with respect to the previously inferred dependencies: given a quasi-functional dependency, it is possible to discover the related anomalies by querying either the original database or the association rules previously stored. By further investigating the nature of such anomalies, we can either derive the presence of erroneous data or highlight novel information which represents significant exceptions of frequent rules. Our method is independent of the considered database and directly infers rules from the data. The applicability of the proposed approach is validated through a set of experiments on XML databases, whose results are here reported.}, keywords = {Anomaly detection, Association rules, Data mining, Qausi-functional dependencies}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-44949112157\&partnerID=40\&md5=cdbe91548ea650327ae0cdf87c4cf97f}, author = {Bruno, G. and Garza, P. and Quintarelli, E. and Rossato, R.} } @article {79, title = {Biological model for information retrieval}, journal = {Journal of Digital Information Management}, volume = {5}, year = {2007}, note = {Export Date: 10 July 2014}, month = {2007}, pages = {123 - 129}, abstract = {Heuristic methods based on biological aspects have been successfully used in many computer science areas of research, including information retrieval (IR). This let us ask: why there is no biological environment for the problem of information retrieval. In this paper, we tried to introduce a new biological environment and model for information retrieval that broad the modeling concept from the mathematical formula that simulates the basic elements of IR problem to their dual schemas in biology. It{\textquoteright}s a new way of thinking of, and dealing with, the problem of information retrieval.}, keywords = {Biological environment, Biological model, Genetic algorithms, Information retrieval}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-70350691855\&partnerID=40\&md5=22f8442d6b340f89f18dd39e3c99ed99}, author = {Girgis, M.R. and Aly, A.E.-M.A. and Latef, B.A.A. and El-Gamil, B.R.} } @article {113, title = {Clustering frequent graph patterns}, journal = {Journal of Digital Information Management}, volume = {5}, year = {2007}, note = {Export Date: 10 July 2014}, month = {2007}, pages = {335 - 346}, abstract = {In recent years, graph mining has attracted much attention in the data mining community. Several efficient frequent subgraph mining algorithms have been recently proposed. However, the number of frequent graph patterns generated by these graph mining algorithms may be too large to be effectively explored by users, especially when the support threshold is low. In this paper, we propose to summarize frequent graph patterns by a much smaller number of representative graph patterns. Several novel concepts such as δ-cover graph, jump value and δ-jump pattern are proposed for efficiently summarizing frequent graph patterns. Based on the property of all δ-jump patterns being representative graph patterns, we propose two efficient algorithms for summarizing frequent graph patterns, RP-FP and RP-GD. The RP-FP algorithm computes representative graph patterns from a set of closed frequent graph patterns, whereas the RP-GD algorithm directly mines representative graph patterns from graph databases. The RP-FP has tight approximation (summarization) bound but higher computational complexity. The RP-GD has no approximation bound guarantee but is far more efficient. We conducted extensive experimental studies using various real and synthetic datasels. Experimental results show that RP-FP and RP-GD are able to obtain compact summarization in both real and synthetic graph databases. When the number of closed graph patterns is very large, RP-GD is much more efficient than RP-FP, while achieving comparable summarization quality.}, keywords = {Closed graph pattern, Frequent graph pattern, Graph mining, Representative graph pattern, δ-jump pattern}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-49149118250\&partnerID=40\&md5=cae15cbd3bb5b1a9e3f57a95dbe295b5}, author = {Liu, Y. and Li, J. and Zhu, J. and Gao, H.} } @article {98, title = {A comparative study on key phrase extraction methods in automatic Web Site Summarization}, journal = {Journal of Digital Information Management}, volume = {5}, year = {2007}, note = {Cited By (since 1996):5Export Date: 10 July 2014}, month = {2007}, pages = {323 - 332}, abstract = {Web Site Summarization is the process of automatically generating a concise and informative summary for a given Web site. It has gained more and more attention in recent years as effective summarization could lead to enhanced Web information retrieval systems such as searching for Web sites. Extraction-based approaches to Web site summarization rely on the extraction of the most significant sentences from the target Web site based on the density of a list of key phrases that best describe the entire Web site. In this work, we benchmark five alternative key phrase extraction methods, TFIDF, KEA, Keyword, Keyterm, and Mixture, in an automatic Web site summarization framework we previously developed. We investigate the performance of these underlying methods via a formal user study and demonstrate that Keyterm is the best choice for key phrase extraction while Mixture should be used to obtain key sentences. We also discuss why one method performs better than another and what could be done to further improve the summarization system.}, keywords = {Key phrase extraction, Web retrieval, Web site study}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-70350686085\&partnerID=40\&md5=1e62cb16df24be6167a1dbde14d4281c}, author = {Zhang, Y. and Milios, E. and Zincir-Heywood, N.} } @article {77, title = {Contextualizing multimedia semantics towards personalised eLearning}, journal = {Journal of Digital Information Management}, volume = {5}, year = {2007}, note = {Export Date: 10 July 2014}, month = {2007}, pages = {62 - 67}, abstract = {Recent developments of the Internet and the World Wide Web (WWW) have resulted in the proliferation of multi-media, resources and learning with existing multimedia web resources on the Web is becoming more prevalent and important. While recent standardization efforts in eLearning such as LOM, SCORM, and IMS Learning Design work towards learning content description, packaging, and delivery; existing eLearning solutions still lack the ability to adequately use multi-media resources to provide a learner with personalised learning resources. Effective use of multimedia for web-based learning provides quality interactive learning experience, but current techniques does not adequately provide a semantic approach for organising multimedia resources. With evolving trend in learning through the use of web technology, eLearning systems are expected to provide personalised learning resources for effective learning. We have accordingly proposed a way of organising existing multimedia resources based on contexts towards providing a truly personalised eLearning experience. This paper presents a framework for achieving context-based multimedia semantic annotation and organisation towards personalised learning.}, keywords = {Multimedia technology, Web based learning, WWW}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-44849139810\&partnerID=40\&md5=bef7d9f2dbe792bb21840530e2dbb14d}, author = {Eze, E. and Ishaya, T. and Wood, D.M.} } @article {70, title = {Digitized information management: The dynamic information system}, journal = {Journal of Digital Information Management}, volume = {5}, year = {2007}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2007}, pages = {25 - 31}, abstract = {This research focuses on the change process that led to a digitized information system in academia. The development was carried out in a project where the participants represented their universities. The biggest issue to manage was to define the electronic process that was to be coded to support student mobility between universities. Action research was chosen as the research method because of the strong involvement of the researcher in the case. The output was evaluated satisfied, even excellent by the users and the goal was achieved despite minor knowledge about designing information systems in the project group.}, keywords = {Change process, Digitizing, Interorganizational information system, User participation}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-33947319335\&partnerID=40\&md5=67ed12cc8841e6bf7302e93b3265de4a}, author = {Halonen, R.} } @article {78, title = {Domain knowledge based queries for multimedia data retrieval}, journal = {Journal of Digital Information Management}, volume = {5}, year = {2007}, note = {Export Date: 10 July 2014}, month = {2007}, pages = {75 - 81}, abstract = {This paper describes an approach for semantic description and retrieval of multimedia data described by means of MPEG-7. This standard uses XML schema to define the descriptions. Therefore, it lacks ability to represent the data semantics in a formal and concise way and it does not allow integration and use of domain specific knowledge. Moreover, inference mechanisms are not provided and hence the extraction of implicit information is not (always) possible. To address these issues, we propose to add a conceptual layer on top of MPEG-7 metadata layer, where the domain knowledge is represented using a formal language. A set of mapping rules is proposed. They serve as a bridge between the two layers. Querying MPEG-7 descriptions using XML query languages such as XPath or XQuery requires to know MPEG-7 syntax and documents structure. To provide a flexible query formulation, we exploit the conceptual layer vocabulary to express user queries. A user query, making reference to terms specified at the conceptual level, is rewritten into an XQuery expression over MPEG-7 descriptions.}, keywords = {Logic languages, Mapping rules, MEPG-7, Multimedia data descriptions, Ontology, Semantic and structural aspects}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-44849105152\&partnerID=40\&md5=6bf0f55f03c657a4b5b8e32948cc69de}, author = {Hammiche, S. and Lopez, B. and Benbernou, S. and Hacid, M.-S. and Vakali, A.} } @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 {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 {103, title = {The Infocious Web search engine: Improving Web searching through linguistic analysis}, journal = {Journal of Digital Information Management}, volume = {5}, year = {2007}, note = {Export Date: 10 July 2014}, month = {2007}, pages = {277 - 291}, abstract = {In this paper we present the Infocious Web search engine [23], which currently indexes more than 2 billion pages collected from the Web. The main goal of Infocious is to enhance the way that people find relevant information on the Web by resolving ambiguities present in natural language text. Towards this goal, Infocious performs linguistic analysis to the content of the Web pages prior to indexing and exploits the output of this analysis when ranking and presenting the results to the users. Our hope is that this additional step of linguistic processing provides Infocious with two main advantages. First, Infocious tries to gain a deeper understanding of the content of Web pages and to match the users{\textquoteright} queries with the indexed documents better, improving the relevancy of the returned results. Second, based on its linguistic processing, Infocious tries to organize and present the results to the users in a structured and more intuitive way. In this paper we present the linguistic processing technologies that we investigated and/or incorporated into the Infocious search engine, and we discuss the main challenges in applying these technologies to Web documents. We also present the various components in the architecture of Infocious, and how each one of these components benefits from the added linguistic processing. Finally, we present preliminary results from our experimental study that evaluates the effectiveness of the described linguistic analysis.}, keywords = {Infocious search engine, Linguistic processing, Web pages, Web search engines}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-70350638936\&partnerID=40\&md5=51ba97210c13f5678967a5c10ff4a58a}, author = {Ntoulas, A. and Chao, G. and Cho, J.} } @article {104, title = {Information vs. Robustness in rank aggregation: Models, algorithms and a statistical framework for evaluation}, journal = {Journal of Digital Information Management}, volume = {5}, year = {2007}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2007}, pages = {292 - 308}, abstract = {The rank aggregation problem has been studied extensively in recent years with a focus on how to combine several different rankers to obtain a consensus aggregate ranker. We study the rank aggregation problem from a different perspective: how the individual input rankers impact the performance of the aggregate ranker. We develop a general statistical framework based on a model of how the individual rankers depend on the ground truth ranker. Within this framework, one can generate synthetic data sets and study the performance of different aggregation methods. The individual rankers, which are the inputs to the rank aggregation algorithm, are statistical perturbations of the ground truth ranker. With rigorous experimental evaluation, we study how noise level and the misinformation of the rankers affect the performance of the aggregate ranker. We introduce and study a novel Kendall-tau rank aggregator and a simple aggregator called PrOpt, which we compare to some other well known rank aggregation algorithms such as average, median, CombMNZ and Markov chain aggregators. Our results show that the relative performance of aggregators varies considerably depending on how the input rankers relate to the ground truth.}, keywords = {Kendall-tau rank aggregator, Rank aggregation algorithms, Rank aggregators}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-70350655572\&partnerID=40\&md5=9105bd74059b6e4c04845776bb7c00d9}, author = {Adali, S. and Hill, B. and Magdon-Ismail, M.} } @article {84, title = {Knowledge-based support for object-oriented software design and synthesis: A category theoretic approach}, journal = {Journal of Digital Information Management}, volume = {5}, year = {2007}, note = {Cited By (since 1996):2Export Date: 10 July 2014}, month = {2007}, pages = {115 - 122}, abstract = {To reuse previous knowledge of objectoriented design and adapt them to solve new problems, the collaboration relationships and the responsibility distribution among software objects need to be thoroughly understood and precisely formulated. The paper proposes a knowledge-based approach that employs category theoretic models to formalize and mechanize objectoriented software design and synthesis by focusing concern on reasoning about the interdependency relationships at different levels of abstraction and granularity. The major benefit of our approach is twofold: First, it provides an explicit semantics for formal object-oriented specifications, and therefore enables a high-level of reusability and dynamic adaptability. Second, it utilizes the ability of categorical computations to support automated software composition and refinement. A prototype tool that demonstrates the feasibility and effectiveness of our approach is also presented.}, keywords = {Automated software, Object oriented design, Software metrics, Software quality}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-70350673897\&partnerID=40\&md5=de1990a30fe9efe685a0df6e39e37b82}, author = {Zheng, Y. and Xue, J. and Hu, Q.} } @article {109, title = {A layered MIMO OFDM system with channel equalization}, journal = {Journal of Digital Information Management}, volume = {5}, year = {2007}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2007}, pages = {361 - 363}, abstract = {This paper proposes a simple and efficient method for layered MIMO-OFDM system with channel equalization. Temporal variations in the channel are due to Doppler spread, a sign of relative motion between transmitter and receiver. Results are simulated in both Rayleigh channel and additive white Gaussian noise (AWGN) channel. Decision feedback equalizer (DFE) with recursive least square (RLS) algonthm is used for channel equalization. Different type of Layered structure is applied to MIMO-OFDM system and their performance is evaluated. Different modulations schemes are used with same number of transmit and receive antennas. Simulation results are shown for both vertical and horizontal coded layered structure MIMO-OFDM systems with different modulation schemes and different number of transmit antennas.}, keywords = {Graphsdecomposition algorithm, VDM, Vienna development method}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-49149122041\&partnerID=40\&md5=36ef5a9a09db5af4163b13d382aab433}, author = {Noori, K. and Haider, S.A.} } @article {81, title = {Linguistic decision analysis based technology project assessment}, journal = {Journal of Digital Information Management}, volume = {5}, year = {2007}, note = {Export Date: 10 July 2014}, month = {2007}, pages = {142 - 151}, abstract = {The problem considered in this paper is that of selecting, from a set of proposals or a subset of projects to be undertaken. Technology project assessment is influenced by a large number of factors, and many times it is hard to measure them in numbers or an objectively way. This paper addresses this by presenting a method for identifying and assessing key project characteristics, which are crucial for a technology project{\textquoteright}s assessment. Fistly, this paper builds a new set of indicators of technology project assessment after analysing the process of it. Secondly, this paper introduces two aggregation operators in the technology project to deal with two situations of technology project assessment respectively, including linguistic and subjective information and pair comparison of preference relation. The methods consist of a number of well-defined steps, which are described in detail. Finally, examples show that the proposed methods with the linguistic decision analysis are useful and provide an understanding way for the decision maker.}, keywords = {Aggregation operator, Linguistic decision analysis, Project assessment, Technology project management}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-70350651772\&partnerID=40\&md5=e8ae7484b3a035c6754606f8fb3b691b}, author = {Pang, X.-L. and Feng, Y.-Q. and Wei-Jiang} } @article {108, title = {A method of reduction of the microinstructions of synchronous digital systems}, journal = {Journal of Digital Information Management}, volume = {5}, year = {2007}, note = {Export Date: 10 July 2014}, month = {2007}, pages = {368 - 371}, abstract = {In this paper, the author presents a method to synthesize the Algorithm State Machines (ASM) for synchronous digital systems using Combined Addressing. In This proposed method, the microinstructions are divided into subsets, and thus the Numbers of microinstructions are apparently minimized and the throughput time of the automation is reduced.}, keywords = {Combined addressing, Digital systems, Microinstruction (MI), Synchronized systems, Throughput}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-49149085311\&partnerID=40\&md5=a0a2d18223b85486d770b84463bf0d39}, author = {Al-Dahleh, M.Z. and Shehabat, I.M.} } @article {107, title = {A multilingual query processing system using software agents}, journal = {Journal of Digital Information Management}, volume = {5}, year = {2007}, note = {Export Date: 10 July 2014}, month = {2007}, pages = {385 - 390}, abstract = {The goal of this work was developing a query processing system using software agents. Open Agent Architecture framework is used for system development. The system supports queries in both Hindi and Malayalam; two prominent regional languages of India. Natural language processing techniques are used for meaning extraction from the plain quety and information from database is given back to the user in his native language. The system architecture is designed in a structured way that it can be adapted to other regional languages of India. This system can be effectively used in application areas like e-governance, agriculture, rural health, education, nabonal resource planning, disaster management, information kiosks etc where people from all walks of life are involved.}, keywords = {Database design, Interfaces, Query processing, Software agents}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-49149103443\&partnerID=40\&md5=a0ff33f2cca96dffadef4c9797934125}, author = {Idicula, S.M. and David Peter, S.} } @article {76, title = {Multimedia knowledge representation for automatic annotation of broadcast TV archives}, journal = {Journal of Digital Information Management}, volume = {5}, year = {2007}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2007}, pages = {67 - 74}, abstract = {Multimedia content classification and retrieval are indispensable tools in the current convergence of audiovisual entertainment and information media. Thanks to the development of broadband networks, every consumer will have digital video programmes available on-line as well as through the traditional distribution channels. In this scenario, since the early {\textquoteright}90s, the most important TV broadcasters in Europe have started projects whose aim was to achieve preservation, restoration and automatic documentation of their audiovisual archives, In particular, the association of low-level multimedia features to knowledge and semantics for the purpose of automatic classification of multimedia archives is currently the target of many researchers in both academic and IT industrial communities, This paper describes our research direction, which is focusing on three points: (a) We first introduce a new taxonomy for classification of broadcast digital archives based on a novel theoretical approach. The advantage of this taxonomy is that it can provide an unambiguous representation of multi-media informative content from the relevant points of view to the broadcasters community. (b) We secondly present a multilayer multimedia database model to represent both structure and content of multimedia objects. (c) We further propose a framework architecture for building a Multimedia Fuzzy Annotation System (MFAS), and a description of our experimental plan.}, keywords = {Knowledge-based multimedia systems, Semantic multimedia retrieval and annotation, Video taxonomy}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-44849139506\&partnerID=40\&md5=6a4a1931e5c3690d56a97c2e4a0c9f48}, author = {Montagnuolo, M. and Messina, A.} } @article {110, title = {Multi-objective mapping for NoC architectures}, journal = {Journal of Digital Information Management}, volume = {5}, year = {2007}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2007}, pages = {378 - 384}, abstract = {In order to improve the performance of current embedded systems, Network -on-Chip (NoC) offers many advantages, especially in terms of flexibility and low cost. Applications require more and more intensive computations, especially multimedia applications such as video encoding. Developing product and application using such an architecture offers many challenges and opportunities. Many tools will be required to develop a NoC architecture for a specific application. A toot which can map and schedule an application or a set of applications to a given NoC architecture will be essential and must be able to satisfy many relative trade-offs (real-time, performance, low power consumption, time to market, re-usability, cost, area, etc). In this paper, we survey most approaches used to solve this problem with different goals. We then describe our approach based on a genetic algorithm and its implementation and its design objective.}, keywords = {Genetic algorithms, Mapping objective, MPSoC, Network-on-chip, Optimization}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-49149093560\&partnerID=40\&md5=0f2dbcdf8982dc893dbcaccefdebbc45}, author = {Benyamina, A. El H. and Boulet, P.} } @article {87, title = {Multi-source remote sensing classification based on Mallat fusion and residual error feature selection}, journal = {Journal of Digital Information Management}, volume = {5}, year = {2007}, note = {Export Date: 10 July 2014}, month = {2007}, pages = {130 - 137}, abstract = {Classification of multi-source remote sensing images has been studied for decades, and many methods have been proposed or improved. Most of these studies focus on how to improve the classifiers in order to obtain higher classification accuracy. However, as we know, even if the most promising method such as neural network, its performance not only depends on the classifier itself, but also has relation with the training pattern (i.e. features). On consideration of this aspect, we propose an approach to feature selection and classification of multi-source remote sensing images based on Mallat fusion and residual error in this paper. Firstly, the fusion of multi-source images can provide a fused image which is more preferable for classification. And then a featureselection scheme approach based on fused image is proposed, which is to select effective subsets of features as inputs of a classifier by taking into account the residual error associated with each land-cover class. In addition, a classification technique base on selected features by using a feed-forward neural network is investigated. The results of computer experiments carried out on a multisource data set confirm the validity of the proposed approach.}, keywords = {Feature selection, Mallet fusion, Multi-source classification, Neural network, Residual error}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-70350668378\&partnerID=40\&md5=8e01a98aa0645ce6934545475591db77}, author = {Cao, D. and Yin, Q. and Guo, P.} } @article {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 {71, title = {Palette-based image segmentation using HSL space}, journal = {Journal of Digital Information Management}, volume = {5}, year = {2007}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2007}, pages = {8 - 11}, abstract = {This paper describes a palette-based colored image segmentation system. In this paper we analyzed the properties of Hue, Saturation, and Luminance (HSL) color space with emphasis on the visual perception of the variation in Hue, Saturation and Luminance values of palette colors. The proposed algorithm based on the concept of re-coloring the palette colors of 256-color images using the properties of HSL color space and segmenting true type images by taking part of the image, generating a palette to it then apply the method to segment the selected region. After re-coloring of the palette colors the colors in the image will be re-colored according to its new palette, and as a result the image will be segmented to different segments.}, keywords = {HSL space, Image segmentation}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-33947359481\&partnerID=40\&md5=5f2dbcc5beba47749ba2c598939ab1d4}, author = {Krikor, L.Z. and Baba, S.E.I. and Krikor, M.Z.} } @article {105, title = {Performance of integrated wired (Token ring) network and wireless (PRMA) network}, journal = {Journal of Digital Information Management}, volume = {5}, year = {2007}, note = {Export Date: 10 July 2014}, month = {2007}, pages = {372 - 377}, abstract = {Computer networks can be built using either wired or wireless technology. Although wired network has been the traditional choice, wireless technologies are becoming more popular. One of the most challenges is to have an existing wired network to which a wireless network extension could be added. Specifically the challenge is to connect a group of wireless networks through a wired backbone. The primary purpose of this study is to develop an integrated mathematical model by integrating Packet Reservation Multiple Access (PRMA) one of the most wireless LAN protocols and Token Ring wired network protocol. Performance parameters of an integrated PRMA-Token Ring model such as delay and throughput have be analyzed. The numerical analysis presented in this paper may help in studying the affect of some parameters on the system performance and stability.}, keywords = {Hybrid network, Network, Performance, PRMA, Token ring, Wireless, Words}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-49149110443\&partnerID=40\&md5=461f26224ae3a230d93b0fcefcafdf1d}, author = {Al-Amawi, A. and Khanfar, K.} } @article {101, title = {Personalized searching by learning wordnet-based user profiles}, journal = {Journal of Digital Information Management}, volume = {5}, year = {2007}, note = {Cited By (since 1996):2Export Date: 10 July 2014}, month = {2007}, pages = {309 - 322}, abstract = {The amount of information available on the Web and in Digital Libraries is increasing over time. In this context, the role of user modeling and personalized information access is becoming crucial: Users need a personalized support in sifting through large amounts of retrieved information according to their interests. Information filtering and retrieval systems relying on this idea adapt their behavior to individual users by learning their preferences during the interaction in order to construct a profile of the user that can be later exploited in the search process. We propose a novel technique to learn user profiles which exploits word sense disambiguation based on the WordNet lexical database, in an attempt to produce semantic user profiles that might discover topics semantically closer to the user interests. Semantic profiles are used in the definition of a retrieval model that turns the traditional document-query search paradigm into a novel document-query-profile paradigm. As an example of this paradigm, we present an extension of the vector space model in which profiles are used to modify the ranking of search results obtained in response to a query, hopefully putting personally relevant items on the top of the result list. Experimental results in a movie retrieval scenario indicate that the proposed model to personalize Web search is effective.}, keywords = {Machine learning, Personalization and information filtering, User modeling, WordNet}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-66149191527\&partnerID=40\&md5=750d800edd5f7fe76d849dd465dafff9}, author = {Semeraro, G.} } @article {102, title = {Pre-processing and Path Normalization of a web graph used as a social network}, journal = {Journal of Digital Information Management}, volume = {5}, year = {2007}, note = {Cited By (since 1996):2Export Date: 10 July 2014}, month = {2007}, pages = {262 - 276}, abstract = {Many efforts have been made for compression of web graphs. Most of these methods are suitable for search engines and are centered around encoding links and URLs efficiently. The purpose is to handle a large set of web pages in the main memory against any web based search. The authors of the present paper are interested in studying web graph as a social network and to develop a data model for it. So, suitable compression techniques, which are space efficient for disk based storage, are required. This paper has provided a two level compression technique. In the first level, the structural properties of a graph are studied and strongly connected components are fused to reduce the original graph to a DAG. Paths on this DAG are then stored efficiently using a Path Normalization technique. Space complexity expressions indicate the efficiency of the method. Relevant operators required for accessing the original graph through the compressed representations have also been discussed. Important earlier works have been referred to indicate the requirements of the present approach.}, keywords = {Compression technique, Path normailisation technique, Social software, Web search}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-57949092373\&partnerID=40\&md5=08a3428b63ad14c630820944a0e9c222}, author = {Teja, C.B. and Mitra, S. and Bagchi, A. and Bandyopadhyay, A.K.} } @article {95, title = {Promotion of local to global operation in train control system}, journal = {Journal of Digital Information Management}, volume = {5}, year = {2007}, note = {Cited By (since 1996):15Export Date: 10 July 2014}, month = {2007}, pages = {231 - 236}, abstract = {Railway interlocking system is a safety critical system. Its failure can cause the loss of human life, severe injuries and loss of money. Therefore the complication of this type of system requires advanced methodologies, which provide complete security and quality of a system. One way of achieving this goal is by using formal methods, which are mathematically based languages, techniques and tools used for specifying and verifying such systems. This paper provides the control of trains in a sector of moving block interlocking system using the approach of promotion. The promotion is the approach used to link the local state with a global state in Z specifications. The control comprises three components, i.e. sector, trains and security of a train in a sector.}, keywords = {Formal specification, Predicate logic, Schema calculus, Z notation}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-44949158690\&partnerID=40\&md5=9dfd5e28516c12ab2f9a5cfc8da8d3f9}, author = {Khan, S.A. and Zafar, N.A.} } @article {91, title = {Querying unstructured and structured peer-to-peer networks: Models, issues, algorithms}, journal = {Journal of Digital Information Management}, volume = {5}, year = {2007}, note = {Export Date: 10 July 2014}, month = {2007}, pages = {201 - 210}, abstract = {Peer-to-Peer (P2P) networks are defined as a collection of peers that expose client/server functionalities simultaneously. P2P systems, built on top of P2P networks, support information sharing primitives and lookup mechanisms of data objects located on peers. It has been demonstrated that the P2P paradigm is able to efficiently capture models and, above all, dynamics of modem applications, beyond limitations of conventional produce/consumer paradigms. Traditionally, P2P primitives and mechanisms have been implemented by means of keyword-based search and matching operations. Modern P2P systems require more complex query functionalities, beyond capabilities of DBMS-inspired models and algorithms. As a consequence, the issue of efficiently querying the underling P2P network is gaining momentum in the research community. Indeed, querying P2P networks, which can be in the unstructured and structure modes, plays a critical role in next-generation P2P systems, as its performance heavily affect the efficiency of the overall system. Starting from these considerations, in this paper we propose a survey on models, issues and algorithms for querying unstructured and structured P2P systems. We also put in evidence similarities and differences of state-of-the-art proposals appearing in literature, with critical discussion, and we provide a rigorous taxonomy of P2P query strategies. Finally, we complete our analytical contribution via hihlighting future directions in this research field.}, keywords = {Issues and algorithms for P2P networks, Query models, Querying P2P networks, Routing P2P networks, Taxonomies of P2P query strategies}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-44949141961\&partnerID=40\&md5=6ec618e515388beb0fc88c49914b8058}, author = {Cuzzocrea, A.} } @article {111, title = {A real time S-box construction using arithmetic modulo prime numbers}, journal = {Journal of Digital Information Management}, volume = {5}, year = {2007}, note = {Cited By (since 1996):3Export Date: 10 July 2014}, month = {2007}, pages = {354 - 360}, abstract = {This paper proposes an implementation of the inverse function of the Advanced Encryption Standard using the field of prime numbers instead of the Galois Field originally proposed by Rijndael. The paper will show that the former approach is simpler and requires less execution time and implementation circuitry compared to the latter. The authors analyzed several implementations of the inverse function for the S-Box using various approaches in search for an optimal one. In particular, simulation was used to analyze performances of algorithms for computing the inverse function based on: the arithmetic modulo a power-of-two; arithmetic modulo a power-of-two plus one; and arithmetic modulo a prime number. The simulation revealed that the modulo a prime number approach has the best performance. Furthermore, the analysis revealed that using this approach may enhance security relative to the original approach. The proposed implementation will provide a better alternative that can be embedded in many systems.}, keywords = {Diffusion, Hardware implementation, Modulo prime arithmetic, Parallel execution, Pipelining, VHDL}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-49149096383\&partnerID=40\&md5=a1fe3d6b0e1b163d7545da8586d0fc0f}, author = {Abuelyman, E.S. and El-Affendi, M.A.} } @article {68, title = {A review of quality of service (QoS) route provisioning in mobile ad hoc networks}, journal = {Journal of Digital Information Management}, volume = {5}, year = {2007}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2007}, pages = {32 - 47}, abstract = {With the increase of portable devices as well as rapid advancement in computing and wireless technologies, mobile ad hoc networking is gaining importance with the increasing number of widespread applications. Quality of service (QoS) routing plays a prominent role for providing QoS in mobile wireless ad hoc networks. Real time and multimedia applications need stringent QoS requirements. Providing a complete quality-of-service (QoS) solution for the ad hoc networking environment requires the interaction and co-operation of several components which include a QoS routing protocol, a resource reservation mechanism and a QoS capable medium access control (MAC) layer. The tasks of QoS routing are in general selecting routes with satisfied QoS requirement(s), and achieving global efficiency in terms of resource utilization. QoS is more difficult to guarantee in mobile ad hoc networks than in other type of networks due to the sharing of wireless bandwidth among adjacent nodes, its dynamic topology and generally imprecise network state information. This work is intended to provide a broad and comprehensive review of the QoS routing protocols proposed for ad hoc networks. This paper also describes important QoS frameworks for MANETs which attempt to provide required/promised services to each user or application.}, keywords = {Code division multiple access (CDMA), MAC, Mobile ad hoc networks (MANETs), Multi-path routing, QoS framework, QoS routing, Quality-of-service (QoS), Time division multiple access (TDMA)}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-33947328537\&partnerID=40\&md5=32892d1835b3d07244ec98fa129cdf02}, author = {Kumar, R. and Misra, M. and Sarje, A.K.} } @article {88, title = {Robust adaptive beamforming with SSMUSIC performance optimization in the presence of steering vector errors}, journal = {Journal of Digital Information Management}, volume = {5}, year = {2007}, note = {Export Date: 10 July 2014}, month = {2007}, pages = {107 - 114}, abstract = {A novel subspace projection approach was proposed to improve the robustness of adaptive beamforming and direction finding algorithms. The cost function of the signal subspace scaled multiple signal classification (SSMUSIC) is minimized in the uncertainty set of the signal steering vector, the optimal solution to the optimization problem is that the assumed steering vector can be modified as the weighed sum of the vectors orthogonally projected onto the signal subspace and the noise subspace. Using the estimated steering vector with small error to the true steering vector, the spectral peaks in the actual signal directions are guaranteed. Consequently, the problem of signal self-canceling encountered by adaptive beamforming due to steering vector mismatches is eliminated. Simulation and lake trial results show that the proposed method not only possesses high resolution performance, but also is robust to a few steering vector errors. Furthermore, the modified MUSIC algorithm outperforms the conventional MUSIC and SSMUSIC methods excellently.}, keywords = {Diagonal loading, Direction of arrival, Robust adaptive beamforning, Steering vector error, Subspace projection matrix}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-70350695756\&partnerID=40\&md5=2214a4d0fbafc0be565751c0b0993b3d}, author = {Jiang, B. and Cheng, Q. and Ling, G.} } @article {69, title = {A robust outlier detection scheme for collaborative 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 = {12 - 18}, abstract = {In-networks, Data Aggregation is usually warranted for distributed wireless sensor networks, owing to reliability and energy efficiency reasons. Sensor nodes are usually deployed in unattended and unsafe environments and hence are vulnerable to intentional or unintentional damages. Individual nodes are prone to different type of faults such as hardware faults, crash faults etc and other security vulnerabilities wherein one or more nodes are compromised to produce bogus data so as to confuse the rest of the network in collaborative sensing applications. The availability of constrained resources and the presence of faulty nodes make designing fault tolerant information aggregation mechanisms in large sensor networks particularly challenging. In our work, we consider Byzantine type of faults, which encompasses most of the common sensor node faults [9]. Faulty nodes are assumed to send inconsistent and arbitrary values to other nodes during information exchange process. These values are termed as outliers and we use a statistical test called Modified Z-score method to reliably detect and remove outliers. We show by simulation that the proposed strategy works well for 2 major classes of collaborative sensor network applications viz. (i) Target/Event detection and (ii) Continuous data gathering.}, keywords = {Data aggregation, Detection accuracy, Distributed information processing, False positives, Fault tolerance, Outliers}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-33947305265\&partnerID=40\&md5=2fae284d218d7852052fabf8a0ef68ca}, author = {Jayashree, L.S. and Arumugam, S. and Vijayalakshmi, K.} } @article {92, title = {Robust self embedding watermarking technique in the DWT domain for digital colored images}, journal = {Journal of Digital Information Management}, volume = {5}, year = {2007}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2007}, pages = {211 - 219}, abstract = {In this work, a robust watermarking algorithm is proposed for colored digital images. The 24 bits/pixel RGB images are converted to YCbCr color format, and the Y part is converted to Discrete Wavelet Transform (DWT). The resulted LL part is resized to the original size of the host image and its blocks are scrambled using certain key. The watermark is another copy of the LL part and its pixels are, also, scrambled and each pixel is embedded in one of the scrambled blocks of the LL part. The algorithm takes into account the Human Visual System via relating the embedding process to the intensity of each block of the host image. We have used the average PSNR as a quality measure for the embedding stage. In all our experiments we got more than 68 dB which satisfies the PSNR bench mark. Also we got an average value of 0.15 for MAE, which is the robustness measure. This means that our algorithm is very robust and the watermark is still recognizable.}, keywords = {Copyright, Digital images, Embedding, Robustness, Scrambling, Watermaking}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-44949187327\&partnerID=40\&md5=d8e2ad97422a0852424c209b57cc93ff}, author = {Al-Tahan Al-Nu{\textquoteright}aimi, A. and Qahwaji, R.} } @article {85, title = {Rotation-based three dimensional shape descriptor}, journal = {Journal of Digital Information Management}, volume = {5}, year = {2007}, note = {Export Date: 10 July 2014}, month = {2007}, pages = {138 - 141}, abstract = {Recent developments in techniques for modeling, digitizing and visualizing three dimensional shapes have led to an explosion in the number of available three dimensional models on the Internet and in many domain-specific databases. However, how to describe three dimensional shapes is a difficult problem. A new three dimensional shape description method based on rotation is proposed in this paper. The first step is to sample points on the surface and compute normal vectors. Secondly, we do Gauss mapping and rotate model, at the same time, rotate the Gauss sphere. The third step is to analysis normal distributions on the sphere surface. Then the Euclidean distance is computed, and finally a statistic histogram is constructed. Experimental results show the effectiveness of this method.}, keywords = {3 d space descriptors, Gauss mapping, Three dimensional shapes}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-70350689502\&partnerID=40\&md5=11b5b46b07b7146eba309aa78ff8f501}, author = {Luo, H. and Chu, S.-C. and Pan, J.-S. and Lu, Z.-M.} } @article {67, title = {Sensitivity analysis of server placement on enterprise network topology through soft computing}, journal = {Journal of Digital Information Management}, volume = {5}, year = {2007}, note = {Export Date: 10 July 2014}, month = {2007}, pages = {1 - 7}, abstract = {We analyze the consequences when both the server placement problem and network topology problem are solved concurrently through soft computing. Both problems are formulated as a combined optimization problem, subject to a set of design and performance constraints while minimizing the enterprise network cost. We have coded the combined optimization problem within a soft computing methodology, which is based on a probabilistic genetic program for automatically searching the design space for good network topologies. The experimental results for synthesizing and optimizing 3-level enterprise network (65 user nodes) for an edge-server placement has demonstrated the effectiveness of our methodology in finding good solutions with a static workload in less than five minutes.}, keywords = {Analysis, Clustering, Edge-server placement, Network topology, Optimization, Soft computing, Web structure analysis}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-33947320448\&partnerID=40\&md5=62ced3281abb66c04e4ac8f00c808c7b}, author = {Safar, M. and Habib, 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 {94, title = {Special issue on "Advances in querying non-conventional date sources"}, journal = {Journal of Digital Information Management}, volume = {5}, year = {2007}, note = {Export Date: 10 July 2014}, month = {2007}, pages = {178 - 179}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-44949092229\&partnerID=40\&md5=28170025218311b3a1d87a2ec56ac3ab}, author = {Cuzzocrea, A.} } @article {99, title = {Special issue on " web information retrieval" guest editorial}, journal = {Journal of Digital Information Management}, volume = {5}, year = {2007}, note = {Export Date: 10 July 2014}, month = {2007}, pages = {247 - 248}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-70350680438\&partnerID=40\&md5=855a794997ff155476fad28109d1f3a2}, author = {Ounis, I. and Van Rijsbergen, K. and Pichappan, P.} } @article {83, title = {Stack-based pattern matching algorithm for XML query processing}, journal = {Journal of Digital Information Management}, volume = {5}, year = {2007}, note = {Cited By (since 1996):4Export Date: 10 July 2014}, month = {2007}, pages = {167 - 174}, abstract = {With the popularity of XML as data exchange over the Web, querying XML data has become an important issue to be addressed. Since the logical structure of XML is a tree, establishing a parent-child (P-C), ancestor-descendant (A-D) or sibling relationship between nodes is essential for structural query processing. Thus, we propose using a < self-level: parent> labeling scheme to encode each element in the XML database by its positional information. Based on this labeling scheme, we further propose our TwigINLAB algorithm to optimize the query processing. Experimental results indicate that TwigINLAB can process both path queries and twig queries better than the TwigStack algorithm on an average of 27\% and 14\% respectively in terms of execution time using the XMARK benchmark dataset.}, keywords = {Labeling, Pattern matching, Query processing, Structural query, Twig query, XML}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-63149191050\&partnerID=40\&md5=a28a66080f0d1b4d84de686811194d9f}, author = {Haw, S.-C. and Lee, C.-S.} } @article {89, title = {Storage and indexing of relational OLAP views with mixed categorical and continuous dimensions}, journal = {Journal of Digital Information Management}, volume = {5}, year = {2007}, note = {Export Date: 10 July 2014}, month = {2007}, pages = {180 - 190}, abstract = {Due to the widespread adoption of location-based services and other spatial applications, data warehouses that store spatial information are becoming increasingly prevalent. Consequently, it is becoming important to extend the standard OLAP paradigm with features that support spatial analysis and aggregation. While traditional OLAP systems are limited to data characterized by strictly categorical feature dimensions, Spatial OLAP systems must provide support for both categorical and spatial feature dimensions. Such spatial feature dimensions are typically represented by continuous data values. In this paper we propose a technique for representing and indexing relational OLAP views with mixed categorical and continuous data. Our method builds on top of an established mechanism for standard OLAP and exploits characteristic properties of space-filling curves. It allows us to effectively represent and index mixed categorical and continuous data, while dynamically adapting to changes in dimension cardinality during updates. We have implemented the proposed storage and indexing methods and evaluated their build, update, and query times using both synthetic and real datasets. Our experiments show that the proposed methods based on Hilbert curves of dynamic resolutions offers significant performance advantages especially for view updates.}, keywords = {Continuous space, Space-filling curves, Spatial OLAP, View indexing}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-44949248100\&partnerID=40\&md5=a63605fb283d6f4f67f8f3aaa7a854be}, author = {Baltzer, O. and Rau-Chaplin, A. and Zeh, N.} } @article {96, title = {Unsupervised learning aided by clustering and local-global hierarchical analysis in knowledge exploration}, journal = {Journal of Digital Information Management}, volume = {5}, year = {2007}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2007}, pages = {237 - 246}, abstract = {Unsupervised learning plays an important role in the Knowlede exploration discovery. The basic task of unsupervised learning is to find latent variablesor relationships in a given dataset wihout any assumed regularities or patterns. In this paper we apply two advanced models, clustering analysis and hierarchial analysis to accomplish unsupervised learning. K-Means clustering presents its strength in large scale clustering. The original data can be pre-processed and the potential variables are targeted. Correlations among these variables are explored in the subsequent sets by Local Global Hierarchial Analysis (LGHA) assisted by three main steps. In the first step, we use a structural approach to find qualititative patterns from the given variables. Then, the second step applies a quantitative based algorithm to find quantitative patterns from those variables. The and last step generated global hybrid patterns by combining the local patterns obtained from the first two steps based on a certain criterion. Both of the K-Means and Local Global Hierarchial Analysis (LGHA) models are applied in experiments with real world longitutional medical datasets.}, keywords = {Hierarchical analysis, K-means clustering, Knowledge exploration, Unsupervised learning}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-44949188275\&partnerID=40\&md5=2448112a6f72451c391f1e75cc38eeed}, author = {Zhang, Y. and Orgun, M.A. and Lin, W.} } @article {106, title = {VDM specification of an algorithm for graph decomposition}, journal = {Journal of Digital Information Management}, volume = {5}, year = {2007}, note = {Export Date: 10 July 2014}, month = {2007}, pages = {347 - 353}, abstract = {Complex software systems need a precise specification of their intended behaviour. While graph theory plays an important role in several aspects of building such software systems, formal methods provide a rigorous mathematical framework within which a system can be described. In this paper, an algorithm for decomposing a graph into disjoint paths is presented. Such decompositions are useful, particularly in implementing software testing. VDM representation of the proposed algorithm facilitates automation of testing process without any ambiguity.}, keywords = {Graphs decomposition algorithm, VDM, Vienna development method}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-49149094335\&partnerID=40\&md5=1cb50e54c6cd978239ea452ebecd006a}, author = {Huq, A. and Ramachandran, N.T.} } @article {86, title = {YCSc: A modified clustering technique based on LCS}, journal = {Journal of Digital Information Management}, volume = {5}, year = {2007}, note = {Cited By (since 1996):2Export Date: 10 July 2014}, month = {2007}, pages = {160 - 166}, abstract = {This paper presents a novel approach to clustering using a simple accuracy-based Learning Classifier System with a modification to the original YCS fitness function has been found to improve the identification of less-separated data sets. Our approach achieves this by exploiting the evolutionary computing and reinforcement learning techniques inherent to such systems. The purpose of the work is to develop an approach to learning rules which accurately describe clusters without prior assumptions as to their number within a given dataset. Favourable comparisons to the commonly used k-means algorithm are demonstrated on a number of datasets.}, keywords = {Evolutionary algorithms, K-means algorithm, Learning classifier systems}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-70350651771\&partnerID=40\&md5=edb219bf61f63b4fe832f9edf8cde638}, author = {Tamee, K. and Bull, L. and Pinngern, O.} } @article {41, title = {Ad hoc location service for mobile agents}, journal = {Journal of Digital Information Management}, volume = {4}, year = {2006}, note = {Export Date: 10 July 2014}, month = {2006}, pages = {131 - 135}, abstract = {In this paper, we study two implementations of a mobile agent location service in the context of an underlying ad hoc network. More precisely, this service aims at solving the-problem of routing an agent toward a target agent in order to cooperate on a common host. Both the migration number and the tracking time most be minimized by such a service, We compare two implementations based on rumor propagation using either a piggybacking approach or a gossipy agent-based approach. The comparison of the two solutions is based upon simulation results. Performance analysis demonstrates that the piggybacking approach minimizes the response time and the gossipy agent-based approach minimizes the network overhead.}, keywords = {Ad hoc location service, Gossipy agent-based approach, Message routing, Mobile agents, Piggybacking approach}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-44649105784\&partnerID=40\&md5=6a967e33c70a9aac0e38aa107fe2fb47}, author = {Lokpo, I. and Bi, T.G. and Cubat dit Cros, C. and Padiou, G.} } @article {34, title = {Applying AOP concepts to increase web services flexibility}, journal = {Journal of Digital Information Management}, volume = {4}, year = {2006}, note = {Cited By (since 1996):11Export Date: 10 July 2014}, month = {2006}, pages = {37 - 43}, abstract = {Web Service is the fitted technical solution which provides the required loose coupling to achieve Service Oriented Architecture (SOA). In previous works, we proposed an approach, using the Aspect Oriented Programming (AOP) paradigm, to increase the adaptability of Web Services. This approach suffers from some deficiencies as dependency for both the programming language (Java) and the SOAP engine (AXIS). In this paper, we propose to increase the adaptability of Web Services by using the main AOP agreed semantics - Advices, Pointcuts and Joinpoints- to change original Web Service behavior. In the new approach, we consider that advices are themselves Web Services. Moreover, we propose to use an XML Language to describe Pointcuts, Joinpoints and for referencing advices. The invocation of advices (Web Services) is accomplished by an XQuery engine to ensure SOAP Engine independency and advices are implemented as Web Services to promote programming language independency.}, keywords = {AOP techniques, SOAP service, XML language, XML schema, XQuery}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-33748251277\&partnerID=40\&md5=b598d50cac5e77e5f660a9cc3541072a}, author = {Hmida, M.M.B. and Tomaz, R.F. and Monfort, V.} } @article {29, title = {Automatic and flexible web services discovery in semantic web}, journal = {Journal of Digital Information Management}, volume = {4}, year = {2006}, note = {Export Date: 10 July 2014}, month = {2006}, pages = {22 - 25}, abstract = {The main objective of the semantic web is to make the interoperation among web services or between users and web services more automated and flexible. The basic step toward the interoperation is that users or web services can discover their required web services. In this paper we present a practical application on Semantic Web and Web Services concepts where a flexible and automatic matching procedure in e-learning is shown. We illustrate how the requirements, web services and domain knowledge are described in machine-understandable forms to support the automatic and flexible discovery of web services. Then a matchmaking algorithm based on the semantic information is proposed. Finally the design and implementation of a prototype for the automatic discovery of web services is described.}, keywords = {Discovery, Elearning, Semantic web, Web service}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-33748262446\&partnerID=40\&md5=f576cda3c55219ff4617a04d7dcb8d8f}, author = {Lu, L. and Chen, J. and Zhu, G.} } @article {27, title = {Continuously evaluating approximate similarity search on high dimensional data stream}, journal = {Journal of Digital Information Management}, volume = {4}, year = {2006}, note = {Export Date: 10 July 2014}, month = {2006}, pages = {82 - 86}, abstract = {In many applications, including online video monitoring system, it is often necessary to find out the most similar sequence, from a sequence set in database, for the high dimensional data stream. Due to its high computation complexity and the restrictions of query processing on data stream, continuously retrieving the similar content on high dimensional data stream is very challenging. The evaluating algorithm is expected to be very fast to match data stream arrival rate. To address this problem, we propose a method called CVNN in this paper. In our method, the sequences in database are represented into the compact summaries, namely CVs, which can be stored in memory. An online algorithm is conducted to transform data stream into a small number of CVs continuously, at the same time the nearest neighbor query is processed periodically based on the similarity of CVs. Experimental results show that our method is fairly effective.}, keywords = {Data stream, High dimensional space, Query processing, Similarity Search, Video indexing}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-33748267270\&partnerID=40\&md5=da6323dddf161caf008918184cbec115}, author = {Wang, W. and Li, J. and Ai, C. and Shi, S.} } @article {23, title = {Creating dependable web services using user-transparent replica}, journal = {Journal of Digital Information Management}, volume = {4}, year = {2006}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2006}, pages = {16 - 21}, abstract = {Dependability is a major concern in software development, deployment, and operation. A commonly accepted solution for providing fault tolerant services on the Internet is to create replica of the services and to deploy them to several hosts. Whenever the service or the underlying node or network fails, another service is ready to take over. In the Venice project, several techniques are combined to create a dependable framework for deploying and managing distributed services using replica on several distinct network nodes.}, keywords = {Dependable web services, Software development, Venice framework, Web service technology, XML}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-33748249857\&partnerID=40\&md5=2f82439b41c666055dd9bd6d4a3dea11}, author = {Hillenbrand, M. and G{\"o}tze, J. and M{\"u}ller, P.} } @article {35, title = {The designing of web services to deliver web documents associated with historical links}, journal = {Journal of Digital Information Management}, volume = {4}, year = {2006}, note = {Export Date: 10 July 2014}, month = {2006}, pages = {11 - 15}, abstract = {The historical links of a web site include the URLs invalidated due to web site reorganization, document removal, renaming or relocation, or links to document snapshots, which are defined as the document{\textquoteright}s contents as of a specific point in time. Tracking historical links will allow users to use out-of-date URLs, retrieve removed documents and document snapshots. This paper presents a logging and archiving scheme to track a source document{\textquoteright}s history of changes, and designs web services to deliver the source document associated with a historical link.}, keywords = {Concept mapping, Hyper space, Information extraction, Knowledge discovery, Semantic web, Web knowledge discovery, Web navigation}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-33748275472\&partnerID=40\&md5=8f950d21d3b688c9a0c1bb1159d7a54d}, author = {Chao, D. and Gill, S.} } @article {26, title = {A dynamic priority allocation scheme of messages for differentiated web services satisfying service level agreement}, journal = {Journal of Digital Information Management}, volume = {4}, year = {2006}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2006}, pages = {26 - 31}, abstract = {Recently many enterprises are adopting web services as the standard between heterogeneous software in the XML message based distributed environment to carry out businesses from B2C to B2B. For effective application of web services, differentiated service quality must be guaranteed. However, majority of the current web services do not differentiate quality of messages and the current web servers do not reflect the quality factors of the service level agreement settled between the service provider and user. Our research analyzes the appropriate quality factor for the quality level where differentiated service is provided and suggests a method for assigning priorities to web service message processing processes based on these quality factors. The suggested method assigns the priority dynamically in order to satisfy the service level agreement as much as possible.}, keywords = {B2B, B2C, Web servers, Web service, Web service quality}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-33748284649\&partnerID=40\&md5=0ba79237064c0f9d6784d65c0224a6b4}, author = {Kim, D. and Lee, S. and Abraham, A. and Han, S.} } @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 {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 {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.} } @article {45, title = {From words to concepts in text mining}, journal = {Journal of Digital Information Management}, volume = {4}, year = {2006}, note = {Export Date: 10 July 2014}, month = {2006}, pages = {147 - 149}, abstract = {In the text mining process the interface between the natural language text and content reflecting terms is essential for the successful indexing process. The traditional interfaces such as the sauri and lexicons have limitations for web content processing. The recent lexical nets have promises; but their efficiency needs to be tested. The current work measures the use of word relations specified by lexical nets in a large test bed. The results correlate with similar recent past studies as not all specified word relations in the lexical nets are semantically rich in expressing the conceptual relations between given words. The results call for applying more heuristic approaches for text mining.}, keywords = {Concept indexing, Text mining, Text processing, Word relation}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-44649133985\&partnerID=40\&md5=46dbcc4ccd511a6a729ef7fac8d7713f}, author = {Al-Zahrani, S.} } @article {57, title = {GraphOnto: OWL-based ontology management and multimedia annotation in the DS-MIRF framework}, journal = {Journal of Digital Information Management}, volume = {4}, year = {2006}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2006}, pages = {214 - 219}, abstract = {We present here GraphOnto, a software component and an API that allow the definition and editing of both standard-based and domain OWL ontologies and their use in multimedia information system components. In our working environment an OWL Upper Ontology that captures the MPEG-7 MDS is utilized and OWL domain ontologies extend the upper ontology with domain knowledge. The ontologies imported in GraphOnto are parsed so that graphical ontology browsing and editing interfaces are automatically generated. The ontologies are used to guide the semantic multimedia annotation in a standardized manner. OWL Ontology mappings, expressed using OWL constructs, are supported and allow the definition of personalized ontologies. Personalization of the GraphOnto user interface on the application, task and user levels is provided. In addition, GraphOnto interoperates with an MPEG-7 Repository both for semantic entity reuse during multimedia content annotation and for semantic description storage. GraphOnto has been evaluated against Prot{\'e}g{\'e} and clearly outperforms it.}, keywords = {MPEG 7, Ontology, Ontology standards, Semantics}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-33845937025\&partnerID=40\&md5=b72758db21f6febb306c3712ffb375fb}, author = {Polydoros, P. and Tsinaraki, C. and Christodoulakis, S.} } @article {62, title = {How to enhance competitive advantage of digital content industries? - A case study of Taiwan}, journal = {Journal of Digital Information Management}, volume = {4}, year = {2006}, note = {Export Date: 10 July 2014}, month = {2006}, pages = {256 - 259}, abstract = {On account for the rising of XDSL construction in Taiwan recent years, hundred of thousands people have become interested in digital content. Digital content is a creative industry, accompanied with emergence of rapid changed technologies and innovative business models, the government all over the world would be devoted to promoting the competitive advantage in digital content industries. From perspective of "digital independence", online game is regarded as the most cultural and innovative among them. While designing the online games architecture researchers provide due importance to technology. However, the present paper place emphasis on human element in architecture related to online games. The Taiwan experience is used to construct the online game architecture.}, keywords = {Digital content, Online games, Taiwan digital industry}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-33845927549\&partnerID=40\&md5=1bc7801fbff9552e0e1cbbbc3589f047}, author = {Yeh, S.-W. and Shiue, Y.-C. and Horng, D.-J.} } @article {36, title = {A hybrid model to improve relevance in document retrieval}, journal = {Journal of Digital Information Management}, volume = {4}, year = {2006}, note = {Cited By (since 1996):2Export Date: 10 July 2014}, month = {2006}, pages = {73 - 81}, abstract = {In information retrieval community a lot of work is focused on increasing efficiency by capturing statistical features. The other dominant approach is to improve the relevance by capturing the semantic and contextual information which is invariably inefficient. Generally the two approaches are assumed to be diametrically opposite. In this paper we have tried to combine the two approaches by proposing a hybrid information retrieval model. The model works in two stages. The first stage is a statistical model and the second stage is based on semantics. We have first downsized the document collection for a given query using vector model and then used a conceptual graph (CG) based representation to rank the documents. Our main objective is to investigate the use of conceptual graphs as a precision tool in the second stage. The use of CGs brings semantic in the ranking process resulting in improved relevance. Three experiments have been conducted to demonstrate the feasibility and usefulness of our model. A test run is made on CACM-3204 collection. We observed 34.8\% increase in precision for a subset of CACM queries. The second experiment is performed on a test collection specifically designed to test the strength of our model in situation where the same terms are being used in different context. Improved relevance has been observed in this case also. The application of this approach on results retrieved from LYCOS shown significant improvement. The proposed model is both efficient, scalable and domain independent.}, keywords = {CG-based retrieval model, High precision information retrieval model, Intelligent retrieval, Two-stage retrieval model}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-33748252460\&partnerID=40\&md5=28fb109a6982827d4057e4947164916d}, author = {Siddiqui, T.J. and Tiwary, U.} } @article {30, title = {Hybrid storage scheme for RDF data management in Semantic Web}, journal = {Journal of Digital Information Management}, volume = {4}, year = {2006}, note = {Export Date: 10 July 2014}, month = {2006}, pages = {32 - 36}, abstract = {With the advent of the Semantic Web as the next-generation of Web technology, large volumes of Semantic Web data described in RDF will appear in the near future. Most previous approaches treat RDF data as a form of triple and store them in a large-sized relational table. Basically, since it always requires the whole table to be scanned for processing a query, it may degrade retrieval performance. In addition, it does not scale well. In this paper, we propose a hybrid storage approach for RDF data management. The proposed approach aims to provide good query performance, scalability, manageability, and flexibility. To achieve these goals, we distinguish some frequently appeared properties in RDF data. A set of RDF data with a distinguished property is independently treated and stored together in a corresponding property-based table. For processing a query having a specific property, we can avoid full scanning the whole data and only have to access a corresponding table. For queries having specific properties, the proposed scheme achieves better performance than the previous approach.}, keywords = {Data storage scheme, RDF data management, Semantic web}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-33748257249\&partnerID=40\&md5=6e21f3861ea8e8149f8df1878a0aaabc}, author = {Kim, S.W.} } @article {24, title = {HyperMap: A system to map the web}, journal = {Journal of Digital Information Management}, volume = {4}, year = {2006}, note = {Export Date: 10 July 2014}, month = {2006}, pages = {4 - 10}, abstract = {This paper presents the HyperMap system which dynamically structures information on the Web. The system is based on a framework resulting from multidisciplinary research, which is briefly discussed. This paper focuses work done to develop a new generation of computational tools able to support the extraction and the discovery of useful information on the Web, becoming agents of innovation and development.}, keywords = {Concept mapping, Hyper space, Information extraction, Knowledge discovery, Semantic web, Web knowledge discovery, Web navigation}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-33748283744\&partnerID=40\&md5=0ae6894b5de7bbb54ba63e4ce6b1f95c}, author = {Ralha, C.G. and Ralha, J.C.L.} } @article {53, title = {An intelligent paradigm for multi-objects tracking in crowded environment}, journal = {Journal of Digital Information Management}, volume = {4}, year = {2006}, note = {Cited By (since 1996):5Export Date: 10 July 2014}, month = {2006}, pages = {184 - 191}, abstract = {In this paper, we describe a novel object tracking technique in color video sequences, with application to multi-object tracking in crowded scenes. The proposed paradigm integrates object detection into the object tracking process and provide a robust tracking framework under ambiguity conditions. In order to reduce the computational complexity and to increase the robustness, we use a tri-sectional structure. i.e., firstly it distinguishes between real world objects, secondly extracts image features like motion blobs and color patches and thirdly abstracts objects like meta-objects that shall denote real world objects. Through such a tight integration of the motion blobs and color patches, as well as the global optimization of object trajectories, we have accomplished not only robust and efficient multi-object tracking, but also the ability to deal with merging/splitting of objects, irregular object motions, changing appearances, etc. which are the challenging problems for the most traditional tracking methods. The efficiency of the suggested technique for multi-objects detection and tracking will be demonstrated in this paper on the basis of analysis of strongly disturbed real image sequences.}, keywords = {Colour video processing, MDI approach, Moving objects, Object motions}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-33749373594\&partnerID=40\&md5=13a4c51b2ea671d5b5b5f2b0e05705e2}, author = {Al-Hamadi, A.K. and Michaelis, B.} } @article {56, title = {Introduction to the Multimedia Semantics issue}, journal = {Journal of Digital Information Management}, volume = {4}, year = {2006}, note = {Export Date: 10 July 2014}, month = {2006}, pages = {206}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-33845938735\&partnerID=40\&md5=6cc5552751fc285d3d1d350093fe3395}, author = {Grosky, B. and Stanchev, P.L.} } @article {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 {32, title = {A model for the aggregation of QoS in WS compositions involving redundant services}, journal = {Journal of Digital Information Management}, volume = {4}, year = {2006}, note = {Cited By (since 1996):3Export Date: 10 July 2014}, month = {2006}, pages = {44 - 49}, abstract = {A composition arranges available services resulting in a defined flow of tasks. A discovery process identifies the suitable candidate services for a composition. A subsequent selection process chooses the optimal candidate for each task. The selection process can consider different quality-of-service (QoS) categories of the individual services to optimise the quality of the whole composition. The result is a quality-optimised assignment of candidates to each task. In this work, we discuss the case how already identified candidates, which a selection process originally has separated out, can improve a composition w.r.t. particular QoS categories. To realise this improvement, redundant arrangements involve the alternative candidates in order to supplement the originally assigned service. We formed these redundant arrangements on the basis of our previously introduced compositions patterns. The contribution of this work is a computational model that allows the aggregation of the QoS for the composition when these arrangements are applied. This work presents extensions and refinements to our previous work [jaeger etal 05] where the basic concepts of this computational model were already discussed.}, keywords = {Quality aggregation, Software quality, Web service quality}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-33748264359\&partnerID=40\&md5=191a90f99492d0ec23efaaa7b31a4c42}, author = {Jaeger, M.C. and Ladner, H.} } @article {46, title = {A new persistent labelling scheme for XML}, journal = {Journal of Digital Information Management}, volume = {4}, year = {2006}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2006}, pages = {112 - 116}, abstract = {With the growing importance of XML in data exchange, much research has been done in providing flexible query facilities to extract data from structured XML documents. Thereby, several path indexing, labelling and numbering scheme have been proposed. However if XML data need to be updated frequently, most of these approaches will need to re-compute existing labels which is rather time consuming. The goal of the research reported in this paper is to design a persistent structural labelling scheme, namely a labelling scheme where labels encode ancestor-descendant relationships and sibling relationship between nodes but need not to be changed when the document is updated.}, keywords = {Data exchange, Labeling scheme, XML database, XML standards}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-44649170430\&partnerID=40\&md5=b06e66fe740929637d6b20adf7fe0e9e}, author = {Gabillon, A. and Fansi, M.} } @article {58, title = {Optimal placement of Web proxies in the Internet with link capacity constraints}, journal = {Journal of Digital Information Management}, volume = {4}, year = {2006}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2006}, pages = {238 - 242}, abstract = {This paper considers the problem of placing a fixed number of proxies in the Web modelled as a tree network. The study assumes that each link in the network has a fixed capacity, and that the total load passing through a link cannot exceed this capacity. We are interested in finding a minimum cost replication set that optimises the cost of servicing access requests in a read-only environment taking into account the capacity constraints of the links.}, keywords = {Dynamic programming, Link capacity, Replication, Tree network, Web server}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-33845933875\&partnerID=40\&md5=9e8af6a6d40a5eb4fb54dbc61e62f0cc}, author = {Tenzakhti, F.} } @article {65, title = {Optimization of Boolean queries in information retrieval systems using genetic algorithms - Genetic programming and fuzzy logic}, journal = {Journal of Digital Information Management}, volume = {4}, year = {2006}, note = {Export Date: 10 July 2014}, month = {2006}, pages = {249 - 254}, abstract = {This paper proposes to use two information retrieval system models (Boolean information retrieval model and extended Boolean (fuzzy) information retrieval model). These models differ by using Boolean queries or fuzzy weighted queries. It also proposes a way for optimizing user query for the two models by using genetic programming and fuzzy logic. And proposes to use more number of Boolean operators (AND, OR, XOR, OF, and NOT) instead of the standard Boolean operators (AND, OR, and NOT), and use weights for Boolean operators and for terms in fuzzy models.}, keywords = {Boolean operator weights, Boolean query, Fuzzy logic, Genetic algorithms, Genetic programming, Information retrieval, Term weights}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-33845945357\&partnerID=40\&md5=bb2fe8678839544324f8ce90e9dca876}, author = {Owais, S.S.J.} } @article {51, title = {Parallel algorithms for the generalized same generation query in deductive databases}, journal = {Journal of Digital Information Management}, volume = {4}, year = {2006}, note = {Export Date: 10 July 2014}, month = {2006}, pages = {192 - 196}, abstract = {The intelligence of traditional database systems can be improved by recursion. Using recursion, relational database systems are extended into knowledge-base systems (deductive database systems). Linear recursion is the most frequently found type of recursion in deductive databases. Deductive databases queries are computationally intensive and lend themselves naturally to parallelization to speed up the solution of such queries. In this paper, parallel algorithms to solve the generalized fully and partially instantiated forms of the same generation query in deductive databases are presented. The algorithms use special data structures, namely, a special matrix that stores paths from source nodes of the graph representing a two-attribute normalized database relation to all nodes reachable from these source nodes, and a reverse matrix that stores paths from any node to all source nodes related to that node.}, keywords = {Deductive databases, Linear recursive rules, Parallel databases, Same generation query}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-33749424147\&partnerID=40\&md5=f02aca3cb9370bdc7720ce48f7507278}, author = {Arman, N.} } @article {50, title = {Peer-to-peer content search supported by a distributed index in a publication/search model}, journal = {Journal of Digital Information Management}, volume = {4}, year = {2006}, note = {Export Date: 10 July 2014}, month = {2006}, pages = {175 - 183}, abstract = {Peer to-peer networks (P2P) are considered a valid approach for the construction of distributed systems. Further research projects in the last few years have focused on using this kind of networks as an alternative for solving different situations that have traditionally required centralized servers, such as search engines. This paper deals with the problem of content search in highly distributed and dynamic environments. We propose and evaluate a distributed index model built upon a peer-to-peer network which supports complete indexing of text documents and allows searching by content. A distinctive feature of this proposal is that it requires no specific network topology or hierarchy. Evaluations with different settings were performed by simulating a 10,000-node network, where each node had the capability to share documents. With regard to the traffic generated, experiments show an improvement in efficiency of between 84\% and 93\% over similar systems like Gnutella. The evaluation of retrieval performance using a test collection showed that the P2P system was able to achieve the same level of performance as the centralized system. It was also found that the amount of traffic generated by this model varies between 80 and 225 Kb per set of query and answers.}, keywords = {Distributed index model, Nodes, P2P network evaluation, P2P networks}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-33749394455\&partnerID=40\&md5=1ab83251bfe0f9c3bd58f562a6312336}, author = {Tolosa, G.H. and Peri, J.A. and Bordignon, F.R.A.} } @article {48, title = {Providing support for interaction with consistent multimedia presentations}, journal = {Journal of Digital Information Management}, volume = {4}, year = {2006}, note = {Export Date: 10 July 2014}, month = {2006}, pages = {124 - 130}, abstract = {Multimedia presentations are generally specified in terms of spatial and temporal relations between the media objects involved. Creation of these presentations, and interactions with them during their play-out, require an effective mechanism for handling the specifications dynamically. These specifications could result in inconsistencies, which need to be checked and resolved. Moreover, consistent presentations could become inconsistent due to interactions during the playout. Our main contribution is the design of an algorithm which aids in resolving these consistency issues dynamically and efficiently. The other salient features of our approach are a new composite spatio-temporal operator and an effective relaxation policy. We have developed a prototype which helps to study the effectiveness of the proposed approach. Thus, this paper presents an interactive multimedia presentation mechanism, which maintains a consistent and complete set of constraints during authoring and play-out of the presentation.}, keywords = {Completeness checking, Consistency checking, Distributed multimedia presentations, Spatio-temporal relations}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-44649102725\&partnerID=40\&md5=6d8bb6f8d9dff4f2b87372209551154a}, author = {Elias, S. and Easwarakumar, K.S. and Mathew, L. and Chbeir, R.} } @article {55, title = {Pruning techniques in associative classification: Survey and comparison}, journal = {Journal of Digital Information Management}, volume = {4}, year = {2006}, note = {Cited By (since 1996):6Export Date: 10 July 2014}, month = {2006}, pages = {197 - 202}, abstract = {Association rule discovery and classification are common data mining tasks. Integrating association rule and classification also known as associative classification is a promising approach that derives classifiers highly competitive with regards to accuracy to that of traditional classification approaches such as rule induction and decision trees. However, the size of the classifiers generated by associative classification is often large and therefore pruning becomes an essential task. In this paper, we survey different rule pruning methods used by current associative classification techniques. Further, we compare the effect of three pruning methods (database coverage, pessimistic error estimation, lazy pruning) on the accuracy rate and the number of rules derived from different classification data sets. Results obtained from experimenting on different data sets from UCI data collection indicate that lazy pruning algorithms may produce slightly higher predictive classifiers than those which utilise database coverage and pessimistic error pruning methods. However, the potential use of such classifiers is limited because they are difficult to understand and maintain by the end-user.}, keywords = {Association rule, Associative classification, Classification, Data mining, Rule pruning}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-33749400880\&partnerID=40\&md5=0633368b3744eefc60e6e205c64d95f4}, author = {Thabtah, F.} } @article {33, title = {RDF-based peer-to-peer based ontology editing}, journal = {Journal of Digital Information Management}, volume = {4}, year = {2006}, note = {Export Date: 10 July 2014}, month = {2006}, pages = {50 - 55}, abstract = {The evolution of the Semantic Web has accelerated the need for ontologies. There is a need to build new ontologies and to extend and merge existing ontologies. To achieve this we need software tools to edit and build ontologies. Our paper describes software to develop a protocol for collaborative ontology editing based on RDF and using a Peer-to-Peer (P2P) networking architecture. The protocol allows for the implementation a voting mechanism embedded into the RDF data itself, using a mixed initiative design for notification. This is implemented as extensions to an ontology browser called OntoRama. The P2P approach is compared to the classic ontology editing approaches and the special requirements of the ontology editing environment are discussed. The protocol, design, implementation and architecture for ontology update are also elaborated.}, keywords = {Network protocol, Ontology, P2P network architecture, RDF data, Semantic web}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-33748271282\&partnerID=40\&md5=6e01c9d91afd3edb7ba6d4f2ba608881}, author = {Becker, P. and Eklund, P. and Roberts, N.} } @article {31, title = {Self organizing sensors by minimization of cluster heads using intelligent clustering}, journal = {Journal of Digital Information Management}, volume = {4}, year = {2006}, note = {Cited By (since 1996):3Export Date: 10 July 2014}, month = {2006}, pages = {87 - 93}, abstract = {Minimization of the number of cluster heads in a wireless sensor network is a very important problem to reduce channel contention and to improve the efficiency of the algorithm when executed at the level of cluster-heads. This paper proposes a Self Organizing Sensor (SOS) network based on an intelligent clustering algorithm which does not require many user defined parameters and random selection to form clusters like in Algorithm for Cluster Establishment (ACE) [2]. The proposed SOS algorithm is compared with ACE and the empirical results clearly illustrate that the SOS algorithm can reduce the number of cluster heads.}, keywords = {Algorithm for cluster establishment, Intelligent clustering, Wireless sensor networks}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-33748269465\&partnerID=40\&md5=09380a1feabe731dc94b96939ce3ea26}, author = {Shin, K. and Abraham, A. and Han, S.Y.} } @article {64, title = {Semantic, constraint \& preference based multimedia presentation authoring}, journal = {Journal of Digital Information Management}, volume = {4}, year = {2006}, note = {Cited By (since 1996):3Export Date: 10 July 2014}, month = {2006}, pages = {207 - 213}, abstract = {We present in this paper an integrated system that allows the management and annotation of multimedia objects stored in MPEG-7/21 repositories, and the specification and semi-automatic generation of multimedia presentations based on the content relationships that exist between the multimedia objects. This system is the outcome of the collaboration between the Technical University of Crete (TUC-MUSIC) and the University of Milan (UNIMI) in the CoCoMA (Content and Context Aware Multimedia Content Retrieval, Delivery and Presentation) project of the DELOS II European Network of Excellence on Digital Libraries. The resulting system is one of the main components of the CoCoMA infrastructure that aims to provide content- and context-aware rich interactive multimedia presentations by controlling data fusion and metadata reuse. The integrated system utilizes the SyMPA management and presentation authoring system developed by UNIMI and the DS-MIRF framework developed by TUC-MUSIC.}, keywords = {Authoring tools, Digital libraries, Multimedia presentations, Multimedia standards}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-33845937945\&partnerID=40\&md5=762148820f31cebc540800656d2bbd38}, author = {Tsinaraki, C. and Perego, A. and Polydoros, P. and Syntzanaki, A. and Martin, A. and Christodoulakis, S.} } @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.} } @article {54, title = {Study of effectiveness of implicit indicators and their optimal combination for accurate inference of users interests}, journal = {Journal of Digital Information Management}, volume = {4}, year = {2006}, note = {Export Date: 10 July 2014}, month = {2006}, pages = {169 - 174}, abstract = {Retrieval and filtering systems may apply relevance feedback to gain information on users{\textquoteright} needs in order to improve their ad-hoc queries or long term profiling. Explicit relevance involves explicit ratings of documents or terms by the users and disrupts their normal patterns of browsing and searching. The alternative non-disruptive method is implicit feedback inferring users{\textquoteright} needs and interests by monitoring their regular interaction with the system. Some implicit indicators of interest, such as reading time, have been investigated in previous studies and were found indicative to the relevance of documents but not sufficiently accurate to substitute explicit ratings. In this paper we present several new relative implicit feedback indicators and examine their effectiveness as well as the effect of combining several implicit indicators. The paper describes a large-scale user study on which users{\textquoteright} searches were observed by a specially developed browser that recorded their behavior (implicit indicators) as well as their explicit ratings. The relationship between implicit indicators and explicit ratings was analyzed and found that a certain combination of implicit indicators achieved higher correlation with the explicit ratings than any of the individual indicators. We have also found that the newly suggested relative indicators are more indicative to the level of interest of the use in an information item than the non-relative indicators.}, keywords = {Implicit indicators, Relevance feedback, User modeling, User studies}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-33749406365\&partnerID=40\&md5=aa35b421ac892afda1341ff1d8c1ae20}, author = {Shapira, B. and Taieb-Maimon, M. and Moskowitz, A.} } @article {42, title = {Trends in data management: {\textquoteright}High availability{\textquoteright}}, journal = {Journal of Digital Information Management}, volume = {4}, year = {2006}, note = {Export Date: 10 July 2014}, month = {2006}, pages = {150 - 154}, abstract = {In today{\textquoteright}s highly competitive business environment, for most companies it is imperative that their business data is always accessible from their data servers in a seamlessly fault tolerant manner. DBMSs, which constitute the core of most business information systems, are attempting to implement this requirement through a feature often referred to in the data management literature as {\textquoteright}high availability{\textquoteright}. Against the backdrop of a leading DBMS, Microsoft SQL Server 2005, we define the concept of high availability and examine the various approaches to high availability, namely, mirroring, clustering, replication, and log shipping, which should be of interest to database administrators and the students of database management system technology.}, keywords = {Data clustering, Data mirroring, Data replication, Database administration, SQL}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-44649115858\&partnerID=40\&md5=c675fe3325e4aad3ae202a7a0cd0b784}, author = {Bock, D.B. and Bordoloi, B.} } @article {37, title = {TWSO - Transactional web service orchestrations}, journal = {Journal of Digital Information Management}, volume = {4}, year = {2006}, note = {Cited By (since 1996):4Export Date: 10 July 2014}, month = {2006}, pages = {56 - 62}, abstract = {There is a need for transactional processing in the Web service world. Software industry responded to this need by publishing a couple of Web service transaction proposals that are quite alike. However, these proposals define basically only communication protocols that indirectly implement advanced transaction models. The proposals lack accurate usage suggestions and the rather obvious question "How can I use transactions in Web service based distributed systems?" is not covered anywhere satisfyingly. The use of arbitrary advanced transaction models is provided only by some of the proposals and likely requires an update of various transaction system components. This paper introduces TWSO (Transactional Web Service Orchestrations), a new approach to integrate transactional processing with Web service orchestrations. It tries to overcome the hassles stated above. TWSO concepts may appear in different manifestations, like an XML vocabulary (TWSOL) or an API for Java (TWSO4J). Constructs of TWSO manifestations are intended to be directly incorporated in Web service orchestration definitions. The usage pattern of TWSO is designed to resemble the programming pattern used when application programmers use transaction - enabled components like databases or application servers. Moreover, arbitrary advanced transaction models can be synthesized by using a basic set of transaction primitives without the demand for system-updates.}, keywords = {Network protocol, Transactional Web Service Orchestrations, TWSO}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-33748275471\&partnerID=40\&md5=072dab0b6eaba78383708fb1f1d20e04}, author = {Hrastnik, P. and Winiwarter, W.} } @article {52, title = {On the use of ontologies for an optimal representation and exploration of the web}, journal = {Journal of Digital Information Management}, volume = {4}, year = {2006}, note = {Cited By (since 1996):5Export Date: 10 July 2014}, month = {2006}, pages = {159 - 168}, abstract = {The use and definition of ontology for the representation and the exploration of knowledge are critical issues for approaches dealing with information retrieval. In this paper, we propose a new ontology-based approach for improving the quality, in terms of relevance, of the results obtained when searching documents on the Internet. This is done by a coherent integration of ontologies, Web data and query languages. We propose new data structures built upon ontologies: the WPGraph and the W 3Graph which allow Web data to be modelled. We also discuss the use of ontologies for an efficient exploration of the knowledge contained in our conceptual structures using ASK, a specific query language introduced in this paper. An experimental validation of our approach is proposed through a prototype supporting our innovative framework.}, keywords = {Conceptual structures, Graphs, Ontology, Query language, Web search}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-33749389716\&partnerID=40\&md5=2881871777661cd78d3507f448bedc32}, author = {Guelfi, N. and Pruski, C.} } @article {61, title = {User interactions with multimedia repositories using natural language interfaces - OntoNL: An architectural framework and its implementation}, journal = {Journal of Digital Information Management}, volume = {4}, year = {2006}, note = {Cited By (since 1996):4Export Date: 10 July 2014}, month = {2006}, pages = {220 - 226}, abstract = {We present a generalized architectural framework for constructing and using natural language interfaces for interactions with multimedia repositories. The system allows the users to specify natural language queries about the multimedia content with rich semantics. It uses an extensive set of methodologies and tools for linguistic processing, and utilizes the MPEG-7 and the domain ontologies to reduce the ambiguities in the natural language and to rank the results. We describe the implementation of this framework for supporting interactions with a multimedia repository, described with the MPEG-7 MDS (Multimedia Description Schemes) structures, that also uses User Profile information for better ranking of the result queries.}, keywords = {MPEG 7, Natural language interface, Ontology, Semantics}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-33845925229\&partnerID=40\&md5=78be53ce109a805416d2c49e78d10de5}, author = {Karanastasi, A. and Zotos, A. and Christodoulakis, S.} } @article {47, title = {Using BFA with wordnet based model for web retrieval}, journal = {Journal of Digital Information Management}, volume = {4}, year = {2006}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2006}, pages = {107 - 111}, abstract = {In the area of information retrieval, the dimension of document vectors plays an important role. We may need to find a few words or concepts, which characterize the document based on its contents, to overcome the problem of the "curse of dimensionality", which makes indexing of high-dimensional data problematic. To do so, we earlier proposed a Wordnet and Wordnet+LSI (Latent Semantic Indexing) based model for dimension reduction. While LSI works on the whole collection, another procedure of feature extraction (and thus dimension reduction) exists, using binary factorization. The procedure is based on the search of attractors in Hopfield-like associative memory. Being applied to textual data the procedure conducted well and even more it showed sensitivity to the context in which the words were used. In this paper, we suggest that the binary factorization may benefit from the Wordnet filtration.}, keywords = {Latent semantic indexing, Ontology, Semantic web, Vector model, Web information retrieval, WordNet}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-44649186320\&partnerID=40\&md5=84c389a9e2d0c1be0cd8ecdb6b1534ec}, author = {Sn{\'a}{\v s}el, V. and Moravec, P. and Pokorn{\'y}, J.} } @article {25, title = {Web services practices}, journal = {Journal of Digital Information Management}, volume = {4}, year = {2006}, note = {Cited By (since 1996):1Export Date: 10 July 2014}, month = {2006}, pages = {1 - 3}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-33748276255\&partnerID=40\&md5=884b133db7ced4fcf2cae9418b3b9919}, author = {Abraham, A. and Chung, J.-Y. and Han, S.} } @article {60, title = {X-Similarity: Computing Semantic Similarity between concepts from different ontologies}, journal = {Journal of Digital Information Management}, volume = {4}, year = {2006}, note = {Cited By (since 1996):25Export Date: 10 July 2014}, month = {2006}, pages = {233 - 237}, abstract = {Semantic Similarity relates to computing the similarity between concepts (terms) which are not necessarily lexically similar. We investigate approaches for computing semantic similarity by mapping terms to an ontology and by examining their relationships in that ontology. More specifically, we investigate approaches to computing the semantic similarity between natural language terms (using WordNet as the underlying reference ontology) and between medical terms (using the MeSH ontology of medical and biomedical terms). The most popular semantic similarity methods are implemented and evaluated using WordNet and MeSH. The focus of this work is also on cross ontology methods which are capable of computing the semantic similarity between terms stemming from different ontologies (WordNet and MeSH in this work). This is a far more difficult problem (than the single ontology one referred to above) which has not been investigated adequately in the literature. X-Similarity, a novel cross-ontology similarity method is also a contribution of this work. All methods examined in this work are integrated into a semantic similarity system which is accessible on the Web.}, keywords = {Content analysis, MeSH, Ontology, Semantics, WordNet}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-33845952568\&partnerID=40\&md5=5bd213d7f778b7c4e7b32133f4b456f8}, author = {Petrakis, E.G.M. and Varelas, G. and Hliaoutakis, A. and Raftopoulou, P.} }