Reflexive-ACL技术及典型应用设计

以实现网络单向访问和内部网络安全为设计背景,介绍了自反访问表技术的概念、工作原理和配置方法,并且与基本访问表技术进行了对比,综合运用自反访问表技术,提出了一个内外网间单向访问的设计方案。

用Reflexive ACL实现网络单向访问

通过建立路由器访问控制列表,可以控制任何IP地址对网络的访问,但要实现网络的单向访问,一般的访问列表是无法做到的。本文从实际应用的角度出发,利用一种特殊的ACL-ReflexiveACL,即自反访问控制列表,来实现网络的单向访问,并分析、阐述了它的配置过程。

THE GENERALIZED REFLEXIVE SOLUTION FOR A CLASS OF MATRIX EQUATIONS (AX-B,XC=D)

In this article, the generalized reflexive solution of matrix equations （AX = B, XC = D） is considered. With special properties of generalized reflexive matrices, the necessary and sufficient conditions for the solvability and the general expression of the solution are obtained. Moreover, the related optimal approximation problem to a given matrix over the solution set is solved.

“反思社会学”,还是“反身社会学”--Reflexive Sociology汉译探析

对布迪厄思想关键词reflexive sociology,现至少有"反思社会学""反思性社会学""反观社会学""反身社会学""反身性社会学"等五种译法。鉴于"反思社会学"之"反思"混淆了reflexive和reflective,前者尚可译为"反身",后者除了"反思"再无词可译。使用"反思社会学"无异于让reflexive抢了reflective的地盘,而reflective在布迪厄著作中同样常见。reflexive本义即为"反身",且布迪厄赋予实践突出的意义,而实践仰仗行动者的身体。在汉语中,"身"有"我自己""你自己""他自己"之意,如"反求诸身";又有实践的意蕴,如"身体力行"。故建议使用"反身社会学"翻译reflexive sociology。

Reflexive solution to a system of matrix equations

We derive necessary and sufficient conditions for the existence and an expression of the （anti）reflexive solution with respect to the nontrivial generalized reflection matrix P to the system of complex matrix equations AX = B and XC = D. The explicit solutions of the approximation problem min x∈Ф ｜｜X - E｜｜F was given, where E is a given complex matrix and Ф is the set of all reflexive （or antireflexive） solutions of the system mentioned above, and ｜｜·｜｜ is the Frobenius norm. Furthermore, it was pointed that some results in a recent paper are special cases of this paper.

Approximate controllability of infinite dimensional linear systems in nonreflexive state spaces

This paper deals with the problem of approximate controllability of infinite dimensional linear systems in nonreflexive state spaces. A necessary and sufficient condition for approximate controllability via L^p（[0, T], U）, 1≤p〈∞ is obtained,where L^p（ [0, T], U） is the control function space.

ALGORITHM OF SOLUTIONS FOR MIXEDNONLINEAR VARIATIONAL-LIKE INEQUALITIES IN REFLEXIVE BANACH SPACE

In this paper, the author studies a class of mixed nonlinear variational-like inequalities in reflexive Banach space. By applying a minimax inequality obtained by the author, some existence uniqueness theorems of solutions for the mixed nonlinear variational-like inequalities are proved. Next, by applying the auxiliary problem technique, rite author suggests an innovative iterative algorithm to compute the approximate solutions of the mixed nonlinear variational-like inequalities. Finally, the convergence criteria is also discussed.

Auxiliary principle and approximation solvability for system of new generalized mixed equilibrium problems in reflexive Banach spaces

A new system of generalized mixed equilibrium problems （SGMEPs） involving generalized mixed variational-like inequality problems is introduced and studied in reflexive Banach spaces. A system of auxiliary generalized mixed equilibrium problems （SAGMEPs） for solving the SGMEPs is first introduced. Existence and uniqueness of the solutions to the SAGMEPs is proved under quite mild assumptions without any coercive conditions in reflexive Banach spaces. Using the auxiliary principle technique, a new iterative algorithm for solving the SGMEPs is proposed and analyzed. Strong convergence of the iterative sequences generated by the algorithm is also proved under quite mild assumptions without any coercive conditions. These results improve, unify, and generalize some recent results in this field.

The Reflexive Solutions of the Matrix Equations (AX,XB^H )= (C,D^H )

