Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Computer Sciences (14)
- Engineering (13)
- Numerical Analysis and Computation (13)
- Dynamic Systems (11)
- Non-linear Dynamics (11)
-
- Partial Differential Equations (11)
- Mathematics (10)
- Physics (10)
- Electrical and Computer Engineering (9)
- Control Theory (8)
- Engineering Physics (8)
- Ordinary Differential Equations and Applied Dynamics (8)
- Dynamical Systems (7)
- Other Physical Sciences and Mathematics (7)
- Fluid Dynamics (6)
- Life Sciences (6)
- Other Mathematics (6)
- Other Physics (5)
- Systems and Communications (5)
- Theory and Algorithms (5)
- Biological and Chemical Physics (4)
- Biology (4)
- Catalysis and Reaction Engineering (4)
- Chemical Engineering (4)
- Chemistry (4)
- Civil and Environmental Engineering (4)
- Complex Fluids (4)
- Keyword
-
- Articles (8)
- Multiple-input multiple-output (MIMO) (3)
- Prace ze studentami (in Polish) (3)
- 1)-labeling (2)
- Amicable orthogonal designs (AOD) (2)
-
- Channel assignment (2)
- Complex orthogonal designs (2)
- Complex orthogonal space–time block codes (CO STBCs) (2)
- Conference Proceedings (2)
- Generalized Petersen graph (2)
- L(2 (2)
- Mathematics (2)
- Orthogonal design (2)
- Peak-to-average power ratio (PAPR) (2)
- Quaternions (2)
- Ricker competition model (2)
- Space–time block code (STBC) (2)
- 1)-coloring (1)
- ABM (1)
- Agents (1)
- Allee curve (1)
- Allee effect (1)
- Anomalous Diffusion (1)
- Applied Mathematics and Statistics (1)
- Articles (Local Journals) (1)
- Badania (1)
- Biogaz; oksy-reforming; wodór (1)
- Biomass (1)
- Block codes (1)
- Blow up (1)
- Publication Year
- Publication
-
- Sarah Spence Adams (9)
- Borbala Mazzag (4)
- Wojciech Budzianowski (4)
- Manfred Minimair (3)
- Cecile M Piret (2)
-
- Saber Elaydi (2)
- Sergey V. Drakunov (2)
- Xiao-Jun Yang (2)
- Alex Capaldi (1)
- Andrei Ludu (1)
- Bradley Minch (1)
- Dr Le Chung Tran (1)
- George K. Thiruvathukal (1)
- H. L. Zadeh (1)
- Kevin Huang (1)
- Kevin J. Black, MD (1)
- Lisa D Humphreys (1)
- Marcus Randall (1)
- Mohan Dev Pant (1)
- Ralph Saxton (1)
- Ronald Greenberg (1)
- SA Edalatpanah (1)
- Saeid Abbasbandy (1)
- William F. Trench (1)
- File Type
Articles 1 - 30 of 44
Full-Text Articles in Other Applied Mathematics
Call For Abstracts - Resrb 2019, July 8-9, Wrocław, Poland, Wojciech M. Budzianowski
Call For Abstracts - Resrb 2019, July 8-9, Wrocław, Poland, Wojciech M. Budzianowski
Wojciech Budzianowski
No abstract provided.
Motion Planning For Educational Robots, Ronald I. Greenberg, Jeffery M. Karp
Motion Planning For Educational Robots, Ronald I. Greenberg, Jeffery M. Karp
Ronald Greenberg
This paper considers various simple ways of navigating in a 2-dimensional territory with a two-wheeled robot of a type typical in educational robotics. We determine shortest paths under various modes of operation and compare.
Collaboration And Health Care Diagnostics: An Agent Based Model Simulation, Sebastian Linde, George K. Thiruvathukal
Collaboration And Health Care Diagnostics: An Agent Based Model Simulation, Sebastian Linde, George K. Thiruvathukal
George K. Thiruvathukal
This paper presents a simple ABM simulation that seeks to provide insight into the public health benefits that derive from greater collaboration among health care professionals. In particular, the paper compares the efficiency, delivery and timeliness of health care diagnostics under two contrasting paradigms–one in which collaboration is encouraged, and an- other where it is not. The preliminary results of this study suggest that while the effect of cooperation on aggregate public health depends on the patient search algorithm employed, its effect on overall efficiency and timeliness of health care diagnostics and treatment is significant and pos- itive. Since the …
Principal Component Analysis In The Eigenface Technique For Facial Recognition, Kevin Huang
Principal Component Analysis In The Eigenface Technique For Facial Recognition, Kevin Huang
Kevin Huang
Several facial recognition algorithms have been explored in the past few decades. Progress has been made towards recognition under varying lighting conditions, poses and facial expressions. In a general context, a facial recognition algorithm and its implementation can be considered as a system. The input to the facial recognition system is a two dimensional image, while the system distinguishes the input image as a user’s face from a pre-determined library of faces. Finally, the output is the discerned face image. In this project, we will examine one particular system: the Eigenface technique.
Investigating Anthropogenic Mammoth Extinction With Mathematical Models, Michael Frank, Anneliese Slaton, Teresa Tinta, Alex Capaldi
Investigating Anthropogenic Mammoth Extinction With Mathematical Models, Michael Frank, Anneliese Slaton, Teresa Tinta, Alex Capaldi
Alex Capaldi
Zespół Energii Odnawialnej I Zrównoważonego Rozwoju (Eozr), Wojciech M. Budzianowski
Zespół Energii Odnawialnej I Zrównoważonego Rozwoju (Eozr), Wojciech M. Budzianowski
Wojciech Budzianowski
No abstract provided.
A Chebyshev Pseudo-Spectral Method To Solve The Space-Time Tempered Fractional Diffusion Equation
A Chebyshev Pseudo-Spectral Method To Solve The Space-Time Tempered Fractional Diffusion Equation
Cecile M Piret
Multiple Local Neighbourhood Search For Extremal Optimisation, Marcus Randall
Multiple Local Neighbourhood Search For Extremal Optimisation, Marcus Randall
Marcus Randall
Extremal optimisation (EO) uses a somewhat unusual mechanism to transform one solution into another. This consists of computing a probabilistic worst solution component value, and changing it to a random value. While simple and avoiding problems with premature convergence, it is mostly incompatible with combinatorial problems, particularly those requiring permutations as solution structures. This paper demonstrates that standard local search operators (e.g., 1-opt, 2-opt and 3-opt – used singly or from a neighbourhood) can be readily integrated into the canonical EO framework, without compromising the integrity of the original algorithm. The idea, in some senses may be viewed as a …
Fast Iterative Method (Fim) For Solving Fully Fuzzy Linear Systems, Sa Edalatpanah, E Abdolmaleki
Fast Iterative Method (Fim) For Solving Fully Fuzzy Linear Systems, Sa Edalatpanah, E Abdolmaleki
SA Edalatpanah
In this paper, a new iterative method is applied to find solution of the fully fuzzy linear systems. Furthermore, we show that in some situations that the existing methods such as Jacobi, Gauss-Seidel and SOR are divergent, our proposed method is applicable . Finally, numerical computations are presented based on a particular linear system, which clearly show the reliability and efficiency of our algorithms.
A Radial Basis Functions Method For Fractional Diffusion Equations, Cecile M. Piret, Emmanuel Hanert
A Radial Basis Functions Method For Fractional Diffusion Equations, Cecile M. Piret, Emmanuel Hanert
Cecile M Piret
Determination Of Kinetic Parameters From The Thermogravimetric Data Set Of Biomass Samples, Karol Postawa, Wojciech M. Budzianowski
Determination Of Kinetic Parameters From The Thermogravimetric Data Set Of Biomass Samples, Karol Postawa, Wojciech M. Budzianowski
Wojciech Budzianowski
This article describes methods of the determination of kinetic parameters from the thermogravimetric data set of biomass samples. It presents the methodology of the research, description of the needed equipment, and the method of analysis of thermogravimetric data. It describes both methodology of obtaining quantitative data such as kinetic parameters as well as of obtaining qualitative data like the composition of biomass. The study is focused mainly on plant biomass because it is easy in harvesting and preparation. Methodology is shown on the sample containing corn stover which is subsequently pyrolysed. The investigated sample show the kinetic of first order …
Application Of Homotopy Analysis Transform Method To Fractional Biological Population Model, Habibolla Latifizadeh
Application Of Homotopy Analysis Transform Method To Fractional Biological Population Model, Habibolla Latifizadeh
H. L. Zadeh
No abstract provided.
Interactive Visualization Of New Jersey Gang Data, Manfred Minimair
Interactive Visualization Of New Jersey Gang Data, Manfred Minimair
Manfred Minimair
This article describes the design and functionality of an online visualization software of data from a survey on gang activities in New Jersey municipalities. The visualization enables the user to explore the distribution of numbers of gang sets across different municipalities in New Jersey, and study certain derived information. The purpose of the visualization is to make data from the gang survey easily and universally accessible through some engaging visual display, to facilitate seamless exploration of the data, and to thus foster discourse on the data among experts and the general public. In order to achieve these goals, bubble charts, …
Novel Constructions Of Improved Square Complex Orthogonal Designs For Eight Transmit Antennas, Le Chung Tran, Tadeusz Wysocki, Jennifer Seberry, Alfred Mertins, Sarah Adams
Novel Constructions Of Improved Square Complex Orthogonal Designs For Eight Transmit Antennas, Le Chung Tran, Tadeusz Wysocki, Jennifer Seberry, Alfred Mertins, Sarah Adams
Dr Le Chung Tran
Constructions of square, maximum rate complex orthogonal space-time block codes (CO STBCs) are well known, however codes constructed via the known methods include numerous zeros, which impede their practical implementation. By modifying the Williamson and Wallis-Whiteman arrays to apply to complex matrices, we propose two methods of construction of square, order-4n CO STBCs from square, order-n codes which satisfy certain properties. Applying the proposed methods, we construct square, maximum rate, order-8 CO STBCs with no zeros, such that the transmitted symbols are equally dispersed through transmit antennas. Those codes, referred to as the improved square CO STBCs, have the advantages …
The Minimum Span Of L(2,1)-Labelings Of Certain Generalized Petersen Graphs, Sarah Adams, Jonathan Cass, Matthew Tesch, Denise Troxell, Cody Wheeland
The Minimum Span Of L(2,1)-Labelings Of Certain Generalized Petersen Graphs, Sarah Adams, Jonathan Cass, Matthew Tesch, Denise Troxell, Cody Wheeland
Sarah Spence Adams
In the classical channel assignment problem, transmitters that are sufficiently close together are assigned transmission frequencies that differ by prescribed amounts, with the goal of minimizing the span of frequencies required. This problem can be modeled through the use of an L(2,1)-labeling, which is a function f from the vertex set of a graph G to the non-negative integers such that |f(x)–f(y)|≥ 2 if xand y are adjacent vertices and |f(x)–f(y)|≥1 if xand y are at distance two. The goal is to …
On An Orthogonal Space-Time-Polarization Block Code, Beata Wysocki, Tadeusz Wysocki, Sarah Adams
On An Orthogonal Space-Time-Polarization Block Code, Beata Wysocki, Tadeusz Wysocki, Sarah Adams
Sarah Spence Adams
Over the past several years, diversity methods such as space, time, and polarization diversity have been successfully implemented in wireless communications systems. Orthogonal space-time block codes efficiently combine space and time diversity, and they have been studied in detail. Polarization diversity has also been studied, however it is usually considered in a simple concatenation with other coding methods. In this paper, an efficient method for incorporating polarization diversity with space and time diversity is studied. The simple yet highly efficient technique is based on extending orthogonal space-time block codes into the quaternion domain and utilizing a description of the dual-polarized …
Novel Constructions Of Improved Square Complex Orthogonal Designs For Eight Transmit Antennas, Le Chung Tran, Tadeusz Wysocki, Jennifer Seberry, Alfred Mertins, Sarah Adams
Novel Constructions Of Improved Square Complex Orthogonal Designs For Eight Transmit Antennas, Le Chung Tran, Tadeusz Wysocki, Jennifer Seberry, Alfred Mertins, Sarah Adams
Sarah Spence Adams
Constructions of square, maximum rate complex orthogonal space-time block codes (CO STBCs) are well known, however codes constructed via the known methods include numerous zeros, which impede their practical implementation. By modifying the Williamson and Wallis-Whiteman arrays to apply to complex matrices, we propose two methods of construction of square, order-4n CO STBCs from square, order-n codes which satisfy certain properties. Applying the proposed methods, we construct square, maximum rate, order-8 CO STBCs with no zeros, such that the transmitted symbols are equally dispersed through transmit antennas. Those codes, referred to as the improved square CO STBCs, have the advantages …
An Extension Of The Channel-Assignment Problem: L(2, 1)-Labelings Of Generalized Petersen Graphs, Sarah Adams, Jonathan Cass, Denise Troxell
An Extension Of The Channel-Assignment Problem: L(2, 1)-Labelings Of Generalized Petersen Graphs, Sarah Adams, Jonathan Cass, Denise Troxell
Sarah Spence Adams
The channel-assignment problem involves assigning frequencies represented by nonnegative integers to radio transmitters such that transmitters in close proximity receive frequencies that are sufficiently far apart to avoid interference. In one of its variations, the problem is commonly quantified as follows: transmitters separated bythe smallest unit distance must be assigned frequencies that are at least two apart and transmitters separated by twice the smallest unit distance must be assigned frequencies that are at least one apart. Naturally, thischannel-assignment problem can be modeled with vertex labelings of graphs. An L(2, 1)-labeling of a graph G is a function f from the …
Identifying High-Dimension Subspace Subcodes Of Reed-Solomon Codes, Sarah Adams
Identifying High-Dimension Subspace Subcodes Of Reed-Solomon Codes, Sarah Adams
Sarah Spence Adams
Subspace subcodes of Reed-Solomon (SSRS) codes were introduced by Hattori, McEliece, Solomo, and Lin in the mid-1990s. These authors found a complicated dimension formula and a simple, tight lower bound on thedimension of SSRS codes over F2m. We prove a conjecture of Hattori concerning how to identify subspaces that can be used to build SSRS codes whose dimension exceeds this lower bound.
Quaternion Orthogonal Designs From Complex Companion Designs, Sarah Adams, Jennifer Seberry, Nathaniel Karst, Jonathan Pollack, Tadeusz Wysocki
Quaternion Orthogonal Designs From Complex Companion Designs, Sarah Adams, Jennifer Seberry, Nathaniel Karst, Jonathan Pollack, Tadeusz Wysocki
Sarah Spence Adams
The success of applying generalized complex orthogonal designs as space–time block codes recently motivated the definition of quaternion orthogonal designs as potential building blocks for space–time-polarization block codes. This paper offers techniques for constructing quaternion orthogonal designs via combinations of specially chosen complex orthogonal designs. One technique is used to build quaternion orthogonal designs on complex variables for any even number of columns. A second related technique is applied to maximum rate complex orthogonal designs to generate an infinite family of quaternion orthogonal designs on complex variables such that the resulting designs have no zero entries. This second technique is …
The Final Case Of The Decoding Delay Problem For Maximum Rate Complex Orthogonal Designs, Sarah Adams, Nathaniel Karst, Mathav Murugan
The Final Case Of The Decoding Delay Problem For Maximum Rate Complex Orthogonal Designs, Sarah Adams, Nathaniel Karst, Mathav Murugan
Sarah Spence Adams
Complex orthogonal space-time block codes (COSTBCs) based on generalized complex orthogonal designs (CODs) have been successfully implemented in wireless systems with multiple transmit antennas and single or multiple receive antennas. It has been shown that for a maximum rate COD with 2m-1 or 2m columns, a lower bound on decoding delay is (m-1 2m) and this delay is achievable when the number of columns is congruent to 0, 1 , or 3 modulo 4. In this paper, the final case is addressed, and it is shown that when the number of columns is congruent to 2 modulo 4, the lower …
The Minimum Decoding Delay Of Maximum Rate Complex Orthogonal Space–Time Block Codes, Sarah Adams, Nathaniel Karst, Jonathan Pollack
The Minimum Decoding Delay Of Maximum Rate Complex Orthogonal Space–Time Block Codes, Sarah Adams, Nathaniel Karst, Jonathan Pollack
Sarah Spence Adams
The growing demand for efficient wireless transmissions over fading channels motivated the development ofspace-time block codes. Space-time block codes built from generalized complex orthogonal designs are particularly attractive because the orthogonality permits a simple decoupled maximum-likelihood decodingalgorithm while achieving full transmit diversity. The two main research problems for these complex orthogonalspace-time block codes (COSTBCs) have been to determine for any number of antennas the maximum rate andthe minimum decoding delay for a maximum rate code. The maximum rate for COSTBCs was determined by Liang in 2003. This paper addresses the second fundamental problem by providing a tight lower bound on …
Optimal Synthesis Of Mite Translinear Loops, Shyam Subramanian, David Anderson, Paul Hasler, Bradley Minch
Optimal Synthesis Of Mite Translinear Loops, Shyam Subramanian, David Anderson, Paul Hasler, Bradley Minch
Bradley Minch
A procedure for synthesizing multiple-input translinear element (MITE) networks that implement a given system of translinear-loop equations (STLE) is presented. The minimum number of MITEs required for implementing the STLE, which is equal to the number of current variables in the STLE, is attained. The number of input gates ofthe MITEs is minimal amongst those MITE networks that satisfy the STLE and have the minimum number of MITEs. The synthesized MITE networks have a unique operating point and, in many cases, the network is guaranteed to be stable in a particular sense. This synthesis procedure exploits the relationship between MITEproduct-of-power-law …
On The Issue Of Decoupled Decoding Of Codes Derived From Quaternion Orthogonal Designs, Tadeusz Wysocki, Beata Wysocki, Sarah Spence Adams
On The Issue Of Decoupled Decoding Of Codes Derived From Quaternion Orthogonal Designs, Tadeusz Wysocki, Beata Wysocki, Sarah Spence Adams
Sarah Spence Adams
Quaternion orthogonal designs (QODs) have been previously introduced as a basis for orthogonal space-time polarization block codes (OSTPBCs). This note will serve to correct statements concerning the optimality of a decoupled maximum-likelihood (ML) decoding algorithm. It will be shown that when compared to coupled decoding, the decoupled decoding is only optimal in certain cases. This raises several open problems concerning the decoding of OSTPBCs.
A Logistic L-Moment-Based Analog For The Tukey G-H, G, H, And H-H System Of Distributions, Todd C. Headrick, Mohan D. Pant
A Logistic L-Moment-Based Analog For The Tukey G-H, G, H, And H-H System Of Distributions, Todd C. Headrick, Mohan D. Pant
Mohan Dev Pant
This paper introduces a standard logistic L-moment-based system of distributions. The proposed system is an analog to the standard normal conventional moment-based Tukey g-h, g, h, and h-h system of distributions. The system also consists of four classes of distributions and is referred to as (i) asymmetric γ-κ, (ii) log-logistic γ, (iii) symmetric κ, and (iv) asymmetric κL-κR. The system can be used in a variety of settings such as simulation or modeling events—most notably when heavy-tailed distributions are of interest. A procedure is also described for simulating γ-κ, γ, κ, and κL-κR distributions with specified L-moments and L-correlations. The …
Multiple Periodic Solutions For A Nonlinear Suspension Bridge Equation, Lisa Humphreys, P. Mckenna
Multiple Periodic Solutions For A Nonlinear Suspension Bridge Equation, Lisa Humphreys, P. Mckenna
Lisa D Humphreys
We investigate nonlinear oscillations in a fourth-order partial differential equation which models a suspension bridge. Previous work establishes multiple periodic solutions when a parameter exceeds a certain eigenvalue. In this paper, we use Leray Schauder degree theory to prove that if the parameter is increased further, beyond a second eigenvalue, then additional solutions are created.
Statistical Research For The Kearny Marsh, Manfred Minimair, Juliana Newman
Statistical Research For The Kearny Marsh, Manfred Minimair, Juliana Newman
Manfred Minimair
Experimental data about the biological environment of the Kearny marsh, New Jersey, USA, is studied.
On The Influence Of Damping In Hyperbolic Equations With Parabolic Degeneracy, Ralph Saxton, Katarzyna Saxton
On The Influence Of Damping In Hyperbolic Equations With Parabolic Degeneracy, Ralph Saxton, Katarzyna Saxton
Ralph Saxton
This paper examines the effect of damping on a nonstrictly hyperbolic 2x2 system. It is shown that the growth of singularities is not restricted as in the strictly hyperbolic case where dissipation can be strong enough to preserve the smoothness of solutions globally in time. Here, irrespective of the stabilizing properties of damping, solutions are found to break down in finite time on a line where two eigenvalues coincide in state space.
General Allee Effect In Two-Species Population Biology, Saber Elaydi
General Allee Effect In Two-Species Population Biology, Saber Elaydi
Saber Elaydi
The main objective of this work is to present a general framework for the notion of the strong Allee effect in population models, including competition, mutualistic, and predator-prey models. The study is restricted to the strong Allee effect caused by an interspecific interaction. The main feature of the strong Allee effect is that the extinction equilibrium is an attractor. We show how a "phase space core" of three or four equilibria is sufficient to describe the essential dynamics of the interaction between two species that are prone to the Allee effect. We will introduce the notion of semistability in planar …
Nonlinear Waves And Solitons On Contours And Closed Surfaces, Andrei Ludu
Nonlinear Waves And Solitons On Contours And Closed Surfaces, Andrei Ludu
Andrei Ludu
No abstract provided.