Search

The fixed-length transfer delay-based adaptive frequency-locked loop (TD-AFLL) has drawn much attention with concise structure and faster response speed compared with the conventional second-order generalized integrator-based FLL. However, the application of TD-AFLL is still limited due to the poor performance in terms of phase-angle detection under distorted grid conditions. This letter proposes an enhanced TD-AFLL (ETD-AFLL) with high phase-angle detection accuracy under distorted grid conditions. The ETD-AFLL employs a filter in parallel with the FLL rather than using a pre-filer before the FLL, so that the constructed phase-angle detection keeps a fast response speed. In addition, this filter fully utilizes the inherent samples of TD-AFLL, thus it requires the slightly additional computational cost. Experimental results are given to support the proposed ETD-AFLL.

This article focuses on the problem of robust sliding mode preview control for a class of non-linear delayed systems. It is assumed that the reference signal is previewed with a fixed length ahead and the norm of uncertainty is bounded. A model transformation is introduced to approximate the time-varying delay such that augmented error systems can be constructed. Conditions of asymptotic stability of sliding motion are established via the small gain theorem. The sliding mode preview controller is designed such that the controlled system state can be attracted to the switching surface and keep on it thereafter. A numerical example is presented to illustrate the effectiveness of the proposed control design.

This paper aims to study the effect of Carbon Fiber Filament (CFF) with different ratios and lengths on the physical and mechanical properties of cement mortar. An experimental program included 3 cm fixed length of CFF with 0, 0.25, 0.5, 0.75, and 1% different ratios by weight of cement addition were used in cement mortar cubes. Another experimental program of 0.5% CFF ratio with 1, 2, 3, 4, and 5 cm different lengths by weight of cement addition was used in cement mortar prisms. The physical and mechanical properties of cement mortar containing CFF were experimentally investigated at 7 and 28 days of curing. Workability, by means of flow table test, were measured. Density is conducted for cubes and prisms at the age of 28 days. At ages of 7 and 28 days, compressive and flexural strengths were studied. The study showed a reduction in workability with the increase of CFF ratios and lengths by 0.0 to 2.7% and by 0.9 to 5.4% respectively. Moreover, an improvement in density, compressive, and flexural strengths was observed. At ages of 7 and 28 days, the results showed that compressive strength increased by 33 and 31% respectively at 0.5% of CFF ratio while the flexural strength increased by 125 and 327% respectively with CFF length of 5 cm. Doi: 10.28991/cej-2021-03091753 Full Text: PDF

We extend the concept of non-decreasing Dyck paths to t-Dyck paths. We denote the set of non-decreasing t-Dyck paths by $${{\mathcal D}}_t$$ . Several classic questions studied in other families of lattice paths are studied here for $${{\mathcal D}}_t$$ . We use generating functions, recursive relations and Riordan arrays to count, for example, the following aspects: the number of non-decreasing paths in $${{\mathcal D}}_t$$ with a given fixed length, the total number of prefixes of all paths in $${{\mathcal D}}_t$$ of a given length, and the total number of paths in $${{\mathcal D}}_t$$ with a fixed number of peaks. We give a generating function to count the number of paths in $${{\mathcal D}}_t$$ that can be written as a concatenation of a given fixed number of primitive paths and we give a relation between paths in $${{\mathcal D}}_t$$ and direct column-convex polyominoes.

The article discusses the possible “physical” meaning of the distance between genetic sequences, based on comparing the set of all words of fixed length (N-gram) occurring in two genomic sequences. The considered distances suitable describe phylogenetic relationships and allow ranking by the genomes similarities in situations where it is practically impossible to provide by alignment methods. A simulation shows that the distances between the N-gram distributions change almost linearly, with genome lengths growing for relatively small artificial evolutionary modifications. In the general case of comparing two genetic texts, a function for “calibrating” the distance between N-gram distributions is found. This fact makes it possible to interpret the considered distances by means of the number of elementary operators performed in an alignment process between the compared sequences.

The soil reinforcement by geosynthetics has been extensively applied in covers and liners of landfills. The stability of this structure is especially dependent on the effectiveness of the anchorages holding the geosynthetic sheets. The simple run-out and L-shaped anchorages are the two most commonly used approaches. For increasing the available knowledge of the anchorage system behavior, experimental studies have been conducted. This paper shows the results of the experimental analysis that are based on the results of large-scale pullout apparatus on geogrid embedded in simple run-out and L-shaped anchorage in two modes (fixed length and fixed space). The influence of different geometric parameters of the trench on the behavior of the geogrid is also examined. Based on the results, the values of pullout force were approximately 69% and 196% higher in the case of the fixed length mode and the fixed space mode, in the respective order, compared to the simple run-out anchorage. In the L-shaped anchorage, it is observed that for the initial length (L) constant, the mode is optimized with a small value of the geogrid rear heel length (B) and a greater value of the depth of the buried geogrid (D) when D+B is constant.

