Routing problem is a serious concern of road safety in Hazmat transportation due to their accident impacts. A number of mathematical models have been developed to determine the route of hazmat transportation to minimize the risk and impacts and solution approach have been considered regarding to their characteristics such as network size and type of variables. In this paper, mathematical models and type of variables in hazmat routing problem have been studied and different approaches of solving the problem have been analyzed. Results show that both size of network and type of variables have significant effects on solution approach. When the size of network is getting large, the solving approach tends to heuristic methods because of running time and when the variables are getting to uncertainty, exact solution approaches are rarely used because of the difficulties in modeling procedure. Results also show that the type of objective functions including bi-level, two-stage, and utility, considered regarding to decision makers, causes significant effects on solution approach.
{"title":"The Effects of Network Size and Variables on Solution Approach in Hazmat Routing Problems","authors":"S. Seyedhosseini, A. Mahmoudabadi","doi":"10.1109/ICCNT.2010.72","DOIUrl":"https://doi.org/10.1109/ICCNT.2010.72","url":null,"abstract":"Routing problem is a serious concern of road safety in Hazmat transportation due to their accident impacts. A number of mathematical models have been developed to determine the route of hazmat transportation to minimize the risk and impacts and solution approach have been considered regarding to their characteristics such as network size and type of variables. In this paper, mathematical models and type of variables in hazmat routing problem have been studied and different approaches of solving the problem have been analyzed. Results show that both size of network and type of variables have significant effects on solution approach. When the size of network is getting large, the solving approach tends to heuristic methods because of running time and when the variables are getting to uncertainty, exact solution approaches are rarely used because of the difficulties in modeling procedure. Results also show that the type of objective functions including bi-level, two-stage, and utility, considered regarding to decision makers, causes significant effects on solution approach.","PeriodicalId":135847,"journal":{"name":"2010 Second International Conference on Computer and Network Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128105033","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}
This paper describes ontological description of computational agents, their properties and abilities. The goal of the work is to allow for autonomous behavior and semi-automatic composition of agents within a multi-agent system. The system has to be create foundation for the interchangeability of computational components, and emergence of new models. This paper focuses on ways of representing agents and systems in standard formalisms, such as description logics, OWL, and Jade.
{"title":"Ontology Description of Jade Computational Agents in OWL-DL","authors":"Roman Neruda","doi":"10.1109/ICCNT.2010.116","DOIUrl":"https://doi.org/10.1109/ICCNT.2010.116","url":null,"abstract":"This paper describes ontological description of computational agents, their properties and abilities. The goal of the work is to allow for autonomous behavior and semi-automatic composition of agents within a multi-agent system. The system has to be create foundation for the interchangeability of computational components, and emergence of new models. This paper focuses on ways of representing agents and systems in standard formalisms, such as description logics, OWL, and Jade.","PeriodicalId":135847,"journal":{"name":"2010 Second International Conference on Computer and Network Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114202423","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}
An enhanced ant colony optimization technique for jobs and resources scheduling in grid computing is proposed in this paper. The proposed technique combines the techniques from Ant Colony System and Max – Min Ant System and focused on local pheromone trail update and trail limit. The agent concept is also integrated in this proposed technique for the purpose of updating the grid resource table. This facilitates in scheduling jobs to available resources efficiently which will enable jobs to be processed in minimum time and also balance all the resource in grid system.
{"title":"Grid Load Balancing Using Ant Colony Optimization","authors":"Husna Jamal Abdul Nasir, K. Ku-Mahamud","doi":"10.1109/ICCNT.2010.10","DOIUrl":"https://doi.org/10.1109/ICCNT.2010.10","url":null,"abstract":"An enhanced ant colony optimization technique for jobs and resources scheduling in grid computing is proposed in this paper. The proposed technique combines the techniques from Ant Colony System and Max – Min Ant System and focused on local pheromone trail update and trail limit. The agent concept is also integrated in this proposed technique for the purpose of updating the grid resource table. This facilitates in scheduling jobs to available resources efficiently which will enable jobs to be processed in minimum time and also balance all the resource in grid system.","PeriodicalId":135847,"journal":{"name":"2010 Second International Conference on Computer and Network Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120832347","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}
Advance Encryption Standard (AES), has received significant interest over the past decade due to its performance and security level. In this paper, we propose a compact 8-bit AES crypto-processor for area constrained and low power applications where both encryption and decryption is needed. The cycle count of the design is the least among previously reported 8-bit AES architectures and the throughput is 203 Mbps. The AES core consumes 5.6k gates in 0.18 μm standard-cell CMOS technology. The power consumption of the core is 49 μW/MHz at 128 MHz which is the minimum power reported thus far.
{"title":"A Compact 8-Bit AES Crypto-processor","authors":"F. Haghighizadeh, H. Attarzadeh, M. Sharifkhani","doi":"10.1109/ICCNT.2010.50","DOIUrl":"https://doi.org/10.1109/ICCNT.2010.50","url":null,"abstract":"Advance Encryption Standard (AES), has received significant interest over the past decade due to its performance and security level. In this paper, we propose a compact 8-bit AES crypto-processor for area constrained and low power applications where both encryption and decryption is needed. The cycle count of the design is the least among previously reported 8-bit AES architectures and the throughput is 203 Mbps. The AES core consumes 5.6k gates in 0.18 μm standard-cell CMOS technology. The power consumption of the core is 49 μW/MHz at 128 MHz which is the minimum power reported thus far.","PeriodicalId":135847,"journal":{"name":"2010 Second International Conference on Computer and Network Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124039858","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}
S. Nandagopalan, B. Adiga, C. Dhanalakshmi, N. Deepak
Accurate analysis of 2D echocardiographic images is vital for diagnosis and treatment of heart related diseases. For this task, extraction of cardiac borders must be carried out. In particular, automatic quantitative measurements of Left Ventricle (LV), Right Ventricle (RV), Left Atrium (LA), Right Atrium, Valve size, etc. are essential. We believe that automatic processing of these echo images could speed up the clinical decisions and reduce human error. In this paper we focus on automatic segmentation of echocardiographic images of different views (Long Axis View, Short Axis View, Apical 4-chamber View) to extract ventricle and atrium borders for detecting heart abnormalities. A novel approach of combining the K-Means clustering algorithm for segmentation and active contour model for boundary detection is proposed. Since conventional K-Means implementation is not time efficient, we propose a novel algorithm called fast K-Means SQL based on (i) TRUNCATE-INSERT instead of DELETE-INSERT for table updates (ii) denormalized database design and tuning (iii) minimal table joins, to accelerate the image segmentation. Thus, with this approach an image of resolution 400×250 takes just 16 seconds, whereas the conventional method takes 950 seconds. After the operator selects the initial contour in the appropriate part of the echocardiographic image, the deformable contour (snake) converges to the boundaries of the region of interest (ROI). Once the shape of the ventricle or atrium is extracted, we apply coordinate geometry to compute all the necessary parameters required for clinical decision. Normally, ultrasound images are embedded with speckle noise; hence we first apply median filter and then the image segmentation. Experiments are conducted using relatively large set of images obtained from a cardiology hospital. The results show that our proposed method is computationally efficient and 2D measurements are accurate.
{"title":"Automatic Segmentation and Ventricular Border Detection of 2D Echocardiographic Images Combining K-Means Clustering and Active Contour Model","authors":"S. Nandagopalan, B. Adiga, C. Dhanalakshmi, N. Deepak","doi":"10.1109/ICCNT.2010.110","DOIUrl":"https://doi.org/10.1109/ICCNT.2010.110","url":null,"abstract":"Accurate analysis of 2D echocardiographic images is vital for diagnosis and treatment of heart related diseases. For this task, extraction of cardiac borders must be carried out. In particular, automatic quantitative measurements of Left Ventricle (LV), Right Ventricle (RV), Left Atrium (LA), Right Atrium, Valve size, etc. are essential. We believe that automatic processing of these echo images could speed up the clinical decisions and reduce human error. In this paper we focus on automatic segmentation of echocardiographic images of different views (Long Axis View, Short Axis View, Apical 4-chamber View) to extract ventricle and atrium borders for detecting heart abnormalities. A novel approach of combining the K-Means clustering algorithm for segmentation and active contour model for boundary detection is proposed. Since conventional K-Means implementation is not time efficient, we propose a novel algorithm called fast K-Means SQL based on (i) TRUNCATE-INSERT instead of DELETE-INSERT for table updates (ii) denormalized database design and tuning (iii) minimal table joins, to accelerate the image segmentation. Thus, with this approach an image of resolution 400×250 takes just 16 seconds, whereas the conventional method takes 950 seconds. After the operator selects the initial contour in the appropriate part of the echocardiographic image, the deformable contour (snake) converges to the boundaries of the region of interest (ROI). Once the shape of the ventricle or atrium is extracted, we apply coordinate geometry to compute all the necessary parameters required for clinical decision. Normally, ultrasound images are embedded with speckle noise; hence we first apply median filter and then the image segmentation. Experiments are conducted using relatively large set of images obtained from a cardiology hospital. The results show that our proposed method is computationally efficient and 2D measurements are accurate.","PeriodicalId":135847,"journal":{"name":"2010 Second International Conference on Computer and Network Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124270709","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}
Image projection is usually associated with image enlargement projected on screen or large display devices. The objective of this paper is to achieve sharper image projection and thinner transition over the edge. Tchebichef moment has been chosen here since it performs better than the popular Discrete Cosine Transform. This transform integrates a simplified mathematical framework technique using matrices, as well as a block-wise reconstruction technique. The result shows Tchebichef moment gives better image projection over the edge on graphical and real images.
{"title":"Image Projection over the Edge","authors":"N. A. Abu, Wong Siaw Lang, S. Sahib","doi":"10.1109/ICCNT.2010.54","DOIUrl":"https://doi.org/10.1109/ICCNT.2010.54","url":null,"abstract":"Image projection is usually associated with image enlargement projected on screen or large display devices. The objective of this paper is to achieve sharper image projection and thinner transition over the edge. Tchebichef moment has been chosen here since it performs better than the popular Discrete Cosine Transform. This transform integrates a simplified mathematical framework technique using matrices, as well as a block-wise reconstruction technique. The result shows Tchebichef moment gives better image projection over the edge on graphical and real images.","PeriodicalId":135847,"journal":{"name":"2010 Second International Conference on Computer and Network Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124390604","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}
with the amount of text data stored in relational databases growing rapidly, the need of the user to search such information is dramatically going up. Many existing approaches focus on finding a tuple matching a keyword query and return the result as a joining network of tuples of one or more tables. In this paper, we formulate an answer aggregation of keyword search over relational databases problem which merges related joining tuples from multiple tables to a single tuple to reduce redundancy in the results and improve the search quality. We developed an approach which exploits the tuple identity information for merging tuples rather than scanning throughout the results to find the common values. We further proposed a pruning algorithm which greatly reduces the number of redundant results after merging. We have conducted experiments extensively on two well-known databases (DBLP and IMDB). The experimental results show that the number of tuples in the results was dramatically reduced which noticeably improved the search quality while the merging time and the pruning time were relatively low when compared to the searching time.
{"title":"Answer Aggregation for Keyword Search over Relational Databases","authors":"Utharn Buranasaksee, Kriengkrai Porkaew, Umaporn Supasitthimethee","doi":"10.1109/ICCNT.2010.130","DOIUrl":"https://doi.org/10.1109/ICCNT.2010.130","url":null,"abstract":"with the amount of text data stored in relational databases growing rapidly, the need of the user to search such information is dramatically going up. Many existing approaches focus on finding a tuple matching a keyword query and return the result as a joining network of tuples of one or more tables. In this paper, we formulate an answer aggregation of keyword search over relational databases problem which merges related joining tuples from multiple tables to a single tuple to reduce redundancy in the results and improve the search quality. We developed an approach which exploits the tuple identity information for merging tuples rather than scanning throughout the results to find the common values. We further proposed a pruning algorithm which greatly reduces the number of redundant results after merging. We have conducted experiments extensively on two well-known databases (DBLP and IMDB). The experimental results show that the number of tuples in the results was dramatically reduced which noticeably improved the search quality while the merging time and the pruning time were relatively low when compared to the searching time.","PeriodicalId":135847,"journal":{"name":"2010 Second International Conference on Computer and Network Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122557081","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}
Haptic sensory feedback has been shown to complement the visual and auditory senses, improve user performance and provide a greater sense of togetherness in collaborative and interactive virtual environments. However, we are faced with numerous challenges when deploying these systems over the present day Internet. The most significant of these challenges are the network performance limitations of the Wide Area Networks. In this paper, we offer a structured examination of the current challenges in the deployment of haptic-based distributed systems by analyzing the recent advances in the understanding of these challenges and the progress that has been made to overcome them.
{"title":"Challenges in the Deployment of Visuo-Haptic Virtual Environments on the Internet","authors":"Jonathan Norman, Felix G. Hamza-Lup","doi":"10.1109/ICCNT.2010.88","DOIUrl":"https://doi.org/10.1109/ICCNT.2010.88","url":null,"abstract":"Haptic sensory feedback has been shown to complement the visual and auditory senses, improve user performance and provide a greater sense of togetherness in collaborative and interactive virtual environments. However, we are faced with numerous challenges when deploying these systems over the present day Internet. The most significant of these challenges are the network performance limitations of the Wide Area Networks. In this paper, we offer a structured examination of the current challenges in the deployment of haptic-based distributed systems by analyzing the recent advances in the understanding of these challenges and the progress that has been made to overcome them.","PeriodicalId":135847,"journal":{"name":"2010 Second International Conference on Computer and Network Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126329088","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}
Peer-to-peer media streaming is a scalable way to multicast real-time contents toward a large number of peers. In multi-stream streaming systems such as P2PTV, peers continuously switch between media streams at a high rate. This leads to data loss, data propagation delay, and overlay reconstruction. In this paper, we propose a mechanism to make a multi-stream peer-to-peer media streaming system resilient to stream switching. This mechanism theoretically limits overlay switching rate and synchronizes overlay departures/joins. Our simulation experiment show the mechanism effectively prevents the delay and loss penalties caused by stream switching.
{"title":"Stream Switching Resilience in P2P Streaming","authors":"Narges Zeighami, J. Mirabedini, S. Jabbehdari","doi":"10.1109/ICCNT.2010.14","DOIUrl":"https://doi.org/10.1109/ICCNT.2010.14","url":null,"abstract":"Peer-to-peer media streaming is a scalable way to multicast real-time contents toward a large number of peers. In multi-stream streaming systems such as P2PTV, peers continuously switch between media streams at a high rate. This leads to data loss, data propagation delay, and overlay reconstruction. In this paper, we propose a mechanism to make a multi-stream peer-to-peer media streaming system resilient to stream switching. This mechanism theoretically limits overlay switching rate and synchronizes overlay departures/joins. Our simulation experiment show the mechanism effectively prevents the delay and loss penalties caused by stream switching.","PeriodicalId":135847,"journal":{"name":"2010 Second International Conference on Computer and Network Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125229711","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}
Safety topic as the same as many topics in transportation system, impresses many factors and is influenced by the other factors. In Iran the most attention was concentrated in executive engineering activities and it was conceived that with only physical adjustments, accident rate will be reduced. In recently years identification and remedying of Accident prone zones was considered by experts, but only experiments of experts and a few present statistics were criteria which define that a section is accident prone or not, whereas many affective criteria like accident prone antecedent, accidents severity and geometric, physical and traffic condition had not been utilized. This paper effort is based on identification and definition of accident prone criteria, weighting to each criterion and at least assigns accident prone number and designs a prioritization model for accident prone zones. In identification of effective criteria, Delphi method, and in constructing prioritization model, multiple criteria decision making methods are used. Although at the end of this paper a set of points will be prioritized with the proposed model.
{"title":"A Proposed Model for Determining and Giving Priority to Accident Prone Zones (Black Spot)","authors":"H. Zoghi, Mojtaba Hajali, Meisam Dirin","doi":"10.1109/ICCNT.2010.77","DOIUrl":"https://doi.org/10.1109/ICCNT.2010.77","url":null,"abstract":"Safety topic as the same as many topics in transportation system, impresses many factors and is influenced by the other factors. In Iran the most attention was concentrated in executive engineering activities and it was conceived that with only physical adjustments, accident rate will be reduced. In recently years identification and remedying of Accident prone zones was considered by experts, but only experiments of experts and a few present statistics were criteria which define that a section is accident prone or not, whereas many affective criteria like accident prone antecedent, accidents severity and geometric, physical and traffic condition had not been utilized. This paper effort is based on identification and definition of accident prone criteria, weighting to each criterion and at least assigns accident prone number and designs a prioritization model for accident prone zones. In identification of effective criteria, Delphi method, and in constructing prioritization model, multiple criteria decision making methods are used. Although at the end of this paper a set of points will be prioritized with the proposed model.","PeriodicalId":135847,"journal":{"name":"2010 Second International Conference on Computer and Network Technology","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125244306","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：