To see the other types of publications on this topic, follow the link: Signal flow graph.

Journal articles on the topic 'Signal flow graph'

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 'Signal flow graph.'

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

Sen, A. K. "Metabolic control analysis. An application of signal flow graphs." Biochemical Journal 269, no. 1 (July 1, 1990): 141–47. http://dx.doi.org/10.1042/bj2690141.

Full text
Abstract:
In this paper the method of signal-flow graphs is used for calculating the Control Coefficients of metabolic pathways in terms of enzyme elasticities. The method is applied to an unbranched pathway (a) without feedback or feedforward regulation and (b) with feedback inhibition of the first enzyme by the last variable metabolite. It is shown that, by using a signal-flow graph, the control structure of a metabolic pathway can be represented in a graphical manner directly from the configuration of the pathway, without the necessity of writing the governing equations in a matrix form. From a signal-flow graph the various Control Coefficients can be evaluated in an easy and straightforward fashion without recourse to matrix inversion or other algebraic techniques. A signal-flow graph also provides a visual framework for analysing the cause-effect relationships of the individual enzymes.
APA, Harvard, Vancouver, ISO, and other styles
2

Wing-Hung Ki. "Signal flow graph analysis of feedback amplifiers." IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications 47, no. 6 (June 2000): 926–33. http://dx.doi.org/10.1109/81.852948.

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

DAVIS, MICHAEL C. "ENGINEERING APPLICATIONS OF THE SIGNAL FLOW GRAPH." Journal of the American Society for Naval Engineers 73, no. 1 (March 18, 2009): 147–56. http://dx.doi.org/10.1111/j.1559-3584.1961.tb02430.x.

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

Ma, R., and K. C. Gupta. "Signal Flow Graphs for Spatial Gear Trains." Journal of Mechanical Design 116, no. 1 (March 1, 1994): 326–31. http://dx.doi.org/10.1115/1.2919367.

Full text
Abstract:
Signal flow graphs (SFG) have been applied in many areas such as circuit analysis, controls, mechanical vibrations, statistics, and operations research. They have also been applied to the analysis of planetary gear trains which are planar, i.e., where all of the gear axes are parallel. In this paper, signal flow graphs are applied to spatial planetary gear trains. Some additional terminology and rules which are needed for this important application are developed in this paper and illustrated by examples. The significance of applying SFG to a gear system is that the graph describes the interrelationship among the system variables by linking causes and effects, offers the information about the topology of system connection, and the kinematic equations of motion can be written easily by inspection. In this way, it helps use to visualize and understand spatial gear train systems better.
APA, Harvard, Vancouver, ISO, and other styles
5

Beaufays, Françoise, and Eric A. Wan. "Relating Real-Time Backpropagation and Backpropagation-Through-Time: An Application of Flow Graph Interreciprocity." Neural Computation 6, no. 2 (March 1994): 296–306. http://dx.doi.org/10.1162/neco.1994.6.2.296.

Full text
Abstract:
We show that signal flow graph theory provides a simple way to relate two popular algorithms used for adapting dynamic neural networks, real-time backpropagation and backpropagation-through-time. Starting with the flow graph for real-time backpropagation, we use a simple transposition to produce a second graph. The new graph is shown to be interreciprocal with the original and to correspond to the backpropagation-through-time algorithm. Interreciprocity provides a theoretical argument to verify that both flow graphs implement the same overall weight update.
APA, Harvard, Vancouver, ISO, and other styles
6

Jeng, Shyr-Long, Rohit Roy, and Wei-Hua Chieng. "A Matrix Approach for Analyzing Signal Flow Graph." Information 11, no. 12 (November 30, 2020): 562. http://dx.doi.org/10.3390/info11120562.