In this short note we analyze the computation algorithms modelled by Church-Turing-Post machines with algorithms for computation which use amount of time spent for computation (number of steps) in their own definitions. We notice some difference and illustrate that there are distinctions in behaviour of such algorithms; also we consider working of MTs on tapes of fixed length and observe again noticed difference

The problem being considered is the reconstruction of periodic words from a finite alphabet using multiset of fixed length subwords. This is a special case of a more general problem of reconstruction with incomplete information and under restrictions on the words in question. For some constraints on the multiset of subwords, conditions for possibility of reconstruction are obtained. It is shown that a periodic word with period $$p$$ is uniquely determined by the multiset of its subwords of length $$k \geq \left\lfloor\frac{16}{7} \sqrt{p}\right\rfloor + 5$$. For a word consisting of a non-periodic prefix of length $$q$$ and a periodic suffix with period $$p$$, repeated $$l$$ times, a similar estimate is obtained: $$k \geq \left\lfloor\frac{16}{7} \sqrt{P}\right\rfloor + 5$$, provided $$l \geq q^{\left\lfloor\tfrac{16}{7} \sqrt{P}\right\rfloor + 5}$$ where $$P = \max(p, q)$$.

It is common practice in India to install rock anchors around test pile in order to obtain reaction for static load tests wherever competent rock is encountered at reasonable depths. Rock anchor design and installation require adequate attention as it is dependent on several parameters and checks. Authors have performed several static load tests across India with rock anchors up to test load of around 2000tons and also in various rock formations such as Basalt, Breccia, Tuff, Granite, Sandstone, etc. Competent rock levels also have been seen to be varied to great extent such as around 20 m from ground surface and such long free lengths offer several challenges including extension of strands equal to or more than ram stroke. Typically, for rock anchors in soft rocks, computed fixed length may be more than 10 m, and BS code 8081:1989 limits the fixed length to 10 m. In order to assess the rock anchor behavior for such condition where fixed length was more than 10 m, an effort was made to test the anchors to its full capacity and corresponding experience will also be summarized in the paper in the form of case history. This paper addresses rock anchor design philosophy including several checks required for appropriate rock anchor design, approaches for rock anchor design in soft rock, author’s experience of rock anchor design and installation with various rock types across India, along with case studies. Paper will also highlight benefits and limitations associated with installation of inclined anchors for crown girder assembly.

In this paper, with the assumption that infectious individuals, once recovered for a period of fixed length, will relapse back to the infectious class, we derive an epidemic model for a population living in a two-patch environment (cities, towns, or countries, etc.). The model is given by a system of delay differential equations with a fixed delay accounting for the fixed constant relapse time and a non-local term caused by the mobility of the individuals during the recovered period. We explore the dynamics of the model under two scenarios: (i) assuming irreducibility for three travel rate matrices; (ii) allowing reducibility in some of the three matrices. For (i), we establish the global threshold dynamics in terms of the principal eigenvalue of a 2×2 matrix. For (ii), we consider three special cases so that we can obtain some explicit results, which allow us to explicitly explore the impact of the travel rates. We find that the role that the travel rate of recovered and infectious individuals differs from that of susceptible individuals. There is also an important difference between case (i) and (ii): under (ii), a boundary equilibrium is possible while under (i) it is impossible.

In this paper we investigate the computational complexity of deciding if a given finite algebraic structure satisfies a fixed (strong) Maltsev condition $\Sigma$. Our goal in this paper is to show that $\Sigma$-testing can be accomplished in polynomial time when the algebras tested are idempotent and the Maltsev condition $\Sigma$ can be described using paths. Examples of such path conditions are having a Maltsev term, having a majority operation, and having a chain of J\'onsson (or Gumm) terms of fixed length., Comment: 33 pages, 19 figures

We define a new class of shift spaces which contains a number of classes of interest, like Sturmian shifts used in discrete geometry. We show that this class is closed under two natural transformations. The first one is called conjugacy and is obtained by sliding block coding. The second one is called the complete bifix decoding, and typically includes codings by non-overlapping blocks of fixed length.

