老年人彩度对比敏感度函数研究及滤波应用

为研究老年人彩色视觉频率响应特性，获取彩度对比敏感度与空间频率之间的函数关系，本文在LCH均匀颜色空间基础上，固定明度和色调角值，以彩度作为变量，设计人眼彩度对比敏感度实验，进行人眼视觉观察实验。获得彩度对比敏感度与空间频率的关系，并构建指数型对比敏感度函数模型。经分析表明老年人眼彩度对比敏感度随着空间频率的增加，产生先升高再缓慢降低的变化，各色调角下彩度对比度存在差异。经分析人眼对比敏感度差异与人眼视觉辨色特性有很大的相关性。并且，将构建的对比敏感度函数模型用于实现基于人眼视觉系统的滤波处理。     

Pattern of separatrices and intrinsic reaction coordinates for degenerate thermal rearrangements

A structurally stable model of the standard adiabatic gradient field of the potential energy surface for certain pericyclic reactions is derived.These reactions are not subjected to the principles of orbital isomerism or to the Woodward-Hoffmann rules.Use is made of a principle established by Ariel Fernández and Oktay Sinanolu which precludes direct meta-IRC connections between transition states.It is shown that Jahn-Teller isomers of the singlet biradicals involved in the process are not interconvertible since the biradical configuration is not a transition state but a critical point with Hessian matrix with two negative eigenvalues.The topological features of the PES obtained by combinatorial methods are in full agreement with earlier results obtained from MINDO calculations.     

Note on the application of the reduced graph model in conjunction with search trees to the enumeration ofKekulé structures

The reduced graph model, when used in conjunction with the search trees method, provides a novel combinatorial procedure for the enumeration and generation ofKekulé structures. The procedure is suited for large benzenoid hydrocarbons consisting of cata- and thin peri-condensed parts.

---

Zur Anwendung des Reduced Graph Model im Zusammenhang mit Search Trees zur Ermittlung der Anzahl möglicherKekulé-Strukturen

Zusammenfassung Das Modell erlaubt mit der im Titel genannten Kombination eine neuartige Methode zur Ermittlung und Generierung vonKekulé-Strukturen. Das Verfahren ist für große benzoide Kohlenwasserstoffe geeignet, die aus cata- und (dünnen) peri-kondensierten Teilstrukturen bestehen.

     

A novel nomenclature of polycyclic aromatic hydrocarbons without using graph centre

In this paper, we develop a novel adjacency matrix, He-matrix, corresponding to the dualist graph. Without using the graph center concept, we advance a novel nomenclature of polycyclic aromatic hydrocarbons. Further, we derive some distinguishing theorems about PAH molecules and present some results of our automatic derivatization and automatic classification counting of fused PAH molecules.     

Cyclic Conjugation Energy Effects in Polycyclic π-Electron Systems

Summary. The fact that cyclic arrangements of double bonds have a dramatic effect on the behavior of conjugated organic molecules is known since the 19th century. The fact that in monocyclic conjugated systems the size of the cycle and the number of -electrons involved is decisive for their stability (aromaticity) or lack of stability (antiaromaticity) is known since the 1930s. In polycyclic -electron systems several cyclic effects are present simultaneously and their separation became possible only recently. A molecular orbital method has been elaborated, by means of which the energy effects of individual cycles in polycyclic -electron systems can be estimated. This method is briefly outlined and illustrated by pertinent examples. An exhaustive bibliography of the topic considered is given.     

On Schreier graphs of gyrogroup actions

The notion of a group action can be extended to the case of gyrogroups. In this article, we examine a digraph and graph associated with a gyrogroup action on a finite nonempty set, called a Schreier digraph and graph. We show that algebraic properties of gyrogroups and gyrogroup actions such as being gyrocommutative, being transitive, and being fixed-point-free are reflected in their Schreier digraphs and graphs. We also prove graph-theoretic versions of the three fundamental theorems involving actions: the Cauchy–Frobenius lemma (also known as the Burnside lemma), the orbit-stabilizer theorem, and the orbit decomposition theorem. Finally, we make a connection between gyrogroup actions and actions of symmetric groups by evaluation via Schreier digraphs and graphs.     

Large cycles in random generalized Johnson graphs

This paper studies thresholds in random generalized Johnson graphs for containing large cycles, i.e. cycles of variable length growing with the size of the graph. Thresholds are obtained for different growth rates.     

Two Hamiltonian cycles

If the line graph of a graph G decomposes into Hamiltonian cycles, what is G? We answer this question for decomposition into two cycles.     

The spum and sum-diameter of graphs: Labelings of sum graphs

A sum graph is a finite simple graph whose vertex set is labeled with distinct positive integers such that two vertices are adjacent if and only if the sum of their labels is itself another label. The spum of a graph G is the minimum difference between the largest and smallest labels in a sum graph consisting of G and the minimum number of additional isolated vertices necessary so that a sum graph labeling exists. We investigate the spum of various families of graphs, namely cycles, paths, and matchings. We introduce the sum-diameter, a modification of the definition of spum that omits the requirement that the number of additional isolated vertices in the sum graph is minimal, which we believe is a more natural quantity to study. We then provide asymptotically tight general bounds on both sides for the sum-diameter, and study its behavior under numerous binary graph operations as well as vertex and edge operations. Finally, we generalize the sum-diameter to hypergraphs.     

Oriented hypergraphs: Balanceability

An oriented hypergraph is an oriented incidence structure that extends the concepts of signed graphs, balanced hypergraphs, and balanced matrices. We introduce hypergraphic structures and techniques that generalize the circuit classification of the signed graphic frame matroid to any oriented hypergraphic incidence matrix via its locally-signed-graphic substructure. To achieve this, Camion's algorithm is applied to oriented hypergraphs to provide a generalization of reorientation sets and frustration that is only well-defined on balanceable oriented hypergraphs. A simple partial characterization of unbalanceable circuits extends the applications to representable matroids demonstrating that the difference between the Fano and non-Fano matroids is one of balance.