Zrození autobiografického subjektu. Máchův intimní deník a moderní básnické deníky ve vztahu k romantické ideji subjektivismu

My text is an attempt to apply Charles Taylor’s theory, dealing with the origins of the modern self, to Czech autobiographical literature originating in Romanticism. Taking a cue from Jean Starobinski and Philippe Lejeune’s concepts of modern autobiography, I analyse Karel Hynek Mácha’s personal diary from 1835 and try to find and emphasize its narrative and compositional aspects, which anticipate the poetics of modern poetic diaries.

W poszukiwaniu czasowników nieznanych lingwist(k)om

Abstract. The paper presents a list of 437 verbs which have not been recorded in lexicography. As the source of reference, the author consulted a spelling dictionary of the Polish language, Wielki słownik ortograficzny PWN, 2nd edition, 2006. The concept of this paper originated from the wish to satisfy the curiosity after reading Indeks neologizmów [Index of Neologisms] prepared by Krystyna Waszakowa in her work Przejawy internacjonalizacji w słowotwórstwie współczesnej polszczyzny [Word-formative internationalisation processes in modern Polish]. The index contains a list of nouns. Given that K. Waszakowa did not take verbs into account (there are far (?) fewer neo-verbs than neo-nouns), the author decided to find out whether it is true that the number of verb neologisms is so small that their philological analysis is pointless from the point of view of research, vocabulary registration, etc. If nouns, such as podczłowiek, miniokupacja, redefinicja, are of interest, why not record the prefixal constructions of the do-, z-, od-, na-, w-, wy-, za-, od-, nad- etc. -robić type? The analysis included randomly selected texts from the „Rzeczpospolita” daily (without any thorough preparation with respect to the content; the texts available were sequentially analysed until the satisfactory result was obtained). The texts under review included an incomplete (it is virtually impossible to determine completeness in this case) electronic archive from the years 1993–2006.

Struktura fizyczna gruntu, zawartość substancji organicznej oraz skład chemiczny gleb w podłożach 21 stanowisk zieleni miejskiej na terenie Poznania. Część III. Zawartość makroelementów: N, P, K, S, Ca i Mg

This article is a continuation of a four-piece work describing the condition of soil in what has been broadly defined as central Poznań. This article presents the content of active forms of six chemical elements which tend to be absorbed by plants in biggest quantities. Relations between these chemical elements are discussed and indications are made of how to counteract the negative effects of deficits as well as overdoses of specific chemical elements in the substrate.

At sea and in port, or, Life and experience of William S. Fletcher : for thirty years seaman's missionary in Portland, Oregon / compiled from his journal and other authentic sources by H.K. Hines ; with an introduction by Earl Cranston.

http://www.archive.org/details/atseandinportorl00hineiala

African missionary heroes and heroines / by H.K.W. Kumm.

http://www.archive.org/details/africanmissionar00kummuoft

Overlay Network Creation and Maintenance with Selfish Users