Optimization of algorithms for computing the values of polynomials, more precisely, of monomials, is equivalent to the problem of constructing for a given number a minimal additive chain. To search for such chains, no algorithms are known except brute force. The increase in the complexity of the brute force algorithm is very large. Among chains of the same length there are a lot of equivalent ones, that is, those ending with the same number. The article provides a sufficient criterion for the equivalence of chains and shows how the use of the criterion reduces the procedure for the formation of all additive chains of a fixed length.

In this article we establish equivariant isomorphisms of Ext and Tor modules over different relative complete intersections. More precisely, for a commutative ring $Q$, this paper investigates how $Ext_{Q/(\boldsymbol{f})}^*(M,N)$ and $Tor^{Q/(\boldsymbol{f})}_*(M,N)$ change when one varies $\boldsymbol{f}$ among all Koszul-regular sequences of a fixed length such that $\boldsymbol{f} M=0$ and $\boldsymbol{f} N=0$. Of notable interest is how the theory of perturbations is used to establish isomorphisms of certain DG modules., 13 pages. Comments welcome!

In this paper, we address the problem of constructing required subgraphs using stock pieces of fixed length (CRS-SPFL, for short), which is a new variant of the minimum-cost edge-weighted subgraph (MCEWS, for short) problem. Concretely, for the MCEWS problem Q, it is asked to choose a minimum-cost subset of edges from a given graph G such that these edges can form a required subgraph $$G'$$. For the CRS-SPFL problem $$Q^{\prime }$$, these edges in such a required subgraph $$G'$$ are further asked to be constructed by plus using some stock pieces of fixed length L. The new objective, however, is to minimize the total cost to construct such a required subgraph $$G'$$, where the total cost is sum of the cost to purchase stock pieces of fixed length L and the cost to construct all edges in such a subgraph $$G'$$. We obtain the following three main results. (1) Given an $$\alpha $$-approximation algorithm to solve the MCEWS problem, where $$\alpha \ge 1$$ (for the case $$\alpha =1$$, the MCEWS problem Q is solved optimally by a polynomial-time exact algorithm), we design a $$2\alpha $$-approximation algorithm and another asymptotic $$\frac{7\alpha }{4}$$-approximation algorithm to solve the CRS-SPFL problem $$Q^{\prime }$$, respectively; (2) When Q is the minimum spanning tree problem, we provide a $$\frac{3}{2}$$-approximation algorithm and an AFPTAS to solve the problem $$Q^{\prime }$$ of constructing a spanning tree using stock pieces of fixed length L, respectively; (3) When Q is the single-source shortest paths tree problem, we present a $$\frac{3}{2}$$-approximation algorithm and an AFPTAS to solve the problem $$Q^{\prime }$$ of constructing a single-source shortest paths tree using stock pieces of fixed length L, respectively.

Palindromic duplication (PD) and tandem duplication (TD) errors can occur when the DNA of a living organism is used to store data. In this work, we construct codes which can correct any number of PD errors of fixed length $k$ where $k=2,3$ . Codes are also constructed to correct a combination of TD errors of fixed length $k$ and PD errors of fixed length $k$ where $k=2,3$ . We introduce $\leqslant k$ -clamp free irreducible words and use them to construct codes which can correct any combination of $ \leqslant k $ -TD and $ \leqslant k $ -PD errors where $k=2,3$ . The extension of these constructions to $k>3$ is conjectured.

As a consequence of the wide deployment of biometrics-based recognition systems, there are increasing concerns about the security of the sensitive information managed. Various techniques have been proposed in the literature for the biometric templates protection (BTP), having gained great popularity the crypto-biometric systems. In the present paper we propose the implementation of a Fuzzy Vault (FV) scheme based on fixed-length templates with application to dynamic signature verification (DSV), where only 15 global features of the signature are considered to form the templates. The performance of the proposed system is evaluated using three databases: a proprietary collection of signatures, and the publicly available databases MCYT and BioSecure. The experimental results show very similar verification performance compared to an equivalent unprotected system. This work was supported by the Spanish National Cybersecurity Institute (INCIBE) through the Excellence of Advanced Cybersecurity Research Teams Program.

