Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 10 of 10
Full-Text Articles in Physical Sciences and Mathematics
A Hybrid Deep Learning Approach For Crude Oil Price Prediction, Hind Aldabagh, Xianrong Zheng, Ravi Mukkamala
A Hybrid Deep Learning Approach For Crude Oil Price Prediction, Hind Aldabagh, Xianrong Zheng, Ravi Mukkamala
Computer Science Faculty Publications
Crude oil is one of the world’s most important commodities. Its price can affect the global economy, as well as the economies of importing and exporting countries. As a result, forecasting the price of crude oil is essential for investors. However, crude oil price tends to fluctuate considerably during significant world events, such as the COVID-19 pandemic and geopolitical conflicts. In this paper, we propose a deep learning model for forecasting the crude oil price of one-step and multi-step ahead. The model extracts important features that impact crude oil prices and uses them to predict future prices. The prediction model …
Detecting Deceptive Dark-Pattern Web Advertisements For Blind Screen-Reader Users, Satwick Ram Kodandaram, Mohan Sunkara, Sampath Jayarathna, Vikas Ashok
Detecting Deceptive Dark-Pattern Web Advertisements For Blind Screen-Reader Users, Satwick Ram Kodandaram, Mohan Sunkara, Sampath Jayarathna, Vikas Ashok
Computer Science Faculty Publications
Advertisements have become commonplace on modern websites. While ads are typically designed for visual consumption, it is unclear how they affect blind users who interact with the ads using a screen reader. Existing research studies on non-visual web interaction predominantly focus on general web browsing; the specific impact of extraneous ad content on blind users' experience remains largely unexplored. To fill this gap, we conducted an interview study with 18 blind participants; we found that blind users are often deceived by ads that contextually blend in with the surrounding web page content. While ad blockers can address this problem via …
Unttangling Irregular Actin Cytoskeleton Architectures In Tomograms Of The Cell With Struwwel Tracer, Salim Sazzed, Peter Scheible, Jing He, Willy Wriggers
Unttangling Irregular Actin Cytoskeleton Architectures In Tomograms Of The Cell With Struwwel Tracer, Salim Sazzed, Peter Scheible, Jing He, Willy Wriggers
Computer Science Faculty Publications
In this work, we established, validated, and optimized a novel computational framework for tracing arbitrarily oriented actin filaments in cryo-electron tomography maps. Our approach was designed for highly complex intracellular architectures in which a long-range cytoskeleton network extends throughout the cell bodies and protrusions. The irregular organization of the actin network, as well as cryo-electron-tomography-specific noise, missing wedge artifacts, and map dimensions call for a specialized implementation that is both robust and efficient. Our proposed solution, Struwwel Tracer, accumulates densities along paths of a specific length in various directions, starting from locally determined seed points. The highest-density paths originating …
Systematizing Confidence In Open Research And Evidence (Score), Nazanin Alipourfard, Beatrix Arendt, Daniel M. Benjamin, Noam Benkler, Michael Bishop, Mark Burstein, Martin Bush, James Caverlee, Yiling Chen, Chae Clark, Anna Dreber Almenberg, Timothy M. Errington, Fiona Fidler, Nicholas Fox, Aaron Frank, Hannah Fraser, Scott Friedman, Ben Gelman, James Gentile, Jian Wu, Et Al., Score Collaboration
Systematizing Confidence In Open Research And Evidence (Score), Nazanin Alipourfard, Beatrix Arendt, Daniel M. Benjamin, Noam Benkler, Michael Bishop, Mark Burstein, Martin Bush, James Caverlee, Yiling Chen, Chae Clark, Anna Dreber Almenberg, Timothy M. Errington, Fiona Fidler, Nicholas Fox, Aaron Frank, Hannah Fraser, Scott Friedman, Ben Gelman, James Gentile, Jian Wu, Et Al., Score Collaboration
Computer Science Faculty Publications
Assessing the credibility of research claims is a central, continuous, and laborious part of the scientific process. Credibility assessment strategies range from expert judgment to aggregating existing evidence to systematic replication efforts. Such assessments can require substantial time and effort. Research progress could be accelerated if there were rapid, scalable, accurate credibility indicators to guide attention and resource allocation for further assessment. The SCORE program is creating and validating algorithms to provide confidence scores for research claims at scale. To investigate the viability of scalable tools, teams are creating: a database of claims from papers in the social and behavioral …
Electroencephalogram (Eeg) For Delineating Objective Measure Of Autism Spectrum Disorder, Sampath Jayarathna, Yasith Jayawardana, Mark Jaime, Sashi Thapaliya
Electroencephalogram (Eeg) For Delineating Objective Measure Of Autism Spectrum Disorder, Sampath Jayarathna, Yasith Jayawardana, Mark Jaime, Sashi Thapaliya
Computer Science Faculty Publications
Autism spectrum disorder (ASD) is a developmental disorder that often impairs a child's normal development of the brain. According to CDC, it is estimated that 1 in 6 children in the US suffer from development disorders, and 1 in 68 children in the US suffer from ASD. This condition has a negative impact on a person's ability to hear, socialize, and communicate. Subjective measures often take more time, resources, and have false positives or false negatives. There is a need for efficient objective measures that can help in diagnosing this disease early as possible with less effort. EEG measures the …
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 …
Efficient Corona Training Protocols For Sensor Networks, Alan A. Bertossi, Stephan Olariu, Cristina M. Pinotti
Efficient Corona Training Protocols For Sensor Networks, Alan A. Bertossi, Stephan Olariu, Cristina M. Pinotti
Computer Science Faculty Publications
Phenomenal advances in nano-technology and packaging have made it possible to develop miniaturized low-power devices that integrate sensing, special-purpose computing, and wireless communications capabilities. It is expected that these small devices, referred to as sensors, will be mass-produced and deployed, making their production cost negligible. Due to their small form factor and modest non-renewable energy budget, individual sensors are not expected to be GPS-enabled. Moreover, in most applications, exact geographic location is not necessary, and all that the individual sensors need is a coarse-grain location awareness. The task of acquiring such a coarse-grain location awareness is referred to as training. …
Upper Bounds To The Clique Width Of Graphs, Bruno Courcelle, Stephan Olariu
Upper Bounds To The Clique Width Of Graphs, Bruno Courcelle, Stephan Olariu
Computer Science Faculty Publications
Hierarchical decompositions of graphs are interesting for algorithmic purposes. Many NP complete problems have linear complexity on graphs with tree-decompositions of bounded width. We investigate alternate hierarchical decompositions that apply to wider classes of graphs and still enjoy good algorithmic properties. These decompositions are motivated and inspired by the study of vertex-replacement context-free graph grammars. The complexity measure of graphs associated with these decompositions is called clique width. In this paper we bound the clique width of a graph in terms of its tree width on the one hand, and of the clique width of its edge complement on …
Weak Bipolarizable Graphs, Stephan Olariu
Weak Bipolarizable Graphs, Stephan Olariu
Computer Science Faculty Publications
We characterize a new class of perfectly orderable graphs and give a polynomial-time recognition algorithm, together with linear-time optimization algorithms for this class of graphs.
An Algorithm For The Electromagnetic Scattering Due To An Axially Symmetric Body With An Impedance Boundary Condition, F. Stenger, M. Hagmann, J. Scheing
An Algorithm For The Electromagnetic Scattering Due To An Axially Symmetric Body With An Impedance Boundary Condition, F. Stenger, M. Hagmann, J. Scheing
Computer Science Faculty Publications
Let B be a body in R3, and let S denote the boundary of B. The surface S is described by S = {(x, y, z): (x2 + Y2)½= ƒ(z), -1≤ z ≤ I}, where ƒ analytic function that is real and positive on (-1, 1) and ƒ(±1) = 0. An algorithm is described for computing the scattered field due to a plane wave incident field, under Leontovich boundary conditions. The Galerkin method of solution used here leads to a block diagonal matrix involving 2M …