{"title":"A new classifier applied to biological early warning systems for toxicity detection","authors":"Yingrong Li, Dong-Hun Seo, W. Lee","doi":"10.1109/ICADIWT.2008.4664373","DOIUrl":"https://doi.org/10.1109/ICADIWT.2008.4664373","url":null,"abstract":"Biological early warning systems(BEWS) has been developed in recent years. BEWS detects toxicity by tracking the physiologic responses of the whole organisms. In the paper, we apply the classification technique to the biological early warning systems and propose a new BEWS which is meaningful to biological field. Meanwhile, how to select the features in such classification application is also a contribution of this paper. By using the fractal dimension theory, we define the input features which represent the organism characteristics in non-toxic or toxic environment. The experiment results show that the proposed new bio-monitoring system is effective for environmental toxicity detection.","PeriodicalId":189871,"journal":{"name":"2008 First International Conference on the Applications of Digital Information and Web Technologies (ICADIWT)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115403233","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Enhancing collaborative filtering by frequent usage patterns","authors":"I. Esslimani, A. Brun, A. Boyer","doi":"10.1109/ICADIWT.2008.4664341","DOIUrl":"https://doi.org/10.1109/ICADIWT.2008.4664341","url":null,"abstract":"Recommender systems contribute to the personalization of resources on the Web sites and information retrieval systems. In this paper, we present a hybrid recommender system using a user based approach which combines predictions based on Web usage patterns and rating data. We suggest a new technique that takes into account frequent patterns in order to compute correlations between users and select neighbors. Then, we combine this technique with collaborative filtering using Pearson correlation metric. The aim of this combination consists in the evaluation of the impact of each technique on recommendations. The performance of our system is tested without and by combining predictions in terms of accuracy and robustness. The different tests show that the more the navigational based technique is involved in the recommendation process, the more the best predictions are accurate and the system is robust.","PeriodicalId":189871,"journal":{"name":"2008 First International Conference on the Applications of Digital Information and Web Technologies (ICADIWT)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124980784","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A study of AJAX vulnerability in Web 2.0 applications","authors":"A. Bin Al-Tameem, P. Chittikala, P. Pichappan","doi":"10.1109/ICADIWT.2008.4664319","DOIUrl":"https://doi.org/10.1109/ICADIWT.2008.4664319","url":null,"abstract":"The current period is marked by the increased application of Web servers and the use of web 2.0 for many utilities. As the access to the Web 2.0 by the global users is on ever increase, the hijackers eye on the Web 2.0 for attacks. The principal technology behind the Web 2.0 is the AJAX which now becomes the target of many security attacks. In the current study we have introduced AJAX PRO, a prototype tool for AJAX vulnerability prevention has visualized an enhanced architecture to reflect the AJAX vulnerability and the architecture is applied in randomized trails and the results call for increased applications.","PeriodicalId":189871,"journal":{"name":"2008 First International Conference on the Applications of Digital Information and Web Technologies (ICADIWT)","volume":"19 S1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125820703","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Multi-join algorithm utilizing sublattice of a minimal number of double indices","authors":"Hanan Ahmed Hossni Mahmoud Abd Alla, L. Al-Safadi","doi":"10.1109/ICADIWT.2008.4664348","DOIUrl":"https://doi.org/10.1109/ICADIWT.2008.4664348","url":null,"abstract":"In this paper, a novel multi-join algorithm is introduced. The novel algorithm is based on building a sublattice of a minimal number of double indices. A double index is a data structure that combines the indices of two relations and is built by a hashed-based join algorithm. The double index is divided into join buckets with the same hash function value. The algorithm then joins buckets with similar hash function to produce joined buckets. These steps are used to build the complete join index of the two relations. The time complexity required to build the join index of two categories is in the order of m log m where m is the size of each category. The time complexity to join all buckets is of the order of n log m. The join index is used to materialize the joined relation if required. Otherwise, it is used along with other double indices of other relations to build a sublattice to be used in multi-join operations with minimal I/O requirements. The sublattice of the double indices can be fitted into the main memory which further reduces time complexity of the multi-join algorithm. The main advantage of our technique is when used in intensive multi-join dominant computational environment.","PeriodicalId":189871,"journal":{"name":"2008 First International Conference on the Applications of Digital Information and Web Technologies (ICADIWT)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128664251","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Optimized DWT-based image watermarking","authors":"A. Abu-Errub, A. Al-Haj","doi":"10.1109/ICADIWT.2008.4664405","DOIUrl":"https://doi.org/10.1109/ICADIWT.2008.4664405","url":null,"abstract":"The discrete wavelet transform is used extensively as a basis for efficient digital image watermarking. However, most wavelets-based watermarking algorithms failed to provide perceptual transparency and robustness simultaneously, since these two watermarking requirements are conflicting requirements. In this paper, we treat the image watermarking problem as an optimization problem and solve it using genetic algorithms. Simulation results indicate optimal image watermarking is achieved only if the watermark is embedded in specific wavelet sub-bands and watermark- amplification values were used.","PeriodicalId":189871,"journal":{"name":"2008 First International Conference on the Applications of Digital Information and Web Technologies (ICADIWT)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123520101","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An Arabic Retrieval System with Native Language rather than SQL Queries","authors":"M. Otair, Raid Al-Sardi, Salah Al-Gialain","doi":"10.1109/ICADIWT.2008.4664323","DOIUrl":"https://doi.org/10.1109/ICADIWT.2008.4664323","url":null,"abstract":"The Arab users face several problems when they search information in the database. Writing SQL query in their natural language is a major problem. This problem leads to a strong need for an Arabic information retrieval system that would help the Arabic user in searching for the desired information without the need to write SQL queries. So, this paper presents an Arabic Retrieval System by Native Language rather than SQL Queries which is called Arabic Query Analyzer (AQA). In the other words, an AQA basically transforms Arabic query texts into SQL commands. The developed system has been fully implemented and tested and has shown tangible performance in retrieving database information using Arabic natural language.","PeriodicalId":189871,"journal":{"name":"2008 First International Conference on the Applications of Digital Information and Web Technologies (ICADIWT)","volume":"167 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125661221","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Navigation of robotic wheelchair based on fuzzy control","authors":"Khalid A. AI-Shalfan","doi":"10.1109/ICADIWT.2008.4664374","DOIUrl":"https://doi.org/10.1109/ICADIWT.2008.4664374","url":null,"abstract":"Precise vision-based navigation is very important in applications of robotics. In spite of many research efforts in the visual guidance of autonomous robotic wheelchairs have been devoted to road edge detection, the after-detection process, especially the physical interpretation of what had been detected, needs more investigation. In fact, there is a wide gap between the scene model built based on image processing algorithms and the physical model of the environment where the robotic wheelchair progress. In this paper, the subjective interaction between the scene model and the world model is investigated, and a visual control scheme for robot guidance is proposed that minimizes the model error induced by processing raw image data. The involved control system includes a fuzzy control system which uses the knowledge base information and the scene model to control the robot motion. On the other hand, the fuzzy control system is finely tuned through feed-backing mean square errors between the scene model parameters and the knowledge-base data. Finally, the fuzzy controller uses results of these calculations to home the robot on the planned path. This paper also shows the principle of this system and the simulation results confirming the feasibility of the approach.","PeriodicalId":189871,"journal":{"name":"2008 First International Conference on the Applications of Digital Information and Web Technologies (ICADIWT)","volume":"117 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134575297","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Collaborative filtering inspired from language modeling","authors":"Geoffray Bonnin, A. Brun, A. Boyer","doi":"10.1109/ICADIWT.2008.4664343","DOIUrl":"https://doi.org/10.1109/ICADIWT.2008.4664343","url":null,"abstract":"Recommender systems filter resources for a given user by predicting the most pertinent item given a specific context. This paper describes a new approach of generating suitable recommendations based on the active user's navigation stream. The underlying hypothesis is that the items order in the stream results from the intrinsic logic of the user's behavior. We show similarities between natural language and Internet navigation and put forward navigation specificities. We then design a new model that integrates advantages of statistical language models such as n-grams and triggers to compute recommendations. The resulting Sequence Based Recommender has been tested on Internet navigation artificial corpora.","PeriodicalId":189871,"journal":{"name":"2008 First International Conference on the Applications of Digital Information and Web Technologies (ICADIWT)","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116163901","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Hybrid canonical genetic algorithm and steepest descent algorithm for optimizing likelihood estimators of ARMA (1, 1) model","authors":"B. A. Hussain, R. D. Al-Dabbagh","doi":"10.1109/ICADIWT.2008.4664392","DOIUrl":"https://doi.org/10.1109/ICADIWT.2008.4664392","url":null,"abstract":"This paper presents a hybrid genetic algorithm (hGA) for optimizing the maximum likelihood function ln( L(phi1,thetas1)) of the mixed model ARMA(1,1). The presented hybrid genetic algorithm (hGA) couples two processes: the canonical genetic algorithm (cGA) composed of three main steps: selection, local recombination and mutation, with the local search algorithm represent by steepest descent algorithm (sDA) which is defined by three basic parameters: frequency, probability, and number of local search iterations. The experimental design is based on simulating the cGA ,hGA, and sDA algorithms with different values of model parameters, and sample sizen. The study contains comparison among these algorithms depending on MSE value. One can conclude that (hGA) can give good estimators (phi1,thetas1) of ARMA(1,1) parameters and more reliable than estimators obtained by cGA and sDA algorithm.","PeriodicalId":189871,"journal":{"name":"2008 First International Conference on the Applications of Digital Information and Web Technologies (ICADIWT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130801777","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Using nonnegative matrix factorization and concept lattice reduction to visualizing data","authors":"V. Snás̃el, H.M. Dahwa Abdulla, M. Polovincak","doi":"10.1109/ICADIWT.2008.4664362","DOIUrl":"https://doi.org/10.1109/ICADIWT.2008.4664362","url":null,"abstract":"The large volume of data from the large-scale computing platforms for high-fidelity design and simulations, and instrumentation for gathering scientific as well as business data, and huge information in the web, give us some problems if we want to compute all concepts from huge incidence matrix. In some cases, we do not need to compute all concepts, but only some of them. In this paper, we proposed minimizing incidence matrix by using non-negative matrix factorization (NMF), because non-negative matrix factorization (NMF) is an emerging technique with a wide spectrum of potential applications in biomedical data analysis. Modified matrix has lower dimensions and acts as an input for some known algorithms for lattice construction.","PeriodicalId":189871,"journal":{"name":"2008 First International Conference on the Applications of Digital Information and Web Technologies (ICADIWT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131004526","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}