This paper describes a framework and tools for automating the production of designs that can be partially recon gured at run time. The approach involves several stages, including: (i) a partial evaluation stage, which produces con guration les for a given design, where the number of con gurations are minimised during the compile-time sequencing stage; (ii) an incremental con guration calculatio...

In this paper we present a self con gurable multiplication technique allowing vari able con guration time for a class of LUT based Field Programmable Gate Arrays FPGAs which exist today We show this technique to be implementable on FPGA architectures allowing internally addressable RAM primitives to be directly mapped to the Logic Elements LEs of the logic resource This provides run time read w...

Network con guration information is useful in producing a visual map of the network complete in all details. The visual map is an essential component for network management and operations. It is also possible to generate an inventory report of a network. The inventory report describes the nodes, networks, interfaces, addresses, protocols, speeds, etc. and is a valuable component for network pla...

This report describes an approach enabling automatic structural recon gurations of distributed applications based on con guration management in order to compensate for node and network failures. The major goal of the approach is to maintain the relevant application functionality after failures automatically. This goal is achieved by a dedicated system model and by a decentralized recon guration...

In this paper we present a hardware design technique which utilises runtime recon guration for a particular class of applications. For a multiplication circuit implemented within an FPGA, a speci c instance of multiplying by a constant provides a signi cant reduction of required logic when compared to the generic case when multiplying any two arbitrary values. The use of recon guration allows t...

In this paper, we consider an optimal (i.e., minimum scheduling length) time slot assignment (for short, TSA) problem in variable bandwidth switching systems. In previous studies, the interdependencies between two consecutive switching con"gurations were neglected. However, it is highly probable that the amount of change between the switching con"gurations will be small. Therefore, it is unnece...

syntax A con guration is a labeled graph, where vertices represent system nodes andedges represent di erent kinds of connection between nodes. Each node has a symbolic identi er.For example, Figure 4.6 shows three nodes having identi ers x, y and z. This means that any scenarioreferring to C3 must involve lifelines for nodes x, y and z. In order to allow for a richer represen-ta...

The asymptotics of Rydberg states, i.e., highly excited bound states of the hydrogen atom Hamiltonian, and various expectations involving these states are investigated. We show that suitable linear combinations of these states, appropriately rescaled and regarded as functions either in momentum space or con guration space, are highly concentrated on classical momentum space or con guration spac...

A con guration is weakly ag transitive if its group of automor phisms acts intransitively on ags but the group of all automorphisms and anti automorphisms acts transitively on ags It is shown that weakly ag transitive con gurations are in one to one correspondence with bipartite  arc transitive graphs of girth not less than Sev eral in nite families of weakly ag transitive con gurations are gi...

Using SAR scattering center locations and magnitudes as features, invariances with articulation (i.e., turret rotation for the ZSU 23/4 gun and T72 tank), with con guration variants (e.g. fuel barrels, searchlights, etc.) and with a depression angle change are shown for real SAR images obtained from the MSTAR public data. This location and magnitude quasi-invariance forms a basis for an innovat...