Full text
Abstract:
Mason’s gain formula can grow factorially because of growth in the enumeration of paths in a directed graph. Each of the (n − 2)! permutation of the intermediate vertices includes a path between input and output nodes. This paper presents a novel method for analyzing the loop gain of a signal flow graph based on the transform matrix approach. This approach only requires matrix determinant operations to determine the transfer function with complexity O(n3) in the worst case, therefore rendering it more efficient than Mason’s gain formula. We derive the transfer function of the signal flow graph to the ratio of different cofactor matrices of the augmented matrix. By using the cofactor expansion, we then obtain a correspondence between the topological operation of deleting a vertex from a signal flow graph and the algebraic operation of eliminating a variable from the set of equations. A set of loops sharing the same backward edges, referred to as a loop group, is used to simplify the loop enumeration. Two examples of feedback networks demonstrate the intuitive approach to obtain the transfer function for both numerical and computer-aided symbolic analysis, which yields the same results as Mason’s gain formula. The transfer matrix offers an excellent physical insight, because it enables visualization of the signal flow.
APA, Harvard, Vancouver, ISO, and other styles
7

Szymkat, M. "Signal Flow Graph Algebraization in the D2M Package *." IFAC Proceedings Volumes 24, no. 4 (July 1991): 197–202. http://dx.doi.org/10.1016/s1474-6670(17)54271-8.

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

Veerachary, Mummadi, Tomonobu Senjyu, and Katsumi Uezato. "Signal flow graph modelling of interleaved buck converters." International Journal of Circuit Theory and Applications 31, no. 3 (2003): 249–64. http://dx.doi.org/10.1002/cta.230.

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

Xiao-Feng, Zhou, and Shen Zhi-Guang. "Signal flow graph analysis of switched-capacitor networks." International Journal of Circuit Theory and Applications 13, no. 2 (April 1985): 179–89. http://dx.doi.org/10.1002/cta.4490130207.

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

Veerachary, M., T. Senjyu, and K. Uezato. "Signal flow graph nonlinear modelling of interleaved converters." IEE Proceedings - Electric Power Applications 148, no. 5 (2001): 410. http://dx.doi.org/10.1049/ip-epa:20010573.

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

Jobling, C. P., and P. W. Grant. "A rule-based program for signal flow graph reduction." Engineering Applications of Artificial Intelligence 1, no. 1 (March 1988): 22–33. http://dx.doi.org/10.1016/0952-1976(88)90065-6.

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

Homier, Eric A., and Robert A. Scholtz. "A Generalized Signal Flow Graph Approach for Hybrid Acquisition of Ultra-Wideband Signals." International Journal of Wireless Information Networks 10, no. 4 (October 2003): 179–91. http://dx.doi.org/10.1023/b:ijwi.0000022049.93791.58.

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

Campolucci, Paolo, Aurelio Uncini, and Francesco Piazza. "A Signal-Flow-Graph Approach to On-line Gradient Calculation." Neural Computation 12, no. 8 (August 1, 2000): 1901–27. http://dx.doi.org/10.1162/089976600300015196.

Full text
Abstract:
A large class of nonlinear dynamic adaptive systems such as dynamic recurrent neural networks can be effectively represented by signal flow graphs (SFGs). By this method, complex systems are described as a general connection of many simple components, each of them implementing a simple one-input, one-output transformation, as in an electrical circuit. Even if graph representations are popular in the neural network community, they are often used for qualitative description rather than for rigorous representation and computational purposes. In this article, a method for both on-line and batch-backward gradient computation of a system output or cost function with respect to system parameters is derived by the SFG representation theory and its known properties. The system can be any causal, in general nonlinear and time-variant, dynamic system represented by an SFG, in particular any feedforward, time-delay, or recurrent neural network. In this work, we use discrete-time notation, but the same theory holds for the continuous-time case. The gradient is obtained in a straightforward way by the analysis of two SFGs, the original one and its adjoint (obtained from the first by simple transformations), without the complex chain rule expansions of derivatives usually employed. This method can be used for sensitivity analysis and for learning both off-line and on-line. On-line learning is particularly important since it is required by many real applications, such as digital signal processing, system identification and control, channel equalization, and predistortion.
APA, Harvard, Vancouver, ISO, and other styles
14

Gajanayake, C. J., D. M. Vilathgamuwa, and P. C. Loh. "Small-Signal and Signal-Flow-Graph Modeling of Switched Z-Source Impedance Network." IEEE Power Electronics Letters 3, no. 3 (September 2005): 111–16. http://dx.doi.org/10.1109/lpel.2005.859771.

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

HOU, CHUN-LI, CHEN-CHUAN HUANG, and JIUN-WEI HORNG. "A CRITERION OF A MULTI-LOOP OSCILLATOR CIRCUIT." Journal of Circuits, Systems and Computers 16, no. 01 (February 2007): 105–11. http://dx.doi.org/10.1142/s0218126607003460.

