A Representation of Binary Matrices

Христина Костадинова, Красимир Йорджев - В статията се обсъжда представянето на произволна бинарна матрица с помощта на последователност от цели неотрицателни числа. Разгледани са някои предимства и недостатъци на това представяне като алтернатива на стандартното, общоприето представяне чрез двумерен масив. Показано е, че представянето на бинарните матрици с помощта на наредени n-торки от естествени числа води до по-бързи алгоритми и до съществена икономия на оперативна памет. Използуван е апарата на обектно-ориентираното програмиране със синтаксиса и семантиката на езика C++.

Fast pseudorandom generator based on packed matrices

Pseudorandom generators are a basic foundation of many cryptographic services and information security protocols. We propose a modification of a previously published matricial pseudorandom generator that significantly improves performance and security. The resulting generator is successfully compared to world class standards.

An optimized pseudorandom generator using packed matrices

Most cryptographic services and information security protocols require a dependable source of random data; pseudorandom generators are convenient and efficient for this application working as one of the basic foundation blocks on which to build the required security infrastructure. We propose a modification of a previously published matricial pseudorandom generator that significantly improves performance and security by using word packed matrices and modifying key scheduling and bit extraction schemes. The resulting generator is then successfully compared to world class standards.

Climate, soil and tree flora relationships in forests in the state of São Paulo, southeastern Brasil

ABSTRACT - (Climate, soil and tree flora relationships in forests in the state of São Paulo, southteastern Brasil). With the aim of verifying possible influences of abiotic features on the spatial distribution of forest tree species and families, thirteen surveys in the state of São Paulo were selected, representing different conditions (localization at the extreme coordenates and altitudes, succesional stages, surveying methods). By applying Jaccard's Index to the binary matrices of 806 synonymized specific binomina and 79 families (Cronquist's system) phenograms were constructed using the method of the unweighted pair grouping by mathematical average (UPGMA). The species formed two floristic blocks: hygrophyllous (yearly rainfall greater than 2000 mm without dry season) and mesophyllous (yearly rainfall about 1400 mm with variable dry season). The latter was divided in two other groups: the high-altitudinal (median altitudes higher than 750 m, frost average frequency greater than 3 days/year) and low-altitudinal. Both mesophyllous floristic blocks were subdivided according to soil conditions (texture, eutrophism, acid or allic dystrophism, iron content). At the family level the relations were weak, but also showed the soil nutritional status as a possible constraint to the spatial partition of families.

The discrete Pascal transform and its applications

We introduce a new discrete polynomial transform constructed from the rows of Pascal’s triangle. The forward and inverse transforms are computed the same way in both the oneand two-dimensional cases, and the transform matrix can be factored into binary matrices for efficient hardware implementation. We conclude by discussing applications of the transform in

Mathematical Modeling of the Weaving Structure Design

Красимир Йорджев, Христина Костадинова - В работата се разглежда една релация на еквивалентност в множеството от всички квадратни бинарни матрици. Обсъдена е комбинаторната задача за намиране мощността и елементите на фактормножеството относно тази релация. Разгледана е и възможността за получаване на някои специални елементи на това фактормножество. Предложен е алгоритъм за решаване на поставените задачи. Получените в статията резултати намират приложение при описанието топологията на различните тъкачни структури.

Representing Equivalence Problems for Combinatorial Objects

Methods for representing equivalence problems of various combinatorial objects as graphs or binary matrices are considered. Such representations can be used for isomorphism testing in classification or generation algorithms. Often it is easier to consider a graph or a binary matrix isomorphism problem than to implement heavy algorithms depending especially on particular combinatorial objects. Moreover, there already exist well tested algorithms for the graph isomorphism problem (nauty) and the binary matrix isomorphism problem as well (Q-Extension). ACM Computing Classification System (1998): F.2.1, G.4.

Stability of curcumin microencapsulated by spray and freeze drying in binary and ternary matrices of maltodextrin, gum arabic and modified starch

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

On infinite graphs and related matrices

