Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Computer Sciences (568)
- Chemistry (539)
- Mathematics (290)
- Physics (266)
- Engineering (247)
-
- Polymer Chemistry (144)
- Applied Mathematics (141)
- Environmental Sciences (124)
- Statistics and Probability (120)
- Databases and Information Systems (113)
- Business (108)
- Other Physics (96)
- Management Information Systems (94)
- Earth Sciences (92)
- Computer Engineering (85)
- Life Sciences (77)
- Organic Chemistry (71)
- Materials Chemistry (70)
- Artificial Intelligence and Robotics (69)
- Social and Behavioral Sciences (61)
- Geology (58)
- Data Science (53)
- Education (51)
- Materials Science and Engineering (45)
- Oceanography and Atmospheric Sciences and Meteorology (42)
- Electrical and Computer Engineering (41)
- Medicine and Health Sciences (33)
- Physical Chemistry (33)
- Analytical Chemistry (32)
- Institution
- Keyword
-
- Machine learning (68)
- Deep learning (41)
- Applied sciences (25)
- Pure sciences (23)
- Data mining (17)
-
- Machine Learning (17)
- Natural language processing (17)
- Artificial intelligence (13)
- Classification (13)
- Bioinformatics (12)
- Carbon nanotubes (12)
- Deep Learning (12)
- Fluorescence (12)
- Graph theory (12)
- Nanoparticles (12)
- Optimization (12)
- Image processing (11)
- Mass spectrometry (11)
- Numerical analysis (10)
- Solar flares (10)
- Big data (9)
- Cloud computing (9)
- Clustering (9)
- Computer vision (9)
- Security (9)
- Solar physics (9)
- Thiol-ene (9)
- Adsorption (8)
- Dynamical systems (8)
- Epoxy (8)
- Publication Type
Articles 1951 - 1980 of 2014
Full-Text Articles in Physical Sciences and Mathematics
Design And Analysis Of Efficient Algorithms To Solve The Maximum Concurrent Flow Problem, Farhad Shahrokhi
Design And Analysis Of Efficient Algorithms To Solve The Maximum Concurrent Flow Problem, Farhad Shahrokhi
Dissertations
The maximum concurrent flow (MCFP) is a generalized commodity flow problem, where every pair of entities can send and receive flow Ma85 , BM86 , MS86 . We develop efficient labeling algorithms to solve the MCFP. We explore the combinatorial structure of the MCFP and show that the problem of associating costs (distances) to the edges so as to maximize the minimum cost of routing the concurrent flow is the dual of the MCFP. This duality covers max-flow min-cut theorem as a special case. Applications in packet switched networks At81 and cluster analysis Ma86 are discussed.
The Design And Analysis Of Drug Combination Experiments, Thomas J. Vidmar
The Design And Analysis Of Drug Combination Experiments, Thomas J. Vidmar
Dissertations
Past literature concerning drug combination studies is reviewed. This literature has both biological and statistical origins. The justification of the logit transformation for dichotomous responses in a linear models framework is made by observing its similarities to models proposed by others. Using the logistic linear model, optimal experimental designs are derived. Methods for obtaining parameter estimates are discussed as are diagnostic techniques for logistic regression. Two new robust techniques for logistic regression are proposed and compared to a robust technique suggested in the literature via Monte Carlo simulation. Finally, estimation of the median effective dose (ED50) and the resulting confidence …
Jacobi Moments In Applied Mathematics With Computer Applications, John A. Kapenga
Jacobi Moments In Applied Mathematics With Computer Applications, John A. Kapenga
Dissertations
This work provides solid asymptotic representations, sharp error bounds and stable recurrence methods (both three term and two dimensional) for the Jacobi moments. These moments are currently used in several areas of numerical analysis (numerical integration, integral equations and boundary value problems).
A powerful representation theorem, due to H. Gingold, which uses the Jacobi moments is extended and analyzed. Applications of this theorem to multi-turning point problems and several other areas are given.
For a number of important problems in mathematical physics it is not possible to prove that the currently employed methods of solution converge, or are valid in …
Generalized Connectivity In Graphs, Ortrud R. Oellermann
Generalized Connectivity In Graphs, Ortrud R. Oellermann
Dissertations
The connectivity of a graph G is the minimum number of vertices in G whose deletion produces a disconnected or trivial graph, while the edge-connectivity of G is the minimum number of edges having this property. In this dissertation several generalizations and variations of these two parameters are introduced and studied.
Chapter I is an overview to the history of connectivity and provides a background for the chapters that follow. In Chapter II major n-connected subgraphs are introduced. Through this concept, the connectivities (of subgraphs) that are most representative in a given graph are studied.
Chapter III is devoted to …
The Effects Of Acid Precipitation On Two Lakes In Southwestern Michigan, Fardin Olyaei
The Effects Of Acid Precipitation On Two Lakes In Southwestern Michigan, Fardin Olyaei
Dissertations
The purpose of this study was to investigate the extent to which acid precipitation contributes acidity and heavy metals to lake environments. Asylum and Bonnie Castle Lakes, both located in the western portion of Kalamazoo County, served as the study sites. Precipitation samples were also taken at a site close to both lakes. Using the Hach Colorimeter, a preliminary study was undertaken to determine concentrations of the major cations (H('+), NH(,4)('+), K('+) and Ca('2+)), and major anions (NO(,3)('-), SO(,4)('2-), and PO(,4)('3-)). The main study dealt with the metal concentrations (Mn, Fe, Cu, Zn, and Pb) in rain/snow water, lakewaters, sediment, …
On Common Subgraphs, Hung Bin Zou
On Common Subgraphs, Hung Bin Zou
Dissertations
A greatest common (induced) subgraph of graphs G(,1) and G(,2) of equal size is a (an induced) common subgraph (without isolated vertices) of G(,1) and G(,2) having maximum size. For a given graph L, a graph G is locally L if the induced subgraph of the neighborhood of each vertex of G is isomorphic to L (L is called a common link). Several topics concerning these concepts are investigated in this dissertation. An historical background to these topics is given in Chapter I.
Chapter II is devoted to the topic on highly connected unique greatest common subgraphs of graphs. We …
Naphthalene-2,3-Dialdehyde: A Synthon To 7,9-Polymethylene-8h-Cyclohepta[B]Naphthalene-8-One And A Study Of Their Aromaticity, Edward O. Crapps
Naphthalene-2,3-Dialdehyde: A Synthon To 7,9-Polymethylene-8h-Cyclohepta[B]Naphthalene-8-One And A Study Of Their Aromaticity, Edward O. Crapps
Dissertations
This report describes the synthesis of naphthalene-2,3-dialdehyde, and an analytical method for determining its purity by thin layer chromatography. Subsequently, the dialdehyde was condensed with various cyclic ketones to generate a series of polymethylene bridged naphthotropones. It was found that planarity and aromaticity increase with the size of the methylene bridge, although, the bridge must contain six or more methylene groups for the latter to be true. The claim for aromaticity is supported by NMR and IR data, which indicates the positive charge for a perchlorate cation salt is delocalized over the naphthalene and tropone ring system. Furthermore, from the …
On The Genus Of A Block Design, Joan Marie Rahn
On The Genus Of A Block Design, Joan Marie Rahn
Dissertations
The genus of a design (BIBD or PBIBD) is defined to be the genus of its corresponding hypergraph (objects as vertices, blocks as edges); that is, the genus of the bipartite graph associated with the hypergraph in a natural way. The Euler formula is used to establish a lower bound (gamma) for the genus of a block design. An imbedding of the design of the surface of genus (gamma) is then described by a voltage hypergraph or voltage graph. Use of the lower bound formula leads to a characterization of planar BIBDs. A connection between a block design derived from …
The Chromatic And Cochromatic Number Of A Graph, John Gordon Gimbel
The Chromatic And Cochromatic Number Of A Graph, John Gordon Gimbel
Dissertations
Clearly, there are many ways that one can partition the vertex sets of graphs. In the first chapter of this work I examine the problem of determining, for a given graph, the minimum order of a vertex partition having specified properties. In the remaining chapters I concentrate on partitions of two types--those in which each subset induces an empty graph and those in which each subset induces an empty or a complete graph.
The chromatic number of a graph G is the minimum number of subsets into which V(G) can be partitioned so that each subset induces an empty graph. …
The Relationship Of Self-Concept, Sex, Age, Major, Anxiety, Mathematics Background, And Mathematics Ability To The Level Of Mathematics And Statistical Anxiety Among College Juniors, David John Maysick
Dissertations
Problem. One's choice of career has significant effect upon one's future life in terms of earning potential and social interaction. Mathematics/statistical anxiety and the mathematics avoidance often accompanying such anxiety, can influence career choice, causing otherwise talented people to limit their future. The purpose of this study was to determine from selected variables--particularly self-concept--which, if any, were related to the problem of mathematics and/or statistical anxiety.
Method. The statistical sample used was 350 juniors. Stratification was by degree of mathematics content in subject's major field of study. For the study, subjects had to be in the same major category as …
On Isomorphic Decompositions Of Graphs, Sergio Ruiz
On Isomorphic Decompositions Of Graphs, Sergio Ruiz
Dissertations
A decomposition of a nonempty graph G is a collection of subgraphs G(,1), G(,2), ... , G(,k) of G such that their edge sets form a partition of the edge set of G. If G(,i) is isomorphic to a fixed graph H for each i, then G has an isomorphic decomposition into the graph H or, equivalently, G is H-decomposable. Several topics, each concerning isomorphic decompositions, are investigated in this dissertation.
An historical introduction to the subject of isomorphic decompositions is given in Chapter I. We also present there some new information on finding regular graphs that are H-decomposable for …
Parameter Optimization Using A Hierarchical System Of Learning Automata, Brian T. Mitchell
Parameter Optimization Using A Hierarchical System Of Learning Automata, Brian T. Mitchell
Dissertations
Many problems in adaptive control, pattern recognition, filtering, identification, and artificial intelligence can be viewed as parameter optimization problems. The learning automation approach to these problems has two distinct advantages over the classic hill climbing methods: (1) the parameter space need not be metric and (2) a global rather than local optimum can be found. Unfortunately, these advantages do not come without corresponding difficulties, namely the problem of high dimensionality. A hierarchical system of learning automata has been used to reduce this problem somewhat, but inefficiencies still remain since the current hierarchical system was balanced and static hierarchical learning automaton …
Kinetics And Mechanism Of Acylation Of Amines With 2-Naphthoyl Azide, Abraham L. Faburada
Kinetics And Mechanism Of Acylation Of Amines With 2-Naphthoyl Azide, Abraham L. Faburada
Dissertations
The reaction of 2-naphthoyl azide with primary and secondary amines in protic and aprotic solvents follows second-order kinetics. The effect of increasing solvent polarity is shown to increase the rate of reaction. For amines of similar basicity, the rate of reaction decreases with increasing steric hindrance on the amine. The changes in free energy and entropy of activation for n-butylamine and cyclohexylamine are in accord with steric requirements of amines. For amines of similar steric hindrance, the rate of reaction increases with increasing amine basicity. The mechanism of addition-elimination involving the formation of a tetrahedral intermediate is consistent with the …
Kinetics Of Ternary Complex Formation Reactions Of The Nickel(Ii) Complexes Of Ethylenediaminediacetate And Triethylenetetramine With Bidentate Donors, Lawrence H. Kolopajlo
Kinetics Of Ternary Complex Formation Reactions Of The Nickel(Ii) Complexes Of Ethylenediaminediacetate And Triethylenetetramine With Bidentate Donors, Lawrence H. Kolopajlo
Dissertations
The stopped-flow technique was used to measure rate constants for ternary complex formation involving both NiEDDA and Ni(trien)('2+), and bidentate donors. The reactions of both NiEDDA and Ni(trien)('2+) with bipy, phen, en, and sar were studied. In addition the reaction of NiEDDA and gly was studied. The reactions were of the first-order with respect to either nickel complex, and with respect to enH('+), bipy, and phen. The reactions involving phen and bipy were independent of pH and were reversible. The formation rate constants for the systems containing diamine reactants are as follows:
(DIAGRAM, TABLE OR GRAPHIC OMITTED...PLEASE SEE DAI)
For …
Determination Of Organophosphorus Compounds By Hplc With Post-Column Photochemical Degradation Followed By The Formation Of Reduced Heieropolymolybdate, Stephen R. Priebe
Determination Of Organophosphorus Compounds By Hplc With Post-Column Photochemical Degradation Followed By The Formation Of Reduced Heieropolymolybdate, Stephen R. Priebe
Dissertations
A novel method for the determination of organophosphorus (OP) compounds by HPLC with post-column photochemical and chemical derivatization reactions has been developed. The OP compounds eluted from the column were photochemically degraded to orthophosphate by the use of a 450 W xenon lamp in conjunction with an auxiliary photodegradation reagent. The photodegradation reaction was studied extensively by means of batch irradiations with triethylphosphate as a model compound. The effects of the initial concentrations of triethylphosphate and ammonium peroxydisulfate, and of varying the pH of the reaction medium were determined. A survey of potential interferences was performed. Copper(II) ion was found …
Random Factors And Isofactors In Graphs And Digraphs, John Frederick Fink
Random Factors And Isofactors In Graphs And Digraphs, John Frederick Fink
Dissertations
A factor is a spanning sub(di)graph of a (di)graph. Factors that are generated by an algorithm that incorporates an element of randomness are often called random factors. An isofactor is essentially a factor G that is either empty or for which there exists a connected regular (di)graph H having a nontrivial G-factorization. Several topics, each concerning random factors or isofactors, are investigated in this dissertation. An historical introduction to these topics is given in Chapter I.
In Chapter II we define an antipath and say that a digraph is randomly antitraceable if every nonspanning antipath can be extended (at its …
Micellarly Catalyzed Reaction Of Substituted Benzohydroxamic Acids, Nop Utrapiromsuk
Micellarly Catalyzed Reaction Of Substituted Benzohydroxamic Acids, Nop Utrapiromsuk
Dissertations
The rate constants for hydrolysis of ten derivatives of benzohydroxamic acid, namely, p-H, p-CH(,3), m-CH(,3), p-CH(,3)CH(,2), p-OCH(,3), p-NO(,2), p-Cl, and m-Cl, in 0.160 and 0.158 M HCl at 67.9-68.2(DEGREES)C without and with sodium 1-dodecanesulfonate were determined. There is a good linear correlation between log k(,w) and the Hammett substituent constants, (sigma), for all para and meta derivatives where k(,w) is the rate constant in the bulk aqeous phase. In the presence of micelles all the compounds, except the meta-nitro derivative, followed the standard pseudophase model of micellar catalysis. However, correlations of log k(,m) or log K/N, where k(,m) is the …
Ground-Water Flow Along The Total Shoreline Of Austin Lake And Its Environmental Contribution To Pollution Of The Lake, William Thomas Williams
Ground-Water Flow Along The Total Shoreline Of Austin Lake And Its Environmental Contribution To Pollution Of The Lake, William Thomas Williams
Dissertations
The vertical direction of ground-water flow in Austin Lake was determined by placing minipiezometers along the entire shoreline at fifty randomly selected sites. Ground-water samples were taken at each site and the specific conductivity of the water samples was determined along with the chloride and phosphate content. The data were analyzed to determine if there were any relationships among water movement, chemical content, and the presence or absence of an onshore septic tank. The minipiezometer data show that the primary direction of water movement through the sediment-water interface is downward but may become reversed at localized regions as conditions vary. …
Storm-Sewer Input Of Heavy Metals Into An Urban Lake Environment, George A. Duba
Storm-Sewer Input Of Heavy Metals Into An Urban Lake Environment, George A. Duba
Dissertations
The purpose of this study was to measure the concentration of lead, cadmium, zinc and copper in runoff entering an urban lake ecosystem and to measure the distribution of these metals in selected tropic levels of the lake.
Fisk Lake was chosen as the study site and is located in East Grand Rapids, Michigan. Samples were collected of stormwater, rainwater and lakewater together with substrate, aquatic macrophytes Peltandra virginica, chironomid larvae, Chironomidae, snails Physa, and eight species of fish, Ictalurus nebulosus, Esox lucius, Lepomis gibbosus, L. macrochirus, Pomoxis nigromaculatus, Micropterus salmoides, Catostomus commersoni, and Perca flavescens. All samples were collected …
Stereochemistry And Circular Dichorism Of Some Cobalt(Iii) Complexes With Ethylenediamine-N, N’-Diacetic Acid And N, N'-Dimethylethylenediamine-N ,N'-Diacetic Acid, Godfrey Chinenye Mbah
Stereochemistry And Circular Dichorism Of Some Cobalt(Iii) Complexes With Ethylenediamine-N, N’-Diacetic Acid And N, N'-Dimethylethylenediamine-N ,N'-Diacetic Acid, Godfrey Chinenye Mbah
Dissertations
Two series of complexes trans-{Co(LL')EDDA}('+) and trans-{Co(LL')DMEDDA}('+), LL' = Meen, 2-Mepn, udmeen, sdmeen, R-dmepn were prepared. EDDA was reacted with cobalt(II) carbonate and the resulting solution combined with the diamine of choice. For the DMEDDA complexes the ligand DMEDDA was first prepared by adding neutralized chloroacetic acid to sdmeen and precipitating out the ligand as the barium salt. The DMEDDA complexes were prepared by reacting the barium salt first with cobalt(II) sulfate and then with the diamines listed above except udmeen. The DMEDDA complexes with R-pn were also prepared. For both series the oxidation of the Co(II) to Co(III) was …
Uniform Factorizations Of Graphs, David Burns
Preparation And Properties Of Benzotropones And Benzohomotropones, Robert E. Suder
Preparation And Properties Of Benzotropones And Benzohomotropones, Robert E. Suder
Dissertations
No abstract provided.
Traceability In Graphs, Ronald J. Gould
Markovian Multiserver Queueing Systems With Servers In Series, Nancy Jean Boynton
Markovian Multiserver Queueing Systems With Servers In Series, Nancy Jean Boynton
Dissertations
No abstract provided.
A Computer Simulation Study Of Seven Pairwise Comparison Procedures: Imbalanced Case, Wayne S. Petroelje
A Computer Simulation Study Of Seven Pairwise Comparison Procedures: Imbalanced Case, Wayne S. Petroelje
Dissertations
No abstract provided.
On A System Of Nonlinear Ordinary Differential Equations With An Irregular Type Singularity: A Degenerate Case, Jerome John Przybylski
On A System Of Nonlinear Ordinary Differential Equations With An Irregular Type Singularity: A Degenerate Case, Jerome John Przybylski
Dissertations
No abstract provided.
Partitions Of The Vertex Set Or Edge Set Of A Graph, H. Joseph Straight
Partitions Of The Vertex Set Or Edge Set Of A Graph, H. Joseph Straight
Dissertations
No abstract provided.
Proximity Effects. Kinetics, Mechanisms And Reactivity Correlations For The Acidic And Alkaline Hydrolysis Of Ortho-Substituted-N-Methylbenzohydroxamic Acids, Irl E. Ward
Dissertations
No abstract provided.
A Comparison Of The Kuder Richardson Formula 20 And Kappa As Estimates Of The Reliability Of Criterion-Referenced Tests, Judith E. Moyer
A Comparison Of The Kuder Richardson Formula 20 And Kappa As Estimates Of The Reliability Of Criterion-Referenced Tests, Judith E. Moyer
Dissertations
No abstract provided.
On Ramsey Numbers Defined By Factorizations Of Regular Complete Multi-Partite Graphs, James M. Benedict
On Ramsey Numbers Defined By Factorizations Of Regular Complete Multi-Partite Graphs, James M. Benedict
Dissertations
No abstract provided.