Intervals of Inverse M-Matrices

If A and B are inverse M-matrices, we show that the interval determined by A and B contains only inverse M-matrices if and only if all vertices of the interval are inverse M. Limitations on strengthening such a statement are exhibited by example, and generalizations to classes of matrices defined by identically signed collections of minors are mentioned.     

An approach to emulating separable graphs

A technique foremulating multicomputer interconnection networks that are based onseparable graphs (graphs having bounded degree and sublinear multicolor recursive bisectors) is presented. Efficient emulations among interconnection networks are necessary for porting programs designed for one network to another.Emulations are formalized asgraph embeddings, where the nodes (processors) of theguest graph (emulated network) are assigned to nodes of thehost graph (emulator), while the edges (communication links) of the guest are routed via paths in the host. The communication slowdown in an emulation depens on thedilation (length of the longest routing path) and thecongestion (number of paths that contend for a host edge) of the embedding. Theexpansion of the embedding (the ratio of the sizes of the host to guest) determines the inefficiency of processor utilization. Cell trees are introduced as interconnection networks whose special communication properties enable them to serve as intermediate devices in these emulations. Nodes in cell trees are organized into equinumerous parts calledcells; the cells are labeled by nodes of a complete binary tree. Communication in cell trees is restricted to two specific and distinct primitives:cell communication is confined within cells, whiletransfer communication occurs between adjacent cells. Rather than solved directly, the emulation problem for the original guest-host pair is decomposed into two independent parts: emulating the guest by the cell tree, and emulating the cell tree by the host.In emulations of separable graphs by cell trees, the node assignment that ensures small dilation is derived from the separator-based decomposition of guest graphs. The congestion-free edge routing is achieved by coordinatingglobal andlocal phases, which are based on two characteristic cell-tree communication primitives.The technique is instantiated by emulating cell trees on specific host graphs. Withshuffle-like hypercube-derivative networks as hosts new constant-expansion emulations are obtained that have both dilation and congestion logarithmic in the size of the multicolor bisector of guest graphs. These emulations are the first such to have optimal (up to constants)congestion; they provide the firstoptimal algorithm for emulating arbitrary separable graphs on shuffle-like networks. The application of the technique tohypercubes as hosts also produces optimal emulations that differ from those previously known by having smaller expansion constants.This research was supported in part by NSF Grants CCR-88-12567 and CCR-90-13184, and by the University of Massachusetts Graduate School Fellowship for the academic year 1991-92. A preliminary version of this paper was presented at the 3rd ACM Symposium on Parallel Algorithms and Architectures, July 22–24, 1991, in Hilton Head, South Carolina, USA.     

Remote sensing of coastal waters by airborne lidar and satellite radiometer Part 2: Measurements

Abstract

Active and passive remote sensing techniques for measurement of oceanic constituents have been compared using the ADRIA'84 dataset. A new method has been developed to retrieve the amount of nonchlorophyllous particles by airborne lidar measurements at three wavelengths. If the lidar measurements of chlorophyll-a and Gelbstoff are calibrated by in situ measurements, the fluorescence efficiencies can be estimated, Specific extinction coefficients for chlorophyll-a and nonchlorophyllous particles for the northern Adriatic Sea have been derived by comparing in situ and underwater irradiance measurements with radiative transfer calculations, using the ocean-atmosphere model by Fischer (1983). For the Coastal Zone Colour Scanner (CZCS), an algorithm for chlorophyll-a measurements was derived. The comparison with chlorophyll-a lidar measurements shows that different scales are resolved by both instruments. The CZCS-chlorophyll-a concentrations are influenced by Gelbstoff and nonchlorophyllous particles. It is possible to use airborne lidar measurements of chlorophyll-a for calibrating spaceborne radiometers, if the fluorescence efficiency of chlorophyll-a is known and if the lidar itself is calibrated. The comparison between Advanced Very High Resolution Radiometer (AVHRR) sea surface temperatures and CZCS measurements indicates that mesoscale structures in the ocean are much better indicated by measurements in the visible spectrum. Mesoscale structures are often masked by the warming of the ocean top layer when measuring in the infrared.     

On the expressive power of CSP refinement

