You limited your search to:
Partner:
UNT College of Engineering
Decade:
2000-2009
Year:
2009
Collection:
UNT Scholarly Works
Combining Lexical Resources for Contextual Synonym Expansion
Date: 2009
Creator: Sinha, Ravi & Mihalcea, Rada, 1974-
Description: This paper discusses combining lexical resources for contextual synonym expansion. Abstract: In this paper, we experiment with the task of contextual synonym expansion, and compare the benefits of combining multiple lexical resources using both unsupervised and supervised approaches. Overall, the results obtained through the combination of several resources exceed the current state-of-the-art when selecting the best synonym for a given target word, and place second when selecting the top ten synonyms, thus demonstrating the usefulness of the approach.
Contributing Partner: UNT College of Engineering
Permallink:digital.library.unt.edu/ark:/67531/metadc31011/
Learning to Identify Educational Materials
Date: 2009
Creator: Hassan, Samer & Mihalcea, Rada, 1974-
Description: This paper discusses learning to identify educational materials. Abstract: In this paper, we explore the task of automatically identifying educational materials, by classifying documents with respect to their educative value. Through experiments carried out on a data set of manually annotated documents, we show that the generally accepted notion of a learning object's "educativeness" is indeed a property that can be reliably assigned through automatic classification.
Contributing Partner: UNT College of Engineering
Permallink:digital.library.unt.edu/ark:/67531/metadc31014/
The Lie Detector: Explorations in the Automatic Recognition of Deceptive Language
Date: 2009
Creator: Mihalcea, Rada, 1974- & Strapparava, Carlo, 1962-
Description: This paper discusses explorations in the automatic recognition of deceptive language. Abstract: In this paper, we present initial experiments in the recognition of deceptive language. We introduce three data sets of true and lying texts collected for this purpose, and the authors show that automatic classification is a viable technique to distinguish between truth and falsehood as expressed in language. We also introduce a method for class-based feature analysis, which sheds some light on the features that are characteristic for deceptive text.
Contributing Partner: UNT College of Engineering
Permallink:digital.library.unt.edu/ark:/67531/metadc31019/
Non-Uniform Grid-Based Coordinated Routing in Wireless Sensor Networks
Date: 2009
Creator: Akl, Robert G.; Kadiyala, Priyanka & Haidar, Mohamad
Description: This paper presents a non-uniform grid-based coordinated routing design in wireless sensor networks. The conditions leading to network partition and analysis of energy consumption that prolongs the network lifetime are studied. The authors focus on implementing routing in densely populated sensor networks. By maintaining constant values for parameters such as path loss exponent, receiver sensitivity and transmit power, and varying between uniform and non-uniform grids, we observe energy consumption patterns for each of the grid structures and infer from the network lifetime the better suited grids for uniformly and randomly deployed sensor nodes.
Contributing Partner: UNT College of Engineering
Permallink:digital.library.unt.edu/ark:/67531/metadc30848/
Non-Uniform Grid-Based Routing in Sensor Networks
Date: 2009
Creator: Akl, Robert G.; Kadiyala, Priyanka & Haidar, Mohamad
Description: This paper discusses non-uniform grid-based routing in sensor networks. A non-uniform grid-based coordinated routing design in wireless sensor networks is presented. The conditions leading to network partition and analysis of energy consumption that prolongs the network lifetime are studied. The authors implement routing in heavily populated sensor networks. By maintaining constant values for parameters such as path loss exponent, receiver sensitivity and transmit power, and varying between uniform and non-uniform grids, we observe energy consumption patters for each of the grid structures, and infer from the network lifetime the better suited grids for uniformly and randomly deployed sensor nodes.
Contributing Partner: UNT College of Engineering
Permallink:digital.library.unt.edu/ark:/67531/metadc30847/
User-Based Channel Assignment Algorithm in a Load-Balanced IEEE 802.11 WLAN
Date: 2009
Creator: Haidar, Mohamad; Al-Rizzo, Hussain M.; Chan, Yupo & Akl, Robert G.
Description: This article discusses a user-based channel assignment algorithm in a load-balanced IEEE 802.11 WLAN. A new load balancing algorithm is presented based on power management of Access Points (APs) to reduce congestion at hot spots in Wireless Local Area Networks (WLANs) and to assign channels to APs. The algorithm first finds the Most Congested Access Point (MCAP), then decreases its transmitted power in discrete steps, and the process continues until the users' assignment which leads to a high balance index is reached. A new mathematical programming formulation is then applied to assign channels to the APs such that the Signal-to-Interference Ratio (SIR) at the users' level is maximized. Results show that the algorithm is capable of reducing the overall congestion at hot spots in a WLAN and increases the SIR significantly for cases involving relatively large WLANs. In the process, network throughput is increased.
Contributing Partner: UNT College of Engineering
Permallink:digital.library.unt.edu/ark:/67531/metadc30851/
Robocamp: Encouraging Young Women to Embrace STEM
Date: February 2009
Creator: Akl, Robert G.; Keathly, David & Garlick, Ryan
Description: This presentation discusses Robocamp, a special summer camp that was created by the University of North Texas (UNT) Computer Science and Engineering department. Robocamp successfully promotes engineering among high school women.
Contributing Partner: UNT College of Engineering
Permallink:digital.library.unt.edu/ark:/67531/metadc30941/
Robocamp: Encouraging Young Women to Embrace STEM
Date: February 2009
Creator: Akl, Robert G. & Keathly, David
Description: This paper describes the efforts and results of a plan for actively recruiting students to undergraduate computer science and engineering programs at the University of North Texas (UNT). Such recruitment of students is critical to the country's efforts to increase the number of engineering professionals, and is a priority for the Computer Science and Engineering (CSE) Department at UNT.
Contributing Partner: UNT College of Engineering
Permallink:digital.library.unt.edu/ark:/67531/metadc30849/
Throughput Validation of an Advanced Channel Assignment Algorithm in IEEE 802.11 WLAN
Date: February 2009
Creator: Haidar, Mohamad; Al-Rizzo, Hussain M.; Chan, Yupo; Akl, Robert G. & Bouharras, Mohamad
Description: In this article, an enhanced channel-assignment algorithm at the Access Points (APs) of a Wireless Local Area Network (WLAN) is validated. The algorithm aims to maximize the Signal-to-Interference Ratio (SIR) at the user level in order to determine the appropriate channel at the APs. The initial channel assignment step at the APs is based on minimizing the total interference between APs. Based on this initial assignment, the SIR for each user is calculated. 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 user distribution and user load. Results show that the algorithm is capable of significantly increasing the SIR over the WLAN, which in turn should improve throughput. Therefore, the authors use OPNET simulation tool to construct several realistic scenarios in order to validate our results.
Contributing Partner: UNT College of Engineering
Permallink:digital.library.unt.edu/ark:/67531/metadc30850/
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/