时间符号迁移图及其互模拟判定

引入时间符号迁移图的概念，作为既涉及通讯又具有实时性的并发系统的模型。该文给出了这种迁移图时间互模拟的算法，并证明了该算法的正确性。

How everyday language can and will boost effective information retrieval

Typing 2 or 3 keywords into a browser has become an easy and efficient way to find information. Yet, typing even short queries becomes tedious on ever shrinking (virtual) keyboards. Meanwhile, speech processing is maturing rapidly, facilitating everyday language input. Also, wearable technology can inform users proactively by listening in on their conversations or processing their social media interactions. Given these developments, everyday language may soon become the new input of choice. We present an information retrieval (IR) algorithm specifically designed to accept everyday language. It integrates two paradigms of information retrieval, previously studied in isolation; one directed mainly at the surface structure of language, the other primarily at the underlying meaning. The integration was achieved by a Markov machine that encodes meaning by its transition graph, and surface structure by the language it generates. A rigorous evaluation of the approach showed, first, that it can compete with the quality of existing language models, second, that it is more effective the more verbose the input, and third, as a consequence, that it is promising for an imminent transition from keyword input, where the onus is on the user to formulate concise queries, to a modality where users can express more freely, more informal, and more natural their need for information in everyday language.

带赋值符号迁移图的局部优化算法

National Natural Science Foundation of China; Public Administration and Civil Service Bureau of Macau SAR; Companhia de Telecomunicacoes de Macau S.A.R.L.; Macau SAR Government Tourist Office

On Graph-Based Cryptography and Symbolic Computations

We have been investigating the cryptographical properties of in nite families of simple graphs of large girth with the special colouring of vertices during the last 10 years. Such families can be used for the development of cryptographical algorithms (on symmetric or public key modes) and turbocodes in error correction theory. Only few families of simple graphs of large unbounded girth and arbitrarily large degree are known. The paper is devoted to the more general theory of directed graphs of large girth and their cryptographical applications. It contains new explicit algebraic constructions of in finite families of such graphs. We show that they can be used for the implementation of secure and very fast symmetric encryption algorithms. The symbolic computations technique allow us to create a public key mode for the encryption scheme based on algebraic graphs.

Timed Transition Automata as Numerical Planning Domain

A general technique for transforming a timed finite state automaton into an equivalent automated planning domain based on a numerical parameter model is introduced. Timed transition automata have many applications in control systems and agents models; they are used to describe sequential processes, where actions are labelling by automaton transitions subject to temporal constraints. The language of timed words accepted by a timed automaton, the possible sequences of system or agent behaviour, can be described in term of an appropriate planning domain encapsulating the timed actions patterns and constraints. The time words recognition problem is then posed as a planning problem where the goal is to reach a final state by a sequence of actions, which corresponds to the timed symbols labeling the automaton transitions. The transformation is proved to be correct and complete and it is space/time linear on the automaton size. Experimental results shows that the performance of the planning domain obtained by transformation is scalable for real world applications. A major advantage of the planning based approach, beside of the solving the parsing problem, is to represent in a single automated reasoning framework problems of plan recognitions, plan synthesis and plan optimisation.

A software tool that generates symbolic model verifier (SMV) input language from a predicate transition net

The purpose of this research was to apply model checking by using a symbolic model checker on Predicate Transition Nets (PrT Nets). A PrT Net is a formal model of information flow which allows system properties to be modeled and analyzed. The aim of this thesis was to use the modeling and analysis power of PrT nets to provide a mechanism for the system model to be verified. Symbolic Model Verifier (SMV) was the model checker chosen in this thesis, and in order to verify the PrT net model of a system, it was translated to SMV input language. A software tool was implemented which translates the PrT Net into SMV language, hence enabling the process of model checking. The system includes two parts: the PrT net editor where the representation of a system can be edited, and the translator which converts the PrT net into an SMV program.

Using culture to manage the transition into university: Conceptualising the dynamics of withdrawal and engagement

