Search Results - "Switching theory, application of Boolean algebra"

Asymptotic Bounds of the Shannon Function for a Depth Model of Functional-Element Networks with Capacity Parameters for Element Outputs: Asymptotic bounds of the Shannon function for a depth model of functional-element networks with capacity parameters for element outputs

Authors: B. R. Danilov S. A. Lozhkin

Source: Computational Mathematics and Modeling. 30:129-136

Subject Terms: delay, depth, Switching theory, application of Boolean algebra, Boolean functions, 0103 physical sciences, functional-element networks, multiplexor function, 0101 mathematics, 01 natural sciences

File Description: application/xml

Access URL: https://istina.msu.ru/publications/article/193941730/
https://link.springer.com/article/10.1007/s10598-019-09441-2

On the number of driver nodes for controlling a Boolean network when the targets are restricted to attractors

Authors: Tatsuya Akutsu Wai-Ki Ching Peiying Ruan et al.

Source: Journal of Theoretical Biology. 463:1-11

Subject Terms: Controllability, 0301 basic medicine, 0303 health sciences, coupon collector's problem, Systems Biology, Systems biology, networks, Models, Theoretical, controllability, Models, Biological, Boolean networks, driver nodes, 03 medical and health sciences, Switching theory, application of Boolean algebra, Boolean functions, Algorithms

File Description: application/xml

Access URL: https://www.biorxiv.org/content/biorxiv/early/2018/09/02/395442.full.pdf
https://pubmed.ncbi.nlm.nih.gov/30543810
https://zbmath.org/7013667
https://doi.org/10.1101/395442
https://doi.org/10.1016/j.jtbi.2018.12.012
https://www.sciencedirect.com/science/article/pii/S0022519318306027
https://www.ncbi.nlm.nih.gov/pubmed/30543810

High-Accuracy Bounds of the Shannon Function for Formula Complexity in Bases with Direct and Iterative Variables: High-accuracy bounds of the Shannon function for formula complexity in bases with direct and iterative variables

Authors: V. A. Konovodov S. A. Lozhkin

Source: Computational Mathematics and Modeling. 30:26-35

Subject Terms: Shannon function, Switching theory, application of Boolean algebra, Boolean functions, 0103 physical sciences, 0101 mathematics, formula, 01 natural sciences, iterative variable

File Description: application/xml

Access URL: https://link.springer.com/article/10.1007/s10598-019-09431-4

Set stability and synchronization of logical networks with probabilistic time delays

Authors: Xueying Ding Haitao Li Shuling Wang

Source: Journal of the Franklin Institute. 355:7735-7748

Subject Terms: Controllability, 0209 industrial biotechnology, set stability, Switching theory, application of Boolean algebra, Boolean functions, Deterministic network models in operations research, 0202 electrical engineering, electronic engineering, information engineering, Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems), Stabilization of systems by feedback, 02 engineering and technology, Stochastic stability in control theory, synchronization, probabilistic time delay, Boolean networks

File Description: application/xml

Access URL: https://zbmath.org/6957929
https://doi.org/10.1016/j.jfranklin.2018.08.009
https://www.sciencedirect.com/science/article/pii/S0016003218305428
https://dblp.uni-trier.de/db/journals/jfi/jfi355.html#DingLW18

Nonlinear FCS-MPC strategy of NPC/H-5 L inverter based on satisfactory optimization algorithm

Authors: Jianguo Jiang Wei Wu Guifeng Wang

Source: Chaos, Solitons & Fractals. 89:353-362

Subject Terms: FCS-MPC, common-mode voltage suppression, Switching theory, application of Boolean algebra, Boolean functions, Analytic circuit theory, 0202 electrical engineering, electronic engineering, information engineering, nonlinear, 02 engineering and technology, satisfactory optimization, NPC/H

File Description: application/xml

Access URL: https://www.sciencedirect.com/science/article/pii/S0960077915004397
http://ui.adsabs.harvard.edu/abs/2016CSF....89..353W/abstract

