Some Applications of Magma in Designs and Codes: Oval Designs,Hermitian Unitals and Generalized Reed–Muller Codes

We describe three applications of Magma to problems in the area of designs and the associated codes:  •  Steiner systems, Hadamard designs and symmetric designs arising from an oval in an even-order plane, leading in the classical case to bent functions and difference-set designs;  •  the Hermitian unital as a 2-(q³ +  1, q +  1, 1) design, and the code overF_p where p divides q +  1;  •  a basis of minimum-weight vectors for the code over F_pof the design of points and hyperplanes of the affine geometry AG_d(F_p), where p is a prime.     

Approximate Solutions of Polynomial Equations

In this paper, we introduce “approximate solutions" to solve the following problem: given a polynomial F(x, y) over Q, where x represents an n -tuple of variables, can we find all the polynomials G(x) such that F(x, G(x)) is identically equal to a constant c in Q ? We have the following: let F(x, y) be a polynomial over Q and the degree of y in F(x, y) be n. Either there is a unique polynomial g(x)  ∈ Q [ x ], with its constant term equal to 0, such that F(x, y)  = ∑_j = 0ⁿc_j(y − g(x))^jfor some rational numbers c_j, hence, F(x, g(x)  + a)  ∈ Q for all a ∈ Q, or there are at most t distinct polynomials g₁(x),⋯ , g_t(x), t ≤ n, such that F(x, g_i(x))  ∈ Q for 1  ≤ i ≤ t. Suppose that F(x, y) is a polynomial of two variables. The polynomial g(x) for the first case, or g₁(x),⋯ , g_t(x) for the second case, are approximate solutions of F(x, y), respectively. There is also a polynomial time algorithm to find all of these approximate solutions. We then use Kronecker’s substitution to solve the case of F(x, y).     

Computing Modular Invariants of p-groups

Let V be a finite dimensional representation of a p -group, G, over a field,k , of characteristic p. We show that there exists a choice of basis and monomial order for which the ring of invariants, k [ V ]^G, has a finite SAGBI basis. We describe two algorithms for constructing a generating set for k [ V ] G. We use these methods to analyse k [2V₃ ]^U₃where U₃is the p -Sylow subgroup ofGL₃ (F_p) and 2 V₃is the sum of two copies of the canonical representation. We give a generating set for k [2 V₃]^U₃forp =  3 and prove that the invariants fail to be Cohen–Macaulay forp >  2. We also give a minimal generating set for k [mV₂ ]^Z / pwere V₂is the two-dimensional indecomposable representation of the cyclic group Z / p.     

Algorithmic Computation of de Rham Cohomology of Complements of Complex Affine Varieties

Let X = Cⁿ. In this paper we present an algorithm that computes the de Rham cohomology groups H_dRⁱ(U,C ) where U is the complement of an arbitrary Zariski-closed set Y in X. Our algorithm is a merger of the algorithm given inOaku and Takayama (1999), who considered the case where Y is a hypersurface, and our methods from Walther (1999) for the computation of local cohomology. We further extend the algorithm to compute de Rham cohomology groups with supports H_{dR, Z}ⁱ(U,C ) where again U is an arbitrary Zariski-open subset of X and Z is an arbitrary Zariski-closed subset of U. Our main tool is a generalization of the restriction process from Oaku and Takayama (in press) to complexes of modules over the Weyl algebra. The restriction rests on an existence theorem onV_d -strict resolutions of complexes that we prove by means of an explicit construction via Cartan–Eilenberg resolutions. All presented algorithms are based on Gröbner basis computations in the Weyl algebra and the examples are carried out using the computer system Kan by Takayama (1999).     

Calibration and validation of hyperspectral indices for the estimation of broadleaved forest leaf chlorophyll content,leaf mass per area,leaf area index and leaf canopy biomass