This conceptual paper explored the purposes of using culture in the process of coping with stress by looking how first year undergraduate students used cultural elements and activities to aid their transition into university. Results supported two key conceptualisations of the use of culture. Firstly, results indicated that students used culture either for withdrawal purposes, i.e., for escaping from the stressful situation, or for engagement purposes, i.e., for actively engaging with the stressful situation. Secondly, the results suggested three different forms of using culture to engage with stressful situations: mood management, learning, and personal interaction. While the results of the study resonate with the distinction between avoidance versus approach-oriented coping strategies that are widely explored in the stress and coping literature, they also suggest that the relationship between withdrawal and engagement might be dynamic with those two strategies serving distinct purposes in the process of coping with stress. The paper thus suggests that there is a need to develop process-oriented models of coping that would allow identifying patterns in the way people fluctuate between withdrawal and engagement that support and facilitate their personal growth and development.

Terra Incognita: A symbolic mythical journey

This practice-led project is implemented in the context of rites of passage based on significant events in formative transitions of Self. It employs an intuitive methodology to examine and explore the 'Child archetype', mythos, symbolic imagination and self-narrative, through the manifestation of a visual symbolic language. The contexts, methods and processes enable empowerment, heightened awareness of personal and collective relationships, meaningful discovery and development of innovative ideas and forms. The implications for this project highlight the importance of intuition in creativity and innovation. Creative practice is a vehicle for personal and collective interconnectedness. I have discovered self-empowerment, meaningful learning and innovative forms of personal and collective communication as a way of enabling transition of a significant life event.

Political transition and structural politicisation : The long shadow of Taiwan's one-party legacy

Väitöskirjatutkimuksessa tarkastellaan Taiwanin politiikkaa ensimmäisen vaalien kautta tapahtuneen vallanvaihdon jälkeen (2000) yhteiskunnan rakenteellisen politisoitumisen näkökulmasta. Koska Taiwanilla siirryttiin verettömästi autoritaarisesta yksipuoluejärjestelmästä monipuoluejärjestelmään sitä on pidetty poliittisen muodonmuutoksen mallioppilaana. Aiempi optimismi Taiwanin demokratisoitumisen suhteen on sittemmin vaihtunut pessimismiin, pitkälti yhteiskunnan voimakkaasta politisoitumisesta johtuen. Tutkimuksessa haetaan selitystä tälle politisoitumiselle. Yhteiskunnan rakenteellisella politisoitumisella tarkoitetaan tilannetta, jossa ”poliittisen” alue kasvaa varsinaisia poliittisia instituutioita laajemmaksi. Rakenteellinen politisoituminen muuttuu helposti yhteiskunnalliseksi ongelmaksi, koska siitä usein seuraa normaalin poliittisen toiminnan (esim. lainsäädännän) jähmettyminen, yhteiskunnan jyrkkä jakautuminen, alhainen kynnys poliittisille konflikteille ja yleisen yhteiskunnallisen luottamuksen alentuminen. Toisin kuin esimerkiksi Itä-Euroopassa, Taiwanissa entinen valtapuolue ei romahtanut poliittisen avautumisen myötä vaan säilytti vahvan rakenteellisen asemansa. Kun valta vaihtui ensimmäisen kerran vaalien kautta, vanha valtapuolue ei ollut valmis luovuttamaan poliittisen järjestelmän ohjaksia käsistään. Alkoi vuosia kestänyt taistelu järjestelmän hallinnasta vanhan ja uuden valtapuolueen välillä, jossa yhteiskunta politisoitui voimakkaasti. Tutkimuksessa Taiwanin yhteiskunnan politisoituminen selitetään useiden rakenteellisten piirteiden yhteisvaikutuksen tuloksena. Tällaisia politisoitumista edistäviä rakentellisia piirteitä ovat hidas poliittinen muutos, joka säilytti vanhat poliittiset jakolinjat ja niihin liittyvät vahvat edut ja intressit; sopimaton perustuslaki; Taiwanin epäselvä kansainvälinen asema ja jakautunut identiteetti; sekä sosiaalinen rakenne, joka helpottaa ihmisten nopeaa mobilisointia poliittiisiin mielenilmauksiin. Tutkimuksessa kiinnitetään huomiota toistaiseksi vähän tutkittuun poliittiseen ilmiöön, joidenkin demokratisoituvien yhteiskuntien voimakkaaseen rakenteelliseen politisoitumiseen. Tutkimuksen pääasiallinen havainto on, että yksipuoluejärjestelmän demokratisoituminen kantaa sisällään rakenteellisen politisoitumisen siemenen, jos entinen valtapuolue ei romahda demokratisoitumisen myötä.

