In this paper we first define and discuss the Newton andLagrange interpolations for a class of non-commutative polynomials called skew polynomials, and then use them to construct Shamir's secret sharing schemes.
{"title":"A Secret Sharing Scheme via Skew Polynomials","authors":"Yang Zhang","doi":"10.1109/ICCSA.2010.32","DOIUrl":"https://doi.org/10.1109/ICCSA.2010.32","url":null,"abstract":"In this paper we first define and discuss the Newton andLagrange interpolations for a class of non-commutative polynomials called skew polynomials, and then use them to construct Shamir's secret sharing schemes.","PeriodicalId":405597,"journal":{"name":"2010 International Conference on Computational Science and Its Applications","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122167412","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}
Deforming surfaces are present in scientific applications, movies and video games. In these fields, polygonal meshes are preferred to represent them. However, these meshes are usually complex and contain much more detail than is necessary for a given frame. A possible solution to efficiently manage such a large amount of information consists in using multiresolution modeling or level of detail. However, most of the work carried out in this respect has focused on managing static meshes, and only a few take advantage of using optimized primitives such as triangle strips or the new capabilities of current GPUs. In this paper, we present a view-dependent method for interactive rendering of keyframing animations in the GPU. Our strip-based approach is capable of managing the level of detail of this type of deforming meshes. We demonstrate the successful use of this method on the GPU. We can generate adaptive levels of detail during all frames of an animation in real-time while providing, at the same time, accurate approximations.
{"title":"Adaptive Keyframing Animation on the GPU Using Triangle Strips","authors":"Francisco Ramos, M. Chover, O. Ripolles","doi":"10.1109/ICCSA.2010.45","DOIUrl":"https://doi.org/10.1109/ICCSA.2010.45","url":null,"abstract":"Deforming surfaces are present in scientific applications, movies and video games. In these fields, polygonal meshes are preferred to represent them. However, these meshes are usually complex and contain much more detail than is necessary for a given frame. A possible solution to efficiently manage such a large amount of information consists in using multiresolution modeling or level of detail. However, most of the work carried out in this respect has focused on managing static meshes, and only a few take advantage of using optimized primitives such as triangle strips or the new capabilities of current GPUs. In this paper, we present a view-dependent method for interactive rendering of keyframing animations in the GPU. Our strip-based approach is capable of managing the level of detail of this type of deforming meshes. We demonstrate the successful use of this method on the GPU. We can generate adaptive levels of detail during all frames of an animation in real-time while providing, at the same time, accurate approximations.","PeriodicalId":405597,"journal":{"name":"2010 International Conference on Computational Science and Its Applications","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125263751","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}
Toshihiro Uchibayashi, B. Apduhan, N. Shiratori, J. Rahayu, D. Taniar
To efficiently utilize the large-scale ontology data distributed on the Semantic Grid is a problem issue of high concern. Sub-ontology extraction that reflects the user requirements is one method of addressing the issue. Large-scale ontology data can be optimized by extracting the required sub-ontology. In this paper, we construct a Semantic Grid prototype environment to extract the sub-ontology and conducted preliminary evaluation through illustrations using UMLSSN ontology data.
{"title":"On a Prototype Environment for Sub-ontology Extraction in Semantic Grid","authors":"Toshihiro Uchibayashi, B. Apduhan, N. Shiratori, J. Rahayu, D. Taniar","doi":"10.1109/ICCSA.2010.82","DOIUrl":"https://doi.org/10.1109/ICCSA.2010.82","url":null,"abstract":"To efficiently utilize the large-scale ontology data distributed on the Semantic Grid is a problem issue of high concern. Sub-ontology extraction that reflects the user requirements is one method of addressing the issue. Large-scale ontology data can be optimized by extracting the required sub-ontology. In this paper, we construct a Semantic Grid prototype environment to extract the sub-ontology and conducted preliminary evaluation through illustrations using UMLSSN ontology data.","PeriodicalId":405597,"journal":{"name":"2010 International Conference on Computational Science and Its Applications","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126986912","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}
Bonhyun Koo, Taewon Ahn, Jung-Whan In, Yongsuk Park, Taeshik Shon
RC (Remote Control) is a technology that can efficiently control and transfer a variety of user commands to CEs (Consumer Electronics). However, the existing RCs have been required various additional features such as communication between CEs, extension of communication range, low power-consumption and bi-directional communication according to the advent of new types of CE devices and its enhanced performance. Even though RC controller has many customers’ requests, it is not a simple solution because most legacies work on IR-based RC. In this paper, we propose RF4CE-based Universal Remote Control Framework using Smartphone in order to solve the many constraints of IR legacies. The proposed R-URC system is designed by RF4CE platform which is a kind of de-facto standard for CE remote control communication. From the verification scenarios using various CEs and smart phone, we can see that the proposed R-URC shows the good practical usage in terms of contents sharing and smart CE control.
{"title":"R-URC: RF4CE-Based Universal Remote Control Framework Using Smartphone","authors":"Bonhyun Koo, Taewon Ahn, Jung-Whan In, Yongsuk Park, Taeshik Shon","doi":"10.1109/ICCSA.2010.73","DOIUrl":"https://doi.org/10.1109/ICCSA.2010.73","url":null,"abstract":"RC (Remote Control) is a technology that can efficiently control and transfer a variety of user commands to CEs (Consumer Electronics). However, the existing RCs have been required various additional features such as communication between CEs, extension of communication range, low power-consumption and bi-directional communication according to the advent of new types of CE devices and its enhanced performance. Even though RC controller has many customers’ requests, it is not a simple solution because most legacies work on IR-based RC. In this paper, we propose RF4CE-based Universal Remote Control Framework using Smartphone in order to solve the many constraints of IR legacies. The proposed R-URC system is designed by RF4CE platform which is a kind of de-facto standard for CE remote control communication. From the verification scenarios using various CEs and smart phone, we can see that the proposed R-URC shows the good practical usage in terms of contents sharing and smart CE control.","PeriodicalId":405597,"journal":{"name":"2010 International Conference on Computational Science and Its Applications","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123099250","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 consider the problem of constructing the Voronoi diagram for a set of weighted lines in the plane. First, we examine the case when each of the given lines is assigned an additive real weight, and next---a more general case when each line is endowed with a linear function, and the distance between any point in the plane and a weighted line is given by the value of the associated linear function of the latter, to which the Euclidean distance between the point and the line is passed as the argument.Our proposed method is based on the wavefront propagation, and allows for an efficient computation of the respective Voronoi diagrams, as well as for the analysis of their structure and properties. Its advantage over the general approach to studying and constructing Voronoi diagrams, which, in our case, would require the computation of the lower envelope of a set of half-planes in three-dimensional space, lies in its relative simplicity.
{"title":"On Constructing the Voronoi Diagram for Lines in the Plane under a Linear-Function Distance","authors":"K. Vyatkina","doi":"10.1109/ICCSA.2010.40","DOIUrl":"https://doi.org/10.1109/ICCSA.2010.40","url":null,"abstract":"We consider the problem of constructing the Voronoi diagram for a set of weighted lines in the plane. First, we examine the case when each of the given lines is assigned an additive real weight, and next---a more general case when each line is endowed with a linear function, and the distance between any point in the plane and a weighted line is given by the value of the associated linear function of the latter, to which the Euclidean distance between the point and the line is passed as the argument.Our proposed method is based on the wavefront propagation, and allows for an efficient computation of the respective Voronoi diagrams, as well as for the analysis of their structure and properties. Its advantage over the general approach to studying and constructing Voronoi diagrams, which, in our case, would require the computation of the lower envelope of a set of half-planes in three-dimensional space, lies in its relative simplicity.","PeriodicalId":405597,"journal":{"name":"2010 International Conference on Computational Science and Its Applications","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122696557","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}
W. Kong, T. Shiraishi, Y. Mizushima, N. Katahira, Akira Fukuda, Masahiko Watanabe
State Transition Matrix (STM) is a table-based modeling language that has been frequently used in industry for specifying behavior of distributed systems. Functional correctness of a STM design (i.e., a design written in STM) could usually be expressed as invariant properties. In this paper, we first present a formalization of the static and dynamic aspects of a STM design. Consequentially, based on this formalization, we investigate a symbolic encoding approach for STM design, through which the design could be bounded model checked wrt. invariant properties by using Satisfiability Modulo Theories (SMT) solving technique. We have built a prototype implementation of the proposed encoding and the state-of-the-art SMT solver -- Yices is used in our experiments to evaluate the effectiveness of our approach.
{"title":"An SMT Approach to Bounded Model Checking of Design in State Transition Matrix","authors":"W. Kong, T. Shiraishi, Y. Mizushima, N. Katahira, Akira Fukuda, Masahiko Watanabe","doi":"10.1109/ICCSA.2010.57","DOIUrl":"https://doi.org/10.1109/ICCSA.2010.57","url":null,"abstract":"State Transition Matrix (STM) is a table-based modeling language that has been frequently used in industry for specifying behavior of distributed systems. Functional correctness of a STM design (i.e., a design written in STM) could usually be expressed as invariant properties. In this paper, we first present a formalization of the static and dynamic aspects of a STM design. Consequentially, based on this formalization, we investigate a symbolic encoding approach for STM design, through which the design could be bounded model checked wrt. invariant properties by using Satisfiability Modulo Theories (SMT) solving technique. We have built a prototype implementation of the proposed encoding and the state-of-the-art SMT solver -- Yices is used in our experiments to evaluate the effectiveness of our approach.","PeriodicalId":405597,"journal":{"name":"2010 International Conference on Computational Science and Its Applications","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114692124","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 evolution of Grid technology, it has become possible to connect resources (service providers or consumers) topologically spread apart falling in different administrative domains. The users or applications submitting multiple storage requests are managed through scheduling arrangements in a centralized manner. The distribution and allocation of the storage requests therefore occurs oblivious of the efficiency and engagements of the underlying resources. The authors propose a model of Storage Grid Federation motivated by concept of Grid Federation constituted of computational resources formulated through peer level coupling. The algorithm is designed for the resource management with a decentralized approach incorporating policies capable of resource monitoring through entities like Storage Federation Agents so as to yield to higher autonomy. The preferences of the consumers are well accessed such as budget, negotiation policies, a specific need of storage and protocol of the organization they belong to. The design includes penal clause and discounts in accordance to a service level agreement while offering Storage Grid services at specified time in future. The goal is achieved through creating number of Storage Federation Agents that are competent to cater to local Resource Service Provider policies. The SFA resource managers are competent to ensure load balancing before distribution of storage requests. The proposed algorithm allows negotiation with SFAs in addition to the local and remote SFAs falling in different domains and hence improving upon its previous federation model based on computational resources only.
{"title":"An Economy Based Storage Grid Federation with a Decentralized Scheduling Technique","authors":"Ravin Ahuja, Asok De, G. Gabrani","doi":"10.1109/ICCSA.2010.61","DOIUrl":"https://doi.org/10.1109/ICCSA.2010.61","url":null,"abstract":"With the evolution of Grid technology, it has become possible to connect resources (service providers or consumers) topologically spread apart falling in different administrative domains. The users or applications submitting multiple storage requests are managed through scheduling arrangements in a centralized manner. The distribution and allocation of the storage requests therefore occurs oblivious of the efficiency and engagements of the underlying resources. The authors propose a model of Storage Grid Federation motivated by concept of Grid Federation constituted of computational resources formulated through peer level coupling. The algorithm is designed for the resource management with a decentralized approach incorporating policies capable of resource monitoring through entities like Storage Federation Agents so as to yield to higher autonomy. The preferences of the consumers are well accessed such as budget, negotiation policies, a specific need of storage and protocol of the organization they belong to. The design includes penal clause and discounts in accordance to a service level agreement while offering Storage Grid services at specified time in future. The goal is achieved through creating number of Storage Federation Agents that are competent to cater to local Resource Service Provider policies. The SFA resource managers are competent to ensure load balancing before distribution of storage requests. The proposed algorithm allows negotiation with SFAs in addition to the local and remote SFAs falling in different domains and hence improving upon its previous federation model based on computational resources only.","PeriodicalId":405597,"journal":{"name":"2010 International Conference on Computational Science and Its Applications","volume":"544 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132415429","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. Zakrzewska, L. Koszalka, I. Pozniak-Koszalka, A. Kasprzak
The objective of the paper is to evaluate and compare proactive and reactive routing protocols designed for ad hoc networks and adapted to Wireless Mesh Networks. The analysis of protocol performance is based on the results of multistage simulations made for UDP traffic and TCP traffic, moreover, for both - a normal working network and the network with selfish node injected. We recommend using particular protocols in certain conditions.
{"title":"Analysis of Routing Protocol Performance in Wireless Mesh Networks","authors":"A. Zakrzewska, L. Koszalka, I. Pozniak-Koszalka, A. Kasprzak","doi":"10.1109/ICCSA.2010.72","DOIUrl":"https://doi.org/10.1109/ICCSA.2010.72","url":null,"abstract":"The objective of the paper is to evaluate and compare proactive and reactive routing protocols designed for ad hoc networks and adapted to Wireless Mesh Networks. The analysis of protocol performance is based on the results of multistage simulations made for UDP traffic and TCP traffic, moreover, for both - a normal working network and the network with selfish node injected. We recommend using particular protocols in certain conditions.","PeriodicalId":405597,"journal":{"name":"2010 International Conference on Computational Science and Its Applications","volume":"265 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132699426","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}
Ontology is the basis component of the Semantic Web. Since constructing ontologies is a time consuming job for domain experts, many researches are conducted on automatic extraction of ontologies from texts. As the development of folksonomy, more and more researchers have realized that folksonomy is a better knowledge source for constructing ontologies than texts. Although some works have already been proposed to extract ontologies from folksonomies, these works have little consideration on what a more acceptable and applicable ontology for users should be, and lack an principle to supervise the ontology extraction from a human’s perspective. According to the study in cognitive psychology, there is a family of concepts named basic level concepts, which are frequently used by people in daily life, and most human knowledge is expressed using basic level concepts. In this paper, inspired by studies in cognitive psychology, we try to extract ontologies with basic level concepts from folksonomies. To the best of our knowledge, it is the first work on discovering basic level concepts in folksonomies and using them to construct ontologies.
{"title":"An Unsupervised Method of Exploring Ontologies from Folksonomies","authors":"Wen-hao Chen, Y. Cai, Ho-fung Leung","doi":"10.1109/ICCSA.2010.78","DOIUrl":"https://doi.org/10.1109/ICCSA.2010.78","url":null,"abstract":"Ontology is the basis component of the Semantic Web. Since constructing ontologies is a time consuming job for domain experts, many researches are conducted on automatic extraction of ontologies from texts. As the development of folksonomy, more and more researchers have realized that folksonomy is a better knowledge source for constructing ontologies than texts. Although some works have already been proposed to extract ontologies from folksonomies, these works have little consideration on what a more acceptable and applicable ontology for users should be, and lack an principle to supervise the ontology extraction from a human’s perspective. According to the study in cognitive psychology, there is a family of concepts named basic level concepts, which are frequently used by people in daily life, and most human knowledge is expressed using basic level concepts. In this paper, inspired by studies in cognitive psychology, we try to extract ontologies with basic level concepts from folksonomies. To the best of our knowledge, it is the first work on discovering basic level concepts in folksonomies and using them to construct ontologies.","PeriodicalId":405597,"journal":{"name":"2010 International Conference on Computational Science and Its Applications","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133493103","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 : 2010-03-23DOI: 10.1080/02533839.2012.725821
K. Liao, C. Chen
A Taylor-type crystalline plasticity model, implemented into the commercial finite element analysis software, is coded as a subroutine to investigate the behavior of a stainless steel sheet with a body centered cubic (BCC) structure in the current study. Thickness variations of the sheet are examined under the micro-groove formation procedures. Effects of the spatial distribution of crystallographic orientations on the thickness distribution over the sheet are also demonstrated. Numerical results, based on the sheet with textured orientations, are in good agreement with the associated experimental measurements reported in the literature.
{"title":"Analysis of Micro/mesoscale Sheet Stamping Processes Based on Crystalline Plasticity Model","authors":"K. Liao, C. Chen","doi":"10.1080/02533839.2012.725821","DOIUrl":"https://doi.org/10.1080/02533839.2012.725821","url":null,"abstract":"A Taylor-type crystalline plasticity model, implemented into the commercial finite element analysis software, is coded as a subroutine to investigate the behavior of a stainless steel sheet with a body centered cubic (BCC) structure in the current study. Thickness variations of the sheet are examined under the micro-groove formation procedures. Effects of the spatial distribution of crystallographic orientations on the thickness distribution over the sheet are also demonstrated. Numerical results, based on the sheet with textured orientations, are in good agreement with the associated experimental measurements reported in the literature.","PeriodicalId":405597,"journal":{"name":"2010 International Conference on Computational Science and Its Applications","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114561244","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
扫码关注我们
求助内容：
应助结果提醒方式：