Rétractes Absolus de Voisinage Algébriques

2000 Mathematics Subject Classification: 54C55, 54H25, 55M20.

Mathematical Modeling of the Weaving Structure Design

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

On some Finite-Dimensional Representations of Artin Braid Group

Валентин В. Илиев - Авторът изучава някои хомоморфни образи G на групата на Артин на плитките върху n нишки в крайни симетрични групи. Получените пермутационни групи G са разширения на симетричната група върху n букви чрез подходяща абелева група. Разширенията G зависят от един целочислен параметър q ≥ 1 и се разцепват тогава и само тогава, когато 4 не дели q. В случая на нечетно q са намерени всички крайномерни неприводими представяния на G, а те от своя страна генерират безкрайна редица от неприводими представяния на групата на плитките.

An Algorithmic Approach to Inferring Cross-Ontology Links while Mapping Anatomical Ontologies

ACM Computing Classification System (1998): J.3.

Mapping and Merging of Anatomical Ontologies

This article presents the principal results of the Ph.D. thesis Intelligent systems in bioinformatics: mapping and merging anatomical ontologies by Peter Petrov, successfully defended at the St. Kliment Ohridski University of Sofia, Faculty of Mathematics and Informatics, Department of Information Technologies, on 26 April 2013.

Zolotarev's proof of Gauss reciprocity and Jacobi symbols

2000 Mathematics Subject Classification: Primary 11A15.

Polynomial automorphisms over finite fields: Mimicking tame maps by the Derksen group

2010 Mathematics Subject Classification: 14L99, 14R10, 20B27.

Chain routing:a new routing framework for the Internet based on complete orders

A new framework to perform routing at the autonomous system (AS) level is proposed here. This mechanism, called chain routing framework (CRF), uses complete orders as its main topological unit. Since complete orders are acyclic digraphs that possess a known topology, it is possible to use these acyclic structures to route consistently packets between a group of ASs. The adoption of complete orders also allows easy identification and avoidance of persistent route oscillations, eliminates the possibility of developing transient loops in paths and provides a structure that facilitates the implementation of traffic engineering. Moreover, by combining CRF with other mechanisms that implement complete orders in time, the authors propose that it is possible to design a new routing protocol, which can be more reliable and stable than the border gateway protocol. © 2011 The Institution of Engineering and Technology.

Non-manipulable domains for the Borda count

We characterize the preference domains on which the Borda count satises Arrow's "independence of irrelevant alternatives" condition. Under a weak richness condition, these domains are obtained by xing one preference ordering and including all its cyclic permutations ("Condorcet cycles"). We then ask on which domains the Borda count is non-manipulable. It turns out that it is non-manipulable on a broader class of domains when combined with appropriately chosen tie-breaking rules. On the other hand, we also prove that the rich domains on which the Borda count is non-manipulable for all possible tie-breaking rules are again the cyclic permutation domains.

Nash implementable domains for the Borda count

We characterize the preference domains on which the Borda count satisfies Maskin monotonicity. The basic concept is the notion of a "cyclic permutation domain" which arises by fixing one particular ordering of alternatives and including all its cyclic permutations. The cyclic permutation domains are exactly the maximal domains on which the Borda count is strategy-proof when combined with every possible tie breaking rule. It turns out that the Borda count is monotonic on a larger class of domains. We show that the maximal domains on which the Borda count satisfies Maskin monotonicity are the "cyclically nested permutation domains" which are obtained from the cyclic permutation domains in an appropriately specified recursive way. ------ *We thank József Mala for posing the question of Nash implementability on restricted domains that led to this research. We are very grateful to two anonymous referees and an associate editor for their helpful comments and suggestions. The second author gratefully acknowledges financial support from the Hungarian Academy of Sciences (MTA) through the Bolyai János research fellowship.

Incomplete pairwise comparison matrices and weighting methods

A special class of preferences, given by a directed acyclic graph, is considered. They are represented by incomplete pairwise comparison matrices as only partial information is available: for some pairs no comparison is given in the graph. A weighting method satisfies the property linear order preservation if it always results in a ranking such that an alternative directly preferred to another does not have a lower rank. We study whether two procedures, the Eigenvector Method and the Logarithmic Least Squares Method meet this axiom. Both weighting methods break linear order preservation, moreover, the ranking according to the Eigenvector Method depends on the incomplete pairwise comparison representation chosen.

Occurrence and distribution of novel botryococcene hydrocarbons in freshwater wetlands of the Florida Everglades

A high abundance of isoprenoid hydrocarbons, the botryococcenes, with carbon numbers from 32 to 34 were detected in the Florida Everglades freshwater wetlands. These compounds were present in varying amounts up to 106 μg/gdw in periphyton, 278 μg/gdw in floc, and 46 μg/gdw in soils. Their structures were determined based on comparison to standards, interpretation of their mass spectra and those of their hydrogenation products, and comparison of Kovats indexes to those reported in the literature. A total of 26 cyclic and acyclic botryococcenes with 8 skeletons were identified, including those with fewer degrees of unsaturation, which are proposed as early diagenetic derivatives from the natural products. This is the first report that botryococcenes occur in the Everglades freshwater wetlands. Their potential biogenetic sources from green algae and cyanobacteria were examined, but neither contained botryococcenes. Thus, the source implication of botryococcenes in this ecosystem needs further study.

On Optimizing Compatible Security Policies in Wireless Networks

This paper deals with finding the maximum number of security policies without conflicts. By doing so we can remove security loophole that causes security violation. We present the problem of maximum compatible security policy and its relationship to the problem of maximum acyclic subgraph, which is proved to be NP-hard. Then we present a polynomial-time approximation algorithm and show that our result has approximation ratio for any integer with complexity .

Joint-specific changes in locomotor complexity in the absence of muscle atrophy following incomplete spinal cord injury

ackground Following incomplete spinal cord injury (iSCI), descending drive is impaired, possibly leading to a decrease in the complexity of gait. To test the hypothesis that iSCI impairs gait coordination and decreases locomotor complexity, we collected 3D joint angle kinematics and muscle parameters of rats with a sham or an incomplete spinal cord injury. Methods 12 adult, female, Long-Evans rats, 6 sham and 6 mild-moderate T8 iSCI, were tested 4 weeks following injury. The Basso Beattie Bresnahan locomotor score was used to verify injury severity. Animals had reflective markers placed on the bony prominences of their limb joints and were filmed in 3D while walking on a treadmill. Joint angles and segment motion were analyzed quantitatively, and complexity of joint angle trajectory and overall gait were calculated using permutation entropy and principal component analysis, respectively. Following treadmill testing, the animals were euthanized and hindlimb muscles removed. Excised muscles were tested for mass, density, fiber length, pennation angle, and relaxed sarcomere length. Results Muscle parameters were similar between groups with no evidence of muscle atrophy. The animals showed overextension of the ankle, which was compensated for by a decreased range of motion at the knee. Left-right coordination was altered, leading to left and right knee movements that are entirely out of phase, with one joint moving while the other is stationary. Movement patterns remained symmetric. Permutation entropy measures indicated changes in complexity on a joint specific basis, with the largest changes at the ankle. No significant difference was seen using principal component analysis. Rats were able to achieve stable weight bearing locomotion at reasonable speeds on the treadmill despite these deficiencies. Conclusions Decrease in supraspinal control following iSCI causes a loss of complexity of ankle kinematics. This loss can be entirely due to loss of supraspinal control in the absence of muscle atrophy and may be quantified using permutation entropy. Joint-specific differences in kinematic complexity may be attributed to different sources of motor control. This work indicates the importance of the ankle for rehabilitation interventions following spinal cord injury.