No one doubts that the by-laws fulfill important roles in commercial companies. Due to the unitar... more No one doubts that the by-laws fulfill important roles in commercial companies. Due to the unitarian concept (vision) of company contract and by-laws, these roles have been assigned historically to the company contract, for which “by-laws” seem to be merely the commercial denomination. However, under French Law, by-laws differ more and more from company contract following in some way a movement already known in Comparative Law. At present this dissociation between contract and by-laws is only impulsed by the legislative action which recognizes an increased autonomy to the by-laws as compared to the company contract, as of the Act n°66-537 of July 24, 1966, enhanced by the Act n����85-697 of July 11, 1985, introducing individual enterprise in the French company Law. According to this Act, by-laws are the only basic requirements to create this structure, without the need to use the company contract even in a case where the one-owner enterprise would be transformed in a multi-owner com...
International Conference on Machine Learning and Applications, 2010
A simulated annealing framework is presented for learning gene regulatory networks with predefine... more A simulated annealing framework is presented for learning gene regulatory networks with predefined attractors, under the threshold Boolean network model updated sequentially. The proposed method is used to study the robustness of the networks, defined as the number of different updating sequences they can have without loosing the attractor. The results suggests a power law between the frequency of the networks and the number of the updating sequences, also, a decrease of the networks' robustness as the cycle length grows. In general, the proposed simulated annealing framework is effective for reverse engineering problems.
Artificial Life 14: Proceedings of the Fourteenth International Conference on the Synthesis and Simulation of Living Systems, 2014
ABSTRACT In (Veliz-Cuba and Stigler, 2011) the authors proposed a Boolean model for the lac opero... more ABSTRACT In (Veliz-Cuba and Stigler, 2011) the authors proposed a Boolean model for the lac operon in Escherichia coli that is capable of predicting the operon being ON, OFF and bistable when the update schedule is the parallel one. We complement this work by using theoretical and algorithmic tools that allow us to know which are the configurations that converge to a fixed point or limit cycle (set namely attractor basin) for each deterministic update schedule. We show that, when bistability appears, about 70% of the dynamics have only the steady states ON and OFF. This latest having an attractor basin of an average size about 8 times bigger than that of ON. In the other 30%, the proportion is balanced between ON/OFF basins but the basins of limit cycles sum up, in average, about 5 times more than that of ON and OFF respectively. The techniques presented in this work are general and can be used to analyze other Boolean models.
In this paper we study the dynamical behavior of neural networks such that their interconnections... more In this paper we study the dynamical behavior of neural networks such that their interconnections are the incidence matrix of an undirected finite graph G=(V,E) (i.e., the weights belong to {0,1}). The network may be updated synchronously (every node is updated at the same time), sequentially (nodes are updated one by one in a prescribed order) or in a block-sequential way (a mixture of the previous schemes). We characterize completely the attractors (fixed points or cycles). More precisely, we establish the convergence to fixed points related to a parameter α(G), taking into account the number of loops, edges, vertices as well as the minimum number of edges to remove from E in order to obtain a maximum bipartite graph. Roughly, α(G('))<0 for any G(') subgraph of G implies the convergence to fixed points. Otherwise, cycles appear. Actually, for very simple networks (majority functions updated in a block-sequential scheme such that each block is of minimum cardinality two) we exhibit cycles with non-polynomial periods.
No one doubts that the by-laws fulfill important roles in commercial companies. Due to the unitar... more No one doubts that the by-laws fulfill important roles in commercial companies. Due to the unitarian concept (vision) of company contract and by-laws, these roles have been assigned historically to the company contract, for which “by-laws” seem to be merely the commercial denomination. However, under French Law, by-laws differ more and more from company contract following in some way a movement already known in Comparative Law. At present this dissociation between contract and by-laws is only impulsed by the legislative action which recognizes an increased autonomy to the by-laws as compared to the company contract, as of the Act n°66-537 of July 24, 1966, enhanced by the Act n����85-697 of July 11, 1985, introducing individual enterprise in the French company Law. According to this Act, by-laws are the only basic requirements to create this structure, without the need to use the company contract even in a case where the one-owner enterprise would be transformed in a multi-owner com...
International Conference on Machine Learning and Applications, 2010
A simulated annealing framework is presented for learning gene regulatory networks with predefine... more A simulated annealing framework is presented for learning gene regulatory networks with predefined attractors, under the threshold Boolean network model updated sequentially. The proposed method is used to study the robustness of the networks, defined as the number of different updating sequences they can have without loosing the attractor. The results suggests a power law between the frequency of the networks and the number of the updating sequences, also, a decrease of the networks' robustness as the cycle length grows. In general, the proposed simulated annealing framework is effective for reverse engineering problems.
Artificial Life 14: Proceedings of the Fourteenth International Conference on the Synthesis and Simulation of Living Systems, 2014
ABSTRACT In (Veliz-Cuba and Stigler, 2011) the authors proposed a Boolean model for the lac opero... more ABSTRACT In (Veliz-Cuba and Stigler, 2011) the authors proposed a Boolean model for the lac operon in Escherichia coli that is capable of predicting the operon being ON, OFF and bistable when the update schedule is the parallel one. We complement this work by using theoretical and algorithmic tools that allow us to know which are the configurations that converge to a fixed point or limit cycle (set namely attractor basin) for each deterministic update schedule. We show that, when bistability appears, about 70% of the dynamics have only the steady states ON and OFF. This latest having an attractor basin of an average size about 8 times bigger than that of ON. In the other 30%, the proportion is balanced between ON/OFF basins but the basins of limit cycles sum up, in average, about 5 times more than that of ON and OFF respectively. The techniques presented in this work are general and can be used to analyze other Boolean models.
In this paper we study the dynamical behavior of neural networks such that their interconnections... more In this paper we study the dynamical behavior of neural networks such that their interconnections are the incidence matrix of an undirected finite graph G=(V,E) (i.e., the weights belong to {0,1}). The network may be updated synchronously (every node is updated at the same time), sequentially (nodes are updated one by one in a prescribed order) or in a block-sequential way (a mixture of the previous schemes). We characterize completely the attractors (fixed points or cycles). More precisely, we establish the convergence to fixed points related to a parameter α(G), taking into account the number of loops, edges, vertices as well as the minimum number of edges to remove from E in order to obtain a maximum bipartite graph. Roughly, α(G('))<0 for any G(') subgraph of G implies the convergence to fixed points. Otherwise, cycles appear. Actually, for very simple networks (majority functions updated in a block-sequential scheme such that each block is of minimum cardinality two) we exhibit cycles with non-polynomial periods.
Uploads
Papers by Gonzalo RUZ