Designing for parallel fuzzy computing

As the number of fuzzy logic applications increases, demand for faster architectures will grow. Our design for a VLSI fuzzy processor uses fuzzy inference techniques that optimize processing time. Preprocessing that reduces the number of rules to be processed, parallel computation of active rule degrees of activation, and scalability are major features of this architecture. The journal issue contains a concise summary of this article. The complete article is linked to Micro's home page on the World Wide Web (http://www.computer.org/pubs/micro/micro.htm)     

An evolutionary management scheme in high-performance packet switches

This paper deals with a novel buffer management scheme based on the combination of evolutionary computing and fuzzy logic for shared-memory packet switches. The philosophy behind it is adaptation of the threshold for each logical output queue to the real traffic conditions by means of a system of fuzzy inferences. The optimal fuzzy system is achieved using a systematic methodology based on Genetic Algorithms for membership-function selecting and tuning. This methodology approach allows the fuzzy system parameters to be automatically derived when the switch parameters vary, offering a high degree of scalability to the fuzzy control system. Its performance is close to that of the push-out mechanism, which can be considered ideal from a performance viewpoint, and at any rate much better than that of threshold schemes based on conventional logic. In addition, the fuzzy threshold scheme is simple to implement, unlike the push-out mechanism which is not practically feasible in high-speed switches due to the amount of time required for computation, and above all inexpensive when implemented using current standard technology.     

Optimal sampling for the estimation of dispersion parameters in soil columns using an Iterative Genetic Algorithm

In groundwater modelling, an appropriate soil characterization is strongly recommended to evaluate both the fate and transport of solutes and the performance of groundwater remediation criterion, though parameter estimation techniques are often blocked by several inherent difficulties (i.e. ill-posedness and insufficient quantity and quality of observation data). In this paper, an iterative decision model is built and tested in order to locate the position of a fixed number of sample points in a soil column experiment to obtain optimal parameter estimation (OPE), minimizing the parametric uncertainty and the overall cost of the experimental campaign. Starting from an initial guess of chosen points (given by a fraction of the total disposable ones), an Iterative Genetic Algorithm (IGA) is capable of finding the best points able to minimize a first-order approximation of the parameter covariance matrix. The parameter estimates are updated under a Bayesian scheme, using exclusively the observations collected after the earlier run of minimization, and the iterative process stops when the imposed convergence criterion based on the parameter values is reached. An important contribution of this work is the development of an effective direct search algorithm (IGA) for solving the sampling network optimization problem at a laboratory scale.     

Performance evaluation of efficient multi-objective evolutionary algorithms for design space exploration of embedded computer systems

Multi-objective evolutionary algorithms (MOEAs) have received increasing interest in industry because they have proved to be powerful optimizers. Despite the great success achieved, however, MOEAs have also encountered many challenges in real-world applications. One of the main difficulties in applying MOEAs is the large number of fitness evaluations (objective calculations) that are often needed before an acceptable solution can be found. There are, in fact, several industrial situations in which fitness evaluations are computationally expensive and the time available is very short. In these applications efficient strategies to approximate the fitness function have to be adopted, looking for a trade-off between optimization performance and efficiency. This is the case in designing a complex embedded system, where it is necessary to define an optimal architecture in relation to certain performance indexes while respecting strict time-to-market constraints. This activity, known as design space exploration (DSE), is still a great challenge for the EDA (electronic design automation) community. One of the most important bottlenecks in the overall design flow of an embedded system is due to simulation. Simulation occurs at every phase of the design flow and is used to evaluate a system which is a candidate for implementation. In this paper we focus on system level design, proposing an extensive comparison of the state-of-the-art of MOEA approaches with an approach based on fuzzy approximation to speed up the evaluation of a candidate system configuration. The comparison is performed in a real case study: optimization of the performance and power dissipation of embedded architectures based on a Very Long Instruction Word (VLIW) microprocessor in a mobile multimedia application domain. The results of the comparison demonstrate that the fuzzy approach outperforms in terms of both performance and efficiency the state of the art in MOEA strategies applied to DSE of a parameterized embedded system.     

An efficient fuzzy system for traffic management in high-speed packet-switched networks

 In this paper we present a novel buffer management scheme based on fuzzy logic. We deal with the problem of managing traffic flows with different priorities within the same buffer. The aim is to guarantee the QoS of high-priority traffic, and at the same time exploit unused buffer resources to accommodate best-effort traffic in order to maximize the total throughput. The scheme we propose can be applied both to ATM and IP networks. The performance evaluation of the fuzzy priority control scheme shows that it outperforms any static threshold mechanism and, as far as the total throughput is concerned, it is very close to that of the push out mechanism considered in literature as an ideal mechanism. Finally, we address some implementation issues of the control system and propose the design of a new cost-effective VLSI fuzzy processor.     

Static analysis of logical languages with deferred update semantics

Static analysis of declarative languages deals with the detection, at compile time, of program properties that can be used to better understand the program semantics and to improve the efficiency of program evaluation. In logical update languages, an interesting problem is the detection of conflicting updates, inserting and deleting the same fact, for transactions based on set-oriented updates and active rules. In this paper, we investigate this topic in the context of the U-Datalog language, a set-oriented update language for deductive databases, based on a deferred semantics. We first formally define relevant properties of U-Datalog programs, mainly related to update conflicts. Then, we prove that the defined properties are decidable and we propose an algorithm to detect such conditions. Finally, we show how the proposed techniques can be applied to other logical update languages. Our results are based on the concept of labeling and query-tree.     

