You limited your search to:
Partner:
UNT College of Engineering
Decade:
2000-2009
Year:
2004
An Algorithm for Open Text Semantic Parsing
Date: August 2004
Creator: Shi, Lei & Mihalcea, Rada
Description: Abstract: This paper describes an algorithm for open text shallow semantic parsing. The algorithm relies on a frame dataset (FrameNet) and a semantic network (WordNet), to identify semantic relations between words in open text, as well as shallow semantic features associated with concepts in the text. Parsing semantic structures allows semantic units and constituents to be accessed and processed in a more meaningful way than syntactic parsing, moving the automation of understanding natural language text to a higher level.
Contributing Partner: UNT College of Engineering
Permallink:digital.library.unt.edu/ark:/67531/metadc30953/
Co-training and Self-training for Word Sense Disambiguation
Date: May 2004
Creator: Mihalcea, Rada, 1974-
Description: This paper investigates the application of co-training and self-training to word sense disambiguation. Optimal and empirical parameter selection methods for co-training and self-training are investigated, with various degrees of error reduction. A new method that combines co-training with majority voting is introduced, with the effect of smoothing the bootstrapping learning curves, and improving the average performance.
Contributing Partner: UNT College of Engineering
Permallink:digital.library.unt.edu/ark:/67531/metadc30955/
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/
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
Permallink:digital.library.unt.edu/ark:/67531/metadc30954/
Finding Semantic Associations on Express Lane
Date: May 2004
Creator: Nastase, Vivi & Mihalcea, Rada, 1974-
Description: This paper introduces a new codification scheme for efficient computation of measures in semantic networks. The scheme is particularly useful for fast computation of semantic associations between words and implementation of an informational retrieval operator for efficient search in semantic spaces. Other applications may also be possible.
Contributing Partner: UNT College of Engineering
Permallink:digital.library.unt.edu/ark:/67531/metadc30956/
Global versus Local Call Admission Control in CDMA Cellular Networks
Date: July 2004
Creator: Akl, Robert G. & Parvez, Asad
Description: This presentation discusses interference model impacts on capacity, global call admission controls, local call admission controls, and the differences in global versus local call admission controls.
Contributing Partner: UNT College of Engineering
Permallink:digital.library.unt.edu/ark:/67531/metadc30931/
Global versus Local Call Admission Control in CDMA Cellular Networks
Date: July 2004
Creator: Akl, Robert G. & Parvez, Asad
Description: This paper discusses global versus local call admission control. Abstract: We design and implement global and local CAC algorithms for CDMA networks, and compare their network throughput for various mobility scenarios. The global CAC algorithms is inherently optimized and uses global information in making every call admission decision; it yields the best possible performance but has an intensive computational complexity. The design of the local CAC algorithm uses global information but its implementation in each cell uses only local information; it only requires the number of calls currently active in that cell and thus is very simple to implement. We show that our optimized local CAC algorithm achieves almost the same performance as our global CAC algorithm for a given call arrival rate profile.
Contributing Partner: UNT College of Engineering
Permallink:digital.library.unt.edu/ark:/67531/metadc30816/
Graph-based Ranking Algorithms for Sentence Extraction, Applied to Text Summarization
Date: July 2004
Creator: Mihalcea, Rada, 1974-
Description: Abstract: This paper presents an innovative unsupervised method for automatic sentence extraction using graph-based ranking algorithms. We evaluate the method in the context of a text summarization task, and show that the results obtained compare favorably with previously published results on established benchmarks.
Contributing Partner: UNT College of Engineering
Permallink:digital.library.unt.edu/ark:/67531/metadc30957/
How to Hide Secrets from Operating System: Architecture Level Support for Dynamic Address Trace Obfuscation
Date: 2004
Creator: Gomathisankaran, Mahadevan & Tyagi, Akhilesh
Description: This technical report addresses how to hide secrets from an operating system. Abstract: The adversary model for digital rights management is much more powerful than for the traditional security scenarios. The adversary has complete control of the computing node - supervisory privileges, physical as well as architectural object observational capabilities. In essence, this makes the operating system (or any other layer around the architecture) itself the adversary. The repercussions of this observation are severe. It creates a need to "keep secrets" from the operating system. We argue for the need to keep secrets from the OS in hardware. This concept is demonstrated through architectural support for the obfuscation of dynamic address traces on the memory bus. The objective is to leak as little information about the executed program sequence as possible. This is done by handing over many of the virtual memory management responsibilities from the operating system to an architecturally isolated hardware black-box (VM black-box). The authors provide a detailed design for the VM blackbox and some microarchitecture level simulation derived performance data. We also describe a compiler directed prefetch scheme that uses both instruction and data prefetches to obfuscate the address traces on the address bus between on-chip ...
Contributing Partner: UNT College of Engineering
Permallink:digital.library.unt.edu/ark:/67531/metadc94282/
Impact of Interference Model on Capacity in CDMA Cellular Networks
Date: May 2004
Creator: Akl, Robert G. & Parvez, Asad
Description: This paper discusses an impact of interference model on capacity in CDMA cellular 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 distribution, the deviation can be tremendously large for non-uniform user distributions.
Contributing Partner: UNT College of Engineering
Permallink:digital.library.unt.edu/ark:/67531/metadc30817/