This article aims at finding efficient hyperspectral indices for the estimation of forest sun leaf chlorophyll content (CHL, µg cm_leaf^? 2), sun leaf mass per area (LMA, g_{dry matter} m_leaf^? 2), canopy leaf area index (LAI, m²_leaf m_soil^? 2) and leaf canopy biomass (B_leaf, g_{dry matter} m_soil^? 2). These parameters are useful inputs for forest ecosystem simulations at landscape scale. The method is based on the determination of the best vegetation indices (index form and wavelengths) using the radiative transfer model PROSAIL (formed by the newly-calibrated leaf reflectance model PROSPECT coupled with the multi-layer version of the canopy radiative transfer model SAIL). The results are tested on experimental measurements at both leaf and canopy scales. At the leaf scale, it is possible to estimate CHL with high precision using a two wavelength vegetation index after a simulation based calibration. At the leaf scale, the LMA is more difficult to estimate with indices. At the canopy scale, efficient indices were determined on a generic simulated database to estimate CHL, LMA, LAI and Bleaf in a general way. These indices were then applied to two Hyperion images (50 plots) on the Fontainebleau and Fougères forests and portable spectroradiometer measurements. They showed good results with an RMSE of 8.2 µg cm^? 2 for CHL, 9.1 g m^? 2 for LMA, 1.7 m² m^? 2 for LAI and 50.6 g m^? 2 for Bleaf. However, at the canopy scale, even if the wavelengths of the calibrated indices were accurately determined with the simulated database, the regressions between the indices and the biophysical characteristics still had to be calibrated on measurements. At the canopy scale, the best indices were: for leaf chlorophyll content: ND_chl = (ρ₉₂₅ ? ρ₇₁₀)/(ρ₉₂₅ + ρ₇₁₀), for leaf mass per area: ND_LMA = (ρ₂₂₆₀ ? ρ₁₄₉₀)/(ρ₂₂₆₀ + ρ₁₄₉₀), for leaf area index: D_LAI = ρ₁₇₂₅ ? ρ₉₇₀, and for canopy leaf biomass: ND_Bleaf = (ρ₂₁₆₀ ? ρ₁₅₄₀)/(ρ₂₁₆₀ + ρ₁₅₄₀).     

Gröbner Bases Applied to Finitely Generated Field Extensions

Using a constructive field-ideal correspondence it is shown how to compute the transcendence degree and a (separating) transcendence basis of finitely generated field extensionsk (x) / k(g), resp. how to determine the (separable) degree if k(x) / k(g) is algebraic. Moreover, this correspondence is used to derive a method for computing minimal polynomials and deciding field membership. Finally, a connection between certain intermediate fields of k(x) / k(g) and a minimal primary decomposition of a suitable ideal is described. For Galois extensions the field-ideal correspondence can also be used to determine the elements of the Galois group.     

Bounds for the Roots of Lacunary Polynomials

A polynomial P(X)  = X^d + a_d − 1X^d − 1 + ⋯ is called lacunary when a_d − 1 =  0. We give bounds for the roots of such polynomials with complex coefficients. These bounds are much smaller than for general polynomials.     

Mason: morphological simplification

The traditional rounding and filleting morphological filters are biased. Hence, as r grows, the rounding R_r (S) of S shrinks and the filleting F_r (S) grows. A shape S is r-regular when R_r (S) = F_r (S) = S. The combinations F_r (R_r (S)) and R_r (F_r (S)) produce nearly r-regular shapes, but retain a bias: F_r (R_r (S)) is usually smaller than S and R_r (F_r (S)) is larger. To overcome this bias, we propose a new filter, called Mason. The r-mortar M_r (S) of S is F_r (S)–R_r (S), and the stability of a point P with respect to S is the smallest value of r for which P belongs to M_r (S). Stability provides important information about the shape’s imbedding that cannot be obtained through traditional topological or differential analysis tools. F_r (R_r (S)) and R_r (F_r (S)) only affect space in M_r (S). For each maximally connected component of M_r (S), Mason performs either F_r (R_r (S)) or R_r (F_r (S)), choosing the combination that alters the smallest portion of that component. Hence, Mason acts symmetrically on the shape and on its complement. Its output is guaranteed to have a smaller symmetric difference with the original shape than that of either combination F_r (R_r (S)) or R_r (F_r (S)). Many previously proposed shape simplification algorithms were focused on reducing the combinatorial storage or processing costs of a shape at the expense of the smoothness and regularity or altered the shape in regular portions that did not exhibit any high frequency complexity. Mason is the first shape simplification operator that is independent of the particular representation and offers the advantage of preserving portions of the boundary of S that are regular at the desired scale.     

