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

Computer Engineering Commons™

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

25,747 Full-Text Articles 44,029 Authors 14,813,023 Downloads 285 Institutions

All Articles in Computer Engineering

Faceted Search

25,747 full-text articles. Page 1026 of 1047.

Measuring Whitespace Patterns As An Indication Of Plagiarism, Ilana Shay, Nikolaus Baer, Robert Zeidman 2010 Zeidman Consulting

Measuring Whitespace Patterns As An Indication Of Plagiarism, Ilana Shay, Nikolaus Baer, Robert Zeidman

Annual ADFSL Conference on Digital Forensics, Security and Law

There are several different methods of comparing source code from different programs to find copying1 . Perhaps the most common method is comparing source code statements, comments, strings, identifiers, and instruction sequences. However, there are anecdotes about the use of whitespace patterns in code. These virtually invisible patterns of spaces and tabs have been used in litigation to imply copying, but no formal study has been performed that shows that these patterns can actually identify copied code. This paper presents a detailed study of whitespace patterns and the uniqueness of these patterns in different programs.

Keywords: Copyright Infringement, Intellectual Property, …


Electronic Discovery: A Fool’S Errand Where Angels Fear To Tread?, Milton Luoma, Vicki Luoma 2010 Assistant Professor, Metropolitan State University

Electronic Discovery: A Fool’S Errand Where Angels Fear To Tread?, Milton Luoma, Vicki Luoma

Annual ADFSL Conference on Digital Forensics, Security and Law

Electronic discovery has transformed the discovery phase of civil litigation in recent years. The expectations of lawyers and parties were initially established in the Rowe and Zubulake cases that led to a complete revision of the electronic discovery rules contained in the Federal Rules of Civil Procedure. Subsequent cases have underscored the importance of document search methodologies and implications for attorneys, IT professionals, and digital forensics professionals. The authors review how electronic discovery has evolved thus far and offer recommendations regarding the electronic discovery process.

Keywords: Electronic discovery, e-discovery, keyword search, concept search,


Social Networking: A Boon To Criminals, Tejashree D. Datar, Richard Mislan 2010 Computer and Information Technology Department, Perdue University

Social Networking: A Boon To Criminals, Tejashree D. Datar, Richard Mislan

Annual ADFSL Conference on Digital Forensics, Security and Law

With the world getting more and more digitized, social networking has also found a place in the cyber world. These social networking sites (SNSs) which enable people to socialize, and build and maintain relationships are attracting attention of all kinds of people such as teens, adults, sports persons, and even businesses. But these SNSs are also getting unwanted attention from people like sexual predators, spammers, and people involved in criminal and illegal activities. This paper talks about SNSs and how these sites are exploited for criminal or illegal activity. The SNSs are discussed in detail with respect to user profiles, …


Hard Disk Storage: Firmware Manipulation And Forensic Impact And Current Best Practice, Gareth Davies, Iain Sutherland 2010 Faculty of Advanced Technology, University of Glamorgan

Hard Disk Storage: Firmware Manipulation And Forensic Impact And Current Best Practice, Gareth Davies, Iain Sutherland

Annual ADFSL Conference on Digital Forensics, Security and Law

The most common form of storage media utilized in both commercial and domestic systems is the hard disk drive, consequently these devices feature heavily in digital investigations. Hard disk drives are a collection of complex components. These components include hardware and firmware elements that are essential for the effective operation of the drive. There are now a number of devices available, intended for data recovery, which can be used to manipulate the firmware components contained within the drive. It has been previously shown that it is possible to alter firmware for malicious purposes, either to conceal information or to prevent …


Organizational Handling Of Digital Evidence, Sheona A. Hoolachan, William B. Glisson 2010 HATII, George Service House, 11 University Gardens, Glasgow, Scotland, UK

Organizational Handling Of Digital Evidence, Sheona A. Hoolachan, William B. Glisson

Annual ADFSL Conference on Digital Forensics, Security and Law

