You limited your search to:

  Partner: UNT College of Engineering
Dynamic intimate contact social networks and epidemic interventions

Dynamic intimate contact social networks and epidemic interventions

Date: 2008
Creator: Corley, Courtney; Mikler, Armin R.; Cook, Diane J., 1963- & Singh, Karan P.
Description: This article discusses dynamic intimate contact social networks and epidemic interventions. Abstract: Sexually transmitted diseases and infections are, by definition, transferred among intimate social settings. Although the circumstances under which these social settings are established and maintained may vary, the common prerequisite remains an intimate level of social atmosphere. For this reason, the development of sexually transmitted disease mathematical and computational models must utilize dynamic and evolving social network simulation. This paper presents DynSNIC (Dynamic Social Network of Intimate Contacts), a computational simulator created to embody the intimate dynamic and evolving social networks related to the transmission of sexually transmitted diseases and infections. DynSNIC's utilization by health professionals will facilitate evaluation of targeted intervention strategies and public health policies.
Contributing Partner: UNT College of Engineering
The Effect of an Enhanced Channel Assignment Algorithm on an IEEE 802.11 WLAN

The Effect of an Enhanced Channel Assignment Algorithm on an IEEE 802.11 WLAN

Date: December 2009
Creator: Haidar, Mohamad; Al-Rizzo, Hussain Mudhaffar Younis, 1957-; Akl, Robert G. & El-Bazzal, Zouhair
Description: This article discusses the effect of an enhanced channel assignment algorithm on an IEEE 802.11 WLAN. Abstract: In this paper, a channel-assignment algorithm at the Access Points (APs) of a Wireless Local Area Network (WLAN) is proposed in order to maximize Signal-to-Interference Ratio (SIR) at the user level. We start with an initial channel assignment based on minimizing the total interference between APs. Based on this assignment, we calculate the SIR for each user. Then, another channel assignment is performed based on maximizing the SIR at the users. The algorithm can be applied to any WLAN, irrespective of the users' and load distributions. Simulation results showed that the proposed algorithm is capable of significantly increasing the SIR over the WLAN, which in turn improves throughput. Finally, several scenarios were constructed using OPNET simulation tool to validate our results.
Contributing Partner: UNT College of Engineering
Effects of Call Arrival Rate and Mobility on Network Throughput in Multi-Cell CDMA

Effects of Call Arrival Rate and Mobility on Network Throughput in Multi-Cell CDMA

Date: June 1999
Creator: Hegde, Manju V.; Akl, Robert G. & Min, Paul S.
Description: This presentation discusses call arrival rate and mobility. The effect of call arrival rate on the capacity of a code-division multiple-access (CDMA) cellular network is evaluated. First the inter-cell and intra-cell interferences of every cell on every other cell are calculated for a given network topology. Then the capacity region for the number of simultaneous calls in every cell is defined for specified system parameters. This region is used to evaluate the new call blocking and handoff call blocking probabilities.
Contributing Partner: UNT College of Engineering
Effects of Interference on Capacity in Multi-Cell CDMA Networks

Effects of Interference on Capacity in Multi-Cell CDMA Networks

Date: March 2005
Creator: Akl, Robert G.; Parvez, Asad & Nguyen, Son
Description: This article discusses the effects of interference on capacity in multi-cell CDMA networks. Abstract: An overwhelming number of models in the literature use average interference for calculation of capacity of a CDMA network. In this paper, we calculate the actual per-user interference and analyze the effect of user-distribution on the capacity of a CDMA network. We show that even though the capacity obtained using average interference is a good approximation to the capacity calculated using actual interference for a uniform user distributions, the deviation can be tremendously large for non-uniform user distributions. We also present an analytical model for approximating the user distributions using 2-dimensional Gaussian distributions by determining the means and the standard deviations of the distributions for every cell. This allows us to calculate the inter-cell interference and the reverse-link capacity of the network. We compare their model with simulation results and show that it is fast and accurate enough to be used efficiently in the planning process of large CDMA networks.
Contributing Partner: UNT College of Engineering
Efficient Energy Saving Scheme for On-Chip Caches

Efficient Energy Saving Scheme for On-Chip Caches

Date: 2002
Creator: Gomathisankaran, Mahadevan & Somani, Arun
Description: This paper discusses efficient energy saving scheme for on-chip caches. Abstract: With the reduction in feature size the static power component, such as the leakage power, dominates the dynamic power consumption in the on-chip caches. It has been observed that all cache lines need not be kept alive at all times. Only a very few lines during a given window of time need to be actively powered from the footprint, i.e., they are accessed during that time. Earlier research has addressed the issue of how to determine the set of active lines and how long to keep them active (powered). Circuit techniques have also been developed to keep a cache line in low leakage state i.e., Drowsy State when the line is not being accessed or used. Such a cache is called drowsy cache. These circuit techniques try to achieve maximum reduction in the leakage power without losing the information content and with minimal performance penalty associated with power transitions. These techniques when used with optimal switching scheme, which decides when and what lines to drowse, results in maximum reduction in energy consumed. In this paper, the authors study the cache access pattern to evaluate them and arrive at an ...
Contributing Partner: UNT College of Engineering
An Efficient Non-Preemptive Real-Time Scheduling