This thesis Entitled On Infinite graphs and related matrices.ln the last two decades (iraph theory has captured wide attraction as a Mathematical model for any system involving a binary relation. The theory is intimately related to many other branches of Mathematics including Matrix Theory Group theory. Probability. Topology and Combinatorics . and has applications in many other disciplines..Any sort of study on infinite graphs naturally involves an attempt to extend the well known results on the much familiar finite graphs. A graph is completely determined by either its adjacencies or its incidences. A matrix can convey this information completely. This makes a proper labelling of the vertices. edges and any other elements considered, an inevitable process. Many types of labelling of finite graphs as Cordial labelling, Egyptian labelling, Arithmetic labeling and Magical labelling are available in the literature. The number of matrices associated with a finite graph are too many For a study ofthis type to be exhaustive. A large number of theorems have been established by various authors for finite matrices. The extension of these results to infinite matrices associated with infinite graphs is neither obvious nor always possible due to convergence problems. In this thesis our attempt is to obtain theorems of a similar nature on infinite graphs and infinite matrices. We consider the three most commonly used matrices or operators, namely, the adjacency matrix

Ionic liquids and other liquid matrices for sensitive MALDI MS analysis

Although liquid matrix-assisted laser desorption/ionization (MALDI) has been used in mass spectrometry (MS) since the early introduction of MALDI, its substantial lack of sensitivity compared to solid (crystalline) MALDI was for a long time a major hurdle to its analytical competitiveness. In the last decade, this situation has changed with the development of new sensitive liquid matrices, which are often based on a binary matrix acid/base system. Some of these matrices were inspired by the recent progress in ionic liquid research, while others were developed from revisiting previous liquid MALDI work as well as from a combination of these two approaches. As a result, two high-performing liquid matrix classes have been developed, the ionic liquid matrices (ILMs) and the liquid support matrices (LSMs), now allowing MS measurements at a sensitivity level that is very close to the level of solid MALDI and in some cases even surpasses it. This chapter provides some basic information on a selection of highly successful representatives of these new liquid matrices and describes in detail how they are made and applied in MALDI MS analysis.

Comparison of different clean-up procedures for the determination of N-methylcarbamate insecticides in vegetable matrices by high-performance liquid chromatography with UV detection

Several clean-up procedures which included the use of glass chromatography columns (silica gel, alumina, Florisil, silanized Celite-charcoal), Sep-Pak cartridges and standard solutions were compared for the determination of the following N-methylcarbamate (NMC) insecticides: aldicarb, carbaryl, carbofuran, methomyl and propoxur. According to recovery results of the compounds after elution in a glass column, the most efficient systems employed 4.6% deactivated alumina and a silanized Celite-charcoal (4:1) as adsorbents, using dichloromethane-methanol (99:1) and toluene-acetonitrile (75:25) mixtures, respectively, as binary eluents. The recoveries of the compounds studied varied from 84 to 120%. Comparable recoveries (75-100%) for Sep-Pak cartridges in normal phase (NH2, CN) and reversed phase (C-8) were observed. Different temperatures were tested during the concentration step in a rotary evaporator, and we verified a strong influence of this parameter on the stability of some compounds, such as carbofuran and carbaryl. Recovery studies employing the best clean up procedures were performed at the Brazilian agricultural level in potato and carrot samples; Validation methodology of the US Food and Drug Administration was adapted for the N-methylcarbamate analysis. Their recoveries ranged between 79 and 93% with coefficients of variation of 2.3-8%. (C) 1998 Elsevier B.V. B.V.

Microencapsulation of turmeric oleoresin in binary and ternary blends of gum arabic, maltodextrin and modified starch

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Calculation of GFSR pseudorandom number binary starting matrix,

Mode of access: Internet.

Differential Balanced Trees and (0,1) Matrices

* The research was supported by INTAS 00-397 and 00-626 Projects.

The Basic Reproduction Number Obtained From Jacobian And Next Generation Matrices - A Case Study Of Dengue Transmission Modelling.

The basic reproduction number is a key parameter in mathematical modelling of transmissible diseases. From the stability analysis of the disease free equilibrium, by applying Routh-Hurwitz criteria, a threshold is obtained, which is called the basic reproduction number. However, the application of spectral radius theory on the next generation matrix provides a different expression for the basic reproduction number, that is, the square root of the previously found formula. If the spectral radius of the next generation matrix is defined as the geometric mean of partial reproduction numbers, however the product of these partial numbers is the basic reproduction number, then both methods provide the same expression. In order to show this statement, dengue transmission modelling incorporating or not the transovarian transmission is considered as a case study. Also tuberculosis transmission and sexually transmitted infection modellings are taken as further examples.