Browsing Faculty of Engineering by Title
Now showing items 624-643 of 2303
-
F-Shaped Monopole Antenna
(IEEE, 2017)In this paper, effects of F antenna arm length on the frequency, gain and s11 values are studied. The arms and the total length of the F determine the resonance frequency of the antenna. The inverted F shaped antennas are ... -
Facile synthesis of 2D Zn(II) coordination polymer and its crystal structure, selective removal of methylene blue and molecular simulations
(Elsevier, 2017)A new coordination polymer {[Zn(μ3-ppda)(H2O)(μ-bpa)Zn(μ-ppda)(μ-bpa)]·4H2O}n (1) (ppda = 1,4-phenylenediacetate, bpa = 1,2-bis(4-pyridyl)ethane) has been synthesized by microwave-assisted reaction and characterized by ... -
Fair-fixture: minimizing carry-over effects in football leagues
(American Institute of Mathematical Sciences, 2019-10)We study a sports scheduling problem with the objective of minimizing carry-over effects in round robin tournaments. In the first part, focusing on tournaments that allow minimum number of breaks (at most one) for each ... -
Fall detection for elderly people using depth video data obtained by kinect
(2013-08)Automatic detection of unusual events such as falls is very important especially for elderly people living alone. Real-time detection of these events can reduce the health risks associated with a fall. There has been a ... -
FAS: introducing a service for avoiding faults in composite services
(Springer Science+Business Media, 2012)In service-oriented architectures, composite services depend on a set of partner services to perform the required tasks. These partner services may become unavailable due to system and/or network faults, leading to an ... -
Fashion image retrieval with capsule networks
(IEEE, 2019)In this study, we investigate in-shop clothing retrieval performance of densely-connected Capsule Networks with dynamic routing. To achieve this, we propose Triplet-based design of Capsule Network architecture with two ... -
Fast and efficient circuit topologies for finding the maximum of n k-bit numbers
(IEEE, 2014-08-01)Finding the value and/or index of the maximum (or minimum) element of a set of n numbers (each with k-bits) is a fundamental arithmetic operation and is needed in many applications. This paper proposes several maximum-finder ... -
Fast and efficient implementation of lightweight crypto algorithm PRESENT on FPGA through processor instruction set extension
(IEEE, 2019)As Internet of Things (IoT) technology becomes widespread, the importance of information security increases. PRESENT algorithm is a major lightweight symmetric-key encryption algorithm for IoT devices. Compared to the ... -
A fast circuit topology for finding the maximum of n k-bit numbers
(IEEE, 2013)Finding the value and/or address (position) of the maximum element of a set of binary numbers is a fundamental arithmetic operation. Numerous systems, which are used in different application areas, require fast (low-latency) ... -
Fast incremental least square pose estimation for hardware implementation with rolling shutter camera
(IEEE, 2020-10-05)6 DoF position and orientation estimation is vital for many real-time applications. It is essential to meet low latency, high accuracy and reliability requirements, especially when used for real-time haptic feedback ... -
Fast multiplier generator for FPGAs with LUT based partial product generation and column/row compression
(Elsevier, 2017)We present a new parallel integer multiplier generator for FPGAs. It combines (i) a new Generalized Parallel Counter (GPC) grouping algorithm for column compression with (ii) a LUT based partial product generation, is (iii) ... -
Fast one- and two-pick fixed-priority selection and muxing circuits
(IEEE, 2016)Priority encoders and arbiters usually drive multiplexers (muxes). Latency optimization of priority encoders and multiplexer trees has usually been handled separately in the literature. However, in some applications with ... -
Fast parallel prefix logic circuits for n2n round-robin arbitration
(Elsevier, 2012-08)An n2n round-robin arbiter (RRA) searches its n inputs for a 1, starting from the highest-priority input. It picks the first 1 and outputs its index in one-hot encoding. RRA aims to be fair to its inputs and maintains ... -
Fast two-pick n2n round-robin arbiter circuit
(IEEE, 2012-06)A regular (one-pick) round-robin arbiter circuit picks one active requester (if any) out of n requesters. A two-pick round-robin arbiter selects up to two requesters. An n2n two-pick round-robin arbiter indicates the picked ... -
Fast, secure, and remote multiboot of FPGAs
(2012-09)The purpose of this thesis is to develop an efficient framework to implement secure FPGA-based (Field Programmable Gate Array) systems. An FPGA is a reconfigurable device that has the ability to adapt the hardware during ... -
Fast-decodable MIMO HARQ systems
(IEEE, 2015-05)This paper presents a comprehensive study on the problem of decoding complexity in a Multi-Input Multi-Output (MIMO) Hybrid Automatic Repeat reQuest (HARQ) system based on Space-Time Block Codes (STBCs). We show that there ... -
Fatigue behavior of friction stir welded joints of pure copper with ultra-fine grains
(Elsevier, 2015)In order to determine the long term durability of friction stir welded joints with ultra-fine grained microstructure, investigation of the mechanical response with specific emphasis on fatigue behaviour is critical. In ... -
Fatigue characteristics of continuous welded rails and the effect of residual stress on fatigue-ratchetting interaction
(Taylor & Francis, 2020-03-16)The importance of ratchetting-fatigue interaction is garnering interest due to complex failure mechanism of rail welds under cyclic loading. The objective of this paper is to investigate the fatigue characteristics of ... -
Fault masking as a service
(Wiley, 2014-07)In SOA, composite services depend on a set of partner services to perform their tasks. These partner services may become unavailable because of system and/or network faults, leading to an increased error rate for the ... -
Fault masking as a service
(2013-01)In service-oriented architectures, composite services depend on a set of partner services to perform their tasks. These partner services may become unavailable due to system and/or network faults, leading to an increased ...
Share this page
