Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Computer Sciences (12)
- Mathematics (5)
- Theory and Algorithms (5)
- Engineering (4)
- Life Sciences (4)
-
- Statistics and Probability (4)
- Applied Mathematics (3)
- Bioinformatics (3)
- Biostatistics (3)
- Databases and Information Systems (3)
- Medicine and Health Sciences (3)
- Electrical and Computer Engineering (2)
- Graphics and Human Computer Interfaces (2)
- OS and Networks (2)
- Other Computer Sciences (2)
- Amino Acids, Peptides, and Proteins (1)
- Applied Statistics (1)
- Artificial Intelligence and Robotics (1)
- Chemicals and Drugs (1)
- Communication (1)
- Communication Technology and New Media (1)
- Environmental Law (1)
- Environmental Sciences (1)
- Genetics and Genomics (1)
- Harmonic Analysis and Representation (1)
- Law (1)
- Natural Resources and Conservation (1)
- Numerical Analysis and Scientific Computing (1)
- Operations Research, Systems Engineering and Industrial Engineering (1)
- Institution
- Publication
- Publication Type
Articles 1 - 22 of 22
Full-Text Articles in Physical Sciences and Mathematics
Filters And Matrix Factorization, Myung-Sin Song, Palle E. T. Jorgensen
Filters And Matrix Factorization, Myung-Sin Song, Palle E. T. Jorgensen
SIUE Faculty Research, Scholarship, and Creative Activity
We give a number of explicit matrix-algorithms for analysis/synthesis
in multi-phase filtering; i.e., the operation on discrete-time signals which
allow a separation into frequency-band components, one for each of the
ranges of bands, say N , starting with low-pass, and then corresponding
filtering in the other band-ranges. If there are N bands, the individual
filters will be combined into a single matrix action; so a representation of
the combined operation on all N bands by an N x N matrix, where the
corresponding matrix-entries are periodic functions; or their extensions to
functions of a complex variable. Hence our setting entails …
On The Analysis Of Some Recursive Equations In Probability., Arunangshu Biswas Dr.
On The Analysis Of Some Recursive Equations In Probability., Arunangshu Biswas Dr.
Doctoral Theses
This thesis deals with recursive systems used in theoretical and applied probability. Recursive systems are stochastic processes {Xn}n≥1 where the Xn depends on the earlier Xn−1 and also on some increment process which is uncorrelated with the process Xn. The simplest example of a recursive system is the Random Walk, whose properties have been extensively studied. Mathematically a recursive system takes the form Xn = f(Xn−1, n), is the increment/ innovation procedure and f(·, ·) is a function on the product space of xn and n. We first consider a recursive system called Self-Normalized sums (SNS) corresponding to a sequence …
Development And Validation Of An Epitope Prediction Tool For Swine (Pigmatrix) Based On The Pocket Profile Method, Andres H. Gutiérrez, William D. Martin, Chris Bailey-Kellogg, Frances Terry, Leonard Moise, Anee S. De Groot
Development And Validation Of An Epitope Prediction Tool For Swine (Pigmatrix) Based On The Pocket Profile Method, Andres H. Gutiérrez, William D. Martin, Chris Bailey-Kellogg, Frances Terry, Leonard Moise, Anee S. De Groot
Dartmouth Scholarship
Background: T cell epitope prediction tools and associated vaccine design algorithms have accelerated the development of vaccines for humans. Predictive tools for swine and other food animals are not as well developed, primarily because the data required to develop the tools are lacking. Here, we overcome a lack of T cell epitope data to construct swine epitope predictors by systematically leveraging available human information. Applying the “pocket profile method ”, we use sequence and structural similarities in the binding pockets of human and swine major histocompatibility complex proteins to infer Swine Leukocyte Antigen (SLA) peptide binding preferences. We developed epitope-prediction …
Answering Why-Not Questions On Reverse Top-K Queries, Yunjun Gao, Qing Liu, Gang Chen, Baihua Zheng, Linlin Zhou
Answering Why-Not Questions On Reverse Top-K Queries, Yunjun Gao, Qing Liu, Gang Chen, Baihua Zheng, Linlin Zhou
Research Collection School Of Computing and Information Systems
Why-not questions, which aim to seek clarifications on the missing tuples for query results, have recently received considerable attention from the database community. In this paper, we systematically explore why-not questions on reverse top-k queries, owing to its importance in multi-criteria decision making. Given an initial reverse top-k query and a missing/why-not weighting vector set Wm that is absent from the query result, why-not questions on reverse top-k queries explain why Wm does not appear in the query result and provide suggestions on how to refine the initial query with minimum penalty to include Wm in the refined query result. …
3d Virtual Worlds And The Metaverse: Current Status And Future Possibilities, John David N. Dionisio, William G. Burns Iii, Richard Gilbert
3d Virtual Worlds And The Metaverse: Current Status And Future Possibilities, John David N. Dionisio, William G. Burns Iii, Richard Gilbert
John David N. Dionisio
Moving from a set of independent virtual worlds to an integrated network of 3D virtual worlds or Metaverse rests on progress in four areas: immersive realism, ubiquity of access and identity, interoperability, and scalability. For each area, the current status and needed developments in order to achieve a functional Metaverse are described. Factors that support the formation of a viable Metaverse, such as institutional and popular interest and ongoing improvements in hardware performance, and factors that constrain the achievement of this goal, including limits in computational methods and unrealized collaboration among virtual world stakeholders and developers, are also considered.
Evaluation Of Data-Path Topologies For Self-Timed Conditional Statements, Navaneeth Prasannakumar Jamadagni
Evaluation Of Data-Path Topologies For Self-Timed Conditional Statements, Navaneeth Prasannakumar Jamadagni
Dissertations and Theses
This research presents a methodology to evaluate data path topologies that implement a conditional statement for an average-case performance that is better than the worst-case performance. A conditional statement executes one of many alternatives depending on how Boolean conditions evaluate to true or false. Alternatives with simple computations take less time to execute. The self-timed designs can exploit the faster executing alternatives and provide an average-case behavior, where the average depends on the frequency of simple and complex computations, and the difference in the completion times of simple and complex computations. The frequency of simple and complex computations depends on …
The Pc-Tree Algorithm, Kuratowski Subdivisions, And The Torus., Charles J. Suer
The Pc-Tree Algorithm, Kuratowski Subdivisions, And The Torus., Charles J. Suer
Electronic Theses and Dissertations
The PC-Tree algorithm of Shih and Hsu (1999) is a practical linear-time planarity algorithm that provides a plane embedding of the given graph if it is planar and a Kuratowski subdivision otherwise. Remarkably, there is no known linear-time algorithm for embedding graphs on the torus. We extend the PC-Tree algorithm to a practical, linear-time toroidality test for K3;3-free graphs called the PCK-Tree algorithm. We also prove that it is NP-complete to decide whether the edges of a graph can be covered with two Kuratowski subdivisions. This greatly reduces the possibility of a polynomial-time toroidality testing algorithm based solely on edge-coverings …
On Supervised And Unsupervised Methodologies For Mining Of Text Data., Tanmay Basu Dr.
On Supervised And Unsupervised Methodologies For Mining Of Text Data., Tanmay Basu Dr.
Doctoral Theses
The supervised and unsupervised methodologies of text mining using the plain text data of English language have been discussed. Some new supervised and unsupervised methodologies have been developed for effective mining of the text data after successfully overcoming some limitations of the existing techniques.The problems of unsupervised techniques of text mining, i.e., document clustering methods are addressed. A new similarity measure between documents has been designed to improve the accuracy of measuring the content similarity between documents. Further, a hierarchical document clustering technique is designed using this similarity measure. The main significance of the clustering algorithm is that the number …
Using Monte Carlo Tree Search For Replanning In A Multistage Simultaneous Game, Daniel Beard, Philip Hingston, Martin Masek
Using Monte Carlo Tree Search For Replanning In A Multistage Simultaneous Game, Daniel Beard, Philip Hingston, Martin Masek
Martin Masek
In this study, we introduce MC-TSAR, a Monte Carlo Tree Search algorithm for strategy selection in simultaneous multistage games. We evaluate the algorithm using a battle planning scenario in which replanning is possible. We show that the algorithm can be used to select a strategy that approximates a Nash equilibrium strategy, taking into account the possibility of switching strategies part way through the execution of the scenario in the light of new information on the progress of the battle.
Hyperlegality And Heightened Surveillance: The Case Of Threatened Species Lists, Irus Braverman
Hyperlegality And Heightened Surveillance: The Case Of Threatened Species Lists, Irus Braverman
Journal Articles
My contribution to the Debate "Thinking about Law and Surveillance" focuses on the project of governing nonhuman species through care, briefly pointing to how law and surveillance are interwoven in this context and to how conservation's biopolitical regimes are increasingly becoming more abstract, standardized, calculable, and algorithmic in scope. I argue that conservation’s focus on governing through care lends itself to heightened modes of surveillance and to hyperlegality - namely, to the intensified inspection and regulation of both governed and governing actors. I start with some preliminary explanations about my atypical use of the terms surveillance, law, and biopolitics.
Probabilistic Inference Based Message-Passing For Resource Constrained Dcops, Supriyo Ghosh, Akshat Kumar, Pradeep Varakantham
Probabilistic Inference Based Message-Passing For Resource Constrained Dcops, Supriyo Ghosh, Akshat Kumar, Pradeep Varakantham
Research Collection School Of Computing and Information Systems
Distributed constraint optimization (DCOP) is an important framework for coordinated multiagent decision making. We address a practically useful variant of DCOP, called resource-constrained DCOP (RC-DCOP), which takes into account agents’ consumption of shared limited resources. We present a promising new class of algorithm for RC-DCOPs by translating the underlying co- ordination problem to probabilistic inference. Using inference techniques such as expectation- maximization and convex optimization machinery, we develop a novel convergent message-passing algorithm for RC-DCOPs. Experiments on standard benchmarks show that our approach provides better quality than previous best DCOP algorithms and has much lower failure rate. Comparisons against an …
Stochastic Optimization Via Forward Slice, Bob A. Salim, Lurdes Y. T. Inoue
Stochastic Optimization Via Forward Slice, Bob A. Salim, Lurdes Y. T. Inoue
UW Biostatistics Working Paper Series
Optimization consists of maximizing or minimizing a real-valued objective function. In many problems, the objective function may not yield closed-form solutions. Over many decades, optimization methods, both deterministic and stochastic, have been developed to provide solutions to these problems. However, some common limitations of these methods are the sensitivity to the initial value and that often current methods only find a local (non-global) extremum. In this article, we propose an alternative stochastic optimization method, which we call "Forward Slice", and assess its performance relative to available optimization methods.
Trip: Tracking Rhythms In Plants, An Automated Leaf Movement Analysis Program For Circadian Period Estimation, Kathleen Greenham, Ping Lou, Sara E. Remsen, Hany Farid, C Robertson Mcclung
Trip: Tracking Rhythms In Plants, An Automated Leaf Movement Analysis Program For Circadian Period Estimation, Kathleen Greenham, Ping Lou, Sara E. Remsen, Hany Farid, C Robertson Mcclung
Dartmouth Scholarship
Background: A well characterized output of the circadian clock in plants is the daily rhythmic movement of leaves. This process has been used extensively in Arabidopsis to estimate circadian period in natural accessions as well as mutants with known defects in circadian clock function. Current methods for estimating circadian period by leaf movement involve manual steps throughout the analysis and are often limited to analyzing one leaf or cotyledon at a time.
Methods: In this study, we describe the development of TRiP (Tracking Rhythms in Plants), a new method for estimating circadian period using a motion estimation algorithm that can …
Optimal "Big Data" Aggregation Systems - From Theory To Practical Application, William J. Culhane Iv
Optimal "Big Data" Aggregation Systems - From Theory To Practical Application, William J. Culhane Iv
Open Access Dissertations
The integration of computers into many facets of our lives has made the collection and storage of staggering amounts of data feasible. However, the data on its own is not so useful to us as the analysis and manipulation which allows manageable descriptive information to be extracted. New tools to extract this information from ever growing repositories of data are required.
Some of these analyses can take the form of a two phase problem which is easily distributed to take advantage of available computing power. The first phase involves computing some descriptive partial result from some subset of the original …
Optcluster : An R Package For Determining The Optimal Clustering Algorithm And Optimal Number Of Clusters., Michael N. Sekula
Optcluster : An R Package For Determining The Optimal Clustering Algorithm And Optimal Number Of Clusters., Michael N. Sekula
Electronic Theses and Dissertations
Determining the best clustering algorithm and ideal number of clusters for a particular dataset is a fundamental difficulty in unsupervised clustering analysis. In biological research, data generated from Next Generation Sequencing technology and microarray gene expression data are becoming more and more common, so new tools and resources are needed to group such high dimensional data using clustering analysis. Different clustering algorithms can group data very differently. Therefore, there is a need to determine the best groupings in a given dataset using the most suitable clustering algorithm for that data. This paper presents the R package optCluster as an efficient …
Sensitivity Of Mixed Models To Computational Algorithms Of Time Series Data, Gunaime Nevine
Sensitivity Of Mixed Models To Computational Algorithms Of Time Series Data, Gunaime Nevine
Doctoral Dissertations
Statistical analysis is influenced by implementation of the algorithms used to execute the computations associated with various statistical techniques. Over many years; very important criteria for model comparison has been studied and examined, and two algorithms on a single dataset have been performed numerous times. The goal of this research is not comparing two or more models on one dataset, but comparing models with numerical algorithms that have been used to solve them on the same dataset.
In this research, different models have been broadly applied in modeling and their contrasting which are affected by the numerical algorithms in different …
Spectral Gene Set Enrichment (Sgse), H Robert Frost, Zhigang Li, Jason H. Moore
Spectral Gene Set Enrichment (Sgse), H Robert Frost, Zhigang Li, Jason H. Moore
Dartmouth Scholarship
Gene set testing is typically performed in a supervised context to quantify the association between groups of genes and a clinical phenotype. In many cases, however, a gene set-based interpretation of genomic data is desired in the absence of a phenotype variable. Although methods exist for unsupervised gene set testing, they predominantly compute enrichment relative to clusters of the genomic variables with performance strongly dependent on the clustering algorithm and number of clusters. We propose a novel method, spectral gene set enrichment (SGSE), for unsupervised competitive testing of the association between gene sets and empirical data sources. SGSE first computes …
Generic Constructions Of Different Cryptographic Primitives Over Various Public Key Paradigms., Sumit Kumar Pandey Dr.
Generic Constructions Of Different Cryptographic Primitives Over Various Public Key Paradigms., Sumit Kumar Pandey Dr.
Doctoral Theses
In this thesis, we study the generic construction of some cryptographic primitives over various public key paradigms like traditional Public Key Cryptosystems and Identity Based Cryptosystems. It can be broadly divided into two categories1. Generic construction of some highly secure cryptographic primitives from less secure cryptographic primitives, and2. Generic construction of some complex cryptographic primitives from basic cryptographic primitives. Mathematical tools provide a way to achieve cryptographic functionality like confidentiality, authentication, data-integrity, non-repudiation etc., but in the case of complex cryptographic functionality like achieving confidentiality and authentication at the same time or confidentiality, authentication and non-repudiation at the same time …
In-Degree Dynamics Of Large-Scale P2p Systems, Zhongmei Yao, Daren B. H. Cline, Dmitri Loguinov
In-Degree Dynamics Of Large-Scale P2p Systems, Zhongmei Yao, Daren B. H. Cline, Dmitri Loguinov
Zhongmei Yao
This paper builds a complete modeling framework for understanding user churn and in-degree dynamics in unstructured P2P systems in which each user can be viewed as a stationary alternating renewal process. While the classical Poisson result on the superposition of n stationary renewal processes for n→∞ requires that each point process become sparser as n increases, it is often difficult to rigorously show this condition in practice. In this paper, we first prove that despite user heterogeneity and non-Poisson arrival dynamics, a superposition of edge-arrival processes to a live user under uniform selection converges to a Poisson process when …
Extracting City Traffic Events From Social Streams, Pramod Anantharam, Payam Barnaghi, Krishnaprasad Thirunarayan, Amit P. Sheth
Extracting City Traffic Events From Social Streams, Pramod Anantharam, Payam Barnaghi, Krishnaprasad Thirunarayan, Amit P. Sheth
Kno.e.sis Publications
Cities are composed of complex systems with physical, cyber, and social components. Current works on extracting and understanding city events mainly rely on technology enabled infrastructure to observe and record events. In this work, we propose an approach to leverage citizen observations of various city systems and services such as traffic, public transport, water supply, weather, sewage, and public safety as a source of city events. We investigate the feasibility of using such textual streams for extracting city events from annotated text. We formalize the problem of annotating social streams such as microblogs as a sequence labeling problem. We present …
Modeling User Transportation Patterns Using Mobile Devices, Erfan Davami
Modeling User Transportation Patterns Using Mobile Devices, Erfan Davami
Electronic Theses and Dissertations
Participatory sensing frameworks use humans and their computing devices as a large mobile sensing network. Dramatic accessibility and affordability have turned mobile devices (smartphone and tablet computers) into the most popular computational machines in the world, exceeding laptops. By the end of 2013, more than 1.5 billion people on earth will have a smartphone. Increased coverage and higher speeds of cellular networks have given these devices the power to constantly stream large amounts of data. Most mobile devices are equipped with advanced sensors such as GPS, cameras, and microphones. This expansion of smartphone numbers and power has created a sensing …
A Dynamic Programming Algorithm For Finding The Optimal Placement Of A Secondary Structure Topology In Cryo-Em Data, Abhishek Biswas, Desh Ranjan, Mohammad Zubair, Jing He
A Dynamic Programming Algorithm For Finding The Optimal Placement Of A Secondary Structure Topology In Cryo-Em Data, Abhishek Biswas, Desh Ranjan, Mohammad Zubair, Jing He
Computer Science Faculty Publications
The determination of secondary structure topology is a critical step in deriving the atomic structures from the protein density maps obtained from electron cryomicroscopy technique. This step often relies on matching the secondary structure traces detected from the protein density map to the secondary structure sequence segments predicted from the amino acid sequence. Due to inaccuracies in both sources of information, a pool of possible secondary structure positions needs to be sampled. One way to approach the problem is to first derive a small number of possible topologies using existing matching algorithms, and then find the optimal placement for each …