A Genetic Algorithm for Overall Designing and Planning of a Long Term Evolution Advanced Network

In the mobile radio industry, planning is a fundamental step for the deployment and commissioning of a Telecom network. The proposed models are based on the technology and the focussed architecture. In this context, we introduce a comprehensive single-lens model for a fourth generation mobile network, Long Term Evolution Advanced Network (4G/LTE-A) technology which includes three sub assignments: cells in the core network. In the resolution, we propose an adaptation of the Genetic Evolutionary Algorithm for a global resolution. This is a combinatorial optimization problem that is considered as difficult. The use of this adaptive method does not necessarily lead to optimal solutions with the aim of reducing the convergence time towards a feasible solution.

THE MAXIMUM AND MINIMUM DEGREES OF RANDOM BIPARTITE MULTIGRAPHS

In this paper the authors generalize the classic random bipartite graph model, and define a model of the random bipartite multigraphs as follows：let m = m（n） be a positive integer-valued function on n and ζ（n,m;{pk}） the probability space consisting of all the labeled bipartite multigraphs with two vertex sets A ={a_1,a_2,...,a_n} and B = {b_1,b_2,...,b_m}, in which the numbers t_（ai）,b_j of the edges between any two vertices a_i∈A and b_j∈ B are identically distributed independent random variables with distribution P{t_（ai）,b_j=k}=pk,k=0,1,2,...,where pk ≥0 and ∞Σk=0 pk=1. They obtain that X_（c,d,A）, the number of vertices in A with degree between c and d of G_（n,m）∈ζ（n, m;{pk}） has asymptotically Poisson distribution, and answer the following two questions about the space ζ（n,m;{pk}） with {pk} having geometric distribution, binomial distribution and Poisson distribution, respectively. Under which condition for {pk} can there be a function D（n） such that almost every random multigraph G_（n,m）∈ζ（n,m;{pk}） has maximum degree D（n）in A？ under which condition for {pk} has almost every multigraph G（n,m）∈ζ（n,m;{pk}） a unique vertex of maximum degree in A？

An Automatic Optimization Technique for the Calibration of a Physically Based Hydrological Rainfall-Runoff Model

Models are tools widely used in the prediction of hydrological phenomena. The present study aims to contribute to the implementation of an automatic optimization strategy of parameters for the calibration of a hydrological model based on the least action principle (HyMoLAP). The Downhill Simplex method is also known as the Nelder-Mead algorithm, which is a heuristic research method, is used to optimize the cost function on a given domain. The performance of the model is evaluated by the Nash Stucliffe Efficiency Index (NSE), the Root Mean Square Error (RMSE), the coefficient of determination (R2), the Mean Absolute Error (MAE). A comparative estimation is conducted using the Nash-Sutcliffe Modeling Efficiency Index and the mean relative error to evaluate the performance of the optimization method. It appears that the variation in water balance parameter values is acceptable. The simulated optimization method appears to be the best in terms of lower variability of parameter values during successive tests. The quality of the parameter sets obtained is good enough to impact the performance of the objective functions in a minimum number of iterations. We have analyzed the algorithm from a technical point of view, and we have carried out an experimental comparison between specific factors such as the model structure and the parameter’s values. The results obtained confirm the quality of the model (NSE = 0.90 and 0.75 respectively in calibration and validation) and allow us to evaluate the efficiency of the Nelder-Mead algorithm in the automatic calibration of the HyMoLAP model. The developed hybrid automatic calibration approach is therefore one of the promising ways to reduce computational time in rainfall-runoff modeling.

Method of Estimation of Chemical Compounds of a Solution by Analysis of Video Images of Titration from a Semi-Automatic Approach

To titrate or measure a chemical species in a solution is to estimate its quantity of matter or its molar concentration in a given solution. Several methods of estimating molar concentrations of chemical species exist, the main ones being Colorimetric titration, Conductimetric titration, pH metric titration. In practice, all these methods present approximative results because the operator repeats the experiment to ensure the reliability of the results. As a consequence, we have a prolonged time of the experiment which involves a cost in reagents. Given the repetitions of the same experiment, the final result is the average of the results of each experiment. The aim of this paper is to correct this subjectivity by implementing a semi-automatic approach based on colorimetric titration. At the end of the implementation of our approach, we compared our results to those of existing techniques. These results show the reliability of the calculation by the semi-automatic method. This method of estimating the volume at equivalence is fast because it is not manual and does not involve the use of geometric measuring instruments to find the volume at equivalence. This method improves the manual calculation of the volume at equivalence used in the laboratories in school and student environment.

Design,fabrication,characterization and reliability study of CMOS-MEMS Lorentz-force magnetometers

