02502nas a2200145 4500008004100000245010000041210006900141260001200210300001100222490000700233520203100240100001802271700002102289856004602310 2024 eng d00aA Brief Review of the Automation of Dependency Satisfaction With in Microservices Architectures0 aBrief Review of the Automation of Dependency Satisfaction With i c09/2024 a99-1070 v223 a

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’ 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’ 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.

1 aEsrawi, Ammar1 aAlkhatib, Bassel uhttps://10.0.23.137/jdim/2024/22/3/99-10702449nas a2200145 4500008004100000245005400041210005300095260001200148300001000160490000700170520203100177100001802208700002102226856005602247 2024 eng d00aCan ChatGPT Predict Stock Market Price Movements?0 aCan ChatGPT Predict Stock Market Price Movements c09/2024 a91-980 v223 a

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’ 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’ 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.

1 aEsrawi, Ammar1 aAlkhatib, Bassel uhttp://www.dline.info/jdim/wp-content/uploads/2.pdf01650nas a2200133 4500008004100000245014800041210006900189260001200258300001000270490000700280520115500287100001301442856006101455 2024 eng d00aEvaluation of Local Green Supply Chain Performance Using a Three-Phase Data Envelopment Analysis (DEA) Model and Malmquist Efficiency Framework0 aEvaluation of Local Green Supply Chain Performance Using a Three c06/2024 a63-730 v223 a

Regional synergistic development and lowcarbon economy are China'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’ 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.

1 aZhao, Bo uhttps://www.dline.info/fpaper/jdim/v22i2/jdimv22i2_3.pdf01515nas a2200157 4500008004100000245008500041210006900126260001200195300001000207490000700217520101200224100002001236700002101256700001901277856006101296 2024 eng d00aIntroducing a Process-Oriented Framework for the Design of Advertising Campaigns0 aIntroducing a ProcessOriented Framework for the Design of Advert c03/2024 a17-320 v223 a

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.

1 aShafiee, Maysam1 aIranpak, Parasto1 aZand, Mohammad uhttps://www.dline.info/fpaper/jdim/v22i1/jdimv22i1_3.pdf02546nas a2200133 4500008004100000245012300041210006900164260001200233300001000245490000700255520208600262100001702348856004702365 2024 eng d00aPredicting the Productivity of China’s Building Sector and the Elements that Affect it Using the DEA-Tobit Framework0 aPredicting the Productivity of China s Building Sector and the E c06/2024 a46-550 v223 a

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’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’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’s construction industry based on the Tobit regression model. The results show that the average production efficiency of China’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’s construction industry.

1 aCheng, Guang uhttp://www.dline.info/download.php?sn=405302411nas a2200145 4500008004100000245009900041210006900140260001200209300001000221490000700231520192900238100001802167700002402185856005602209 2024 eng d00aPredictive Modeling of Stock Price Trends Using Machine Learning and Deep Learning Techniques-0 aPredictive Modeling of Stock Price Trends Using Machine Learning c09/2024 a83-900 v223 a

: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'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..

1 aKiruthika, K.1 aSamundeeswari, E.S. uhttp://www.dline.info/jdim/wp-content/uploads/1.pdf01235nas a2200133 4500008004100000245008500041210006900126260001200195300000800207490000700215520080400222100001401026856006101040 2024 eng d00aA Recognition Learning System Based on Poetry Database and Text Pattern Function0 aRecognition Learning System Based on Poetry Database and Text Pa c03/2024 a1-70 v223 a

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’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’ learning progress and abilities to achieve precise teaching.

1 aHu, Youyu uhttps://www.dline.info/fpaper/jdim/v22i1/jdimv22i1_1.pdf01741nas a2200145 4500008004100000245009600041210006900137260001200206300000900218490000700227520126100234100002101495700001801516856006101534 2024 eng d00aStudy to Analyze the Effect of Online Reviews and Smart Phone Buying Behaviour of Customers0 aStudy to Analyze the Effect of Online Reviews and Smart Phone Bu c03/2024 a8-160 v223 a

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’ attitudes and behaviours towards mobile phone purchases.

1 aKanojiya, Nitesh1 aSharma, Pooja uhttps://www.dline.info/fpaper/jdim/v22i1/jdimv22i1_2.pdf01158nas a2200133 4500008004100000245008600041210006900127260001200196300001000208490000700218520072600225100001200951856006100963 2024 eng d00aUrban Rainwater Management and Protection Through Optimization for Multiple Goals0 aUrban Rainwater Management and Protection Through Optimization f c06/2024 a56-620 v223 a

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.

1 aYong, L uhttps://www.dline.info/fpaper/jdim/v22i2/jdimv22i2_2.pdf01586nas a2200133 4500008004100000245007800041210006900119260001200188300000800200490000700208520117600215100001401391856004701405 2023 eng d00aAn Algorithm of Wavelet Data Compression Based on Wireless Sensor Network0 aAlgorithm of Wavelet Data Compression Based on Wireless Sensor N c03-2023 a1-80 v213 a

 Firstly, this paper gives a data aggregation algorithm based on learning automata to solve the problem that the existing data aggregation algorithm can’t solve, the uneven energy cost, and the existing algorithm can’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.

1 aXiao, Luo uhttp://www.dline.info/download.php?sn=368101133nas a2200157 4500008004100000245005300041210005200094260001200146300001000158490000700168520069200175100001900867700002200886700002000908856004700928 2023 eng d00aAnalysis of ChatGPT as a Question-Answering Tool0 aAnalysis of ChatGPT as a QuestionAnswering Tool c06/2023 a50-610 v213 a

 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’ requirements.

1 aPichappan, Pit1 aKrishnamurthy, M.1 aVijayakumar, P. uhttp://www.dline.info/download.php?sn=375801048nas a2200133 4500008004100000245005900041210005800100260001200158300001000170490000700180520066100187100001900848856004700867 2023 eng d00aAnalysis of the Growth of Medical Information Systems-0 aAnalysis of the Growth of Medical Information Systems c09/2023 a88-950 v213 a

 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.

1 aRocha, Álvaro uhttp://www.dline.info/download.php?sn=383801594nas a2200145 4500008004100000245006900041210006700110260001200177300001000189490000700199520114200206100002101348700003201369856004701401 2023 eng d00aASR Features Extraction Using MFCC And LPC: A Comparative Study-0 aASR Features Extraction Using MFCC And LPC A Comparative Study c06/2023 a39-490 v213 a

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' 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’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).

1 aAlkhatib, Bassel1 aEddin, Mohammad, Madian Kam uhttp://www.dline.info/download.php?sn=375701983nas a2200193 4500008004100000245009200041210006900133260001200202300001300214490000700227520137600234100002201610700002101632700001701653700002101670700001701691700002001708856006101728 2023 eng d00aConvolutional Neural Networks for Handwritten Text Recognition of Medical Prescription-0 aConvolutional Neural Networks for Handwritten Text Recognition o c12/2023 a117--1240 v213 a

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 – 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%.

1 aShahade, Makarand1 aKulkarni, Mayuri1 aPawar, Vivek1 aChaudhari, Jatin1 aLakade, Yash1 aKotkar, Darshan uhttps://www.dline.info/fpaper/jdim/v21i4/jdimv21i4_3.pdf02491nas a2200193 4500008004100000245009200041210006900133260001200202300001200214490000700226520189900233100002202132700002102154700001702175700002102192700001702213700002002230856004702250 2023 eng d00aConvolutional Neural Networks for Handwritten Text Recognition of Medical Prescription-0 aConvolutional Neural Networks for Handwritten Text Recognition o c12/2023 a117-1240 v213 a

 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 – 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%.

1 aShahade, Makarand1 aKulkarni, Mayuri1 aPawar, Vivek1 aChaudhari, Jatin1 aLakade, Yash1 aKotkar, Darshan uhttp://www.dline.info/download.php?sn=389900500nas a2200145 4500008004100000245010800041210006900149260001200218300000900230490000700239100002200246700002100268700001800289856004700307 2023 eng d00aEmpirical Analysis on the Efficiency of Clustering Algorithms Based on the Significance of Cluster Size0 aEmpirical Analysis on the Efficiency of Clustering Algorithms Ba c03/2023 a9-170 v211 aCheriyan, Sunitha1 aIbrahim, Shaniba1 aTreesa, Susan uhttp://www.dline.info/download.php?sn=368201348nas a2200157 4500008004100000245004300041210004100084260001200125300001300137490000700150520092100157100002201078700002301100700002001123856004701143 2023 eng d00aERP Project Lifecycle costs: A Review-0 aERP Project Lifecycle costs A Review c12/2024 a110 -1160 v213 a

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.

1 aHanane, L’YARFI1 aNoureddine, MOTAKI1 aMostafa, DERRHI uhttp://www.dline.info/download.php?sn=389801391nas a2200169 4500008004100000245004300041210004100084260001200125300001200137490000700149520092100156100002201077700002301099700002001122700001801142856006101160 2023 eng d00aERP Project Lifecycle costs: A Review-0 aERP Project Lifecycle costs A Review c12/2023 a110-1160 v213 a

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.

1 aHanane, L’YARFI1 aNoureddine, MOTAKI1 aMostafa, DERRHI1 aImane, LAHLOU uhttps://www.dline.info/fpaper/jdim/v21i4/jdimv21i4_2.pdf01747nas a2200145 4500008004100000245011800041210006900159260001200228300001000240490000700250520126800257100001601525700001301541856004701554 2023 eng d00aHow Much Difference in Earthquake Risk among China’s Areas: A Study based on Pricing a Seismic Catastrophe Bond0 aHow Much Difference in Earthquake Risk among China s Areas A Stu c03/2023 a18-230 v213 a

Firstly, this paper gives a data aggregation algorithm based on learning automata to solve the problem that the existing data aggregation algorithm can’t solve, the uneven energy cost, and the existing algorithm can’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.

1 aZhang, Yong1 aLiu, Wei uhttp://www.dline.info/download.php?sn=368301359nas a2200133 4500008004100000245012400041210006900165260001200234300001000246490000700256520089800263100001701161856004701178 2023 eng d00aImprovement of English-Chinese Translation Method by Feature Reduction and Rule Optimization Based on Rough Set Theory-0 aImprovement of EnglishChinese Translation Method by Feature Redu c09-2023 a83-870 v213 a

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.

1 aWei, Hongxia uhttp://www.dline.info/download.php?sn=383701922nas a2200133 4500008004100000245007800041210006900119260001200188300001200200490000700212520150800219100001401727856004701741 2023 eng d00aRecruitment Management System Design and Deployment-Based on PHP Analysis0 aRecruitment Management System Design and DeploymentBased on PHP  c11/2023 a101-1090 v213 a

 This article aims to create a three-level architecture based on PHP to implement a company’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.

1 aHu, Youyu uhttp://www.dline.info/download.php?sn=389701929nas a2200133 4500008004100000245007700041210006900118260001200187300001200199490000700211520150200218100001401720856006101734 2023 eng d00aRecruitment Management System Design and Deployment-Based on PHPAnalysis0 aRecruitment Management System Design and DeploymentBased on PHPA c12/2023 a101-1090 v213 a

This article aims to create a three-level architecture based on PHP to implement a company’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.

1 aHu, Youyu uhttps://www.dline.info/fpaper/jdim/v21i4/jdimv21i4_1.pdf01580nas a2200145 4500008004100000245006600041210006300107260001200170300001000182490000700192520114700199100002001346700002101366856004701387 2023 eng d00aA Step towards Semantic Digital Library in the Arabic Region-0 aStep towards Semantic Digital Library in the Arabic Region c06/2023 a29-380 v213 a

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.

1 aAlsahar, Maysah1 aAlkhatib, Bassel uhttp://www.dline.info/download.php?sn=375601006nas a2200157 4500008004100000245008800041210006900129260001200198300001000210490000700220520052300227100001700750700001700767700001700784856004700801 2023 eng d00aWireless Sensor Networks: New Deployment Topology and DV-hop Algorithm Improvement-0 aWireless Sensor Networks New Deployment Topology and DVhop Algor c09/2023 a71-820 v213 a

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.

1 aROUAM, Rania1 aHAMID, Mouna1 aAmad, Mourad uhttp://www.dline.info/download.php?sn=383601653nas a2200145 4500008004100000245006900041210006700110260001200177300001000189490000700199520120100206100003201407700002101439856004701460 2022 eng d00aASR Features Extraction Using MFCC and LPC: A Comparative Study-0 aASR Features Extraction Using MFCC and LPC A Comparative Study c09-2022 a79-890 v203 a

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'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'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).

1 aEddin, Mohammad, Madian Kam1 aAlkhatib, Bassel uhttp://www.dline.info/download.php?sn=356601096nas a2200133 4500008004100000245011300041210006900154260001200223300001200235490000700247520063900254100002200893856004700915 2022 eng d00aCOVID- 19 pandemic – An Empirical Study on the Cybersecurity Behaviour of Healthcare Sectors and Employees0 aCOVID 19 pandemic An Empirical Study on the Cybersecurity Behavi c12/2022 a115-1300 v203 a

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 “interpolated XOR” 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.

1 aStewart, Harrison uhttp://www.dline.info/download.php?sn=361701591nas a2200157 4500008004100000245006200041210006200103260001200165300001200177490000700189520114100196100002101337700002101358700001701379856003701396 2022 eng d00aDeep Learning Model CNN With LSTM For Speaker Recognition0 aDeep Learning Model CNN With LSTM For Speaker Recognition c12/2022 a131-1470 v203 a

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’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'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’s a new enrollment.

1 aAlkhatib, Bassel1 aMadian, Mohammad1 aEddin, Kamal uhttps://dline.info/newl/node/75501541nas a2200157 4500008004100000245009400041210006900135260001200204300001000216490000700226520102600233100003101259700002201290700002401312856004701336 2022 eng d00aA Design of Chao Phraya Express Boat Route and Tourist Attraction Application On Android-0 aDesign of Chao Phraya Express Boat Route and Tourist Attraction  c06/2022 a67-740 v203 a

This paper aims to develop a design for the Chao Phraya Express Boat application and evaluate users' 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'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.

1 aKetmaneechairat, Hathairat1 aThurapan, Supakit1 aPhadlom, Sireethorn uhttp://www.dline.info/download.php?sn=351301629nas a2200169 4500008004100000245009600041210006900137260001200206300001000218490000700228520108600235100002201321700002001343700002601363700002101389856004901410 2022 eng d00aEEMCRP: Energy Efficient Multi-hop Clustering Routing Protocol for Wireless Sensor Networks0 aEEMCRP Energy Efficient Multihop Clustering Routing Protocol for c06/2022 a35-450 v203 a

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.

1 aBOULFEKHAR, Samra1 aBELAMRI, Fatima1 aBENMOHAMMED, Mohammed1 aAïssani, Djamil uhttps://doi.org/10.6025/jdim/2022/20/2/35-4501608nas a2200157 4500008004100000245008300041210006900124260001200193300001200205490000700217520111700224100001701341700002301358700002201381856004701403 2022 eng d00aImpact of Digital Leadership on Kuwaiti hospitals’ Employees’ Performance-0 aImpact of Digital Leadership on Kuwaiti hospitals Employees Perf c09/2022 a104-1100 v203 a

 The study aimed to identify the Impact of Digital Leadership on Kuwaiti hospitals' employees' 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'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' employees' 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.

1 aOmran, Esraa1 aSharhan, Salah, Al1 aGrandison, Tyrone uhttp://www.dline.info/download.php?sn=356800989nas a2200133 4500008004100000245006600041210006600107260001200173300001000185490000700195520057700202100002900779856004700808 2022 eng d00aPublic Key Cryptosystem and Binary Edwards Curves on the Ring0 aPublic Key Cryptosystem and Binary Edwards Curves on the Ring c03/2022 a25-300 v203 a

 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.

1 aElhamam, Moha, ben taleb uhttp://www.dline.info/download.php?sn=345001488nas a2200157 4500008004100000245005800041210005600099260001200155300001000167490000700177520104200184100001701226700002101243700001901264856004701283 2022 eng d00aA Survey of Sentiment Analysis in the Arabic Language0 aSurvey of Sentiment Analysis in the Arabic Language c03/2022 a10-240 v203 a

 â€œWhat the others think?” 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.

1 aJAFAR, Kamel1 aAlkhatib, Bassel1 aWANNOUS, Hazem uhttp://www.dline.info/download.php?sn=344901607nas a2200145 4500008004100000245008700041210006900128260001200197300000800209490000700217520115000224100001901374700002101393856004701414 2022 eng d00aA Systematic Review of Serious Games Relating to Cognitive Impairment and Dementia0 aSystematic Review of Serious Games Relating to Cognitive Impairm c03/2022 a1-90 v203 a

 Assessment, diagnosis, and cognitive stimulation of patients with different stages of cognitive impairment, including mild cognitive impairment (MCI) and Alzheimer’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.

1 aMezrar, Samiha1 aBendella, Fatima uhttp://www.dline.info/download.php?sn=344801320nas a2200169 4500008004100000245007500041210006900116260001200185300001200197490000700209520079400216100001901010700002301029700002101052700003001073856004701103 2022 eng d00aUtilization of SAM-based network for developing function approximation0 aUtilization of SAMbased network for developing function approxim c12/2022 a148-1550 v203 a

We have previously reported progress in developing a multilayer SAM spiking neural network and a training algorithm, suitable for implementation on an FPGA with “On- Chip Learning”. 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 ‘NFR-coding’. We demonstrate “interpolated XOR” 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.

1 aMotoki, Minoru1 aShintani, Hirohito1 aMatsuo, Kazunori1 aMcGinnity, Thomas, Martin uhttp://www.dline.info/download.php?sn=361901364nas a2200133 4500008004100000245007200041210006900113260001200182300001100194490000700205520095900212100002201171856003701193 2022 eng d00aWhy ISO27001 Certified Organizations Still Experience Data Leakage?0 aWhy ISO27001 Certified Organizations Still Experience Data Leaka c09/2022 a90-1030 v203 a

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.

1 aStewart, Harrison uhttps://dline.info/newl/node/75801314nas a2200169 4500008004100000245011500041210006900156260001200225300001000237490000700247520077900254100001601033700001501049700001801064700001501082856004701097 2021 eng d00a Automated Management of Computer Management Procedure of Critical Control Point Information on HACCP System-0 aAutomated Management of Computer Management Procedure of Critica c03/2021 a27-300 v193 a

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.

1 aLi, Yongmei1 aZhao, Yang1 aWang, Lingjun1 aWang, Ying uhttp://www.dline.info/download.php?sn=317301899nas a2200145 4500008004100000245010300041210006900144260001000213300001000223490000700233520142700240100001801667700002101685856004701706 2021 eng d00aEfficient Measuring of Readability to Improve Documents Accessibility for Arabic Language Learners0 aEfficient Measuring of Readability to Improve Documents Accessib c09/21 a75-820 v193 a

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ïve Bayes, Bernoulli Naï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 ‘level identification’ 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ï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.

1 aBessou, Sadik1 aChenni, Ghozlane uhttp://www.dline.info/download.php?sn=332601439nas a2200133 4500008004100000245008500041210006900126260001200195300001200207490000700219520100400226100002801230856004701258 2021 eng d00aThe Imperialist Competitive Algorithm for Automated Mining of Association Rules-0 aImperialist Competitive Algorithm for Automated Mining of Associ c12/2021 a135-1430 v193 a

 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.

1 aKhademolghorani, Fariba uhttp://www.dline.info/download.php?sn=336901738nas a2200157 4500008004100000245007800041210006900119260001200188300001000200490000700210520124700217100001901464700002601483700002401509856004701533 2021 eng d00a Incorporating Quality Measurement into Scientific Document Retrieval –0 aIncorporating Quality Measurement into Scientific Document Retri c06/2021 a47-580 v193 a

 One of the challenges facing today'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’ 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.

1 aIbrahim, Nedra1 aChaibi, Anja, Habacha1 aBen Ghézala, Henda uhttp://www.dline.info/download.php?sn=325901454nas a2200145 4500008004100000245007700041210006900118260001200187300000800199490000700207520099900214100003001213700001801243856004701261 2021 eng d00aInformation Organization Activities in the Knowledge Management Setting-0 aInformation Organization Activities in the Knowledge Management  c03/2021 a1-90 v193 a

 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.

1 aMasinde, Johnson, Mulongo1 aSanya, Otuoma uhttp://www.dline.info/download.php?sn=317100455nas a2200133 4500008004100000245009200041210006900133260001200202300001200214490000700226100002400233700001700257856004700274 2021 eng d00aLearning from Web Searching: Enhancing Users’ Experiences with NaviWeb Mobile System-0 aLearning from Web Searching Enhancing Users Experiences with Nav c12/2021 a113-1240 v191 aMarshad, Shaden, Al1 aBerri, Jawad uhttp://www.dline.info/download.php?sn=336704254nas a2200133 4500008004100000245007200041210006900113260001200182300001000194490000700204520383600211100002604047856004704073 2021 eng d00aMigration Intelligence: AI and Bio-surveillance of Migration Flows-0 aMigration Intelligence AI and Biosurveillance of Migration Flows c06/2021 a59-640 v193 a

 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 ‘invisible populations’, 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 ‘data panoptic’ 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’ 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 ‘Migration Intelligence’ 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 ‘Migration Intelligence’ 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.

1 aBuoncompagni, Giacomo uhttp://www.dline.info/download.php?sn=326001385nas a2200145 4500008004100000245010800041210006900149260001200218300001000230490000700240520089300247100002901140700002301169856004701192 2021 eng d00aRetrieving and Processing Images from the Pages of a Historical Newspaper and Modeling the Text Topics-0 aRetrieving and Processing Images from the Pages of a Historical  c06/2021 a41-460 v193 a

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.

1 aSá, Gildácio, J. de A.1 aMaia, José, E. B. uhttp://www.dline.info/download.php?sn=325800484nas a2200145 4500008004100000245009300041210006900134260001200203300001000215490000700225100002000232700001200252700002700264856004700291 2021 eng d00aTSV2RDF: Generating RDF Data Model from TSV File Format using Semantic Web Technologies-0 aTSV2RDF Generating RDF Data Model from TSV File Format using Sem c03/2021 a10-260 v191 aHasan, Mammadov1 aLi, Yan1 aAhmad, Muhammad, Waqas uhttp://www.dline.info/download.php?sn=317201773nas a2200145 4500008004100000245007800041210006900119260001200188300000900200490000700209520130200216100002001518700003301538856005601571 2020 eng d00a Automatic Marching Cubes for Improving 3D Medical Images Reconstruction-0 aAutomatic Marching Cubes for Improving 3D Medical Images Reconst c02/2020 a1-100 v183 a

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.

1 aFekraoui, Farah1 aBabahenini, Mohamed, Chaouki uhttp://dline.info/fpaper/jdim/v18i1/jdimv18i1_1.pdf01105nas a2200145 4500008004100000245008900041210006900130260001200199300001000211490000700221520063400228100002000862700002100882856005600903 2020 eng d00aIs the Binary Search Faster when Two Variables are Added in the Middle of the Data?-0 aBinary Search Faster when Two Variables are Added in the Middle  c04/2020 a57-640 v183 a

 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.

1 aTjendry, Djasen1 aIstiono, Wirawan uhttp://dline.info/fpaper/jdim/v18i2/jdimv18i2_2.pdf01866nas a2200181 4500008004100000245013300041210006900174260001200243300001000255490000700265520124400272100002201516700002401538700002001562700002501582700002101607856005601628 2020 eng d00aComparison of the Effects Stemmer Porter and Nazief-Adriani on the Performance of Winnowing Algorithms for Measuring Plagiarism-0 aComparison of the Effects Stemmer Porter and NaziefAdriani on th c04/2020 a49-560 v183 a

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.

1 aRahmatulloh, Alam1 aKurniati, Neng, Ika1 aDarmawan, Irfan1 aAsyikin, Adi, Zaenal1 aWitarsyah, Deden uhttp://dline.info/fpaper/jdim/v18i2/jdimv18i2_1.pdf01537nas a2200145 4500008004100000245007400041210006900115260002000184300001200204490000700216520107800223100002201301700002101323856004701344 2020 eng d00aData Mining Applications for Banks’ Business Intelligence Maturity-0 aData Mining Applications for Banks Business Intelligence Maturit c10/2020,12/2020 a153-1720 v183 a

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’ business intelligence maturity from the data perspective and enable managers in requirement analysis of information systems.

1 aRanjbarfard, Mina1 aAhmadi, Shahideh uhttp://www.dline.info/download.php?sn=310302516nas a2200145 4500008004100000245011800041210006900159260002000228300001200248490000700260520203500267100000502302700001602307856004702323 2020 eng d00a Formation Mechanism of Knowledge Stickiness in the Collaborative Innovation of Industry–University–Research-0 aFormation Mechanism of Knowledge Stickiness in the Collaborative c10/2020,12/2020 a173-1830 v183 a

 Purpose In the context of deepening the cooperation of Industry–University–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 “Situation–Action–Cognition” (S– A–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.

1 a1 aGuoxin, Liu uhttp://www.dline.info/download.php?sn=310401603nas a2200145 4500008004100000245007900041210006900120260001200189300001100201490000700212520114600219100001801365700001801383856005601401 2020 eng d00aA Graph-Based Approach for Aspect Extraction from Online Customer Reviews-0 aGraphBased Approach for Aspect Extraction from Online Customer R c06/2022 a99-1080 v183 a

 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.

1 aKumar, Rakesh1 aSharan, Aditi uhttp://dline.info/fpaper/jdim/v18i3/jdimv18i3_2.pdf01692nas a2200157 4500008004100000245009800041210006900139260001200208300001000220490000700230520118400237100001801421700001501439700002401454856005601478 2020 eng d00aImproved Face and Facial Expression Recognition Based on a Novel Local Gradient Neighborhood-0 aImproved Face and Facial Expression Recognition Based on a Novel c02/2020 a33-420 v183 a

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%.

1 aAYECHE, Farid1 aALTI, Adel1 aBOUKERRAM, Abdallah uhttp://dline.info/fpaper/jdim/v18i1/jdimv18i1_4.pdf02634nas a2200145 4500008004100000245009800041210006900139260002000208300000800228490000700236520216300243100001802406700001702424856004702441 2020 eng d00aIncentive Mechanism of Innovation Failure Knowledge Sharing of Virtual Research Organization-0 aIncentive Mechanism of Innovation Failure Knowledge Sharing of V c10/2020,12/2020 a1940 v183 a

 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.

1 aZhuang, Xiong1 aPengju, Wang uhttp://www.dline.info/download.php?sn=310502140nas a2200157 4500008004100000245008800041210006900129260001200198300001000210490000700220520163500227100002401862700001901886700002101905856005601926 2020 eng d00aKnowledge-Intensive Decision Support System for Manufacturing Equipment Maintenance0 aKnowledgeIntensive Decision Support System for Manufacturing Equ c06/2020 a85-980 v183 a

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.

1 aBouhalouan, Djamila1 aNachet, Bakhta1 aAdla, Abdelkader uhttp://dline.info/fpaper/jdim/v18i3/jdimv18i3_1.pdf01254nas a2200157 4500008004100000245011900041210006900160260001200229300001200241490000700253520072700260100001600987700001701003700002001020856005601040 2020 eng d00aLCHREP: Layer and Cluster based Hierarchical Routing and Energy Optimization Protocol in Wireless Sensor Networks-0 aLCHREP Layer and Cluster based Hierarchical Routing and Energy O c08/2020 a139-1500 v183 a

 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.

1 aABBAS, Akli1 aAmad, Mourad1 aAMOKRANE, Fatma uhttp://dline.info/fpaper/jdim/v18i4/jdimv18i4_2.pdf01615nas a2200157 4500008004100000245009100041210006900132260002000201300001200221490000700233520110900240100002101349700001701370700002301387856004701410 2020 eng d00aA New Approach Based Symbiotic Organism Search using Data Mining for Medical Decision-0 aNew Approach Based Symbiotic Organism Search using Data Mining f c10/2020,12/2020 a195-2090 v183 a

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.

1 aNouredine, Samia1 aToumi, Abida1 aZineeddine, Baarir uhttp://www.dline.info/download.php?sn=310401567nas a2200157 4500008004100000245008300041210006900124260001200193300001000205490000700215520107300222100001801295700002001313700002001333856005601353 2020 eng d00a New Measures of Journal Impact Based on the Number of Citations and PageRank-0 aNew Measures of Journal Impact Based on the Number of Citations  c02/2020 a11-200 v183 a

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.

1 aSouma, Wataru1 aVodenska, Irena1 aChitkushev, Lou uhttp://dline.info/fpaper/jdim/v18i1/jdimv18i1_2.pdf01131nas a2200169 4500008004100000245005900041210005600100260001200156300001200168490000700180520065400187100001500841700001500856700002100871700001300892856005600905 2020 eng d00aA Novel Algorithm for Generating pseudo Random Number-0 aNovel Algorithm for Generating pseudo Random Number c08/2020 a151-1560 v183 a

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.

1 aHu, Gangyi1 aKou, Weili1 aYuenyong, Sumeth1 aQu, Jian uhttp://dline.info/fpaper/jdim/v18i4/jdimv18i4_3.pdf01110nas a2200145 4500008004100000245009500041210006900136260001200205300001200217490000700229520061800236100003100854700002300885856005600908 2020 eng d00aQuery Expansion in Text Information Retrieval with Local Context and Distributional Model-0 aQuery Expansion in Text Information Retrieval with Local Context c12/2019 a313-3200 v173 a

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.

1 ada Silva, Fabiano, Tavares1 aMaia, José, E. B. uhttp://dline.info/fpaper/jdim/v17i6/jdimv17i6_1.pdf01334nas a2200133 4500008004100000245005900041210005500100260001200155300001000167490000700177520093900184100002101123856005601144 2020 eng d00a Real Estate Loan Knowledge-Based Recommender System-0 aReal Estate Loan KnowledgeBased Recommender System c04/2020 a65-770 v183 a

 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.

1 aAdla, Abdelkader uhttp://dline.info/fpaper/jdim/v18i2/jdimv18i2_3.pdf01667nas a2200133 4500008004100000245006600041210006300107260001200170300001200182490000700194520124400201100003201445856005601477 2020 eng d00aReviewing the Concept of Enterprise Content Management (ECM)-0 aReviewing the Concept of Enterprise Content Management ECM c08/2020 a125-1380 v183 a

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 ‘content’, 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.

1 aRosman, Mohamad, Rahimi Moh uhttp://dline.info/fpaper/jdim/v18i4/jdimv18i4_1.pdf01743nas a2200145 4500008004100000245011500041210006900156260001200225300001000237490000700247520125400254100001601508700001701524856005601541 2020 eng d00aRumor Retransmission on Twitter: Message Characteristics, user Characteristics and 21 Retransmission Outcomes-0 aRumor Retransmission on Twitter Message Characteristics user Cha c02/2020 a21-320 v183 a

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.

1 aChua, Alton1 aChen, Xiaoyu uhttp://dline.info/fpaper/jdim/v18i1/jdimv18i1_3.pdf01477nas a2200145 4500008004100000245007400041210006900115260001200184300001200196490000700208520101700215100002201232700002101254856005601275 2020 eng d00aA Study of Data Requirements for Data Mining Applications in Banking-0 aStudy of Data Requirements for Data Mining Applications in Banki c06/2022 a109-1170 v183 a

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‘s business intelligence maturity from the data perspective and enabling managers for analyzing data requirement of information systems.

1 aRanjbarfard, Mina1 aAhmadi, Shahideh uhttp://dline.info/fpaper/jdim/v18i3/jdimv18i3_3.pdf02063nas a2200169 4500008004100000245010600041210006900147260001200216300001200228490000700240520150900247100002001756700002301776700002201799700001601821856005601837 2019 eng d00aAn Agent-Based Approach for Extracting Business Association Rules from Centralized Databases Systems-0 aAgentBased Approach for Extracting Business Association Rules fr c10/2019 a270-2880 v173 a

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.

1 aMesbahi, Nadjib1 aZoubeidi, Merouane1 aMerizig, Abdelhak1 aKazar, Okba uhttp://dline.info/fpaper/jdim/v17i5/jdimv17i5_2.pdf01671nas a2200145 4500008004100000245005500041210005200096260001200148300001000160490000700170520124300177100002101420700002801441856005601469 2019 eng d00aA CBR Decision Support System for Loan Evaluation-0 aCBR Decision Support System for Loan Evaluation c04/2019 a75-860 v173 a

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.

1 aAdla, Abdelkader1 aBenmessaoud, Noureddine uhttp://dline.info/fpaper/jdim/v17i2/jdimv17i2_3.pdf01840nas a2200205 4500008004100000245005400041210005200095260001200147300001000159490000700169520124300176653002501419653002601444653001701470653002601487653002301513100002101536700002801557856004901585 2019 eng d00aA CBR Decision Support System for Loan Evaluation0 aCBR Decision Support System for Loan Evaluation c04/2019 a75-860 v173 a

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.

10aCase-based Reasoning10aGroup Decision Making10aGroup Memory10aInformation retrieval10aRecommender system1 aAdla, Abdelkader1 aBenmessaoud, Noureddine uhttps://doi.org/10.6025/jdim/2019/17/2/75-8600493nas a2200145 4500008004100000245009400041210006900135260001200204300001200216490000700228100002300235700001600258700001700274856005600291 2019 eng d00aComputer and Network Security: Ontological and Multi-agent System for Intrusion Detection0 aComputer and Network Security Ontological and Multiagent System  c06/2019 a133-1440 v171 aBourekkache, Samir1 aKazar, Okba1 aAloui, Ahmed uhttp://dline.info/fpaper/jdim/v17i3/jdimv17i3_3.pdf01620nas a2200157 4500008004100000245009500041210006900136260001200205300001200217490000700229520111400236100002301350700001601373700001701389856005601406 2019 eng d00aComputer and Network Security: Ontological and Multi-agent System for Intrusion Detection-0 aComputer and Network Security Ontological and Multiagent System  c06/2019 a133-1440 v173 a

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 …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.

1 aBourekkache, Samir1 aKazar, Okba1 aAloui, Ahmed uhttp://dline.info/fpaper/jdim/v17i3/jdimv17i3_3.pdf01665nas a2200169 4500008004100000245007300041210006900114260001200183300001200195490000700207520113300214100002201347700003001369700001701399700002301416856005601439 2019 eng d00a Corpus-Based Techniques for Sentiment Lexicon Generation: A Review-0 aCorpusBased Techniques for Sentiment Lexicon Generation A Review c10/2019 a296-3050 v173 a

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.

1 aDarwich, Mohammad1 aNoah, Shahrul, Azman Mohd1 aOmar, Nazlia1 aOsman, Nurul, Aida uhttp://dline.info/fpaper/jdim/v17i5/jdimv17i5_4.pdf00452nas a2200133 4500008004100000245008300041210006900124260001200193300001000205490000700215100002100222700001900243856005600262 2019 eng d00aCrawling the Dark Web: A Conceptual Perspective, Challenges and Implementation0 aCrawling the Dark Web A Conceptual Perspective Challenges and Im c04/2019 a51-600 v171 aAlkhatib, Bassel1 aBasheer, Randa uhttp://dline.info/fpaper/jdim/v17i2/jdimv17i2_1.pdf01705nas a2200145 4500008004100000245008600041210006900127260001200196300001000208490000700218520123800225100002101463700001901484856005601503 2019 eng d00aCrawling the Dark Web: A Conceptual Perspective, Challenges and Implementation–0 aCrawling the Dark Web A Conceptual Perspective Challenges and Im c04/2019 a51-600 v173 a

 Internet and network technologies have evolved dramatically in the last two decades, with rising users’ demands to preserve their identities and privacy. Researchers have developed approaches to achieve users’ 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.

1 aAlkhatib, Bassel1 aBasheer, Randa uhttp://dline.info/fpaper/jdim/v17i2/jdimv17i2_1.pdf00470nas a2200133 4500008004100000245010100041210006900142260001200211300001200223490000700235100002700242700003000269856003700299 2019 eng d00aDeveloping a Framework for Testing Android Applications based on Reverse Engineering Techniques-0 aDeveloping a Framework for Testing Android Applications based on c08/2019 a189-2000 v171 aAlkhateeb, Noor, Jamal1 aAbouTrab, Mohammad, Saeed uhttps://dline.info/newl/node/71801370nas a2200145 4500008004100000245010100041210006900142260001200211300001200223490000700235520086900242100002701111700003001138856005601168 2019 eng d00aDeveloping a Framework for Testing Android Applications based on Reverse Engineering Techniques-0 aDeveloping a Framework for Testing Android Applications based on c08/2019 a189-2000 v173 a

 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’s designs, architecture and knowledge and extract models to represent them.

1 aAlkhateeb, Noor, Jamal1 aAbouTrab, Mohammad, Saeed uhttp://dline.info/fpaper/jdim/v17i4/jdimv17i4_1.pdf01602nas a2200157 4500008004100000245006500041210006400106260001200170300001200182490000700194520114500201100001501346700001301361700001401374856005601388 2019 eng d00aEffective Evaluation of XML Queries in a Visual Environment-0 aEffective Evaluation of XML Queries in a Visual Environment c06/2-29 a113-1210 v133 a

 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.

1 aHe, Weimin1 aLv, Teng1 aYan, Ping uhttp://dline.info/fpaper/jdim/v17i3/jdimv17i3_1.pdf00450nas a2200157 4500008004100000245006400041210006400105260001200169300001200181490000700193520001300200100001500213700001300228700001400241856003700255 2019 eng d00aEffective Evaluation of XML Queries in a Visual Environment0 aEffective Evaluation of XML Queries in a Visual Environment c06/2019 a113-1210 v173 a
1 aHe, Weimin1 aLv, Teng1 aYan, Ping uhttps://dline.info/newl/node/71401211nas a2200169 4500008004100000245007600041210006900117260001200186300001200198490000700210520067900217100002300896700001900919700002200938700002500960856005600985 2019 eng d00aFault Prediction in Fuzzy Discrete Event Systems: A Diagnoser Approach-0 aFault Prediction in Fuzzy Discrete Event Systems A Diagnoser App c12/2019 a337-3450 v173 a

 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.

1 aBenmessahel, Bilal1 aNouioua, Farid1 aTouahria, Mohamed1 aChariete, Abderrahim uhttp://dline.info/fpaper/jdim/v17i6/jdimv17i6_3.pdf01053nas a2200145 4500008004100000245008600041210006900127260001200196300001000208490000700218520060100225100002000826700000500846856005600851 2019 eng d00aHybrid Force-Based Model to Simulate Behavior of Human Crowd in Panic Situations-0 aHybrid ForceBased Model to Simulate Behavior of Human Crowd in P c02/2019 a25-330 v173 a

 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.

1 aAlnahhas, Ammar1 a uhttp://dline.info/fpaper/jdim/v17i1/jdimv17i1_3.pdf00398nas a2200121 4500008004100000245008500041210006900126260001200195490000700207100002000214700000500234856003700239 2019 eng d00aHybrid Force-Based Model to Simulate Behavior of Human Crowd in Panic Situations0 aHybrid ForceBased Model to Simulate Behavior of Human Crowd in P c02/20190 v191 aAlnahhas, Ammar1 a uhttps://dline.info/newl/node/70700427nas a2200133 4500008004100000245008800041210006900129260001200198300001100210490000700221100002300228700000500251856003700256 2019 eng d00aHybrid SVR-ACNN Model: Proposed Video Super-Resolution Method for Video Enhancement0 aHybrid SVRACNN Model Proposed Video SuperResolution Method for V c04/2019 a87-1030 v171 aM, Padma, Reddy A.1 a uhttps://dline.info/newl/node/71301967nas a2200145 4500008004100000245014000041210006900181260001200250300001200262490000700274520143900281100002001720700002501740856005601765 2019 eng d00aInformation Security Risk Management of Research Information Systems: A hybrid approach of Fuzzy FMEA, AHP, TOPSIS and Shannon Entropy-0 aInformation Security Risk Management of Research Information Sys c12/2019 a321-3360 v173 a

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’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.

1 aErshadi, M., J.1 aForouzandeh, Mehrdad uhttp://dline.info/fpaper/jdim/v17i6/jdimv17i6_2.pdf01619nas a2200145 4500008004100000245010800041210006900149260001200218300001000230490000700240520113600247100001601383700001801399856005601417 2019 eng d00aIntroducing a Personal Semantics in the User Profile Modeling for a Personalized Information Retrieval-0 aIntroducing a Personal Semantics in the User Profile Modeling fo c04/2019 a61-740 v173 a

 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’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.

1 aRAFA, Tahar1 aKECHID, Samir uhttp://dline.info/fpaper/jdim/v17i2/jdimv17i2_2.pdf00451nas a2200133 4500008004100000245010700041210006900148260001200217300001000229490000700239100001600246700001800262856003700280 2019 eng d00aIntroducing a Personal Semantics in the User Profile Modeling for a Personalized Information Retrieval0 aIntroducing a Personal Semantics in the User Profile Modeling fo c04/2019 a61-750 v171 aRAFA, Tahar1 aKECHID, Samir uhttps://dline.info/newl/node/71102010nas a2200157 4500008004100000245010300041210006900144260001200213300001200225490000700237520146700244100003201711700002401743700002901767856005601796 2019 eng d00aInvestigating the Determinant and Impact of Digital Library Engagement: A Conceptual Framework –0 aInvestigating the Determinant and Impact of Digital Library Enga c08/2019 a214-2260 v173 a

 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 

1 aRosman, Mohamad, Rahimi Moh1 aIsmail, Mohd, Nasir1 aMasrek, Mohamad, Noorman uhttp://dline.info/fpaper/jdim/v17i4/jdimv17i4_3.pdf00508nas a2200145 4500008004100000245009900041210006900140260001200209300001200221490000700233100003200240700002400272700002900296856003700325 2019 eng d00aInvestigating the Determinant and Impact of Digital Library Engagement: A Conceptual Framework0 aInvestigating the Determinant and Impact of Digital Library Enga c08/2019 a214-2260 v171 aRosman, Mohamad, Rahimi Moh1 aIsmail, Mohd, Nasir1 aMasrek, Mohamad, Noorman uhttps://dline.info/newl/node/72000496nas a2200145 4500008004100000245011300041210006900154260001200223300001200235490000700247100002600254700001600280700001700296856003700313 2019 eng d00aA New Design for Smart and Decentralized Approach for Resource Allocation in Cloud Computing using CSP Model0 aNew Design for Smart and Decentralized Approach for Resource All c08/2019 a201-2130 v171 aAbdallah, Almutawakel1 aOkba, Kazar1 aMouadh, Bali uhttps://dline.info/newl/node/71901537nas a2200157 4500008004100000245011400041210006900155260001200224300001200236490000700248520100900255100002601264700001601290700001701306856005601323 2019 eng d00aA New Design for Smart and Decentralized Approach for Resource Allocation in Cloud Computing using CSP Model-0 aNew Design for Smart and Decentralized Approach for Resource All c08/2019 a201-2130 v173 a

 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’ 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.

1 aAbdallah, Almutawakel1 aOkba, Kazar1 aMouadh, Bali uhttp://dline.info/fpaper/jdim/v17i4/jdimv17i4_2.pdf00465nas a2200133 4500008004100000245009700041210006900138260001200207300001200219490000700231100001900238700001800257856005600275 2019 eng d00aOntological Approach Based on Multi-Agent System for Indexing and Filtering Arabic Documents0 aOntological Approach Based on MultiAgent System for Indexing and c06/2019 a145-1630 v171 aZouaoui, Samia1 aRezeg, Khaled uhttp://dline.info/fpaper/jdim/v17i3/jdimv17i3_4.pdf02309nas a2200145 4500008004100000245009800041210006900139260001200208300001200220490000700232520183100239100001902070700001802089856005602107 2019 eng d00aOntological Approach Based on Multi-Agent System for Indexing and Filtering Arabic Documents-0 aOntological Approach Based on MultiAgent System for Indexing and c06/2019 a145-1630 v173 a

: 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’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’ 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

1 aZouaoui, Samia1 aRezeg, Khaled uhttp://dline.info/fpaper/jdim/v17i3/jdimv17i3_4.pdf02292nas a2200181 4500008004100000245007300041210006900114260001200183300001200195490000700207520175500214100001801969700002001987700001702007700001502024700001502039856005602054 2019 eng d00aOptimization of Topic Recognition Model for News Texts Based on LDA-0 aOptimization of Topic Recognition Model for News Texts Based on  c10/2019 a257-2690 v173 a

 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.

1 aWang, Hongbin1 aWang, Jianxiong1 aZhang, Yafei1 aWang, Meng1 aMao, Cunli uhttp://dline.info/fpaper/jdim/v17i5/jdimv17i5_1.pdf01465nas a2200157 4500008004100000245009200041210006900133260001200202300001200214490000700226520095500233100001801188700002501206700002001231856005601251 2019 eng d00aPrediction of Reviews Rating: A Survey of Methods, Techniques and Hybrid Architectures-0 aPrediction of Reviews Rating A Survey of Methods Techniques and  c06/2019 a164-1780 v173 a

 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.

1 aHarrag, Fouzi1 aAlsalman, Abdulmalik1 aAlqahtani, Alaa uhttp://dline.info/fpaper/jdim/v17i3/jdimv17i3_5.pdf01432nas a2200145 4500008004100000245006400041210006300105260001200168300001200180490000700192520099300199100001801192700002001210856005601230 2019 eng d00aSubjective Sentiment Analysis for Arabic Newswire Comments-0 aSubjective Sentiment Analysis for Arabic Newswire Comments c10/2019 a289-2950 v173 a

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ï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’ sentiment from written text. Experimental results showed that n-gram features could substantially improve performance; and showed that the Multinomial Naï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.

1 aBessou, Sadik1 aAberkane, Rania uhttp://dline.info/fpaper/jdim/v17i5/jdimv17i5_3.pdf00502nas a2200157 4500008004100000245009100041210006900132260001200201300001200213490000700225100002000232700001600252700002000268700001900288856003700307 2019 eng d00aA Survey on Vehicular Ad-Hoc Networks Routing Protocols: Classification and Challenges0 aSurvey on Vehicular AdHoc Networks Routing Protocols Classificat c08/2019 a227-2440 v171 aNadia, TASSOULT1 aMourad, MAD1 aHamouma, MOUMEN1 aHamoudi, KALLA uhttps://dline.info/newl/node/72101848nas a2200169 4500008004100000245009200041210006900133260001200202300001200214490000700226520131300233100002001546700001701566700002001583700001901603856005601622 2019 eng d00aA Survey on Vehicular Ad-Hoc Networks Routing Protocols: Classification and Challenges-0 aSurvey on Vehicular AdHoc Networks Routing Protocols Classificat c08/2019 a227-2440 v173 a

The Vehicle ad hoc Networks (VANET) are attracting more and more manufacturers and researchers’ 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.

1 aNadia, TASSOULT1 aMourad, AMAD1 aHamouma, MOUMEN1 aHamoudi, KALLA uhttp://dline.info/fpaper/jdim/v17i4/jdimv17i4_4.pdf01686nas a2200169 4500008004100000245011100041210006900152260001200221300001200233490000700245520110200252100003001354700002201384700002901406700002501435856005601460 2019 eng d00aTemporal Trends Analysis for Dengue Outbreak and Network Threats Severity Prediction Accuracy Improvement-0 aTemporal Trends Analysis for Dengue Outbreak and Network Threats c06/2019 a122-1320 v173 a

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’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.

1 aSharef, Nurfadhlina, Mohd1 aHusin, Nor, Azura1 aKasmiran, Khairul, Azhar1 aNinggal, Mohd, Izuan uhttp://dline.info/fpaper/jdim/v17i3/jdimv17i3_2.pdf00568nas a2200157 4500008004100000245011100041210006900152260001200221300000800233490000700241100003000248700002200278700002900300700002500329856005600354 2019 eng d00aTemporal Trends Analysis for Dengue Outbreak and Network Threats Severity Prediction Accuracy Improvement-0 aTemporal Trends Analysis for Dengue Outbreak and Network Threats c06/2019 a1320 v171 aSharef, Nurfadhlina, Mohd1 aHusin, Nor, Azura1 aKasmiran, Khairul, Azhar1 aNinggal, Mohd, Izuan uhttp://dline.info/fpaper/jdim/v17i3/jdimv17i3_2.pdf00502nas a2200157 4500008004100000245007800041210006900119260001200188490000700200100002200207700002100229700001800250700001900268700002000287856003700307 2019 eng d00aViscovery: Trend Tracking in Opinion Forums based on Dynamic Topic Models0 aViscovery Trend Tracking in Opinion Forums based on Dynamic Topi c02/20190 v191 aEspinoza, Ignacio1 aMendoza, Marcelo1 aOrtega, Pablo1 aRivera, Daniel1 aWeiss, Fernanda uhttps://dline.info/newl/node/70600883nas a2200181 4500008004100000245007900041210006900120260001200189300001000201490000700211520035700218100002200575700000500597700001800602700000500620700002000625856005600645 2019 eng d00aViscovery: Trend Tracking in Opinion Forums based on Dynamic Topic Models-0 aViscovery Trend Tracking in Opinion Forums based on Dynamic Topi c02/2019 a13-240 v173 a

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.

1 aEspinoza, Ignacio1 a1 aOrtega, Pablo1 a1 aWeiss, Fernanda uhttp://dline.info/fpaper/jdim/v17i1/jdimv17i1_2.pdf00420nas a2200133 4500008004100000245006600041210006600107260001200173490000700185100002200192700001600214700001900230856003700249 2019 eng d00aWeb Service Selection Approach Based on Agent and Fuzzy Logic0 aWeb Service Selection Approach Based on Agent and Fuzzy Logic c02/20190 v191 aBelouaar, Houcine1 aKazar, Okba1 aKabachi, Nadia uhttps://dline.info/newl/node/70502139nas a2200157 4500008004100000245006700041210006600108260001200174300000900186490000700195520166600202100002201868700001601890700001901906856005601925 2019 eng d00aWeb Service Selection Approach Based on Agent and Fuzzy Logic-0 aWeb Service Selection Approach Based on Agent and Fuzzy Logic c02/2019 a1-120 v173 a

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.

1 aBelouaar, Houcine1 aKazar, Okba1 aKabachi, Nadia uhttp://dline.info/fpaper/jdim/v17i1/jdimv17i1_1.pdf00425nas a2200121 4500008004100000245007300041210006900114260001200183490000700195100003300202700003100235856003700266 2019 eng d00aWebsite Localisation in the Corporate Context: A Spanish Perspective0 aWebsite Localisation in the Corporate Context A Spanish Perspect c02/20190 v191 aOlvera-Lobo, María, Dolores1 aCastillo-Rodríguez, Celia uhttps://dline.info/newl/node/70801562nas a2200145 4500008004100000245007400041210006900115260001200184300001000196490000700206520108300213100003301296700003101329856005601360 2019 eng d00aWebsite Localisation in the Corporate Context: A Spanish Perspective-0 aWebsite Localisation in the Corporate Context A Spanish Perspect c02/2019 a34-430 v173 a

 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 –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’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.

1 aOlvera-Lobo, María, Dolores1 aCastillo-Rodríguez, Celia uhttp://dline.info/fpaper/jdim/v17i1/jdimv17i1_4.pdf00451nas a2200133 4500008004100000245010200041210006900143260001200212300001000224490000600234100001900240700002100259856003700280 2018 eng d00aAnomaly Based Worm Detection Using Deterministic Finite Automata and Efficient Keygraph Technique0 aAnomaly Based Worm Detection Using Deterministic Finite Automata c06/2018 a63-730 v81 aB, Leelavathi.1 aM, Rajesh, Babu. uhttps://dline.info/newl/node/67300427nas a2200121 4500008004100000245010600041210006900147300000900216490000600225100001900231700001800250856003700268 2018 eng d00aApplication of the Fiber Image Detection Algorithm Based on the Grey System Theory and Directed Graph0 aApplication of the Fiber Image Detection Algorithm Based on the  a8-150 v91 aWang, Xiaodong1 aYang, Jianhui uhttps://dline.info/newl/node/62201419nas a2200157 4500008004100000245006700041210006700108260001200175300000900187490000600196520095700202100002701159700001601186700002201202856003701224 2018 eng d00aApplied Management Support for an Efficient WSN Infrastructure0 aApplied Management Support for an Efficient WSN Infrastructure c01/2018 a1-120 v93 a

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.

1 aKamila, Nilayam, Kumar1 aDhal, Sunil1 aNayak, Bhagirathi uhttps://dline.info/newl/node/62700497nas a2200157 4500008004100000245008100041210006900122260001200191300000800203490000600211100001700217700002700234700002100261700002000282856003700302 2018 eng d00aAre Two Emotion States Distinguishable From Each Other? An Alternative Study0 aAre Two Emotion States Distinguishable From Each Other An Altern c03/2018 a1-70 v71 aDey, Anilesh1 aAcharjee, Purnendu, B.1 aGhosh, Tanushrre1 aGogoi, Pompy, R uhttps://dline.info/newl/node/63001534nas a2200157 4500008004100000245018200041210006900223260001200292300001000304490000700314520096100321100002701282700000501309700002501314856003701339 2018 eng d00aAssimilation of Business Intelligence (BI) and Big Data Analytics (BDA) Towards Establishing Organizational Strategic Performance Management Diagnostics Framework: A Case Study-0 aAssimilation of Business Intelligence BI and Big Data Analytics  c02/2018 a22-320 v163 a

 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 – the organizational strategic diagnostic dashboard.

1 aJayakrishnan, Mailasan1 a1 aYusof, Mokhtar, Mohd uhttps://dline.info/newl/node/83500597nas a2200145 4500008004100000245018100041210006900222260001200291300000700303490000700310100002700317700002600344700002500370856005600395 2018 eng d00aAssimilation of Business Intelligence (BI) and Big Data Analytics (BDA) Towards Establishing Organizational Strategic Performance Management Diagnostics Framework: A Case Study0 aAssimilation of Business Intelligence BI and Big Data Analytics  c02/2018 a320 v161 aJayakrishnan, Mailasan1 aMohamad, Abdul, Karim1 aYusof, Mokhtar, Mohd uhttp://dline.info/fpaper/jdim/v16i1/jdimv16i1_3.pdf00461nas a2200145 4500008004100000245007200041210006900113260001200182300001200194490000600206100002200212700002200234700002200256856003700278 2018 eng d00aAutomatic Verification of Communicative Commitments using Reduction0 aAutomatic Verification of Communicative Commitments using Reduct c09/2018 a114-1280 v91 aAl-diabat, Mofleh1 aAl-saqqar, Faisal1 aAl-saqqar, Ashraf uhttps://dline.info/newl/node/69500367nas a2200109 4500008004100000245007600041210006900117300001000186490000600196100001800202856003700220 2018 eng d00aBIG DATA: Balancing between Risks and opportunities – UAE Perspective0 aBIG DATA Balancing between Risks and opportunities UAE Perspecti a37-440 v71 aHabbal, Firas uhttps://dline.info/newl/node/63800437nas a2200133 4500008004100000245008600041210006900127260001200196300001200208490000700220100002100227700001800248856003700266 2018 eng d00aBuilding a Herbal Medicine Ontology Aligned with Symptoms and Diseases Ontologies0 aBuilding a Herbal Medicine Ontology Aligned with Symptoms and Di c06/2018 a114-1260 v161 aAlkhatib, Bassel1 aBriman, Dania uhttps://dline.info/newl/node/67600778nas a2200145 4500008004100000245009000041210006900131260001200200300001200212490000700224520030600231100002100537700001800558856005600576 2018 eng d00aBuilding a Herbal Medicine Ontology Aligned with Symptoms and Diseases Ontologies –0 aBuilding a Herbal Medicine Ontology Aligned with Symptoms and Di c06/2018 a114-1260 v163 a

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.

1 aAlkhatib, Bassel1 aBriman, Dania uhttp://dline.info/fpaper/jdim/v16i3/jdimv16i3_2.pdf00403nas a2200121 4500008004100000245008900041210006900130260001200199300001200211490000700223100001400230856003700244 2018 eng d00aCloud Computing Intrusion Detection Using Artificial Bee Colony-BP Network Algorithm0 aCloud Computing Intrusion Detection Using Artificial Bee ColonyB c08/2018 a203-2090 v161 aHui, Yang uhttps://dline.info/newl/node/68901399nas a2200133 4500008004100000245009000041210006900131260001200200300001200212490000700224520096400231100001401195856005601209 2018 eng d00aCloud Computing Intrusion Detection Using Artificial Bee Colony-BP Network Algorithm-0 aCloud Computing Intrusion Detection Using Artificial Bee ColonyB c08/2018 a203-2090 v163 a

 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’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.

1 aHui, Yang uhttp://dline.info/fpaper/jdim/v16i4/jdimv16i4_5.pdf00449nas a2200133 4500008004100000245009900041210006900140300001000209490000600219100001600225700001700241700002000258856003700278 2018 eng d00aA Comparative Analysis of the Efficiency of Video Reader Object for Frame Extraction in MATLAB0 aComparative Analysis of the Efficiency of Video Reader Object fo a16-210 v91 aNachamai, M1 aPaulose, Joy1 aMarandi, Samuel uhttps://dline.info/newl/node/62301424nas a2200145 4500008004100000245009600041210006900137260001200206300001200218490000700230520097000237100001501207700001901222856003701241 2018 eng d00aContent Based Text Information Search and Retrieval in Document Images for Digital Library-0 aContent Based Text Information Search and Retrieval in Document  c06/2018 a136-1510 v163 a

 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’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’s needs, becomes very essential in nowadays. Traditionally Optical Character Recognition (OCR) tools are used for information retrieval from the document images, but it’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.

1 aSakila, A.1 aVijayarani, S. uhttps://dline.info/newl/node/82800431nas a2200133 4500008004100000245009500041210006900136260001200205300001200217490000700229100000500236700001900241856003700260 2018 eng d00aContent Based Text Information Search and Retrieval in Document Images for Digital Library0 aContent Based Text Information Search and Retrieval in Document  c06/2018 a136-1510 v161 a1 aVijayarani, S. uhttps://dline.info/newl/node/67800462nas a2200133 4500008004100000245010300041210006900144260001200213300001000225490000600235100002500241700002500266856003700291 2018 eng d00aA Cross-Layered Approach for Improving Quality of Service of Video Transmission in Ad-hoc Networks0 aCrossLayered Approach for Improving Quality of Service of Video  c06/2018 a48-550 v91 aAli, Mohammed, Yasin1 aAhmed, Syed, Musthak uhttps://dline.info/newl/node/66700445nas a2200133 4500008004100000245009700041210006900138260001200207300001000219490000600229100002000235700001900255856003700274 2018 eng d00aData Fusion Techniques in Wireless Sensor Networks: Structured Vs. Structure-Free Approaches0 aData Fusion Techniques in Wireless Sensor Networks Structured Vs c06/2018 a41-470 v91 aKoupaee, Mahnaz1 aReza, Mohammad uhttps://dline.info/newl/node/66601053nas a2200157 4500008004100000245007900041210006900120260001200189300000700201490000700208520056300215100002100778700001800799700002200817856005600839 2018 eng d00aData Quality Measures and Data Cleansing for Research Information Systems-0 aData Quality Measures and Data Cleansing for Research Informatio c02/2018 a210 v163 a

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.

1 aAzeroual, Otmane1 aSaake, Gunter1 aAbuosba, Mohammad uhttp://dline.info/fpaper/jdim/v16i1/jdimv16i1_2.pdf00477nas a2200145 4500008004100000245007800041210006900119260001200188300000700200490000700207100002100214700001800235700002200253856005600275 2018 eng d00aData Quality Measures and Data Cleansing for Research Information Systems0 aData Quality Measures and Data Cleansing for Research Informatio c02/2018 a210 v161 aAzeroual, Otmane1 aSaake, Gunter1 aAbuosba, Mohammad uhttp://dline.info/fpaper/jdim/v16i1/jdimv16i1_2.pdf00513nas a2200145 4500008004100000245011200041210006900153260001200222300000900234490000600243100002600249700003000275700002500305856003700330 2018 eng d00aDesign and Development of Bi-Directional IoT Gateway using ZigBee and Wi-Fi Technologies with MQTT Protocol0 aDesign and Development of BiDirectional IoT Gateway using ZigBee c03/2018 a1-110 v81 aPopuri, Gopi, Krishna1 aKavuluri, Srinivasa, Ravi1 aKommuri, Krishnaveni uhttps://dline.info/newl/node/63300506nas a2200157 4500008004100000245009100041210006900132260001200201300001000213490000700223100001800230700002000248700001800268700002500286856003700311 2018 eng d00aDesign and Development of IoT enabled Multi Robot System for Search and Rescue Mission0 aDesign and Development of IoT enabled Multi Robot System for Sea c06/2018 a51-630 v101 aSingh, Rajesh1 aSamkaria, Rohit1 aGehlot, Anita1 aChoudhary, Sushabhan uhttps://dline.info/newl/node/68001815nas a2200157 4500008004100000245005000041210005000091260001200141300000700153490000600160520136600166100002801532700002001560700001901580856005801599 2018 eng d00aDeveloping Mobile Apps to Protect Environment0 aDeveloping Mobile Apps to Protect Environment c01/2018 a100 v93 a

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.

1 aRinea, Iulia, Georgiana1 aFlorea, Delilah1 aFlorea, Adrian uhttp://www.dline.info/jet/fulltext/v9n1/jetv9n1_1.pdf01767nas a2200157 4500008004100000245011700041210006900158260001200227300001200239490000700251520123700258100001901495700002101514700001801535856005601553 2018 eng d00aDevelopment of an Adaptive Collaborative Serious Game Based on Learning Style, Using Trace and Agent Technology-0 aDevelopment of an Adaptive Collaborative Serious Game Based on L c06/2018 a127-1350 v163 a

: 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.

1 aBoufera, Hadya1 aBendella, Fatima1 asehaba, Karim uhttp://dline.info/fpaper/jdim/v16i3/jdimv16i3_3.pdf00498nas a2200145 4500008004100000245011600041210006900157260001200226300001200238490000700250100001900257700002100276700001800297856003700315 2018 eng d00aDevelopment of an Adaptive Collaborative Serious Game Based on Learning Style, Using Trace and Agent Technology0 aDevelopment of an Adaptive Collaborative Serious Game Based on L c06/2018 a127-1350 v161 aBoufera, Hadya1 aBendella, Fatima1 asehaba, Karim uhttps://dline.info/newl/node/67700516nas a2200145 4500008004100000245011400041210006900155300000900224490000600233100002100239700002100260700002200281700003000303856003700333 2018 eng d00aDevelopment of an Integrated Model for Successful Adoption of Management Information Systems in Organizations0 aDevelopment of an Integrated Model for Successful Adoption of Ma a1-270 v71 aAl-Mamary, Yaser1 aAl-nashmi, Murad1 aShamsuddin, Alina1 aHassan, Yahya, Abdul Ghaf uhttps://dline.info/newl/node/63600456nas a2200133 4500008004100000245010500041210006900146260001200215300001000227490000600237100002000243700002200263856003700285 2018 eng d00aDimensions of Changeability of Futuristic Organizations: Need of Organizations in Change Environment0 aDimensions of Changeability of Futuristic Organizations Need of  c06/2018 a51-620 v81 aJalalian, Najme1 aGramipour, Masoud uhttps://dline.info/newl/node/67201520nas a2200157 4500008004100000245010200041210006900143260001200212300001000224490000700234520099000241100002701231700002701258700002101285856005601306 2018 eng d00aEfficient Management of Community Question Answering Sites using Improved Spectral Clustering –0 aEfficient Management of Community Question Answering Sites using c04/2018 a76-840 v163 a

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.

1 aSingh, Abhishek, Kumar1 aNagwani, Naresh, Kumar1 aPandey, Sudhakar uhttp://dline.info/fpaper/jdim/v16i2/jdimv16i2_3.pdf00495nas a2200145 4500008004100000245009800041210006900139260001200208300001000220490000700230100002700237700002700264700002100291856003700312 2018 eng d00aEfficient Management of Community Question Answering Sites using Improved Spectral Clustering0 aEfficient Management of Community Question Answering Sites using c04/2018 a76-840 v161 aSingh, Abhishek, Kumar1 aNagwani, Naresh, Kumar1 aPandey, Sudhakar uhttps://dline.info/newl/node/65300424nas a2200133 4500008004100000245008100041210006900122260001200191300001000203490000600213100001500219700001900234856003700253 2018 eng d00aEmotional Intelligence: A Valuable Contrivance for Analyzing Emotional Facet0 aEmotional Intelligence A Valuable Contrivance for Analyzing Emot c06/2018 a58-690 v81 aMir, Aasim1 aSehgal, Gaurav uhttps://dline.info/newl/node/67000471nas a2200121 4500008004100000245015300041210006900194260001200263300001000275490000600285100002100291856003700312 2018 eng d00aAn Empirical Study to Develop a Decision Support System (DSS) for Measuring the Impact of Quality Measurements over Agile Software Development (ASD)0 aEmpirical Study to Develop a Decision Support System DSS for Mea c03/2018 a27-430 v81 aAlshareet, Osama uhttps://dline.info/newl/node/65000425nas a2200121 4500008004100000245010800041210006900149260001200218300001000230490000600240100002000246856003700266 2018 eng d00aAn Empirical Study to Understanding Students’ Continuance Intention Use of Multimedia Online Learning0 aEmpirical Study to Understanding Students Continuance Intention  c06/2018 a60-690 v91 aHariguna, Taqwa uhttps://dline.info/newl/node/66500406nas a2200133 4500008004100000245005600041210005600097260001200153300001200165490000700177100002800184700002300212856003700235 2018 eng d00aExploiting Links to Improve Search in XML Documents0 aExploiting Links to Improve Search in XML Documents c08/2018 a169-1790 v161 aBerchiche-Fellag, Samia1 aMezghiche, Mohamed uhttps://dline.info/newl/node/68600906nas a2200145 4500008004100000245005700041210005600098260001200154300001200166490000700178520046800185100002800653700002300681856005600704 2018 eng d00aExploiting Links to Improve Search in XML Documents-0 aExploiting Links to Improve Search in XML Documents c08/2018 a169-1790 v163 a

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.

1 aBerchiche-Fellag, Samia1 aMezghiche, Mohamed uhttp://dline.info/fpaper/jdim/v16i4/jdimv16i4_2.pdf00448nas a2200121 4500008004100000245012200041210006900163300001000232490000600242100002400248700001700272856003700289 2018 eng d00aA Framework for Big Data Pre-processing and Search Optimization Using Hmga-aco: A Hierarchical Optimization Approach-0 aFramework for Big Data Preprocessing and Search Optimization Usi a10-250 v71 aSatish, K., V. Rama1 aKavya, N., P uhttps://dline.info/newl/node/62500565nas a2200181 4500008004100000245008900041210006900130260001200199300001000211490000600221100001800227700002200245700002100267700002300288700001800311700001700329856003700346 2018 eng d00aFrom Words to Emoticons: Deep Emotion Recognition in Text and Its Wider Implications0 aFrom Words to Emoticons Deep Emotion Recognition in Text and Its c03/2018 a10-260 v91 aRzepka, Rafal1 aTakizawa, Mitsuru1 aVallverdu, Jordi1 aPtaszynski, Michal1 aDybala, Pawel1 aAraki, Kenji uhttps://dline.info/newl/node/65700478nas a2200157 4500008004100000245007000041210006900111260001200180300001000192490000600202100002000208700002100228700001600249700001800265856003700283 2018 eng d00aFusion Model for Traffic Sign Detection, Tracking and Recognition0 aFusion Model for Traffic Sign Detection Tracking and Recognition c06/2018 a72-790 v81 aDhingra, Hubham1 aDiwakar, Shalini1 aSaranya, G.1 aKumar, Manish uhttps://dline.info/newl/node/68400494nas a2200157 4500008004100000245008000041210006900121260001200190300001000202490000600212100001900218700002300237700002100260700001800281856003700299 2018 eng d00aFuture Reference Sentence Extraction in Support of Future Event Prediction-0 aFuture Reference Sentence Extraction in Support of Future Event  c03/2018 a27-410 v91 aNakajima, Yoko1 aPtaszynski, Michal1 aHonma, Hirotoshi1 aMasui, Fumito uhttps://dline.info/newl/node/65800431nas a2200133 4500008004100000245008700041210006900128260001200197300000800209490000600217100001900223700001800242856003700260 2018 eng d00aGAIT Biometric Recognition Using Direct Classification, TSVM, SVM & Neural Network0 aGAIT Biometric Recognition Using Direct Classification TSVM SVM  c03/2018 a1-70 v81 aKumar, Senthil1 aKathiresan, V uhttps://dline.info/newl/node/63900457nas a2200133 4500008004100000245010900041210006900150260001200219300001000231490000600241100001700247700002200264856003700286 2018 eng d00aGreen Practices for Sustainable Development: A Study on Readymade Garment (RMG) Industries of Bangladesh0 aGreen Practices for Sustainable Development A Study on Readymade c06/2018 a70-750 v81 aSaha, Bijeta1 aRakibulHoque, Md. uhttps://dline.info/newl/node/67100429nas a2200133 4500008004100000245006100041210006100102260001200163300001000175490000600185100003300191700003400224856003700258 2018 eng d00aHealth Care Monitoring Using Wifi Through Mobile Devices0 aHealth Care Monitoring Using Wifi Through Mobile Devices c02/2018 a18-250 v91 aGogineni, Krishna, Chaitanya1 aUppuluri, Lakshmi, Soundharya uhttps://dline.info/newl/node/66100448nas a2200133 4500008004100000245010600041210006900147260001200216300001100228490000600239100001700245700001500262856003700277 2018 eng d00aA Hybrid Feature Selection Algorithm Based on Information Gain and Sequential Forward Floating Search0 aHybrid Feature Selection Algorithm Based on Information Gain and c09/2018 a93-1010 v91 aDing, Jianli1 aFu, Liyang uhttps://dline.info/newl/node/69300439nas a2200133 4500008004100000245009500041210006900136260001200205300000900217490000600226100001800232700001800250856003700268 2018 eng d00aHybrid Multi-Criteria Decision Making Approach for Product Ranking Using Customers Reviews0 aHybrid MultiCriteria Decision Making Approach for Product Rankin c03/2018 a1-170 v81 aKumar, Rakesh1 aSharan, Aditi uhttps://dline.info/newl/node/64800452nas a2200133 4500008004100000245010000041210006900141260001200210300001000222490000700232100001600239700002600255856003700281 2018 eng d00aICT Green Alignment: New Generation Model Based on Corporate Social Responsibility and Green IT0 aICT Green Alignment New Generation Model Based on Corporate Soci c06/2018 a64-730 v101 aHba, Rachid1 aManouar, Abdellah, El uhttps://dline.info/newl/node/68100460nas a2200157 4500008004100000245006400041210006300105260001200168300001200180490000600192100002100198700002500219700000500244700001600249856003700265 2018 eng d00aIdentification of Sunspots on SODISM Full-Disk Solar Images0 aIdentification of Sunspots on SODISM FullDisk Solar Images c09/2018 a102-1110 v91 aAlasta, Amro, F.1 aAlgamudi, Abdulrazag1 a1 aIpson, Stan uhttps://dline.info/newl/node/69200428nas a2200121 4500008004100000245010600041210006900147260001200216300000900228490000600237100002600243856003700269 2018 eng d00aImplement Efficient Route Discovery of Broadcasting Technique in Moving Object Detection and Tracking0 aImplement Efficient Route Discovery of Broadcasting Technique in c03/2018 a8-160 v71 aThangaraj, Mahalingam uhttps://dline.info/newl/node/63100510nas a2200157 4500008004100000245006700041210006700108260001200175300001000187490000600197100002600203700002700229700002900256700003000285856003700315 2018 eng d00aInformative Frame Automated Extraction from Colonoscopy Videos0 aInformative Frame Automated Extraction from Colonoscopy Videos c03/2018 a15-260 v81 aArcila-Diaz, Juan, C.1 aTuesta-Monteza, Victor1 aMejia-Cabrera, Heber, I.1 aTrujillo-Uribe, Maria, P. uhttps://dline.info/newl/node/64100359nas a2200109 4500008004100000245007500041210006900116260001200185300000800197490000700205856003700212 2018 eng d00aInmate OS and VMM based Secured Virtualization for Cloud Encompassment0 aInmate OS and VMM based Secured Virtualization for Cloud Encompa c03/2018 a1-70 v10 uhttps://dline.info/newl/node/64501414nas a2200157 4500008004100000245008900041210006900130260001200199300001200211490000700223520091900230100002501149700002101174700000501195856005601200 2018 eng d00a Intellectual Capital as a Core Competency for Competitive Advantage: A Case Study-0 aIntellectual Capital as a Core Competency for Competitive Advant c08/2018 a192-2020 v163 a

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.

1 aMalkawi, Nazem, M.M.1 aOmari, Kalid, Al1 a uhttp://dline.info/fpaper/jdim/v16i4/jdimv16i4_4.pdf00437nas a2200133 4500008004100000245008600041210006900127300001200196490000700208100002500215700002100240700000500261856003700266 2018 eng d00aIntellectual Capital as a Core Competency for Competitive Advantage: A Case Study0 aIntellectual Capital as a Core Competency for Competitive Advant a192-2020 v161 aMalkawi, Nazem, M.M.1 aOmari, Kalid, Al1 a uhttps://dline.info/newl/node/68801755nas a2200145 4500008004100000245007700041210006900118260001200187300001000199490000700209520129500216100002101511700002101532856005601553 2018 eng d00aIntelligent Semantic Case Based Reasoning System for Fault Diagnosis –0 aIntelligent Semantic Case Based Reasoning System for Fault Diagn c04/2018 a53-630 v163 a

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.

1 aAdla, Abdelkader1 aBen Bella, Ahmed uhttp://dline.info/fpaper/jdim/v16i2/jdimv16i2_1.pdf00424nas a2200133 4500008004100000245007300041210006900114260001100183300001000194490000700204100002100211700002100232856003700253 2018 eng d00aIntelligent Semantic Case Based Reasoning System for Fault Diagnosis0 aIntelligent Semantic Case Based Reasoning System for Fault Diagn c042018 a53-630 v161 aAdla, Abdelkader1 aBen Bella, Ahmed uhttps://dline.info/newl/node/65100432nas a2200145 4500008004100000245005900041210005800100260001200158300001000170490000600180100001900186700002100205700002300226856003700249 2018 eng d00aIntention to use Mobile Wallet: Extension of TAM Model0 aIntention to use Mobile Wallet Extension of TAM Model c03/2018 a27-340 v81 aKumar, Krishna1 aSivashanmugam, C1 aVenkataraman, Ajay uhttps://dline.info/newl/node/63500460nas a2200121 4500008004100000245014000041210006900181260001200250300001200262490000600274100002100280856003700301 2018 eng d00aInterval Intuitionistic Trapezoidal Fuzzy Prioritized Aggregating Operators and their Application to Multiple Attribute Decision Making0 aInterval Intuitionistic Trapezoidal Fuzzy Prioritized Aggregatin c09/2018 a102-1130 v91 aJiang, Xian-Ping uhttps://dline.info/newl/node/69400379nas a2200109 4500008004100000245008900041210006900130300001000199490000600209100001700215856003700232 2018 eng d00aKnowledge Management: Tool for Enhancing HRM Practices and Organizational Innovation0 aKnowledge Management Tool for Enhancing HRM Practices and Organi a28-360 v71 aUddin, Mueen uhttps://dline.info/newl/node/63700457nas a2200145 4500008004100000245007900041210006900120260001200189300001200201490000700213100001600220700001700236700002100253856003700274 2018 eng d00aA Log Based Update of Replicated Profiles in Decentralized Social Networks0 aLog Based Update of Replicated Profiles in Decentralized Social  c10/2018 a230-2450 v161 aBadis, Lyes1 aAmad, Mourad1 aAïssani, Djamil uhttps://dline.info/newl/node/69801347nas a2200157 4500008004100000245008000041210006900121260001200190300001200202490000700214520086900221100000501090700001701095700002101112856005601133 2018 eng d00aA Log Based Update of Replicated Profiles in Decentralized Social Networks-0 aLog Based Update of Replicated Profiles in Decentralized Social  c10/2018 a230-2450 v163 a

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’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.

1 a1 aAmad, Mourad1 aAïssani, Djamil uhttp://dline.info/fpaper/jdim/v16i5/jdimv16i5_3.pdf01498nas a2200157 4500008004100000245009500041210006900136260001300205300001200218490000700230520097500237100002401212700002801236700002001264856005601284 2018 eng d00aMachine Learning in Predicting the Appropriate Model of Software Process Models Deviation-0 aMachine Learning in Predicting the Appropriate Model of Software c12/.2018 a308-3230 v163 a

 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 “priority and dependency of sub-activities “ 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

1 aChaghrouchni, Tarik1 aKabbaj, Issam, Mohammed1 aBakkoury, Zohra uhttp://dline.info/fpaper/jdim/v16i6/jdimv16i6_3.pdf00509nas a2200145 4500008004100000245009400041210006900135260001200204300001200216490000700228100002400235700002800259700002000287856005600307 2018 eng d00aMachine Learning in Predicting the Appropriate Model of Software Process Models Deviation0 aMachine Learning in Predicting the Appropriate Model of Software c12/2018 a308-3230 v161 aChaghrouchni, Tarik1 aKabbaj, Issam, Mohammed1 aBakkoury, Zohra uhttp://dline.info/fpaper/jdim/v16i6/jdimv16i6_3.pdf00363nas a2200121 4500008004100000245005800041210005800099260001200157300001200169490000700181100001600188856003700204 2018 eng d00aMajor Issues in Adoption of Electronic Health Records0 aMajor Issues in Adoption of Electronic Health Records c08/2018 a180-1910 v161 aYi, Myongho uhttps://dline.info/newl/node/68700844nas a2200133 4500008004100000245005900041210005800100260001200158300001200170490000700182520044900189100001600638856005600654 2018 eng d00aMajor Issues in Adoption of Electronic Health Records-0 aMajor Issues in Adoption of Electronic Health Records c08/2018 a180-1910 v163 a

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.

1 aYi, Myongho uhttp://dline.info/fpaper/jdim/v16i4/jdimv16i4_3.pdf00453nas a2200133 4500008004100000245009000041210006900131260001200200300001000212490000600222100003100228700002300259856003700282 2018 eng d00aMashup Service Implementation on Multi-cloud Environment Using Map Reduction Approach0 aMashup Service Implementation on Multicloud Environment Using Ma c03/2018 a18-260 v81 aPeddada, Venkateswara, Rao1 aMohd, Ali, Hussain uhttps://dline.info/newl/node/64900496nas a2200145 4500008004100000245011000041210006900151260001200220300001000232490000700242100002100249700002200270700002100292856003700313 2018 eng d00aMathematical Formulation for Programmers to Select Background and Foreground Colors in Designing Websites0 aMathematical Formulation for Programmers to Select Background an c06/2018 a47-500 v101 aDuvvuri, Veeresh1 aLaggoni, Srinivas1 aKaringa, Shankar uhttps://dline.info/newl/node/67900360nas a2200121 4500008004100000245005300041210005000094300001000144490000600154100002500160700001600185856003700201 2018 eng d00aMCWDF - Micro-chunk based Web Delivery Framework0 aMCWDF Microchunk based Web Delivery Framework a26-400 v71 aShivakumar, Shailesh1 aSuresh, P.V uhttps://dline.info/newl/node/62600445nas a2200133 4500008004100000245009500041210006900136260001200205300001000217490000600227100002000233700002100253856003700274 2018 eng d00aMeasuring Software Architecture Stability Evolution in Object-oriented Open Source Systems0 aMeasuring Software Architecture Stability Evolution in Objectori c06/2018 a35-480 v91 aAlmousa, Hassan1 aAlenezi, Mamdouh uhttps://dline.info/newl/node/66300831nas a2200133 4500008004100000245006800041210006700109260001200176300000900188490000700197520041900204100001800623856005600641 2018 eng d00aMining of Social Networks from Classic Books and Visualization-0 aMining of Social Networks from Classic Books and Visualization c02/2018 a1-110 v163 a

 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.

1 aLim, SeungJin uhttp://dline.info/fpaper/jdim/v16i1/jdimv16i1_1.pdf00399nas a2200121 4500008004100000245006700041210006700108260001200175300000700187490000700194100002000201856005600221 2018 eng d00aMining of Social Networks from Classic Books and Visualization0 aMining of Social Networks from Classic Books and Visualization c02/2018 a120 v161 aLim, Seung, Jin uhttp://dline.info/fpaper/jdim/v16i1/jdimv16i1_1.pdf00446nas a2200133 4500008004100000245008900041210006900130260001200199300001100211490000600222100001900228700002800247856003700275 2018 eng d00aA Mixed Chaotic-cellular Automata Based Encryption Scheme for Compressed Jpeg Images0 aMixed Chaoticcellular Automata Based Encryption Scheme for Compr c09/2018 a88-1010 v91 aBeniani, Rabab1 aFARAOUN, Kamel, Mohamed uhttps://dline.info/newl/node/69100452nas a2200145 4500008004100000245006200041210006000103260001200163300001200175490000700187100002000194700001600214700002000230856005600250 2018 eng d00aModel Integration Approach from SysML to MATLAB/Simulink-0 aModel Integration Approach from SysML to MATLABSimulink c12/2018 a289-3070 v161 aCHABIBI, Bassim1 aANWAR, Adil1 aNASSAR, Mahmoud uhttp://dline.info/fpaper/jdim/v16i6/jdimv16i6_2.pdf01771nas a2200157 4500008004100000245006200041210006000103260001200163300001200175490000700187520130700194100002001501700001601521700002001537856005601557 2018 eng d00aModel Integration Approach from SysML to MATLAB/Simulink-0 aModel Integration Approach from SysML to MATLABSimulink c12/2018 a289-3070 v163 a

In system engineering process, descriptive system models seem to be insufficient in order to perform a system verification which fulfils various stakeholders’ 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 

1 aCHABIBI, Bassim1 aANWAR, Adil1 aNASSAR, Mahmoud uhttp://dline.info/fpaper/jdim/v16i6/jdimv16i6_2.pdf00493nas a2200145 4500008004100000245010400041210006900145300000800214490000600222100002600228700001700254700001900271700002000290856003700310 2018 eng d00aModel of “International Megalesson” of Learning Programming in Schools of Russia and Kazakhstan0 aModel of International Megalesson of Learning Programming in Sch a1-90 v71 aAkkassynova, Zhamilya1 aPak, Nikolay1 aIvkina, Liubov1 aRomanov, Dmitry uhttps://dline.info/newl/node/62400509nas a2200157 4500008004100000245009500041210006900136260001200205300000900217490000600226100002200232700002000254700002100274700001900295856003700314 2018 eng d00aA MultiCriteria Spatial WEB Decision Support System for Hazardous Materials Road Transport0 aMultiCriteria Spatial WEB Decision Support System for Hazardous  c02/2018 a1-200 v61 aHamdadou, Djamila1 aAlnafie, Emdjed1 aBouamrane, Karim1 aBehilil, Ikram uhttps://dline.info/newl/node/64200479nas a2200145 4500008004100000245007200041210006900113260001100182300001000193490000600203100002100209700002600230700001900256856005800275 2018 eng d00aNDSOM: Self Organizing Maps Learning Approach to Extract Noisy Data0 aNDSOM Self Organizing Maps Learning Approach to Extract Noisy Da c3/2018 a24-320 v91 aChaudhary, Vikas1 aDelbu, Mesfin, Jariso1 aBhatia, R., S. uhttp://www.dline.info/jic/fulltext/v9n1/jicv9n1_3.pdf01097nas a2200121 4500008004100000245008800041210006900129300001000198490000600208520070200214100002200916856003700938 2018 eng d00aNetwork Intrusion Detection by using Particle Swarm Optimization and Neural Network0 aNetwork Intrusion Detection by using Particle Swarm Optimization a22-300 v93 a

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.

1 aChangsheng, Xiang uhttps://dline.info/newl/node/62901752nas a2200169 4500008004100000245008000041210006900121260001000190300001200200490000700212520123000219100002001449700001601469700001901485700002201504856005601526 2018 eng d00aNew approach for intrusion detection in Big Data as a service in the Cloud-0 aNew approach for intrusion detection in Big Data as a service in c10/12 a258-2700 v163 a

 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.

1 aKassimi, Dounya1 aKazar, Okba1 aBoussaid, Omar1 aMerizig, Abdelhak uhttp://dline.info/fpaper/jdim/v16i5/jdimv16i5_5.pdf00492nas a2200157 4500008004100000245007900041210006900120260001200189300001200201490000700213100002000220700001600240700001900256700002200275856003700297 2018 eng d00aNew approach for intrusion detection in Big Data as a service in the Cloud0 aNew approach for intrusion detection in Big Data as a service in c10/2018 a258-2710 v161 aKassimi, Dounya1 aKazar, Okba1 aBoussaid, Omar1 aMerizig, Abdelhak uhttps://dline.info/newl/node/70000422nas a2200133 4500008004100000245007500041210006900116260001200185300001000197490000600207100002300213700001500236856003700251 2018 eng d00aNew Ideas for Applying Ant Colony Optimization to the Protein Function0 aNew Ideas for Applying Ant Colony Optimization to the Protein Fu c06/2018 a74-810 v81 aG, Mohana, Prabha.1 aS, Chitra. uhttps://dline.info/newl/node/67400493nas a2200181 4500008004100000245005700041210005500098260001200153300001200165490000700177100001700184700001700201700001600218700001500234700001200249700001300261856003700274 2018 eng d00aA New Look at the TOR Anonymous Communication System0 aNew Look at the TOR Anonymous Communication System c10/2018 a223-2290 v161 aAhmad, Imran1 aSaddique, M.1 aPirzada, U.1 aZohaib, M.1 aAli, A.1 aKhan, M. uhttps://dline.info/newl/node/69701304nas a2200193 4500008004100000245005800041210005500099260001200154300001200166490000700178520080900185100001700994700000501011700000501016700001501021700000501036700001301041856005601054 2018 eng d00aA New Look at the TOR Anonymous Communication System-0 aNew Look at the TOR Anonymous Communication System c10/2018 a223-2290 v163 a

 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’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.

1 aAhmad, Imran1 a1 a1 aZohaib, M.1 a1 aKhan, M. uhttp://dline.info/fpaper/jdim/v16i5/jdimv16i5_2.pdf00496nas a2200157 4500008004100000245009300041210006900134300001200203490000700215100001500222700002100237700001300258700001500271700001500286856003700301 2018 eng d00aA Noise-Robust Image Encryption Algorithm Based on Hyper Chaotic Cellular Neural Network0 aNoiseRobust Image Encryption Algorithm Based on Hyper Chaotic Ce a246-2570 v161 aHu, Gangyi1 aYuenyong, Sumeth1 aQu, Jian1 aRong, Jian1 aKou, Weili uhttps://dline.info/newl/node/69901668nas a2200181 4500008004100000245009400041210006900135260001200204300001200216490000700228520113100235100001501366700002101381700001301402700000501415700001501420856005101435 2018 eng d00aA Noise-Robust Image Encryption Algorithm Based on Hyper Chaotic Cellular Neural Network-0 aNoiseRobust Image Encryption Algorithm Based on Hyper Chaotic Ce c10/2018 a246-2570 v153 a

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.

1 aHu, Gangyi1 aYuenyong, Sumeth1 aQu, Jian1 a1 aKou, Weili uhttps://doi.org/10.6025/jdim/2018/16/5/246-25700463nas a2200145 4500008004100000245008000041210006900121260001200190300001000202490000700212100001900219700001800238700002400256856003700280 2018 eng d00aNon-words Spell Corrector of Social Media Data in Message Filtering Systems0 aNonwords Spell Corrector of Social Media Data in Message Filteri c04/2018 a64-750 v161 aWint, Zar, Zar1 aDucros, Théo1 aAritsugi, Masayoshi uhttps://dline.info/newl/node/65201305nas a2200157 4500008004100000245008500041210006900126260001200195300001000207490000700217520083300224100000501057700000501062700002401067856005601091 2018 eng d00a Non-words Spell Corrector of Social Media Data in Message Filtering Systems –0 aNonwords Spell Corrector of Social Media Data in Message Filteri c04/2018 a64-750 v163 a

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.

1 a1 a1 aAritsugi, Masayoshi uhttp://dline.info/fpaper/jdim/v16i2/jdimv16i2_2.pdf00428nas a2200133 4500008004100000245007900041210006900120260001200189300001200201490000700213100001900220700001800239856003700257 2018 eng d00aA Novel Framework for Context-aware Outlier Detection in Big Data Streams-0 aNovel Framework for Contextaware Outlier Detection in Big Data S c10/2018 a213-2220 v161 aAhmad, Hussien1 aDowaji, Salah uhttps://dline.info/newl/node/69602165nas a2200145 4500008004100000245007900041210006900120260001200189300001200201490000700213520170600220100001901926700001801945856005601963 2018 eng d00aA Novel Framework for Context-aware Outlier Detection in Big Data Streams-0 aNovel Framework for Contextaware Outlier Detection in Big Data S c10/2018 a213-2220 v163 a

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.

1 aAhmad, Hussien1 aDowaji, Salah uhttp://dline.info/fpaper/jdim/v16i5/jdimv16i5_1.pdf00452nas a2200133 4500008004100000245009800041210006900139260001200208300001000220490000600230100002900236700001600265856003700281 2018 eng d00aA Novel Node Integrity Based Authentication Model For Dynamic Wireless Communication Networks0 aNovel Node Integrity Based Authentication Model For Dynamic Wire c03/2018 a17-330 v71 aBandanatham, Madhuravani1 aMurthy, DSR uhttps://dline.info/newl/node/63200422nas a2200121 4500008004100000245010900041210006900150260001200219300001000231490000600241100001600247856003700263 2018 eng d00aOne-layer Neural Network for Solving Least Absolute Deviation Problems with Box and Equality Constraints0 aOnelayer Neural Network for Solving Least Absolute Deviation Pro c06/2018 a57-710 v81 aLi, Cuiping uhttps://dline.info/newl/node/68300987nas a2200145 4500008004100000245004500041210004400086260001200130300001000142490000700152520058400159100002100743700002100764856005600785 2018 eng d00aOntology Matching as Regression Problem-0 aOntology Matching as Regression Problem c02/2018 a33-420 v163 a

 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.

1 aAlboukaey, Nadia1 aJoukhadar, Ammar uhttp://dline.info/fpaper/jdim/v16i1/jdimv16i1_4.pdf00387nas a2200133 4500008004100000245004400041210004400085260001200129300000700141490000700148100002100155700002100176856005600197 2018 eng d00aOntology Matching as Regression Problem0 aOntology Matching as Regression Problem c02/2018 a420 v161 aAlboukaey, Nadia1 aJoukhadar, Ammar uhttp://dline.info/fpaper/jdim/v16i1/jdimv16i1_4.pdf00407nas a2200121 4500008004100000245008900041210006900130260001200199300001200211490000700223100001800230856003700248 2018 eng d00aOptimal Web Service Selection Model using Fuzzy Extended AHP and Weighted Sum Method0 aOptimal Web Service Selection Model using Fuzzy Extended AHP and c08/2018 a157-1680 v161 aKohar, Rachna uhttps://dline.info/newl/node/68501399nas a2200133 4500008004100000245009000041210006900131260001200200300001200212490000700224520096000231100001801191856005601209 2018 eng d00aOptimal Web Service Selection Model using Fuzzy Extended AHP and Weighted Sum Method-0 aOptimal Web Service Selection Model using Fuzzy Extended AHP and c08/2018 a157-1680 v163 a

 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’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.

1 aKohar, Rachna uhttp://dline.info/fpaper/jdim/v16i4/jdimv16i4_1.pdf00518nas a2200169 4500008004100000245006400041210006400105260001100169300000800180490000700188100003100195700001900226700002100245700002100266700000500287856005600292 2018 eng d00aParking System Development Using Extreme Programming Method0 aParking System Development Using Extreme Programming Method c122018 a2880 v161 aAndry, Johannes, Fernandes1 aJuliawan, Gary1 aChristian, Yosua1 aLeonardo, Jeffry1 a uhttp://dline.info/fpaper/jdim/v16i6/jdimv16i6_1.pdf01943nas a2200181 4500008004100000245006500041210006400106260001200170300001200182490000700194520140700201100003101608700001901639700002101658700002101679700000501700856005601705 2018 eng d00aParking System Development Using Extreme Programming Method-0 aParking System Development Using Extreme Programming Method c12/2018 a279-2880 v163 a

 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.

1 aAndry, Johannes, Fernandes1 aJuliawan, Gary1 aChristian, Yosua1 aLeonardo, Jeffry1 a uhttp://dline.info/fpaper/jdim/v16i6/jdimv16i6_1.pdf00481nas a2200133 4500008004100000245012600041210006900167260001200236300001000248490000600258100001800264700002800282856003700310 2018 eng d00aPerformance Measure and Analysis of MPLS and conventional IP network through VoIP: Effect in Video and Audio transmission0 aPerformance Measure and Analysis of MPLS and conventional IP net c06/2018 a56-650 v91 aOubaha, Jawad1 aEz-zahout, Abderrahmane uhttps://dline.info/newl/node/66800419nas a2200133 4500008004100000245007000041210006800111260001200179300000900191490000600200100002000206700002200226856003700248 2018 eng d00aPlay-driven Design: Model for Engaging Person as in Content Sites0 aPlaydriven Design Model for Engaging Person as in Content Sites c03/2018 a7-150 v81 aPúblio, Angelo1 aNesteriuk, Sergio uhttps://dline.info/newl/node/64000366nas a2200121 4500008004100000245006000041210005900101260001200160300001000172490000600182100001900188856003700207 2018 eng d00aPrivate Cloud for College: Architecture and Possibility0 aPrivate Cloud for College Architecture and Possibility c02/2018 a13-170 v91 aAlnuaimi, Saif uhttps://dline.info/newl/node/66000488nas a2200133 4500008004100000245013600041210006900177260001200246300001000258490000700268100002400275700001800299856003700317 2018 eng d00aQuery Expansion with Enhanced-BM25 Approach for Improving the Search Query Performance on Clustered Biomedical Literature Retrieval0 aQuery Expansion with EnhancedBM25 Approach for Improving the Sea c04/2018 a85-980 v161 aMD, ThayyabaKhatoon1 aGovardhan, A. uhttps://dline.info/newl/node/65401567nas a2200145 4500008004100000245014000041210006900181260001200250300001000262490000700272520104400279100002401323700001801347856005601365 2018 eng d00aQuery Expansion with Enhanced-BM25 Approach for Improving the Search Query Performance on Clustered Biomedical Literature Retrieval –0 aQuery Expansion with EnhancedBM25 Approach for Improving the Sea c04/2018 a86-980 v163 a

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

1 aMD, ThayyabaKhatoon1 aGovardhan, A. uhttp://dline.info/fpaper/jdim/v16i2/jdimv16i2_4.pdf00464nas a2200145 4500008004100000245009400041210006900135260001200204300001200216490000700228100002600235700000500261700001500266856003700281 2018 eng d00aQuery Optimization on Distributed Health Database DBD by Minimizing Attribute Involvement0 aQuery Optimization on Distributed Health Database DBD by Minimiz c06/2018 a105-1130 v161 aN, Slamet, Sudaryanto1 a1 aS, Maryani uhttps://dline.info/newl/node/67500432nas a2200121 4500008004100000245011700041210006900158260001200227300001000239490000600249100001800255856003700273 2018 eng d00aRain Water Harvesting Basic Need of Present Urban Sector – Use of Digital Technology for Rain Water Harvesting0 aRain Water Harvesting Basic Need of Present Urban Sector Use of  c02/2018 a21-250 v61 aGaikwad, Anil uhttps://dline.info/newl/node/64301251nas a2200133 4500008004100000245009400041210006900135300001000204490000600214520081500220100002101035700002401056856003701080 2018 eng d00aReliability, Neighborhood Discovery and Active Node Selection in Wireless Sensor Networks0 aReliability Neighborhood Discovery and Active Node Selection in  a13-210 v93 a

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.

1 aMopuru, Bhargavi1 aRao, Naga, Bhushana uhttps://dline.info/newl/node/62800380nas a2200133 4500008004100000245005200041210005200093260001200145300001000157490000600167100002000173700001600193856003700209 2018 eng d00aRound Instrumentation for Aerospace Application0 aRound Instrumentation for Aerospace Application c06/2018 a45-560 v81 aBachu, Srinivas1 aSupriya, B. uhttps://dline.info/newl/node/68200479nas a2200157 4500008004100000245009400041210006900135260001200204300001000216490000600226100001400232700001800246700001500264700000500279856003700284 2018 eng d00aSA-min: An Efficient Algorithm for Minimizing the Spread of Influence in a Social Network0 aSAmin An Efficient Algorithm for Minimizing the Spread of Influe c06/2018 a48-590 v91 aLiu, Yong1 aXie, Shengnan1 aZhang, Wei1 a uhttps://dline.info/newl/node/66400388nas a2200109 4500008004100000245009700041210006900138300000800207490000600215100002000221856003700241 2018 eng d00aSatellite Image Compression Technique Using Noise Bit Removal and Discrete Wavelet Transform0 aSatellite Image Compression Technique Using Noise Bit Removal an a1-70 v91 aSahnoun, Khaled uhttps://dline.info/newl/node/62100357nas a2200133 4500008004100000245004000041210004000081260001200121300001000133490000600143100001800149700001900167856003700186 2018 eng d00aSecured Multimodal Biometric System0 aSecured Multimodal Biometric System c09/2018 a77-870 v91 aFatima, Bedad1 aRéda, Adjoudj uhttps://dline.info/newl/node/69001279nas a2200157 4500008004100000245006800041210006600109260001200175300001200187490000700199520079800206100002101004700002001025700002001045856005601065 2018 eng d00aSentiment Analysis of Arabic Tweets: Opinion Target Extraction-0 aSentiment Analysis of Arabic Tweets Opinion Target Extraction c12/2018 a324-3310 v163 a

 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ïve Bayes are trained. The experiment results show that, with 500 tweets collected and manually tagged, SVM gives the highest precision and recall (86%).

1 aBEHDENNA, Salima1 aBarigou, Fatiha1 aBelalem, Ghalem uhttp://dline.info/fpaper/jdim/v16i6/jdimv16i6_4.pdf00468nas a2200145 4500008004100000245006700041210006600108260001200174300001200186490000700198100002100205700002000226700002000246856005600266 2018 eng d00aSentiment Analysis of Arabic Tweets: Opinion Target Extraction0 aSentiment Analysis of Arabic Tweets Opinion Target Extraction c12/2018 a324-3310 v161 aBEHDENNA, Salima1 aBarigou, Fatiha1 aBelalem, Ghalem uhttp://dline.info/fpaper/jdim/v16i6/jdimv16i6_4.pdf00449nas a2200133 4500008004100000245010500041210006900146260001200215300001000227490000600237100001700243700001800260856003700278 2018 eng d00aSolution to Harmonics Interference on Track Circuit Based on ZFFT Algorithm with Multiple Modulation0 aSolution to Harmonics Interference on Track Circuit Based on ZFF c03/2018 a12-260 v81 aWu, Xiaochun1 aJi, Guanggang uhttps://dline.info/newl/node/63400453nas a2200121 4500008004100000245010700041210006900148260001100217300001000228490000600238100002900244856005800273 2018 eng d00aStock Price Prediction Using Multilayer Perceptron Neural Network by Monitoring Frog Leaping Algorithm0 aStock Price Prediction Using Multilayer Perceptron Neural Networ c3/2018 a15-230 v91 aGarakani, Ahdieh, Rahimi uhttp://www.dline.info/jic/fulltext/v9n1/jicv9n1_2.pdf00451nas a2200133 4500008004100000245007500041210006900116260001100185490000600196100001800202700002000220700001900240856005800259 2018 eng d00aStudy on the Task Scheduling Problem of Complicated Products’ Design0 aStudy on the Task Scheduling Problem of Complicated Products Des c3/20180 v91 aCao, Xiao, Bo1 aXu, Cheng, Dong1 aFan, Guo, Chao uhttp://www.dline.info/jic/fulltext/v9n1/jicv9n1_1.pdf00435nas a2200133 4500008004100000245008300041210006900124260001200193300001000205490000600215100002500221700001800246856003700264 2018 eng d00aA Survey and Analysis of Techniques and Tools for Web Performance Optimization0 aSurvey and Analysis of Techniques and Tools for Web Performance  c06/2018 a31-570 v81 aShivakumar, Shailesh1 aSuresh, P., V uhttps://dline.info/newl/node/66900397nas a2200121 4500008004100000245008300041210006900124260001200193300000900205490000600214100001800220856003700238 2018 eng d00aTeam Capacity Evaluation and Scheduling Model for Collaborative Product Design0 aTeam Capacity Evaluation and Scheduling Model for Collaborative  c02/2018 a1-120 v91 aWang, Xiaolei uhttps://dline.info/newl/node/65900431nas a2200145 4500008004100000245006100041210005900102260001200161300000800173490000600181100001600187700001800203700002700221856003700248 2018 eng d00aText Classification for Arabic Words Using BPSO/REP-Tree0 aText Classification for Arabic Words Using BPSOREPTree c03/2018 a1-90 v91 aNaji, Hamza1 aAshour, Wesam1 aHanjouri, Mohammed, Al uhttps://dline.info/newl/node/65600431nas a2200145 4500008004100000245006100041210005900102260001200161300000800173490000600181100001600187700001800203700002700221856003700248 2018 eng d00aText Classification for Arabic Words Using BPSO/REP-Tree0 aText Classification for Arabic Words Using BPSOREPTree c03/2018 a1-90 v91 aNaji, Hamza1 aAshour, Wesam1 aHanjouri, Mohammed, Al uhttps://dline.info/newl/node/65500383nas a2200133 4500008004100000245005700041210005700098260001200155300000900167490000700176100001400183700001500197856003700212 2018 eng d00aTime Optimal Profit Maximization in a Social Network0 aTime Optimal Profit Maximization in a Social Network c03/2018 a8-220 v101 aLiu, Yong1 aZhang, Wei uhttps://dline.info/newl/node/64600474nas a2200157 4500008004100000245008200041210006900123260001200192300001000204490000600214100001400220700001400234700001600248700001500264856003700279 2018 eng d00aUniform Design Research for Maintenance Strategy of Automatic Production Line0 aUniform Design Research for Maintenance Strategy of Automatic Pr c02/2018 a26-330 v61 aLi, Guofa1 aHou, Chao1 aLiu, Guofei1 aJia, Yuhui uhttps://dline.info/newl/node/64400375nas a2200133 4500008004100000245004600041210004600087260001200133300001000145490000700155100002400162700001800186856003700204 2018 eng d00aValue Driven Management of Cloud Services0 aValue Driven Management of Cloud Services c03/2018 a22-370 v101 aMurad, Salah, Eddin1 aDowaji, Salah uhttps://dline.info/newl/node/64700648nas a2200169 4500008004100000245011200041210006900153260000900222300001100231490000700242100002300249700002300272700002300295700002500318700001700343856011800360 2017 eng d00aAutomatic detection of nutritional deficiencies in coffee tree leaves through shape and texture descriptors0 aAutomatic detection of nutritional deficiencies in coffee tree l c2017 a7 - 180 v151 aVassallo-Barco, M.1 aVives-Garnique, L.1 aTuesta-Monteza, V.1 aMejía-Cabrera, H.I.1 aToledo, R.Y. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85016474670&partnerID=40&md5=98af0aca341a806d62107e81ef5988db00526nas a2200145 4500008004100000245007100041210006900112260000900181300001400190490000700204100001500211700001700226700001900243856011800262 2017 eng d00aBuilding consistent UML models for better model driven engineering0 aBuilding consistent UML models for better model driven engineeri c2017 a289 - 3000 v151 aAllaki, D.1 aDahchour, M.1 aEn-nouaary, A. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85036620073&partnerID=40&md5=3f141768de4df003a8dd47e8ece70abb00586nas a2200145 4500008004100000245012100041210006900162260000900231300001400240490000700254100001400261700002700275700002000302856011800322 2017 eng d00aComparing network centrality measures as tools for identifying key concepts in complex networks: A case of wikipedia0 aComparing network centrality measures as tools for identifying k c2017 a203 - 2130 v151 aMatas, N.1 aMartincić-Ipšić, S.1 aMeštrović, A. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85026636099&partnerID=40&md5=50c7ab8bd294001879ffef604b1bc96100499nas a2200133 4500008004100000245008200041210006900123260000900192300001400201490000700215100001200222700001300234856011800247 2017 eng d00aComputer aided fire safety engineering model based on shortest path algorithm0 aComputer aided fire safety engineering model based on shortest p c2017 a106 - 1140 v151 aGao, Y.1 aZhao, J. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85021799816&partnerID=40&md5=d6600cfbe468d44ff4fc46e50a01849800485nas a2200121 4500008004100000245009400041210006900135260000900204300001400213490000700227100001100234856011800245 2017 eng d00aData visualization and retrieval based Convenience store location model of fresh products0 aData visualization and retrieval based Convenience store locatio c2017 a125 - 1340 v151 aLi, L. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85021797683&partnerID=40&md5=72826fd437fd6316cc4864bd8051ea4200452nas a2200121 4500008004100000245006300041210006300104260000900167300001400176490000700190100001500197856011800212 2017 eng d00aDesign of access control system for hangul document system0 aDesign of access control system for hangul document system c2017 a170 - 1780 v151 aJang, S.J. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85026624734&partnerID=40&md5=bb4ae16f5a7688c1f24708dffb41043000414nas a2200121 4500008004100000245004800041210004400089260000900133300001400142490000700156100001100163856011800174 2017 eng d00aThe design research of intelligent suitcase0 adesign research of intelligent suitcase c2017 a320 - 3300 v151 aLi, Y. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85041078765&partnerID=40&md5=cda32c09d5cee78942c927272781aca901516nas a2200133 4500008004100000245004900041210004400090260001200134300000800146490000700154520114700161100001801308856005601326 2017 eng d00aThe Design Research of Intelligent Suitcase-0 aDesign Research of Intelligent Suitcase c12/2017 a3300 v153 a

 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’ demands for safety, carrying and entertainment, so as to provide users’ 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’ 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’ 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.

1 aLi, Yongchuan uhttp://dline.info/fpaper/jdim/v15i6/jdimv15i6_3.pdf00536nas a2200145 4500008004100000245009500041210006900136260000900205300001400214490000700228100001300235700001300248700001100261856011800272 2017 eng d00aDynamic parse approach of ladder diagram based on binary logic tree on the soft PLC system0 aDynamic parse approach of ladder diagram based on binary logic t c2017 a241 - 2500 v151 aYang, G.1 aYang, J.1 aLi, S. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85036640871&partnerID=40&md5=dd38e211439845519d63791a2429f22700562nas a2200145 4500008004100000245011000041210006900151260000900220300001400229490000700243100001600250700001600266700001600282856011800298 2017 eng d00aDynamic tree based classification of Web Queries using B-tree and Simple Ordinal classification algorithm0 aDynamic tree based classification of Web Queries using Btree and c2017 a115 - 1240 v151 aLakshmi, L.1 aReddy, P.B.1 aBindu, C.S. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85021837013&partnerID=40&md5=280f7a24fdb61ddeedd93f8c2b398dc000319nas a2200109 4500008004100000245001400041210001400055260000900069300000600078490000700084856011800091 2017 eng d00aEditorial0 aEditorial c2017 ai0 v15 uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85016489076&partnerID=40&md5=e1ae86d66e0f4660a415221b53fe54d100319nas a2200109 4500008004100000245001400041210001400055260000900069300000600078490000700084856011800091 2017 eng d00aEditorial0 aEditorial c2017 ai0 v15 uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85020194163&partnerID=40&md5=4a1663e5d7e717676be3e722b9ba11bc00319nas a2200109 4500008004100000245001400041210001400055260000900069300000600078490000700084856011800091 2017 eng d00aEditorial0 aEditorial c2017 ai0 v15 uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85026663505&partnerID=40&md5=e682b442d254b92b43b404dba680b09000319nas a2200109 4500008004100000245001400041210001400055260000900069300000600078490000700084856011800091 2017 eng d00aEditorial0 aEditorial c2017 ai0 v15 uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85021830069&partnerID=40&md5=cf41060a52fa38bfffb099c1d413ebbf00319nas a2200109 4500008004100000245001400041210001400055260000900069300000600078490000700084856011800091 2017 eng d00aEditorial0 aEditorial c2017 ai0 v15 uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85036667524&partnerID=40&md5=c98218f7b699e7f5fbe0376e0d5f242400319nas a2200109 4500008004100000245001400041210001400055260000900069300000600078490000700084856011800091 2017 eng d00aEditorial0 aEditorial c2017 ai0 v15 uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85041076013&partnerID=40&md5=085cfa5b37bc804ef4aa4e2426425b3200485nas a2200121 4500008004100000245009400041210006900135260000900204300001400213490000700227100001100234856011800245 2017 eng d00aAn efficient optimization method for extreme learning machine using artificial bee colony0 aefficient optimization method for extreme learning machine using c2017 a135 - 1470 v151 aMa, C. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85021814012&partnerID=40&md5=23df5d471829ac289d14f78e14dac00d00522nas a2200133 4500008004100000245010300041210006900144260000900213300001200222490000700234100001400241700001500255856011800270 2017 eng d00aEnsemble learning to find deceptive reviews using personality traits and reviews specific features0 aEnsemble learning to find deceptive reviews using personality tr c2017 a84 - 940 v151 aSaini, M.1 aSharan, A. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85020169399&partnerID=40&md5=68f6cd81afc51c91e5b486adcb7dfaf600453nas a2200121 4500008004100000245006600041210006300107260000900170300001400179490000700193100001300200856011800213 2017 eng d00aA fast algorithm for plagiarism detection in large-scale data0 afast algorithm for plagiarism detection in largescale data c2017 a331 - 3380 v151 aBaba, K. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85041038008&partnerID=40&md5=38c22942ab3fd6e44bbc8fbb62ea25bd01179nas a2200133 4500008004100000245006700041210006300108260001200171300001200183490000700195520076900202100001800971856005600989 2017 eng d00aA Fast Algorithm for Plagiarism Detection in Large-scale Data-0 aFast Algorithm for Plagiarism Detection in Largescale Data c12/2017 a331-3380 v153 a

This paper proposes a fast plagiarism detection algorithm in large-scale data. Plagiarisms of superficial descriptions, such as “copy and paste”, 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.

1 aBaba, Kensuke uhttp://dline.info/fpaper/jdim/v15i6/jdimv15i6_4.pdf00541nas a2200145 4500008004100000245009500041210006900136260000900205300001200214490000700226100001600233700001400249700001400263856011800277 2017 eng d00aFeasibility of digital forensic examination and analysis of a cloud based storage snapshot0 aFeasibility of digital forensic examination and analysis of a cl c2017 a19 - 290 v151 aAlmulla, S.1 aIraqi, Y.1 aJones, A. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85016449099&partnerID=40&md5=febcecad98f7a471162d3ecc0750e11300522nas a2200145 4500008004100000245008600041210006900127260000900196300001000205490000700215100001200222700001200234700001200246856011800258 2017 eng d00aFormal transformation of spatiotemporal data from object-oriented database to XML0 aFormal transformation of spatiotemporal data from objectoriented c2017 a1 - 60 v151 aBai, L.1 aJia, Z.1 aLiu, J. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85016500198&partnerID=40&md5=5fffc49e324bc3aea22d6f102ff4b29300523nas a2200133 4500008004100000245010200041210006900143260000900212300001400221490000700235100001400242700001500256856011800271 2017 eng d00aGeographic information system-based PROMETHEE II method: An approach for ranking industrial zones0 aGeographic information systembased PROMETHEE II method An approa c2017 a148 - 1580 v151 aTaibi, A.1 aAtmani, B. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85021814656&partnerID=40&md5=69585f0d707204894044047cb634edaf00592nas a2200169 4500008004100000245008200041210006900123260000900192300001400201490000700215100001600222700001400238700001800252700001700270700001700287856011800304 2017 eng d00aHigh level mammographic information fusion for real world ontology population0 aHigh level mammographic information fusion for real world ontolo c2017 a259 - 2710 v151 aSalem, Y.B.1 aIdodi, R.1 aEttabaa, K.S.1 aHamrouni, K.1 aSolaiman, B. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85036660676&partnerID=40&md5=8f5bfd1dfc3fb6b38f1340484f42e5a900514nas a2200121 4500008004100000245012200041210006900163260000900232300001400241490000700255100001200262856011800274 2017 eng d00aAn improved K-means algorithm application in evaluating interactive mechanism of airline industry ecosystem stability0 aimproved Kmeans algorithm application in evaluating interactive  c2017 a214 - 2230 v151 aLiu, Q. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85026645185&partnerID=40&md5=69b9fbf1add6f0310ff1a27d886a6d6300610nas a2200169 4500008004100000245012300041210006900164260000900233300001400242490000700256100001300263700001100276700001100287700001300298700001100311856011800322 2017 eng d00aMulticast optimization and node fast location search method for wireless sensor networks based on ant colony algorithm0 aMulticast optimization and node fast location search method for  c2017 a303 - 3110 v151 aWang, R.1 aHe, G.1 aWu, X.1 aWang, F.1 aHu, Y. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85041033655&partnerID=40&md5=96fc8eeac1d35f0e46d39f00d5a8e7f201805nas a2200169 4500008004100000245012400041210006900165260001200234300001200246490000700258520125400265100003001519700001701549700001801566700001401584856003701598 2017 eng d00aMulticast Optimization and Node Fast Location Search Method for Wireless Sensor Networks Based on Ant Colony Algorithm-0 aMulticast Optimization and Node Fast Location Search Method for  c12/2017 a303-3110 v153 a

 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.

1 aWang, Guoping, He Ruiying1 aWu, Xiaoming1 aWang, Fuqiang1 aHu, Yifan uhttps://dline.info/newl/node/83700491nas a2200121 4500008004100000245010200041210006900143260000900212300001200221490000700233100001100240856011800251 2017 eng d00aA network traffic classification method using support vector machine with feature weighted-degree0 anetwork traffic classification method using support vector machi c2017 a76 - 830 v151 aHe, H. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85020185401&partnerID=40&md5=5b2daddc8a3004dd4eeab5a04b22b6b400530nas a2200133 4500008004100000245010200041210006900143260000900212300001200221490000700233100001800240700002000258856011800278 2017 eng d00aA new maturity model for the implementation of software process improvement in web-based projects0 anew maturity model for the implementation of software process im c2017 a66 - 750 v151 aAl-Rousan, T.1 aAl-Shargabi, B. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85020164708&partnerID=40&md5=203c9c8ccf66da88bffbe4fdcb405e6600488nas a2200133 4500008004100000245007200041210006900113260000900182300001200191490000700203100001400210700001200224856011800236 2017 eng d00aA novel approach for regularization of convolutional neural network0 anovel approach for regularization of convolutional neural networ c2017 a30 - 360 v151 aZhang, Y.1 aShi, B. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85016461859&partnerID=40&md5=546e0229eda800292c211f2c58adf7b500532nas a2200145 4500008004100000245007700041210006900118260000900187300001400196490000700210100001700217700001800234700001600252856011800268 2017 eng d00aOCC-mix approach for concurrent mixture of fixed and mobile transactions0 aOCCmix approach for concurrent mixture of fixed and mobile trans c2017 a272 - 2880 v151 aAl-Qerem, A.1 aHamarsheh, A.1 aNashwan, S. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85036609704&partnerID=40&md5=302cae68771bb14fc6e5fdb2bfea7cbb00540nas a2200145 4500008004100000245009900041210006900140260000900209300001400218490000700232100001200239700001400251700001100265856011800276 2017 eng d00aResearch on flexible customization of business function for intelligent traffic cloud platform0 aResearch on flexible customization of business function for inte c2017 a312 - 3190 v151 aPan, H.1 aHuang, Z.1 aHe, Z. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85041029410&partnerID=40&md5=4bd92bd9fccdbba84441a3fd6d5cfca801295nas a2200157 4500008004100000245010000041210006900141260001200210300000800222490000700230520081100237100001301048700002201061700001701083856003701100 2017 eng d00aResearch on Flexible Customization of Business Function for Intelligent Traffic Cloud Platform-0 aResearch on Flexible Customization of Business Function for Inte c12/2017 a3190 v153 a

 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.

1 aPan, Hua1 aHuang, Zhongxiang1 aHe, Zengzhen uhttps://dline.info/newl/node/83800479nas a2200121 4500008004100000245008500041210006900126260000900195300001400204490000700218100001400225856011800239 2017 eng d00aResearch on the building of emotion metaphor corpus based on machine translation0 aResearch on the building of emotion metaphor corpus based on mac c2017 a224 - 2290 v151 aJiang, X. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85026655786&partnerID=40&md5=7cbd7dc7d8602ee1b00eeba25a5aaff400518nas a2200133 4500008004100000245009200041210006900133260000900202300001400211490000700225100001700232700001700249856011800266 2017 eng d00aStudy on digital image inpainting method based on multispectral image texture synthesis0 aStudy on digital image inpainting method based on multispectral  c2017 a251 - 2580 v151 aZhaoyang, J.1 aGuangxue, C. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85036655486&partnerID=40&md5=87cd3fb02681716474621172e64e05b900565nas a2200121 4500008004100000245017200041210006900213260000900282300001200291490000700303100001500310856011800325 2017 eng d00aTeaching the microprocessors systems focused on societal challenges: Designing of performant cache replacement algorithms as green information technology (IT) solution0 aTeaching the microprocessors systems focused on societal challen c2017 a50 - 650 v151 aFlorea, A. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85020164372&partnerID=40&md5=5ca281296ef54d45e85776b0e48b0ee900534nas a2200157 4500008004100000245006200041210006200103260000900165300001400174490000700188100001600195700001600211700001500227700001600242856011800258 2017 eng d00aTemporal JSON schema versioning in the TJSchema framework0 aTemporal JSON schema versioning in the TJSchema framework c2017 a179 - 2020 v151 aBrahmia, S.1 aBrahmia, Z.1 aGrandi, F.1 aBouaziz, R. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85026631105&partnerID=40&md5=857d828ea22094d110f2391a970dc43101271nas a2200145 4500008004100000245006200041210006000103260001200163300001200175490000700187520084700194100002701041700002001068856003701088 2017 eng d00aThree-stage Short Text Language Identification Algorithm-0 aThreestage Short Text Language Identification Algorithm c12/2017 a354-3720 v163 a

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.

1 aHasimu, Maimaitiyiming1 aSilamu, Wushour uhttps://dline.info/newl/node/84200474nas a2200133 4500008004100000245006100041210006000102260000900162300001400171490000700185100001500192700001500207856011800222 2017 eng d00aThree-stage short text language identification algorithm0 aThreestage short text language identification algorithm c2017 a354 - 3710 v151 aHasimu, M.1 aSilamu, W. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85041035271&partnerID=40&md5=b3b2585d7913f83defb20aecb4f1cbbb01518nas a2200145 4500008004100000245006900041210006900110260001200179300001200191490000700203520105900210100002201269700002501291856005601316 2017 eng d00aUsing Temporal Bayesian Networks to Model user Profile Evolution0 aUsing Temporal Bayesian Networks to Model user Profile Evolution c12/2017 a339-3530 v153 a

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.

1 aAchemoukh, Farida1 aAhmed-Ouamer, Rachid uhttp://dline.info/fpaper/jdim/v15i6/jdimv15i6_5.pdf00500nas a2200133 4500008004100000245006900041210006900110260000900179300001400188490000700202100001800209700002100227856011800248 2017 eng d00aUsing temporal Bayesian networks to model user profile evolution0 aUsing temporal Bayesian networks to model user profile evolution c2017 a339 - 3530 v151 aAchemoukh, F.1 aAhmed-Ouamer, R. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85041072700&partnerID=40&md5=46aee7b47be825e91bb8678ff17ee3d500570nas a2200145 4500008004100000245012300041210006900164260000900233300001400242490000700256100001300263700001400276700001600290856011800306 2016 eng d00aAlgorithm for coding unit partition in 3D animation using high efficiency video coding based on Canny operator segment0 aAlgorithm for coding unit partition in 3D animation using high e c2016 a237 - 2450 v141 aZhao, H.1 aLi, J.-B.1 aZeng, X.-Y. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84991688577&partnerID=40&md5=e79dd6271010e213a188565709bc982400565nas a2200169 4500008004100000245006600041210006600107260000900173300001400182490000700196100001500203700001500218700001300233700001400246700001700260856011800277 2016 eng d00aAnalysis on cloud data service platform for digital oilfields0 aAnalysis on cloud data service platform for digital oilfields c2016 a413 - 4220 v141 aZhu, Z.-P.1 aPan, R.-F.1 aChen, Z.1 aLi, G.-Q.1 aZheng, G.-S. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85011003724&partnerID=40&md5=b4b0c49bf0677be5bce7f05b7c7bc5ae00597nas a2200169 4500008004100000245009400041210006900135260000900204300001200213490000700225100001500232700001500247700001600262700001600278700001500294856011800309 2016 eng d00aApplication of K-means algorithm to web text mining based on average density optimization0 aApplication of Kmeans algorithm to web text mining based on aver c2016 a41 - 460 v141 aFan, G.-L.1 aLiu, Y.-W.1 aTong, J.-Q.1 aZhao, S.-H.1 aNie, Z.-Q. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84969799196&partnerID=40&md5=94816cbcc150372d5cf67b43d1d23d5200622nas a2200157 4500008004100000245012800041210006900169260000900238300001400247490000700261100002000268700001900288700002000307700001900327856011800346 2016 eng d00aApplication of the codes of a polynomial residue number system, aimed at reducing the effects of failures in the AES cipher0 aApplication of the codes of a polynomial residue number system a c2016 a114 - 1230 v141 aStepanova, E.P.1 aKalmykov, I.A.1 aToporkova, E.V.1 aRezenkov, D.N. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84974777732&partnerID=40&md5=9ab931f59e7bead6ed7bd8b89895662400570nas a2200157 4500008004100000245009300041210006900134260000900203300001400212490000700226100001500233700001700248700001400265700001500279856011800294 2016 eng d00aApplying the multi-objective optimization techniques in the design of suspension systems0 aApplying the multiobjective optimization techniques in the desig c2016 a351 - 3670 v141 aFlorea, A.1 aCofaru, I.I.1 aRoman, L.1 aCofaru, N. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85010992362&partnerID=40&md5=c5723e86407f60eee4bf2019fcd6635800525nas a2200133 4500008004100000245009900041210006900140260000900209300001400218490000700232100001600239700001800255856011800273 2016 eng d00aBlind identification algorithm of photorealistic computer grapic based on weber local features0 aBlind identification algorithm of photorealistic computer grapic c2016 a210 - 2170 v141 aXicheng, L.1 aJianzhong, X. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84982833343&partnerID=40&md5=2f16ed2cb0851344b87d839654337da600545nas a2200145 4500008004100000245009100041210006900132260000900201300001400210490000700224100001500231700001600246700001900262856011800281 2016 eng d00aA cloud-assisted architecture for content distribution in mobile peer to peer networks0 acloudassisted architecture for content distribution in mobile pe c2016 a403 - 4120 v141 aLiu, Y.-N.1 aChen, H.-Y.1 aGilani, S.M.M. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85010972068&partnerID=40&md5=478dd69ec164325e2daff594a03ec7d000534nas a2200169 4500008004100000245005700041210005500098260000900153300001400162490000700176100001300183700001100196700001400207700001100221700001400232856011800246 2016 eng d00aA clustering with slope algorithm based on mapreduce0 aclustering with slope algorithm based on mapreduce c2016 a168 - 1760 v141 aWang, Y.1 aWu, H.1 aLiang, J.1 aOu, J.1 aHuang, Y. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84982801686&partnerID=40&md5=59c334c0b1dd3e8b94a3cc75d5785e8900484nas a2200121 4500008004100000245008900041210006900130260000900199300001400208490000700222100001500229856011800244 2016 eng d00aA combination indexing for image social bookmarking system to improve search results0 acombination indexing for image social bookmarking system to impr c2016 a423 - 4310 v141 aJomsri, P. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85010950546&partnerID=40&md5=b3aac0163118ba5aa45d79a62ae9fd2500504nas a2200133 4500008004100000245008800041210006900129260000900198300001400207490000700221100001200228700001200240856011800252 2016 eng d00aConstruction of trust based dynamic access control model in P2P network environment0 aConstruction of trust based dynamic access control model in P2P  c2016 a194 - 1980 v141 aHan, Y.1 aCui, X. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84982850708&partnerID=40&md5=d1a82b733bccde27611b24bd80b7566800522nas a2200145 4500008004100000245007400041210006900115260000900184300001200193490000700205100001600212700001700228700001300245856011800258 2016 eng d00aData and text mining techniques for classifying Arabic tweet polarity0 aData and text mining techniques for classifying Arabic tweet pol c2016 a15 - 250 v141 aBrahimi, B.1 aTouahria, M.1 aTari, A. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84969780164&partnerID=40&md5=57719abacdba72ad8002405b928bfc8b00562nas a2200145 4500008004100000245010300041210006900144260000900213300001400222490000700236100001800243700001600261700002100277856011800298 2016 eng d00aDevelopment of the method for integration of mobile applications and corporate information systems0 aDevelopment of the method for integration of mobile applications c2016 a322 - 3320 v141 aPtitsyn, P.S.1 aRadko, D.V.1 aSkrypnikov, A.V. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85006152467&partnerID=40&md5=89b1522129dfd8af6d4064d4d5346f5300495nas a2200133 4500008004100000245008000041210006900121260000900190300001100199490000700210100001200217700001400229856011800243 2016 eng d00aDigital image clustering algorithm based on multi-agent center optimization0 aDigital image clustering algorithm based on multiagent center op c2016 a8 - 140 v141 aPan, X.1 aSagan, H. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84969758522&partnerID=40&md5=3b83fba746d28c99ce7100ced473ba0d00400nas a2200109 4500008004100000245005500041210005400096260000900150300000600159490000700165856011800172 2016 eng d00aDigital Information Research Foundation: Editorial0 aDigital Information Research Foundation Editorial c2016 ai0 v14 uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85006862423&partnerID=40&md5=537a5ec9b4885f0aef8f74a9635587cb00519nas a2200169 4500008004100000245004400041210004300085260000900128300001400137490000700151100001400158700001700172700001500189700001200204700001500216856011800231 2016 eng d00aDVM-based topic detection for microblog0 aDVMbased topic detection for microblog c2016 a383 - 3910 v141 aLv, J.-G.1 aJiang, X.-Y.1 aChi, Q.-Y.1 aWei, Z.1 aJocshi, A. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85010949216&partnerID=40&md5=25b19644aeefdf985af20e330561f8dd00319nas a2200109 4500008004100000245001400041210001400055260000900069300000600078490000700084856011800091 2016 eng d00aEditorial0 aEditorial c2016 ai0 v14 uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84974806696&partnerID=40&md5=1da7f466070aecb9266bc6db9c57fa3a00319nas a2200109 4500008004100000245001400041210001400055260000900069300000600078490000700084856011800091 2016 eng d00aEditorial0 aEditorial c2016 ai0 v14 uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85010950496&partnerID=40&md5=6b6fe7fe188cad1d1161479c070e743b00319nas a2200109 4500008004100000245001400041210001400055260000900069300000600078490000700084856011800091 2016 eng d00aEditorial0 aEditorial c2016 ai0 v14 uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84991632822&partnerID=40&md5=65bb3595a5fe6ae471609af13e3e3c1300486nas a2200145 4500008004100000245005000041210004900091260000900140300001400149490000700163100001700170700001900187700001600206856011800222 2016 eng d00aEmonews: An emotional news recommender system0 aEmonews An emotional news recommender system c2016 a392 - 4020 v141 aParizi, A.H.1 aKazemifard, M.1 aAsghari, M. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85011002763&partnerID=40&md5=8b7f0afd931aaf9ee2688f258598a5ef00531nas a2200145 4500008004100000245008100041210006900122260000900191300001400200490000700214100001500221700001700236700001400253856011800267 2016 eng d00aExploring government uses of social media through Twitter sentiment analysis0 aExploring government uses of social media through Twitter sentim c2016 a290 - 3010 v141 aChen, H.M.1 aFranks, P.C.1 aEvans, L. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85006868159&partnerID=40&md5=11144532b5f9c5b4092fdc815b6c787800489nas a2200121 4500008004100000245009500041210006900136260000900205300001400214490000700228100001400235856011800249 2016 eng d00aHigh-performance computer system based on CPU/GPU isomeric architecture parallel algorithm0 aHighperformance computer system based on CPUGPU isomeric archite c2016 a218 - 2230 v141 aJiang, H. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84982812315&partnerID=40&md5=30bd9688e827a922977566f2a2b0344d00516nas a2200145 4500008004100000245007600041210006900117260000900186300001400195490000700209100001100216700001200227700001300239856011800252 2016 eng d00aHot topic extraction and public opinion classification of tibetan texts0 aHot topic extraction and public opinion classification of tibeta c2016 a160 - 1670 v141 aXu, G.1 aQiu, L.1 aPeng, X. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84982786667&partnerID=40&md5=65894d6a0354bc43e13d953109c62b9300537nas a2200145 4500008004100000245009100041210006900132260000900201300001400210490000700224100001300231700001200244700001700256856011800273 2016 eng d00aImage fusion based on WRV and NHM rules for medical digital image in contourlet domain0 aImage fusion based on WRV and NHM rules for medical digital imag c2016 a151 - 1590 v141 aWang, J.1 aLai, S.1 aBorjer, T.H. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84982840475&partnerID=40&md5=9ce1fb8c2ef06112889a547afa917d4e00542nas a2200133 4500008004100000245012200041210006900163260000900232300001400241490000700255100001200262700001600274856011800290 2016 eng d00aImproved Convolutional Neural Network for biomedical word sense disambiguation with enhanced context feature modeling0 aImproved Convolutional Neural Network for biomedical word sense  c2016 a342 - 3500 v141 aRen, K.1 aWang, S.-W. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85010950516&partnerID=40&md5=976019ac152af0c2f33880cb6ca688a600540nas a2200157 4500008004100000245006800041210006800109260000900177300001400186490000700200100001200207700001700219700001300236700001500249856011800264 2016 eng d00aImproved digital image restoration algorithm based on Criminisi0 aImproved digital image restoration algorithm based on Criminisi c2016 a302 - 3100 v141 aDai, L.1 aJiang, D.-H.1 aDing, B.1 aHahn, J.K. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85000893942&partnerID=40&md5=cfd761694d61d770d0fcf37e2c8c563d00587nas a2200169 4500008004100000245009400041210006900135260000900204300001300213490000700226100001100233700001600244700001100260700001300271700001500284856011800299 2016 eng d00aAn improved SMOTE algorithm based on genetic algorithm for imbalanced data classification0 aimproved SMOTE algorithm based on genetic algorithm for imbalanc c2016 a92 - 1030 v141 aGu, Q.1 aWang, X.-M.1 aWu, Z.1 aNing, B.1 aXin, C.-S. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84974814392&partnerID=40&md5=8541ce719ff30daad12313b47f99645400584nas a2200169 4500008004100000245007900041210006900120260000900189300001400198490000700212100001600219700001500235700001400250700001600264700001600280856011800296 2016 eng d00aIntuitionistic fuzzy Petri nets for knowledge representation and reasoning0 aIntuitionistic fuzzy Petri nets for knowledge representation and c2016 a104 - 1130 v141 aMeng, F.-X.1 aLei, Y.-J.1 aZhang, B.1 aShen, X.-Y.1 aZhao, J.-Y. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84974817409&partnerID=40&md5=d032ac3e4f411c8d29c603f648b2475500404nas a2200109 4500008004100000245005700041210005600098260000900154300000600163490000700169856011800176 2016 eng d00aJournal of Digital Information Management: Editorial0 aJournal of Digital Information Management Editorial c2016 ai0 v14 uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84969812410&partnerID=40&md5=1a3b50b24491f1db8e8249b5f937c41000478nas a2200121 4500008004100000245008500041210006900126260000900195300001400204490000700218100001300225856011800238 2016 eng d00aKeyword extraction from Chinese text based on multidimensional weighted features0 aKeyword extraction from Chinese text based on multidimensional w c2016 a177 - 1830 v141 aJian, Y. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84982833307&partnerID=40&md5=21b1c4d3d08f73e83fe646df1ec10e9100576nas a2200169 4500008004100000245007800041210006900119260000900188300001400197490000700211100001300218700001600231700001500247700001200262700001400274856011800288 2016 eng d00aModel of e-commerce cloud warehouse grading based on mass simulation data0 aModel of ecommerce cloud warehouse grading based on mass simulat c2016 a311 - 3210 v141 aWang, F.1 aWang, Y.-L.1 aLiu, Z.-J.1 aCui, X.1 aZhang, P. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85006846917&partnerID=40&md5=31b0b8c45c1082ef2e532a89c869992700562nas a2200133 4500008004100000245014200041210006900183260000900252300001400261490000700275100001700282700001100299856011800310 2016 eng d00aModeling the evolution of collaboration network and knowledge network and their effects on knowledge flow through social network analysis0 aModeling the evolution of collaboration network and knowledge ne c2016 a246 - 2540 v141 aZhang, Y.-R.1 aMa, D. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84991694298&partnerID=40&md5=427e307104a58f9c53dfc82d364d3a9400459nas a2200133 4500008004100000245005500041210005500096260000900151300001400160490000700174100001200181700001400193856011800207 2016 eng d00aNew clustering algorithm for multidimensional data0 aNew clustering algorithm for multidimensional data c2016 a255 - 2620 v141 aFan, L.1 aZhong, J. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84991716924&partnerID=40&md5=4ea7d8f5df341e1c97837cd8fa67442800590nas a2200157 4500008004100000245010600041210006900147260000900216300001400225490000700239100001700246700001900263700001600282700001600298856011800314 2016 eng d00aA new method of simulating swarms and herds using PSO and other additions: A social behavior approach0 anew method of simulating swarms and herds using PSO and other ad c2016 a333 - 3390 v141 aAlnahhas, A.1 aAl-Kabbani, A.1 aAlshami, E.1 aAlkhous, A. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85006846869&partnerID=40&md5=d0a08fd6cea0256498921702606dafb000507nas a2200133 4500008004100000245009100041210006900132260000900201300001200210490000700222100001300229700001300242856011800255 2016 eng d00aA novel algorithm for classification rule discovery based on concept granule structure0 anovel algorithm for classification rule discovery based on conce c2016 a73 - 800 v141 aJian, Z.1 aKong, L. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84974822488&partnerID=40&md5=7219cd436198c3dcaeb1e0b7914d411e00564nas a2200157 4500008004100000245009300041210006900134260000900203300001400212490000700226100001500233700001500248700001300263700001200276856011800288 2016 eng d00aA novel digital image classification algorithm via low-rank sparse bag-of-features model0 anovel digital image classification algorithm via lowrank sparse  c2016 a227 - 2360 v141 aZou, X.-M.1 aSun, H.-J.1 aYang, S.1 aZhu, Y. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84991711411&partnerID=40&md5=4cf33f1f8c9b9d91db67d686facdeffd00544nas a2200145 4500008004100000245010000041210006900141260000900210300001200219490000700231100001100238700001400249700001700263856011800280 2016 eng d00aA novel recommendation strategy for user-based collaborative filtering in intelligent marketing0 anovel recommendation strategy for userbased collaborative filter c2016 a81 - 910 v141 aYi, J.1 aZhang, L.1 aPhelan, C.A. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84974784671&partnerID=40&md5=a48f248084cf977768be0931a9ac4d8900506nas a2200133 4500008004100000245008300041210006900124260000900193300001400202490000700216100001700223700001400240856011800254 2016 eng d00aPlagiarism detection in Arabic documents: Approaches, architecture and systems0 aPlagiarism detection in Arabic documents Approaches architecture c2016 a124 - 1350 v141 aKahloula, B.1 aBerri, J. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84974801172&partnerID=40&md5=5284a71ab939f31aa1edb2b12f37113400536nas a2200145 4500008004100000245009800041210006900139260000900208300001200217490000700229100001100236700001200247700001300259856011800272 2016 eng d00aResearch on power dispatching automation system for data management of power plant substation0 aResearch on power dispatching automation system for data managem c2016 a47 - 510 v141 aLi, H.1 aZhu, Q.1 aYang, F. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84969771426&partnerID=40&md5=0a06da909e6eb87ef97d087705a699c900512nas a2200133 4500008004100000245008700041210006900128260000900197300001400206490000700220100001600227700001700243856011800260 2016 eng d00aRisk evaluation of information exchange among nodes under P2P net work environment0 aRisk evaluation of information exchange among nodes under P2P ne c2016 a199 - 2030 v141 aYingjun, H.1 aXiaoyang, W. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84982861472&partnerID=40&md5=2afb4669d2ac571cc863d12802023a6b00593nas a2200157 4500008004100000245011000041210006900151260000900220300001400229490000700243100001800250700001500268700001500283700001900298856011800317 2016 eng d00aSelection problem of Cloud solution for big data accessing: Fuzzy AHP-PROMETHEE as a proposed methodology0 aSelection problem of Cloud solution for big data accessing Fuzzy c2016 a368 - 3820 v141 aBoutkhoum, O.1 aHanine, M.1 aAgouti, T.1 aTikniouine, A. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85010966355&partnerID=40&md5=4f3167a86b6e54545dc4826982f49ca600530nas a2200133 4500008004100000245010900041210006900150260000900219300001200228490000700240100001500247700001600262856011800278 2016 eng d00aSentence-level opinion analysis for Chinese news documents based on sentiment information of social tags0 aSentencelevel opinion analysis for Chinese news documents based  c2016 a52 - 620 v141 aYeh, J.-Y.1 aChen, S.-Y. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84969813520&partnerID=40&md5=48d1a14dad93d4235d4983212eabb14c00542nas a2200145 4500008004100000245010000041210006900141260000900210300001400219490000700233100001200240700001100252700001500263856011800278 2016 eng d00aStudy on the classification of negative sentiment Weibo messages in the post-disaster situation0 aStudy on the classification of negative sentiment Weibo messages c2016 a136 - 1420 v141 aBai, H.1 aYu, G.1 aTian, X.Y. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84974844215&partnerID=40&md5=6406c8db9847b799a50f4615768557f600557nas a2200133 4500008004100000245014100041210006900182260000900251300001400260490000700274100001200281700001200293856011800305 2016 eng d00aStudy on the training system of legal on proceeding business based the prototyping method and object-oriented systematic analysis method0 aStudy on the training system of legal on proceeding business bas c2016 a204 - 2090 v141 aFan, G.1 aLiu, Y. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84982791250&partnerID=40&md5=ec943f5ffc22d260f5d11a043a25810600599nas a2200145 4500008004100000245014800041210006900189260000900258300001400267490000700281100001600288700001500304700001600319856011800335 2016 eng d00aA systematic approach for changing XML namespaces in XML schemas and managing their effects on associated XML documents under schema versioning0 asystematic approach for changing XML namespaces in XML schemas a c2016 a275 - 2890 v141 aBrahmia, Z.1 aGrandi, F.1 aBouaziz, R. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85006957183&partnerID=40&md5=86f720e96986f3731d3e5138d1ad8ff900503nas a2200121 4500008004100000245011000041210006900151260000900220300001200229490000700241100001500248856011800263 2016 eng d00aTechnological relatedness based on co-classification network analysis: A case study on electricity sector0 aTechnological relatedness based on coclassification network anal c2016 a26 - 320 v141 aWen, F.-F. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84969776908&partnerID=40&md5=6479b8e4f2d84118e5b1591e47ca376a00636nas a2200181 4500008004100000245007900041210006900120260000900189300001400198490000700212100002000219700001900239700002000258700002000278700001700298700002100315856011800336 2016 eng d00aA three-tier model for structuring of scientific and technical information0 athreetier model for structuring of scientific and technical info c2016 a184 - 1930 v141 aArtamonov, A.A.1 aAnanieva, A.G.1 aTretyakov, E.S.1 aKshnyakov, D.O.1 aOnykiy, B.N.1 aPronicheva, L.V. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84982841003&partnerID=40&md5=103a8995f5b0a7da7a0a3ddad3e28ca700494nas a2200133 4500008004100000245007900041210006900120260000900189300001200198490000700210100001100217700001400228856011800242 2016 eng d00aTrajectory prediction of vessels based on data mining and machine learning0 aTrajectory prediction of vessels based on data mining and machin c2016 a33 - 400 v141 aQi, L.1 aZheng, Z. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84969857942&partnerID=40&md5=e96a78463c16dcccf34d6c8b1511f98b00528nas a2200121 4500008004100000245012900041210006900170260000900239300001400248490000700262100001900269856011800288 2016 eng d00aThe use of the streaming data transmission from a Web browser to enhance the work efficiency of the contact center operators0 ause of the streaming data transmission from a Web browser to enh c2016 a263 - 2680 v141 aTeykhrib, A.P. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84991677478&partnerID=40&md5=64f220c683cc032b6d2a2a63f73efb8700605nas a2200169 4500008004100000245010100041210006900142260000900211300001000220490000700230100001700237700001400254700001700268700001600285700001600301856011800317 2016 eng d00aA web service-based approach to integrated information management for railway emergency scenario0 aweb servicebased approach to integrated information management f c2016 a1 - 70 v141 aZhang, Z.-H.1 aXu, Z.-L.1 aZhang, Y.-P.1 aDang, J.-W.1 aShen, L.-X. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84969902467&partnerID=40&md5=923eef1ca98ee271af3c1795c251767700572nas a2200157 4500008004100000245008800041210006900129260000900198300001400207490000700221100001600228700001700244700001900261700001600280856011800296 2015 eng d00aA 3D audio augmented reality system for a cultural heritage management and fruition0 a3D audio augmented reality system for a cultural heritage manage c2015 a203 - 2090 v131 aD'Auria, D.1 aDi Mauro, D.1 aCalandra, D.M.1 aCutugno, F. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84942510273&partnerID=40&md5=d148a64add2087fe57ff0e4483dc5bf800617nas a2200157 4500008004100000245012300041210006900164260000900233300001400242490000700256100002000263700001900283700001800302700002100320856011800341 2015 eng d00aAdoption of management information systems in context of yemeni organizations: A structural equation modeling approach0 aAdoption of management information systems in context of yemeni  c2015 a429 - 4440 v131 aAl-Mamary, Y.H.1 aShamsuddin, A.1 aHamid, N.A.A.1 aAl-Maamari, M.H. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84959206334&partnerID=40&md5=afff15087d94541bc0e6a6237a44dfb700481nas a2200133 4500008004100000245007200041210006900113260000900182300000600191490000700197100001400204700001100218856011800229 2015 eng d00aAdvances in secure communication and information processing systems0 aAdvances in secure communication and information processing syst c2015 ai0 v131 aXhafa, F.1 aLi, J. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84942531727&partnerID=40&md5=ec068ff353213713be8f563709ba559c00501nas a2200121 4500008004100000245010800041210006900149260000900218300001400227490000700241100001300248856011800261 2015 eng d00aAlgorithm on Evaluation of Atmospheric Inhalable Particles in Beijing based on Extension Neural Network0 aAlgorithm on Evaluation of Atmospheric Inhalable Particles in Be c2015 a361 - 3660 v131 aChen, M. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84959857928&partnerID=40&md5=34cd3000e93aaa6ed0b53b165ad43dfa00594nas a2200169 4500008004100000245009800041210006900139260000900208300001400217490000700231100001300238700001300251700001600264700001300280700001300293856011800306 2015 eng d00aApplication of a NewmAnt-MinerPRAlgorithm in Classification Rule Mining0 aApplication of a NewinfminfAntMinerinfPRinfAlgorithm in Classifi c2015 a311 - 3200 v131 aYang, L.1 aLi, K.S.1 aZhang, W.S.1 aWang, Y.1 aKe, Z.X. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84959855322&partnerID=40&md5=063496b12a1e92c72d123e5a9f9044f300548nas a2200121 4500008004100000245015400041210006900195260000900264300001400273490000700287100001400294856011800308 2015 eng d00aApplication of radio frequency identification devices technology in vehicle logistics electronic transfer system and logistics management data errors0 aApplication of radio frequency identification devices technology c2015 a467 - 4710 v131 aLiang, Y. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84959212045&partnerID=40&md5=7b08e570be9c82b3c1d9b2df635f8a0c00553nas a2200157 4500008004100000245008000041210006900121260000900190300001400199490000700213100001600220700001200236700001300248700001600261856011800277 2015 eng d00aApplication of Word Embeddings in Biomedical Named Entity Recognition Tasks0 aApplication of Word Embeddings in Biomedical Named Entity Recogn c2015 a321 - 3270 v131 aChang, F.X.1 aGuo, J.1 aXu, W.R.1 aChung, S.R. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84959857144&partnerID=40&md5=efd3cf470dbf495aa4ca4561b2af31b800513nas a2200145 4500008004100000245006600041210006500107260000900172300001400181490000700195100001500202700001600217700001600233856011800249 2015 eng d00aAutomated DD-path Testing and its Significance in SDLC Phases0 aAutomated DDpath Testing and its Significance in SDLC Phases c2015 a337 - 3450 v131 aSattar, H.1 aBajwa, I.S.1 aShafi, U.F. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84959857875&partnerID=40&md5=24005bd30448b154b2db6221bfadc4e100517nas a2200133 4500008004100000245007900041210006900120260000900189300001400198490000700212100002300219700002300242856011800265 2015 eng d00aA basic comparative framework for evaluation of digital identifier systems0 abasic comparative framework for evaluation of digital identifier c2015 a190 - 1970 v131 aKhedmatgozar, H.R.1 aAlipour-Hafezi, M. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84938569694&partnerID=40&md5=abbe6643b61fe841d85b77249398dc0000570nas a2200169 4500008004100000245007200041210006900113260000900182300001400191490000700205100001500212700001300227700001400240700001400254700001400268856011800282 2015 eng d00aCloud-based government procurement information integration platform0 aCloudbased government procurement information integration platfo c2015 a147 - 1550 v131 aWang, P.Y.1 aShen, J.1 aGuo, W.Q.1 aZhang, C.1 aZhang, B. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84938587940&partnerID=40&md5=a0687e73f079a9f60c27328d138c7b9700489nas a2200145 4500008004100000245005700041210005700098260000900155300001400164490000700178100001300185700001200198700001500210856011800225 2015 eng d00aClustering research across Tibetan and Chinese texts0 aClustering research across Tibetan and Chinese texts c2015 a162 - 1680 v131 aXu, G.X.1 aSun, W.1 aPeng, X.P. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84938597690&partnerID=40&md5=a971739a5ed7e44e809f090f4dd4ade800513nas a2200145 4500008004100000245006500041210006500106260000900171300001400180490000700194100001500201700001700216700001600233856011800249 2015 eng d00aCollection and selection based relevant degrees of documents0 aCollection and selection based relevant degrees of documents c2015 a110 - 1190 v131 aKheira, M.1 aLougmiri, Z.1 aKamel, A.M. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84930388004&partnerID=40&md5=d5169e26b597ad1d23dfecfc8ece9fe300464nas a2200121 4500008004100000245007100041210006900112260000900181300001400190490000700204100001300211856011800224 2015 eng d00aComputer graphics algorithm based on visualization teaching theory0 aComputer graphics algorithm based on visualization teaching theo c2015 a137 - 1410 v131 aWang, F. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84938590017&partnerID=40&md5=7ae622ba1163d0246f51519817a5ff8900512nas a2200121 4500008004100000245011900041210006900160260000900229300001400238490000700252100001300259856011800272 2015 eng d00aConstruction and application of teaching file management system in institutions of higher learning based on OpenKM0 aConstruction and application of teaching file management system  c2015 a286 - 2900 v131 aDeng, H. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84956704691&partnerID=40&md5=5c0b7f8150eef63ce1be7af402d6959700537nas a2200133 4500008004100000245011700041210006900158260000900227300001400236490000700250100001500257700001300272856011800285 2015 eng d00aConstruction of a Port Logistics Information Platform Based on J2EE: Taking Dushan Port of Jiaxing as an Example0 aConstruction of a Port Logistics Information Platform Based on J c2015 a328 - 3360 v131 aShen, Y.Y.1 aHe, A.T. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84959855788&partnerID=40&md5=f78c983c5c37a00819a1a87b052b4c6f00549nas a2200145 4500008004100000245010600041210006900147260000900216300001300225490000700238100001400245700001200259700001400271856011800285 2015 eng d00aCooperation based on decode-and-forward plus cooperative jamming for wireless physical layer security0 aCooperation based on decodeandforward plus cooperative jamming f c2015 a92 - 1000 v131 aHuang, S.1 aTan, J.1 aJiang, R. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84930397335&partnerID=40&md5=2c00e27b64c466fff5637cf109a5317400570nas a2200169 4500008004100000245008300041210006900124260000900193300001200202490000700214100001200221700001200233700001200245700001200257700001300269856011800282 2015 eng d00aDenoising and segmentation of digital feather image using mean shift algorithm0 aDenoising and segmentation of digital feather image using mean s c2015 a25 - 300 v131 aYue, H.1 aCai, K.1 aLuo, B.1 aJin, Y.1 aZeng, Z. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84930363955&partnerID=40&md5=d65edfcff5e6774e9248ab177dbaed8d00591nas a2200169 4500008004100000245009900041210006900140260000900209300001400218490000700232100001300239700001200252700001300264700001300277700001300290856011800303 2015 eng d00aDifferential evolution enhanced with composite population information based mutation operators0 aDifferential evolution enhanced with composite population inform c2015 a210 - 2230 v131 aLiao, J.1 aCai, Y.1 aChen, Y.1 aWang, T.1 aTian, H. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84942511121&partnerID=40&md5=7309be081ccccb38955635c7e2c213ec00533nas a2200133 4500008004100000245011800041210006900159260000900228300001400237490000700251100001100258700001200269856011800281 2015 eng d00aDigital audio resampling detection based on sparse representation classifier and periodicity of second derivative0 aDigital audio resampling detection based on sparse representatio c2015 a101 - 1090 v131 aXu, J.1 aXia, J. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84930410136&partnerID=40&md5=cf411bb3b2ebf1796aab9b51593c4cb500494nas a2200121 4500008004100000245009900041210006900140260000900209300001400218490000700232100001500239856011800254 2015 eng d00aDo online recommendations matter? - A multimodal investigation of Amazon's co-purchase network0 aDo online recommendations matter A multimodal investigation of A c2015 a176 - 1840 v131 aChen, H.M. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84938565677&partnerID=40&md5=a31c53e7ea274946578bb61428ef1ce900495nas a2200133 4500008004100000245007300041210006900114260000900183300001400192490000700206100001500213700001500228856011800243 2015 eng d00aDTLS for lightweight secure data streaming in the Internet of Things0 aDTLS for lightweight secure data streaming in the Internet of Th c2015 a247 - 2550 v131 aFisher, R.1 aHancke, G. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84942524746&partnerID=40&md5=744b96bc706ffe05ed4bd97951bf457b00564nas a2200157 4500008004100000245007800041210006900119260000900188300001200197490000700209100001900216700001600235700002200251700001500273856011800288 2015 eng d00aDynMapNoCSIM: A dynamic mapping SIMULATOR for network on chip based MPSoC0 aDynMapNoCSIM A dynamic mapping SIMULATOR for network on chip bas c2015 a45 - 540 v131 aBenhaoua, M.K.1 aSingh, A.K.1 aBenyamina, A.E.H.1 aBoulet, P. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84930319582&partnerID=40&md5=7b17f99ca500531c41690cd57bb94e2500319nas a2200109 4500008004100000245001400041210001400055260000900069300000600078490000700084856011800091 2015 eng d00aEditorial0 aEditorial c2015 ai0 v13 uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84930343347&partnerID=40&md5=c319ff8af0531cf1506ee50172fd067700319nas a2200109 4500008004100000245001400041210001400055260000900069300000600078490000700084856011800091 2015 eng d00aEditorial0 aEditorial c2015 ai0 v13 uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84959186858&partnerID=40&md5=52a91d866ea136c2dd9b9a69b3cffb5800319nas a2200109 4500008004100000245001400041210001400055260000900069300000600078490000700084856011800091 2015 eng d00aEditorial0 aEditorial c2015 ai0 v13 uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84938560172&partnerID=40&md5=0d7f09712bb854bba464d0dd671719bc00319nas a2200109 4500008004100000245001400041210001400055260000900069300000600078490000700084856011800091 2015 eng d00aEditorial0 aEditorial c2015 ai0 v13 uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84930395044&partnerID=40&md5=238b690a729266667f0341a46b8fb1ba00319nas a2200109 4500008004100000245001400041210001400055260000900069300000600078490000700084856011800091 2015 eng d00aEditorial0 aEditorial c2015 ai0 v13 uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84956511799&partnerID=40&md5=f08e72c487745b4fbb237699a8bd571e00543nas a2200157 4500008004100000245007900041210006900120260000900189300001200198490000700210100001200217700001400229700001200243700001200255856011800267 2015 eng d00aAn efficient RFID data cleaning method based on wavelet density estimation0 aefficient RFID data cleaning method based on wavelet density est c2015 a10 - 140 v131 aLiu, Y.1 aZhang, H.1 aHan, F.1 aTan, J. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84930330566&partnerID=40&md5=9044ba6bdb789f569e8827e6132ce5f800545nas a2200157 4500008004100000245008000041210006900121260000900190300001400199490000700213100001400220700001200234700001100246700001200257856011800269 2015 eng d00aA feature selection method to handle imbalanced data in text classification0 afeature selection method to handle imbalanced data in text class c2015 a169 - 1750 v131 aChang, F.1 aGuo, J.1 aXu, W.1 aYao, K. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84938570184&partnerID=40&md5=ae4937f9352d817db15e4e660973556100547nas a2200133 4500008004100000245012500041210006900166260000900235300001400244490000700258100001600265700001400281856011800295 2015 eng d00aHybrid approach for project portfolio selection taking account of resources management and interactions between projects0 aHybrid approach for project portfolio selection taking account o c2015 a451 - 4610 v131 aBenaija, K.1 aKjiri, L. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84959232725&partnerID=40&md5=dfb8c730a2a801c9e09550897ae0f3d300540nas a2200169 4500008004100000245006100041210005900102260000900161300001400170490000700184100001200191700001200203700001200215700001200227700001300239856011800252 2015 eng d00aA hybrid method to extract triggers in biomedical events0 ahybrid method to extract triggers in biomedical events c2015 a300 - 3050 v131 aWei, X.1 aZhu, Q.1 aLyu, C.1 aRen, K.1 aChen, B. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84942513410&partnerID=40&md5=2e0586033f81cb3990ed8b5f9af40cb400505nas a2200133 4500008004100000245008400041210006900125260000900194300001400203490000700217100001400224700001500238856011800253 2015 eng d00aImplementation and evaluation of division-based broadcasting system for webcast0 aImplementation and evaluation of divisionbased broadcasting syst c2015 a234 - 2460 v131 aGotoh, Y.1 aKimura, A. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84942508437&partnerID=40&md5=36e8b45c02dd6dc84df523639afa852700590nas a2200157 4500008004100000245012300041210006900164260000900233300001200242490000700254100001300261700001100274700001200285700001700297856011800314 2015 eng d00aAn improved classification scheme with adaptive region growing and Wishart classification algorithm for digital images0 aimproved classification scheme with adaptive region growing and  c2015 a15 - 240 v131 aChen, J.1 aDu, P.1 aTan, K.1 aBorjer, T.H. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84930368317&partnerID=40&md5=74e8e8ba6a445312904e04e7119c16ab00471nas a2200121 4500008004100000245007900041210006900120260000900189300001400198490000700212100001200219856011800231 2015 eng d00aInfluence of information technology on college piano course teaching model0 aInfluence of information technology on college piano course teac c2015 a185 - 1890 v131 aJin, Y. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84938594099&partnerID=40&md5=427e01b0cae258db68fe5029db676c1d00492nas a2200121 4500008004100000245009700041210006900138260000900207300001400216490000700230100001500237856011800252 2015 eng d00aIntelligent embedded health care seat cushion of vision robot design by fuzzy neural network0 aIntelligent embedded health care seat cushion of vision robot de c2015 a120 - 1250 v131 aMon, Y.-J. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84930401978&partnerID=40&md5=bc2d96d93cfdaf239d1843e2b41e6cfe00504nas a2200133 4500008004100000245008600041210006900127260000900196300001400205490000700219100001200226700001400238856011800252 2015 eng d00aKernel fuzzy C-means clustering for word sense disambiguation in biomedical texts0 aKernel fuzzy Cmeans clustering for word sense disambiguation in  c2015 a411 - 4200 v131 aRen, K.1 aRen, Y.F. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84959203977&partnerID=40&md5=9bc27e007ec898b6bf5ebe7335ceb61200527nas a2200157 4500008004100000245006700041210006300108260000900171300001400180490000700194100001200201700001200213700001300225700001300238856011800251 2015 eng d00aA malicious peers detection framework for peer-to-peer systems0 amalicious peers detection framework for peertopeer systems c2015 a224 - 2330 v131 aWei, X.1 aFan, J.1 aWang, T.1 aWang, Q. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84942519413&partnerID=40&md5=fc3039a25dbc94ef9afe8a2afb325e1b00564nas a2200157 4500008004100000245009300041210006900134260000900203300001400212490000700226100001300233700001400246700001300260700001500273856011800288 2015 eng d00aMedical image retrieval based on an improved non-negative matrix factorization algorithm0 aMedical image retrieval based on an improved nonnegative matrix  c2015 a421 - 4280 v131 aWang, J.1 aLai, S.Y.1 aLi, M.D.1 aLies, D.H. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84959237960&partnerID=40&md5=ee501167cf7cb57cf0c511a61603a1a200567nas a2200169 4500008004100000245007800041210006900119260000900188300001400197490000700211100001100218700001300229700001400242700001100256700001200267856011800279 2015 eng d00aMining Frequent patterns through microaggregation in differential privacy0 aMining Frequent patterns through microaggregation in differentia c2015 a126 - 1310 v131 aNi, Z.1 aLi, Q.M.1 aLiu, X.Q.1 aLi, T.1 aHou, R. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84930403398&partnerID=40&md5=c7f34a551be4df7b2da2a9b9464c607b00573nas a2200145 4500008004100000245012900041210006900170260000900239300001400248490000700262100001400269700001400283700001200297856011800309 2015 eng d00aModel Computing System for Emergent Infectious Disease Prevention and Control Ability Evaluation of Medical Building Network0 aModel Computing System for Emergent Infectious Disease Preventio c2015 a373 - 3800 v131 aZhang, H.1 aZhang, S.1 aLiu, N. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84959857446&partnerID=40&md5=ad80f478bba0d7ef819f61056d0d1d0200564nas a2200157 4500008004100000245008600041210006900127260000900196300001400205490000700219100001600226700001500242700001600257700001500273856011800288 2015 eng d00aA new color descriptor for content-based image retrieval: Application to COIL-1000 anew color descriptor for contentbased image retrieval Applicatio c2015 a472 - 4790 v131 aAsnaoui, El1 aChawki, Y.1 aAksasse, B.1 aOuanan, M. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84959251166&partnerID=40&md5=71c911c1ef2325b8357c7a9122d8d32900532nas a2200157 4500008004100000245006700041210006500108260000900173300001200182490000700194100001500201700001300216700001600229700001100245856011800256 2015 eng d00aA new recognition approach for logical link blocks in webpages0 anew recognition approach for logical link blocks in webpages c2015 a76 - 850 v131 aWang, X.M.1 aWu, Z.D.1 aHuang, Y.N.1 aGu, Q. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84930396310&partnerID=40&md5=4d563f444bd172f8c11110f370212a2a00551nas a2200145 4500008004100000245010000041210006900141260000900210300001400219490000700233100001600240700001600256700001500272856011800287 2015 eng d00aA novel defect tracking algorithm for ink-jet printing video based on particle filter framework0 anovel defect tracking algorithm for inkjet printing video based  c2015 a405 - 4100 v131 aZhou, J.-N.1 aFeng, Z.-L.1 aLin, Z.-H. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84959201190&partnerID=40&md5=5a43eb9e5b049c7ccbe814100c4f200c00529nas a2200157 4500008004100000245007300041210006900114260000900183300001000192490000700202100001100209700001100220700001100231700001100242856011800253 2015 eng d00aA novel particle swarm optimization algorithm for network clustering0 anovel particle swarm optimization algorithm for network clusteri c2015 a1 - 90 v131 aLi, Z.1 aHe, L.1 aLi, Z.1 aLi, Y. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84930347581&partnerID=40&md5=b7f3efd86055985fab003c63b133e03a00520nas a2200133 4500008004100000245010300041210006900144260000900213300001400222490000700236100001200243700001300255856011800268 2015 eng d00aOptimization of reconstruction of 2D medical images based on computer 3D reconstruction technology0 aOptimization of reconstruction of 2D medical images based on com c2015 a142 - 1460 v131 aLiu, S.1 aPeng, J. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84938604272&partnerID=40&md5=1f0030c870b50621048bce878bc27d6600483nas a2200121 4500008004100000245008700041210006900128260000900197300001400206490000700220100001600227856011800243 2015 eng d00aPaper hijacking: Hijackers are attacking journals for hijacking unpublished papers0 aPaper hijacking Hijackers are attacking journals for hijacking u c2015 a306 - 3070 v131 aDadkhah, M. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84942516743&partnerID=40&md5=7f7001b6621fbfce1e57b4250206d07000586nas a2200169 4500008004100000245009600041210006900137260000900206300001400215490000700229100001200236700001100248700001300259700001300272700001300285856011800298 2015 eng d00aPower station flue gas desulfurization system based on automatic online monitoring platform0 aPower station flue gas desulfurization system based on automatic c2015 a480 - 4880 v131 aLiu, X.1 aMa, C.1 aYang, X.1 aYang, C.1 aDiao, Y. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84959194530&partnerID=40&md5=412732dc4426687d89037ffb1fe2083700656nas a2200157 4500008004100000245016700041210006900208260000900277300001400286490000700300100002000307700002200327700001500349700001600364856011800380 2015 eng d00aProviding mobile traffic analysis as-a-Service: Design of a service-based infrastructure to offer high-accuracy traffic classifiers based on hardware accelerators0 aProviding mobile traffic analysis asaService Design of a service c2015 a256 - 2650 v131 aBarbareschi, M.1 aDe Benedictis, A.1 aMazzeo, A.1 aVespoli, A. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84942523467&partnerID=40&md5=be532781710ddddfc3aa468942d2fc7600500nas a2200133 4500008004100000245008500041210006900126260000900195300001400204490000700218100001200225700001100237856011800248 2015 eng d00aRecognizing Discrepant Traffic Data Based on Least Square Support Vector Machine0 aRecognizing Discrepant Traffic Data Based on Least Square Suppor c2015 a381 - 3840 v131 aYao, C.1 aGu, J. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84959856888&partnerID=40&md5=7cb3fbd419b2490aba4f5c026628003f00580nas a2200169 4500008004100000245009000041210006900131260000900200300001400209490000700223100001100230700001400241700001400255700001100269700001200280856011800292 2015 eng d00aThe research of scale-free sensor network topology evolution based on cloud computing0 aresearch of scalefree sensor network topology evolution based on c2015 a266 - 2750 v131 aHe, Y.1 aZhang, W.1 aJiang, N.1 aLi, L.1 aLuo, X. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84942511265&partnerID=40&md5=9a5bc2cf6892f518d2988276246f285900492nas a2200121 4500008004100000245009900041210006900140260000900209300001400218490000700232100001300239856011800252 2015 eng d00aResearch on Application of Digital Literature Archives Management Based on XML Database System0 aResearch on Application of Digital Literature Archives Managemen c2015 a367 - 3720 v131 aYang, Y. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84959853519&partnerID=40&md5=7889c5ca766e50d35f6bdcfec6fe678000582nas a2200157 4500008004100000245008400041210006900125260000900194300001400203490000700217100002100224700002100245700001800266700002200284856011800306 2015 eng d00aResource Allocation with Exponential Model Prediction for Server Virtualization0 aResource Allocation with Exponential Model Prediction for Server c2015 a385 - 3980 v131 aPrangchumpol, D.1 aSophatsathit, P.1 aLursinsap, C.1 aTantasanawong, P. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84959858800&partnerID=40&md5=c2071f7fd5a13a3d062e5f6fe50386fe00543nas a2200157 4500008004100000245007800041210006900119260000900188300001200197490000700209100001200216700001400228700001400242700001100256856011800267 2015 eng d00aAn RFID Data cleaning strategy based on maximum entropy feature selection0 aRFID Data cleaning strategy based on maximum entropy feature sel c2015 a86 - 910 v131 aLiu, Y.1 aLiu, Y.Z.1 aZhang, H.1 aLi, T. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84930392305&partnerID=40&md5=9d8f3ec32b78855920a893ba7854bec200524nas a2200133 4500008004100000245010200041210006900143260000900212300001200221490000700233100001500240700001700255856011800272 2015 eng d00aA semantic approach to enhance HITS algorithm for extracting associated concepts using ConceptNet0 asemantic approach to enhance HITS algorithm for extracting assoc c2015 a55 - 620 v131 aAlsoos, M.1 aKheirbek, A. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84930359429&partnerID=40&md5=627ea17640f272c8144f60205cfa14e400609nas a2200145 4500008004100000245016000041210006900201260000900270300001400279490000700293100001400300700001600314700001500330856011800345 2015 eng d00aSimulation study on the effect of employee mobility on the spreading of tacit knowledge among industrial enterprises based on the knowledge spreading model0 aSimulation study on the effect of employee mobility on the sprea c2015 a445 - 4500 v131 aZhu, H.M.1 aZhang, S.T.1 aLang, Y.J. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84959184125&partnerID=40&md5=8d279888fcea216ca2346d99c18ce71a00554nas a2200157 4500008004100000245008200041210006900123260000900192300001400201490000700215100001200222700001200234700001800246700001400264856011800278 2015 eng d00aSina weibo incident monitor and Chinese disaster microblogging classification0 aSina weibo incident monitor and Chinese disaster microblogging c c2015 a156 - 1610 v131 aBai, H.1 aLin, X.1 aRobinsion, B.1 aPower, R. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84938605096&partnerID=40&md5=0295a6e5d147150bd11644b6a64fd13400526nas a2200145 4500008004100000245007800041210006700119260000900186300001200195490000700207100001700214700001500231700001600246856011800262 2015 eng d00aAn SMS - Based one - Time - Password scheme with client - Side validation0 aSMS Based one Time Password scheme with client Side validation c2015 a69 - 750 v131 aHwang, J.-J.1 aHsu, Y.-C.1 aLiao, G.-Y. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84930396014&partnerID=40&md5=25262d5aa35b7270c00ed1be30ba156500621nas a2200169 4500008004100000245011800041210006900159260000900228300001200237490000700249100001700256700001500273700001400288700001700302700001400319856011800333 2015 eng d00aStudy on the 3D information reconstruction and management of cultural relics based on the articulated arm scanner0 aStudy on the 3D information reconstruction and management of cul c2015 a31 - 380 v131 aZhang, X.-D.1 aHou, M.-L.1 aHu, Y.-Y.1 aZhang, X.-Q.1 aWu, Y.-H. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84930349218&partnerID=40&md5=53aa49c6b138faae7f80780d39bb0fde00621nas a2200169 4500008004100000245011900041210006900160260000900229300001400238490000700252100001500259700001700274700001700291700001300308700001200321856011800333 2015 eng d00aTacit knowledge spreading based on knowledge spreading model on networks with consideration of intention mechanism0 aTacit knowledge spreading based on knowledge spreading model on  c2015 a293 - 2990 v131 aZhu, H.-M.1 aZhang, S.-T.1 aZhang, Y.-Y.1 aWang, F.1 aLiu, K. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84942525245&partnerID=40&md5=49327da3411a33f3822677a64952560c00522nas a2200121 4500008004100000245012800041210006900169260000900238300001400247490000700261100001400268856011800282 2015 eng d00aThree-dimensional reconstruction of binocular stereo vision based on improved surf algorithm and KD-Tree matching algorithm0 aThreedimensional reconstruction of binocular stereo vision based c2015 a462 - 4660 v131 aCheng, J. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84959226715&partnerID=40&md5=c7814fee292ae675ed8df9aa27700f4a00527nas a2200145 4500008004100000245008400041210006900125260000900194300001400203490000700217100001200224700001400236700001300250856011800263 2015 eng d00aTibetan Word Sense Disambiguation Based on a Semantic knowledge Network Diagram0 aTibetan Word Sense Disambiguation Based on a Semantic knowledge  c2015 a346 - 3530 v131 aQiu, L.1 aJiang, X.1 aLing, R. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84959854282&partnerID=40&md5=6ebfa5c50654802f8807568584d3d3e600541nas a2200157 4500008004100000245007400041210006900115260000900184300001400193490000700207100001200214700001400226700001300240700001200253856011800265 2015 eng d00aUnderstanding Geographical Space with Big Data: A Network Perspective0 aUnderstanding Geographical Space with Big Data A Network Perspec c2015 a354 - 3600 v131 aMao, L.1 aZheng, B.1 aZhao, G.1 aLiu, L. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84959853984&partnerID=40&md5=e14d86c5b381ac06445461758f94aef800551nas a2200133 4500008004100000245013100041210006900172260000900241300001400250490000700264100001200271700001600283856011800299 2015 eng d00aThe wavelength division multiplexing passive optical network breakpoint precision detection system based broadband chaos light0 awavelength division multiplexing passive optical network breakpo c2015 a276 - 2850 v131 aZou, D.1 aZhang, Y.J. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84942510569&partnerID=40&md5=5c796d62fc66eaece2d1ef7fd3501ee700508nas a2200121 4500008004100000245011500041210006900156260000900225300001200234490000700246100001500253856011800268 2015 eng d00aWSN-Based indoor location identification system (LIS) applied to vision robot designed by fuzzy neural network0 aWSNBased indoor location identification system LIS applied to vi c2015 a39 - 440 v131 aMon, Y.-J. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84930336145&partnerID=40&md5=41376161b34353ac9ef5039b0169fe7601202nas a2200205 4500008004100000245007500041210006900116260000900185300001300194490000700207520050000214653001600714653002300730653003000753653002000783653003400803653002700837100001500864856011700879 2014 eng d00aAcupuncture system based on computer techniques and database diagnosis0 aAcupuncture system based on computer techniques and database dia c2014 a93 - 1010 v123 aThe 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.10aAcupuncture10aContent processing10aEA (Electric acupuncture)10aExpert database10aThe maximum likelihood method10aVideo frame processing1 aPei, S.-L. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84903169031&partnerID=40&md5=043e6726f6964463af5cf04005a78a3d01746nas a2200253 4500008004100000245008000041210006900121260000900190300001000199490000700209520093800216653003101154653002001185653003701205653001201242653002701254100001701281700001401298700001501312700001601327700001601343700001601359856011701375 2014 eng d00aAdaptive fuzzy PID control for servo motor direct-drive pump control system0 aAdaptive fuzzy PID control for servo motor directdrive pump cont c2014 a1 - 70 v123 aThe 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.10aAdaptive fuzzy PID control10aAMESim/simulink10aDirect-drive pump control system10aLabview10aPosition servo control1 aZheng, J.-M.1 aHe, M.-J.1 aLiu, E.-D.1 aYuan, Q.-L.1 aXiao, J.-M.1 aTang, A.-F. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84900429525&partnerID=40&md5=987ea43b8cb58e566d21061a4b7a355801574nas a2200217 4500008004100000245007500041210006900116260000900185300001400194490000700208520090300215653002001118653001101138653001501149653002001164100001501184700001301199700001501212700001201227856011701239 2014 eng d00aAnalysis of information management and scheduling technology in hadoop0 aAnalysis of information management and scheduling technology in  c2014 a133 - 1380 v123 aDevelopment of big data computing has brought many changes to society and social life is constantly digitized. 'How to handle vast amounts of data' 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'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.10aCloud computing10aHadoop10aMap Reduce10aTask Scheduling1 aWeihua, M.1 aHong, Z.1 aQianmu, L.1 aBin, X. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84903118321&partnerID=40&md5=9c6201daf048bd5fc8d52c577eeb612602134nas a2200217 4500008004100000245007800041210006900119260000900188300001400197490000700211520142600218653001801644653001701662653003201679653002501711653001901736100001501755700001301770700001601783856011701799 2014 eng d00aCampsna: A cloud assisted mobile peer to peer social network architecture0 aCampsna A cloud assisted mobile peer to peer social network arch c2014 a126 - 1320 v123 aIn 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.10aData exchange10aMobile Cloud10aMobile peer to peer Network10aNetwork Architecture10aSocial Network1 aLiu, Y.-N.1 aTang, H.1 aZhao, G.-F. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84903137451&partnerID=40&md5=eeaa0a8cdbbd54b68c6c7fb395d2169200320nas a2200109 4500008004100000245001400041210001400055260000900069300000800078490000700086856011700093 2014 eng d00aEditorial0 aEditorial c2014 a - 0 v12 uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84900397968&partnerID=40&md5=cab115be1393d3861d80cd3c160359f501469nas a2200193 4500008004100000245006800041210006800109260000900177300001400186490000700200520082000207653002801027653002501055653002601080653002701106653001301133100001201146856011701158 2014 eng d00aEvaluation model for internet cloud data structure audit system0 aEvaluation model for internet cloud data structure audit system c2014 a108 - 1130 v123 aAs 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'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.10aAudit system evaluation10aCloud data structure10aCould data processing10aInformation processing10aInternet1 aFan, W. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84903171427&partnerID=40&md5=13723b36a13841eb49681a783fae672702357nas a2200229 4500008004100000245013000041210006900171260000900240300001200249490000700261520157200268653003001840653001701870653001701887653002201904100001601926700002001942700001801962700001501980700001501995856011702010 2014 eng d00aImplementing and evaluating a smart-M3 platform-based multi-vendor micropayment system pilot in the context of small business0 aImplementing and evaluating a smartM3 platformbased multivendor  c2014 a44 - 510 v123 aToday, 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' 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.10aElectronic payment system10aMicropayment10aMulti-vendor10aSmart-M3 platform1 aRohunen, A.1 aEteläperä, M.1 aLiukkunen, K.1 aTulppo, T.1 aChan, K.W. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84900390339&partnerID=40&md5=0dbddde65f1c4cabb8e7e74284b24fe501517nas a2200253 4500008004100000245007000041210006700111260000900178300001400187490000700201520072800208653002700936653002700963653002800990653001501018653002401033653002001057100001601077700001301093700001301106700001501119700001201134856011701146 2014 eng d00aAn indirect security trust method based on credibility evaluation0 aindirect security trust method based on credibility evaluation c2014 a139 - 1500 v123 aIn 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.10aCredibility Evaluation10aFuzzy based Evaluation10aIndirect Recommendation10aReputation10aSecurity Evaluation10aTrust Mechanism1 aXianghe, W.1 aHong, Z.1 aZhen, L.1 aQianmu, L.1 aBin, X. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84903216443&partnerID=40&md5=a59d1e2ce7d032c7b4f8031b81f9574201855nas a2200193 4500008004100000245010600041210006900147260000900216300001100225490000700236520117800243653002801421653002201449653002501471653002401496100001301520700001101533856011701544 2014 eng d00aThe influence of government intervention on logistics enterprise's adoption of information technology0 ainfluence of government intervention on logistics enterprises ad c2014 a8 - 170 v123 aWith 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.10aGovernment intervention10aInnovation policy10aLogistics enterprise10aTechnology adoption1 aXiao, L.1 aMa, X. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84900452701&partnerID=40&md5=112750f1b798a63b5af1ec6502ed603a01246nas a2200193 4500008004100000245010200041210006900143260000900212300001200221490000700233520054100240653002100781653004400802653002600846653003800872100001300910700001200923856011700935 2014 eng d00aThe performance evaluation of university scientific research project management based on the FAHP0 aperformance evaluation of university scientific research project c2014 a18 - 250 v123 aAlong 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.10aCollege research10aFuzzy analytic hierarchy process (FAHP)10aFuzzy judgment matrix10aManagement performance evaluation1 aWang, B.1 aLiu, D. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84900456922&partnerID=40&md5=ce39e1cb0f995af4ded628027c5968ea01581nas a2200205 4500008004100000245010800041210006900149260000900218300001400227490000700241520086900248653002001117653002201137653001901159653001701178653002801195653002201223100001301245856011701258 2014 eng d00aResearch on analysis of factors influencing terrestrial transmission efficiency of satellite data files0 aResearch on analysis of factors influencing terrestrial transmis c2014 a120 - 1250 v123 aThe 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.10aNumber of Files10aNumber of Threads10aSatellite Data10aTransmission10aTransmission Efficiency10aTransmission Time1 aJing, Z. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84903203624&partnerID=40&md5=f19f3afd8384101a14eb338817baff3c01395nas a2200205 4500008004100000245010300041210006900144260000900213300001400222490000700236520069600243653003400939653001900973653002100992100001401013700001601027700001401043700001501057856011701072 2014 eng d00aResearch on application of image encryption technology based on chaotic of cellular neural network0 aResearch on application of image encryption technology based on  c2014 a151 - 1580 v123 aThis 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' scrambling degree, small correlation between adjacent pixels, strong anti attack, higher security.10aCellular Neural Network (CNN)10aChaotic System10aImage Encryption1 aLi, G.-D.1 aZhao, G.-M.1 aXu, W.-X.1 aYao, S.-Z. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84903142349&partnerID=40&md5=c7341677c7c2ee9af614f1ed54e5a66c01506nas a2200193 4500008004100000245009300041210006900134260000900203300001400212490000700226520082900233653002701062653002601089653002801115653002701143653001301170100001201183856011701195 2014 eng d00aResearch on ontology construction and information extraction technology based on wordnet0 aResearch on ontology construction and information extraction tec c2014 a114 - 1190 v123 aIntroducing ontology in the field of information extraction can effectively improve the performance of information extraction. Ontology of college teachers' 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.10aInformation processing10aOntology construction10aOntotology construction10aSimilarity calculation10aWord net1 aHua, H. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84903142066&partnerID=40&md5=34f76335049f1f44a30d7889f3b2dfd601453nas a2200241 4500008004100000245009700041210006900138260000900207300001200216490000700228520070300235653002300938653002900961653000900990653000800999653002701007100001301034700001201047700001101059700001301070700001101083856011701094 2014 eng d00aResearch on the Application of SIFT Algorithm in UAV remote sensing image feature extraction0 aResearch on the Application of SIFT Algorithm in UAV remote sens c2014 a67 - 720 v123 aUAV 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.10aContent processing10aFeature point extraction10aSIFT10aUAV10aVideo frame processing1 aYuan, D.1 aCui, X.1 aXu, W.1 aHong, X.1 aYu, S. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84903184144&partnerID=40&md5=bddf4902f4b44d9155c7e7ef6b18bbbc01895nas a2200205 4500008004100000245009100041210007000132260000900202300001200211490000700223520122800230653003101458653001001489653001601499653001901515100001401534700001301548700001101561856011701572 2014 eng d00aResolving rule conflicts based on Naïve Bayesian model for associative classification0 aResolving rule conflicts based on Naïve Bayesian model for assoc c2014 a36 - 430 v123 aThe 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ï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' 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ïve Bayesian classification.10aAssociative classification10aBayes10aData mining10aRule conflicts1 aHuang, Z.1 aZhou, Z.1 aHe, T. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84900460217&partnerID=40&md5=bec565675923a67f04838dadf519210d01867nas a2200241 4500008004100000245006400041210006200105260000900167300001400176490000700190520112000197653002001317653001901337653002301356653001901379653002001398653002401418653002201442100001201464700001501476700001701491856011701508 2014 eng d00aA SEIR model epidemic of virus on the online social network0 aSEIR model epidemic of virus on the online social network c2014 a102 - 1070 v123 aVigorous development of computer technology has made computers play an integral role in people'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'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.10aComplex network10aComputer virus10aEpidemic spreading10aSocial Network10aSocial networks10aTransmission factor10aVirus propagation1 aMin, Y.1 aQianmu, L.1 aYaoliang, S. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84903186303&partnerID=40&md5=6a9d4aa50e806dcc14698506b1e5b11501727nas a2200265 4500008004100000245003900041210003700080260000900117300001200126490000700138520098900145653001501134653001601149653001101165653001801176653001601194653001901210653003801229653001401267653001301281100001701294700001701311700001601328856011701344 2014 eng d00aSoft-404 pages, a crawling problem0 aSoft404 pages a crawling problem c2014 a73 - 920 v123 aDuring 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.10aAlgorithms10aData mining10aDesign10aLink analysis10aPerformance10aSoft-404 error10aStatistical properties of the web10aWeb decay10aWeb spam1 aPrieto, V.M.1 aÁlvarez, M.1 aCacheda, F. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84903202899&partnerID=40&md5=fa1bd1e59e4da6c413c6527da17e6e6b01270nas a2200193 4500008004100000245008400041210006900125260000900194300001200203490000700215520063400222653002200856653002000878653002800898100001100926700001100937700001100948856011700959 2014 eng d00aStudy on college student credit evaluation and prediction based on RF algorithm0 aStudy on college student credit evaluation and prediction based  c2014 a26 - 300 v123 aIn 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.10aCredit evaluation10aPrediction mode10aRandom forest algorithm1 aMu, J.1 aXu, L.1 aPu, H. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84900433117&partnerID=40&md5=50b322efa1e0fc719d4244f770e8918a01209nas a2200181 4500008004100000245005600041210005500097260000900152300001200161490000700173520060600180653002900786653002100815653004500836653001600881100001300897856011700910 2014 eng d00aTensor graph-optimized linear discriminant analysis0 aTensor graphoptimized linear discriminant analysis c2014 a31 - 350 v123 aGraph-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.10aDimensionality reduction10aFace recognition10aGraph-based fisher discriminant analysis10aTensor data1 aChen, J. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84900431732&partnerID=40&md5=cbccd93685522d83cd7e46df5728b79701795nas a2200181 4500008004100000245010900041210006900150260000900219300001400228490000700242520114100249653002401390653002301414653002201437653002201459100001501481856011701496 2013 eng d00aAlgorithm of distributed mining community structure used in sports psychology based on local information0 aAlgorithm of distributed mining community structure used in spor c2013 a248 - 2550 v113 aThe 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-â algorithm while keeping the accuracy. Then we implement the algorithm with the model of MapReduce, and run the program on the Hadoop platform.10aCommunity structure10aDistributed mining10aLocal information10aSports psychology1 aSidong, C. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84880793261&partnerID=40&md5=88f2eaba1351c936f816b0f0b67ac7b401794nas a2200193 4500008004100000245007800041210006900119260000900188300001200197490000700209520115700216653002101373653002001394653001301414653002201427653002201449100001201471856011701483 2013 eng d00aAn algorithm of wavelet data compression based on wireless sensor network0 aalgorithm of wavelet data compression based on wireless sensor n c2013 a54 - 610 v113 aFirstly, this paper gives a data aggregation algorithm based on learning automata to solve the problem that the existing data aggregation algorithm can't solve, the uneven energy cost, and the existing algorithm can'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.10aData compression10aGatherting path10aHot node10aLearning automata10aWavelet Transform1 aLuo, X. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84879075413&partnerID=40&md5=96bdcc7d815f35b35316761219475c3d01718nas a2200181 4500008004100000245011700041210006900158260000900227300001400236490000700250520104700257653002201304653002201326653002301348653003501371100001301406856011701419 2013 eng d00aAlgorithm research for supply chain demand prediction - Taking fresh agricultural product enterprises as example0 aAlgorithm research for supply chain demand prediction Taking fre c2013 a160 - 1640 v113 aSupply 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.10aBP Neural Network10aLegendre wavelets10aMarkets management10aSupply chain demand prediction1 aWang, H. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84879120765&partnerID=40&md5=78a05f213a7f4f86b41f6e014b4c897b01673nas a2200169 4500008004100000245014500041210006900186260000900255300001400264490000700278520101800285653002101303653002301324653002801347100001101375856011701386 2013 eng d00aThe analysis of network structure model and innovation network characteristics for industrial cluster: Using complicated network perspective0 aanalysis of network structure model and innovation network chara c2013 a277 - 2830 v113 a

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'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.

10aIndustry cluster10aInnovation network10aNetwork structure model1 aQi, W. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84888314006&partnerID=40&md5=b983e8753037ff953c725592163f784701015nas a2200181 4500008004100000245009200041210006900133260000900202300001400211490000700225520040700232653002500639653001700664653001200681100001100693700001200704856011700716 2013 eng d00aApplication of finite volume method for solving two-dimensional Navier Stokes equations0 aApplication of finite volume method for solving twodimensional N c2013 a321 - 3260 v113 aThe 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.10aFinite volume method10aNS equations10aRiemann1 aNi, J.1 aWei, X. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84890477987&partnerID=40&md5=7acba40f69d1d5d175c6bb896216f1c401027nas a2200169 4500008004100000245011900041210006900160260000900229300001200238490000700250520037800257653003800635653002700673653002800700100001200728856011700740 2013 eng d00aApproach to cultivate talents of information management under the combination of information and industrialization0 aApproach to cultivate talents of information management under th c2013 a25 - 320 v113 aHigh 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's talents of information management was analyzed, and based on that, we suggested the talents training mode.10aInformation and industrialization10aInformation management10aTalent cultivation mode1 aFen, L. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84879088342&partnerID=40&md5=febc7bd890d5a8b95f7dc5834bb8aa7601498nas a2200181 4500008004100000245006200041210006100103260000900164300001400173490000700187520091200194653004001106653001501146100001401161700001101175700001301186856011701199 2013 eng d00aAugmented broadcaster identity-based broadcast encryption0 aAugmented broadcaster identitybased broadcast encryption c2013 a227 - 2340 v113 aIdentity-based Broadcast Encryption (IBBE) has the inherent key escrow problem that Private Key Generator (PKG) can fully determine the user'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.10aIdentity-based broadcast encryption10aKey escrow1 aZhang, J.1 aXu, Y.1 aChen, Z. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84880816896&partnerID=40&md5=1b3634203833f7e75593ce577d867ca501337nas a2200193 4500008004100000245006200041210006200103260000900165300001400174490000700188520071200195653001300907653002100920653002100941653003000962653001800992100001601010856011701026 2013 eng d00aBibliometrical analysis on the big data research in China0 aBibliometrical analysis on the big data research in China c2013 a383 - 3900 v113 aThe 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.10aBig Data10aCluster Analysis10aCo-word analysis10aMultidimensional Analysis10aVisualization1 aRuixian, Y. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84892171702&partnerID=40&md5=aeba904bd887d86dc21fc4991f64a21500818nas a2200181 4500008004100000245004400041210004000085260000900125300001400134490000700148520028600155653001100441653002100452653002100473100001100494700001400505856011700519 2013 eng d00aThe computer design of practical filter0 acomputer design of practical filter c2013 a175 - 1780 v113 aThis 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's advantage is that it is very direct, and universal. So, this method is simple, convenient, practical and fast.10aFilter10aPolynomial shift10aTransform matrix1 aLi, Z.1 aWeixi, Z. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84880791462&partnerID=40&md5=b00b61c35f2558a8a5cc5066cdb53b3d01418nas a2200193 4500008004100000245008400041210006900125260000900194300001400203490000700217520078000224653003101004653001101035653002501046100001201071700001201083700001201095856011701107 2013 eng d00aThe design and implementation of library's user training system based on moodle0 adesign and implementation of librarys user training system based c2013 a298 - 3060 v113 aA 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'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.10aMedical university library10aMoodle10aUser training system1 aSun, Y.1 aLiu, C.1 aCui, X. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84888380258&partnerID=40&md5=3c85e26ff123a30bec20f0933de4f6b301256nas a2200181 4500008004100000245006100041210006100102260000900163300001400172490000700186520067500193653002200868653002300890653001900913100001100932700001400943856011700957 2013 eng d00aDesign of a teaching robot based on fischertechnik model0 aDesign of a teaching robot based on fischertechnik model c2013 a190 - 1930 v113 aThis 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.10aFischechnik model10aPLC control system10aTeaching robot1 aLi, Z.1 aHuang, Z. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84880818201&partnerID=40&md5=ee65643ea046ef1e8cf9d62466a1f2b101525nas a2200217 4500008004100000245009600041210006900137260000900206300001400215490000700229520081500236653002701051653001801078653002001096100001401116700001501130700001501145700001601160700001401176856011701190 2013 eng d00aDifferential evolution for rule extraction and its application in recognizing oil reservoir0 aDifferential evolution for rule extraction and its application i c2013 a435 - 4400 v113 aThe 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.10aDifferential Evolution10aOil Reservoir10aRule Extraction1 aLi, J.-L.1 aGuo, H.-X.1 aZhu, K.-J.1 aWang, D.-Y.1 aHu, J.-L. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84892182107&partnerID=40&md5=822605bef25e5d8a1d8382dfd3d0fb8601555nas a2200181 4500008004100000245008300041210006900124260000900193300001400202490000700216520090000223653002401123653002101147653004001168653003301208100001501241856011701256 2013 eng d00aDigital information facial recognition based on PCA and its improved algorithm0 aDigital information facial recognition based on PCA and its impr c2013 a390 - 3950 v113 aFace 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.10aDigital information10aFace recognition10aImage enhancement processing method10aPrincipal component analysis1 aZhu, H.-F. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84890454789&partnerID=40&md5=9180e88599a60f794e63948a9a7036db01665nas a2200217 4500008004100000245009100041210006900132260000900201300001400210490000700224520093400231653002601165653002401191653002901215653002101244100001701265700001601282700001601298700001601314856011701330 2013 eng d00aA diversity-based multi-antenna cooperative detection model in cognitive radio network0 adiversitybased multiantenna cooperative detection model in cogni c2013 a220 - 2260 v113 aSpectrum 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'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.10aCooperative detection10aDiversity technique10aMulti-antenna technology10aSpectrum sensing1 aZhenquan, Q.1 aWenjing, L.1 aHuizhen, J.1 aWeifeng, S. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84880787172&partnerID=40&md5=c40e6173f1ef81d864ae8908b332906702005nas a2200181 4500008004100000245007200041210006900113260000900182300001000191490000700201520139700208653001901605653002601624653001701650653002801667100001101695856011701706 2013 eng d00aDuopoly game models of water supply in the presence of market power0 aDuopoly game models of water supply in the presence of market po c2013 a1 - 70 v113 aThe 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.10aOligopoly game10aStrategic interaction10aWater market10aWater supply allocation1 aLu, H. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84879120120&partnerID=40&md5=1e1dbd82eabe910e261c6c005e21bd9800320nas a2200109 4500008004100000245001400041210001400055260000900069300000800078490000700086856011700093 2013 eng d00aEditorial0 aEditorial c2013 a - 0 v11 uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84888374235&partnerID=40&md5=e32c0bcd695ba92f192288c14345f02b00320nas a2200109 4500008004100000245001400041210001400055260000900069300000800078490000700086856011700093 2013 eng d00aEditorial0 aEditorial c2013 a - 0 v11 uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84879107959&partnerID=40&md5=93df30dd0327de4b42fd96551b58fd7f00320nas a2200109 4500008004100000245001400041210001400055260000900069300000800078490000700086856011700093 2013 eng d00aEditorial0 aEditorial c2013 a - 0 v11 uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84892149940&partnerID=40&md5=b922ec5a35933d8cebf439855820ccc400320nas a2200109 4500008004100000245001400041210001400055260000900069300000800078490000700086856011700093 2013 eng d00aEditorial0 aEditorial c2013 a - 0 v11 uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84890511635&partnerID=40&md5=e3c808f2849b55c0e265a4ef0f83391f00343nas a2200121 4500008004100000245001400041210001400055260000900069300000800078490000700086100001100093856011700104 2013 eng d00aEditorial0 aEditorial c2013 a - 0 v111 aLi, G. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84879112019&partnerID=40&md5=72399cf5058ac4195b016eef539bb61701645nas a2200205 4500008004100000245004900041210004600090260000900136300001400145490000700159520101900166653002101185653002501206653002001231653002801251653000801279100001701287700001801304856011701322 2013 eng d00aAn efficient use of a mapping knowledge base0 aefficient use of a mapping knowledge base c2013 a307 - 3130 v113 aIn 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.10aData integration10aRelational databases10aSchema matching10aSimilarity coefficients10aXML1 aKahloula, B.1 aBouamrane, K. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84888320638&partnerID=40&md5=d04798bbda1e485e62f2df159a46f9a201505nas a2200193 4500008004100000245008400041210006900125260000900194300001400203490000700217520083600224653001501060653003901075653001301114653001501127653003601142100001601178856011701194 2013 eng d00aEnhancing workflow systems resiliency by using delegation and priority concepts0 aEnhancing workflow systems resiliency by using delegation and pr c2013 a267 - 2760 v113 aEnforcing 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.10aDelegation10aDynamic access control constraints10aPriority10aResiliency10aWorkflow Satisfiability Problem1 aBakkali, El uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84888373794&partnerID=40&md5=fedc10e4bf4acaa3224e1a9dfa459fc002188nas a2200217 4500008004100000245008400041210006900125260000900194300001400203490000700217520149000224653002101714653002301735653001601758653002801774100001301802700001301815700001401828700001101842856011701853 2013 eng d00aException detection for web service composition using improved bayesian network0 aException detection for web service composition using improved b c2013 a108 - 1140 v113 aNew 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.10aBayesian network10aException handling10aWeb service10aWeb service composition1 aChen, Y.1 aYing, S.1 aZhang, L.1 aWu, J. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84879099166&partnerID=40&md5=0973327f022946c84a165872a228552401756nas a2200205 4500008004100000245006800041210006800109260000900177300001400186490000700200520109000207653002501297653001701322653002701339653002501366100001301391700001601404700001301420856011701433 2013 eng d00aFair virtual bandwidth allocation model in virtual data centers0 aFair virtual bandwidth allocation model in virtual data centers c2013 a179 - 1830 v113 aNetwork 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.10aBandwidth allocation10aMulti-tenant10aNetwork virtualization10aVirtual data centers1 aYuan, Y.1 aWang, C.-R.1 aWang, C. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84880784551&partnerID=40&md5=592719b8e0f5ff76a5dbdb85fdbe06e301590nas a2200193 4500008004100000245007800041210006900119260000900188300001400197490000700211520095500218653002101173653002101194653002301215653001601238100001101254700001401265856011701279 2013 eng d00aFault prediction of nonlinear system using time series novelty estimation0 aFault prediction of nonlinear system using time series novelty e c2013 a207 - 2120 v113 aMany 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.10aFault prediction10aNonlinear system10aNovelty estimation10aTime series1 aSu, S.1 aZhang, W. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84880818113&partnerID=40&md5=5fe267d630eb652afa900d99483c0dcf02349nas a2200193 4500008004100000245008200041210006900123260000900192300001200201490000700213520168700220653002101907653002801928653002701956653002901983100001302012700001302025856011702038 2013 eng d00aHierarchical clustering analysis method based on the grid with obstacle space0 aHierarchical clustering analysis method based on the grid with o c2013 a76 - 820 v113 aThe 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ÿ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'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.10aCluster ensemble10aGrid spatial clustering10aMulti-scale clustering10aSpatial cluster analysis1 aShan, D.1 aYang, Z. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84879084446&partnerID=40&md5=8173c506959188548e2182b57f3f31c201158nas a2200217 4500008004100000245008600041210006900127260000900196300001400205490000700219520045100226653002700677653002100704653002800725653002100753653001400774100001100788700001200799700001200811856011700823 2013 eng d00aHigh points recognition method of scraped surface based on background Subtraction0 aHigh points recognition method of scraped surface based on backg c2013 a115 - 1190 v113 aUsing 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.10aBackground subtraction10aContour analysis10aHigh points recognition10aImage processing10aScrapping1 aLi, X.1 aSun, L.1 aLiu, Y. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84879125674&partnerID=40&md5=593c3c4ffe380889b98f09f916fa0b8c01788nas a2200205 4500008004100000245008100041210006900122260000900191300001400200490000700214520111100221653002201332653002201354653003001376653001601406100001601422700001101438700001601449856011701465 2013 eng d00aA hybrid method to deformation force of high-speed cold roll-beating forming0 ahybrid method to deformation force of highspeed cold rollbeating c2013 a146 - 1530 v113 aHigh-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.10aCold roll-beating10aDeformation force10aExperimental verification10aSlab method1 aYang, M.-S.1 aLi, Y.1 aYuan, Q.-L. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84879119848&partnerID=40&md5=beed77f3dd930748bf1900ffca1e5ad001705nas a2200229 4500008004100000245007100041210006900112260000900181300001400190490000700204520097700211653002501188653001701213653002301230653002501253653003301278100001201311700001101323700001201334700001201346856011701358 2013 eng d00aImproved image fusion algorithm for detecting obstacles in forests0 aImproved image fusion algorithm for detecting obstacles in fores c2013 a378 - 3840 v113 aThe 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' 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.10aContourlet transform10aImage fusion10aImproved algorithm10aObstacles in forests10aPulse coupled neural network1 aYan, L.1 aYu, Z.1 aHan, N.1 aLiu, J. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84890541561&partnerID=40&md5=16f7eefad0eaee5c1b654f4eb9b1a1ba01279nas a2200193 4500008004100000245005000041210004900091260000900140300001400149490000700163520067100170653002400841653002200865653002500887653002900912100001300941700001400954856011700968 2013 eng d00aInformation sharing in supply chain: A review0 aInformation sharing in supply chain A review c2013 a125 - 1300 v113 aThe 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.10aInformation sharing10aLiterature review10aSupply chain network10aSupply chains management1 aYang, Z.1 aZhang, L. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84879070693&partnerID=40&md5=492576360136fd7384f5e3b18e51a4d101411nas a2200181 4500008004100000245012400041210006900165260000900234300001400243490000700257520074600264653003401010653001201044653003401056100001101090700001101101856011701112 2013 eng d00aThe integration of PCA, FLD and gabor two-dimensional wavelet transformation using facial expression feature extraction0 aintegration of PCA FLD and gabor twodimensional wavelet transfor c2013 a284 - 2890 v113 aIn 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.10aFacial expression recognition10aPCA+FLD10aTwo dimensional gabor wavelet1 aNi, J.1 aLi, Y. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84888357193&partnerID=40&md5=4efdf9679a3c503ac68ea6391448496601280nas a2200205 4500008004100000245009300041210006900134260000900203300001400212490000700226520057700233653002000810653001700830653002700847653001400874653003800888100001600926700001500942856011700957 2013 eng d00aInvestigating a new design pattern for efficient implementation of prediction algorithms0 aInvestigating a new design pattern for efficient implementation  c2013 a366 - 3770 v113 aIn 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.10aDesign patterns10aMarkov Chain10aMulti-layer perceptron10aPredictor10aReusable object-oriented software1 aGellert, A.1 aFlorea, A. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84890511699&partnerID=40&md5=d755a7c4e09429fec9144a9ed21aa35301974nas a2200205 4500008004100000245006300041210006100104260000900165300001400174490000700188520133200195653002201527653002001549653001101569653001901580100001801599700001701617700001701634856011701651 2013 eng d00aA leakage monitoring system of pipeline in heating network0 aleakage monitoring system of pipeline in heating network c2013 a462 - 4690 v113 aSupervisory 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.10aGenetic Algorithm10aHeating Network10aMATLAB10aPressure Graph1 aXianliang, Y.1 aLianlian, J.1 aSongling, W. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84892175513&partnerID=40&md5=1c08ed8b399411798f88e31b5dd14cec01530nas a2200217 4500008004100000245006500041210006300106260000900169300001400178490000700192520084900199653003401048653001501082653002601097653002301123100001401146700001201160700001101172700001201183856011701195 2013 eng d00aModeling and simulation of DIGSILENT-based micro-grid system0 aModeling and simulation of DIGSILENTbased microgrid system c2013 a342 - 3510 v113 aThe 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'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.10aBattery energy storage system10aMicro grid10aPhotovoltaic inverter10aSilicon solar cell1 aZhang, Y.1 aZhu, X.1 aLi, Q.1 aLiu, T. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84890522361&partnerID=40&md5=6ae6926a5a8e9c87e46f14f7d564b0cc02104nas a2200205 4500008004100000245011300041210006900154260000900223300001400232490000700246520138500253653002201638653002201660653002601682653001801708653002601726100001301752700001601765856011701781 2013 eng d00aThe modeling of genetic and Tabu search algorithm based BP neural network in the risk analysis of investment0 amodeling of genetic and Tabu search algorithm based BP neural ne c2013 a391 - 3990 v113 aThere are many parameters which affect the economic benefit indicators for evaluation and they are all uncertain. Because of the parameters' 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.10aBP Neural Network10aGenetic Algorithm10aInvestment Evaluation10aRisk Analysis10aTabu Search Algorithm1 aYang, L.1 aYunlong, D. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84892147727&partnerID=40&md5=33572128b86e13bfcb8fb0b8e2c3299401784nas a2200181 4500008004100000245009900041210006900140260000900209300001200218490000700230520114500237653002201382653002001404653002301424653002501447100001301472856011701485 2013 eng d00aModeling resource-constrained project scheduling problem and its solution by genetic algorithm0 aModeling resourceconstrained project scheduling problem and its  c2013 a87 - 960 v113 aThe 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.10aGenetic Algorithm10aNP-hard problem10aProject scheduling10aResource constraints1 aChai, C. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84879108012&partnerID=40&md5=6b5486fdec78b400439deebbf407f5b001878nas a2200205 4500008004100000245008900041210006900130260000900199300001400208490000700222520116300229653002201392653002001414653003501434653002401469653003601493100001301529700001301542856011701555 2013 eng d00aA new shuffled frog leaping algorithm with space zoomed factor and gravity attractor0 anew shuffled frog leaping algorithm with space zoomed factor and c2013 a352 - 3580 v113 aShuffled 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.10aGravity attractor10aSearch strategy10aShuffled frogleaping algorithm10aSpace zoomed factor10aSwarm intelligence optimization1 aTang, D.1 aYang, J. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84890525256&partnerID=40&md5=78a3eaab0aabe647fea2933aa34ed25402118nas a2200193 4500008004100000245009600041210006900137260000900206300001400215490000700229520142900236653001901665653002701684653003001711653002701741653002801768100001101796856011701807 2013 eng d00aA novel fault identifying method with supervised classification and unsupervised clustering0 anovel fault identifying method with supervised classification an c2013 a184 - 1890 v113 aTo 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.10aFault identify10aSubtractive clustering10aSupervised classification10aSupport vector machine10aUnsupervised clustering1 aXu, T. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84880836927&partnerID=40&md5=9f7c84bdac0bd7c607dac64aa37c736201354nas a2200217 4500008004100000245006500041210006300106260000900169300001400178490000700192520068500199653001900884653000800903653003000911653002000941653000900961653002500970100001200995700001201007856011701019 2013 eng d00aA novel RFID authentication protocol with ownership transfer0 anovel RFID authentication protocol with ownership transfer c2013 a476 - 4810 v113 aDuring 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.10aAuthentication10aBAN10aPublic Key Infrastructure10aRadio Frequency10aRFID10aSecurity and Privacy1 aSun, D.1 aLiu, D. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84892150043&partnerID=40&md5=b783572fda084b8e9a02a980716334aa01802nas a2200205 4500008004100000245009300041210006900134260000900203300001400212490000700226520107700233653003301310653003201343653003401375653002701409100001501436700001601451700001201467856011701479 2013 eng d00aOptimization and application of support vector machine based on SVM algorithm parameters0 aOptimization and application of support vector machine based on  c2013 a165 - 1690 v113 aThe 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.10aCustomer data classification10aKernel parameters selection10aParticle swarm pattern search10aSupport vector machine1 aYan, H.-F.1 aWang, W.-F.1 aLiu, J. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84879098093&partnerID=40&md5=aa26078b417c2386e1244d36d3bacb0901790nas a2200205 4500008004100000245009400041210006900135260000900204300001400213490000700227520106500234653002001299653002901319653002601348653003201374653002601406100001601432700001901448856011701467 2013 eng d00aOrchestrating the natural language processing software in the cloud computing environment0 aOrchestrating the natural language processing software in the cl c2013 a396 - 3990 v113 aThe 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'000 sentences from the Russian news subcorpus of the Leipzig corpora. The benchmarks are presented and discussed.10aCloud computing10aData-intensive computing10aDistributed computing10aNatural Language Processing10aService orchestration1 aUstalov, D.1 aGoldshtein, M. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84890443570&partnerID=40&md5=80168707d25eb1e8a3acabfb35fdf93f01557nas a2200193 4500008004100000245013800041210006900179260000900248300001400257490000700271520080600278653002201084653004101106653004701147653002501194100001301219700001401232856011701246 2013 eng d00aParameters selection in the discrete particle swarm optimization algorithm solving gate and runway combinational optimization problem0 aParameters selection in the discrete particle swarm optimization c2013 a197 - 2010 v113 aGate 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.10aAirport operation10aDiscrete particle swarm optimization10aGate and runway combinational optimization10aParameters selection1 aDing, J.1 aZhang, Y. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84880782704&partnerID=40&md5=b89c7c4e42430962155e9283216c7b7001871nas a2200241 4500008004100000245007500041210006900116260000900185300001400194490000700208520110400215653003601319653002201355653004301377653001101420653002001431100001401451700001101465700001101476700001301487700001201500856011701512 2013 eng d00aProduction line production planning model of iron and steel enterprise0 aProduction line production planning model of iron and steel ente c2013 a131 - 1350 v113 aAt 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.10aAggregate production plan model10aGenetic Algorithm10aIndex terms -iron and steel enterprise10aMATLAB10aProduction line1 aJiang, G.1 aHe, E.1 aLi, G.1 aKong, J.1 aXie, L. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84879110969&partnerID=40&md5=f4274b55fafe675f163de08cb3f49a8701388nas a2200181 4500008004100000245006200041210006200103260000900165300001400174490000700188520072900195653002900924653003900953653003000992653005601022100001101078856011701089 2013 eng d00aRegularized orthogonal local fisher discriminant analysis0 aRegularized orthogonal local fisher discriminant analysis c2013 a154 - 1590 v113 aAiming 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.10aDimensionality reduction10aLocal fisher discriminant analysis10aLocal nonlinear structure10aRegularized orthogonal linear discriminant analysis1 aXu, S. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84879121480&partnerID=40&md5=294ec31f3b8631180e347dff9cae6b7801591nas a2200205 4500008004100000245010500041210006900146260000900215300001200224490000700236520090100243653001801144653001501162653004101177100001101218700001301229700001301242700001301255856011701268 2013 eng d00aThe research and realization of wireless energy consumption detector based on the internet of things0 aresearch and realization of wireless energy consumption detector c2013 a62 - 680 v113 aIntelligent 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.10aIEEE802.15.4E10aSmart home10aWireless energy consumption detector1 aFu, W.1 aShui, M.1 aChen, Y.1 aChen, L. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84879106063&partnerID=40&md5=32877c7463cacdf6d4cc123f5922c0a901249nas a2200205 4500008004100000245006800041210006400109260000900173300001400182490000700196520059500203653001400798653001600812653002500828653002700853653002200880100001300902700001100915856011700926 2013 eng d00aThe research of algorithm for data mining based on fuzzy theory0 aresearch of algorithm for data mining based on fuzzy theory c2013 a327 - 3340 v113 aData 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'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.10aAlgorithm10aData mining10aFuzzy classification10aFuzzy linear separable10aFuzzy programming1 aWang, A.1 aLi, J. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84890455119&partnerID=40&md5=cafd40536136512fd2e0485a0240a56501534nas a2200205 4500008004100000245008200041210006900123260000900192300001400201490000700215520085300222653002301075653002201098653002401120653002201144100001201166700001501178700001801193856011701211 2013 eng d00aResearch on an adaptive algorithm of service selection in pervasive computing0 aResearch on an adaptive algorithm of service selection in pervas c2013 a482 - 4880 v113 aAn 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.10aAdaptive Algorithm10aElitism Selection10aPervasive computing10aService Selection1 aWei, L.1 aLanfei, Z.1 aJianqiang, D. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84892166746&partnerID=40&md5=ea96f5d6b9c178bdf71b3822a053afae01989nas a2200193 4500008004100000245008400041210006900125260000900194300001400203490000700217520131100224653002701535653002001562653002701582653004301609100001301652700001301665856011701678 2013 eng d00aResearch on cluster analysis of high dimensional space based on fuzzy extension0 aResearch on cluster analysis of high dimensional space based on  c2013 a359 - 3650 v113 aTraditional 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'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.10aClustering integration10aFuzzy extension10aMulti-scale clustering10aSpatial clustering of high dimensional1 aShan, D.1 aLi, W.Y. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84890448809&partnerID=40&md5=ad16385737a42e682c93f28740cee12a01299nas a2200181 4500008004100000245009200041210006900133260000900202300001400211490000700225520068800232653002000920653002400940100001200964700001200976700001200988856011701000 2013 eng d00aResearch on digital library personalized information service model based on agent model0 aResearch on digital library personalized information service mod c2013 a418 - 4220 v113 aTaking 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.10aDigital Library10aInformation Service1 aCao, J.1 aLiu, M.1 aCao, L. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84892164200&partnerID=40&md5=5b059b6ec77bef4ae78981c43fbfa23f01538nas a2200205 4500008004100000245007500041210006900116260000900185300001200194490000700206520088900213653002501102653001201127653002801139653001201167100001301179700001101192700001201203856011701215 2013 eng d00aResearch on factors affecting farmers' network information consumption0 aResearch on factors affecting farmers network information consum c2013 a33 - 380 v113 aResearch on farmers' 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' network information consumption, and the conclusions are as follows: 1) there are a number of factors affecting farmers' consumption by using modern network information media; 2) environmental characteristics is the main factor affecting farmers' 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.10aConsumption behavior10aFarmers10aInformation consumption10aNetwork1 aMeng, H.1 aGe, X.1 aXie, M. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84879070031&partnerID=40&md5=afb20649e0143ffa20b16c6c7f385bb801358nas a2200193 4500008004100000245008300041210006900124260000900193300001400202490000700216520069800223653002800921653002800949653002100977653002500998100001101023700001301034856011701047 2013 eng d00aThe research on giant complex system using intelligent decision support system0 aresearch on giant complex system using intelligent decision supp c2013 a335 - 3410 v113 aMankind 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.10aArtificial intelligence10aDecision support system10aFuzzy processing10aGiant complex system1 aLi, J.1 aWang, A. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84890477476&partnerID=40&md5=62072c647fcaedfc91f59a55e1124f4d01334nas a2200193 4500008004100000245007700041210006900118260000900187300001400196490000700210520067600217653002200893653002100915653002700936653003300963100001300996700001401009856011701023 2013 eng d00aResearch on management of mobile communication network centralized alarm0 aResearch on management of mobile communication network centraliz c2013 a261 - 2660 v113 aThis 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.10aAlarm correlation10aAlarm management10aCentralized monitoring10aMobile communication network1 aWang, Y.1 aZhang, R. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84888333439&partnerID=40&md5=95535069f8aee6f6ca3093cd7ac4d8c001471nas a2200241 4500008004100000245007200041210006900113260000900182300001400191490000700205520073000212653002100942653001700963653003100980653001201011653002301023100001101046700001601057700001301073700001301086700001301099856011701112 2013 eng d00aResearch on the anti-perspective correction algorithm of QR barcode0 aResearch on the antiperspective correction algorithm of QR barco c2013 a202 - 2060 v113 a2-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'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.10aImage correction10aLine fitting10aPerspective transformation10aQR code10aSearching graphics1 aLi, J.1 aWang, Y.-W.1 aWang, Y.1 aChen, Y.1 aWang, G. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84880830674&partnerID=40&md5=4b80f450374df6601877d816dd4cc9af01213nas a2200205 4500008004100000245007600041210006900117260000900186300001300195490000700208520054700215653002600762653001700788653003500805100001400840700001100854700001400865700001100879856011700890 2013 eng d00aResearch on the e-commerce of agricultural products in Sichuan province0 aResearch on the ecommerce of agricultural products in Sichuan pr c2013 a97 - 1010 v113 aA 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.10aAgricultural products10aE - commerce10aLogistics information platform1 aJiong, M.1 aXu, L.1 aHuang, Q.1 aLi, C. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84879093653&partnerID=40&md5=a6a6161eb5e909e880cfcdfd360a539c01399nas a2200193 4500008004100000245010800041210006900149260000900218300001400227490000700241520077100248653001401019653001001033653000801043653000901051100001201060700001601072856011701088 2013 eng d00aResearch on the service modeling method of information management software based on the petri net model0 aResearch on the service modeling method of information managemen c2013 a430 - 4340 v113 aWith 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'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.10aPetri Net10aPN-SM10aSOA10aSOMA1 aRui, S.1 aXiaoyan, W. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84892141654&partnerID=40&md5=9aefdc360773763828cb2e16117ebeed01276nas a2200181 4500008004100000245006700041210006700108260000900175300001400184490000700198520065100205653002400856653003300880653002800913100002000941700001600961856011700977 2013 eng d00aResearch on transmission based on collaboration coding in WSNs0 aResearch on transmission based on collaboration coding in WSNs c2013 a441 - 4450 v113 aIn 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.10aNodes Collaboration10aRandom Linear Network Coding10aWireless sensor network1 aXiao-Xing, L.V.1 aBai-Hai, Z. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84892145435&partnerID=40&md5=2d72868947bda082492e18284f12ea5b01405nas a2200229 4500008004100000245005400041210005300095260000900148300001400157490000700171520075600178653000800934653001000942653001400952653002000966653001000986653002200996100001201018700001401030700001401044856011701058 2013 eng d00aRobust zero-watermarking algorithm for CAD models0 aRobust zerowatermarking algorithm for CAD models c2013 a240 - 2430 v113 aCopyright 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.10aCAD10aChaos10aCopyright10aEmbedded design10aNURBS10aZero-watermarking1 aLiu, N.1 aZhang, S.1 aZhang, Y. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84880814416&partnerID=40&md5=7e8682b26931ad23644dd6e4bbbd631802318nas a2200241 4500008004100000245006700041210006700108260000900175300001400184490000700198520158900205653001601794653001701810653002601827653001501853653002801868100001101896700001301907700001201920700001401932700001301946856011701959 2013 eng d00aRobustness analysis of social network based on a dynamic model0 aRobustness analysis of social network based on a dynamic model c2013 a453 - 4610 v113 aDue to the high vulnerability of today'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'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.10aDisruptions10aGraph Theory10aNetwork Damage Degree10aRobustness10aSocial Network Analysis1 aWu, H.1 aYing, S.1 aJia, X.1 aZhang, L.1 aChen, X. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84892163854&partnerID=40&md5=861e44abb43f2d1f64ca3d9c26ee9c4f01408nas a2200205 4500008004100000245007500041210006900116260000900185300001400194490000700208520072300215653002000938653002400958653004600982653002301028100001101051700001101062700001201073856011701085 2013 eng d00aRotation invariant texture image retrieval based on log-polar and NSCT0 aRotation invariant texture image retrieval based on logpolar and c2013 a470 - 4750 v113 aIn 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.10aImage Retrieval10aLog-Polar Transform10aNonsubsampled Contourlet Transform (NSCT)10aRotation Invariant1 aXu, B.1 aLi, Z.1 aXie, S. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84892172030&partnerID=40&md5=1266a1090a336e697f9579c13ca705a601383nas a2200181 4500008004100000245006500041210006500106260000900171300001400180490000700194520080400201653001901005653002501024653001301049653000801062100001401070856011701084 2013 eng d00aSecure digital certificate design based on the RSA algorithm0 aSecure digital certificate design based on the RSA algorithm c2013 a423 - 4290 v113 aWith 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.10aAuthentication10aDigital Certificates10aInternet10aRSA1 aZhong, Y. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84892153961&partnerID=40&md5=9398ee5232d46b8d829b73ca5dbee71401239nas a2200181 4500008004100000245009400041210006900135260000900204300001400213490000700227520059700234653002900831653003300860653001300893100001900906700001500925856011700940 2013 eng d00aSecurity analysis and evaluation of random linear network coding under wiretapping attack0 aSecurity analysis and evaluation of random linear network coding c2013 a446 - 4520 v113 aThis 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.10aMultinode Co-wiretapping10aRandom Linear Network Coding10aSecurity1 aXiaoxing, L.V.1 aBaihai, Z. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84892157046&partnerID=40&md5=987b97220d343f2739f129f050e6b5ef02373nas a2200181 4500008004100000245009500041210006900136260000900205300001400214490000700228520172600235653002501961653002201986653002702008653002302035100001602058856011702074 2013 eng d00aSegmentation strategies for passage retrieval from internet video using speech transcripts0 aSegmentation strategies for passage retrieval from internet vide c2013 a400 - 4080 v113 aWe 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.10aMultimedia Retrieval10aText Segmentation10aUser Generated Content10aVideo Segmentation1 aWartena, C. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84892167136&partnerID=40&md5=41e146d1a72335b63599072284ec5b9e01885nas a2200229 4500008004100000245009500041210006900136260000900205300001200214490000700226520110200233653002201335653001501357653002501372653002501397653003101422653004001453100001701493700001501510700001301525856011701538 2013 eng d00aThe short-term wind power forecast based on phase-space reconstruction and neural networks0 ashortterm wind power forecast based on phasespace reconstruction c2013 a40 - 450 v113 aThe 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.10aBP Neural Network10aDelay time10aElman neural network10aEmbedding dimensions10aPhase-space reconstruction10aThe short-term wind power forecasts1 aZhang, J.-H.1 aLiu, Y.-Q.1 aTian, D. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84879073309&partnerID=40&md5=fdd64e3c0ae9db677a30cd0fc318f9ba01753nas a2200205 4500008004100000245009400041210006900135260000900204300001400213490000700227520108600234653002001320653001401340653001801354653002001372100001301392700001301405700001201418856011701430 2013 eng d00aSpanning tree method for minimum communication costs in grouped virtual mapreduce cluster0 aSpanning tree method for minimum communication costs in grouped  c2013 a213 - 2190 v113 aToday, 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.10aCloud computing10aMapreduce10aSpanning tree10aVirtual machine1 aYang, Y.1 aLong, X.1 aShi, B. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84880774380&partnerID=40&md5=a8db5f920e0bbee748a4977aecbefdf201484nas a2200193 4500008004100000245007000041210006600111260000900177300001400186490000700200520087000207653001701077653001601094653001301110653002001123100001401143700001601157856011701173 2013 eng d00aThe statistical analysis of family names of donators for wenchuan0 astatistical analysis of family names of donators for wenchuan c2013 a235 - 2390 v113 aIt 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's distribution of China.10aDistribution10aExponential10aPowerlaw10aThe family name1 aYufan, L.1 aQinghua, C. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84880773341&partnerID=40&md5=5ab1d739ad89b517599a75710dec963b01514nas a2200241 4500008004100000245007400041210006900115260000900184300001400193490000700207520077100214653002200985653002601007653001701033653001701050653002701067100001101094700001101105700001301116700001401129700001201143856011701155 2013 eng d00aStructure optimization of ladle bottom based on finite element method0 aStructure optimization of ladle bottom based on finite element m c2013 a120 - 1240 v113 aLadle 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's lifetime.10aEquivalent stress10aFinite element method10aLadle bottom10aStress field10aStructure optimization1 aLi, G.1 aLi, Z.1 aKong, J.1 aJiang, G.1 aXie, L. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84879119261&partnerID=40&md5=b9bc4b165b18d48acae83fe0d659cc3e01043nas a2200181 4500008004100000245010000041210006900141260000900210300001400219490000700233520038800240653004000628653002600668653001900694100001500713700001600728856011700744 2013 eng d00aStudy of methods for constructing families of odd-periodic perfect complementary sequence pairs0 aStudy of methods for constructing families of oddperiodic perfec c2013 a194 - 1960 v113 aSome 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.10aOdd-periodic complementary sequence10aPerfect signal theory10aSequence pairs1 aJin, H.-L.1 aChen, J.-X. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84880828927&partnerID=40&md5=e9791258f96791c503bea170292e04cb01103nas a2200193 4500008004100000245006600041210006600107260000900173300001200182490000700194520049400201653001900695653002700714653001300741100001300754700001300767700001200780856011700792 2013 eng d00aStudy on a robot 3D laser radar information collection system0 aStudy on a robot 3D laser radar information collection system c2013 a69 - 750 v113 aThis 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's collection on external image is achieved through the study of Open CV learning that combined with VC2008.10a3D laser radar10aInformation collection10aLow-cost1 aChen, W.1 aShen, J.1 aXue, J. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84879113061&partnerID=40&md5=7941cc253a0c68dabc5b5f89de60ee2701716nas a2200193 4500008004100000245005300041210005300094260000900147300001400156490000700170520112700177653001901304653001501323653000901338653002501347653001801372100001501390856011701405 2013 eng d00aStudy on computer audit based on OLAP technology0 aStudy on computer audit based on OLAP technology c2013 a409 - 4170 v113 aIt 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.10aComputer Audit10aData model10aOLAP10aSubsystem CLC Number10aTP311.13 F2391 aYanjun, T. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84892159745&partnerID=40&md5=73e06eabfb56e4cc5549342fff805b9c01342nas a2200205 4500008004100000245008400041210006900125260000900194300001200203490000700215520066500222653002300887653002700910653002500937653001800962100001500980700001200995700001201007856011701019 2013 eng d00aStudy on current protection in distribution network with distributed generation0 aStudy on current protection in distribution network with distrib c2013 a46 - 530 v113 aRunning 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.10aCurrent protection10aDistributed generation10aDistribution network10aFault current1 aZhu, X.-L.1 aLiu, J.1 aHan, F. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84879100407&partnerID=40&md5=c313cd9e2a75b7b6bd904c992a80944501613nas a2200193 4500008004100000245006300041210006300104260000900167300001400176490000700190520094000197653003101137653002701168653003201195653004601227100001701273700001201290856011701302 2013 eng d00aStudy on fuzzy evaluation of credit risk of corporate bond0 aStudy on fuzzy evaluation of credit risk of corporate bond c2013 a102 - 1070 v113 aThe 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.10aAnalytic hierarchy process10aCredit risk evaluation10aEvaluation indicator system10aMultistage comprehensive fuzzy evaluation1 aJiazhong, O.1 aMin, L. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84879107489&partnerID=40&md5=5ed9e7ced58f7b1babf82aed43c4db9001149nas a2200193 4500008004100000245008900041210006900130260000900199300001400208490000700222520050800229653000900737653002600746653002100772653001200793100001700805700001600822856011700838 2013 eng d00aThe study on information characteristics analysis using information diffusion method0 astudy on information characteristics analysis using information  c2013 a290 - 2970 v113 aA 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.10aBlog10aInformation diffusion10aNetwork analysis10aRanking1 aHuang, L.-D.1 aShen, X.-C. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84888365071&partnerID=40&md5=fac2b10e3f70e9d408611eb7bb0b945101275nas a2200193 4500008004100000245009300041210006900134260000900203300001200212490000700224520065300231653000800884653001300892653000800905653001900913100001700932700001500949856011700964 2013 eng d00aThe study on pendubot control linear quadratic regulator and particle swarm optimization0 astudy on pendubot control linear quadratic regulator and particl c2013 a16 - 240 v113 aIn 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.10aLQR10aPendubot10aPSO10aState-feedback1 aJianfeng, X.1 aHuzhen, S. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84879114013&partnerID=40&md5=b4f25efc7f371dde9d9d28828f6856e701559nas a2200241 4500008004100000245009100041210006900132260000900201300001400210490000700224520078700231653002101018653002601039653001901065653001901084653003001103100001601133700001501149700001201164700001101176700001301187856011701200 2013 eng d00aTuning of PID controller for air conditioning unit based on adaptive genetic algorithm0 aTuning of PID controller for air conditioning unit based on adap c2013 a385 - 3890 v113 aPID 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.10aAdaptive genetic10aAir-conditioning unit10aControl system10aPenalty factor10aPID parameter optimizatio1 aZhou, Y.-T.1 aNie, J.-B.1 aHan, N.1 aLi, D.1 aChen, C. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84890505004&partnerID=40&md5=0eb209969776e5c94c3b9272214e4d6f01681nas a2200193 4500008004100000245009700041210006900138260000900207300001400216490000700230520100800237653002201245653002701267653001701294653003301311100001301344700001301357856011701370 2013 eng d00aVehicle routing optimization problem with time-windows and its solution by genetic algorithm0 aVehicle routing optimization problem with timewindows and its so c2013 a136 - 1450 v113 aVehicle 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.10aGenetic Algorithm10aLogistics distribution10aTime-windows10aVehicle routing optimization1 aChen, T.1 aZhou, G. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84879123858&partnerID=40&md5=7522f4b2d16a9e979a5ea8b102a48e5a01597nas a2200193 4500008004100000245005900041210005600100260000900156300001100165490000700176520097900183653003101162653002701193653001601220653001801236100001601254700001601270856011701286 2013 eng d00aA web-based virtual lab for accounting skills practice0 awebbased virtual lab for accounting skills practice c2013 a8 - 140 v113 aWith 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.10aAccounting skills practice10aEducational technology10aVirtual lab10aWeb based lab1 aXiaomei, G.1 aLihuang, C. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84879082631&partnerID=40&md5=bb326c958ec9343412074107e37686f901280nas a2200205 4500008004100000245009800041210006900139260000900208300001400217490000700231520054900238653004500787653002600832653003000858653003200888100001200920700001300932700001200945856011700957 2012 eng d00aApplication study on visual discussion technique in group decision making of sudden disasters0 aApplication study on visual discussion technique in group decisi c2012 a373 - 3780 v103 aEmergency 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.10aEmergency Management of Sudden Disasters10aGroup Decision Making10aSemantic Cluster Analysis10aVisual Discussion Technique1 aTao, F.1 aWang, H.1 aLiu, G. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84874910051&partnerID=40&md5=0a893329cccfb221cc012d5e9b72840e01611nas a2200193 4500008004100000245006400041210006400105260000900169300001400178490000700192520097000199653003101169653002601200653001901226653001501245653002801260100001201288856011701300 2012 eng d00aApplications of numerical calculation in engineering design0 aApplications of numerical calculation in engineering design c2012 a308 - 3110 v103 aSuch 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'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.10aElectrostatic precipitator10aNumerical calculation10aOrbit equation10aSpacecraft10aTranscendental equation1 aLei, Q. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84870802969&partnerID=40&md5=2de3ed3efc1aa45fdb83fa6b27b27ef001897nas a2200265 4500008004100000245005600041210005400097260000900151300001400160490000700174520110700181653001601288653001401304653001801318653002801336653001701364653002801381653002201409653001701431100001801448700001601466700001401482700001801496856011701514 2012 eng d00aA clustering based forecast engine for retail sales0 aclustering based forecast engine for retail sales c2012 a219 - 2290 v103 aEfficient 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.10aBad experts10aCombining10aDecomposition10aFrequent pattern mining10aGood experts10aHierarchical clustering10aSales forecasting10aTimes series1 aMurlidhar, V.1 aMenezes, B.1 aSathe, M.1 aMurlidhar, G. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84866437246&partnerID=40&md5=483d9ce78ec38199f57ebcb1bca8dc6402257nas a2200205 4500008004100000245006800041210006600109260000900175300001200184490000700196520160100203653001901804653002701823653001901850653002701869100001301896700001301909700001201922856011701934 2012 eng d00aCMCCR: Classification based on multiple class-correlation rules0 aCMCCR Classification based on multiple classcorrelation rules c2012 a64 - 700 v103 aPrevious 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.10aAll-confidence10aClass-correlation rule10aClassification10aCorrelation confidence1 aZhou, Z.1 aWang, X.1 aPan, G. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84866448185&partnerID=40&md5=10fb4c8ff12d02f2555fb4ba4c8f5d0401431nas a2200253 4500008004100000245009100041210006900132260000900201300001400210490000700224520062100231653002600852653002100878653002600899653003300925100001700958700001500975700001700990700001201007700001501019700001201034700001401046856011701060 2012 eng d00aA comparison of pattern classification approaches for structural damage identification0 acomparison of pattern classification approaches for structural d c2012 a126 - 1300 v103 aA 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.10aExtraction algorithms10aPattern matching10aSensor identificaiton10aWavelet packet decomposition1 aQingqing, Z.1 aQifeng, Z.1 aYongpeng, N.1 aFan, Y.1 aJiayan, L.1 aRun, T.1 aMinda, L. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84866443034&partnerID=40&md5=17335eb07404e2de90828f9bb812e1da01440nas a2200193 4500008004100000245008200041210006900123260000900192300001400201490000700215520079100222653002901013653002301042653002701065653001301092100001301105700001101118856011701129 2012 eng d00aA constrained optimization evolutionary algorithm based on membrane computing0 aconstrained optimization evolutionary algorithm based on membran c2012 a121 - 1250 v103 aBased 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.10aConstrained optimization10aMembrane computing10aOptimization algorithm10aP system1 aChen, H.1 aLu, J. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84866465380&partnerID=40&md5=f4dc024e4e87df897034039972862ac902186nas a2200229 4500008004100000245009800041210006900139260000900208300001400217490000700231520138800238653003201626653003201658653002401690653002901714653002801743100001701771700001801788700001401806700001901820856011701839 2012 eng d00aCreating multi-level class hierarchy for question classification with NP analysis and wordnet0 aCreating multilevel class hierarchy for question classification  c2012 a379 - 3880 v103 aQuestion 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.10aMeta Information Management10aNatural Language Processing10aQuestion Answering410aQuestion Class Hierarchy10aQuestion Classification1 aBakhtyar, M.1 aKawtrakul, A.1 aBaber, J.1 aDoudpota, S.M. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84874837728&partnerID=40&md5=3f2a45281c24dba71e9fbc36717f9a7001494nas a2200229 4500008004100000245009900041210006900140260000900209300001400218490000700232520076600239653001301005653001301018653001201031653002001043653000801063653002401071653001801095100001801113700001601131856011701147 2012 eng d00aD3-P2P: Managing distributed and replicated database in P2P environment by using quorum system0 aD3P2P Managing distributed and replicated database in P2P enviro c2012 a351 - 3640 v103 aThe 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.10aDatabase10aDeadlock10aFailure10aNode Dynamicity10aP2P10aPartial Replication10aQuorum System1 aMounine, H.S.1 aWalid, H.K. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84874883777&partnerID=40&md5=d05a262f0b42b99fd75e7a6488bc8fd401313nas a2200205 4500008004100000245006500041210006500106260000900171300001400180490000700194520063600201653001900837653003000856653002500886653003000911653002400941100001400965700001100979856011700990 2012 eng d00aDesign of the fuzzy intelligent controller of air compressor0 aDesign of the fuzzy intelligent controller of air compressor c2012 a320 - 3230 v103 aThe 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.10aAir compressor10aFuzzy intelligent control10aFuzzy pid controller10aPressure fuzzy controller10aTime-varying system1 aLi, G.-F.1 aHe, Y. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84870779991&partnerID=40&md5=084b1bca94ceece320d2c7dc345dff4002082nas a2200217 4500008004100000245007400041210006900115260000900184300001400193490000700207520137100214653001601585653002001601653002801621653002101649653003201670100001701702700001301719700001501732856011701747 2012 eng d00aDeveloping and deploying cloud services based on abstraction approach0 aDeveloping and deploying cloud services based on abstraction app c2012 a254 - 2610 v103 aWith 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'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.10aAbstraction10aCloud computing10aCloud-based application10aInteroperability10aObject-oriented programming1 aNguyen, B.M.1 aTran, V.1 aHluchy, L. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84866463483&partnerID=40&md5=2567e71dfda85333923569e2cdf21fc401305nas a2200193 4500008004100000245010700041210006900148260000900217300001400226490000700240520062800247653001700875653002900892653001100921653003500932100001400967700001300981856011700994 2012 eng d00aThe development and application of learning support service system for normal students' work placement0 adevelopment and application of learning support service system f c2012 a168 - 1730 v103 aThe model of normal students work placement has been a significant measure for the reform of teacher'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' work placement activities.10aInteractivit10aLearning support service10aSystem10aWork-placement normal students1 aShibo, Z.1 aXuer, S. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84866468116&partnerID=40&md5=4a2a2c97005fa059d75d8f361db5a83601890nas a2200193 4500008004100000245007900041210006900120260000900189300001400198490000700212520125000219653001401469653002001483653002001503653002601523100001601549700001401565856011701579 2012 eng d00aDistributed weighted clustering of evolving sensor data streams with noise0 aDistributed weighted clustering of evolving sensor data streams  c2012 a410 - 4200 v103 aCollecting 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.10aAlgorithm10aData clustering10aData Processing10aWireless Sensor Nodes1 aHassani, M.1 aSeidl, T. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84874869330&partnerID=40&md5=29927101aa08b9c82193c09bb9c5030400394nas a2200145 4500008004100000245001400041210001400055260000900069300000800078490000700086100001100093700001300104700001400117856011700131 2012 eng d00aEditorial0 aEditorial c2012 a - 0 v101 aLi, G.1 aChen, T.1 aXiong, H. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84870820511&partnerID=40&md5=0a1285fba51c505abaa2624d343b1bc300320nas a2200109 4500008004100000245001400041210001400055260000900069300000800078490000700086856011700093 2012 eng d00aEditorial0 aEditorial c2012 a - 0 v10 uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84857537098&partnerID=40&md5=6a479ac509720ccaa2853695ab57576600320nas a2200109 4500008004100000245001400041210001400055260000900069300000800078490000700086856011700093 2012 eng d00aEditorial0 aEditorial c2012 a - 0 v10 uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84874887195&partnerID=40&md5=11a016fc7cf6f668670cec4c327a5d6a00320nas a2200109 4500008004100000245001400041210001400055260000900069300000800078490000700086856011700093 2012 eng d00aEditorial0 aEditorial c2012 a - 0 v10 uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84866445471&partnerID=40&md5=1248a8e53f5b217b9ddba6977922742c00320nas a2200109 4500008004100000245001400041210001400055260000900069300000800078490000700086856011700093 2012 eng d00aEditorial0 aEditorial c2012 a - 0 v10 uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84866446334&partnerID=40&md5=da13d634d1e4b39ad93182c6d987f7ae01331nas a2200193 4500008004100000245007500041210006900116260000900185300001400194490000700208520069600215653002900911653002600940653000800966653000800974653002000982100001801002856011701020 2012 eng d00aEffective implementation of basic operations for information retrieval0 aEffective implementation of basic operations for information ret c2012 a389 - 3980 v103 aIn 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.10aDocuments Categorization10aInformation retrieval10aPCA10aSOM10aText clustering1 aSzymanski, J. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84874861039&partnerID=40&md5=f0cc1565c8fce706ec0125e688e6474a01409nas a2200205 4500008004100000245008500041210006900126260000900195300001300204490000700217520074800224653002400972653003200996653001301028653001001041100001101051700001201062700001201074856011701086 2012 eng d00aAn equivalent circuit model for on-chip inductors with gradual changed structure0 aequivalent circuit model for onchip inductors with gradual chang c2012 a99 - 1030 v103 aInductor 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.10aEequivalent circuit10aGradually changed structure10aInductor10aModel1 aLi, X.1 aRen, Z.1 aShi, Y. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84866462474&partnerID=40&md5=02e9de97a74f79993822587bc84bfc4201371nas a2200205 4500008004100000245008000041210006900121260000900190300001400199490000700213520067000220653001500890653002700905653002800932653003400960653002700994100001201021700001501033856011701048 2012 eng d00aExperimental evaluation for impact factors of online signature verification0 aExperimental evaluation for impact factors of online signature v c2012 a187 - 1930 v103 aA 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.10aBiometrics10aDynamic timing warping10aExperimental evaluation10aOnline signature verification10aSupport vector machine1 aHao, C.1 aMing, D.D. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84866459887&partnerID=40&md5=efb57c0a5eb8df586d615ad81371552d01276nas a2200181 4500008004100000245012800041210006900169260000900238300001400247490000700261520056700268653004200835653003000877653003200907653002300939100001500962856011700977 2012 eng d00aExploration in to reform in computer application technology major in higher vocational colleges based on tripartite linkage0 aExploration in to reform in computer application technology majo c2012 a147 - 1520 v103 aIt 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.10aComputer application technology major10aCourse system development10aHigher vocational education10aTripartite linkage1 aQiming, T. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84866466981&partnerID=40&md5=a2ce9de57c2c14a652be2794a635c08d01808nas a2200181 4500008004100000245009800041210006900139260000900208300001400217490000700231520117600238653003001414653002301444653001201467100001501479700001501494856011701509 2012 eng d00aExploring lexicographic ontologies for hierarchically organizing the greek wikipedia articles0 aExploring lexicographic ontologies for hierarchically organizing c2012 a157 - 1670 v103 aTo 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.10aHierarchical organization10aWikipedia articles10aWordNet1 aNiarou, M.1 aStamou, S. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84866437570&partnerID=40&md5=f78ff732a8358e3c52247f353ea4acc201131nas a2200205 4500008004100000245006600041210006400107260000900171300001200180490000700192520047900199653001700678653002800695653002100723653002400744100001400768700001200782700001400794856011700808 2012 eng d00aA feature points matching algorithm based on wavelet analysis0 afeature points matching algorithm based on wavelet analysis c2012 a94 - 980 v103 aIn 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.10aCoefficients10aFeature points matching10aWavelet analysis10aWeighted statistics1 aLijun, W.1 aXin, X.1 aGuang, X. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84866439147&partnerID=40&md5=94422ee81166dc1c5a0b1ffc243d168601921nas a2200205 4500008004100000245009200041210006900133260000900202300001400211490000700225520121400232653002401446653002201470653002501492653002001517100002101537700002101558700001901579856011701598 2012 eng d00aFrom a system dynamics causal loop diagram to an object-role model: A stepwise approach0 aFrom a system dynamics causal loop diagram to an objectrole mode c2012 a174 - 1860 v103 aTwo 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.10aCausal loop diagram10aObject role model10aObject-role modeling10aSystem dynamics1 aTulinayo, F.P.F.1 aVan Bommel, P.P.1 aProper, H.A.E. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84866459829&partnerID=40&md5=128968f0bcab0a3bc3ebee5e3d62926e01647nas a2200181 4500008004100000245009800041210006900139260000900208300001400217490000700231520099700238653002101235653003701256653002101293653002001314100001401334856011701348 2012 eng d00aFunctional requirements analysis-based method for product platform design in axiomatic design0 aFunctional requirements analysisbased method for product platfor c2012 a312 - 3190 v103 aToday'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.10aAxiomatic design10aFunctional requirements analysis10aProduct platform10aRelation degree1 aCheng, X. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84870774667&partnerID=40&md5=83472ec4b196c7698750567c7989da4901262nas a2200193 4500008004100000245008200041210006900123260000900192300001200201490000700213520062900220653001900849653001300868653001900881653001800900100001600918700001700934856011700951 2012 eng d00aImage tamper detection and recovery based on dual watermarks sharing strategy0 aImage tamper detection and recovery based on dual watermarks sha c2012 a39 - 490 v103 aRecently, 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'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.10aAuthentication10aRecovery10aSecret sharing10aSteganography1 aChen, Y.-H.1 aChang, C.-C. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84863269265&partnerID=40&md5=941cf4b613804091a5e3d1ea5d154fa501545nas a2200217 4500008004100000245011700041210006900158260000900227300001400236490000700250520077500257653002501032653002201057653005101079653002901130100001201159700001301171700001301184700001301197856011701210 2012 eng d00aAn intelligent communication path planning method of metallurgical equipment multi-dimensional information space0 aintelligent communication path planning method of metallurgical  c2012 a295 - 3000 v103 aWith 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.10aAnt colony algorithm10aCellular automata10aIntelligent planning of the communication path10aMetallurgical equipments1 aLiu, J.1 aKong, J.1 aZhou, M.1 aWang, X. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84870775516&partnerID=40&md5=662c43d3290cf4324b438895204b0c6b01682nas a2200265 4500008004100000245008800041210006900129260000900198300001400207490000700221520088800228653001601116653001601132653001801148653001201166653001701178653002001195653001101215100001201226700001701238700001801255700001301273700001301286856011701299 2012 eng d00aInvestigating factors influencing non-use and abandonment of microblogging services0 aInvestigating factors influencing nonuse and abandonment of micr c2012 a421 - 4290 v103 aThis 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' 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.10aAbandonment10aFocus Group10aMicroblogging10aNon-use10aSocial media10aSocial networks10aSurvey1 aGuo, Y.1 aGoh, D.H.-L.1 aIlangovan, K.1 aJiao, S.1 aYang, X. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84874905735&partnerID=40&md5=087e167bd1bd9f4c37ad9988561e5f6901782nas a2200217 4500008004100000245008100041210006900122260000900191300001400200490000700214520110400221653000901325653001301334653002401347653002601371100001101397700001401408700001101422700001401433856011701447 2012 eng d00aLow overhead geometric on-demand routing protocol for mobile ad hoc networks0 aLow overhead geometric ondemand routing protocol for mobile ad h c2012 a114 - 1200 v103 aAt 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.10aAODV10aFlooding10aGeometrical routing10aMobile ad hoc network1 aSu, C.1 aZheng, L.1 aSi, X.1 aShang, F. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84866448629&partnerID=40&md5=1ddb21882f2996c7fdd5e7fbfd1511cb01075nas a2200181 4500008004100000245006100041210006100102260000900163300001200172490000700184520051500191653000800706653001000714653002600724653001300750100001300763856011700776 2012 eng d00aMechanism analysis of protocols based on the FPCPN model0 aMechanism analysis of protocols based on the FPCPN model c2012 a86 - 930 v103 aFocusing 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.10aCPN10aFPCPN10aMechanism of protocol10aPetrinet1 aWang, W. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84866451164&partnerID=40&md5=eb201b179c8b50ddc41f54eabc15fec202175nas a2200217 4500008004100000245005500041210005500096260000900151300001200160490000700172520145700179653002401636653002901660653004201689653002301731653002501754653002601779100001701805700001801822856011701840 2012 eng d00aMiddleware model for adapting dynamic requirements0 aMiddleware model for adapting dynamic requirements c2012 a20 - 280 v103 aMaking 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.10aAdaptability Metric10aAspect-Oriented Approach10aAspect-Oriented Reflective Middleware10aDynamic Adaptation10aDynamic Requirements10aReflective Middleware1 aSuganthi, S.1 aNadarajan, R. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84857583024&partnerID=40&md5=38c4e35715ea15a7d59be1dfde2d18d101447nas a2200205 4500008004100000245007500041210006900116260000900185300001400194490000700208520078700215653001301002653001801015653001401033653000801047653003801055100001401093700001701107856011701124 2012 eng d00aModeling push-based live P2P streaming by stochastic activity networks0 aModeling pushbased live P2P streaming by stochastic activity net c2012 a236 - 2440 v103 aLive 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' 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.10aModeling10aP2P streaming10aPollution10aQoS10aStochastic activity networks(SAN)1 aZhang, P.1 aHelvik, B.E. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84866465492&partnerID=40&md5=34d4755b1ae344b34d02b8146fa9232501663nas a2200181 4500008004100000245008000041210006900121260000900190300001400199490000700213520103900220653002201259653002801281653002401309653002001333100001101353856011701364 2012 eng d00aA new customer classification algorithm for electronic commerce enterprises0 anew customer classification algorithm for electronic commerce en c2012 a284 - 2880 v103 aCorrectly 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.10aBP Neural Network10aCustomer classification10aElectronic commerce10aImmune genetics1 aLi, X. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84870801373&partnerID=40&md5=e0e9cd1f8a408b64aa0f9dc6037ec8e601298nas a2200193 4500008004100000245014000041210006900181260000900250300001200259490000700271520057400278653003300852653002200885653002600907653002900933100001200962700001300974856011700987 2012 eng d00aA new range-free localization algorithm in wireless sensor networks based on improved genetic algorithm by control on adrenaline levels0 anew rangefree localization algorithm in wireless sensor networks c2012 a50 - 540 v103 aIn 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ÿ 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.10aControl on Adrenaline Levels10aGenetic Algorithm10aLocalization Accuracy10aWireless sensor networks1 aLiu, Z.1 aFang, Z. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84863283296&partnerID=40&md5=8d2ce76d7be6aef5a62301c217b62a7801644nas a2200229 4500008004100000245006000041210005900101260000900160300001400169490000700183520098400190653001001174653002101184653001101205653000901216653000801225100001601233700001601249700001201265700002001277856011701297 2012 eng d00aNL2 Alloy: A tool to generate alloy from NL constraints0 aNL2 Alloy A tool to generate alloy from NL constraints c2012 a365 - 3720 v103 aIn 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's standard SBVR in translation of NL to formal languages. The NL2Alloy approach is also implemented as an Eclipse plugin.10aAlloy10aNatural language10aNL2OCL10aSBVR10aUML1 aBajwa, I.S.1 aBordbar, B.1 aLee, M.1 aAnastasakis, K. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84874825931&partnerID=40&md5=a6062c119677b77912bbf70d219d113201531nas a2200193 4500008004100000245008300041210006900124260000900193300001400202490000700216520086100223653002801084653001601112653002901128653003301157653001901190100001101209856011701220 2012 eng d00aA novel method of data stream classification based on incremental storage tree0 anovel method of data stream classification based on incremental  c2012 a301 - 3070 v103 aFor 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.10aBayesian classification10aData stream10aIncremental storage tree10aPrincipal component analysis10aSliding window1 aXu, C. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84870803724&partnerID=40&md5=ee151686cdc13a9a1a785eb65f87d46701744nas a2200241 4500008004100000245009300041210006900134260000900203300001400212490000700226520097400233653002601207653002301233653001901256653002901275653001901304100001201323700001301335700001201348700001201360700001301372856011701385 2012 eng d00aA novel RDB-SW approach for commodities price dynamic trend analysis based on web mining0 anovel RDBSW approach for commodities price dynamic trend analysi c2012 a230 - 2350 v103 aIn 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.10aDichotomy backfilling10aDisturbance factor10aImperfect data10aPrice forecast algorithm10aSliding window1 aZhu, Q.1 aZhou, P.1 aCao, S.1 aYan, Y.1 aDing, J. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84866463450&partnerID=40&md5=5874dc4739d723f46728438c22a52b9a01506nas a2200217 4500008004100000245005000041210004800091260000900139300001200148490000700160520086000167653002201027653002001049653002101069653001701090100001401107700001701121700001601138700001701154856011701171 2012 eng d00aA Personalization layer for mediation systems0 aPersonalization layer for mediation systems c2012 a29 - 380 v103 aMediation systems allow integration of disparate and heterogeneous data sources. Unfortunately, with the increasing number of integrated sources, especially in the context of web, mediator'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'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'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.10aMediation systems10aPersonalization10aSource selection10aUser profile1 aZaoui, I.1 aWadjinny, F.1 aChiadmi, D.1 aBenhlima, L. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84857594503&partnerID=40&md5=345cb9fd1cebc3bd1598d806adb3d01201698nas a2200205 4500008004100000245009500041210006900136260000900205300001200214490000700226520100700233653003201240653002101272653001401293653002001307100001701327700001401344700001701358856011701375 2012 eng d00aPlaying games with information: Investigating perceptions of a mobile content sharing game0 aPlaying games with information Investigating perceptions of a mo c2012 a10 - 190 v103 aWe 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' 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's gaming features emerged as significant predictors.10aMobile Content Sharing Game10aSocial Computing10aUsability10aUser Evaluation1 aGoh, D.H.-L.1 aLee, C.S.1 aChua, A.Y.K. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84863281265&partnerID=40&md5=41c91a3b7957ec0b637c641bf9ba9a6e01990nas a2200181 4500008004100000245008400041210006900125260000900194300001400203490000700217520133700224653002901561653003301590653004001623100001301663700001501676856011701691 2012 eng d00aReal-time fault-tolerant scheduling algorithm for distributed computing systems0 aRealtime faulttolerant scheduling algorithm for distributed comp c2012 a289 - 2940 v103 aThis 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.10aCommunication reliabiity10aDirected acyclic graph (DAG)10aFault-tolerant scheduling algorithm1 aLing, Y.1 aOuyang, Y. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84870824298&partnerID=40&md5=b2233dbb54c6e75335831b70d22145e801955nas a2200181 4500008004100000245009200041210006900133260000900202300001400211490000700225520135400232653001301586653002101599653001201620100001201632700001201644856011701656 2012 eng d00aResearch and analysis of improved extraction based on information processing technology0 aResearch and analysis of improved extraction based on informatio c2012 a142 - 1460 v103 aThis 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.10aAnalysis10aNatural language10aSeminar1 aWei, Y.1 aGuo, Y. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84866466102&partnerID=40&md5=408ac5cc2bfbffd4fed15d3005d825c201257nas a2200169 4500008004100000245009600041210006900137260000900206300001200215490000700227520065000234653003700884653002500921653001200946100001200958856011700970 2012 eng d00aResearch and practice of characteristic teaching resources sharing and interactive platform0 aResearch and practice of characteristic teaching resources shari c2012 a59 - 630 v103 aBy 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.10aCharacteristic teaching resource10aInteractive platform10aSharing1 aYun, W. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84866460216&partnerID=40&md5=4feb99d8b6bba4b616f6710a86bd53c201211nas a2200193 4500008004100000245007200041210006900113260000900182300001400191490000700205520054100212653002100753653002300774653003300797653004100830100001600871700001300887856011700900 2012 eng d00aResearch on face recognition based on wavelet transform and PCA-ANN0 aResearch on face recognition based on wavelet transform and PCAA c2012 a136 - 1410 v103 aThis paper mainly studies the basic theory and technology on the identification of people'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.10aFace recognition10aFeature extraction10aPrincipal component analysis10aRadial basis function neural network1 aYuanzhi, W.1 aXiao, L. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84866450615&partnerID=40&md5=f0bb715fcc45b0395a7a2fee9540fdb901387nas a2200193 4500008004100000245008000041210006900121260000900190300001000199490000700209520075600216653002300972653001900995653001501014100001501029700001501044700001701059856011701076 2012 eng d00aA retrieval method based on language model considering neighboring contents0 aretrieval method based on language model considering neighboring c2012 a1 - 90 v103 aThe 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.10aHyperlink Analysis10aLanguage Model10aWeb search1 aTamura, K.1 aHatano, K.1 aYadohisa, H. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84857609599&partnerID=40&md5=78bc4a283c5231cf36f479f17c8ab0e501455nas a2200193 4500008004100000245007600041210006900117260000900186300001200195490000700207520082200214653001701036653002001053653002201073653001701095653001801112100001401130856011701144 2012 eng d00aReview on virtual Human's affective model and related applied algorithm0 aReview on virtual Humans affective model and related applied alg c2012 a71 - 780 v103 aThe 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's necessary to review on virtual human'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'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.10aA* algorithm10aAffective model10aMovement planning10aOptimal path10aVirtual Human1 aLiang, Z. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84866463534&partnerID=40&md5=9d6a46a01aa39f2875b7e69bd67a41e501487nas a2200217 4500008004100000245007800041210006900119260000900188300001400197490000700211520080100218653002201019653002301041653002001064653002001084100001201104700001301116700001201129700001101141856011701152 2012 eng d00aRisk evaluation of rural financial organization operation based on the BP0 aRisk evaluation of rural financial organization operation based  c2012 a341 - 3460 v103 aThe 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.10aBP Neural Network10aRisk early warning10aRisk evaluation10aRural finanical1 aFan, S.1 aZhao, Y.1 aXie, H.1 aLi, C. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84870856910&partnerID=40&md5=85d32baadc606adc5051d555a7003b8a01186nas a2200205 4500008004100000245011400041210006900155260000900224300001400233490000700247520049000254653003400744653000800778653002400786653000800810100001600818700001200834700001700846856011700863 2012 eng d00aSemantic-oriented integration and simulation-based analysis approach for healthcare information systems (HIS)0 aSemanticoriented integration and simulationbased analysis approa c2012 a131 - 1350 v103 aAccording 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.10aHealthcare information system10aMDA10aSimulation analysis10aSOA1 aSong, L.-L.1 aXie, J.1 aHuang, Z.-D. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84866469913&partnerID=40&md5=59195f9ddbbe9698b622a0623d81497d01852nas a2200205 4500008004100000245007900041210006900120260000900189300001200198490000700210520118900217653001101406653002001417653001501437653002401452653001301476653002801489100001201517856011701529 2012 eng d00aSERCID: A secure mechanism for data collection in wireless sensor networks0 aSERCID A secure mechanism for data collection in wireless sensor c2012 a79 - 850 v103 aThe 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.10aAttack10aData collection10aEncryption10aIntrusion detection10aSecurity10aWireless sensor network1 aMao, Y. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84866465185&partnerID=40&md5=ba314ed11d14004232b2fddcd4fa4ee801866nas a2200217 4500008004100000245008600041210006900127260000900196300001400205490000700219520111900226653002201345653002001367653002401387653004401411653002901455100001501484700001401499700001801513856011701531 2012 eng d00aSnippets and component-based authoring tools for reusing and connecting documents0 aSnippets and componentbased authoring tools for reusing and conn c2012 a399 - 4090 v103 aThis 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.10aApplied computing10aAuthoring tools10aDocument management10aDocument management and text processing10aHuman-centered computing1 aKirsch, L.1 aBotev, J.1 aRothkugel, S. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84874892012&partnerID=40&md5=559724084cafa42bb9580bae7e030bbe00397nas a2200133 4500008004100000245002800041210002800069260000900097300000800106490000700114100001300121700001200134856011700146 2012 eng d00aSpecial issue editorial0 aSpecial issue editorial c2012 a - 0 v101 aTian, W.1 aXie, M. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84866449547&partnerID=40&md5=28d7bd0880f0712f199dfb5a32a0608801529nas a2200193 4500008004100000245009000041210006900131260000900200300001400209490000700223520086400230653002101094653002101115653002301136653002601159653001701185100001601202856011701218 2012 eng d00aStory segmentation of xinwenlianbo based on three-level criterion of content analysis0 aStory segmentation of xinwenlianbo based on threelevel criterion c2012 a104 - 1080 v103 aTo 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%.10aContent analysis10aPenalty distance10aStory segmentation10aThree-level criterion10aXinwenlianbo1 aYang, J.-C. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84866436585&partnerID=40&md5=4769d7d15e1441698955b8a3e0da054101821nas a2200229 4500008004100000245011700041210006900158260000900227300001400236490000700250520106500257653001501322653001601337653002201353653002001375653001901395653001401414100001701428700001301445700001601458856011701474 2012 eng d00aA strategic search method for requirement-aware functional-block selection and composition in a flexible network0 astrategic search method for requirementaware functionalblock sel c2012 a194 - 2010 v103 aInternet 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'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.10aComplexity10aComposition10aFlexible networks10aFuture internet10aProtocol graph10aSelection1 aGünther, D.1 aKerr, N.1 aMüller, P. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84866463034&partnerID=40&md5=b30673b530b454aa1a7fead4a7f771ad01206nas a2200229 4500008004100000245006300041210006100104260000900165300001400174490000700188520052600195653002000721653001900741653002000760653001900780100001100799700001300810700001100823700001300834700001200847856011700859 2012 eng d00aA survey on data migration management in cloud environment0 asurvey on data migration management in cloud environment c2012 a324 - 3310 v103 aCloud 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.10aCloud computing10aLive migration10aVirtual machine10aVirtualization1 aHu, L.1 aZhao, J.1 aXu, G.1 aDing, Y.1 aChu, J. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84870801122&partnerID=40&md5=b4c2238489deb4c292137fd14e4a209101270nas a2200217 4500008004100000245005600041210005500097260000900152300001400161490000700175520064700182653001100829653001700840653000900857653001600866100001600882700001100898700001500909700001100924856011700935 2012 eng d00aSwarm-robot system based on wireless sensor network0 aSwarmrobot system based on wireless sensor network c2012 a277 - 2830 v103 aThe 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.10aCC251010aCoordination10aFHSS10aSwarm-robot1 aPeng, J.-S.1 aLi, X.1 aQin, Z.-Q.1 aLi, W. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84870787456&partnerID=40&md5=1543551d520c6b04bd2a82a95ffe828301537nas a2200205 4500008004100000245007800041210006900119260000900188300001400197490000700211520085000218653004101068653001701109653002401126653002301150100001301173700001701186700001101203856011701214 2012 eng d00aA taxonomic relationship learning approach for log ontology content event0 ataxonomic relationship learning approach for log ontology conten c2012 a109 - 1130 v103 aTo construct the log ontology is one of the main tasks of semantic Web usage mining. In order to discover the hierarchy of users' 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' visiting action, and content event is the semantic behavior of users' 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.10aContent event taxonomic relationship10aLog ontology10aSemantic web mining10aSwarm intelligence1 aMing, S.1 aQinghong, S.1 aBo, C. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84866440989&partnerID=40&md5=9e0960d7e083c77e4cd41cbb915068b601920nas a2200217 4500008004100000245009500041210006900136260000900205300001400214490000700228520122000235653001201455653001101467653001301478653002101491653002101512100001701533700001601550700001901566856011701585 2012 eng d00aTrue: A trust evaluation service for mobile ad hoc networks resistant to malicious attacks0 aTrue A trust evaluation service for mobile ad hoc networks resis c2012 a262 - 2710 v103 aTrust 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.10aAttacks10aMANETs10aSecurity10aSelforganization10aTrust evaluation1 aDa Silva, E.1 aMisaghi, M.1 aAlbini, L.C.P. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84866468796&partnerID=40&md5=08ff8aec3056b7029837f9948c2ccdcf01445nas a2200193 4500008004100000245007500041210006900116260000900185300001400194490000700208520082000215653000801035653001701043653002701060653001701087100001201104700001801116856011701134 2012 eng d00aUniversity teachers' performance appraisals model based on DEA and AHP0 aUniversity teachers performance appraisals model based on DEA an c2012 a332 - 3400 v103 aThe university teachers' 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' performance appraisals model. Second, it combines the current teachers' performance appraisals theory and practice research, and discusses the questionnaire suitable for the university teachers' 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' performance appraisals index model based on DEA.10aAHP10aIndex system10aPerformance appraisals10aQuantization1 aBei, W.1 aDongsheng, L. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84870835193&partnerID=40&md5=a2b5682b9d4038ce96253a8d9901597502185nas a2200193 4500008004100000245008900041210006900130260000900199300001400208490000700222520151600229653001501745653003601760653002701796653001701823100001401840700002001854856011701874 2012 eng d00aWebbing semantified scholarly communication datasets for improved resource discovery0 aWebbing semantified scholarly communication datasets for improve c2012 a245 - 2530 v103 aThe 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.10aCase study10aInterlinking scholarly datasets10aLinked Open Data (LOD)10aSemantic web1 aLatif, A.1 aTochtermann, K. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84866447762&partnerID=40&md5=15e762eee3e9e8e6b5060785d45a923c01966nas a2200217 4500008004100000245005200041210005200093260000900145300001400154490000700168520130000175653001901475653002101494653002701515653002401542653002801566100001401594700001101608700001201619856011701631 2012 eng d00aWord combination kernel for text categorization0 aWord combination kernel for text categorization c2012 a202 - 2110 v103 aWe 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.10aKernel methods10aMachine learning10aSupport vector machine10aText classification10aWord-combination kernel1 aZhang, L.1 aHu, X.1 aQin, S. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84866439932&partnerID=40&md5=8649dfc8c1ee23ca70f2b137a74a19e401724nas a2200205 4500008004100000245007900041210006900120260000900189300001200198490000600210520099400216653003401210653002701244653004501271653002701316653002801343100001501371700001501386856011701401 2011 eng d00aApplication of Esscher transformed Laplace distribution in Web server data0 aApplication of Esscher transformed Laplace distribution in Web s c2011 a19 - 260 v93 aIn 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.10aAsymptotic confdence interval10aEsscher transformation10aEsscher transformed Laplace distribution10aFile size distribution10aHeavy tail distribution1 aGeorge, D.1 aGeorge, S. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-79960684244&partnerID=40&md5=df49fdec131cd1ab8f2b958022b553e601890nas a2200193 4500008004100000245007900041210006900120260000900189300001400198490000600212520126000218653001801478653002201496653001801518653001901536100001101555700001301566856011701579 2011 eng d00aApplication research on bp neural network pid control of the belt conveyor0 aApplication research on bp neural network pid control of the bel c2011 a266 - 2700 v93 aIn 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.10aBelt Conveyor10aBP Neural Network10aDynamic model10aPID controller1 aXi, P.1 aSong, Y. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84855380085&partnerID=40&md5=8f75d8ae8fabd7ffd683a7b47b40c79502376nas a2200205 4500008004100000245008800041210006900129260000900198300001400207490000600221520168100227653002101908653002101929653002401950653003901974100001302013700001402026700001302040856011702053 2011 eng d00aApplication-level solution for data integration in ubiquitous computing environment0 aApplicationlevel solution for data integration in ubiquitous com c2011 a233 - 2410 v93 aThe Ubiquitous Computing envisions a world of communicating mobile devices and sensors. Advances in wireless communications raise users' 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.10aData integration10aQuery processing10aService composition10aUbiquitous Computing Data Services1 aZhou, L.1 aZhang, Y.1 aGuan, B. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84855403966&partnerID=40&md5=c0fbe9d31dec46666f6361a5d9fb7a7201821nas a2200217 4500008004100000245010400041210006900145260000900214300001400223490000600237520109000243653003201333653002601365653003101391653001501422100001201437700001201449700001401461700001101475856011701486 2011 eng d00aApplications classification and scheduling on heterogeneous hpc systems using experimental research0 aApplications classification and scheduling on heterogeneous hpc  c2011 a227 - 2320 v93 aHeterogeneous 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.10aApplications Classification10aHeterogeneous Systems10aHigh Performance Computing10aScheduling1 aXia, Y.1 aZhu, M.1 aKuang, L.1 aMa, X. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84855410151&partnerID=40&md5=442c0fa54ceef88eed0bc85373d116ff01499nas a2200229 4500008004100000245004300041210004000084260000900124300001400133490000600147520080600153653002500959653002900984653001601013653001901029653002901048100001701077700001601094700002001110700002201130856011701152 2011 eng d00aB-mail: A brain-controlled mail client0 aBmail A braincontrolled mail client c2011 a167 - 1700 v93 aFor 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's brain activity signals using the P300 technique and performs the appropriate corresponding actions.10aAssistive technology10aBrain computer interface10aMail client10aP300-Technique10aPeople with disabilities1 aGannouni, S.1 aAlrayes, N.1 aAlsaudi, A.A.A.1 aAlabdulkareem, A. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-80053115577&partnerID=40&md5=a1ba320d72ea04d8618894cb42e306fb01276nas a2200181 4500008004100000245008100041210006900122260000900191300001400200490000600214520065400220653002200874653002600896653001700922653002300939100001500962856011700977 2011 eng d00aA combined measure of semantic web and meta tag technology for web retrieval0 acombined measure of semantic web and meta tag technology for web c2011 a219 - 2220 v93 aIncreasingly 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.10aGulf institutions10aInstitutions profiles10aSemantic web10aWeb construct data1 aReyaee, Al uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84855373332&partnerID=40&md5=941434981b3a9f7b76faa977d407fee301224nas a2200169 4500008004100000245008200041210006900123260000900192300001400201490000600215520064000221653001900861653002100880653002300901100001300924856011700937 2011 eng d00aConstruction of a teaching resources sharing platform based on campus network0 aConstruction of a teaching resources sharing platform based on c c2011 a261 - 2650 v93 aThis 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.10aCampus Network10aSharing Platform10aTeaching Resources1 aTian, W. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84855387451&partnerID=40&md5=689dd41b71fa90672a3a7e7a4602676501621nas a2200193 4500008004100000245009000041210006900131260000900200300001400209490000600223520095500229653001901184653001901203653003301222653002901255100001201284700001401296856011701310 2011 eng d00aThe design and challenges of online reprogramming system for wireless sensor networks0 adesign and challenges of online reprogramming system for wireles c2011 a255 - 2600 v93 aAt 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.10aAuthentication10aHash Key Chain10aOnline Network Reprogramming10aWireless sensor networks1 aXie, M.1 aZhang, G. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84855387891&partnerID=40&md5=a4ce74298f75f1a849cd6ed7c203d24f01641nas a2200181 4500008004100000245011600041210006900157260000900226300001400235490000600249520098800255653002701243653003101270653001501301100001401316700001201330856011701342 2011 eng d00aThe design and implementation of the digital down converter based on the improved dds and dspbuilder techniques0 adesign and implementation of the digital down converter based on c2011 a281 - 2860 v93 aDDC (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'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'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.10aDigital Down Converter10aDirect Digital Synthesizer10aDSPBuilder1 aZhang, G.1 aXie, M. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84855395419&partnerID=40&md5=64afa914e4030e52506b12f1d4b5d81601872nas a2200205 4500008004100000245007300041210006900114260000900183300001400192490000600206520120000212653002101412653001801433653002301451653002301474653001601497100001801513700001801531856011701549 2011 eng d00aDetecting human sentiment from text using a proximity-based approach0 aDetecting human sentiment from text using a proximitybased appro c2011 a206 - 2120 v93 aSentiment 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.10aMachine learning10aMovie reviews10aProximity analysis10aSentiment analysis10aText mining1 aHasan, S.M.S.1 aAdjeroh, D.A. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84855397249&partnerID=40&md5=a009c46b7b54e127e88ca882940b976701430nas a2200217 4500008004100000245006500041210006200106260000900168300001400177490000600191520079100197653001500988653001001003653001701013100001201030700001201042700001401054700001401068700001301082856011701095 2011 eng d00aA dynamic role-based authorization model in grid environment0 adynamic rolebased authorization model in grid environment c2011 a242 - 2480 v93 aIn 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'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.10aCAS server10aDRBAC10aDynamic role1 aSun, W.1 aGuo, C.1 aZhang, P.1 aZhang, N.1 aWang, H. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84855373392&partnerID=40&md5=1f10e75d6a2d4f01105000efde1e9fdc00319nas a2200109 4500008004100000245001400041210001400055260000900069300000800078490000600086856011700092 2011 eng d00aEditorial0 aEditorial c2011 a - 0 v9 uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-80053092628&partnerID=40&md5=b04c52e61e35721f703490a70af6310c00319nas a2200109 4500008004100000245001400041210001400055260000900069300000800078490000600086856011700092 2011 eng d00aEditorial0 aEditorial c2011 a - 0 v9 uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84855410927&partnerID=40&md5=5b500c0d9d5b012377893a4c7ac1171700368nas a2200133 4500008004100000245001400041210001400055260000900069300000800078490000600086100001400092700001100106856011700117 2011 eng d00aEditorial0 aEditorial c2011 a - 0 v91 aYuxin, M.1 aXu, L. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84855367587&partnerID=40&md5=2e6b58ecf6c83ad9a99a7485563c524b02041nas a2200193 4500008004100000245009700041210006900138260000900207300001200216490000600228520137500234653002501609653001501634653002301649653002201672100001701694700001901711856011701730 2011 eng d00aElementary patterns for converting textual and visual formalisms based on set theory and ORM0 aElementary patterns for converting textual and visual formalisms c2011 a64 - 710 v93 aTextual 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.10aObject Role Modeling10aSet theory10aTextual formalisms10aVisual formalisms1 aOverbeek, S.1 avan Bommel, P. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-79960694971&partnerID=40&md5=fb5b641c92f12de5340fa890fca9fa4402441nas a2200241 4500008004100000245009100041210006900132260000900201300001200210490000600222520165400228653001501882653003101897653002701928653001501955653003001970653002102000100001502021700001602036700001502052700001502067856011702082 2011 eng d00aEnhanced learning and educational management through online collaborative technologies0 aEnhanced learning and educational management through online coll c2011 a33 - 420 v93 aMerging 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'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.10aAlgorithms10aCollaborative technologies10aDigital logic circuits10ae-Learning10aEducation Management Tool10aWeb applications1 aFlorea, A.1 aGellert, A.1 aAnghel, T.1 aFlorea, D. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-79960666591&partnerID=40&md5=5b162b4c94771ec8eac487c8670056dc01981nas a2200241 4500008004100000245006500041210006500106260000900171300001400180490000600194520126500200653002401465653002001489653001901509653000801528653002501536653000701561653000901568100001401577700001501591700001601606856011701622 2011 eng d00aEvaluation of topic identification methods on arabic corpora0 aEvaluation of topic identification methods on arabic corpora c2011 a185 - 1920 v93 aTopic 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.10aAlwatan-2004 corpus10aArabic language10aNeural network10aSVM10aTopic Identification10aTR10aTULM1 aAbbas, M.1 aSmaili, K.1 aBerkani, D. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84855410016&partnerID=40&md5=8736f4304c67d00c33512bbcb14394fa01568nas a2200217 4500008004100000245008600041210006900127260000900196300001200205490000600217520086200223653002801085653002201113653001501135653002301150100001401173700001501187700001501202700001601217856011701233 2011 eng d00aFast remote user authentication scheme with smart card based on quadratic residue0 aFast remote user authentication scheme with smart card based on  c2011 a51 - 540 v93 aThere 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.10aPassword authentication10aQuadratic residue10aSmart card10aVerification table1 aWu, T.-S.1 aLin, H.-Y.1 aLee, M.-L.1 aChen, W.-Y. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-79960674401&partnerID=40&md5=9e6a08e95cf41ee5f01ee9be34b0657302021nas a2200217 4500008004100000245009100041210006900132260000900201300001400210490000600224520128200230653001801512653003501530653002701565653002501592653003201617100001101649700001401660700001201674856011701686 2011 eng d00aFroglingo, a programming language empowered by a total-recursive-equivalent data model0 aFroglingo a programming language empowered by a totalrecursiveeq c2011 a134 - 1460 v93 aThe 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.10aEP data model10aFroglingo programming langauge10aHigher-order functions10aKnowledge management10aTotal-recursive equivalence1 aXu, K.1 aZhang, J.1 aGao, S. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-80053114137&partnerID=40&md5=1d550173b3aa984474c5a8e1930a465a01986nas a2200229 4500008004100000245010800041210006900149260000900218300001400227490000600241520120300247653002801450653002401478653002301502653002401525653002401549653003001573100001101603700001301614700001201627856011701639 2011 eng d00aFusion user browsing behavior and user interests autonomous control of personalized search results sort0 aFusion user browsing behavior and user interests autonomous cont c2011 a271 - 2750 v93 aReference simplifies the ODP concept, establish a user hierarchical structure can be controlled autonomously interest preference expression of use interests model. Meanwhile, from the user's browsing behavior can reflect the user's interest in starting, this paper analyzes the relationship between the user'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'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.10aDegree of User Interest10aPersonalized Search10aPrivacy protection10aSort Search Results10aUser Interest Model10aUser's Browsing Behaviors1 aLi, J.1 aWang, H.1 aGuo, Y. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84855413177&partnerID=40&md5=42962ce43dcfb6f7b617b32ec5cecdcd01106nas a2200181 4500008004100000245005900041210005900100260000900159300001400168490000600182520052400188653003200712653001700744653001800761653001000779100001800789856011700807 2011 eng d00aImproving data management in a distributed environment0 aImproving data management in a distributed environment c2011 a122 - 1250 v93 aUsers 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.10aDistributed Database System10aDistribution10aFragmentation10aQuery1 aAbdalla, H.I. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-80052973755&partnerID=40&md5=d554854694c349305ec91c3b7ac7585f00327nas a2200109 4500008004100000245001800041210001800059260000900077300000800086490000600094856011700100 2011 eng d00aIn this issue0 aIn this issue c2011 a - 0 v9 uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-80053021313&partnerID=40&md5=e40f73bbb38dd7a90bd87090e7b864b800327nas a2200109 4500008004100000245001800041210001800059260000900077300000800086490000600094856011700100 2011 eng d00aIn this issue0 aIn this issue c2011 a - 0 v9 uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-79960689567&partnerID=40&md5=6c6fae2483a2f61a738518e0e1e6a5e200327nas a2200109 4500008004100000245001800041210001800059260000900077300000800086490000600094856011700100 2011 eng d00aIn this issue0 aIn this issue c2011 a - 0 v9 uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-79960685616&partnerID=40&md5=ddd0379845a601b346b8e9e4029418ea01292nas a2200169 4500008004100000245004500041210004500086260000900131300001400140490000600154520074600160653004000906653002400946653002000970100001500990856011701005 2011 eng d00aInformation system decomposition quality0 aInformation system decomposition quality c2011 a106 - 1100 v93 aObject-oriented design is becoming very popular in today'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.10aObject oriented information systems10aSystem architecture10aSystems quality1 aTagoug, N. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-80053018512&partnerID=40&md5=2c5417786ce4b94abbf252ab4ac6f66601260nas a2200181 4500008004100000245010900041210006900150260000900219300001400228490000600242520060300248653003200851653002500883653001800908100001500926700002000941856011700961 2011 eng d00aLocality preserving scheme of text databases representative in distributed information retrieval systems0 aLocality preserving scheme of text databases representative in d c2011 a193 - 1980 v93 aThis 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.10aLocality preserving mapping10aPeer-to-Peer systems10aText analysis1 aHassan, M.1 aAl-Lahham, Y.A. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84855374323&partnerID=40&md5=f56ad390368eb3d75500b51f46ddceb501458nas a2200217 4500008004100000245008800041210006900129260000900198300001200207490000600219520075400225653001500979653001200994653001901006653002001025653002801045653001801073100001501091700001701106856011701123 2011 eng d00aLTSC-128: Stream cipher based on the intractable Shortest Vector Problem in Lattice0 aLTSC128 Stream cipher based on the intractable Shortest Vector P c2011 a27 - 320 v93 aLTSC-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.10aEncryption10aLattice10aMultithreading10aNP-hard problem10aShortest Vector Problem10aStream cipher1 aSuwais, K.1 aSamsudin, A. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-79960657199&partnerID=40&md5=b4fe242766b77ba21be7e3f6815f31d701759nas a2200169 4500008004100000245006700041210006700108260000900175300001400184490000600198520118500204653002401389653001801413653002301431100001801454856011701472 2011 eng d00aNew technique to deal with dynamic data mining in the database0 aNew technique to deal with dynamic data mining in the database c2011 a147 - 1520 v93 aData 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.10aData mining process10aItemsummation10aStatic Data Mining1 aAbdalla, H.I. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-80053118883&partnerID=40&md5=c7d5459975035a08f96fa6900e7ba73901694nas a2200217 4500008004100000245011000041210006900151260000900220300001400229490000600243520100100249653000801250653000801258653000801266653000901274653002101283653002701304100001401331700001401345856011701359 2011 eng d00aNovel scanned beam millimeter-wave antenna using micromachined variable capacitors on coplanar structures0 aNovel scanned beam millimeterwave antenna using micromachined va c2011 a117 - 1210 v93 aThis 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.10aCPW10aDQM10aLWA10aMEMS10aMillimeter-waves10aSurface micromachining1 aHamdi, A.1 aSamet, A. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-80053034494&partnerID=40&md5=86725cbb55db5daaeae532550fd98ef201389nas a2200217 4500008004100000245007100041210006700112260000900179300001100188490000600199520068400205653001900889653002200908653001900930653002700949653002600976100001501002700001601017700002101033856011701054 2011 eng d00aAn ontology-based approach for detecting knowledge intensive tasks0 aontologybased approach for detecting knowledge intensive tasks c2011 a9 - 180 v93 aIn the context detection field, an important challenge is automatically detecting the user'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.10aClassification10aContext-awareness10aTask detection10aUser context detection10aUser context ontology1 aRath, A.S.1 aDevaurs, D.1 aLindstaedt, S.N. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-79960684788&partnerID=40&md5=2680764b7de9a96a3bfc50e670a65ce801438nas a2200229 4500008004100000245007900041210006900120260000900189300001200198490000600210520070900216653001400925653001900939653002300958653003400981100001701015700001601032700001401048700001301062700001601075856011701091 2011 eng d00aPassword based anonymous authentication with private information retrieval0 aPassword based anonymous authentication with private information c2011 a72 - 780 v93 aThis 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].10aAnonymity10aAuthentication10aPrivacy protection10aPrivate information retrieval1 aNakamura, T.1 aInenaga, S.1 aIkeda, D.1 aBaba, K.1 aYasuura, H. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-79960675855&partnerID=40&md5=0726c99925b632851b1817cb7859e93101659nas a2200169 4500008004100000245009300041210006900134260000900203300001400212490000600226520105300232653002401285653002501309653002301334100001501357856011701372 2011 eng d00aThe performance analysis of a service deployment system based on the centralized storage0 aperformance analysis of a service deployment system based on the c2011 a287 - 2910 v93 aBecause 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.10aCentralized Storage10aPerformance Analysis10aService Deployment1 aDong, Z.X. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84855403722&partnerID=40&md5=ef5c7bf82725ab97629cbfa9acd24bfb01462nas a2200193 4500008004100000245006200041210005900103260000900162300001200171490000600183520083600189653002001025653003301045653002501078653002601103100001101129700001101140856011701151 2011 eng d00aA practical and secure buyer-seller watermarking protocol0 apractical and secure buyerseller watermarking protocol c2011 a43 - 470 v93 aDigital 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.10aCopy deterrence10aDigital copyright protection10aDigital watermarking10aWatermarking protocol1 aHu, D.1 aLi, Q. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-79960684787&partnerID=40&md5=2a64f864f0b47aac9775c3f7d261c7e001376nas a2200217 4500008004100000245005900041210005600100260000900156300001200165490000600177520074200183653001500925653001700940653000800957653001300965653001500978100001700993700001601010700001501026856011701041 2011 eng d00aA practical U-healthcare network with security and QoS0 apractical Uhealthcare network with security and QoS c2011 a87 - 940 v93 aAs 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.10aHealthcare10aIPv6 network10aQoS10aSecurity10aUbiquitous1 aHuang, S.-Y.1 aHung, C.-C.1 aLee, C.-C. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-79960689974&partnerID=40&md5=ac1cfe986d44de663237d411cebdc5cc01363nas a2200193 4500008004100000245006200041210006200103260000900165300001400174490000600188520076700194653002100961653002100982653001901003653000801022100001101030700001101041856011701052 2011 eng d00aQuerying and ranking xml documents based on data synopses0 aQuerying and ranking xml documents based on data synopses c2011 a199 - 2050 v93 aThere 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.10aDocument ranking10aQuery processing10aQuery synopses10aXML1 aHe, W.1 aLv, T. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84855362331&partnerID=40&md5=85a8a3de60a877da1d0a3495eaf27e2201571nas a2200205 4500008004100000245008400041210006900125260000900194300001400203490000600217520087900223653002701102653003101129653002201160653002701182100001401209700001301223700001201236856011701248 2011 eng d00aReasoning on context satisfiability for service recommendation in mobilenetwork0 aReasoning on context satisfiability for service recommendation i c2011 a249 - 2540 v93 aThe 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.10aContext Satisfiability10aPrecondition Formalization10aService Reasoning10aService Recommendation1 aKuang, L.1 aChen, L.1 aXia, Y. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84855397903&partnerID=40&md5=409b304a3bf247ee3b6d37e361841e4101539nas a2200169 4500008004100000245004800041210004800089260000900137300001400146490000600160520099200166653002801158653002901186100001901215700001801234856011701252 2011 eng d00aReconfiguration of graphical user interface0 aReconfiguration of graphical user interface c2011 a213 - 2180 v93 aThe 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.10aDynamic reconfiguration10aGraphical user interface1 aPeriyasamy, K.1 aPerkinian, V. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84855393429&partnerID=40&md5=b5e09662f0a73d94b82934fd0f54d7df01742nas a2200205 4500008004100000245008200041210006900123260000900192300001200201490000600213520108100219653002301300653002501323653001501348100001301363700001501376700001401391700001401405856011701419 2011 eng d00aA refined methodology for automatic keyphrase assignment to digital documents0 arefined methodology for automatic keyphrase assignment to digita c2011 a55 - 630 v93 aKeyphrases 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.10aAutomatic indexing10aKeyphrase assignment10aVocabulary1 aKhan, S.1 aFatima, I.1 aIrfan, R.1 aLatif, K. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-79960690550&partnerID=40&md5=aeb220f4fd01fa335a93432979341abe01723nas a2200181 4500008004100000245010900041210006900150260000900219300001400228490000600242520105500248653002101303653002301324653004001347653002601387100001101413856011701424 2011 eng d00aResearch on color consistency for color marketing in network transactionsystem based on color management0 aResearch on color consistency for color marketing in network tra c2011 a276 - 2800 v93 aColor 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.10aColor Management10aColor Reproduction10aContraction-expansion Curve Fitting10aYule-Nielson Equation1 aLi, X. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84855376957&partnerID=40&md5=0b49993c20664cc749d00431998517a201550nas a2200205 4500008004100000245006200041210006200103260000900165300001400174490000600188520089100194653002201085653003101107653003101138100001401169700001601183700001501199700001301214856011701227 2011 eng d00aRole of segment progressive filter in dynamic data mining0 aRole of segment progressive filter in dynamic data mining c2011 a171 - 1750 v93 aAssociation 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.10aMining algorithms10aSegment Progressive Filter10aTemporal association rules1 aNaqvi, M.1 aHussain, K.1 aAsghar, S.1 aFong, S. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-80053099423&partnerID=40&md5=e113d860dc0339efdd1f9af97d9c912101834nas a2200193 4500008004100000245008300041210006900124260000900193300001400202490000600216520120800222653001201430653002101442653000901463653001101472100001501483700002501498856011701523 2011 eng d00aRoute maintenance using link state prediction for dense mobile Ad hoc networks0 aRoute maintenance using link state prediction for dense mobile A c2011 a153 - 1580 v93 aAn 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'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.10aHandoff10aPromiscuous mode10aRCPI10aRM-LSP1 aSankar, S.1 aSankaranarayanan, V. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-80053097391&partnerID=40&md5=c78b385ffa38ed082a3ca58d4fdd388f02039nas a2200169 4500008004100000245008800041210006900129260000900198300001400207490000600221520144000227653002301667653002201690653002601712100001401738856011701752 2011 eng d00aScanning-beam antenna on metamaterials coplanar structure for wireless applications0 aScanningbeam antenna on metamaterials coplanar structure for wir c2011 a111 - 1160 v93 aA 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.10aCoplanar Structure10aMicrowave systems10aScanning-Beam Antenna1 aHamdi, A. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-80053027377&partnerID=40&md5=64150e3e06edecef1c364f45804780d201995nas a2200193 4500008004100000245007500041210006900116260000900185300001300194490000600207520137000213653001801583653002101601653001601622653000901638100001601647700002101663856011701684 2011 eng d00aA secure and efficient authentication protocol for mobile RFID systems0 asecure and efficient authentication protocol for mobile RFID sys c2011 a99 - 1050 v93 aThe 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'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.10aEavesdropping10aForward security10aMobile RFID10aRFID1 aSandhya, M.1 aRangaswamy, T.R. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-80053013286&partnerID=40&md5=1de54a3906933fffce15a15339f4b55c01719nas a2200205 4500008004100000245007700041210006900118260000900187300001400196490000600210520103900216653002701255653002101282653002201303653002401325100001401349700001301363700002001376856011701396 2011 eng d00aA semantic annotation model for indexing and retrieving learning objects0 asemantic annotation model for indexing and retrieving learning o c2011 a159 - 1660 v93 aThe 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'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.10aContextual exploration10aLearning objects10aRocchio algorithm10aSemantic annotation1 aSmine, B.1 aFaiz, R.1 aDesclés, J.-P. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-80053105137&partnerID=40&md5=a9c6f1a4944e56cbefac59e5ce02559201486nas a2200193 4500008004100000245006000041210006000101260000900161300001400170490000600184520087000190653002801060653002301088653001801111100001501129700001601144700001501160856011701175 2011 eng d00aSemantic resource discovery in large scale environments0 aSemantic resource discovery in large scale environments c2011 a126 - 1310 v93 aIn 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' dynamicity, (ii) reducing the maintenance cost and (iii) taking into account the semantic heterogeneity.10aBiomedical Data Sources10aResource Discovery10aSemantic Grid1 aKetata, I.1 aMokadem, R.1 aMorvan, F. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-80052989830&partnerID=40&md5=60069a9a9d80afc6bcdc3332e86f2c8601237nas a2200181 4500008004100000245004600041210004500087260000900132300001000141490000600151520065300157653003600810653002700846653002100873653002400894100002000918856011700938 2011 eng d00aTask-oriented dialogue agent architecture0 aTaskoriented dialogue agent architecture c2011 a1 - 80 v93 aThis 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.10aAgent-based dialogue management10aArtifcial intelligence10aDialogue systems10aSystem adaptability1 aNestorovič, T. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-79960683406&partnerID=40&md5=8d1dcf9d4272619ff036cd94546c40cb02040nas a2200229 4500008004100000245009800041210006900139260000900208300001400217490000600231520131100237653000901548653001301557653000801570653003601578653002701614653000801641100001401649700001601663700001401679856011701693 2010 eng d00aAn AODV based QoS routing protocol for delay sensitive applications in mobile Ad Hoc networks0 aAODV based QoS routing protocol for delay sensitive applications c2010 a303 - 3140 v83 aIn 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.10aAODV10aGloMoSim10aMAC10aMobile ad hoc networks (MANETs)10aPerformance evaluation10aQoS1 aKumar, R.1 aSarje, A.K.1 aMisra, M. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-79960677246&partnerID=40&md5=b4b3c7a8accf3bb3de65c75a752e891502312nas a2200217 4500008004100000245007500041210006900116260000900185300001400194490000600208520161300214653002401827653002501851653001801876653002001894100001701914700001601931700001501947700001501962856011701977 2010 eng d00aAn approach for matching schemas of heterogeneous relational databases0 aapproach for matching schemas of heterogeneous relational databa c2010 a260 - 2690 v83 aSchema 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.10aBiomedical database10aDatabase integration10aHeterogeneous10aSchema matching1 aKarasneh, Y.1 aIbrahim, H.1 aOthman, M.1 aYaakob, R. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-79960671688&partnerID=40&md5=6ff8c1cb0997d2a66db189af36cbfb1c01675nas a2200169 4500008004100000245004600041210004300087260000900130300001400139490000600153520113900159653002001298653002101318653003401339100001501373856011701388 2010 eng d00aOn Arabic texts compression and searching0 aArabic texts compression and searching c2010 a355 - 3610 v83 aWith 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.10aArabic language10aData compression10aSearching in compressed files1 aSallay, H. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-79960677042&partnerID=40&md5=e14b05b52c375cabf39af4b4801c5c9101839nas a2200205 4500008004100000245006300041210006200104260000900166300001400175490000600189520117400195653002201369653003001391653001501421653001401436653002801450100001901478700001901497856011701516 2010 eng d00aAugmenting digital libraries with web-based visualizations0 aAugmenting digital libraries with webbased visualizations c2010 a377 - 3860 v83 aDigital 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'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'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.10aDigital libraries10aGraphical user interfaces10aNavigation10aPaperCube10aWeb-based visualization1 aBergström, P.1 aAtkinson, D.C. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-79960682007&partnerID=40&md5=746cf2e1545b3dd8f0d1697f5673e6e801482nas a2200193 4500008004100000245008900041210006900130260000900199300001200208490000600220520082300226653002401049653002801073653002001101100001601121700001901137700001501156856011701171 2010 eng d00aAn authoring system for interactive mobile TV services using MPEG-7 and MPEG-4 LASeR0 aauthoring system for interactive mobile TV services using MPEG7  c2010 a37 - 460 v83 aConsuming 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.10aMobile Applications10aMultimedia applications10aUser Evaluation1 aHofmann, A.1 aKriechbaum, A.1 aBailer, W. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-77958062610&partnerID=40&md5=09822f4813deb4b9ba70a5e3a45a02fe02111nas a2200205 4500008004100000245011700041210006900158260000900227300001400236490000600250520137500256653002501631653002601656653002701682653002401709100002001733700001601753700001901769856011701788 2010 eng d00aAutomatic segmentation, aggregation and indexing of multimodal news information from television and the Internet0 aAutomatic segmentation aggregation and indexing of multimodal ne c2010 a387 - 3950 v83 aThe 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.10aContent segmentation10aMultimedia annotation10aMultimodal aggregation10aSemantic enrichment1 aMontagnuolo, M.1 aMessina, A.1 aBorgotallo, R. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-79960677245&partnerID=40&md5=7e687d0db3f4300e8eef4114759a01c601590nas a2200193 4500008004100000245006600041210006600107260000900173300001400182490000600196520095400202653003301156653002801189100001301217700001801230700001801248700001301266856011701279 2010 eng d00aBidirectional recommendation technology for web digital texts0 aBidirectional recommendation technology for web digital texts c2010 a240 - 2460 v83 aRecently, 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.10aBidirectional recommendation10aCollaborative filtering1 aWada, Y.1 aMatsuzawa, S.1 aYamaguchi, M.1 aDohi, S. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-79960678552&partnerID=40&md5=26da622fa54ccbb85a451552ee79e80101717nas a2200181 4500008004100000245006200041210006100103260000900164300001200173490000600185520111700191653002201308653002901330653002501359100001601384700001801400856011701418 2010 eng d00aBuilding context-awareness models for mobile applications0 aBuilding contextawareness models for mobile applications c2010 a78 - 870 v83 aThe 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.10aContext-awareness10aModel driven engineering10aUbiquitous computing1 aTaconet, C.1 aKazi-Aoul, Z. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-79960676592&partnerID=40&md5=bec59c3aa9c877ef871154ab0b7c4a0c01226nas a2200205 4500008004100000245006100041210006000102260000900162300001100171490000600182520058700188653002500775653001700800653002300817653002200840653001800862653000900880100001400889856011700903 2010 eng d00aCase studies on context-aware mobile multimedia services0 aCase studies on contextaware mobile multimedia services c2010 a4 - 150 v83 aThis 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.10aContext-aware system10aGPRS network10aMobile advertising10aMobile multimedia10aSmartRotuaari10aWLAN1 aOjala, T. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-77958049730&partnerID=40&md5=d237bec84fe18702a28d433ba8d5ce4701531nas a2200229 4500008004100000245007600041210006900117260000900186300001400195490000600209520079000215653001701005653002701022653001801049653002001067653002301087653002301110100002101133700001601154700001401170856011701184 2010 eng d00aCellular DBMS: An attempt towards biologically-inspired data management0 aCellular DBMS An attempt towards biologicallyinspired data manag c2010 a117 - 1280 v83 aExisting 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.10aAdaptability10aBiological-inspiration10aCustomization10aData management10aDBMS architectures10aEmbedded databases1 aRahman, S.S., Ur1 aKöppen, V.1 aSaake, G. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-79952576380&partnerID=40&md5=ec9e6d57f05cbabf1fcc0934eb81596301961nas a2200169 4500008004100000245006900041210006700110260000900177300001200186490000600198520140100204653001801605653002301623100001401646700001401660856011701674 2010 eng d00aContent-based image retrieval systems-reviewing and benchmarking0 aContentbased image retrieval systemsreviewing and benchmarking c2010 a54 - 640 v83 aThe 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.10aImage ranking10aMPEG-7 descriptors1 aKosch, H.1 aMaier, P. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-77958035095&partnerID=40&md5=3332d95bebdc7fdabeda9f57902ea60801422nas a2200193 4500008004100000245009000041210006900131260000900200300001400209490000600223520074000229653003400969653002201003653003301025653002301058100001601081700001401097856011701111 2010 eng d00aA deadline-driven probabilistic quality of service routing for mobile ad hoc networks0 adeadlinedriven probabilistic quality of service routing for mobi c2010 a129 - 1350 v83 aProvision 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.10aNodedisjoint mulipath routing10aPath independence10aProbabilistic QoS guarantees10aQuality of service1 aAbbas, A.M.1 aKure, Ø. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-77958573455&partnerID=40&md5=3979494bcea959e4e5267076e4538fb502282nas a2200217 4500008004100000245006100041210005900102260000900161300001400170490000600184520161700190653001601807653001901823653001601842653001601858653002401874653001801898100001501916700001601931856011701947 2010 eng d00aA dynamic load distribution algorithm for virtual worlds0 adynamic load distribution algorithm for virtual worlds c2010 a181 - 1890 v83 aThe 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.10aConsistency10aLoad balancing10aScalability10aSecond life10aVirtual Environment10aVirtual world1 aFarooq, U.1 aGlauert, J. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-79960667976&partnerID=40&md5=0447704980b109c746d050be6818c61301068nas a2200373 4500008004100000245009900041210006900140260000900209300001000218490000600228100001700234700001900251700001500270700001400285700001500299700001300314700001500327700001200342700001600354700001800370700001900388700002000407700001500427700001200442700001600454700001300470700001500483700001700498700001400515700001600529700001600545700001600561856011700577 2010 eng d00aEditorial preface: Special issue on context-aware and mobile multimedia databases and services0 aEditorial preface Special issue on contextaware and mobile multi c2010 a2 - 30 v81 aGrigoras, R.1 aCharvillat, V.1 aChbeir, R.1 aKosch, H.1 aBailer, W.1 aBoll, S.1 aBrunie, L.1 aCao, Y.1 aDelgado, J.1 aGranitzer, M.1 aHausenblas, M.1 aEidenberger, H.1 aKlamma, R.1 aLux, M.1 aMarques, O.1 aOria, V.1 aPlesca, C.1 aPréteux, F.1 aSedes, F.1 aSpaniol, M.1 aTernier, S.1 aWolpers, M. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84861465089&partnerID=40&md5=7b82f006c7ffa103ca31e784f7cd8bf800461nas a2200109 4500008004100000245009900041210006900140260000900209300001000218490000600228856011700234 2010 eng d00aEditorial preface: Special issue on context-aware and mobile multimedia databases and services0 aEditorial preface Special issue on contextaware and mobile multi c2010 a2 - 30 v8 uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-77958036375&partnerID=40&md5=77e073b1f1ef1e51a6dbafd4610f190e02545nas a2200241 4500008004100000245011500041210006900156260000900225300001400234490000600248520174100254653002501995653002702020653001402047653002402061653002102085100001702106700001902123700001402142700001402156700001602170856011702186 2010 eng d00aEnabling automatic just-in-time evaluation of in-class discussions in on-line collaborative learning practices0 aEnabling automatic justintime evaluation of inclass discussions  c2010 a322 - 3290 v83 aLearning 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.10aAutomatic evaluation10aCollaborative learning10aGroupware10aKnowledge discovery10aMachine learning1 aCaballé, S.1 aLapedriza, À.1 aMasip, D.1 aXhafa, F.1 aAbraham, A. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-79960216812&partnerID=40&md5=0f38528ca7e6fa26bdcaf9c0b81206c901308nas a2200205 4500008004100000245006700041210006700108260000900175300001200184490000600196520064300202653002400845653002800869653002000897100001700917700001500934700001700949700001900966856011700985 2010 eng d00aEvaluation of multimedia features in mobile guide applications0 aEvaluation of multimedia features in mobile guide applications c2010 a28 - 360 v83 aMobile guide applications are among the most used applications in Today'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.10aMobile Applications10aMultimedia applications10aUser Evaluation1 aChoudary, O.1 aBaccot, B.1 aGrigoras, R.1 aCharvillat, V. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-77958074631&partnerID=40&md5=11c8aa34465d113aadb7a6cfe58a3b3b01850nas a2200217 4500008004100000245010200041210006900143260000900212300001400221490000600235520109100241653002801332653002601360653003401386653002001420653002001440100001701460700001701477700002101494856011701515 2010 eng d00aExploiting multi-word similarity for retrieval in medical document collections: The TSRM approach0 aExploiting multiword similarity for retrieval in medical documen c2010 a315 - 3210 v83 aIn 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.10aDocument representation10aInformation retrieval10aMedical information retrieval10aTerm extraction10aTerm Similarity1 aDrymonas, E.1 aZervanou, K.1 aPetrakis, E.G.M. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-79960229245&partnerID=40&md5=f9f58b511661960f2a01ed0691084e3301542nas a2200217 4500008004100000245007300041210006900114260000900183300001400192490000600206520084100212653001801053653001801071653002501089653002101114653002801135100001501163700001101178700001801189856011701207 2010 eng d00aExtraction of characteristic description for analyzing news agencies0 aExtraction of characteristic description for analyzing news agen c2010 a349 - 3540 v83 aNews 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.10aNews agencies10aNews analysis10aText characteristics10aText description10aWord frequency analysis1 aIshida, S.1 aMa, Q.1 aYoshikawa, M. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-79960674167&partnerID=40&md5=ecab8d077da920129f8c0e884ea0c5b401758nas a2200217 4500008004100000245006600041210006500107260000900172300001400181490000600195520108700201653002401288653001501312653002401327653001401351100001301365700001501378700001301393700001701406856011701423 2010 eng d00aExtraction of children's friend relations from activity level0 aExtraction of childrens friend relations from activity level c2010 a270 - 2750 v83 aThis 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's greatly influenced by their friend relations. Although preschool teachers need to observe them to assist in the growth of children's social progress and support the development each child'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's "breadth" and "depth" of friend relations by using more than one dendrogram. When the authors record children'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.10aAcceleration sensor10aClustering10aFriendship relation10aPedometer1 aHaga, H.1 aKaneda, S.1 aKono, A.1 aShintani, K. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-79960659287&partnerID=40&md5=0f94aed0a83203638341b37b6cb7cc8b01803nas a2200205 4500008004100000245010800041210006900149260000900218300001400227490000600241520109000247653002201337653002901359653002901388653001901417100001701436700001201453700001501465856011701480 2010 eng d00aExtraction of features for diagnosing pneumoconiosis from chest radiographs obtained with a CCD scanner0 aExtraction of features for diagnosing pneumoconiosis from chest  c2010 a147 - 1520 v83 aThis 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.10aChest radiographs10aComputer-aided diagnosis10aMedical image processing10aPneumoconiosis1 aNakamura, M.1 aAbe, K.1 aMinami, M. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-79960677554&partnerID=40&md5=95072c54ff5968028fd8e2985166c66301572nas a2200193 4500008004100000245010200041210006900143260000900212300001400221490000600235520091700241653001901158653002001177653001601197653001401213100001501227700001901242856011701261 2010 eng d00aFault-tolerant meta-scheduler for price-based job scheduling by applying multi-reservation method0 aFaulttolerant metascheduler for pricebased job scheduling by app c2010 a213 - 2180 v83 aIn 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.10aCheck-pointing10aFault tolerance10aReplication10aRough set1 aBouyer, A.1 aAbdullah, A.H. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-79960679148&partnerID=40&md5=e30a655c66545df2023a714a92a03da801841nas a2200205 4500008004100000245008900041210006900130260000900199300001400208490000600222520116600228653002101394653001701415653001601432100001801448700001701466700001801483700001701501856011701518 2010 eng d00aFile replication method based on demand forecasting of file download in P2P networks0 aFile replication method based on demand forecasting of file down c2010 a247 - 2530 v83 aIn 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.10aP2P file sharing10aP2P networks10aReplication1 aKobayashi, M.1 aKageyama, J.1 aShibusawa, S.1 aYonekura, T. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-79960687658&partnerID=40&md5=3db4c30b2db7743416ab3f4cb69524b301256nas a2200193 4500008004100000245006000041210005700101260000900158300001400167490000600181520064800187653003200835653001900867653000800886653002200894100001300916700001600929856011700945 2010 eng d00aA framework for enhancing non context-driven XML search0 aframework for enhancing non contextdriven XML search c2010 a167 - 1740 v83 aA 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' 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.10aContextdriven search system10aKeyword search10aXML10aXML search engine1 aTaha, K.1 aElmasri, R. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-79960686613&partnerID=40&md5=a8d61dbc9c63c15c9ce19f500d97fabe01537nas a2200169 4500008004100000245007800041210006900119260000900188300001400197490000600211520095100217653002801168653002801196100001401224700001201238856011701250 2010 eng d00aFramework for mixed entity resolving system using unsupervised clustering0 aFramework for mixed entity resolving system using unsupervised c c2010 a362 - 3680 v83 aDuring 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.10aMixed entity resolution10aUnsupervised clustering1 aOn, B.-W.1 aLee, I. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-79960657815&partnerID=40&md5=b7024f58cda537138350a05e3d88ac8c01179nas a2200217 4500008004100000245006400041210006200105260000900167300001400176490000600190520050600196653002600702653002600728653001300754653001800767653001700785653001100802100001700813700001400830856011700844 2010 eng d00aA fuzzy grassroots ontology for improving weblog extraction0 afuzzy grassroots ontology for improving weblog extraction c2010 a276 - 2840 v83 aThis 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.10aFuzzy data clustering10aInformation retrieval10aOntology10aSearch engine10aSemantic web10aWeblog1 aPortmann, E.1 aMeier, A. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-77955703451&partnerID=40&md5=e96f607ac097bae04e70c3dc44c841f301169nas a2200217 4500008004100000245008100041210006900122260000900191300001400200490000600214520048200220653002100702653002000723653001800743653001700761653000800778100001500786700001700801700001600818856011700834 2010 eng d00aGeneralization of multiple key agreement protocol based on bilinear pairings0 aGeneralization of multiple key agreement protocol based on bilin c2010 a298 - 3020 v83 aIn 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.10aBilinear pairing10aData encryption10aKey agreement10aKey exchange10aMQV1 aLee, C.-C.1 aCheng, T.-Y.1 aChen, T.-Y. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-79960675856&partnerID=40&md5=75cd9ae7824ee7748fc6d102330d630d01269nas a2200205 4500008004100000245007800041210006900119260000900188300001200197490000600209520058000215653003500795653002400830653002400854653001800878100001700896700001500913700001800928856011700946 2010 eng d00aA grayscale image steganography based upon discrete cosine transformation0 agrayscale image steganography based upon discrete cosine transfo c2010 a88 - 940 v83 aIn 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.10aDiscrete cosine transformation10aHuman visual system10aInformation systems10aSteganography1 aChang, C.-C.1 aLin, P.-Y.1 aChuang, J.-C. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-79960667544&partnerID=40&md5=50ebade6fc46d74174983072f0b6f5e801946nas a2200265 4500008004100000245005700041210005700098260000900155300001400164490000600178520115700184653001301341653002901354653002601383653002701409653001701436653000801453653002001461100001401481700001601495700001601511700001601527700002001543856011701563 2010 eng d00aHarvesting pertinent resources from Linked Open Data0 aHarvesting pertinent resources from Linked Open Data c2010 a205 - 2120 v83 aLinked 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' 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.10aCAF-SIAL10aInformation presentation10aInformation retrieval10aLinked Open Data (LOD)10aSemantic web10aURI10aUser interfaces1 aLatif, A.1 aAfzal, M.T.1 aSaeed, A.U.1 aHoefler, P.1 aTochtermann, K. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-79960685735&partnerID=40&md5=cc886d4db44fdc4f20722b7621aca81801582nas a2200241 4500008004100000245008200041210006900123260000900192300001200201490000600213520077800219653004100997653002401038653002301062653002301085653001601108653002601124100001801150700001701168700002101185700001701206856011701223 2010 eng d00aHierarchical clustering in medical document collections: The BIC-means method0 aHierarchical clustering in medical document collections The BICm c2010 a71 - 770 v83 aHierarchical 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.10aBayesian information criterion (BIC)10aDocument clustering10aDocument retrieval10aDynamic clustering10aPerformance10aTermination criterion1 aHourdakis, N.1 aArgyriou, M.1 aPetrakis, E.G.M.1 aMilios, E.E. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-79960667355&partnerID=40&md5=87c5599ab55c27b1d1ae1f1f2e76cd6b01449nas a2200205 4500008004100000245007100041210006900112260000900181300001400190490000600204520077700210653002000987653000801007653001901015653003301034653002401067100001501091700002001106856011701126 2010 eng d00aImproving Arabic text categorization using Neural Network with SVD0 aImproving Arabic text categorization using Neural Network with S c2010 a233 - 2390 v83 aIn 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.10aArabic language10aMLP10aNeural network10aSingular Value Decomposition10aText categorization1 aHarrag, F.1 aAl-Qawasmah, E. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-79960685734&partnerID=40&md5=231f569e3eb222816e6af0bb1e4a5cc400327nas a2200109 4500008004100000245001800041210001800059260000900077300000800086490000600094856011700100 2010 eng d00aIn this issue0 aIn this issue c2010 a - 0 v8 uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-79960663855&partnerID=40&md5=372c45972c74319be5ec570016fa54c700327nas a2200109 4500008004100000245001800041210001800059260000900077300000800086490000600094856011700100 2010 eng d00aIn this issue0 aIn this issue c2010 a - 0 v8 uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-79960681866&partnerID=40&md5=be81ddd041d7fc3802f56551ac48e57b01624nas a2200205 4500008004100000245007000041210006900111260000900180300001400189490000600203520094300209653003401152653002001186653002301206653002501229100001801254700001101272700001801283856011701301 2010 eng d00aKnowledge management of 1D SDS PAGE gel protein image information0 aKnowledge management of 1D SDS PAGE gel protein image informatio c2010 a223 - 2320 v83 aComputational 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.10a1D SDS PAGE protein gel image10aAtlantic salmon10aGel image analysis10aKnowledge management1 aRamaswamy, G.1 aWu, B.1 aMacevilly, U. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-79960692176&partnerID=40&md5=be17770f0ee0ad9cba603f903cdd0aee01819nas a2200217 4500008004100000245006000041210006000101260000900161300001400170490000600184520115700190653001801347653001301365653002801378653001601406653001501422100001601437700001601453700001501469856011701484 2010 eng d00aMining the blogosphere to generate cuisine hotspot maps0 aMining the blogosphere to generate cuisine hotspot maps c2010 a396 - 4010 v83 aChoosing 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.10aBlog analysis10aHotspots10aName entity recognition10aWeb content10aWeb search1 aShih, C.-C.1 aPeng, T.-C.1 aLai, W.-S. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-79960266928&partnerID=40&md5=4f85ee81adec856534db4c96673f0dbe01371nas a2200253 4500008004100000245007500041210006900116260000900185300001200194490000600206520054000212653002900752653005700781653002400838653002200862100001700884700001300901700001900914700001600933700001600949700001700965700001800982856011701000 2010 eng d00aA MPEG-based architecture for generic distributed multimedia scenarios0 aMPEGbased architecture for generic distributed multimedia scenar c2010 a47 - 530 v83 aThis 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.10aContext-based adaptation10aDigital Rights Management-Rights Expression Language10aFeatures extraction10aMPEG query format1 aCarreras, A.1 aTous, R.1 aRodríguez, E.1 aDelgado, J.1 aCordara, G.1 aFrancini, G.1 aGibellino, D. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-77958070468&partnerID=40&md5=fccf7895a6f9802b4adb6febe511be2f01809nas a2200205 4500008004100000245005200041210005100093260000900144300001400153490000600167520115100173653004801324653001701372653002001389653002801409100001801437700001801455700001301473856011701486 2010 eng d00aMulti-objective optimization in service systems0 aMultiobjective optimization in service systems c2010 a254 - 2590 v83 aMuti-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.10aMulti-Objective Particle Swarm Optimization10aService cost10aService systems10aSimulation optimization1 aGonsalves, T.1 aYamagishi, K.1 aItoh, K. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-79960666260&partnerID=40&md5=6941ee36882d582a6672bdc8a5f3755502070nas a2200229 4500008004100000245006500041210006300106260000900169300001400178490000600192520137000198653001901568653001901587653002201606653002901628653001401657100001401671700001301685700001201698700001301710856011701723 2010 eng d00aA novel access control strategy for distributed data systems0 anovel access control strategy for distributed data systems c2010 a291 - 2970 v83 aIt 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.10aAccess control10aCloud database10aData distribution10aMulti-hierarchical model10aMultitree1 aZhang, J.1 aWang, X.1 aLiu, H.1 aMeng, J. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-79960669952&partnerID=40&md5=82211ced06d718d2f20daa5dfc14679801906nas a2200217 4500008004100000245006900041210006900110260000900179300001400188490000600202520124400208653001801452653001601470653001501486653001001501100001501511700001301526700001601539700001601555856011701571 2010 eng d00aPerformance evaluation of fixed and mobile relay in WiMAX system0 aPerformance evaluation of fixed and mobile relay in WiMAX system c2010 a190 - 1950 v83 aFuture 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.10aCoverage area10aFixed relay10aThroughput10aWiMAX1 aMumtaz, S.1 aTu, L.T.1 aSadeghi, R.1 aGameiro, A. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-79960663765&partnerID=40&md5=08f3181dd0a1828512060fb801f8eadc01854nas a2200205 4500008004100000245008300041210006900124260000900193300001400202490000600216520115100222653002401373653002901397653002301426653002801449653001301477100001801490700002301508856011701531 2010 eng d00aQos-aware selection of web service compositions using Harmony Search algorithm0 aQosaware selection of web service compositions using Harmony Sea c2010 a160 - 1660 v83 aExtensive 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'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.10aGlobal optimization10aHarmony Search algorithm10aQuality-of-service10aWeb service composition10aWorkflow1 aJafarpour, N.1 aKhayyambashi, M.R. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-79960212292&partnerID=40&md5=8b2aa95f15cbf2d77baea346d4870d0401726nas a2200205 4500008004100000245008200041210006900123260000900192300001400201490000600215520104000221653002801261653000801289653003701297653002201334100001501356700001501371700001701386856011701403 2010 eng d00aA query-oriented XML fragment search approach on a relational database system0 aqueryoriented XML fragment search approach on a relational datab c2010 a175 - 1800 v83 aIn 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.10aEfficient and effective10aRDB10aScoring method for XML fragments10aXML search engine1 aKeyaki, A.1 aHatano, K.1 aMiyazaki, J. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-79956028452&partnerID=40&md5=42415d9f4c5aca4c312c791ecc719adb01777nas a2200217 4500008004100000245005300041210005300094260000900147300001400156490000600170520110600176653001901282653002001301653002201321653002701343100001601370700001501386700001701401700002401418856011701442 2010 eng d00aRule based autonomous citation mining with tierl0 aRule based autonomous citation mining with tierl c2010 a196 - 2040 v83 aCitations management is an important task in managing digital libraries. Citations provide valuable information e.g., used in evaluating an author'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.10aCitation index10aCitation mining10aDigital libraries10aInformation extraction1 aAfzal, M.T.1 aMaurer, H.1 aBalke, W.-T.1 aKulathuramaiyer, N. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-79951786283&partnerID=40&md5=4fbea6129a6c4c727c3c0618ccbe608701839nas a2200205 4500008004100000245010600041210006900147260000900216300001400225490000600239520115800245653002001403653001501423653001401438653002101452653001401473653001401487100001501501856011701516 2010 eng d00aSpam blog filtering with bipartite graph clustering and mutual detection between spam blogs and words0 aSpam blog filtering with bipartite graph clustering and mutual d c2010 a108 - 1160 v83 aThis 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' updated blog data and a more detailed experiment with one day'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.10aBipartite graph10aClustering10aFiltering10aMutual detection10aSpam blog10aSpam word1 aIshida, K. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-79960276152&partnerID=40&md5=575c9621399a49b24a9d7c264810d30402193nas a2200205 4500008004100000245010100041210006900142260000900211300001400220490000600234520145900240653004101699653002401740653002301764653002301787653001601810653002601826100001801852856011701870 2010 eng d00aA specification model for temporal and spatial relations of segments in multimedia presentations0 aspecification model for temporal and spatial relations of segmen c2010 a136 - 1460 v83 aIn 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.10aBayesian information criterion (BIC)10aDocument clustering10aDocument retrieval10aDynamic clustering10aPerformance10aTermination criterion1 aHakkoymaz, V. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-79960249136&partnerID=40&md5=da73c8932dcd46bf41b98910c87b591601865nas a2200229 4500008004100000245008600041210006900127260000900196300001200205490000600217520116900223653001001392653000801402653002101410653001301431653001101444653001001455100001701465700001701482700001901499856011701518 2010 eng d00aA survey on delivery context description formats - A comparison and mapping model0 asurvey on delivery context description formats A comparison and  c2010 a16 - 270 v83 aNowadays, 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).10aCC/PP10aDCO10aDelivery Context10aMetadata10aUAProf10aUED.t1 aTimmerer, C.1 aJabornig, J.1 aHellwagner, H. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-77958067245&partnerID=40&md5=4ec9bec6bf35fd2f1a58a4be7f5ec64a01812nas a2200193 4500008004100000245006400041210006400105260000900169300001400178490000600192520118900198653002001387653001901407653002401426653002001450100001601470700001501486856011701501 2010 eng d00aSystem of boosting voting with multiple learning algorithms0 aSystem of boosting voting with multiple learning algorithms c2010 a153 - 1590 v83 aThe 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.10aBoosting voting10aClassification10aEnsemble classifier10aMajority voting1 aChen, C.-H.1 aHsu, C.-C. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-79960667758&partnerID=40&md5=c1ce08210de8719732261454255800d901635nas a2200181 4500008004100000245005600041210005600097260000900153300001400162490000600176520105100182653001901233653002501252653002601277653001901303100001401322856011701336 2010 eng d00aTowards building ranking models with annual reports0 aTowards building ranking models with annual reports c2010 a338 - 3430 v83 aThe 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.10aAnnual reports10aDocumentation models10aInformation retrieval10aRanking models1 aQiu, X.Y. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-79960663639&partnerID=40&md5=391fa47605e7e864c26988ad0b95ab6302051nas a2200241 4500008004100000245008000041210006900121260000900190300001300199490000600212520132700218653001401545653001401559653001301573653001201586653001601598653001301614653001901627100001601646700001501662700001501677856011701692 2010 eng d00aV-isoNet: A virtualised and isolated network using open source technologies0 aVisoNet A virtualised and isolated network using open source tec c2010 a95 - 1000 v83 aComputer 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.10aEducation10aForensics10aIsolated10aNetwork10aOpen source10aSecurity10aVirtualization1 aGleeson, M.1 aMarkey, D.1 aMtenzi, F. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-79960692758&partnerID=40&md5=67245f8ace4f0dc027e9fdd56f9771d202286nas a2200205 4500008004100000245012200041210006900163260000900232300001400241490000600255520152200261653003101783653002901814653002601843653003701869100002401906700001901930700001401949856011701963 2010 eng d00aWeb Architectural-Inducing Model (WA-IM) for Information Architecture in cultural context: An empirical investigation0 aWeb ArchitecturalInducing Model WAIM for Information Architectur c2010 a330 - 3370 v83 aWebsite 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.10aHuman computer interaction10aInformation architecture10aInformation structure10aWebsite information architecture1 aIsa, W.A.R.W., Mohd1 aNoor, N.L., Md1 aMehad, S. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-79960696381&partnerID=40&md5=3f95a28698acba915c51fe96df49d29702230nas a2200205 4500008004100000245013200041210006900173260000900242300001400251490000600265520149200271653003401763653002401797653002101821653002401842100001301866700001301879700001501892856011701907 2010 eng d00aA Web-based surveillance system for traffic behavior and its application for practical recommendation of crosswalk installation0 aWebbased surveillance system for traffic behavior and its applic c2010 a101 - 1070 v83 aA 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' 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' 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'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' 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's periodical behaviors.10aEvidence-based recommendation10aImage understanding10aMobile computing10aSurveillance system1 aImai, Y.1 aHori, Y.1 aMasuda, S. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-79960688256&partnerID=40&md5=5ad95a8727255298e88fb69f8b4cffd701407nas a2200241 4500008004100000245006700041210006700108260000900175300001400184490000600198520066400204653002100868653001500889653002400904653001500928653002400943653001900967100001600986700001601002700001501018700001501033856011701048 2009 eng d00aAbout the reusable software remote laboratories have in common0 aAbout the reusable software remote laboratories have in common c2009 a166 - 1720 v73 aIn 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.10aInteroperability10aMiddleware10aOnline laboratories10aOntologies10aRemote laboratories10aRemote systems1 aGravier, C.1 aFayolle, J.1 aLardon, J.1 aBayard, B. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-73249142470&partnerID=40&md5=639fc7fb80ea23878b67430f914497fe01669nas a2200229 4500008004100000245008200041210006900123260000900192300001400201490000600215520095400221653001101175653002001186653002001206653001801226653001801244100001501262700001601277700001201293700001701305856011701322 2009 eng d00aAddressing the challenge of managing large-scale digital multimedia libraries0 aAddressing the challenge of managing largescale digital multimed c2009 a261 - 2690 v73 aTraditional 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.10aDesign10aDigital objects10aExperimentation10aHuman factors10aVideo objects1 aGurrin, C.1 aAarflot, T.1 aSav, S.1 aJohansen, D. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-77953277044&partnerID=40&md5=75419cab710ca0152f89b3a277933c7101687nas a2200193 4500008004100000245009100041210006900132260000900201300001400210490000600224520102100230653004001251653002201291653001701313100001501330700001601345700001501361856011701376 2009 eng d00aOn automated generation of Diagnosers in fault tolerant Service Oriented Architectures0 aautomated generation of Diagnosers in fault tolerant Service Ori c2009 a336 - 3420 v73 aOne of the key stages of the development of a fault tolerant Service Oriented Architecture is the creation of Diagnosers, which monitors the system'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.10aBusiness process execution language10aOracle JDevlopers10aWeb services1 aAlodib, M.1 aBordbar, B.1 aMajeed, B. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-79960673085&partnerID=40&md5=01e27ad877cad334f9f50bb5f59cbeff01401nas a2200241 4500008004100000245008200041210006900123260000900192300001300201490000600214520061100220653003100831653002900862653002500891653002300916653002800939653001600967100001100983700001800994700001601012700001401028856011701042 2009 eng d00aBiorthogonal matrix dirty paper coding for information hiding in still images0 aBiorthogonal matrix dirty paper coding for information hiding in c2009 a96 - 1050 v73 aIn 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', 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.10aBiorthogonal matrix coding10aDigital content security10aDigital watermarking10aDirty paper coding10aDocument authentication10aGoppa codes1 aXu, X.1 aTomlinson, M.1 aAmbroze, M.1 aAhmed, M. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-70350666671&partnerID=40&md5=1a086001e3b504ed05b908e929fd00e101581nas a2200193 4500008004100000245010100041210006900142260000900211300001400220490000600234520089200240653002201132653002801154653002601182100002601208700001801234700001801252856011701270 2009 eng d00aCache Pre-fetching and Replacement strategies for location dependent data in mobile environments0 aCache Prefetching and Replacement strategies for location depend c2009 a185 - 1900 v73 aIn 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.10aCache replacement10aLocation dependent data10aPrefetching algorithm1 aJane, Mary, Magdalene1 aIlayaraja, N.1 aNadarajan, R. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-73249124769&partnerID=40&md5=c2445ecd7a2b48db9d0be250bd2dc45e01958nas a2200169 4500008004100000245004000041210003900081260000900120300001400129490000600143520141500149653001501564653002301579653004701602100002201649856011701671 2009 eng d00aCUDL language semantics: Conditions0 aCUDL language semantics Conditions c2009 a244 - 2510 v73 aConceptual 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.10aConditions10aDatabase languages10aDynamically evolving database environments1 aKaranikolas, N.N. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-77953258890&partnerID=40&md5=6ee88af2dfa44c5427dc14e26dbc6d4002181nas a2200205 4500008004100000245008400041210006900125260000900194300001400203490000600217520150200223653002001725653001901745653002301764653001601787100001501803700002201818700001801840856011701858 2009 eng d00aDeriving the impact of scientific publications by mining citation opinion terms0 aDeriving the impact of scientific publications by mining citatio c2009 a282 - 2880 v73 aOne 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' 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's impact? Does the citations' context influence people'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' perceived importance.10aCitation impact10aOpinion mining10aSentiment analysis10aText mining1 aStamou, S.1 aMpouloumpasis, N.1 aKozanidis, L. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-77953259909&partnerID=40&md5=29f4612a2a8b6038c4d5f5e37fcbd67b01859nas a2200217 4500008004100000245006500041210006500106260000900171300001200180490000600192520116800198653002701366653002601393653002601419653001801445100001701463700001401480700001701494700001301511856011701524 2009 eng d00aDesign and development of a Query Graph Visualization system0 aDesign and development of a Query Graph Visualization system c2009 a21 - 290 v73 aCollaborative 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'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'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.10aCollaborative querying10aInformation retrieval10aQuery Graph Visualize10aQuery network1 aGoh, D.H.-L.1 aLee, C.S.1 aChua, A.Y.K.1 aLuyt, B. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-70350660828&partnerID=40&md5=33ccaf28cf0dad32e0b47d01f84a870702001nas a2200217 4500008004100000245009400041210006900135260000900204300001200213490000600225520126000231653002401491653004001515653000901555653003301564653001001597100001601607700002101623700002201644856011701666 2009 eng d00aDesign and development of the dynamic DRBAC model using PMI and xacml-based authorization0 aDesign and development of the dynamic DRBAC model using PMI and  c2009 a63 - 730 v73 aIn 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.10aDrbac authorization10aPrivilege Management Infrastructure10aSAML10aX.509 public key certificate10aXACML1 aFugkeaw, S.1 aManpanpanich, P.1 aJuntapremjitt, S. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-70350666673&partnerID=40&md5=f54e5a65269f08ac0f6dda7b45a823c101783nas a2200289 4500008004100000245005600041210005600097260000900153300001400162490000600176520096500182653002301147653002301170653000801193653000801201653001201209653003201221653001301253653001301266653001501279653002401294100001301318700001301331700001801344700001401362856011701376 2009 eng d00aDesign and implementation of the Fast Send Protocol0 aDesign and implementation of the Fast Send Protocol c2009 a120 - 1270 v73 aOver 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' 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's resources to a high extent.10aBulk-data transfer10aFast Send Protocol10aFSP10aFTP10aGridFTP10aHigh performance networking10aMeridian10aStriping10aTCP tuning10aTwo staged transfer1 aRabl, T.1 aKoch, C.1 aHölbling, G.1 aKosch, H. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-70350639599&partnerID=40&md5=5f9011b915c84a15c0c366695d8c57e201437nas a2200205 4500008004100000245006900041210006700110260000900177300001400186490000600200520079300206653001800999653001901017653001301036653002301049653001201072100001601084700001401100856011701114 2009 eng d00aDetecting phishing websites: On the effectiveness of users' tips0 aDetecting phishing websites On the effectiveness of users tips c2009 a276 - 2810 v73 aPhishing 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.10aEffectiveness10aInternet fraud10aPhishing10aPhishing detection10aRanking1 aAlnajim, A.1 aMunro, M. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-77953240881&partnerID=40&md5=1c3c56a578107f812828ab410ac41cba01731nas a2200265 4500008004100000245005600041210005500097260000900152300001400161490000600175520093100181653002501112653002201137653002301159653002201182653002101204100001801225700001701243700001801260700001301278700002201291700002001313700001501333856011701348 2009 eng d00aDistributed Web 2.0 crawling for ontology evolution0 aDistributed Web 20 crawling for ontology evolution c2009 a114 - 1190 v73 aThe 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.10aDistributed crawling10aExecuted crawling10aOntology evolution10aOntology learning10aWeb 2.0 crawling1 aJuffinger, A.1 aNeidhart, T.1 aGranitzer, M.1 aKern, R.1 aWeichselbraun, A.1 aWohlgenannt, G.1 aScharl, A. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-70350630600&partnerID=40&md5=7b88c38575eca72b620a0a6e113a8f5501642nas a2200229 4500008004100000245007300041210006900114260000900183300001000192490000600202520088000208653003001088653002001118653002901138653003301167653002201200653002101222100001801243700001401261700002001275856011701295 2009 eng d00aDual watermarking scheme for copyright protection and authentication0 aDual watermarking scheme for copyright protection and authentica c2009 a1 - 70 v73 aDigital 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.10aDigital dual watermarking10aGray-scale logo10aMultiresolution analysis10aSingular Value Decomposition10aWavelet Transform10aZig-zag sequence1 aBhatnagar, G.1 aRaman, B.1 aSwaminathan, K. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-70350656255&partnerID=40&md5=31754c14c6a8a23bba58615c2b8ff02a02545nas a2200241 4500008004100000245011500041210006900156260000900225300001400234490000600248520174100254653002501995653002702020653001402047653002402061653002102085100001702106700001902123700001402142700001402156700001602170856011702186 2009 eng d00aEnabling automatic just-in-time evaluation of in-class discussions in on-line collaborative learning practices0 aEnabling automatic justintime evaluation of inclass discussions  c2009 a289 - 2960 v73 aLearning 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.10aAutomatic evaluation10aCollaborative learning10aGroupware10aKnowledge discovery10aMachine learning1 aCaballé, S.1 aLapedriza, À.1 aMasip, D.1 aXhafa, F.1 aAbraham, A. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-77953238102&partnerID=40&md5=6dce6350dd861170e2133b9b2f59762701839nas a2200229 4500008004100000245008100041210006900122260000900191300001400200490000600214520114900220653000701369653001901376653001701395653000801412653002401420653000801444100001201452700001701464700001101481856011701492 2009 eng d00aGA and PSO-based resource scheduling for orchestrated, distributed computing0 aGA and PSObased resource scheduling for orchestrated distributed c2009 a343 - 3510 v73 aA 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.10aGA10aGrid computing10aInter-domain10aPSO10aResource scheduling10aVPN1 aGao, Y.1 aPhillips, C.1 aHe, L. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-79960659450&partnerID=40&md5=d9ea15f86f2d90b8c89711571dc6151401852nas a2200217 4500008004100000245006800041210006500109260000900174300001400183490000600197520115700203653002401360653002201384653002501406653002101431100001501452700001501467700001601482700001901498856011701517 2009 eng d00aA generic context model enhanced with self-configuring features0 ageneric context model enhanced with selfconfiguring features c2009 a159 - 1650 v73 aThis 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.10aAutonomic computing10aContext awareness10aPervasive middleware10aSelf-configuring1 aCioara, T.1 aAnghel, L.1 aSalomie, L.1 aDinsoreanu, M. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-73249115300&partnerID=40&md5=f9d617fff380ea06eb2e277b2d81a58002395nas a2200205 4500008004100000245009300041210006900134260000900203300001400212490000600226520168400232653003401916653002001950653002101970653002101991653002902012100001502041700001602056856011702072 2009 eng d00aHGOAAM: Facial analysis by active appearance model optimized by hybrid genetic algorithm0 aHGOAAM Facial analysis by active appearance model optimized by h c2009 a193 - 2010 v73 aFacial 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'08, Pointing'04 and synthetic characters comprising of different facial poses are analyzed. Simulation results validate the efficiency, accuracy and robustness achieved.10aActive appearance model (AAM)10aFacial analysis10aFacial databases10aGradient descent10aHybrid genetic algorithm1 aSattar, A.1 aSeguier, R. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-77953263109&partnerID=40&md5=6f400ca83dfd110454d823df512347c501831nas a2200205 4500008004100000245008100041210006900122260000900191300001400200490000600214520114700220653002501367653003601392653001801428653001401446100001501460700001701475700001601492856011701508 2009 eng d00aAn image copyright protection scheme using DCT and a table look-up technique0 aimage copyright protection scheme using DCT and a table lookup t c2009 a358 - 3640 v73 aIn 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'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.10aCopyright protection10aDiscrete cosine transform (DCT)10aTable look-up10aWatermark1 aLin, C.-N.1 aChang, C.-C.1 aTsai, M.-T. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-79960672480&partnerID=40&md5=d3494694cccbe120402c83a50046601c02057nas a2200205 4500008004100000245008400041210006900125260000900194300001400203490000600217520137800223653002801601653002101629653002301650653002001673100001501693700001401708700001201722856011701734 2009 eng d00aImage recognition of occluded objects based on improved curve moment invariants0 aImage recognition of occluded objects based on improved curve mo c2009 a152 - 1580 v73 aThis 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.10aCurve moment invariants10aImage recogniton10aObject recognition10aOccluded object1 aLichun, K.1 aBin, L.K.1 aJin, Y. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-73249137091&partnerID=40&md5=f19ee8c05f39dc1d26d8fca6dbc9e11101641nas a2200157 4500008004100000245007800041210006900119260000900188300001400197490000600211520108700217653002201304653002401326100001601350856011701366 2009 eng d00aImage-based technique to select visually salient pages in large documents0 aImagebased technique to select visually salient pages in large d c2009 a313 - 3170 v73 aThe 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'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.10aDigital documents10aImage data analysis1 aMatulic, F. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-77953245612&partnerID=40&md5=48492271587c1f8b79e6cc6f66f7459901755nas a2200229 4500008004100000245008000041210006900121260000900190300001400199490000600213520102400219653001901243653001601262653002301278653002201301653002301323100001401346700001401360700001901374700001501393856011701408 2009 eng d00aImplementation of a chain ontology based approach in the health care sector0 aImplementation of a chain ontology based approach in the health  c2009 a270 - 2750 v73 aPreserving 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.10aChain ontology10aHealth care10aPersonal databases10aPersonal ontology10aPrivacy management1 aOmran, E.1 aBokma, A.1 aAl-Maati, S.A.1 aNelson, D. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-77953238906&partnerID=40&md5=a47b3ef0a48f1d46ac87ecbf451089d801384nas a2200217 4500008004100000245009200041210006900133260000900202300001200211490000600223520068400229653002300913653002200936653001500958653002300973100001200996700001301008700001501021700001301036856011701049 2009 eng d00aImproving user's Web search experience by interactive re-ranking and zooming interfaces0 aImproving users Web search experience by interactive reranking a c2009 a35 - 430 v73 aThe 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.10aInteractive search10aOnline web search10aRe-ranking10aZooming interfaces1 aLiu, J.1 aChen, H.1 aFuruse, K.1 aOhbo, N. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-70350657173&partnerID=40&md5=1b8f312e46399e7ccb384b0f2b26c92a01631nas a2200253 4500008004100000245005200041210005200093260000900145300001400154490000600168520087500174653001501049653001901064653004601083100001801129700001501147700001501162700001601177700001801193700001601211700001401227700001901241856011701260 2009 eng d00aMachine learning based work task classification0 aMachine learning based work task classification c2009 a305 - 3120 v73 aIncreasing the productivity of a knowledge worker via intelligent applications requires the identification of a user'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.10aData model10aData structure10aWork task classification user interaction1 aGranitzer, M.1 aRath, A.S.1 aKröll, M.1 aSeifert, C.1 aIpsmiller, D.1 aDevaurs, D.1 aWeber, N.1 aLindstaedt, S. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-77953256434&partnerID=40&md5=ad1b8dc83a81694afe23a15ad90c66af01270nas a2200193 4500008004100000245009900041210006900140260000900209300001400218490000600232520059900238653002600837653002600863653001900889100001500908700001700923700001900940856011700959 2009 eng d00aMaximizing mobile multimedia adhoc networks lifetime using a distributed cooperation mechanism0 aMaximizing mobile multimedia adhoc networks lifetime using a dis c2009 a352 - 3570 v73 aEnergy 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.10aDistributed algorithm10aMobile ad hoc network10aNodes mobility1 aBahi, J.M.1 aEskandar, M.1 aMostefaoui, A. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-79960685343&partnerID=40&md5=e4fa9baab9e0df89a5c694d24960476e01399nas a2200217 4500008004100000245008900041210006900130260000900199300001400208490000600222520068500228653001000913653001900923653001600942653002400958653001900982653003201001100001501033700001601048856011701064 2009 eng d00aMobile lab clients for testing application specific integrated circuits in education0 aMobile lab clients for testing application specific integrated c c2009 a181 - 1840 v73 aThe 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's commands upon request.10aASICs10aMobile devices10aMobile labs10aOnline laboratories10aRemote systems10aServer-client communication1 aAuer, M.E.1 aZutin, D.G. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-73249148043&partnerID=40&md5=22ca5f36d66213765126ebee1739ec0601367nas a2200193 4500008004100000245005900041210005800100260000900158300001200167490000600179520072800185653001800913653003900931653002200970653001900992653002501011100002001036856011701056 2009 eng d00aNanotechnology development and sub-technologies effect0 aNanotechnology development and subtechnologies effect c2009 a44 - 520 v73 aThe 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.10aBiotechnology10aHigh-tech institutional capitalism10aInnovation system10aNanotechnology10aTechnological system1 aAl-Tameem, A.A. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-70350627566&partnerID=40&md5=831142db0c5083b6af6583cedbe4b28801208nas a2200193 4500008004100000245006400041210006200105260000900167300001400176490000600190520059000196653001900786653001300805653003200818100001500850700001600865700001600881856011700897 2009 eng d00aA new authentication scheme for session initiation protocol0 anew authentication scheme for session initiation protocol c2009 a133 - 1360 v73 ahe 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.10aAuthentication10aSecurity10aSession initiation protocol1 aLee, C.-C.1 aYang, C.-C.1 aHuang, S.Y. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-73249123219&partnerID=40&md5=c652e0ae0a489db32f8bdd813fcac57f01824nas a2200205 4500008004100000245008300041210006900124260000900193300001100202490000600213520113600219653002401355653001901379653002401398653002301422100001901445700001801464700001901482856011701501 2009 eng d00aThe NEWER system: How to exploit a neuro-fuzzy strategy for Web recommendation0 aNEWER system How to exploit a neurofuzzy strategy for Web recomm c2009 a8 - 140 v73 aWeb 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.10aNeuro-fuzzy systems10aSoft computing10aWeb personalization10aWeb recommendation1 aCastellano, G.1 aFanelli, A.M.1 aTorsello, M.A. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-70350623232&partnerID=40&md5=082ad7746b5c22f000652fb4261cfdc901535nas a2200205 4500008004100000245006500041210006300106260000900169300001400178490000600192520089700198653002301095653002001118653001901138653001901157100001101176700001401187700001101201856011701212 2009 eng d00aA novel graph containment query algorithm on graph databases0 anovel graph containment query algorithm on graph databases c2009 a143 - 1510 v73 aNowadays, 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.10aFrequent subgraphs10aGraph databases10aGraph indexing10aGraph querying1 aLi, X.1 aZhang, W.1 aLi, J. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-73249130115&partnerID=40&md5=c53fbe52cb4f2481146df6768914245f01185nas a2200193 4500008004100000245008700041210006900128260000900197300001400206490000600220520051700226653002200743653002500765653003000790100001700820700001700837700002000854856011700874 2009 eng d00aOptimizing Heating system management using an activity-based pervasive application0 aOptimizing Heating system management using an activitybased perv c2009 a327 - 3350 v73 aThe 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'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's motion in physical space in order to adjust temperature according to their current activities.10aContext awareness10aHeat control systems10aHeating system management1 aBruegger, P.1 aPallotta, V.1 aHirsbrunner, B. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-79960692759&partnerID=40&md5=2401f279d8595a2a81a6c410b1bb3ae401313nas a2200241 4500008004100000245011000041210006900151260000900220300001200229490000600241520052700247653002700774653000800801653002000809653001900829653002400848100001400872700002000886700001700906700001600923700001500939856011700954 2009 eng d00aA query answering surveillance system for detecting and tracking moving objects using bounding rectangles0 aquery answering surveillance system for detecting and tracking m c2009 a15 - 200 v73 aIn 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.10aBackground subtraction10aMBR10aObject tracking10aRgb difference10aSurveillance system1 aSleit, A.1 aAlmobaideen, W.1 aQatawneh, M.1 aBarakat, A.1 aSaadeh, H. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-70350676981&partnerID=40&md5=bf39ff54dd637a3f58625643a68ed65a01542nas a2200193 4500008004100000245006100041210005800102260000900160300001400169490000600183520091700189653002601106653002101132653002601153653002401179100001401203700001401217856011701231 2009 eng d00aQuery-by-multiple-examples using support vector machines0 aQuerybymultipleexamples using support vector machines c2009 a202 - 2100 v73 aWe 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.10aInformation retrieval10aMachine learning10aSupportvector machine10aText classification1 aZhang, D.1 aLee, W.S. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-77953247724&partnerID=40&md5=8fea0823a5d70e478bf228f315a5ef8901783nas a2200205 4500008004100000245009900041210006900140260000900209300001400218490000600232520109100238653002101329653002101350653001901371100001801390700001501408700001901423700001801442856011701460 2009 eng d00aThe role of interoperability in egovernment applications: An investigation of critical factors0 arole of interoperability in egovernment applications An investig c2009 a235 - 2430 v73 aThe 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.10aCritical factors10aInteroperability10aPublic service1 aTambouris, E.1 aLoutas, N.1 aPeristeras, V.1 aTarabanis, K. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-77953270343&partnerID=40&md5=c3757c55a2892aedc09fa0f7b0d1465002077nas a2200205 4500008004100000245007800041210006900119260000900188300001400197490000600211520142900217653001001646653001001656653002701666653001501693100001601708700001401724700001601738856011701754 2009 eng d00aA secondary storage scheme for multidimensional data preserving proximity0 asecondary storage scheme for multidimensional data preserving pr c2009 a227 - 2340 v73 aMultidimensional 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.10aChunk10aMOLAP10aMultidimensional array10aZ-ordering1 aShimada, T.1 aTsuji, T.1 aHiguchi, K. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-77953264906&partnerID=40&md5=267ce77ab223e1b13bb8dbb5b851b85d02059nas a2200193 4500008004100000245005400041210005400095260000900149300001400158490000600172520140600178653002201584653003801606653002001644653005301664100001901717700001201736856011701748 2009 eng d00aSigning digital documents in hostile environments0 aSigning digital documents in hostile environments c2009 a106 - 1130 v73 aDigital 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.10aDigital signature10aLegal issues in digital signature10aNon-repudiation10aSecurity and identity management in e-activities1 aBuccafurri, F.1 aLax, G. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-70350635834&partnerID=40&md5=5181ea4d5763adab38c1aa2e6e360ecb01460nas a2200217 4500008004100000245008700041210006900128260000900197300001400206490000600220520077800226653001401004653001601018653001001034653001101044653001501055100001701070700002201087700001601109856011701125 2009 eng d00aSmart electronic visitor information management system with biometric verification0 aSmart electronic visitor information management system with biom c2009 a318 - 3250 v73 aSmart 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'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.10aBiometric10aFingerprint10aMyKad10aSEVIMS10aSmart card1 aNoraziah, A.1 aNoorhuzaimi, M.N.1 aJunaida, S. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-77953251164&partnerID=40&md5=c75349813dbd8d0247a33bb80770adc001273nas a2200229 4500008004100000245007800041210006900119260000900188300001400197490000600211520053600217653002700753653001300780653002400793653002100817100002200838700001600860700001900876700001500895700001600910856011700926 2009 eng d00aStudents' review of acceptance, usability and usefulness of WebLab-Deusto0 aStudents review of acceptance usability and usefulness of WebLab c2009 a173 - 1800 v73 aThe 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.10aComputing architecture10aHardware10aRemote laboratories10aWeb laboratories1 aGarcía-Zubia, J.1 aOrduña, P.1 aHernández, U.1 aAngulo, I.1 aIrurzun, J. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-73249122403&partnerID=40&md5=ca83df5c2e11b7b56703ac6f3c0f066901764nas a2200217 4500008004100000245003400041210003300075260000900108300001200117490000600129520104800135653003101183653003701214653003401251653003101285653004201316653003901358100001501397700001701412856011701429 2009 eng d00aSVD-based image water marking0 aSVDbased image water marking c2009 a83 - 890 v73 aAdvances 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.10aDigital image watermarking10aDiscrete Wavelet Transform (DWT)10aFrequency-domain watermarking10aImage copyright protection10aNon-invertible watermarking algorithm10aSingular Value Decomposition (SVD)1 aAl-Haj, A.1 aManasrah, T. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-70350657176&partnerID=40&md5=f1e603314fd32dcb9a0c53258db0623202384nas a2200205 4500008004100000245011600041210006900157260000900226300001400235490000600249520167200255653002501927653001801952653001201970653002301982653002502005100001602030700001502046856011702061 2009 eng d00aTowards awareness of privacy and quality of context in context-based access control for ubiquitous applications0 aTowards awareness of privacy and quality of context in contextba c2009 a219 - 2260 v73 aThe 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'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'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.10aAccess control model10aContext-aware10aPrivacy10aQuality of context10aUbiquitous computing1 aFilho, J.B.1 aMartin, H. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-77953237856&partnerID=40&md5=ea8d4b294375a77ff9f0320a1f0d098a01074nas a2200181 4500008004100000245009000041210006900131260000900200300001200209490000600221520046000227653001900687653002000706653001400726100001700740700001800757856011700775 2009 eng d00aUpper and lower bounds on the pagenumber of the book embedding of the k-ary hypercube0 aUpper and lower bounds on the pagenumber of the book embedding o c2009 a30 - 340 v73 aGraph 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.10aBook embedding10aGraph embedding10aHypercube1 aBettayeb, S.1 aHoelzeman, D. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-70350635831&partnerID=40&md5=91db3d618f5fa9711898a49d98f347a101387nas a2200193 4500008004100000245007500041210006900116260000900185300001200194490000600206520070600212653002000918653004500938653002900983653001701012653002801029100001901057856011701076 2009 eng d00aVector maps compression for progressive transmission over the Internet0 aVector maps compression for progressive transmission over the In c2009 a90 - 950 v73 aA 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.10aMap server; Gis10aMulti-resolution polygonal approximation10aProgressive transmission10aQuantization10aVector maps compression1 aKolesnikov, A. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-70350649032&partnerID=40&md5=062e8eba1305927bde4445dff580973302294nas a2200205 4500008004100000245012200041210006900163260000900232300001400241490000600255520152200261653003101783653002901814653002601843653003701869100002901906700002101935700001501956856011701971 2009 eng d00aWeb architectural-inducing model (WA-IM) for information architecture in cultural context: An empirical investigation0 aWeb architecturalinducing model WAIM for information architectur c2009 a297 - 3040 v73 aWebsite 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.10aHuman computer interaction10aInformation architecture10aInformation structure10aWebsite information architecture1 aRahim, W.M.I., Wan Abdul1 aLaila, M.N., Nor1 aShafie, M. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-77953257765&partnerID=40&md5=744aea135f4ac60f3dfdcc5443c61f9001926nas a2200193 4500008004100000245003600041210003500077260000900112300001400121490000600135520133900141653002201480653001801502653002201520653002801542653002801570100001701598856011701615 2009 eng d00aWhere do the authors come from?0 aWhere do the authors come from c2009 a211 - 2180 v73 aPermanent 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.10aCo-author network10aDBLP database10aDigital libraries10aLanguage classification10aScientific publications1 aBiryukov, M. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-77953242477&partnerID=40&md5=d76b422a52e3bdf48f54dbd4ba5cd9c101843nas a2200229 4500008004100000245008600041210006900127260000900196300001400205490000600219520104900225653002201274653002201296653005501318653002101373653002901394100002101423700001901444700001901463700001401482856011701496 2008 eng d00aAccessing heritage documents according to space criteria within digital libraries0 aAccessing heritage documents according to space criteria within  c2008 a102 - 1170 v63 aLocal 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's query. This paper focuses on IR and Visualization proposals relying on the geospatial characteristics of cultural heritage corpora.10aCultural heritage10aDigital libraries10aGeographic information retrieval and visualization10aGeographic model10aNon-structured documents1 aMarquesuzaà, C.1 aEtcheverry, P.1 aSallaberry, C.1 aBaziz, M. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-56849092298&partnerID=40&md5=199c3f9b17bf1a325e0c3fcc90160b1701282nas a2200193 4500008004100000245004900041210004600090260000900136300001400145490000600159520068000165653001900845653001800864653001300882653004100895100001900936700001600955856011700971 2008 eng d00aAn actor like data model for a parallel DBMS0 aactor like data model for a parallel DBMS c2008 a262 - 2710 v63 aWe 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.10aActor paradigm10aParallel DBMS10aRecovery10aScalable distributed data structures1 aHidouchi, W.K.1 aEzegour, D. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-70449395027&partnerID=40&md5=62e63e876a6d33c10455c63bda2b977e01441nas a2200157 4500008004100000245008800041210006900129260000900198300001400207490000600221520086400227653002601091653002901117100002001146856011701166 2008 eng d00aAnalysis of the association between bioinformatics and biotechnological development0 aAnalysis of the association between bioinformatics and biotechno c2008 a128 - 1350 v63 aGenerally, 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.10aBioinformatics growth10aComputational techniques1 aAl-Tameem, A.A. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-56849106044&partnerID=40&md5=8de93884e0b90b4cb04af4dbef44126b01609nas a2200217 4500008004100000245007600041210006900117260000900186300001200195490000600207520089300213653001501106653001301121653003501134653003201169653001301201100001501214700002701229700001801256856011701274 2008 eng d00aAnT&CoW: Share, classify and elaborate documents by means of annotation0 aAnTCoW Share classify and elaborate documents by means of annota c2008 a61 - 700 v63 aAs 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.10aAnnotation10aDocument10aMulti-viewpoint classification10aNatural Language Processing10aThesauri1 aLortal, G.1 aTodirascu-Courtier, A.1 aLewkowicz, M. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-56849132057&partnerID=40&md5=8195cee5570fdfc7541bbf7254f465cb01856nas a2200205 4500008004100000245009000041210006900131260000900200300001200209490000600221520117600227653001601403653001801419653001301437653001901450653003401469100001401503700001601517856011701533 2008 eng d00aApplication schema mapping based on ontology: An approach for geospatial data storage0 aApplication schema mapping based on ontology An approach for geo c2008 a51 - 600 v63 aThe 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.10aGML storage10aOGC Standards10aOntology10aSchema Mapping10aSpatial Data Interoperability1 aManoj, P.1 aGhosh, S.K. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-56849122330&partnerID=40&md5=d3859ad1904574ca7d3094b2262d495201871nas a2200217 4500008004100000245009200041210006900133260000900202300001100211490000600222520115200228653002301380653001501403653001501418653003001433653002501463100001901488700001401507700001501521856011701536 2008 eng d00aAutomating the management of scientific conferences using information mining techniques0 aAutomating the management of scientific conferences using inform c2008 a3 - 110 v63 aConference 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.10aAssignment problem10aAutomation10aClustering10aInformation visualization10aSelf-organizing maps1 aPesenhofer, A.1 aMayer, R.1 aRauber, A. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-56849090253&partnerID=40&md5=bcbf62b3dabc739191df5c6d0fcdad5002082nas a2200181 4500008004100000245006200041210006200103260000900165300001400174490000600188520148600194653003501680653002301715100001801738700001301756700001401769856011701783 2008 eng d00aBehavioral similarities for collaborative recommendations0 aBehavioral similarities for collaborative recommendations c2008 a442 - 4480 v63 aRecommender 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.10aCollaborative filtering system10aRecommender system1 aEsslimani, I.1 aBrun, A.1 aBoyer, A. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-77955227289&partnerID=40&md5=c1516b14dc70e7dac89d3e8bef4af7a101978nas a2200145 4500008004100000245007600041210006900117260000900186300001400195490000600209520145900215100002101674700002001695856011701715 2008 eng d00aCitation auctions as a method to improve selection of scientific papers0 aCitation auctions as a method to improve selection of scientific c2008 a414 - 4200 v63 aThis 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'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.1 aDe La Rosa, J.L.1 aSzymanski, B.K. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84865494320&partnerID=40&md5=ebc2cdcc8ee9804c72cf125c9ee6c61901638nas a2200193 4500008004100000245007700041210006900118260000900187300001200196490000600208520097800214653002201192653003301214653002701247100002101274700001601295700001601311856011701327 2008 eng d00aClassification of digital libraries - An e-business model-based approach0 aClassification of digital libraries An ebusiness modelbased appr c2008 a71 - 800 v63 aThe 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.10aDigital libraries10aDigital libraries evaluation10aInformation processing1 aMarkscheffel, B.1 aFischer, D.1 aStelzer, D. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-56849121020&partnerID=40&md5=5183b0da70e4e961e3e8e1e49f3af70301640nas a2200229 4500008004100000245014300041210006900184260000900253300001400262490000600276520085400282653001501136653002701151653002001178653002401198653000801222653001401230653001601244100001601260700001701276856011701293 2008 eng d00aClassification of geographic web services for building an efficient geographic information system offering profitable value added services0 aClassification of geographic web services for building an effici c2008 a396 - 4040 v63 aIn 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.10aCase study10aCommercial web service10aGeo web service10aGeographic services10aGIS10aHydrology10aWeb service1 aKleiner, C.1 aAliste, A.G. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84865525965&partnerID=40&md5=11ac40933f4282aacc48cbc4550b85c401698nas a2200205 4500008004100000245007500041210006900116260000900185300001200194490000600206520105500212653001001267653002201277653001801299653001801317100001301335700001401348700001301362856011701375 2008 eng d00aCluster based mixed coding schemes for inverted file index compression0 aCluster based mixed coding schemes for inverted file index compr c2008 a30 - 370 v63 aThe cluster property of document collections in today'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.10ad-gap10aIndex compression10aInverted file10aInverted list1 aChen, J.1 aZhong, P.1 aCook, T. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-56849117299&partnerID=40&md5=e6f756f0e7e96db7d5c31eadd73799d601535nas a2200217 4500008004100000245007300041210006900114260000900183300001400192490000600206520086600212653002101078653001801099653001001117653002101127653000801148100001701156700001401173700001301187856011701200 2008 eng d00aCommius - An email based interoperability solution tailored for SMEs0 aCommius An email based interoperability solution tailored for SM c2008 a430 - 4330 v63 aMore 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.10aBusiness process10aCollaboration10aEmail10aInteroperability10aSME1 aBurkhart, T.1 aWerth, D.1 aLoos, P. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-70449333910&partnerID=40&md5=5e75b584683eae1a1025309705abc10f01232nas a2200217 4500008004100000245007200041210006900113260000900182300001200191490000600203520054500209653002400754653002100778653001900799653001400818653001200832100001400844700001500858700002400873856011700897 2008 eng d00aComplex query processing on Web graph: A social network perspective0 aComplex query processing on Web graph A social network perspecti c2008 a12 - 200 v63 aA 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.10aOperator Evaluation10aQuery processing10aSocial Network10aWeb Graph10aXB-tree1 aMitra, S.1 aBagchi, A.1 aBandyopadhyay, A.K. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-56849104350&partnerID=40&md5=3a2ecc369cf5c3b535859eeb8d73c2e001717nas a2200205 4500008004100000245006000041210005800101260000900159300001400168490000600182520108900188653003101277653002401308653001601332653000801348100001301356700001301369700001201382856011701394 2008 eng d00aCo-training for search-based automatic image annotation0 aCotraining for searchbased automatic image annotation c2008 a214 - 2180 v63 aSearch-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.10aAutomatic image annotation10aBayesian classifier10aCo-training10aSVM1 aZhao, Y.1 aZhao, Y.1 aZhu, Z. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-72449186106&partnerID=40&md5=73219b4c7b5383b4a06f69f6ba3903d101387nas a2200193 4500008004100000245010200041210006900143260000900212300001400221490000600235520069300241653004100934653002900975653002801004100001401032700001501046700001501061856011701076 2008 eng d00aDiscriminant parallel feature fusion based on maximum margin criterion for pattern classification0 aDiscriminant parallel feature fusion based on maximum margin cri c2008 a203 - 2070 v63 aIn 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.10aDiscriminant parallel feature fusion10aMaximum margin criterion10aParallel feature fusion1 aLi, J.-B.1 aChu, S.-C.1 aPan, J.-S. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-72449120326&partnerID=40&md5=45d5e7fee23074133279fb977574a55102300nas a2200229 4500008004100000245007400041210006900115260000900184300001200193490000600205520159200211653001701803653000801820653003801828653001401866653001001880653000801890100001801898700001501916700002201931856011701953 2008 eng d00aEfficient power aware and reputation-based routing protocol for MANET0 aEfficient power aware and reputationbased routing protocol for M c2008 a21 - 290 v63 aEnergy 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.10aBattery cost10aDSR10aEnergy efficient routing protocol10aMAC layer10aMANET10aNIC1 aGomathi, S.S.1 aChbeir, R.1 aKrishnamurthi, S. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-56849115358&partnerID=40&md5=3571c3639e44fc54a89c22a1452df37701610nas a2200205 4500008004100000245007500041210006900116260000900185300001400194490000600208520092900214653002601143653001001169653003501179653001301214653002801227100001601255700001601271856011701287 2008 eng d00aA forum-based organizational memory as organizational learning support0 aforumbased organizational memory as organizational learning supp c2008 a303 - 3060 v63 aInformation 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.10aCommunity of practice10aForum10aLearning organizational memory10aOntology10aOrganizational learning1 aLeblanc, A.1 aAbel, M.-H. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-70349980893&partnerID=40&md5=91b22b845ffabe4a466a7a6fb88cce8901693nas a2200217 4500008004100000245007700041210006900118260000900187300001400196490000600210520096000216653002301176653003601199653002001235653003401255100001401289700001601303700001901319700002001338856011701358 2008 eng d00aA framework for web content management system operations and maintenance0 aframework for web content management system operations and maint c2008 a342 - 3470 v63 aOrganizations 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.10aContent management10aInformation systems maintenance10aWeb application10aWeb content management system1 aSouer, J.1 aHonders, P.1 aVersendaal, J.1 aBrinkkemper, S. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-70350000617&partnerID=40&md5=06dc0f7329e75809c5441e53f7b3942701637nas a2200229 4500008004100000245010300041210006900144260000900213300001400222490000600236520090600242653002101148653001801169653001001187653002101197653000801218100001201226700001601238700001801254700001801272856011701290 2008 eng d00aA generic framework for visualizing the news article domain and its application to real-world data0 ageneric framework for visualizing the news article domain and it c2008 a434 - 4410 v63 aIn 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.10aBusiness process10aCollaboration10aEmail10aInteroperability10aSME1 aLex, E.1 aSeifert, C.1 aKienreich, W.1 aGranitzer, M. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-77950335223&partnerID=40&md5=e07a8280eb1e93146ec05ab62b545f5a02444nas a2200217 4500008004100000245007500041210006900116260000900185300001400194490000600208520172600214653002901940653002801969653002201997653002702019653001602046100001602062700001502078700001602093856011702109 2008 eng d00aHybrid clustering approach for term partitioning in document data sets0 aHybrid clustering approach for term partitioning in document dat c2008 a272 - 2770 v63 aInformation 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.10aDimensionality reduction10aHierarchical clustering10aK means algorithm10aPartitional clustering10aText mining1 aReddy, K.T.1 aShashi, M.1 aReddy, L.P. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-70350735762&partnerID=40&md5=911fe260f9a7d869bf7ee8660851cdac01977nas a2200205 4500008004100000245008700041210006900128260000900197300001400206490000600220520129300226653002401519653002901543653002101572653002401593100001201617700001301629700001201642856011701654 2008 eng d00aAn improved biometric template protection method based on non-uniform quantization0 aimproved biometric template protection method based on nonunifor c2008 a169 - 1740 v63 aIn 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' 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.10aBiometrics template10aNon-uniform quantization10aPrivacy security10aQuantizing template1 aHan, Q.1 aWang, Z.1 aNiu, X. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-67449162388&partnerID=40&md5=2c7c418154a7c1360f7d9e69ff41882400357nas a2200121 4500008004100000245001800041210001800059260000900077300000800086490000600094100001800100856011700118 2008 eng d00aIn this issue0 aIn this issue c2008 a4290 v61 aPichappan, P. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84865485798&partnerID=40&md5=870e1831d3dff4f4d1cdbe08687846b500464nas a2200133 4500008004100000245005600041210005600097260000900153300001400162490000600176100001500182700001600197856011700213 2008 eng d00aInformation hiding and multimedia signal processing0 aInformation hiding and multimedia signal processing c2008 a140 - 1420 v61 aPan, J.-S.1 aAbraham, A. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-72449205976&partnerID=40&md5=cf60ca8c2c2cff6aee125963a9d4800c01399nas a2200229 4500008004100000245005200041210005200093260000900145300001400154490000600168520072000174653002300894653003000917653000900947653002100956653000800977100001700985700001501002700001701017700001801034856011701052 2008 eng d00aInformation hiding on lossless data compression0 aInformation hiding on lossless data compression c2008 a151 - 1560 v63 aWe 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.10aInformation hiding10aLossless data compression10aLZSS10aTamper detection10aZIP1 aYoshioka, K.1 aSonoda, K.1 aTakizawa, O.1 aMatsumoto, T. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-72449125165&partnerID=40&md5=eca05f3963e0a10ea67d3f0d70e77c7600442nas a2200121 4500008004100000245006100041210006000102260000900162300000800171490000600179100001800185856011700203 2008 eng d00aJournal of Digital Information Management: In this issue0 aJournal of Digital Information Management In this issue c2008 a2350 v61 aPichappan, P. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-70350725976&partnerID=40&md5=2ab88ac93de55c834aae9f68ac1d2af101560nas a2200157 4500008004100000245007400041210006900115260000900184300001400193490000600207520099200213653003301205653002801238100001901266856011701285 2008 eng d00aLearning transfer rules for machine translation from parallel corpora0 aLearning transfer rules for machine translation from parallel co c2008 a285 - 2930 v63 aIn 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'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.10aJapanese-English translation10aLanguage transfer rules1 aWiniwarter, W. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-70349984013&partnerID=40&md5=b27c9c795bbe154aace0b228c131a68e01776nas a2200229 4500008004100000245007500041210006900116260000900185300001400194490000600208520101000214653001701224653002201241653003401263653002401297653002901321653002801350100001801378700001701396700001601413856011701429 2008 eng d00aMap integrity constraint verification by using visual language parsing0 aMap integrity constraint verification by using visual language p c2008 a332 - 3410 v63 aIn 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.10aData Quality10aGrammar Formalism10aIntegrity Constraint Checking10aSpatial Consistency10aTopologicalrelationships10aVisual Language Parsing1 aDel Fatto, V.1 aDeufemia, V.1 aPaolino, L. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-70349979001&partnerID=40&md5=74efb0fc7499a7151d63110ec06db5d601775nas a2200229 4500008004100000245007500041210006900116260000900185300001400194490000600208520101000214653001701224653002201241653003401263653002401297653003001321653002801351100001601379700001701395700001601412856011701428 2008 eng d00aMap integrity constraint verification by using visual language parsing0 aMap integrity constraint verification by using visual language p c2008 a386 - 3950 v63 aIn 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.10aData Quality10aGrammar Formalism10aIntegrity Constraint Checking10aSpatial Consistency10aTopological Relationships10aVisual Language Parsing1 aFatto, V.D.1 aDeufemia, V.1 aPaolino, L. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84865514855&partnerID=40&md5=c3f7b43fbb1550bfd3198eec27ecb80101788nas a2200181 4500008004100000245007800041210006900119260000900188300001400197490000600211520118900217653001901406653002001425100001401445700001501459700001501474856011701489 2008 eng d00aMap-based interfaces for information management in large text collections0 aMapbased interfaces for information management in large text col c2008 a294 - 3020 v63 aThe 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'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'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.10aMap interfaces10aText collection1 aMayer, R.1 aRoiger, A.1 aRauber, A. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-70349977818&partnerID=40&md5=0a5cd581dabcf26526b1e0ca5ed375bb01847nas a2200169 4500008004100000245007000041210006800111260000900179300001200188490000600200520126000206653003401466653002901500100001701529700001401546856011701560 2008 eng d00aModel-driven development of content-based image retrieval systems0 aModeldriven development of contentbased image retrieval systems c2008 a81 - 910 v63 aGeneric 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.10aContent-based image retrieval10aModel-driven development1 aIgnatova, T.1 aHeuer, A. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-56849098357&partnerID=40&md5=3b61ca364dee9f708c17826e51dca87a01430nas a2200193 4500008004100000245008200041210006900123260000900192300001400201490000600215520077400221653001700995653001701012653003201029653003101061100001201092700001501104856011701119 2008 eng d00aMultiple description coding of an audio stream by optimum recovery transforms0 aMultiple description coding of an audio stream by optimum recove c2008 a189 - 1950 v63 aIn 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.10aAudio coding10aAudio signal10aMultiple description coding10aOptimum recovery transform1 aIto, A.1 aMakino, S. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-72449178373&partnerID=40&md5=fa0b212006f85c8502fb726c829bd02f01371nas a2200181 4500008004100000245006300041210005900104260000900163300001400172490000600186520076800192653002000960653002700980653002101007100002001028700002401048856011701072 2008 eng d00aThe OntoNL semantic relatedness measure for OWL ontologies0 aOntoNL semantic relatedness measure for OWL ontologies c2008 a366 - 3740 v63 aAn 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.10aDomain ontology10aKnowledge Repositories10aOntoNL Framework1 aKaranastasi, A.1 aChristodoulakis, S. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84865464416&partnerID=40&md5=b36024693390715e4aab217ee0f62b1201530nas a2200205 4500008004100000245006400041210006100105260000900166300001400175490000600189520088400195653001901079653001001098653001701108653003301125100001601158700001601174700001701190856011701207 2008 eng d00aOptimal two-pass frame-layer bit allocation for H.264 Video0 aOptimal twopass framelayer bit allocation for H264 Video c2008 a174 - 1790 v63 aIn 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.10aBit allocation10aH.26410aRate control10aRate-distortion optimization1 aKwon, D.-K.1 aShen, M.-Y.1 aKuo, C.-C.J. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-72449209699&partnerID=40&md5=c41f97ca2d0ee3770b908360518c355601900nas a2200229 4500008004100000245011200041210006900153260000900222300001400231490000600245520109000251653001701341653002201358653003401380653002401414653003001438653002801468100002301496700001801519700001601537856011701553 2008 eng d00aPersonalized document ranking: Exploiting evidence from multiple user interests for profiling and retrieval0 aPersonalized document ranking Exploiting evidence from multiple  c2008 a354 - 3650 v63 aThe 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'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's topics of interest. Experimental results using enhanced TREC collections indicate that our personalized retrieval model is effective.10aData Quality10aGrammar Formalism10aIntegrity Constraint Checking10aSpatial Consistency10aTopological Relationships10aVisual Language Parsing1 aTamine-Lechani, L.1 aBoughanem, M.1 aZemirli, N. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-70349921290&partnerID=40&md5=8adac2115f775267c564b7fcb8a379f101359nas a2200205 4500008004100000245005300041210005300094260000900147300001400156490000600170520073400176653001400910653002600924653001700950653002100967100001700988700001301005700001801018856011701036 2008 eng d00aQuery planning in the PORDaS P2P database system0 aQuery planning in the PORDaS P2P database system c2008 a307 - 3140 v63 aComputational 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.10aData grid10aDistributed databases10aPeer-to-peer10aQuery processing1 aNørvåg, K.1 aEide, E.1 aStandal, O.H. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-70349991902&partnerID=40&md5=ac29e0f628f2878d089fa8c43f3eb0de01882nas a2200205 4500008004100000245010400041210006900145260000900214300001400223490000600237520116000243653002401403653003401427653003101461653001401492653001701506100001901523700001701542856011701559 2008 eng d00aRate control scheme based on cauchy R-D optimization model for H.264/AVC under low delay constraint0 aRate control scheme based on cauchy RD optimization model for H2 c2008 a180 - 1880 v63 aThe 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.10aCauchy distribution10aLagrange multiplier technique10aLinear regression analysis10aLow delay10aRate control1 aEiamjumrus, N.1 aAramvith, S. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-72449205119&partnerID=40&md5=60340eb5bbe6774b89e2d6c72f1c718102056nas a2200229 4500008004100000245006800041210006600109260000900175300001400184490000600198520133500204653002001539653002201559653001801581653002701599653002101626100001501647700001801662700001501680700001401695856011701709 2008 eng d00aA recommendation model based on site semantics and usage mining0 arecommendation model based on site semantics and usage mining c2008 a244 - 2550 v63 aThe 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' 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' 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' navigational patterns and the site'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' navigational behavior and that our recommendation model, which uses the identified user preferences and goals yields significant improvements in the sites' usability.10aRecommendations10aSubject hierarchy10aUser profiles10aWeb site customization10aWeb usage mining1 aStamou, S.1 aKozanidis, L.1 aTzekou, P.1 aZotos, N. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-70350741026&partnerID=40&md5=9afb2fa2b33a9de355f329041b57251801928nas a2200205 4500008004100000245008000041210006900121260000900190300001200199490000600211520125600217653002201473653002201495653002201517100001401539700001701553700001701570700001801587856011701605 2008 eng d00aRestricted continuous KNN queries on road networks with caching enhancement0 aRestricted continuous KNN queries on road networks with caching  c2008 a38 - 500 v63 aUsing 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.10aNavigation system10aNetwork databases10aSpatial databases1 aSafar, M.1 aEbrahimi, D.1 aJane, M.M.F.1 aNadarajan, R. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-56849106703&partnerID=40&md5=cc8d24f89ed2e864614cd064ddf33afc01357nas a2200205 4500008004100000245004700041210004700088260000900135300001400144490000600158520074200164653001600906653001600922653003000938653001800968100001700986700001501003700001601018856011701034 2008 eng d00aReversible data embedding for color images0 aReversible data embedding for color images c2008 a143 - 1500 v63 aThe 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.10aColor image10aData hiding10aReversible data embedding10aSteganography1 aChang, C.-C.1 aKieu, T.D.1 aChou, Y.-C. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-72449195742&partnerID=40&md5=1b853cfe31f8ca5c0628ba531a66fd9201786nas a2200229 4500008004100000245013000041210006900171260000900240300001400249490000600263520101700269653002201286653000801308653001801316653002301334100001601357700001601373700001601389700001701405700001701422856011701439 2008 eng d00aRobust video watermarking based on dual-plane correlation for immunity to rotation, scale, translation, and random distortion0 aRobust video watermarking based on dualplane correlation for imm c2008 a161 - 1670 v63 aA 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'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.10aRandom distortion10aRST10aSurvivability10aVideo watermarking1 aAtomori, Y.1 aEchizen, I.1 aDainaka, M.1 aNakayama, S.1 aYoshiura, H. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-67949090393&partnerID=40&md5=66e6b7ff3c851392463bf9ef0b6f2ae301404nas a2200193 4500008004100000245009900041210006900140260000900209300001400218490000600232520073900238653002300977653002401000653002101024100001401045700001801059700001601077856011701093 2008 eng d00aRoute navigation method for disabled access GIS in consideration of abilities and psychologies0 aRoute navigation method for disabled access GIS in consideration c2008 a348 - 3520 v63 aThis paper aims to propose a route navigation method for disabled access GIS. We focused the disabled'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.10aDijkstra algorithm10aDisabled GIS access10aRoute navigation1 aIzumi, S.1 aKobayashi, G.1 aYoshida, T. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-70349999422&partnerID=40&md5=4e6caeba1ef58b3c7c8a134d5f996e5701864nas a2200205 4500008004100000245003000041210002900071260000900100300001400109490000600123520125400129653003201383653002701415653002101442653002701463653001401490653002401504100001301528856011701541 2008 eng d00aService-oriented workflow0 aServiceoriented workflow c2008 a118 - 1270 v63 aThe 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.10aDesign tools and techniques10aIntegrated environment10aInteroperability10aSoftware architectures10aStandards10aWorkflow management1 aBadr, Y. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-56849115934&partnerID=40&md5=00c78de5d2932b1fff3748d5f163697401080nas a2200193 4500008004100000245005700041210005500098260000900153300001400162490000600176520047100182653001600653653002400669653002000693100002000713700001800733700001800751856011700769 2008 eng d00aA smart card based remote user authentication scheme0 asmart card based remote user authentication scheme c2008 a256 - 2610 v63 aPassword 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.10aSmart cards10aUser authentication10aUser passowords1 aMisbahuddin, M.1 aPremchand, P.1 aGovardhan, A. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-70350745322&partnerID=40&md5=472b89ddad64850ae41b20e57c01c3b901601nas a2200229 4500008004100000245007700041210006900118260000900187300001400196490000600210520088200216653001801098653001701116653002101133653002001154653001701174100001601191700001601207700001501223700001601238856011701254 2008 eng d00aSmoke detection for early fire-alarming system based on video processing0 aSmoke detection for early firealarming system based on video pro c2008 a196 - 2020 v63 aThe 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.10aFire-alarming10aFuzzy scheme10aImage processing10aSmoke detection10aSmoke pixels1 aWang, D.-J.1 aChen, T.-H.1 aYin, Y.-H.1 aChen, T.-Y. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-72449134788&partnerID=40&md5=1d71de0f8f9dde2103aa7102bd316fc300453nas a2200133 4500008004100000245005200041210005200093260000900145300001400154490000600168100001300174700001500187856011700202 2008 eng d00aSpecial issue on digital information management0 aSpecial issue on digital information management c2008 a281 - 2840 v61 aBadr, Y.1 aChbeir, R. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-70349983276&partnerID=40&md5=3307d00e9cbb24d7342a1b1218e9ac2000482nas a2200145 4500008004100000245005200041210005200093260000900145300001000154490000600164100001500170700001800185700001600203856011700219 2008 eng d00aSpecial issue on digital information management0 aSpecial issue on digital information management c2008 a1 - 20 v61 aChbeir, R.1 aPichappan, P.1 aAbraham, A. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-56849108171&partnerID=40&md5=967301b4d0cf740733a20c27b70edde401893nas a2200205 4500008004100000245009800041210006900139260000900208300001400217490000600231520120000237653002301437653002901460653002201489100001601511700001401527700001401541700001501555856011701570 2008 eng d00aStandardized multimedia retrieval based on web service technologies and the MPEG query format0 aStandardized multimedia retrieval based on web service technolog c2008 a315 - 3310 v63 aIn 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.10aAudio visual media10aISO multimedia standards10aMPEG query format1 aD'Oller, M.1 aBauer, K.1 aKosch, H.1 aGruhne, M. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-67650583071&partnerID=40&md5=ad0ab700b7cdca43c561426ac442090a01658nas a2200205 4500008004100000245006300041210006200104260000900166300001200175490000600187520102000193653002101213653001501234653002001249100002001269700001501289700001401304700001701318856011701335 2008 eng d00aTopic maps management in spatial-temporal multimedia blogs0 aTopic maps management in spatialtemporal multimedia blogs c2008 a92 - 990 v63 aWeb-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.10aMultimedia blogs10aTopic maps10aWeb based blogs1 aRajbhandari, S.1 aAndres, F.1 aNaito, M.1 aWuwongse, V. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-56849111393&partnerID=40&md5=8bf91066001e7e131a7ed018919772f301509nas a2200205 4500008004100000245008800041210006900129260000900198300001400207490000600221520082800227653002101055653002701076653001501103653001701118100001701135700001901152700001501171856011701186 2008 eng d00aTowards an on- Line semantic information retrieval system based on Fuzzy Ontologies0 aTowards an on Line semantic information retrieval system based o c2008 a375 - 3850 v63 aThe 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.10aFuzzy ontologies10aIn formation retrieval10aOntologies10aSemantic web1 aBaazaoui, H.1 aAufaure, M.-A.1 aSoussi, R. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-79952825348&partnerID=40&md5=8f3f224f39ca945c15dffeedf6099fad01793nas a2200241 4500008004100000245005200041210004900093260000900142300001400151490000600165520109600171653000901267653002401276653001801300653001901318653000801337653002501345100001401370700001601384700001701400700001701417856011701434 2008 eng d00aA trust-based virtual collaborative environment0 atrustbased virtual collaborative environment c2008 a405 - 4130 v63 aThe 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' 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.10aABAC10aIdentity federation10aISO/IEC 2700010aMaturity level10aPMI10aVirtual Organisation1 aKamel, M.1 aLaborde, R.1 aBarrère, F.1 aBenzekri, A. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-70449694381&partnerID=40&md5=b483d2e5359ab72eb596dab3a424963f01385nas a2200181 4500008004100000245005900041210005800100260000900158300001400167490000600181520081700187653001101004653002701015653001701042100001301059700001401072856011701086 2008 eng d00aWeb information extraction using web-specific features0 aWeb information extraction using webspecific features c2008 a235 - 2430 v63 aSeveral 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.10aHidden10aInformation extraction10aMarkov model1 aChen, J.1 aZhong, P. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-70350728184&partnerID=40&md5=f0b7ac3e808f4c890768399e96e15bca01121nas a2200181 4500008004100000245003000041210003000071260000900101300001400110490000600124520061100130653002400741653000900765653001700774100001700791700001400808856011700822 2007 eng d00aAdaptive turbo coded OFDM0 aAdaptive turbo coded OFDM c2007 a364 - 3670 v53 aIn 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.10aAdaptive modulation10aOFDM10aTurbo coding1 aHaider, S.A.1 aNoori, K. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-49149125188&partnerID=40&md5=a098b6218fe0034c544bfe24d2b8e4aa01462nas a2200181 4500008004100000245010000041210006900141260000900210300001400219490000600233520081400239653001801053653001101071653003601082653002501118100002001143856011701163 2007 eng d00aAn algorithm for generating the design matrix for multivariate polynomial least squares fitting0 aalgorithm for generating the design matrix for multivariate poly c2007 a225 - 2300 v53 aThis 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.10aCurve fitting10aMATLAB10aMultivariate polynomial fitting10aNumerical algorithms1 aAl-Hamdan, S.F. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-44949259846&partnerID=40&md5=70df949826a1c381c4c629a148ad7e1e01735nas a2200205 4500008004100000245007900041210006900120260000900189300001200198490000600210520104200216653002201258653001901280653002301299653003301322100001701355700002001372700002001392856011701412 2007 eng d00aAnalysis of the data quality of audio descriptions of environmental sounds0 aAnalysis of the data quality of audio descriptions of environmen c2007 a48 - 540 v53 aIn 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.10aAudio descriptors10aAudio features10aMPEG-7 descriptors10aMultimedia content retrieval1 aMitrovic, D.1 aZeppelzauer, M.1 aEidenberger, H. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-44849119790&partnerID=40&md5=8ed62cb5e71bdeccf00462d93d30e2db02124nas a2200217 4500008004100000245006700041210006600108260000900174300001400183490000600197520142800203653002201631653002201653653001601675653003401691100001401725700001401739700002001753700001601773856011701789 2007 eng d00aAnomaly detection through quasi-functional dependency analysis0 aAnomaly detection through quasifunctional dependency analysis c2007 a191 - 2000 v53 aAnomaly 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.10aAnomaly detection10aAssociation rules10aData mining10aQausi-functional dependencies1 aBruno, G.1 aGarza, P.1 aQuintarelli, E.1 aRossato, R. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-44949112157&partnerID=40&md5=cdbe91548ea650327ae0cdf87c4cf97f01260nas a2200217 4500008004100000245004700041210004700088260000900135300001400144490000600158520059100164653002700755653002100782653002300803653002600826100001700852700001900869700001800888700001900906856011700925 2007 eng d00aBiological model for information retrieval0 aBiological model for information retrieval c2007 a123 - 1290 v53 aHeuristic 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's a new way of thinking of, and dealing with, the problem of information retrieval.10aBiological environment10aBiological model10aGenetic algorithms10aInformation retrieval1 aGirgis, M.R.1 aAly, A.E.-M.A.1 aLatef, B.A.A.1 aEl-Gamil, B.R. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-70350691855&partnerID=40&md5=22f8442d6b340f89f18dd39e3c99ed9902206nas a2200229 4500008004100000245003900041210003900080260000900119300001400128490000600142520154200148653002501690653002701715653001701742653003301759653002001792100001201812700001101824700001201835700001201847856011701859 2007 eng d00aClustering frequent graph patterns0 aClustering frequent graph patterns c2007 a335 - 3460 v53 aIn 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.10aClosed graph pattern10aFrequent graph pattern10aGraph mining10aRepresentative graph pattern10aδ-jump pattern1 aLiu, Y.1 aLi, J.1 aZhu, J.1 aGao, H. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-49149118250&partnerID=40&md5=cae15cbd3bb5b1a9e3f57a95dbe295b501708nas a2200193 4500008004100000245009300041210006900134260000900203300001400212490000600226520105000232653002601282653001801308653001901326100001401345700001501359700002301374856011701397 2007 eng d00aA comparative study on key phrase extraction methods in automatic Web Site Summarization0 acomparative study on key phrase extraction methods in automatic  c2007 a323 - 3320 v53 aWeb 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.10aKey phrase extraction10aWeb retrieval10aWeb site study1 aZhang, Y.1 aMilios, E.1 aZincir-Heywood, N. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-70350686085&partnerID=40&md5=1e62cb16df24be6167a1dbde14d4281c01838nas a2200193 4500008004100000245007200041210006900113260000900182300001200191490000600203520121900209653002601428653002301454653000801477100001201485700001501497700001501512856011701527 2007 eng d00aContextualizing multimedia semantics towards personalised eLearning0 aContextualizing multimedia semantics towards personalised eLearn c2007 a62 - 670 v53 aRecent 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.10aMultimedia technology10aWeb based learning10aWWW1 aEze, E.1 aIshaya, T.1 aWood, D.M. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-44849139810&partnerID=40&md5=bef7d9f2dbe792bb21840530e2dbb14d01247nas a2200181 4500008004100000245006900041210006800110260000900178300001200187490000600199520062700205653001900832653001500851653004300866653002300909100001600932856011700948 2007 eng d00aDigitized information management: The dynamic information system0 aDigitized information management The dynamic information system c2007 a25 - 310 v53 aThis 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.10aChange process10aDigitizing10aInterorganizational information system10aUser participation1 aHalonen, R. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-33947319335&partnerID=40&md5=67ed12cc8841e6bf7302e93b3265de4a01876nas a2200253 4500008004100000245006500041210006500106260000900171300001200180490000600192520109500198653002001293653001801313653001101331653003301342653001301375653003601388100001701424700001401441700001801455700001701473700001501490856011701505 2007 eng d00aDomain knowledge based queries for multimedia data retrieval0 aDomain knowledge based queries for multimedia data retrieval c2007 a75 - 810 v53 aThis 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.10aLogic languages10aMapping rules10aMEPG-710aMultimedia data descriptions10aOntology10aSemantic and structural aspects1 aHammiche, S.1 aLopez, B.1 aBenbernou, S.1 aHacid, M.-S.1 aVakali, A. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-44849105152&partnerID=40&md5=6bf0f55f03c657a4b5b8e32948cc69de00527nas a2200145 4500008004100000245008400041210006900125260000900194300001200203490000600215100001600221700001300237700001400250856011700264 2007 eng d00aEditorial: Special issue on computational intelligence in information retrieval0 aEditorial Special issue on computational intelligence in informa c2007 a97 - 980 v51 aAbraham, A.1 aChen, Y.1 aXhafa, F. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-70350664206&partnerID=40&md5=881162d6fe901d46e633d998f654ed1b01482nas a2200229 4500008004100000245010100041210006900142260000900211300001200220490000600232520074600238653001300984653002000997653001501017653002101032653001801053653002101071653000801092100001501100700002001115856011701135 2007 eng d00aAn efficient path query processing support for parent-child relationship in native XML databases0 aefficient path query processing support for parentchild relation c2007 a82 - 870 v53 aDue 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.10aMatching10aPath expression10aPath query10aQuery evaluation10aQuery pattern10aQuery processing10aXML1 aHaw, S.-C.1 aRao, G.S.V.R.K. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-36048941577&partnerID=40&md5=7e045de46c15618285abdf54053caa5f02174nas a2200205 4500008004100000245005800041210005800099260000900157300001200166490000600178520153100184653001301715653002401728653003101752653002501783100001501808700001301823700001501836856011701851 2007 eng d00aEmergent semantics in personalized multimedia content0 aEmergent semantics in personalized multimedia content c2007 a55 - 600 v53 aAuthoring 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's or user group'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.10aMetadata10aMultimedia elements10aMultimedia personalization10aMultimedia semantics1 aScherp, A.1 aBoll, S.1 aCremer, H. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-37849008165&partnerID=40&md5=366f71c39eca694096c9135c18c67f1201700nas a2200217 4500008004100000245009300041210006900134260000900203300001300212490000600225520098800231653002901219653001801248653002101266653002001287653002101307100001101328700001401339700001201353856011701365 2007 eng d00aEmpirically validating software metrics for risk prediction based on intelligent methods0 aEmpirically validating software metrics for risk prediction base c2007 a99 - 1060 v53 aThe 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.10aBayesian belief networks10aDecision tree10aNearest neighbor10aRisk prediction10aSoftware metrics1 aXu, Z.1 aZheng, X.1 aGuo, P. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-70350695759&partnerID=40&md5=f939c6d69c641cbeee0b6e64381ba65a01708nas a2200217 4500008004100000245007200041210006900113260000900182300001200191490000600203520099800209653002701207653002901234653001601263653002101279653003401300100001401334700001301348700001201361856011701373 2007 eng d00aEnergy efficient and QoS-aware tasks allocation for sensor networks0 aEnergy efficient and QoSaware tasks allocation for sensor networ c2007 a88 - 940 v53 aCollaborative 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'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.10aGenetic algorithm (GA)10aQuality-of-service (QoS)10aTasks graph10aTasks scheduling10aWireless sensor network (WSN)1 aZhu, J.H.1 aLi, J.Z.1 aGao, H. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-44849126976&partnerID=40&md5=62663602655dc452190f9dd9b2a26fc501530nas a2200205 4500008004100000245006200041210006200103260000900165300001200174490000600186520089700192653001001089653002601099653002001125100001601145700001601161700001501177700001501192856011701207 2007 eng d00aImpact of node mobility on MANET routing protocols models0 aImpact of node mobility on MANET routing protocols models c2007 a19 - 240 v53 aA 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.10aMANET10aMobile adhoc networks10aMobility models1 aDivecha, B.1 aAbraham, A.1 aGrosan, C.1 aSanyal, S. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-33947316746&partnerID=40&md5=9ec1ff712eea94ec5e6ac514c870c54202158nas a2200205 4500008004100000245008900041210006900130260000900199300001400208490000600222520147500228653002801703653002601731653001401757653002301771100001601794700001301810700001201823856011701835 2007 eng d00aThe Infocious Web search engine: Improving Web searching through linguistic analysis0 aInfocious Web search engine Improving Web searching through ling c2007 a277 - 2910 v53 aIn 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' 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.10aInfocious search engine10aLinguistic processing10aWeb pages10aWeb search engines1 aNtoulas, A.1 aChao, G.1 aCho, J. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-70350638936&partnerID=40&md5=51ba97210c13f5678967a5c10ff4a58a01930nas a2200193 4500008004100000245011400041210006900155260000900224300001400233490000600247520123200253653003201485653003201517653002101549100001401570700001301584700002201597856011701619 2007 eng d00aInformation vs. Robustness in rank aggregation: Models, algorithms and a statistical framework for evaluation0 aInformation vs Robustness in rank aggregation Models algorithms  c2007 a292 - 3080 v53 aThe 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.10aKendall-tau rank aggregator10aRank aggregation algorithms10aRank aggregators1 aAdali, S.1 aHill, B.1 aMagdon-Ismail, M. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-70350655572&partnerID=40&md5=9105bd74059b6e4c04845776bb7c00d901655nas a2200205 4500008004100000245010900041210006900150260000900219300001400228490000600242520095500248653002301203653002701226653002101253653002101274100001401295700001201309700001101321856011701332 2007 eng d00aKnowledge-based support for object-oriented software design and synthesis: A category theoretic approach0 aKnowledgebased support for objectoriented software design and sy c2007 a115 - 1220 v53 aTo 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.10aAutomated software10aObject oriented design10aSoftware metrics10aSoftware quality1 aZheng, Y.1 aXue, J.1 aHu, Q. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-70350673897&partnerID=40&md5=de1990a30fe9efe685a0df6e39e37b8201398nas a2200181 4500008004100000245005700041210005500098260000900153300001400162490000600176520081400182653003400996653000801030653003001038100001401068700001701082856011701099 2007 eng d00aA layered MIMO OFDM system with channel equalization0 alayered MIMO OFDM system with channel equalization c2007 a361 - 3630 v53 aThis 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.10aGraphsdecomposition algorithm10aVDM10aVienna development method1 aNoori, K.1 aHaider, S.A. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-49149122041&partnerID=40&md5=36ef5a9a09db5af4163b13d382aab43301748nas a2200205 4500008004100000245006900041210006900110260000900179300001400188490000600202520105400208653002501262653003301287653002301320653003401343100001601377700001601393700001601409856011701425 2007 eng d00aLinguistic decision analysis based technology project assessment0 aLinguistic decision analysis based technology project assessment c2007 a142 - 1510 v53 aThe 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'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.10aAggregation operator10aLinguistic decision analysis10aProject assessment10aTechnology project management1 aPang, X.-L.1 aFeng, Y.-Q.1 a-Jiang, Wei uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-70350651772&partnerID=40&md5=e8ae7484b3a035c6754606f8fb3b691b01043nas a2200205 4500008004100000245008200041210006900123260000900192300001400201490000600215520035000221653002400571653002000595653002600615653002500641653001500666100002000681700001900701856011700720 2007 eng d00aA method of reduction of the microinstructions of synchronous digital systems0 amethod of reduction of the microinstructions of synchronous digi c2007 a368 - 3710 v53 aIn 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.10aCombined addressing10aDigital systems10aMicroinstruction (MI)10aSynchronized systems10aThroughput1 aAl-Dahleh, M.Z.1 aShehabat, I.M. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-49149085311&partnerID=40&md5=a0a2d18223b85486d770b84463bf0d3901400nas a2200193 4500008004100000245006500041210006300106260000900169300001400178490000600192520078000198653002000978653001500998653002101013653002001034100001801054700001701072856011701089 2007 eng d00aA multilingual query processing system using software agents0 amultilingual query processing system using software agents c2007 a385 - 3900 v53 aThe 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.10aDatabase design10aInterfaces10aQuery processing10aSoftware agents1 aIdicula, S.M.1 aPeter, David uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-49149103443&partnerID=40&md5=a0ff33f2cca96dffadef4c979793412502131nas a2200181 4500008004100000245009000041210006900131260000900200300001200209490000600221520146200227653003901689653004901728653001901777100002001796700001601816856011701832 2007 eng d00aMultimedia knowledge representation for automatic annotation of broadcast TV archives0 aMultimedia knowledge representation for automatic annotation of  c2007 a67 - 740 v53 aMultimedia 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 '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.10aKnowledge-based multimedia systems10aSemantic multimedia retrieval and annotation10aVideo taxonomy1 aMontagnuolo, M.1 aMessina, A. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-44849139506&partnerID=40&md5=6a4a1931e5c3690d56a97c2e4a0c9f4801561nas a2200205 4500008004100000245005000041210004900091260000900140300001400149490000600163520094000169653002301109653002201132653001001154653002001164653001701184100002201201700001501223856011701238 2007 eng d00aMulti-objective mapping for NoC architectures0 aMultiobjective mapping for NoC architectures c2007 a378 - 3840 v53 aIn 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.10aGenetic algorithms10aMapping objective10aMPSoC10aNetwork-on-chip10aOptimization1 aBenyamina, El, H.1 aBoulet, P. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-49149093560&partnerID=40&md5=0f2dbcdf8982dc893dbcaccefdebbc4501961nas a2200217 4500008004100000245010700041210006900148260000900217300001400226490000600240520123400246653002201480653001801502653003201520653001901552653001901571100001201590700001201602700001201614856011701626 2007 eng d00aMulti-source remote sensing classification based on Mallat fusion and residual error feature selection0 aMultisource remote sensing classification based on Mallat fusion c2007 a130 - 1370 v53 aClassification 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.10aFeature selection10aMallet fusion10aMulti-source classification10aNeural network10aResidual error1 aCao, D.1 aYin, Q.1 aGuo, P. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-70350668378&partnerID=40&md5=8e01a98aa0645ce6934545475591db7701849nas a2200229 4500008004100000245008100041210006900122260000900191300001400200490000600214520112500220653001601345653001801361653002201379653001901401653001701420100002101437700001501458700001401473700001501487856011701502 2007 eng d00aA non reference fingerpint image validity via statistical weight calculation0 anon reference fingerpint image validity via statistical weight c c2007 a220 - 2240 v53 aClarity 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.10aFingerprint10aImage quality10aImage subtraction10aOtsu threshold10aSegmentation1 aAltarawneh, M.S.1 aKhor, L.C.1 aWoo, W.L.1 aDlay, S.S. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-44949123442&partnerID=40&md5=c56872a67fd18e70e84324f95df34eaf01303nas a2200181 4500008004100000245005300041210005200094260000900146300001100155490000600166520074400172653001400916653002300930100001700953700001700970700001700987856011701004 2007 eng d00aPalette-based image segmentation using HSL space0 aPalettebased image segmentation using HSL space c2007 a8 - 110 v53 aThis 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.10aHSL space10aImage segmentation1 aKrikor, L.Z.1 aBaba, S.E.I.1 aKrikor, M.Z. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-33947359481&partnerID=40&md5=5f2dbcc5beba47749ba2c598939ab1d401559nas a2200229 4500008004100000245008500041210006900126260000900195300001400204490000600218520086100224653001901085653001201104653001601116653000901132653001501141653001301156653001001169100001701179700001601196856011701212 2007 eng d00aPerformance of integrated wired (Token ring) network and wireless (PRMA) network0 aPerformance of integrated wired Token ring network and wireless  c2007 a372 - 3770 v53 aComputer 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.10aHybrid network10aNetwork10aPerformance10aPRMA10aToken ring10aWireless10aWords1 aAl-Amawi, A.1 aKhanfar, K. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-49149110443&partnerID=40&md5=461f26224ae3a230d93b0fcefcafdf1d01994nas a2200181 4500008004100000245006700041210006600108260000900174300001400183490000600197520137800203653002101581653004601602653001801648653001201666100001701678856011701695 2007 eng d00aPersonalized searching by learning wordnet-based user profiles0 aPersonalized searching by learning wordnetbased user profiles c2007 a309 - 3220 v53 aThe 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.10aMachine learning10aPersonalization and information filtering10aUser modeling10aWordNet1 aSemeraro, G. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-66149191527&partnerID=40&md5=750d800edd5f7fe76d849dd465dafff901809nas a2200217 4500008004100000245008200041210006900123260000900192300001400201490000600215520109000221653002601311653003401337653002001371653001501391100001501406700001401421700001501435700002401450856011701474 2007 eng d00aPre-processing and Path Normalization of a web graph used as a social network0 aPreprocessing and Path Normalization of a web graph used as a so c2007 a262 - 2760 v53 aMany 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.10aCompression technique10aPath normailisation technique10aSocial software10aWeb search1 aTeja, C.B.1 aMitra, S.1 aBagchi, A.1 aBandyopadhyay, A.K. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-57949092373&partnerID=40&md5=08a3428b63ad14c630820944a0e9c22201398nas a2200193 4500008004100000245006700041210006700108260000900175300001400184490000600198520077200204653002500976653002001001653002001021653001501041100001501056700001601071856011701087 2007 eng d00aPromotion of local to global operation in train control system0 aPromotion of local to global operation in train control system c2007 a231 - 2360 v53 aRailway 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.10aFormal specification10aPredicate logic10aSchema calculus10aZ notation1 aKhan, S.A.1 aZafar, N.A. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-44949158690&partnerID=40&md5=9dfd5e28516c12ab2f9a5cfc8da8d3f902212nas a2200193 4500008004100000245009100041210006900132260000900201300001400210490000600224520150300230653004301733653001701776653002601793653002501819653003901844100001801883856011701901 2007 eng d00aQuerying unstructured and structured peer-to-peer networks: Models, issues, algorithms0 aQuerying unstructured and structured peertopeer networks Models  c2007 a201 - 2100 v53 aPeer-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.10aIssues and algorithms for P2P networks10aQuery models10aQuerying P2P networks10aRouting P2P networks10aTaxonomies of P2P query strategies1 aCuzzocrea, A. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-44949141961&partnerID=40&md5=6ec618e515388beb0fc88c49914b805801724nas a2200217 4500008004100000245007300041210006900114260000900183300001400192490000600206520101900212653001401231653002801245653002801273653002301301653001501324653000901339100002001348700002101368856011701389 2007 eng d00aA real time S-box construction using arithmetic modulo prime numbers0 areal time Sbox construction using arithmetic modulo prime number c2007 a354 - 3600 v53 aThis 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.10aDiffusion10aHardware implementation10aModulo prime arithmetic10aParallel execution10aPipelining10aVHDL1 aAbuelyman, E.S.1 aEl-Affendi, M.A. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-49149096383&partnerID=40&md5=a1fe3d6b0e1b163d7545da8586d0fc0f02178nas a2200253 4500008004100000245008600041210006900127260000900196300001200205490000600217520132800223653004101551653000801592653003601600653002301636653001801659653001601677653002901693653004101722100001401763700001401777700001601791856011701807 2007 eng d00aA review of quality of service (QoS) route provisioning in mobile ad hoc networks0 areview of quality of service QoS route provisioning in mobile ad c2007 a32 - 470 v53 aWith 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.10aCode division multiple access (CDMA)10aMAC10aMobile ad hoc networks (MANETs)10aMulti-path routing10aQoS framework10aQoS routing10aQuality-of-service (QoS)10aTime division multiple access (TDMA)1 aKumar, R.1 aMisra, M.1 aSarje, A.K. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-33947328537&partnerID=40&md5=32892d1835b3d07244ec98fa129cdf0201822nas a2200217 4500008004100000245011200041210006900153260000900222300001400231490000600245520106000251653002101311653002501332653003201357653002601389653003101415100001401446700001401460700001301474856011701487 2007 eng d00aRobust adaptive beamforming with SSMUSIC performance optimization in the presence of steering vector errors0 aRobust adaptive beamforming with SSMUSIC performance optimizatio c2007 a107 - 1140 v53 aA 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.10aDiagonal loading10aDirection of arrival10aRobust adaptive beamforning10aSteering vector error10aSubspace projection matrix1 aJiang, B.1 aCheng, Q.1 aLing, G. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-70350695756&partnerID=40&md5=2214a4d0fbafc0be565751c0b0993b3d02066nas a2200229 4500008004100000245007200041210006900113260000900182300001200191490000600203520131500209653002101524653002301545653003901568653002001607653002001627653001301647100002001660700001701680700002201697856011701719 2007 eng d00aA robust outlier detection scheme for collaborative sensor networks0 arobust outlier detection scheme for collaborative sensor network c2007 a12 - 180 v53 aIn-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.10aData aggregation10aDetection accuracy10aDistributed information processing10aFalse positives10aFault tolerance10aOutliers1 aJayashree, L.S.1 aArumugam, S.1 aVijayalakshmi, K. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-33947305265&partnerID=40&md5=2fae284d218d7852052fabf8a0ef68ca01663nas a2200217 4500008004100000245009400041210006900135260000900204300001400213490000600227520096100233653001401194653001901208653001401227653001501241653001501256653001601271100002501287700001601312856011701328 2007 eng d00aRobust self embedding watermarking technique in the DWT domain for digital colored images0 aRobust self embedding watermarking technique in the DWT domain f c2007 a211 - 2190 v53 aIn 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.10aCopyright10aDigital images10aEmbedding10aRobustness10aScrambling10aWatermaking1 aAl-Nu'aimi, Al-Tahan1 aQahwaji, R. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-44949187327&partnerID=40&md5=d8e2ad97422a0852424c209b57cc93ff01427nas a2200205 4500008004100000245005400041210005300095260000900148300001400157490000600171520079800177653002600975653001801001653002901019100001201048700001501060700001501075700001401090856011701104 2007 eng d00aRotation-based three dimensional shape descriptor0 aRotationbased three dimensional shape descriptor c2007 a138 - 1410 v53 aRecent 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.10a3 d space descriptors10aGauss mapping10aThree dimensional shapes1 aLuo, H.1 aChu, S.-C.1 aPan, J.-S.1 aLu, Z.-M. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-70350689502&partnerID=40&md5=11b5b46b07b7146eba309aa78ff8f50101529nas a2200229 4500008004100000245009900041210006900140260000900209300001000218490000600228520078200234653001301016653001501029653002601044653002101070653001701091653001901108653002701127100001401154700001401168856011701182 2007 eng d00aSensitivity analysis of server placement on enterprise network topology through soft computing0 aSensitivity analysis of server placement on enterprise network t c2007 a1 - 70 v53 aWe 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.10aAnalysis10aClustering10aEdge-server placement10aNetwork topology10aOptimization10aSoft computing10aWeb structure analysis1 aSafar, M.1 aHabib, S. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-33947320448&partnerID=40&md5=62ced3281abb66c04e4ac8f00c808c7b01977nas a2200241 4500008004100000245006200041210006000103260000900163300001400172490000600186520124700192653002201439653002301461653002301484653002001507100001201527700001901539700001901558700001501577700001301592700001301605856011701618 2007 eng d00aSocial search with missing data: Which ranking algorithm?0 aSocial search with missing data Which ranking algorithm c2007 a249 - 2610 v53 aOnline social networking tools are extremely popular, but can miss potential discoveries latent in the social 'fabric'. 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'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 'inferred profiles' 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.10aInstant messaging10aRanking algorithms10aRelation discovery10aSocial software1 aZhu, J.1 aEisenstadt, M.1 aGonçalves, A.1 aDenham, C.1 aUren, V.1 aSong, D. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-70350629888&partnerID=40&md5=a263e560496728c004285a55b37a4e2700470nas a2200121 4500008004100000245007400041210006900115260000900184300001400193490000600207100001800213856011700231 2007 eng d00aSpecial issue on "Advances in querying non-conventional date sources"0 aSpecial issue on Advances in querying nonconventional date sourc c2007 a178 - 1790 v51 aCuzzocrea, A. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-44949092229&partnerID=40&md5=28170025218311b3a1d87a2ec56ac3ab00517nas a2200145 4500008004100000245006600041210006300107260000900170300001400179490000600193100001400199700002300213700001800236856011700254 2007 eng d00aSpecial issue on " web information retrieval" guest editorial0 aSpecial issue on web information retrieval guest editorial c2007 a247 - 2480 v51 aOunis, I.1 aVan Rijsbergen, K.1 aPichappan, P. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-70350680438&partnerID=40&md5=855a794997ff155476fad28109d1f3a201464nas a2200217 4500008004100000245006800041210006700109260000900176300001400185490000600199520079500205653001301000653002101013653002101034653002101055653001501076653000801091100001501099700001501114856011701129 2007 eng d00aStack-based pattern matching algorithm for XML query processing0 aStackbased pattern matching algorithm for XML query processing c2007 a167 - 1740 v53 aWith 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.10aLabeling10aPattern matching10aQuery processing10aStructural query10aTwig query10aXML1 aHaw, S.-C.1 aLee, C.-S. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-63149191050&partnerID=40&md5=a28a66080f0d1b4d84de686811194d9f02046nas a2200205 4500008004100000245009900041210006900140260000900209300001400218490000600232520135600238653002101594653002501615653001701640653001801657100001601675700002001691700001201711856011701723 2007 eng d00aStorage and indexing of relational OLAP views with mixed categorical and continuous dimensions0 aStorage and indexing of relational OLAP views with mixed categor c2007 a180 - 1900 v53 aDue 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.10aContinuous space10aSpace-filling curves10aSpatial OLAP10aView indexing1 aBaltzer, O.1 aRau-Chaplin, A.1 aZeh, N. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-44949248100&partnerID=40&md5=a63605fb283d6f4f67f8f3aaa7a854be01884nas a2200205 4500008004100000245011000041210006900151260000900220300001400229490000600243520116900249653002601418653002301444653002601467653002601493100001401519700001601533700001201549856011701561 2007 eng d00aUnsupervised learning aided by clustering and local-global hierarchical analysis in knowledge exploration0 aUnsupervised learning aided by clustering and localglobal hierar c2007 a237 - 2460 v53 aUnsupervised 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.10aHierarchical analysis10aK-means clustering10aKnowledge exploration10aUnsupervised learning1 aZhang, Y.1 aOrgun, M.A.1 aLin, W. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-44949188275&partnerID=40&md5=2448112a6f72451c391f1e75cc38eeed01157nas a2200181 4500008004100000245006200041210006200103260000900165300001400174490000600188520055600194653003500750653000800785653003000793100001200823700002300835856011700858 2007 eng d00aVDM specification of an algorithm for graph decomposition0 aVDM specification of an algorithm for graph decomposition c2007 a347 - 3530 v53 aComplex 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.10aGraphs decomposition algorithm10aVDM10aVienna development method1 aHuq, A.1 aRamachandran, N.T. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-49149094335&partnerID=40&md5=1cb50e54c6cd978239ea452ebecd006a01267nas a2200193 4500008004100000245005500041210005400096260000900150300001400159490000600173520065100179653002800830653002200858653003200880100001400912700001300926700001700939856011700956 2007 eng d00aYCSc: A modified clustering technique based on LCS0 aYCSc A modified clustering technique based on LCS c2007 a160 - 1660 v53 aThis 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.10aEvolutionary algorithms10aK-means algorithm10aLearning classifier systems1 aTamee, K.1 aBull, L.1 aPinngern, O. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-70350651771&partnerID=40&md5=edb219bf61f63b4fe832f9edf8cde63801414nas a2200229 4500008004100000245004600041210004600087260000900133300001400142490000600156520071700162653002800879653003300907653002000940653001800960653002600978100001401004700001301018700002101031700001501052856011701067 2006 eng d00aAd hoc location service for mobile agents0 aAd hoc location service for mobile agents c2006 a131 - 1350 v43 aIn 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.10aAd hoc location service10aGossipy agent-based approach10aMessage routing10aMobile agents10aPiggybacking approach1 aLokpo, I.1 aBi, T.G.1 aCros, Cubat, dit1 aPadiou, G. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-44649105784&partnerID=40&md5=6a967e33c70a9aac0e38aa107fe2fb4701642nas a2200217 4500008004100000245006300041210006300104260000900167300001200176490000600188520098400194653001901178653001701197653001701214653001501231653001101246100001801257700001601275700001601291856011701307 2006 eng d00aApplying AOP concepts to increase web services flexibility0 aApplying AOP concepts to increase web services flexibility c2006 a37 - 430 v43 aWeb 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.10aAOP techniques10aSOAP service10aXML language10aXML schema10aXQuery1 aHmida, M.M.B.1 aTomaz, R.F.1 aMonfort, V. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-33748251277&partnerID=40&md5=b598d50cac5e77e5f660a9cc3541072a01421nas a2200205 4500008004100000245006600041210006600107260000900173300001200182490000600194520080100200653001401001653001401015653001701029653001601046100001101062700001301073700001201086856011701098 2006 eng d00aAutomatic and flexible web services discovery in semantic web0 aAutomatic and flexible web services discovery in semantic web c2006 a22 - 250 v43 aThe 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.10aDiscovery10aElearning10aSemantic web10aWeb service1 aLu, L.1 aChen, J.1 aZhu, G. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-33748262446&partnerID=40&md5=f576cda3c55219ff4617a04d7dcb8d8f01671nas a2200229 4500008004100000245009000041210006900131260000900200300001200209490000600221520094500227653001601172653002701188653002101215653002201236653001901258100001301277700001101290700001101301700001201312856011701324 2006 eng d00aContinuously evaluating approximate similarity search on high dimensional data stream0 aContinuously evaluating approximate similarity search on high di c2006 a82 - 860 v43 aIn 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.10aData stream10aHigh dimensional space10aQuery processing10aSimilarity Search10aVideo indexing1 aWang, W.1 aLi, J.1 aAi, C.1 aShi, S. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-33748267270&partnerID=40&md5=da6323dddf161caf008918184cbec11501230nas a2200217 4500008004100000245006800041210006700109260000900176300001200185490000600197520053200203653002800735653002500763653002100788653002700809653000800836100002000844700001500864700001600879856011700895 2006 eng d00aCreating dependable web services using user-transparent replica0 aCreating dependable web services using usertransparent replica c2006 a16 - 210 v43 aDependability 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.10aDependable web services10aSoftware development10aVenice framework10aWeb service technology10aXML1 aHillenbrand, M.1 aGötze, J.1 aMüller, P. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-33748249857&partnerID=40&md5=2f82439b41c666055dd9bd6d4a3dea1101314nas a2200229 4500008004100000245009200041210006900133260000900202300001200211490000600223520056100229653002000790653001600810653002700826653002400853653001700877653002800894653001900922100001300941700001300954856011700967 2006 eng d00aThe designing of web services to deliver web documents associated with historical links0 adesigning of web services to deliver web documents associated wi c2006 a11 - 150 v43 aThe 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'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's history of changes, and designs web services to deliver the source document associated with a historical link.10aConcept mapping10aHyper space10aInformation extraction10aKnowledge discovery10aSemantic web10aWeb knowledge discovery10aWeb navigation1 aChao, D.1 aGill, S. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-33748275472&partnerID=40&md5=8f950d21d3b688c9a0c1bb1159d7a54d01605nas a2200229 4500008004100000245012000041210006900161260000900230300001200239490000600251520087700257653000801134653000801142653001601150653001601166653002401182100001201206700001201218700001601230700001201246856011701258 2006 eng d00aA dynamic priority allocation scheme of messages for differentiated web services satisfying service level agreement0 adynamic priority allocation scheme of messages for differentiate c2006 a26 - 310 v43 aRecently 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.10aB2B10aB2C10aWeb servers10aWeb service10aWeb service quality1 aKim, D.1 aLee, S.1 aAbraham, A.1 aHan, S. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-33748284649&partnerID=40&md5=0ba79237064c0f9d6784d65c0224a6b400381nas a2200133 4500008004100000245001400041210001400055260000900069300000800078490000600086100001800092700002000110856011700130 2006 eng d00aEditorial0 aEditorial c2006 a1580 v41 aPichappan, P.1 aEl-Qawasmeh, E. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-33749407706&partnerID=40&md5=797926d82d7289fb4e88f4899809bc0400382nas a2200133 4500008004100000245001400041210001400055260000900069300001400078490000600092100001500098700001800113856011700131 2006 eng d00aEditorial0 aEditorial c2006 a100 - 1010 v41 aChbeir, R.1 aYetongnon, K. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-44649109659&partnerID=40&md5=1372fbf024af643ce6af2ec7b0a60a1101519nas a2200181 4500008004100000245006500041210006400106260000900170300001400179490000600193520092600199653002301125653001301148653002301161100001801184700001801202856011701220 2006 eng d00aEnabling metaphor evolution for improving systems' usability0 aEnabling metaphor evolution for improving systems usability c2006 a243 - 2480 v43 aIn 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.10aInformation system10aMetaphor10aSoftware evolution1 aKaschek, R.H.1 aTretiakov, A. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-33845955932&partnerID=40&md5=5e4f1d1515e1ac91de0d2055cd05453301497nas a2200205 4500008004100000245009000041210006900131260000900200300001400209490000600223520076000229653003400989653004901023653002201072653004001094100001301134700001301147700001401160856011701174 2006 eng d00aEnergy efficient adaptive message transmission algorithm for wireless sensor networks0 aEnergy efficient adaptive message transmission algorithm for wir c2006 a142 - 1460 v43 aAn 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.10aAdaptive message transmission10aData management for wireless sensor networks10aEnergy efficiency10aEvent-based ad hoc query processing1 aLi, G.L.1 aLi, J.Z.1 aGuo, L.J. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-44649137406&partnerID=40&md5=1f91920bf596f1fc95306fa2882e01b401896nas a2200205 4500008004100000245008100041210006900122260000900191300001400200490000600214520116200220653003801382653002601420653002401446653005201470100001501522700002101537700001501558856011701573 2006 eng d00aExpressing and interpreting user intention in pervasive service environments0 aExpressing and interpreting user intention in pervasive service  c2006 a102 - 1060 v43 aThe 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.10aAlgorithms in pervasive computing10aObject-oriented model10aPervasive computing10aPervasive Service Action Query Language (PsaQL)1 aBihler, P.1 aScuturici, V.-M.1 aBrunie, L. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-34547320698&partnerID=40&md5=47a322c63cbf87aec59acd1e5104f08d01832nas a2200181 4500008004100000245007000041210006900111260000900180300001400189490000600203520122600209653001801435653002901453653001701482653002101499100001301520856011701533 2006 eng d00aExtracting information from coarser-grained data in XML documents0 aExtracting information from coarsergrained data in XML documents c2006 a117 - 1230 v43 aXML 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.10aData exchange10aFinite state transducers10aXML database10aXtractor wrapper1 aBadr, Y. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-44649098973&partnerID=40&md5=e3df331dc7e1172e6d94226eecc4f74401253nas a2200181 4500008004100000245004200041210004200083260000900125300001400134490000600148520070600154653002100860653001600881653002000897653001800917100001900935856011700954 2006 eng d00aFrom words to concepts in text mining0 aFrom words to concepts in text mining c2006 a147 - 1490 v43 aIn 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.10aConcept indexing10aText mining10aText processing10aWord relation1 aAl-Zahrani, S. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-44649133985&partnerID=40&md5=46dbcc4ccd511a6a729ef7fac8d7713f01751nas a2200205 4500008004100000245009600041210006900137260000900206300001400215490000600229520107200235653001101307653001301318653002301331653001401354100001801368700001801386700002401404856011701428 2006 eng d00aGraphOnto: OWL-based ontology management and multimedia annotation in the DS-MIRF framework0 aGraphOnto OWLbased ontology management and multimedia annotation c2006 a214 - 2190 v43 aWe 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égé and clearly outperforms it.10aMPEG 710aOntology10aOntology standards10aSemantics1 aPolydoros, P.1 aTsinaraki, C.1 aChristodoulakis, S. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-33845937025&partnerID=40&md5=b72758db21f6febb306c3712ffb375fb01442nas a2200193 4500008004100000245009700041210006900138260000900207300001400216490000600230520078100236653002001017653001701037653002801054100001501082700001701097700001701114856011701131 2006 eng d00aHow to enhance competitive advantage of digital content industries? - A case study of Taiwan0 aHow to enhance competitive advantage of digital content industri c2006 a256 - 2590 v43 aOn 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.10aDigital content10aOnline games10aTaiwan digital industry1 aYeh, S.-W.1 aShiue, Y.-C.1 aHorng, D.-J. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-33845927549&partnerID=40&md5=1bc7801fbff9552e0e1cbbbc3589f04702206nas a2200193 4500008004100000245006200041210006000103260000900163300001200172490000600184520153900190653002901729653004701758653002601805653003001831100001901861700001501880856011701895 2006 eng d00aA hybrid model to improve relevance in document retrieval0 ahybrid model to improve relevance in document retrieval c2006 a73 - 810 v43 aIn 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.10aCG-based retrieval model10aHigh precision information retrieval model10aIntelligent retrieval10aTwo-stage retrieval model1 aSiddiqui, T.J.1 aTiwary, U. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-33748252460&partnerID=40&md5=28fb109a6982827d4057e4947164916d01669nas a2200169 4500008004100000245006600041210006600107260000900173300001200182490000600194520110300200653002401303653002401327653001701351100001401368856011701382 2006 eng d00aHybrid storage scheme for RDF data management in Semantic Web0 aHybrid storage scheme for RDF data management in Semantic Web c2006 a32 - 360 v43 aWith 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.10aData storage scheme10aRDF data management10aSemantic web1 aKim, S.W. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-33748257249&partnerID=40&md5=6e21f3861ea8e8149f8df1878a0aaabc01087nas a2200229 4500008004100000245003800041210003700079260000900116300001100125490000600136520041300142653002000555653001600575653002700591653002400618653001700642653002800659653001900687100001600706700001800722856011700740 2006 eng d00aHyperMap: A system to map the web0 aHyperMap A system to map the web c2006 a4 - 100 v43 aThis 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.10aConcept mapping10aHyper space10aInformation extraction10aKnowledge discovery10aSemantic web10aWeb knowledge discovery10aWeb navigation1 aRalha, C.G.1 aRalha, J.C.L. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-33748283744&partnerID=40&md5=0ae6894b5de7bbb54ba63e4ce6b1f95c01867nas a2200193 4500008004100000245007800041210006900119260000900188300001400197490000600211520121800217653002801435653001701463653001901480653001901499100002001518700001801538856011701556 2006 eng d00aAn intelligent paradigm for multi-objects tracking in crowded environment0 aintelligent paradigm for multiobjects tracking in crowded enviro c2006 a184 - 1910 v43 aIn 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.10aColour video processing10aMDI approach10aMoving objects10aObject motions1 aAl-Hamadi, A.K.1 aMichaelis, B. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-33749373594&partnerID=40&md5=13a4c51b2ea671d5b5b5f2b0e05705e200451nas a2200133 4500008004100000245005100041210005100092260000900143300000800152490000600160100001500166700001900181856011700200 2006 eng d00aIntroduction to the Multimedia Semantics issue0 aIntroduction to the Multimedia Semantics issue c2006 a2060 v41 aGrosky, B.1 aStanchev, P.L. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-33845938735&partnerID=40&md5=6cc5552751fc285d3d1d350093fe339501144nas a2200205 4500008004100000245004600041210004400087260000900131300001400140490000600154520050500160653002200665653002500687653002100712653002900733100001800762700001900780700002200799856011700821 2006 eng d00aA method for incorporating user modelling0 amethod for incorporating user modelling c2006 a136 - 1410 v43 aIn 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.10aAdaptation graphs10aAdaptive hyper media10aSoftware systems10aUser modeling techniques1 ade Vrieze, P.1 avan Bommel, P.1 avan der Weide, T. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-44649122190&partnerID=40&md5=81f31d807146f2213cd9d4bec519f99801841nas a2200181 4500008004100000245008700041210006900128260000900197300001200206490000600218520121700224653002401441653002101465653002401486100001701510700001501527856011701542 2006 eng d00aA model for the aggregation of QoS in WS compositions involving redundant services0 amodel for the aggregation of QoS in WS compositions involving re c2006 a44 - 490 v43 aA 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.10aQuality aggregation10aSoftware quality10aWeb service quality1 aJaeger, M.C.1 aLadner, H. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-33748264359&partnerID=40&md5=191a90f99492d0ec23efaaa7b31a4c4201256nas a2200193 4500008004100000245004600041210004400087260000900131300001400140490000600154520068100160653001800841653002000859653001700879653001800896100001700914700001400931856011700945 2006 eng d00aA new persistent labelling scheme for XML0 anew persistent labelling scheme for XML c2006 a112 - 1160 v43 aWith 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.10aData exchange10aLabeling scheme10aXML database10aXML standards1 aGabillon, A.1 aFansi, M. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-44649170430&partnerID=40&md5=b06e66fe740929637d6b20adf7fe0e9e01100nas a2200193 4500008004100000245008400041210006900125260000900194300001400203490000600217520045800223653002400681653001800705653001600723653001700739653001500756100001800771856011700789 2006 eng d00aOptimal placement of Web proxies in the Internet with link capacity constraints0 aOptimal placement of Web proxies in the Internet with link capac c2006 a238 - 2420 v43 aThis 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.10aDynamic programming10aLink capacity10aReplication10aTree network10aWeb server1 aTenzakhti, F. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-33845933875&partnerID=40&md5=9e8af6a6d40a5eb4fb54dbc61e62f0cc01342nas a2200217 4500008004100000245013200041210006900173260000900242300001400251490000600265520056500271653002900836653001800865653001600883653002300899653002400922653002600946653001700972100001800989856011701007 2006 eng d00aOptimization of Boolean queries in information retrieval systems using genetic algorithms - Genetic programming and fuzzy logic0 aOptimization of Boolean queries in information retrieval systems c2006 a249 - 2540 v43 aThis 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.10aBoolean operator weights10aBoolean query10aFuzzy logic10aGenetic algorithms10aGenetic programming10aInformation retrieval10aTerm weights1 aOwais, S.S.J. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-33845945357&partnerID=40&md5=bb2fe8678839544324f8ce90e9dca87601562nas a2200181 4500008004100000245008900041210006900130260000900199300001400208490000600222520092100228653002401149653002701173653002301200653002601223100001401249856011701263 2006 eng d00aParallel algorithms for the generalized same generation query in deductive databases0 aParallel algorithms for the generalized same generation query in c2006 a192 - 1960 v43 aThe 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.10aDeductive databases10aLinear recursive rules10aParallel databases10aSame generation query1 aArman, N. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-33749424147&partnerID=40&md5=f02aca3cb9370bdc7720ce48f750727801975nas a2200205 4500008004100000245009500041210006900136260000900205300001400214490000600228520128200234653002801516653001001544653002701554653001701581100001701598700001501615700002201630856011701652 2006 eng d00aPeer-to-peer content search supported by a distributed index in a publication/search model0 aPeertopeer content search supported by a distributed index in a  c2006 a175 - 1830 v43 aPeer 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.10aDistributed index model10aNodes10aP2P network evaluation10aP2P networks1 aTolosa, G.H.1 aPeri, J.A.1 aBordignon, F.R.A. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-33749394455&partnerID=40&md5=1ab83251bfe0f9c3bd58f562a631233601764nas a2200217 4500008004100000245007900041210006900120260000900189300001400198490000600212520102200218653002601240653002501266653004101291653003001332100001401362700002301376700001501399700001501414856011701429 2006 eng d00aProviding support for interaction with consistent multimedia presentations0 aProviding support for interaction with consistent multimedia pre c2006 a124 - 1300 v43 aMultimedia 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.10aCompleteness checking10aConsistency checking10aDistributed multimedia presentations10aSpatio-temporal relations1 aElias, S.1 aEaswarakumar, K.S.1 aMathew, L.1 aChbeir, R. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-44649102725&partnerID=40&md5=6d8bb6f8d9dff4f2b87372209551154a01850nas a2200193 4500008004100000245007600041210006900117260000900186300001400195490000600209520120400215653002101419653003101440653001901471653001601490653001701506100001601523856011701539 2006 eng d00aPruning techniques in associative classification: Survey and comparison0 aPruning techniques in associative classification Survey and comp c2006 a197 - 2020 v43 aAssociation 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.10aAssociation rule10aAssociative classification10aClassification10aData mining10aRule pruning1 aThabtah, F. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-33749400880&partnerID=40&md5=0633368b3744eefc60e6e205c64d95f401495nas a2200217 4500008004100000245005000041210004700091260000900138300001200147490000600159520085600165653002101021653001301042653002901055653001301084653001701097100001501114700001501129700001601144856011701160 2006 eng d00aRDF-based peer-to-peer based ontology editing0 aRDFbased peertopeer based ontology editing c2006 a50 - 550 v43 aThe 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.10aNetwork protocol10aOntology10aP2P network architecture10aRDF data10aSemantic web1 aBecker, P.1 aEklund, P.1 aRoberts, N. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-33748271282&partnerID=40&md5=6e01c9d91afd3edb7ba6d4f2ba60888101308nas a2200193 4500008004100000245009000041210006900131260000900200300001200209490000600221520063100227653004000858653002700898653002900925100001300954700001600967700001400983856011700997 2006 eng d00aSelf organizing sensors by minimization of cluster heads using intelligent clustering0 aSelf organizing sensors by minimization of cluster heads using i c2006 a87 - 930 v43 aMinimization 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.10aAlgorithm for cluster establishment10aIntelligent clustering10aWireless sensor networks1 aShin, K.1 aAbraham, A.1 aHan, S.Y. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-33748269465&partnerID=40&md5=09380a1feabe731dc94b96939ce3ea2601772nas a2200241 4500008004100000245007800041210006900119260000900188300001400197490000600211520099100217653002001208653002201228653002901250653002501279100001801304700001501322700001801337700001901355700001501374700002401389856011701413 2006 eng d00aSemantic, constraint & preference based multimedia presentation authoring0 aSemantic constraint preference based multimedia presentation aut c2006 a207 - 2130 v43 aWe 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.10aAuthoring tools10aDigital libraries10aMultimedia presentations10aMultimedia standards1 aTsinaraki, C.1 aPerego, A.1 aPolydoros, P.1 aSyntzanaki, A.1 aMartin, A.1 aChristodoulakis, S. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-33845937945&partnerID=40&md5=762148820f31cebc540800656d2bbd3801751nas a2200241 4500008004100000245008100041210006900122260000900191300001200200490000600212520099800218653002501216653001401241653002401255653001501279653001701294653001701311100001501328700001601343700001501359700001801374856011701392 2006 eng d00aSemantic indexing and hyperlinking of multimedia news: The RitroveRAI system0 aSemantic indexing and hyperlinking of multimedia news The Ritrov c2006 a63 - 720 v43 aWeb 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.10aHyper link structure10aMeta data10aMultimedia indexing10aRitroveRAI10aSemantic web10aWeb services1 aBasili, R.1 aCammisa, M.1 aDonati, E.1 aMoschitti, A. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-33748253466&partnerID=40&md5=05e5487b09fcb109fd3c282449982ec401551nas a2200217 4500008004100000245005000041210005000091260000900141300001400150490000600164520089000170653001801060653002101078653003001099653001101129653002501140100001901165700001501184700001701199856011701216 2006 eng d00aSome issues in the art image database systems0 aSome issues in the art image database systems c2006 a227 - 2320 v43 aIn 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.10aArt databases10aImage processing10aImage search and analysis10aMPEG 710aMultimedia databases1 aStanchev, P.L.1 aJr., Green1 aDimitrov, B. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-33845946404&partnerID=40&md5=1b636067433b4b642b3499b0c6712dff02186nas a2200205 4500008004100000245012200041210006900163260000900232300001400241490000600255520146500261653002401726653002301750653001801773653001701791100001601808700002101824700001801845856011701863 2006 eng d00aStudy of effectiveness of implicit indicators and their optimal combination for accurate inference of users interests0 aStudy of effectiveness of implicit indicators and their optimal  c2006 a169 - 1740 v43 aRetrieval and filtering systems may apply relevance feedback to gain information on users' 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' 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' 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.10aImplicit indicators10aRelevance feedback10aUser modeling10aUser studies1 aShapira, B.1 aTaieb-Maimon, M.1 aMoskowitz, A. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-33749406365&partnerID=40&md5=aa35b421ac892afda1341ff1d8c1ae2001374nas a2200205 4500008004100000245005100041210004800092260000900140300001400149490000600163520075400169653002000923653001900943653002100962653002800983653000801011100001501019700001701034856011701051 2006 eng d00aTrends in data management: 'High availability'0 aTrends in data management High availability c2006 a150 - 1540 v43 aIn today'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 'high availability'. 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.10aData clustering10aData mirroring10aData replication10aDatabase administration10aSQL1 aBock, D.B.1 aBordoloi, B. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-44649115858&partnerID=40&md5=c675fe3325e4aad3ae202a7a0cd0b78402026nas a2200181 4500008004100000245005200041210005000093260000900143300001200152490000600164520144600170653002101616653004501637653000901682100001701691700001901708856011701727 2006 eng d00aTWSO - Transactional web service orchestrations0 aTWSO Transactional web service orchestrations c2006 a56 - 620 v43 aThere 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.10aNetwork protocol10aTransactional Web Service Orchestrations10aTWSO1 aHrastnik, P.1 aWiniwarter, W. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-33748275471&partnerID=40&md5=072dab0b6eaba78383708fb1f1d20e0401502nas a2200205 4500008004100000245008600041210006900127260000900196300001400205490000600219520084000225653002601065653001101091653001301102653001901115653001501134100001501149700001501164856011701179 2006 eng d00aOn the use of ontologies for an optimal representation and exploration of the web0 ause of ontologies for an optimal representation and exploration  c2006 a159 - 1680 v43 aThe 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.10aConceptual structures10aGraphs10aOntology10aQuery language10aWeb search1 aGuelfi, N.1 aPruski, C. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-33749389716&partnerID=40&md5=2881871777661cd78d3507f448bedc3201471nas a2200205 4500008004100000245014500041210006900186260000900255300001400264490000600278520073700284653001101021653003101032653001301063653001401076100002001090700001401110700002401124856011701148 2006 eng d00aUser interactions with multimedia repositories using natural language interfaces - OntoNL: An architectural framework and its implementation0 aUser interactions with multimedia repositories using natural lan c2006 a220 - 2260 v43 aWe 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.10aMPEG 710aNatural language interface10aOntology10aSemantics1 aKaranastasi, A.1 aZotos, A.1 aChristodoulakis, S. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-33845925229&partnerID=40&md5=78be53ce109a805416d2c49e78d10de501610nas a2200229 4500008004100000245005700041210005700098260000900155300001400164490000600178520091100184653002901095653001301124653001701137653001701154653003001171653001201201100001701213700001601230700001701246856011701263 2006 eng d00aUsing BFA with wordnet based model for web retrieval0 aUsing BFA with wordnet based model for web retrieval c2006 a107 - 1110 v43 aIn 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.10aLatent semantic indexing10aOntology10aSemantic web10aVector model10aWeb information retrieval10aWordNet1 aSnášel, V.1 aMoravec, P.1 aPokorný, J. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-44649186320&partnerID=40&md5=84c389a9e2d0c1be0cd8ecdb6b1534ec00428nas a2200145 4500008004100000245002700041210002700068260000900095300001000104490000600114100001600120700001700136700001200153856011700165 2006 eng d00aWeb services practices0 aWeb services practices c2006 a1 - 30 v41 aAbraham, A.1 aChung, J.-Y.1 aHan, S. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-33748276255&partnerID=40&md5=884b133db7ced4fcf2cae9418b3b991901899nas a2200229 4500008004100000245009100041210006900132260000900201300001400210490000600224520117600230653002101406653000901427653001301436653001401449653001201463100002101475700001601496700002001512700002001532856011701552 2006 eng d00aX-Similarity: Computing Semantic Similarity between concepts from different ontologies0 aXSimilarity Computing Semantic Similarity between concepts from  c2006 a233 - 2370 v43 aSemantic 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.10aContent analysis10aMeSH10aOntology10aSemantics10aWordNet1 aPetrakis, E.G.M.1 aVarelas, G.1 aHliaoutakis, A.1 aRaftopoulou, P. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-33845952568&partnerID=40&md5=5bd213d7f778b7c4e7b32133f4b456f8