Sharif Digital Repository

Given a simple polygon P with n vertices, the visibility polygon (V P) of a point q (V P(q)), or a segment (formula present) (V P(pq)) inside P can be computed in linear time. We propose a linear time algorithm to extend V P of a viewer (point or segment), by converting some edges of P into mirrors, such that a given non-visible segment (formula present) can also be seen from the viewer. Various definitions for the visibility of a segment, such as weak, strong, or complete visibility are considered. Our algorithm finds every edge such that, when converted to a mirror, makes (formula present) visible to our viewer. We find out exactly which interval of (formula present) becomes visible, by... 

Given a simple polygon P with n vertices, the visibility polygon (VP) of a point q, or a segment pq‾ inside P can be computed in linear time. We propose a linear time algorithm to extend the VP of a viewer (point or segment), by converting some edges of P into mirrors, such that a given non-visible segment uw‾ can also be seen from the viewer. Various definitions for the visibility of a segment, such as weak, strong, or complete visibility are considered. Our algorithm finds every edge that, when converted to a mirror, makes uw‾ visible to our viewer. We find out exactly which interval of uw‾ becomes visible, by every edge middling as a mirror, all in linear time. In other words, in this... 

This paper deals with fractional-order linear time invariant swarm systems. Necessary and sufficient conditions for asymptotic swarm stability of these systems are presented. Also, based on a time response analysis the speed of convergence in an asymptotically swarm stable fractional-order linear time invariant swarm system is investigated and compared with that of its integer-order counterpart. Numerical simulation results are presented to show the effectiveness of the paper results  

Bounded-input bounded-output (BIBO) stability of distributed-order linear time-invariant (LTI) systems with uncertain order weight functions and uncertain dynamic matrices is investigated in this paper. The order weight function in these uncertain systems is assumed to be totally unknown lying between two known positive bounds. First, some properties of stability boundaries of fractional distributed-order systems with respect to location of eigenvalues of dynamic matrix are proved. Then, on the basis of these properties, it is shown that the stability boundary of distributed-order systems with the aforementioned uncertain order weight functions is located in a certain region on the complex... 

This article investigates the robustness of strong structural controllability for linear time-invariant and linear time-varying directed networks with respect to structural perturbations, including edge deletions and additions. In this direction, we introduce a new construct referred to as a perfect graph associated with a network with a given set of control nodes. The tight upper bounds on the number of edges that can be added to, or removed from a network, while ensuring strong structural controllability, are then derived. Moreover, we obtain a characterization of critical edge sets, the maximal sets of edges whose any subset can be respectively added to or removed from a network while... 

This paper considers the Integral Stabilizability (IS) and partial integrity of Linear Time Invariant (LTI) systems with an unstable sub-system. The main contribution of the paper is to show that if the unstable sub-system can be stabilized by means of output feedback, then one obtains an integrity condition which is actually equivalent to that of open-loop stable systems, with two additional assumptions. This means the condition may be evaluated solely on the basis of plant information and does not rely on the knowledge of the values of the controller parameters  

This paper studies undamped oscillations generated by marginally stable fractional order linear time invariant (LTI) systems. In this study, an analytical approach is proposed to be used for harmonic analysis of such oscillations in marginally stable commensurate order LTI systems. Also, it is shown that the Q-semi norm of the limit sets for a trajectory of these systems can be analytically determined based on the Q-semi norm of the initial condition, where Q is a specific matrix. Moreover, this result is extended to the wider class of rational order systems. Finally, some numerical examples are presented to demonstrate the use of the paper results  

This paper is devoted to analysis of undamped oscillations generated by fractional order linear time invariant (LTI) systems. At first, the trajectories of marginally stable commensurate order systems are investigated. It is verified that we can not use the time-independent phase flow concept for this kind of systems. Also, the differences with the integer order case are highlighted. Then, it is shown that we can determine the Q-norm of the limit sets of a trajectory for these systems based on the Q-norm of the initial condition. Some numerical examples are brought to confirm the achievements of the paper  

For a simple polygon P of size n, we define weak visibility counting problem (WVCP) as finding the number of visible segments of P from a query line segment pq. We present different algorithms to compute WVCP in sub-linear time. In our first algorithm, we spend O(n7) time to preprocess the polygon and build a data structure of size O(n6), so that we can optimally answer WVCP in O(logn) time. Then, we reduce the preprocessing costs to O(n4+ε) time and space at the expense of more query time of O(log5n). We also obtain a trade-off between preprocessing and query time costs. Finally, we propose an approximation method to reduce the preprocessing costs to O(n2) time and space and O(n1/2+ε) query... 

