Global culture, local cultures and the internet: The Thai example

This paper addresses the questions of whether and, if so, how and to what extent the Internet brings about homogenisation of local cultures in the world. It examines a particular case, that of Thai culture, through an investigation and interpretation of a Usenet newsgroup, soc.culture.thai. Two threads of discussion in the newsgroup are selected. One deals with criticisms of the Thai government and political leaders, and the other focuses on whether the Thai language should be a medium, or perhaps the only medium, of communication in the newsgroup. It is found that, instead of erasing local cultural boundaries, creating a worldwide monolithic culture, the Internet reduplicates the existing cultural boundaries. What the Internet does, on the contrary, is to create an umbrella cosmopolitan culture which is necessary for communication among people from disparate cultures. That culture, however, is devoid of thick backgrounds, in Michael Walzer's sense.     

Dynamics of Lifeboat and Boom in Deployment from a Moving Support

The equations governing the boom-assisted deployment of a lifeboat from a moving support are formulated in three dimensions using Kanes method, accounting for the coupling of the dynamics of the boom and lifeboat. The effect of wind loading is included. At splashdown we assume a controlled water entry and hence the buoyancy force, but not impact force, is modeled. The equations are solved numerically using a standard Runge-Kutta MATLAB routine. Comparison with a known solution for a special case is illustrated.     

A predicate transformer for the progress property ‘to-always’

The temporal property to-always has been proposed for specifying progress properties of concurrent programs. Although the to-always properties are a subset of the leads-to properties for a given program, to-always has more convenient proof rules and in some cases more accurately describes the desired system behavior. In this paper, we give a predicate transformerwta, derive some of its properties, and use it to define to-always. Proof rules for to-always are derived from the properties ofwta. We conclude by briefly describing two application areas, nondeterministic data flow networks and self-stabilizing systems where to-always properties are useful.     

A Mathematical Analysis of Pānini’s <Emphasis Type="Italic">Śivasūtras</Emphasis>

In Pninis grammar of Sanskrit one finds the ivastras, a table which defines the natural classes of phonological segments in Sanskrit by intervals. We present a formal argument which shows that, using his representation method, Pninis way of ordering the phonological segments to represent the natural classes is optimal. The argument is based on a strictly set-theoretical point of view depending only on the set of natural classes and does not explicitly take into account the phonological features of the segments, which are, however, implicitly given in the way a language clusters its phonological inventory. The key idea is to link the graph of the Hasse-diagram of the set of natural classes closed under intersection to ivastra-style representations of the classes. Moreover, the argument is so general that it allows one to decide for each set of sets whether it can be represented with Pninis method. Actually, Pnini had to modify the set of natural classes to define it by the ivastras (the segment h plays a special role). We show that this modification was necessary and, in fact, the best possible modification. We discuss how every set of classes can be modified in such a way that it can be defined in a ivastra-style representation.¹     

Design and analysis of two-wire focusing actuator for small-sized ODD with linear VCM type’s actuator

Recent advancements in mobile devices have fueled a requirement for information storage systems with characteristics such as subminiature size, low cost, and minimum power consumption. Small optical disk drives could provide a good solution, because their storage media is cheaper than those of hard disk drives or flash memories. In this study, we design and analysis a linear voice coil motor (VCM) types actuator for the coarse and fine tracking motions and a two-wire spring types actuator for a fine focusing motion in order to apply them to small-sized optical disk drives of high data capacity. And, we make the mathematical model of a two-wire spring types actuator and find proper conditions to suppress the tilt motion of the lens holder for various focusing offset positions without sacrificing the sensitivity. Based on them, we design and modify the magnetic circuit and the structural part. Finally, we verify that the designed actuator had the proper dynamic characteristics and that it could be used in small optical disk drives by simulations and experiments.     

Optimal shape of a heavy compressed column

By using Pontryagins maximum principle we determine the shape of a heavy compressed rod, stable against buckling. It is assumed that the eigenvalue pair corresponding to the optimal rod is simple. With this assumption (unimodal optimization) it is shown that the cross-sectional area function is determined from the solution of a nonlinear boundary value problem. A variational principle for this boundary value problem is formulated and two first integrals are constructed. The optimal shape of a rod is determined by numerical integration.     

Deterministic polynomial-time quantum algorithms for Simon’s problem

D. R. Simon stated a problem, so-called Simons problem, whose computational complexity is in the class BQP but not in BPP, where is the function or oracle given in the problem. This result indicates that BPP may be strictly included in its quantum counterpart, BQP. Later, G. Brassard and P. Høyer showed that Simons problem and its extended version can be solved by a deterministic polynomial time quantum algorithm. That is, these problems are in the class EQP. In this paper, we show that Simons problem and its extended version can be deterministically solved in a simpler and more concrete way than that proposed by G. Brassard and P. Høyer.     

Structural optimization complexity: what has Moore’s law done for us?

Rapid increases in computer processing power, memory and storage space have not eliminated computational cost and time constraints on the use of structural optimization for design. This is due to the constant increase in the required fidelity (and hence complexity) of analysis models. Anecdotal evidence seems to indicate that analysis models of acceptable accuracy have required at least six to eight hours of computer time (an overnight run) throughout the last thirty years. This poses a severe challenge for global optimization or reliability-based design. In this paper, we review how increases in computer power were utilized in structural optimization. We resolve problem complexity into components relating to complexity of analysis model, analysis procedure and optimization methodology. We explore the structural optimization problems that we can solve at present and conclude that we can solve problems with the highest possible complexity in only two of the three components of model, analysis procedure or optimization. We use examples of optimum design of composite structures to guide the discussion due to our familiarity with such problems. However, these are supplemented with other structural optimization examples to illustrate the universality of the message.     

Michell structures formed on surfaces of revolution

The paper formulates the Michell-like problems for surface gridworks. Particular attention is devoted to the problem of designing the lightest fully stressed gridworks formed on surfaces of revolution. In the examples considered, the gridworks are subjected to torsion. Proof is given that the circular meridian is a minimizer of the weight (or volume) functional of a shell subjected to torsion, thus justifying the original Michell conjecture according to which just the spherical twisting shell is the lightest. The proof is based on the methods of the classical variational calculus and thus can be viewed as elementary. This result is confirmed by a direct comparison of the exact formulae for the weight of a spherical Michell shell with the exact formulae for the weights of optimal conical and cylindrical shells with the same fixed boundaries.     

Complex-Weighted One-Unit ‘Rigid-Bodies’ Learning Rule for Independent Component Analysis

Over the recent years, noticeable theoretical efforts have been devoted to the understanding of the role of networks' parameter spaces in neural learning. One of the contributions in this field concerns the study of weight-flows on Stiefel manifold, which is the natural parameter-space's algebraic-structure in some unsupervised (information-theoretic) learning task. An algorithm belonging to the class of learning equations generating Stiefel-flows is based on the rigid-body theory, introduced by the present Author in 1996. The aim of this Letter is to present an investigation on the capability of a complex-weighted neuron, trained by a rigid-bodies learning theory, with application to blind source separation of complex-valued independent signals for telecommunication systems.     

Knowledge discovery and system-user partnership: On a production “adversarial partnership” approach

We examine the relationship between systems and their users from the knowledge discovery perspective. Recently knowledge discovery in databases has made important progress, but it may also bring some potential problems to database design, such as issues related to database security, because an unauthorised user may derive highly sensitive knowledge from unclassified data. In this paper we point out that there is a need for a comprehensive study on knowledge discovery in human-computer symbiosis. Borrowing terms from algorithm design and artificial intelligence literature, we propose a notion called database-user adversarial partnership. We point out that this notion is general enough to cover various knowledge discovery and security of issues related to databases and their users. Furthermore, we point out the notion of database-user adversarial partnership can be further generalised into system-user adversarial partnership. Opportunities provided by knowledge discovery techniques and potential social implications are also discussed.     

Mechanical procedure for proof construction via closed terms in typed λ calculus

In this paper is presented an algorithm for constructing natural deduction proofs in the propositional intuitionistic and classical logics according to the analogy relating intuitionistic propositional formulas and natural deduction proofs, respectively, to types and terms of simple type theory. Proofs are constructed as closed terms in the simple typed calculus. The soundness and completeness of this method are proved.     

The essence of eta-expansion in partial evaluation

Selective eta-expansion is a powerful binding-time improvement,i.e., a source-program modification that makes a partial evaluator yield better results. But like most binding-time improvements, the exact problem it solves and the reason why have not been formalized and are only understood by few.In this paper, we describe the problem and the effect of eta-redexes in terms of monovariant binding-time propagation: eta-redexes preserve the static data flow of a source program by interfacingstatic higher-order values in dynamic contexts anddynamic higher-order values in static contexts. They contribute to twodistinct binding-time improvements.We present two extensions of Gomard's monovariant binding-time analysis for the pure -calculus. Our extensions annotateand eta-expand -terms. The first one eta-expands static higher-order values in dynamic contexts. The second also eta-expands dynamic higher-order values in static contexts.As a significant application, we show that our first binding-time analysis suffices to reformulate the traditional formulation of a CPS transformation into a modern one-pass CPS transformer. This binding-time improvement is known, but it is still left unexplained in contemporary literature,e.g., about cps-based partial evaluation.We also outline the counterpart of eta-expansion for partially static data structures.     

A Comparison of the Moore and Miranda Existence Tests

We compare two computational tests for the existence of a zero of a nonlinear system. One of the tests is based on a theorem by Moore, the other relies on Mirandas theorem. It turns out that the Miranda test is always at least as powerful as the Moore test. We also indicate some conditions under which both tests are equivalent.B. Lang gratefully acknowledges support by VolkswagenStiftung within the project Konstruktive Methoden der Nichtlinearen Dynamik zum Entwurf verfahrenstechnischer Prozesse, Geschäftszeichen I/79 288.     

The historical workstation project

Since 1978 research in the development of software dedicated to the specific problems of historical research has been undertaken at the Max-Planck-Institute für Geschichte in Göttingen. From a background of practical experiences during these years, a concept of what an appropriate workstation for an historian would be has been derived. It stresses the necessity of three components: (a) software, derived from a detailed analysis of what differentiates information contained in historical sources from such present in current material, (b) databases which are as easily available as printed books and (c) knowledge bases which allow software and data bases to draw upon the information contained in historical reference works. A loose network of European research projects, dedicated to the realization of such a setup, is described.Manfred Thaller has a Ph.D. (1975) in Modern and Medieval History and held a post-doctoral fellowship in sociology at the Institute for Advanced Studies (Vienna). Since 1978 he has been at the Max-Planck-Institute for History, where he is a research fellow for Historical Information Science.     

Consistency of the Adiabatic Theorem

We review the quantum adiabatic approximation for closed systems, and its recently introduced generalization to open systems (M.S. Sarandy and D.A. Lidar, eprint quant-ph/0404147). We also critically examine a recent argument claiming that there is an inconsistency in the adiabatic theorem for closed quantum systems (K.P. Marzlin and B.C. Sanders, Phys. Rev. Lett. 93, 160408 (2004).) and point out how an incorrect manipulation of the adiabatic theorem may lead one to obtain such an inconsistent result.PACS: 03.65.Ta, 03.65.Yz, 03.67.-a, 03.65.Vf.     

End-to-end communications management using TMN “X” interfaces

The ongoing integration of LANs and WANs to support global communications and businesses and the emergence of integrated broadband communication services has created an increased demand for cooperation between customers, network and service providers to achieve end-to-end service management. Such a cooperation between autonomous authorities, each defining their own administrative management domains, requires the application of an open standardized framework to facilitate and regulate interworking. Such a framework is given by the ITU-T recommendations on TMN, where the so-called X interface is of particular importance for inter-domain management. In this paper, we explain the role of the TMN X interface within an inter-domain TMN architecture supporting end-to-end communications management. We identify the important issues that need to be addressed for the definition and realization of TMN X interfaces and report about our practical experiences with the implementation of TMN X interfaces in the PREPARE project.