We propose an algorithm of region division and computations for the basis functions of regular Loop subdivision surface. By means of this algorithm we obtain an exact bound between regular Loop subdivision surface patch and its control mesh. The bound is given by maximum Euclidean norm of the first differences of the control vertices of the surface patch.
{"title":"An exact bound on regular Loop subdivision surface","authors":"Guorong Zhou, Yuhua Zhang, Mingming Shan, Youzhi Wang, Yaohan Zhang, Xiao-Ming Zeng","doi":"10.1109/CSAE.2011.5952499","DOIUrl":"https://doi.org/10.1109/CSAE.2011.5952499","url":null,"abstract":"We propose an algorithm of region division and computations for the basis functions of regular Loop subdivision surface. By means of this algorithm we obtain an exact bound between regular Loop subdivision surface patch and its control mesh. The bound is given by maximum Euclidean norm of the first differences of the control vertices of the surface patch.","PeriodicalId":138215,"journal":{"name":"2011 IEEE International Conference on Computer Science and Automation Engineering","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127936083","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-06-10DOI: 10.1109/CSAE.2011.5952795
Shao-Ping Jiang, Zi-Gang Fu
This paper proposed a new preprocessing method for the reconstruction of three dimensional shapes from a practical engineering drawing which clarify the entities in the drawing and construct an efficient data structure to express the topology relationships among endpoints and edges. For dealing with non standard three-view drawing, a new composite-three-view representation is proposed to organize the auxiliary views, which extends the scope of engineering drawing can be handled.
{"title":"Preprocessing for solid reconstruction from engineering drawing","authors":"Shao-Ping Jiang, Zi-Gang Fu","doi":"10.1109/CSAE.2011.5952795","DOIUrl":"https://doi.org/10.1109/CSAE.2011.5952795","url":null,"abstract":"This paper proposed a new preprocessing method for the reconstruction of three dimensional shapes from a practical engineering drawing which clarify the entities in the drawing and construct an efficient data structure to express the topology relationships among endpoints and edges. For dealing with non standard three-view drawing, a new composite-three-view representation is proposed to organize the auxiliary views, which extends the scope of engineering drawing can be handled.","PeriodicalId":138215,"journal":{"name":"2011 IEEE International Conference on Computer Science and Automation Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127961332","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-06-10DOI: 10.1109/CSAE.2011.5952654
Dong-Sung Ryu, Sun-young Park, Kwanghwi Kim, Hwan-Gue Cho
Widespread distribution of digital cameras and the low price of memory are acclimating people to taking many more photos than before. As the number of photos to be managed grows, photo management tasks become more and more burdensome. One of the most time-consuming aspects of photo management is photo classification. A person must make many folders, group photos, and label grouped photos. In order to assist in this task, we proposed a priority queue-based hierarchical photo clustering method that partitions ordered photos by their temporal context. The temporal context we considered is the variance of time gaps between photos taken in a window (its size is user-designated). A recursive partitioning called by a priority queue enables classified photo groups with maximum variance to be selected primarily. In an experiment, we compared our system with Cooper's temporal clustering method in terms of precision and recall. Our method is superior when the photo timestamp difference has a uniform pattern. For further work, we propose a visualization method for the clustered photos.
{"title":"A priority queue-based hierarchical photo clustering method using photo timestamps","authors":"Dong-Sung Ryu, Sun-young Park, Kwanghwi Kim, Hwan-Gue Cho","doi":"10.1109/CSAE.2011.5952654","DOIUrl":"https://doi.org/10.1109/CSAE.2011.5952654","url":null,"abstract":"Widespread distribution of digital cameras and the low price of memory are acclimating people to taking many more photos than before. As the number of photos to be managed grows, photo management tasks become more and more burdensome. One of the most time-consuming aspects of photo management is photo classification. A person must make many folders, group photos, and label grouped photos. In order to assist in this task, we proposed a priority queue-based hierarchical photo clustering method that partitions ordered photos by their temporal context. The temporal context we considered is the variance of time gaps between photos taken in a window (its size is user-designated). A recursive partitioning called by a priority queue enables classified photo groups with maximum variance to be selected primarily. In an experiment, we compared our system with Cooper's temporal clustering method in terms of precision and recall. Our method is superior when the photo timestamp difference has a uniform pattern. For further work, we propose a visualization method for the clustered photos.","PeriodicalId":138215,"journal":{"name":"2011 IEEE International Conference on Computer Science and Automation Engineering","volume":"261 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115821574","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-06-10DOI: 10.1109/CSAE.2011.5952707
Pan Jin, Q. Song
The original R*Q-tree is the most popular query index of special database, but it is not suitable for the situation of frequent insertion and deletion, because its' construction cost is much more than the other query methods. Therefore, the novel R*Q-tree splitting technology has been proposed as for improving the shortcomings of the original R*Q-tree. When the novel R*Q-tree has objects inserted into it the nodes may overflow. During this, rather than split the node immediately, it attempts to insert nodes in the adjacent neighboring nodes until they were full. Then it uses clustering technology to split the nodes, data items were reorganized the nodes between in the neighboring nodes and spitted nodes. The novel R*Q-tree ensuring the premise of query performance greatly reduced the cost of structure and significantly improve the space utilization of the index structure. Finally, the analysis and experiments show that the efficiency of the novel R*Q-tree is improved. But also among the novel R*Q-tree and the promoter region, there is no duplication elements, which made structure of the novel R*Q-tree simplified. Lazy splitting; Clustering; R*Q-tree
{"title":"A novel index structure R*Q-tree based on lazy splitting and clustering","authors":"Pan Jin, Q. Song","doi":"10.1109/CSAE.2011.5952707","DOIUrl":"https://doi.org/10.1109/CSAE.2011.5952707","url":null,"abstract":"The original R*Q-tree is the most popular query index of special database, but it is not suitable for the situation of frequent insertion and deletion, because its' construction cost is much more than the other query methods. Therefore, the novel R*Q-tree splitting technology has been proposed as for improving the shortcomings of the original R*Q-tree. When the novel R*Q-tree has objects inserted into it the nodes may overflow. During this, rather than split the node immediately, it attempts to insert nodes in the adjacent neighboring nodes until they were full. Then it uses clustering technology to split the nodes, data items were reorganized the nodes between in the neighboring nodes and spitted nodes. The novel R*Q-tree ensuring the premise of query performance greatly reduced the cost of structure and significantly improve the space utilization of the index structure. Finally, the analysis and experiments show that the efficiency of the novel R*Q-tree is improved. But also among the novel R*Q-tree and the promoter region, there is no duplication elements, which made structure of the novel R*Q-tree simplified. Lazy splitting; Clustering; R*Q-tree","PeriodicalId":138215,"journal":{"name":"2011 IEEE International Conference on Computer Science and Automation Engineering","volume":"185 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132065513","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-06-10DOI: 10.1109/CSAE.2011.5952510
Fuzhou Feng, A. Si, Wei Xing
In order to overcome the drawbacks of a neural network based on back propagation (BP) algorithm, such as too slow to converge and easy to be trapped into a local minimum, a new modified algorithm is proposed in this paper, in which the grads information of the network are exchanged dynamically in each iteration step, and the increment factor of learning rate and interaction function in delta-bar-delta (DBD) algorithm are improved based on the idea of cross and mutation in Genetic algorithm (GA). The new algorithm has been applied in the fault diagnosis of a fuel supply system in a certain diesel engine successfully.
{"title":"Application of improved DBD algorithm based bp neural network on fault diagnosis for fuel supply system in a certain diesel engine","authors":"Fuzhou Feng, A. Si, Wei Xing","doi":"10.1109/CSAE.2011.5952510","DOIUrl":"https://doi.org/10.1109/CSAE.2011.5952510","url":null,"abstract":"In order to overcome the drawbacks of a neural network based on back propagation (BP) algorithm, such as too slow to converge and easy to be trapped into a local minimum, a new modified algorithm is proposed in this paper, in which the grads information of the network are exchanged dynamically in each iteration step, and the increment factor of learning rate and interaction function in delta-bar-delta (DBD) algorithm are improved based on the idea of cross and mutation in Genetic algorithm (GA). The new algorithm has been applied in the fault diagnosis of a fuel supply system in a certain diesel engine successfully.","PeriodicalId":138215,"journal":{"name":"2011 IEEE International Conference on Computer Science and Automation Engineering","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132346990","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-06-10DOI: 10.1109/CSAE.2011.5953169
Chang Shuchun, Li Lixing
The Command and Control Relationships Network Models are constructed. The architecture features of these models are analyzed using “continuous core/periphery model” in Social Network Analysis. It can be seen from research, whether a C2 organization network model has “core/periphery” architecture feature can be judged by calculating and analyzing. If the clear degree of the feature is distinct, the nodes of model can be separated into core, semi-periphery and periphery. The relationships between structure features and organizations efficiency are endeavor to be discovered.
{"title":"Continuous core/periphery architecture features of C2 organizations analysis based on Social Network Analysis","authors":"Chang Shuchun, Li Lixing","doi":"10.1109/CSAE.2011.5953169","DOIUrl":"https://doi.org/10.1109/CSAE.2011.5953169","url":null,"abstract":"The Command and Control Relationships Network Models are constructed. The architecture features of these models are analyzed using “continuous core/periphery model” in Social Network Analysis. It can be seen from research, whether a C2 organization network model has “core/periphery” architecture feature can be judged by calculating and analyzing. If the clear degree of the feature is distinct, the nodes of model can be separated into core, semi-periphery and periphery. The relationships between structure features and organizations efficiency are endeavor to be discovered.","PeriodicalId":138215,"journal":{"name":"2011 IEEE International Conference on Computer Science and Automation Engineering","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130002399","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-06-10DOI: 10.1109/CSAE.2011.5952914
U. Torteanchai, M. Kumngern, K. Dejhan
This paper presents a new active building block for analog signal processing, called the current-controlled differential difference current conveyor (CCDDCC) with controlled current gain. Its parasitic resistance at X-terminal can be controlled by an external bias current and the current at Z-terminal can be electronically controlled by a current ratio and can be made insensitive to temperature and integrated circuit processing. PSPICE simulation results of proposed CCDDCC with controlled current gain and its application are also presented.
{"title":"Current-controlled CCDDCC with controlled current gain","authors":"U. Torteanchai, M. Kumngern, K. Dejhan","doi":"10.1109/CSAE.2011.5952914","DOIUrl":"https://doi.org/10.1109/CSAE.2011.5952914","url":null,"abstract":"This paper presents a new active building block for analog signal processing, called the current-controlled differential difference current conveyor (CCDDCC) with controlled current gain. Its parasitic resistance at X-terminal can be controlled by an external bias current and the current at Z-terminal can be electronically controlled by a current ratio and can be made insensitive to temperature and integrated circuit processing. PSPICE simulation results of proposed CCDDCC with controlled current gain and its application are also presented.","PeriodicalId":138215,"journal":{"name":"2011 IEEE International Conference on Computer Science and Automation Engineering","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133876913","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-06-10DOI: 10.1109/CSAE.2011.5952946
Xinle Yu, Dandan Song, Zhanxin Yang
In this Paper, we proposed a method of Aeronautics channel modeling for block-Data transmission systems, the channel model is generated in frequency domain instead of time domain. The characteristics of aeronautical channel are introduced. The analysis and simulation of channel modeling method in frequency domain are proposed in the end of this paper.
{"title":"Aeronautical channel modeling in frequency-domain for block-data transmission systems","authors":"Xinle Yu, Dandan Song, Zhanxin Yang","doi":"10.1109/CSAE.2011.5952946","DOIUrl":"https://doi.org/10.1109/CSAE.2011.5952946","url":null,"abstract":"In this Paper, we proposed a method of Aeronautics channel modeling for block-Data transmission systems, the channel model is generated in frequency domain instead of time domain. The characteristics of aeronautical channel are introduced. The analysis and simulation of channel modeling method in frequency domain are proposed in the end of this paper.","PeriodicalId":138215,"journal":{"name":"2011 IEEE International Conference on Computer Science and Automation Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133909014","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-06-10DOI: 10.1109/CSAE.2011.5952831
Ting-wei Chen, Carlos Madrazo, Takeshi Tsuchiya, K. Koyanagi
A peer-to-peer-based storage system has become a common way to alleviate network congestion and the limitation of storage space for providing file sharing, distributed computation, and instant messaging. Since the peer-to-peer technique has been used in file sharing, replications of a file is produced for a quick response and high availability. On the other hand, too much replications of a file may waste storage after the file become unpopular. The objective is to manage replications of file efficiently. In the proposed method, a popularity level is defined for evaluating the popularity of a file, used to determine the increasing or decreasing of the number of replications. The popularity level has three thresholds to determine replication of file. Thresholds are setting up by the 80–20 rule, and it changes dynamically overtime. We conclude that the popularity of file and its number of replication affect each other to use storage efficiently.
{"title":"Unbalanced replication by evaluating popularity over web scalable storage","authors":"Ting-wei Chen, Carlos Madrazo, Takeshi Tsuchiya, K. Koyanagi","doi":"10.1109/CSAE.2011.5952831","DOIUrl":"https://doi.org/10.1109/CSAE.2011.5952831","url":null,"abstract":"A peer-to-peer-based storage system has become a common way to alleviate network congestion and the limitation of storage space for providing file sharing, distributed computation, and instant messaging. Since the peer-to-peer technique has been used in file sharing, replications of a file is produced for a quick response and high availability. On the other hand, too much replications of a file may waste storage after the file become unpopular. The objective is to manage replications of file efficiently. In the proposed method, a popularity level is defined for evaluating the popularity of a file, used to determine the increasing or decreasing of the number of replications. The popularity level has three thresholds to determine replication of file. Thresholds are setting up by the 80–20 rule, and it changes dynamically overtime. We conclude that the popularity of file and its number of replication affect each other to use storage efficiently.","PeriodicalId":138215,"journal":{"name":"2011 IEEE International Conference on Computer Science and Automation Engineering","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133988130","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-06-10DOI: 10.1109/CSAE.2011.5952541
Deji Chen, M. Nixon, Thomas Lin, Song Han, Xiuming Zhu, A. Mok, R. Xu, Julia Deng, An Liu
Security has become a key consideration in industrial settings. Newer technologies, such as wireless sensor networks, have adopted the position that security is mandatory. For wireless sensor applications it is important to secure data in transit in the air, to authenticate data originating from, or arriving at the wireless devices and applications, and, most important, to protect the safety and integrity of the legacy process control and plant safeguarding systems that the new wireless world interconnects into. Current industrial wireless mesh networks, such as WirelessHART™, ISA100.11a, and WIA-PA, have adopted AES 128 bit encryption for both securing communications and data. To ensure that devices and applications are authenticated special join keys are used. The process of loading these keys is called provisioning. To ensure that join keys remain secret they are loaded offline through special wired interfaces or provisioned over the air using less secure mechanisms. What is needed is a low cost efficient public key mechanism that can be utilized over the air while not compromising security. This paper examines the use of elliptic curve cryptography for this purpose. We realize this technique on a WirelessHART mesh network. Efforts are underway to incorporate this approach as an addition to the WirelessHART standard.
{"title":"Over the air provisioning of industrial wireless devices using elliptic curve cryptography","authors":"Deji Chen, M. Nixon, Thomas Lin, Song Han, Xiuming Zhu, A. Mok, R. Xu, Julia Deng, An Liu","doi":"10.1109/CSAE.2011.5952541","DOIUrl":"https://doi.org/10.1109/CSAE.2011.5952541","url":null,"abstract":"Security has become a key consideration in industrial settings. Newer technologies, such as wireless sensor networks, have adopted the position that security is mandatory. For wireless sensor applications it is important to secure data in transit in the air, to authenticate data originating from, or arriving at the wireless devices and applications, and, most important, to protect the safety and integrity of the legacy process control and plant safeguarding systems that the new wireless world interconnects into. Current industrial wireless mesh networks, such as WirelessHART™, ISA100.11a, and WIA-PA, have adopted AES 128 bit encryption for both securing communications and data. To ensure that devices and applications are authenticated special join keys are used. The process of loading these keys is called provisioning. To ensure that join keys remain secret they are loaded offline through special wired interfaces or provisioned over the air using less secure mechanisms. What is needed is a low cost efficient public key mechanism that can be utilized over the air while not compromising security. This paper examines the use of elliptic curve cryptography for this purpose. We realize this technique on a WirelessHART mesh network. Efforts are underway to incorporate this approach as an addition to the WirelessHART standard.","PeriodicalId":138215,"journal":{"name":"2011 IEEE International Conference on Computer Science and Automation Engineering","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134308846","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
扫码关注我们
求助内容：
应助结果提醒方式：