You limited your search to:

  Partner: UNT College of Engineering
 Resource Type: Article
 Collection: UNT Scholarly Works
Agent-based Distance Vector Routing: A Resource Efficient and Scalable approach to Routing in Large Communication Networks

Agent-based Distance Vector Routing: A Resource Efficient and Scalable approach to Routing in Large Communication Networks

Date: March 25, 2002
Creator: Amin, Kaizar A. & Mikler, Armin R.
Description: This article discusses agent-based distance vector routing. Abstract: In spite of the ever-increasing availability of computation and communication resources in modern networks, the overhead associated with network management protocols, such as traffic control and routing, continues to be an important aspect in the design of new methodologies. Resource efficiency of such protocols has become even more prominent with the recent developments of wireless and ad-hoc networks, which are marked by much more severe resource constraints in terms of bandwidth, memory, and computational capabilities. This paper presents an Agent-Based approach to Distance Vector Routing that addresses these resources constraints. Agent-Based Distance Vector Routing (ADVR) is a resource efficient implementation of Distance Vector Routing that is fault tolerant and scales well for large networks. ADVR draws upon some basic biologically inspired principles to facilitate coordination among the mobile agents that implement the routing task. Specifically, simulated pheromones are used to control the movement of agents within the network and to dynamically adjust the number of agents in the population. The behavior of ADVR is analyzed and compared to that of traditional Distance Vector Routing.
Contributing Partner: UNT College of Engineering
Architecture Support for 3D Obfuscation

Architecture Support for 3D Obfuscation

Date: May 2006
Creator: Gomathisankaran, Mahadevan & Tyagi, Akhilesh
Description: This article discusses architecture support for 3D obfuscation. Abstract: Software obfuscation is defined as a transformation of a program P into T(P) such that the whitebox and blackbox behaviors of T(P) are computationally indistinguishable. However, robust obfuscation is impossible to achieve with the existing software only solutions. This results from the power of the adversary model in DRM which is significantly more than in the traditional security scenarios. The adversary has complete control of the computing node - supervisory privileges along with the full physical as well as architectural object observational capabilities. In essence, this makes the operating system (or any other layer around the architecture) untrustworthy. Thus the trust has to be provided by the underlying architecture. In this paper, the authors develop an architecture to support 3-D obfuscation through the use of well known cryptographic methods. The three dimensional obfuscation hides the address sequencing, the contents associated with an address, and the temporal reuse of address sequences such as in loops (or the second order address sequencing). The software is kept as an obfuscated file system image statically. Moreover, its execution traces are also dynamically obfuscated along all the three dimensions of address sequencing, contents and second order ...
Contributing Partner: UNT College of Engineering
Classifying genes to the correct Gene Ontology Slim term in Saccharomyces cerevisiae using neighbouring genes with classification learning

Classifying genes to the correct Gene Ontology Slim term in Saccharomyces cerevisiae using neighbouring genes with classification learning

Date: May 28, 2010
Creator: Amthauer, Heather A. & Tsatsoulis, C. (Costas), 1962-
Description: This article discusses classifying genes to the correct Gene Ontology Slim term in Saccharomyces cerevisiae using neighbouring genes with classification learning. Abstract: Background: There is increasing evidence that gene location and surrounding genes influence the functionality of genes in the eukaryotic genome. Knowing the Gene Ontology Slim terms associated with a gene gives the authors insight into a gene's functionality by informing the authors how its gene product behaves in a cellular context using three different ontologies: molecular function, biological process, and cellular component. In this study, the authors analyzed if they could classify a gene in Saccharomyces cerevisiae to its correct Gene Ontology Slim term using information about its location in the genome and information from its nearest-neighbouring genes using classification learning. Results: The authors performed experiments to establish that the MultiBoostAB algorithm using the J48 classifier could correctly classify Gene Ontology Slim terms of a gene given information regarding the gene's location and information from its nearest-neighbouring genes for training. Different neighbourhood sizes were examined to determine how many nearest neighbours should be included around each gene to provide better classification rules. The authors' results show that by just incorporating neighbour information from each gene's two-nearest neighbours, the ...
Contributing Partner: UNT College of Engineering
Open Mind Word Expert: Creating Large Data Collections with Web Users' Help

Open Mind Word Expert: Creating Large Data Collections with Web Users' Help

Date: June 2002
Creator: Chklovski, Timothy & Mihalcea, Rada
Description: This article discusses Open Mind Word Expert (OMWE). The World Wide Web has both exacerbated the need and provided an opportunity for creating automatic tools for language processing. To tap the full potential of the Web, we need accurate information extraction, summarization and navigation technologies. None of these can come close to human-level performance without advancing the state of the art on how machines "make sense" of the text they are to process. One notoriously difficult problem in understanding text has been word sense disambiguation (WSD). Ambiguity is very common (especially among the most common words - think about "table", or "computer fan"), but people are so good at figuring it out from context that usually they do not even notice it. OMWE is a system that aims to tap people's ability to disambiguate words and to give computers the benefit of people's knowledge. Any Web user can visit the OMWE site and contribute some knowledge about the meanings of given words in given sentences. As a result, OMWE creates large sense-tagged corpora that can be used to build automatic WSD systems.
Contributing Partner: UNT College of Engineering
Networks and Natural Language Processing

