A characterization of (regular) circular languages generated by monotone complete splicing systems

Circular splicing systems are a formal model of a generative mechanism of circular words, inspired by a recombinant behaviour of circular DNA. Some unanswered questions are related to the computational power of such systems, and finding a characterization of the class of circular languages generated by circular splicing systems is still an open problem. In this paper we solve this problem for monotone complete systems, which are finite circular splicing systems with rules of a simpler form. We show that a circular language L is generated by a monotone complete system if and only if the set Lin(L) of all words corresponding to L is a pure unitary language generated by a set closed under the conjugacy relation. The class of pure unitary languages was introduced by A. Ehrenfeucht, D. Haussler, G. Rozenberg in 1983, as a subclass of the class of context-free languages, together with a characterization of regular pure unitary languages by means of a decidable property. As a direct consequence, we characterize (regular) circular languages generated by monotone complete systems. We can also decide whether the language generated by a monotone complete system is regular. Finally, we point out that monotone complete systems have the same computational power as finite simple systems, an easy type of circular splicing system defined in the literature from the very beginning, when only one rule of a specific type is allowed. From our results on monotone complete systems, it follows that finite simple systems generate a class of languages containing non-regular languages, showing the incorrectness of a longstanding result on simple systems.     

A quantitative multimodal discourse analysis of teaching and learning in a web-conferencing environment – The efficacy of student-centred learning designs

This paper presents a quantitative approach to multimodal discourse analysis for analyzing online collaborative learning. The coding framework draws together the fields of systemic functional linguistics and Activity Theory to analyze interactions between collaborative-, content- and technology-related discourse. The approach is used to examine how the task subject matter, the activity design, and the choice of interface affected interaction and collaboration for a computing course conducted in a web-conferencing environment. The analysis revealed the critical impact of activity design on the amount and type of discourse that transpired. Student-centred designs resulted in over six times more student discourse as compared to teacher-centred designs and created a learning environment where students took greater ownership over the tasks and contributed more to the content-based discussion. The paper also incorporates a rationale for the approach to coding and a reflection on its efficacy for discourse analysis in technology-based learning environments.     

Stabilization of linear systems with input delay and saturation—A parametric Lyapunov equation approach

This paper studies the problem of stabilizing a linear system with delayed and saturating feedback. It is known that the eigenstructure assignment‐based low‐gain feedback law (globally) stabilizes a linear system in the presence of arbitrarily large delay in its input, and semi‐globally stabilizes it when the input is also subject to saturation, as long as all its open‐loop poles are located in the closed left‐half plane. Based on a recently developed parametric Lyapunov equation‐based low‐gain feedback design method, this paper presents alternative, but simpler and more elegant, feedback laws that solve these problems. The advantages of this new approach include its simplicity, the capability of giving explicit conditions to guarantee the stability of the closed‐loop system, and the ease in scheduling the low‐gain parameter on line to achieve global stabilization in the presence of actuator saturation. Copyright © 2009 John Wiley & Sons, Ltd.     

Tuning of multi-loop PI controllers based on gain and phase margin specifications

In this paper, a single-iteration strategy is proposed for the design of a multi-loop PI controller to achieve the desired gain and phase margins for two-input and two-output (TITO) processes. To handle loop interactions, a TITO system is converted into two equivalent single loops with uncertainties drawn from interactions. The maximum uncertainty is estimated for the initial controller design in one loop and single-input and single-output (SISO) controller design is applied. This controller is substituted to other equivalent loop for design, and finally, the first loop controller is refined on knowledge of other loop controller. For SISO controller tuning, a new method is presented to determine the achievable gain and phase margins as well as the relevant controller parameters. Examples are given for illustration and comparison.     

fKenzo: A user interface for computations in Algebraic Topology

fKenzo (=friendly Kenzo) is a graphical user interface providing a user-friendly front-end for the Kenzo system, a Common Lisp program devoted to Algebraic Topology. The fKenzo system provides the user interface itself, an XML intermediary generator-translator and, finally the Kenzo kernel. We describe in this paper the main points of fKenzo, and we explain also the advantages and limitations of fKenzo with respect to Kenzo itself. The text is separated into two parts, trying to cover both the user and the developer perspectives.     

On properties not inherited by monoids from their Schützenberger groups

We give an example of a monoid with finitely many left and right ideals, all of whose Schützenberger groups are presentable by finite complete rewriting systems, and so each have finite derivation type, but such that the monoid itself does not have finite derivation type, and therefore does not admit a presentation by a finite complete rewriting system. The example also serves as a counterexample to several other natural questions regarding complete rewriting systems and finite derivation type. Specifically it allows us to construct two finitely generated monoids M and N with isometric Cayley graphs, where N has finite derivation type (respectively, admits a presentation by a finite complete rewriting system) but M does not. This contrasts with the case of finitely generated groups for which finite derivation type is known to be a quasi-isometry invariant. The same example is also used to show that neither of these two properties is preserved under finite Green index extensions.     

改进的证据理论在合作频谱感知中的应用

为了能够在认知无线电网络中有效、准确地检测出授权用户,提出了基于改进的证据理论的合作频谱感知方案设计方法.根据各个次用户对授权用户进行多次本地检测得出的时域DS融合结果,设计并改进融合顺序和融合结构,将多个时域DS融合结果送到融合中心进行空域DS融合,得到最终判决.在此基础上,给出了融合顺序、融合结构的改变对算法性能的...     

The effect of visualizing the flow of multimedia content among and inside devices

This study introduces a user interface, referred to as the flow interface, which provides a graphical representation of the movement of content among and inside audio/video devices. The proposed interface provides a different frame of reference with content-oriented visualization of the generation, manipulation, storage, and display of content as well as input and output. The flow interface was applied to a VCR/DVD recorder combo, one of the most complicated consumer products. A between-group experiment was performed to determine whether the flow interface helps users to perform various tasks and to examine the learning effect of the flow interface, particularly in regard to hooking up and recording tasks. The results showed that participants with access to the flow interface performed better in terms of success rate and elapsed time. In addition, the participants indicated that they could easily understand the flow interface. The potential of the flow interface for application to other audio video devices, and design issues requiring further consideration, are discussed.