Relevant bibliographies by topics / Kautz / Journal articles
To see the other types of publications on this topic, follow the link: Kautz.

Journal articles on the topic 'Kautz'

Author: Grafiati
Published: 4 June 2021
Last updated: 8 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Kautz.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Wahlberg, Bo. "Laguerre and Kautz Models." IFAC Proceedings Volumes 27, no. 8 (July 1994): 965–76. http://dx.doi.org/10.1016/s1474-6670(17)47834-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Bermond, J. C., N. Homobono, and C. Peyrat. "Connectivity of kautz networks." Discrete Mathematics 114, no. 1-3 (April 1993): 51–62. http://dx.doi.org/10.1016/0012-365x(93)90355-w.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Böhmová, Katerina, Cristina Dalfó, and Clemens Huemer. "The diameter of cyclic Kautz digraphs." Filomat 31, no. 20 (2017): 6551–60. http://dx.doi.org/10.2298/fil1720551b.

Full text
Abstract:
We present a new kind of digraphs, called cyclic Kautz digraphs CK(d,l), which are subdigraphs of the well-known Kautz digraphs K(d,l). The latter have the smallest diameter among all digraphs with their number of vertices and degree. Cyclic Kautz digraphs CK(d,l) have vertices labeled by all possible sequences a1...al of length l, such that each character ai is chosen from an alphabet containing d + 1 distinct symbols, where the consecutive characters in the sequence are different (as in Kautz digraphs), and now also requiring that a1 ? al. Their arcs are between vertices a1a2... al and a2... alal+1, with a1 ? al and a2 ? al+1. We give the diameter of CK(d,l) for all the values of d and l, and also its number of vertices and arcs.
APA, Harvard, Vancouver, ISO, and other styles
4

Wahlberg, B. "System identification using Kautz models." IEEE Transactions on Automatic Control 39, no. 6 (June 1994): 1276–82. http://dx.doi.org/10.1109/9.293196.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Morvan, R., N. Tanguy, P. Vilbé, and L. C. Calvez. "Pertinent parameters for Kautz approximation." Electronics Letters 36, no. 8 (2000): 769. http://dx.doi.org/10.1049/el:20000581.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Xu, Jun-Ming, Ye-Zhou Wu, Jia Huang, and Chao Yang. "Feedback numbers of Kautz digraphs." Discrete Mathematics 307, no. 13 (June 2007): 1589–99. http://dx.doi.org/10.1016/j.disc.2006.09.010.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Ettefagh, Massoud Hemmasian, José De Doná, Mahyar Naraghi, and Farzad Towhidkhah. "Control of Constrained Linear-Time Varying Systems via Kautz Parametrization of Model Predictive Control Scheme." Emerging Science Journal 1, no. 2 (September 19, 2017): 65. http://dx.doi.org/10.28991/esj-2017-01117.

Full text
Abstract:
Kautz parametrization of the Model Predictive Control (MPC) method has shown its ability to reduce the number of decision variables in Linear Time Invariant (LTI) systems. This paper devotes to extend Kautz network to be used in MPC Algorithm for linear time-varying systems. It is shown that Kautz network enables us to maintain a satisfactory performance while the number of decision variables are reduced considerably. Stability of the algorithm is studied under the framework of the optimal solution. The proposed method is validated by an illustrative example. In this regard, the performance of unconstrained systems as well as constrained ones is compared.
APA, Harvard, Vancouver, ISO, and other styles
8

Bahar, Arash, Ali Chaibakhsh, and Sajad Haqdadi. "Identification of MR Damper Based on Normalized Bouc-Wen Model Using Neural Network." Applied Mechanics and Materials 229-231 (November 2012): 2140–44. http://dx.doi.org/10.4028/www.scientific.net/amm.229-231.2140.

Full text
Abstract:
The Magneto-rheological (MR) dampers are favorite mechanical system in dynamic structures. This paper presents an application of Wiener-type nonlinear models for describing the hysteresis behaviors of MR dampers at different operating conditions. In this structure, a linear part consisting discrete-time Kautz filters is cascading by a nonlinear mapping function (feedforward neural network (FFNN)). The pole parameters of Kautz filters were chosen with respect to the poles of best fitted linear model on real system. By defining the parameters of Kautz filter, the nonlinear behaviors of system were identified using neural network model, as the output of filters were considered as the output on NN. In order to assess the performances of the developed models a comparison between the responses of the models and another recent modeling approach was preformed.
APA, Harvard, Vancouver, ISO, and other styles
9

