Lots of collaborative applications that contain a number of dependent tasks run in networked embedded system, such as wireless sensor network, Cyber-Physical-System and so on. For the reasons that deadlines of some collaborative applications are usually not so hard and lifetime of whole system depends on energy dissipation, it is meaningful to figure out a good strategy for balancing delay with system energy dissipation. Considering this issue, our research focuses on trying to minimize total system energy dissipation for extending lifetime of whole system, on the premise that delay of finish time is acceptable. In this paper, we point out which tasks are critical among independent tasks from the perspective of energy-saving and propose BESF (Biggest Energy Span First) algorithm that first allocates the task with biggest energy span. Actually, BESF algorithm references BEATA algorithm, however, BESF could not only further decrease energy-consumption of whole system comparing with existing related algorithms, like BEATA, GEATA, but also still ensure that the finish time is tolerable. Experimental results show that in most situations, BESF algorithm is able to save more energy comparing with existing algorithms.
{"title":"An Energy-Saving Algorithm in Networked Embedded System Based on Critical Tasks Served First Strategy","authors":"Bing Xue, Z. Zhao, Lu Wang, Xiaoli Zhu","doi":"10.1109/ISCC-C.2013.37","DOIUrl":"https://doi.org/10.1109/ISCC-C.2013.37","url":null,"abstract":"Lots of collaborative applications that contain a number of dependent tasks run in networked embedded system, such as wireless sensor network, Cyber-Physical-System and so on. For the reasons that deadlines of some collaborative applications are usually not so hard and lifetime of whole system depends on energy dissipation, it is meaningful to figure out a good strategy for balancing delay with system energy dissipation. Considering this issue, our research focuses on trying to minimize total system energy dissipation for extending lifetime of whole system, on the premise that delay of finish time is acceptable. In this paper, we point out which tasks are critical among independent tasks from the perspective of energy-saving and propose BESF (Biggest Energy Span First) algorithm that first allocates the task with biggest energy span. Actually, BESF algorithm references BEATA algorithm, however, BESF could not only further decrease energy-consumption of whole system comparing with existing related algorithms, like BEATA, GEATA, but also still ensure that the finish time is tolerable. Experimental results show that in most situations, BESF algorithm is able to save more energy comparing with existing algorithms.","PeriodicalId":313511,"journal":{"name":"2013 International Conference on Information Science and Cloud Computing Companion","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125720241","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 random search algorithm to resolve the problem of packing circles into a rectangular container. With our method, all the circles are put into a large space randomly, and then by introducing the bow shift area, the searching space can be reduced and the local optimal solution can be list. By moving, turning and other disturbance methods, it will achieve the global optimization in the whole area. We designed exactly software to verify our algorithm. With our approach, the best optimal layout is irrelevant with the initial layout and the position of the biggest circle.
{"title":"A Method Based on Random Search Algorithm for Unequal Circle Packing Problem","authors":"Ying Shang, Jizheng Chu","doi":"10.1109/ISCC-C.2013.19","DOIUrl":"https://doi.org/10.1109/ISCC-C.2013.19","url":null,"abstract":"We propose a random search algorithm to resolve the problem of packing circles into a rectangular container. With our method, all the circles are put into a large space randomly, and then by introducing the bow shift area, the searching space can be reduced and the local optimal solution can be list. By moving, turning and other disturbance methods, it will achieve the global optimization in the whole area. We designed exactly software to verify our algorithm. With our approach, the best optimal layout is irrelevant with the initial layout and the position of the biggest circle.","PeriodicalId":313511,"journal":{"name":"2013 International Conference on Information Science and Cloud Computing Companion","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134259897","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}
Fault diagnosis of bridge is critical to guarantee the safe operation of structure. A fuzzy logic-based damage detection method is proposed in this paper to identify the single and multiple damages of bridge. Modal frequency is adopted as input parameter, while the damage severity is output one. Gauss and Bell functions are used as membership functions for input and output parameters, respectively. The fuzzy rule base is established according to suitable acquisition method. Numerical simulation for a simply supported bridge is used to verify the feasibility of the proposed method. The results reveal that the established fuzzy system possesses favorable memory, inference and anti-noise abilities. Its anti-noise level is favorable. The fuzzy logic method is feasible for fault diagnosis of bridge structure with single and multiple damaged locations under noise effect.
{"title":"Fuzzy Logic-Based Fault Diagnosis of Simply Supported Bridge Using Modal Frequency as Input Variable","authors":"Yongchun Cheng, H. Guo, Xianqiang Wang, Yubo Jiao","doi":"10.1109/ISCC-C.2013.74","DOIUrl":"https://doi.org/10.1109/ISCC-C.2013.74","url":null,"abstract":"Fault diagnosis of bridge is critical to guarantee the safe operation of structure. A fuzzy logic-based damage detection method is proposed in this paper to identify the single and multiple damages of bridge. Modal frequency is adopted as input parameter, while the damage severity is output one. Gauss and Bell functions are used as membership functions for input and output parameters, respectively. The fuzzy rule base is established according to suitable acquisition method. Numerical simulation for a simply supported bridge is used to verify the feasibility of the proposed method. The results reveal that the established fuzzy system possesses favorable memory, inference and anti-noise abilities. Its anti-noise level is favorable. The fuzzy logic method is feasible for fault diagnosis of bridge structure with single and multiple damaged locations under noise effect.","PeriodicalId":313511,"journal":{"name":"2013 International Conference on Information Science and Cloud Computing Companion","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123628340","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}
Community detection has been an issue in complex network research. In the paper, according to the definition of weak community, we firstly propose a local modularity and then design a new mutation operator with better efficiency based on local modularity. The mutation operator selects the neighbor node that can best embody the definition of weak community structures as mutated result, which makes the mutated candidate solution closer to the optimal solution. Furthermore, to accelerate the emergence of the optimal solution, the roulette selection is integrated into a uniform crossover operator. On the basis of the above works, an improved Genetic Algorithm based on the local modularity (IGALM) is presented for Community detection. The proposed algorithm is tested and compared to the other algorithms on both computer-generated network and real-world networks. The comparative experimental results reflect that the new algorithm is feasible and effective in small and large scale complex networks.
{"title":"An Improved Genetic Algorithm Based on Local Modularity for Community Detection in Complex Network","authors":"Xinwu Yang, Rui Li","doi":"10.1109/ISCC-C.2013.42","DOIUrl":"https://doi.org/10.1109/ISCC-C.2013.42","url":null,"abstract":"Community detection has been an issue in complex network research. In the paper, according to the definition of weak community, we firstly propose a local modularity and then design a new mutation operator with better efficiency based on local modularity. The mutation operator selects the neighbor node that can best embody the definition of weak community structures as mutated result, which makes the mutated candidate solution closer to the optimal solution. Furthermore, to accelerate the emergence of the optimal solution, the roulette selection is integrated into a uniform crossover operator. On the basis of the above works, an improved Genetic Algorithm based on the local modularity (IGALM) is presented for Community detection. The proposed algorithm is tested and compared to the other algorithms on both computer-generated network and real-world networks. The comparative experimental results reflect that the new algorithm is feasible and effective in small and large scale complex networks.","PeriodicalId":313511,"journal":{"name":"2013 International Conference on Information Science and Cloud Computing Companion","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122399031","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}
Yuntian Feng, Hongjun Zhang, Wenning Hao, Gang Chen
To compute iceberg cube based on non-antimonotonic constraint, we propose a modified Star-Cubing method by means of converting constraint by top-k. It uses a method of top-k to convert a constraint to an antimonotonic constraint and carries out the star-reduction in the base cuboid table, thus reduces the cost of the shared dimension pruning in Star-Cubing. Experimental results show that the method could compute iceberg cube based on non-antimonotonic constraint availably and improve the efficiency of computation method at the same time.
{"title":"A Method of Computing Iceberg Cube Based on Non-antimonotonic Constraint","authors":"Yuntian Feng, Hongjun Zhang, Wenning Hao, Gang Chen","doi":"10.1109/ISCC-C.2013.20","DOIUrl":"https://doi.org/10.1109/ISCC-C.2013.20","url":null,"abstract":"To compute iceberg cube based on non-antimonotonic constraint, we propose a modified Star-Cubing method by means of converting constraint by top-k. It uses a method of top-k to convert a constraint to an antimonotonic constraint and carries out the star-reduction in the base cuboid table, thus reduces the cost of the shared dimension pruning in Star-Cubing. Experimental results show that the method could compute iceberg cube based on non-antimonotonic constraint availably and improve the efficiency of computation method at the same time.","PeriodicalId":313511,"journal":{"name":"2013 International Conference on Information Science and Cloud Computing Companion","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122183484","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}
Deformation of 3D objects is an important problem in many application domains, such as geometric modeling, computer graphics and computer-aided design. In this paper, we propose a method for deformation of 3D objects with arc-length constraints. We convert the curve into the polyline. Then we build the energy function of the polyline. Based on the minimum energy curve method, the curve on the mesh is deformed with arc-length constraints and multi-points constraints. The test results show that the proposed method has good performance. Compared to the other method, shape preserving of the curve is better. Finally, we use this method for the deformation of the 3D mannequin model.
{"title":"Arc-Length Constraint-Based Surface Deformation Using Energy-Minimum Optimization","authors":"Huanyu Yang, K. Hao, Yongsheng Ding","doi":"10.1109/ISCC-C.2013.51","DOIUrl":"https://doi.org/10.1109/ISCC-C.2013.51","url":null,"abstract":"Deformation of 3D objects is an important problem in many application domains, such as geometric modeling, computer graphics and computer-aided design. In this paper, we propose a method for deformation of 3D objects with arc-length constraints. We convert the curve into the polyline. Then we build the energy function of the polyline. Based on the minimum energy curve method, the curve on the mesh is deformed with arc-length constraints and multi-points constraints. The test results show that the proposed method has good performance. Compared to the other method, shape preserving of the curve is better. Finally, we use this method for the deformation of the 3D mannequin model.","PeriodicalId":313511,"journal":{"name":"2013 International Conference on Information Science and Cloud Computing Companion","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122233949","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}
This paper focuses on the potential security risk embedded in the model of multi-tenant sharing virtual machine service. Also the characteristics of current Java virtual machine standard model and the typical problems that may be encountered under the multi-tenant circumstances will be further discussed. Additionally, major solutions to the above problems of Java application server, including MVM, I-JVM and improved OSGI model, will be deeply analyzed in this paper. Through introduction to the GAE of commercial multi-tenant PaaS platform, this paper presents a clear and precise discussion and clarification to the solutions of security problems on the platform of multi-tenant PaaS.
{"title":"Research on Multi-tenant PaaS Cloud Security on Java Platform","authors":"Changyun Jia, Min Zhu, Xiaoming Liu","doi":"10.1109/ISCC-C.2013.112","DOIUrl":"https://doi.org/10.1109/ISCC-C.2013.112","url":null,"abstract":"This paper focuses on the potential security risk embedded in the model of multi-tenant sharing virtual machine service. Also the characteristics of current Java virtual machine standard model and the typical problems that may be encountered under the multi-tenant circumstances will be further discussed. Additionally, major solutions to the above problems of Java application server, including MVM, I-JVM and improved OSGI model, will be deeply analyzed in this paper. Through introduction to the GAE of commercial multi-tenant PaaS platform, this paper presents a clear and precise discussion and clarification to the solutions of security problems on the platform of multi-tenant PaaS.","PeriodicalId":313511,"journal":{"name":"2013 International Conference on Information Science and Cloud Computing Companion","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115414503","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}
Face identification is the key step for reconstruction of a three dimensional object from a single two-dimensional line drawing depicting it. Many methods have been presented to solve this problem, and none of them considered the convexity of cycle polygon. In this paper we propose a new approach of face identification in line drawings, which combines together graph theory and convex property of polygons. With considering the convexity, we can overcome the difficulty of non-convex cycle polygons and our algorithm can deal with 3D solids of over 10,000 potential faces with efficiency. A couple of examples are provided in the end to show that our approach can handle some complex 3D reconstructions.
{"title":"A New Approach of Face Identification in Line Drawings","authors":"Weikun Sun, Xin Pan","doi":"10.1109/ISCC-C.2013.24","DOIUrl":"https://doi.org/10.1109/ISCC-C.2013.24","url":null,"abstract":"Face identification is the key step for reconstruction of a three dimensional object from a single two-dimensional line drawing depicting it. Many methods have been presented to solve this problem, and none of them considered the convexity of cycle polygon. In this paper we propose a new approach of face identification in line drawings, which combines together graph theory and convex property of polygons. With considering the convexity, we can overcome the difficulty of non-convex cycle polygons and our algorithm can deal with 3D solids of over 10,000 potential faces with efficiency. A couple of examples are provided in the end to show that our approach can handle some complex 3D reconstructions.","PeriodicalId":313511,"journal":{"name":"2013 International Conference on Information Science and Cloud Computing Companion","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116381382","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, we study the problem of effective keyword search over XML documents, Keyword search for smallest lowest common ancestor(SLCA) in XML data has recently been proposed as a meaningful way to identify interesting data nodes in XML data where their sub trees contain an input set of keywords. XML retrieval technology has been concerned widely by information retrieval researchers. XML data contains rich semantic information, but most of query methods can't make full use of the semantic information. There will be missed case if there is no enough semantic information. This paper proposed a new XML keyword query algorithm based on semantic(SKSA) to solve the question above. The algorithm takes full use of the node semantic information based on structural semantic. The same or similar results will be returned to users if there is no the keyword in XML document, which avoids the missed case. The test experiment result on the real XML data sets shows that SKSA has higher recall rate, and can match the user's query intention better.
{"title":"Research on XML Keyword Query Method Based on Semantic","authors":"Guofeng Zhao, S. Tian","doi":"10.1109/ISCC-C.2013.120","DOIUrl":"https://doi.org/10.1109/ISCC-C.2013.120","url":null,"abstract":"In this paper, we study the problem of effective keyword search over XML documents, Keyword search for smallest lowest common ancestor(SLCA) in XML data has recently been proposed as a meaningful way to identify interesting data nodes in XML data where their sub trees contain an input set of keywords. XML retrieval technology has been concerned widely by information retrieval researchers. XML data contains rich semantic information, but most of query methods can't make full use of the semantic information. There will be missed case if there is no enough semantic information. This paper proposed a new XML keyword query algorithm based on semantic(SKSA) to solve the question above. The algorithm takes full use of the node semantic information based on structural semantic. The same or similar results will be returned to users if there is no the keyword in XML document, which avoids the missed case. The test experiment result on the real XML data sets shows that SKSA has higher recall rate, and can match the user's query intention better.","PeriodicalId":313511,"journal":{"name":"2013 International Conference on Information Science and Cloud Computing Companion","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115735869","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}
Hongke Xu, M. Song, Xiaohong Wang, Jiayu Yang, Enmao Quan
This paper constructs a bridge health monitoring system based on Wireless Sensor Network. In order to detect and obtain the bridge's status information, we have studied the clock synchronization problem between the sensor nodes in wireless sensor network of the bridge health monitoring system. The clock synchronization simulation verifies the design of asymmetrical clock synchronization algorithm in the wireless sensor of the bridge health monitoring system is valid and reliable. The simulation results show that this clock synchronization algorithm can realize the clock synchronization and be able to monitor real-time bridge conditions.
{"title":"Research and Design of the Clock Synchronization for the Bridge Health Monitoring System Based on Wireless Sensor Network","authors":"Hongke Xu, M. Song, Xiaohong Wang, Jiayu Yang, Enmao Quan","doi":"10.1109/ISCC-C.2013.107","DOIUrl":"https://doi.org/10.1109/ISCC-C.2013.107","url":null,"abstract":"This paper constructs a bridge health monitoring system based on Wireless Sensor Network. In order to detect and obtain the bridge's status information, we have studied the clock synchronization problem between the sensor nodes in wireless sensor network of the bridge health monitoring system. The clock synchronization simulation verifies the design of asymmetrical clock synchronization algorithm in the wireless sensor of the bridge health monitoring system is valid and reliable. The simulation results show that this clock synchronization algorithm can realize the clock synchronization and be able to monitor real-time bridge conditions.","PeriodicalId":313511,"journal":{"name":"2013 International Conference on Information Science and Cloud Computing Companion","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127495209","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
扫码关注我们
求助内容：
应助结果提醒方式：