Program slice has many applications such as program debugging, testing, maintenance, and complexity measurement. A static slice consists of all statements in program P that may effect the value of variable v a...Program slice has many applications such as program debugging, testing, maintenance, and complexity measurement. A static slice consists of all statements in program P that may effect the value of variable v at some point p , and a dynamic slice consists only of statements that influence the value of variable occurrence for specific program inputs. In this paper, we concern the problem of dynamic slicing of object oriented programs which, to our knowledge, has not been addressed in the literatures. To solve this problem, we present the dynamic object oriented dependence graph (DODG)which is an arc classified digraph to explicitly represent various dynamic dependence between statement instances for a particular execution of an object oriented program. Based on the DODG, we present a two phase backward algorithm for computing a dynamic slice of an object oriented program.展开更多
Two multi-objective programming models are built to describe Pilots’ full flight simulator (FFS) recurrent training (PFRT) problem. There are two objectives for them. One is the best matching of captains and copilots...Two multi-objective programming models are built to describe Pilots’ full flight simulator (FFS) recurrent training (PFRT) problem. There are two objectives for them. One is the best matching of captains and copilots in the same aircraft type. The other is that pilots could attend his training courses at proper month. Usually the two objectives are conflicting because there are copilots who will promote to captains or transfer to other aircraft type and new trainees will enter the company every year. The main theme in the research is to find the final non-inferior solutions of PFRT problem. Graph models are built to help to analyze the problem and we convert the original problem into a longest-route problem with weighted paths. An algorithm is designed with which we can obtain all the non-inferior solutions by a graphic method. A case study is present to demonstrate the effectiveness of the algorithm as well.展开更多
We have often heard remarks such as “We can plot graphs from the mathematical equations”, including equations of lines, equations of curves, and equations of invisible and visible objects. Actually, we can present e...We have often heard remarks such as “We can plot graphs from the mathematical equations”, including equations of lines, equations of curves, and equations of invisible and visible objects. Actually, we can present each object by mathematical equation and we can plot graphs from equations. Equations not only show visible objects but also can show invisible objects such as wave equations in differential equations. In fact, the change of equations is also to conduce the change of objects and phenomena. This paper presents mathematical equations, methods to plot the graphs in 2D and 3D space. The paper is also a small proof of this conclusion have been provided and addressing visualization problem for any object. The novelty of this paper presents some special equations of objects and shows the ideas to build objects from equations.展开更多
文摘Program slice has many applications such as program debugging, testing, maintenance, and complexity measurement. A static slice consists of all statements in program P that may effect the value of variable v at some point p , and a dynamic slice consists only of statements that influence the value of variable occurrence for specific program inputs. In this paper, we concern the problem of dynamic slicing of object oriented programs which, to our knowledge, has not been addressed in the literatures. To solve this problem, we present the dynamic object oriented dependence graph (DODG)which is an arc classified digraph to explicitly represent various dynamic dependence between statement instances for a particular execution of an object oriented program. Based on the DODG, we present a two phase backward algorithm for computing a dynamic slice of an object oriented program.
文摘Two multi-objective programming models are built to describe Pilots’ full flight simulator (FFS) recurrent training (PFRT) problem. There are two objectives for them. One is the best matching of captains and copilots in the same aircraft type. The other is that pilots could attend his training courses at proper month. Usually the two objectives are conflicting because there are copilots who will promote to captains or transfer to other aircraft type and new trainees will enter the company every year. The main theme in the research is to find the final non-inferior solutions of PFRT problem. Graph models are built to help to analyze the problem and we convert the original problem into a longest-route problem with weighted paths. An algorithm is designed with which we can obtain all the non-inferior solutions by a graphic method. A case study is present to demonstrate the effectiveness of the algorithm as well.
文摘We have often heard remarks such as “We can plot graphs from the mathematical equations”, including equations of lines, equations of curves, and equations of invisible and visible objects. Actually, we can present each object by mathematical equation and we can plot graphs from equations. Equations not only show visible objects but also can show invisible objects such as wave equations in differential equations. In fact, the change of equations is also to conduce the change of objects and phenomena. This paper presents mathematical equations, methods to plot the graphs in 2D and 3D space. The paper is also a small proof of this conclusion have been provided and addressing visualization problem for any object. The novelty of this paper presents some special equations of objects and shows the ideas to build objects from equations.
