The forcing relation on n-modal cycles is studied. If alpha is an n-modal cycle then the n-modal cycles with block structure that force alpha form a 2(n)-horseshoe above alpha. If n-modal beta forces alpha, and beta d...
详细信息
The forcing relation on n-modal cycles is studied. If alpha is an n-modal cycle then the n-modal cycles with block structure that force alpha form a 2(n)-horseshoe above alpha. If n-modal beta forces alpha, and beta does not have a block structure over alpha, then beta forces a 2-horseshoe of simple extensions of alpha.
Many interior point methods for large scale linear programming, quadratic programming, the convex programming solve an (n + m) x (n + m) linear system in each iteration. The last m equations require exact solutions in...
Many interior point methods for large scale linear programming, quadratic programming, the convex programming solve an (n + m) x (n + m) linear system in each iteration. The last m equations require exact solutions in order to maintain the feasibility. Current implementations reduce that step to solving an m x m linear system. The solution must be exact, because otherwise the error would be entirely passed on to the last m equations of the original system. This makes the computation costly and sometimes impractical. In this paper, we propose an inexpensive iterative method for solving that (n + m) x (n + m) system. It guarantees exact solutions to the last m equations. The convergence is proved, and the implementational issues are discussed. Some preliminary numerical results are also reported.
In this paper, the problem of inverse full-state hybrid projective synchronization (IFSHPS) for general discrete chaotic systems is introduced and investigated. Based on a new controllers and Lyapunov stability theory...
详细信息
We study line configurations in 3-space by means of ''line diagrams,'' projections into a plane with an indication of over and under crossing at the vertices. If we orient such a diagram, we can associ...
We study line configurations in 3-space by means of ''line diagrams,'' projections into a plane with an indication of over and under crossing at the vertices. If we orient such a diagram, we can associate a ''contracted tensor'' T with it in the same spirit as is done in Knot Theory. We give conditions to make T independent of the orientation, and invariant under isotopy. The Yang-Baxter equation is one such condition. Afterwards we restrict ourselves to Yang-Baxter invariants with a topological state model, and give some new invariants for line isotopy.
We investigate a generalized stochastic epidemic model with two epidemic and communal infections. In our study, we identify a stochastic threshold,, and use it for theoretical analysis to determine the conditions for ...
详细信息
This paper presents a federated sampling strategy aimed at enhancing data efficiency and privacy in IoT networks. By introducing a novel approach to summarization and synthetic data generation, we enable IoT devices t...
详细信息
ISBN:
(数字)9798331519957
ISBN:
(纸本)9798331519964
This paper presents a federated sampling strategy aimed at enhancing data efficiency and privacy in IoT networks. By introducing a novel approach to summarization and synthetic data generation, we enable IoT devices to share compact statistical representations of data rather than raw data, significantly reducing the amount of data transmitted while preserving privacy. Our evaluation, using a protocol classification task, demonstrates that synthetic data generated from these summaries effectively replicates the statistical properties of the original data. This proof-of-concept work lays the foundation for future advancements, including network-wide simulations, intrusion detection mechanisms, and federated learning-inspired aggregation techniques, paving the way for resilient and privacy-preserving IoT systems.
Bayesian lower bounds for the reliability function are obtained for the lognormal failure model with respect to the s-normal-gamma (conjugate) prior distribution and a vague prior distribution of Jeffreys. The Bayesia...
详细信息
Bayesian lower bounds for the reliability function are obtained for the lognormal failure model with respect to the s-normal-gamma (conjugate) prior distribution and a vague prior distribution of Jeffreys. The Bayesian lower bound with respect to the vague prior is the same as the uniformly most accurate (UMA) lower s-confidence bound for reliability. All lower bounds are given in terms of the noncentrality parameter of a generalized noncentral t-distribution. A simple approximation for the noncentrality parameter is discussed. computer simulation results indicate how well the approximation performs and provide a performance comparison between the Bayes lower bounds with respect to the (proper) s-normal-gamma prior and the UMA lower s-confidence bound. The two measures used in the simulations to evaluate performance of the lower bounds are 1) the average difference between the computed lower bound and the true reliability and 2) the fraction of computed lower bounds which are actually less than the true reliability. This Bayes procedure performs very well even though the assumed prior information is not exactly correct; and the approximation is used to obtain the lower bounds.
The classical deterministic inventory model is considered for the case of constant time between each replenishment and linear trend in demand. The optimum policy is derived and shown to apply to both positive and nega...
详细信息
The classical deterministic inventory model is considered for the case of constant time between each replenishment and linear trend in demand. The optimum policy is derived and shown to apply to both positive and negative trends. This policy is used in two examples considered in earlier papers on linear trend. It is shown to give only slightly higher costs than the optimal policy with varying replenishment periods, and is compared with a recent heuristic for that case.
A programmable logic array (PLA) was designed that is capable of implementing 24 logic functions each with 48 product terms of 16 variables. The PLA is composed of two diode matrices, and is programmed by inserting sh...
详细信息
A programmable logic array (PLA) was designed that is capable of implementing 24 logic functions each with 48 product terms of 16 variables. The PLA is composed of two diode matrices, and is programmed by inserting short plugs. Implementation of arithmetic algorithms in a laboratory course dealing with computer hardware has successfully been performed using the PLA to organize a finite-state machine (FSM) controlling a data path. Both the data path and the PLA were incorporated into a panel on which the data flow and the states and outputs of the FSM are made visible by light-emitting diodes. This helps students understand the algorithms and debug the implementation.< >
We consider the problem of extending a given causal time-varying contraction T to become the partial input-output operator of a lossless system. We give a necessary and sufficient condition for the existence of such a...
详细信息
We consider the problem of extending a given causal time-varying contraction T to become the partial input-output operator of a lossless system. We give a necessary and sufficient condition for the existence of such an embedding. In particular, this is the case for T strictly contractive. We show how to construct a large class of extensions for this case and discuss various examples of arbitrary contractions.
暂无评论