On the Depth of k-Valued Logic Functions Over Arbitrary Bases: On the depth of \(k\)-valued logic functions over arbitrary bases

Authors: A. V. Kochergin

Source: Journal of Mathematical Sciences. 233:100-102

Subject Terms: Switching theory, application of Boolean algebra, Boolean functions, 0102 computer and information sciences, 0101 mathematics, 01 natural sciences

File Description: application/xml

Access URL: https://link.springer.com/article/10.1007%2Fs10958-018-3927-5

Controllability of probabilistic Boolean control networks based on transition probability matrices

Authors: Yang Liu Jianquan Lu Hongwei Chen et al.

Source: Automatica. 52:340-345

Subject Terms: Controllability, 0209 industrial biotechnology, transition probability matrix, Attainable sets, reachability, probabilistic Boolean control network, Switching theory, application of Boolean algebra, Boolean functions, semi-tensor product, 0202 electrical engineering, electronic engineering, information engineering, Stochastic systems in control theory (general), 02 engineering and technology, controllability

File Description: application/xml

Access URL: https://zbmath.org/6432199
https://doi.org/10.1016/j.automatica.2014.12.018
https://www.sciencedirect.com/science/article/pii/S0005109814005974
https://dl.acm.org/doi/10.1016/j.automatica.2014.12.018
https://dblp.uni-trier.de/db/journals/automatica/automatica52.html#LiuCLW15
https://dialnet.unirioja.es/servlet/articulo?codigo=4979980

Controllability Analysis and Control Design for Switched Boolean Networks with State and Input Constraints: Controllability analysis and control design for switched Boolean networks with state and input constraints

Authors: Haitao Li Yuzhen Wang

Source: SIAM Journal on Control and Optimization. 53:2955-2979

Subject Terms: Controllability, optimal control, 0209 industrial biotechnology, Discrete-time control/observation systems, state and input constraints, Switching theory, application of Boolean algebra, Boolean functions, semi-tensor product of matrices, switched Boolean network, 02 engineering and technology, Feedback control, 16. Peace & justice, controllability, stabilization

File Description: application/xml

Access URL: https://zbmath.org/6489597
https://doi.org/10.1137/120902331
https://dblp.uni-trier.de/db/journals/siamco/siamco53.html#LiW15
https://doi.org/10.1137%2f120902331
https://epubs.siam.org/doi/10.1137/120902331

Bi-Decomposition of Function Sets in Multiple-Valued Logic for Circuit Design and Data Mining: Bi-decomposition of function sets in multiple-valued logic for circuit design and data mining

Authors: Christian Lang Bernd Steinbach

Source: Artificial Intelligence in Logic Design ISBN: 9789048165834

Subject Terms: 0209 industrial biotechnology, machine learning, Many-valued logic, differential calculus, Switching theory, application of Boolean algebra, Boolean functions, Learning and adaptive systems in artificial intelligence, bi-decomposition, multiple-valued logic, 0202 electrical engineering, electronic engineering, information engineering, data mining, 02 engineering and technology, logic synthesis, multi-level circuit design

File Description: application/xml

Access URL: https://zbmath.org/2129708
https://doi.org/10.1023/b:aire.0000006608.31990.cd
https://dblp.uni-trier.de/db/journals/air/air20.html#LangS03
https://link.springer.com/article/10.1023/B:AIRE.0000006608.31990.cd
https://link.springer.com/10.1023/B:AIRE.0000006608.31990.cd
https://rd.springer.com/chapter/10.1007/978-1-4020-2075-9_4
https://link.springer.com/chapter/10.1007/978-1-4020-2075-9_4

Exploiting Functional Properties of Boolean Functions for Optimal Multi-Level Design by Bi-Decomposition: Exploiting functional properties of Boolean functions for optimal multi-level design by bi-decomposition

Authors: Bernd Steinbach Christian Lang

Source: Artificial Intelligence in Logic Design ISBN: 9789048165834

