Spelling suggestions: "subject:"sets (amathematics)"" "subject:"sets (bmathematics)""
1 
Untersuchungen über kurvennetze ohne umwege ...Reckers, Otto Anton, January 1910 (has links)
Inaug.diss.Münster. / Cover title. Lebenslauf.

2 
Petri nets and their applicationsJin, Wei January 1991 (has links)
Petri nets are named in honor of Dr. Carl A. Petri for his famous Ph.D dissertation of general net theory in 1962. A substantial amount of work utilizing and modifying the Petri nets has been done since then, and they have turned out to be very useful in the study of asynchronous concurrent systems. The liveness and reachability problems are considered to be some of the major problems in Petri net theory.Since the structure of a Petri net can be regarded as sets of places and transitions form a graphical point of view, this thesis is concerned with utilizing the results of graph theory to investigate the liveness in terms of deadlock problems of a special subclass of Petri nets, freechoice Petri nets. As a subclass of Petri nets, the class of freechoice Petri nets possesse relatively strong analysis properties. This is especially true of complete freechoice Petri nets. We show in particular that any system which can be modeled by a general Petri net can also be modeled by a freechoice Petri net. / Department of Computer Science

3 
Untersuchungen über kurvennetze ohne umwege ...Reckers, Otto Anton, January 1910 (has links)
Inaug.diss.Münster. / Cover title. Lebenslauf.

4 
Concerning the Convergence of Some NetsShaw, Jack V. 08 1900 (has links)
This thesis discusses the convergence of nets through a series of theorems and proofs.

5 
Probability driven heuristic netsCarter, Lynn Robert 25 July 1974 (has links)
Let a probability driven switch be defined as a switch of three input paths and three output paths. The status of the input paths defines a probability for each output path (as to whether it will generate a signal or not.) One output path is linked to one input path, so the results of the switch at time t can affect the switch at time t+1. A switch so constructed can be defined (by the probabilities) to take on the function of the standard logic gates (AND, OR, …) A net constructed of these switches can be “taught” by “reward” and “punish” algorithms to recognize input patterns. A simulation model showed that a repetitive learning algorithm coupled with a base knowledge (where new patterns are learned while continually checking past learned patterns) gives best results as a function of time. A good measure for the level of stability in response is to notice how many probabilities have converged to one or zero. The larger the number, the more stable the net.

6 
Digital nets and sequences for quasiMonte Carlo methodsHong, Hee Sun 01 January 2002 (has links)
No description available.

7 
The MooreSmith LimitAlexander, Donnie B. January 1952 (has links)
It is the purpose of this thesis to indicate in more detail how various limits defined in analysis, as well as other concepts not ordinarily defined as limits, may be obtained as special cases of the MooreSmith limit.

8 
Applications of quasiMonte Carlo methods in modelrobust response surface designsYue, Rongxian 01 January 1997 (has links)
No description available.

9 
The logic of systems.Furtek, Frederick Curtis January 1976 (has links)
Thesis. 1976. Ph.D.Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. / Microfiche copy available in Archives and Engineering. / Bibliography: p.173174. / Ph.D.

10 
Decidability questions for Petri Nets.Hack, Michel Henri Théodore January 1976 (has links)
Thesis. 1976. Ph.D.Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. / Microfiche copy available in Archives and Engineering. / Vita. / Bibliography: leaves 188193. / Ph.D.

Page generated in 0.1237 seconds