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 on...

Managing heat is a major challenge to meet future demands for a sustainable use of our energy resources. This requires materials, which can be custom-designed to exhibit specific temperature-dependent thermal transport properties to become integrated into thermal switches, transistors, or diodes. Common crystalline and amorphous materials are not suitable, owing to their gradual changes of the ...

. in order to study the variation for seed yield and its components, 200 accessions of alfalfa (medicago sativa l.) were sown as drilled plots, using alpha designs/unreplicated with two repeated entries with in all of 10 blocks under dry land farming system in kabodarahang research station, hamadan, iran, during 2010 to 2011. data were analyzed for descriptive statistics, correlation, regressio...

A scroll compressor concept is presented which has a very unique method of eliminating the inherent overturning or tipping moment associated with conventional orbiting scrolls. This design is a high~side compressor with axial compliance. An innovative gas discharge path from the involute effectively reduces the height of the assembly. A special offset is placed in the location of the involute, ...

1. Embedding the complete binary tree in low-dimensional `1. Let Tn (Vn , En) be the complete binary tree of height n (so it has 2n+1 − 1 vertices). For two vertices x , y ∈ Vn , let dTn (x , y) denote the length of the (unique) shortest-path between them in Tn . Our goal in this problem will be to nd a map f : Vn → ’k so that k is small and the map has small distortion in the `1 norm: dTn (x ,...

In this paper, we present several methods to improve the evaluation of homomorphic functions, both for fully and for leveled homomorphic encryption. We propose two packing methods, in order to decrease the expansion factor and optimize the evaluation of look-up tables and random functions in TRGSW-based homomorphic schemes. We also extend the automata logic, introduced in [19, 12], to the effic...

The max tree-height of an undirected graph is the longest possible length of a path among all spanning trees of the graph. A maximum height spanning tree of an undirected graph is a spanning tree that has a path of length equal to the max tree-height of the graph. Finding the max tree-height of a graph, or similarly some spanning tree of maximum height, is an NP-hard optimization problem for wh...