Overlay networks have been used for adding and enhancing functionality to the end-users without requiring modifications in the Internet core mechanisms. Overlay networks have been used for a variety of popular applications including routing, file sharing, content distribution, and server deployment. Previous work has focused on devising practical neighbor selection heuristics under the assumption that users conform to a specific wiring protocol. This is not a valid assumption in highly decentralized systems like overlay networks. Overlay users may act selfishly and deviate from the default wiring protocols by utilizing knowledge they have about the network when selecting neighbors to improve the performance they receive from the overlay. This thesis goes against the conventional thinking that overlay users conform to a specific protocol. The contributions of this thesis are threefold. It provides a systematic evaluation of the design space of selfish neighbor selection strategies in real overlays, evaluates the performance of overlay networks that consist of users that select their neighbors selfishly, and examines the implications of selfish neighbor and server selection to overlay protocol design and service provisioning respectively. This thesis develops a game-theoretic framework that provides a unified approach to modeling Selfish Neighbor Selection (SNS) wiring procedures on behalf of selfish users. The model is general, and takes into consideration costs reflecting network latency and user preference profiles, the inherent directionality in overlay maintenance protocols, and connectivity constraints imposed on the system designer. Within this framework the notion of user’s "best response" wiring strategy is formalized as a k-median problem on asymmetric distance and is used to obtain overlay structures in which no node can re-wire to improve the performance it receives from the overlay. Evaluation results presented in this thesis indicate that selfish users can reap substantial performance benefits when connecting to overlay networks composed of non-selfish users. In addition, in overlays that are dominated by selfish users, the resulting stable wirings are optimized to such great extent that even non-selfish newcomers can extract near-optimal performance through naïve wiring strategies. To capitalize on the performance advantages of optimal neighbor selection strategies and the emergent global wirings that result, this thesis presents EGOIST: an SNS-inspired overlay network creation and maintenance routing system. Through an extensive measurement study on the deployed prototype, results presented in this thesis show that EGOIST’s neighbor selection primitives outperform existing heuristics on a variety of performance metrics, including delay, available bandwidth, and node utilization. Moreover, these results demonstrate that EGOIST is competitive with an optimal but unscalable full-mesh approach, remains highly effective under significant churn, is robust to cheating, and incurs minimal overheads. This thesis also studies selfish neighbor selection strategies for swarming applications. The main focus is on n-way broadcast applications where each of n overlay user wants to push its own distinct file to all other destinations as well as download their respective data files. Results presented in this thesis demonstrate that the performance of our swarming protocol for n-way broadcast on top of overlays of selfish users is far superior than the performance on top of existing overlays. In the context of service provisioning, this thesis examines the use of distributed approaches that enable a provider to determine the number and location of servers for optimal delivery of content or services to its selfish end-users. To leverage recent advances in virtualization technologies, this thesis develops and evaluates a distributed protocol to migrate servers based on end-users demand and only on local topological knowledge. Results under a range of network topologies and workloads suggest that the performance of the distributed deployment is comparable to that of the optimal but unscalable centralized deployment.

Comparison of K-ary N-cube and de Bruijn Overlays in QoS-Constrained Multicast Applications

Research on the construction of logical overlay networks has gained significance in recent times. This is partly due to work on peer-to-peer (P2P) systems for locating and retrieving distributed data objects, and also scalable content distribution using end-system multicast techniques. However, there are emerging applications that require the real-time transport of data from various sources to potentially many thousands of subscribers, each having their own quality-of-service (QoS) constraints. This paper primarily focuses on the properties of two popular topologies found in interconnection networks, namely k-ary n-cubes and de Bruijn graphs. The regular structure of these graph topologies makes them easier to analyze and determine possible routes for real-time data than complete or irregular graphs. We show how these overlay topologies compare in their ability to deliver data according to the QoS constraints of many subscribers, each receiving data from specific publishing hosts. Comparisons are drawn on the ability of each topology to route data in the presence of dynamic system effects, due to end-hosts joining and departing the system. Finally, experimental results show the service guarantees and physical link stress resulting from efficient multicast trees constructed over both kinds of overlay networks.

Neural Control of Interlimb Coordination and Gait Timing in Bipeds and Quadrupeds