Symptomatic dermographism, a type of physical urticaria is a common condition affecting patient’s quality of life. For its diagnosis, clinicians in India currently use tip of the ball point pen for estimating the provocation threshold. However, because of single tip of fixed length, ball point pen can-not differentiate between different grades of symptomatic dermographism. With variations in the intensity of stroke, there is a possibility of even missing the diagnosis. Hence, there is a need of a better method to diagnose symptomatic dermographism and determine the provocation threshold. Skin writometer, a plastic instrument with three arms of varying length can be novel in this regards. This instrument is simple, user friendly, easy to use and inexpensive. It can be used for diagnosis as well as assessment of treatment response in patients with symptomatic dermographism. Keywords: instrument, Symptomatic dermographism, Usefulness.

We consider a cooperative packing game in which the characteristic function is defined as the maximum number of independent simple paths of a fixed length included in a given coalition. The conditions under which the core exists in this game are established, and its form is obtained. For several particular graphs, the explicit form of the core is presented.

This paper studies cooperative charging, in which multiple mobile chargers cooperatively provide wireless charging services in a Wireless Rechargeable Sensor Network (WRSN). The ultimate goal of this cooperative charging is the long-term optimization that maximizes both the lifetime of all sensor nodes and the charging utility of each Mobile Charger (MC). We have attempted to apply Multi-Agent Reinforcement Learning (MARL) algorithms to this problem. Unfortunately, similar to existing methods, MARL algorithms also fail early in cooperative charging. We found that an MARL algorithm trained in each time-step of fixed length is neither accurate nor efficient in cooperative charging. We propose a new MARL framework, called VarLenMARL. For the accuracy of reward estimation, VarLenMARL allows each MC completes an action within a time-step of variable length before estimating rewards. Furthermore, we design a special mechanism in VarLenMARL for the long-term optimality of cooperative charging within a WRSN. Our results show that algorithms implemented on VarLenMARL achieved both higher charging utility of MCs and longer lifetime of sensor nodes.

The correlation method for operative detection of recurrent states in complex dynamical systems at irregular measurements was proposed. The concepts of correlation for the case of the vectors of states of the trajectory of dynamics of complex systems and estimates of vectors correlation for a fixed length fragment moving along the trajectory were generalized. The space with scalar product of states vectors is used to implement the method. Estimation of the magnitudes of correlations of state vectors makes it possible to interpret them as corresponding levels of energy interaction of states vectors and to detect degree of their recurrence. In this case, calculation of the magnitudes of correlation are carried out only based on the known measurements of the state vector and does not require determining the threshold and the method of distance calculation, traditionally used in the methods of recurrent plots. The efficiency of the proposed method was tested on a specific example of experimental data of the actual dynamics of the vector of states of pollution of the urban atmosphere. The following gas pollutants were considered as components of the vector of state: formaldehyde, ammonia and carbon dioxide. The obtained results in general indicate the efficiency of the proposed method. It was established experimentally that the correlation method in case of irregular measurements of atmospheric contaminations ensures the authenticity of detection of recurrent states, corresponding to maximum correlation of states. In this case, the correlation assessment should be conducted for a movable fragment of a trajectory of the states vector. The length of the fragment should not be more than 10 responses

In this study, the poly(D-lactide)-block-poly(butylene succinate)-block-poly(D-lactide) (PDLA-b-PBS-b-PDLA) triblock copolymers with a fixed length of PBS and various lengths of PDLA are synthesized, and the crystallization behaviors of the PDLA and PBS blocks are investigated. Although both the crystallization behaviors of PBS and PDLA blocks depend on composition, they exhibit different variations. For the PDLA block, its crystallization behaviors are mainly influenced by temperature and block length. The crystallization signals of PDLA block appear in the B-D 2–2 specimen, and these signals get enhanced with PDLA block length. The crystallization rates tend to decrease with increasing PDLA block lendth during crystallizing at 90 and 100 °C. Crystallizing at higher temperature, the crystallization rates increase at first and then decrease with block length. The crystallization rates decrease as elevating the crystallization temperature. The melting temperatures of PDLA blocks increase with block lengths and crystallization temperatures. For the PBS block, its crystallization behaviors are mainly controlled by the nucleation and confinement from PDLA block. The crystallization and melting enthalpies as well as the crystallization and melting temperatures of PBS block reduce as a longer PDLA block has been copolymerized, while the crystallization rates of the PBS block exhibit unique component dependence, and the highest rate is observed in the B-D 2–2 specimen. The Avrami exponent of PBS crystallites is reduced as a longer PDLA block is incorporated or the sample is crystallized at higher temperature. This investigation provides a convenient route to tune the crystallization behavior of PBS and PLA.

