Computer Engineering Commons^™

Cs 4830-01/6830-01: Systems Simulation, Erik Marlow Buck

Computer Science & Engineering Syllabi

No abstract provided.

Cs 7900-03: Information Security, Shaojun Wang

Computer Science & Engineering Syllabi

Machine learning studies automatic methods of learning to make accurate predictions or useful decisions based on past observations. This course introduces theoretical machine learning, including mathematical models of machine learning, and the design and rigorous analysis of learning algorithms for classification, regression and ranking etc. Topics include: bounds on the number of random examples needed to learn; learning from non-random examples in the on-line learning model (for instance, for investment portfolio selection); how to boost the accuracy of a weak learning algorithm, kernel methods such as support-vector machines; consistency of machine learning methods.

Cs 2800: Web Design Fundamentals, Mohamed B. Ali

Computer Science & Engineering Syllabi

HTML is the markup language that every web developer uses in order to structure and present content in the Internet. HTML5 is the standard that is being shaped and developed currently. It extends and improves the last HTML4 standard and takes it to the next level with support multimedia, communication and more. In this course, Students learn the fundamentals of Web design and development. Using various web software (Text editors, Expression Web, browsers and ftp clients). We will use CSS and forms, learn to add multimedia to pages, learn to insert JavaScript code into our web pages to increase interactivity, …

Ceg 2170-01: Introduction To C Programming For Engineers, Shaojun Wang

Computer Science & Engineering Syllabi

Basic engineering problem solving using the C programming language. Topics include loops, selection, input/output, files, functions, arrays, complex variables, pointers, structures, and dynamic memory. Students will learn how to approach solving problems in engineering and science; how to develop algorithms, using advanced techniques such as recursion, searching, s01ting and linked lists, to solve those problems; and how to implement those algorithms in the C language.

Cs 1000-01: Technology And Society, Meg Wiltshire

Computer Science & Engineering Syllabi

What impact does technology have on society? As technology plays a greater role in our everyday lives, this becomes and increasingly important issue. The past 30 years have seen unprecedented technological advances, but the benefits obtained are often offset by unforeseen consequences and repercussions, such as privacy concerns, identity theft, and safety. This course will evaluate the consequences of technology on individuals, organizations, and society, identifying the potential benefits and limitations. We will discuss how social, ethical, legal, and philosophical issues have impacted, and will continue to impact, society.

Searching Visual Instances With Topology Checking And Context Modeling, Wei Zhang, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

Instance Search (INS) is a realistic problem initiated by TRECVID, which is to retrieve all occurrences of the querying object, location, or person from a large video collection. It is a fundamental problem with many applications, and also a challenging problem different from the traditional concept or near-duplicate (ND) search, since the relevancy is defined at instance level. True responses could exhibit various visual variations, such as being small on the image with different background, or showing a non-homography spatial configuration. Based on the Bag-of-Words model, we propose two techniques tailored for Instance Search. Specifically, we explore the use of …

Arraytrack: A Fine-Grained Indoor Location System, Jie Xiong, Kyle Jamieson

Research Collection School Of Computing and Information Systems

With myriad augmented reality, social networking, and retail shopping applications all on the horizon for the mobile handheld, a fast and accurate location technology will become key to a rich user experience. When roaming outdoors, users can usually count on a clear GPS signal for accurate location, but indoors, GPS often fades, and so up until recently, mobiles have had to rely mainly on rather coarse-grained signal strength readings. What has changed this status quo is the recent trend of dramatically increasing numbers of antennas at the indoor access point, mainly to bolster capacity and coverage with multiple-input, multiple-output (MIMO) …

Tdma Slot Reservation In Cluster-Based Vanets, Mohammad Salem Almalag

Computer Science Theses & Dissertations

Vehicular Ad Hoc Networks (VANETs) are a form of Mobile Ad Hoc Networks (MANETs) in which vehicles on the road form the nodes of the network. VANETs provide several services to enhance the safety and comfort of drivers and passengers. These services can be obtained by the wireless exchange of information among the vehicles driving on the road. In particular, the transmission of two different types of messages, safety/update and non-safety messages.

The transmission of safety/update message aims to inform the nearby vehicles about the sender's current status and/or a detected dangerous situation. This type of transmission is designed to …