The matrix equations (AX, XBH)=(C, DH) have been widely used in structural design, parameter identification, linear optimal control, and so on. But few researches studied the reflexive solutions. A new approach for the reflexive solutions to the matrix equations was proposed. By applying the canonical correlation decomposition (CCD) of matrix pairs, the necessary and sufficient conditions for the existence and the general expression for the reflexive solutions of the matrix equations (AX, XBH)=(C, DH) were established. In addition, by using the methods of space decomposition, the expression of the optimal approximation solution to a given matrix was derived.

Bilevel generalized mixed equilibrium problems involving generalized mixed variational-like inequality problems in reflexive Banach spaces

A new bilevel generalized mixed equilibrium problem （BGMEP） involving generalized mixed variational-like inequality problems （GMVLIPs） is introduced and studied in the reflexive Banach spaces. First, an auxiliary generalized mixed equilibrium problem （AGMEP） is introduced to compute the approximate solutions of the BGMEP involving the GMVLIPs. By using a minimax inequality, the existence and the unique- ness of solutions of the AGMEP are proved under mild conditions without any coercive assumptions. By using an auxiliary principle technique, the new iterative algorithms are proposed and analyzed, with which the approximate solutions of the BGMEP are computed. The strong convergence of the iterative sequence generated by the algorithms is shown under mild conditions without any coercive assumptions. These new results can generalize some recent results in this field.

Block Decompositions and Applications of Generalized Reflexive Matrices

Generalize reflexive matrices are a special class of matrices ?that have the relation where? and ?are some generalized reflection matrices. The nontrivial cases ( or ) of this class of matrices occur very often in many scientific and engineering applications. They are also a generalization of centrosymmetric matrices and reflexive matrices. The main purpose of this paper is to present block decomposition schemes for generalized reflexive matrices of various types and to obtain their decomposed explicit block-diagonal structures. The decompositions make use of unitary equivalence transformations and, therefore, preserve the singular values of the matrices. They lead to more efficient sequential computations and at the same time induce large-grain parallelism as a by-product, making themselves computationally attractive for large-scale applications. A numerical example is employed to show the usefulness of the developed explicit decompositions for decoupling linear least-square problems whose coefficient matrices are of this class into smaller and independent subproblems.

On Edge Irregular Reflexive Labeling of Categorical Product of Two Paths

Among the huge diversity of ideas that show up while studying graph theory,one that has obtained a lot of popularity is the concept of labelings of graphs.Graph labelings give valuable mathematical models for a wide scope of applications in high technologies(cryptography,astronomy,data security,various coding theory problems,communication networks,etc.).A labeling or a valuation of a graph is any mapping that sends a certain set of graph elements to a certain set of numbers subject to certain conditions.Graph labeling is a mapping of elements of the graph,i.e.,vertex and for edges to a set of numbers(usually positive integers),called labels.If the domain is the vertex-set or the edge-set,the labelings are called vertex labelings or edge labelings respectively.Similarly,if the domain is V(G)[E(G)],then the labeling is called total labeling.A reflexive edge irregular k-labeling of graph introduced by Tanna et al.:A total labeling of graph such that for any two different edges ab and a'b'of the graph their weights has wt_(x)(ab)=x(a)+x(ab)+x(b) and wt_(x)(a'b')=x(a')+x(a'b')+x(b') are distinct.The smallest value of k for which such labeling exist is called the reflexive edge strength of the graph and is denoted by res(G).In this paper we have found the exact value of the reflexive edge irregularity strength of the categorical product of two paths (P_(a)×P_(b))for any choice of a≥3 and b≥3.

A Class of Constrained Inverse Eigenproblem and Associated Approximation Problem for Symmetric Reflexive Matrices

Let S∈Rn×n be a symmetric and nontrival involution matrix. We say that A∈E R n×n is a symmetric reflexive matrix if AT = A and SAS = A. Let S R r n×n(S)={A|A= AT,A = SAS, A∈Rn×n}. This paper discusses the following two problems. The first one is as follows. Given Z∈Rn×m (m < n),∧= diag(λ1,...,λm)∈Rm×m, andα,β∈R withα<β. Find a subset (?)(Z,∧,α,β) of SRrn×n(S) such that AZ = Z∧holds for any A∈(?)(Z,∧,α,β) and the remaining eigenvaluesλm+1 ,...,λn of A are located in the interval [α,β], Moreover, for a given B∈Rn×n, the second problem is to find AB∈(?)(Z,∧,α,β) such that where ||.|| is the Frobenius norm. Using the properties of symmetric reflexive matrices, the two problems are essentially decomposed into the same kind of subproblems for two real symmetric matrices with smaller dimensions, and then the expressions of the general solution for the two problems are derived.