In 2000, Babson and Steingr\'{i}msson generalized the notion of permutation patterns to the so-called vincular patterns, and they showed that many Mahonian statistics can be expressed as sums of vincular pattern occurrence statistics. STAT is one of such Mahonian statistics discoverd by them. In 2016, Kitaev and the third author introduced a words analogue of STAT and proved a joint equidistribution result involving two sextuple statistics on the whole set of words with fixed length and alphabet. Moreover, their computer experiments hinted at a finer involution on $R(w)$, the rearrangement class of a given word $w$. We construct such an involution in this paper, which yields a comparable joint equidistribution between two sextuple statistics over $R(w)$. Our involution builds on Burstein's involution and Foata-Sch\"{u}tzenberger's involution that utilizes the celebrated RSK algorithm., Comment: 11 pages

Background To reduce excess central line use and provide an option for difficult venous access patients through the introduction of a midline catheter. Methods Design included prospective monitoring of the implementation of a quality improvement project. The setting was a 576 bed, urban, community, nonprofit, Magnet recognized, level 3 trauma center serving primarily adult patients. Midline and peripherally inserted central catheters were inserted by a specialty nursing team; care and maintenance of all devices were provided by front line staff. Results Zero midline catheter infections were observed in the 24 months after implementation of the fixed length, power injectable device. Completion of therapy was 80%, the most frequently encountered complication was device dislodgement. Conclusions Adoption of a vascular access nurse led midline catheter program, coupled with device selection algorithms expanded the ability to select the right device for the patient, while decreasing excess central line usage without additional increased risks to the patient.

We consider the status updates of a physical process over an unreliable channel. In this setting, one may not be able to reliably transmit the current state at all times. Instead, one is interested in the timeliness of the accurately received information. This is a setting for several cyber-physical system applications that require real-time monitoring and control. In this paper, we study periodic data transmission schemes at a single source which exploit the temporal correlation in the source messages. When the source has no feedback, it can periodically send the actual information, interspersed with differential messages. On the availability of receiver's feedback at the source, it can decide to send either the differential or the actual information at each transmission opportunity. For a fixed length coding, we show that the differential encoding improves the timeliness performance only if the receiver's feedback is available.

Obstructive sleep apnea (OSA) is a common sleep-related respiratory disease that affects people's health, especially in the elderly. In the traditional PSG-based OSA detection, people's sleep may be disturbed, meanwhile the electrode slices are easily to fall off. In this paper, we study a sleep apnea detection method based on non-contact mattress, which can detect OSA accurately without disturbing sleep. Piezoelectric ceramics sensors are used to capture pressure changes in the chest and abdomen of the human body. Then heart rate and respiratory rate are extracted from impulse waveforms and respiratory waveforms that converted by filtering and processing of the pressure signals. Finally, the Heart Rate Variability (HRV) is obtained by processing the obtained heartbeat signals. The features of the heartbeat interval signal and the respiratory signal are extracted over a fixed length of time, wherein a classification model is used to predict whether sleep apnea will occur during this time interval. Model fusion technology is adopted to improve the detection accuracy of sleep apnea. Results show that the proposed algorithm can be used as an effective method to detect OSA.

The paper deals with the methods used by companies for controlled transactions in services. The author performs an analysis of the ways a company that takes part in controlled transactions of transfer pricing can tackle tax issues using an adequate tax method. Services should comply with the arm’s length principle. Therefore, the best method rule and the comparability analysis have a critical role in the arm’s length principle of services. The paper compares the results of transfer pricing services with the transfer pricing of goods to conclude the similarities. The object of the paper is to determine the importance of the application of fixed length principle, meaning the application of additional tax for controlled transactions and declined tax for uncontrolled transactions. Therefore, this scrutiny showed that the unstable tax environments force enterprises to proceed to controlled transactions.

Due to the usage of social distancing as a means to control the spread of the novel coronavirus disease COVID-19, there has been a large amount of research into the dynamics of epidemiological models with time-varying transmission rates. Such studies attempt to capture population responses to differing levels of social distancing, and are used for designing policies which both inhibit disease spread but also allow for limited economic activity. One common criterion utilized for the recent pandemic is the peak of the infected population, a measure of the strain placed upon the health care system; protocols which reduce this peak are commonly said to ‘flatten the curve.” In this work, we consider a very specialized distancing mandate, which consists of one period of fixed length of distancing, and addresses the question of optimal initiation time. We prove rigorously that this time is characterized by an equal peaks phenomenon: the optimal protocol will experience a rebound in the infected peak after distancing is relaxed, which is equal in size to the peak when distancing is commenced. In the case of a non-perfect lockdown (i.e. disease transmission is not completely suppressed), explicit formulas for the initiation time cannot be computed, but implicit relations are provided which can be pre-computed given the current state of the epidemic. Expected extensions to more general distancing policies are also hypothesized, which suggest designs for the optimal timing of non-overlapping lockdowns.

