{"title":"Research of Collaborative Design Task Management Method Based on Grid","authors":"Xuebin Chen, Shufen Zhang, Shuai Zhang","doi":"10.1109/ICFN.2010.61","DOIUrl":"https://doi.org/10.1109/ICFN.2010.61","url":null,"abstract":"In the coordination design support environment full use network resources carry on the coordination work, realizes the different person to design the identical product together the goal. In the coordination design process, a complex task is decomposed to small sub-tasks with certain granularity and assigns each sub-task for in the suitable grid node completes by the suitable person. The entire product design process is one kind of lamination nesting structure, its design task decomposition is whether reasonable, will directly affect the product design flow and the design cycle, moreover the task coupling relations will involve the design change dissemination and the design recollection, therefore, will have to carry on the coordination and the control to each sub-task advancement, under certain rule control each task distribution for the different design personnel, will avoid as far as possible with the reduced coordination design process in the conflict, thus the guarantee coordination design overall task will complete smoothly. This article has studied the task theory of dissociation, has given the product coordination design task concrete decomposition method, uses the design structure matrix to judge the rationality which the task decomposes and to the task to carry on the reorganization, gives the coupling task collection the decoupling method. Finally, it has given the task plan function module network realization flow.","PeriodicalId":185491,"journal":{"name":"2010 Second International Conference on Future Networks","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130751088","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}
{"title":"Optimization of Heterogeneous Databases Data Synchronization in WAN by Virtual Log Compression","authors":"Z. Lu, Chun-Ling Zhang, Zun-Feng Liu","doi":"10.1109/ICFN.2010.71","DOIUrl":"https://doi.org/10.1109/ICFN.2010.71","url":null,"abstract":"Data synchronization based on virtual log is now widely used, while huge log records will affect the efficiency of data synchronization, especially when the master side has frequent changes in same record. Virtual log compression will calculate and merge log records, and only those records related with data synchronization will be left and therefore reducing network traffic and improve the efficiency of data synchronization. Virtual log compression is particularly suitable for heterogeneous database and asynchronous data synchronization in WAN, and has a high prospect.","PeriodicalId":185491,"journal":{"name":"2010 Second International Conference on Future Networks","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134583749","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}
{"title":"Design and Implementation of Simplified MGCP Stack Based on DSP","authors":"Guo Cui-juan, Miao Changyun, Wu Zhigang, Li Jie","doi":"10.1109/ICFN.2010.14","DOIUrl":"https://doi.org/10.1109/ICFN.2010.14","url":null,"abstract":"Based on analysis of the MGCP protocol, a DSP-based simplified MGCP stack running on LAN IP telephony system is implemented. The simplified MGCP stack adopts layered structure and session state machine, and accomplishes some functions such as individual calling, group calling, full calling, amplifying calling, storage and parse for MGCP messages. The simplified MGCP task is created with μC/OS-II embedded operating system, which shows the character of simple structure, easy debugging, good stability and low cost in practice.","PeriodicalId":185491,"journal":{"name":"2010 Second International Conference on Future Networks","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132701502","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}
{"title":"The Crack Injury Detection Based CMR and Natural Frequency with BP Neutral Network","authors":"Mingjun Liu, Li Li, Xiuyang Zhao, H. Liu","doi":"10.1109/ICFN.2010.38","DOIUrl":"https://doi.org/10.1109/ICFN.2010.38","url":null,"abstract":"In this paper a new approach based curvature mode ratio (CMR) and natural frequency with BP neutral network for crack injury detection is proposed. Taking a simple cantilever beam with multiple damage and perfect structure as study object, injury indices are gained by way of analysis the merit and drawback of natural frequency and the curvature mode, then use BP neutral network training tests that regards the natural frequency, the amount of the frequency relative decline and the first-order maximum CMR as the input parameter, crack location and injury degree as the output parameter. The simulated results confirm that the method can be very well applied to the crack damage identification.","PeriodicalId":185491,"journal":{"name":"2010 Second International Conference on Future Networks","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114473141","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}
{"title":"A Redundancy Detection Algorithm for Complex Environment in Wireless Sensor Networks","authors":"W. Qu, Jinkuan Wang, Zhigang Liu","doi":"10.1109/ICFN.2010.10","DOIUrl":"https://doi.org/10.1109/ICFN.2010.10","url":null,"abstract":"Due to the imbalance of the node’s energy consumption the sensing radius of node is different between each other, and in view of this complex application environment, a redundancy detection algorithm is proposed. The corresponding redundancy detection criteria are proposed under Boolean sensing model and probability sensing model and the reasonableness of the criteria are analyzed. Under the condition of maintaining the coverage quality of original network, the algorithm can detect the redundant node more adequately. Simulation results show that, in the complex environment when the nodes have the same sensing radius under Boolean sensing model, the algorithm activates less node in work and the redundancy detection is thorough, and when the nodes have different sensing radius, the algorithm detects the redundant node adequately and efficiently still; the performance of the algorithm under probability sensing model is stable, and it is easier and more accurate compared with grid-based method.","PeriodicalId":185491,"journal":{"name":"2010 Second International Conference on Future Networks","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117180999","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}
{"title":"An Intelligent WLAN Intrusion Prevention System Based on Signature Detection and Plan Recognition","authors":"Guanlin Chen, Hui Yao, Zebing Wang","doi":"10.1109/ICFN.2010.77","DOIUrl":"https://doi.org/10.1109/ICFN.2010.77","url":null,"abstract":"WLAN intrusion prevention systems have recently become one of the research hotspots with the rapid development of wireless communication. This paper starts from the introduction of intrusion prevention system and security threats to WLAN, puts forward the framework of the wireless IPS with an intelligent plan recognition engine, especially illustrates the expanding description of signature detection rules and the process of plan recognition. By utilizing device information and happened attack plans on monitored WLAN, this engine can predict the future actions and direct active responses to these actions. We present an improved model for conducting plan recognition. Experimental results showed that this engine can not only detect and prevent the main wireless attacks but also decrease false positives.","PeriodicalId":185491,"journal":{"name":"2010 Second International Conference on Future Networks","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122487315","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}
{"title":"Design and Formulation of Security Strategy in Network","authors":"Ning Zhang, Hong Bao","doi":"10.1109/ICFN.2010.91","DOIUrl":"https://doi.org/10.1109/ICFN.2010.91","url":null,"abstract":"In recent years, The information security has become a thriving and fast moving discipline in modern network society. people have realized that design and formulation of security strategy is very important and security failure is caused at least as often by bad incentives as by bad design. We find that incentives are becoming as important as technical design in achieving dependability. Systems are particularly prone to failure when the person guarding them is not the person who suffers when they fail. The growing use of security mechanisms to enable one system user to exert power over another user, rather than simply to exclude people who should not be users at all, introduces many strategic and policy issues.","PeriodicalId":185491,"journal":{"name":"2010 Second International Conference on Future Networks","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124820586","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}
{"title":"Background Subtraction under Single Varying Illumination in Different Background Luminance","authors":"Ming Yang Yang, Yang Bo, M. Dong, G. Long","doi":"10.1109/ICFN.2010.30","DOIUrl":"https://doi.org/10.1109/ICFN.2010.30","url":null,"abstract":"Background subtraction is widely used in detecting moving objects in a static scene, which requires a fixed camera, and a static background. Most background subtract algorithms require the illumination changing slowly, so can be tracked and updated. If the illumination changes fast and non-monotony, many algorithms fail. Here we research one special scene in changing illumination: single continuous varying illumination. This scene can be seen indoor or in the dark or in underground architecture and in some daytime conditions. We consider three different conditions on the background luminance, and a new algorithm based on these conditions through calculating the illumination factor is advanced, it can relative precisely obtain the moving objects in this scene compared to other algorithms.","PeriodicalId":185491,"journal":{"name":"2010 Second International Conference on Future Networks","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123022745","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}
{"title":"An Effective Background Subtraction under a Continuosly and Rapidly Varying Illumination","authors":"Bo Yang, Yunlong Guo, Yangyang Ming, Aidong Men","doi":"10.1109/ICFN.2010.17","DOIUrl":"https://doi.org/10.1109/ICFN.2010.17","url":null,"abstract":"Background subtraction is an effective method in detecting moving objects in a static scene, which requires a fixed camera, and a static background. Illumination changing is a challenging problem which causes failure of background subtraction. Most background subtract algorithms require the illumination changing slowly, so the object can be tracked accurately and the background is easy to update. If the illumination changes rapidly and nonmonotonously, many algorithms fail. In this paper, we do some research on the condition when there is a single light which simulates a continuously and rapidly varying illumination. This kind of condition has many applicable scenes in daily life. This scene can be seen not only in doors or in the dark or in underground architecture but also out doors or in the light. We propose a new algorithm based on the illumination factor which can be applied to not only the indoor environment but also outdoors with natural illumination. In our algorithm, illumination factor is computed through the comparison of background and the current frame. The background is estimated and updated based on this factor, which tracks the change of background accurately and reduces the chance of failure. Experiments have proven the effectiveness of our method.","PeriodicalId":185491,"journal":{"name":"2010 Second International Conference on Future Networks","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132402538","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}
{"title":"The Theory and Empirical Research of Commodity Networks Based on Relationship Value","authors":"Jingdong Chen, Yilin Hu","doi":"10.1109/ICFN.2010.82","DOIUrl":"https://doi.org/10.1109/ICFN.2010.82","url":null,"abstract":"Networks exist in every aspect of people's lives, not just a highly developed Internet today, in the agricultural society also have a virtual network, such as interpersonal networks, social networks. In this paper, commodity marketing on the Internet as a research object proceeds in three areas which is the mutual of goods, mutual of services and mutual of network. Then analyzes the relationship value and builds structural equation modeling to verify the dimensions of the mutual influence relationship value, and reveals fit intermediate effect.","PeriodicalId":185491,"journal":{"name":"2010 Second International Conference on Future Networks","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130371514","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}