Rolim, José, Pavel Tvrdik, Jan Trdlička, and Imrich Vrto. "Bisecting de Bruijn and Kautz graphs." Discrete Applied Mathematics 85, no. 1 (June 1998): 87–97. http://dx.doi.org/10.1016/s0166-218x(98)00031-6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Böhmová, K., C. Dalfó, and C. Huemer. "The Diameter of Cyclic Kautz Digraphs." Electronic Notes in Discrete Mathematics 49 (November 2015): 323–30. http://dx.doi.org/10.1016/j.endm.2015.06.044.

Full text
APA, Harvard, Vancouver, ISO, and other styles
11

den Brinker, A. C., F. P. A. Benders, and T. A. M. Oliveira e Silva. "Optimality conditions for truncated Kautz series." IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing 43, no. 2 (1996): 117–22. http://dx.doi.org/10.1109/82.486458.

Full text
APA, Harvard, Vancouver, ISO, and other styles
12

Lin, Shangwei, Chanchan Zhou, and Chunfang Li. "Arc fault tolerance of Kautz digraphs." Theoretical Computer Science 687 (July 2017): 1–10. http://dx.doi.org/10.1016/j.tcs.2017.04.011.

Full text
APA, Harvard, Vancouver, ISO, and other styles
13

Bermond, Jean-Claude, Robin W. Dawes, and Fahir �. Ergincan. "De Bruijn and Kautz bus networks." Networks 30, no. 3 (October 1997): 205–18. http://dx.doi.org/10.1002/(sici)1097-0037(199710)30:3<205::aid-net5>3.0.co;2-p.

Full text
APA, Harvard, Vancouver, ISO, and other styles
14

Dong, Yan-xia, Er-fang Shan, and Ling-ye Wu. "Twin domination in generalized Kautz digraphs." Journal of Shanghai University (English Edition) 14, no. 3 (May 29, 2010): 177–81. http://dx.doi.org/10.1007/s11741-010-0626-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
15

DALFÓ, C. "From Subkautz Digraphs to Cyclic Kautz Digraphs." Journal of Interconnection Networks 18, no. 02n03 (June 2018): 1850006. http://dx.doi.org/10.1142/s0219265918500068.

Full text
Abstract:
The Kautz digraphs K(d, ℓ) are a well-known family of dense digraphs, widely studied as a good model for interconnection networks. Closely related to these, the cyclic Kautz digraphs CK(d, ℓ) were recently introduced by Böhmová, Huemer and the author, and some of its distance-related parameters were fixed. In this paper we propose a new approach to the cyclic Kautz digraphs by introducing the family of the subKautz digraphs sK(d, ℓ), from where the cyclic Kautz digraphs can be obtained as line digraphs. This allows us to give exact formulas for the distance between any two vertices of both sK(d, ℓ) and CK(d, ℓ). Moreover, we compute the diameter and the semigirth of both families, also providing efficient routing algorithms to find the shortest path between any pair of vertices. Using these parameters, we also prove that sK(d, ℓ) and CK(d, ℓ) are maximally vertex-connected and super-edge-connected. Whereas K(d, ℓ) are optimal with respect to the diameter, we show that sK(d, ℓ) and CK(d, ℓ) are optimal with respect to the mean distance, whose exact values are given for both families when ℓ = 3. Finally, we provide a lower bound on the girth of CK(d, ℓ) and sK(d, ℓ).
APA, Harvard, Vancouver, ISO, and other styles
16

Lindskog, P., and B. Wahlberg. "Applications of Kautz Models in System Identification." IFAC Proceedings Volumes 26, no. 2 (July 1993): 41–44. http://dx.doi.org/10.1016/s1474-6670(17)48218-8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
17

