Exact and approximate algorithms for computing a second Hamiltonian cycle.

A classic result by Stockmeyer [Stockmeyer, 1974] gives a non-elementary lower bound to the emptiness problem for star-free generalized regular expressions. This result is intimately connected to the satisfiability problem for interval temporal logic, notably for formulas that make use of the so-called chop operator. Such an operator can indeed be interpreted as the inverse of the concatenation operation on regular languages, and this correspondence enables reductions between non-emptiness of star-free generalized regular expressions and satisfiability of formulas of the interval temporal logic of the chop operator under the homogeneity assumption [Halpern et al., 1983]. In this paper, we study the complexity of the satisfiability problem for a suitable weakening of the chop interval temporal logic, that can be equivalently viewed as a fragment of Halpern and Shoham interval logic featuring the operators B, for "begins", corresponding to the prefix relation on pairs of intervals, and D, for "during", corresponding to the infix relation. The homogeneous models of the considered logic naturally correspond to languages defined by restricted forms of regular expressions, that use union, complementation, and the inverses of the prefix and infix relations

On a temporal logic of prefixes and infixes

A classic result by Stockmeyer [16] gives a non-elementary lower bound to the emptiness problem for star-free generalized regular expressions. This result is intimately connected to the satisfiability problem for interval temporal logic, notably for formulas that make use of the so-called chop operator. Such an operator can indeed be interpreted as the inverse of the concatenation operation on regular languages, and this correspondence enables reductions between non-emptiness of star-free generalized regular expressions and satisfiability of formulas of the interval temporal logic of the chop operator under the homogeneity assumption [5]. In this paper, we study the complexity of the satisfiability problem for a suitable weakening of the chop interval temporal logic, that can be equivalently viewed as a fragment of Halpern and Shoham interval logic featuring the operators B, for \u201cbegins\u201d, corresponding to the prefix relation on pairs of intervals, and D, for \u201cduring\u201d, corresponding to the infix relation. The homogeneous models of the considered logic naturally correspond to languages defined by restricted forms of regular expressions, that use union, complementation, and the inverses of the prefix and infix relations

REGISTERS OF CHEFS‟ SPOKEN LANGUAGE IN TELEVISION COOKING SHOWS: A PHENOMENON OF LANGUAGE SHIFTING

Register bahasa lisan yang biasa digunakan oleh para koki dalam acara-acara memasak di televisi sangat menarik untuk dikaji. Istilah-istilah kuliner sepertinya mengalami perkembangan secara drastis dari waktu ke waktu. Istilah-istilah yang biasanya digunakan dan dimengerti secara umum telah berubah ke arah yang lebih ke barat-baratan dan terdengar asing. Peristilahan di dalam bidang kuliner yang saat ini lebih banyak menggunakan kosakata asing telah mengalami pergeseran sehingga secara langsung maupun tidak turut memengaruhi tatanan bahasa Indonesia. Berdasarkan hal tersebut di atas, penulis tertarik untuk mendeskripsikan permasalahan yang terjadi di dalam penggunaan register bahasa lisan yang digunakan para koki pada acara memasak di stasiun televisi yang berdampak pada terjadinya fenomena pergeseran bahasa, selain itu bahasa yang digunakan oleh para koki tersebut merupakan ragam bahasa register yang menarik untuk diteliti karena ragam bahasa register dalam acara tersebut tidak terdapat dalam acara-acara yang lain. Register bahasa lisan yang diteliti dibatasi pada penggunaan kata dan kalimat yang digunakan dalam bahasa lisan. Guna mendukung kajian ini penulis menggunakan metodologi deskriptif kualitatif dengan melakukan pengamatan dan observasi pada acaraacara memasak di stasiun TV. Perekaman juga dilakukan untuk lebih mendukung data penelitian. Hasil dari penelitian menunjukkan bahwa penggunaan kosa kata asing dalam konteks leksikal secara langsung maupun tidak, perlahan tapi pasti, mengakibatkan pergeseran terhadap bahasa Indonesia. Penamaan nama masakan dan istilah-istilah kuliner dalam bahasa asing sangat mendominasi dunia kuliner di masa kini

Convolution, Separation and Concurrency

A notion of convolution is presented in the context of formal power series together with lifting constructions characterising algebras of such series, which usually are quantales. A number of examples underpin the universality of these constructions, the most prominent ones being separation logics, where convolution is separating conjunction in an assertion quantale; interval logics, where convolution is the chop operation; and stream interval functions, where convolution is used for analysing the trajectories of dynamical or real-time systems. A Hoare logic is constructed in a generic fashion on the power series quantale, which applies to each of these examples. In many cases, commutative notions of convolution have natural interpretations as concurrency operations.Comment: 39 page

The addition of temporal neighborhood makes the logic of prefixes and sub-intervals EXPSPACE-complete

A classic result by Stockmeyer gives a non-elementary lower bound to the emptiness problem for star-free generalized regular expressions. This result is intimately connected to the satisfiability problem for interval temporal logic, notably for formulas that make use of the so-called chop operator. Such an operator can indeed be interpreted as the inverse of the concatenation operation on regular languages, and this correspondence enables reductions between non-emptiness of star-free generalized regular expressions and satisfiability of formulas of the interval temporal logic of chop under the homogeneity assumption. In this paper, we study the complexity of the satisfiability problem for suitable weakenings of the chop interval temporal logic, that can be equivalently viewed as fragments of Halpern and Shoham interval logic. We first consider the logic $\mathsf{BD}_{hom}$ featuring modalities $B$, for \emph{begins}, corresponding to the prefix relation on pairs of intervals, and $D$, for \emph{during}, corresponding to the infix relation. The homogeneous models of $\mathsf{BD}_{hom}$ naturally correspond to languages defined by restricted forms of regular expressions, that use union, complementation, and the inverses of the prefix and infix relations. Such a fragment has been recently shown to be PSPACE-complete . In this paper, we study the extension $\mathsf{BD}_{hom}$ with the temporal neighborhood modality $A$ (corresponding to the Allen relation \emph{Meets}), and prove that it increases both its expressiveness and complexity. In particular, we show that the resulting logic $\mathsf{BDA}_{hom}$ is EXPSPACE-complete.Comment: arXiv admin note: substantial text overlap with arXiv:2109.0832

Computation Time Comparison Between Matlab and C++ Using Launch Windows

Processing speed between Matlab and C++ was compared by examining launch windows and handling large amounts of data found in pork chop plots. A compilation of code was generated in Matlab to produce the plots and an identical file was created in C++ that was then compiled and run in Matlab to plot the data. This file is known as a MEX-file. This report outlines some of the basics when working with MEX-files and the problems that face users. For Lambert’s solver, multi revolution cases were considered and some pork chop plots of single revolution trajectories were plotted. Three different date grids were plotted with different dimensions to determine the difference in processing speed of the two languages