Anisotropic metrics for finite element meshes using a posteriori error estimates: Poisson and Stokes equations

In this paper, metrics derived from a posteriori error estimates for the Poisson problem and for the Stokes system solved by some finite element methods are presented. Numerical examples of mesh adaptation in two dimensions of the space are given and show that these metrics detect the singular behavior of the solution, in particular its anisotropy.     

Using Boolean factors for the construction of an artificial neural networks

ABSTRACT

We propose a novel approach to define Artificial Neural Network(ANN) architecture from Boolean factors. ANNs are a subfield of machine learning applicable to several areas of life. However, defining its architecture for solving a given problem is not formalized and remains an open research problem. Since it is difficult to look into the network and figure out exactly what it has learnt, the complexity of such a technique makes its interpretation more tedious. We propose in this paper to build feedforward ANNs using the optimal factors obtained from the Boolean context representing a data. Since optimal factors completely cover the data and therefore give an explanation to these data, We could give an interpretation to the neurons activation and justify the presence of a neuron in our proposed neural network. We show through experiments and comparisons on the use data sets that this approach provides relatively better results for some key performance measures.     

Influence of bunch maturation and chemical precursors on acrylamide formation in starchy banana chips

The present study investigated the effect of ripening stages and chemical precursors on acrylamide formation in deep-fried chips of five plantains and one cooking banana. The highest level of acrylamide was found in the cooking banana, followed by False Horn plantain and French plantain, respectively. French plantain hybrids exhibited a significantly lower (P < 0.05) level of acrylamide when compared to French plantain. The ripening stage demonstrated a positive Pearson correlation (P < 0.05, r = 0.57) with acrylamide formation. As ripening progressed, the levels of glucose and fructose significantly increased (P < 0.05) and showed a positive correlation with acrylamide formation (r = 0.85 and 0.96, respectively). The level of the amino acid asparagine during ripening was not correlated with acrylamide formation. In contrast, the level of histidine, arginine, iso-leucine and cystine during ripening was positively correlated (P < 0.05, r > 0.60) with acrylamide formation in fried chips. The higher level of TP was significantly related (P < 0.05) to the lower level of acrylamide (r = −0.62). The reduced levels of carotenoid isomers, except lutein, during fruit ripening were positively correlated (P < 0.05) with acrylamide formation, especially trans-BC (r = 0.72) and 9-cis-BC(r = 0.64).     

Colorimetric Detection of Small Molecules by a Frustrated Lewis Pair Containing a Phosphorus-Functionalized Cycloheptatrienyl?Cyclopentadienyl Titanium Sandwich Complex

The phosphorus-functionalized cycloheptatrienyl cyclopentadienyl (Cht Cp) titanium sandwich complex [(η⁷-C₇H₇)Ti(η⁵-C₅H₄PtBu₂)] ( 7 ) forms a frustrated Lewis pair (FLP) in combination with the borane B(C₆F₅)₃, and this FLP undergoes heterolytic cleavage of dihydrogen and fixation of carbon dioxide and nitrous oxide with a noticeable colorimetric response, which is visible to the naked eye. In their UV/Vis spectra, the H₂, CO₂ and N₂O fixation products exhibit a bathochromic shift of the absorption band that can be assigned to a HOMO LUMO excitation of the Cht Cp titanium (troticene) moiety.     

Evaluation of Beauvericin Toxicity with the Bacterial Bioluminescence Assay and the Ames Mutagenicity Bioassay

ABSTRACT: The bacterial bioluminescence assay was used to determine the acute toxicity level of beauvericin, which was found to be moderate with an EC₅₀ of 94 ± 9 μg/ml. The Ames test was used to evaluate mutagenicity of this mycotoxin. Assays were carried out on 5 Salmonella typhimurium standard tester strains. The spot test was performed on a single beauvericin concentration of 2 μg/plate. The plate incorporation test was done over a range of concentrations (0.2 to 500 μg/plate), both with and without S9. A negative control and 3 positive controls, 2-aminofluorene, sodium azide, and dexon, were included in the assays. Beauvericin was nonmutagenic to any of the standard tester strains used, either with or without metabolic activation.     

Anterior and antero-lateral surgery of the lower cervical spine (25 years after H. Verbiest). 2: Indications, results, complications)

The present course on the anterior and antero-lateral surgical approach of the lower cervical spine was organized for the neurosurgery trainees by the French Speaking Neurosurgical Society, and was held during the winter meeting in December 1995. The aim of this course was to recall the basic technical principles of the microsurgical anterior cervical approach, and to discuss the main indications of this surgical treatment. Many theoretical points were strengthened by the author's personal experience and comments. In Part I, the technical bases of the different anterior or antero-lateral approaches were presented (1996, 42 : 105-122). In the present Part II, the main indications of the anterior surgical approach to the cervical disk or the vertebral body are detailed, and the requirement of a bone graft and/or an osteosynthesis are discussed with their consequences on the final results. Secondly, variants of the surgical technics in use in case of cervical spinal instability are commented. Then various approaches to the cervical spinal tumors and to the vertebral artery are detailed and commented. Lastly, general and specific complications of the anterior cervical approach are listed with their rate of occurrence, and their prevention and management are discussed.     

A numerical investigation of the use of novel melt processed PET‐hemp fiber composites for thermoforming applications

The mechanical and structural properties of five formulations of a novel melt processed poly‐ethylene terephthalate (PET)‐hemp fibers composite were determined, followed by a numerical investigation of their thermoformability using the ThermoForm^® code. The composites' linear viscoelastic properties were determined by small amplitude oscillatory shear tests and their viscoelastic behavior characterized by the Christensen's model. The forming pressure load required by the numerical analysis was derived from the Redlich–Kwong's real gas equation of state. The air flow's influence on the thickness of the thermoformed part, as well as the stress and the energy required for the process were analyzed. Our observations indicate little influence of the constitutive equations of the investigated formulations on the final thickness distribution of the thermoformed part; moreover, the time and energy required for the process showed no clear variation with the fiber load. POLYM. ENG. SCI. 56:1021–1030, 2016. © 2016 Society of Plastics Engineers     

A quadratic edge-finding filtering algorithm for cumulative resource constraints

The cumulative scheduling constraint, which enforces the sharing of a finite resource by several tasks, is widely used in constraint-based scheduling applications. Propagation of the cumulative constraint can be performed by several different filtering algorithms, often used in combination. One of the most important and successful of these filtering algorithms is edge-finding. Recent work by Vilím has resulted in a ?? (kn log n) algorithm for cumulative edge-finding (where n is the number of tasks and k is the number of distinct capacity requirements), as well as a new related filter, timetable edge-finding, with a complexity of ??(n ²). We present a sound ??(n ²) filtering algorithm for standard cumulative edge-finding, orthogonal to the work of Vilím; we also show how this algorithm’s filtering may be improved by incorporating some reasoning from extended edge-finding, with no increase in complexity. The complexity of the new algorithm does not strictly dominate previous edge-finders for small k, and it sometimes requires more iterations to reach the same fixpoint; nevertheless, results from Project Scheduling Problem Library benchmarks show that in practice this algorithm consistently outperforms earlier edge-finding filters, and remains competitive with timetable edge-finding, despite the latter algorithm’s generally stronger filtering.