Nilpotent Elements and Nil-Reflexive Property of Generalized Power Series Rings

Let R be a ring and (S,≤) a strictly ordered monoid. In this paper, we deal with a new approach to reflexive property for rings by using nilpotent elements, in this direction we introduce the notions of generalized power series reflexive and nil generalized power series reflexive, respectively. We obtain various necessary or sufficient conditions for a ring to be generalized power series reflexive and nil generalized power series reflexive. Examples are given to show that, nil generalized power series reflexive need not be generalized power series reflexive and vice versa, and nil generalized power series reflexive but not semicommutative are presented. We proved that, if R is a left APP-ring, then R is generalized power series reflexive, and R is nil generalized power series reflexive if and only if R/I is nil generalized power series reflexive. Moreover, we investigate ring extensions which have roles in ring theory.

Note on Reflexive Algebras with Non-distribut iveInvariant Lattices

In this note,we discuss some properties of reflexive algebras on a Hilbert space with invariant subspace lattices as realizations of the pentagon and the double triangle and give some results concerning hyperreflexivity,automorphism and finite rank operators.

Feedback Systems on a Reflexive Banach Space—Linearization

The aim of our work is to formulate and demonstrate the results of the normality, the Lipschitz continuity, of a nonlinear feedback system described by the monotone maximal operators and hemicontinuous, defined on real reflexive Banach spaces, as well as the approximation in a neighborhood of zero, of solutions of a feedback system [A,B] assumed to be non-linear, by solutions of another linear, This approximation allows us to obtain appropriate estimates of the solutions. These estimates have a significant effect on the study of the robust stability and sensitivity of such a system see [1] [2] [3]. We then consider a linear FS , and prove that, if ; , with the respective solutions of FS’s [A,B] and corresponding to the given (u,v) in . There exists,, positive real constants such that, . These results are the subject of theorems 3.1, ... , 3.3. The proofs of these theorems are based on our lemmas 3.2, ... , 3.5, devoted according to the hypotheses on A and B, to the existence of the inverse of the operator I+BA and . The results obtained and demonstrated along this document, present an extension in general Banach space of those in [4] on a Hilbert space H and those in [5] on a extended Hilbert space .

Flexible DPPT‑TT/PEO Fiber‑Exploiting Electro‑optical Synaptic Transistor for Artificial Withdrawal Reflex Arc

An artificial withdrawal reflex arc that can realize neuromorphic tactile perception,neural coding,information processing,and real-time responses was fabricated at the device level without dependence on algorithms.As an extended application,the artificial reflex arc was used to perform an object-lifting task based on tactile commands,and it can easily lift a 200-g weight.A fiber-exploiting electro-optical synaptic transistor(FEST)was fabricated to emulate synaptic plasticity modulated by electrical or optical spikes.Due to an ultrahigh spike duration-dependent plasticity index(~12,651%),the FEST was applied in electro-optical encrypted communication tasks and effectively increased signal recognition accuracy.In addition,the FEST has excellent bending resistance(bending radii=0.6-1.4 cm,bending cycles>2000)and stable illumination responses for a wide range of incident angles(0°-360°),demonstrating its potential applicability in wearable electronics.This work presents new design strategies for complete artificial reflex arcs and wearable neuromorphic devices,which may have applications in bioinspired artificial intelligence,human-machine interaction,and neuroprosthetics.

Strongly s-Reflexive Rings Relative to a Monoid

For a monoid M and an endomorphism α of a ring R, we introduce the notion of strongly M-α-reflexive rings and study its properties. For an u.p.-monoid M and a right Ore ring R with its classical right quotient ring Q, we prove that R is strongly M-α-reflexive if and only if Q is strongly M-α-reflexive, where R is α-rigid, α is an epimorphism of R. The relationship between some special subrings of upper triangular matrix rings and strongly M-α-reflexive rings is also investigated. Several known results similar to strongly M-α-reversible rings are obtained.