{"title":"Job shop scheduling with unit length tasks","authors":"Meike Akveld, R. Bernhard","doi":"10.1051/ita/2011132","DOIUrl":"https://doi.org/10.1051/ita/2011132","url":null,"abstract":"In this paper, we consider a class of scheduling problems that are among the fundamental optimization problems in operations research. More specifically, we deal with a particular version called job shop scheduling with unit length tasks . Using the results of Hromkovic, Momke, Steinhofel, and Widmayer presented in their work Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms , we analyze the problem setting for 2 jobs with an unequal number of tasks. We contribute a deterministic algorithm which achieves a vanishing delay in certain cases and a randomized algorithm with a competitive ratio tending to 1. Furthermore, we investigate the problem with 3 jobs and we construct a randomized online algorithm which also has a competitive ratio tending to 1.","PeriodicalId":438841,"journal":{"name":"RAIRO Theor. Informatics Appl.","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132543469","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"On the joint 2-adic complexity of binary multisequences","authors":"Lu Zhao, Qiao-yan Wen","doi":"10.1051/ita/2012011","DOIUrl":"https://doi.org/10.1051/ita/2012011","url":null,"abstract":"Joint 2-adic complexity is a new important index of the cryptographic security for\u0000 multisequences. In this paper, we extend the usual Fourier transform to the case of\u0000 multisequences and derive an upper bound for the joint 2-adic complexity. Furthermore, for\u0000 the multisequences with p n -period, we discuss\u0000 the relation between sequences and their Fourier coefficients. Based on the relation, we\u0000 determine a lower bound for the number of multisequences with given joint 2-adic\u0000 complexity.","PeriodicalId":438841,"journal":{"name":"RAIRO Theor. Informatics Appl.","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124020597","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Easy lambda-terms are not always simple","authors":"Alberto Carraro, A. Salibra","doi":"10.1051/ita/2012005","DOIUrl":"https://doi.org/10.1051/ita/2012005","url":null,"abstract":"A closed λ -term M is easy if, for any\u0000 other closed term N , the lambda theory generated by\u0000 M = N is consistent. Recently, it has been introduced\u0000 a general technique to prove the easiness of λ -terms through the\u0000 semantical notion of simple easiness. Simple easiness implies easiness and allows to prove\u0000 consistency results via construction of suitable filter models of\u0000 λ -calculus living in the category of complete partial orderings: given\u0000 a simple easy term M and an arbitrary closed term N , it\u0000 is possible to build (in a canonical way) a non-trivial filter model which equates the\u0000 interpretation of M and N . The question whether easiness\u0000 implies simple easiness constitutes Problem 19 in the TLCA list of open problems. In this\u0000 paper we negatively answer the question providing a non-empty co-r.e. (complement of a\u0000 recursively enumerable) set of easy, but not simple easy, λ -terms.","PeriodicalId":438841,"journal":{"name":"RAIRO Theor. Informatics Appl.","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117194910","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Formal Methods to Improve Public Administration Business Processes","authors":"A. Polini, A. Polzonetti, B. Re","doi":"10.1051/ita/2012002","DOIUrl":"https://doi.org/10.1051/ita/2012002","url":null,"abstract":"Starting from late 90’s the public administration has started to employ a quite relevant amount of its budget in developing ICT solutions to better deliver services to citizens. In spite of this effort many statistics show that the mere availability of ICT based services does not guarantee per se their usage. Citizens have continued to largely access services through “traditional” means. In our study we suggest that the highlighted situation is partly due to the fact that relevant domain dependent requirements, mainly related to the delivery process of e-government digital services, are often ignored in the development of e-government solutions. We provide here a domain related quality framework and encoded it in a set of formal statements, so that we can apply automatic verification techniques to assess and improve ICT solutions adopted by public administrations. The paper discusses both the defined quality framework and the tool chain we developed to enable automatic assessment of ICT solutions. The tool chain is based on a denotational mapping of business process modeling notation elements into process algebraic descriptions and to the encoding of quality requirements in linear temporal logic formulas. The resulting approach has been applied to real case studies with encouraging results.","PeriodicalId":438841,"journal":{"name":"RAIRO Theor. Informatics Appl.","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114781076","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"On the size of transducers for bidirectional decoding of prefix codes","authors":"Laura Giambruno, S. Mantaci","doi":"10.1051/ita/2012006","DOIUrl":"https://doi.org/10.1051/ita/2012006","url":null,"abstract":"In a previous paper [L. Giambruno and S. Mantaci, Theoret. Comput. Sci. 411 (2010) 1785–1792] a bideterministic transducer is defined for the bidirectional deciphering of words by the method introduced by Girod [ IEEE Commun. Lett. 3 (1999) 245–247]. Such a method is defined using prefix codes. Moreover a coding method, inspired by the Girod’s one, is introduced, and a transducer that allows both right-to-left and left-to-right decoding by this method is defined. It is proved also that this transducer is minimal. Here we consider the number of states of such a transducer, related to some features of the considered prefix code X . We find some bounds of such a number of states in relation with different notions of “size” of X . In particular, we give an exact formula for the number of states of transducers associated to maximal prefix codes. We moreover consider two special cases of codes: maximal uniform codes and a class of codes, that we name string-codes. We show that they represent, for maximal codes, the extreme cases with regard to the number of states in terms of different sizes. Moreover we prove that prefix codes corresponding to isomorphic trees have transducers that are isomorphic as unlabeled graphs.","PeriodicalId":438841,"journal":{"name":"RAIRO Theor. Informatics Appl.","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124669266","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Foreword ICTCS 2010 special issue","authors":"E. Moggi","doi":"10.1051/ita/2012008","DOIUrl":"https://doi.org/10.1051/ita/2012008","url":null,"abstract":"The Italian Conference on Theoretical Computer Science (ICTCS) is the conference of the Italian chapter of EATCS. The first ICTCS was held in Pisa in 1972. The 12th ICTCS (ICTCS 2010) took place in Camerino, 15–17 September, 2010. The aim of ICTCS 2010 was to provide a forum for the exchange of ideas among researchers, and to foster an environment, where junior researchers and PhD students could gain experience in presenting their work, broaden their views on the subject, and benefit from contact with more established researchers. Any area of Theoretical Computer Science was welcome. The contributions were: original works, that the authors wanted to submit to a post-conference special issue; original works submitted or accepted elsewhere, that the authors wanted to publicize at ICTCS; or works in progress, on which the authors wanted to get feedback. The program included:","PeriodicalId":438841,"journal":{"name":"RAIRO Theor. Informatics Appl.","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124422661","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Domenico Cantone, A. Formisano, Marianna Nicolosi Asmundo, E. Omodeo
{"title":"A graphical representation of relational formulae with complementation","authors":"Domenico Cantone, A. Formisano, Marianna Nicolosi Asmundo, E. Omodeo","doi":"10.1051/ita/2012003","DOIUrl":"https://doi.org/10.1051/ita/2012003","url":null,"abstract":"We study translations of dyadic first-order sentences into equalities between relational expressions. The proposed translation techniques (which work also in the converse direction) exploit a graphical representation of formulae in a hybrid of the two formalisms. A major enhancement relative to previous work is that we can cope with the relational complement construct and with the negation connective. Complementation is handled by adopting a Smullyan-like uniform notation to classify and decompose relational expressions; negation is treated by means of a generalized graph-representation of formulae in L + ,","PeriodicalId":438841,"journal":{"name":"RAIRO Theor. Informatics Appl.","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132076017","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Decidability of the HD0L ultimate periodicity problem","authors":"F. Durand","doi":"10.1051/ita/2013035","DOIUrl":"https://doi.org/10.1051/ita/2013035","url":null,"abstract":"In this paper we prove the decidability of the HD0L ultimate periodicity problem.","PeriodicalId":438841,"journal":{"name":"RAIRO Theor. Informatics Appl.","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126198798","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Morphisms preserving the set of words coding three interval exchange","authors":"Tomáš Hejda","doi":"10.1051/ita/2012009","DOIUrl":"https://doi.org/10.1051/ita/2012009","url":null,"abstract":"Any amicable pair ϕ , ψ of Sturmian morphisms enables a construction of a ternary morphism η which preserves the set of infinite words coding 3-interval exchange. We determine the number of amicable pairs with the same incidence matrix in SL± (2,ℕ) and we study incidence matrices associated with the corresponding ternary morphisms η .","PeriodicalId":438841,"journal":{"name":"RAIRO Theor. Informatics Appl.","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122842994","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"The cyclicity problem for the images of Q-rational series","authors":"J. Honkala","doi":"10.1051/ita/2011111","DOIUrl":"https://doi.org/10.1051/ita/2011111","url":null,"abstract":"We show that it is decidable whether or not a given Q-rational series in several noncommutative variables has a cyclic image. By definition, a series r has a cyclic image if there is a rational number q such that all nonzero coefficients of r are integer powers of q .","PeriodicalId":438841,"journal":{"name":"RAIRO Theor. Informatics Appl.","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124263121","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
求助内容：
应助结果提醒方式：