Predicting Sql Injection And Cross Site Scripting Vulnerabilities Through Mining Input Sanitization Patterns, Lwin Khin Shar, Hee Beng Kuan Tan

Research Collection School Of Computing and Information Systems

ContextSQL injection (SQLI) and cross site scripting (XSS) are the two most common and serious web application vulnerabilities for the past decade. To mitigate these two security threats, many vulnerability detection approaches based on static and dynamic taint analysis techniques have been proposed. Alternatively, there are also vulnerability prediction approaches based on machine learning techniques, which showed that static code attributes such as code complexity measures are cheap and useful predictors. However, current prediction approaches target general vulnerabilities. And most of these approaches locate vulnerable code only at software component or file levels. Some approaches also involve process attributes that …

Circular Reranking For Visual Search, Ting Yao, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

Search reranking is regarded as a common way to boost retrieval precision. The problem nevertheless is not trivial especially when there are multiple features or modalities to be considered for search, which often happens in image and video retrieval. This paper proposes a new reranking algorithm, named circular reranking, that reinforces the mutual exchange of information across multiple modalities for improving search performance, following the philosophy that strong performing modality could learn from weaker ones, while weak modality does benefit from interacting with stronger ones. Technically, circular reranking conducts multiple runs of random walks through exchanging the ranking scores among …

Impact Of Primary User Activity On The Performance Of Energy-Based Spectrum Sensing In Cognitive Radio Systems, Sara L. Macdonald

Electrical & Computer Engineering Theses & Dissertations

Increasing numbers of wireless devices and mobile data requirements have led to a spectrum shortage. However spectrum utilization percentages are often low due to the current static spectrum allocation process where primary users (PUs) are given exclusive use to spectrum. Several mechanisms to increase spectrum utilization have been proposed including opportunistic spectrum access (OSA). Cognitive Radio (CR) is an emerging concept in wireless communication systems that aims to enable OSA in licensed frequencies by secondary users (SUs). CR systems are expected to sense the spectrum in order to determine if the PU is transmitting. Therefore OSA performance relies on the …

Measuring The Value Of Conceptual Modeling A Return On Investment (Roi) Analysis, Jeffrey Alan Brelsford

Computational Modeling & Simulation Engineering Theses & Dissertations

This thesis presents a method for calculating the return on investment (ROI) of conceptual modeling. Conceptual modeling as it relates to Modeling and Simulation (M&S) studies is a process that abstracts a model of a real or proposed system to be subsequently used for developing computer models. The conceptual modeling process is a critical constituent in an M&S project because it produces the central reference for building the computer model. Computer models require formal logic to carry out procedures, and consistent arguments in formal logic are crucial for the model to be useful. Not only does formal logic provide the …

Stochastic Modeling And Time-To-Event Analysis Of Voip Traffic, Imad Al Ajarmeh

College of Computing and Digital Media Dissertations

Voice over IP (VoIP) systems are gaining increased popularity due to the cost effectiveness, ease of management, and enhanced features and capabilities. Both enterprises and carriers are deploying VoIP systems to replace their TDM-based legacy voice networks. However, the lack of engineering models for VoIP systems has been realized by many researchers, especially for large-scale networks. The purpose of traffic engineering is to minimize call blocking probability and maximize resource utilization. The current traffic engineering models are inherited from the legacy PSTN world, and these models fall short from capturing the characteristics of new traffic patterns. The objective of this …

Rootkit Detection Using A Cross-View Clean Boot Method, Bridget N. Flatley

Theses and Dissertations

In cyberspace, attackers commonly infect computer systems with malware to gain capabilities such as remote access, keylogging, and stealth. Many malware samples include rootkit functionality to hide attacker activities on the target system. After detection, users can remove the rootkit and associated malware from the system with commercial tools. This research describes, implements, and evaluates a clean boot method using two partitions to detect rootkits on a system. One partition is potentially infected with a rootkit while the other is clean. The method obtains directory listings of the potentially infected operating system from each partition and compares the lists to …

Modeling Cyber Situational Awareness Through Data Fusion, Evan L. Raulerson

Theses and Dissertations

Cyber attacks are compromising networks faster than administrators can respond. Network defenders are unable to become oriented with these attacks, determine the potential impacts, and assess the damages in a timely manner. Since the observations of network sensors are normally disjointed, analysis of the data is overwhelming and time is not spent efficiently. Automation in defending cyber networks requires a level of reasoning for adequate response. Current automated systems are mostly limited to scripted responses. Better defense tools are required. This research develops a framework that aggregates data from heterogeneous network sensors. The collected data is correlated into a single …

