The peak volume characteristics are of great significance to transportation planning, design, and management. However, the amount of researches conducted on the subject of site-to-site variability of the peak volume characteristics is relatively limited, which largely restrict the identification of appropriate peak volume factor and other pertinent parameters in traffic analysis. This paper discussed the site-to-site variability of the peak volume in Shanghai in detail based on three-year data. In this paper, 49 automatic traffic recorder stations at intersections were selected to collect traffic data in the central city of Shanghai from 2006 to 2008. The statistical characteristics of a.m. peak hour volume and peak period volume were then analyzed based on the data of intersections and approaches, respectively. The relationship between peak hour factors (or the ratios of peak hour volume to peak period volume) and volume, location, and road class were obtained by linear regressions. It was concluded that the peak volume characteristics varied from site to site evidently. Furthermore, the peak volume characteristics of intersections and of approaches were different. Lastly, the significant influencing factors were different for intersections and for approaches.
{"title":"Peak Volume Characteristics of Urban Road Intersections: Case in Shanghai","authors":"Lianghui Qian, Xiaohong Chen","doi":"10.1109/ICCNT.2010.82","DOIUrl":"https://doi.org/10.1109/ICCNT.2010.82","url":null,"abstract":"The peak volume characteristics are of great significance to transportation planning, design, and management. However, the amount of researches conducted on the subject of site-to-site variability of the peak volume characteristics is relatively limited, which largely restrict the identification of appropriate peak volume factor and other pertinent parameters in traffic analysis. This paper discussed the site-to-site variability of the peak volume in Shanghai in detail based on three-year data. In this paper, 49 automatic traffic recorder stations at intersections were selected to collect traffic data in the central city of Shanghai from 2006 to 2008. The statistical characteristics of a.m. peak hour volume and peak period volume were then analyzed based on the data of intersections and approaches, respectively. The relationship between peak hour factors (or the ratios of peak hour volume to peak period volume) and volume, location, and road class were obtained by linear regressions. It was concluded that the peak volume characteristics varied from site to site evidently. Furthermore, the peak volume characteristics of intersections and of approaches were different. Lastly, the significant influencing factors were different for intersections and for approaches.","PeriodicalId":135847,"journal":{"name":"2010 Second International Conference on Computer and Network Technology","volume":"698 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121924073","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}
Biological data is huge and increasing rapidly therefore data storing and mining will become major challenges. We have encountered several key problems related to limitations in the database management system (DBMS) used and information retrieval in our in-house Monogenean-host database. In this paper we will be presenting the ontology developed that is specific to our dataset using semantic technology to overcome these problems. Our Taxonomy ontology is built based on accepted taxonomic classification system and semantic key identifier therefore problems in information retrieval are minimized. Our focus is on the images used in taxonomy and how to retrieve them based on semantic identifiers.
{"title":"Semantic Technology: An Efficient Approach to Monogenean Information Retrieval","authors":"Alfred S, Arpah A, L. H. S. Li, Sarinder K K S","doi":"10.1109/ICCNT.2010.127","DOIUrl":"https://doi.org/10.1109/ICCNT.2010.127","url":null,"abstract":"Biological data is huge and increasing rapidly therefore data storing and mining will become major challenges. We have encountered several key problems related to limitations in the database management system (DBMS) used and information retrieval in our in-house Monogenean-host database. In this paper we will be presenting the ontology developed that is specific to our dataset using semantic technology to overcome these problems. Our Taxonomy ontology is built based on accepted taxonomic classification system and semantic key identifier therefore problems in information retrieval are minimized. Our focus is on the images used in taxonomy and how to retrieve them based on semantic identifiers.","PeriodicalId":135847,"journal":{"name":"2010 Second International Conference on Computer and Network Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131115671","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}
Production scheduling in multiple-stage multiple- machine multiple-product environment is a NP hard problem usually faced by make/engineer-to-order companies engaged in capital goods Industry. Feasible schedules must correctly sequence the operations required to manufacture components and also satisfy assembly precedence relationships. This paper presents the development of Artificial Bee Colony algorithm for solving the scheduling problem. Based on Just in time philosophy, the proposed algorithm was designed to minimise the combination of earliness and tardiness penalties cost. The computational experiment was conducted using data obtained from a collaborating company that manufactures complex capital goods. The aim was to investigate the influence of parameter configuration on the algorithm performance. The analysis of variance on the experimental results indicated that the performance can be improved dramatically after adopting the optimum parameter setting.
{"title":"Identifying Optimum Artificial Bee Colony (ABC) Algorithm's Parameters for Scheduling the Manufacture and Assembly of Complex Products","authors":"Primpika Pansuwan, Niyada Rukwong, P. Pongcharoen","doi":"10.1109/ICCNT.2010.25","DOIUrl":"https://doi.org/10.1109/ICCNT.2010.25","url":null,"abstract":"Production scheduling in multiple-stage multiple- machine multiple-product environment is a NP hard problem usually faced by make/engineer-to-order companies engaged in capital goods Industry. Feasible schedules must correctly sequence the operations required to manufacture components and also satisfy assembly precedence relationships. This paper presents the development of Artificial Bee Colony algorithm for solving the scheduling problem. Based on Just in time philosophy, the proposed algorithm was designed to minimise the combination of earliness and tardiness penalties cost. The computational experiment was conducted using data obtained from a collaborating company that manufactures complex capital goods. The aim was to investigate the influence of parameter configuration on the algorithm performance. The analysis of variance on the experimental results indicated that the performance can be improved dramatically after adopting the optimum parameter setting.","PeriodicalId":135847,"journal":{"name":"2010 Second International Conference on Computer and Network Technology","volume":"172 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133829789","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}
One approach to securing radio signals in wireless sensor networks is frequency hopping in which transmitters and receivers change frequencies at a predetermined interval using a pattern of frequencies that is programmed a priori or calculated dynamically via ashared seeding mechanism. For these systems, if an adversary can physically capture a node in the network and steal the seed or hopping set, it can compromise the network. To protect against this weakness, we propose Signal Strength Seed Frequency Hopping, a hopping set selection scheme in which the seed used to calculate a dynamic hopping set is generated using signal strength measurements collected after the network has been deployed. We show our scheme has sufficient stochasticity to produce hopping sets that cannot be easily reproduced by an adversary.
{"title":"Signal Strength Seeded Frequency Hopping","authors":"Robert Kelley, Anup Kumar, Bin Xie, Xianqian Liu","doi":"10.1109/ICCNT.2010.83","DOIUrl":"https://doi.org/10.1109/ICCNT.2010.83","url":null,"abstract":"One approach to securing radio signals in wireless sensor networks is frequency hopping in which transmitters and receivers change frequencies at a predetermined interval using a pattern of frequencies that is programmed a priori or calculated dynamically via ashared seeding mechanism. For these systems, if an adversary can physically capture a node in the network and steal the seed or hopping set, it can compromise the network. To protect against this weakness, we propose Signal Strength Seed Frequency Hopping, a hopping set selection scheme in which the seed used to calculate a dynamic hopping set is generated using signal strength measurements collected after the network has been deployed. We show our scheme has sufficient stochasticity to produce hopping sets that cannot be easily reproduced by an adversary.","PeriodicalId":135847,"journal":{"name":"2010 Second International Conference on Computer and Network Technology","volume":"269 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133886099","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}
The novelty of the paper is the comparison between the inverse dynamic solution based on Lagrangian formulation and the direct dynamic solution of the Stewart platform by simulation with ADAMS commercial engineering package. In this paper, based on the inverse kinematics, the Jacobian matrix and the dynamic equations of the six-degree-of-freedom Stewart platform are derived. The Inertia matrix and Coriolis-Centrifugal terms which are essential for control analyzing of this robot are also obtained. Finally, the results of the analytical solution using Lagrange method for a specific movement path which is simulated by ADAMS are compared and verified.
{"title":"Analyzing and Simulating the Inverse and the Direct Dynamics of Parallel Robot Stewart Platform","authors":"Hamidreza Hajimirzaalian, H. Moosavi, M. Massah","doi":"10.1109/ICCNT.2010.84","DOIUrl":"https://doi.org/10.1109/ICCNT.2010.84","url":null,"abstract":"The novelty of the paper is the comparison between the inverse dynamic solution based on Lagrangian formulation and the direct dynamic solution of the Stewart platform by simulation with ADAMS commercial engineering package. In this paper, based on the inverse kinematics, the Jacobian matrix and the dynamic equations of the six-degree-of-freedom Stewart platform are derived. The Inertia matrix and Coriolis-Centrifugal terms which are essential for control analyzing of this robot are also obtained. Finally, the results of the analytical solution using Lagrange method for a specific movement path which is simulated by ADAMS are compared and verified.","PeriodicalId":135847,"journal":{"name":"2010 Second International Conference on Computer and Network Technology","volume":"216 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134318599","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 presents th implementation decisions to be made when th choice is between protocols that involve distance vector or link state or the combination of both. Here a comparison is made between different parameters and a detailed simulation study is performed on the network with different routing protocols and it has been shown that EIGRP provides a better network convergence time, less bandwidth requirements and better CPU and memory utilization compared to OSPF and RIP. EIGRP, OSPF and RIP are the dynamic routing protocols being used in the practical networks to propagat network topology information to the neighboring routers. There have been a large number of static and dynamic routing protocols available but choice of the right protocol for routing is dependent on many parameters critical being network convergence time, scalability, memory and CPU requirements, security and bandwidth requirement etc.
{"title":"Dynamic Routing Protocol Implementation Decision between EIGRP, OSPF and RIP Based on Technical Background Using OPNET Modeler","authors":"Sheela Ganesh Thorenoor","doi":"10.1109/ICCNT.2010.66","DOIUrl":"https://doi.org/10.1109/ICCNT.2010.66","url":null,"abstract":"This paper presents th implementation decisions to be made when th choice is between protocols that involve distance vector or link state or the combination of both. Here a comparison is made between different parameters and a detailed simulation study is performed on the network with different routing protocols and it has been shown that EIGRP provides a better network convergence time, less bandwidth requirements and better CPU and memory utilization compared to OSPF and RIP. EIGRP, OSPF and RIP are the dynamic routing protocols being used in the practical networks to propagat network topology information to the neighboring routers. There have been a large number of static and dynamic routing protocols available but choice of the right protocol for routing is dependent on many parameters critical being network convergence time, scalability, memory and CPU requirements, security and bandwidth requirement etc.","PeriodicalId":135847,"journal":{"name":"2010 Second International Conference on Computer and Network Technology","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126680267","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}
In this paper, a distributed fusion filtering problem for a linear discrete-time dynamic system with uncertainty is considered. All fusion filtering algorithms are based on fusion formulas which represent a weighted sum of the local Kalman estimates with matrix or scalar weights. The fusion weights are calculated by using four algorithms: convex combination, optimal fusion, covariance intersection, and median fusion. The comparison results of the fusion algorithms are discussed in terms of estimation accuracy and computation cost.
{"title":"Comparison of Distributed Fusion Filters for Linear Dynamic System with Uncertainty","authors":"J. Yoon, S. Bae, V. Shin","doi":"10.1109/ICCNT.2010.71","DOIUrl":"https://doi.org/10.1109/ICCNT.2010.71","url":null,"abstract":"In this paper, a distributed fusion filtering problem for a linear discrete-time dynamic system with uncertainty is considered. All fusion filtering algorithms are based on fusion formulas which represent a weighted sum of the local Kalman estimates with matrix or scalar weights. The fusion weights are calculated by using four algorithms: convex combination, optimal fusion, covariance intersection, and median fusion. The comparison results of the fusion algorithms are discussed in terms of estimation accuracy and computation cost.","PeriodicalId":135847,"journal":{"name":"2010 Second International Conference on Computer and Network Technology","volume":"380 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114890450","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}
Crushing energy has to sufficiently be absorbed in order to save the protections of passengers in a car accident. There have been a set of studies on the crushing energy absorption of a fundamental construction in automobiles. In this paper, the purpose concerns the crashworthiness of the widely used vehicle structure, triangular thin-walled tubes with ±45º and 0/90º fiber orientation. An experimental investigation was carried out to study the energy absorption characteristics of thin-walled triangular tubes subjected to quasi-static axial loading to develop the optimum structural members. Notch shapes and structure modification applied to structural design have nowadays been used to keep up the efficiency of energy absorption. Such ideas may result in the reduction of structural stiffness and buckling or collapse can easily be done in impact. Four different numbers of layers (4, 6, 8 and 10) by using woven roving glass fiber/ epoxy E-600 with two fiber orientation ±45º and 0/90º
{"title":"Energy Absorption of Thin-Walled Composite Tubes Subjected under Quasi-static Compression","authors":"H. Al-Qrimli, H. S. Aljibori, F. M.","doi":"10.1109/ICCNT.2010.101","DOIUrl":"https://doi.org/10.1109/ICCNT.2010.101","url":null,"abstract":"Crushing energy has to sufficiently be absorbed in order to save the protections of passengers in a car accident. There have been a set of studies on the crushing energy absorption of a fundamental construction in automobiles. In this paper, the purpose concerns the crashworthiness of the widely used vehicle structure, triangular thin-walled tubes with ±45º and 0/90º fiber orientation. An experimental investigation was carried out to study the energy absorption characteristics of thin-walled triangular tubes subjected to quasi-static axial loading to develop the optimum structural members. Notch shapes and structure modification applied to structural design have nowadays been used to keep up the efficiency of energy absorption. Such ideas may result in the reduction of structural stiffness and buckling or collapse can easily be done in impact. Four different numbers of layers (4, 6, 8 and 10) by using woven roving glass fiber/ epoxy E-600 with two fiber orientation ±45º and 0/90º","PeriodicalId":135847,"journal":{"name":"2010 Second International Conference on Computer and Network Technology","volume":"242 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114999128","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}
Man has always tried to make new systems, which can do his difficult tasks. Manage and control of such new complex systems is new challenge in our life. Today, one solution to deal with this challenge is using advantage of features of autonomy. It means that instead of managing and controlling the entire system, each component or at least part of the system can manage or control itself even in unpredictable situations. In this paper, we proposed a new algorithm, is named “self-configurable particle swarm optimization algorithm (SCPSO)”. This method can control a system without outside observers in decentralize fashion. Each particle can makes decision to find optimum position for itself even when there is not enough information from whole system. By this method, particles can work autonomously even in unpredictable situations. We examine our proposed algorithm in both static and dynamic environments. This algorithm is a good method for using in disaster management or crisis management. Results show this method is a successful, especially in communication less environments.
{"title":"Using Self-Configurable Particle Swarm Optimization for Allocation Position of Rescue Robots","authors":"F. S. Fard, H. Parvar, M. Shiri, Ehsan Soleimani","doi":"10.1109/ICCNT.2010.15","DOIUrl":"https://doi.org/10.1109/ICCNT.2010.15","url":null,"abstract":"Man has always tried to make new systems, which can do his difficult tasks. Manage and control of such new complex systems is new challenge in our life. Today, one solution to deal with this challenge is using advantage of features of autonomy. It means that instead of managing and controlling the entire system, each component or at least part of the system can manage or control itself even in unpredictable situations. In this paper, we proposed a new algorithm, is named “self-configurable particle swarm optimization algorithm (SCPSO)”. This method can control a system without outside observers in decentralize fashion. Each particle can makes decision to find optimum position for itself even when there is not enough information from whole system. By this method, particles can work autonomously even in unpredictable situations. We examine our proposed algorithm in both static and dynamic environments. This algorithm is a good method for using in disaster management or crisis management. Results show this method is a successful, especially in communication less environments.","PeriodicalId":135847,"journal":{"name":"2010 Second International Conference on Computer and Network Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130409161","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 put forward a new method of the fuzzy rules and wavelet neural network model for mid-long term load forecasting. The neural call function is basis of nonlinear wavelets. We overcome the shortcoming of single train set of fuzzy rules. It can be seen from the example this method can improve effectively the forecast accuracy and speed. The forecast model was tested and the result showed that it was an effective way to forecast mid-long term electric load.
{"title":"A Fuzzy Rules and Wavelet Neural Network Method for Mid-long-term Electric Load Forecasting","authors":"Qian Zhang, Tongna Liu","doi":"10.1109/ICCNT.2010.106","DOIUrl":"https://doi.org/10.1109/ICCNT.2010.106","url":null,"abstract":"This paper put forward a new method of the fuzzy rules and wavelet neural network model for mid-long term load forecasting. The neural call function is basis of nonlinear wavelets. We overcome the shortcoming of single train set of fuzzy rules. It can be seen from the example this method can improve effectively the forecast accuracy and speed. The forecast model was tested and the result showed that it was an effective way to forecast mid-long term electric load.","PeriodicalId":135847,"journal":{"name":"2010 Second International Conference on Computer and Network Technology","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130566539","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
扫码关注我们
求助内容：
应助结果提醒方式：