Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Network transformations for realization of lumped and distributed filters
Download
035440.pdf
Date
1994
Author
Karaaslan, Mehmet
Metadata
Show full item record
Item Usage Stats
92
views
0
downloads
Cite This
URI
https://hdl.handle.net/11511/10971
Collections
Graduate School of Natural and Applied Sciences, Thesis
Suggestions
OpenMETU
Core
Network attack classification with few-shot learning methods
Tüzün, İsmail; Angın, Pelin; Department of Computer Engineering (2022-9-14)
As the number of devices using the Internet increases, the network attacks that these devices are exposed to also diversify. Identifying network attack types from network packets is important to prevent the damage of the attack and to minimize it in cases where it cannot be prevented. Classical machine learning methods and deep learning methods need a lot of data to get successful results. Unfortunately, preparing and labeling large amounts of data is costly in current conditions. This cost is mostly due to...
Network Analysis Algorithm for the Solution of Discrete Time-Cost Trade-off Problem
BETTEMİR, ÖNDER HALİS; Birgönül, Mustafa Talat (2017-05-01)
Optimum solution of time-cost trade-off problem has significant importance since it provides the highest profit opportunity. For this reason, exact, heuristic, and meta-heuristic algorithms are adapted to obtain the optimum or near-optimum solution. However, heuristic algorithms may not always converge into the global optimum, while meta-heuristic algorithms require significant computation to converge into global optimum and exact methods are complex for construction planners to implement. Therefore, minimu...
Network Modeling Identifies Patient-specific Pathways in Glioblastoma.
Tunçbağ, Nurcan; POKORNY, JL; JOHNSON, H; SIO, TT; DALIN, S; IYEKEGBE, DO; WHITE, FM; SARKARIA, JN; FRAENKEL, E (2016-06-29)
Glioblastoma is the most aggressive type of malignant human brain tumor. Molecular profiling experiments have revealed that these tumors are extremely heterogeneous. This heterogeneity is one of the principal challenges for developing targeted therapies. We hypothesize that despite the diverse molecular profiles, it might still be possible to identify common signaling changes that could be targeted in some or all tumors. Using a network modeling approach, we reconstruct the altered signaling pathways from t...
Network dimensioning in randomly deployed wireless sensor networks
Sevgi, Cüneyt; Koçyiğit, Altan; Department of Information Systems (2009)
In this study, we considered a heterogeneous, clustered WSN, which consists of two types of nodes (clusterheads and sensor nodes) deployed randomly over a sensing field. We investigated two cases based on how clusterheads can reach the sink: direct and multi-hop communication cases. Network dimensioning problems in randomly deployed WSNs are among the most challenging ones as the attributes of these networks are mostly non-deterministic. We focused on a number of network dimensioning problems based on the c...
Network structure
Purutçuoğlu Gazi, Vilda (null; 2011-06-01)
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
M. Karaaslan, “Network transformations for realization of lumped and distributed filters,” Middle East Technical University, 1994.