Mobile Network Defense Interface For Cyber Defense And Situational Awareness, James C. Hannan

Theses and Dissertations

Today's computer networks are under constant attack. In order to deal with this constant threat, network administrators rely on intrusion detection and prevention services (IDS) (IPS). Most IDS and IPS implement static rule sets to automatically alert administrators and resolve intrusions. Network administrators face a difficult challenge, identifying attacks against a vast number of benign network transactions. Also after a threat is identified making even the smallest policy change to the security software potentially has far-reaching and unanticipated consequences. Finally, because the administrator is primarily responding to alerts they may lose situational awareness of the network. During this research a …

Semi-Supervised Heterogeneous Fusion For Multimedia Data Co-Clustering, Lei Meng, Ah-Hwee Tan, Dong Xu

Research Collection School Of Computing and Information Systems

Co-clustering is a commonly used technique for tapping the rich meta-information of multimedia web documents, including category, annotation, and description, for associative discovery. However, most co-clustering methods proposed for heterogeneous data do not consider the representation problem of short and noisy text and their performance is limited by the empirical weighting of the multi-modal features. In this paper, we propose a generalized form of Heterogeneous Fusion Adaptive Resonance Theory, called GHF-ART, for co-clustering of large-scale web multimedia documents. By extending the two-channel Heterogeneous Fusion ART (HF-ART) to multiple channels, GHF-ART is designed to handle multimedia data with an arbitrarily rich …

Special Issue On Medical Simulation, Michel Audette, Hanif M. Ladak

Computational Modeling & Simulation Engineering Faculty Publications

We would like to welcome you to this Special Issue on Medical Simulation, the first of its kind not only for SIMULATION: Transactions of The Society for Modeling and Simulation International, but for any technical journal. Our respective backgrounds are an indication of the technical and clinical breadth of medical simulation, as we approach the subject as primarily medical image analysis and biomechanics experts respectively, each with a variety of clinical interests spanning virtual reality (VR)–based neuro-, orthopedic and ear-nose-and-throat surgery. Moreover, we believe that the breadth of the papers that comprise this issue reflects an even broader perspective. After …

Multiple Bounding Boxes Algorithm In Collision Detection And Its Performances In Sequential Vs Cuda Parallel Processing, Min Qi

Electronic Theses and Dissertations

The traditional method for detecting collisions in a 2D computer game uses a axisaligned bounding box around each sprite, and checks to determine if the bounding boxes overlap periodically. Using this single bounding box method may result in a large amount of pixel intersection tests, since a sprite may be composed of areas where the pixels are empty and the intersecting bounding box test results in false positives.

Our algorithm analysis shows that the optimal two or three bounding boxes is the best partition we can get for a reasonable time complexity. The results further show significantly diminishing returns for …

Reducing Communication Delay Variability For A Group Of Robots, Goncalo Martins

Electronic Theses and Dissertations

A novel architecture is presented for reducing communication delay variability for a group of robots. This architecture relies on using three components: a microprocessor architecture that allows deterministic real-time tasks; an event-based communication protocol in which nodes transmit in a TDMA fashion, without the need of global clock synchronization techniques; and a novel communication scheme that enables deterministic communications by allowing senders to transmit without regard for the state of the medium or coordination with other senders, and receivers can tease apart messages sent simultaneously with a high probability of success. This approach compared to others, allows simultaneous communications without …

Dependence On Cyberscribes - Issues In E-Security, Thomas R. Mclean, Alexander B. Mclean

Journal of Business & Technology Law

No abstract provided.

Table Of Contents

Journal of Digital Forensics, Security and Law

No abstract provided.

A Simple Experiment With Microsoft Office 2010 And Windows 7 Utilizing Digital Forensic Methodology, Gregory H. Carlton

Journal of Digital Forensics, Security and Law

Digital forensic examiners are tasked with retrieving data from digital storage devices, and frequently these examiners are expected to explain the circumstances that led to the data being in its current state. Through written reports or verbal, expert testimony delivered in court, digital forensic examiners are expected to describe whether data have been altered, and if so, then to what extent have data been altered. Addressing these expectations results from opinions digital forensic examiners reach concerning their understanding of electronic storage and retrieval methods. The credibility of these opinions evolves from the scientific basis from which they are drawn using …

