Cross-lingual Semantic Relatedness Using Encyclopedic Knowledge
Date: August 2009
Creator: Hassan, Samer & Mihalcea, Rada, 1974-
Description: This paper discusses cross-lingual semantic relatedness using encyclopedic knowledge. Abstract: In this paper, we address the task of cross-lingual semantic relatedness. We introduce a method that relies on the information extracted from Wikipedia, by exploiting the interlanguage links available between Wikipedia versions in multiple languages. Through experiments performed on several language pairs, we show that the method performs well, with a performance comparable to monolingual measures of relatedness.
Contributing Partner: UNT College of Engineering
Permallink:digital.library.unt.edu/ark:/67531/metadc31012/
Current Research in Wireless at UNT
Date: October 2004
Creator: Akl, Robert G.
Description: This presentation discusses wireless networks, access point selections, traffic balancing, multi-cell CDMA, user distribution modeling, and call admission control.
Contributing Partner: UNT College of Engineering
Permallink:digital.library.unt.edu/ark:/67531/metadc30930/
The Decomposition of Human-Written Book Summaries
Date: March 2009
Creator: Ceylan, Hakan & Mihalcea, Rada, 1974-
Description: In this paper, the authors evaluate the extent to which human-written book summaries can be obtained through cut-and-paste operations from the original book. The authors analyze the effect of the parameters involved in the decomposition algorithm, and highlight the distinctions in coverage obtained for different summary types.
Contributing Partner: UNT College of Engineering
Permallink:digital.library.unt.edu/ark:/67531/metadc31018/
Document Indexing using Named Entities
Date: January 2001
Creator: Mihalcea, Rada, 1974- & Moldovan, Dan I.
Description: This article discusses document indexing using named entities. Abstract: Current text indexing and retrieval techniques have their roots in the field of Information Retrieval where the task is to extract documents that best match a query. With an ever increasing number of documents available due to the easy access through the Internet, the challenge is to provide users with concise and relevant information. The authors are proposing here a novel, yet simple approach, which indexes the named entities in the documents, such as to improve the relevance of documents retrieved. Experiments performed in finding information related to a set of 75 input questions, from a large collection of 125,000 documents, show that this new technique reduces the number of retrieved documents by a factor of 2, while still retrieving the relevant documents.
Contributing Partner: UNT College of Engineering
Permallink:digital.library.unt.edu/ark:/67531/metadc83311/
Dynamic Agent Population in Agent-Based Distance Vector Routing
Date: August 2002
Creator: Amin, Kaizar A. & Mikler, Armin R.
Description: This paper discusses dynamic agent population in agent-based distance vector routing. Abstract: The Intelligent mobile agent paradigm can be applied to a wide variety of intrinsically parallel and distributed applications. Network routing is one such application that can be mapped to an agent-based approach. The performance of any agent-based system will depend on its agent population. Although a lot of research has been conducted on agent-based systems, little consideration has been given to the importance of agent population in dynamic networks. A large number of constituent agents can increase the resource overhead of the system, thereby impeding the overall performance of the network. Hence, it is imperative to find the optimal number of agents in the system that would maximize the efficiency of the agent-based mechanism in the network. This optimal value cannot be determined manually, thereby emphasizing the need for an adaptive approach that manipulates the number of agents in the system based on its resource availability. This paper discusses an agent-based approach to Distance Vector Routing, referred as Agent-based Distance Vector Routing and also describes an adaptive approach controlling the number of agents in the network using pheromones and discusses their limitations.
Contributing Partner: UNT College of Engineering
Permallink:digital.library.unt.edu/ark:/67531/metadc132968/
Dynamic Channel Assignment in IEEE 802.11 Networks
Date: March 2007
Creator: Akl, Robert G. & Arepally, Anurag
Description: This paper discusses dynamic channel assignment in IEEE 802.11 networks. Abstract: We design a dynamic channel assignment algorithm for IEEE 802.11 wireless networks. Our algorithm assigns channels dynamically in a way that minimizes channel interference generated by neighboring access points (APs) on a reference access point, resulting in higher throughput. We implement and simulate their algorithm using two versions (1: pick randomly 2: pick first) and different number of APs (4, 9, 16, and 25). Analysis of this algorithm shows an improvement by a factor of 4 (by lowering the total interference on an AP by 6 dBm on average) over default settings of having all APs use the same channel. As the number of APs is increased in a given service area, dynamic channel assignment becomes crucial; otherwise overlapping channel interference becomes a limiting factor.
Contributing Partner: UNT College of Engineering
Permallink:digital.library.unt.edu/ark:/67531/metadc30837/
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
Permallink:digital.library.unt.edu/ark:/67531/metadc132993/
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
Permallink:digital.library.unt.edu/ark:/67531/metadc30846/
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
Permallink:digital.library.unt.edu/ark:/67531/metadc30826/
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
Permallink:digital.library.unt.edu/ark:/67531/metadc94293/