Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Security visualization (2)
- Web crawler (2)
- 4.311 Primal (1)
- AODV (1)
- Ad hoc network (1)
-
- Adder (1)
- Algorithm (1)
- Anomalies (1)
- Architecture (1)
- Assistive technology (1)
- Atomicity (1)
- Battlefiled Management Simulation (1)
- Best first crawler (1)
- Bioinformatics applications (1)
- BondFlow (1)
- CDMA2000 (1)
- Classification (1)
- Client (1)
- Cognitive psychology (1)
- Comparison Methods (1)
- Composition of web services (1)
- Cursor control system (1)
- DCT (1)
- Data Maping (1)
- Decision support system (1)
- Distributed systems (1)
- Domain based (1)
- Energy efficiency (1)
- Equivalence (1)
- Evaluation method (1)
Articles 1 - 24 of 24
Full-Text Articles in Entire DC Network
Structure Learning Of A Behavior Network For Context Dependent Adaptability, Ou Li
Structure Learning Of A Behavior Network For Context Dependent Adaptability, Ou Li
Computer Science Theses
One mechanism for an intelligent agent to adapt to substantial environmental changes is to change its decision making structure. Pervious work in this area has developed a context-dependent behavior selection architecture that uses structure change, i.e., changing the mutual inhibition structures of a behavior network, as the main mechanism to generate different behavior patterns according to different behavioral contexts. Given the important of network structure, this work investigates how the structure of a behavior network can be learned. We developed a structure learning method based on generic algorithm and applied it to a model crayfish that needs to survive in …
Qos Multimedia Multicast Routing: A Component Based Primal Dual Approach, Faheem Akhtar Hussain
Qos Multimedia Multicast Routing: A Component Based Primal Dual Approach, Faheem Akhtar Hussain
Computer Science Theses
The QoS Steiner Tree Problem asks for the most cost efficient way to multicast multimedia to a heterogeneous collection of users with different data consumption rates. We assume that the cost of using a link is not constant but rather depends on the maximum bandwidth routed through the link. Formally, given a graph with costs on the edges, a source node and a set of terminal nodes, each one with a bandwidth requirement, the goal is to find a Steiner tree containing the source, and the cheapest assignment of bandwidth to each of its edges so that each source-to-terminal path …
Toward A Heuristic Model For Evaluating The Complexity Of Computer Security Visualization Interface, Hsiu-Chung Wang
Toward A Heuristic Model For Evaluating The Complexity Of Computer Security Visualization Interface, Hsiu-Chung Wang
Computer Science Theses
Computer security visualization has gained much attention in the research community in the past few years. However, the advancement in security visualization research has been hampered by the lack of standardization in visualization design, centralized datasets, and evaluation methods. We propose a new heuristic model for evaluating the complexity of computer security visualizations. This complexity evaluation method is designed to evaluate the efficiency of performing visual search in security visualizations in terms of measuring critical memory capacity load needed to perform such tasks. Our method is based on research in cognitive psychology along with characteristics found in a majority of …
Scalable Proxy Architecture For Mobile And Peer-To-Peer Networks, Praveena Jayanthi
Scalable Proxy Architecture For Mobile And Peer-To-Peer Networks, Praveena Jayanthi
Computer Science Theses
The growth of wireless telecommunications has stipulated the interest for anywhere-anytime computing. The synergy between networking and mobility will engender new collaborative applications with mobile devices on heterogeneous platforms. One such middleware is “SYSTEM ON MOBILE DEVICES”, SYD developed by the Yamacraw Embedded Systems research team. This type of middleware is an opening step towards Peer-to-Peer mobile networks. This project envisioned collaborative applications among mobile devices and PDAs were used as servers. This thesis studies various existing architectures in mobile computing and their scalability issues. We also proposed new scalable flexible thick client proxy system FTCPS, an architecture suitable for …
An Agent Based Transaction Manager For Multidatabase Systems, Sugandhi Madiraju
An Agent Based Transaction Manager For Multidatabase Systems, Sugandhi Madiraju
Computer Science Theses
A multidatabase system (MDBMS) is a facility that allows users to access data located in multiple autonomous database management systems (DBMSs) at different sites. To ensure global atomicity for multidatabase transactions, a reliable global atomic commitment protocol is a possible solution. In this protocol a centralized transaction manager (TM) receives global transactions, submits subtransactions to the appropriate sites via AGENTS. An AGENT is a component of MDBS that runs on each site; AGENTS after receiving subtransactions from the transaction manager perform the transaction and send the results back to TM. We have presented a unique proof-of-concept, a JAVA application for …
Comparison Of Methods Used For Aligning Protein Sequences, Sangeetha Madangopal
Comparison Of Methods Used For Aligning Protein Sequences, Sangeetha Madangopal
Computer Science Theses
Comparing protein sequences is an essential procedure that has many applications in the field of bioinformatics. The recent advances in computational capabilities and algorithm design, simplified the comparison procedure of protein sequences from several databases. Various algorithms have emerged using state of the art approaches to match protein sequences based on structural and functional properties of the amino acids. The matching involves structural alignment, and this alignment may be global; comprising of the whole length of the protein, or local; comprising of the sub-sequences of the proteins. Families of related proteins are found by clustering sequence alignments. The frequency distributions …
A Characterization Of Wireless Network Interface Card Active Scanning Algorithms, Vaibhav Gupta
A Characterization Of Wireless Network Interface Card Active Scanning Algorithms, Vaibhav Gupta
Computer Science Theses
In this thesis, we characterize the proprietary active scanning algorithm of several wireless network interface cards. Our experiments are the first of its kind to observe the complete scanning process as the wireless network interface cards probe all the channels in the 2.4GHz spectrum. We discuss the: 1) correlation of channel popularity during active scanning and access point channel deployment popularity; 2) number of probe request frames statistics on each channel; 3) channel probe order; and 4) dwell time. The knowledge gained from characterizing wireless network interface cards is important for the following reasons: 1) it helps one understand how …
Dct Implementation On Gpu, Serpil Tokdemir
Dct Implementation On Gpu, Serpil Tokdemir
Computer Science Theses
There has been a great progress in the field of graphics processors. Since, there is no rise in the speed of the normal CPU processors; Designers are coming up with multi-core, parallel processors. Because of their popularity in parallel processing, GPUs are becoming more and more attractive for many applications. With the increasing demand in utilizing GPUs, there is a great need to develop operating systems that handle the GPU to full capacity. GPUs offer a very efficient environment for many image processing applications. This thesis explores the processing power of GPUs for digital image compression using Discrete cosine transform.
An Enhanced Algorithm To Find Dominating Set Nodes In Ad Hoc Wireless Networks, Naresh Nanuvala
An Enhanced Algorithm To Find Dominating Set Nodes In Ad Hoc Wireless Networks, Naresh Nanuvala
Computer Science Theses
A wireless ad hoc network is a collection of wireless mobile nodes forming a temporary network without the aid of any established infrastructure or centralized administration. A connection is achieved between two nodes through a single hop transmission if they are directly connected or multi-hop transmission if they are not. The wireless networks face challenges to form an optimal routing protocol. Some approaches are based on a dominating set, which has all the nodes either in the set or within its neighborhood. The proposed algorithm is an enhancement of the distributed algorithm proposed by Wu and Li. The simulation results …
A Domain Based Approach To Crawl The Hidden Web, Milan Pandya
A Domain Based Approach To Crawl The Hidden Web, Milan Pandya
Computer Science Theses
There is a lot of research work being performed on indexing the Web. More and more sophisticated Web crawlers are been designed to search and index the Web faster. But all these traditional crawlers crawl only the part of Web we call “Surface Web”. They are unable to crawl the hidden portion of the Web. These traditional crawlers retrieve contents only from surface Web pages which are just a set of Web pages linked by some hyperlinks and ignoring the hidden information. Hence, they ignore tremendous amount of information hidden behind these search forms in Web pages. Most of the …
64 X 64 Bit Multiplier Using Pass Logic, Shibi Thankachan
64 X 64 Bit Multiplier Using Pass Logic, Shibi Thankachan
Computer Science Theses
ABSTRACT Due to the rapid progress in the field of VLSI, improvements in speed, power and area are quite evident. Research and development in this field are motivated by growing markets of portable mobile devices such as personal multimedia players, cellular phones, digital camcorders and digital cameras. Among the recently popular logic families, pass transistor logic is promising for low power applications as compared to conventional static CMOS because of lower transistor count. This thesis proposes four novel designs for Booth encoder and selector logic using pass logic principles. These new designs are implemented and used to build a 64 …
Fuzzy Mouse Cursor Control System For Computer Users With Spinal Cord Injuries, Tihomir Surdilovic
Fuzzy Mouse Cursor Control System For Computer Users With Spinal Cord Injuries, Tihomir Surdilovic
Computer Science Theses
People with severe motor-impairments due to Spinal Cord Injury (SCI) or Spinal Cord Dysfunction (SCD), often experience difficulty with accurate and efficient control of pointing devices (Keates et al., 02). Usually this leads to their limited integration to society as well as limited unassisted control over the environment. The questions “How can someone with severe motor-impairments perform mouse pointer control as accurately and efficiently as an able-bodied person?” and “How can these interactions be advanced through use of Computational Intelligence (CI)?” are the driving forces behind the research described in this paper. Through this research, a novel fuzzy mouse cursor …
Inferring The Structure Of Signal Transduction Networks From Interactions Between Cellular Components And Inferring Haplotypes From Informative Snps, Kelly Anthony Westbrooks
Inferring The Structure Of Signal Transduction Networks From Interactions Between Cellular Components And Inferring Haplotypes From Informative Snps, Kelly Anthony Westbrooks
Computer Science Theses
Many problems in bioinformatics are inference problems, that is, the problem objective is to infer something based upon a limited amount of information. In this work we explore two different inference problems in bioinformatics. The first problem is inferring the structure of signal transduction networks from interactions between pairs of cellular components. We present two contributions towards the solution to this problem: an mixed integer program that produces and exact solution, and an implementation of an approximation algorithm in Java that was originally described by DasGupta et al. An exact solution is obtained for a problem instance consisting of real …
Ic2mpi: A Platform For Parallel Execution Of Graph-Structured Iterative Computations, Harnish Botadra
Ic2mpi: A Platform For Parallel Execution Of Graph-Structured Iterative Computations, Harnish Botadra
Computer Science Theses
Parallelization of sequential programs is often daunting because of the substantial development cost involved. Various solutions have been proposed to address this concern, including directive-based approaches and parallelization platforms. These solutions have not always been successful, in part because many try to address all types of applications. We propose a platform for parallelization of a class of applications that have similar computational structure, namely graph-structured iterative applications. iC2mpi is a unique proof-of-concept prototype platform that provides relatively easy parallelization of existing sequential programs and facilitates experimentation with static partitioning and dynamic load balancing schemes. We demonstrate with various generic application …
Implementation Of Vertical Handoff Algorithm Between Ieee802.11 Wlan And Cdma Cellular Network, Mary Narisetti
Implementation Of Vertical Handoff Algorithm Between Ieee802.11 Wlan And Cdma Cellular Network, Mary Narisetti
Computer Science Theses
Today’s wireless users expect great things from tomorrow’s wireless networks. These expectations have been fueled by hype about what the next generations of wireless networks will offer. The rapid increase of wireless subscribers increases the quality of services anytime, anywhere, and by any-media becoming indispensable. Integration of various networks such as CDMA2000 and wireless LAN into IP-based networks is required in these kinds of services, which further requires a seamless vertical handoff to 4th generation wireless networks. The proposed handoff algorithm between WLAN and CDMA2000 cellular network is implemented. The results of the simulation shows the behavior of the handoff …
An Automated Xpath To Sql Transformation Methodology For Xml Data, Sandeep Jandhyala
An Automated Xpath To Sql Transformation Methodology For Xml Data, Sandeep Jandhyala
Computer Science Theses
In this thesis we present an automated system that allows users to execute XPATH queries against an XML data source. The system exploits the shared-inlining mapping from XML to Relational data. At the core of the system is an XPATH to SQL transformation algorithm that produces corresponding SQL queries for a subset of XPATH. This approach allows one to utilize standard relational databases to store XML data. Given a DTD, the system creates appropriate relational tables based on the shared-inlining method. The system is capable of transforming an XML data source that conforms to the DTD into relational data. The …
Statistical Genetic Interval-Valued Type-2 Fuzzy System And Its Application, Yu Qiu
Statistical Genetic Interval-Valued Type-2 Fuzzy System And Its Application, Yu Qiu
Computer Science Theses
In recent years, the type-2 fuzzy sets theory has been used to model and minimize the effects of uncertainties in rule-base fuzzy logic system. In order to make the type-2 fuzzy logic system reasonable and reliable, a new simple and novel statistical method to decide interval-valued fuzzy membership functions and a new probability type reduced reasoning method for the interval-valued fuzzy logic system are proposed in this thesis. In order to optimize this particle system’s performance, we adopt genetic algorithm (GA) to adjust parameters. The applications for the new system are performed and results have shown that the developed method …
The Relative Importance Of Input Encoding And Learning Methodology On Protein Secondary Structure Prediction, Arnshea Clayton
The Relative Importance Of Input Encoding And Learning Methodology On Protein Secondary Structure Prediction, Arnshea Clayton
Computer Science Theses
In this thesis the relative importance of input encoding and learning algorithm on protein secondary structure prediction is explored. A novel input encoding, based on multidimensional scaling applied to a recently published amino acid substitution matrix, is developed and shown to be superior to an arbitrary input encoding. Both decimal valued and binary input encodings are compared. Two neural network learning algorithms, Resilient Propagation and Learning Vector Quantization, which have not previously been applied to the problem of protein secondary structure prediction, are examined. Input encoding is shown to have a greater impact on prediction accuracy than learning methodology with …
An Indexation And Discovery Architecture For Semantic Web Services And Its Application In Bioinformatics, Liyang Yu
Computer Science Theses
Recently much research effort has been devoted to the discovery of relevant Web services. It is widely recognized that adding semantics to service description is the solution to this challenge. Web services with explicit semantic annotation are called Semantic Web Services (SWS). This research proposes an indexation and discovery architecture for SWS, together with a prototype application in the area of bioinformatics. In this approach, a SWS repository is created and maintained by crawling both ontology-oriented UDDI registries and Web sites that hosting SWS. For a given service request, the proposed system invokes the matching algorithm and a candidate set …
Simulating A Pipelined Reconfigurable Mesh On A Linear Array With A Reconfigurable Pipelined Bus System, Mathura Gopalan
Simulating A Pipelined Reconfigurable Mesh On A Linear Array With A Reconfigurable Pipelined Bus System, Mathura Gopalan
Computer Science Theses
Due to the unidirectional nature of propagation and predictable delays, optically pipelined buses have been gaining more attention. There have been many models proposed over time that use reconfigurable optically pipelined buses. The reconfigurable nature of the models makes them capable of changing their component’s functionalities and structure that connects the components at every step of computation. There are both one dimensional as well as k –dimensional models that have been proposed in the literature. Though equivalence between various one dimensional models and equivalence between different two dimensional models had been established, so far there has not been any attempt …
A System For Rapid Configuration Of Distributed Workflows Over Web Services And Their Handheld-Based Coordination, Jaimini Joshi
A System For Rapid Configuration Of Distributed Workflows Over Web Services And Their Handheld-Based Coordination, Jaimini Joshi
Computer Science Theses
Web services technology has lately stirred tremendous interest in industry as well as the academia. Web services are self-contained, platform independent functionality which is available over the internet. Web services are defined, discovered & accessed using a standard protocols like WSDL, UDDI & SOAP. With the advent of Service-Oriented Architecture and need for more complex application, it became eminent to have a way in which these independent entities could collaborate in a coherent manner to provide a high level functionality. But the problem of service composition is not an easy one. One reason being the self-contained and loosely coupled interaction …
Node Caching Enhancement Of Reactive Ad Hoc Routing Protocol, Sunsook Jung
Node Caching Enhancement Of Reactive Ad Hoc Routing Protocol, Sunsook Jung
Computer Science Theses
Enhancing route request broadcasting protocols constitutes a substantial part of research in mobile ad hoc network routing. In the thesis, enhancements of ad hoc routing protocols, energy efficiency metrics and clustered topology generators are discussed. The contributions include the followings. First, a node caching enhancement of Ad-hoc On-demand Distance Vector (AODV) routing protocol is introduced. Extensive simulation studies of the enhanced AODV in NS2 shows up to 9-fold reduction in the routing overhead, up to 20% improvement in the packet delivery ratio and up to 60% reduction in the end-to-end delay. The largest improvement happens to highly stressed situations. Secondly, …
A Survey, Taxonomy, And Analysis Of Network Security Visualization Techniques, Rawiroj Robert Kasemsri
A Survey, Taxonomy, And Analysis Of Network Security Visualization Techniques, Rawiroj Robert Kasemsri
Computer Science Theses
Network security visualization is a relatively new field and is quickly gaining momentum. Network security visualization allows the display and projection of the network or system data, in hope to efficiently monitor and protect the system from any intrusions or possible attacks. Intrusions and attacks are constantly continuing to increase in number, size, and complexity. Textually reading through log files or other textual sources is currently insufficient to secure a network or system. Using graphical visualization, security information is presented visually, and not only by text. Without network security visualization, reading through log files or other textual sources is an …
Web Shopping Expert Systems Using New Interval Type-2 Fuzzy Reasoning, Ling Gu
Web Shopping Expert Systems Using New Interval Type-2 Fuzzy Reasoning, Ling Gu
Computer Science Theses
Finding a product with high quality and reasonable price online is a difficult task due to the fuzzy nature of data and queries. In order to handle the fuzzy problem, a new type-2 fuzzy reasoning based decision support system, the Web Shopping Expert for online users is proposed. In the Web Shopping Expert, an interval type-2 fuzzy logic system is used and a fuzzy output can be obtained using the up-low limit technique, which offers an opportunity to directly employ all the rules and methods of the type-1 fuzzy sets onto the type-2 fuzzy sets. To achieve the best performance …