The paper is based on a long-lasting research carried out among the members of Serbian ethnic/national minority in Hungary. The research focused on the topic of ethnic identity. This paper is an attempt to derive the actual concept of ethnic identity out of its results, together with the manner in which it is symbolized in the case of the observed group. The approach assumes that (eth-nic) identity is a socio-cultural construction, whereas the results are based on statements and behavior of the group members themselves - those who declare themselves as Serbs.
This paper is concerned with the finite and infinite horizon optimal control issue for a class of networked control systems with stochastic communication protocols. Due to the limitation of networked bandwidth, only the limited number of sensors and actuators are allowed to get access to network mediums according to stochastic access protocols. A discrete-time Markov chain with a known transition probability matrix is employed to describe the scheduling behaviors of the stochastic access protocols, and the networked systems are modeled as a Markov jump system based on the augmenting technique. In such a framework, both the approaches of stochastic analysis and dynamic programming are utilized to derive the optimal control sequences satisfying the quadratic performance index. Moreover, the optimal controller gains are characterized by solving the solutions to coupled algebraic Riccati equations. Finally, a numerical example is provided to demonstrate the correctness and effectiveness of the proposed results.
Motivated by the conjectures in [11], we introduce the maximal chains of a cycle permutation graph, and we use the properties of maximal chains to establish the upper bounds for the toughness of cycle permutation graphs. Our results confirm two conjectures in [11].