Analysis of the EMBRACE aperture array antenna by the characteristic Basis Function Method

This paper describes the use of the Characteristic Basis Function Method for the simulation of large phased array antennas for radio astronomy. It will be shown how the antenna effective area and the receiver noise temperature depend on array size. Also the receiving sensitivity Aeff /T sys normalised with respect to the physical area of the array will be shown for different array sizes and scan angles

Frege on the Generality of Logical Laws

Frege claims that the laws of logic are characterized by their “generality,” but it is hard to see how this could identify a special feature of those laws. I argue that we must understand this talk of generality in normative terms, but that what Frege says provides a normative demarcation of the logical laws only once we connect it with his thinking about truth and science. He means to be identifying the laws of logic as those that appear in every one of the scientific systems whose construction is the ultimate aim of science, and in which all truths have a place. Though an account of logic in terms of scientific systems might seem hopelessly antiquated, I argue that it is not: a basically Fregean account of the nature of logic still looks quite promising

β\beta-Stars or On Extending a Drawing of a Connected Subgraph

We consider the problem of extending the drawing of a subgraph of a given plane graph to a drawing of the entire graph using straight-line and polyline edges. We define the notion of star complexity of a polygon and show that a drawing $\Gamma_H$ of an induced connected subgraph $H$ can be extended with at most $\min\{ h/2, \beta + \log_2(h) + 1\}$ bends per edge, where $\beta$ is the largest star complexity of a face of $\Gamma_H$ and $h$ is the size of the largest face of $H$. This result significantly improves the previously known upper bound of $72|V(H)|$ [5] for the case where $H$ is connected. We also show that our bound is worst case optimal up to a small additive constant. Additionally, we provide an indication of complexity of the problem of testing whether a star-shaped inner face can be extended to a straight-line drawing of the graph; this is in contrast to the fact that the same problem is solvable in linear time for the case of star-shaped outer face [9] and convex inner face [13].Comment: Appears in the Proceedings of the 26th International Symposium on Graph Drawing and Network Visualization (GD 2018

Combinatorial Properties of Triangle-Free Rectangle Arrangements and the Squarability Problem

We consider arrangements of axis-aligned rectangles in the plane. A geometric arrangement specifies the coordinates of all rectangles, while a combinatorial arrangement specifies only the respective intersection type in which each pair of rectangles intersects. First, we investigate combinatorial contact arrangements, i.e., arrangements of interior-disjoint rectangles, with a triangle-free intersection graph. We show that such rectangle arrangements are in bijection with the 4-orientations of an underlying planar multigraph and prove that there is a corresponding geometric rectangle contact arrangement. Moreover, we prove that every triangle-free planar graph is the contact graph of such an arrangement. Secondly, we introduce the question whether a given rectangle arrangement has a combinatorially equivalent square arrangement. In addition to some necessary conditions and counterexamples, we show that rectangle arrangements pierced by a horizontal line are squarable under certain sufficient conditions.Comment: 15 pages, 13 figures, extended version of a paper to appear at the International Symposium on Graph Drawing and Network Visualization (GD) 201

Follicle-Stimulating Hormone Regulates igfbp Gene Expression Directly or via Downstream Effectors to Modulate Igf3 Effects on Zebrafish Spermatogenesis

publishedVersio

Planar Octilinear Drawings with One Bend Per Edge

In octilinear drawings of planar graphs, every edge is drawn as an alternating sequence of horizontal, vertical and diagonal ($45^\circ$) line-segments. In this paper, we study octilinear drawings of low edge complexity, i.e., with few bends per edge. A $k$-planar graph is a planar graph in which each vertex has degree less or equal to $k$. In particular, we prove that every 4-planar graph admits a planar octilinear drawing with at most one bend per edge on an integer grid of size $O(n^2) \times O(n)$. For 5-planar graphs, we prove that one bend per edge still suffices in order to construct planar octilinear drawings, but in super-polynomial area. However, for 6-planar graphs we give a class of graphs whose planar octilinear drawings require at least two bends per edge

Electron and hole transmission through superconductor - normal metal interfaces

We have investigated the transmission of electrons and holes through interfaces between superconducting aluminum (Tc = 1.2 K) and various normal non-magnetic metals (copper, gold, palladium, platinum, and silver) using Andreev-reflection spectroscopy at T = 0.1 K. We analyzed the point contacts with the modified BTK theory that includes Dynes' lifetime as a fitting parameter G in addition to superconducting energy gap 2D and normal reflection described by Z. For contact areas from 1 nm^2 to 10000 nm^2 the BTK Z parameter was 0.5, corresponding to transmission coefficients of about 80 %, independent of the normal metal. The very small variation of Z indicates that the interfaces have a negligible dielectric tunneling barrier. Fermi surface mismatch does not account for the observed transmission coefficient.Comment: 9 pages, 4 figures, submitted to Proceedings of the 19th International Conference on Magnetism ICM2012 (Busan 2012

Structured Early Consultation with the Occupational Physician Reduces Sickness Absence Among Office Workers at High Risk for Long-Term Sickness Absence: a Randomized Controlled Trial

Objective To examine the efficacy of structured early consultation among employees at high risk for future long-term sickness absence, in the prevention and/or reduction of sickness absence. The focus of the experiment was the timing of the intervention, that is, treatment before sickness absence actually occurs. Methods In the current prospective randomized controlled trial (RCT), employees at high risk for long-term sickness absence were selected based on responses to a 34-item screening questionnaire including demographic, workplace, health and psychosocial factors associated with long-term sickness absence (>28 days). A total of 299 subjects at risk for future long-term sickness absence were randomized in an experimental group (n = 147) or in a control group (n = 152). Subjects in the experimental group received a structured early consult with their occupational physician (OP), in some cases followed by targeted intervention. The control group received care as usual. Sickness absence was assessed objectively through record linkage with the company registers on sickness absence over a 1 year follow-up period. Results Modified intention-to-treat analysis revealed substantial and statistically significant differences (p = 0.007) in total sickness absence duration over 1 year follow-up between the experimental (mean 18.98; SD 29.50) and control group (mean 31.13; SD 55.47). Per-protocol analysis additionally showed that the proportion of long-term sickness absence spells (>28 days) over 1 year follow-up was significantly (p = 0.048) lower in the experimental (9.1%) versus control group (18.3%). Conclusions Structured early consultation with the OP among employees at high risk for future long-term sickness absence is successful in reducing total sickness absence

How Reasoning Aims at Truth

Many hold that theoretical reasoning aims at truth. In this paper, I ask what it is for reasoning to be thus aim-directed. Standard answers to this question explain reasoning’s aim-directedness in terms of intentions, dispositions, or rule-following. I argue that, while these views contain important insights, they are not satisfactory. As an alternative, I introduce and defend a novel account: reasoning aims at truth in virtue of being the exercise of a distinctive kind of cognitive power, one that, unlike ordinary dispositions, is capable of fully explaining its own exercises. I argue that this account is able to avoid the difficulties plaguing standard accounts of the relevant sort of mental teleology