2,744 research outputs found
Realistic, Extensible DNS and mDNS Models for INET/OMNeT++
The domain name system (DNS) is one of the core services in today's network
structures. In local and ad-hoc networks DNS is often enhanced or replaced by
mDNS. As of yet, no simulation models for DNS and mDNS have been developed for
INET/OMNeT++. We introduce DNS and mDNS simulation models for OMNeT++, which
allow researchers to easily prototype and evaluate extensions for these
protocols. In addition, we present models for our own experimental extensions,
namely Stateless DNS and Privacy-Enhanced mDNS, that are based on the
aforementioned models. Using our models we were able to further improve the
efficiency of our protocol extensions.Comment: Published in: A. F\"orster, C. Minkenberg, G. R. Herrera, M. Kirsche
(Eds.), Proc. of the 2nd OMNeT++ Community Summit, IBM Research - Zurich,
Switzerland, September 3-4, 201
Lost in Abstraction: Monotonicity in Multi-Threaded Programs (Extended Technical Report)
Monotonicity in concurrent systems stipulates that, in any global state,
extant system actions remain executable when new processes are added to the
state. This concept is not only natural and common in multi-threaded software,
but also useful: if every thread's memory is finite, monotonicity often
guarantees the decidability of safety property verification even when the
number of running threads is unknown. In this paper, we show that the act of
obtaining finite-data thread abstractions for model checking can be at odds
with monotonicity: Predicate-abstracting certain widely used monotone software
results in non-monotone multi-threaded Boolean programs - the monotonicity is
lost in the abstraction. As a result, well-established sound and complete
safety checking algorithms become inapplicable; in fact, safety checking turns
out to be undecidable for the obtained class of unbounded-thread Boolean
programs. We demonstrate how the abstract programs can be modified into
monotone ones, without affecting safety properties of the non-monotone
abstraction. This significantly improves earlier approaches of enforcing
monotonicity via overapproximations
Time series segmentation by Cusum, AutoSLEX and AutoPARM methods
Time series segmentation has many applications in several disciplines as neurology, cardiology, speech, geology and others. Many time series in this fields do not behave as stationary and the usual transformations to linearity cannot be used. This paper describes and evaluates different methods for segmenting non-stationary time series. We propose a modification of the algorithm in Lee et al. (2003) which is designed to searching for a unique change in the parameters of a time series, in order to find more than one change using an iterative procedure. We evaluate the performance of three approaches for segmenting time series: AutoSLEX (Ombao et al., 2002), AutoPARM (Davis et al., 2006) and the iterative cusum method mentioned above and referred as ICM. The evaluation of each methodology consists of two steps. First, we compute how many times each procedure fails in segmenting stationary processes properly. Second, we analyze the effect of different change patterns by counting how many times the corresponding methodology correctly segments a piecewise stationary process. ICM method has a better performance than AutoSLEX for piecewise stationary processes. AutoPARM presents a very satisfactory behaviour. The performance of the three methods is illustrated with time series datasets of neurology and speechTime series segmentation, AutoSLEX, AutoPARM, Cusum Methods
The fractional chromatic number of triangle-free subcubic graphs
Heckman and Thomas conjectured that the fractional chromatic number of any
triangle-free subcubic graph is at most 14/5. Improving on estimates of Hatami
and Zhu and of Lu and Peng, we prove that the fractional chromatic number of
any triangle-free subcubic graph is at most 32/11 (which is roughly 2.909)
Reforged in fire: The Central Building of Iowa State
Iowa State University began as a small land grant institution that offered a narrow education in the agricultural and technical fields. The College Building, commonly referred to as Old Main, housed students and provided several classrooms for Iowa State. The structure was the focal point of the campus, and the building symbolized the college’s original narrow educational goals and purposes. After the state government amended Iowa’s educational code in 1884, the institution gradually began to broaden its curriculum and introduced new courses which triggered a backlash from farmers’ organizations. This opposition halted Iowa State’s expanding educational goals, but by the turn of the century the institution slowly returned to broadening and diversifying its curriculum outside the agricultural and technical fields. Aside from new coursework and heightened enrollment, the institution also experienced two fires in the early 1900s which destroyed Old Main. From the ashes of Old Main arose the Central Building, which the college built as a replacement. The institution experienced unprecedented growth in enrollment and curriculum, and Iowa State’s new Central Building symbolized sweeping changes. Reforged in fire explores how the Central Building helped display, facilitate, and make permanent Iowa State’s broadening educational goals and embodied the institution’s evolving purpose
Modeling and Simulation of Compositional Engineering in Sige Films Using Patterned Stress Fields
Semiconductor alloys such as silicon-germanium (SiGe) offer attractive environments for engineering quantum-confined structures that are the basis for a host of current and future optoelectronic devices. Although vertical stacking of such structures is routinely achieved via heteroepitaxy, lateral manipulation has proven much more challenging. I describe a new approach that suggests that a patterned elastic stress field generated with an array of nanoscale indenters in an initially compositionally uniform SiGe substrate will drive atomic interdiffusion, leading to compositional patterns in the near-surface region of the substrate. While this approach may offer a potentially efficient and robust pathway to producing laterally ordered arrays of quantum-confined structures, there is a large set of parameters important to the process. Thus, it is difficult to consider this approach using only costly experiments, which necessitates detailed computational analysis.
First, I review computational approaches to simulating the long length and time scales required for this process, and I develop and present a mesoscopic model based on coarse-grained lattice kinetic Monte Carlo that quantitatively describes the atomic interdiffusion processes in SiGe alloy film subjected to applied stress. I show that the model provides predictions that are quantitatively consistent with experimental measurements, and I examine the impact of basic indenter geometries on the patterning process. Second, I extend the model to investigate the impact of several process parameters, such as more complicated indenter shapes and pitches. I find that certain indenter configurations produce compositional patterns that are favorable for use as lateral arrays of quantum-confined structures. Finally, I measure a set of important physical parameters, the so-called “activation volumes” that describes the impact of stress on diffusion. The values of these parameters are not well established in the literature. I make quantitative connections to the range of values found in the literature and characterize the effects of different stress states on the overall patterning process. Finally, I conclude with ideas about alternative pathways to quantum confined structure generation and possible extensions of the framework developed
An Algebraic-Coding Equivalence to the Maximum Distance Separable Conjecture
We formulate an Algebraic-Coding Equivalence to the Maximum Distance
Separable Conjecture. Specifically, we present novel proofs of the following
equivalent statements. Let be a fixed pair of integers satisfying
is a prime power and . We denote by the vector
space of functions from a finite field to itself, which can be
represented as the space of
polynomial functions. We denote by the
set of polynomials that are either the zero polynomial, or have at most
distinct roots in . Given two subspaces of ,
we denote by their span. We prove that the following are
equivalent.
[A] Suppose that either: 1. is odd 2. is even and .
Then there do not exist distinct subspaces and of
such that:
3. 4. . 5. 6. 7.
.
[B] Suppose is odd, or, if is even, . There is
no integer with such that the Reed-Solomon code
over of dimension can have columns
added to it, such that:
8. Any submatrix of containing
the first columns of is independent. 9. is independent.
[C] The MDS conjecture is true for the given .Comment: This is version: 5.6.18. arXiv admin note: substantial text overlap
with arXiv:1611.0235
Short Cycle Covers of Cubic Graphs and Graphs with Minimum Degree Three
The Shortest Cycle Cover Conjecture of Alon and Tarsi asserts that the edges
of every bridgeless graph with edges can be covered by cycles of total
length at most . We show that every cubic bridgeless graph has a
cycle cover of total length at most and every bridgeless
graph with minimum degree three has a cycle cover of total length at most
- …