Using soft computing for solving distribution reconfiguration problems were studied for many years. Genetic algorithm (GA) is one of the most popular technologies in the soft computing area for solving distribution sy...
详细信息
Using soft computing for solving distribution reconfiguration problems were studied for many years. Genetic algorithm (GA) is one of the most popular technologies in the soft computing area for solving distribution system problems. However, due to the radial structure of power distribution system, traditional GAs may encounter some difficulties when searching for the optimal solution. Evolutionary programming (EP) was also being used to solve some distribution system problems, for example, loss minimization, service restoration, capacitor placement and many others. Hence, the EP is applied in this paper in order to overcome the weakness of traditional GAs (Fudou et. al, (1997); Miranda et al., (1994); Nara et al., (2003); Ying-Tung Hsiao, (2004), Back et al., (2004); Ying-Tung Hsiao and Ching-Yang Chien, 2000). One of the differences between GA and EP is that the weighting of chromosomes is used for selection operator. The weighting calculation of this paper is based on the characteristics of feeder losses and load balancing on distribution feeders. The results show that the proposed EP with adapted weight calculation performs better than traditional GAs
The proceedings contain 39 papers from the proceedings of the 23rd Annual acmsymposium on Principles of Distributed computing. The topics discussed include: completely fair SFE and coalition-safe cheap talk;mechanism...
详细信息
The proceedings contain 39 papers from the proceedings of the 23rd Annual acmsymposium on Principles of Distributed computing. The topics discussed include: completely fair SFE and coalition-safe cheap talk;mechanism design for policy routing;selfish caching in distributed systems: a game-theoretic analysis;bringing practical lock-free synchronization to 64-bit applications;an almost non-blocking stack and lock-free linked lists and skip lists.
The proceedings contains 70 papers from the conference on the 36th Annual acmsymposium on Theory of computing. The topics discussed include: new hardness results for congestion minimization and machine scheduling;on ...
详细信息
The proceedings contains 70 papers from the conference on the 36th Annual acmsymposium on Theory of computing. The topics discussed include: new hardness results for congestion minimization and machine scheduling;on the performance of greedy algorithms in packet buffering;approximating the cut-norm via grothendieck's inequality;the zero-one principle for switching networks;nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems;and dictionary matching and indexing with errors and don't cares.
Power consumption, performance, area, and cost are critical concerns in designing microprocessors for embedded systems such as portable handheld computing and personal telecommunication devices. In previous work [A. C...
详细信息
Power consumption, performance, area, and cost are critical concerns in designing microprocessors for embedded systems such as portable handheld computing and personal telecommunication devices. In previous work [A. Cheng et al., (2004)], we introduced the concept of framework-based instruction-set tuning synthesis (FITS), which is a new instruction synthesis paradigm that falls between a general-purpose embedded processor and a synthesized application specific processor (ASP). We address these design constraints through FITS by improving the code density. A FITS processor improves code density by tailoring the instruction set to the requirement of a target application to reduce the code size. This is achieved by replacing the fixed instruction and register decoding of general purpose embedded processor with programmable decoders that can achieve ASP performance, low power consumption, and compact chip area with the fabrication advantages of a mass produced single chip solution to amortize the cost. Instruction cache has been recognized as one of the most predominant source of power dissipation in a microprocessor. For instance, in Intel's StrongARMprocessor, 27% of total chip power loss goes into the instruction cache [J. Montanaro et al., (1996)]. In this paper, we demonstrate how FITS can be applied to improve the instruction cache power efficiency. Experimental results show that our synthesized instruction sets result in significant power reduction in the instruction cache compared to ARM instructions. For 21 benchmarks from the MiBench suite [M. Guthaus et al., (2001)], our simulation results indicate on average: a 49.4% saving for switching power; a 43.9% saving for internal power; a 14.9% saving for leakage power; a 46.6% saving for total cache power with up to 60.3% saving for peak power
This paper presents a new application of the snap-drift algorithm by S. W. Lee, et al. (2004): phrase recognition using a set of phrases from the Lancaster parsed corpus (LPC) by R. Garside, et al. (1987). The learnin...
详细信息
This paper presents a new application of the snap-drift algorithm by S. W. Lee, et al. (2004): phrase recognition using a set of phrases from the Lancaster parsed corpus (LPC) by R. Garside, et al. (1987). The learning algorithm is the classifier version of snap-drift. In this version, along with the complementary concepts of fast minimalist learning (snap) and slow drift towards the input pattern, each node of the snap-drift neural network (SDNN) swaps between snap and drift modes when declining performance is indicated on that particular node. This method enables the SDNN to learn at node level, in the sense that each node has its learning mode toggled independently of the other nodes. Learning on each node is also reinforced by enabling learning with a probability that decreases with increasing performance. The simulations demonstrate that learning is stable, and the results have consistently shown similar classification performance and advantages in terms of speed in comparison with a multilayer perceptron (MLP) and back-propagation by J. Topper, et al. (2002), D. E. Rumelhart, et al. (1986) applied to the same problem.
This paper deals with the estimation of rare event probabilities in finite capacity queuing networks. The traditional product form property of Markovian queueing networks usually vanishes when capacity of queues are f...
详细信息
ISBN:
(纸本)9780780395190
This paper deals with the estimation of rare event probabilities in finite capacity queuing networks. The traditional product form property of Markovian queueing networks usually vanishes when capacity of queues are finite and clients are blocked or rejected. A new efficient simulation method, derived from Propp & Wilson (Propp 1996), perfect simulation, is applied in the finite capacity queue context. An algorithm directly samples states of the network according to the stationary distribution. This method is adapted for simulation of rare events, typically when events are described by an increasing subset of the state space. Provided that events of the network are monotone, monotonicity techniques are used to reduce the sampling time. Moreover, a stopping mechanism has been developed to interrupt the simulation when an increasing set has been reached. Then, for the estimation of a monotonous reward function, the simulation time could be reduced drastically as in (Vincent and Marchand 2004).
In 2004, Dubberly Design Office (DDO) was contracted by "HandScript" to design a product that enables physicians to enter orders on a handheld ***' engineers had been working for a year on an alpha proto...
详细信息
ISBN:
(纸本)9781595932501
In 2004, Dubberly Design Office (DDO) was contracted by "HandScript" to design a product that enables physicians to enter orders on a handheld ***' engineers had been working for a year on an alpha prototype and would continue development during the design of the beta. HandScripts' physicians were supplying content using a tool that mimicked an early interface for the product and enjoyed their roles as designers. The client had a limited budget and needed usability questions answered *** in many design projects, there was not time for a top-down or bottom-up design process. DDO had to work "middle-out".This case study describes how DDO borrowed the software quality assurance cycle and applied it to managing interaction design---resolving both large conceptual questions and detailed, screen-level questions. This "middle-out" approach used a familiar process to achieve fast, quality work.
暂无评论