1,841 research outputs found
Enabling High-Level Application Development for the Internet of Things
Application development in the Internet of Things (IoT) is challenging
because it involves dealing with a wide range of related issues such as lack of
separation of concerns, and lack of high-level of abstractions to address both
the large scale and heterogeneity. Moreover, stakeholders involved in the
application development have to address issues that can be attributed to
different life-cycles phases. when developing applications. First, the
application logic has to be analyzed and then separated into a set of
distributed tasks for an underlying network. Then, the tasks have to be
implemented for the specific hardware. Apart from handling these issues, they
have to deal with other aspects of life-cycle such as changes in application
requirements and deployed devices. Several approaches have been proposed in the
closely related fields of wireless sensor network, ubiquitous and pervasive
computing, and software engineering in general to address the above challenges.
However, existing approaches only cover limited subsets of the above mentioned
challenges when applied to the IoT. This paper proposes an integrated approach
for addressing the above mentioned challenges. The main contributions of this
paper are: (1) a development methodology that separates IoT application
development into different concerns and provides a conceptual framework to
develop an application, (2) a development framework that implements the
development methodology to support actions of stakeholders. The development
framework provides a set of modeling languages to specify each development
concern and abstracts the scale and heterogeneity related complexity. It
integrates code generation, task-mapping, and linking techniques to provide
automation. Code generation supports the application development phase by
producing a programming framework that allows stakeholders to focus on the
application logic, while our mapping and linking techniques together support
the deployment phase by producing device-specific code to result in a
distributed system collaboratively hosted by individual devices. Our evaluation
based on two realistic scenarios shows that the use of our approach improves
the productivity of stakeholders involved in the application development
The Newton tree: geometric interpretation and applications to the motivic zeta function and the log canonical threshold
Let I be an arbitrary ideal in C[[x,y]]. We use the Newton algorithm to
compute by induction the motivic zeta function of the ideal, yielding only few
poles, associated to the faces of the successive Newton polygons. We associate
a minimal Newton tree to I, related to using good coordinates in the Newton
algorithm, and show that it has a conceptual geometric interpretation in terms
of the log canonical model of I. We also compute the log canonical threshold
from a Newton polygon and strengthen Corti's inequalities.Comment: 32 page
Multivariable Hodge theoretical invariants of germs of plane curves
We describe methods for calculation of polytopes of quasiadjunction for plane
curve singularities which are invariants giving a Hodge theoretical refinement
of the zero sets of multivariable Alexander polynomials. In particular we
identify some hyperplanes on which all polynomials in multivariable Bernstein
ideal vanish
Invariants of plane curve singularities and Newton diagrams
We present an intersection-theoretical approach to the invariants of plane
curve singularities , , related by the Milnor formula
. Using Newton transformations we give formulae for ,
, which imply planar versions of well-known theorems on
nondegenerate singularities
- …