Yazılım Mühendisliği Bölümü Yayın Koleksiyonu

Permanent URI for this collectionhttps://hdl.handle.net/20.500.12416/2147

Browse

Now showing 1 - 5 of 5

Citation - WoS: 1
Citation - Scopus: 4
A Comparative Evaluation Of Popular Search Engines On Finding Turkish Documents For A Specific Time Period
(Univ Osijek, Tech Fac, 2017) Bitirim, Yiltan; Görür, Abdül Kadir; Gorur, Abdul Kadir; 107251; Bilgisayar Mühendisliği
This study evaluates the popular search engines, Google, Yahoo, Bing, and Ask, on finding Turkish documents by comparing their current performances with their performances measured six years ago. Furthermore, the study reveals the current information retrieval effectiveness of the search engines. First of all, the Turkish queries were run on the search engines separately. Each retrieved document was classified and precision ratios were calculated at various cut-off points for each query and engine pair. Afterwards, these ratios were compared with the six years ago ratios for the evaluations. Besides the descriptive statistics, Mann-Whitney U and Kruskal-Wallis H statistical tests were used in order to find out statistically significant differences. All search engines, except Google, have better performance today. Bing has the most increased performance compared to six years ago. Nowadays: Yahoo has the highest mean precision ratios at various cut-off points; all search engines have their highest mean precision ratios at cut-off point 5; dead links were encountered in Google, Bing, and Ask; and repeated documents were encountered in Google and Yahoo.
Citation - WoS: 0
Citation - Scopus: 0
A Two-Stage Matching Method for Multi-Component Shapes
(Univ Suceava, Fac Electrical Eng, 2015) Hassanpour, Reza; Hassanpour, Reza; Yazılım Mühendisliği
In this paper a shape matching algorithm for multiple component objects has been proposed which aims at matching shapes by a two-stage method. The first stage extracts the similarity features of each component using a generic shape representation model. The first stage of our shape matching method normalizes the components for orientation and scaling, and neglects minor deformations. In the second stage, the extracted similarity features of the components are combined with their relative spatial characteristics for shape matching. Some important application areas for the proposed multi-component shape matching are medical image registration, content based medical image retrieval systems, and matching articulated objects which rely on the a-priori information of the model being searched. In these applications, salient features such as vertebrae or rib cage bones can be easily segmented and used. These features however, show differences from person to person on one hand and similarities at different cross-sectional images of the same examination on the other hand. The proposed method has been tested on articulated objects, and reliable registration of 3-dimensional abdominal computed tomography images.
Citation - WoS: 1
Citation - Scopus: 2
Identifying criminal organizations from their social network structures
(Tubitak Scientific & Technological Research Council Turkey, 2019) Cinar, Muhammet Serkan; Sever, Hayri; Genc, Burkay; Sever, Hayri; 11916; Bilgisayar Mühendisliği
Identification of criminal structures within very large social networks is an essential security feat. By identifying such structures, it may be possible to track, neutralize, and terminate the corresponding criminal organizations before they act. We evaluate the effectiveness of three different methods for classifying an unknown network as terrorist, cocaine, or noncriminal. We consider three methods for the identification of network types: evaluating common social network analysis metrics, modeling with a decision tree, and network motif frequency analysis. The empirical results show that these three methods can provide significant improvements in distinguishing all three network types. We show that these methods are viable enough to be used as supporting evidence by security forces in their fight against criminal organizations operating on social networks.
Citation - WoS: 2
Multiple Description Scalable Coding for Video Transmission over Unreliable Networks
(Springer-verlag Berlin, 2009) Choupani, Roya; Wong, Stephan; Tolun, Mehmet R.; 1863
Developing real time multimedia applications for best effort networks such as the Internet requires prohibitions against jitter delay and frame loss. This problem is further complicated in wireless networks as the rate of frame corruption or loss is higher in wireless networks while they generally have lower data rates compared to wired networks. On the other hand, variations of the bandwidth and the receiving device characteristics require data rate adaptation capability of the coding method. Multiple Description Coding (MDC) methods are used to solve the jitter delay and frame loss problems by making the transmitted data more error resilient, however, this results in reduced data rate because of the added overhead. MDC methods do not address the bandwidth variation and receiver characteristics differences. In this paper a new method based on integrating MDC and the scalable video coding extension of H.264 standard is proposed. Our method can handle both jitter delay and frame loss, and data rate adaptation problems. Our method utilizes motion compensating scheme and, therefore, is compatible with the current video coding standards such as MPEG-4 and H.264. Based on the simulated network conditions, our method shows promising results and we have achieved tip to 36dB for average Y-PSNR.
Citation - WoS: 2
Citation - Scopus: 3
Single-Machine Scheduling of Indivisible Multi-Operatıon Jobs
(Southern African inst industrial Engineering, 2019) Çetinkaya, Ferda Can; Cetinkaya, F. C.; Catmakas, H. A.; Görür, Abdül Kadir; Gorur, A. K.; 50129; 57532; 107251; Endüstri Mühendisliği; Bilgisayar Mühendisliği
This paper considers a single-machine scheduling problem of multi-operation jobs where each job consists of several operations processed contiguously, rather than being intermingled with the operations of different jobs. That is, the jobs are indivisible. A sequence-independent setup is required if the machine switches from one operation to another. However, no setup is necessary before the first operation of a job if this first operation is the same as the last operation of the immediately previous job. A job is complete when all of its operations have been processed. We investigate the problem for two cases. Makespan, which is the time needed to complete all jobs, is minimised in the first case; whereas the total completion time, which is the sum of the job completion times, is minimised in the second case. We show that the makespan problem is solvable in polynomial time. For the problem of minimising total completion time, we develop a mixed integer linear programming (MILP) model, which is capable of solving small and medium-sized problem instances optimally, and obtain a very small gap between the solution found and the best possible solution for the unsolved large-sized problem instances.

Browse

Browsing Yazılım Mühendisliği Bölümü Yayın Koleksiyonu by Scopus Q "Q3"