Identifying communities has always been a fundamental task in analysis of complex networks. Many methods have been devised over the last decade for detection of communities. Amongst them, the label propagation algorithm brings great scalability together with high accuracy. However, it has one major flaw; when the community structure in the network is not clear enough, it will assign every node the same label, thus detecting the whole graph as one giant community. We have addressed this issue by setting a capacity for communities, starting from a small value and gradually increasing it over time. Preliminary results show that not only our extension improves the detection capability of the... 

Reo is a connector language for the exogenous composition and orchestration of components in a software system. An operational semantics of Reo connectors can be given in terms of Büchi automata over a suitable alphabet of records, capturing both synchronization and context dependency requirements. In this paper, we define an action based linear time temporal logic for expressing properties of Reo connectors. Formulas can be synthesized into Büchi automata representing Reo connectors, thus leading to an automata based model checking algorithm. By generalizing standard automata based model checking algorithms for linear time temporal logic, we give an efficient on-the-fly algorithm for the... 

This paper deals with asymptotic swarm stabilization of fractional order linear time invariant swarm systems in the presence of two constraints: the input saturation constraint and the restriction on distance of the agents from final destination which should be less than a desired value. A feedback control law is proposed for asymptotic swarm stabilization of fractional order swarm systems which guarantees satisfying the above-mentioned constraints. Numerical simulation results are given to confirm the efficiency of the proposed control method  

This paper investigates the robustness of strong structural controllability for linear time-invariant directed networked systems with respect to structural perturbations, including edge additions and deletions. In this regard, an algorithm is presented that is initiated by endowing each node of a network with a successive set of integers. Using this algorithm, a new notion of perfect graphs associated with a network is introduced, and tight upper bounds on the number of edges that can be added to, or removed from a network, while ensuring strong structural controllability, are derived. Moreover, we obtain a characterization of critical edges with respect to edge additions and deletions;... 

This article introduces a new time-varying model to generate synthetic non-stationary acceleration records using the modified Kanaii-Tajimi model with time-variant parameters. The proposed method can capture two different dominant frequencies per time which makes it suitable for synthesizing the near-field no-pulse earthquake records. A number of closed-form relationships are developed to describe the frequency dependent time-domain level crossings of the simulated records under white noise excitation. The model parameters are optimized using the crossing and Arias intensity properties of the synthetic and target records. The efficiency of the proposed model is demonstrated using a data base... 

A method for the reduction of interactions in linear time invariant (LTI) multivariable uncertain systems is proposed. An H∞-norm metric is proposed for the assessment of interactions in interval uncertain multiple-input multiple-output (MIMO) plants. Based on this, a procedure for the design of fixed-order dynamic decoupling precompensators for MIMO plants with interval uncertainty is outlined which can be solved using efficient solvers such as CVX. The proposed methodology is used to develop a low-order robust multivariable controller for voltage and frequency control of an islanded distributed generation (DG) unit. Copyright © 2017 by ASME  

BIBO stability of linear time-invariant (LTI) distributed order dynamic systems with non-negative weight functions is investigated in this paper by using Lagrange inversion theorem. New sufficient conditions of stability/instability are presented for these systems accordingly. These algebraically simple conditions are relatively tight and their conservatism is adjustable. © 2018 Chinese Automatic Control Society and John Wiley & Sons Australia, Ltd  

In this paper, we discuss the controllability of a family of linear time-invariant (LTI) networks defined on a signed graph. In this direction, we introduce the notion of positive and negative signed zero forcing sets for the controllability analysis of positive and negative eigenvalues of system matrices with the same sign pattern. A sufficient combinatorial condition that ensures the strong structural controllability of signed networks is then proposed. Moreover, an upper bound on the maximum multiplicity of positive and negative eigenvalues associated with a signed graph is provided. © 2019 IEEE  

BIBO stability of linear time-invariant (LTI) distributed order dynamic systems with non-negative weight functions is investigated in this paper by using Lagrange inversion theorem. New sufficient conditions of stability/instability are presented for these systems accordingly. These algebraically simple conditions are relatively tight and their conservatism is adjustable. © 2018 Chinese Automatic Control Society and John Wiley & Sons Australia, Ltd