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
Comperarison of bottom up evaluation techniques for lenearly recursive queries in deductive databases
Download
056516.pdf
Date
1996
Author
Onural, Halit Deniz
Metadata
Show full item record
Item Usage Stats
93
views
0
downloads
Cite This
URI
https://hdl.handle.net/11511/11703
Collections
Graduate School of Natural and Applied Sciences, Thesis
Suggestions
OpenMETU
Core
Probabilistic modeling of operational dynamic water balance system for a mining facility
Pelenk, Ümit Giray; Yılmaz, Koray K.; Department of Geological Engineering (2019)
Water management in any environment is quite difficult and complex not only because of the effort that is required to comply with the environmental regulations but also due to the dynamic nature of the system not well suited for the deterministic approaches. As a result, probabilistic approaches are developed to make decisions that can actually represent the uncertainties quantitatively as probability distributions. Such methods, considered to be the best practice in mining industry, are very useful to make...
A longest path problem for evaluating the worst case packet delay of switched ethernet
Schmidt, Klaus Verner; Schmidt, Şenan Ece (2010-07-09)
In the recent years, the use of real-time Ethernet protocols becomes more and more relevant for time-critical networked industrial applications. In this context, this paper presents a method to compute the worst-case packet delays on switched Ethernet. Based on an evaluation of the packet delays at each switch port and the network topology, we construct a weighted directed graph that allows to find the worst-case end-to-end packet delay by solving a conventional longest-path problem.
A framework for aspect based sentiment analysis on turkish informal texts
Karagöz, Pınar; ÖZTÜRK, MURAT; Toroslu, İsmail Hakkı (Springer Science and Business Media LLC, 2019-12-01)
The web provides a suitable media for users to share opinions on various topics, including consumer products, events or news. In most of such content, authors express different opinions on different features (i.e., aspects) of the topic. It is a common practice to express a positive opinion on one aspect and a negative opinion on another aspect within the same post. Conventional sentiment analysis methods do not capture such details, rather an overall sentiment score is generated. In aspect based sentiment ...
An analysis of peculiarity oriented interestingness measures on medical data
Aldaş, Cem Nuri; Taşkaya Temizel, Tuğba; Department of Medical Informatics (2008)
Peculiar data are regarded as patterns which are significantly distinguishable from other records, relatively few in number and they are accepted as to be one of the most striking aspects of the interestingness concept. In clinical domain, peculiar records are probably signals for malignancy or disorder to be intervened immediately. The investigation of the rules and mechanisms which lie behind these records will be a meaningful contribution for improved clinical decision support systems. In order to discov...
A modified heuristic procedure for materials management in project networks
Erbasi, A; Sepil, C (1999-06-01)
A heuristic procedure for determining the tradeoff between expediting the ordering of materials and delaying the project is presented. The heuristic procedure is a modification of the procedure taken from the literature. With the use of an illustrative example, it has been shown that the modified procedure provides schedules with lower total cost values. Experimental results performed on randomly generated problems reveal that the modification can bring a decrease in total cost values as much as 52%.
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
H. D. Onural, “Comperarison of bottom up evaluation techniques for lenearly recursive queries in deductive databases,” Middle East Technical University, 1996.