With the increasing popularity of wireless sensor network and GPS technologies, uncertain data as a new type of data bring new challenge for the data processing methods. Data broadcasting is an effective means for data dissemination in mobile computing environment. Definition of the mean uncertainty ratio of data is presented and a broadcasting scheme UDBS is proposed for uncertain data dissemination. Simulation results show that UDBS can reduce the uncertainty of the broadcasted uncertain data effectively at the cost of minor increase in data access time, in the cases of single broadcast channel and multiple broadcast channels.
{"title":"Scheduling Uncertain Data Broadcast in Mobile Computing Environment","authors":"Huajie Xu, Guohui Li, Jianqiang Du","doi":"10.1109/ICINIS.2008.23","DOIUrl":"https://doi.org/10.1109/ICINIS.2008.23","url":null,"abstract":"With the increasing popularity of wireless sensor network and GPS technologies, uncertain data as a new type of data bring new challenge for the data processing methods. Data broadcasting is an effective means for data dissemination in mobile computing environment. Definition of the mean uncertainty ratio of data is presented and a broadcasting scheme UDBS is proposed for uncertain data dissemination. Simulation results show that UDBS can reduce the uncertainty of the broadcasted uncertain data effectively at the cost of minor increase in data access time, in the cases of single broadcast channel and multiple broadcast channels.","PeriodicalId":185739,"journal":{"name":"2008 First International Conference on Intelligent Networks and Intelligent Systems","volume":"45 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132758388","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}
Network mobility (NEMO) basic support protocol (NBS) enables mobile networks to work well under Internet, but leads to pinball routing problem. A MAP based route optimization scheme (MROS) is proposed to provide route optimization and reduce mobility management overhead for mobile networks. MROS uses MAP which is a mobility management technique in HMIPv6 to construct a hierarchical mobile network, MNpsilas registration cost is reduced with regional management. Moreover, a route optimization scheme is also introduced by MROS to eliminate pinball routing with regard to NBS.
{"title":"A MAP Based Route Optimization Scheme for Mobile Networks","authors":"Tianhan Gao, Nan Guo, Zhiliang Zhu","doi":"10.1109/ICINIS.2008.183","DOIUrl":"https://doi.org/10.1109/ICINIS.2008.183","url":null,"abstract":"Network mobility (NEMO) basic support protocol (NBS) enables mobile networks to work well under Internet, but leads to pinball routing problem. A MAP based route optimization scheme (MROS) is proposed to provide route optimization and reduce mobility management overhead for mobile networks. MROS uses MAP which is a mobility management technique in HMIPv6 to construct a hierarchical mobile network, MNpsilas registration cost is reduced with regional management. Moreover, a route optimization scheme is also introduced by MROS to eliminate pinball routing with regard to NBS.","PeriodicalId":185739,"journal":{"name":"2008 First International Conference on Intelligent Networks and Intelligent Systems","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122695537","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}
Combining kernel principal component analysis (KPCA) and support vector machines (SVM) in this study, we set up a KPCA-SVM model to predict the fineness of raw mill finished products. We conducted nonlinear feature extraction from the technological parameter samples of the raw mill by means of KPCA and obtained the feature principal components that are easier for regression operations. Thus, the number of input space dimensions that can lower the SVM was met. Then we conducted training by using the least squares support vector machines (LS-SVM). Finally, our computation results proved that the model proposed in this study can effectively predict the fineness of raw mill finished products.
{"title":"Predicting the Fineness of Raw Mill Finished Products on the Basis of KPCA-SVM","authors":"Shu Yunxing, Yun Shiwei, Ge Bo","doi":"10.1109/ICINIS.2008.48","DOIUrl":"https://doi.org/10.1109/ICINIS.2008.48","url":null,"abstract":"Combining kernel principal component analysis (KPCA) and support vector machines (SVM) in this study, we set up a KPCA-SVM model to predict the fineness of raw mill finished products. We conducted nonlinear feature extraction from the technological parameter samples of the raw mill by means of KPCA and obtained the feature principal components that are easier for regression operations. Thus, the number of input space dimensions that can lower the SVM was met. Then we conducted training by using the least squares support vector machines (LS-SVM). Finally, our computation results proved that the model proposed in this study can effectively predict the fineness of raw mill finished products.","PeriodicalId":185739,"journal":{"name":"2008 First International Conference on Intelligent Networks and Intelligent Systems","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121287608","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}
Supply chain management (GSCM) making the interactions between applications much easier, but the service delay and unstable network will block the whole business process. Replicated services are a good choice to resolve this problem. The transparency of information become increasingly important in the GSCM as a result of using caching, middleware and distributed database replication etc. technologies to improve the correctness of replicas in business operations. An efficient real-time replicas updating mechanism was proposed to maintain consistent and correct logistic and market information which was shared by all kinds of application systems in transnational enterprises. However, it is difficult for enterprise copies with local or remote original data source (ODS) object partial dependency relationships to maintain their consistency correctness and availableness. With these models, optimization of the correct copy inputs and switching time of each activity in a recursive routing are calculated to obtain the minimum total cost of the project. Finally, our results can be expanded for enterprise database replicas with correctness maintenance abilities.
{"title":"An Efficient Data Source Replicas Consistency Mechanism in Global Enterprise Firms","authors":"Ching-shun Hsieh, Shao-Shin Hung, Hui-ling Lin, Chin-Hsien Tseng, Jyh-Jong Tsay","doi":"10.1109/ICINIS.2008.87","DOIUrl":"https://doi.org/10.1109/ICINIS.2008.87","url":null,"abstract":"Supply chain management (GSCM) making the interactions between applications much easier, but the service delay and unstable network will block the whole business process. Replicated services are a good choice to resolve this problem. The transparency of information become increasingly important in the GSCM as a result of using caching, middleware and distributed database replication etc. technologies to improve the correctness of replicas in business operations. An efficient real-time replicas updating mechanism was proposed to maintain consistent and correct logistic and market information which was shared by all kinds of application systems in transnational enterprises. However, it is difficult for enterprise copies with local or remote original data source (ODS) object partial dependency relationships to maintain their consistency correctness and availableness. With these models, optimization of the correct copy inputs and switching time of each activity in a recursive routing are calculated to obtain the minimum total cost of the project. Finally, our results can be expanded for enterprise database replicas with correctness maintenance abilities.","PeriodicalId":185739,"journal":{"name":"2008 First International Conference on Intelligent Networks and Intelligent Systems","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116724937","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. Kurebayashi, H. Nishigaya, H. Murofushi, K. Eguchi
We describe a control board for an autonomous mobile robot with an arm as a teaching material we have developed and evaluation of it.Using our control board and programming language ldquoDolittlerdquo in technology education, we thought that students could learn systems that work with mechanics, electricity and computers through integrating manufacturing and programming. So we established a curriculum for junior high school students to learn systems we wanted to teach with an autonomous mobile robot with an arm as a teaching material. In this paper, we will report a conducted test to evaluate our lessons in a junior high school. As a result, our technology education curriculum satisfies requirements for students that have more incentive to learn the concept of systems.
{"title":"Development of an Autonomous Mobile Robot with an Arm as a Teaching Material","authors":"S. Kurebayashi, H. Nishigaya, H. Murofushi, K. Eguchi","doi":"10.1109/ICINIS.2008.177","DOIUrl":"https://doi.org/10.1109/ICINIS.2008.177","url":null,"abstract":"We describe a control board for an autonomous mobile robot with an arm as a teaching material we have developed and evaluation of it.Using our control board and programming language ldquoDolittlerdquo in technology education, we thought that students could learn systems that work with mechanics, electricity and computers through integrating manufacturing and programming. So we established a curriculum for junior high school students to learn systems we wanted to teach with an autonomous mobile robot with an arm as a teaching material. In this paper, we will report a conducted test to evaluate our lessons in a junior high school. As a result, our technology education curriculum satisfies requirements for students that have more incentive to learn the concept of systems.","PeriodicalId":185739,"journal":{"name":"2008 First International Conference on Intelligent Networks and Intelligent Systems","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116751986","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}
H. Donghong, Chen Wei, Wang Hao, Zhang Ling, Wang Ying
Based on the monitoring of satellite remote sensing images, a lot of big progresses have been made in environment analysis and researches about the Schistosome snail breeding ground and the distribution of snails in marshland. This paper focuses on the identification of the Schistosome snail individual goals. Based on the image segmentation by maximum inter-variance, the objects, including snails, are segmented from the background. The radius functions of the typical snails are calculated by scanning the boundary of the object with 8-neighborhood following method. By matching the waveform of Fourier transformation, the snail targets are identified. In the laboratory environment, the recognizing rate can reach over 90% and it has robust in rotation, scaling and translation.
{"title":"Snail Identification Based on Fourier Transformation","authors":"H. Donghong, Chen Wei, Wang Hao, Zhang Ling, Wang Ying","doi":"10.1109/ICINIS.2008.101","DOIUrl":"https://doi.org/10.1109/ICINIS.2008.101","url":null,"abstract":"Based on the monitoring of satellite remote sensing images, a lot of big progresses have been made in environment analysis and researches about the Schistosome snail breeding ground and the distribution of snails in marshland. This paper focuses on the identification of the Schistosome snail individual goals. Based on the image segmentation by maximum inter-variance, the objects, including snails, are segmented from the background. The radius functions of the typical snails are calculated by scanning the boundary of the object with 8-neighborhood following method. By matching the waveform of Fourier transformation, the snail targets are identified. In the laboratory environment, the recognizing rate can reach over 90% and it has robust in rotation, scaling and translation.","PeriodicalId":185739,"journal":{"name":"2008 First International Conference on Intelligent Networks and Intelligent Systems","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116791595","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}
Pub Date : 2008-11-01DOI: 10.1109/APCCAS.2008.4746397
Huahua Chen, Minhui Dong
3D map building is an important task of autonomous land vehicle (ALV) for obstacle detection, path planning. Traditional methods using stereo vision usually relies on dense disparity map obtained by stereo matching, and 3D map is built based on the disparity map. Traditional methods are sensitive to mismatch pixels in disparity map, and dense stereo matching increases lots of unnecessary computation. This paper proposes a novel 3D map building method based on projection of virtual height line (VHL). Unlike traditional methods, the proposed needn't obtain the disparity map, so it reduces the computation cost and can be highly real-time. Simulation and experimental result is given to show that the built 3D map reflects the actual scene basically and meets the need of ALV navigation.
{"title":"Local 3D Map Building Based on Projection of Virtual Height Line","authors":"Huahua Chen, Minhui Dong","doi":"10.1109/APCCAS.2008.4746397","DOIUrl":"https://doi.org/10.1109/APCCAS.2008.4746397","url":null,"abstract":"3D map building is an important task of autonomous land vehicle (ALV) for obstacle detection, path planning. Traditional methods using stereo vision usually relies on dense disparity map obtained by stereo matching, and 3D map is built based on the disparity map. Traditional methods are sensitive to mismatch pixels in disparity map, and dense stereo matching increases lots of unnecessary computation. This paper proposes a novel 3D map building method based on projection of virtual height line (VHL). Unlike traditional methods, the proposed needn't obtain the disparity map, so it reduces the computation cost and can be highly real-time. Simulation and experimental result is given to show that the built 3D map reflects the actual scene basically and meets the need of ALV navigation.","PeriodicalId":185739,"journal":{"name":"2008 First International Conference on Intelligent Networks and Intelligent Systems","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115457909","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}
Self-healing key distribution enables users in a large and dynamic group to establish session keys for secure group communication over an unreliable network. The main property of self-healing key distribution is that the users are capable of recovering lost session keys on their own, without requesting additional transmissions from the group manager. In this paper, we propose a self-healing key distribution scheme for unreliable networks with constrained bandwidth resources. Our scheme has the limited group membership property that there exists an upper bound on the number of members in the group. We show that our scheme has a better tradeoff between storage and communication overhead than some previous schemes.
{"title":"Self-Healing Key Distribution with Limited Group Membership Property","authors":"Ting Yuan, Jianqing Ma, Yiping Zhong, Shiyong Zhang","doi":"10.1109/ICINIS.2008.9","DOIUrl":"https://doi.org/10.1109/ICINIS.2008.9","url":null,"abstract":"Self-healing key distribution enables users in a large and dynamic group to establish session keys for secure group communication over an unreliable network. The main property of self-healing key distribution is that the users are capable of recovering lost session keys on their own, without requesting additional transmissions from the group manager. In this paper, we propose a self-healing key distribution scheme for unreliable networks with constrained bandwidth resources. Our scheme has the limited group membership property that there exists an upper bound on the number of members in the group. We show that our scheme has a better tradeoff between storage and communication overhead than some previous schemes.","PeriodicalId":185739,"journal":{"name":"2008 First International Conference on Intelligent Networks and Intelligent Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115767299","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}
We propose a distributed index based multi-resolution storage architecture (DIMSA) for data storage and retrieval at multiple levels of detail in wireless sensor networks. The proposed scheme could automatically retrieve subsets of the data in correspondence to the user defined level of detail to save energy. In addition, DIMSA deploys attribute allocation scheme to further reduce energy consumption in the condition that some attributes are included in many events. In this condition, traditional data-centric storage schemes consumes more energy because the values for these attributes have to be replicated and stored at different places in the network for each individual event. A distributed index scheme is also proposed to avoid query flooding and extra data transmission. Analysis and simulations are conducted to evaluate the performance of the proposed scheme. The results show that DIMSA outperforms the traditional data-centric storage scheme like GHT.
{"title":"A Distributed Index Based Multi-Resolution Data Storage Architecture in Wireless Sensor Networks","authors":"Liu Yan, Liu Kai, Ta Weiliang, Xu Ying","doi":"10.1109/ICINIS.2008.44","DOIUrl":"https://doi.org/10.1109/ICINIS.2008.44","url":null,"abstract":"We propose a distributed index based multi-resolution storage architecture (DIMSA) for data storage and retrieval at multiple levels of detail in wireless sensor networks. The proposed scheme could automatically retrieve subsets of the data in correspondence to the user defined level of detail to save energy. In addition, DIMSA deploys attribute allocation scheme to further reduce energy consumption in the condition that some attributes are included in many events. In this condition, traditional data-centric storage schemes consumes more energy because the values for these attributes have to be replicated and stored at different places in the network for each individual event. A distributed index scheme is also proposed to avoid query flooding and extra data transmission. Analysis and simulations are conducted to evaluate the performance of the proposed scheme. The results show that DIMSA outperforms the traditional data-centric storage scheme like GHT.","PeriodicalId":185739,"journal":{"name":"2008 First International Conference on Intelligent Networks and Intelligent Systems","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116197606","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}
Chunjian Xie, Kai Zhang, Kuisheng Feng, Chenjiang Guo, Jiadong Xu
Ultra-wideband synthetic aperture radar is interfered by ground clutter and artificial jamming. In many cases the targetpsilas scatter signal can be approximated as linear frequency modulated signals. Time-frequency Distribution, such as Winger-Ville distribution, provides a direct and effective analysis method of the time-frequency structures of linear frequency modulated signals. Meanwhile, the cross terms of the Winger-Ville distribution can be smoothed through the smoothed pseudo Winger-Ville distribution. Combine Hough transform the time-frequency concentration is improved and better precision of parameter estimation will be obtained. Target detecting and parameter estimation by the smoothed pseudo Winger-Ville distribution and Hough transform for frequency-modulated jamming are simulated in this paper. The method proved to be efficient for target detecting and parameter estimation of ultra-wideband synthetic aperture radar.
{"title":"Target Detecting Based on Improved WVD-HT for Radio Frequency Interference to UWB-SAR","authors":"Chunjian Xie, Kai Zhang, Kuisheng Feng, Chenjiang Guo, Jiadong Xu","doi":"10.1109/ICINIS.2008.173","DOIUrl":"https://doi.org/10.1109/ICINIS.2008.173","url":null,"abstract":"Ultra-wideband synthetic aperture radar is interfered by ground clutter and artificial jamming. In many cases the targetpsilas scatter signal can be approximated as linear frequency modulated signals. Time-frequency Distribution, such as Winger-Ville distribution, provides a direct and effective analysis method of the time-frequency structures of linear frequency modulated signals. Meanwhile, the cross terms of the Winger-Ville distribution can be smoothed through the smoothed pseudo Winger-Ville distribution. Combine Hough transform the time-frequency concentration is improved and better precision of parameter estimation will be obtained. Target detecting and parameter estimation by the smoothed pseudo Winger-Ville distribution and Hough transform for frequency-modulated jamming are simulated in this paper. The method proved to be efficient for target detecting and parameter estimation of ultra-wideband synthetic aperture radar.","PeriodicalId":185739,"journal":{"name":"2008 First International Conference on Intelligent Networks and Intelligent Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123081512","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
扫码关注我们
求助内容：
应助结果提醒方式：