There are a number of factors that impact a digital forensics investigation. These factors include: the digital media in question, implemented processes and methodologies, the legal aspects, and the individuals involved in the investigation. This paper presents the initial idea that Digital Forensic Practice (DFP) recommendations can potentially improve how organizations handle digital evidence. The recommendations are derived from an in-depth survey conducted with practitioners in both commercial organizations and law enforcement along with supporting literature. The recommendations presented in this paper can be used to assess an organization’s existing digital forensics practices and a guide to Digital Forensics Improvement …


A Framework To Integrate The Data Of Interview Investigation And Digital Evidence, Fahad Alshathry 2010 De Montfort University, Software Technology Research laboratory (STRL), Leicester, UK

A Framework To Integrate The Data Of Interview Investigation And Digital Evidence, Fahad Alshathry

Annual ADFSL Conference on Digital Forensics, Security and Law

The physical interview process in crime investigation produces an extremely large amount of data, particularly in big cases. In comparison, examiners of digital evidence have enormous amounts of data to search through whilst looking for data relating to the investigation. However, the links between their results are limited. Whilst investigators need to refute or support their hypothesis throughout, digital evidence examiners often use search based keywords. These keywords are usually created from evidence taken from the physical investigation reports and this basic method has been found to have many shortcomings and limitations. This paper proposes a highly automatic framework to …


Developing Voip Honeypots: A Preliminary Investigation Into Malfeasant Activity, Craig Valli 2010 Secau – Security Research Centre, Edith Cowan University Perth, Western Australia

Developing Voip Honeypots: A Preliminary Investigation Into Malfeasant Activity, Craig Valli

Annual ADFSL Conference on Digital Forensics, Security and Law

30 years ago PABX systems were compromised by hackers wanting to make long distance calls at some other entities expense. This activity faded as telephony became cheaper and PABX systems had countermeasures installed to overcome attacks. Now the world has moved onto the provision of telephony via broadband enabled Voice over Internet Protocol (VoIP) with this service now being provided as a replacement for conventional fixed wire telephony by major telecommunication providers worldwide. Due to increasing bandwidth it is possible for systems to support multiple voice connections simultaneously. The networked nature of the Internet allows for attackers of these VoIP …


Higate (High Grade Anti‐Tamper Equipment) Prototype And Application To E‐Discovery, Yui Sakurai, Yuki Ashino, Tetsutaro Uehara, Hiroshi Yoshiura, Ryoichi Sasaki 2010 The Dept. of Information Systems and Multimedia Design, School of Engineering, Tokyo Denki University

Higate (High Grade Anti‐Tamper Equipment) Prototype And Application To E‐Discovery, Yui Sakurai, Yuki Ashino, Tetsutaro Uehara, Hiroshi Yoshiura, Ryoichi Sasaki

Annual ADFSL Conference on Digital Forensics, Security and Law

These days, most data is digitized and processed in various ways by computers. In the past, computer owners were free to process data as desired and to observe the inputted data as well as the interim results. However, the unrestricted processing of data and accessing of interim results even by computer users is associated with an increasing number of adverse events. These adverse events often occur when sensitive data such as personal or confidential business information must be handled by two or more parties, such as in the case of e-Discovery, used in legal proceedings, or epidemiologic studies. To solve …


Assembly Of Ordered Carbon Shells On Semconducting Nanomaterals, Eli Anguelova Sutter, Peter Werner Sutter 2010 Westhampton Beach, NY

Assembly Of Ordered Carbon Shells On Semconducting Nanomaterals, Eli Anguelova Sutter, Peter Werner Sutter

Department of Electrical and Computer Engineering: Faculty Publications

In some embodiments of the invention, encapsulated semiconducting nanomaterials are described. In certain embodiments the nanostructures described are semiconducting nanomaterials encapsulated with ordered carbon shells. In some aspects a method for producing encapsulated semiconducting nanomaterials is disclosed. In some embodiments applications of encapsulated semiconducting nanomaterials are described.


Developing A Baccalaureate Digital Forensics Major, John H. Riley 2010 Dept. of Mathematics, Computer Science and Statistics, Bloomsburg University

Developing A Baccalaureate Digital Forensics Major, John H. Riley

Annual ADFSL Conference on Digital Forensics, Security and Law