An extended algebra for constraint databases

Constraint relational databases use constraints to both model and query data. A constraint relation contains a finite set of generalized tuples. Each generalized tuple is represented by a conjunction of constraints on a given logical theory and, depending on the logical theory and the specific conjunction of constraints, it may possibly represent an infinite set of relational tuples. For their characteristics, constraint databases are well suited to model multidimensional and structured data, like spatial and temporal data. The definition of an algebra for constraint relational databases is important in order to make constraint databases a practical technology. We extend the previously defined constraint algebra (called generalized relational algebra). First, we show that the relational model is not the only possible semantic reference model for constraint relational databases and we show how constraint relations can be interpreted under the nested relational model. Then, we introduce two distinct classes of constraint algebras, one based on the relational algebra, and one based on the nested relational algebra, and we present an algebra of the latter type. The algebra is proved equivalent to the generalized relational algebra when input relations are modified by introducing generalized tuple identifiers. However, from a user point of view, it is more suitable. Thus, the difference existing between such algebras is similar to the difference existing between the relational algebra and the nested relational algebra, dealing with only one level of nesting. We also show how external functions can be added to the proposed algebra     

A GA-based design space exploration framework for parameterized system-on-a-chip platforms

The constant increase in levels of integration and reduction in the time-to-market has led to the definition of new methodologies, which lay emphasis on reuse. One emerging approach in this context is platform-based design. The basic idea is to avoid designing a chip from scratch. Some portions of the chip's architecture are predefined for a specific type of application. This implies that the basic micro-architecture of the implementation is essentially "fixed," i.e., the principal components should remain the same within a certain degree of parameterization. Many researchers predict that platforms will take the lion's share of the integrated circuit market. In this paper, we propose an approach based on genetic algorithms for exploring the design space of parameterized system-on-a-chip (SOC) platforms. Our strategy focuses on exploration of the architectural parameters of the processor, memory subsystem and bus, making up the hardware kernel of a parameterized SOC platform for the design of embedded systems with strict power consumption and performance constraints. The approach has been validated on two different parameterized architectures: one based on a RISC processor and another based on a parameterized very long instruction word architecture. The results obtained on a suite of benchmarks for embedded applications are discussed in terms of both accuracy and efficiency. As far as accuracy is concerned, the approach gives solutions uniformly distributed in a region less than 1% from the Pareto-optimal front. As regards efficiency, the exploration times required by the approach are up to 20 times shorter than those required by one of the most efficient and widely referenced approaches in the literature.     

Variation in ovarian morphology in four species of New World moles with a peniform clitoris

Female moles of the Old World genus Talpa display a curious suite of reproductive features that include a peniform clitoris and ovaries with a discrete interstitial gland or testis-like region (so-called 'ovotestes'). The masculinization of the female external genitalia in Talpa has accordingly been linked with secretion of androgens from the interstitial gland region of the fetal gonad. Although their ovarian morphology has received less attention, some species of New World moles also have ovaries with a pronounced interstitial gland (for example star-nosed mole, Condylura cristata), whereas females of other species do not (for example eastern mole, Scalopus aquaticus). Although it is difficult to determine the sex of both Old and New World moles, published accounts describing the external genitalia of female moles are available only for Talpa. The hypothesis that masculinization of the female external genitalia in moles is associated with the presence of an ovarian interstitial gland (OIG) was tested in the present study by using a comparative approach to determine whether these features are ever found in isolation of one another. Three genera of North American moles (Scapanus, Condylura and Neurotrichus) were studied and a peniform clitoris was found in all three species, but OIG were found in only two of three genera. The ovaries of S. latimanus and S. orarius were unremarkable, with no evidence of a discrete interstitial gland or testis-like region. Mapping these results onto recent talpid phylogenies indicates that loss of the bipolar ovarian morphology is a derived trait in Scapanus, and conclusively demonstrates that masculinization of the external genitalia in female moles can develop in the presence or absence of 'ovotestes'.     

A screening methodology for implementing cost effective energy retrofit measures in Canadian office buildings

Private and public sectors own and operate an array of office buildings that consume energy and contribute to the emission of greenhouse gases (GHG). Energy demands can be reduced by applying energy retrofit measures (ERMs) to existing buildings. The choice of ERMs involves evaluation of applicability, energy end uses and cost of application versus energy savings. This paper describes a methodology developed to screen office buildings for their current level of energy consumption and potential for retrofit application. Selection of an optimal set of ERMs is influenced by climate, occupancy, heating and cooling systems, envelope properties and building geometry. When assessing the implications of applying ERMs to a large building stock it is vital to screen the complete building set for optimal retrofit opportunities. This can be accomplished by characterizing office building stock into a manageable set of archetypes and simulating building operation using energy simulation software. Using regression analyses, a model was developed for estimating the energy consumption. Present value analysis was used to optimize the evaluation of the various ERMs. The methodology developed can be used to simplify the ranking of buildings for retrofit; to select and combine ERMs, and to plan energy and GHG reduction activities.