Refinement of neuronal networks in the rodent prefrontal cortex and hippocampus : critical impact of early and late social experiences

Weaning, social environment, dendrites, dendritic spines, limbic system

stochastic method for automated matching of horizons across a fault in 3D seismic data

Seismic analysis, horizon matching, fault tracking, marked point process,stochastic annealing

Community analysis in dynamic social networks

Magdeburg, Univ., Fak. für Informatik, Diss., 2009

Management of XML data by means of schema matching

Magdeburg, Univ., Fak. für Informatik, Diss., 2010

Fault-tolerant radio coverage and connectivity in wireless mesh networks

Magdeburg, Univ., Fak. für Informatik, Diss., 2011

Influence of Jitter on Reliable Multicast Data Transmission Rate in Terms of CDN Networks

This paper devotes to evaluation of performance bottlenecks and algorithm deficiencies in the area of contemporary reliable multicast networking. Hereby, the impact of packet delay jitter on the end-to-end performance of multicast IP data transport is investigated. A series of tests with two most significant open-source implementations of reliable multicast is performed and analyzed. These are: UDP-based File Transfer Protocol (UFTP) and NACK-oriented Reliable multicast (NORM). Tests were targeted to simulate scenario of content distribution in WAN – sized Content Delivery Networks (CDN). Then, results were grouped and averaged, by round trip time and packet losses. This enabled us to see jitter influence independently on round trip time(RTT) and packet loss rates. Revealed jitter influence for different network conditions. Confirmed, that appearance of even small jitter causes significant data rate reduction.

Implicit sequence learning in recurrent neural networks

Magdeburg, Univ., Fak. für Elektrotechnik, Diss., 2013

Mathematical modeling and evolution of signal transduction pathways and networks

Magdeburg, Univ., Fak. für Naturwiss., Diss., 2013

A Model of Video Traffic Transmission in IP Networks

Telecommunications and network technology is now the driving force that ensures continued progress of world civilization. Design of new and expansion of existing network infrastructures requires improving the quality of service(QoS). Modeling probabilistic and time characteristics of telecommunication systems is an integral part of modern algorithms of administration of quality of service. At present, for the assessment of quality parameters except simulation models analytical models in the form of systems and queuing networks are widely used. Because of the limited mathematical tools of models of these classes the corresponding parameter estimation of parameters of quality of service are inadequate by definition. Especially concerning the models of telecommunication systems with packet transmission of multimedia real-time traffic.

Multisite phosphorylation in (bio-)chemical reaction networks : multistationarity and robustness

Magdeburg, Univ., Fak. für Elektro- und Informationstechnik, Diss., 2014

Statistical model identification : dynamical processes and large-scale networks in systems biology

Magdeburg, Univ., Fak. für Verfahrens- und Systemtechnik, Diss., 2014

Statistical model identification : dynamical processes and large-scale networks in systems biology

Magdeburg, Univ., Fak. für Verfahrens- und Systemtechnik, Diss., 2014

The transcriptomic networks controlling the sporulation in Physarum polycephalum

Magdeburg, Univ., Fak. für Naturwiss., Diss., 2015

Dynamic matching and bargaining: the role of deadlines

We consider a dynamic model where traders in each period are matched randomly into pairs who then bargain about the division of a fixed surplus. When agreement is reached the traders leave the market. Traders who do not come to an agreement return next period in which they will be matched again, as long as their deadline has not expired yet. New traders enter exogenously in each period. We assume that traders within a pair know each other's deadline. We define and characterize the stationary equilibrium configurations. Traders with longer deadlines fare better than traders with short deadlines. It is shown that the heterogeneity of deadlines may cause delay. It is then shown that a centralized mechanism that controls the matching protocol, but does not interfere with the bargaining, eliminates all delay. Even though this efficient centralized mechanism is not as good for traders with long deadlines, it is shown that in a model where all traders can choose which mechanism to

Median stable matching for college admission

We give a simple and concise proof that so-called generalized median stable matchings are well-defined stable matchings for college admissions problems. Furthermore, we discuss the fairness properties of median stable matchings and conclude with two illustrative examples of college admissions markets, the lattices of stable matchings, and the corresponding generalized median stable matchings.