Networks and Natural Language Processing

Date: September 2008
Creator: Radev, Dragomir R. & Mihalcea, Rada
Description: This article discusses networks and natural language processing. Over the last few years, a number of areas of natural language processing have begun applying graph-based techniques. These include, among others, text summarization, syntactic parsing, word-sense disambiguation, ontology construction, sentiment and subjectivity analysis, and text clustering. In this paper, the authors present some of the most successful graph-based representations and algorithms used in language processing and try to explain how and why they work
Contributing Partner: UNT College of Engineering
A Novel Space Partitioning Algorithm to Improve Current Practices in Facility Placement

A Novel Space Partitioning Algorithm to Improve Current Practices in Facility Placement

Date: March 2011
Creator: Jimenez, Tamara; Mikler, Armin R. & Tiwari, Chetan
Description: This article discusses a novel space partitioning algorithm to improve current practices in facility placement. In the presence of naturally occurring and man-made public health threats, the feasibility of regional bio-emergency contingency plans plays a crucial role in the mitigation of such emergencies. While the analysis of in-place response scenarios provides a measure of quality for a given plan, it involves human judgement to identify improvements in plans that are otherwise likely to fail. Since resource constraints and government mandates limit the availability of service provided in case of an emergency, computational techniques can determine optimal locations for providing emergency response assuming that the uniform distribution of demand across homogeneous resources will yield and optimal service outcome. This paper presents an algorithm that recursively partitions the geographic space into sub-regions while equally distributing the population across the partitions. For this method, the authors have proven the existence of an upper bound on the deviation from the optimal population size for sub-regions.
Contributing Partner: UNT College of Engineering
On B.S.E and B.S.ET for the Engineering Profession

On B.S.E and B.S.ET for the Engineering Profession

Date: 2010
Creator: Barbieri, Enrique; Attarzadeh, Farrokh; Pascali, Raresh; Shireen, Wajiha & Fitzgibbon, William
Description: This article discusses baccalaureate programs for the engineering profession. An educational model for ABET-accredited baccalaureate programs in Engineering (E) and in Engineering Technology (ET) is proposed whereby all students inclined to pursue an engineering career would first complete two years of a 4-year ET program. By the end of the sophomore year, those students interested and skilled enough to follow a more theoretical or conceive-and-design side of an engineering career would go on to complete a degree in perhaps two to four additional years in a department that offered E degrees. The 4-year option would satisfy the Department of Education definition of a 6-year first professional degree. On the other hand, those students interested and skilled enough to follow a more applied or implement-and-operate side of an engineering career would opt to complete a degree in two additional years in a department that offered ET degrees. The model offers clearly defined options to students interested in an industry-based engineering profession two to four years after graduation where conceive-, design-, implement- and operate-tasks are assigned. If adopted, the model will result in several benefits including: (1) improved program marketing; (2) increased enrollment and retention rates; and (3) improved human and facility ...
Contributing Partner: UNT College of Engineering
Mobility-Based CAC Algorithm for Arbitrary Call-Arrival Rates in CDMA Cellular Systems

Mobility-Based CAC Algorithm for Arbitrary Call-Arrival Rates in CDMA Cellular Systems

Date: March 2005
Creator: Akl, Robert G.; Hegde, Manju V. & Naraghi-Pour, Mort
Description: This paper presents a novel approach for designing a call-admission control (CAC) algorithm for code-division multiple-access (CDMA) networks with arbitrary call-arrival rates. The design of the CAC algorithm uses global information; it incorporates the call-arrival rates and the user mobilities across the network and guarantees the users' quality of service (QoS) as well as prescribed blocking probabilities. On the other hand, its implementation in each cell uses local information; it only requires the number of calls currently active in that cell. The authors present several cases for a nontrivial network topology where their CAC algorithm guarantees QoS and blocking probabilities while achieving significantly higher throughput than that achieved by traditional techniques. The authors also calculate the network capacity, i.e., the maximum throughput for the entire network, for prespecified blocking probabilities and QoS requirements.
Contributing 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
Parallel Texts

Parallel Texts

Date: September 2005
Creator: Mihalcea, Rada & Simard, Michel
Description: This article discusses parallel texts. Parallel texts have become a vital element for natural language processing. The authors present a panorama of current research activities related to parallel texts, and offer some thoughts about the future of this rich field of investigation.
Contributing Partner: UNT College of Engineering
FIRST PREV 1 2 3 NEXT LAST