Full text
Abstract:
Multi-loop feedback control has attracted considerable attention due to its simplicity and ease of implementation.1 In order to simplify the cumbersome analysis of a multi-loop circuit, the signal flow graph representation should be used rather than our familiar nodal analysis methods. This paper presents a criterion from the well-established Mason's formula for multi-loop oscillator in terms of signal flow graphs. The multi-loop oscillator circuit based on two operational transresistance amplifiers (OTRAs) is used as an example.
APA, Harvard, Vancouver, ISO, and other styles
16

Rasim, Feim Ridvan, and Sebastian M. Sattler. "Analysis of Electronic Circuits with the Signal Flow Graph Method." Circuits and Systems 08, no. 11 (2017): 261–74. http://dx.doi.org/10.4236/cs.2017.811019.

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

Ruyle, J. E., and J. T. Bernhard. "Signal Flow Graph for a Probe-Fed Microstrip Patch Antenna." IEEE Antennas and Wireless Propagation Letters 8 (2009): 935–38. http://dx.doi.org/10.1109/lawp.2009.2027726.

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

Veerachary, Mummadi. "Signal flow graph modeling of two-cell cascade buck converters." Electrical Engineering 87, no. 3 (March 26, 2004): 143–49. http://dx.doi.org/10.1007/s00202-003-0225-z.

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

Dobrijevic, M., J. P. Parisot, and I. Dutour. "A study of chemical systems using signal flow graph theory." Advances in Space Research 16, no. 2 (January 1995): 105–8. http://dx.doi.org/10.1016/0273-1177(95)00198-n.

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

Pius, Einar, Raphael Dias da Silva, and Elham Kashefi. "Optimising the information flow of one-way quantum computations." Quantum Information and Computation 15, no. 9&10 (July 2015): 853–84. http://dx.doi.org/10.26421/qic15.9-10-6.

Full text
Abstract:
In the one-way quantum computing model, the information processing is driven by measurements performed on an entangled state, called the resource state. In order to achieve parallelism, one aims to increase the number of simultaneous measurements, such that the effects of decoherence on the resource state are minimised due to the reduction of the time required to run the computation. At the heart of this question is the notion of quantum information flow, which specifies the dependency relations between the measurements in the computations. There exist two well-known techniques for reducing the time required to perform a one-way quantum computation without changing its semantics. The first one, called signal-shifting, transforms the flow of a graph (representing the resource state) within the measurement calculus formalism, whereas the second one, namely finding the maximally-delayed generalised flow, explores the geometry of the graph to increase the number of operations that can be performed simultaneously. In this paper, we show for the first time how these two techniques relate to each other. We prove that the application of the signal-shifting rules to a measurement pattern with flow results in a generalised flow for the pattern. Then, we prove that in the particular case when the input size equals the output size, the gflow obtained using signal-shifting has the lowest possible depth. As a side result, we construct an $O(n^3)$-algorithm for finding maximally delayed gflows on graphs with flow. For those graphs, our algorithm is more efficient than the best previously known algorithm for the same task, which takes $O(n^4)$ operations to complete.
APA, Harvard, Vancouver, ISO, and other styles
21

M. Perera, Sirani. "Signal flow graph approach to efficient and forward stable DST algorithms." Linear Algebra and its Applications 542 (April 2018): 360–90. http://dx.doi.org/10.1016/j.laa.2017.05.050.

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

Abbasi, Majid, Ahmad Afifi, and Mohammad Reza Alizadeh Pahlavani. "Ripple base signal flow graph modelling of DC–DC switching converters." IET Power Electronics 12, no. 5 (May 2019): 1274–84. http://dx.doi.org/10.1049/iet-pel.2018.6036.

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

Li, Shengchao. "Loop Reversal Rule in Block Diagram and Signal Flow Graph Manipulation." IEEE Signal Processing Letters 19, no. 10 (October 2012): 672–75. http://dx.doi.org/10.1109/lsp.2012.2211869.

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

Veerachary, M. "Signal flow graph modelling of multi-state boost DC–DC converters." IEE Proceedings - Electric Power Applications 151, no. 5 (2004): 583. http://dx.doi.org/10.1049/ip-epa:20040680.

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

