1,106 research outputs found
Significant Scales in Community Structure
Many complex networks show signs of modular structure, uncovered by community
detection. Although many methods succeed in revealing various partitions, it
remains difficult to detect at what scale some partition is significant. This
problem shows foremost in multi-resolution methods. We here introduce an
efficient method for scanning for resolutions in one such method. Additionally,
we introduce the notion of "significance" of a partition, based on subgraph
probabilities. Significance is independent of the exact method used, so could
also be applied in other methods, and can be interpreted as the gain in
encoding a graph by making use of a partition. Using significance, we can
determine "good" resolution parameters, which we demonstrate on benchmark
networks. Moreover, optimizing significance itself also shows excellent
performance. We demonstrate our method on voting data from the European
Parliament. Our analysis suggests the European Parliament has become
increasingly ideologically divided and that nationality plays no role.Comment: To appear in Scientific Report
The temporal perspective of epistemics in Dutch
A series of experiments is conducted on naĂŻve native speakers of Dutch and English to study the scope relation between tense and epistemic modality. The results are consistent with the claim that epistemics scope over tense (Stowell 2004, Hacquard 2006, a.o.), and challenge recent research that states that epistemics can, or must, scope under tense (von Fintel and Gillies 2007, Rullmann & Matthewson 2018): Dutch and English participants in a Truth Value Judgment Task judge sentences to be false when the past tense forms of the modals have to and moeten 'have to' are used to make an epistemic claim that held at a time before speech time, and true when they are used to make an epistemic claim that holds at speech time. Moreover, English participants in an Acceptability Judgment Task judge sentences to be infelicitous when the same past tense form of have to is used to make an epistemic claim that held at a time before speech time. Besides these general patterns, the results show variation within and across the two languages, which leads to interesting new questions about the interaction between tense and (epistemic) modality
Narrow scope for resolution-limit-free community detection
Detecting communities in large networks has drawn much attention over the
years. While modularity remains one of the more popular methods of community
detection, the so-called resolution limit remains a significant drawback. To
overcome this issue, it was recently suggested that instead of comparing the
network to a random null model, as is done in modularity, it should be compared
to a constant factor. However, it is unclear what is meant exactly by
"resolution-limit-free", that is, not suffering from the resolution limit.
Furthermore, the question remains what other methods could be classified as
resolution-limit-free. In this paper we suggest a rigorous definition and
derive some basic properties of resolution-limit-free methods. More
importantly, we are able to prove exactly which class of community detection
methods are resolution-limit-free. Furthermore, we analyze which methods are
not resolution-limit-free, suggesting there is only a limited scope for
resolution-limit-free community detection methods. Finally, we provide such a
natural formulation, and show it performs superbly
Simulating the effect of forces pit ventilation on ammonia emission from naturally ventilated cow houses with CFD
Atmospheric NH3, mainly originates from agricultural sources, can cause serious environmental problems related to eutrophication and soil acidification. Emissions from dairy houses are 15% of total agricultural NH3 emissions. Due to open buildings, existing abatement options are limited. Pit air separation was identified as a potentially efficacious option. In this study a model simulation of a commercial dairy cow building with slatted floor is presented. The model was solved for 12 cases, differing wind speed, direction and both air and manure temperature. For each case three solutions were obtained, which correspond a) to a building where a forced pit ventilation system is applied at capacity of 250 and 500 m-3 h-1 cow-1 and b) to a building without forced pit ventilation system. The results show that due to forced pit ventilation system, at 250 and 500 m-3 h-1 cow-1, the ventilation rate was increased 3.1% and 6.2% respectively. The contribution of the pit ventilation system to the total ammonia released from the pit during winter, ranged from 31-35%, 16-19% and 11-8%, for wind speed of 1.0, 4.0 and 8.0 m s-1 respectively. Correspondingly, during summer, the contribution of the system ranged from 44-48%, 20-21% and 12-9%. Although obvious benefits arise from a forced pit ventilation system, the main mass flow of ammonia from the pit still emitted through the building ventilation openings, especially at high wind speeds
A matrix pencil approach to the existence of compactly supported reconstruction functions in average sampling
The aim of this work is to solve a question raised for average sampling in shift-invariant spaces by using the well-known matrix pencil theory. In many common situations in sampling theory, the available data are samples of some convolution operator acting on the function itself: this leads to the problem of average sampling, also known as generalized sampling. In this paper we deal with the existence of a sampling formula involving these samples and having reconstruction functions with compact support. Thus, low computational complexity is involved and truncation errors are avoided. In practice, it is accomplished by means of a FIR filter bank. An answer is given in the light of the generalized sampling theory by using the oversampling technique: more samples than strictly necessary are used. The original problem reduces to finding a polynomial left inverse of a polynomial matrix intimately related to the sampling problem which, for a suitable choice of the sampling period, becomes a matrix pencil. This matrix pencil approach allows us to obtain a practical method for computing the compactly supported reconstruction functions for the important case where the oversampling rate is minimum. Moreover, the optimality of the obtained solution is established
Innovatieve en goedkope daken voor melkveestallen
Om de kostprijs van melk laag te houden is er behoefte aan bovenbouwconcepten die goedkoop zijn of die opbrengsten genereren. In het project âDuurzame dakenâ zoekt Wageningen UR Livestock Research naar innovatieve en kostprijsefficiĂ«nte bovenbouwconcepten voor melkveestalle
Computation of Zeros of Linear Multivariable Systems
Several algorithms have been proposed in the literature for the computation of the zeros of a linear system described by a state-space model {A, B, C, D}. In this paper we discuss the numerical properties of a new algorithm and compare it with some earlier techniques of computing zeros. The method is a modified version of Silverman's structure algorithm and is shown to be backward stable in a rigorous sense. The approach is shown to handle both nonsquare and/or degenerate systems. Several numerical examples are also provided
Learning what must and can must and can mean
This corpus study investigates how children figure out that functional modals like must can express various flavors of modality. We examine how modality is expressed in speech to and by children, and find that the way speakers use modals may obscure their polysemy. Yet, children eventually figure it out. Our results suggest that some do before age 3. We show that while root and epistemic flavors are not equally well-represented in the input, there are robust correlations between flavor and aspect, which learners could exploit to discover modal polysemy
A regularization algorithm for matrices of bilinear and sesquilinear forms
We give an algorithm that uses only unitary transformations and for each
square complex matrix constructs a *congruent matrix that is a direct sum of a
nonsingular matrix and singular Jordan blocks.Comment: 18 page
- âŠ