As colleges and universities consider instituting a bachelor’s degree in digital forensics or computer forensics, there are numerous questions to be addressed. While some of these normally occur in the development of any new major, there are aspects of digital forensics which do not often (if ever) occur in other majors. We discuss the issues that should be resolved in the development of a baccalaureate degree program in digital forensics.

Keywords: Digital forensics major. Computer forensics major.


Detection And Filtering Of Landmark Occlusions Using Terrain Spatiograms, Damian M. Lyons 2010 Fordham University

Detection And Filtering Of Landmark Occlusions Using Terrain Spatiograms, Damian M. Lyons

Faculty Publications

A team of robots cooperating to quickly produce a map needs to share landmark information between members so that the local maps can be accurately merged. However, the appearance of landmarks as seen by members of the team can change dramatically due to the phenomenon of occlusion.

We have previously presented an approach to landmark representation using Terrain Spatiograms – an extension to image spatiograms in which the spatial information relates to the scene rather than the image. Because this representation preserves depth structure, it is possible to identify and filter potential occlusions.

We present an approach to identifying and …


A Visual Imagination Approach To Cognitive Robotics, Damian M. Lyons, Sirhan Chaudhry, D. Paul Benjamin 2010 Fordham University

A Visual Imagination Approach To Cognitive Robotics, Damian M. Lyons, Sirhan Chaudhry, D. Paul Benjamin

Faculty Publications

No abstract provided.


How To Relate Fuzzy And Owa Estimates, Tanja Magoc, Vladik Kreinovich 2010 The University of Texas at El Paso

How To Relate Fuzzy And Owa Estimates, Tanja Magoc, Vladik Kreinovich

Departmental Technical Reports (CS)

In many practical situations, we have several estimates x1, ..., xn of the same quantity x, i.e., estimates for which x1 ~ x, x2 ~ x, ..., and xn ~ x. It is desirable to combine (fuse) these estimates into a single estimate for x. From the fuzzy viewpoint, a natural way to combine these estimates is: (1) to describe, for each x and for each i, the degree mu(xi - x) to which x is close to xi, (2) to use a t-norm ("and"-operation) to combine these degrees into a degree to which x is consistent with all n …


Efficient Algorithms For Heavy-Tail Analysis Under Interval Uncertainty, Vladik Kreinovich, Monchaya Chiangpradit, Wararit Panichkitkosolkul 2010 The University of Texas at El Paso

Efficient Algorithms For Heavy-Tail Analysis Under Interval Uncertainty, Vladik Kreinovich, Monchaya Chiangpradit, Wararit Panichkitkosolkul

Departmental Technical Reports (CS)

Most applications of statistics to science and engineering are based on the assumption that the corresponding random variables are normally distributed, i.e., distributed according to Gaussian law in which the probability density function d(x) exponentially decreases with x: d(x) ~ exp(-k * x^2). Normal distributions indeed frequently occur in practice. However, there are also many practical situations, including situations from mathematical finance, in which we encounter heavy-tailed distributions, i.e., distributions in which d(x) decreases as d(x) ~ x^(-a). To properly take this uncertainty into account when making decisions, it is necessary to estimate the parameters of such distributions based on …


Metrization Theorem For Space-Times: From Urysohn's Problem Towards Physically Useful Constructive Mathematics, Vladik Kreinovich 2010 The University of Texas at El Paso

Metrization Theorem For Space-Times: From Urysohn's Problem Towards Physically Useful Constructive Mathematics, Vladik Kreinovich

Departmental Technical Reports (CS)

In the early 1920s, Pavel Urysohn proved his famous lemma (sometimes referred to as "first non-trivial result of point set topology"). Among other applications, this lemma was instrumental in proving that under reasonable conditions, every topological space can be metrized.

A few years before that, in 1919, a complex mathematical theory was experimentally proven to be extremely useful in the description of real world phenomena: namely, during a solar eclipse, General Relativity theory -- that uses pseudo-Riemann spaces to describe space-time -- has been (spectacularly) experimentally confirmed. Motivated by this success, Urysohn started working on an extension of his lemma …


