This article based on the actual university library business needs, using association rules to mining analysis universities Library students borrow data. First the library history borrowing data pretreatment, including data cleaning, data integration, data transformation and transaction database construction, Then the association rules mining algorithm MFP-Miner algorithm is applied to the transaction database, mining the association rules of borrowing books, for borrowing books and books recommended services providing scientific data support, so as to enhance the service quality of library.
{"title":"Borrowing Data Mining Based on Association Rules","authors":"Xiaojian Long, Yuchun Wu","doi":"10.1109/ICCSEE.2012.179","DOIUrl":"https://doi.org/10.1109/ICCSEE.2012.179","url":null,"abstract":"This article based on the actual university library business needs, using association rules to mining analysis universities Library students borrow data. First the library history borrowing data pretreatment, including data cleaning, data integration, data transformation and transaction database construction, Then the association rules mining algorithm MFP-Miner algorithm is applied to the transaction database, mining the association rules of borrowing books, for borrowing books and books recommended services providing scientific data support, so as to enhance the service quality of library.","PeriodicalId":132465,"journal":{"name":"2012 International Conference on Computer Science and Electronics Engineering","volume":"52 1-4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123458411","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}
On Dec. 10, 2010, the NIST declares the fore five algorithms for SHA-3 competition: Keccak, Skein, JH, Grøstl, BLAKE. In this paper, we introduce the five candidates. The news extension of BLAKE uses the Mode of LAKE. Grøstl follows the design principles of AES. JH uses the cycle structure of SPN. Keccak adopts the sealing sponge structure. SKEIN is a one-way function which is extended from the design of Three fish group password. After introducing and comparing the five candidates, we made a list of their respective characteristics.
{"title":"Explanation of Sha-3 Algorithm by the Third Round Activities","authors":"Fang Pang, Lili Liu","doi":"10.1109/ICCSEE.2012.225","DOIUrl":"https://doi.org/10.1109/ICCSEE.2012.225","url":null,"abstract":"On Dec. 10, 2010, the NIST declares the fore five algorithms for SHA-3 competition: Keccak, Skein, JH, Grøstl, BLAKE. In this paper, we introduce the five candidates. The news extension of BLAKE uses the Mode of LAKE. Grøstl follows the design principles of AES. JH uses the cycle structure of SPN. Keccak adopts the sealing sponge structure. SKEIN is a one-way function which is extended from the design of Three fish group password. After introducing and comparing the five candidates, we made a list of their respective characteristics.","PeriodicalId":132465,"journal":{"name":"2012 International Conference on Computer Science and Electronics Engineering","volume":"406 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123554818","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-D CFD model was built within the computational domain including the greenhouse and its surroundings. The turbulence transfer was described by the standard turbulence model at the near-wall region. DO radiation model was selected, and the tomato crop was described by the porous medium model. Comparing with the simulated values and the experimental values, the absolute error, average error, related average error and maximum related error of the inner temperature was 0.2°C~2.2°C, 0.91°C, 3.1%, 7.7%, respectively, and the related average error and maximum related error of the simulated values of the inner humidity was 6.4% and 16.6%, respectively.
{"title":"CFD Simulation of the Temperature and Humid Distribution for Natural Ventilated Modern Greenhouse","authors":"Xiaochan Wang, Guomin He, Yu Zhang","doi":"10.1109/ICCSEE.2012.181","DOIUrl":"https://doi.org/10.1109/ICCSEE.2012.181","url":null,"abstract":"3-D CFD model was built within the computational domain including the greenhouse and its surroundings. The turbulence transfer was described by the standard turbulence model at the near-wall region. DO radiation model was selected, and the tomato crop was described by the porous medium model. Comparing with the simulated values and the experimental values, the absolute error, average error, related average error and maximum related error of the inner temperature was 0.2°C~2.2°C, 0.91°C, 3.1%, 7.7%, respectively, and the related average error and maximum related error of the simulated values of the inner humidity was 6.4% and 16.6%, respectively.","PeriodicalId":132465,"journal":{"name":"2012 International Conference on Computer Science and Electronics Engineering","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126144523","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}
Yaohua Luo, Ke Guo, Da-Ming Wang, Zhongping Tao, Maozhi Wang, Z. Wang
Hyper spectral remote sensing has a great application in resources, environment, urban development and ecological balance and other aspects, one of the most important fields is for precise classification of features. Due to the hyper spectral remote sensing data has the characteristics of large data volume, the specific operation in the presence of long processing time problem. This paper focus on SAM algorithm and realize optimization based on the GPU parallel framework, and makes a system experiment on hyper spectral remote sensing images to prove the validity of this method.
{"title":"Hyperspectral Remote Sensing Classification Processing Parallel Computing Research Based on GPU","authors":"Yaohua Luo, Ke Guo, Da-Ming Wang, Zhongping Tao, Maozhi Wang, Z. Wang","doi":"10.1109/ICCSEE.2012.240","DOIUrl":"https://doi.org/10.1109/ICCSEE.2012.240","url":null,"abstract":"Hyper spectral remote sensing has a great application in resources, environment, urban development and ecological balance and other aspects, one of the most important fields is for precise classification of features. Due to the hyper spectral remote sensing data has the characteristics of large data volume, the specific operation in the presence of long processing time problem. This paper focus on SAM algorithm and realize optimization based on the GPU parallel framework, and makes a system experiment on hyper spectral remote sensing images to prove the validity of this method.","PeriodicalId":132465,"journal":{"name":"2012 International Conference on Computer Science and Electronics Engineering","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124806791","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 recent years, the problem of aging population of Japan is becoming increasingly severe, and the life of the elderly has become a focus of Japanese society. With worldwide popularity of the network, the daily life of the elderly will also develop in the direction to the network. From the point of view of designing, this paper states the feasibility of setting up a C2C (Consumer to Consumer) e-commerce system for the elderly in Japan by using the B/S (Browser/Server) computing mode, Dream weaver + ASP.NET + SQL Server/Oracle to implement system functions, and explains the process of the logistics and funds flow of commodity trading in the community. This system can provide a rich platform for elderly people the realization of e-commerce information exchange in the community.
近年来，日本人口老龄化问题日益严重，老年人的生活成为日本社会关注的焦点。随着网络在世界范围内的普及，老年人的日常生活也将朝着网络化的方向发展。本文从设计的角度阐述了采用B/S (Browser/Server)计算模式，dreamweaver + ASP，为日本老年人建立C2C (Consumer to Consumer)电子商务系统的可行性。NET + SQL Server/Oracle实现系统功能，并阐述了社区商品交易的物流和资金流过程。本系统可以为老年人在社区实现电子商务信息交流提供一个丰富的平台。
{"title":"The Construction of a Consumer to Consumer E-commerce System Based on Japanese Elderly Community","authors":"Ce Shi","doi":"10.1109/ICCSEE.2012.414","DOIUrl":"https://doi.org/10.1109/ICCSEE.2012.414","url":null,"abstract":"In recent years, the problem of aging population of Japan is becoming increasingly severe, and the life of the elderly has become a focus of Japanese society. With worldwide popularity of the network, the daily life of the elderly will also develop in the direction to the network. From the point of view of designing, this paper states the feasibility of setting up a C2C (Consumer to Consumer) e-commerce system for the elderly in Japan by using the B/S (Browser/Server) computing mode, Dream weaver + ASP.NET + SQL Server/Oracle to implement system functions, and explains the process of the logistics and funds flow of commodity trading in the community. This system can provide a rich platform for elderly people the realization of e-commerce information exchange in the community.","PeriodicalId":132465,"journal":{"name":"2012 International Conference on Computer Science and Electronics Engineering","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128667838","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}
As the development of the data acquisition technology, the research of the uncertain data has been the center of people's attention, and at the same time, the cluster of the uncertain data has been in use widely. In this paper, after studying the cluster of the uncertain data, considering characters of the uncertain data, we propose a improved algorithm. We called it En-DBSCAN. In order to adapt the request of uncertain data's clustering we add probability factors and the theory of information entropy. The algorithm brings in a conception of probability radius to adjust uncertain data's scope of EPS neighborhood and information entropy to reduce center point's indeterminacy. Besides, this paper gives an analysis and confirmation about the algorithm.
{"title":"A Density-Based Clustering Algorithm for Uncertain Data","authors":"Hongmei Wang, Yingying Wang, S. Wan","doi":"10.1109/ICCSEE.2012.91","DOIUrl":"https://doi.org/10.1109/ICCSEE.2012.91","url":null,"abstract":"As the development of the data acquisition technology, the research of the uncertain data has been the center of people's attention, and at the same time, the cluster of the uncertain data has been in use widely. In this paper, after studying the cluster of the uncertain data, considering characters of the uncertain data, we propose a improved algorithm. We called it En-DBSCAN. In order to adapt the request of uncertain data's clustering we add probability factors and the theory of information entropy. The algorithm brings in a conception of probability radius to adjust uncertain data's scope of EPS neighborhood and information entropy to reduce center point's indeterminacy. Besides, this paper gives an analysis and confirmation about the algorithm.","PeriodicalId":132465,"journal":{"name":"2012 International Conference on Computer Science and Electronics Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128720848","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, with corn as the research object, according to their physiological and morphological characteristics of corn to establish the appropriate model. In the modeling process, firstly, based on Green-Maize model to build the mode of corn production; Secondly, from the perspective of the establishment of its skeleton model, building the corn plant at different times to make a dynamic expression in key-frame technology; meanwhile, make use of the method of spline interpolation to draw the model of the corn leaf, the model makes the plant more vivid; Finally, I will add collision detection technology to the corn model, and use the key points storage to improve the time complexity of collision detection. This new method of the corn model improves the image more vivid, true and reliable. At the same time, the model can be widely applied to agricultural areas as well, which will greatly enhance the level of agricultural information.
{"title":"The Study of Corn Model Based on Collision Detection","authors":"Wei Zhao, Nan Jiang","doi":"10.1109/ICCSEE.2012.80","DOIUrl":"https://doi.org/10.1109/ICCSEE.2012.80","url":null,"abstract":"In this paper, with corn as the research object, according to their physiological and morphological characteristics of corn to establish the appropriate model. In the modeling process, firstly, based on Green-Maize model to build the mode of corn production; Secondly, from the perspective of the establishment of its skeleton model, building the corn plant at different times to make a dynamic expression in key-frame technology; meanwhile, make use of the method of spline interpolation to draw the model of the corn leaf, the model makes the plant more vivid; Finally, I will add collision detection technology to the corn model, and use the key points storage to improve the time complexity of collision detection. This new method of the corn model improves the image more vivid, true and reliable. At the same time, the model can be widely applied to agricultural areas as well, which will greatly enhance the level of agricultural information.","PeriodicalId":132465,"journal":{"name":"2012 International Conference on Computer Science and Electronics Engineering","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129594915","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}
To improve real-time performance and accuracy are key aspects of collision detection. In view of that conventional algorithms of collision detection spend a lot of detection time, this paper presents a advanced algorithm. We adapts a parallel method based on MPI. At the same time, we use temporal-spatial coherence and spatial subdivision algorithm. First, we subdivide the space into a series of voxels, and then we detect the state of the object. If the state is changed, we should build its list which is used to store its adjacent objects in voxel. We can begin with mark points. These mark points has independence, so the parallel method based on MPI can be used to speed up the collision detection. In a word, this algorithm reduces the times of collision detection and the traversing depth of the bounding box tree. The results of experiment prove that this method has real-time performance and superiority.
{"title":"Fast Collision Detection of Space-Time Correlation","authors":"Huiyan Qu, Zhao Wei","doi":"10.1109/ICCSEE.2012.231","DOIUrl":"https://doi.org/10.1109/ICCSEE.2012.231","url":null,"abstract":"To improve real-time performance and accuracy are key aspects of collision detection. In view of that conventional algorithms of collision detection spend a lot of detection time, this paper presents a advanced algorithm. We adapts a parallel method based on MPI. At the same time, we use temporal-spatial coherence and spatial subdivision algorithm. First, we subdivide the space into a series of voxels, and then we detect the state of the object. If the state is changed, we should build its list which is used to store its adjacent objects in voxel. We can begin with mark points. These mark points has independence, so the parallel method based on MPI can be used to speed up the collision detection. In a word, this algorithm reduces the times of collision detection and the traversing depth of the bounding box tree. The results of experiment prove that this method has real-time performance and superiority.","PeriodicalId":132465,"journal":{"name":"2012 International Conference on Computer Science and Electronics Engineering","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127105700","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 industry, the following problem is often faced: manager must depend on various factors such as production conditions, market price and profit to select the optimal production plan in many available production plan. This is actually a multiple objective decision-making problem. In this paper, we use fuzzy decision-making method to deal with this problem.
{"title":"Borda Method of Fuzzy Decision Making","authors":"Kai-qi Zou","doi":"10.1109/ICCSEE.2012.24","DOIUrl":"https://doi.org/10.1109/ICCSEE.2012.24","url":null,"abstract":"In industry, the following problem is often faced: manager must depend on various factors such as production conditions, market price and profit to select the optimal production plan in many available production plan. This is actually a multiple objective decision-making problem. In this paper, we use fuzzy decision-making method to deal with this problem.","PeriodicalId":132465,"journal":{"name":"2012 International Conference on Computer Science and Electronics Engineering","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127237941","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}
Wireless sensor network coverage to a large extent depends on the deployment of wireless sensor networks. We propose in this work an approach based on an optimized artificial fish-swarm algorithm for wireless sensor networks deployment optimization scheme in a wireless sensor network which is composed of fixed sensor nodes and some mobile sensor nodes. The OAFSA (Optimized Artificial Fish Swarm Algorithm) inherits the foraging and rear behavior of artificial fish in AFSA (Artificial Fish Swarm Algorithm), and optimizes the capacity of finding maximal objective function value. The simulation results show that our approach works better than the AFSA does in wireless sensor network coverage, which improves the network performance.
{"title":"Wireless Sensor Network Deployment Using an Optimized Artificial Fish Swarm Algorithm","authors":"Wang Yiyue, L. Hongmei, Hu Hengyang","doi":"10.1109/ICCSEE.2012.453","DOIUrl":"https://doi.org/10.1109/ICCSEE.2012.453","url":null,"abstract":"Wireless sensor network coverage to a large extent depends on the deployment of wireless sensor networks. We propose in this work an approach based on an optimized artificial fish-swarm algorithm for wireless sensor networks deployment optimization scheme in a wireless sensor network which is composed of fixed sensor nodes and some mobile sensor nodes. The OAFSA (Optimized Artificial Fish Swarm Algorithm) inherits the foraging and rear behavior of artificial fish in AFSA (Artificial Fish Swarm Algorithm), and optimizes the capacity of finding maximal objective function value. The simulation results show that our approach works better than the AFSA does in wireless sensor network coverage, which improves the network performance.","PeriodicalId":132465,"journal":{"name":"2012 International Conference on Computer Science and Electronics Engineering","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129109165","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
扫码关注我们
求助内容：
应助结果提醒方式：