Bahadoran, Mahdi, Jalil Ali, and Preecha P. Yupapin. "Ultrafast all-optical switching using signal flow graph for PANDA resonator." Applied Optics 52, no. 12 (April 18, 2013): 2866. http://dx.doi.org/10.1364/ao.52.002866.

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

Zhang, Guoxing, Haixiao Wang, and Yuanpu Yin. "Multi-type Parameter Prediction of Traffic Flow Based on Time-space Attention Graph Convolutional Network." International Journal of Circuits, Systems and Signal Processing 15 (August 11, 2021): 902–12. http://dx.doi.org/10.46300/9106.2021.15.97.

Full text
Abstract:
Graph Convolutional Neural Networks are more and more widely used in traffic flow parameter prediction tasks by virtue of their excellent non-Euclidean spatial feature extraction capabilities. However, most graph convolutional neural networks are only used to predict one type of traffic flow parameter. This means that the proposed graph convolutional neural network may only be effective for specific parameters of specific travel modes. In order to improve the universality of graph convolutional neural networks. By embedding time feature and spatio-temporal attention layer, we propose a spatio-temporal attention graph convolutional neural network based on the attention mechanism of the neural network. Through experiments on passenger flow data and vehicle speed data of two different travel modes (Hangzhou Metro Data and California Highway Data), it is verified that the proposed spatio-temporal attention graph convolutional neural network can be used to predict passenger flow and vehicle speed simultaneously. Meanwhile, the error distribution range of the proposed model is minimum, and the overall level of prediction results is more accurate.
APA, Harvard, Vancouver, ISO, and other styles
27

Prasad, V. C. "Compact Form of Mason's Gain Formula for Signal Flow Graphs." International Journal of Electrical Engineering & Education 47, no. 4 (October 2010): 393–403. http://dx.doi.org/10.7227/ijeee.47.4.4.

Full text
Abstract:
Mason's gain formula requires combining all paths and all loops judiciously. New techniques are presented in this paper to do this. All possible non-touching loop combinations can be generated systematically and represented compactly using a tree structure and/or factoring technique. Both numerator and denominator of the formula can be treated identically. The approach is simple enough to be used in teaching students Mason's gain formula as part of courses in control systems, digital signal processing, graph theory and applications, among others.
APA, Harvard, Vancouver, ISO, and other styles
28

Yang Pengbo, 杨鹏勃, 梁金龙 Liang Jinlong, 曲阳 Qu Yang, 陈晨 Chen Chen, 王甲伟 Wang Jiawei, and 高劭宏 Gao Shaohong. "Signal Flow Graph for Analyzing Characteristics of Multiple-Ring Microring Resonator Filters." Laser & Optoelectronics Progress 48, no. 9 (2011): 092301. http://dx.doi.org/10.3788/lop48.092301.

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

Veerachary, Mummadi, Tomonobu Senjyu, and Katsumi Uezato. "Signal flow graph modelling and analysis of interleaved DC?DC parallel converters." International Journal of Electronics 88, no. 9 (September 2001): 1015–33. http://dx.doi.org/10.1080/00207210110063557.

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

Jiang, Jinguang, Xifeng Zhou, and Weilin Xu. "Nth-order current transfer function synthesis using DVCCs: signal-flow graph approach." International Journal of Electronics 100, no. 4 (April 2013): 482–96. http://dx.doi.org/10.1080/00207217.2012.713019.

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

Dorn, Britta, Falk Hüffner, Dominikus Krüger, Rolf Niedermeier, and Johannes Uhlmann. "Exploiting bounded signal flow for graph orientation based on cause-effect pairs." Algorithms for Molecular Biology 6, no. 1 (2011): 21. http://dx.doi.org/10.1186/1748-7188-6-21.

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

Mahdy, A. M. S., M. S. Mohamed, K. A. Gepreel, A. AL-Amiri, and M. Higazy. "Dynamical Characteristics and Signal Flow Graph of Nonlinear Fractional Smoking Mathematical Model." Chaos, Solitons & Fractals 141 (December 2020): 110308. http://dx.doi.org/10.1016/j.chaos.2020.110308.

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