Sin importar el tipo de tecnología aplicada para la secuenciación de un genoma, el filtrado de secuencias es un paso esencial, en el cual aquellas lecturas de baja calidad o parte de estas son eliminadas. En un ensamblado la construcción de un genoma se realiza a partir de la unión de lecturas cortas en cóntigos. Algunos ensambladores miden la relación que existe entre secuencias de una longitud fija (k-mer) que puede verse afectada por la presencia de secuencias de baja calidad. Un enfoque común para evaluar los ensamblados se basa en el análisis del número de cóntigos, la longitud del cóntigo más largo y el valor de N50,definido como la longitud del cóntigo que representa el 50% de la longitud del conjunto. En este contexto, el presente estudio tuvo como objetivo evaluar el efecto del uso de lecturas crudas y filtradas en los valores de los parámetros de calidad obtenidos en el ensamblado del genoma de la cepa de Bacillus altitudinis19RS3 aislada de Ilex paraguariensis. Se realizó el análisis de calidad de ambos archivos de partida con el software FastqC y se filtraron las lecturas con el software Trimmomatic. Para el ensamblado se utilizó el softwareSPAdes y para su evaluación la herramienta QUAST. El mejor ensamblado para B. altitudinis19RS3 se obtuvo a partir de las lecturas filtradas con el valor dek-mer79, que generó 16cóntigosmayores a 500 pb con un N50 de 931914 pb y el cóntigo más largo de 966271 pb. Sequence filtering is an essential step regardless of the type of technology applied for sequencing a genome, in which low-quality readings or a portion are eliminated. In an assembly, the construction of a genome is carried out from the union of short reads in contigs. Some assemblers measure the relationship between sequences of a fixed length (k-mer) that can be affected by the presence of low-quality sequences. A common approach to evaluating assemblies is based on the analysis of the number of contigs, the length of the longest contig, and the value of N50 defined as the length of the contig representing 50 % of the length of the assembly. In this context, the objective of this study was to evaluate the effect of the use of crude and filtered reads on the values of the quality parameters obtained from the genome assembly of Bacillus altituidinis 19RS3 isolated from Ilex paraguariensis. The quality analysis of both starting files was performed with the FastqC software and the readings were filtered with the Trimmomatic software. The SPAdes software was used for the assembly and the QUAST tool for its evaluation. The best assembly for B. altitudinis 19RS3 was obtained from the filtered readings with the value of k-mer 79, which generated 16 contigs greater than 500 bp with a N50 of 931 914 bp and the longest contig of 966 271 bp. Fil: Cortese, Iliana Julieta. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Nordeste; Argentina. Universidad Nacional de Misiones. Facultad de Ciencias Exactas Químicas y Naturales. Departamento de Bioquímica Clínica. Laboratorio de Biotecnología Molecular; Argentina Fil: Castrillo, María Lorena. Universidad Nacional de Misiones. Facultad de Ciencias Exactas Químicas y Naturales. Departamento de Bioquímica Clínica. Laboratorio de Biotecnología Molecular; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Nordeste; Argentina Fil: Zapata, Pedro Dario. Universidad Nacional de Misiones. Facultad de Ciencias Exactas Químicas y Naturales. Departamento de Bioquímica Clínica. Laboratorio de Biotecnología Molecular; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Nordeste; Argentina Fil: Laczeski, Margarita Ester. Universidad Nacional de Misiones. Facultad de Ciencias Exactas Químicas y Naturales. Departamento de Bioquímica Clínica. Laboratorio de Biotecnología Molecular; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Nordeste; Argentina

We consider the problem of synthesizing joint distributions of signals and actions over noisy channels in the finite-length regime. For a fixed blocklength $n$ and an upper bound on the distance $\varepsilon$, a coding scheme is proposed such that the induced joint distribution is $\varepsilon$-close in $L^1$ distance to a target i.i.d. distribution. The set of achievable target distributions and rate for asymptotic strong coordination can be recovered from the main result of this paper by having $n$ that tends to infinity., 5 pages, 2 figures

