Open Access. Powered by Scholars. Published by Universities.®

Computer Engineering Commons™

Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 8671 - 8700 of 13565

Full-Text Articles in Computer Engineering

Countering Noise-Based Splicing Detection Using Noise Density Transfer, Thibault Julliand, Vincent Nozick, Hugues Talbot Jan 2016

Countering Noise-Based Splicing Detection Using Noise Density Transfer, Thibault Julliand, Vincent Nozick, Hugues Talbot

Journal of Digital Forensics, Security and Law

Image splicing is a common and widespread type of manipulation, which is defined as pasting a portion of an image onto a second image. Several forensic methods have been developed to detect splicing, using various image properties. Some of these methods exploit the noise statistics of the image to try and find discrepancies. In this paper, we propose a new counter-forensic approach to eliminate the noise differences that can appear in a spliced image. This approach can also be used when creating computer graphics images, in order to endow them with a realistic noise. This is performed by changing the …


Evidential Reasoning For Forensic Readiness, Yi-Ching Liao, Hanno Langweg Jan 2016

Evidential Reasoning For Forensic Readiness, Yi-Ching Liao, Hanno Langweg

Journal of Digital Forensics, Security and Law

To learn from the past, we analyse 1,088 "computer as a target" judgements for evidential reasoning by extracting four case elements: decision, intent, fact, and evidence. Analysing the decision element is essential for studying the scale of sentence severity for cross-jurisdictional comparisons. Examining the intent element can facilitate future risk assessment. Analysing the fact element can enhance an organization's capability of analysing criminal activities for future offender profiling. Examining the evidence used against a defendant from previous judgements can facilitate the preparation of evidence for upcoming legal disclosure. Follow the concepts of argumentation diagrams, we develop an automatic judgement summarizing …


Table Of Contents Jan 2016

Table Of Contents

Journal of Digital Forensics, Security and Law

No abstract provided.


Table Of Contents Jan 2016

Table Of Contents

Journal of Digital Forensics, Security and Law

No abstract provided.


Electronic Voting Service Using Block-Chain, Kibin Lee, Joshua I. James, Tekachew G. Ejeta, Hyoung J. Kim Jan 2016

Electronic Voting Service Using Block-Chain, Kibin Lee, Joshua I. James, Tekachew G. Ejeta, Hyoung J. Kim

Journal of Digital Forensics, Security and Law

Cryptocurrency, and its underlying technologies, has been gaining popularity for transaction management beyond financial transactions. Transaction information is maintained in the block-chain, which can be used to audit the integrity of the transaction. The focus on this paper is the potential availability of block-chain technology of other transactional uses. Block-chain is one of the most stable open ledgers that preserves transaction information, and is difficult to forge. Since the information stored in block-chain is not related to personally identify information, it has the characteristics of anonymity. Also, the block-chain allows for transparent transaction verification since all information in the block-chain …


Exploring Deviant Hacker Networks (Dhn) On Social Media Platforms, Samer Al-Kateeb, Kevin Conlan, Nitin Agarwal, Ibrahim Baggili, Frank Breitinger Jan 2016

Exploring Deviant Hacker Networks (Dhn) On Social Media Platforms, Samer Al-Kateeb, Kevin Conlan, Nitin Agarwal, Ibrahim Baggili, Frank Breitinger

Electrical & Computer Engineering and Computer Science Faculty Publications

Online Social Networks (OSNs) have grown exponentially over the past decade. The initial use of social media for benign purposes (e.g., to socialize with friends, browse pictures and photographs, and communicate with family members overseas) has now transitioned to include malicious activities (e.g., cybercrime, cyberterrorism, and cyberwarfare). These nefarious uses of OSNs poses a signi_cant threat to society, and thus requires research attention. In this exploratory work, we study activities of one deviant groups: hacker groups on social media, which we term Deviant Hacker Networks (DHN). We investigated the connection between different DHNs on Twitter: how they are connected, identified …


Towards Syntactic Approximate Matching-A Pre-Processing Experiment, Doowon Jeong, Frank Breitinger, Hari Kang, Sangjin Lee Jan 2016

Towards Syntactic Approximate Matching-A Pre-Processing Experiment, Doowon Jeong, Frank Breitinger, Hari Kang, Sangjin Lee

Electrical & Computer Engineering and Computer Science Faculty Publications