Koksal, Muhammet, and Mehmet Sagbas. "A versatile signal flow graph realization of a general current transfer function." AEU - International Journal of Electronics and Communications 62, no. 1 (January 2008): 33–40. http://dx.doi.org/10.1016/j.aeue.2007.02.003.

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

Athamneh, Abedalgany, and Shadi A. Alboon. "Analysis of Liquid Crystal Tunable Thin-Film Optical Filters Using Signal Flow Graph Technique." International Journal of Optics 2021 (July 13, 2021): 1–4. http://dx.doi.org/10.1155/2021/5513995.

Full text
Abstract:
In this paper, a liquid crystal tunable thin-film optical bandpass filter is studied and analyzed using the signal flow graph technique. This paper investigates an exact form for calculating the transmission coefficients, reflection coefficients, and the transmission intensity of the filter. The simulation results show the filter performance and the channel shape profile. In addition, the results show the tuning capability of the filter. The signal flow graph technique provides an attractive method for analyzing the thin-film optical filters since it overcomes the difficulty of the refractive index concept in extending to optical applications. Moreover, it simplifies the filter analysis and design process.
APA, Harvard, Vancouver, ISO, and other styles
35

BARUAH, N., and A. K. BARUAH. "THE SET OF FEASIBLE CONTROL VECTORS IN A TRAFFIC CONTROL PROBLEM." Latin American Applied Research - An international journal 46, no. 3 (July 29, 2016): 99–102. http://dx.doi.org/10.52292/j.laar.2016.334.

Full text
Abstract:
Signal Groups of a compatibility graph is used to solve conflict between the traffic streams and hence can used as a solution for traffic control problem at an intersection. The compatibility relation of the signal groups is defined and the control vectors i.e. the phases of the compatibility graph are used to control the flow of traffic. The set of feasible control vectors Uf is determined and phasing of signal group is done by choosing the controls from the set of feasible control Uf. Keywords   , ,.
APA, Harvard, Vancouver, ISO, and other styles
36

Javidi, Giti, and Ehsan Sheybani. "Application of Digital Signal Processing in USRP Satellite Signal Detection." International Journal of Interdisciplinary Telecommunications and Networking 9, no. 2 (April 2017): 16–25. http://dx.doi.org/10.4018/ijitn.2017040102.

Full text
Abstract:
The Universal Software Radio Peripheral development technique is designing and implementing radio frequency based systems. The distinctiveness originates from the interchangeable daughterboard within the USRP. The system is designed around the Xilinx Vertex 3 FPGA chip. This means C++, Python, and VHDL can be used to program this device. The project consists of creating a receiver. The objective of the project is to research and comprehend the hardware functionalities of the USRP. The purpose is to create codes in C++ and Python to implement receiving capabilities of the device. The goal of this project was to design a GPS receiver that is capable of recording the L1 signal from a DirecTV satellite. The USRP is used a lot for research. This project consisted of more than just one method. We used GNU Radio Companion and Matlab/Simulink. GNU Radio is open source for building software defined radios. It is also known as GRC. While using GRC the USRP1 was the device used. This software has rapid development. It runs in Ubuntu, a Linux operating system. Within this software there are logic blocks. Each block consists of information to create a flow graph. The flow graph builds and generates the program. Simulink can be compared to GRC. They both have logic blocks that have to be connected to run. Simulink can be used to create a transmitter or a receiver for software radio development and signal processing. Software-defined radio can only be defined if its baseband operations can be completely defined by software. A SDR converts digital to analog signals. The USRP can also convert digital signals from a computer to Radio Frequency Signals (RF). This software is one way to communicate between hardware and software.
APA, Harvard, Vancouver, ISO, and other styles
37

Li, Max Z., Karthik Gopalakrishnan, Kristyn Pantoja, and Hamsa Balakrishnan. "Graph Signal Processing Techniques for Analyzing Aviation Disruptions." Transportation Science 55, no. 3 (May 2021): 553–73. http://dx.doi.org/10.1287/trsc.2020.1026.