The Advanced Data Acquisition Model (Adam): A Process Model For Digital Forensic Practice, Richard Adams, Val Hobbs, Graham Mann

Journal of Digital Forensics, Security and Law

As with other types of evidence, the courts make no presumption that digital evidence is reliable without some evidence of empirical testing in relation to the theories and techniques associated with its production. The issue of reliability means that courts pay close attention to the manner in which electronic evidence has been obtained and in particular the process in which the data is captured and stored. Previous process models have tended to focus on one particular area of digital forensic practice, such as law enforcement, and have not incorporated a formal description. We contend that this approach has prevented the …

Using Power-Law Properties Of Social Groups For Cloud Defense And Community Detection, Justin L. Rice

Doctoral Dissertations

The power-law distribution can be used to describe various aspects of social group behavior. For mussels, sociobiological research has shown that the Lévy walk best describes their self-organizing movement strategy. A mussel's step length is drawn from a power-law distribution, and its direction is drawn from a uniform distribution. In the area of social networks, theories such as preferential attachment seek to explain why the degree distribution tends to be scale-free. The aim of this dissertation is to glean insight from these works to help solve problems in two domains: cloud computing systems and community detection.

Privacy and security are …

A Method For Ontology-Based Semantic Relatedness Measurement, Görkem Gi̇ray, Murat Osman Ünalir

Turkish Journal of Electrical Engineering and Computer Sciences

There are many methods having different approaches for assessing similarity and relatedness and they are used in many application areas, including web service discovery, invocation and composition, word sense disambiguation, information retrieval, ontology alignment and merging, document clustering, and short answer grading. These methods can be categorized as path-based, information content-based, feature-based, geometric model-based, and hybrid approaches. These approaches use resources such as concept hierarchy, conceptual graph, and corpus for computing similarity and relatedness. With the rise of the semantic web, ontologies have attracted the attention of several researchers. Ontologies represented in the Web Ontology Language (OWL) are also valuable …

Algorithms And Data Structures For Efficient Timing Analysis Of Asynchronous Real-Time Systems, Yingying Zhang

USF Tampa Graduate Theses and Dissertations

This thesis presents a framework to verify asynchronous real-time systems based on model checking. These systems are modeled by using a common modeling formalism named Labeled Petri-nets(LPNs).

In order to verify the real-time systems algorithmically, the zone-based timing analysis method is used for LPNs. It searches the state space with timing information (represented by zones). When there is a high degree of concurrency in the model, firing concurrent enabled transitions in different order may result in different zones, and these zones may be combined without affecting the verification result. Since the zone-based method could not deal with this problem efficiently, …

Relation Lifting, With An Application To The Many-Valued Cover Modality, Marta Bílková, Alexander Kurz, Daniela Petrişan, Jirí Velebil

Engineering Faculty Articles and Research

We introduce basic notions and results about relation liftings on categories enriched in a commutative quantale. We derive two necessary and sufficient conditions for a 2-functor T to admit a functorial relation lifting: one is the existence of a distributive law of T over the “powerset monad” on categories, one is the preservation by T of “exactness” of certain squares. Both characterisations are generalisations of the “classical” results known for set functors: the first characterisation generalises the existence of a distributive law over the genuine powerset monad, the second generalises preservation of weak pullbacks.

The results presented in this paper …

Nominal Coalgebraic Data Types With Applications To Lambda Calculus, Alexander Kurz, Daniela Petrişan, Paula Severi, Fer-Jan De Vries

Engineering Faculty Articles and Research

We investigate final coalgebras in nominal sets. This allows us to define types of infinite data with binding for which all constructions automatically respect alpha equivalence. We give applications to the infinitary lambda calculus.

Nominal Computation Theory (Dagstuhl Seminar 13422), Mikołaj Bojanczyk, Bartek Klin, Alexander Kurz, Andrew M. Pitts

Engineering Faculty Articles and Research

This report documents the program and the outcomes of Dagstuhl Seminar 13422 “Nominal Computation Theory”. The underlying theme of the seminar was nominal sets (also known as sets with atoms or Fraenkel-Mostowski sets) and they role and applications in three distinct research areas: automata over infinite alphabets, program semantics using nominal sets and nominal calculi of concurrent processes.