Publications without Fulltext
Permanent URI for this collectionhttps://hdl.handle.net/20.500.14288/3
Browse
5 results
Search Results
Publication Metadata only Automatic detection of road types from the third military mapping survey of Austria-Hungary historical map series with deep convolutional neural networks(IEEE-inst Electrical Electronics Engineers inc, 2021) N/A; N/A; Department of History; Can, Yekta Said; Gerrits, Petrus Johannes; Kabadayı, Mustafa Erdem; Resercher; Master Student; Faculty Member; Department of History; College of Social Sciences and Humanities; Graduate School of Social Sciences and Humanities; College of Social Sciences and Humanities; N/A; N/A; 33267With the increased amount of digitized historical documents, information extraction from them gains pace. Historical maps contain valuable information about historical, geographical and economic aspects of an era. Retrieving information from historical maps is more challenging than processing modern maps due to lower image quality, degradation of documents and the massive amount of non-annotated digital map archives. Convolutional Neural Networks (CNN) solved many image processing challenges with great success, but they require a vast amount of annotated data. for historical maps, this means an unprecedented scale of manual data entry and annotation. in this study, we first manually annotated the Third Military Mapping Survey of austria-Hungary historical map series conducted between 1884 and 1918 and made them publicly accessible. We recognized different road types and their pixel-wise positions automatically by using a CNN architecture and achieved promising results.Publication Metadata only Engine compartment UWB channel model for intravehicular wireless sensor networks(IEEE-Inst Electrical Electronics Engineers Inc, 2014) Department of Computer Engineering; N/A; Department of Electrical and Electronics Engineering; Demir, Utku; Baş, Celalettin Ümit; Ergen, Sinem Çöleri; Undergraduate Student; Master Student; Faculty Member; Department of Computer Engineering; Department of Electrical and Electronics Engineering; College of Engineering; Graduate School of Sciences and Engineering; College of Engineering; N/A; N/A; 7211Intravehicular wireless sensor network (IVWSN) is a cutting edge research topic that delivers cost reduction, assembly, and maintenance efficiency by removing the wiring harnesses within the vehicle and enables the integration of new sensors into the locations inside a vehicle where cable connection is not possible. Providing energy efficiency through the low-duty-cycle operation and high reliability by exploiting the large bandwidth, ultrawideband (UWB) has been determined to be the most appropriate technology for IVWSNs. We investigate the UWB channel model for IVWSNs within the engine compartment of a vehicle by collecting an extensive amount of data for 19 x 19 links for different types and conditions of the vehicle. These include a Fiat Linea with engine off, Fiat Linea with engine on, and Peugeot Bipper with engine off. The path-loss exponent is estimated to be around 3.5 without exhibiting much variation when the engine is turned on and for different types of vehicles. The power variation around the expected path loss has lognormal distribution with zero mean and standard deviation in the range of [5.5, 6.3] dB for different types of vehicles with almost no variation when the engine of the same vehicle is turned on. The clustering phenomenon in the power delay profile (PDP) is well represented by a modified Saleh-Valenzuela (SV) model. The interarrival times of the clusters are modeled using a Weibull distribution. The cluster-amplitude and ray-amplitude decay functions are represented with a dual-slope linear model with breakpoint around 26.6 and 5.5 ns, respectively. The parameters of the Weibull distribution and these dual-slope linear models do not vary significantly for different types and conditions of the vehicle. The variations of the observed PDPs around the SV model is well modeled by independent normal random variables with zero mean and with a variance independent of the delay bin, and the type and condition of the vehicle. We propose a simulation model for the UWB channel within the engine compartment based on these findings and validate it by comparing the received energy and root mean square (RMS) delay spread of the generated and observed PDPs.Publication Metadata only Inonymous: anonymous invitation-based system(Springer International Publishing Ag, 2017) N/A; Department of Computer Engineering; Boshrooyeh, Sanaz Taheri; Küpçü, Alptekin; PhD Student; Faculty Member; Department of Computer Engineering; Graduate School of Sciences and Engineering; College of Engineering; N/A; 168060In invitation-based systems, a user is allowed to join upon receipt of a certain number of invitations from the existing members. The system administrator approves the new membership if he authenticates the inviters and the invitations, knowing who is invited by whom. However, the inviter-invitee relationship is privacy-sensitive information and can be exploited for inference attacks: The invitee's profile (e.g., political view or location) might leak through the inviters' profiles. To cope with this problem, we propose Inonymous, an anonymous invitationbased system where the administrator and the existing members do not know who is invited by whom. We formally define and prove the inviter anonymity against honest but curious adversaries and the information theoretic unforgeability of invitations. Inonymous is efficiently scalable in the sense that once a user joins the system, he can immediately act as an inviter, without re-keying and imposing overhead on the existing members. We also present InonymouX, an anonymous cross-network invitation-based system where users join one network (e.g., Twitter) using invitations of members of another network (e.g., Facebook).Publication Metadata only Task allocation in volunteer computing networks under monetary budget constraints(Springer, 2015) Barla Cambazoglu, B.; Department of Computer Engineering; Department of Computer Engineering; Güler, Hüseyin; Özkasap, Öznur; PhD Student; Faculty Member; Department of Computer Engineering; College of Engineering; College of Engineering; N/A; 113507In volunteer computing networks, the peers contribute to the solution of a computationally intensive problem by freely providing their computational resources, i.e., without seeking any immediate financial benefit. In such networks, although the peers can set certain bounds on how much their resources can be exploited by the network, the monetary cost that the network brings to the peers is unclear. In this work, we propose a volunteer computing network where the peers can set monetary budgets, limiting the financial burden incurred on them due the usage of their computational resources. Under the assumption that the price of the electricity consumed by the peers has temporal variation, we show that our approach leads to an interesting task allocation problem, where the goal is to maximize the amount of work done by the peers without violating the monetary budget constraints set by them. We propose various heuristics as solution to the problem, which is NP-hard. Our extensive simulations using realistic data traces and real-life electricity prices demonstrate that the proposed techniques considerably increase the amount of useful work done by the peers, compared to a baseline technique.Publication Metadata only Scheduling in single-hop multiple access wireless networks with successive interference cancellation(IEEE-Inst Electrical Electronics Engineers Inc, 2014) N/A; N/A; Department of Electrical and Electronics Engineering; Kontik, Mehmet; Ergen, Sinem Çöleri; N/A; Faculty Member; Department of Electrical and Electronics Engineering; N/A; College of Engineering; N/A; 7211We study the optimal scheduling problem for minimizing the length of the schedule required to satisfy the traffic demands of the links in single-hop multiple access wireless networks using Successive interference Cancellation (SIC). We first formulate the optimal scheduling as a Linear Programming (LP) problem where each variable represents the time allocated to a subset of the links sorted according to their decoding order for SIC at the receiver. Since the LP formulation requires a high number of variables exponential in the decoding capability of the receiver, we propose a Column Generation Method (CGM) based heuristic algorithm. This algorithm is based on decomposing the original problem into Restricted Master Problem (RMP) and Pricing Problem (PP), and approximating the exponentially complex PP by a greedy heuristic algorithm. Compared to the CGM based heuristic algorithms previously proposed for minimum length scheduling problem in various types of networks, the formulation of the PP and the heuristic algorithm proposed for PP are different due to the requirement of including the decoding order of simultaneous transmissions in SIC based networks. We demonstrate via simulations that the proposed algorithm performs very close to the optimal LP formulation with runtime robust to the increasing number of the links and decoding capability of the receiver, and much smaller than that of the optimal algorithm.