Subject Terms: Boolean differential calculus, delay, derivative operation, Learning and adaptive systems in artificial intelligence, bi-decomposition, 0211 other engineering and technologies, area, 02 engineering and technology, multi-level circuit, Switching theory, application of Boolean algebra, Boolean functions, Boolean function, 0202 electrical engineering, electronic engineering, information engineering, lattice

File Description: application/xml

Access URL: https://zbmath.org/2129710
https://doi.org/10.1023/b:aire.0000006606.01771.8f
https://dblp.uni-trier.de/db/journals/air/air20.html#SteinbachL03
https://rd.springer.com/chapter/10.1007/978-1-4020-2075-9_6
https://doi.org/10.1023/B:AIRE.0000006606.01771.8f
https://link.springer.com/article/10.1023%2FB%3AAIRE.0000006606.01771.8f

Complexity of realization of Boolean functions from some classes related to finite grammars by formulas of alternation depth 3

Authors: S. A. Lozhkin V. A. Konovodov

Source: Moscow University Mathematics Bulletin. 69:100-105

Subject Terms: 2. Zero hunger, Switching theory, application of Boolean algebra, Boolean functions, 0103 physical sciences, 0101 mathematics, 16. Peace & justice, Information theory (general), 01 natural sciences

File Description: application/xml

Access URL: https://link.springer.com/article/10.3103/S0027132214030036

An Efficient Method to Synthesize Reversible Logic by Using Positive Davio Decision Diagrams: An efficient method to synthesize reversible logic by using positive Davio decision diagrams

Authors: Huawei Huang Yu Pang Wei Wu et al.

Source: Circuits, Systems, and Signal Processing. 33:3107-3121

Subject Terms: positive Davio decision diagram, quantum computation, Quantum computation, Quantum information, communication, networks (quantum-theoretic aspects), Switching theory, application of Boolean algebra, Boolean functions, 0202 electrical engineering, electronic engineering, information engineering, quantum cost, 02 engineering and technology, reversible logic

File Description: application/xml

Access URL: https://zbmath.org/6608856
https://doi.org/10.1007/s00034-014-9789-2
https://link.springer.com/article/10.1007/s00034-014-9789-2
https://dblp.uni-trier.de/db/journals/cssp/cssp33.html#PangYLHW14
https://link.springer.com/content/pdf/10.1007%2Fs00034-014-9789-2.pdf
https://rd.springer.com/article/10.1007/s00034-014-9789-2

Further constructions of resilient Boolean functions with very high nonlinearity

Authors: Enes Pasalic Subhamoy Maitra

Source: Sequences and their Applications ISBN: 9781852335298

Subject Terms: Switching theory, application of Boolean algebra, Boolean functions, Cryptography, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

File Description: application/xml

Access URL: https://dl.acm.org/doi/10.1109/TIT.2002.1013128
https://rd.springer.com/chapter/10.1007/978-1-4471-0673-9_20
https://portal.research.lu.se/en/publications/further-constructions-of-resilient-boolean-functions-with-very-hi
https://link.springer.com/content/pdf/10.1007%2F978-1-4471-0673-9_20.pdf
http://ieeexplore.ieee.org/document/1013128/
http://lup.lub.lu.se/record/334543

New Results on Monotone Dualization and Generating Hypergraph Transversals: New results on monotone dualization and generating hypergraph transversals

Authors: Eiter, T Gottlob, G Makino, K

Source: SIAM Journal on Computing. 32:514-537

Subject Terms: FOS: Computer and information sciences, combinatorial enumeration, Analysis of algorithms and problem complexity, Applications of graph theory, 0211 other engineering and technologies, G.2.1, G.2.2, 0102 computer and information sciences, 02 engineering and technology, dualization, Computational Complexity (cs.CC), Hypergraphs, 01 natural sciences, Graph algorithms (graph-theoretic aspects), Computer Science - Data Structures and Algorithms, treewidth, Data Structures and Algorithms (cs.DS), Boolean functions, hypergraph acyclicity, Database theory, output-polynomial algorithms, F.2.2, F.1.3, transversal computation, Computer Science - Computational Complexity, hypergraphs, Knowledge representation, Graph theory (including graph drawing) in computer science, Switching theory, application of Boolean algebra, limited nondeterminism

