Physical Sciences and Mathematics Commons^™

U-No: U-Shaped Neural Operators, Md Ashiqur Rahman, Zachary E Ross, Kamyar Azizzadenesheli

Department of Computer Science Faculty Publications

Neural operators generalize classical neural networks to maps between infinite-dimensional spaces, e.g., function spaces. Prior works on neural operators proposed a series of novel methods to learn such maps and demonstrated unprecedented success in learning solution operators of partial differential equations. Due to their close proximity to fully connected architectures, these models mainly suffer from high memory usage and are generally limited to shallow deep learning models. In this paper, we propose U-shaped Neural Operator (U-NO), a U-shaped memory enhanced architecture that allows for deeper neural operators. U-NOs exploit the problem structures in function predictions and demonstrate fast training, data …

Design Of Wireless Sensors For Iot With Energy Storage And Communication Channel Heterogeneity, Paul N. Borza, Mihai Machedon-Pisu, Felix G. Hamza-Lup

Department of Computer Science Faculty Publications

Autonomous Wireless Sensors (AWSs) are at the core of every Wireless Sensor Network (WSN). Current AWS technology allows the development of many IoT-based applications, ranging from military to bioengineering and from industry to education. The energy optimization of AWSs depends mainly on: Structural, functional, and application specifications. The holistic design methodology addresses all the factors mentioned above. In this sense, we propose an original solution based on a novel architecture that duplicates the transceivers and also the power source using a hybrid storage system. By identifying the consumption needs of the transceivers, an appropriate methodology for sizing and controlling the …

Text Summarization Techniques: A Brief Survey, Mehdi Allahyari, Seyedamin Pouriyeh, Mehdi Assefi, Saeid Safaei, Elizabeth D. Trippe, Juan B. Gutierrez, Krys Kochut

Department of Computer Science Faculty Publications

In recent years, there has been a explosion in the amount of text data from a variety of sources. This volume of text is an invaluable source of information and knowledge which needs to be effectively summarized to be useful. Text summarization is the task of shortening a text document into a condensed version keeping all the important information and content of the original document. In this review, the main approaches to automatic text summarization are described. We review the different processes for summarization and describe the effectiveness and shortcomings of the different methods.

A Knowledge-Based Topic Modeling Approach For Automatic Topic Labeling, Mehdi Allahyari, Seyedamin Pouriyeh, Krys Kochut, Hamid Reza Arabnia

Department of Computer Science Faculty Publications

Probabilistic topic models, which aim to discover latent topics in text corpora define each document as a multinomial distributions over topics and each topic as a multinomial distributions over words. Although, humans can infer a proper label for each topic by looking at top representative words of the topic but, it is not applicable for machines. Automatic Topic Labeling techniques try to address the problem. The ultimate goal of topic labeling techniques are to assign interpretable labels for the learned topics. In this paper, we are taking concepts of ontology into consideration instead of words alone to improve the quality …

G-Cpt Symmetry Of Quantum Emergence And Submergence -- An Information Conservational Multiagent Cellular Automata Unification Of Cpt Symmetry And Cp Violation For Equilibrium-Based Many-World Causal Analysis Of Quantum Coherence And Decoherence, Wen-Ran Zhang

Department of Computer Science Faculty Publications

An equilibrium-based YinYang bipolar dynamic Generalization of CPT (G -CPT) symmetry is introduced based on energy/information conservational quantum emergence-submergence. As a bottleneck of quantum computing, quantum decoherence or collapse has been plaguing quantum mechanics for decades. It is suggested that the crux of the problem can trace its origin back to the incompleteness of CPT symmetry due to the lack of holistic representation for equilibrium-based bipolar coexistence. In this work, the notion of quantum emergence-submergence is coined as two opposite processes with bipolar energy/information conservation. The new notion leads to G-CPT symmetry supported by a Bipolar Quantum Cellular Automata (BQCA) …

Single Machine Scheduling With Job-Dependent Machine Deterioration, Wenchang Luo, Xu Yao, Weitian Tong, Guohui Lin

Department of Computer Science Faculty Publications

