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":null,"pages":null},"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}
Timed transition systems are a widely studied model for real-time systems. The intention of the paper is to show the applicability of the general categorical framework of openmaps in order to prove...
时间过渡系统是实时系统中一个被广泛研究的模型。本文的目的是为了证明开放映射的一般范畴框架的适用性。
{"title":"Timed Delay Bisimulation is an Equivalence Relation for Timed Transition Systems","authors":"GribovskayaNatalya, VirbitskaiteIrina","doi":"10.5555/1576070.1576080","DOIUrl":"https://doi.org/10.5555/1576070.1576080","url":null,"abstract":"Timed transition systems are a widely studied model for real-time systems. The intention of the paper is to show the applicability of the general categorical framework of openmaps in order to prove...","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":null,"pages":null},"PeriodicalIF":0.8,"publicationDate":"2009-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71119664","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}
A new classification of arbitrary cellular automata (CA for short) in Z d is studied considering the set (group) of all permutations of the neighborhood ν and state set Q. Two CA (Z d, Q, f A, ν A) and (Z d, Q, f B, ν B) are called automorphisc, if there is a pair of permutations (π, p) of ν and Q, respectively, such that (f B, ν B) = (p −1 f A πp, ν A π), where ν π denotes a permutation of ν and f π denotes a permutation of arguments of local function f corresponding to ν π. This automorphissm naturally induces a classification of CA, such that it generally preserves the global properties of CA up to permutation. As a typical example of the theory, the local functions of 256 ECA (1-dimensional 3-nearest neighbors 2-states CA) are classified into 46 classes. We also give a computer test of surjectivity, injecitivity and reversibility of the classes.
的新分类任意细胞自动机(CA) Z d研究考虑的所有排列的设置(集团)附近ν和州组问:两个CA (Z d, Q, f,νA)和(B Z d, Q, f,νB)被称为automorphisc,如果有一对排列ν(π,p)和Q,分别,(f B,νB) = (p−1 fπp,νπ),在νπ表示ν的排列和fπ代表一个排列的参数的本地函数f对应νπ。这种自同构自然地引起CA的分类，这样它通常保留CA的全局属性直到置换。作为该理论的一个典型例子，256个一维3近邻2态CA的局部函数被划分为46类。并给出了类的满射性、注入性和可逆性的计算机测试。
{"title":"Automorphissm Classification of Cellular Automata","authors":"H. Nishio","doi":"10.3233/FI-2010-339","DOIUrl":"https://doi.org/10.3233/FI-2010-339","url":null,"abstract":"A new classification of arbitrary cellular automata (CA for short) in Z d is studied considering the set (group) of all permutations of the neighborhood ν and state set Q. Two CA (Z d, Q, f A, ν A) and (Z d, Q, f B, ν B) are called automorphisc, if there is a pair of permutations (π, p) of ν and Q, respectively, such that (f B, ν B) = (p −1 f A πp, ν A π), where ν π denotes a permutation of ν and f π denotes a permutation of arguments of local function f corresponding to ν π. This automorphissm naturally induces a classification of CA, such that it generally preserves the global properties of CA up to permutation. As a typical example of the theory, the local functions of 256 ECA (1-dimensional 3-nearest neighbors 2-states CA) are classified into 46 classes. We also give a computer test of surjectivity, injecitivity and reversibility of the classes.","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":null,"pages":null},"PeriodicalIF":0.8,"publicationDate":"2009-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74238494","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 : 2008-12-15DOI: 10.1007/978-3-540-73094-1_19
R. Lazic, T. Newcomb, J. Ouaknine, A. W. Roscoe, J. Worrell
{"title":"Nets with Tokens which Carry Data","authors":"R. Lazic, T. Newcomb, J. Ouaknine, A. W. Roscoe, J. Worrell","doi":"10.1007/978-3-540-73094-1_19","DOIUrl":"https://doi.org/10.1007/978-3-540-73094-1_19","url":null,"abstract":"","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":null,"pages":null},"PeriodicalIF":0.8,"publicationDate":"2008-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75849505","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}
Disjunctive logic programming under the answer set semantics (DLP, ASP) has been acknowledged as a versatile formalism for knowledge representation and reasoning during the last decade. Lifschitz, Tang, and Turner have introduced an extended language of DLP, called Nested Logic Programming (NLP), in 1999 [1]. It often allows for more concise representations by permitting a richer syntax in rule heads and bodies. However, that language is propositional and thus does not allow for variables, one of the strengths of DLP. In this paper, we introduce a language similar to NLP, called Normal Form Nested (NPN) programs, which does allow for variables, and present the syntax and semantics. With the presence of variables, domain independence is no longer guaranteed. We study this issue in depth and define the class of safe NPNprograms, which are guaranteed to be domain independent. Moreover, we show that for NPNprograms which are also NLPs, our semantics coincides with the one of [1]; while keeping the standard meaning of answer sets on DLP programs with variables. Finally, we provide an algorithm which translates NPNprograms into DLPprograms, and does so in an efficient way, allowing for the effective implementation of the NPNlanguage on top of existing DLP systems.
{"title":"Normal Form Nested Programs","authors":"Annamaria Bria, Wolfgang Faber, N. Leone","doi":"10.3233/FI-2009-179","DOIUrl":"https://doi.org/10.3233/FI-2009-179","url":null,"abstract":"Disjunctive logic programming under the answer set semantics (DLP, ASP) has been acknowledged as a versatile formalism for knowledge representation and reasoning during the last decade. Lifschitz, Tang, and Turner have introduced an extended language of DLP, called Nested Logic Programming (NLP), in 1999 [1]. It often allows for more concise representations by permitting a richer syntax in rule heads and bodies. However, that language is propositional and thus does not allow for variables, one of the strengths of DLP. \u0000 \u0000In this paper, we introduce a language similar to NLP, called Normal Form Nested (NPN) programs, which does allow for variables, and present the syntax and semantics. With the presence of variables, domain independence is no longer guaranteed. We study this issue in depth and define the class of safe NPNprograms, which are guaranteed to be domain independent. Moreover, we show that for NPNprograms which are also NLPs, our semantics coincides with the one of [1]; while keeping the standard meaning of answer sets on DLP programs with variables. Finally, we provide an algorithm which translates NPNprograms into DLPprograms, and does so in an efficient way, allowing for the effective implementation of the NPNlanguage on top of existing DLP systems.","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":null,"pages":null},"PeriodicalIF":0.8,"publicationDate":"2008-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81393310","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 : 2008-08-01DOI: 10.1007/978-3-540-73094-1_18
M. Koutny, Marta Pietkiewicz-Koutny
{"title":"Synthesis of Elementary Net Systems with Context Arcs and Localities","authors":"M. Koutny, Marta Pietkiewicz-Koutny","doi":"10.1007/978-3-540-73094-1_18","DOIUrl":"https://doi.org/10.1007/978-3-540-73094-1_18","url":null,"abstract":"","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":null,"pages":null},"PeriodicalIF":0.8,"publicationDate":"2008-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90252598","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 paper presents some new results concerning the descriptional complexity of partially parallel grammars. Specifically, it proves that every recursively enumerable language is generated (i) by a...
本文给出了部分并行语法描述复杂度的一些新结果。具体地说，它证明了每个递归可枚举语言都是(i)由…
{"title":"On Descriptional Complexity of Partially Parallel Grammars","authors":"MasopustTomáš, MedunaAlexander","doi":"10.5555/1494710.1494720","DOIUrl":"https://doi.org/10.5555/1494710.1494720","url":null,"abstract":"This paper presents some new results concerning the descriptional complexity of partially parallel grammars. Specifically, it proves that every recursively enumerable language is generated (i) by a...","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":null,"pages":null},"PeriodicalIF":0.8,"publicationDate":"2008-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71118347","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 : 2008-07-01DOI: 10.1142/9789814280945_0043
T. Phillips
We have studied diboson events produced by p{bar p} collisions at {radical}s = 1.96 TeV using the CDF detector. Our observations of Z{gamma}, WZ, and ZZ production are consistent with Standard Model predictions, and we set limits on some anomalous couplings.
{"title":"DIBOSON PHYSICS AT CDF","authors":"T. Phillips","doi":"10.1142/9789814280945_0043","DOIUrl":"https://doi.org/10.1142/9789814280945_0043","url":null,"abstract":"We have studied diboson events produced by p{bar p} collisions at {radical}s = 1.96 TeV using the CDF detector. Our observations of Z{gamma}, WZ, and ZZ production are consistent with Standard Model predictions, and we set limits on some anomalous couplings.","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":null,"pages":null},"PeriodicalIF":0.8,"publicationDate":"2008-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"64060463","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. Darondeau, M. Koutny, Marta Pietkiewicz-Koutny, A. Yakovlev
The unconstrained step semantics of Petri nets is impractical for simulating and modelling applications. In the past, this inadequacy has been alleviated by introducing various flavours of maximally concurrent semantics, as well as priority orders. In this paper, we introduce a general way of controlling step semantics of Petri nets through step firing policies that restrict the concurrent behaviour of Petri nets and so improve their execution and modelling features. In a nutshell, a step firing policy disables at each marking a subset of enabled steps which could otherwise be executed. We discuss various examples of step firing policies and then investigate the synthesis problem for Petri nets controlled by such policies. Using generalised regions of step transition systems, we provide an axiomatic characterisation of those transition systems which can be realised as reachability graphs of Petri nets controlled by a given step firing policy. We also provide a decision and synthesis algorithm for PT-nets and step firing policies based on linear rewards of steps, where fixing the reward of elementary transitions is part of the synthesis problem. The simplicity of the algorithm supports our claim that the proposed approach is practical.
{"title":"Synthesis of Nets with Step Firing Policies","authors":"P. Darondeau, M. Koutny, Marta Pietkiewicz-Koutny, A. Yakovlev","doi":"10.3233/FI-2009-132","DOIUrl":"https://doi.org/10.3233/FI-2009-132","url":null,"abstract":"The unconstrained step semantics of Petri nets is impractical for simulating and modelling applications. In the past, this inadequacy has been alleviated by introducing various flavours of maximally concurrent semantics, as well as priority orders. In this paper, we introduce a general way of controlling step semantics of Petri nets through step firing policies that restrict the concurrent behaviour of Petri nets and so improve their execution and modelling features. In a nutshell, a step firing policy disables at each marking a subset of enabled steps which could otherwise be executed. We discuss various examples of step firing policies and then investigate the synthesis problem for Petri nets controlled by such policies. Using generalised regions of step transition systems, we provide an axiomatic characterisation of those transition systems which can be realised as reachability graphs of Petri nets controlled by a given step firing policy. We also provide a decision and synthesis algorithm for PT-nets and step firing policies based on linear rewards of steps, where fixing the reward of elementary transitions is part of the synthesis problem. The simplicity of the algorithm supports our claim that the proposed approach is practical.","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":null,"pages":null},"PeriodicalIF":0.8,"publicationDate":"2008-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81052126","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 : 2008-05-27DOI: 10.1142/9789814280945_0009
S. Baumgart, F. C. Collaboration
We report on measurements of open charm production through both hadronic and semi-leptonic decay channels in $sqrt{s_{NN}}$ = 200 GeV heavy ion collision at the STAR experiment at RHIC. We compare experimental results to theoretical predictions from pQCD. The open charm $R_{AA}$ is also presented as evidence of possible medium-induced energy loss.
{"title":"Measurement of the Open Charm Cross-Section in 200-GeV Heavy-Ion Collisions at STAR","authors":"S. Baumgart, F. C. Collaboration","doi":"10.1142/9789814280945_0009","DOIUrl":"https://doi.org/10.1142/9789814280945_0009","url":null,"abstract":"We report on measurements of open charm production through both hadronic and semi-leptonic decay channels in $sqrt{s_{NN}}$ = 200 GeV heavy ion collision at the STAR experiment at RHIC. We compare experimental results to theoretical predictions from pQCD. The open charm $R_{AA}$ is also presented as evidence of possible medium-induced energy loss.","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":null,"pages":null},"PeriodicalIF":0.8,"publicationDate":"2008-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"64060378","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
扫码关注我们
求助内容：
应助结果提醒方式：