1) A large body of behavioral data conceming animal and human gaits and gait transitions is simulated as emergent properties of a central pattern generator (CPG) model. The CPG model incorporates neurons obeying Hodgkin-Huxley type dynamics that interact via an on-center off-surround anatomy whose excitatory signals operate on a faster time scale than their inhibitory signals. A descending cornmand or arousal signal called a GO signal activates the gaits and controL their transitions. The GO signal and the CPG model are compared with neural data from globus pallidus and spinal cord, among other brain structures. 2) Data from human bimanual finger coordination tasks are simulated in which anti-phase oscillations at low frequencies spontaneously switch to in-phase oscillations at high frequencies, in-phase oscillations can be performed both at low and high frequencies, phase fluctuations occur at the anti-phase in-phase transition, and a "seagull effect" of larger errors occurs at intermediate phases. When driven by environmental patterns with intermediate phase relationships, the model's output exhibits a tendency to slip toward purely in-phase and anti-phase relationships as observed in humans subjects. 3) Quadruped vertebrate gaits, including the amble, the walk, all three pairwise gaits (trot, pace, and gallop) and the pronk are simulated. Rapid gait transitions are simulated in the order--walk, trot, pace, and gallop--that occurs in the cat, along with the observed increase in oscillation frequency. 4) Precise control of quadruped gait switching is achieved in the model by using GO-dependent modulation of the model's inhibitory interactions. This generates a different functional connectivity in a single CPG at different arousal levels. Such task-specific modulation of functional connectivity in neural pattern generators has been experimentally reported in invertebrates. Phase-dependent modulation of reflex gain has been observed in cats. A role for state-dependent modulation is herein predicted to occur in vertebrates for precise control of phase transitions from one gait to another. 5) The primary human gaits (the walk and the run) and elephant gaits (the amble and the walk) are sirnulated. Although these two gaits are qualitatively different, they both have the same limb order and may exhibit oscillation frequencies that overlap. The CPG model simulates the walk and the run by generating oscillations which exhibit the same phase relationships. but qualitatively different waveform shapes, at different GO signal levels. The fraction of each cycle that activity is above threshold quantitatively distinguishes the two gaits, much as the duty cycles of the feet are longer in the walk than in the run. 6) A key model properly concerns the ability of a single model CPG, that obeys a fixed set of opponent processing equations to generate both in-phase and anti-phase oscillations at different arousal levels. Phase transitions from either in-phase to anti-phase oscillations, or from anti-phase to in-phase oscillations, can occur in different parameter ranges, as the GO signal increases.

Evaluation of Speaker Normalization Methods for Vowel Recognition Using Fuzzy ARTMAP and K-NN

A procedure that uses fuzzy ARTMAP and K-Nearest Neighbor (K-NN) categorizers to evaluate intrinsic and extrinsic speaker normalization methods is described. Each classifier is trained on preprocessed, or normalized, vowel tokens from about 30% of the speakers of the Peterson-Barney database, then tested on data from the remaining speakers. Intrinsic normalization methods included one nonscaled, four psychophysical scales (bark, bark with end-correction, mel, ERB), and three log scales, each tested on four different combinations of the fundamental (Fo) and the formants (F1 , F2, F3). For each scale and frequency combination, four extrinsic speaker adaptation schemes were tested: centroid subtraction across all frequencies (CS), centroid subtraction for each frequency (CSi), linear scale (LS), and linear transformation (LT). A total of 32 intrinsic and 128 extrinsic methods were thus compared. Fuzzy ARTMAP and K-NN showed similar trends, with K-NN performing somewhat better and fuzzy ARTMAP requiring about 1/10 as much memory. The optimal intrinsic normalization method was bark scale, or bark with end-correction, using the differences between all frequencies (Diff All). The order of performance for the extrinsic methods was LT, CSi, LS, and CS, with fuzzy AHTMAP performing best using bark scale with Diff All; and K-NN choosing psychophysical measures for all except CSi.

Planning the deployment of fault-tolerant wireless sensor networks

Since Wireless Sensor Networks (WSNs) are subject to failures, fault-tolerance becomes an important requirement for many WSN applications. Fault-tolerance can be enabled in different areas of WSN design and operation, including the Medium Access Control (MAC) layer and the initial topology design. To be robust to failures, a MAC protocol must be able to adapt to traffic fluctuations and topology dynamics. We design ER-MAC that can switch from energy-efficient operation in normal monitoring to reliable and fast delivery for emergency monitoring, and vice versa. It also can prioritise high priority packets and guarantee fair packet deliveries from all sensor nodes. Topology design supports fault-tolerance by ensuring that there are alternative acceptable routes to data sinks when failures occur. We provide solutions for four topology planning problems: Additional Relay Placement (ARP), Additional Backup Placement (ABP), Multiple Sink Placement (MSP), and Multiple Sink and Relay Placement (MSRP). Our solutions use a local search technique based on Greedy Randomized Adaptive Search Procedures (GRASP). GRASP-ARP deploys relays for (k,l)-sink-connectivity, where each sensor node must have k vertex-disjoint paths of length ≤ l. To count how many disjoint paths a node has, we propose Counting-Paths. GRASP-ABP deploys fewer relays than GRASP-ARP by focusing only on the most important nodes – those whose failure has the worst effect. To identify such nodes, we define Length-constrained Connectivity and Rerouting Centrality (l-CRC). Greedy-MSP and GRASP-MSP place minimal cost sinks to ensure that each sensor node in the network is double-covered, i.e. has two length-bounded paths to two sinks. Greedy-MSRP and GRASP-MSRP deploy sinks and relays with minimal cost to make the network double-covered and non-critical, i.e. all sensor nodes must have length-bounded alternative paths to sinks when an arbitrary sensor node fails. We then evaluate the fault-tolerance of each topology in data gathering simulations using ER-MAC.

