## Search

Now showing items 1-7 of 7

JavaScript is disabled for your browser. Some features of this site may not work without it.

AuthorTempone, Raul (4)Bagci, Hakan (3)Ulku, Huseyin Arda (3)Alouini, Mohamed-Slim (2)Haji Ali, Abdul Lateef (2)View MoreDepartment

Applied Mathematics and Computational Science Program (7)

Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division (7)
Electrical Engineering Program (7)

Physical Sciences and Engineering (PSE) Division (2)Beacon Development Company (1)View MoreSubjectCEM (1)Wireless (1)View MoreType
Poster (7)

Year (Issue Date)2017 (2)2016 (2)2015 (2)2014 (1)Item Availability
Open Access (7)

Now showing items 1-7 of 7

- List view
- Grid view
- Sort Options:
- Relevance
- Title Asc
- Title Desc
- Issue Date Asc
- Issue Date Desc
- Submit Date Asc
- Submit Date Desc
- Results Per Page:
- 5
- 10
- 20
- 40
- 60
- 80
- 100

Computation of Electromagnetic Fields Scattered From Dielectric Objects of Uncertain Shapes Using MLMC

Litvinenko, Alexander; Haji Ali, Abdul Lateef; Uysal, Ismail Enes; Ulku, Huseyin Arda; Oppelstrup, Jesper; Tempone, Raul; Bagci, Hakan (2016-01-06) [Poster]

Simulators capable of computing scattered fields from objects of uncertain shapes are highly useful in electromagnetics and photonics, where device designs are typically subject to fabrication tolerances. Knowledge of statistical variations in scattered fields is useful in ensuring error-free functioning of devices. Oftentimes such simulators use a Monte Carlo (MC) scheme to sample the random domain, where the variables parameterize the uncertainties in the geometry. At each sample, which corresponds to a realization of the geometry, a deterministic electromagnetic solver is executed to compute the scattered fields. However, to obtain accurate statistics of the scattered fields, the number of MC samples has to be large. This significantly increases the total execution time.
In this work, to address this challenge, the Multilevel MC (MLMC [1]) scheme is used together with a (deterministic) surface integral equation solver. The MLMC achieves a higher efficiency by balancing the statistical errors due to sampling of the random domain and the numerical errors due to discretization of the geometry at each of these samples. Error balancing results in a smaller number of samples requiring coarser discretizations. Consequently, total execution time is significantly shortened.

A Unified Simulation Approach for the Fast Outage Capacity Evaluation over Generalized Fading Channels

Rached, Nadhir B.; Kammoun, Abla; Alouini, Mohamed-Slim; Tempone, Raul (2016-01-06) [Poster]

The outage capacity (OC) is among the most important performance metrics of communication systems over fading channels. The evaluation of the OC, when equal gain combining (EGC) or maximum ratio combining (MRC) diversity techniques are employed, boils down to computing the cumulative distribution function (CDF) of the sum of channel envelopes (equivalently amplitudes) for EGC or channel gains (equivalently squared enveloped/ amplitudes) for MRC. Closed-form expressions of the CDF of the sum of many generalized fading variates are generally unknown and constitute open problems. We develop a unified hazard rate twisting Importance Sampling (IS) based approach to efficiently estimate the CDF of the sum of independent arbitrary variates. The proposed IS estimator is shown to achieve an asymptotic optimality criterion, which clearly guarantees its efficiency. Some selected simulation results are also shown to illustrate the substantial computational gain achieved by the proposed IS scheme over crude Monte Carlo simulations.

Ensemble Data Assimilation System for Forecasting the Red Sea Circulation

Toye, Habib; Zhan, Peng; Sana, Furrukh; Gapalakrishnan, Ganesh; Kartadikaria, Aditya R.; Hoteit, Ibrahim (2017-01-08) [Poster]

Minimum Delay Moving Object Detection

Lao, Dong; Sundaramoorthi, Ganesh (2017-01-08) [Poster]

We present a general framework and method for detection of an object in a video based on apparent motion. The object moves relative to background motion at some unknown time in the video, and the goal is to detect and segment the object as soon it moves in an online manner. Due to unreliability of motion between frames, more than two frames are needed to reliably detect the object. Our method is designed to detect the object(s) with minimum delay, i.e., frames after the object moves, constraining the false alarms. Experiments on a new extensive dataset for moving object detection show that our method achieves less delay for all false alarm constraints than existing state-of-the-art.

Litvinenko, Alexander; Haji Ali, Abdul Lateef; Uysal, Ismail Enes; Ulku, Huseyin Arda; Tempone, Raul; Bagci, Hakan; Oppelstrup, Jesper (2015-01-07) [Poster]

Simulators capable of computing scattered fields from objects of uncertain shapes are highly useful in electromagnetics and photonics, where device designs are typically subject to fabrication tolerances. Knowledge of statistical variations in scattered fields is useful in ensuring error-free functioning of devices. Oftentimes such simulators use a Monte Carlo (MC) scheme to sample the random domain, where the variables parameterize the uncertainties in the geometry. At each sample, which corresponds to a realization of the geometry, a deterministic electromagnetic solver is executed to compute the scattered fields. However, to obtain accurate statistics of the scattered fields, the number of MC samples has to be large.
This significantly increases the total execution time. In this work, to address this challenge, the Multilevel MC (MLMC [1]) scheme is used together with a (deterministic) surface integral equation solver. The MLMC achieves a higher efficiency by “balancing” the statistical errors due to sampling of the random domain and the numerical errors due to discretization of the geometry at each of these samples. Error balancing results in a smaller number of samples requiring coarser discretizations. Consequently, total execution time is significantly shortened.

An Efficient Simulation Method for Rare Events

Rached, Nadhir B.; Benkhelifa, Fatma; Kammoun, Abla; Alouini, Mohamed-Slim; Tempone, Raul (2015-01-07) [Poster]

Estimating the probability that a sum of random variables (RVs) exceeds a given threshold is a well-known challenging problem. Closed-form expressions for the sum distribution do not generally exist, which has led to an increasing interest in simulation approaches. A crude Monte Carlo (MC) simulation is the standard technique for the estimation of this type of probability. However, this approach is computationally expensive, especially when dealing with rare events. Variance reduction techniques are alternative approaches that can improve the computational efficiency of naive MC simulations. We propose an Importance Sampling (IS) simulation technique based on the well-known hazard rate twisting approach, that presents the advantage of being asymptotically optimal for any arbitrary RVs. The wide scope of applicability of the proposed method is mainly due to our particular way of selecting the twisting parameter. It is worth observing that this interesting feature is rarely satisfied by variance reduction algorithms whose performances were only proven under some restrictive assumptions. It comes along with a good efficiency, illustrated by some selected simulation results comparing the performance of our method with that of an algorithm based on a conditional MC technique.

Nyström-discretized Magnetic Field Integral Equation for 2D Electromagnetic Scattering

Al-Harthi, Noha A.; Ulku, Huseyin Arda; Yokota, Rio; Keyes, David E.; Bagci, Hakan (2014-05-04) [Poster]

The export option will allow you to export the current search results of the entered query to a file. Different formats are available for download. To export the items, click on the button corresponding with the preferred download format.

By default, clicking on the export buttons will result in a download of the allowed maximum amount of items. For anonymous users the allowed maximum amount is 50 search results.

To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export. The amount of items that can be exported at once is similarly restricted as the full export.

After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.