Extending Maximum Entropy Techniques To Entropy Constraints, Gang Xiang, Vladik Kreinovich 2010 The University of Texas at El Paso

Extending Maximum Entropy Techniques To Entropy Constraints, Gang Xiang, Vladik Kreinovich

Departmental Technical Reports (CS)

In many practical situations, we have only partial information about the probabilities. In some cases, we have {\em crisp} (interval) bounds on the probabilities and/or on the related statistical characteristics. In other situations, we have {\em fuzzy} bounds, i.e., different interval bounds with different degrees of certainty.

In a situation with uncertainty, we do not know the exact value of the desired characteristic. In such situations, it is desirable to find its worst possible value, its best possible value, and its "typical" value -- corresponding to the "most probable" probability distribution. Usually, as such a "typical" distribution, we select the …


Coping With The Curse Of Dimensionality By Combining Linear Programming And Reinforcement Learning, Scott H. Burton 2010 Utah State University

Coping With The Curse Of Dimensionality By Combining Linear Programming And Reinforcement Learning, Scott H. Burton

All Graduate Theses and Dissertations, Spring 1920 to Summer 2023

Reinforcement learning techniques offer a very powerful method of finding solutions in unpredictable problem environments where human supervision is not possible. However, in many real world situations, the state space needed to represent the solutions becomes so large that using these methods becomes infeasible. Often the vast majority of these states are not valuable in finding the optimal solution. This work introduces a novel method of using linear programming to identify and represent the small area of the state space that is most likely to lead to a near-optimal solution, significantly reducing the memory requirements and time needed to arrive …


Constraint Programming Techniques For Generating Efficient Hardware Architectures For Field Programmable Gate Arrays, Atul Kumar Shah 2010 Utah State University

Constraint Programming Techniques For Generating Efficient Hardware Architectures For Field Programmable Gate Arrays, Atul Kumar Shah

All Graduate Theses and Dissertations, Spring 1920 to Summer 2023

This thesis presents an approach for modeling and generating efficient hardware architectures using constraint programming techniques, targeting field programmable gate arrays (FPGAs). The focus of this thesis is the derivation of optimal or near-optimal schedules for streaming applications from data flow graphs (DFGs). The resulting schedules are then used to facilitate the architecture generation process. Most streaming applications, like digital singal processing (DSP) algorithms, are repetitive in nature: the same computation is performed on different data items. This repetitive nature of streaming applications can be used to expose additional parallelism available across different iterations, by creating multiple instances of the …


Cooperative Remote Sensing And Actuation Using Networked Unmanned Vehicles, Haiyang Chao 2010 Utah State University

Cooperative Remote Sensing And Actuation Using Networked Unmanned Vehicles, Haiyang Chao

All Graduate Theses and Dissertations, Spring 1920 to Summer 2023

This dissertation focuses on how to design and employ networked unmanned vehicles for remote sensing and distributed control purposes in the current information-rich world. The target scenarios are environmental or agricultural applications such as river/reservoir surveillance, wind profiling measurement, and monitoring/control of chemical leaks, etc. AggieAir, a small and low-cost unmanned aircraft system, is designed based on the remote sensing requirements from environmental monitoring missions. The state estimation problem and the advanced lateral flight controller design problem are further attacked focusing on the small unmanned aerial vehicle (UAV) platform. Then the UAV-based remote sensing problem is focused with further flight …


Decentralized Coordination Of Multiple Autonomous Vehicles, Yongcan Cao 2010 Utah State University

Decentralized Coordination Of Multiple Autonomous Vehicles, Yongcan Cao

All Graduate Theses and Dissertations, Spring 1920 to Summer 2023

This dissertation focuses on the study of decentralized coordination algorithms of multiple autonomous vehicles. Here, the term decentralized coordination is used to refer to the behavior that a group of vehicles reaches the desired group behavior via local interaction. Research is conducted towards designing and analyzing distributed coordination algorithms to achieve desired group behavior in the presence of none, one, and multiple group reference states.

Decentralized coordination in the absence of any group reference state is a very active research topic in the systems and controls society. We first focus on studying decentralized coordination problems for both single-integrator kinematics and …


Digital Commons powered by bepress