BOKOR, J., and F. SCHIPP. "Approximate Identification in Laguerre and Kautz Bases." Automatica 34, no. 4 (April 1998): 463–68. http://dx.doi.org/10.1016/s0005-1098(97)00201-x.

Full text
APA, Harvard, Vancouver, ISO, and other styles
18

Harbane, Rabah, and Carles Padró. "Spanners of de Bruijn and Kautz graphs." Information Processing Letters 62, no. 5 (June 1997): 231–36. http://dx.doi.org/10.1016/s0020-0190(97)00075-6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
19

Da Silva, S., M. Dias Júnior, and V. Lopes Junior. "Identification of Mechanical Systems through Kautz Filter." Journal of Vibration and Control 15, no. 6 (February 13, 2009): 849–65. http://dx.doi.org/10.1177/1077546308091458.

Full text
APA, Harvard, Vancouver, ISO, and other styles
20

Chiang, W. K., and R. J. Chen. "Distributed Fault-Tolerant Routing in Kautz Networks." Journal of Parallel and Distributed Computing 20, no. 1 (January 1994): 99–106. http://dx.doi.org/10.1006/jpdc.1994.1010.

Full text
APA, Harvard, Vancouver, ISO, and other styles
21

Du, D. Z., D. F. Hsu, and Y. D. Lyuu. "On the diameter vulnerability of Kautz digraphs." Discrete Mathematics 151, no. 1-3 (May 1996): 81–85. http://dx.doi.org/10.1016/0012-365x(94)00084-v.

Full text
APA, Harvard, Vancouver, ISO, and other styles
22

KUO, JYHMIN. "ON THE TWIN DOMINATION NUMBER IN GENERALIZED DE BRUIJN AND GENERALIZED KAUTZ DIGRAPHS." Discrete Mathematics, Algorithms and Applications 02, no. 02 (June 2010): 199–205. http://dx.doi.org/10.1142/s1793830910000577.

Full text
Abstract:
Let V and A denote the vertex and edge sets of a digraph G. A set T ⊆V is a twin dominating set of G if for every vertex v ∈ V - T, there exist u, w ∈ T (possibly u = w) such that arcs (u, v), (v, w) ∈ A. The twin domination number γ*(G) of G is the cardinality of a minimum twin dominating set of G. In this note, we investigate the twin domination numbers of generalized de Bruijn digraph and generalized Kautz digraph. The bounds of twin domination number of special generalized Kautz digraphs are given.
APA, Harvard, Vancouver, ISO, and other styles
23

Khan, B., J. A. Rossiter, and G. Valencia-Palomo. "Exploiting Kautz functions to improve feasibility in MPC." IFAC Proceedings Volumes 44, no. 1 (January 2011): 6777–82. http://dx.doi.org/10.3182/20110828-6-it-1002.00251.

Full text
APA, Harvard, Vancouver, ISO, and other styles
24

Zhang GuoYin, and Li Heng. "Dynamic Routing Strategies based on Hierarchical Kautz Graph." Journal of Convergence Information Technology 7, no. 11 (June 30, 2012): 1–10. http://dx.doi.org/10.4156/jcit.vol7.issue11.1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
25

Tvrdik, Pavel, Rabah Harbane, and Marie-Claude Heydemann. "Uniform homomorphisms of de Bruijn and Kautz networks." Discrete Applied Mathematics 83, no. 1-3 (March 1998): 279–301. http://dx.doi.org/10.1016/s0166-218x(97)00115-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
26

Smit, Gerard J. M., Paul J. M. Havinga, Pierre G. Jansen, Fokke de Boer, and Bert Molenkamp. "On hardware for generating routes in Kautz digraphs." Microprocessing and Microprogramming 32, no. 1-5 (August 1991): 593–99. http://dx.doi.org/10.1016/0165-6074(91)90407-k.

Full text
APA, Harvard, Vancouver, ISO, and other styles
27

Dalfó, C. "The spectra of subKautz and cyclic Kautz digraphs." Linear Algebra and its Applications 531 (October 2017): 210–19. http://dx.doi.org/10.1016/j.laa.2017.05.046.

Full text
APA, Harvard, Vancouver, ISO, and other styles
28

