Open Access. Powered by Scholars. Published by Universities.®
- Institution
-
- University of Dayton (56)
- University of Denver (10)
- City University of New York (CUNY) (8)
- California Polytechnic State University, San Luis Obispo (7)
- San Jose State University (7)
-
- University of South Alabama (6)
- Chapman University (5)
- Eastern Washington University (4)
- Southern Methodist University (4)
- The University of Akron (4)
- University of Arkansas, Fayetteville (4)
- California State University, San Bernardino (3)
- Claremont Colleges (3)
- Georgia Southern University (3)
- Montclair State University (3)
- Technological University Dublin (3)
- University of Nebraska at Omaha (3)
- Virginia Commonwealth University (3)
- Central Washington University (2)
- Dakota State University (2)
- Fort Hays State University (2)
- LSU New Orleans (2)
- Nova Southeastern University (2)
- Purdue University (2)
- University at Albany, State University of New York (2)
- University of Nebraska - Lincoln (2)
- University of Nevada, Las Vegas (2)
- University of New Mexico (2)
- University of Texas at Arlington (2)
- Western University (2)
- Keyword
-
- Computer science (9)
- Algorithms (8)
- Computer Science (6)
- Machine Learning (6)
- Peer-to-peer computing (6)
-
- Graph theory (5)
- Machine learning (5)
- Probability (5)
- Cryptography (4)
- Delay (4)
- Pathfinding (4)
- Procedural Generation (4)
- Python (4)
- Resilience (4)
- Simulation (4)
- Analytical models (3)
- Bioinformatics (3)
- Classification (3)
- Clustering (3)
- Daniel Felix Ritchie School of Engineering and Computer Science (3)
- Deep Learning (3)
- Deep learning (3)
- History (3)
- Large-scale systems (3)
- Navigation (3)
- P2P networks (3)
- Peer to peer computing (3)
- Peer-to-peer (3)
- Random processes (3)
- User churn (3)
- Publication Year
- Publication
-
- Computer Science Faculty Publications (41)
- MAICS: The Modern Artificial Intelligence and Cognitive Science Conference (12)
- Moving AI Lab: 2D Maps and Benchmark Problems (7)
- Dissertations, Theses, and Capstone Projects (5)
- Electronic Theses and Dissertations (5)
-
- Master's Projects (5)
- Computer Science and Computer Engineering Undergraduate Honors Theses (4)
- EWU Masters Thesis Collection (4)
- Honors Theses (4)
- Master's Theses (4)
- Williams Honors College, Honors Research Projects (4)
- CMC Senior Theses (3)
- Department of Computer Science Faculty Scholarship and Creative Works (3)
- SMU Data Science Review (3)
- Theses and Dissertations (3)
- All Master's Theses (2)
- Branch Mathematics and Statistics Faculty and Staff Publications (2)
- CCAC Theses and Dissertations (2)
- Computer Science Working Papers (2)
- Computer Science and Software Engineering (2)
- Conference papers (2)
- Dissertations (2)
- Dissertations and Theses (2)
- Electronic Theses & Dissertations (2024 - present) (2)
- Electronic Theses, Projects, and Dissertations (2)
- Faculty Publications (2)
- Honors College Theses (2)
- LSU New Orleans Theses and Dissertations (2)
- Mathematics, Physics, and Computer Science Faculty Articles and Research (2)
- UNO Student Research and Creative Activity Fair (2)
- Publication Type
- File Type
Articles 91 - 120 of 191
Full-Text Articles in Theory and Algorithms
The Chapman Bone Algorithm: A Diagnostic Alternative For The Evaluation Of Osteoporosis, Elise Levesque, Anton Ketterer, Wajiha Memon, Cameron James, Noah Barrett, Cyril Rakovski, Frank Frisch
The Chapman Bone Algorithm: A Diagnostic Alternative For The Evaluation Of Osteoporosis, Elise Levesque, Anton Ketterer, Wajiha Memon, Cameron James, Noah Barrett, Cyril Rakovski, Frank Frisch
Mathematics, Physics, and Computer Science Faculty Articles and Research
Osteoporosis is the most common metabolic bone disease and goes largely undiagnosed throughout the world, due to the inaccessibility of DXA machines. Multivariate analyses of serum bone turnover markers were evaluated in 226 Orange County, California, residents with the intent to determine if serum osteocalcin and serum pyridinoline cross-links could be used to detect the onset of osteoporosis as effectively as a DXA scan. Descriptive analyses of the demographic and lab characteristics of the participants were performed through frequency, means and standard deviation estimations. We implemented logistic regression modeling to find the best classification algorithm for osteoporosis. All calculations and …
Rationality And Efficient Verifiable Computation, Matteo Campanelli
Rationality And Efficient Verifiable Computation, Matteo Campanelli
Dissertations, Theses, and Capstone Projects
In this thesis, we study protocols for delegating computation in a model where one of the parties is rational. In our model, a delegator outsources the computation of a function f on input x to a worker, who receives a (possibly monetary) reward. Our goal is to design very efficient delegation schemes where a worker is economically incentivized to provide the correct result f(x). In this work we strive for not relying on cryptographic assumptions, in particular our results do not require the existence of one-way functions.
We provide several results within the framework of rational proofs introduced by Azar …
An Algorithmic Approach To Creating Effective Study Groups Using A Smart Phone App, Kelvin J. Rosado-Ayala
An Algorithmic Approach To Creating Effective Study Groups Using A Smart Phone App, Kelvin J. Rosado-Ayala
Honors College Theses
For many students entering college, meeting new people and studying are a common struggle. Study groups are generally recommended, especially if the groups are comprised of members with complementary personality traits. But the challenge still remains, how do freshmen or transfer students find and form these heterogeneous study groups. In order to help alleviate this issue, an Android application was developed to automatically create study groups for students. Using basic information provided by students upon registration, the algorithm is able to automatically find matching group members. The application was designed using an agile life cycle model over the course of …
Finding Spanning Trees In Strongly Connected Graphs With Per-Vertex Degree Constraints, Samuel Benjamin Chase
Finding Spanning Trees In Strongly Connected Graphs With Per-Vertex Degree Constraints, Samuel Benjamin Chase
Computer Science and Software Engineering
In this project, I sought to develop and prove new algorithms to create spanning trees on general graphs with per-vertex degree constraints. This means that each vertex in the graph would have some additional value, a degree constraint d. For a spanning tree to be correct, every vertex vi in the spanning tree must have a degree exactly equal to a degree constraint di. This poses an additional constraint on what would otherwise be a trivial spanning tree problem. In this paper, two proofs related to my studies will be discussed and analyzed, leading to my algorithm …
Topographic Maps: Image Processing And Path-Finding, Calin Washington
Topographic Maps: Image Processing And Path-Finding, Calin Washington
Master's Theses
Topographic maps are an invaluable tool for planning routes through unfamiliar terrain. However, accurately planning routes on topographic maps is a time- consuming and error-prone task. One factor is the difficulty of interpreting the map itself, which requires prior knowledge and practice. Another factor is the difficulty of making choices between possible routes that have different trade-offs between length and the terrain they traverse.
To alleviate these difficulties, this thesis presents a system to automate the process of finding routes on scanned images of topographic maps. The system allows users to select any two points on a topographic map and …
Blockchain In Payment Card Systems, Darlene Godfrey-Welch, Remy Lagrois, Jared Law, Russell Scott Anderwald, Daniel W. Engels
Blockchain In Payment Card Systems, Darlene Godfrey-Welch, Remy Lagrois, Jared Law, Russell Scott Anderwald, Daniel W. Engels
SMU Data Science Review
Payment cards (e.g., credit and debit cards) are the most frequent form of payment in use today. A payment card transaction entails many verification information exchanges between the cardholder, merchant, issuing bank, a merchant bank, and third-party payment card processors. Today, a record of the payment transaction often records to multiple ledgers. Merchant’s incur fees for both accepting and processing payment cards. The payment card industry is in dire need of technology which removes the need for third-party verification and records transaction details to a single tamper-resistant digital ledger. The private blockchain is that technology. Private blockchain provides a linked …
Understanding Natural Keyboard Typing Using Convolutional Neural Networks On Mobile Sensor Data, Travis Siems
Understanding Natural Keyboard Typing Using Convolutional Neural Networks On Mobile Sensor Data, Travis Siems
Computer Science and Engineering Theses and Dissertations
Mobile phones and other devices with embedded sensors are becoming increasingly ubiquitous. Audio and motion sensor data may be able to detect information that we did not think possible. Some researchers have created models that can predict computer keyboard typing from a nearby mobile device; however, certain limitations to their experiment setup and methods compelled us to be skeptical of the models’ realistic prediction capability. We investigate the possibility of understanding natural keyboard typing from mobile phones by performing a well-designed data collection experiment that encourages natural typing and interactions. This data collection helps capture realistic vulnerabilities of the security …
Relating Justification Logic Modality And Type Theory In Curry–Howard Fashion, Konstantinos Pouliasis
Relating Justification Logic Modality And Type Theory In Curry–Howard Fashion, Konstantinos Pouliasis
Dissertations, Theses, and Capstone Projects
This dissertation is a work in the intersection of Justification Logic and Curry--Howard Isomorphism. Justification logic is an umbrella of modal logics of knowledge with explicit evidence. Justification logics have been used to tackle traditional problems in proof theory (in relation to Godel's provability) and philosophy (Gettier examples, Russel's barn paradox). The Curry--Howard Isomorphism or proofs-as-programs is an understanding of logic that places logical studies in conjunction with type theory and -- in current developments -- category theory. The point being that understanding a system as a logic, a typed calculus and, a language of a class of categories constitutes …
Glyph Based Segmentation Of Chinese Calligraphy Characters In The "Collected Characters" Stele., David A. Mcinnis
Glyph Based Segmentation Of Chinese Calligraphy Characters In The "Collected Characters" Stele., David A. Mcinnis
EWU Masters Thesis Collection
Text character segmentation is the process of detecting the bounding box position of individual characters within a written text document image. The character segmentation problem remains extremely difficult for ancient Chinese calligraphy documents. This paper examines a glyph-based segmentation technique for segmenting Chinese Calligraphy characters in the "Collected Characters". The glyph-based character segmentation pipeline utilizes a combination of well-understood image processing techniques in a novel pipeline which is able to detect Chinese calligraphy characters from ink-blots with a good reliability.
A Practical And Efficient Algorithm For The K-Mismatch Shortest Unique Substring Finding Problem, Daniel Robert Allen
A Practical And Efficient Algorithm For The K-Mismatch Shortest Unique Substring Finding Problem, Daniel Robert Allen
EWU Masters Thesis Collection
This thesis revisits the k-mismatch shortest unique substring (SUS) finding problem and demonstrates that a technique recently presented in the context of solving the k-mismatch average common substring problem can be adapted and combined with parts of the existing solution, resulting in a new algorithm which has expected time complexity of O(n logk n), while maintaining a practical space complexity at O(kn), where n is the string length. When k > 0, which is the hard case, the new proposal significantly improves the any-case O(n2) time complexity of the prior best method for k-mismatch SUS finding. Experimental study …
Design And Implementation Of A Stand-Alone Tool For Metabolic Simulations, Milad Ghiasi Rad
Design And Implementation Of A Stand-Alone Tool For Metabolic Simulations, Milad Ghiasi Rad
School of Computing: Dissertations, Theses, and Student Research
In this thesis, we present the design and implementation of a stand-alone tool for metabolic simulations. This system is able to integrate custom-built SBML models along with external user’s input information and produces the estimation of any reactants participating in the chain of the reactions in the provided model, e.g., ATP, Glucose, Insulin, for the given duration using numerical analysis and simulations. This tool offers the food intake arguments in the calculations to consider the personalized metabolic characteristics in the simulations. The tool has also been generalized to take into consideration of temporal genomic information and be flexible for simulation …
Web Application For Graduate Course Advising System, Sanjay Karrolla
Web Application For Graduate Course Advising System, Sanjay Karrolla
Electronic Theses, Projects, and Dissertations
The main aim of the course recommendation system is to build a course recommendation path for students to help them plan courses to successfully graduate on time. The Model-View-Controller (MVC) architecture is used to isolate the user interface (UI) design from the business logic. The front-end of the application develops the UI using AngularJS. The front-end design is done by gathering the functionality system requirements -- input controls, navigational components, informational components and containers and usability testing. The back-end of the application involves setting up the database and server-side routing. Server-side routing is done using Express JS.
Morphogenesis And Growth Driven By Selection Of Dynamical Properties, Yuri Cantor
Morphogenesis And Growth Driven By Selection Of Dynamical Properties, Yuri Cantor
Dissertations, Theses, and Capstone Projects
Organisms are understood to be complex adaptive systems that evolved to thrive in hostile environments. Though widely studied, the phenomena of organism development and growth, and their relationship to organism dynamics is not well understood. Indeed, the large number of components, their interconnectivity, and complex system interactions all obscure our ability to see, describe, and understand the functioning of biological organisms.
Here we take a synthetic and computational approach to the problem, abstracting the organism as a cellular automaton. Such systems are discrete digital models of real-world environments, making them more accessible and easier to study then their physical world …
Ancr—An Adaptive Network Coding Routing Scheme For Wsns With Different-Success-Rate Links †, Xiang Ji, Anwen Wang, Chunyu Li, Chun Ma, Yao Peng, Dajin Wang, Qingyi Hua, Feng Chen, Dingyi Fang
Ancr—An Adaptive Network Coding Routing Scheme For Wsns With Different-Success-Rate Links †, Xiang Ji, Anwen Wang, Chunyu Li, Chun Ma, Yao Peng, Dajin Wang, Qingyi Hua, Feng Chen, Dingyi Fang
Department of Computer Science Faculty Scholarship and Creative Works
As the underlying infrastructure of the Internet of Things (IoT), wireless sensor networks (WSNs) have been widely used in many applications. Network coding is a technique in WSNs to combine multiple channels of data in one transmission, wherever possible, to save node’s energy as well as increase the network throughput. So far most works on network coding are based on two assumptions to determine coding opportunities: (1) All the links in the network have the same transmission success rate; (2) Each link is bidirectional, and has the same transmission success rate on both ways. However, these assumptions may not be …
Parallelization Of Molecular Docking Algorithms Using Cuda For Use In Drug Discovery, Brandon Stewart, Jonathan Fine, Gaurav Chopra Phd
Parallelization Of Molecular Docking Algorithms Using Cuda For Use In Drug Discovery, Brandon Stewart, Jonathan Fine, Gaurav Chopra Phd
The Summer Undergraduate Research Fellowship (SURF) Symposium
Traditional drug discovery methodology uses a multitude of software packages to design and evaluate new drug-like compounds. While software packages implement a wide variety of methods, the serial (i.e. single core) implementation for many of these algorithms, prohibit large scale docking, such as proteome-wide docking (i.e. thousands of compounds with thousands of proteins). Several docking algorithms can be parallelized, significantly reducing the runtime of the calculations, thus enabling large-scale docking. Implementing algorithms that take advantage of the distributed nature of graphical processing units (GPUs) via the Compute Unified Device Architecture (CUDA) enables us to efficiently implement massively parallel algorithms. Two …
An Analysis Of The Application Of Simplified Silhouette To The Evaluation Of K-Means Clustering Validity, Fei Wang, Hector-Hugo Franco-Penya, John D. Kelleher, John Pugh, Robert J. Ross
An Analysis Of The Application Of Simplified Silhouette To The Evaluation Of K-Means Clustering Validity, Fei Wang, Hector-Hugo Franco-Penya, John D. Kelleher, John Pugh, Robert J. Ross
Conference papers
Silhouette is one of the most popular and effective internal measures for the evaluation of clustering validity. Simplified Silhouette is a computationally simplified version of Silhouette. However, to date Simplified Silhouette has not been systematically analysed in a specific clustering algorithm. This paper analyses the application of Simplified Silhouette to the evaluation of k-means clustering validity and compares it with the k-means Cost Function and the original Silhouette from both theoretical and empirical perspectives. The theoretical analysis shows that Simplified Silhouette has a mathematical relationship with both the k-means Cost Function and the original Silhouette, while empirically, we show that …
Educational Magic Tricks Based On Error-Detection Schemes, Ronald I. Greenberg
Educational Magic Tricks Based On Error-Detection Schemes, Ronald I. Greenberg
Computer Science: Faculty Publications and Other Works
Magic tricks based on computer science concepts help grab student attention and can motivate them to delve more deeply. Error detection ideas long used by computer scientists provide a rich basis for working magic; probably the most well known trick of this type is one included in the CS Unplugged activities. This paper shows that much more powerful variations of the trick can be performed, some in an unplugged environment and some with computer assistance. Some of the tricks also show off additional concepts in computer science and discrete mathematics.
Influence Detection And Spread Estimation In Social Networks, Madhura Kaple
Influence Detection And Spread Estimation In Social Networks, Madhura Kaple
Master's Projects
A social network is an online platform, where people communicate and share information with each other. Popular social network features, which make them di erent from traditional communication platforms, are: following a user, re-tweeting a post, liking and commenting on a post etc. Many companies use various social networking platforms extensively as a medium for marketing their products. A xed amount of budget is alloted by the companies to maximize the positive in uence of their product. Every social network consists of a set of users (people) with connections between them. Each user has the potential to extend its in …
Unsupervised Machine Learning In Agent-Based Modeling, Luke D. Robinson
Unsupervised Machine Learning In Agent-Based Modeling, Luke D. Robinson
Celebration of Learning
Agent-based models (ABMs) are used by researchers in a variety of fields to model natural phenomena. In an ABM, a wide range of behaviors and outcomes can be observed based on the parameters of the model. In many cases, these behaviors can be categorized into discrete outcomes identifiable by human observers. Our goal was to use clustering algorithms to identify those outcomes from model output data. For this project, we used data from the NetLogo Wolf Sheep Predation model to explore and evaluate three clustering algorithms from Python's scikit-learn package. If this task can be completed reliably by a computer, …
Optimized Forecasting Of Dominant U.S. Stock Market Equities Using Univariate And Multivariate Time Series Analysis Methods, Michael Schwartz
Optimized Forecasting Of Dominant U.S. Stock Market Equities Using Univariate And Multivariate Time Series Analysis Methods, Michael Schwartz
Computational and Data Sciences Theses
This dissertation documents an investigation into forecasting U.S. stock market equities via two very different time series analysis techniques: 1) autoregressive integrated moving average (ARIMA), and 2) singular spectrum analysis (SSA). Approximately 40% of the S&P 500 stocks are analyzed. Forecasts are generated for one and five days ahead using daily closing prices. Univariate and multivariate structures are applied and results are compared. One objective is to explore the hypothesis that a multivariate model produces superior performance over a univariate configuration. Another objective is to compare the forecasting performance of ARIMA to SSA, as SSA is a relatively recent development …
Network Analytics For The Mirna Regulome And Mirna-Disease Interactions, Joseph Jayakar Nalluri
Network Analytics For The Mirna Regulome And Mirna-Disease Interactions, Joseph Jayakar Nalluri
Theses and Dissertations
miRNAs are non-coding RNAs of approx. 22 nucleotides in length that inhibit gene expression at the post-transcriptional level. By virtue of this gene regulation mechanism, miRNAs play a critical role in several biological processes and patho-physiological conditions, including cancers. miRNA behavior is a result of a multi-level complex interaction network involving miRNA-mRNA, TF-miRNA-gene, and miRNA-chemical interactions; hence the precise patterns through which a miRNA regulates a certain disease(s) are still elusive. Herein, I have developed an integrative genomics methods/pipeline to (i) build a miRNA regulomics and data analytics repository, (ii) create/model these interactions into networks and use optimization techniques, motif …
Data Mining By Grid Computing In The Search For Extrasolar Planets, Oisin Creaner [Thesis]
Data Mining By Grid Computing In The Search For Extrasolar Planets, Oisin Creaner [Thesis]
Doctoral
A system is presented here to provide improved precision in ensemble differential photometry. This is achieved by using the power of grid computing to analyse astronomical catalogues. This produces new catalogues of optimised pointings for each star, which maximise the number and quality of reference stars available. Astronomical phenomena such as exoplanet transits and small-scale structure within quasars may be observed by means of millimagnitude photometric variability on the timescale of minutes to hours. Because of atmospheric distortion, ground-based observations of these phenomena require the use of differential photometry whereby the target is compared with one or more reference stars. …
An Introduction To The Theory And Applications Of Bayesian Networks, Anant Jaitha
An Introduction To The Theory And Applications Of Bayesian Networks, Anant Jaitha
CMC Senior Theses
Bayesian networks are a means to study data. A Bayesian network gives structure to data by creating a graphical system to model the data. It then develops probability distributions over these variables. It explores variables in the problem space and examines the probability distributions related to those variables. It conducts statistical inference over those probability distributions to draw meaning from them. They are good means to explore a large set of data efficiently to make inferences. There are a number of real world applications that already exist and are being actively researched. This paper discusses the theory and applications of …
Special Issue: Neutrosophic Theories Applied In Engineering, Florentin Smarandache, Jun Ye
Special Issue: Neutrosophic Theories Applied In Engineering, Florentin Smarandache, Jun Ye
Branch Mathematics and Statistics Faculty and Staff Publications
Neutrosophic sets and logic are generalizations of fuzzy and intuitionistic fuzzy sets and logic. Neutrosophic sets and logic are gaining significant attention in solving many real life decision making problems that involve uncertainty, impreciseness, vagueness, incompleteness, inconsistent, and indeterminacy. They have been applied in computational intelligence, multiple criteria decision making, image processing, medical diagnoses, etc. This Special Issue presents original research papers that report on state-of-the-art and recent advancements in neutrosophic sets and logic in soft computing, artificial intelligence, big and small data mining, decision making problems, and practical achievements.
Marim: Mobile Augmented Reality For Interactive Manuals, Tam Nguyen, Dorothy Tan, Bilal Mirza, Jose Sepulveda
Marim: Mobile Augmented Reality For Interactive Manuals, Tam Nguyen, Dorothy Tan, Bilal Mirza, Jose Sepulveda
Computer Science Faculty Publications
In this work, we present a practical system which uses mobile devices for interactive manuals. In particular, there are two modes provided in the system, namely, expert/trainer and trainee modes. Given the expert/trainer editor, experts design the step-by-step interactive manuals. For each step, the experts capture the images by using phones/tablets and provide visual instructions such as interest regions, text, and action animations. In the trainee mode, the system utilizes the existing object detection and tracking algorithms to identify the step scene and retrieve the respective instruction to be displayed on the mobile device. The trainee then follows the displayed …
The Contributions Of Anatol Rapoport To Game Theory, Erika Simpson
The Contributions Of Anatol Rapoport To Game Theory, Erika Simpson
Political Science Publications
Game theory is used to rationally and dispassionately examine the strategic behaviour of nations, especially superpower behaviour. This article explains how basic game theory - at its simplest level - was used by Anatol Rapoport to generate ideas about how to enhance world peace. Rapoport was at the forefront of the game theoreticians who sought to conceptualize strategies that could promote international cooperation. Accordingly, the basic logic of game theory is explained using the game models of ‘Chicken’ and ‘Prisoner’s Dilemma’. These models were used by Rapoport in his books and lectures in simple and complex ways. Then Rapoport’s revolutionary …
A Study Of Android Malware Detection Techniques And Machine Learning, Balaji Baskaran, Anca Ralescu
A Study Of Android Malware Detection Techniques And Machine Learning, Balaji Baskaran, Anca Ralescu
MAICS: The Modern Artificial Intelligence and Cognitive Science Conference
Android OS is one of the widely used mobile Operating Systems. The number of malicious applications and adwares are increasing constantly on par with the number of mobile devices. A great number of commercial signature based tools are available on the market which prevent to an extent the penetration and distribution of malicious applications. Numerous researches have been conducted which claims that traditional signature based detection system work well up to certain level and malware authors use numerous techniques to evade these tools. So given this state of affairs, there is an increasing need for an alternative, really tough malware …
Extended Pixel Representation For Image Segmentation, Deeptha Girish, Vineeta Singh, Anca Ralescu
Extended Pixel Representation For Image Segmentation, Deeptha Girish, Vineeta Singh, Anca Ralescu
MAICS: The Modern Artificial Intelligence and Cognitive Science Conference
We explore the use of extended pixel representation for color based image segmentation using the K-means clustering algorithm. Various extended pixel representations have been implemented in this paper and their results have been compared. By extending the representation of pixels an image is mapped to a higher dimensional space. Unlike other approaches, where data is mapped into an implicit features space of higher dimension (kernel methods), in the approach considered here, the higher dimensions are defined explicitly. Preliminary experimental results which illustrate the proposed approach are promising.
An Autonomic Computing System Based On A Rule-Based Policy Engine And Artificial Immune Systems, Rahmira Rufus, William Nick, Joseph Shelton, Albert Esterline
An Autonomic Computing System Based On A Rule-Based Policy Engine And Artificial Immune Systems, Rahmira Rufus, William Nick, Joseph Shelton, Albert Esterline
MAICS: The Modern Artificial Intelligence and Cognitive Science Conference
Autonomic computing systems arose from the notion that complex computing systems should have properties like those of the autonomic nervous system, which coordinates bodily functions and allows attention to be directed to more pressing needs. An autonomic system allows the system administrator to specify high-level policies, which the system maintains without administrator assistance. Policy enforcement can be done with a rule based system such as Jess (a java expert system shell). An autonomic system must be able to monitor itself, and this is often a limiting factor. We are developing an automatic system that has a policy engine and uses …
Towards The Development Of A Cyber Analysis & Advisement Tool (Caat) For Mitigating De-Anonymization Attacks, Siobahn Day, Henry Williams, Joseph Shelton, Gerry Dozier
Towards The Development Of A Cyber Analysis & Advisement Tool (Caat) For Mitigating De-Anonymization Attacks, Siobahn Day, Henry Williams, Joseph Shelton, Gerry Dozier
MAICS: The Modern Artificial Intelligence and Cognitive Science Conference
We are seeing a rise in the number of Anonymous Social Networks (ASN) that claim to provide a sense of user anonymity. However, what many users of ASNs do not know that a person can be identified by their writing style.
In this paper, we provide an overview of a number of author concealment techniques, their impact on the semantic meaning of an author's original text, and introduce AuthorCAAT, an application for mitigating de-anonymization attacks. Our results show that iterative paraphrasing performs the best in terms of author concealment and performs well with respect to Latent Semantic Analysis.