96,626 Hits in 4.7 sec

Expanding and forwarding parameters of product graphs

Jianguo Qian, Fuji Zhang
2004 Discrete Applied Mathematics  
Expanding and forwarding are two graphic parameters related to the connectivity and the capacity of the network-the undirected graph with a given routing.  ...  The study shows that the t-forwarding parameters of a given graph are convergent (refers to the limit t → ∞), which reveals some further properties concerning the forwarding parameters of the product graphs  ...  In this paper, our main aim is to study the expanding and forwarding parameters of the graphs produced by Cartisian product (or product graph, for short).  ... 
doi:10.1016/s0166-218x(03)00199-9 fatcat:rmltewa2qvbcdpiztz3osj5ara

An efficient timing model for hardware implementation of multirate dataflow graphs

Nitin Chandrachoodan, Shuvra S Bhattacharyaa, K.J. Ray Liu
2001 2001 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.01CH37221)  
This information is used for synthesis of appropriate architectures for implementing the graph.  ...  We identify some of these shortcomings, and provide an alternate model that does not have these problems.  ...  need to be completely flattened and expanded in the context of the overall graph.  ... 
doi:10.1109/icassp.2001.941126 dblp:conf/icassp/ChandrachoodanBL01 fatcat:j5put3cqwnevbekbptl4kouqsy


Przemysław Piróg
2016 Informatyka Automatyka Pomiary w Gospodarce i Ochronie Środowiska  
Flow graphs are the effective tool for description of the complicated microwave measurement systems and usually are used in the process of creating measurement equation.  ...  This operation needs to perform a lot of symbolic computations so performing of this algorithm without proper software is heavy and is vulnerable to appearing some errors.  ...  of possible forward paths between IN and ON, k Ggain of k-th forward path between IN and ON, i Lloop gain of each closed loop in the graph, of the loop gains of any two non-touching loops, of the loop  ... 
doi:10.5604/20830157.1212258 fatcat:5egg3emrdbchdn3v6p4kdkutky

Cartesian product of synchronization transitions and hysteresis

Changsu Wang, Yong Zou, Shuguang Guan, Jürgen Kurths
2017 New Journal of Physics  
We show that the order parameter of the Cartesian product is the product of the order parameters of the factors.  ...  On the product graph, we observe either continuous or discontinuous synchronization transitions.  ...  Acknowledgments This work is in part financially supported by Natural Science Foundation of Shanghai (Grant No. 17ZR1444800).  ... 
doi:10.1088/1367-2630/aa99b5 fatcat:yjwogp5qkfcizbcvtzrqq6xcf4

The forwarding indices of graphs - a survey

Jun-Ming Xu, Min Xu
2013 Opuscula Mathematica  
The parameter is called the forwarding index of G with respect to R, and the parameter Similar problems were studied for edges by Heydemann et al. [32] in 1989.  ...  indices of graphs -a survey 347 and the edge-forwarding index of G is defined as π(G) = min{π(G, R) : R ∈ R m (G)}.  ...  The work was supported partially by NNSF of China (No. 11071233; No. 61272008 ) and Fundamental Research Funds for the Central Universities.  ... 
doi:10.7494/opmath.2013.33.2.345 fatcat:47zeik3anjam5ghhxyqdiehm4e

Application of neural network modeling and fuzzy inference methods in cladding operation design

D A Rastorguev, A V Zotov, R R Dema
2020 IOP Conference Series: Materials Science and Engineering  
and competitiveness of production.  ...  The features of this approach are considered when choosing and calculating the design and technological parameters of the operation.  ...  This will expand the possibilities for the selection of technological parameters in the range of possible applications and in their number.  ... 
doi:10.1088/1757-899x/734/1/012133 fatcat:t7zs474h3fhvffh4rsfb7cqhzi

Operations for Learning with Graphical Models [article]

W. L. Buntine
1994 arXiv   pre-print
This includes versions of linear regression, techniques for feed-forward networks, and learning Gaussian and discrete Bayesian networks from data.  ...  Well-known examples of graphical models include Bayesian networks, directed graphs representing a Markov chain, and undirected networks representing a Markov field.  ...  Graduate students at Stanford and Berkeley have also received various incarnations of this ideas.  ... 
arXiv:cs/9412102v1 fatcat:7ysut5wo6nfwnaco4rycbedpva

Differentiable Programming Tensor Networks [article]

Hai-Jun Liao, Jin-Guo Liu, Lei Wang, Tao Xiang
2019 arXiv   pre-print
By formulating the tensor network algorithm as a computation graph, one can compute higher order derivatives of the program accurately and efficiently using AD.  ...  Next, we perform gradient based variational optimization of infinite projected entangled pair states for quantum antiferromagnetic Heisenberg model and obtain start-of-the-art variational energy and magnetization  ...  We thank Philippe Corboz and Laurens Vanderstraeten for providing the reference data shown in Fig. 4 .  ... 
arXiv:1903.09650v1 fatcat:n7l5zjfhhvemhianohbig7l4di

VLSI Architecture of a Cellular Automata based One-Way Function

