AmbiKraf

This paper presents, AmbiKraf, a non-emissive fabric display that subtly animates patterns on common fabrics. We use thermochromic inks and peltier semiconductor elements to achieve this technology. With this technology we have produced numerous prototypes from animated wall paintings to pixilated fabric displays. The ability of this technology to subtly and ubiquitously change the color of the fabric itself has made us able to merge different fields and technologies with AmbiKraf. In addition, with an animated room divider screen, Ambikraf merged its technology with Japanese Byobu art to tighten the gap between traditional arts and contemporary technologies. Through this AmbiKraf Byobu art installation and other installations, we discuss the impact of this technology as a ubiquitous fabric display. With focus to improvements of some limitations of the existing system, we present our future vision that enables us to merge this technology into more applications fields thus making this technology a platform for ubiquitous interactions on our daily peripherals.     

A quantitative model for software engineering trends

Many decision-makers in industry, government and academia routinely make decisions whose outcome depends on the evolution of software technology trends. Even though the stakes of these decisions are usually very high, decision makers routinely depend on expert opinions and qualitative assessments to model the evolution of software technology; both of these sources of decision-making information are subjective, are based on opinions rather than facts, and are prone to error. In this paper, we report on our ongoing work to build quantitative models of the evolution of software technology trends. In particular, we discuss how we took specific evolutionary models and merged them into a single (general-purpose) model. The original specific models are derived empirically using statistical methods on trend data we had collected over several years, and have been validated individually; in this paper we further validate the generic (general-purpose) model.     

Understanding design patterns — what is the problem?

Design patterns codify proven solutions to recurring design problems. Their proper use within a development context requires that: (i) we understand them; (ii) we ascertain their applicability or relevance to the design problem at hand; and (iii) we apply them faithfully to the problem at hand. We argue that an explicit representation of the design problem solved by a design pattern is key to supporting the three tasks in an integrated fashion. We propose a model‐driven representation of design patterns consisting of triples < MP, MS, T > where MP is a model of the problem solved by the pattern, MS is a model of the solution proposed by the pattern, and T is a model transformation of an instance of the problem into an instance of the solution. Given an object‐oriented design model, we look for model fragments that match MP (call them instances of MP), and when one is found, we apply the transformation T yielding an instance of MS. Easier said than done. Experimentation with an Eclipse Modeling Framework‐based implementation of our approach applied to a number of open‐source software application's raised fundamental questions about: (i) the nature of design patterns in general, and the ones that lend themselves to our approach, and (ii) our understanding and codification of seemingly simple design patterns. In this paper, we present the principles behind our approach, report on the results of applying the approach to the Gang of Four (GoF) design patterns, and discuss the representability of design problems solved by these patterns. Copyright © 2011 John Wiley & Sons, Ltd.     

Qualitative analysis of motion properties of semistate models of large-scale systems

This paper studies the behavior of motions of large-scale (LS) semistate systems (SSS) governed byP _i (t)x _i =M _i (t,x _i )x _i +f _i (t)+h _i (t, x), i=1,2,...,s, =(x ₁ ^T x ₂ ^T x _s ^T )^T, where matricesP _i (t) are singular. Using Lyapunov's approach and the tools for LS system analysis, a variant of attractivity and ultimate boundedness of appropriate time-variable sets are investigated. The results are based on a specific choice of the aggregate functions. It is assumed that the reduction of equations to a normal form of lower order is inconvenient. The aggregation-decomposition approach used in this paper reduces the dimensionality of an aggregate matrix of the system to the number of its systems. Motion properties of LS systems are deduced from the properties of its isolated subsystems, the character of interconnections, and the conditions imposed on the system aggregate matrix. Sufficient algebraic conditions for the above-mentioned motion properties are developed.     

Compressive creep of Fe3Al-type iron aluminide with Zr additions

High-temperature creep of a Fe₃Al-type iron aluminide alloyed by zirconium was studied in the temperature range 873–1073 K. The alloy contained (wt.%) 31.5% Al, 3.5% Cr, 0.25% Zr, 0.19% C (Fe balance). It was tested in two states: (i) as received after hot rolling and (ii) heat treated (1423 K/2 h/air). Creep tests were performed in compression at constant load with stepwise loading: in each step, the load was changed to a new value after steady state creep rate had been established. Stress exponent and activation energy of the creep rate were determined and possible creep mechanisms were discussed in terms of the threshold stress concept. A rapid fall of the stress exponent and of the threshold stress with the increasing temperature indicates that creep is impeded by the presence of precipitates only at temperature 873 K. The results were compared with the results of long-term creep tests in tension performed recently on the same alloy. __________ Translated from Problemy Prochnosti, No. 1, pp. 117–120, January–February, 2008.     

Mathematics for reasoning about loop functions

The criticality of modern software applications, the pervasiveness of malicious code concerns, the emergence of third-party software development, and the preponderance of program inspection as a quality assurance method all place a great premium on the ability to analyze programs and derive their function in all circumstances of use and all its functional detail. For C-like programming languages, one of the most challenging tasks in this endeavor is the derivation of loop functions. In this paper, we outline the premises of our approach to this problem, present some mathematical results, and discuss how these results can be used as a basis for building an automated tool that derives the function of while loops under some conditions.     

On the Effect of the Machine Saturation on SSR in Power Systems

A bifurcation analysis is performed to investigate the influence of iron saturation on the complex dynamics of a heavily loaded single-machine-infinitebusbar power system modeling the characteristics of the CHOLLA# 4 generator with respect to the SOWARO station. The system has five mechanical and two electrical modes. The results show that as the compensation level increases, the operating condition loses stability via a supercritical Hopf bifurcation. As a result, the power system oscillates subsynchronously with a small limit-cycle attractor. The instability is due to the interaction of the subsynchronous electrical mode with one of the torsional modes. When the machine saturation is considered, again the system loses stability via a supercritical Hopf bifurcation; however, it occurs at a slightly lower level of compensation, indicating that the influence of machine saturation is slightly destabilizing.     

Data dependencies in extended possibility‐based fuzzy relational databases

Based on the semantic equivalence degree the formal definitions of fuzzy functional dependencies (FFDs) and fuzzy multivalued dependencies (FMVDs) are first introduced to the fuzzy relational databases, where fuzziness of data appears in attribute values in the form of possibility attributions, as well as resemblance relations in attribute domain elements, called extended possibility‐based fuzzy relational databases. A set of inference rules for FFDs and FMVDs is then proposed. It is shown that FFDs and FMVDs are consistent and the inference rules are sound and complete, just as Armstrong's axioms for classic cases. © 2002 Wiley Periodicals, Inc.