Evaluation of response characteristics of resistive oxygen sensors based on porous cerium oxide thick film using pressure modulation method

In order to reduce the response time of resistive oxygen sensors using porous cerium oxide thick film, it is important to ascertain the factors controlling response. Pressure modulation method (PMM) was used to find the rate-limiting step of sensor response. This useful method measures the amplitude of sensor output (H(f)) for the sine wave modulation of oxygen partial pressure at constant frequency (f). In PMM, “break” response time, which is minimum period in which the sensor responds precisely, can be measured. Three points were examined: (1) simulated calculations of PMM were carried out using a model of porous thick film in which spherical particles are connected in a three-dimensional network; (2) sensor response speed was experimentally measured using PMM; and (3) the diffusion coefficient and surface reaction coefficient were estimated by comparison between experiment and calculation. The plot of log f versus log H(f) in the high f region was found to have a slope of approximately −0.5 for both porous thick film and non-porous thin film, when the rate-limiting step was diffusion. Calculations showed the response time of porous thick film was 1/20 that of non-porous thin film when the grain diameter of the porous thick film was the same as the thickness of non-porous thin film. At 973 K, “break” response time (t_b) of the resistive oxygen sensor was found by experiment to be 109 ms. It was concluded that the response of the resistive oxygen sensor prepared in this study was strongly controlled by diffusion at 923–1023 K, since the experiment revealed that the slope of plot of log f versus log H(f) in the high f region was approximately −0.5. At 923–1023 K, the diffusion coefficient of oxygen vacancy in porous ceria (D_V) was expressed as follows: D_V (m²s⁻¹) = 5.78 × 10⁻⁴ exp(−1.94 eV/kT). At 1023 K, the surface reaction coefficient (K) was found to exceed 10⁻⁴ m/s.     

A simple semi-analytical model for remote estimation of chlorophyll-a in turbid waters: Validation

Accurate assessment of phytoplankton chlorophyll-a (chla) concentrations in turbid waters by means of remote sensing is challenging due to the optical complexity of case 2 waters. We have applied a recently developed model of the form [R_rs^? 1(λ₁) ? R_rs^? 1(λ₂)] × R_rs(λ₃) where R_rs(λ_i) is the remote-sensing reflectance at the wavelength λ_i, for the estimation of chla concentrations in turbid waters. The objectives of this paper are (a) to validate the three-band model as well as its special case, the two-band model R_rs^? 1(λ₁) × R_rs(λ₃), using datasets collected over a considerable range of optical properties, trophic status, and geographical locations in turbid lakes, reservoirs, estuaries, and coastal waters, and (b) to evaluate the extent to which the three-band model could be applied to the Medium Resolution Imaging Spectrometer (MERIS) and two-band model could be applied to the Moderate Resolution Imaging Spectroradiometer (MODIS) to estimate chla in turbid waters.The three-band model was calibrated and validated using three MERIS spectral bands (660–670 nm, 703.75–713.75 nm, and 750?757.5 nm), and the 2-band model was tested using two MODIS spectral bands (λ₁ = 662–672, λ₃ = 743–753 nm). We assessed the accuracy of chla prediction in four independent datasets without re-parameterization (adjustment of the coefficients) after initial calibration elsewhere. Although the validation data set contained widely variable chla (1.2 to 236 mg m^? 3), Secchi disk depth (0.18 to 4.1 m), and turbidity (1.3 to 78 NTU), chla predicted by the three-band algorithm was strongly correlated with observed chla (r² > 0.96), with a precision of 32% and average bias across data sets of ? 4.9% to 11%. Chla predicted by the two-band algorithm was also closely correlated with observed chla (r² > 0.92); however, the precision declined to 57%, and average bias across the data sets was 18% to 50.3%. These findings imply that, provided that an atmospheric correction scheme for the red and NIR bands is available, the extensive database of MERIS and MODIS imagery could be used for quantitative monitoring of chla in turbid waters.     

