1,721,217 research outputs found
METODE THRESHOLDING CITRA KOMPUTER BERDASARKAN HISTOGRANI CITRA: PENDEKATAN FUNGSI EKSPONENSIAL
Analisis suatu citra komputer (computer images) seringkali didasarkan pada format biner citra tersebut, sedangkan citra tersebut pada umumnya ditangkap dengan format keabuan (grey level images). Berdasarkan hal tersebut, diperlukan adanya mekanisme untuk mentransformasikan citra dalam format keabuan menjadi format biner, yang disebut metode thresholding. Transformasi yang dilakukan kadang kadang menyebabkan hilangnya beberapa informasi citra tersebut. Dengan demikian diperlukan mekanisme transformasi yang meminimalkan kehilangan informasi tersebut. Salah satu mekanisme thresholding didasarkan pada histogram citra tersebut. Penentuan thresholding dengan pendekatan fungsi eksponensial terhadap histogram citra
METODE TRESHOLDING CITRA KOMPUTER BERDASARKAN HISTOGRAM CITRA: Pendekatan Fungsi Eksponensial
lihat pdf</p
RETRACTED: Comparison of running time between C4.5 and k-nearest neighbor (k-NN) algorithm on deciding mainstay area clustering
RETRACTED
Following a rigorous, carefully concerns and considered review of the article published in International Journal of Advances in Intelligent Informatics to article entitled “Comparison of running time between C4.5 and k-nearest neighbor (k-NN) algorithm on deciding mainstay area clustering” Vol 2, No 1, pp. 1-6, March 2016, DOI: https://doi.org/10.26555/ijain.v2i1.49.
This paper has been found to be in violation of the International Journal of Advances in Intelligent Informatics Publication principles and has been retracted.
The article contained redundant material, the editor investigated and found that the paper published in IOSR Journal of Computer Engineering (IOSR - JCE), Vol. 18, No. 2 (Mar-April 2016), pp. 86-92, 2016, DOI: http://doi.org/10.9790/0661-1802048692, URL: http://www.iosrjournals.org/iosr-jce/papers/Vol18-issue2/Version-4/K1802048692.pdf entitled "AnalysisofC4.5 andK-Nearest Neighbor(KNN)MethodonAlgorithmofClusteringForDeciding Mainstay Area".
The document and its content has been removed from International Journal of Advances in Intelligent Informatics, and reasonable effort should be made to remove all references to this article
Algorithms of the Combination of Compiler Optimization Options for Automatic Performance Tuning
Optimalisasi penjadualan multi constraint menggunakan logika fuzzy = Multi Constraint Scheduling Optimization Using Fuzzy Logic
Scheduling problems are often modeled as source of from problems which must be done by paying attention a number of definition which have been known to get resulth of best.
In this paper describes extension of usage from Tabu Search for special case of the class of scheduling problem in Faculty of MIPA Gadjah Mada University in the form of Fuzzy Tabu Search. Core of from scheduling problem, how to schedule some components which consist of students, lecturers, times and rooms by paying attention a number of certain condition and definition.
A number of rule going into effect about scheduling class in Faculty of MIPA and additional order which in temporary character are grouped transient to become 2 parts of that are hard constraint and soft constraint. Time used to get valid schedule much more quickly by using Fuzzy Tabu Search algorithm compared to the way of modestly.
Keywords : scheduling, hard constraint, soft constraint, fuzzy tabu searc
Going Beyond Counting First Authors in Author Co-citation Analysis
The present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
- …
