Pub Date : 2011-12-01DOI: 10.1109/ICCSNT.2011.6182088
Wei‐Jei Song, Ming Li
This design has proposed and achieved a kind of intellectualized MCU integrated development environment based on GCC technology. It stands at the angle of “system” and uses the “top-down” method to carry on project design. Moreover, this development environment has introduced “the hierarchical software design thought” to achieve the goal of standardizing user code and improving the development efficiency. By using this development environment to carry on project design, users can spare more energy at user logic realization and develop high quality code efficiently and quickly; when introduced into teaching, this design could decrease the difficulty of studying MCU principle course and help students to form the standardized programming habits and learn good programming method.
{"title":"Intellectualized MCU integrated development environment based on GCC technology","authors":"Wei‐Jei Song, Ming Li","doi":"10.1109/ICCSNT.2011.6182088","DOIUrl":"https://doi.org/10.1109/ICCSNT.2011.6182088","url":null,"abstract":"This design has proposed and achieved a kind of intellectualized MCU integrated development environment based on GCC technology. It stands at the angle of “system” and uses the “top-down” method to carry on project design. Moreover, this development environment has introduced “the hierarchical software design thought” to achieve the goal of standardizing user code and improving the development efficiency. By using this development environment to carry on project design, users can spare more energy at user logic realization and develop high quality code efficiently and quickly; when introduced into teaching, this design could decrease the difficulty of studying MCU principle course and help students to form the standardized programming habits and learn good programming method.","PeriodicalId":303186,"journal":{"name":"Proceedings of 2011 International Conference on Computer Science and Network Technology","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134333875","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 : 2011-12-01DOI: 10.1109/ICCSNT.2011.6182051
Zhang Dong, Zhicheng Xie
Microblogs are very popular large-scale communication social networks nowadays in China. In order to study the characteristics of Sina Microblogs, we collect a large amount of users' data based on the Sina Microblogs and place them in the database. Using these data, we visualize the Microblogs network model and create a complex network model. We study Sina Microblogs' network properties through the data of the complex network model, such as nodes, links, degrees clustering coefficient and average distance. Then we analyse the similarity and difference between Sina and Twitter. The visualization of complex network helps users easily identify the central node and the edge area, so that information would be spread more effective and quickly in the shortest possible time through the specified node. So we discuss this method to deal with emergences especially natural disasters.
{"title":"Analysis and research on microblogging network model based on crawler data","authors":"Zhang Dong, Zhicheng Xie","doi":"10.1109/ICCSNT.2011.6182051","DOIUrl":"https://doi.org/10.1109/ICCSNT.2011.6182051","url":null,"abstract":"Microblogs are very popular large-scale communication social networks nowadays in China. In order to study the characteristics of Sina Microblogs, we collect a large amount of users' data based on the Sina Microblogs and place them in the database. Using these data, we visualize the Microblogs network model and create a complex network model. We study Sina Microblogs' network properties through the data of the complex network model, such as nodes, links, degrees clustering coefficient and average distance. Then we analyse the similarity and difference between Sina and Twitter. The visualization of complex network helps users easily identify the central node and the edge area, so that information would be spread more effective and quickly in the shortest possible time through the specified node. So we discuss this method to deal with emergences especially natural disasters.","PeriodicalId":303186,"journal":{"name":"Proceedings of 2011 International Conference on Computer Science and Network Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134408653","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 : 2011-12-01DOI: 10.1109/ICCSNT.2011.6181997
Yang Zhang, J. Grossschadl
Public-Key Cryptography (PKC) is essential to ensure the authenticity and confidentiality of communication in open computer networks such as the Internet. While RSA is still the most widely used public-key cryptosystem today, it can be expected that Elliptic Curve Cryptography (ECC) will continue to gain importance and become the de-facto standard for PKC in the emerging “Internet of Things.” ECC is particularly attractive for use in resource-restricted devices (e.g. wireless sensor nodes, RFID tags) due to its high level of security per bit, which allows for shorter keys compared to RSA. The performance of elliptic curve cryptosystems is primarily determined by the efficiency of certain arithmetic operations (especially multiplication and squaring) in the underlying finite field. In the present paper, we introduce a high-speed implementation of arithmetic in Optimal Prime Fields (OPFs) for the ATmega128, an 8-bit processor used in a number of sensor nodes including the MICAz mote. An OPF is defined by a prime of the form p = u · 2k +v, whereby u and v are small compared to 2k; in our implementation u is a 16-bit integer and v = 1. A special property of these primes is their low Hamming weight since only a few bits near the MSB and LSB are one. We describe an optimized variant of Montgomery multiplication, based on Gura et al's hybrid technique, that takes the low weight of such primes into account to minimize execution time. Our implementation for the ATmega128 is able to perform a multiplication in a 160-bit OPF in 3,532 clock cycles, which represents a new speed record for 160-bit modular multiplication on an 8-bit processor.
{"title":"Efficient prime-field arithmetic for elliptic curve cryptography on wireless sensor nodes","authors":"Yang Zhang, J. Grossschadl","doi":"10.1109/ICCSNT.2011.6181997","DOIUrl":"https://doi.org/10.1109/ICCSNT.2011.6181997","url":null,"abstract":"Public-Key Cryptography (PKC) is essential to ensure the authenticity and confidentiality of communication in open computer networks such as the Internet. While RSA is still the most widely used public-key cryptosystem today, it can be expected that Elliptic Curve Cryptography (ECC) will continue to gain importance and become the de-facto standard for PKC in the emerging “Internet of Things.” ECC is particularly attractive for use in resource-restricted devices (e.g. wireless sensor nodes, RFID tags) due to its high level of security per bit, which allows for shorter keys compared to RSA. The performance of elliptic curve cryptosystems is primarily determined by the efficiency of certain arithmetic operations (especially multiplication and squaring) in the underlying finite field. In the present paper, we introduce a high-speed implementation of arithmetic in Optimal Prime Fields (OPFs) for the ATmega128, an 8-bit processor used in a number of sensor nodes including the MICAz mote. An OPF is defined by a prime of the form p = u · 2k +v, whereby u and v are small compared to 2k; in our implementation u is a 16-bit integer and v = 1. A special property of these primes is their low Hamming weight since only a few bits near the MSB and LSB are one. We describe an optimized variant of Montgomery multiplication, based on Gura et al's hybrid technique, that takes the low weight of such primes into account to minimize execution time. Our implementation for the ATmega128 is able to perform a multiplication in a 160-bit OPF in 3,532 clock cycles, which represents a new speed record for 160-bit modular multiplication on an 8-bit processor.","PeriodicalId":303186,"journal":{"name":"Proceedings of 2011 International Conference on Computer Science and Network Technology","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131155151","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 : 2011-12-01DOI: 10.1109/ICCSNT.2011.6182351
Wang Shishui
With a high priority in database development and application, database query algorithm is especially important for complex data processing in deep level. Aiming at accomplishing queries for multi-level users, a new iterative query algorithm is proposed on top of the recursive algorithms. This algorithm starts from choosing a root node, which taken as the only entry and exit of the algorithm. Then it traverses to all the related nodes from the root node and the corresponding data processing will be conducted. Finally ,through the experiment, the algorithm is verified and its performance is evaluated
{"title":"Base on the database inquiry algorithm of the recursion research and realizes","authors":"Wang Shishui","doi":"10.1109/ICCSNT.2011.6182351","DOIUrl":"https://doi.org/10.1109/ICCSNT.2011.6182351","url":null,"abstract":"With a high priority in database development and application, database query algorithm is especially important for complex data processing in deep level. Aiming at accomplishing queries for multi-level users, a new iterative query algorithm is proposed on top of the recursive algorithms. This algorithm starts from choosing a root node, which taken as the only entry and exit of the algorithm. Then it traverses to all the related nodes from the root node and the corresponding data processing will be conducted. Finally ,through the experiment, the algorithm is verified and its performance is evaluated","PeriodicalId":303186,"journal":{"name":"Proceedings of 2011 International Conference on Computer Science and Network Technology","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133572169","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 : 2011-12-01DOI: 10.1109/ICCSNT.2011.6182417
Lijuan Yang, Zongtian Liu, Fang Zhu, Yang Zhao
For the difference between the traditional ontology and event ontology, this paper proposes a new event ontology storage mode and implements an event ontology system to manage the event ontology. The experiments show that the proposed mode has a higher query efficiency and lower data redundancy comparing to the XML storage mode. In addition, the new storage mode can preserve integrate semantic information of the event.
{"title":"The storage mode and query strategy for event ontology","authors":"Lijuan Yang, Zongtian Liu, Fang Zhu, Yang Zhao","doi":"10.1109/ICCSNT.2011.6182417","DOIUrl":"https://doi.org/10.1109/ICCSNT.2011.6182417","url":null,"abstract":"For the difference between the traditional ontology and event ontology, this paper proposes a new event ontology storage mode and implements an event ontology system to manage the event ontology. The experiments show that the proposed mode has a higher query efficiency and lower data redundancy comparing to the XML storage mode. In addition, the new storage mode can preserve integrate semantic information of the event.","PeriodicalId":303186,"journal":{"name":"Proceedings of 2011 International Conference on Computer Science and Network Technology","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132454823","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 : 2011-12-01DOI: 10.1109/ICCSNT.2011.6182055
Qian Yi, Zhu Xiao-rong
In this paper, a low noise amplifier (LNA) with a newly architecture of fully integrated common-source is designed based on TSMC 0.35 µm CMOS process, which worked at the frequency of 2.45 GHz. For input matching, LC parallel network is used instead of the traditional large inductor, and a capacitor is paralleled on the gate. Simulation results with LNA design shows that the newly architecture can conducive to the input matching and can reduce noise and power.
{"title":"The design of a 2.45 GHz low-power low-noise amplifier","authors":"Qian Yi, Zhu Xiao-rong","doi":"10.1109/ICCSNT.2011.6182055","DOIUrl":"https://doi.org/10.1109/ICCSNT.2011.6182055","url":null,"abstract":"In this paper, a low noise amplifier (LNA) with a newly architecture of fully integrated common-source is designed based on TSMC 0.35 µm CMOS process, which worked at the frequency of 2.45 GHz. For input matching, LC parallel network is used instead of the traditional large inductor, and a capacitor is paralleled on the gate. Simulation results with LNA design shows that the newly architecture can conducive to the input matching and can reduce noise and power.","PeriodicalId":303186,"journal":{"name":"Proceedings of 2011 International Conference on Computer Science and Network Technology","volume":"177 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132693641","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 : 2011-12-01DOI: 10.1109/ICCSNT.2011.6182528
Chen Xiao-jie
In order to construct the national sports information network following the steps of the developed countries, several factors which influence china sports government affairs information network were discussed. Investigation of the influence of China's eastern region and western region, in the sports government affairs information network construction of subjective and objective factors, pointed out these regions in the network construction of the achievements and shortcomings. Reasons were given based on the differences between economic, technical and personnel in the causes of formation. In the end, this paper proposed some improved guidance and advices which was very useful for the network construction.
{"title":"Impact of China's sports information network construction factors","authors":"Chen Xiao-jie","doi":"10.1109/ICCSNT.2011.6182528","DOIUrl":"https://doi.org/10.1109/ICCSNT.2011.6182528","url":null,"abstract":"In order to construct the national sports information network following the steps of the developed countries, several factors which influence china sports government affairs information network were discussed. Investigation of the influence of China's eastern region and western region, in the sports government affairs information network construction of subjective and objective factors, pointed out these regions in the network construction of the achievements and shortcomings. Reasons were given based on the differences between economic, technical and personnel in the causes of formation. In the end, this paper proposed some improved guidance and advices which was very useful for the network construction.","PeriodicalId":303186,"journal":{"name":"Proceedings of 2011 International Conference on Computer Science and Network Technology","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133109761","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 : 2011-12-01DOI: 10.1109/ICCSNT.2011.6182423
Xuesong Zhang, Xin Chen, Lei Zhang, Guofeng Xin, Tong Xu
The determinacy of Full Duplex Switch Ethernet (AFDX) provides a guaranteed service to support real-time data transmission among avionics subsystem [1]. Traditional AFDX adopts FIFO scheduling algorithm in ES and output port in switches. In this paper, we explore the feasibility to use various scheduling policy in AFDX protocol. The aim of this research is to identify whether alternative scheduling policy can provide good enough QoS service which meets the requirements of avionic environment. We calculate the End-to-End delays of virtual links (VL) in three given circumstance using Network Calculus: PGPS and SP scheme on scheduler of ES and FIFO and SP on output port of AFDX switch. Numerical result shows that the scheme of SP on scheduler of ES and output port of AFDX switch rather than FIFO can provide an improved service.
{"title":"End-to-End delay analysis of avionics Full Duplex switched Ethernet with different flow scheduling scheme","authors":"Xuesong Zhang, Xin Chen, Lei Zhang, Guofeng Xin, Tong Xu","doi":"10.1109/ICCSNT.2011.6182423","DOIUrl":"https://doi.org/10.1109/ICCSNT.2011.6182423","url":null,"abstract":"The determinacy of Full Duplex Switch Ethernet (AFDX) provides a guaranteed service to support real-time data transmission among avionics subsystem [1]. Traditional AFDX adopts FIFO scheduling algorithm in ES and output port in switches. In this paper, we explore the feasibility to use various scheduling policy in AFDX protocol. The aim of this research is to identify whether alternative scheduling policy can provide good enough QoS service which meets the requirements of avionic environment. We calculate the End-to-End delays of virtual links (VL) in three given circumstance using Network Calculus: PGPS and SP scheme on scheduler of ES and FIFO and SP on output port of AFDX switch. Numerical result shows that the scheme of SP on scheduler of ES and output port of AFDX switch rather than FIFO can provide an improved service.","PeriodicalId":303186,"journal":{"name":"Proceedings of 2011 International Conference on Computer Science and Network Technology","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127825270","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 : 2011-12-01DOI: 10.1109/ICCSNT.2011.6182554
Jun-ya Lv
The article mainly introduces design and construction of Web-based multimedia database system, analyzes and introduces network technology, ASP technology and IIS technology and determines browser/server architecture of the system. The article decides the logical structure and functions of the system by research and analysis on the system demand, introduces target of system design and design restrictions in detail, summarizes difficulties, skills and features in system development and implementation stage, analyzes on the system and gives comments. The system adopts B/S architecture as share mode of information, TCP/IP protocol as network platform basis and ASP technical language as specific development tool for network activity application, establishes relatively complete database subject to request of the system users and realizes multi-user network VOD.
{"title":"Research on large-size multimedia database construction","authors":"Jun-ya Lv","doi":"10.1109/ICCSNT.2011.6182554","DOIUrl":"https://doi.org/10.1109/ICCSNT.2011.6182554","url":null,"abstract":"The article mainly introduces design and construction of Web-based multimedia database system, analyzes and introduces network technology, ASP technology and IIS technology and determines browser/server architecture of the system. The article decides the logical structure and functions of the system by research and analysis on the system demand, introduces target of system design and design restrictions in detail, summarizes difficulties, skills and features in system development and implementation stage, analyzes on the system and gives comments. The system adopts B/S architecture as share mode of information, TCP/IP protocol as network platform basis and ASP technical language as specific development tool for network activity application, establishes relatively complete database subject to request of the system users and realizes multi-user network VOD.","PeriodicalId":303186,"journal":{"name":"Proceedings of 2011 International Conference on Computer Science and Network Technology","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131865950","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 : 2011-12-01DOI: 10.1109/ICCSNT.2011.6182321
Xianmin Wei
In this paper, a new algorithm called multi-objective ant-genetic algorithms, which is based on the continuous space optimization is presented to solve constrained multi-objective function optimization problems. For the trait of multi-objective optimization, we define the pheromone instruction inheritance searching strategy and the method of pheromone updating. Then we combine four means of pheromone instruction inheritance searching, introduction of excellent decision-making, decision set updating and changing algorithm termination condition together so that the constringent speed of searching has improved a lot and the quantity of Pareto optimal decisions were controlled, also the distributing area of decisions were enlarged, the diversity of the swarm was maintained. At the same time, the termination conditions of multi-objective ant-genetic algorithms were presented. In the end, an example was listed to prove that the algorithms were effective, and it can find a group of widely distributed Pareto optimal decisions.
{"title":"Ant-genetic algorithms based on multi-objective optimization","authors":"Xianmin Wei","doi":"10.1109/ICCSNT.2011.6182321","DOIUrl":"https://doi.org/10.1109/ICCSNT.2011.6182321","url":null,"abstract":"In this paper, a new algorithm called multi-objective ant-genetic algorithms, which is based on the continuous space optimization is presented to solve constrained multi-objective function optimization problems. For the trait of multi-objective optimization, we define the pheromone instruction inheritance searching strategy and the method of pheromone updating. Then we combine four means of pheromone instruction inheritance searching, introduction of excellent decision-making, decision set updating and changing algorithm termination condition together so that the constringent speed of searching has improved a lot and the quantity of Pareto optimal decisions were controlled, also the distributing area of decisions were enlarged, the diversity of the swarm was maintained. At the same time, the termination conditions of multi-objective ant-genetic algorithms were presented. In the end, an example was listed to prove that the algorithms were effective, and it can find a group of widely distributed Pareto optimal decisions.","PeriodicalId":303186,"journal":{"name":"Proceedings of 2011 International Conference on Computer Science and Network Technology","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131877868","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
扫码关注我们
求助内容：
应助结果提醒方式：