A study of symbolic processing and computational aspects in helicopter dynamics

Even research models of helicopter dynamics often lead to a large number of equations of motion with periodic coefficients; and Floquet theory is a widely used mathematical tool for dynamic analysis. Presently, three approaches are used in generating the equations of motion. These are (1) general-purpose symbolic processors such as REDUCE and MACSYMA, (2) a special-purpose symbolic processor, DEHIM (Dynamic Equations for Helicopter Interpretive Models), and (3) completely numerical approaches. In this paper, comparative aspects of the first two purely algebraic approaches are studied by applying REDUCE and DEHIM to the same set of problems. These problems range from a linear model with one degree of freedom to a mildly non-linear multi-bladed rotor model with several degrees of freedom. Further, computational issues in applying Floquet theory are also studied, which refer to (1) the equilibrium solution for periodic forced response together with the transition matrix for perturbations about that response and (2) a small number of eigenvalues and eigenvectors of the unsymmetric transition matrix. The study showed the following: (1) compared to REDUCE, DEHIM is far more portable and economical, but it is also less user-friendly, particularly during learning phases; (2) the problems of finding the periodic response and eigenvalues are well conditioned.

Analysing Message Sequence Graph Specifications

We give a detailed construction of a finite-state transition system for a com-connected Message Sequence Graph. Though this result is well-known in the literature and forms the basis for the solution to several analysis and verification problems concerning MSG specifications, the constructions given in the literature are either not amenable to implementation, or imprecise, or simply incorrect. In contrast we give a detailed construction along with a proof of its correctness. Our transition system is amenable to implementation, and can also be used for a bounded analysis of general (not necessarily com-connected) MSG specifications.

Non-commutative symbolic coding

Gohm, Rolf; Kummerer, B.; Lang, T., (2006) 'Non-commutative symbolic coding', Ergodic Theory and Dynamical Systems 26(5) pp.1521-1548 RAE2008

Isoperimetric Partitioning: A New Algorithm for Graph Partitioning

Temporal structure is skilled, fluent action exists at several nested levels. At the largest scale considered here, short sequences of actions that are planned collectively in prefronatal cortex appear to be queued for performance by a cyclic competitive process that operates in concert with a parallel analog representation that implicitly specifies the relative priority of elements of the sequence. At an intermediate scale, single acts, like reaching to grasp, depend on coordinated scaling of the rates at which many muscles shorten or lengthen in parallel. To ensure success of acts such as catching an approaching ball, such parallel rate scaling, which appears to be one function of the basal ganglia, must be coupled to perceptual variables such as time-to-contact. At a finer scale, within each act, desired rate scaling can be realized only if precisely timed muscle activations first accelerate and then decelerate the limbs, to ensure that muscle length changes do not under- or over- shoot the amounts needed for precise acts. Each context of action may require a different timed muscle activation pattern than similar contexts. Because context differences that require different treatment cannot be known in advance, a formidable adaptive engine-the cerebellum-is needed to amplify differences within, and continuosly search, a vast parallel signal flow, in order to discover contextual "leading indicators" of when to generate distinctive patterns of analog signals. From some parts of the cerebellum, such signals control muscles. But a recent model shows how the lateral cerebellum may serve the competitive queuing system (frontal cortex) as a repository of quickly accessed long-term sequence memories. Thus different parts of the cerebellum may use the same adaptive engine design to serve the lowest and highest of the three levels of temporal structure treated. If so, no one-to-one mapping exists between leveels of temporal structure and major parts of the brain. Finally, recent data cast doubt on network-delay models of cerebellar adaptive timing.