With the development of distributed simulation technology, firstly this paper based on the service-oriented technology, presents a service-oriented network simulation construction and operation models to meet the future military system simulation new demands. Secondly, we particularly present relevant research on the network simulation supporting platform and interrelated core services, focusing on operation support platform architecture and construction and operation of the simulation application services under the architecture. End of the paper gives the key technologies analysis for future explanation of the operation support platform, including multi-CoST Management, virtual scheduling and simulation core services management.
{"title":"Research on Service-Oriented Network Simulation and Operation of Supporting Platform","authors":"Li Jianning, Yu Jie, Sun Liyang","doi":"10.1109/ICCIS.2012.255","DOIUrl":"https://doi.org/10.1109/ICCIS.2012.255","url":null,"abstract":"With the development of distributed simulation technology, firstly this paper based on the service-oriented technology, presents a service-oriented network simulation construction and operation models to meet the future military system simulation new demands. Secondly, we particularly present relevant research on the network simulation supporting platform and interrelated core services, focusing on operation support platform architecture and construction and operation of the simulation application services under the architecture. End of the paper gives the key technologies analysis for future explanation of the operation support platform, including multi-CoST Management, virtual scheduling and simulation core services management.","PeriodicalId":269967,"journal":{"name":"2012 Fourth International Conference on Computational and Information Sciences","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115392400","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}
A new experimental method was introduced in this paper, in which the Multiquadric function interpolation with scattered data points was used for surface reconstruction. Through the comparison of experiments and error analysis, we get the relative efficient proportion of interpolation nodes. Then a hand model surface reconstruction experiment has been done to verify the conclusion.
{"title":"Surface Reconstruction by the Multiquadric Function","authors":"K. Li","doi":"10.1109/ICCIS.2012.308","DOIUrl":"https://doi.org/10.1109/ICCIS.2012.308","url":null,"abstract":"A new experimental method was introduced in this paper, in which the Multiquadric function interpolation with scattered data points was used for surface reconstruction. Through the comparison of experiments and error analysis, we get the relative efficient proportion of interpolation nodes. Then a hand model surface reconstruction experiment has been done to verify the conclusion.","PeriodicalId":269967,"journal":{"name":"2012 Fourth International Conference on Computational and Information Sciences","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123075876","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}
With the popularity of Extensible Markup Language (XML) as the new standard of data exchange on the web, a large number of data sources are represented or encoded in XML format. Therefore, querying and searching XML data on the web has attracted much attention in the database literature. In this research work, we developed a prototype software system named VXPath to facilitate the efficient evaluation of XPath queries over XML data. VXPath is a visual XPath query evaluator that allows the user to evaluate an XPath query by clicking the nodes in an expanding tree instead of typing the whole XPath query by hand. Our system supports most common XPath axes, such as child, descendant, predicate and so on. In order to handle XML documents in very large size, instead of loading the whole XML document into memory, we extracted a concise data synopsis termed structural summary from the original XML document to avoid the loading overhead for large XML document. We evaluated our system over the data from XMark and DBLP and our system can handle large XML documents up to gigabytes.
{"title":"VXPath: A Visual XPath Query Evaluator","authors":"Weimin He, Teng Lv, Matthew Meis, Ping Yan","doi":"10.1109/ICCIS.2012.362","DOIUrl":"https://doi.org/10.1109/ICCIS.2012.362","url":null,"abstract":"With the popularity of Extensible Markup Language (XML) as the new standard of data exchange on the web, a large number of data sources are represented or encoded in XML format. Therefore, querying and searching XML data on the web has attracted much attention in the database literature. In this research work, we developed a prototype software system named VXPath to facilitate the efficient evaluation of XPath queries over XML data. VXPath is a visual XPath query evaluator that allows the user to evaluate an XPath query by clicking the nodes in an expanding tree instead of typing the whole XPath query by hand. Our system supports most common XPath axes, such as child, descendant, predicate and so on. In order to handle XML documents in very large size, instead of loading the whole XML document into memory, we extracted a concise data synopsis termed structural summary from the original XML document to avoid the loading overhead for large XML document. We evaluated our system over the data from XMark and DBLP and our system can handle large XML documents up to gigabytes.","PeriodicalId":269967,"journal":{"name":"2012 Fourth International Conference on Computational and Information Sciences","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123351198","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}
A meshless model is developed to investigate behaviors of heat conduction in skin tissues. The model is established through combined use of Laplace transform (LT), radial basis function (RBF) and method of fundamental solution (MFS). The well-known Pennes bioheat model is used to describe the process of heat conduction in skin tissues. First, Laplace transform is applied to handle the time variable in the Pennes bioheat equation, which results in a generalized Helmholtz equation. Then, a RBF-MFS scheme is constructed to solve the Helmholtz equation in Laplace space. Further, Stefest's algorithm is employed to convert the results in Laplace space back into the time space. Finally, the performance of the proposed method is assessed by several benchmark examples. The results demonstrate desirable efficiency and accuracy of the proposed method.
{"title":"Numerical Simulation of Thermal Properties in 2D Biological Tissue by LT-RBF-MFS","authors":"Leilei Cao, J. Pei, Xuemin Zhang","doi":"10.1109/ICCIS.2012.193","DOIUrl":"https://doi.org/10.1109/ICCIS.2012.193","url":null,"abstract":"A meshless model is developed to investigate behaviors of heat conduction in skin tissues. The model is established through combined use of Laplace transform (LT), radial basis function (RBF) and method of fundamental solution (MFS). The well-known Pennes bioheat model is used to describe the process of heat conduction in skin tissues. First, Laplace transform is applied to handle the time variable in the Pennes bioheat equation, which results in a generalized Helmholtz equation. Then, a RBF-MFS scheme is constructed to solve the Helmholtz equation in Laplace space. Further, Stefest's algorithm is employed to convert the results in Laplace space back into the time space. Finally, the performance of the proposed method is assessed by several benchmark examples. The results demonstrate desirable efficiency and accuracy of the proposed method.","PeriodicalId":269967,"journal":{"name":"2012 Fourth International Conference on Computational and Information Sciences","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123428427","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 presents three accurate methods for finding simple roots of polynomials in floating point arithmetic. We present them by using the Compensated Horner algorithm to accurately compute the residual which can yield a full precision when the problem is ill-conditioned enough. Some numerical experiments are conducted to justify the proposed approaches.
{"title":"Some Accurate Methods for Finding Simple Roots of Polynomials in Floating Point Arithmetic","authors":"Peibing Du, Lizhi Cheng, Hao Jiang, Feicheng Wang","doi":"10.1109/ICCIS.2012.284","DOIUrl":"https://doi.org/10.1109/ICCIS.2012.284","url":null,"abstract":"This paper presents three accurate methods for finding simple roots of polynomials in floating point arithmetic. We present them by using the Compensated Horner algorithm to accurately compute the residual which can yield a full precision when the problem is ill-conditioned enough. Some numerical experiments are conducted to justify the proposed approaches.","PeriodicalId":269967,"journal":{"name":"2012 Fourth International Conference on Computational and Information Sciences","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122662278","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}
A new approach based on XML element and correlation was proposed to reflect users' fuzzy query intention. Based on the fuzzy sets theory, a fuzzy extension of XPath query expression was proposed, which can be expressed exploiting fuzzy predicates. Then fuzzy query relaxations were provided to get more querying results, which satisfy users' query requests. The proposed scoring method uses an extended vector space model, which considers the element correlation and inverse element frequency, when ranking these query results. According to the matching results, the elements whose scores are greater than the threshold are query results. Finally, the efficiency of the approach is demonstrated by experimental results.
{"title":"Fuzzy Query Based on XML Element and Correlation","authors":"Ruixia Li, Shoubao Su","doi":"10.1109/ICCIS.2012.161","DOIUrl":"https://doi.org/10.1109/ICCIS.2012.161","url":null,"abstract":"A new approach based on XML element and correlation was proposed to reflect users' fuzzy query intention. Based on the fuzzy sets theory, a fuzzy extension of XPath query expression was proposed, which can be expressed exploiting fuzzy predicates. Then fuzzy query relaxations were provided to get more querying results, which satisfy users' query requests. The proposed scoring method uses an extended vector space model, which considers the element correlation and inverse element frequency, when ranking these query results. According to the matching results, the elements whose scores are greater than the threshold are query results. Finally, the efficiency of the approach is demonstrated by experimental results.","PeriodicalId":269967,"journal":{"name":"2012 Fourth International Conference on Computational and Information Sciences","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123981945","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}
Compounded texture is an important method of texture mapping. Some texture samples build compounded texture by a certain rule or style, which can greatly enrich the expressiveness of ceramic product. This paper reviews the constraint of the various samples' texture synthesis method, uses OpenGL blend technology, constructs virtual texture, loads texture to ceramic product, realizes compounded texture mapping finally. This method is simple and effective, which will benefit innovative design of ceramic product.
{"title":"Application of Compounded Texture Mapping to Ceramic Product Design","authors":"Li Juan, Z. Lai","doi":"10.1109/ICCIS.2012.80","DOIUrl":"https://doi.org/10.1109/ICCIS.2012.80","url":null,"abstract":"Compounded texture is an important method of texture mapping. Some texture samples build compounded texture by a certain rule or style, which can greatly enrich the expressiveness of ceramic product. This paper reviews the constraint of the various samples' texture synthesis method, uses OpenGL blend technology, constructs virtual texture, loads texture to ceramic product, realizes compounded texture mapping finally. This method is simple and effective, which will benefit innovative design of ceramic product.","PeriodicalId":269967,"journal":{"name":"2012 Fourth International Conference on Computational and Information Sciences","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124197265","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}
Dealing with the problem of virtual network (VN) mapping in the environment of network virtualization, this paper proposes a decomposing mapping algorithm that generally focuses on the remaining network balance. The algorithm first decomposes a request of VN mapping into meta-requests, each of which is consisted of a pair of nodes and a virtual link. The second step is to search out a path set which meets the aforementioned meta-requests. From such a set, the algorithm selects a path that can achieve a relative balance of the remaining resources. Combining shortest-path algorithm and the depth first search strategy, our algorithm can find out a path that enables the remaining network to maintain a minimum degree of equilibrium. Minimizing the expense of VN construction, our algorithm at the same time pays an attention to the remaining resource balance of the substrate network. Compared with the overall planning based on multi-commodity flow and another approach that simply uses shortest-path algorithm, simulation results show that the proposed algorithm can improve the acceptance ratio of virtual network mapping requests.
{"title":"A Study on Virtual Network Decomposing Mapping Algorithm Based on Network Balance","authors":"Zhang Dong","doi":"10.1109/ICCIS.2012.55","DOIUrl":"https://doi.org/10.1109/ICCIS.2012.55","url":null,"abstract":"Dealing with the problem of virtual network (VN) mapping in the environment of network virtualization, this paper proposes a decomposing mapping algorithm that generally focuses on the remaining network balance. The algorithm first decomposes a request of VN mapping into meta-requests, each of which is consisted of a pair of nodes and a virtual link. The second step is to search out a path set which meets the aforementioned meta-requests. From such a set, the algorithm selects a path that can achieve a relative balance of the remaining resources. Combining shortest-path algorithm and the depth first search strategy, our algorithm can find out a path that enables the remaining network to maintain a minimum degree of equilibrium. Minimizing the expense of VN construction, our algorithm at the same time pays an attention to the remaining resource balance of the substrate network. Compared with the overall planning based on multi-commodity flow and another approach that simply uses shortest-path algorithm, simulation results show that the proposed algorithm can improve the acceptance ratio of virtual network mapping requests.","PeriodicalId":269967,"journal":{"name":"2012 Fourth International Conference on Computational and Information Sciences","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126271410","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 investigate the uniqueness problem on a conjecture of R. Bruck concerning meromorphic function sharing the set with its derivative, and obtain some results which improve the theorems given by Zhang and Yang, Chen and Shon.
{"title":"On a Conjecture of R. Brück Concerning Meromorphic Function Sharing a Set with Its Derivative","authors":"H. Xu","doi":"10.1109/ICCIS.2012.4","DOIUrl":"https://doi.org/10.1109/ICCIS.2012.4","url":null,"abstract":"In this paper, we investigate the uniqueness problem on a conjecture of R. Bruck concerning meromorphic function sharing the set with its derivative, and obtain some results which improve the theorems given by Zhang and Yang, Chen and Shon.","PeriodicalId":269967,"journal":{"name":"2012 Fourth International Conference on Computational and Information Sciences","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125738224","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}
The conventional algorithm of the BP neural network has some disadvantages such as in the vicinity of the target, if the learning factor is too small, the convergence may be too slow, and if the learning factor is too large, the convergence may be amended too much, leading to oscillations and even dispersing phenomenon. At the same time, the very slow speed of convergence and the main procedure is easily trapped into local minimum value. To tackle these problems, this paper optimizes the learning factor and the Sigmoid function, and improves the conventional BP neural network. The comparison of the results in the simulation analysis shows that the convergence and the accuracy of the improved algorithm are better than that of the conventional algorithm, and it has some intelligent advantages such as that the accuracy of the evaluation results can be improved by continuous self-learning, and there are not subjective factors interference in the application.
{"title":"An Improved BP Neural Network and Its Application","authors":"Rui Mou, Qinyin Chen, Minying Huang","doi":"10.1109/ICCIS.2012.68","DOIUrl":"https://doi.org/10.1109/ICCIS.2012.68","url":null,"abstract":"The conventional algorithm of the BP neural network has some disadvantages such as in the vicinity of the target, if the learning factor is too small, the convergence may be too slow, and if the learning factor is too large, the convergence may be amended too much, leading to oscillations and even dispersing phenomenon. At the same time, the very slow speed of convergence and the main procedure is easily trapped into local minimum value. To tackle these problems, this paper optimizes the learning factor and the Sigmoid function, and improves the conventional BP neural network. The comparison of the results in the simulation analysis shows that the convergence and the accuracy of the improved algorithm are better than that of the conventional algorithm, and it has some intelligent advantages such as that the accuracy of the evaluation results can be improved by continuous self-learning, and there are not subjective factors interference in the application.","PeriodicalId":269967,"journal":{"name":"2012 Fourth International Conference on Computational and Information Sciences","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124553362","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
扫码关注我们
求助内容：
应助结果提醒方式：