Over the past few years, the popularity of approximate matching algorithms (a.k.a. fuzzy hashing) has increased. Especially within the area of bytewise approximate matching, several algorithms were published, tested, and improved. It has been shown that these algorithms are powerful, however they are sometimes too precise for real world investigations. That is, even very small commonalities (e.g., in the header of a file) can cause a match. While this is a desired property, it may also lead to unwanted results. In this paper, we show that by using simple pre-processing, we significantly can influence the outcome. Although our test set …


Find Me If You Can: Mobile Gps Mapping Applications Forensic Analysis & Snavp The Open Source, Modular, Extensible Parser, Jason Moore, Ibrahim Baggili, Frank Breitinger Jan 2016

Find Me If You Can: Mobile Gps Mapping Applications Forensic Analysis & Snavp The Open Source, Modular, Extensible Parser, Jason Moore, Ibrahim Baggili, Frank Breitinger

Electrical & Computer Engineering and Computer Science Faculty Publications

The use of smartphones as navigation devices has become more prevalent. The ubiquity of hand-held navigation devices such as Garmins or Toms Toms has been falling whereas the ownership of smartphones and their adoption as GPS devices is growing. This work provides a comprehensive study of the most popular smartphone mapping applications, namely Google Maps, Apple Maps, Waze, MapQuest, Bing, and Scout, on both Android and iOS. It details what data was found, where it was found, and how it was acquired for each application. Based on the findings, the work allowed for the construction of a tool capable of …


In-Shoe Plantar Pressure System To Investigate Ground Reaction Force Using Android Platform, Ahmed A. Mostfa Jan 2016

In-Shoe Plantar Pressure System To Investigate Ground Reaction Force Using Android Platform, Ahmed A. Mostfa

Theses and Dissertations

Human footwear is not yet designed to optimally relieve pressure on the heel of the foot. Proper foot pressure assessment requires personal training and measurements by specialized machinery. This research aims to investigate and hypothesize about Preferred Transition Speed (PTS) and to classify the gait phase of explicit variances in walking patterns between different subjects. An in-shoe wearable pressure system using Android application was developed to investigate walking patterns and collect data on Activities of Daily Living (ADL). In-shoe circuitry used Flexi-Force A201 sensors placed at three major areas: heel contact, 1st metatarsal, and 5th metatarsal with a PIC16F688 microcontroller …


Flexc: Protein Flexibility Prediction Using Context-Based Statistics, Predicted Structural Features, And Sequence Information, Ashraf Yaseen, Mais Nijim, Brandon Williams, Lei Qian, Min Li, Jianxin Wang, Yaohang Li Jan 2016

Flexc: Protein Flexibility Prediction Using Context-Based Statistics, Predicted Structural Features, And Sequence Information, Ashraf Yaseen, Mais Nijim, Brandon Williams, Lei Qian, Min Li, Jianxin Wang, Yaohang Li

Computer Science Faculty Publications

The fluctuation of atoms around their average positions in protein structures provides important information regarding protein dynamics. This flexibility of protein structures is associated with various biological processes. Predicting flexibility of residues from protein sequences is significant for analyzing the dynamic properties of proteins which will be helpful in predicting their functions.


Numerical Analysis Of Flexural Slip During Viscoelastic Buckle Folding, Davi Rodrigues Damasceno Jan 2016

Numerical Analysis Of Flexural Slip During Viscoelastic Buckle Folding, Davi Rodrigues Damasceno

Masters Theses

"Flexural slip is considered to be an important folding mechanism contributing in the development of different folds such as chevron, and kink-band buckle folds. Various filed studies have provided a general conceptual and qualitative understanding of flexural slip. However, quantitative evidence of the importance of the flexural slip mechanism during fold evolution is sparse, as the actual amount of surface parallel displacement, and timing, is difficult to measure accurately, due to the lack of suitable strain markers.

In this study 2D finite element analysis is used to overcome these disadvantages and to simulate flexural slip during viscoelastic buckle folding. Variations …


Emerging Adaptive Architectures For Biomolecular Computation, Matthew Fleetwood Jan 2016

Emerging Adaptive Architectures For Biomolecular Computation, Matthew Fleetwood

Maseeh Summer Undergraduate Research Experience

The goal of this work is to explore applications of reservoir computing in biomolecular computation. Reservoir computing is a unique model for representing a mapping from one instance in time to a specific output. A neural network of randomly connected neurons is linked with a single output neuron or multiple output neurons. The output neurons are capable of mapping inputs to desired outputs using adaptable algorithms. This framework is investigated by using the Python programming language and object oriented design and programming. Neurons are created in programs by bundling information like input data and attributes of the network, which utilize …


From Boolean Equalities To Constraints, Sergio Antoy, Michael Hanus Dec 2015

