Fault-aware Communication Mapping for NoCs with Guaranteed Latency

As feature sizes shrink, transient failures of on-chip network links become a critical problem. At the same time, many applications require guarantees on both message arrival probability and response time. We address the problem of transient link failures by means of temporally and spatially redundant transmission of messages, such that designer-imposed message arrival probabilities are guaranteed. Response time minimisation is achieved by a heuristic that statically assigns multiple copies of each message to network links, intelligently combining temporal and spatial redundancy. Concerns regarding energy consumption are addressed in two ways. First, we reduce the total amount of transmitted messages, and, second, we minimise the application response time such that the resulted time slack can be exploited for energy savings through voltage reduction. The advantages of the proposed approach are guaranteed message arrival probability and guaranteed worst case application response time.     

Using classification techniques for informal requirements in the requirements analysis-supporting system

In order to efficiently develop large-scale and complicated software, it is important for system engineers to correctly understand users’ requirements. Most requirements in large-scale projects are collected from various stakeholders located in various regions, and they are generally written in natural language. Therefore, the initial collected requirements must be classified into various topics prior to analysis phases in order to be usable as input in several requirements analysis methods. If this classification process is manually done by analysts, it becomes a time-consuming task. To solve this problem, we propose a new bootstrapping method which can automatically classify requirements sentences into each topic category using only topic words as the representative of the analysts’ views. The proposed method is verified through experiments using two requirements data sets: one written in English and the other in Korean. The significant performances were achieved in the experiments: the 84.28 and 87.91 F1 scores for the English and Korean data sets, respectively. As a result, the proposed method can provide an effective function for an Internet-based requirements analysis-supporting system so as to efficiently gather and analyze requirements from various and distributed stakeholders by using the Internet.     

A slotted post-wall waveguide array with interdigital structure for 45/spl deg/ linear and dual polarization

This work proposes a dual-polarized planar antenna; two post-wall slotted waveguide arrays with orthogonal 45/spl deg/ linearly-polarized waves interdigitally share the aperture on a single layer substrate. Uniform excitation of the two-dimensional slot array is confirmed by experiment in the 25 GHz band. The isolation between two slot arrays is also investigated in terms of the relative displacement along the radiation waveguide axis in the interdigital structure. The isolation is 33.0 dB when the relative shift of slot position between the two arrays is -0.5/spl lambda//sub g/, while it is only 12.8 dB when there is no shift. The cross-polarization level in the far field is -25.2 dB for a -0.5/spl lambda//sub g/ shift, which is almost equal to that of the isolated single polarization array. It is degraded down to -9.6 dB when there is no shift.     

Copper-zirconium tungstate composites exhibiting low and negative thermal expansion influenced by reinforcement phase transformations

A fully-dense Cu-75 vol pct ZrW₂O₈ metal matrix composite was fabricated by hot isostatic pressing of Cu-coated ZrW₂O₈ particles. A small amount of the high-pressure γ-ZrW₂O₈ phase was created during the cooldown and depressurization following densification; near complete transformation to γ-ZrW₂O₈ was achieved by subsequent cold isostatic pressing. The thermal expansion behavior of the composite between 25°C and 325°C was altered by the cold isostatic pressing treatment, and also depended on the length of time that had passed between thermal cycles. The measured thermal expansion coefficients within specific temperature ranges varied from −6·10⁻⁶ K⁻¹ to far above the thermal expansion coefficient of the copper matrix. The complex temperature-dependent expansion/contraction behavior could be justified by considering the evolution of phase transformations taking place in the ZrW₂O₈ phase, which were observed by in-situ synchrotron X-ray diffraction measurements.     

Analytical results for the plectonemic response of supercoiled DNA

The DNA molecule is modeled as an elastic rod with bending and twisting rigidities, subjected to external tension and twist applied at one end, the other end being clamped. We study the plectonemic equilibrium of such a rod, taking into account the impenetrability constraint. Numerical solutions of this boundary value problem have previously shown that purely elastic models can reproduce the supercoiling response of the DNA molecule. Using a variational approach, we derive analytical formulae for the elastic response of the filament, and extend former numerical results.     

Application of Support Vector Machines in Assessing Conceptual Cost Estimates

Total conceptual cost estimates and the assessment of the quality of these estimates are critical in the early stages of a building construction project. In this study, the support vector machine (SVM) model for assessing the quality of conceptual cost estimates is proposed, and the application of SVM in construction areas is investigated. The results show that the SVM model assessed the quality of conceptual cost estimates slightly more accurately than the discriminant analysis model. This shows that using the SVM has potential in construction areas. In addition, the SVM model can assist clients in their evaluation of the quality of the estimated cost and the probability of exceeding the target cost, and in their decision on whether or not it is necessary to seek a more accurate estimate in the early stages of a project.     

Algorithms in the W-Hierarchy

We show new upper bounds for problems in the W-hierarchy of fixed-parameter complexity. A crucial ingredient of our proofs is an extension to the W-RAM model, which permits more-powerful operations but remains equivalent to the original. We use the extended model to give new upper bounds for Subsetsum, Maximum Irredundant Set, and various problems concerning intersection of finite-state machines.     

Polynomial-Space Decidable Membership Problems for Recurrent Systems over Sets of Natural Numbers

A finite recurrent system over sets of natural numbers of dimension n is a pair composed of n n-ary functions over sets of natural numbers and an n-tuple of singleton sets of natural numbers. Every function is applied to the entries of the tuple and computes a set of natural numbers, that may also be empty. The results are composed into another tuple, and the process is started anew. Thus, a finite recurrent system defines an infinite sequence of n-tuples containing sets of natural numbers. The last entry of a generated n-tuple is called the output of a step, and the union of the output sets of all steps is the set defined by the finite recurrent system. Membership problems ask whether a given number is in a specified output set or in some output set. We study membership problems for special finite recurrent systems, whose functions are built from the set operations union, intersection and complementation and the arithmetical operations addition and multiplication. Sum and product of two sets of natural numbers are defined elementwise. We restrict the set of operations from which functions are built and determine the impact on the complexity of the membership problems. We focus on PSPACE-decidable membership problems and show completeness results for the complexity classes NL, NP and PSPACE.