This workshop is co-organized with Kobe Studio Seminar for Studies with Renderman.
There are some requests. Please read the Japanese page carefully.
I explain how we investigate the possibilities between art, mathematics, computer science, and computer graphics, to get a trade-off of practical and theoretical richness via movie scripts, storyboards and scene description as a view from our current production, for researchers.
references:
From the viewpoint of symbolic-numeric people, we will survey on some recent methods in numerical computations and symbolic algebraic computations. Especially the methodology involved in their similarities is our interest, which may be applicable to other topics in this workshop. Participants are expected to have basics of numerical or symbolic computations.
You may find the basics of numerical or symbolic computations: Algorithms for Computer Algebra Systems, by M.Noro (PDF, in Japanese) in Risa/Asir Download Page for symbolic computation and Prof. Oishi's website for numerical computation with guaranteed accuracy.
For the information beyond the basics on symbolic algebraic computation, you may read the text book "Modern Computer Algebra" by Joachim von zur Gathen and Juergen Gerhard.
A semidefinite programming (SDP) is the problem of minimizing a linear function over the intersection an affine space and a cone of positive semidefinite matrices. It is one of the convex programming problems and can be solved efficiently in practice by primal-dual interior-point methods. Since SDP can deal with a linear matrix inequality, it is used in the various fields, such as control, statistics and machine learning. Furthermore, some approaches which use SDP are proposed to solve non-convex optimization problems. In this talk, we introduce SDP and recent results on SDP.
From the viewpoint of researchers studying applications of Computer Algebra　to control theory, we will report some results on the study of symbolic Generalized KYP Lemma. Basic knowledge of linear differential equations and Computer Algebra is required.
It is often said that many of software failures have roots in their ambiguous requirement specifications in the concept phase. It is because the ambiguity obscures contradictions in the specifications. Therefore writing explicit specifications are very important. However, it is very difficult to write such specifications because nothing has been decided explicitly in the early stages of the software lifecycle. We only have a rough picture, which is not enough to write an explicit specifications to verify their consistency by formal methods, of the whole system at that time.
In this talk, we introduce some challenges of writing the concept phase specifications by using semi-formal methods. Even though the details of system have not been decided in such early stage, the semi-formal methods seem to be enough to describe the whole structure of arguments which guarantees compliance of their safety functions with international standards, as IEC62278, of safety functionality.