Deke Guo, Jie Wu, Yunhao Liu, Hai Jin, Hanhua Chen, and Tao Chen. "Quasi-Kautz Digraphs for Peer-to-Peer Networks." IEEE Transactions on Parallel and Distributed Systems 22, no. 6 (June 2011): 1042–55. http://dx.doi.org/10.1109/tpds.2010.161.

Full text
APA, Harvard, Vancouver, ISO, and other styles
29

Makila, P. M., and J. R. Partington. "Laguerre and Kautz shift approximations of delay systems." International Journal of Control 72, no. 10 (January 1999): 932–46. http://dx.doi.org/10.1080/002071799220678.

Full text
APA, Harvard, Vancouver, ISO, and other styles
30

Tanguy, N., R. Morvan, P. Vilbe, and L. C. Calvez. "Pertinent choice of parameters for discrete Kautz approximation." IEEE Transactions on Automatic Control 47, no. 5 (May 2002): 783–87. http://dx.doi.org/10.1109/tac.2002.1000273.

Full text
APA, Harvard, Vancouver, ISO, and other styles
31

Delorme, C., and J. P. Tillich. "The Spectrum of de Bruijn and Kautz Graphs." European Journal of Combinatorics 19, no. 3 (April 1998): 307–19. http://dx.doi.org/10.1006/eujc.1997.0183.

Full text
APA, Harvard, Vancouver, ISO, and other styles
32

Panchapakesan, G., and A. Sengupta. "On a lightwave network topology using Kautz digraphs." IEEE Transactions on Computers 48, no. 10 (1999): 1131–37. http://dx.doi.org/10.1109/12.805162.

Full text
APA, Harvard, Vancouver, ISO, and other styles
33

Shibata, Y., and Y. Gonda. "Extension of de Bruijn graph and Kautz graph." Computers & Mathematics with Applications 30, no. 9 (November 1995): 51–61. http://dx.doi.org/10.1016/0898-1221(95)00146-p.

Full text
APA, Harvard, Vancouver, ISO, and other styles
34

Björsell, N., M. Isaksson, P. Händel, and D. Rönnow. "Kautz–Volterra modelling of analogue-to-digital converters." Computer Standards & Interfaces 32, no. 3 (March 2010): 126–29. http://dx.doi.org/10.1016/j.csi.2009.11.007.

Full text
APA, Harvard, Vancouver, ISO, and other styles
35

Lien, Min-Yun, Jyhmin Kuo, and Hung-Lin Fu. "On the decycling number of generalized Kautz digraphs." Information Processing Letters 115, no. 2 (February 2015): 209–11. http://dx.doi.org/10.1016/j.ipl.2014.09.013.

Full text
APA, Harvard, Vancouver, ISO, and other styles
36

Pollack, Martha, and Henry Kautz. "AAAI Leadership Transition." AI Magazine 31, no. 2 (June 15, 2010): 7. http://dx.doi.org/10.1609/aimag.v31i2.2308.

Full text
Abstract:
AAAI’s leadership underwent a major change in March of this year. Martha Pollack, who had been serving as AAAI president since July 2009 resigned her position, and Henry Kautz, who had been serving as AAAI president-elect assumed the duties and responsibilities of the president. As stipu- lated in the AAAI bylaws, Kautz will serve in this capacity until the 2010 AAAI annual business meeting, after which he will begin his full two-year term as president, starting one year ahead of schedule. In addi- tion, Eric Horvitz, who has already served one year as AAAI past president, has agreed to serve one addi- tional year so that the position will remain filled throughout Kautz’s tenure as president. An election will be held this year for the now-open position of president elect.
APA, Harvard, Vancouver, ISO, and other styles
37

Wang, Shiying, and Shangwei Lin. "The maximal restricted edge connectivity of Kautz undirected graphs." Electronic Notes in Discrete Mathematics 22 (October 2005): 49–53. http://dx.doi.org/10.1016/j.endm.2005.06.009.

Full text
APA, Harvard, Vancouver, ISO, and other styles
38

Guo, Deke, Yunhao Liu, Hai Jin, Zhong Liu, Weiming Zhang, and Hui Liu. "Theory and network applications of balanced kautz tree structures." ACM Transactions on Internet Technology 12, no. 1 (June 2012): 1–25. http://dx.doi.org/10.1145/2220352.2220355.

