发布求助
文献互助 智能选刊 最新文献

2008 First International Conference on the Applications of Digital Information and Web Technologies (ICADIWT)最新文献

筛选
英文 中文
Comparison between document-based, term-based and hybrid partitioning 基于文档、基于术语和混合分区之间的比较
2008 First International Conference on the Applications of Digital Information and Web Technologies (ICADIWT) Pub Date : 2008-10-31 DOI: 10.1109/ICADIWT.2008.4664324
A. Abusukhon, M. Oakes, M. Talib, A. M. Abdalla
{"title":"Comparison between document-based, term-based and hybrid partitioning","authors":"A. Abusukhon, M. Oakes, M. Talib, A. M. Abdalla","doi":"10.1109/ICADIWT.2008.4664324","DOIUrl":"https://doi.org/10.1109/ICADIWT.2008.4664324","url":null,"abstract":"Information retrieval (IR) systems for largescale data collections must build an index in order to provide efficient retrieval that meets the userpsilas needs. In distributed IR systems, query response time is affected by the way in which the data collection is partitioned across nodes. There are three types of collection partitioning; document-based partitioning (called the local index), term-based partitioning (called the global index) and hybrid partitioning. In this paper, we compare the three types of partitioning in terms of average query response time for a system with one broker and six other nodes. Our results showed that within our distributed IR system, the document-based and hybrid partitioning outperformed the term-based partitioning. However, unlike Xi et al. , we did not find that hybrid partitioning was any better than document-based partitioning in terms of average query response time.","PeriodicalId":189871,"journal":{"name":"2008 First International Conference on the Applications of Digital Information and Web Technologies (ICADIWT)","volume":"55 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":"125073775","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}
引用次数: 6
Experimental performance evaluation of Wireless 802.11b networks 无线802.11b网络的实验性能评估
2008 First International Conference on the Applications of Digital Information and Web Technologies (ICADIWT) Pub Date : 2008-10-31 DOI: 10.1109/ICADIWT.2008.4664335
Asma Bait Fadhah, Athra' Al-Lawati, Sara Al-Maskari, A. Touzene, Ahmed Al-Kindi
{"title":"Experimental performance evaluation of Wireless 802.11b networks","authors":"Asma Bait Fadhah, Athra' Al-Lawati, Sara Al-Maskari, A. Touzene, Ahmed Al-Kindi","doi":"10.1109/ICADIWT.2008.4664335","DOIUrl":"https://doi.org/10.1109/ICADIWT.2008.4664335","url":null,"abstract":"According to the IEEE 802.11 b/g standard (WiFi) should have a range of 300-500 ft (about 152 m). The 2.4 GHz frequency band used by WiFi devices is divided into 11 (in FCC) (or 13 in ETSI) partially overlapping channels. It is claimed that by using frequency bands that are at least four channels apart (non-overlapping channels) interference between those channels is avoided. We carried out two types of experiments to measure the effect of the distance and the claimed non-overlapping channels on the bit rate. From the first study, we experimentally derived a model of distance versus throughput. The second study has confirmed that the interference between the channels cannot be avoided even when using non-overlapping channels. The experiments also showed that by increasing the distance between the networks that are using non-overlapping channels, the effect of the interference decreases.","PeriodicalId":189871,"journal":{"name":"2008 First International Conference on the Applications of Digital Information and Web Technologies (ICADIWT)","volume":"59 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":"116556317","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}
引用次数: 10
MAVIE: A mobile agents view synchronization system MAVIE:移动代理视图同步系统
2008 First International Conference on the Applications of Digital Information and Web Technologies (ICADIWT) Pub Date : 2008-10-31 DOI: 10.1109/ICADIWT.2008.4664334
J. Akaichi, W. Oueslati
{"title":"MAVIE: A mobile agents view synchronization system","authors":"J. Akaichi, W. Oueslati","doi":"10.1109/ICADIWT.2008.4664334","DOIUrl":"https://doi.org/10.1109/ICADIWT.2008.4664334","url":null,"abstract":"Data warehouse view definitions are constructed thanks to information sources schemas. When these latter evolve, view definitions may become undefined. In this paper, we propose a system based on mobile agents destined to achieve view definitions repairing or synchronization following schema changes happened at distributed, heterogeneous and autonomous information sources. The proposed solution decreases the synchronization time thanks to parallelism permitted by agents, avoids network saturation by enhancing local processing and increase local intelligence.","PeriodicalId":189871,"journal":{"name":"2008 First International Conference on the Applications of Digital Information and Web Technologies (ICADIWT)","volume":"50 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":"126280220","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}
引用次数: 6
XML components ranking : Which relevant ranking criteria ? Which relevant criteria merging ? XML组件排序:哪些相关的排序标准?合并哪些相关标准?
2008 First International Conference on the Applications of Digital Information and Web Technologies (ICADIWT) Pub Date : 2008-10-31 DOI: 10.1109/ICADIWT.2008.4664347
Faïza Abbaci, P. Francq
{"title":"XML components ranking : Which relevant ranking criteria ? Which relevant criteria merging ?","authors":"Faïza Abbaci, P. Francq","doi":"10.1109/ICADIWT.2008.4664347","DOIUrl":"https://doi.org/10.1109/ICADIWT.2008.4664347","url":null,"abstract":"Retrieving specific information becomes an important issue, especially in XML information retrieval (XML-IR). Indexing XML components (elements) rather than the entire XML document allows to target more effectively the relevant elements. In this paper, we consider the problem of ranking the relevant components returned in response to a user query. As opposed to ranking documents, ranking XML elements introduces new criteria to take into account in determining the degree of relevance of a component, as for example the granularity of an XML component or the proximity of query keywords within the XML structure. Our aim is to answer two questions : Which criteria reflect best the relevance of an XML component? and how can these criteria be combined to obtain an efficient scoring function in order to calculate the degree of relevance of an XML component?","PeriodicalId":189871,"journal":{"name":"2008 First International Conference on the Applications of Digital Information and Web Technologies (ICADIWT)","volume":"6 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":"125987202","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}
引用次数: 5
The new statistical compression method: Multistream compression 新的统计压缩方法多流压缩
2008 First International Conference on the Applications of Digital Information and Web Technologies (ICADIWT) Pub Date : 2008-10-31 DOI: 10.1109/ICADIWT.2008.4664366
Jiřı́ Kochánek UniControls, Jan Lánský, Petr Uzel, M. Zemlicka
{"title":"The new statistical compression method: Multistream compression","authors":"Jiřı́ Kochánek UniControls, Jan Lánský, Petr Uzel, M. Zemlicka","doi":"10.1109/ICADIWT.2008.4664366","DOIUrl":"https://doi.org/10.1109/ICADIWT.2008.4664366","url":null,"abstract":"We present here a new statistical lossless data compression technique. Its performance is a bit higher than the one of arithmetic coding. It can be used in combination with other data transforms to create powerful compressing applications. According to our knowledge the principle, on which the method is built, is new. It is therefore likely that it will be an interesting topic for further research, testing, and improvements. The presented method can be often used as a replacement of some existing methods (Huffman and arithmetic coding) as it often gives better results. This method gives interesting results if applied as final phase of Burrows-Wheeler transform based compression. We suppose that it can be very useful in compression of document databases. It can be also used for image compression, for example as a step processing the output of discrete cosine transformation (after quantization) used in JPEG. The hardware support can highly benefit from the fact that this method can be efficiently pipelined what promises high throughput.","PeriodicalId":189871,"journal":{"name":"2008 First International Conference on the Applications of Digital Information and Web Technologies (ICADIWT)","volume":"56 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":"128391530","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}
引用次数: 3
Visualizing a multi-dimensional data set in a lower dimensional space 在低维空间中可视化多维数据集
2008 First International Conference on the Applications of Digital Information and Web Technologies (ICADIWT) Pub Date : 2008-10-31 DOI: 10.1109/ICADIWT.2008.4664363
Dong-Hun Seo, W. Lee
{"title":"Visualizing a multi-dimensional data set in a lower dimensional space","authors":"Dong-Hun Seo, W. Lee","doi":"10.1109/ICADIWT.2008.4664363","DOIUrl":"https://doi.org/10.1109/ICADIWT.2008.4664363","url":null,"abstract":"This paper presents a method of visualizing a multi-dimensional data set into a lower dimensional space, especially into a two-dimensional space, so that people can intuitively conceive the relations or the distance between the entities of the data. Kullback-Leibler divergence is used as the measure to evaluate the distance between the vectors of the probability distribution. The measured distance values are used to find the corresponding coordinates of the entities in a lower dimensional space. Here, the one variable stochastic simulated annealing (OVSSA) is employed as the optimization technique. Experiments show that this is a plausible way of visualizing the multi-dimensional data, letting people see the relations among the entities intuitively.","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":"130684902","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}
引用次数: 1
Using clustering to improve WLZ77 compression 使用聚类改进WLZ77压缩
2008 First International Conference on the Applications of Digital Information and Web Technologies (ICADIWT) Pub Date : 2008-10-31 DOI: 10.1109/ICADIWT.2008.4664364
J. Platoš, J. Dvorský, J. Martinovič
{"title":"Using clustering to improve WLZ77 compression","authors":"J. Platoš, J. Dvorský, J. Martinovič","doi":"10.1109/ICADIWT.2008.4664364","DOIUrl":"https://doi.org/10.1109/ICADIWT.2008.4664364","url":null,"abstract":"Many types of information retrieval systems (IRS) are created and more and more documents are stored in them too. The fundamental process of IRS is building of textual database, and compression of the documents stored in the database. One possibility for compression of textual data is word-based compression. Several algorithms for word-based compression algorithms based on Huffman encoding, LZW or BWT algorithm was proposed. In this paper, we describe word-based compression method based on LZ77 algorithm. IRS can also perform cluster analysis of textual database to improve quality of answers to userspsila queries. The information retrieved from the clustering can be very helpful in compression. Word-based compression using information about cluster hierarchy is presented in this paper. Experimental results which are provided at the end of the paper were achieved not only using well-known word-based compression algorithms WBW and WLZW but also using quite new WLZ77 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":"131378534","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}
引用次数: 6
Non-intrusive QoS monitoring and analysis for self-healing web services 用于自修复web服务的非侵入性QoS监控和分析
2008 First International Conference on the Applications of Digital Information and Web Technologies (ICADIWT) Pub Date : 2008-10-31 DOI: 10.1109/ICADIWT.2008.4664408
R. Ben Halima, K. Guennoun, K. Drira, M. Jmaiel
{"title":"Non-intrusive QoS monitoring and analysis for self-healing web services","authors":"R. Ben Halima, K. Guennoun, K. Drira, M. Jmaiel","doi":"10.1109/ICADIWT.2008.4664408","DOIUrl":"https://doi.org/10.1109/ICADIWT.2008.4664408","url":null,"abstract":"Monitoring and analysis of QoS are crucial steps for the provisioning of self-healing Web services and for managing web service-based distributed interactive applications. Dealing with these issues becomes even more challenging when applications are dynamically built by composition of distributed services involving different service providers. In this case, assuming access to the internal logic and its implementation within the composed Web services is not realistic. In this paper, we propose an architectural framework for monitoring and analysis of QoS driven by models for QoS analysis. This framework has been implemented and experimented for the web service technology within the European WS-DIAMOND project. We consider the general context where only SOAP messages between web services are monitored. The main novelty of our approach is, on the one hand, to provide a generic application-independent framework. On the other hand, we provide models allowing QoS deficiencies to be detected and considered as an indicator of the health degradation of the monitored Web services.","PeriodicalId":189871,"journal":{"name":"2008 First International Conference on the Applications of Digital Information and Web Technologies (ICADIWT)","volume":"10 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":"114978497","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}
引用次数: 18
Implementation of the image logging server for web forensics 实现了用于web取证的图像日志服务器
2008 First International Conference on the Applications of Digital Information and Web Technologies (ICADIWT) Pub Date : 2008-10-31 DOI: 10.1109/ICADIWT.2008.4664317
S. Yoo, Yilhyeong Mun, D. Cho
{"title":"Implementation of the image logging server for web forensics","authors":"S. Yoo, Yilhyeong Mun, D. Cho","doi":"10.1109/ICADIWT.2008.4664317","DOIUrl":"https://doi.org/10.1109/ICADIWT.2008.4664317","url":null,"abstract":"Development of the computer and the Internet got user convenience, however it brought new dysfunction of the computer crime. Finally, this occurred the criminal who has a specified purpose and it became a big obstacle that check development of information-oriented society. Hereupon, a corresponded information protection technology was situated by measure that judge individualpsilas private life protection and country competitive power. And in present, an information protection technology is very important.These information protection technology were connected to constant development of a fire wall and an intrusion detection system. However the technology of a computer forensic is not with activity about collecting of evidences of damage systems, a recovery and an analysis. In this paper, implement multi thread TCP server which stores the image files of the Web URL pages of the same time that is recorded and makes log files. As a evidence about the computer cyber crime, we suggest the image log file that is digital forensics.","PeriodicalId":189871,"journal":{"name":"2008 First International Conference on the Applications of Digital Information and Web Technologies (ICADIWT)","volume":"101 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":"116371788","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}
引用次数: 3
Management rules optimization for software development based on System Dynamics and Swarm intelligence 基于系统动力学和群体智能的软件开发管理规则优化
2008 First International Conference on the Applications of Digital Information and Web Technologies (ICADIWT) Pub Date : 2008-10-31 DOI: 10.1109/ICADIWT.2008.4664352
Jiann-Horng Lin, Hsiu-Cheng Liu
{"title":"Management rules optimization for software development based on System Dynamics and Swarm intelligence","authors":"Jiann-Horng Lin, Hsiu-Cheng Liu","doi":"10.1109/ICADIWT.2008.4664352","DOIUrl":"https://doi.org/10.1109/ICADIWT.2008.4664352","url":null,"abstract":"Software research and development has to take considerable costs and time. For traditional decision making, the experience of managers is a crucial key to make accurate decisions. In contrast, modern entrepreneurs employ database and statistical model to determine efficiently favorable strategies. The main goal of this study is to build system equation models by limited but informational data and to transform observed mathematical results into pragmatic plans for decision makers. Here we apply the simulation of system dynamics to build Abdel-Hamidpsilas dynamics model and to create pseudo-outcomes requisite for iteration method of particle swarm optimization (PSO), and then to search the optimization solution by PSO algorithm. The results seem to indicate that PSO algorithm is competitive with other evolutionary algorithms, and can be successfully applied to more data mining domains.","PeriodicalId":189871,"journal":{"name":"2008 First International Conference on the Applications of Digital Information and Web Technologies (ICADIWT)","volume":"26 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":"116435176","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}
引用次数: 0
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信