We show that wide-ranging classes of predicates on the failures-divergences model for CSP can be represented by refinement checks in a general form. These are predicates of a process P expressible as F(P)⊏G(P), where F and G are CSP contexts and ⊏ is refinement. We use ideas similar to full abstraction, but achieve a stronger property than that. Our main result is that topologically-closed predicates are precisely those representable when F and G are both uniformly continuous. We show that sub-classes of predicates such as refinement-closed and distributive ones are represented by special forms of this check.Received November 2003Revised July 2004Accepted December 2004 by M. Leuschel and D. J. Cooke     

Continuous‐time stable and unstable system modelling with orthonormal basis functions

In this paper, model sets for linear time‐invariant continuous‐time systems which are spanned by fixed‐pole orthonormal bases are investigated. The obtained model sets are shown to be complete in the Lebesque spaces L_p (1<p<∞) and in C, the space of complex‐valued functions that are continuous on the extended imaginary axis. The L_p norm error bounds for estimating systems in L_p by the partial sums of the Fourier series formed by the orthonormal functions are computed for the case 1<p<∞. Some inequalities on the 𝓁_p means of the Fourier coefficients are also derived. These results have application in estimation and model reduction of stable and unstable continuous‐time linear time‐invariant systems. A numerical example illustrates the use of the basis functions for the approximation of unstable infinite‐dimensional dynamics. Copyright © 2000 John Wiley & Sons, Ltd.     

L ∞-error estimates of higher order mixed finite element approximations for elliptic optimal control problems

In this paper, we investigate the L ^∞-error estimates of the numerical solutions of linear-quadratic elliptic control problems by using higher order mixed finite element methods. The state and co-state are approximated by the order k Raviart-Thomas mixed finite element spaces and the control variable is approximated by piecewise polynomials of order k (k≥1). Optimal L ^∞-error estimates are derived for both the control and the state approximations. These results are seemed to be new in the literature of the mixed finite element methods for optimal control problems.     

Comparison of hemispheric asymmetry measurements for emotional recordings from controls

Four asymmetry measurements (conventional coherence function (CCF), cross wavelet correlation (CWC), phase lag index (PLI), and mean phase coherence (MPC)) have been compared to each other for the first time in order to recognize emotional states (pleasant (P), neutral (N), unpleasant (UP)) from controls in EEG sub-bands (delta (0–4 Hz), theta (4–8 Hz), alpha (8–16 Hz), beta (16–32 Hz), gamma (32–64 Hz)) mediated by affective pictures from the International Affective Picture Archiving System (IAPS). Eight emotional features, computed as hemispheric asymmetry between eight electrode pairs (Fp1 − Fp2, F7 − F8, F3 − F4, C3 − C4, T7 − T8, P7 − P8, P3 − P4, and O1 − O2), have been classified by using data mining methods. Results show that inter-hemispheric emotional functions are mostly mediated by gamma. The best classification is provided by a neural network classifier, while the best features are provided by CWC in time-scale domain due to non-stationary nature of electroencephalographic (EEG) series. The highest asymmetry levels are provided by pleasant pictures at mostly anterio-frontal (F3 − F4) and central (C3 − C4) electrode pairs in gamma. Inter-hemispheric asymmetry levels are changed by each emotional state at all lobes. In conclusion, we can state the followings: (1) Nonlinear and wavelet transform-based methods are more suitable for characterization of EEG; (2) The highest difference in hemispheric asymmetry was observed among emotional states in gamma; (3) Cortical emotional functions are not region-specific, since all lobes are effected by emotional stimuli at different levels; and (4) Pleasant stimuli can strongly mediate the brain in comparison to unpleasant and neutral stimuli.

     

An efficient alignment algorithm for masked sequences

We consider the alignment problem where sequences may have masked regions. The bases in masked regions are either unspecified or unknown, and they will be denoted by N. We present an efficient algorithm that finds an optimal local alignment by skipping such masked regions of sequences. Our algorithm works for both the affine gap penalty model and the linear gap penalty model. The time complexity of our algorithm is O((n−T)(m−S)+vm+wn) time, where n and m are the lengths of given sequences A and B, T and S are the numbers of base N in A and B, and v and w are the numbers of masked regions in A and B, respectively.     

Integrating statistical theory with statistical databases

Statistical databases have traditionally been stored as flat files approximating relations. We propose that by storing statistical data in an object oriented type database, enhanced with knowledge of statistical theory, a more natural and powerful interface to statistical data can be created.A formalism is proposed for dealing with and combining data that have random components by makingstatistics first class citizens in the database world. Entities in the databases are classified according to whether they areobservations, orstatistics.Estimates are a special type ofstatistics which aremoored toobservation entities.Statistics entities are classified by their statistical properties. A hierarchical structure of random features is provided, with distributions at its leaves. This structure is a DAG (Directed Acyclic Graph), which may be extended or redefined for different applications and contains information used to compare and manipulatestatistics.     

