Design and implementation of the Node Identity Internetworking Architecture

The Internet Protocol (IP) has been proven very flexible, being able to accommodate all kinds of link technologies and supporting a broad range of applications. The basic principles of the original Internet architecture include end-to-end addressing, global routeability and a single namespace of IP addresses that unintentionally serves both as locators and host identifiers. The commercial success and widespread use of the Internet have lead to new requirements, which include Internetworking over business boundaries, mobility and multi-homing in an untrusted environment. Our approach to satisfy these new requirements is to introduce a new Internetworking layer, the node identity layer. Such a layer runs on top of the different versions of IP, but could also run directly on top of other kinds of network technologies, such as MPLS and 2G/3G PDP contexts. This approach enables connectivity across different communication technologies, supports mobility, multi-homing, and security from ground up. This paper describes the Node Identity Architecture in detail and discusses the experiences from implementing and running a prototype.     

Selective determination of urea using urease immobilized on ZnO nanowires

Well-aligned zinc oxide (ZnO) nanowire arrays were fabricated on gold-coated plastic substrates using a low-temperature aqueous chemical growth (ACG) method. The ZnO nanowire arrays with 50–130 nm diameters and ∼1 μm in lengths were used in an enzyme-based urea sensor through immobilization of the enzyme urease that was found to be sensitive to urea concentrations from 0.1 mM to 100 mM. Two linear sensitivity regions were observed when the electrochemical responses (EMF) of the sensors were plotted vs. the logarithmic concentration range of urea from 0.1 mM to 100 mM. The proposed sensor showed a sensitivity of 52.8 mV/decade for 0.1–40 mM urea and a fast response time less than 4 s was achieved with good selectivity, reproducibility and negligible response to common interferents such as ascorbic acid and uric acid, glucose, K⁺ and Na⁺ ions.     

Modelling of interstitials in the bcc phase

There are several widespread thermodynamic datasets which produce a spurious bcc interstitial solution at high temperature and high X content (X is an interstitally dissolved element). The reason for this is the standard model for bcc interstitial solutions (M(V a,X)₃), which requires careful selection of optimising parameters to minimise spurious appearances of the bcc phase. In this work the model M(V a,X)₁ is suggested as an alternative. This model is much easier to handle and its parameters can be directly compared with those of the fcc phase. The two models are compared for the Fe–C and Nb–N systems. In the Fe–C system almost identical results are achieved. In Nb–N there are some differences for high N content, but there is no experimental data to clearly support any model.     

Active learning for extended finite state machines

We present a black-box active learning algorithm for inferring extended finite state machines (EFSM)s by dynamic black-box analysis. EFSMs can be used to model both data flow and control behavior of software and hardware components. Different dialects of EFSMs are widely used in tools for model-based software development, verification, and testing. Our algorithm infers a class of EFSMs called register automata. Register automata have a finite control structure, extended with variables (registers), assignments, and guards. Our algorithm is parameterized on a particular theory, i.e., a set of operations and tests on the data domain that can be used in guards.Key to our learning technique is a novel learning model based on so-called tree queries. The learning algorithm uses tree queries to infer symbolic data constraints on parameters, e.g., sequence numbers, time stamps, identifiers, or even simple arithmetic. We describe sufficient conditions for the properties that the symbolic constraints provided by a tree query in general must have to be usable in our learning model. We also show that, under these conditions, our framework induces a generalization of the classical Nerode equivalence and canonical automata construction to the symbolic setting. We have evaluated our algorithm in a black-box scenario, where tree queries are realized through (black-box) testing. Our case studies include connection establishment in TCP and a priority queue from the Java Class Library.     

Outflow Boundary Conditions for the Fourier Transformed One-Dimensional Vlasov–Poisson System

In order to facilitate numerical simulations of plasma phenomena where kinetic processes are important, we have studied the technique of Fourier transforming the Vlasov equation analytically in the velocity space, and solving the resulting equation numerically. Special attention has been paid to the boundary conditions of the Fourier transformed system. By using outgoing wave boundary conditions in the Fourier transformed space, small-scale information in velocity space is carried outside the computational domain and is lost. Thereby the so-called recurrence phenomenon is reduced. This method is an alternative to using numerical dissipation or smoothing operators in velocity space. Different high-order methods are used for computing derivatives as well as for the time-stepping, leading to an over-all fourth-order method.     

Competitive exploration of rectilinear polygons

Exploring a polygon with robots when the robots do not have knowledge of the surroundings can be viewed as an online problem. Typical for online problems is that decisions must be made based on past events without complete information about the future. In our case the robots do not have complete information about the environment. Competitive analysis can be used to measure the performance of methods solving online problems. The competitive ratio of such a method is the ratio between the method's performance and the performance of the best method having full knowledge of the future. We prove constant competitive strategies and lower bounds for exploring a simple rectilinear polygon in the _L1$L_1$ metric.     

Key principles for user-centred systems design

The concept of user-centred systems design (UCSD) has no agreed upon definition. Consequently, there is a great variety in the ways it is applied, which may lead to poor quality and poor usability in the resulting systems, as well as misconceptions about the effectiveness of UCSD. The purpose of this paper is to propose a definition of UCSD. We have identified 12 key principles for the adoption of a user-centred development process, principles that are based on existing theory, as well as research in and experiences from a large number of software development projects. The initial set of principles were applied and evaluated in a case study and modified accordingly. These principles can be used to communicate the nature of UCSD, evaluate a development process or develop systems development processes that support a user-centred approach. We also suggest activity lists and some tools for applying UCSD.     

Parallelization of a multi-blocked CFD code via three strategies for fluid flow and heat transfer analysis

This paper reports on a parallel implementation of a general 3D multi-block CFD code. The parallelization is achieved by using three strategies. Firstly, it is done on dual-processor PC-clusters where Windows NT systems are running. A multi-thread programming model is adopted for the multi-block code, where one thread corresponds to a block. Shared-memory is used for the exchange of inner-boundaries between neighboring blocks (threads) on the same node, while WinSockets are employed for those on different nodes. Secondly, the parallelization is extended to UNIX operating system. MPI is applied for all the message passing between different processors, including those on the same node. Thirdly, Pthreads (POSIX threads), a standardized application interface for threads, are adopted to take the advantage of the shared-memory feature of the SMP nodes, while MPI is only applied for the message passing between processors on different nodes. In all the strategies, a static load-balancing method is employed for equitable distribution of computational work to specified nodes. The parameters of the present code is studied in detail to facilitate the explanation of the speedup results. Two examples are provided to show the speedup and load balancing of the parallel calculation. Detailed comparison is made to evaluate the efficiency of different strategies.     

Cluster randomized trials with treatment noncompliance.

Cluster randomized trials (CRTs) have been widely used in field experiments treating a cluster of individuals as the unit of randomization. This study focused particularly on situations where CRTs are accompanied by a common complication, namely, treatment noncompliance or, more generally, intervention nonadherence. In CRTs, compliance may be related not only to individual characteristics but also to the environment of clusters individuals belong to. Therefore, analyses ignoring the connection between compliance and clustering may not provide valid results. Although randomized field experiments often suffer from both noncompliance and clustering of the data, these features have been studied as separate rather than concurrent problems. On the basis of Monte Carlo simulations, this study demonstrated how clustering and noncompliance may affect statistical inferences and how these two complications can be accounted for simultaneously. In particular, the effect of the intervention on individuals who not only were assigned to active intervention but also abided by this intervention assignment (complier average causal effect) was the focus. For estimation of intervention effects considering noncompliance and data clustering, an ML-EM estimation method was employed. (PsycINFO Database Record (c) 2010 APA, all rights reserved)