The possibility of using C20 fullerene and graphene as semiconductor segments for detection,and destruction of cyanogen-chloride chemical agent

Detection of hazardous chemical species by changing the electrical conductivity of a semiconductor matter is a proposed and applied way for decreasing their subsequent unpleasant effects. Recently, many examples of using inorganic or organic materials, polymeric, and also nano-sized species as sensors were reported in which, in some cases, those matters were strongly affective and suitable.In this project, we have made an assessment on whether the graphene segment or C₂₀ fullerene, able to sense the existence of cyanogen chloride NCCl? In order to gain trustable results, the possible reaction pathways along with the adsorption kinetics were investigated. Moreover, the electronic density of states DOS showed that C₂₀ fullerene senses the existence of cyanogen chloride agent with a clearer signal (ΔE_g = 0.0110 eV) compared to the graphene segment (ΔE_g = 0.0001 eV). Also the adsorption energy calculations showed that cyanogen chloride could be adsorbed by the fullerene in a multi-step process (E_ads1 = −0.852 kcal mol⁻¹; E_ads2 = −0.446 kcal mol⁻¹; E_ads3 = −2.330 kcal mol⁻¹).     

Fast LLL-type lattice reduction

We modify the concept of LLL-reduction of lattice bases in the sense of Lenstra, Lenstra, Lovász, Factoring polynomials with rational coefficients, Math. Ann. 261 (1982) 515–534 towards a faster reduction algorithm. We organize LLL-reduction in segments of the basis. Our SLLL-bases approximate the successive minima of the lattice in nearly the same way as LLL-bases. For integer lattices of dimension n given by a basis of length 2^O(n), SLLL-reduction runs in O (n^{5 +ε}) bit operations for every ε > 0, compared to O (n^{7 +ε}) for the original LLL and to O (n^{6 +ε}) for the LLL-algorithms of Schnorr, A more efficient algorithm for lattice reduction, Journal of Algorithm, 9 (1988) 47–62 and Storjohann, Faster Algorithms for Integer Lattice Basis Reduction. TR 249, Swiss Federal Institute of Technology, ETH-Zurich, Department of Computer Science, Zurich, Switzerland, July 1996. We present an even faster algorithm for SLLL-reduction via iterated subsegments running in O (n³log n) arithmetic steps. Householder reflections are shown to provide better accuracy than Gram–Schmidt for orthogonalizing LLL-bases in floating point arithmetic.     

Simulation of solid thermal explosion and liquid thermal explosion of dicumyl peroxide using calorimetric technique

Dicumyl peroxide (DCPO), is produced by cumene hydroperoxide (CHP) process, is utilized as an initiator for polymerization, a prevailing source of free radicals, a hardener, and a linking agent. DCPO has caused several thermal explosion and runaway reaction accidents in reaction and storage zone in Taiwan because of its unstable reactive property. Differential scanning calorimetry (DSC) was used to determine thermokinetic parameters including 700 J g^–1 of heat of decomposition (ΔH_d), 110 °C of exothermic onset temperature (T₀), 130 kJ mol^–1 of activation energy (E_a), etc., and to analyze the runaway behavior of DCPO in a reaction and storage zone. To evaluate thermal explosion of DCPO with storage equipment, solid thermal explosion (STE) and liquid thermal explosion (LTE) of thermal safety software (TSS) were applied to simulate storage tank under various environmental temperatures (T_e). T_e exceeding the T₀ of DCPO can be discovered as a liquid thermal explosion situation. DCPO was stored under room temperature without sunshine and was prohibited exceeding 67 °C of self-accelerating decomposition temperature (SADT) for a tank (radius = 1 m and height = 2 m). SADT of DCPO in a box (width, length and height = 1 m, respectively) was determined to be 60 °C. The TSS was employed to simulate the fundamental thermal explosion behavior in a large tank or a drum. Results from curve fitting demonstrated that, even at the earlier stage of the reaction in the experiments, ambient temperature could elicit exothermic reactions of DCPO. To curtail the extent of the risk, relevant hazard information is quite significant and must be provided in the manufacturing process.     

