Search results for " Network"
showing 10 items of 6428 documents
Descriptional and Computational Complexity of the Circuit Representation of Finite Automata
2018
In this paper we continue to investigate the complexity of the circuit representation of DFA—BC-complexity. We compare it with nondeterministic state complexity, obtain upper and lower bounds which differ only by a factor of 4 for a Binary input alphabet. Also we prove that many simple operations (determining if a state is reachable or if an automaton is minimal) are PSPACE-complete for DFA given in circuit representation.
The computational power of continuous time neural networks
1997
We investigate the computational power of continuous-time neural networks with Hopfield-type units. We prove that polynomial-size networks with saturated-linear response functions are at least as powerful as polynomially space-bounded Turing machines.
Some Afterthoughts on Hopfield Networks
1999
In the present paper we investigate four relatively independent issues, which complete our knowledge regarding the computational aspects of popular Hopfield nets. In Section 2 of the paper, the computational equivalence of convergent asymmetric and Hopfield nets is shown with respect to network size. In Section 3, the convergence time of Hopfield nets is analyzed in terms of bit representations. In Section 4, a polynomial time approximate algorithm for the minimum energy problem is shown. In Section 5, the Turing universality of analog Hopfield nets is studied. peerReviewed
Automata and forbidden words
1998
Abstract Let L ( M ) be the (factorial) language avoiding a given anti-factorial language M . We design an automaton accepting L ( M ) and built from the language M . The construction is effective if M is finite. If M is the set of minimal forbidden words of a single word ν, the automaton turns out to be the factor automaton of ν (the minimal automaton accepting the set of factors of ν). We also give an algorithm that builds the trie of M from the factor automaton of a single word. It yields a nontrivial upper bound on the number of minimal forbidden words of a word.
Heterogeneous network games: Conflicting preferences
2013
Proceeding at: 2nd Annual UECE Lisbon Meeting: Game Theory and Applications, took place 2010, November, 4-6, in Lisbon (Portugal). The event Web site http://pascal.iseg.utl.pt/~uece/lisbonmeetings2010/ In many economic situations, a player pursues coordination or anti-coordination with her neighbors on a network, but she also has intrinsic preferences among the available options. We here introduce a model which allows to analyze this issue by means of a simple framework in which players endowed with an idiosyncratic identity interact on a social network through strategic complements or substitutes. We classify the possible types of Nash equilibria under complete information, finding two thr…
Comparative study of modelling the thermal efficiency of a novel straight through evacuated tube collector with MLR, SVR, BP and RBF methods
2021
Abstract Data-based methods are useful for accurate modelling of solar thermal systems. In this work, several artificial neural network (ANN) techniques are proposed to predict the thermal performance of an all-glass straight through evacuated tube solar collector. These are compared to support vector regression analysis. Extensive experimental data sets were collected for training the ANN models. Solar radiation intensity, ambient temperature, wind speed, mass flow rate and collector inlet temperature were selected as the input layer to predict the thermal efficiency of the solar collector. The prediction precision of the ANN models was compared to the multiple linear regression and suppor…
Competition of Direct and Indirect Sources of Thermal Entanglement in a spin star network
2017
A spin star system consisting of three peripheral two-state systems and a central one is considered, with the peripheral spins assumed to interact with each other, as well as with the central one. It is shown that such two couplings, each one being a thermal entanglement source, can significantly compete in the formation of quantum correlations in the thermal state, to the point that they can destroy any thermal entanglement of the peripheral spins.
ChemInform Abstract: Relaxation Phenomena of a Triplet Spin Probe in Glassy and Crystalline o-Terphenyl.
2010
The authors used quinoxaline in its photoexcited triplet state as a spin probe in order to measure the spin-lattice relaxation rate in o-terphenyl glass as a function of temperature. They found a power law with an exponent close to 2. Since o-terphenyl can easily be crystallized, they investigated the crystal, too. Below 3.5 K the spin is highly polarized, contrary to the behavior in the glass, where it reaches thermal equilibrium down to the lowest temperatures of their experiment (1.4 K). Around 3.5 K the polarization in the crystal vanishes. Above it appears with opposite sign due to thermal equilibration.
Serine- and Threonine/Valine-Dependent Activation of PDK and Tor Orthologs Converge on Sch9 to Promote Aging
2014
Dietary restriction extends longevity in organisms ranging from bacteria to mice and protects primates from a variety of diseases, but the contribution of each dietary component to aging is poorly understood. Here we demonstrate that glucose and specific amino acids promote stress sensitization and aging through the differential activation of the Ras/cAMP/PKA, PKH1/2 and Tor/S6K pathways. Whereas glucose sensitized cells through a Ras-dependent mechanism, threonine and valine promoted cellular sensitization and aging primarily by activating the Tor/S6K pathway and serine promoted sensitization via PDK1 orthologs Pkh1/2. Serine, threonine and valine activated a signaling network in which Sch…
Computational evidence that frequency trajectory theory does not oppose but emerges from age-of-acquisition theory.
2012
International audience; According to the age-of-acquisition hypothesis, words acquired early in life are processed faster and more accurately than words acquired later. Connectionist models have begun to explore the influence of the age/order of acquisition of items (and also their frequency of encounter). This study attempts to reconcile two different methodological and theoretical approaches (proposed by Lambon Ralph & Ehsan, 2006 and Zevin & Seidenberg, 2002) to age-limited learning effects. The current simulations extend the findings reported by Zevin and Seidenberg (2002) that have shown that frequency trajectories (FTs) have limited and specific effects on word-reading tasks. Using th…