You limited your search to:

  Partner: UNT College of Engineering
 Resource Type: Article
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
Document Indexing using Named Entities

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
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 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
Evaluation Results of an E and ET Education Forum

Evaluation Results of an E and ET Education Forum

Date: 2011
Creator: Ramos, Miguel; Chapman, Lauren; Cannady, Mac & Barbieri, Enrique
Description: This article discusses evaluation results of an Engineering (E) and Engineering Technology (ET) education forum. Abstract: Under a two-year Department of Education FIPSE grant, the College of Technology at the University of Houston hosted a two-day forum in spring 2010 to explore a variety of issues related to E and ET education. A central focus to these discussions revolved around whether E and ET exist as separate fields or whether there was value in thinking about them as part of a continuum. The CDIO (conceive-design-implement-operate) model was used as a framework for thinking about these two knowledge areas as facets of an overarching engineering profession, where the majority of E and ET graduates flow to the middle of CDIO and engage in "design-implement" tasks within three to five years after graduation. Several implications of a continuum-based framework for engineering education were debated within the context of two alternative curricular approaches. The first approach envisions a two-year curriculum in which E and ET students enroll in a set of common technical core courses. At the end of the second year, students would make a well-educated decision to become either engineering or engineering technology majors, subsequently completing a BS degree. The second ...
Contributing Partner: UNT College of Engineering
Improving the search on the Internet by using WordNet and lexical operators

Improving the search on the Internet by using WordNet and lexical operators

Date: July 21, 1999
Creator: Moldovan, Dan I. & Mihalcea, Rada, 1974-
Description: This article discusses improving the search on the internet by using WordNet and lexical operators. Abstract: This paper presents a natural language interface system to an Internet search engine that provides the following improvements: (1) accepts natural language (English) questions, (2) expands the query, based on a word sense disambiguation method, and (3) uses a new lexical operator to post-process the documents retrieved for extracting only the part of a document that is relevant to a query. The system was tested on 100 queries of which 50 were adopted from the TIPSTER topics collection, provided at the 6th Text Retrieval Conference (TREC-6) and 50 were selected from among the queries submitted by users to an existing Web search engine. The results obtained demonstrate a substantial increase in both the precision and the percentage of queries answered correctly, while the amount of text presented to the user is reduced in comparison with the current Internet search engine technology.
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
FIRST PREV 1 2 3 NEXT LAST