Full text
Abstract:
Understanding the characteristics of air-traffic delays and disruptions is critical for developing ways to mitigate their significant economic and environmental impacts. Conventional delay-performance metrics reflect only the magnitude of incurred flight delays at airports; in this work, we show that it is also important to characterize the spatial distribution of delays across a network of airports. We analyze graph-supported signals, leveraging techniques from spectral theory and graph-signal processing to compute analytical and simulation-driven bounds for identifying outliers in spatial distribution. We then apply these methods to the case of airport-delay networks and demonstrate the applicability of our methods by analyzing U.S. airport delays from 2008 through 2017. We also perform an airline-specific analysis, deriving insights into the delay dynamics of individual airline subnetworks. Through our analysis, we highlight key differences in delay dynamics between different types of disruptions, ranging from nor’easters and hurricanes to airport outages. We also examine delay interactions between airline subnetworks and the system-wide network and compile an inventory of outlier days that could guide future aviation operations and research. In doing so, we demonstrate how our approach can provide operational insights in an air-transportation setting. Our analysis provides a complementary metric to conventional aviation-delay benchmarks and aids airlines, traffic-flow managers, and transportation-system planners in quantifying off-nominal system performance.
APA, Harvard, Vancouver, ISO, and other styles
38

Farida, Yuniar, Aris Fanani, Ida Purwanti, Luluk Wulandari, and Nanida Jenahara Zaen. "P PEMODELAN ARUS LALU LINTAS DAN WAKTU TUNGGU TOTAL OPTIMAL DI PERSIMPANGAN JL. JEMUR ANDAYANI – AHMAD YANI SEBAGAI UPAYA MENGURAI KEMACETAN." BAREKENG: Jurnal Ilmu Matematika dan Terapan 14, no. 3 (October 10, 2020): 389–98. http://dx.doi.org/10.30598/barekengvol14iss3pp389-398.

Full text
Abstract:
One crossroad of ​​Surabaya whose high level of congestion is the crossing of Jemur Andayani – Ahmad Yani Street. It needs to Improve traffic management, geometric, and signal time to obtain optimal traffic performance. The purpose of this study is to make a model of traffic flow and determine the optimal total waiting time at the crossing of Jemur Andayani – Ahmad Yani using Compatible Graph. Compatible graphs are two sets where vertices indicate objects to be arranged and edges indicate compatible pairs of objects. Compatible traffic flow is two traffic flows which if both of them run simultaneously can run safely and not collide. The results of the optimal waiting time calculation using a compatible graph assuming the left turn following the lamp is 75 seconds. While the optimal total waiting time by assuming the left turn not following the lights is 60 seconds. The optimal total waiting time is smaller than the actual total waiting time currently applied at Frontage Ahmad Yani street, which is 170 seconds by assuming turn left following the lights.
APA, Harvard, Vancouver, ISO, and other styles
39

Shao, Jun Peng, Jian Ying Li, Zhong Wen Wang, and Gui Hua Han. "Research on Electro-Hydraulic Load Simulator Based on Building Model of Flow Press Servo Valve." Advanced Materials Research 129-131 (August 2010): 213–17. http://dx.doi.org/10.4028/www.scientific.net/amr.129-131.213.

Full text
Abstract:
The model of flow press servo valve is built in this paper, during building the model, the author emphatically analyses the flow equation and force (torque) balance equation of every part of the valve, at the same time, all levels sub-models are organic combined according to power flow direction, signal flow direction of elements and causality, then we get the bond graph model of the flow press servo from this way. Adapting flow press servo valve and flow servo valve to concurrently control load system has its great advantage in restraining the superfluous force of the electro-hydraulic load simulator system, the performance such as load precision of system is enhanced greatly according to this method. Based on the system bond graph model, and by comparing the simulation curves and experiment curves, we can know that the simulation curves basically tally with the experiment curves, the bond graph models are validated right, which are flow press servo valve bond graph model and double valves concurrently control the electro-hydraulic load simulator system bond graph model. Simultaneity, the bond graph models in this paper take on generality, they are can be used on other aspects, such as other valve controlling cylinder system simulation, design and control strategy theory research.
APA, Harvard, Vancouver, ISO, and other styles
40

DAS, B. K., R. N. MAHAPATRA, and B. N. CHATTERJI. "PERFORMANCE MODELING OF DISCRETE COSINE TRANSFORM FOR STAR GRAPH CONNECTED MULTIPROCESSORS." Journal of Circuits, Systems and Computers 06, no. 06 (December 1996): 635–48. http://dx.doi.org/10.1142/s0218126696000443.