Integrating Factors for Second-order ODEs

A systematic algorithm for building integrating factors of the form μ(x, y), μ(x, y^′) or μ(y, y^′) for second-order ODEs is presented. The algorithm can determine the existence and explicit form of the integrating factors themselves without solving any differential equations, except for a linear ODE in one subcase of the μ (x, y) problem. Examples of ODEs not having point symmetries are shown to be solvable using this algorithm. The scheme was implemented in Maple, in the framework of the ODEtools package and its ODE-solver. A comparison between this implementation and other computer algebra ODE-solvers in tackling non-linear examples from Kamke's book is shown.     

Effect of temperature on humido-sensitive conducting polymer actuators

Temperature dependence of water vapor sorption and electro-active polymer actuating behavior of free-standing films made of poly(3,4-ethylenedioxythiophene) doped with poly(4-styrenesulfonate) (PEDOT/PSS) was investigated by means of sorption isotherm and electromechanical analyses. The non-porous PEDOT/PSS film, having a specific surface area of 0.13 m² g^?1, sorbed water vapor of 1080 cm³(STP) g^?1, corresponding to 87 wt%, at relative water vapor pressure of 0.95. A temperature rise from 25 °C to 40 °C lowered sorption degree, indicative of an exothermic process, where isosteric heat of sorption decreased with increasing water vapor sorption and the value reached 43.9 kJ mol^?1, being consistent with the heat of water condensation (44 kJ mol^?1). Upon application of 10 V, the film underwent contraction of 2.46% at 5 °C caused by desorption of water vapor due to Joule heating, which slightly decreased to 2.10% at 45 °C. The speed of contraction was one order of magnitude faster than that of expansion and less dependent on the temperature since water vapor sorbed in the film were forced to desorb by Joule heating. In contrast, the higher the temperature the faster the film expansion because diffusion coefficient increased as the temperature became higher.     

Tetrel bonds between PySiX3 and some nitrogenated bases: Hybridization,substitution, and cooperativity

Ab initio calculations have been performed to study the influence of hybridization, substitution, and cooperativity on the tetrel bond in the complexes of PySiX₃ (Py = pyridine and X = halogen). The tetrel bond becomes stronger in the order of p-PySiF₃⋯NCH(sp) < p-PySiF₃⋯NHCH₂(sp²) < p-PySiF₃⋯NH₃(sp³). The electron-donating group in the electron donor strengthens the tetrel bond, and this effect is mainly achieved through electrostatic and polarization interactions. Tetrel bonding displays cooperative effects with triel bonding and chalcogen bonding, characterized by shorter binding distances and greater electron densities. The cooperative effects between triel/chalcogen bond and tetrel bond have been analyzed by molecular electrostatic potentials and charge transfer. Energy decomposition indicates that many-body effects are mainly caused by polarization energy. The geometries of Si⋯N interaction and its applications in crystal materials have been characterized and evidenced by a CSD research.     

Broadcast in the rendezvous model

In many large, distributed or mobile networks, broadcast algorithms are used to update information stored at the nodes. In this paper, we propose a new model of communication based on rendezvous and analyze a multi-hop distributed algorithm to broadcast a message in a synchronous setting. In the rendezvous model, two neighbors u and v can communicate if and only if u calls v and v calls u simultaneously. Thus nodes u and v obtain a rendezvous at a meeting point. If m is the number of meeting points, the network can be modeled by a graph of n vertices and m edges. At each round, every vertex chooses a random neighbor and there is a rendezvous if an edge has been chosen by its two extremities. Rendezvous enable an exchange of information between the two entities. We get sharp lower and upper bounds on the time complexity in terms of number of rounds to broadcast: we show that, for any graph, the expected number of rounds is between ln n and O (n²). For these two bounds, we prove that there exist some graphs for which the expected number of rounds is either O (ln (n)) or Ω (n²). For specific topologies, additional bounds are given.