Pub Date : 2009-09-01DOI: 10.1142/9789814280945_0021
M. Fiorini
{"title":"Lepton universality test and the $K^+ to pi^+ nu overline{nu}$ experiment at the CERN SPS","authors":"M. Fiorini","doi":"10.1142/9789814280945_0021","DOIUrl":"https://doi.org/10.1142/9789814280945_0021","url":null,"abstract":"","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":"1 1","pages":"214-218"},"PeriodicalIF":0.8,"publicationDate":"2009-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"64060508","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-09-01DOI: 10.1142/9789814280945_0057
M. A. Ward
{"title":"NOVEL PHOTO-SENSORS FOR THE T2K EXPERIMENT","authors":"M. A. Ward","doi":"10.1142/9789814280945_0057","DOIUrl":"https://doi.org/10.1142/9789814280945_0057","url":null,"abstract":"","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":"11 1","pages":"393-397"},"PeriodicalIF":0.8,"publicationDate":"2009-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"64060619","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
J. V. D. Werf, B. V. Dongen, C. Hurkens, Alexander Serebrenik
The research domain of process discovery aims at constructing a process model (e.g. a Petri net) which is an abstract representation of an execution log. Such a model should (1) be able to reproduce the log under consideration and (2) be independent of the number of cases in the log. In this paper, we present a process discovery algorithm where we use concepts taken from the language-based theory of regions, a well-known Petri net research area. We identify a number of shortcomings of this theory from the process discovery perspective, and we provide solutions based on integer linear programming.
{"title":"Process Discovery using Integer Linear Programming","authors":"J. V. D. Werf, B. V. Dongen, C. Hurkens, Alexander Serebrenik","doi":"10.3233/FI-2009-136","DOIUrl":"https://doi.org/10.3233/FI-2009-136","url":null,"abstract":"The research domain of process discovery aims at constructing a process model (e.g. a Petri net) which is an abstract representation of an execution log. Such a model should (1) be able to reproduce the log under consideration and (2) be independent of the number of cases in the log. In this paper, we present a process discovery algorithm where we use concepts taken from the language-based theory of regions, a well-known Petri net research area. We identify a number of shortcomings of this theory from the process discovery perspective, and we provide solutions based on integer linear programming.","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":"3 1","pages":"368-387"},"PeriodicalIF":0.8,"publicationDate":"2009-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75385146","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In 1978, G. Plotkin [7] conjectured that for the three-element truthvalue dcpo T, if κ > ω then the function space [T$^{κ}$ → T$^{κ}$] is not a retract of T$^{κ}$. In this short paper, we constructively prove a stronger result that if κ > ω then the function space [T$^{κ}$ → T$^{κ}$] is not a retract of the Cartesian product of any family of finite posets. Thus Plotkin's Conjecture is proved to be correct.
{"title":"A Proof of Plotkin's Conjecture","authors":"Yinbin Lei, Mao-kang Luo","doi":"10.3233/FI-2009-0076","DOIUrl":"https://doi.org/10.3233/FI-2009-0076","url":null,"abstract":"In 1978, G. Plotkin [7] conjectured that for the three-element truthvalue dcpo T, if κ > ω then the function space [T$^{κ}$ → T$^{κ}$] is not a retract of T$^{κ}$. In this short paper, we constructively prove a stronger result that if κ > ω then the function space [T$^{κ}$ → T$^{κ}$] is not a retract of the Cartesian product of any family of finite posets. Thus Plotkin's Conjecture is proved to be correct.","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":"92 1","pages":"301-306"},"PeriodicalIF":0.8,"publicationDate":"2009-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.3233/FI-2009-0076","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"69903350","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Consider a Markovian Petri net with race policy. The marking process has a “product form” stationary distribution if the probability of viewing a given marking can be decomposed as the product over places of terms depending only on the local marking. First we observe that the Deficiency Zero Theorem of Feinberg, developed for chemical reaction networks, provides a structural and simple sufficient condition for the existence of a product form. In view of this, we study the classical subclass of free-choice nets. Roughly, we show that the only Petri nets of this class which have a product form are the state machines, which can alternatively be viewed as Jackson networks.
{"title":"Deficiency Zero Petri Nets and Product Form","authors":"J. Mairesse, H. Nguyen","doi":"10.3233/FI-2010-366","DOIUrl":"https://doi.org/10.3233/FI-2010-366","url":null,"abstract":"Consider a Markovian Petri net with race policy. The marking process has a “product form” stationary distribution if the probability of viewing a given marking can be decomposed as the product over places of terms depending only on the local marking. First we observe that the Deficiency Zero Theorem of Feinberg, developed for chemical reaction networks, provides a structural and simple sufficient condition for the existence of a product form. In view of this, we study the classical subclass of free-choice nets. Roughly, we show that the only Petri nets of this class which have a product form are the state machines, which can alternatively be viewed as Jackson networks.","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":"25 1","pages":"103-122"},"PeriodicalIF":0.8,"publicationDate":"2009-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79322221","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper we study the reachability problem for parametric flat counter automata, in relation with the satisfiability problem of three fragments of integer arithmetic. The equivalence between non-parametric flat counter automata and Presburger arithmetic has been established previously by Comon and Jurski. We simplify their proof by introducing finite state automata defined over alphabets of a special kind of graphs (zigzags). This framework allows one to express also the reachability problem for parametric automata with one control loop as the satisfiability of a 1-parametric linear Diophantine systems. The latter problem is shown to be decidable, using a number-theoretic argument. In general, the reachability problem for parametric flat counter automata with more than one loops is shown to be undecidable, by reduction from Hilbert's Tenth Problem. Finally, we study the relation between flat counter automata, integer arithmetic, and another important class of computational devices, namely the 2-way reversal bounded counter machines.
{"title":"Flat Parametric Counter Automata","authors":"M. Bozga, Radu Iosif, Y. Lakhnech","doi":"10.3233/FI-2009-0044","DOIUrl":"https://doi.org/10.3233/FI-2009-0044","url":null,"abstract":"In this paper we study the reachability problem for parametric flat counter automata, in relation with the satisfiability problem of three fragments of integer arithmetic. The equivalence between non-parametric flat counter automata and Presburger arithmetic has been established previously by Comon and Jurski. We simplify their proof by introducing finite state automata defined over alphabets of a special kind of graphs (zigzags). This framework allows one to express also the reachability problem for parametric automata with one control loop as the satisfiability of a 1-parametric linear Diophantine systems. The latter problem is shown to be decidable, using a number-theoretic argument. In general, the reachability problem for parametric flat counter automata with more than one loops is shown to be undecidable, by reduction from Hilbert's Tenth Problem. Finally, we study the relation between flat counter automata, integer arithmetic, and another important class of computational devices, namely the 2-way reversal bounded counter machines.","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":"48 1","pages":"577-588"},"PeriodicalIF":0.8,"publicationDate":"2009-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91220069","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
P. Bonizzoni, C. Ferretti, A. R. S. Mary, G. Mauri
We propose a new formalism for generating picture languages based on an assembly mechanism of tiles that uses rules having a context and a replacement site. More precisely, a picture language will be generated from a finite set of initial pictures by iteratively applying rewriting rules from a given finite set of rules, called a tiling rule system (TRuS system). We prove that the TRuS systems have a greater generative capacity than the tiling systems of Giammarresi and Restivo. This is due mainly to the use of the notion of replacement site, but we further characterize the difference between these systems by comparing them to Wang systems.
{"title":"Picture Languages Generated by Assembling Tiles","authors":"P. Bonizzoni, C. Ferretti, A. R. S. Mary, G. Mauri","doi":"10.3233/FI-2011-529","DOIUrl":"https://doi.org/10.3233/FI-2011-529","url":null,"abstract":"We propose a new formalism for generating picture languages based on an assembly mechanism of tiles that uses rules having a context and a replacement site. More precisely, a picture language will be generated from a finite set of initial pictures by iteratively applying rewriting rules from a given finite set of rules, called a tiling rule system (TRuS system). We prove that the TRuS systems have a greater generative capacity than the tiling systems of Giammarresi and Restivo. This is due mainly to the use of the notion of replacement site, but we further characterize the difference between these systems by comparing them to Wang systems.","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":"46 33 1","pages":"224-235"},"PeriodicalIF":0.8,"publicationDate":"2009-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80521070","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This article proposes an approximation of the tree edit distance through the string edit distance for binary tree codes, instead of for Euler strings introduced by Akutsu (2006). Here, a binary tree code is a string obtained by traversing a binary tree representation with two kinds of dummy nodes of a tree in preorder. Then, we show that σ/2 ≤ τ ≤ (h + 1)σ + h, where τ is the tree edit distance between trees, and σ is the string edit distance between their binary tree codes and h is the minimum height of the trees.
{"title":"Approximating Tree Edit Distance through String Edit Distance for Binary Tree Codes","authors":"Taku Aratsu, K. Hirata, T. Kuboyama","doi":"10.3233/FI-2010-282","DOIUrl":"https://doi.org/10.3233/FI-2010-282","url":null,"abstract":"This article proposes an approximation of the tree edit distance through the string edit distance for binary tree codes, instead of for Euler strings introduced by Akutsu (2006). Here, a binary tree code is a string obtained by traversing a binary tree representation with two kinds of dummy nodes of a tree in preorder. Then, we show that σ/2 ≤ τ ≤ (h + 1)σ + h, where τ is the tree edit distance between trees, and σ is the string edit distance between their binary tree codes and h is the minimum height of the trees.","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":"18 1","pages":"93-104"},"PeriodicalIF":0.8,"publicationDate":"2009-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87860471","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Application of Concurrency to System Design, Preface to the Seventh Special Issue","authors":"R. Janicki, M. Koutny, J. Billington","doi":"10.3233/FI-2009-139","DOIUrl":"https://doi.org/10.3233/FI-2009-139","url":null,"abstract":"","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":"1 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2009-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.3233/FI-2009-139","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"69903362","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Petitcolas has proposed a steganographic technique called MP3Stego which can hide secret messages in a MP3 audio. This technique is well-known because of its high capacity. However, in rare cases, the normal audio encoding process will be terminated due to the endless loop problem caused by embedding operation. In addition, the statistical undetectability of MP3Stego can be further improved. Inspired by MP3Stego, a new steganographic method for MP3 audio is proposed in this paper. The parity bit of quantization step rather than the parity bit of block size in MP3Stego is employed to embed secret messages. Compared with MP3Stego, the proposed method can avoid the endless loop problem and achieve better imperceptibility and higher security.
{"title":"Quantization Step Parity-based Steganography for MP3 Audio","authors":"Yan Diqun, Wang Rangding, Zhang Liguang","doi":"10.3233/FI-2009-190","DOIUrl":"https://doi.org/10.3233/FI-2009-190","url":null,"abstract":"Petitcolas has proposed a steganographic technique called MP3Stego which can hide secret messages in a MP3 audio. This technique is well-known because of its high capacity. However, in rare cases, the normal audio encoding process will be terminated due to the endless loop problem caused by embedding operation. In addition, the statistical undetectability of MP3Stego can be further improved. Inspired by MP3Stego, a new steganographic method for MP3 audio is proposed in this paper. The parity bit of quantization step rather than the parity bit of block size in MP3Stego is employed to embed secret messages. Compared with MP3Stego, the proposed method can avoid the endless loop problem and achieve better imperceptibility and higher security.","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":"97 1","pages":"1-14"},"PeriodicalIF":0.8,"publicationDate":"2009-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.3233/FI-2009-190","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"69903402","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：