Repairing wireless sensor network connectivity in damaged environments

A wireless sensor network can become partitioned due to node failure, requiring the deployment of additional relay nodes in order to restore network connectivity. This introduces an optimisation problem involving a tradeoff between the number of additional nodes that are required and the costs of moving through the sensor field for the purpose of node placement. This tradeoff is application-dependent, influenced for example by the relative urgency of network restoration. In addition, minimising the number of relay nodes might lead to long routing paths to the sink, which may cause problems of data latency. This data latency is extremely important in wireless sensor network applications such as battlefield surveillance, intrusion detection, disaster rescue, highway traffic coordination, etc. where they must not violate the real-time constraints. Therefore, we also consider the problem of deploying multiple sinks in order to improve the network performance. Previous research has only parts of this problem in isolation, and has not properly considered the problems of moving through a constrained environment or discovering changes to that environment during the repair or network quality after the restoration. In this thesis, we firstly consider a base problem in which we assume the exploration tasks have already been completed, and so our aim is to optimise our use of resources in the static fully observed problem. In the real world, we would not know the radio and physical environments after damage, and this creates a dynamic problem where damage must be discovered. Therefore, we extend to the dynamic problem in which the network repair problem considers both exploration and restoration. We then add a hop-count constraint for network quality in which the desired locations can talk to a sink within a hop count limit after the network is restored. For each new problem of the network repair, we have proposed different solutions (heuristics and/or complete algorithms) which prioritise different objectives. We evaluate our solutions based on simulation, assessing the quality of solutions (node cost, movement cost, computation time, and total restoration time) by varying the problem types and the capability of the agent that makes the repair. We show that the relative importance of the objectives influences the choice of algorithm, and different speeds of movement for the repairing agent have a significant impact on performance, and must be taken into account when selecting the algorithm. In particular, the node-based approaches are the best in the node cost, and the path-based approaches are the best in the mobility cost. For the total restoration time, the node-based approaches are the best with a fast moving agent while the path-based approaches are the best with a slow moving agent. For a medium speed moving agent, the total restoration time of the node-based approaches and that of the path-based approaches are almost balanced.

Astrocytes refine cortical connectivity at dendritic spines.

During cortical synaptic development, thalamic axons must establish synaptic connections despite the presence of the more abundant intracortical projections. How thalamocortical synapses are formed and maintained in this competitive environment is unknown. Here, we show that astrocyte-secreted protein hevin is required for normal thalamocortical synaptic connectivity in the mouse cortex. Absence of hevin results in a profound, long-lasting reduction in thalamocortical synapses accompanied by a transient increase in intracortical excitatory connections. Three-dimensional reconstructions of cortical neurons from serial section electron microscopy (ssEM) revealed that, during early postnatal development, dendritic spines often receive multiple excitatory inputs. Immuno-EM and confocal analyses revealed that majority of the spines with multiple excitatory contacts (SMECs) receive simultaneous thalamic and cortical inputs. Proportion of SMECs diminishes as the brain develops, but SMECs remain abundant in Hevin-null mice. These findings reveal that, through secretion of hevin, astrocytes control an important developmental synaptic refinement process at dendritic spines.

Huntingtin is required for normal excitatory synapse development in cortical and striatal circuits.

