Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Computer Sciences (9)
- Mathematics (4)
- Programming Languages and Compilers (4)
- Discrete Mathematics and Combinatorics (3)
- Software Engineering (3)
-
- Arts and Humanities (2)
- Chemistry (2)
- Composition (2)
- Library and Information Science (2)
- Music (2)
- Physics (2)
- Quantum Physics (2)
- Social and Behavioral Sciences (2)
- Theory and Algorithms (2)
- Ecology and Evolutionary Biology (1)
- Environmental Monitoring (1)
- Environmental Sciences (1)
- Life Sciences (1)
- Keyword
-
- Computational Creativity (2)
- Quantum computing (2)
- Quantum information (2)
- Adoption (1)
- Analysis of Boolean functions (1)
-
- Assessment (1)
- Computational learning theory (1)
- Cryptography (1)
- Data (1)
- Ecosystem (1)
- Flocking Algorithms (1)
- Generative Music (1)
- Hardness amplification (1)
- Lindenmayer Systems (1)
- Lower bounds (1)
- Metrics (1)
- Modularity (1)
- Online resources (1)
- Quantum computation (1)
- Satellite (1)
- Software development environments (1)
- Software maintenance (1)
- Software tools (1)
- Stability (1)
- Vegetation (1)
- File Type
Articles 1 - 16 of 16
Full-Text Articles in Physical Sciences and Mathematics
Optimal Cryptographic Hardness Of Learning Monotone Functions, Dana Dachman-Soled, Homin K. Lee, Tal Malkin, Rocco A. Servedio, Andrew Wan, Hoeteck Wee
Optimal Cryptographic Hardness Of Learning Monotone Functions, Dana Dachman-Soled, Homin K. Lee, Tal Malkin, Rocco A. Servedio, Andrew Wan, Hoeteck Wee
Publications and Research
Over the years a range of positive algorithmic results have been obtained for learning various classes of monotone Boolean functions from uniformly distributed random examples. Prior to our work, however, the only negative result for learning monotone functions in this model has been an information-theoretic lower bound showing that certain super-polynomial-size monotone circuits cannot be learned to accuracy 1/2+w(log n/ p n) (Blum, Burch, and Langford, FOCS’98). This is in contrast with the situation for nonmonotone functions, where a wide range of cryptographic hardness results establish that various “simple” classes of polynomial-size circuits are not learnable by polynomial-time algorithms.
In …
Correlating Molecular Phylogeny With Venom Apparatus Occurrence In Panamic Auger Snails (Terebridae), Mandë Holford, Nicolas Puillandre, Maria Vittoria Modica, Maren Watkins, Rachel Collin, Eldredge Bermingham, Baldomero M. Olivera
Correlating Molecular Phylogeny With Venom Apparatus Occurrence In Panamic Auger Snails (Terebridae), Mandë Holford, Nicolas Puillandre, Maria Vittoria Modica, Maren Watkins, Rachel Collin, Eldredge Bermingham, Baldomero M. Olivera
Publications and Research
Central to the discovery of neuroactive compounds produced by predatory marine snails of the superfamily Conoidea (cone snails, terebrids, and turrids) is identifying those species with a venom apparatus. Previous analyses of western Pacific terebrid specimens has shown that some Terebridae groups have secondarily lost their venom apparatus. In order to efficiently characterize terebrid toxins, it is essential to devise a key for identifying which species have a venom apparatus. The findings presented here integrate molecular phylogeny and the evolution of character traits to infer the presence or absence of the venom apparatus in the Terebridae. Using a combined dataset …
Pointcut Rejuvenation: Recovering Pointcut Expressions In Evolving Aspect-Oriented Software, Raffi T. Khatchadourian, Phil Greenwood, Awais Rashid, Guoqing Harry Xu
Pointcut Rejuvenation: Recovering Pointcut Expressions In Evolving Aspect-Oriented Software, Raffi T. Khatchadourian, Phil Greenwood, Awais Rashid, Guoqing Harry Xu
Publications and Research
Pointcut fragility is a well-documented problem in Aspect-Oriented Programming; changes to the base-code can lead to join points incorrectly falling in or out of the scope of pointcuts. We present an automated approach that limits fragility problems by providing mechanical assistance in pointcut maintenance. The approach is based on harnessing arbitrarily deep structural commonalities between program elements corresponding to join points selected by a pointcut. The extracted patterns are then applied to later versions to offer suggestions of new join points that may require inclusion. We demonstrate the usefulness of our technique by rejuvenating pointcuts in multiple versions of several …
Contributing Factors To Pointcut Fragility, Phil Greenwood, Awais Rashid, Raffi T. Khatchadourian
Contributing Factors To Pointcut Fragility, Phil Greenwood, Awais Rashid, Raffi T. Khatchadourian
Publications and Research
Pointcut fragility is a well-documented problem of Aspect-Oriented Programming with changes to the base-code causing join points to incorrectly fall in or out of scope. In order to combat this problem a tool was developed that provides mechanical assistance to pointcut maintenance. This tool relied on the deep structural commonalities between program elements to detect when pointcut fragility occurs. During the assessment of this tool a number of common practices were uncovered that were employed both in the aspect and base-code that contributed to or prevented pointcut fragility. This paper documents the practices uncovered and describes how they can affect …
Quantum Computing: Selected Internet Resources For Librarians, Researchers, And The Casually Curious, Jill Cirasella
Quantum Computing: Selected Internet Resources For Librarians, Researchers, And The Casually Curious, Jill Cirasella
Publications and Research
This article is an annotated selection of the most important and informative Internet resources for learning about quantum computing, finding quantum computing literature, and tracking quantum computing news.
The Maximum Rectilinear Crossing Number Of The N Dimensional Cube Graph, Matthew Alpert, Elie Feder, Heiko Harborth, Sheldon Klein
The Maximum Rectilinear Crossing Number Of The N Dimensional Cube Graph, Matthew Alpert, Elie Feder, Heiko Harborth, Sheldon Klein
Publications and Research
We find a.nd prove the maximum rectilinear crossing n1.1mber of the three-dimensional cube graph (Q3). We demonstrate a method of drawing then-cube graph, Qn., with many crossings, and thus find a lower bound for the maximum rectilinear crossing number of Qn. We conjecture that this bound is sharp. We also prove an upper bound for the maximum rectilinear crossing number of Qn.
Lattice Operators And Topologies, Eva Cogan
Lattice Operators And Topologies, Eva Cogan
Publications and Research
Working within a complete (not necessarily atomic) Boolean algebra, we use a sublattice to define a topology on that algebra. Our operators generalize complement on a lattice which in turn abstracts the set theoretic operator. Less restricted than those of Banaschewski and Samuel, the operators exhibit some surprising behaviors. We consider properties of such lattices and their interrelations. Many of these properties are abstractions and generalizations of topological spaces. The approach is similar to that of Bachman and Cohen. It is in the spirit of Alexandroff, Frolík, and Nöbeling, although the setting is more general. Proceeding in this manner, we …
The Most Effective Statistical Approach To Correct Environmental Satellite Data, Md Zahidur Rahman, Leonid Roytman
The Most Effective Statistical Approach To Correct Environmental Satellite Data, Md Zahidur Rahman, Leonid Roytman
Publications and Research
The proposed paper apply novel statistical approach to correct radiometric data measured by Advanced Very High Resolution Radiometers (AVHRR) onboard the National Oceanic and Atmospheric Administration (NOAA) Polar Orbiting Environmental Satellites (POES). This paper investigates Normalized Difference Vegetation Index (NDVI) stability in the NOAA/NESDIS Global Vegetation Index (GVI) data during 1982-2003. AVHRR weekly data for the five NOAA afternoon satellites for the China dataset is studied, for it includes a wide variety of different ecosystems represented globally. It was found that data for the years 1988, 1992, 1993, 1994, 1995 and 2000 are not stable enough compared to other years …
Series That Probably Converge To One, Thomas J. Pfaff, Max Tran
Series That Probably Converge To One, Thomas J. Pfaff, Max Tran
Publications and Research
No abstract provided.
The Maximum Of The Maximum Rectilinear Crossing Numbers Of D-Regular Graphs Of Order N, Matthew Alpert, Elie Feder, Heiko Harborth
The Maximum Of The Maximum Rectilinear Crossing Numbers Of D-Regular Graphs Of Order N, Matthew Alpert, Elie Feder, Heiko Harborth
Publications and Research
We extend known results regarding the maximum rectilinear crossing number of the cycle graph (Cn) and the complete graph (Kn ) to the class of general d-regular graphs Rn,d. We present the generalized star drawings of the d-regular graphs Sn,d of order n where n + d ≡ 1 (mod 2) and prove that they maximize the maximum rectilinear crossing numbers. A star-like drawing of Sn,d for n ≡ d ≡ 0 (mod 2) is introduced and we conjecture that this drawing maximizes the maximum rectilinear crossing numbers, too. We offer a simpler proof of two results initially proved by …
The Orchard Crossing Number Of An Abstract Graph, Elie Feder, David Garber
The Orchard Crossing Number Of An Abstract Graph, Elie Feder, David Garber
Publications and Research
.We introduce the Orchard crossing number, which is defined in a similar way to the well-known rectilinear crossing number. We compute the Orchard crossing number for some simple families of graphs. We also prove some properties of this crossing number.
Moreover, we define a variant of this crossing number which is tightly connected to the rectilinear crossing number, and compute it for some simple families of graphs.
Quirky, Not Quacky: Quantum Computing For Librarians, Jill Cirasella
Quirky, Not Quacky: Quantum Computing For Librarians, Jill Cirasella
Publications and Research
This slideshow introduces librarians and non-scientists to the relatively young field of quantum computing.
Flocking In The Time-Dissonance Plane, Adam James Wilson
Flocking In The Time-Dissonance Plane, Adam James Wilson
Publications and Research
This paper describes a technique for the sonification of an idealized model of the flocking behavior of birds, fish, and insects. Flocking agents are represented by pitches that move through time to produce chords of variable dissonance. The objective of each agent is to move toward more consonant chord formations with other agents. The output of the sonification is intended to provide material for use in musical composition.
A Symbolic Sonification Of L-Systems, Adam James Wilson
A Symbolic Sonification Of L-Systems, Adam James Wilson
Publications and Research
This paper describes a simple technique for the sonification of branching structures in plants. The example is intended to illustrate a qualitative definition of best practices for sonification aimed at the production of musical material. Visually manifest results of tree growth are modelled and subsequently mapped to pitch, time, and amplitude. Sample results are provided in symbolic music notation.
Specifying Reusable Aspects, Neelam Soundarajan, Raffi T. Khatchadourian
Specifying Reusable Aspects, Neelam Soundarajan, Raffi T. Khatchadourian
Publications and Research
Aspect-Oriented Programming enables developers to manage, in a more modular fashion, implementations of crosscutting concerns that might be scattered or tangled if aspect-oriented techniques were not utilized. Our interest in this paper is in considering techniques for specifying precise properties of aspects. In particular, we are interested in specifying reusable aspects; i.e., aspects that correspond to crosscutting concerns that occur in many systems. These abstract aspects can be reused in various systems where a particular concern is applicable. Although there has been work on issues related to reasoning about aspects and the behaviors of aspect-oriented systems, specifying reusable abstract aspects …
Phenyl-Substituted Siloxane Hybrid Gels That Soften Below 140[Degrees]C, Andrei Jitianu, Glenn Amatucci, Lisa C. Klein
Phenyl-Substituted Siloxane Hybrid Gels That Soften Below 140[Degrees]C, Andrei Jitianu, Glenn Amatucci, Lisa C. Klein
Publications and Research
A characteristic of so-called melting gels is that the gels, which are rigid at room temperature, are able to soften and resoften at temperatures around 110 [degrees]C. However, after consolidation at temperatures higher than 150 [degrees]C, the gels no longer resoften. Two systems of melting gels were investigated: phenyltrimethoxysilane (PhTMS)–diphenyldimethoxysilane (DPhDMS) and phenyltriethoxysilane (PhTES)–diphenyldiethoxysilane (DPhDES). The influence of disubstituted versus monosubstituted alkoxide on the softening behavior and the temperature of decomposition was studied. The consolidation temperature increased as the amount of disubstituted alkoxide increased, while the decomposition temperature increased only slightly. In general, the ethoxy-containing gels (maximum at 150[degrees]C) consolidated …