The problem of finding the minimum number of colors to color a graph properly without containing any bicolored copy of a fixed family of subgraphs has been widely studied. Most well-known examples are star coloring and acyclic coloring of graphs (Grunbaum, 1973) where bicolored copies of \(P_4\) and cycles are not allowed, respectively. We introduce a variation of these problems and study proper coloring of graphs not containing a bicolored path of a fixed length and provide general bounds for all graphs. A \(P_k\)-coloring of an undirected graph G is a proper vertex coloring of G such that there is no bicolored copy of \(P_k\) in G, and the minimum number of colors needed for a \(P_k\)-coloring of G is called the \(P_k\)-chromatic number of G, denoted by \(s_k(G).\) We provide bounds on \(s_k(G)\) for all graphs, in particular, proving that for any graph G with maximum degree \(d\ge 2,\) and \(k\ge 4,\) \(s_k(G)\le \lceil 6\sqrt{10}d^{\frac{k-1}{k-2}} \rceil .\) Moreover, we find the exact values for the \(P_k\)-chromatic number of the products of some cycles and paths for \(k=5,6\).

Machine translation is one of the challenging Artificial Intelligence areas due to the complexity of the languages. Models that use Recurrent Neural Networks (RNN) such as Sequence-to-Sequence model have become popular on many Natural Language Processing (NLP) problems including machine translation. However, these models underperform on long sentences due to fixed length vector design. In this paper, we deployed a RNN based Sequence-to-Sequence model and Long Short-Term Memory (LSTM) with attention trained for Machine Translation (MT). We evaluated our model on a Turkish to English dataset. In addition, we have created a dataset with words from Ottoman literature which we plan to use in our future studies. We believe that this dataset will be a very valuable data source as not many NLP studies have been done with Ottoman literature. The effect of hyperparameters is also examined.

In this paper, a frame synchronization algorithm based on the cumulative sum is proposed in order to solve the frame synchronization problem of navigation messages. First, it is concluded that the synchronization code appears periodically on the basis of the analysis of the inherent structural characteristics of navigation messages. Second, on the basis of the above conclusion, the sequence to be synchronized is divided according to a fixed length, and the cumulative sum processing is carried out to obtain the cumulative sequence. Last, by observing the periodic distribution of the cumulative sequence, the correct synchronization of navigation messages is achieved. The simulation experiments have verified the effectiveness of the proposed algorithm that shows certain practical engineering values.

We conducted lab-scale experiments to investigate the mechanism of dual-peaked breakthrough curves (BTCs) in karst tracer tests. Three groups of dual conduit structures were constructed by varying: (1) the length ratio between the two conduits for a fixed length of the shorter conduit, (2) the total length of the conduits for a fixed length ratio, (3) the connection angle between the conduits. The BTCs generated by the tracing experiments were fitted by a Dual-Region Advection Dispersion (DRAD) model to derive effective transport parameters. Our results confirm that the dual conduit structure triggers the double-peaked BTCs. Increasing the conduit length for a fixed length ratio or increasing the length ratio increases peak separation. The connection angles between the two conduits θ1 and θ2 also influence the BTCs: increasing θ1 and decreasing θ2 causes the first peak to get smaller and the second peak to get larger. The DRAD model can reproduce the dual-peaked BTCs while its application to the case of single-peaked BTCs may be problematic due to strong interaction between model parameters. A method is proposed for estimating underground karstic conduit lengths from experimental dual-peaked BTCs.

We consider the problem of geometric optimization for the lowest eigenvalue of the two-dimensional Schrodinger operator with an attractive δ′-interaction of a fixed strength, the support of which is a C2-smooth contour. Under the constraint of a fixed length of the contour, we prove that the lowest eigenvalue is maximized by the circle. The proof relies on the min-max principle and the method of parallel coordinates.

We prove the analyticity of smooth critical points for O’Hara’s knot energies [Formula: see text], with [Formula: see text] and [Formula: see text], subject to a fixed length constraint. This implies, together with the already established regularity results for O’Hara’s knot energies, that bounded energy critical points of [Formula: see text] subject to a fixed length constraint are not only [Formula: see text] but also analytic. Our approach is based on Cauchy’s method of majorants and a decomposition of the gradient that was adapted from the Möbius energy case [Formula: see text].

It is well known that the expected number of real zeros of a random cosine polynomial $ V_n(x) = \sum_ {j=0} ^{n} a_j \cos (j x) , \ x \in (0,2\pi) $, with the $ a_j $ being standard Gaussian i.i.d. random variables is asymptotically $ 2n / \sqrt{3} $. On the other hand, some of the previous works on the random cosine polynomials with dependent coefficients show that such polynomials have at least $ 2n / \sqrt{3} $ expected real zeros lying in one period. In this paper we investigate two classes of random cosine polynomials with pairwise equal blocks of coefficients. First, we prove that a random cosine polynomial with the blocks of coefficients being of a fixed length and satisfying $ A_{2j}=A_{2j+1} $ possesses the same expected real zeros as the classical case. Afterwards, we study a case containing only two equal blocks of coefficients, and show that in this case significantly more real zeros should be expected compared to those of the classical case.