This article presents several design techniques to fabricate micro-electro-mechanical systems(MEMS)using standard complementary metal-oxide semiconductor(CMOS)processes.They were applied to fabricate high yield CMOS-MEMS shielded Lorentz-force magnetometers(LFM).The multilayered metals and oxides of the back-end-of-line(BEOL),normally used for electronic routing,comprise the structural part of the MEMS.The most important fabrication challenges,modeling approaches and design solutions are discussed.Equations that predict the Q factor,sensitivity,Brownian noise and resonant frequency as a function of temperature,gas pressure and design parameters are presented and validated in characterization tests.A number of the fabricated magnetometers were packaged into Quad Flat No-leads(QFN)packages.We show this process can achieve yields above 95%when the proper design techniques are adopted.Despite CMOS not being a process for MEMS manufacturing,estimated performance(sensitivity and noise level)is similar or superior to current commercial magnetometers and others built with MEMS processes.Additionally,typical offsets present in Lorentz-force magnetometers were prevented with a shielding electrode,whose efficiency is quantified.Finally,several reliability test results are presented,which demonstrate the robustness against high temperatures,magnetic fields and acceleration shocks.

THE MEANING OF FROZEN TOKENS IN LIVE NETS

A concurrent system can be modeled by a Petri net. A live Petri net may have fro-zen tokens. It is showed that such tokens can be deleted if they are superfluous, and, whilethey are useful, can be defrozen if they became frozen due to unfair occurrences of tran-sitions, and, finaloy, some frozen tokens lead to more processes.

The Maximum and Minimum Degree of the Random r-uniform r-partite Hypergraphs

In this paper we consider the random r-uniform r-partite hypergraph model H（n1, n2,…, nr; n, p） which consists of all the r-uniform r-partite hypergraphs with vertex partition {V1,V2,…, Vr} where ｜Vi｜ = ni = ni（n） （1 ≤ i ≤ r） are positive integer-valued functions on n with n1 ＋n2 ＋… ＋nr =n, and each r-subset containing exactly one element in Vi （1 ≤ i ≤ r） is chosen to be a hyperedge of Hp ∈H（n1,n2,…,nr;n,p） with probability p = p（n）, all choices being independent. Let △V1 = △V1 （H） and δv1 = δv1（H） be the maximum and minimum degree of vertices in V1 of H, respectively; Xd,V1 = Xd,V1 （H）, Yd,V1 = Yd,V1 （H）, Zd,V1 = Zd,V1 （H） and Zc,d,V1=Zc,d,V1 （H） be the number of vertices in V1 of H with degree d, at least d, at most d, and between c and d, respectively. In this paper we obtain that in the space H（n1, n2,…, nr; n,p）, Xd,V1, Yd,V1, Zd,V1, and Zc,d,V1all have asymptotically Poisson distributions. We also answer the following two questions. What is the range of p that there exists a function D（n） such that in the space H（n1, n2,…,nr; n, p）, lim n→＋∞ P（△v1 = D（n）） = 1？ What is the range of p such that a.e., Hp ∈ H（n1,n2,...,nr;n,p） has a unique vertex in V1 with degree Av1（Hp）？ Both answers are p = o（logn1/N）, where N = r ∏ i=2 ni. The corresponding problems on δv1（Hp） also are considered, and we obtained the answers are p ≤ （1＋o（1））（logn1/N） andp=o （log n1/N）, respectively.

The Degree Distribution of the Random Multigraphs

In this paper, as a generalization of the binomial random graph model, we define the model of multigraphs as follows： let G（n; {pk}） be the probability space of all the labelled loopless multigraphs with vertex set V = {v1, v2, ..., vn }, in which the distribution of tvi,vj, the number of the edges between any two vertices vi and vj is P{tvi,vj =k}=Pk, k=0, 1,2,...and they are independent of each other. Denote by Xd = Xd（G）,Yd = Yd（G）, Zd = Zd（G） and Zcd = Zcd（G） the number of vertices of G with degree d, at least d, at most d and between c and d. In this paper, we discuss the distribution of Xd, Yd, Zd and Zcd in the probability space G（n; （Pk））.

FAIR Computational Workflows

Computational workflows describe the complex multi-step methods that are used for data collection,data preparation,analytics,predictive modelling,and simulation that lead to new data products.They can inherently contribute to the FAIR data principles:by processing data according to established metadata;by creating metadata themselves during the processing of data;and by tracking and recording data provenance.These properties aid data quality assessment and contribute to secondary data usage.Moreover,workflows are digital objects in their own right.This paper argues that FAIR principles for workflows need to address their specific nature in terms of their composition of executable software steps,their provenance,and their development.

Linear Arboricity of Regular Digraphs

A linear directed forest is a directed graph in which every component is a directed path.The linear arboricity la(D) of a digraph D is the minimum number of linear directed forests in D whose union covers all arcs of D. For every d-regular digraph D, Nakayama and P′eroche conjecture that la(D) = d + 1. In this paper, we consider the linear arboricity for complete symmetric digraphs,regular digraphs with high directed girth and random regular digraphs and we improve some wellknown results. Moreover, we propose a more precise conjecture about the linear arboricity for regular digraphs.

Distributing pairs of vertices on Hamiltonian cycles

Let G be a graph of order n with minimum degree δ(G)≥n/2+1. Faudree and Li(2012) conjectured that for any pair of vertices x and y in G and any integer 2≤k≤n/2, there exists a Hamiltonian cycle C such that the distance between x and y on C is k. In this paper, we prove that this conjecture is true for graphs of sufficiently large order. The main tools of our proof are the regularity lemma of Szemer′edi and the blow-up lemma of Koml′os et al.(1997).