906 resultados para common agent architecture design
Resumo:
This paper presents the design of the area optimized integer two dimensional discrete cosine transform (2-D DCT) used in H.264/AVC codecs. The 2-D DCT calculation is performed by utilizing the separability property, in such a way that 2-D DCT is divided into two 1-D DCT calculation that are joined through a common memory. Due to its area optimized approach, the design will find application in mobile devices. Verilog hardware description language (HDL) in cadence environment has been used for design, compilation, simulation and synthesis of transform block in 0.18 mu TSMC technology.
Resumo:
This paper presents a decentralized/peer-to-peer architecture-based parallel version of the vector evaluated particle swarm optimization (VEPSO) algorithm for multi-objective design optimization of laminated composite plates using message passing interface (MPI). The design optimization of laminated composite plates being a combinatorially explosive constrained non-linear optimization problem (CNOP), with many design variables and a vast solution space, warrants the use of non-parametric and heuristic optimization algorithms like PSO. Optimization requires minimizing both the weight and cost of these composite plates, simultaneously, which renders the problem multi-objective. Hence VEPSO, a multi-objective variant of the PSO algorithm, is used. Despite the use of such a heuristic, the application problem, being computationally intensive, suffers from long execution times due to sequential computation. Hence, a parallel version of the PSO algorithm for the problem has been developed to run on several nodes of an IBM P720 cluster. The proposed parallel algorithm, using MPI's collective communication directives, establishes a peer-to-peer relationship between the constituent parallel processes, deviating from the more common master-slave approach, in achieving reduction of computation time by factor of up to 10. Finally we show the effectiveness of the proposed parallel algorithm by comparing it with a serial implementation of VEPSO and a parallel implementation of the vector evaluated genetic algorithm (VEGA) for the same design problem. (c) 2012 Elsevier Ltd. All rights reserved.
Resumo:
In a networked society, governing advocacy groups and networks through decentralized systems of policy implementation has been the interest of governance network literature. This paper addresses the topic of governing networks in the context of Indian agrarian societies by taking the case example of a welfare scheme for the Indian rural poor. We explore context-specific regulatory dynamics through the situated agent based architectural framework. The effects of various regulatory strategies that can be adopted by governing node are tested under various action arenas through experimental design. Results show the impact of regulatory strategies on the resource dependencies and asymmetries in the network relationships. This indicates that the optimal feasible regulatory strategy in networked society is institutionally rational and is context dependent. Further, we show that situated MAS architecture is a natural fit for institutional understanding of the dynamics (Ostrom et al. in Rules, games, and common-pool resources, 1994).
Resumo:
Functions are important in designing. However, several issues hinder progress with the understanding and usage of functions: lack of a clear and overarching definition of function, lack of overall justifications for the inevitability of the multiple views of function, and scarcity of systematic attempts to relate these views with one another. To help resolve these, the objectives of this research are to propose a common definition of function that underlies the multiple views in literature and to identify and validate the views of function that are logically justified to be present in designing. Function is defined as a change intended by designers between two scenarios: before and after the introduction of the design. A framework is proposed that comprises the above definition of function and an empirically validated model of designing, extended generate, evaluate, modify, and select of state-change, and an action, part, phenomenon, input, organ, and effect model of causality (Known as GEMS of SAPPhIRE), comprising the views of activity, outcome, requirement-solution-information, and system-environment. The framework is used to identify the logically possible views of function in the context of designing and is validated by comparing these with the views of function in the literature. Describing the different views of function using the proposed framework should enable comparisons and determine relationships among the various views, leading to better understanding and usage of functions in designing.
Resumo:
This paper presents a Radix-4(3) based FFT architecture suitable for OFDM based WLAN applications. The radix-4(3) parallel unrolled architecture presented here, uses a radix-4 butterfly unit which takes all four inputs in parallel and can selectively produce one out of the four outputs. A 64 point FFT processor based on the proposed architecture has been implemented in UMC 130nm 1P8M CMOS process with a maximum clock frequency of 100 MHz and area of 0.83mm(2). The proposed processor provides a throughput of four times the clock rate and can finish one 64 point FFT computation in 16 clock cycles. For IEEE 802.11a/g WLAN, the processor needs to be operated at a clock rate of 5 MHz with a power consumption of 2.27 mW which is 27% less than the previously reported low power implementations.
Resumo:
We discuss the potential application of high dc voltage sensing using thin-film transistors (TFTs) on flexible substrates. High voltage sensing has potential applications for power transmission instrumentation. For this, we consider a gate metal-substrate-semiconductor architecture for TFTs. In this architecture, the flexible substrate not only provides mechanical support but also plays the role of the gate dielectric of the TFT. Hence, the thickness of the substrate needs to be optimized for maximizing transconductance, minimizing mechanical stress, and minimizing gate leakage currents. We discuss this optimization, and develop n-type and p-type organic TFTs using polyvinyldene fluoride as the substrate-gate insulator. Circuits are also realized to achieve level shifting, amplification, and high drain voltage operation.
Resumo:
A useful insight into managerial decision making can be found from simulation of business systems, but existing work on simulation of supply chain behaviour has largely considered non-competitive chains. Where competitive agents have been examined, they have generally had a simple structure and been used for fundamental examination of stability and equilibria rather than providing practical guidance to managers. In this paper, a new agent for the study of competitive supply chain network dynamics is proposed. The novel features of the agent include the ability to select between competing vendors, distribute orders preferentially among many customers, manage production and inventory, and determine price based on competitive behaviour. The structure of the agent is related to existing business models and sufficient details are provided to allow implementation. The agent is tested to demonstrate that it recreates the main results of the existing modelling and management literature on supply chain dynamics. A brief exploration of competitive dynamics is given to confirm that the proposed agent can respond to competition. The results demonstrate that overall profitability for a supply chain network is maximised when businesses operate collectively. It is possible for an individual business to achieve higher profits by adopting a more competitive stance, but the consequence of this is that the overall profitability of the network is reduced. The agent will be of use for a broad range of studies on the long-run effect of management decisions on their network of suppliers and customers.
Resumo:
There is an increasing number of Ambient Intelligence (AmI) systems that are time-sensitive and resource-aware. From healthcare to building and even home/office automation, it is now common to find systems combining interactive and sensing multimedia traffic with relatively simple sensors and actuators (door locks, presence detectors, RFIDs, HVAC, information panels, etc.). Many of these are today known as Cyber-Physical Systems (CPS). Quite frequently, these systems must be capable of (1) prioritizing different traffic flows (process data, alarms, non-critical data, etc.), (2) synchronizing actions in several distributed devices and, to certain degree, (3) easing resource management (e.g., detecting faulty nodes, managing battery levels, handling overloads, etc.). This work presents FTT-MA, a high-level middleware architecture aimed at easing the design, deployment and operation of such AmI systems. FTT-MA ensures that both functional and non-functional aspects of the applications are met even during reconfiguration stages. The paper also proposes a methodology, together with a design tool, to create this kind of systems. Finally, a sample case study is presented that illustrates the use of the middleware and the methodology proposed in the paper.
Resumo:
This thesis describes research pursued in two areas, both involving the design and synthesis of sequence specific DNA-cleaving proteins. The first involves the use of sequence-specific DNA-cleaving metalloproteins to probe the structure of a protein-DNA complex, and the second seeks to develop cleaving moieties capable of DNA cleavage through the generation of a non-diffusible oxidant under physiological conditions.
Chapter One provides a brief review of the literature concerning sequence-specific DNA-binding proteins. Chapter Two summarizes the results of affinity cleaving experiments using leucine zipper-basic region (bZip) DNA-binding proteins. Specifically, the NH_2-terminal locations of a dimer containing the DNA binding domain of the yeast transcriptional activator GCN4 were mapped on the binding sites 5'-CTGACTAAT-3' and 5'ATGACTCTT- 3' using affinity cleaving. Analysis of the DNA cleavage patterns from Fe•EDTA-GCN4(222-281) and (226-281) dimers reveals that the NH_2-termini are in the major groove nine to ten base pairs apart and symmetrically displaced four to five base pairs from the central C of the recognition site. These data are consistent with structural models put forward for this class of DNA binding proteins. The results of these experiments are evaluated in light of the recently published crystal structure for the GCN4-DNA complex. Preliminary investigations of affinity cleaving proteins based on the DNA-binding domains of the bZip proteins Jun and Fos are also described.
Chapter Three describes experiments demonstrating the simultaneous binding of GCN4(226-281) and 1-Methylimidazole-2-carboxamide-netropsin (2-ImN), a designed synthetic peptide which binds in the minor groove of DNA at 5'-TGACT-3' sites as an antiparallel, side-by-side dimer. Through the use of Fe•EDTA-GCN4(226-281) as a sequence-specific footprinting agent, it is shown that the dimeric protein GCN4(226-281) and the dimeric peptide 2- ImN can simultaneously occupy their common binding site in the major and minor grooves of DNA, respectively. The association constants for 2-ImN in the presence and in the absence of Fe•EDTA-GCN4(226-281) are found to be similar, suggesting that the binding of the two dimers is not cooperative.
Chapter Four describes the synthesis and characterization of PBA-β-OH-His- Hin(139-190), a hybrid protein containing the DNA-binding domain of Hin recombinase and the putative iron-binding and oxygen-activating domain of the antitumor antibiotic bleomycin. This 54-residue protein, comprising residues 139-190 of Hin recombinase with the dipeptide pyrimidoblamic acid-β-hydroxy-L-histidine (PBA-β-OH-His) at the NH2 terminus, was synthesized by solid phase methods. PBA-β-OH-His-Hin(139- 190) binds specifically to DNA at four distinct Hin binding sites with affinities comparable to those of the unmodified Hin(139-190). In the presence of dithiothreitol (DTT), Fe•PB-β-OH-His-Hin(139-190) cleaves DNA with specificity remarkably similar to that of Fe•EDTA-Hin(139-190), although with lower efficiency. Analysis of the cleavage pattern suggests that DNA cleavage is mediated through a diffusible species, in contrast with cleavage by bleomycin, which occurs through a non-diffusible oxidant.
Resumo:
The dissertation studies the general area of complex networked systems that consist of interconnected and active heterogeneous components and usually operate in uncertain environments and with incomplete information. Problems associated with those systems are typically large-scale and computationally intractable, yet they are also very well-structured and have features that can be exploited by appropriate modeling and computational methods. The goal of this thesis is to develop foundational theories and tools to exploit those structures that can lead to computationally-efficient and distributed solutions, and apply them to improve systems operations and architecture.
Specifically, the thesis focuses on two concrete areas. The first one is to design distributed rules to manage distributed energy resources in the power network. The power network is undergoing a fundamental transformation. The future smart grid, especially on the distribution system, will be a large-scale network of distributed energy resources (DERs), each introducing random and rapid fluctuations in power supply, demand, voltage and frequency. These DERs provide a tremendous opportunity for sustainability, efficiency, and power reliability. However, there are daunting technical challenges in managing these DERs and optimizing their operation. The focus of this dissertation is to develop scalable, distributed, and real-time control and optimization to achieve system-wide efficiency, reliability, and robustness for the future power grid. In particular, we will present how to explore the power network structure to design efficient and distributed market and algorithms for the energy management. We will also show how to connect the algorithms with physical dynamics and existing control mechanisms for real-time control in power networks.
The second focus is to develop distributed optimization rules for general multi-agent engineering systems. A central goal in multiagent systems is to design local control laws for the individual agents to ensure that the emergent global behavior is desirable with respect to the given system level objective. Ideally, a system designer seeks to satisfy this goal while conditioning each agent’s control on the least amount of information possible. Our work focused on achieving this goal using the framework of game theory. In particular, we derived a systematic methodology for designing local agent objective functions that guarantees (i) an equivalence between the resulting game-theoretic equilibria and the system level design objective and (ii) that the resulting game possesses an inherent structure that can be exploited for distributed learning, e.g., potential games. The control design can then be completed by applying any distributed learning algorithm that guarantees convergence to the game-theoretic equilibrium. One main advantage of this game theoretic approach is that it provides a hierarchical decomposition between the decomposition of the systemic objective (game design) and the specific local decision rules (distributed learning algorithms). This decomposition provides the system designer with tremendous flexibility to meet the design objectives and constraints inherent in a broad class of multiagent systems. Furthermore, in many settings the resulting controllers will be inherently robust to a host of uncertainties including asynchronous clock rates, delays in information, and component failures.
Resumo:
In this paper we present a methodology and its implementation for the design and verification of programming circuit used in a family of application-specific FPGAs that share a common architecture. Each member of the family is different either in the types of functional blocks contained or in the number of blocks of each type. The parametrized design methodology is presented here to achieve this goal. Even though our focus is on the programming circuitry that provides the interface between the FPGA core circuit and the external programming hardware, the parametrized design method can be generalized to the design of entire chip for all members in the FPGA family. The method presented here covers the generation of the design RTL files and the support files for synthesis, place-and-route layout and simulations. The proposed method is proven to work smoothly within the complete chip design methodology. We will describe the implementation of this method to the design of the programming circuit in details including the design flow from the behavioral-level design to the final layout as well as the verification. Different package options and different programming modes are included in the description of the design. The circuit design implementation is based on SMIC 0.13-micron CMOS technology.