Pauline N. Kawamoto

Work in Progress: Sharing Learning Resources in the Development of an Online Engineering Presentations Course

Good presentation skills are almost always among the most valuable and most desirable skills in engineers, but there are few educational examples on the Web for students to see how engineers actually practice such an important skill. In this project, our goal is to create online courseware for teaching presentation skills to engineering students by pooling the learning resources available on campus - English presentation teachers and trainers, actual students presenting at international conferences - and showcasing examples of how engineers apply these lessons to real presentations. We use multimedia authoring tools to generate the contents and combine them with student testing and logging elements to create a completely open online courseware package for students to learn technical presentation skills and watch how others learned as well

A set of time dependent fuzzy membership functions and its compactness

By regarding the set of fuzzy membership functions as a subset of the set of functions which depend on time, we show compactness in weak topology. We prove also that the function which composes the control of the function given by the center of gravity calculation is continuous for the topology of pointwise convergence. As an application, we discuss the existence of an optimal solution in fuzzy control for an open-loop system.

The Formalization of Decision-Free Petri Net

Summary In this article we formalize the definition of Decision-Free Petri Net (DFPN) presented in [19]. Then we formalize the concept of directed path and directed circuit nets in Petri nets to prove properties of DFPN. We also present the definition of firing transitions and transition sequences with natural numbers marking that always check whether transition is enabled or not and after firing it only removes the available tokens (i.e., it does not remove from zero number of tokens). At the end of this article, we show that the total number of tokens in a circuit of decision-free Petri net always remains the same after firing any sequences of the transition.

Formulation of Cell Petri Nets

Abstract Based on the Petri net definitions and theorems already formalized in the Mizar article [13], in this article we were able to formalize the definition of cell Petri nets. It is based on [12]. Colored Petri net has already been defined in [11]. In addition, the conditions of the firing rule and the colored set to this definition, that defines the cell Petri nets are further extended to CPNT.i further. The synthesis of two Petri nets was introduced in [11] and in this work the definition is extended to produce the synthesis of a family of colored Petri nets. Specifically, the extension to a CPNT family is performed by specifying how to link the outbound transitions of each colored Petri net to the place elements of other nets to form a neighborhood relationship. Finally, the activation of colored Petri nets was formalized.