We consider the single machine scheduling problem with job-dependent machine deterioration. In the problem, we are given a single machine with an initial non-negative maintenance level, and a set of jobs each with a non-preemptive processing time and a machine deterioration. Such a machine deterioration quantifies the decrement in the machine maintenance level after processing the job. To avoid machine breakdown, one should guarantee a non-negative maintenance level at any time point; and whenever necessary, a maintenance activity must be allocated for restoring the machine maintenance level. The goal of the problem is to schedule the jobs and the maintenance …

Entropyexplorer: An R Package For Computing And Comparing Differential Shannon Entropy, Kai Wang, Charles A. Philips, Arnold M. Saxton, Michael A. Langston

Department of Computer Science Faculty Publications

Background: Differential Shannon entropy (DSE) and differential coefficient of variation (DCV) are effective metrics for the study of gene expression data. They can serve to augment differential expression (DE), and be applied in numerous settings whenever one seeks to measure differences in variability rather than mere differences in magnitude. A general purpose, easily accessible tool for DSE and DCV would help make these two metrics available to data scientists. Automated p value computations would additionally be useful, and are often easier to interpret than raw test statistic values alone.

Results: EntropyExplorer is an R package for calculating DSE, DCV and …

Yinyang Bipolar Quantum Geometry And Bipolar Quantum Superposition Part I—A Background Independent Geometrical And Logical Exposition Of Dirac 3-Polarizer Experiment, Wen-Ran Zhang, Francesco Marchetti

Department of Computer Science Faculty Publications

Bipolar quantum agent (BQA), bipolar quantum geometry (BQG) and bipolar dynamic logic (BDL) are introduced based on bipolar complementarity – a logical extension to Niels Bohr’s particle-wave YinYang duality principle. Complete geometrical background independence is proposed and BQG is proven completely background independent which leads to the notion of bipolar quantum superposition – an equilibrium-based logical approach to superposition. It is shown that the logical linearity of BDL can be unified with the physical nonlinearity of bipolar dynamic equilibrium. It is proven that a single polarized photon as a BQA can be logically channeled through the three polarizers in Dirac’s …

Yinyang Bipolar Quantum Geometry And Bipolar Quantum Superposition Part Ii—Toward An Equilibrium-Based Analytical Paradigm Of Quantum Mechanics And Quantum Biology, Wen-Ran Zhang, Francesco Marchetti

Department of Computer Science Faculty Publications

In Part I of this paper, YinYang bipolar quantum agent (BQA), bipolar quantum geometry (BQG) and 2-dimensional generic bipolar quantum superposition are introduced with a geometrical and logical exposition of Dirac 3-polarizer experiment. While the exposition qualifies BQG as a geometry of light, it is shown in this paper that the logical exposition can be extended to an analytical paradigm of quantum mechanics and quantum biology. It is shown that BQG as the geometry of light is also the geometry of Nature with a logical unification of matter and antimatter atoms into a bipolar quantum cellular automaton (BQCA) through multidimensional …

Isomorphism And Similarity For 2-Generation Pedigrees, Haitao Jiang, Guohui Lin, Weitian Tong, Daming Zhu, Binhai Zhu

Department of Computer Science Faculty Publications

We consider the emerging problem of comparing the similarity between (unlabeled) pedigrees. More specifically, we focus on the simplest pedigrees, namely, the 2-generation pedigrees. We show that the isomorphism testing for two 2-generation pedigrees is GI-hard. If the 2-generation pedigrees are monogamous (i.e., each individual at level-1 can mate with exactly one partner) then the isomorphism testing problem can be solved in polynomial time. We then consider the problem by relaxing it into an NP-complete decomposition problem which can be formulated as the Minimum Common Integer Pair Partition (MCIPP) problem, which we show to be FPT by exploiting a property …

Bipolar Quantum Logic Gates And Quantum Cellular Combinatorics – A Logical Extension To Quantum Entanglement, Wen-Ran Zhang

Department of Computer Science Faculty Publications

Based on bipolar dynamic logic (BDL) and bipolar quantum linear algebra (BQLA) this work introduces bipolar quantum logic gates and quantum cellular combinatorics with a logical interpretation to quantum entanglement. It is shown that: 1) BDL leads to logically definable causality and generic particle-antiparticle bipolar quantum entanglement; 2) BQLA makes composite atom-atom bipolar quantum entanglement reachable. Certain logical equivalence is identified between the new interpretation and established ones. A logical reversibility theorem is presented for ubiquitous quantum computing. Physical reversibility is briefly discussed. It is shown that a bipolar matrix can be either a modular generalization of a quantum logic …