Full text
Abstract:
Discrete Cosine Transform algorithm has emphasized the research attention for its ability to analyze application-based problems in signal and image processing like speech coding, image coding, filtering, cepstral analysis, topographic classification, progressive image transmission, data compression etc. This has major applications in pattern recognition and image processing. In this paper, a Cooley-Tukey approach has been proposed for computation of Discrete Cosine Transform and the necessary mathematical formulations have been developed for Star Graph connected multiprocessors. The signal flow graph of the algorithm has been designed for mapping onto the Star Graph. The modeling results are derived in terms of computation time, speedup and efficiency.
APA, Harvard, Vancouver, ISO, and other styles
41

Huang, Yuan Xin, Kun Li, Xiu Wei Xuan, and Jian Fu Teng. "High-Order Active Filter Design Based on Component-Level Signal Flow Graph Method." Applied Mechanics and Materials 385-386 (August 2013): 1340–43. http://dx.doi.org/10.4028/www.scientific.net/amm.385-386.1340.

Full text
Abstract:
In this paper, a seventh-order elliptic low-pass active-RC filter with three finite transmission zeros is designed for the baseband filter of a 433MHz wireless communication terminal. While designing, the canonical signal flow graph (SFG) method is applied based on component-level simulation of LC ladder prototype circuit. The simulation and measurement results show that the filter satisfied the design specifications.
APA, Harvard, Vancouver, ISO, and other styles
42

He, Hai Zhen, Jun Kuang, Xin Liu, Xin Hang Huang, and Mei Li Cao. "Signal Flow Graph Synthetical Implement the Current-Mode Multifunction Filter Based on CDTA." Applied Mechanics and Materials 530-531 (February 2014): 1100–1107. http://dx.doi.org/10.4028/www.scientific.net/amm.530-531.1100.

Full text
Abstract:
In this paper, a signal flow graph structure of current-mode multifunction filter using current differencing transconductance amplifier (CDTA) is presented. The proposed configuration is comprised of two grounded capacitors and four CDTAs. They exhibit low-input and high-output impedances, which is very convenient for integrated circuit implementation. The presented filter configuration can realize all the standard filter functions simultaneously, lowpass (LP), bandpass (BP), highpass (HP), bandstop (BS) and allpass (AP), without any component matching conditions. The natural frequency () and the bandwidth () of the proposed filter can be electronically tuned by varying the bias current of the CDTA. PSPICE simulation results are included to confirm the theory.
APA, Harvard, Vancouver, ISO, and other styles
43

Lehner, D., and R. Unbehauen. "A modified procedure to convert a signal flow graph into its Chan model." IEEE Transactions on Circuits and Systems 34, no. 5 (May 1987): 584–86. http://dx.doi.org/10.1109/tcs.1987.1086163.

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

Veerachary, M. "General rules for signal flow graph modeling and analysis of DC-DC converters." IEEE Transactions on Aerospace and Electronic Systems 40, no. 1 (January 2004): 259–71. http://dx.doi.org/10.1109/taes.2004.1292158.

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

Veerachary, M. "Analysis of interleaved dual boost converter with integrated magnetics: signal flow graph approach." IEE Proceedings - Electric Power Applications 150, no. 4 (2003): 407. http://dx.doi.org/10.1049/ip-epa:20030260.

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

Dobrijevic, M., J. P. Parisot, and I. Dutour. "A study of chemical systems using signal flow graph theory: application to Neptune." Planetary and Space Science 43, no. 1-2 (January 1995): 15–24. http://dx.doi.org/10.1016/0032-0633(94)00147-j.

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

Zaenal, Harris. "KONSEP DESAIN ALAT UJI KINERJA SERVO-VALVE = DESIGN CONCEPT OF TESTING MACHINE OF SERVO-VALVE PERFORMANCES." Material Komponen dan Konstruksi 14, no. 1 (June 1, 2014): 9. http://dx.doi.org/10.29122/mkk.v14i1.1650.