Multi-field relations in designing for short-range RFID

Multi-field inputs are techniques driven by multiple short-range RFID-enabled artifacts like RFID-tags and RFID-tag readers. The technology is useful for designers so as to enable the construction of advanced interaction through the physical world. To take advantage of such opportunities, it is important to understand the technology in terms of what interactions it might offer designers. I address this issue by unwrapping and exposing elements that can be used to conceptualize multi-field interactions. This is done by way of a design driven inquiry in which design and research methods are used to investigate short-range RFID technology. My approach is informed by activity theory which I use to analyze RFID technology from a design perspective. The study presents multi-field relations as a conceptual framework that can be used to describe and generate multi-field inputs. Four types of multi-field relations are discussed: one-way, two-way, sequence and multiple relations. These are described and analyzed in context of a set of multi-field input examples. The multi-field relations expose elements that can be used to construct interactions. This is important for interaction designers, since new interactions presents designers with opportunities for making entirely new types of interfaces that can lead to interesting and surprising experiences.     

Static state feedback triangular block decoupling for arbitrary systems: a state-space method

In this paper, the static state feedback triangular block decoupling problem for a general system described by (A, B, C, D) quadruples is studied. Necessary and sufficient conditions which are numerically verifiable are obtained and a numerically reliable decoupling method is established in the state space. Two examples are solved by our method which show the effectiveness.     

Direction-based surrounder queries for mobile recommendations

Location-based recommendation services recommend objects to the user based on the user’s preferences. In general, the nearest objects are good choices considering their spatial proximity to the user. However, not only the distance of an object to the user but also their directional relationship are important. Motivated by these, we propose a new spatial query, namely a direction-based surrounder (DBS) query, which retrieves the nearest objects around the user from different directions. We define the DBS query not only in a two-dimensional Euclidean space \mathbbE{\mathbb{E}} but also in a road network \mathbbR{\mathbb{R}} . In the Euclidean space \mathbbE{\mathbb{E}} , we consider two objects a and b are directional close w.r.t. a query point q iff the included angle Daqb{\angle aqb} is bounded by a threshold specified by the user at the query time. In a road network \mathbbR{\mathbb{R}} , we consider two objects a and b are directional close iff their shortest paths to q overlap. We say object a dominates object b iff they are directional close and meanwhile a is closer to q than b. All the objects that are not dominated by others based on the above dominance relationship constitute direction-based surrounders (DBSs). In this paper, we formalize the DBS query, study it in both the snapshot and continuous settings, and conduct extensive experiments with both real and synthetic datasets to evaluate our proposed algorithms. The experimental results demonstrate that the proposed algorithms can answer DBS queries efficiently.     

Fast algorithms for generalized predictive control

Fast algorithms for generalized predictive control (GPC) are derived by adopting an approach whereby dynamic programming and a polynomial formulation are jointly exploited. They consist of a set of coupled linear polynomial recursions by which the dynamic output feedback GPC law is recursively computed wwith only O(Nn) computations for an n-th order plant and N-steps prediction horizon.     

Gradient minimax techniques for system modelling

Some recently proposed gradient methods for minimax or near minimax approximation are applied to producing optimal second-order and third-order models of a high-order system. The Fletcher-Powell method, a more recent method by Fletcher and o. method by Jacobson and Oksman are employed with least pth approximation, using large values of p, as proposed by Bandler and Charalambous and critically compared with the grazer search technique of minimax approximation by Bandler et al. The solutions obtained are shown to satisfy the necessary conditions for a minimax optimum.     

命题线性时序逻辑的对偶模型问题的复杂性

定义了一个命题线性时序逻辑的对偶模型的概念.一个公式f的对偶模型是指f的满足以下条件的两个模型(即状态的w序列):在每个位置上这两个模型对原子命题的赋值都是对偶的.然后,对于确定一个公式f是否有对偶模型的判定问题(记为DM)和在一个Kripke-结构中确定是否存在从两个给定状态出发的对偶模型满足给定公式f的判定问题(记为KDM)的复杂性进行了研究.证明了以下结果:对于只含有F("Future")算子的命题线性时序逻辑,DM和KDM都是NP完全的;而对于以下命题线性时序逻辑,DM和KDM都是PSPACE完全的:含有F,X ("Next")算子的逻辑、含有U("Until")算子的逻辑、含有U,S,X算子的逻辑以及由Wolper给出的含有正规语言算子的逻辑(一般称为扩展时序逻辑,简称ETL).     