Huntington's disease (HD) is a neurodegenerative disease caused by the expansion of a poly-glutamine (poly-Q) stretch in the huntingtin (Htt) protein. Gain-of-function effects of mutant Htt have been extensively investigated as the major driver of neurodegeneration in HD. However, loss-of-function effects of poly-Q mutations recently emerged as potential drivers of disease pathophysiology. Early synaptic problems in the excitatory cortical and striatal connections have been reported in HD, but the role of Htt protein in synaptic connectivity was unknown. Therefore, we investigated the role of Htt in synaptic connectivity in vivo by conditionally silencing Htt in the developing mouse cortex. When cortical Htt function was silenced, cortical and striatal excitatory synapses formed and matured at an accelerated pace through postnatal day 21 (P21). This exuberant synaptic connectivity was lost over time in the cortex, resulting in the deterioration of synapses by 5 weeks. Synaptic decline in the cortex was accompanied with layer- and region-specific reactive gliosis without cell loss. To determine whether the disease-causing poly-Q mutation in Htt affects synapse development, we next investigated the synaptic connectivity in a full-length knock-in mouse model of HD, the zQ175 mouse. Similar to the cortical conditional knock-outs, we found excessive excitatory synapse formation and maturation in the cortices of P21 zQ175, which was lost by 5 weeks. Together, our findings reveal that cortical Htt is required for the correct establishment of cortical and striatal excitatory circuits, and this function of Htt is lost when the mutant Htt is present.

Less wiring, more firing: low-performing older adults compensate for impaired white matter with greater neural activity.

The reliable neuroimaging finding that older adults often show greater activity (over-recruitment) than younger adults is typically attributed to compensation. Yet, the neural mechanisms of over-recruitment in older adults (OAs) are largely unknown. Rodent electrophysiology studies have shown that as number of afferent fibers within a circuit decreases with age, the fibers that remain show higher synaptic field potentials (less wiring, more firing). Extrapolating to system-level measures in humans, we proposed and tested the hypothesis that greater activity in OAs compensates for impaired white-matter connectivity. Using a neuropsychological test battery, we measured individual differences in executive functions associated with the prefrontal cortex (PFC) and memory functions associated with the medial temporal lobes (MTLs). Using event-related functional magnetic resonance imaging, we compared activity for successful versus unsuccessful trials during a source memory task. Finally, we measured white-matter integrity using diffusion tensor imaging. The study yielded 3 main findings. First, low-executive OAs showed greater success-related activity in the PFC, whereas low-memory OAs showed greater success-related activity in the MTLs. Second, low-executive OAs displayed white-matter deficits in the PFC, whereas low-memory OAs displayed white-matter deficits in the MTLs. Finally, in both prefrontal and MTL regions, white-matter decline and success-related activations occurred in close proximity and were negatively correlated. This finding supports the less-wiring-more-firing hypothesis, which provides a testable account of compensatory over-recruitment in OAs.

Cross-hemispheric collaboration and segregation associated with task difficulty as revealed by structural and functional connectivity.

Although it is known that brain regions in one hemisphere may interact very closely with their corresponding contralateral regions (collaboration) or operate relatively independent of them (segregation), the specific brain regions (where) and conditions (how) associated with collaboration or segregation are largely unknown. We investigated these issues using a split field-matching task in which participants matched the meaning of words or the visual features of faces presented to the same (unilateral) or to different (bilateral) visual fields. Matching difficulty was manipulated by varying the semantic similarity of words or the visual similarity of faces. We assessed the white matter using the fractional anisotropy (FA) measure provided by diffusion tensor imaging (DTI) and cross-hemispheric communication in terms of fMRI-based connectivity between homotopic pairs of cortical regions. For both perceptual and semantic matching, bilateral trials became faster than unilateral trials as difficulty increased (bilateral processing advantage, BPA). The study yielded three novel findings. First, whereas FA in anterior corpus callosum (genu) correlated with word-matching BPA, FA in posterior corpus callosum (splenium-occipital) correlated with face-matching BPA. Second, as matching difficulty intensified, cross-hemispheric functional connectivity (CFC) increased in domain-general frontopolar cortex (for both word and face matching) but decreased in domain-specific ventral temporal lobe regions (temporal pole for word matching and fusiform gyrus for face matching). Last, a mediation analysis linking DTI and fMRI data showed that CFC mediated the effect of callosal FA on BPA. These findings clarify the mechanisms by which the hemispheres interact to perform complex cognitive tasks.