Full text
APA, Harvard, Vancouver, ISO, and other styles
39

Wei, Wenhong, Wenjun Xiao, and Yong Qin. "The Hyper-Kautz Network: A New Scalable Product Network." International Journal of Distributed Sensor Networks 5, no. 1 (January 2009): 71–72. http://dx.doi.org/10.1080/15501320802558449.

Full text
APA, Harvard, Vancouver, ISO, and other styles
40

OMURA, S. "Neighborhood Broadcasting in Undirected de Bruijn and Kautz Networks." IEICE Transactions on Information and Systems E88-D, no. 1 (January 1, 2005): 89–95. http://dx.doi.org/10.1093/ietisy/e88-d.1.89.

Full text
APA, Harvard, Vancouver, ISO, and other styles
41

Strok, V. V. "Unicontour Isomorphic Factorizations of de Bruijn and Kautz Digraphs." Cybernetics and Systems Analysis 40, no. 4 (July 2004): 478–85. http://dx.doi.org/10.1023/b:casa.0000047869.16553.68.

Full text
APA, Harvard, Vancouver, ISO, and other styles
42

Klages, Rainer. "Richard Kautz: Chaos—The Science of Predictable Random Motion." Journal of Statistical Physics 144, no. 4 (July 28, 2011): 918–19. http://dx.doi.org/10.1007/s10955-011-0282-z.

Full text
APA, Harvard, Vancouver, ISO, and other styles
43

Wu, Ling-ye, and Er-fang Shan. "Bounds on the absorbant number of generalized Kautz digraphs." Journal of Shanghai University (English Edition) 14, no. 1 (February 2010): 76–78. http://dx.doi.org/10.1007/s11741-010-0115-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
44

Huangfu, Xianpeng, Deke Guo, Honghui Chen, and Xueshan Luo. "KMcube: the compound of Kautz digraph and Möbius cube." Frontiers of Computer Science 7, no. 2 (February 23, 2013): 298–306. http://dx.doi.org/10.1007/s11704-013-2016-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
45

Wang, Shiying, and Shangwei Lin. "The k-restricted edge connectivity of undirected Kautz graphs." Discrete Mathematics 309, no. 13 (July 2009): 4649–52. http://dx.doi.org/10.1016/j.disc.2009.02.004.

Full text
APA, Harvard, Vancouver, ISO, and other styles
46

Zhou, S., H. Xu, and W. Xiao. "A unified formulation of Kautz network and generalized hypercube." Computers & Mathematics with Applications 49, no. 9-10 (May 2005): 1403–11. http://dx.doi.org/10.1016/j.camwa.2004.11.012.

Full text
APA, Harvard, Vancouver, ISO, and other styles
47

Reddy, Rajasekhara, and Prabirkumar Saha. "Kautz filters based model predictive control for resonating systems." International Journal of Dynamics and Control 5, no. 3 (March 30, 2016): 477–95. http://dx.doi.org/10.1007/s40435-016-0242-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
48

Misra, Shamik, Rajasekhara Reddy, and Prabirkumar Saha. "Model predictive control of resonant systems using Kautz model." International Journal of Automation and Computing 13, no. 5 (April 23, 2016): 501–15. http://dx.doi.org/10.1007/s11633-016-0954-x.

Full text
APA, Harvard, Vancouver, ISO, and other styles
49

Dong, Yanxia, Erfang Shan, and Xiao Min. "Distance domination of generalized de Bruijn and Kautz digraphs." Frontiers of Mathematics in China 12, no. 2 (December 7, 2016): 339–57. http://dx.doi.org/10.1007/s11464-016-0607-y.

Full text
APA, Harvard, Vancouver, ISO, and other styles
50

Hasunuma, Toru, Yosuke Kikuchi, Takeshi Mori, and Yukio Shibata. "On the number of cycles in generalized Kautz digraphs." Discrete Mathematics 285, no. 1-3 (August 2004): 127–40. http://dx.doi.org/10.1016/j.disc.2004.01.014.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the bibliographies on the topic 'Kautz' for other source types:
Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography