Modeling of elastic thin-walled beams, plates and shells as 1D and 2D boundary value problems is valid in undisturbed subdomains. Disturbances near supports and free edges, in the vicinity of concentrated loads and at thickness jumps cannot be described by 1D and 2D BVP’s. In these disturbed subdomains dimensional (d)-adaptivity and possibly model (m)-adaptivity have to be performed and coupled...

Supplementary Figure 1 Precision and signal intensity of live cell imaging, and cxcr4 control experiments Supplementary Figure 2 Tracking the diffusion of individual PBs in live HeLa cells Supplementary Figure 3 Live cell images after incubation for varying amounts of time after microinjection Supplementary Figure 4 Relative deviation (RD) analysis of diffusion coefficients over time Supplement...

Regression trees are tree-based models used to solve those prediction problems in which the response variable is numeric. They differ from the better-known classification or decision trees only in that they have a numeric value rather than a class label associated with the leaves. Model trees are an extension of regression trees in the sense that they associate leaves with multivariate linear m...

The action system formalism 4] is a state-based approach to distributed computing. In this paper, it is shown how the action system formalism may be used to describe systems that communicate with their environment through synchronised value-passing. Deenitions and rules are presented for reening and decomposing such action systems into distributed implementations in which internal communication...

Linear Discriminant Analysis (LDA) is a popular feature extraction technique in statistical pattern recognition. However, it often suffers from the small sample size problem when dealing with the high dimensional data. Moreover, while LDA is guaranteed to find the best directions when each class has a Gaussian density with a common covariance matrix, it can fail if the class densities are more ...

S tepwise refinement remains a popular approach to program-design implementation, primarily because of its flexibility. As originally proposed by Niklaus Wirth, the technique involves successively decomposing design decisions into target code. With each re6nement step, the designer must + note the interdependence of subproblems, + attempt to preserve the design’s functional correctness, and + d...

An algorithm for switchbox routing, called PACKER, is presented. In an initial phase, the connectivity of each net is established in a fast way without taking the other nets into account. In general this will give rise to conflicts (short circuits). In the second stage the conflicts are removed iteratively using Connectivity preserving local transformations (CPLT’s). They “reshape” a net by dis...

Model checking complex systems always suffers from the state explosion problem. Over the last 10 years there has been lots of researches on how to mitigate the state explosion problem. As a result, many techniques have been emerged such as absiraction, compositional reasoning, and exploiting symmetry. In line with these efforts, this paper proposes stepwise model checking which exploits hierarc...