2008 IEEE/ACS International Conference on Computer Systems and Applications最新文献

筛选
英文 中文
Active contours initialization for ultrasound carotid artery images 主动轮廓初始化超声颈动脉图像
2008 IEEE/ACS International Conference on Computer Systems and Applications Pub Date : 2008-03-31 DOI: 10.1109/AICCSA.2008.4493596
S. Moursi, M. El-Sakka
{"title":"Active contours initialization for ultrasound carotid artery images","authors":"S. Moursi, M. El-Sakka","doi":"10.1109/AICCSA.2008.4493596","DOIUrl":"https://doi.org/10.1109/AICCSA.2008.4493596","url":null,"abstract":"One of the major issues of active contouring methods is their sensitivity to the initial contour that is provided by the user. Unless it is drawn close enough to the actual contour, it may lead to unsatisfactory results. Thus, most active contour algorithms require considerable user interaction to provide a good initial contour. In this paper we present an efficient and fast rule- based algorithm for generating a good carotid artery initial contour from ultrasound images. Our algorithm reduces user interaction, as a user is only required to place a seed point inside the region of interest. Sensitivity, precision rate, and overlap ratio have been used to assess the amount of correlation between manually segmented lumens by an experienced clinician and by our algorithm, where the obtained 95% confidence interval of the mean value of these measures over all test cases are: [78.32% plusmn 1.98], [91.77% plusmn 1.96], and [72.68% plusmn 1.90], respectively. Furthermore, the output of our proposed scheme can be used as an input to any active contour algorithm to produce even better results.","PeriodicalId":234556,"journal":{"name":"2008 IEEE/ACS International Conference on Computer Systems and Applications","volume":"302 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131645197","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
An agent-based clustering algorithm using potential fields 一种基于代理的势场聚类算法
2008 IEEE/ACS International Conference on Computer Systems and Applications Pub Date : 2008-03-31 DOI: 10.1109/AICCSA.2008.4493586
M. Baghshah, S. Shouraki, C. Lucas
{"title":"An agent-based clustering algorithm using potential fields","authors":"M. Baghshah, S. Shouraki, C. Lucas","doi":"10.1109/AICCSA.2008.4493586","DOIUrl":"https://doi.org/10.1109/AICCSA.2008.4493586","url":null,"abstract":"In this paper, a novel clustering algorithm using an agent-based architecture along with a force-based clustering algorithm is proposed. To this end, a set of simple mobile agents that have limited processing power is used. These agents communicate in a pair- wise manner to exchange their position information. As opposed to the bio-inspired clustering algorithms that need a set of local rules to specify the agent movements, in this paper the agent motions are driven from attractive and repulsive potential fields that are created by the data points and the other agents respectively. Each agent moves according to the resulted force from applying the potential fields and announces its next position to the other agents. The movement of agents is continued until all of them reach equilibrium points.","PeriodicalId":234556,"journal":{"name":"2008 IEEE/ACS International Conference on Computer Systems and Applications","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127574783","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}
引用次数: 4
QoS monitoring framework for end-to-end service management in wired and wireless networks 用于有线和无线网络端到端业务管理的QoS监控框架
2008 IEEE/ACS International Conference on Computer Systems and Applications Pub Date : 2008-03-31 DOI: 10.1109/AICCSA.2008.4493661
M. Sidibé, A. Mehaoua
{"title":"QoS monitoring framework for end-to-end service management in wired and wireless networks","authors":"M. Sidibé, A. Mehaoua","doi":"10.1109/AICCSA.2008.4493661","DOIUrl":"https://doi.org/10.1109/AICCSA.2008.4493661","url":null,"abstract":"The explosive increasing amount of multimedia content to be offered in the Internet and the heterogeneity of the underlying networking technologies demand the provision of new QoS-enabled mechanisms and architecture to efficiently control, manage and monitor the networks. This paper first briefly introduces a complex system for multimedia content generation, transport and consumption, over heterogeneous network environment. This is developed in ENTHRONE I and II projects, where a central concept and subsystem is the ENTHRONE integrated management supervisor (EIMS). Then, the focus of the paper is to present a novel service oriented monitoring framework as an essential part of the EIMS. The proposed QoS monitoring system aims at providing service performance verification with respect to the QoS guarantees specified in contractual agreements between providers and users. This is achieved by not only monitoring services inside wired and wireless access/core networks but also at the customer side. The presented system also provides monitoring information to service providers for providing quantified QoS-based services and service assurance and to network providers for managing network resources.","PeriodicalId":234556,"journal":{"name":"2008 IEEE/ACS International Conference on Computer Systems and Applications","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127753597","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
Impact of fading wireless channel on the performance of game theoretic power control algorithms for CDMA wireless data 信道衰落对CDMA无线数据博弈论功率控制算法性能的影响
2008 IEEE/ACS International Conference on Computer Systems and Applications Pub Date : 2008-03-31 DOI: 10.1109/AICCSA.2008.4493552
M. Hayajneh, C. Abdallah, W. Ibrahim
{"title":"Impact of fading wireless channel on the performance of game theoretic power control algorithms for CDMA wireless data","authors":"M. Hayajneh, C. Abdallah, W. Ibrahim","doi":"10.1109/AICCSA.2008.4493552","DOIUrl":"https://doi.org/10.1109/AICCSA.2008.4493552","url":null,"abstract":"Our goal in this paper is to study the performance of the game-theoretic power control algorithms for wireless data introduced by Saraydar et al [1] in two realistic channels: (a1) fast flat fading channel and (a2) Slow flat fading channel. The fading coefficients under both (a1) and (a2) are studied under an appropriate small scale channel model that is used in the CDMA cellular systems, namely Nakagami channel model. To do so, we derive a closed- form expression of the average utility function which represents the number of bits received correctly at the receiver per one Joule expended. Then, using this expression we study the existence, uniqueness of Nash equilibrium (NE), and the social desirability of NE in the Pareto sense.","PeriodicalId":234556,"journal":{"name":"2008 IEEE/ACS International Conference on Computer Systems and Applications","volume":"282 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133263847","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
Measured delay distribution in a Wireless Mesh Network test-bed 无线网状网络试验台中测量的延迟分布
2008 IEEE/ACS International Conference on Computer Systems and Applications Pub Date : 2008-03-31 DOI: 10.1109/AICCSA.2008.4493540
N. Abuali, Essa Ekram, Ali Eljasmy, K. Shuaib
{"title":"Measured delay distribution in a Wireless Mesh Network test-bed","authors":"N. Abuali, Essa Ekram, Ali Eljasmy, K. Shuaib","doi":"10.1109/AICCSA.2008.4493540","DOIUrl":"https://doi.org/10.1109/AICCSA.2008.4493540","url":null,"abstract":"A lot of work has been done to evaluate the real time applications' performance over wireless networks. Some work focused on delay as a performance metric. However, no work studied the delay random behavior over a test-bed which imitates as much as possible actual operative networks. In this paper, we designed and run different experiments over heterogeneous 802.11 wireless mesh network (WMN) test-bed with a scope of studying the delay probability distribution over multihop WMN. We anticipate that by knowing the link delay distribution, we will be able to use this information to design sound algorithms to provide for QoS. For example, designing a partitioning algorithm capable of partitioning multiple end-to-end QoS requirements into link QoS requirements. We designed different experiments to measure the link and end-to-end delays over the WMN test-bed. The measured link delays are used to construct an empirical histogram. Our experiments reveal that irrespective of the number of hops along the paths and type of traffic crossing the link, the empirical histograms almost have same general shapes. The empirical histograms are fitted into different types of standard pdf distributions. We found that the best fits for almost 90% of the empirical distributions are two standard distributions: gamma and logistic.","PeriodicalId":234556,"journal":{"name":"2008 IEEE/ACS International Conference on Computer Systems and Applications","volume":"26 23","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133425739","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}
引用次数: 35
Intelligent heart disease prediction system using data mining techniques 基于数据挖掘技术的智能心脏病预测系统
2008 IEEE/ACS International Conference on Computer Systems and Applications Pub Date : 2008-03-31 DOI: 10.1109/AICCSA.2008.4493524
S. Palaniappan, Rafiah Awang
{"title":"Intelligent heart disease prediction system using data mining techniques","authors":"S. Palaniappan, Rafiah Awang","doi":"10.1109/AICCSA.2008.4493524","DOIUrl":"https://doi.org/10.1109/AICCSA.2008.4493524","url":null,"abstract":"The healthcare industry collects huge amounts of healthcare data which, unfortunately, are not \";mined\"; to discover hidden information for effective decision making. Discovery of hidden patterns and relationships often goes unexploited. Advanced data mining techniques can help remedy this situation. This research has developed a prototype Intelligent Heart Disease Prediction System (IHDPS) using data mining techniques, namely, Decision Trees, Naive Bayes and Neural Network. Results show that each technique has its unique strength in realizing the objectives of the defined mining goals. IHDPS can answer complex \";what if\"; queries which traditional decision support systems cannot. Using medical profiles such as age, sex, blood pressure and blood sugar it can predict the likelihood of patients getting a heart disease. It enables significant knowledge, e.g. patterns, relationships between medical factors related to heart disease, to be established. IHDPS is Web-based, user-friendly, scalable, reliable and expandable. It is implemented on the .NET platform.","PeriodicalId":234556,"journal":{"name":"2008 IEEE/ACS International Conference on Computer Systems and Applications","volume":"62 14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134428492","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}
引用次数: 841
Processing-delay reduction during the vertical handoff decision in heterogeneous wireless systems 异构无线系统垂直切换决策过程中的处理延迟降低
2008 IEEE/ACS International Conference on Computer Systems and Applications Pub Date : 2008-03-31 DOI: 10.1109/AICCSA.2008.4493561
R. Tawil, J. Demerjian, G. Pujolle, O. Gaitán
{"title":"Processing-delay reduction during the vertical handoff decision in heterogeneous wireless systems","authors":"R. Tawil, J. Demerjian, G. Pujolle, O. Gaitán","doi":"10.1109/AICCSA.2008.4493561","DOIUrl":"https://doi.org/10.1109/AICCSA.2008.4493561","url":null,"abstract":"Service continuity in heterogeneous wireless access technologies is a main issue. The challenge is to preserve continuous services while moving between these technologies. Making the decision to which network to switch (handoff) is one of the main key. In order to achieve the service continuity, we must rely on seamless vertical handoff techniques with a minimum processing-delay. In this paper we propose a vertical handoff decision scheme to enhance the service mobility using the simple additive weighting (SAW) method in a distributed manner, under heterogeneous environments. Our main goal is to reduce the overload and the processing-delay in the mobile terminal, by delegating the calculation of handoff metrics for network selection to the target visiting networks.","PeriodicalId":234556,"journal":{"name":"2008 IEEE/ACS International Conference on Computer Systems and Applications","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131840559","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}
引用次数: 21
MASCE: A Multi-Agent System for Collaborative E-Learning 协同电子学习的多智能体系统
2008 IEEE/ACS International Conference on Computer Systems and Applications Pub Date : 2008-03-31 DOI: 10.1109/AICCSA.2008.4493647
Hani M. K. Mahdi, S. S. Attia
{"title":"MASCE: A Multi-Agent System for Collaborative E-Learning","authors":"Hani M. K. Mahdi, S. S. Attia","doi":"10.1109/AICCSA.2008.4493647","DOIUrl":"https://doi.org/10.1109/AICCSA.2008.4493647","url":null,"abstract":"E-learning has become one of the most popular teaching methods in recent years. One of its modes is the blended learning where learners can read teaching materials asynchronously from a teaching website and collaborate with their peers, while providing for necessary face-to-face explanation, discussion, and physical operation in the classroom. In the computational intelligence field, the intelligent agent paradigm gained a tremendous interest in many application domains over the last two decades . This research project paper focuses on the use of intelligent agents in the sphere of e-learning education with the help of collaborative learning. Intelligent agents - the so called e-assistants or helper programs - can sit inside a computer and make the learning in e- learning happen dynamically to suit the need of the user. They can trap the user's likes and dislikes in various areas, the level of knowledge and the learning style and accordingly recommend the best matching helpers for collaboration. The paper introduces a multi-agent system for collaborative e-learning (MASCE). MASCE is to assist teaching and learning process and also to encourage collaborative learning among peers. This system shall be used in a blended learning environment as a supplement to the face-to-face lecture where students can use the system in the lab or from home after attending the traditional lecture in the faculty. The objective is to incorporate the intelligence of the multi- agent system (MAS) in a way that enables it to actively and intelligently support the educational processes, where multiple agents can interact to exchange information so that students may collaborate on how best to gain knowledge.","PeriodicalId":234556,"journal":{"name":"2008 IEEE/ACS International Conference on Computer Systems and Applications","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132650568","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}
引用次数: 12
When serializability comes without cost 当可序列化性无需成本时
2008 IEEE/ACS International Conference on Computer Systems and Applications Pub Date : 2008-03-31 DOI: 10.1109/AICCSA.2008.4493531
M. Alomari, Michael J. Cahill, A. Fekete, Uwe Röhm
{"title":"When serializability comes without cost","authors":"M. Alomari, Michael J. Cahill, A. Fekete, Uwe Röhm","doi":"10.1109/AICCSA.2008.4493531","DOIUrl":"https://doi.org/10.1109/AICCSA.2008.4493531","url":null,"abstract":"It is usually expected that performance is reduced by using stricter concurrency control, which reduces the risk of anomalies that can lead to data corruption. For example, the weak isolation level Read Committed allows anomalies that are prevented by two-phase locking (abbreviated 2PL), and because 2PL holds locks for longer than RC, it has lower throughput. We show that sometimes, guaranteed correctness can be obtained along with better throughput than RC, by use of the multiversion snapshot isolation mechanism along with modifications to application programs as proposed by Fekete et al. We investigate the conditions under which this effect occurs.","PeriodicalId":234556,"journal":{"name":"2008 IEEE/ACS International Conference on Computer Systems and Applications","volume":"78 7","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133139917","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
Enumeration of maximal clique for mining spatial co-location patterns 空间共位模式挖掘的最大团枚举
2008 IEEE/ACS International Conference on Computer Systems and Applications Pub Date : 2008-03-31 DOI: 10.1109/AICCSA.2008.4493526
Ghazi Al-Naymat
{"title":"Enumeration of maximal clique for mining spatial co-location patterns","authors":"Ghazi Al-Naymat","doi":"10.1109/AICCSA.2008.4493526","DOIUrl":"https://doi.org/10.1109/AICCSA.2008.4493526","url":null,"abstract":"This paper presents a systematic approach to mine co- location patterns in Sloan Digital Sky Survey (SDSS) data. SDSS Data Release 5 (DR5) contains 3.6 TB of data. Availability of such large amount of useful data is an opportunity for application of data mining techniques to generate interesting information. The major reason for the lack of such data mining applications in SDSS is the unavailability of data in a suitable format. This work illustrates a procedure to obtain additional galaxy types from an available attributes and transform the data into maximal cliques of galaxies which in turn can be used as transactions for data mining applications. An efficient algorithm GridClique is proposed to generate maximal cliques from large spatial databases. It should be noted that the full general problem of extracting a maximal clique from a graph is known as NP-Hard. The experimental results show that the GridClique algorithm successfully generates all maximal cliques in the SDSS data and enables the generation of useful co-location patterns.","PeriodicalId":234556,"journal":{"name":"2008 IEEE/ACS International Conference on Computer Systems and Applications","volume":"224 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122069781","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}
引用次数: 28
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学术官方微信
小红书