Matching Phosphorylation Response Patterns Of Antigen-Receptor-Stimulated T Cells Via Flow Cytometry, Ariful Azad, Saumyadipta Pyne, Alex Pothen

Department of Computer Science Faculty Publications

Background

When flow cytometric data on mixtures of cell populations are collected from samples under different experimental conditions, computational methods are needed (a) to classify the samples into similar groups, and (b) to characterize the changes within the corresponding populations due to the different conditions. Manual inspection has been used in the past to study such changes, but high-dimensional experiments necessitate developing new computational approaches to this problem. A robust solution to this problem is to construct distinct templates to summarize all samples from a class, and then to compare these templates to study the changes across classes or conditions. …

Beyond Spacetime Geometry – The Death Of Philosophy And Its Quantum Reincarnation, Wen-Ran Zhang

Department of Computer Science Faculty Publications

Contrary to the “end” and “death” assertions on philosophy, this paper predicts an equilibrium-based and harmony-centered scientific reincarnation of philosophy. Logically, the reincarnation is backed by a formal system and a background independent geometry that transcends spacetime. Physically, it is supported by definable quantum causality and bipolar logical unifications of matter and antimatter, particle and wave, big bang and black hole, relativity and quantum entanglement. Philosophically, it is distinguished from Western metaphysics and dialectics as well as the Dao of Laozi. It is named a quantum reincarnation for its central claim that YinYang bipolar quantum entanglement is the source of …

Yin Yang Bipolar Atom - An Eastern Road Toward Quantum Gravity, Wen-Ran Zhang

Department of Computer Science Faculty Publications

Based on bipolar dynamic logic and bipolar quantum linear algebra, a causal theory of YinYang bipolar atom is introduced in a completely background independent geometry that transcends spacetime. The causal theory leads to an equilibrium-based super symmetrical quantum cosmology of negative-positive energies. It is contended that the new theory has opened an Eastern road toward quantum gravity with bipolar logical unifications of particle and wave, matter and antimatter, relativity and quantum entanglement. Information recovery after a black hole is discussed. It is shown that not only can the new theory be applied in physical worlds but also in logical, mental, …

Two Approximate Minkowski Sum Algorithms, Victor Milenkovic, Elisha P. Sacks

Department of Computer Science Faculty Publications

We present two approximate Minkowski sum algorithms for planar regions bounded by line and circle segments. Both algorithms form a convolution curve, construct its arrangement, and use winding numbers to identify sum cells. The first uses the kinetic convolution and the second uses our monotonic convolution. The asymptotic running times of the exact algorithms are increased by kmlogm with m the number of segments in the convolution and with k the number of segment triples that are in cyclic vertical order due to approximate segment intersection. The approximate Minkowski sum is close to the exact sum of perturbation regions that …

Controlled Linear Perturbation, Elisha P. Sacks, Victor Milenkovic, Min-Ho Kyung

Department of Computer Science Faculty Publications

We present an algorithmic solution to the robustness problem in computational geometry, called controlled linear perturbation, and demonstrate it on Minkowski sums of polyhedra. The robustness problem is how to implement real RAM algorithms accurately and efficiently using computer arithmetic. Approximate computation in floating point arithmetic is efficient but can assign incorrect signs to geometric predicates, which can cause combinatorial errors in the algorithm output. We make approximate computation accurate by performing small input perturbations, which we compute using differential calculus. This strategy supports fast, accurate Minkowski sum computation. The only prior robust implementation uses a less efficient algorithm, requires …

Engaging Students In Information Storage Management Courses, Vladan Jovanovic, Timur Mirzoev, Lee Toderick, Rick Homkes, Mark Stockman

Department of Computer Science Faculty Publications

This panel will elaborate on faculty experiences with specific ways used to engage students in the Information Storage and Management, formerly Storage Technology, and the Virtualization coursework. The emphasize of the discussion will be on the mechanisms used in engaging students in learning and on experiences with various activities helpful for varying learning preferences/modes. All invited panelists are experienced faculty involved with subject matter courses via EMC’s Academic Alliance program. The resources made available via this alliance and through exchange among the faculty involved in teaching related subjects in IT and CS programs will be discussed and evaluated. The impact …