DSpace Collection:
http://hdl.handle.net/10174/969
Fri, 03 Jul 2020 22:32:20 GMT2020-07-03T22:32:20ZFull command of a network by a new node: some results and examples
http://hdl.handle.net/10174/27632
Title: Full command of a network by a new node: some results and examples
Authors: Gracio, Clara; Fernandes, Sara; Lopes, Luis Mário
Editors: Ding-Zhu, Du; T. Thai, My
Abstract: We consider that a network of chaotic identical dynamical systems is connected to a
new node. Depending on some properties of the network and on the way that connection
is made, the new node may control the network. We consider a full-command
connection and analyze the possibility of the network being full-commandable by the
new node. For full-commandable networks, we define the full-command-window, a
set that includes some of the values that the coupling strength of the new node may
assume. We present several results and examples that enlight us how a network can
become more vulnerable or resistant to full-command.Thu, 26 Dec 2019 00:00:00 GMThttp://hdl.handle.net/10174/276322019-12-26T00:00:00ZAnalysis of the Behavior of a Chaotic Dynamic System under Different Types of Couplings and Several free Dynamics
http://hdl.handle.net/10174/27630
Title: Analysis of the Behavior of a Chaotic Dynamic System under Different Types of Couplings and Several free Dynamics
Authors: Gracio, Clara; Fernandes, Sara; Lopes, Luís; Thapa, Gyan
Editors: Shakya, Subarna; Bhattarai, Binod
Abstract: n this paper, we analyze how the behavior of a chaotic dynamical system changes when we couple it with another. We focus our attention on two aspects: the possibility of chaos suppression and the possibility of synchronization. We consider a Symmetric Linear Coupling and several free dynamics. For each of them we study the evolution of the coupling behavior with the coupling strength constant, defining windows of behavior. We extend the analysis to some other couplings. This is a survey paper.Tue, 01 Jan 2019 00:00:00 GMThttp://hdl.handle.net/10174/276302019-01-01T00:00:00ZA problem of integer partitions and numerical semigroups
http://hdl.handle.net/10174/27628
Title: A problem of integer partitions and numerical semigroups
Authors: Rosales, J. C.; Branco, M. B.
Editors: Stuart White, University of Oxford, UK
Abstract: Let C be a set of positive integers. In this paper we obtain an algorithm for computing all subsets A of positive integers which are
minimals with the condition that if x_1 +....+ x_n is a partition of an
element in C, then at least a summand of this partition belongs to A. We use techniques of numerical semigroups to solve this problem,
because it is equivalent to give an algorithm that allows us compute all the numerical semigroups which are maximals with the condition that have empty intersection with the set C.Wed, 31 Jul 2019 23:00:00 GMThttp://hdl.handle.net/10174/276282019-07-31T23:00:00ZSome results on the Frobenius coin problem
http://hdl.handle.net/10174/27627
Title: Some results on the Frobenius coin problem
Authors: Rosales, J. C.; Branco, M. B.
Editors: Tanuja Srivastava Department of Mathematics, Indian Institute of Technology
Abstract: The Frobenius coin problem consists in finding a formula, in terms of the elements in a minimal system of generators of a numerical semigroup, for computing the Frobenius number and the genus. In this paper we will present some classes of numerical semigroups for which this problem is solved. We give formulas for the Frobenius number, type and the genus for MED-semigroups, Mersenne numerical semigroups, Thabit numerical semigroups, Repunit numerical semigroups and numerical semigroups with multiplicity four.Thu, 01 Nov 2018 00:00:00 GMThttp://hdl.handle.net/10174/276272018-11-01T00:00:00Z