From Boolean Equalities To Constraints, Sergio Antoy, Michael Hanus

Computer Science Faculty Publications and Presentations

Although functional as well as logic languages use equality to discriminate between logically different cases, the operational meaning of equality is different in such languages. Functional languages reduce equational expressions to their Boolean values, True or False, logic languages use unification to check the validity only and fail otherwise. Consequently, the language Curry, which amalgamates functional and logic programming features, offers two kinds of equational expressions so that the programmer has to distinguish between these uses. We show that this distinction can be avoided by providing an analysis and transformation method that automatically selects the appropriate operation. Without this distinction …


Data To Decisions For Cyberspace Operations, Steve Stone Dec 2015

Data To Decisions For Cyberspace Operations, Steve Stone

Military Cyber Affairs

In 2011, the United States (U.S.) Department of Defense (DOD) named cyberspace a new operational domain. The U.S. Cyber Command and the Military Services are working to make the cyberspace environment a suitable place for achieving national objectives and enabling military command and control (C2). To effectively conduct cyberspace operations, DOD requires data and analysis of the Mission, Network, and Adversary. However, the DOD’s current data processing and analysis capabilities do not meet mission needs within critical operational timelines. This paper presents a summary of the data processing and analytics necessary to effectively conduct cyberspace operations.


Nd − Pdpa: N Dimensional Probability Density Profile Analysis, Arjang Fahim Dec 2015

Nd − Pdpa: N Dimensional Probability Density Profile Analysis, Arjang Fahim

Theses and Dissertations

Proteins are often referred as working molecule of a cell, performing many structural, functional and regulatory processes. Revealing the function of proteins still remains a challenging problem. Advancement in genomics sequence projects produces large protein sequence repository, but due to technical difficulty and cost related to structure determination, the number of identified protein structure is far behind. Novel structures identification are particularly important for a number of reasons: they generate models of similar proteins for comparison; identify evolutionary relationships; further contribute to our understanding of protein function and mechanism; and allow for the fold of other family members to be …


All Your Sessions Are Belong To Us: Investigating Authenticator Leakage Through Backup Channels On Android, Guangdong Bai, Jun Sun, Jianliang Wu, Quanqi Ye, Li Li, Jin Song Dong, Shanqing Guo Dec 2015

All Your Sessions Are Belong To Us: Investigating Authenticator Leakage Through Backup Channels On Android, Guangdong Bai, Jun Sun, Jianliang Wu, Quanqi Ye, Li Li, Jin Song Dong, Shanqing Guo

Research Collection School Of Computing and Information Systems

Security of authentication protocols heavily relies on the confidentiality of credentials (or authenticators) like passwords and session IDs. However, unlike browser-based web applications for which highly evolved browsers manage the authenticators, Android apps have to construct their own management. We find that most apps simply locate their authenticators into the persistent storage and entrust underlying Android OS for mediation. Consequently, these authenticators can be leaked through compromised backup channels. In this work, we conduct the first systematic investigation on this previously overlooked attack vector. We find that nearly all backup apps on Google Play inadvertently expose backup data to any …


Gpu Accelerated On-The-Fly Reachability Checking, Zhimin Wu, Yang Liu, Jun Sun, Jianqi Shi, Shengchao Qin Dec 2015

Gpu Accelerated On-The-Fly Reachability Checking, Zhimin Wu, Yang Liu, Jun Sun, Jianqi Shi, Shengchao Qin

Research Collection School Of Computing and Information Systems

Model checking suffers from the infamous state space explosion problem. In this paper, we propose an approach, named GPURC, to utilize the Graphics Processing Units (GPUs) to speed up the reachability verification. The key idea is to achieve a dynamic load balancing so that the many cores in GPUs are fully utilized during the state space exploration.To this end, we firstly construct a compact data encoding of the input transition systems to reduce the memory cost and fit the calculation in GPUs. To support a large number of concurrent components, we propose a multi-integer encoding with conflict-release accessing approach. We …


Generalized Techniques For Using System Execution Traces To Support Software Performance Analysis, Thelge Manjula Peiris Dec 2015

Generalized Techniques For Using System Execution Traces To Support Software Performance Analysis, Thelge Manjula Peiris

Open Access Dissertations

This dissertation proposes generalized techniques to support software performance analysis using system execution traces in the absence of software development artifacts such as source code. The proposed techniques do not require modifications to the source code, or to the software binaries, for the purpose of software analysis (non-intrusive). The proposed techniques are also not tightly coupled to the architecture specific details of the system being analyzed. This dissertation extends the current techniques of using system execution traces to evaluate software performance properties, such as response times, service times. The dissertation also proposes a novel technique to auto-construct a dataflow model …


