High-speed data word monitor

Small, portable, self-contained device provides high-speed display of bit pattern or any selected portion of transmission, can suppress filler patterns so that display is not updated, and can freeze display so that specific event may be observed in detail

Selective data segment monitoring system

High speed data monitoring apparatus is described for displaying the bit pattern of a selected portion of a block of transmitted data comprising a shift register for receiving the transmitted data and for temporarily containing the consecutive data bits. A programmable sync detector for monitoring the contents of the shift register and for generating a sync signal when the shift register contains a predetermined sync code is included. A counter is described for counting the data bits input to the shift register after the sync signal is generated and for generating a count complete signal when a selected number of data bits have been input to the register. A data storage device is used for storing the contents of the shift register at the time the count complete signal is generated

Small gain theorems for large scale systems and construction of ISS Lyapunov functions

We consider interconnections of n nonlinear subsystems in the input-to-state stability (ISS) framework. For each subsystem an ISS Lyapunov function is given that treats the other subsystems as independent inputs. A gain matrix is used to encode the mutual dependencies of the systems in the network. Under a small gain assumption on the monotone operator induced by the gain matrix, a locally Lipschitz continuous ISS Lyapunov function is obtained constructively for the entire network by appropriately scaling the individual Lyapunov functions for the subsystems. The results are obtained in a general formulation of ISS, the cases of summation, maximization and separation with respect to external gains are obtained as corollaries.Comment: provisionally accepted by SIAM Journal on Control and Optimizatio

Sprunggelenkarthrodese nach gescheiterter Endoprothesenimplantation

Zusammenfassung: Trotz anatomischer und biomechanischer Verbesserungen bleibt die Langzeitprognose oberer Sprunggelenkendoprothesen hinsichtlich der Überlebensrate problematisch. Bei fehlgeschlagener oberer Sprunggelenkendoprothesenimplantation stellt die Konversion in eine obere Sprunggelenkarthrodese eine zuverlässige Behandlungsmethode dar. Trotzdem ist die Durchführung aufgrund der Knochendefekte, des prekären Weichteilzustands und auch Erhaltung der Beinlänge technisch anspruchsvoll und aufwendig. Es besteht das Potenzial zu erheblichen Einschränkungen der Lebensqualität als auch Gesamtfunktion des Fuß- und Sprunggelenks. Der vorliegende Artikel behandelt das Thema der Arthrodese nach gescheiterter oberer Sprunggelenkendoprothesenimplantation und schlägt Algorithmen für die Therapie vo

Comment to "Observation of the neutron radiative decay" by R.U. Khafizov et al., published in JETP Letters 83 (2006) 5 (Pis'ma v ZhETF 83 (2006) 7)

The commented manuscript was submitted for publication without informing at least four of the other authors, viz. N. Severijns, O. Zimmer, H.-F. Wirth and D. Rich. This violates our rights as collaborators. The analysis presented and the manuscript itself have not been discussed and have also not been approved by the entire collaboration prior to submission. Besides this formal incorrectness, we also criticise the content of the paper

Local Guarantees in Graph Cuts and Clustering

Correlation Clustering is an elegant model that captures fundamental graph cut problems such as Min $s-t$ Cut, Multiway Cut, and Multicut, extensively studied in combinatorial optimization. Here, we are given a graph with edges labeled $+$ or $-$ and the goal is to produce a clustering that agrees with the labels as much as possible: $+$ edges within clusters and $-$ edges across clusters. The classical approach towards Correlation Clustering (and other graph cut problems) is to optimize a global objective. We depart from this and study local objectives: minimizing the maximum number of disagreements for edges incident on a single node, and the analogous max min agreements objective. This naturally gives rise to a family of basic min-max graph cut problems. A prototypical representative is Min Max $s-t$ Cut: find an $s-t$ cut minimizing the largest number of cut edges incident on any node. We present the following results: $(1)$ an $O(\sqrt{n})$-approximation for the problem of minimizing the maximum total weight of disagreement edges incident on any node (thus providing the first known approximation for the above family of min-max graph cut problems), $(2)$ a remarkably simple $7$-approximation for minimizing local disagreements in complete graphs (improving upon the previous best known approximation of $48$), and $(3)$ a $1/(2+\varepsilon)$-approximation for maximizing the minimum total weight of agreement edges incident on any node, hence improving upon the $1/(4+\varepsilon)$-approximation that follows from the study of approximate pure Nash equilibria in cut and party affiliation games

Finding Galaxy Groups In Photometric Redshift Space: the Probability Friends-of-Friends (pFoF) Algorithm

We present a structure finding algorithm designed to identify galaxy groups in photometric redshift data sets: the probability friends-of-friends (pFoF) algorithm. This algorithm is derived by combining the friends-of-friends algorithm in the transverse direction and the photometric redshift probability densities in the radial dimension. The innovative characteristic of our group-finding algorithm is the improvement of redshift estimation via the constraints given by the transversely connected galaxies in a group, based on the assumption that all galaxies in a group have the same redshift. Tests using the Virgo Consortium Millennium Simulation mock catalogs allow us to show that the recovery rate of the pFoF algorithm is larger than 80% for mock groups of at least 2\times10^{13}M_{\sun}, while the false detection rate is about 10% for pFoF groups containing at least $\sim8$ net members. Applying the algorithm to the CNOC2 group catalogs gives results which are consistent with the mock catalog tests. From all these results, we conclude that our group-finding algorithm offers an effective yet simple way to identify galaxy groups in photometric redshift catalogs.Comment: AJ accepte

Observation of Landau quantization and standing waves in HfSiS

Recently, HfSiS was found to be a new type of Dirac semimetal with a line of Dirac nodes in the band structure. Meanwhile, Rashba-split surface states are also pronounced in this compound. Here we report a systematic study of HfSiS by scanning tunneling microscopy/spectroscopy at low temperature and high magnetic field. The Rashba-split surface states are characterized by measuring Landau quantization and standing waves, which reveal a quasi-linear dispersive band structure. First-principles calculations based on density-functional theory are conducted and compared with the experimental results. Based on these investigations, the properties of the Rashba-split surface states and their interplay with defects and collective modes are discussed.Comment: 6 pages, 5 figure