835 resultados para Computer networks -- Simulation methods
Resumo:
This paper presents a mathematical model and a methodology to solve the transmission network expansion planning problem with security constraints in full competitive market, assuming that all generation programming plans present in the system operation are known. The methodology let us find an optimal transmission network expansion plan that allows the power system to operate adequately in each one of the generation programming plans specified in the full competitive market case, including a single contingency situation with generation rescheduling using the security (n-1) criterion. In this context, the centralized expansion planning with security constraints and the expansion planning in full competitive market are subsets of the proposal presented in this paper. The model provides a solution using a genetic algorithm designed to efficiently solve the reliable expansion planning in full competitive market. The results obtained for several known systems from the literature show the excellent performance of the proposed methodology.
Resumo:
Since the 1980s, huge efforts have been made to utilise renewable energy sources to generate electric power. One of the interesting issues about embedded generators is the question of optimal placement and sizing of the embedded generators. This paper reports an investigation of impact of the integration of embedded generators on the overall performances of the distribution networks in the steady state, using theorem of superposition. Set of distribution system indices is proposed to observe performances of the distribution networks with embedded generators. Results obtained from the case study using IEEE test network are presented and discussed.
Resumo:
This paper presents an algorithm to solve the network transmission system expansion planning problem using the DC model which is a mixed non-linear integer programming problem. The major feature of this work is the use of a Branch-and-Bound (B&B) algorithm to directly solve mixed non-linear integer problems. An efficient interior point method is used to solve the non-linear programming problem at each node of the B&B tree. Tests with several known systems are presented to illustrate the performance of the proposed method. ©2007 IEEE.
Resumo:
A bilevel programming approach for the optimal contract pricing of distributed generation (DG) in distribution networks is presented. The outer optimization problem corresponds to the owner of the DG who must decide the contract price that would maximize his profits. The inner optimization problem corresponds to the distribution company (DisCo), which procures the minimization of the payments incurred in attending the expected demand while satisfying network constraints. The meet the expected demand the DisCo can purchase energy either form the transmission network through the substations or form the DG units within its network. The inner optimization problem is substituted by its Karush- Kuhn-Tucker optimality conditions, turning the bilevel programming problem into an equivalent single-level nonlinear programming problem which is solved using commercially available software. © 2010 IEEE.
Resumo:
This paper presents a NCAP embedded on DE2 kit with Nios II processor and uClinux to development of a network gateway with two interfaces, wireless (ZigBee) and wired (RS232) based on IEEE 1451. Both the communications, wireless and wired, were developed to be point-to-point and working with the same protocols, based on IEEE 1451.0-2007. The tests were made using a microcomputer, which through of browser was possible access the web page stored in the DE2 kit and send commands of control and monitoring to both TIMs (WTIM and STIM). The system describes a different form of development of the NCAP node to be applied in different environments with wired or wireless in the same node. © 2011 IEEE.
Resumo:
Intrusion detection systems that make use of artificial intelligence techniques in order to improve effectiveness have been actively pursued in the last decade. Neural networks and Support Vector Machines have been also extensively applied to this task. However, their complexity to learn new attacks has become very expensive, making them inviable for a real time retraining. In this research, we introduce a new pattern classifier named Optimum-Path Forest (OPF) to this task, which has demonstrated to be similar to the state-of-the-art pattern recognition techniques, but extremely more efficient for training patterns. Experiments on public datasets showed that OPF classifier may be a suitable tool to detect intrusions on computer networks, as well as allow the algorithm to learn new attacks faster than the other techniques. © 2011 IEEE.
Resumo:
The performance of muon reconstruction, identification, and triggering in CMS has been studied using 40 pb-1 of data collected in pp collisions at s = 7 TeV at the LHC in 2010. A few benchmark sets of selection criteria covering a wide range of physics analysis needs have been examined. For all considered selections, the efficiency to reconstruct and identify a muon with a transverse momentum pT larger than a few GeV/c is above 95% over the whole region of pseudorapidity covered by the CMS muon system, < 2.4, while the probability to misidentify a hadron as a muon is well below 1%. The efficiency to trigger on single muons with pT above a few GeVc is higher than 90% over the full η range, and typically substantially better. The overall momentum scale is measured to a precision of 0.2% with muons from Z decays. The transverse momentum resolution varies from 1% to 6% depending on pseudorapidity for muons with pT below 100GeV/c and, using cosmic rays, it is shown to be better than 10% in the central region up to pT = 1 TeV/c. Observed distributions of all quantities are well reproduced by the Monte Carlo simulation. © 2012 IOP Publishing Ltd and Sissa Medialab srl.
Resumo:
The aim of this study was to evaluate the incidence of pleiomorphisms and its influence on the distribution of sperm morphometric subpopulations in ejaculates from the vulnerable Goeldi's monkey (Callimico goeldii) by using a combination of computerized analysis system and Principal Component Analysis (PCA) methods Each sperm head was measured for four primary spermatozoal head dimensional parameters (area [A (μm2)], perimeter [P (μm)], length [L (μm)] and width [W (μm)]) and three head shape derived parameters (ellipticity [(L/W)], elongation [(L-W)/(L+W)] and rugosity [(4πA/P2)]) Six separate subpopulations (SPs) were identified: SP1, constituted by very large, narrow and very elliptical spermatozoa (A=16.85±1.56μm2, W=2.75±0.42μm and ellipticity=2.16±0.24); SP2, characterized by average sized, short, wide and round spermatozoa (A=15.00±1.92μm2, L=5.06±0.49μm, W=3.51±0.31μm and ellipticity=1.44±0.15); SP3, represented by small, wide and slightly round spermatozoa (A=14.95±1.75μm2, W=3.47±0.29μm and ellipticity=1.48±0.14); SP4 included very small, short and very round spermatozoa (A=14.15±2.38μm2, L=4.90±0.57μm and elongation=0.18±0.05); SP5 consisted of average sized and slightly elliptical spermatozoa (A=15.14±1.72μm2 and ellipticity=1.49±0.14); and SP6 included large and round spermatozoa (A=16.30±1.62μm2 and elongation=0.19±0.04) There were differences in the sperm subpopulation distribution (P<0.001) among the five donors analyzed In conclusion, the results of the current study confirmed that the use of computer sperm analysis methods combined with PCA cluster analyses are useful methods to identify, classify, and characterize different sperm head morphometric subpopulations in neotropical primates Broadening our knowledge of C goeldii sperm morphometric abnormalities as well as developing reliable techniques for sperm evaluation may be essential for ex situ conservation of this threatened species © 2012 Elsevier B.V.
Resumo:
Current research compares the Bayesian estimates obtained for the parameters of processes of ARCH family with normal and Student's t distributions for the conditional distribution of the return series. A non-informative prior distribution was adopted and a reparameterization of models under analysis was taken into account to map parameters' space into real space. The procedure adopts a normal prior distribution for the transformed parameters. The posterior summaries were obtained by Monte Carlo Markov Chain (MCMC) simulation methods. The methodology was evaluated by a series of Bovespa Index returns and the predictive ordinate criterion was employed to select the best adjustment model to the data. Results show that, as a rule, the proposed Bayesian approach provides satisfactory estimates and that the GARCH process with Student's t distribution adjusted better to the data.
Resumo:
Objectives: This study evaluated the gloss behaviour of experimental resin composites loaded with different filler percentages, immediately after polishing and after toothbrushing simulation. Methods: Sixteen disc-shaped specimens were fabricated for each different-charged composite (40%, 50%, 60%, 70% and 75%) and polished with SiC abrasive papers. Gloss measurements were made prior to simulated toothbrushing. The specimens were subjected to the simulation for 5, 15, 30 and 60 min using an electrical toothbrush with a standardized pressure while being immersed in a toothpaste/artificial saliva slurry. Results: Baseline composite gloss values ranged from 69.7 (40%) to 81.3 (75%) GU (gloss units) and from 18.1 (40%) to 32.3 (75%) GU after 1 h of brushing. Highest gloss values were obtained by 75%-charged resin, while the lowest values were obtained by the 40%-charged one. Conclusions: All tested materials showed a gloss decrease. However, the higher filler load a composite resin has, the higher gloss it can achieve. Clinical significance: Gloss of resin composite materials is an important factor in determining aesthetic success of anterior restorations, and this property may vary according to the filler charge of the restorative material. Higher filler load of a composite resin results in higher gloss values. © 2013 Elsevier Ltd. All rights reserved.
Resumo:
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Resumo:
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Resumo:
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Resumo:
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Resumo:
Pós-graduação em Ciência da Informação - FFC