Full text
Abstract:
Design concept of performance test equipment for servo-valve consists of mechanical and electronic systems. The mechanical parts includes a hydraulic power pack equipped with safety and monitoring of pressure and flow-rate, servo-valve and its base-plate, flow-meter for monitoring flow-rate in A and B ports. The electronic system parts includes a signal generator to the servo- valve, output signal from flow meter A and B ports, acquisition for signal output flow-meter, hardware and software computer. The form of graph Input Signal (m- Ampere) versus Output Signal (LPM) can help analyze to determine servo-valve performance, that are accuracy and detect damage which can be taken for further maintenance and repair.Keywords : servo-valve, signal input, flow rate output , performance test machine.Abstrak Konsep desain alat uji kinerja servo-valve terdiri atas konsep desain mekanis dan konsep desain elektronik. Konsep desain mekanis meliputi hydraulic power pack yang dilengkapi pengaman dan monitor tekanan dan flow- rate, servo-valve dan base-plate-nya, flow-meter untuk monitor flow-rate di port A dan B. Konsep desain elektronik meliputi pembangkit signal input kepada servo-valve, signal output dari flow-meter A dan B, akuisisi signal output flow- meter, hardware dan software komputer. Grafik Signal Input (m-Ampere) versus Signal Output (LPM) dapat membantu analisa untuk mengetahui kinerja servo-valve antara lain keakurasian, mendeteksi kerusakan servo-valve untuk selanjutnya dapat diambil tindakan pemeliharaan dan perbaikan.Kata Kunci : servo-valve, input signal, output flow rate ,alat uji kinerja.
APA, Harvard, Vancouver, ISO, and other styles
48

Díaz-Zuccarini, Vanessa, and César Pichardo-Almarza. "On the formalization of multi-scale and multi-science processes for integrative biology." Interface Focus 1, no. 3 (March 30, 2011): 426–37. http://dx.doi.org/10.1098/rsfs.2010.0038.

Full text
Abstract:
The aim of this work is to introduce the general concept of ‘Bond Graph’ (BG) techniques applied in the context of multi-physics and multi-scale processes. BG modelling has a natural place in these developments. BGs are inherently coherent as the relationships defined between the ‘elements’ of the graph are strictly defined by causality rules and power (energy) conservation. BGs clearly show how power flows between components of the systems they represent. The ‘effort’ and ‘flow’ variables enable bidirectional information flow in the BG model. When the power level of a system is low, BGs degenerate into signal flow graphs in which information is mainly one-dimensional and power is minimal, i.e. they find a natural limitation when dealing with populations of individuals or purely kinetic models, as the concept of energy conservation in these systems is no longer relevant. The aim of this work is twofold: on the one hand, we will introduce the general concept of BG techniques applied in the context of multi-science and multi-scale models and, on the other hand, we will highlight some of the most promising features in the BG methodology by comparing with examples developed using well-established modelling techniques/software that could suggest developments or refinements to the current state-of-the-art tools, by providing a consistent framework from a structural and energetic point of view.
APA, Harvard, Vancouver, ISO, and other styles
49

Buonanno, Amedeo, Antonio Nogarotto, Giuseppe Cacace, Giovanni Di Gennaro, Francesco A. N. Palmieri, Maria Valenti, and Giorgio Graditi. "Bayesian Feature Fusion Using Factor Graph in Reduced Normal Form." Applied Sciences 11, no. 4 (February 22, 2021): 1934. http://dx.doi.org/10.3390/app11041934.

Full text
Abstract:
In this work, we investigate an Information Fusion architecture based on a Factor Graph in Reduced Normal Form. This paradigm permits to describe the fusion in a completely probabilistic framework and the information related to the different features are represented as messages that flow in a probabilistic network. In this way we build a sort of context for observed features conferring to the solution a great flexibility for managing different type of features with wrong and missing values as required by many real applications. Moreover, modifying opportunely the messages that flow into the network, we obtain an effective way to condition the inference based on the different reliability of each information source or in presence of single unreliable signal. The proposed architecture has been used to fuse different detectors for an identity document classification task but its flexibility, extendibility and robustness make it suitable to many real scenarios where the signal can be wrongly received or completely missing.
APA, Harvard, Vancouver, ISO, and other styles
50

Wing-Hung Ki. "Signal flow graph in loop gain analysis of DC-DC PWM CCM switching converters." IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications 45, no. 6 (June 1998): 644–55. http://dx.doi.org/10.1109/81.678481.

Full text
APA, Harvard, Vancouver, ISO, and other styles
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