The inverse Frobenius–Perron problem (IFPP) is a global open-loop strategy to control chaos. The goal of our IFPP is to design a dynamical system in < which is: (1) nearby the original dynamical system, and (2) has a desired invariant density. We reduce the question of stabilizing an arbitrary invariant measure, to the question of a hyperplane intersecting a unit hyperbox; several controllabili...

1.1. Preliminaries. We will begin with a detailed study of the Kontsevich moduli spaces of stable maps to P . These spaces can be defined much more generally. However, we will have very little to say about the general situation. We will mostly concentrate on the case of genus zero maps to P . The best introduction to Kont­ sevich moduli spaces is [FP] where you can find details about the constr...

Feature-Product networks (FP-nets) are a novel deep-network architecture inspired by principles of biological vision. These contain the so-called FP-blocks that learn two different filters for each input feature map, outputs which then multiplied. Such an is models end-stopped neurons, common in cortical areas V1 and especially V2. The authors here use FP-nets on three image quality assessment ...

BACKGROUND Unique adhesive and biocompatibility properties of mussel adhesive proteins (MAPs) are known for their great potential in many tissue engineering and biomedical applications. Previously, it was successfully demonstrated that redesigned hybrid type MAP, fp-151, mass-produced in Gram-negative bacterium Escherichia coli, could be utilized as a promising adhesive biomaterial. However, pu...

Discovering new drugs for disease treatment is challenging, requiring a multidisciplinary effort as well time, and resources. With view to improving hit discovery lead compound identification, machine learning (ML) approaches are being increasingly used in the decision-making process. Although number of ML-based studies have been published, most only report fragments wider range bioactivities w...

In this paper we present the novel SD-Map algorithm for exhaustive but efficient subgroup discovery. SD-Map guarantees to identify all interesting subgroup patterns contained in a data set, in contrast to heuristic or samplingbased methods. The SD-Map algorithm utilizes the well-known FP-growth method for mining association rules with adaptations for the subgroup discovery task. We show how SD-...

Objectives: The goal of this paper is to introduce the ideas Contra soft generalized** (briefly g**). Continuous functions and almost g**) – in topological spaces. Additionally, we discussed some its characteristics. Methods: To obtain definition contra g**- continuous functions, used previously introduced definition(1) (i.e. inverse image every closed set FQ g**-closed FP). Also, regular open ...

The N-terminal domain of HIV-1 glycoprotein 41,000 (gp41) participates in viral fusion processes. Here, we use physical and computational methodologies to examine the secondary structure of a peptide based on the N terminus (FP; residues 1–23) in aqueous and detergent environments. C-Fourier transform infrared (FTIR) spectroscopy indicated greater -helix for FP in lipid-detergent sodium dodecyl...

The N-terminal domain of HIV-1 glycoprotein 41,000 (gp41) participates in viral fusion processes. Here, we use physical and computational methodologies to examine the secondary structure of a peptide based on the N terminus (FP; residues 1-23) in aqueous and detergent environments. (12)C-Fourier transform infrared (FTIR) spectroscopy indicated greater alpha-helix for FP in lipid-detergent sodiu...