Probabilistic Verification Beyond Context-Freeness
Probabilistic pushdown automata (recursive state machines) are a widely known model of probabilistic computation associated with many decidable problems concerning termination (time) and lineartime model checking. Higher-order recursion schemes (HORS) are a prominent formalism for the analysis of higher-order computation.
Li, G, Murawski, A, Ong, C-H
openaire +2 more sources
Effect of Refining Intensity on Pulp and Paper Properties Made of Eucalyptus Camaldulensis Wood [PDF]
This study is for identifying of the effect of refining intensity on pulp and paper properties made from eucalyptuswood. For this purpose three normal eucalyptus camaldulensis spp trees were randomly cut down from Shastkolateh Experimental Forest ...
Behzad Kord
doaj +1 more source
Weighted Envy-freeness in Indivisible Item Allocation [PDF]
We introduce and analyze new envy-based fairness concepts for agents with weights that quantify their entitlements in the allocation of indivisible items.
Mithun Chakraborty +2 more
semanticscholar +1 more source
Topological freeness for C⁎-correspondences [PDF]
We have updated the list of references, fixed some typos and made other minor improvements.
Toke Meier Carlsen +2 more
openaire +4 more sources
Effect of boiling water pre-treatment on the yield, physical, optical and mechanical properties of neutral sulfite semi chemical pulp from wheat straw [PDF]
In this study, the effect of boiling water pre-treatment on yield, optical, physical and mechanical properties of NSSC (Neutral Sulfite Semi Chemical) pulp from Zagroos wheat straw (Golestan province) was investigated.
ahmad saraiyan, soodeh zhand
doaj +1 more source
Investigation on the effect of cellulose fiber surface characteristics on mechanical properties of cellulose fiber /polypropylene composite [PDF]
In this research the effect of softwood cellulose fibers surface characteristics on mechanical properties of cellulose fibers / polypropylene composite (W.P.C) was studied.
shahram Badamchi +3 more
doaj +1 more source
Flip-Flop P Systems With Proteins on Membranes in a Time-Free Manner
Flip-flop P systems with proteins are a bio-inspired variant of cell-like P systems in membrane computing, where proteins can control the execution of rules.
Xiaoming Wan, Yi Liu, Yueguo Luo
doaj +1 more source
Comparing Approximate Relaxations of Envy-Freeness [PDF]
In fair division problems with indivisible goods it is well known that one cannot have any guarantees for the classic fairness notions of envy-freeness and proportionality.
Georgios Amanatidis +2 more
semanticscholar +1 more source
Time-freeness and clock-freeness and related concepts in P systems
In the majority of models of P systems, rules are applied at the ticks of a global clock and their products are introduced into the system for the following step. In timed P systems, di erent integer durations are statically assigned to rules; time-free P systems are P systems yielding the same languages independently of these durations.
Alhazov, Artiom +4 more
openaire +6 more sources
Contraction: A Unified Perspective of Correlation Decay and Zero-Freeness of 2-Spin Systems [PDF]
We study the connection between the correlation decay property (more precisely, strong spatial mixing) and the zero-freeness of the partition function of 2-spin systems on graphs of bounded degree.
Shuai Shao, Yuxin Sun
semanticscholar +1 more source