D. Mukhopadhyay, P. Joshi, D. RoyChowdhury
2008 Journal of Computers  
It has been shown that the expander graphs built using the TPSA-CA are promising and lead to the development of strong one-way functions.  ...  In this paper, a technique to generate expander graphs using Cellular Automata (CA) has been presented.  ...  The outline of the paper is as follows: Section II describes some of the preliminaries of expander graphs. The TPSA-CA is characterized in section III and is used to generate expander graphs.  ... 
doi:10.4304/jcp.3.5.46-53 fatcat:lwzxd4erx5cy7or6izcqjtar7a

A Pilot Protocol Study on How Designers Construct Function Structures in Novel Design [chapter]

Chiradeep Sen, Joshua D. Summers
2014 Design Computing and Cognition '12  
The protocol analysis reveals patterns of modeling activities, such as forward chaining (expanding the model by adding functions to the head of flows and flows outgoing of functions), backward chaining  ...  Sen and J.D. Summers 2 cleation or forward chaining of functions and forward or backward chaining of flows.  ...  The Design Repository is an archive of these reverse engineered products and is currently expanding to support other research needs.  ... 
doi:10.1007/978-94-017-9112-0_14 fatcat:6ipacnqorbbdhebsn4zxscowpy

Fast Haar Transforms for Graph Neural Networks [article]

Ming Li, Zheng Ma, Yu Guang Wang, Xiaosheng Zhuang
2019 arXiv   pre-print
The sparsity and locality of the Haar basis allow Fast Haar Transforms (FHTs) on graph, by which a fast evaluation of Haar convolution between graph data and filters can be achieved.  ...  Graph Neural Networks (GNNs) have become a topic of intense research recently due to their powerful capability in high-dimensional classification and regression tasks for graph-structured data.  ...  with filter g which is of length N J but with N J−1 independent parameters, where g is expanded from level J − 1 to J by weight sharing, and the output f out of the first layer is the ReLU of the Haar  ... 
arXiv:1907.04786v3 fatcat:7ixsue4bzvaatkb6akhglh25ge

Hardness Amplification Via Space-Efficient Direct Products [chapter]

Venkatesan Guruswami, Valentine Kabanets
2006 Lecture Notes in Computer Science  
The proof of our Direct Product Lemma is inspired by Dinur's remarkable proof of the PCP theorem by gap amplification using expanders [Din05] .  ...  . , v t ) in some explicit d-regular expander graph on 2 n vertices, the function g (w) def = g(v 1 ) . . . g(v t ) cannot be computed on more than 1 − Ω(tδ) fraction of inputs by any deterministic time  ...  We anticipate that there will be further examples of such iterative, "gradual-improvement" algorithms in the future.  ... 
doi:10.1007/11682462_52 fatcat:udzsfvvkhjgnfadcb2torhj2hi

Hardness Amplification via Space-Efficient Direct Products

Venkatesan Guruswami, Valentine Kabanets
2008 Computational Complexity  
The proof of our Direct Product Lemma is inspired by Dinur's remarkable proof of the PCP theorem by gap amplification using expanders [Din05] .  ...  . , v t ) in some explicit d-regular expander graph on 2 n vertices, the function g (w) def = g(v 1 ) . . . g(v t ) cannot be computed on more than 1 − Ω(tδ) fraction of inputs by any deterministic time  ...  We anticipate that there will be further examples of such iterative, "gradual-improvement" algorithms in the future.  ... 
doi:10.1007/s00037-008-0253-1 fatcat:m4dcekzmgvggzlqo3ln2ay6a5y

Predicting retrosynthetic pathways using a combined linguistic model and hyper-graph exploration strategy [article]

Philippe Schwaller, Riccardo Petraglia, Valerio Zullo, Vishnu H Nair, Rico Andreas Haeuselmann, Riccardo Pisoni, Costas Bekas, Anna Iuliano, and Teodoro Laino
2019 arXiv   pre-print
The hypergraph is constructed on the fly, and the nodes are filtered and further expanded based on a Bayesian-like probability.  ...  We present an extension of our Molecular Transformer architecture combined with a hyper-graph exploration strategy for automatic retrosynthesis route planning without human intervention.  ...  Expand the graph at every node contained in one of the possible pathways discovered up to this point and not yet expanded. 2.  ... 
arXiv:1910.08036v1 fatcat:vqhxfzown5dbpkd7ynamfn4ihm

Novel Efficacious Utilization of Fuzzy-logic Controller-Based Two-Quadrant Operation of PMBLDC Motor Drive Systems for Multipass Hot-Steel Rolling Processes

Mohanraj N, Sankaran R, Subashini N, Shriram S. Rangarajan
2020 Electronics  
We present a modeling of the hot-steel rough-rolling process using a set of metallurgical parameters and mechanical equations based on their operating conditions, specific features and characteristics,  ...  The above equations and related parameters were modeled in MATLAB/Simulink schematic under variations in temperature and slab thickness corresponding using three different hot-rolled (HR) steel specimens  ...  Acknowledgments: Authors would like to thank the management of SASTRA Deemed University and the R& D lab at Power electronics and drives laboratory of SEEE at SASTRA University for providing necessary  ... 
doi:10.3390/electronics9061008 fatcat:k5nuchcgj5dvzfmr5y5zkrgdg4
« Previous Showing results 1 — 15 out of 96,626 results