A criterion for atomicity revisited

Concurrent and reactive programs are specified by their behaviours in the presence of a nondeterministic environment. In a natural way, this gives a specification (ARW) of an atomic variable in the style of Abadi and Lamport. Several implementations of atomic variables by lower level primitives are known. A few years ago, we formulated a criterion to prove the correctness of such implementations. The proof of correctness of the criterion itself was based on Lynch’s definition of atomicity by serialization points. Here, this criterion is reformulated as a specification HRW in the formal sense. Simulations from HRW to ARW and vice versa are constructed. These now serve as a constructive proof of correctness of the criterion. Eternity variables are used in the simulation from HRW to ARW. We propose so-called gliding simulations to deal with the problems that appear when occasionally the concrete implementation needs fewer steps than the abstract specification.     

Crown graphs and subdivision of ladders are odd graceful

A graph G of size q is odd graceful, if there is an injection φ from V(G) to {0, 1, 2, …, 2q?1} such that, when each edge xy is assigned the label or weight |f(x)?f(y)|, the resulting edge labels are {1, 3, 5, …, 2q?1}. This definition was introduced in 1991 by Gnanajothi [3], who proved that the graphs obtained by joining a single pendant edge to each vertex of C _n are odd graceful, if n is even. In this paper, we generalize Gnanajothi's result on cycles by showing that the graphs obtained by joining m pendant edges to each vertex of C _n are odd graceful if n is even. We also prove that the subdivision of ladders S(L _n ) (the graphs obtained by subdividing every edge of L _n exactly once) is odd graceful.     

Value monoids of zero-dimensional valuations of rank 1

Classically, Gröbner bases are computed by first prescribing a fixed monomial order. Moss Sweedler suggested an alternative in the mid-1980s and developed a framework for performing such computations by using valuation rings in place of monomial orders. We build on these ideas by providing a class of valuations on K(x,y) that are suitable for this framework. We then perform such computations for ideals in the polynomial ring K[x,y]. Interestingly, for these valuations, some ideals have finite Gröbner bases with respect to a valuation that are not Gröbner bases with respect to any monomial order, whereas other ideals only have Gröbner bases that are infinite.     

Stabilization of feedforward systems approximated by a non-linear chain of integrators

We prove that, for any odd integer p and any strictly positive integer n, feedforward systems which are approximated at the origin by a chain of integrators of degree p and length n can be globally asymptotically stabilized by bounded smooth time-invariant state feedbacks. Our proof is based on the construction of a Lyapunov function and the feedback laws we obtain are given by explicit formulas.     

Optimal Trajectories for a Quadruped Robot with Trot,Amble and Curvet Gaits for Two Energetic Criteria

In this paper, optimal cyclic reference trajectories aredesigned for three gaits of a quadruped robot, the curvet, theamble, and the trot, taking into account the actuatorscharacteristics. The gaits are composed of stance phases andinstantaneous double supports. The principle of virtual leg isused to obtain simpler dynamic model describing the motion ofthe quadruped. The impact phases are modeled by passive impactequations. For the curvet the step is composed of twodifferent half steps. For the amble and trot gaits twofollowing half steps are symmetrical.The optimization problem is solved with an algebraicoptimization technique. The actuated joint evolution is chosenas a polynomial function of time. The coefficients of thepolynomial functions are optimization parameters. Thequadruped studied has non-actuated ankles. The kineticmomentum theorem permits to define the evolution of this non-actuated variable in function of the actuated variables. Twoenergetic criteria are defined: a torque cost and an energetic cost. The first is represented by the integral of the torquenorm and the second by the absolute value integral of theexternal forces work. The two criteria are calculated for adisplacement of one meter. During the optimization process,the constraints on the ground reactions, on the validity ofimpact, on the torques, on the joints velocities and on themotion velocity of the robot prototype are taken into account.Simulation results are presented for the three gaits. Allmotions are realistic. Curvet is the less efficient gait withrespect to the criteria studied. For slow motion, trot is themore efficient gait. But amble permits the fastest motion withthe same actuators.