We consider a susceptible, infected, removed (SIR) system where the transmission rate may be temporarily reduced for a fixed amount of time. We show that in order to minimize the total number of fatalities, the transmission rate should be reduced on a single contiguous time interval, and we characterize this interval via an integral condition. We conclude with a few numerical simulations showing the actual reduction obtained., Comment: 15 pages, 2 figures

In cloud infrastructure, job scheduling is the main critical issue to be solved. Effective and efficient task scheduling algorithm needed to met users requirement and resolve the complexity in cloud environment, Data of resources are shared among several cloud users. Task scheduling comes under NP-complete problem to apply appropriate scheduling policy is major concern. Many researchers consider this problem with fixed length of time which cannot be applicable in dynamic world computing. Our research aim is to consider the number of instruction execution of processor and Grain_size of work of piece. Through the simulation experiment the proposed algorithm helps to improve the efficiency & effectiveness of scheduling as well as to minimize the finished time in (ms).

The aims of this study were to describe the worst-case scenarios (WCS) in professional soccer players calculated by fixed length and rolling average methods with regards to each playing position. This was done, firstly, by comparing total distance (TD covered in the WCS; secondly, by comparing high-speed running distance (HSRD); and thirdly, by comparing sprint distance (SPD). The study was conducted over a three-mesocycle competitive period. The WCS of three distance-related variables (TD, HSRD, SPD) in four time windows (1, 3, 5, 10 minutes) were calculated according to playing position (central defender; full-back; midfielder, wide midfielder, and forward) using fixed length and rolling average methods. A significant effect of the type of method used to calculate the WCS in TD (F(1, 142) = 151.49, p < 0.001, ηp2 = 0.52), HSRD (F(1, 138) = 336.95, p < 0.001, ηp2 = 0.71) and SPD (F(1, 138) = 76.74, p < 0.001, ηp2 = 0.36) was observed. In addition, there was a significant interaction between type of method and WCS duration in TD (F(1.36, 193.53) = 41.95, p < 0.001, ηp2 = 0.23), HSRD (F(2.28, 315.11) = 21.77, p < 0.001, ηp2 = 0.14) and SPD (F(2.59, 358.41) = 6.93, p < 0.001, ηp2 = 0.05). In conclusion, the use of fixed length methods of different durations significantly underestimated the WCS of TD, HSRD and SPD across the most common playing positions in professional soccer players. Therefore, the application of rolling averages is recommended for an appropriate WCS analysis in professional soccer match-play.

In this paper we consider the problem of determining fixed-length routes on a street map that start and end at the same location. We propose a heuristic for this problem based on finding pairs of edge-disjoint shortest paths, which can then be combined into a circuit. Various heuristics and filtering techniques are also proposed for improving the algorithm’s performance.

Low-cost options to provide local transactional network coverage are LPWAN (Low Power Wide Area Network), which are simpler to implement and to manage. The emerging technology known as LoRaWAN represents a promising LPWAN option due to its relative long range, as well as the technological development opportunities given its recent introduction and unfinished standard. The main LoRaWAN protocol consists of frames with fixed length encoded data from end-devices, no matter the length of such data; this choice is to simplify coding, transmission and decoding, in order to keep the low-power consumption of the network. In this work we present a modification of the LoRaWAN communications protocol in which payload data are encoded within customised frames which respect the nature and length of such data. The methodology is exemplified considering low-power end-devices (sensors) which generate 9 position, orientation and meteorological variables, and it is carefully implemented in order to simplify the decoding stage in the receiver as well as to optimise the manageability of the network traffic. The main outcome of this frame encoding of variable length technique is a considerable improvement of transmission data rates (with a factor of \({\sim }50{\times }\) for the chosen sensing modules) as the payload field is never filled with zeros up to the fixed size of the corresponding frame (according to original LoRaWAN standard). As the obtained frames are way smaller for this kind of sensors, the maximum number of end-devices supported by the network before its saturation point also increases substantially. This proposal is aimed to represent a viable and inexpensive option to cover the increasing demand in network coverage for end-devices as those used in Internet of Things and smart cities.