File Description: application/xml

Access URL: http://arxiv.org/abs/cs/0204009
https://arxiv.org/pdf/cs/0204009
https://ui.adsabs.harvard.edu/abs/2002cs........4009E/abstract
http://portal.acm.org/citation.cfm?doid=509907.509912
http://www.kr.tuwien.ac.at/staff/eiter/et-archive/dual-stoc02.pdf
https://dblp.uni-trier.de/db/journals/corr/corr0204.html#cs-DS-0204009
https://www.cs.ox.ac.uk/publications/publication176-abstract.html
https://ora.ox.ac.uk/objects/uuid:08358504-8295-4044-add3-3e389c6cfa59
https://ora.ox.ac.uk/objects/uuid:0f8cffd0-f051-4deb-91a7-84054df48cc2
https://ora.ox.ac.uk/objects/uuid:6ad59704-11d2-497d-8fd1-3906bb0b7519
https://doi.org/10.1145/509907.509912

Computing Boolean Functions from Multiple Faulty Copies of Input Bits: Computing Boolean functions from multiple faulty copies of input bits

Authors: Mario Szegedy Xiaomin Chen

Source: Lecture Notes in Computer Science ISBN: 9783540434009

Subject Terms: Sensitivity, Linear programming, Switching theory, application of Boolean algebra, Boolean functions, 0102 computer and information sciences, 0101 mathematics, 01 natural sciences, Randomized functions, Theoretical Computer Science, Computer Science(all)

File Description: application/xml

Access URL: https://link.springer.com/10.1007/3-540-45995-2_47
https://dblp.uni-trier.de/db/conf/latin/latin2002.html#SzegedyC02
https://link.springer.com/chapter/10.1007/3-540-45995-2_47

Efficient time slot assignment algorithms for TDM hierarchical and nonhierarchical switching systems

Authors: Yeung, KL

Source: IEEE Transactions on Communications. 49:351-359

Subject Terms: 0508 media and communications, Scheduling algorithm, Switching theory, application of Boolean algebra, Boolean functions, time slot assignment, 05 social sciences, heuristic, 0202 electrical engineering, electronic engineering, information engineering, scheduling algorithm, Heuristic, 02 engineering and technology, Time slot assignment, TDM switching system

File Description: application/xml; 25600 bytes; 182724 bytes; application/msword; application/pdf

Access URL: http://hub.hku.hk/bitstream/10722/42885/1/61698.pdf
https://ieeexplore.ieee.org/document/905898/
https://doi.org/10.1109/26.905898
https://core.ac.uk/display/37882193
https://dblp.uni-trier.de/db/journals/tcom/tcom49.html#Yeung01
http://ieeexplore.ieee.org/document/905898/
https://ieeexplore.ieee.org/document/587671/
http://hub.hku.hk/handle/10722/158187
http://hub.hku.hk/bitstream/10722/42885/1/61698.pdf
http://hdl.handle.net/10722/158187
http://hdl.handle.net/10722/42885

Fast, Efficient Equipment Placement Heuristics for Broadband Switched or Internet Router Networks: Fast, efficient equipment placement heuristics for broadband switched or internet router net\-works

Authors: J.W. Gannett

Source: Heuristic Approaches for Telecommunications Network Management, Planning and Expansion ISBN: 9781441949707

Subject Terms: Network design and communication in computer systems, network design, 0211 other engineering and technologies, 02 engineering and technology, telecommunication networks, router network, Applications of mathematical programming, Communication networks in operations research, Switching theory, application of Boolean algebra, Boolean functions, Deterministic network models in operations research, 0202 electrical engineering, electronic engineering, information engineering, equipment placement - switched network, internet, optimization

File Description: application/xml