The Bounded Edge Coloring Problem And Offline Crossbar Scheduling, Jonathan Turner Dec 2015

The Bounded Edge Coloring Problem And Offline Crossbar Scheduling, Jonathan Turner

All Computer Science and Engineering Research

This paper introduces a variant of the classical edge coloring problem in graphs that can be applied to an offline scheduling problem for crossbar switches. We show that the problem is NP-complete, develop three lower bounds bounds on the optimal solution value and evaluate the performance of several approximation algorithms, both analytically and experimentally. We show how to approximate an optimal solution with a worst-case performance ratio of 3/2 and our experimental results demonstrate that the best algorithms produce results that very closely track a lower bound.


Transforming C Openmp Programs For Verification In Civl, Michael Rogers Dec 2015

Transforming C Openmp Programs For Verification In Civl, Michael Rogers

School of Computing: Dissertations, Theses, and Student Research

There are numerous way to express parallelism which can make it challenging for developers to verify these programs. Many tools only target a single dialect but the Concurrency Intermediate Verification Language (CIVL) targets MPI, Pthreads, and CUDA. CIVL provides a general concurrency model that can represent pro- grams in a variety of concurrency dialects. CIVL includes a front-end that support all of the dialects mentioned above. The back-end is a verifier that uses model checking and symbolic execution to check standard properties.

In this thesis, we have designed and implemented a transformer that will take C OpenMP programs and transform …


Novel Software Defined Radio Architecture With Graphics Processor Acceleration, Lalith Narasimhan Dec 2015

Novel Software Defined Radio Architecture With Graphics Processor Acceleration, Lalith Narasimhan

Dissertations

Wireless has become one of the most pervasive core technologies in the modern world. Demand for faster data rates, improved spectrum efficiency, higher system access capacity, seamless protocol integration, improved security and robustness under varying channel environments has led to the resurgence of programmable software defined radio (SDR) as an alternative to traditional ASIC based radios. Future SDR implementations will need support for multiple standards on platforms with multi-Gb/s connectivity, parallel processing and spectrum sensing capabilities. This dissertation implemented key technologies of importance in addressing these issues namely development of cost effective multi-mode reconfigurable SDR and providing a framework to …


Learning Query And Image Similarities With Ranking Canonical Correlation Analysis, Ting Yao, Tao Mei, Chong-Wah Ngo Dec 2015

Learning Query And Image Similarities With Ranking Canonical Correlation Analysis, Ting Yao, Tao Mei, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

One of the fundamental problems in image search is to learn the ranking functions, i.e., similarity between the query and image. The research on this topic has evolved through two paradigms: feature-based vector model and image ranker learning. The former relies on the image surrounding texts, while the latter learns a ranker based on human labeled query-image pairs. Each of the paradigms has its own limitation. The vector model is sensitive to the quality of text descriptions, and the learning paradigm is difficult to be scaled up as human labeling is always too expensive to obtain. We demonstrate in this …


Adaptive Duty Cycling In Sensor Networks With Energy Harvesting Using Continuous-Time Markov Chain And Fluid Models, Ronald Wai Hong Chan, Pengfei Zhang, Ido Nevat, Sai Ganesh Nagarajan, Alvin Cerdena Valera, Hwee Xian Tan Dec 2015

Adaptive Duty Cycling In Sensor Networks With Energy Harvesting Using Continuous-Time Markov Chain And Fluid Models, Ronald Wai Hong Chan, Pengfei Zhang, Ido Nevat, Sai Ganesh Nagarajan, Alvin Cerdena Valera, Hwee Xian Tan

Research Collection School Of Computing and Information Systems

The dynamic and unpredictable nature of energy harvesting sources available for wireless sensor networks, and the time variation in network statistics like packet transmission rates and link qualities, necessitate the use of adaptive duty cycling techniques. Such adaptive control allows sensor nodes to achieve long-run energy neutrality, where energy supply and demand are balanced in a dynamic environment such that the nodes function continuously. In this paper, we develop a new framework enabling an adaptive duty cycling scheme for sensor networks that takes into account the node battery level, ambient energy that can be harvested, and application-level QoS requirements. We …


Faster Maximium Priority Matchings In Bipartite Graphs, Jonathan Turner Dec 2015

Faster Maximium Priority Matchings In Bipartite Graphs, Jonathan Turner

All Computer Science and Engineering Research

