Word recognition in a reduced linear prediction space

A label space is defined as a space to which the reference points of a feature space can be mapped. The measurement of similarity in the space of linear prediction features can benefit from this mapping, and a new two-phase algorithm for word similarity studies is proposed. Two experiments for finding an optimum set of parameters and determining system performance are reported.     

Optimal alignments in linear space

Space, not time, is often the limiting factor when computing optimal sequence alignments, and a number of recent papers in the biology literature have proposed space-saving strategies. However, a 1975 computer science paper by Hirschberg presented a method that is superior to the new proposals, both in theory and in practice. The goal of this paper is to give Hirschberg's idea the visibility it deserves by developing a linear-space version of Gotoh's algorithm, which accommodates affine gap penalties. A portable C-software package implementing this algorithm is available on the BIONET free of charge.     

Application of generally weighted moving average method to tracking signal state space model

In predicting time series, if a trend includes a structural break, then a state space model can be applied to revise the predictive method. Some scholars suggest that restricted damped trend models yield excellent prediction results by automatically revising unforeseen structural break factors in the prediction process. Restricted damped trend models add a smoothed error statistic to a local‐level model and use the exponentially weighted moving average (EWMA) method to make corrections. This paper applies the generally weighted moving average (GWMA) concept and method to a restricted damped trend model that changes the smoothed error statistic from the EWMA form to the GWMA form and adds the correction parameter λ, which distinguishes three situations , , and . The original restricted damped trend model applies only to , enabling the model to capture situations in which and increases its generality. This paper also compares the effect of various parameter values on the predictive model and finds the range of parameter settings that optimize the model.     

Robust stability in linear state space models

A new sufficient condition is presented for the stability of interval matrices based on Kharitonov's theorem (1978).     

Structural state space sensitivity in linear systems

The concept of transformation independent noise is introduced to define a general class of structurally insensitive state space realizations of a given transfer function. A performance measure is minimized subject first to only an t₂-scaling constraint on the norm of each state node. This constraint normalizes the contribution of each state in the performance measure. Later additional constraints are imposed on the class of allowable state space structures. One constraint requires a covariance decoupled structure while another imposes a constraint on the Markov parameters of a partitioned substructure.     

A genetic algorithm to solve the storage space allocation problem in a container terminal

In this paper, an efficient genetic algorithm (GA) is presented to solve an extended storage space allocation problem (SSAP) in a container terminal. The SSAP is defined as the temporary allocation of the inbound/outbound containers to the storage blocks at each time period with aim of balancing the workload between blocks in order to minimize the storage/retrieval times of containers. An extended version of a SSAP proposed in the literature is considered in this paper in which the type of container affects on making the decision on the allocation of containers to the blocks. In real-world cases, there are different types (as well as different sizes) of containers consisting of several different goods such as regular, empty and refrigerated containers. The extended SSAP is solved by an efficient GA for real-sized instances. Because of existing the several equality constraints in the extended model, the implementation of the GA in order to quick and facilitate achieve to the feasible solutions is one of the outstanding advantages of this paper. The performance of the extended model and proposed GA is verified by a number of numerical examples.     

Stable unmerging in linear time and constant space

In the Summer 1985 issue of SIGACT News, Santoro enquired about the space-time complexity of unmerging. Suppose that two sorted lists A and B of total size n are merged to produce the list L. The problem is to separate L into A and B in sorted order. An optimal algorithm is presented which unmerges in O(n) time using O(1) extra space, and which is stable.     

基于知识的集装箱堆场箱位分配计划研究

针对集装箱堆场箱位分配问题中规则因素较强的特点,建立基于知识的箱位分配计划方法.首先描述了该问题中知识构成和表示方法;并提出了基于知识的箱位分配模型,包括分配区域划分、作业模式及规则匹配、最优箱位选择三个部分.实例分析表明本方法可取得良好的箱位分配效果.     

Goal-oriented state control of a cognitive linear model with a bounded state space

Representing the basic concept of this paper, cognitive map is used to construct a cognitive linear dynamic model with a bounded state space. We consider the problem of transferring this model from an arbitrary initial state to some asymptotically stable state belonging to a neighborhood of a given state. We suggest two classes of controls and introduce the transfer “quality” as the proximity of the resulting steady state to the desired state. And finally, an illustrative example is provided.     

Continued-fraction decomposition of linear systems in the state space

Various results pertaining to a continued-fraction decomposition of matrix formal power series, and in particular of multi-input multi-output linear constant systems, are presented from a state-space point of view.     

Structural stability of linear difference equations in Hilbert space

In this note, we prove that linear difference equations in Hilbert space are structurally stable if and only if they have an exponential dichotomy.     

Querying fragmented relations in a distributed database

Summary The paper discusses the query optimization problem in a distributed database system supporting a complex fragmentation schema, in which different fragments can share the same set of data. The fragmentation and the distribution of data are assumed to be transparent to the user, who queries the database in terms of the global relations. The optimization of queries stated on a single fragmented relation is considered, and a method for its solution is presented. The method is based on an algorithm which calculates a set of virtual fragments that can alternatively be used to answer the query.     

使用LDC码的BI-STCM-ID系统中的星座映射分析

研究了BI-STCM-ID系统中的星座映射问题。证明了在使用LDC（Linear Dispersion Code）空时编码方案的BI-STCM-ID系统中,基于最大化编码增益的高维星座映射设计优化问题等价于基于最大化欧式距调和均值的一维星座映射设计优化问题。     

基于知识的集装箱堆场箱位分配计划研究*

针对集装箱堆场箱位分配问题中规则因素较强的特点,建立基于知识的箱位分配计划方法。首先描述了该问题中知识构成和表示方法;并提出了基于知识的箱位分配模型,包括分配区域划分、作业模式及规则匹配、最优箱位选择三个部分。实例分析表明本方法可取得良好的箱位分配效果。     

两类多用户MIMO线性预编码的功率分配*

将多用户MIMO线性预编码分为干扰消除和干扰抑制两类,针对干扰消除中的块对角化（block diagonalization,BD）迫零算法,讨论了经典注水功率分配,提出一种信噪比控制功率分配方案。该方案可使系统各子流接收信噪比相同,各个用户的误码性能一致,也可控制用户之间的任意信噪比比例;研究了干扰抑制类预编码的统一功率分配方案,提出一种针对存在干扰系统的适用于相关信道的迭代注水算法。该算法引入经典注水的思想,将干扰和噪声一并考虑。仿真结果表明,该算法在相关信道下使系统和容量获得了明显提高。     

The BC-chain method for representing combinators in linear space

Turner’s combinator implementation (1979) of functional programs requires the memory space of size Ω(n ²) in the worst case for translating given lambda expressions of lengthn to combinator graphs. In this paper a new idea named the BC-chain method for transferring actual arguments to variables is presented. We show that the BC-chain method requires onlyO(n) space for the translation. The basic idea is to group together into a single entity a sequence of combinatorsB, B′, C andC′, for a variable, which appear consecutively along a path in the combinator graph. We formulate two reduction algorithms in the new representation. The first algorithm naively simulates the original normal order reduction, while the second algorithm simulates it in constant time per unit operation of the original reduction. Another reduction method is also suggested, and a technique for practical implementation is briefly mentioned.     

Stability robustness for linear state space models - a Lyapunov mapping approach

Some Pythagorean-like conditions for the existence of a common Lyapunov solution for two given matrices are presented. These conditions are set on the Lyapunov mappings associated with given matrices. The key is the semipositiveness of linear mappings defined on symmetric matrices. From the viewpoint of the existence of a common Lyapunov solution, some known stability robustness results are reviewed and refined.