Access URL: https://zbmath.org/2180957
https://doi.org/10.1023/a:1009661626037
https://rd.springer.com/chapter/10.1007/978-1-4757-5392-9_3
https://doi.org/10.1023/A:1009661626037
https://dblp.uni-trier.de/db/journals/heuristics/heuristics6.html#Gannett00
https://link.springer.com/article/10.1023/A:1009661626037
https://www.argreenhouse.com/papers/jgannett/20000400_equip_placement.pdf
https://link.springer.com/content/pdf/10.1023/A:1009661626037.pdf

Restricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication: Restricted nondeterministic read-once branching programs and an exponential lower bound for integer multiplication

Authors: Beate Bollig

Source: Lecture Notes in Computer Science ISBN: 9783540679011

Subject Terms: Switching theory, application of Boolean algebra, Boolean functions, 0202 electrical engineering, electronic engineering, information engineering, Complexity classes (hierarchies, relations among complexity classes, etc.), Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.), 0102 computer and information sciences, 02 engineering and technology, Models of computation (Turing machines, etc.), branching programs, 01 natural sciences

File Description: application/xml

Access URL: http://eccc.hpi-web.de/report/2000/048/download/
https://dblp.uni-trier.de/db/conf/mfcs/mfcs2000.html#Bollig00
https://link.springer.com/chapter/10.1007%2F3-540-44612-5_18
https://link.springer.com/10.1007/3-540-44612-5_18
http://eccc.hpi-web.de/report/2000/048/download/
https://core.ac.uk/display/102553684
https://rd.springer.com/chapter/10.1007/3-540-44612-5_18
https://www.cambridge.org/core/journals/rairo-theoretical-informatics-and-applications/article/restricted-nondeterministic-readonce-branching-programs-and-an-exponential-lower-bound-for-integer-multiplication/6314383C4295322F6A8CC9BC92110702
https://www.rairo-ita.org/articles/ita/abs/2001/02/ita0012/ita0012.html
https://dblp.uni-trier.de/db/journals/ita/ita35.html#Bollig01
http://www.rairo-ita.org/articles/ita/abs/2001/02/ita0012/ita0012.html

Virtual Path Design in Service-Specific ATM Networks: Virtual path design in service-specific ATM networks

Authors: Joel Sokol Iraj Saniee

Source: Heuristic Approaches for Telecommunications Network Management, Planning and Expansion ISBN: 9781441949707

Subject Terms: add drop heuristic for combinatorial optimization problems, Applications of mathematical programming, Combinatorial optimization, circuit-switching, Switching theory, application of Boolean algebra, Boolean functions, Deterministic network models in operations research, 0211 other engineering and technologies, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology, ATM network management, virtual paths, multicommodity network optimization, Approximation methods and heuristics in mathematical programming

File Description: application/xml

Access URL: https://zbmath.org/2180958
https://doi.org/10.1023/a:1009613710108
https://dblp.uni-trier.de/db/journals/heuristics/heuristics6.html#SanieeS00
https://link.springer.com/10.1007/978-1-4757-5392-9_4
https://rd.springer.com/chapter/10.1007/978-1-4757-5392-9_4
https://link.springer.com/article/10.1023/A%3A1009613710108

Minimum energy control and optimal-satisfactory control of Boolean control network

Authors: Xiwen Lu Fangfei Li

Source: Physics Letters A. 377:3112-3118

Subject Terms: 0209 industrial biotechnology, minimum energy control, Switching theory, application of Boolean algebra, Boolean functions, semi-tensor product, Boolean programming, 02 engineering and technology, Boolean control network, optimal-satisfactory control, Computational methods in systems theory, Applications of optimal control and differential games

File Description: application/xml

Access URL: https://zbmath.org/6380625
https://doi.org/10.1016/j.physleta.2013.10.002
https://ui.adsabs.harvard.edu/abs/2013PhLA..377.3112L/abstract
https://www.sciencedirect.com/science/article/pii/S0375960113009201