Restorations of punctured languages and similarity of languages

Punctured languages are languages whose words are partial words in the sense that the letters at some positions are unknown. We investigate to which extent restoration of punctured languages is possible if the number of unknown positions or the proportion of unknown positions per word, respectively, is bounded, and we study their relationships for different boundings. The considered restoration classes coincide with similarity classes according to some kind of similarity for languages. Thus all results we can also formulate in the language of similarity. We show some hierarchies of similarity classes for each class from the Chomsky hierarchy and prove the existence of linear languages which are not δ ‐similar to any regular language for any δ < ½. For δ ≥ ½ this is unknown but it could only be possible in the case of non‐slender linear languages. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

On disjoint configurations in infinite graphs

For a graph A and a positive integer n, let nA denote the union of n disjoint copies of A; similarly, the union of ?₀ disjoint copies of A is referred to as ?₀A. It is shown that there exist (connected) graphs A and G such that nA is a minor of G for all n??, but ?₀A is not a minor of G. This supplements previous examples showing that analogous statements are true if, instead of minors, isomorphic embeddings or topological minors are considered. The construction of A and G is based on the fact that there exist (infinite) graphs G₁, G₂,… such that G_i is not a minor of G_j for all i ≠ j. In contrast to previous examples concerning isomorphic embeddings and topological minors, the graphs A and G presented here are not locally finite. The following conjecture is suggested: for each locally finite connected graph A and each graph G, if nA is a minor of G for all n ? ?, then ?₀A is a minor of G, too. If true, this would be a far‐reaching generalization of a classical result of R. Halin on families of disjoint one‐way infinite paths in graphs. © 2002 Wiley Periodicals, Inc. J Graph Theory 39: 222–229, 2002; DOI 10.1002/jgt.10016     

Optimality conditions and duality theory for minimizing sums of the largest eigenvalues of symmetric matrices

The sum of the largest eigenvalues of a symmetric matrix is a nonsmooth convex function of the matrix elements. Max characterizations for this sum are established, giving a concise characterization of the subdifferential in terms of a dual matrix. This leads to a very useful characterization of the generalized gradient of the following convex composite function: the sum of the largest eigenvalues of a smooth symmetric matrix-valued function of a set of real parameters. The dual matrix provides the information required to either verify first-order optimality conditions at a point or to generate a descent direction for the eigenvalue sum from that point, splitting a multiple eigenvalue if necessary. Connections with the classical literature on sums of eigenvalues and eigenvalue perturbation theory are discussed. Sums of the largest eigenvalues in the absolute value sense are also addressed.This paper is dedicated to Phil Wolfe on the occasion of his 65th birthday.The work of this author was supported by the National Science Foundation under grants CCR-8802408 and CCR-9101640.The work of this author was supported in part during a visit to Argonne National Laboratory by the Applied Mathematical Sciences subprogram of the Office of Energy Research of the U.S. Department of Energy under contract W-31-109-Eng-38, and in part during a visit to the Courant Institute by the U.S. Department of Energy under Contract DEFG0288ER25053.     

因子分析在企业竞争力评价中的应用

根据因子分析原理,建立了企业竞争力的规模因子、效益因子和成长因子得分模型。通过现实竞争力和潜在竞争力分析,实现了企业竞争力和可持续发展的评价。     

一种检验定性指标的有效方法

介绍了一种检验定性指标的有效方法,可用于确定产品的合格率和评价检验人员的检验水平。用该方法分析了某厂产品的一项实际指标,合格率为91 4%,还对该厂10名检验员的检验水平作了客观的评价。     

ON SOME INTERPRETATIONS OF CLASSICAL LOGIC

In distinction from the well-known double-negation embeddings of the classical logic we consider some variants of single-negation embeddings and describe some classes of superintuitionistic first-order predicate logics in which the classical first-order calculus is interpretable in such a way. Also we find the minimal extensions of Heyting's logic in which the classical predicate logic can be embedded by means of these translations.     

Influence of concentration on the activation energy for diffusion in polymer-solvent systems

The self-diffusion of benzene, toluene, and ethylbenzene in polystyrene have been analyzed using the Vrentas/Duda free-volume diffusion model. Diffusion coefficient predictions suggest an exponential concentration dependence of the activation energy required to overcome attractive forces, E. Without the use of any diffusion data approximating E as zero over the entire concentration range yields self-diffusion coefficient predictions which are in good agreement with experimental data. © 1992 John Wiley & Sons, Inc.     

THE MODELING AND ESTIMATION OF THE SHORT-RUN SUPPLY OF ROUNDWOOD UNDER NONLINEAR INCOME TAXES

This paper deals with the theory and estimation of the short-run supply of roundwood under nonlinear (progressive) income taxation. The theoretical part of the paper uses the two-period consumption harvesting model to introduce nonlinear income taxes into the forest management problem and presents a simple method to determine the optimal supply of roundwood in this case. In the empirical part of the paper, the model is specified in a way suitable for econometric analysis. The estimation method is the maximum likelihood method, and the estimation results seem to support the theoretical model. Finally, some results from model simulation imply that income taxation may have a nonnegligible impact on the supply of roundwood.     

Efficacy of the accent method of voice therapy

The management of voice disorders may follow one of four approaches: surgical, pharmacological, technical aid, and/or voice therapy. The latter approach offers a wide variety of techniques, each based on certain theoretical beliefs. One of these techniques is the Smith Accent Method. The principles and goals of the Accent Method are presented. The results of its application are discussed. This technique proved effective for cases of functional voice disorders, vocal nodules, and some degrees of vocal fold paralysis.     

RECONSTRUCTION OF BINARY RELATIONS FROM THEIR RESTRICTIONS OF CARDINALITY 2, 3, 4 and (n - 1) II

We shall prove here that any binary relation on a base E with cardinality n > 6 is reconstructible from its restrictions of cardinality 2, 3, 4 and (n - 1). This proof needs results of part I of this paper where we characterize any pair of relations R, R' which are 2-, 3- and 4-hypomorphic. As a corollary we obtain that any binary relation is (n - 4)-reconstructible (when n > 9).