Results 51 to 60 of about 141,879 (256)
A predictive model for 3D printability is developed by integrating rheological analysis, including the Large Amplitude Oscillatory Shear (LAOS) test, with machine learning. With prediction errors under 10%, the model shows that post‐extrusion recovery controls horizontal printability, while high‐strain‐rate nozzle flow dictates vertical printability ...
Eun Hui Jeong +7 more
wiley +1 more source
Binary sequence/array pairs via diference set pairs: A recursive approach [PDF]
Binary array pairs with optimal/ideal correlation values and their algebraic counterparts textquotedblleft difference set pairstextquotedblright;(DSPs) in abelian groups are studied. In addition to generalizing known 1-dimensional (sequences) examples,
K. T. Arasu, Anika Goyal, Abhishek Puri
doaj +1 more source
Ecosystem‐Centered Robot Design: Toward Ecoresorbable Sustainability Robots (ESRs)
Robots exploring natural ecosystems can support monitoring and conservation, but must adopt ecosystem‐centered design to avoid pollution, waste, and damage. This review proposes guidelines for co‐designing ecoresorbable sustainability robots (ESRs), uniting materials, robotics, and ecological contexts in a single framework.
Tülin Yılmaz Nayır +4 more
wiley +1 more source
On the solutions of some systems of rational difference equations
In this paper, we considered some systems of rational difference equations of higher order as follows$ \begin{eqnarray*} u_{n+1} & = &\frac{v_{n-6}}{1\pm v_{n}u_{n-1}v_{n-2}u_{n-3}v_{n-4}u_{n-5}v_{n-6}}, \\ v_{n+1} & = &\frac{u_{n-6}}{1 ...
M. T. Alharthi
doaj +1 more source
Blind Construction of Optimal Nonlinear Recursive Predictors for Discrete Sequences [PDF]
We present a new method for nonlinear prediction of discrete random sequences under minimal structural assumptions. We give a mathematical construction for optimal predictors of such processes, in the form of hidden Markov models.
Shalizi, Cosma Rohilla +1 more
core
On Time-Bounded Incompressibility of Compressible Strings and Sequences
For every total recursive time bound $t$, a constant fraction of all compressible (low Kolmogorov complexity) strings is $t$-bounded incompressible (high time-bounded Kolmogorov complexity); there are uncountably many infinite sequences of which every ...
Daylight, E. G. +2 more
core +1 more source
A high‐throughput in silico calculations for NO3RR based on transition metal doped and nitrogen decorated biphenylene network are performed. A symbolic regression is designed to capture the hidden descriptors of NO3RR for hyper dimensional system entailing large geometric variability.
Zheng Shu +9 more
wiley +1 more source
Discatenated and lacunary recurrences [PDF]
Recursive sequences with gaps have been studied previously. This paper considers some elementary properties of such sequences where the gaps have been created on a regular basis from sequence to sequence – ‘discatenated’ (systematic gaps) and ‘lacunary’
Hakan Akkuş +3 more
doaj +1 more source
On Some Properties of the Hofstadter–Mertens Function
Many mathematicians have been interested in the study of recursive sequences. Among them, a class of “chaotic” sequences are named “meta-Fibonacci sequences.” The main example of meta-Fibonacci sequence was introduced by Hofstadter, and it is called the ...
Pavel Trojovský
doaj +1 more source
Code Construction and Decoding Algorithms for Semi-Quantitative Group Testing with Nonuniform Thresholds [PDF]
We analyze a new group testing scheme, termed semi-quantitative group testing, which may be viewed as a concatenation of an adder channel and a discrete quantizer. Our focus is on non-uniform quantizers with arbitrary thresholds.
Emad, Amin, Milenkovic, Olgica
core