A maximum priority matching is a matching in an undirected graph that maximizes a priority score defined with respect to given vertex priorities. An earlier paper showed how to find maximum priority matchings in unweighted graphs. This paper describes an algorithm for bipartite graphs that is faster when the number of distinct priority classes is limited. For graphs with k distinct priority classes it runs in O(kmn1/2) time, where n is the number of vertices in the graph and m is the number of edges.


Adaptive Scaling Of Cluster Boundaries For Large-Scale Social Media Data Clustering, Lei Meng, Ah-Hwee Tan, Donald C. Wunsch Dec 2015

Adaptive Scaling Of Cluster Boundaries For Large-Scale Social Media Data Clustering, Lei Meng, Ah-Hwee Tan, Donald C. Wunsch

Research Collection School Of Computing and Information Systems

The large scale and complex nature of social media data raises the need to scale clustering techniques to big data and make them capable of automatically identifying data clusters with few empirical settings. In this paper, we present our investigation and three algorithms based on the fuzzy adaptive resonance theory (Fuzzy ART) that have linear computational complexity, use a single parameter, i.e., the vigilance parameter to identify data clusters, and are robust to modest parameter settings. The contribution of this paper lies in two aspects. First, we theoretically demonstrate how complement coding, commonly known as a normalization method, changes the …


Maximum Priority Matchings, Jonathan Turner Nov 2015

Maximum Priority Matchings, Jonathan Turner

All Computer Science and Engineering Research

Let G=(V,E) be an undirected graph with n vertices and m edges, in which each vertex u is assigned an integer priority in [1,n], with 1 being the ``highest'' priority. Let M be a matching of G. We define the priority score of M to be an n-ary integer in which the i-th most-significant digit is the number of vertices with priority i that are incident to an edge in M. We describe a variation of the augmenting path method (Edmonds' algorithm) that finds a matching with maximum priority score in O(mn) time.


The Role Of Cryptography In Security For Electronic Commerce, Ann Murphy, David Murphy Nov 2015

The Role Of Cryptography In Security For Electronic Commerce, Ann Murphy, David Murphy

The ITB Journal

Many businesses and consumers are wary of conducting business over the Internet due to a perceived lack of security. Electronic business is subject to a variety of threats such as unauthorised access, misappropriation, alteration and destruction of both data and systems. This paper explores the major security concerns of businesses and users and describes the cryptographic techniques used to reduce such risks.


Morphological Parsing Of Albanian Language: A Different Approach To Albanian Verbs, Iir Çollaku, Eşref Adali Nov 2015

Morphological Parsing Of Albanian Language: A Different Approach To Albanian Verbs, Iir Çollaku, Eşref Adali

UBT International Conference

The very first step when processing a natural language is creating a morphological parser. Verbs in Albanian language are the most complex area of inflection. Besides irregular verbs, the ways in which the regular verbs change their form while being inflected are hardly definable, and the number of exceptions is huge. In this paper, a different approach to Albanian verbs is made. Unlike traditional classification, based on the inflection themes they take, verbs are classified into different verb groups. This way, the inflection process looks clearer and more regular, as the affix remains the only changeable part of the inflected …


Microsimulation Models For Simulating Pathways Of Patients With Mental Diseases, Andreas Bauer, Felix Breitenecker, Christoph Urach Nov 2015

Microsimulation Models For Simulating Pathways Of Patients With Mental Diseases, Andreas Bauer, Felix Breitenecker, Christoph Urach

UBT International Conference

Predicting demand for care is necessary to provide sufficient capacities in hospitals and enable better planning to cope with challenges like changes in the structure of the population. Emphasis in this work is put on the analysis of the data and on the parametrization of a simulation model for the paths of patients with mental diseases through the health care system. Survival analysis and model selection methods are used for this purpose. Data on patients and their treatments is analyzed with methods of survival analysis. Different methods for modelling the survival and hazard function are presented and compared. Hereby, the …


Introduction To Stratospheric Communication Platforms (Scp), Dimov Stojce Ilcev Nov 2015

Introduction To Stratospheric Communication Platforms (Scp), Dimov Stojce Ilcev

UBT International Conference

In this paper are introduced the modern airship techniques and technologies as cost effective solutions of Stratospheric Communication Platforms (SCP). The launch or putting in position the airship is not critical point such as launch of satellite and controlling support services in the creation of space-based communication technology and the most expensive phase of the total system cost. Therefore, with few cost effective remote controlled and solar powered airships can be covered some region or country including urban, suburban and rural areas, mobile, farms and other environments with low density of population. The airship SCP network offers better solutions than …