An Efficient Non-Preemptive Real-Time Scheduling

Date: September 2005
Creator: Li, Wenming; Kavi, Krishna M. & Akl, Robert G.
Description: This paper discusses non-preemptive, real-time scheduling. Abstract: Traditional real-time systems are designed using preemptive scheduling and worst-case execution time estimates to guarantee the execution of high priority tasks. There is, however, an interest in exploring non-preemptive scheduling models for real-time systems, particularly for soft real-time multimedia applications. In this paper, we propose a new algorithm that uses multiple scheduling strategies. The goal of this research is to improve the success rate of the well-known Earliest Deadline First (EDF) approach even when the load on the system is very high. The approach, known as group-EDF (gEDF) is based on (dynamic) grouping of tasks with deadlines that are very close to each other, and using Shortest Job First (SJF) technique to schedule tasks within the group. We present results comparing gEDF and EDF using randomly generated tasks with varying execution times, release times, deadlines and tolerance to missing deadlines, under varying workloads. We believe that the grouping of tasks with similar deadlines and utilizing information other than deadlines (such as execution times, priorities or resource availability) for scheduling tasks within a group can lead to new and more efficient real-time scheduling algorithms.
Contributing Partner: UNT College of Engineering
Energy-Aware Routing and Hybrid Synchronization in Sensor Networks

Energy-Aware Routing and Hybrid Synchronization in Sensor Networks

Date: September 2007
Creator: Akl, Robert G.
Description: This presentation discusses the research of sensor synchronization, sensor grid routing, and voice over internet protocol (VoIP).
Contributing Partner: UNT College of Engineering
Enhanced Channel Assignment and Load Distribution in IEEE 802.11 WLANs

Enhanced Channel Assignment and Load Distribution in IEEE 802.11 WLANs

Date: November 2007
Creator: Al-Rizzo, Hussain Mudhaffar Younis, 1957-; Haidar, Mohamad; Akl, Robert G. & Chan, Yupo
Description: This paper discusses enhanced channel assignment and load distribution in IEEE 802.11 WLANs. Abstract: An algorithm to reduce congestion and balance users' load in IEEE 802.11b/g wireless local area networks (WLANs) is presented, which takes into account overlapping channel interference between access points (APs) and the signal-to-interference ratio (SIR) experienced by the users. After finding the best channel assignment at the APs, the algorithm then finds the most congested access point (MCAP). It reexamines the users' association with APS by minimizing the congestion at the MCAP. Simulation results show that the proposed algorithm is capable of significantly reducing the overall congestion in the WLAN while mitigating channel interference. Our algorithm has also been shown to be scalable and it performs well for networks of different topologies.
Contributing Partner: UNT College of Engineering
Enhancing the Undergraduate Research Experience in a Senior Design Context

Enhancing the Undergraduate Research Experience in a Senior Design Context

Date: June 2010
Creator: Attarzadeh, Farrokh; Barbieri, Enrique & Ramos, Miguel
Description: This paper discusses enhancing the undergraduate research experience in a senior design context. Abstract: This paper presents an instructional framework developed by the authors that engages senior students in a 5-credit Research and Development course incorporating project development, implementation, entrepreneurship, innovation, creativity, teamwork, and communication. The paper discusses the development and accomplishments of the course over the past four years in the context of the Quality Enhancement Plan (QEP) - an initiative at the University of Houston intended to encourage the development and enhancement of undergraduate research skills. The philosophy behind the course is to provide training and real world, small-scale project experience through the completion of a full-project lifecycle from conceptualization to prototype. Brief discussion of those projects that resulted in provisional patents, refereed journal publications, and conference presentations will be given. Some of the features of the course, such as University and industry guest speaker series and final project evaluation by the department's Industrial Advisory Board, leading professionals, faculty, technical staff and peers will be examined. The paper concludes by outlining a set of short term and long term goals for the future direction of the course.
Contributing Partner: UNT College of Engineering
An Evaluation Exercise for Romanian Word Sense Disambiguation

An Evaluation Exercise for Romanian Word Sense Disambiguation

Date: July 2004
Creator: Mihalcea, Rada, 1974-; Nastase, Vivi; Chklovski, Timothy A. (Timothy Anatolievich), 1977; Tatar, Doina; Tufis, Dan & Hristea, Florentina T.
Description: This paper discusses an evaluation exercise for Romanian word sense disambiguation. Abstract: This paper presents the task definition, resources, participating systems, and comparative results for a Romanian Word Sense Disambiguation task, which was organized as part of the SENSEVAL-3 evaluation exercise. Five teams with a total of seven systems were drawn to this task.
Contributing Partner: UNT College of Engineering