An Aggressive Approach to Parameter Extraction

合集下载

THE Sigma APPROACH TO THE FINE STRUCTURE OF L

THE Sigma APPROACH TO THE FINE STRUCTURE OF L
Research supported by NSF contract number 9205530.
2
SY D. FRIEDMAN
0
-Comprehension + \Every set has a transitive closure." Then there exists a universal n predicate for S . Proof. It is enough to treat the case n = 1, as for example to get W2 from W1 we can just de ne W2(e; x) ! 9 y W1(e; hx; yi). Let h'i j i 2 !i be a standard list of formulas with one free variable and de ne Sat(z; i; x) to mean: z is transitive, x 2 z and hz; i j= 'i(x). Sat can be expressed by a 1 formula: Sat(z; i; x) ! z is transitive, x 2 z and 9Y (i + 1) z s.t. f8j i If 'j (x) is atomic then hj; xi 2 Y ! 'j true; if 'j (x) is 9y 'j0 (hx; yi) then hj; xi 2 Y0 ! 9y 2 z(hj 0; hx; yii 2 Y ); if 'j (x) is 'j0 (x) then hj; xi 2 Y ! hj ; xi 2 Y ; if 'j (x) is 'j1 (x) ^ 'j2 (x) then hj; xi 2 Y ! (hj1 ; xi 2 Y = and hj2 ; xi 2 Y )] and hi; xi 2 Y g. The fact that S satis es pairing and 0 Comprehension implies that when restricted to S , Sat is 1-de nable over hS; i, via the above de nition. Finally we set: W1(e; x) ! e = hi; pi and for some transitive z; Sat(z; i; hx; pi): W1 is universal, using pairing, the existence of transitive closures and the persistence of 1 formulas over transitive sets. We're ready to de ne the J -hierarchy. By induction on we de ne J to satisfy the hypotheses of Lemma 1. Let Wn (e; x) denote the canonical universal n predicate coming from the proofS Lemma 1. For = 0 we have J0 = and for = 1 we have J1 = L! . For of limit, J = fJ j < g. Note that the hypotheses of Lemma 1 are met by J , given that they are met by each J ; < . Suppose that J ; Wn (e; x) are de ned for some > 0 and we wish to de ne J +1. An n-code is a pair (n; e) where e 2 J . By induction on n de ne: X (O; e) = e X (n + 1; e) = fX (n; f ) j Wn+1(e; f )g : S Then J ;n = fX (n; e) j e 2 J g and J +1 = fJ ;n j n 2 !g. Lemma 2. (a) n m ?! J ;n J ;m . (b) J ;n is transitive. (c) ORD(J ;n) = ! + n. (d) J +1 Pairing + 0-Comprehension. (e) J +1 \ P (J ) = Def (J ). Proof. (a) By induction on n, we de ne a function F (n; e), e 2 J that produces f 2 J such that X (n; e) = X (n + 1; f ). For n = 0, let F (0; e) = f where fg j W1 (f; g)g = e; then X (0; e) = e = fg j W1 (f; g)g = X (1; f ). Suppose that F (n; e) has been de ned for all e. Then let F (n + 1; e) = f where fg j Wn+2 (f; g)g = fF (n; h) j Wn+1 (e; h)g; clearly f exists as we can choose F to be 1(J ) and therefore the latter set is n+1(J ) with parameter e. Finally we get X (n + 2; f ) = fX (n + 1; F (n; h)) j Wn+1 (e; h)g = fX (n; h) j Wn+1 (e; h)g by induction, and the latter set is X (n + 1; e).

ASPEN最新版先进控制软件 DMC 3

ASPEN最新版先进控制软件 DMC 3

T he Aspen DMC3 Difference An Industry White PaperRobert Golightly, Product Marketing Manager, Aspen Technology, Inc.IntroductionThere is a classic dichotomy in APC: the technology delivers maximum benefitswhen the underlying algorithms leverage accurate models for the aggressivepursuit of profits. However, we also want the controller to gracefully handle thepresence of errors or poor model conditioning. The controller algorithms have traditionally been slanted in one direction or the other; to be very aggressive in the pursuit of benefits, or be less aggressive in order to compensate for the potential for reduced accuracy in the models.There was, of course, a price to be paid for either choice. When errors are present in aggressive controllers, the optimizer can jump from solution to solution as itchases the potential profit it identified as a result of the model inaccuracies. Whenthe choice of a less aggressive controller is made, the price equals lower benefits asthe controller is essentially tuned to ignore improvements below a certainthreshold.Part of the problem is that this is also a temporal issue and not just about the initialmodel accuracy. We know that the changes that occur in the plant betweenrevamps of the controller cause slowly evolving differences between the actualplant behavior and the model predictions—hence the eroding benefits of thecontroller. In fact, there are several points within the APC lifecycle where these issues surface. Figure 1 depicts the facets of APC that offer opportunities to tune the behavior of the APC solution to address issues affecting benefits, operating stability, and product quality in the presence of model inaccuracies.For the last 10 years, AspenT ech has been working on a comprehensive solution for top-of-mind issues for APCpractitioners. Beginning with offline collinearity repair nearly a decade ago, and now with Adaptive Process Control, LP Tuning, and Constrained Model Identification, AspenT ech is again setting the standard for multivariable model predictive control and optimization with Aspen DMC3.Model ConditioningThere are many reasons why a substantially inaccurate model can lead to performance issues, andthis applies to all MPC formulations. In model conditioning, we are addressing aspects of the modelthat create ambiguity with respect to decisions made in the course of optimization. The mostillustrative example is near collinearity in the models. When this condition exists, there are very smalldifferences in the gains that an aggressively tuned optimizer will see as opportunities for profit. This type of “numerical fuzziness” can create cycling. Certain tools that have been in existence help expert practitioners fix the Relative Gain Arrays (RGAs) of the models to prevent this situation. The most recent innovations in this area surface these tools as an integrated part of the workflow and simplify the use of the tools via automation, thereby enabling non-expert practitioners to correct issues with collinearity during the offline modeling phase.Figure 1: Facets of APCController TuningDynamic model accuracy (curve shape) is also important as it affects the dynamic control movecalculation, which can also lead to cycles if the main model curves are very inaccurate. This is usuallynot the dominant reason for cycling, unless MV tuning (move suppression) is very aggressive. Agood control solution would need the ability to handle instability resulting from inaccuracy in the dynamic models, as well as inappropriate tuning.Model AdaptationAspenT ech has been working steadily for the last decade to solve the model maintenance side of thisissue. This technology includes the ability to alter the “personality” of the controller in terms of theaggressiveness of plant testing. The adaptive technology alters the optimization behavior of thecontroller to direct it to be less aggressive during testing, and in the presence of the errors, inherent ininitial seed models. The Adaptive Process Control technology provides the engineer with an analog parameter to adjust the tradeoff between testing aggressiveness and the capture of benefits. Previous to this technology, the choice was binary—focus on testing OR optimization, not a user-specified balance of objectives.The adaptive technology allows the user to tune the personality of the controller to particular circumstances encountered during the testing and model construction phases. Rather than a one-size-fits-all set of binary choices, we now have the ability to fine-tune the tradeoff to unique needs.LP TuningT o complement the Adaptive capability, we also need a way to shape the behavior of the controllerwhen in optimizing control mode. As changes occur in the plant over time, or via transient events, weneed to be able to easily modify the behavior of the controller until the issues can be addressed, orsimply modify as a technical hedge tactic.It is a well-known fact that a Linear Program (LP) algorithm has the ability to select the most optimal set of simultaneous constraints where a process unit will make the most money. Most APC applications contain two to three times more controlled variables than manipulated variables. Therefore, the controller model is referred to as “non-square,” and potentially millions of constraint combinations are possible. The objective is to find the constraint set that maximizes the benefits. For most control applications, the interior point LP algorithm can select the most optimal solution within amatter of milliseconds. This is possible due to the ability of the LP to “square up” the control problem by preferentially finding the constraint set where all controlled variables (CVs) are inside their safety and operability limits, while maximizing profitability of the process unit. If there is no feasible solution— because limits are set too conservatively or inconsistency exists in model relationship—then a ranked approach is used to decide which CVs are allowed to violate constraints.Linear Programming has many advantages in optimization, but there are a few disadvantages too. If the model is not accurate with respect to the process variable costs, the LP might pick an unfavorable solution. It is often the case that when this occurs, operators get frustrated, complaining that the controller “is not doing the right thing.”In what follows, we’ll illustrate the behavior of the Aspen DMC3 controller, using its ability to adjust the LP aggressiveness to address the more common types of model inaccuracies.Steady-State Gain ErrorsThe current biased prediction is used as the starting point to initialize the LP at every execution cycle. If the gain matrix is very inaccurate, then the LP might make bigger-than-required MV moves to steer the unit back toward the chosen LP targets. This leads to excessive MV movement and potential cycling between solutions. This behavior is upsetting to operators, and leads to being unprofitable.Another form of model inaccuracy, where a closed material balance does not add up to zero, is when the LP might think it can optimize in ways that violate the laws of physics i.e. by creating mass. The gain matrix does not need to be perfectly accurate, but as gain errors increase there comes a point where the LP will switch to the wrong solution.The LP might also pick a new solution based on feedback information, allowing the controller to move in that direction.But due to the model errors, the controller will observe a process response quite different from what it predicted. A few steps later, the LP might conclude that the original constraint was better after all. This can result in a cycle where the LP flips between two or more active constraint sets.A good robust control solution would prevent LP flipping by avoiding the use of weak process handles to deal with new CV limit excursions. The robust solution would also need to prevent giving up too much in terms of dynamic performance. It must not become so sluggish that it cannot adequately reject disturbances. In terms of optimization performance, it should not move too far away from the theoretically optimal solution.The next few figures display some simulations of Aspen DMC3. Figure 2 shows where the controller model has a gain that is 5x too low (worst case direction).Figure 2: Increasing the robustness factor prevents LP flipping in the presence of model mismatchAll MVs and CVs except for FC2001 and AI2020 have been turned off, making this is a simple 1x1 controller, similar to a PID single loop controller. We would typically not build applications this small, but it serves to illustrate the ability of the new algorithm to stabilize the dynamic move plan when the LP is not active since the controller is already squared up.We intentionally started with a very large model mismatch (500% in the worst case direction), and inappropriate MV tuning (move suppression of 0.1, which is very aggressive). As can be expected, the 1x1 controller cycled poorly using the standard move plan algorithm. The new global tuning parameter called “Robustness Factor” (R) was used, a normalized number between 0 and 1. As the Robustness Factor increased, the loop became better damped (less cyclical) until Time (min)Time (min)C V –%C 5 T o p M V –R e f l u xacceptable performance was achieved at R=0.2. Clearly, the robust control algorithm managed to stabilize this controller in the presence of severe model mismatch. This example highlights how the robust algorithm adjusts the dynamic move plan optimization to provide improved performance.Figure 3 below shows where we created random gain errors in the controller model varying from 0.1 (10x or 1000% too low) to 2x (200% too high).Figure 3: Cycling is cured with Robust operationThe controller was started with the Robustness Factor (R) set to zero, i.e. the user is saying “no additional controller robustness is needed; I trust my model completely.” Clearly, the excessive (unreasonable) model mismatch was sufficiently large in this example to cause the controller to cycle or “flip” between alternate solutions.Errors in the gain and shape of the model curves can also contribute to controller instability, as the move plan engine will respond to bias feedback. As the R was increased to a small non-zero value (0.005), the cycle persisted and got smaller.By increasing R to 0.05 (still small, 5% of range) it cured the cycle completely. C V - % C 5 T o p M V -R e f l u x C V - % C 7 M i d -p r o d u c t Time (min)Time (min)R=0.0R=0.005R=0.05R=0.0R=0.005R=0.05R=0.0R=0.005R=0.05The compromise is that AI2021 moved inside its limit instead of riding the high limit as before. The trade-off is thecontroller will respond slower and give up some economic benefit. Figure 4 shows a second simulation displaying a more realistic scenario where R was held constant at 0.1, and the amplitude of the random disturbances were increased by 10x.Figure 4: MV targets stay constant, changing only when there is sufficient economic reason for doing soNotice that the red MV LP target stays constant for some period of time, changing only when there is a sufficienteconomic reason for doing so (too far away from the optimal LP targets), or if a disturbance drives the CV beyond limits.With less movement in the LP targets, there is of course less movement in the MVs that slow down the controller, leading to less bias updating and further stabilizing the LP targets.The philosophy here is that if the controller moves less (or more slowly), and if the LP is somewhat less profit hungry, then there is less need for accurate models. The new robust control algorithm intentionally prevents the LP from “chasing after pennies” (a small benefit that is most likely not achievable), while keeping the LP targets as constant as possible—dictated by the economic give-up (economic relaxation), which depends on the Robustness Factor. See the figures below detailing the CV plot.M V –M i d P r o d M V - F e e d T e m pC V –%C 7 M i d P r o d u c t C V –%C 5 T o p C V –%C 3 B o t . P r o d u c t Time (min)Time (min)Time (min)Figure 5: The MV target may be constant for long periods of time if the CV is still near the optimal solution and is not violating constraints Figure 6: The CV LP steady-state target is underneath the actual CV value, while the MV target is held constant Notice that the CV LP target is occasionally set equal to the current CV value. This indicates that the MV LP targets are being held constant during this time period, and that the algorithm has concluded that it is OK for the CV to move around by this amount. Once the CVs move too far away, the LP will make an MV LP target change, pick new CV targets, and try to drive the process closer to optimality.M V –F e e d T e m pTime (min)C V - % C 7 M i d -p r o d u c tTime (min)Also, the controller internally calculates the RGA numbers of the sub-models participating in the current active constraint set. If sub-models with high RGA numbers become active, indicating that the model matrix has unrepaired collinearity issues, the LP will drop these degrees of freedom by preventing movement in the weak process direction. If the reduced rank LP problem has no spare degrees of freedom left, it will allow some of the CV LP targets to violate the active limits by a small amount, rather than rely on the weak directions of the process to try and drive inside the limits, which typically does not work well because it requires very large MV movement.Often these high RGA sub-models are not accurate anyway and the actual process might very well be perfectly collinear. The user is encouraged to set the CV Validity Limits, such that the controller will turn off if the CV exceeds these limits. If there is still enough spare degrees of freedom left after removing the weakest 2x2 directions from the LP, then the controller will move the CV a small amount inside their limits, in effect giving up some amount of economic benefit. This relaxed LP solution is compared every minute with the optimal LP solution, and only if the delta cost function (delta J) becomes too large (as determined by the Robustness Factor) will new MV LP targets be picked.Clearly, as we increase the Robustness Factor, the controller slows down (move suppression values will go up internally), and the LP solution will stabilize nicely even in the presence of an unrepaired model matrix. The controller will also become more conservative, giving up some of the economic benefits in exchange for higher stability.ConclusionAspen DMC3 provides the control engineer with a set of modes and analog parameters that modify the behavior of the controller based on the lifecycle needs. Adaptive Process Control provides a complete range of economic tradeoffs for managing step testing and model construction. The LP tuning feature of Aspen DMC3 provides the same ability to shape the personality of the controller when in optimizing control mode. By adjusting the LP tuning factor, the controller aggressiveness can be set by the engineer to mitigate the risk of poor model conditioning.Engineers now have the ability to configure a controller personality to address specific issues. Binary choices are replaced with analog choices, giving fine control over the technical and economic tradeoffs involved in APC. Aspen DMC3 gives users the ability to shape the economics of APC solutions to meet business objectives. Users can now modify the behavior of the controller to fit the needs of any phase of the lifecycle.echAspenT ech is a leading supplier of software that optimizes process manufacturing—for energy, chemicals, engineering and construction, and other industries that manufacture and produce products from a chemical process. With integrated aspenONE®solutions, process manufacturers can implement best practices for optimizing their engineering, manufacturing, and supply chain operations. As a result, AspenT ech customers are better able to increase capacity, improve margins, reduce costs, and becomemore energy efficient. T o see how the world’s leading process manufacturers rely on AspenT ech to achieve their operational excellence goals, visit .© 2014 Aspen T echnology, Inc. AspenT ech®, aspenONE®, the Aspen leaf logo, the aspenONE logo, and OPTIMIZE are trademarks Worldwide HeadquartersAspen T echnology, Inc.200 Wheeler RoadBurlington, MA 01803United Statesphone: +1–781–221–6400fax: +1–781–221–6410info@Regional HeadquartersHouston, TX | USAphone: +1–281–584–1000São Paulo | Brazilphone: +55–11–3443–6261Reading | United Kingdomphone: +44–(0)–1189–226400 Singapore | Republic of Singapore phone: +65–6395–3900Manama | Bahrainphone: +973–17–50–3000For a complete list of offices, please visit。

Kinetix 7000高功率伺服驱动器固件修订版1.101-1.107说明书

Kinetix 7000高功率伺服驱动器固件修订版1.101-1.107说明书

Release NotesKinetix 7000 High-power Servo Drives, Firmware Revisions 1.101…1.107Catalog Numbers 2099-BM06-S, 2099-BM07-S, 2099-BM08-S, 2099-BM09-S, 2099-BM10-S,2099-BM11-S, 2099-BM12-SAbout This PublicationThese release notes describe hardware and software enhancements, anomalies, restrictions, and other usage considerations for Kinetix®7000 drive firmware revisions 1.101…1.107 when used with RSLogix ™5000 software or the Studio 5000 Logix Designer™ application.The -S at the end of the catalog number indicates a Kinetix 7000 high-power servo drive with the safe-off feature.Topic Page About This Publication 1 Enhancements 2Corrected Anomalies 2 Known Anomalies 3Restrictions 4Additional Resources4IMPORTANTFor Kinetix 7000 safe-off (SO) connector wiring and troubleshooting information, refer to the Kinetix Safe-off Feature Safety Reference Manual, publication GMC-RM002.IMPORTANTUsing the Kinetix 7000 drives with the Motor Feedback Noise fault-action set to Status Only can result in absolute position offset due to the loss of feedback information. For applications requiring precise absolute positioning or axis synchronization, verify the Motor Feedback Noise Status Only setting. IMPORTANTIf you currently use a custom RSLogix 5000 motion database in RSLogix 5000 software, version 12…16, you need an updated motion database to use RSLogix 5000 software or the Logix Designer application. To initiate the process of updating the database, email your reque st to ***************************.com . If your current database includes non-Rockwell Automation motors, include any prior technical support case numbers.2 Kinetix 7000 High-power Servo Drives, Firmware Revisions 1.101...1.107EnhancementsThese enhancements correspond to Kinetix 7000 drive firmware revisions 1.104 and 1.107.Table 1 - Enhancements with Revision 1.107Table 2 - Enhancements with Revision 1.104Corrected AnomaliesThese corrections apply to firmware revisions 1.101…1.107.Table 3 - Corrected Anomalies with Revision 1.107Table 4 - Corrected Anomalies with Revision 1.106Cat. No.Enhancements2099-BM06-S, 2099-BM07-S, 2099-BM08-S, 2099-BM09-S, 2099-BM10-S, 2099-BM11-S, 2099-BM12-SAdded detection of motor movement when the Stegmann encoder is read during initialization of the position and commutation variables. If motor movement is excessive during these times (typically occurring at powerup, sercos ring phase-up, or during a fault reset), an E31 fault is generated.Lgx00145274Added support for detecting when a motor has changed, so that absolute positioning applications can programmatically detect when re-referencing of the axis is necessary. When the absolute reference is set by the user, the serial number of the motor is stored into non-volatile memory. Subsequently, upon power up, the serial number of the motor (encoder) is read and compared to the serial number previously stored in non-volatile memory. If the encoder serial numbers match (same motor), the absolute reference flag remains set. If a different serial number is detected, the absolute flag reference is cleared and the reference offsets are set to 0.When updating a drive to an older firmware revision to revision 1.107, the absolute flag reference is cleared.Lgx00097123Cat. No.Enhancements2099-BM06-S, 2099-BM07-S, 2099-BM08-S, 2099-BM09-S, 2099-BM10-S, 2099-BM11-S, 2099-BM12-SSupport for the 2090-K7CK-KENDAT EnDat to Hiperface feedback module has been added for the 2099-BM xx -S drives. IMPORTANT: Use of the 2090-K7CK-KENDAT feedback module requires motion database version 5.14 or later.Setting the Current Low Pass Filter Override IDN (16 bit, P00065) to a value of 1 permits the filter values to be set to any value in the range of 0…8000 radians/second.Cat. No.Description2099-BM06-S, 2099-BM07-S, 2099-BM08-S, 2099-BM09-S, 2099-BM10-S, 2099-BM11-S, 2099-BM12-SThe brake never releases for Hookup test.Lgx00094258The current command filter maximum value is not configurable via IDN.Lgx00095941Cat. No.Description2099-BM06-S, 2099-BM07-S, 2099-BM08-S, 2099-BM09-S, 2099-BM10-S, 2099-BM11-S, 2099-BM12-SThe Kinetix 7000 drive eventually posts an E71 Memory Init fault when attempting a homing operation with the DC bus down if it had previously been up since the last power cycle.Kinetix 7000 High-power Servo Drives, Firmware Revisions 1.101...1.107 3Table 5 - Corrected Anomalies with Revision 1.105Table 6 - Corrected Anomalies with Revision 1.101Known AnomaliesThese known anomalies apply to firmware revisions 1.101…1.107.Cat. No.Description2099-BM06-S, 2099-BM07-S, 2099-BM08-S, 2099-BM09-S, 2099-BM10-S, 2099-BM11-S, 2099-BM12-SThe absolute reference status in the drive is no longer cleared if control power is cycled without the DC bus being present.Cat. No.Description2099-BM06-S, 2099-BM07-S, 2099-BM08-S, 2099-BM09-S, 2099-BM10-S, 2099-BM11-S, 2099-BM12-SThe feedback communication detection was corrected to reduce incorrect auxiliary feedback loss faults.Cat. No.Description2099-BM06-S, 2099-BM07-S, 2099-BM08-S, 2099-BM09-S, 2099-BM10-S, 2099-BM11-S, 2099-BM12-SIf a Motion Axis Home (MAH) command with Mode = Absolute and Sequence = Immediate is executed while the drive is in a faulted state with Regen_PS_OK fault (E111), the absolute reference status is initially set and cleared during the next drive power-up cycle.In a system where the rated current of the drive is less than the rated current of the motor, certain torque attributes (torque limits and motor torque feedback) are incorrect. RSLogix 5000 software assumes that 100% current is always motor rated current, but in the case of a drive limiting the rated current, the values are incorrect.The Test Command and Feedback Hook-up Test fails with a missing feedback error when used on dual-loop configurations.If dual-position servo-loop configuration is selected and auxiliary feedback is set to none, an Encoder Feedback Loss fault (E07) is displayed rather than an Auxiliary Feedback fault (E62) following the drive enable command.When using an induction motor, a program should wait approximately 200 ms after a Motion Servo On (MSO) command before commanding an aggressive move profile. Not doing so could result in an Excess Following Error (E19). Also, Autotune may not produce accurate results. Manual tuning can be necessary. This is due to the time it takes to flux the field on the motor producing full torque.Home to Torque Level in Forward Bi-directional or Reverse Bi-directional mode should reverse direction and move until Homing Torque Above Threshold status is low. Then the process complete (PC) bit should set. However, when the torque level is reached, the PC bit is set and the motor remains at that torque level. If the Peak Torque/Force Limit value is not reduced, the motor remains at the Dynamic Torque-limit value.Allen-Bradley, CompactLogix, ControlLogix, HPK-Series, Kinetix, Rockwell Software, Rockwell Automation, RSLogix, SoftLogix, and Studio 5000 Logix Designer are trademarks of Rockwell Automation, Inc.T rademarks not belonging to Rockwell Automation are property of their respective companies.Rockwell Otomasyon Ticaret A.Ş., Kar Plaza İş Merkezi E Blok Kat:6 34752 İçerenköy, İstanbul, T el: +90 (216) 5698400Publication 2099-RN003F-EN-P - June 2014Supersedes Publication - 2099-RN003E-EN-P - June 2014Copyright © 2014 Rockwell Automation, Inc. All rights reserved. Printed in the U.S.A.RestrictionsThese restrictions apply when using RSLogix 5000 software in conjunction with a 1756-M xx SE (ControlLogix®), 1769-M04SE (CompactLogix ™), or1784-PM16SE (SoftLogix ™) sercos module, and Kinetix 7000 servo drives.Additional ResourcesThese documents contain additional information concerning related products from Rockwell Automation.You can view or download publications at/literature . T o order paper copies of technical documentation, contact your local Allen-Bradley distributor or Rockwell Automation sales representative.Cat. No.Description2099-BM06-S, 2099-BM07-S, 2099-BM08-S, 2099-BM09-S, 2099-BM10-S, 2099-BM11-S, 2099-BM12-SWhen removing an axis association on the Associated Axes tab of the Module Properties dialog box, control power to the drive must be cycled to clear the previous associations. Failing to do so results in the Kinetix 7000 drive reporting a Sercos Ring fault (E38).When changing from a dual-loop configuration (dual-position servo, dual-command servo, auxiliary dual-command servo, and dual-command/ feedback servo) to a single-loop configuration (position servo, auxiliary position servo, velocity servo, and torque servo), control power to the drive must be cycled to clear out the previous loop-configuration setting. Failing to do so results in the Kinetix 7000 drive reporting an Auxiliary Feedback fault (E62) when the auxiliary feedback device is removed.When using a dual-loop configuration, the resolution units setting (Rev, Inch, and Millimeter) on the Motor Feedback and Aux Feedback tabs of the Axis Properties dialog box must be the same.After issuing a Set System Variable (SSV) on a drive parameter, wait at least 3 ms after the ConfigUpdateComplete bit is set before acting on the result of the setting.The auxiliary encoder channel does not generate a marker from any sine/cosine device, including SRS/SRM feedback. Setting the low-pass output filter bandwidth to a value greater than 3183Hz causes a configuration error when downloaded. An E19 or E05 fault can occur if a Motion Servo On (MSO) command is executed when the motor shaft is still rotating.When in the Position Servo mode, the Kinetix 7000 drive does not execute a Motion Axis Jog command above 80 revolutions per second to a Bulletin 8720SM or HPK-Series ™ induction motor.Resource Description Kinetix 7000 High Power Servo Drives Installation Instructions, publication 2099-IN003Information on installing, setting up with RSLogix 5000 software, applying power, and troubleshooting your Kinetix 7000 drive.Kinetix 7000 High Power Servo Drives User Manual, publication 2099-UM001Detailed mounting, wiring, setting up with RSLogix 5000 software, applying power, and troubleshooting information with an appendix to support firmware upgrades.Home to Torque Level Application Note, publication MOTION-AT001Information on the use and restrictions of the Home to Torque Level feature.。

软件汉化常用术语

软件汉化常用术语

Source Term Translationalternate copy交替复制"Local Computer" Policy本机策略1 1/2 Space 1 1/2 空间1000 Separator千位分隔符16 Shades of Gray16 级灰度2 Sided Operation双面操作24 hour24 小时256 color bitmap256色位图2-button flight yoke w/throttle带方向舵的双按钮式飞行控制器2-button gamepad双按钮式游戏板3 dimensional screen savers三维屏幕保护程序32 bit word machine32 位字的机器386 Enhanced Mode386 增强模式3-D arcade pinball game三维弓形弹球游戏3-D Digitizer三维空间数字化仪3D FlowerBox (OpenGL)三维花盒(OpenGL)3D Flying Objects三维飞行物3D Flying Objects Screen Saver三维飞行物屏幕保护程序3D Game Controller三维空间游戏控制器3D Maze三维谜宫3D Object三维物体3D Pinball三维弹球3D Pipes (OpenGL)三维管道 (OpenGL)3D Text (OpenGL)三维文字 (OpenGL)3D-Bronze3D-Pinball for Windows Windows 三维弹球3D-White3rd-Party第三方512 Byte Max Transfer512 字节最大传送量56K Digital56K 数字式56K Voice56K 语音式8 Bit8 位AaBbYyZz AaBbYyZzAbort终止Abort放弃Abort Process终止过程aborted终止Aborted by the user由用户终止ABORTING即将终止aborting终止About关于Above Limit超出界限Absent无absolute绝对Absolute Colorimetric绝对色度Abstract抽象abstraction抽象AC Power交流电accelerate加速Acceleration加速Accelerator加速器Accept接受Acceptable Security Methods可接受的安全方法accepted接受Accepted Community Name接受社区名称Access访问Access Denied拒绝访问Access door访问入口Access Global Atoms访问通用原子Access Key访问键Access Level访问层次Access Not Specified未指定的访问Access Number访问号码Access Provider访问提供商Access Right访问权利Access Through Share通过共享访问Access Type访问类型Accessed By访问者Accessibility辅助功能Accessibility Feature辅助功能Accessibility Option辅助选项Accessibility Setting辅助功能设置Accessibility Status辅助状态Accessibility Wizard辅助向导Accessible Table可用表格Accessible volume可用卷accessing访问Accessories附件Accessories\\Games附件/游戏Accessories\\Multimedia附件/媒体accommodate适宜accompanying item附属项目according根据Account帐户account balance帐目平衡表Account disabled禁用帐户Account expires帐户过期Account Information Unavailable帐户信息无法使用Account name帐户名Account Operator帐户操作员Account Policy帐户策略account privilege帐户特权Account Restriction帐户限制Account Run Under帐户运行在Account Unknown未知的帐户accumulated积累的accuracy准确Achieved已达到的acquire要求across通过ACS Dead interval ACS 停顿间隔ACS Refresh interval ACS 刷新间隔Action操作Action Menu操作菜单Action required from user用户必需指定操作Actions to take when service fails当服务失败时进行的操作Activate激活Activate Arabic form shaping启动阿拉伯语字体造形Activate as激活方式Activate Content激活内容Activate Shortcut Rules激活快捷方式策略Activate this window激活这个窗口Activates embedded or linked object启动嵌入或链接的对象Activation code活动代码Active激活的Active活动的Active Association活动关联Active Border活动中的边界Active call活动中的调用Active Code Page当前代码页Active Desktop活动桌面Active Desktop Item活动桌面项Active Directory Active DirectoryActive Directory Browser Active Directory 浏览器Active Directory Database and Log Active Directory 数据库和日志文件Active Directory Domains and Trusts Active Directory 域和信任关系Active Directory Schema Active Directory 架构Active Directory Service Interface Error Active Directory 服务界面错误Active Directory Service object Active Directory 服务对象Active Directory Sites and Services Active Directory 站点和服务Active Directory Tree Active Directory 树Active Directory Users and Computers Active Directory 用户和计算机Active Directory Viewer Active Directory 查看器active document活动文档Active Lease有效租约Active Lease活动租约Active Open活动打开Active Option活动选项Active Session活动的会话Active Setup Engine活动安装程序引擎Active Setup Product Update活动安装程序产品更新Active Setup Update活动安装程序更新Active Statements活动的语句Active Title Bar活动标题栏Active Title Bar Text活动标题栏文本Active Users活动用户Active Window活动窗口Active Window Border活动窗口边框Active/Excluded活动的/排除的ActiveMovie ActiveMovieActiveX Control ActiveX 控件ActiveX Controls and Java applets ActiveX 控件和 Java 小程序ActiveX Viewer Not Installed未安装 ActiveX 查看器Activity活动Actual实际Actual size实际大小Adapter适配器Adapter Configuration Wizard适配器配置向导Adapter in Registry注册表中的适配器Adapter Information适配器信息Adapter String适配器字符串Adapter Type适配器类型Add添加Add Adapter添加适配器Add All全部添加Add Another Log View添加另一个日志查看Add Color添加颜色Add Document Type添加文件类型Add Font添加字体Add Form Feed添加换页符Add IME添加 IMEAdd Input Locale添加输入法区域设置Add Key添加键Add Lock添加锁定Add Phone Book Entry添加电话簿项目Add Software添加软件Add Static Mappings添加静态映射Add Sub-Directory添加子目录Add to添加到Add to Domain添加到域Added cost增加成本adding添加addition另外Additional Information其它信息Additional model附加的模型Additional parameter附加参数Address地址Address bar地址栏Address Book通讯簿Address Book Field通讯簿字符域Address Cluster Size地址簇大小Address Database地址库Address Display地址显示Address Expression地址表达式Address family地址系列Address Information地址信息Address of Entry Point入口点地址Address of object对象的地址Address of proxy to use使用的代理地址Address Pool地址池Address Range地址范围Address range for distribution分布地址范围Address Space地址空间Address to use for router solicitation供路由器请求使用的地址Address translations地址翻译Addresses of NIS servers on client's subnet客户子网上的 NIS 服务器地址Addressing寄给Adjust调整Adjust volume调节音量Admin管理员Admin Setup管理员安装程序Admin Trigger管理触发器Admin. status管理状态Administer Print Job系统管理打印工作Administer Print Server系统管理打印服务器Administer Printer系统管理打印机Administration管理Administration Application管理应用程序Administration Limit Exceeded超过管理限制administrative管理administrative account管理帐户Administrative Roles系统管理作用Administrative State系统管理状态Administrative Tools管理工具Administrative Wizards管理向导administratively-defined管理性定义的Administrator管理员Administrator Account管理员帐户Administrator Name管理员名称Administrator Password管理员密码administrator's request管理员请求Admiral海军上将ADODB Error Lookup Service ADODB 错误搜索服务Aduit审计Advance高级Advance Hijri date高级 Hijri 日期Advanced Prediction高级预测advanced security高级安全措施Advanced Settings高级设置Advertise公布Advertise a product locally在本地为一产品作广告Advertise Routes公布路由Advertise Service公布服务Advertisement公布Advertisement lifetime公布寿命Advertisement rate公布速率Advertising router公布路由器Advise建议AFD Networking Support Enviroment AFD 网络支持环境affect影响Affects Multiple DSAs影响到多重 DSAAffinity相似性Afghanistan阿富汗AFP Server AFP 服务器Afrikaans南非荷兰语AFS volume location server AFS 卷位置服务器After Dial Terminal终端拨号之后After dialing (login)拨号后(登录)After you click the Find Now button在单击“开始查找”按钮之后afternoon下午Again再次Age年龄Agent代理Agent failed代理程序失败Agent Name代理程序名Agent status update frequency代理程序轮询状态的更新频率aggregation合计Aggressive过分的Aging老化Aging Interval Multiplier老化间隔倍增器Aileron副翼Aileron Trim副翼调整Airplane Simulation Device飞机模拟设备Alarm警报Alarm Action警报操作Albania阿尔巴尼亚Albanian阿尔巴尼亚语alert报警Alert entry警报项目Alert Legend警报图例Alert Log警报日志alert table警报表Alert with做警报Alerter警报器Alerters警报器Algeria阿尔及利亚Algorithm运算法则Alias别名Alias Dereference Problem别名解除参照问题Alias Problem别名问题Alien Menace外星人威协Aliens Repelled驱逐了外星人Align对齐Align Center居中Align Left左对齐Align Right右对齐Alignment对齐alignment定位All全部All Are Members Of全部隶属于All backup sets所有备份集All controls所有控制All data所有数据all files所有文件All format全部格式All Frames所有帧All frames individually所有单个框All in全部在All instances所有范例All licenses所有许可证All Markers所有标记All Messages所有邮件All objects所有对象All of type全是All Picture Files所有图片文件All ports所有端口All rates所有比率All rates所有价格All Records所有记录All referrals failed全部指示都失败All Rights Reserved保留所有权利All selected files所有已选文件All Standard Rights全部标准权限All subnets are local所有子网均为本地的All tabs所有 Tab 键All types全部类型All words所有单词allocate分配Allocate network number automatically自动分配网络号码Allocating network buffer正在分配网络缓冲区allocation分配Allocation Unit Size分置单位大小allocator分配器allotted分配Allow允许Allow 8-bit characters in headers允许标题使用 8 位字符Allow ACE允许 ACEAllow Anonymous Connections允许别名连接Allow changes immediately允许立即更改Allow Configuration of Object Trustees允许配置对象信任者Allow dynamic update允许动态更新Allow ticket renewal without re-authentication票证续订时不用再重新验证Allowed Clip Percentage所允许剪辑的百分比Allowed times允许时间Alphabetic按字母顺序alphabetic character字母字符alphabetically按字母的already已经Already connected已经连接already exists已存在Already running已在运行中Also search descriptions同时搜索描述Alt packet改变数据包alter变更alter替换altered变更Alternate其它的Alternate候选Alternate driver备用的驱动程序Alternate Erase交替擦除Alternate Function交替功能Alternate keypad mode替换小键盘模式Alternate Location其它位置alternate secutity identity其它的安全识别Alternate Select候选Alternative替换选项alternative-recipient其他接收者Altitude高度AltPin (Alternate RJ-45 wiring)Alt-subject所有主题Always总是Always check spelling before sending发送前必须进行拼写检查Always confirm总是确认Always On Top前端显示Always prompt before auto-dialing必须在自动拨号前提示Always reboot总是重新启动Always replace自动替换Always spool RAW datatype总是后台处理 RAW 数据类型Always suspend一直暂停am上午AM radio AM 广播AM symbol AM 符号American Samoa东萨摩亚amount数量Amount of disk space to use磁盘空间使用总量Amount of Users to Display要显示的用户数Amount Used使用数量Amplifier扩音器An authentication request is being acknowledged.已认可身份验证请求。

present at a concentration of -回复

present at a concentration of -回复

present at a concentration of -回复Present at a concentration of...Chemical substances are often encountered in various forms and concentrations in our everyday lives. From the medications we take to the cleaning products we use, the concentration of these substances plays a crucial role in their effectiveness and safety. In this article, we will delve into the importance of concentration and explore how it impacts different aspects of our lives.To begin with, concentration refers to the amount of a substance present in a given volume or mass of another substance. It is typically expressed as a ratio or a percentage. Concentration plays a significant role in many fields, including chemistry, biology, medicine, and environmental science. Scientists and researchers rely on accurate measurements of concentration to understand the behavior and properties of substances and to develop effective solutions for various problems.In chemistry, concentration is of utmost importance in conducting experiments and determining the chemical properties of substances. Take the example of a chemical reaction between tworeactants. The concentration of each reactant greatly affects the rate at which the reaction occurs. A higher concentration of reactants generally leads to a higher reaction rate due to more frequent collisions between molecules. By altering the concentration, scientists can control the speed and efficiency of chemical reactions.In the field of medicine, the concentration of drugs is a critical factor that directly affects their therapeutic effects. When a medication is ingested, it is absorbed into the bloodstream and distributed throughout the body. The concentration of the drug in the blood determines how effectively it can reach its target site and produce the desired effect. Too low of a concentration may lead to ineffective treatment, while a concentration that is too high can have harmful side effects. Finding an optimal concentration of drugs is crucial to achieving the desired therapeutic outcome while minimizing any potential risks.Another area where concentration matters is in environmental science. Substances like pollutants and toxins can have detrimental effects on ecosystems and human health. Monitoring the concentration of these substances is essential to assess theimpact on the environment and develop strategies for mitigation. By accurately measuring concentrations, scientists can identify sources of pollution, evaluate the risk to organisms, and take appropriate actions to safeguard the environment.Moreover, concentration is a crucial parameter in biological systems as well. In biological research, determining the concentration of biomolecules such as proteins, nucleic acids, and enzymes is essential for understanding their functions and interactions within cells. For instance, the concentration of an enzyme can significantly impact the rate of a biochemical reaction. By knowing the enzyme's concentration, scientists can optimize conditions for maximum activity and study the enzyme's behavior under different concentrations.In conclusion, the concentration of substances is a vital aspect in various fields and applications. From chemistry to medicine and environmental science to biology, accurate measurements of concentration allow scientists to understand and manipulate substances to achieve desired outcomes. Whether it is finding the right drug concentration for effective treatment or determiningthe optimal condition for a chemical reaction, concentration plays a crucial role. With ongoing research and advancements in measurement techniques, the understanding of concentration continues to deepen, leading to improved outcomes and a safer environment.。

四驱车万向传动装置毕业设计

四驱车万向传动装置毕业设计

中华人民共和国教育部大学毕业设计设计题目: 四驱车万向传动装置学生:指导教师:学院:交通学院专业:交通运输类(车辆工程)大学毕业设计任务书论文题目四驱车万向传动装置指导教师专业交通运输类(车辆工程)学生2 1 题目名称:四驱车万向传动装置设计课题内容本题目要求学生利用计算机设计软件完成四驱车万向传动装置的结构设计,包括各十字轴万向节、传动轴的设计以及相应零件的计算、校核。

课题要求1、查阅相关资料,学习使用相关软件。

2、计算参数,设计结构,利用计算机辅助设计软件绘图。

3、编写设计说明书。

4、结构设计合理,图面清晰。

时间安排2010.12.202011.3.13 调研、查阅万向传动装置设计的资料,撰写开题报告,进行毕业实习。

2011.3.14~2011.3.20 开题。

2011.3.21~2011.4.17 计算各项基本数据,绘制草图,利用设计软件绘出零件图及装配图。

2011.4.18~2011.4.28 中期考核。

毕业设计应完成总体设计方案、初步计算及总装配图,提供相应计算结果、方案布置图等材料。

2011.4.28~2011.5.20 完成设计和论文初稿。

2011.5.21~2011.5.24 指导教师审定设计和说明书内容、格式,修改后准备预答辩。

2011.5.25 ~2011.5.30 设计预答辩。

毕业设计应完成所有设计图纸及设计说明书的全部内容,并提供打印稿,指导教师审阅并签字。

2011.5.31 ~2011.6.5 修改设计和说明书,确定最终装配图、文稿,完善内容、格式,制作电子答辩演示稿,完成答辩准备。

2011.6.6 ~2011.6.12 毕业设计、论文答辩。

完成工作量: 参考文献篇数:10 篇以上。

图纸张数:折合0 图纸≥3 张,其中至少含1 张0 图纸。

说明书字数:不低于6000 字。

学科(专业)负责人意见签名:年月日2 1 万向传动装置的设计摘要本设计主要是深入学习和研究万向节与传动轴的结构、功能,同时也为整车装配提供三维图。

On Cognitive Approach to Metaphor

On Cognitive Approach to Metaphor

On Cognitive Approach to MetaphorLi XiangSupervisor:Professor Zhu YueMay, 2002School of Foreign Studies, Anhui UniversityCONTENTS ACKNOWLEDGEMENTS..................................................................ⅱABSTRACT (ⅲ)CHAPTER 1 Introduction (1)CHAPTER2 The traditional inheritance: a general survey (4)2.1 the Aristotelian tradition2.2 Richards, Black, the interaction theoryCHAPTER 3 Theoretical foundations of cognitive approach (11)3.1 Objectivism vs experientialism3.2 Autonomous linguistics vs cognitive linguisticsCHAPTER 4 Cognitive approach to metaphor (17)4.1 Conceptual metaphor4.2 Cognitive mechanism of metaphor4.2.1 Mapping4.2.2 IntegrationCHAPTER 5 Reflections on the cognitive approach (30)5.1 Semantic deviation5.2 Similarity5.3 ContextCHAPTER 6 Conclusion (36)BIBLIOGRAPHYACKNOWLEDGEMENTSI would like to take the opportunity to express my deeply-felt gratitude to the teaching faculty and all my classmates for their advice and help throughout the process of my writing the thesis.Profuse thanks are due to Prof. Zhou Fang-zhu, Prof. Hong Zeng-liu, Prof. Cheng Zheng-fa, Prof. Xiao Shu-hui, Prof. He Gong-jie, and especiallly the deceased Prof. Zhang Zu-wu whose lectures on different subjects provide me with rich knowledge in different fields.My particular thanks go to Prof. Zhu Yue whose masterful handling of linguistics triggers my immense interest, without whose precious guidance, patience, kindness and encouragement, the paper could not have been what it is now.AbstractThis paper first makes a general survey of rhetoric and semantic study of metaphor, indicating that cognitive approach to metaphor has its traditional inheritance. As part of cognitive linguistic study, cognitive approach to metaphor is philosophically grounded on non-objectivist experiential realism or experientialism. The main idea includes Lakoff‟s conceptual metaphor theory, and Fauconnier‟s mental spaces and conceptual blending theory. According to the cognitive approach, metaphor is not to be seen as a purely linguistic phenomenon, but a cognitive phenomenon. The essence of metaphor is understanding and experiencing one kind of thing in terms of another. Our ordinary conceptual system by means of which we live, think and act is fundamentally metaphorical in nature. Metaphor arises from mapping among different cognitive domains, especially the mapping from familiar, easily-understood source domain onto unfamiliar, abstract target domain.Cognitive approach stresses the cognitive nature of metaphor, but because what is focused on is often the so-called dead metaphor, especially Lakoff‟s conceptual metaphors, which are mainly conventional metaphors that have become part of our everyday speech, the identification and comprehension of metaphor have not been clearly explained. The paper stresses that both similarity and dissimilarity between the domains should be taken into consideration in the identification of metaphor. Production of metaphorical meaning must be based on similarity between the two domains. Dissimilarity between the two domains results in semantic deviation on which metaphorical inferences are based. Context, esp. the situational context is very essential in the understanding and interpretation of metaphors because context plays a key role in the specification and differentiation of the source and target domain. Cognitive approach stresses the role of cognitive context, but overrides the importance of situational context, thus its explanatory power is limited.Key words: Cognitive approach, Metaphor, Semantic deviation, Similarity, Dissimilarity, Context中文摘要本篇论文首先对传统的隐喻修辞研究和语义研究作一综述,在此基础上指出隐喻研究的认知观有其历史渊源;隐喻研究作为认知语言学的一部分,以非客观主义的经验现实主义哲学或经验主义哲学作为自己思想和方法论的基础。

k-relevant explanations for constraint

k-relevant explanations for constraint

An operational viewpoint of conflict-sets can be made explicit by rewriting Equation 1 the following way: C ∧
i∈[1..k]\j
3
dci → ¬dcj
(2)
Notice that some special cases may arise. If k < 1, the considered problem is proved to be over-constrained; some constraints need to be removed. If C = ∅, the set of decisions that have been made so far is itself contradictory. This can happen only if no propagation is done after a decision has been made.
k-relevant explanations for constraint programming
Samir Ouis1 , Narendra Jussien1 , and Patrice Boizumault2
´ Ecole des Mines de Nantes 4, rue Alfred Kastler – BP 20722 F-44307 Nantes Cedex 3 – France {souis,jussien}@emn.fr 2 GREYC, CNRS UMR 6072 Universit´ e de Caen, Campus 2, F-14032 Caen Cedex – France boizu@info.unicaen.fr
  1. 1、下载文档前请自行甄别文档内容的完整性,平台不提供额外的编辑、内容补充、找答案等附加服务。
  2. 2、"仅部分预览"的文档,不可在线预览部分如存在完整性等问题,可反馈申请退款(可完整预览的文档不适用该条件!)。
  3. 3、如文档侵犯您的权益,请联系客服反馈,我们会尽快为您处理(人工客服工作时间:9:00-18:30)。

An Aggressive Approach to Parameter Extraction Mohamed H.Bakr,Student Member,IEEE,John W.Bandler,Fellow,IEEE,and Natalia Georgieva,Member,IEEEAbstract—A novel aggressive parameter-extraction(APE) algorithm is presented.Our APE algorithm addresses the optimal selection of parameter perturbations used to increase trust in parameter-extraction uniqueness.The uniqueness of the parameter-extraction problem is crucial especially in the space-mapping approach to circuit design.We establish an appropriate criterion for the generation of these perturbations. The APE algorithm classifies possible solutions for the parameter extraction problem.Two different approaches for obtaining subsequent perturbations are utilized based on a classification of the extracted parameters.The examples include the parameter extraction of a decomposed electromagnetic model of a high-temperature superconductingfilter.The parameter extraction of an empirical model of a double-folded stubfilter is also carried out.Index Terms—Design automation,electromagnetic simulation, microstripfilters,optimization methods,parameter extraction, space mapping,waveguidefilters.I.I NTRODUCTIONP ARAMETER extraction is important in device modeling and characterization.It also plays a crucial role in space-mapping(SM)technology[1]–[3].Optimization approaches to parameter extraction often yield nonunique solutions.In SM optimization,this nonuniqueness may lead to divergence or oscillatory behavior.We present an“aggressive”approach to parameter ex-traction.While generally applicable,the new algorithm is discussed here in the context of SM technology.We assume the existence of a“fine”model that generates the target response and a“coarse”model whose parameters are to be extracted. Several authors have addressed nonuniqueness in parameter extraction.For example,Bandler et al.[4]proposed the idea of making unknown perturbations to a certain system whose parameters are to be extracted.Bandler et al.[5]later suggested that multipoint extraction(MPE)be used to match thefirst-order derivatives of the two models to ensure a global minimum.The perturbations used in that approach are predefined and arbitrary.The optimality of the selection of those perturbations was not addressed.Recently,a recursive Manuscript received March26,1999;revised July12,1999.This work was supported in part by the Natural Sciences and Engineering Research Council (NSERC)of Canada under Grant OGP0007239and under Grant STP0201832, and by the Micronet Network of Centres of Excellence.The work of M.H. Bakr was supported under an Ontario Graduate Scholarship.The work of N. Georgieva was supported under an NSERC Postdoctorate Fellowship.M.H.Bakr and N.Georgieva are with the Simulation Optimization Systems Research Laboratory,Department of Electrical and Computer Engineering, McMaster University,Hamilton,Ont.,Canada L8S4K1.J.W.Bandler is with the Simulation Optimization Systems Research Laboratory,Department of Electrical and Computer Engineering,McMaster University,Hamilton,Ont.,Canada L8S4K1,and is also with the Bandler Corporation,Dundas,Ont.,Canada L9H5E7.Publisher Item Identifier S0018-9480(99)08439-2.MPE technique was suggested by Bakr et al.[3].This approach employs a mapping between the two models to enhance uniqueness.Our algorithm aims at minimizing the number of pertur-bations used in the MPE process by utilizing perturbations that significantly improve the uniqueness in each iteration. Consequently,we designate this as an aggressive parameter-extraction(APE)algorithm.Each perturbation requires an additionalfine-model simulation that could be very central processing unit(CPU)intensive.We classify the different solutions returned by the MPE process and,based on this classification,a new perturbation that is likely to sharpen the result is suggested.II.P ARAMETER E XTRACTIONThe objective of parameter extraction is tofind a set of parameters of a model whose response matches a given set of measurements.It can be formulatedas(1)where,typically from an electromagnetic simulator,at a certainpoint supplies the targetresponse(2)whereis the corresponding perturbation in the fine-model space.Theperturbationsand in this0018–9480/99$10.00©1999IEEEFig.1.Illustration of the SPE procedure.Fig.2.Illustration of the MPE procedure.Fig.3.Illustration of the relationship between the generated sets V(i),thefine-model points x(i)em,and the extracted coarse-model points x e(i)os generated by the APE algorithm.MPE procedure are related byoffine-model points utilizedin MPE isFig.4.The flowchart of the APE algorithm.III.T HE S ELECTIONOFP ERTURBATIONSThe vector of coarse-modelresponses used to match thetwo models is givenby,whereandsuchthat.Otherwise,it is labeled locally nonunique.It was shown in [6]that the local uniqueness condition is equivalent to the condition that the Jacobianof hasrankis the number of parameters.To achieve local uniqueness,it was suggested in the context of system identification [4]that increasing the number of perturbations enhances the possibility that the Jacobianmatrixof becomes full rank.The perturbations suggested in [4]were unidentified perturbations and,thus,result in an increase in the number of the optimizable parameters.However,it was pointed out that the improvement in the rankof outweighs the increase in the number of parameters.In a later work,the idea of using known perturbations to achieve global uniqueness of parameter extraction was introduced [5].By global uniqueness,we mean that there exists only oneminimum,where isthe number of parameters.We suggest aperturbationthat attempts to increase the rank of the Jacobian of the responsesFig.5.The responses of the given fine-model point (o)and the coarse-modelresponse (—)at the point x e (1)os for the 10:1impedancetransformer.Fig.6.The contours of Q (x ;V (1))for the 10:1impedance transformer.corresponding to the augmentedsetatof the coarse-model responses in thenew responsevectorof the responsesin thevectorat thepointwhereresponsesinis the gradient oftheis the corresponding Hessian.The imposed conditionon the perturbation isthat(14)and thevectorandobtains the solution withminimumwhere are the Hessian matrices fortheusing a set of fine-modelpoints(16)is obtained by formulating theLagrangian(a)(b)Fig.7.The fine-model response (o)and the corresponding coarse-model response (—):(a)at the first point and (b)at the second point utilized in the DPE for the 10:1impedancetransformer.Fig.8.The contours of Q (x ;V (2))for the 10:1impedance transformer.It followsthat is an eigenvector of thematrix(20)and(21)whereat this point can be obtainedwhile no information is available about the Hessian at the other locally unique minima that may exist.In such a case,a reasonable assumption is totake,the identity ma-trix or alternativelytakeas the identity matrix in (23).This assumption implies that no information is available about the curvature of the objective function atthe other minima.It followsthatis an eigenvector of thematrix.The perturbation given by (23)is a suggested perturbation in the coarse-model space.The new fine-model point that shouldbe added to thesetwhere is obtained by solving the system of linearequations.(a)(b)(c)Fig.9.The fine-model response (o)and the corresponding coarse-model response (—):(a)at the first point,(b)at the second point,and (c)at the third point utilized in the three-point parameter extraction for the 10:1impedancetransformer.Fig.10.The contours of Q (x ;V (3))for the 10:1impedancetransformer.Fig.11.The HTS filter [9].The scheme that we utilized for the selection of points in (23)is as follows.First,the eigenvalue problem is solved.Theeigenvectorwith the largest eigenvalue in modulusis Fig.12.The fine-model response (o)and the corresponding coarse-model response (—)at the point utilized in the SPE for the HTS filter.Note that only points in the range from 3.967to 4.099GHz were actually used.initially selected as the candidate eigenvector.The suggested perturbation in this caseis(25)whereis rejected if thecondition(27)(a)(b)Fig.13.The fine-model response (o)and the corresponding coarse-model response (—):(a)at the first point and (b)at the second point utilized in the DPE for the HTS filter.Note that only points in the range from 3.967to 4.099GHz were actually used.is tested against the condition (26).If it also fails,we switch to the eigenvector with second largest eigenvalue in modulus and repeat steps (25)–(27).This is repeated until either a perturbation is found such that (26)is not satisfied or all the eigenvectors are exhausted for perturbations oflengthis scaledby,.Initializeandsetcontains the points used for the MPE in theis equal to ,the cardinalityof.3)Apply MPE using thesettoget .4)Thepointis the solution to the MPE problem obtained using theset.5)If the Jacobianofathas full rank,go to Step 4.6)Obtain a newperturbationusing (13),use (24)togetandlet .Set.8)Ifis approaching a limit,stop.10)Obtain a newperturbationusing (23)and use (24)toget.Update .Setfine-model pointsis close enough in terms of some norm to the vector ofextracted parameters obtained usingfine-model points.TABLE IT HE V ARIATION OF THE E XTRACTED P ARAMETERS FOR THE 10:1I MPEDANCET RANSFORMER WITH THE N UMBER OF F INE -M ODEL POINTSFig.3illustrates the relationship between the generatedsets,the fine-modelpoints ,and the extracted coarse-modelpoints.A flowchart of the APE algorithm is shown in Fig.4.The current implementation of the algorithm is in MATLAB.1V.E XAMPLESA.10:1Impedance TransformerThe first example is the well-known 10:1impedance trans-former [8].The parameters for this problem are the character-istic impedance of the two transmissionlines.This point is theoptimal coarse-model design according to the specifications in [8].The two models are matched using the reflection coefficients at 11equally spaced frequencies in the frequencyrangeGHz GHz.The fine-model responseat and the coarse-model response at thepoint are shown in Fig.5.The contoursof(a)(b)(c)Fig.14.The fine-model response (o)and the corresponding coarse-model response (—):(a)at the first point,(b)at the second point,and (c)at the third point utilized in the three-point parameter extraction for the HTS filter.Note that only points in the range from 3.967to 4.099GHz were actually used.TABLE IIM ATERIAL AND P HYSICAL P ARAMETERS FOR THE C OARSE AND F INEM ODELS OF THE HTS FILTERThe fine-model response for every pointin and the coarse response at the corresponding extracted coarse-model point are shown in Fig.7.The contours of this double-point extraction (DPE)are shown in Fig.8.It is clear that there still exist two locally unique ing (23),wehaveare shown in Fig.10.The algorithm terminates TABLE IIIT HE O PTIMAL C OARSE -M ODEL D ESIGN FOR THE HTS FILTERas the termination condition is satisfied.The variation of theextracted coarse-model point withis given in Table I.B.The High-Temperature Superconducting Filter:The fine model for the high-temperature superconducting(HTS)filter [9](Fig.11)is simulated as a whole usingSonnet’s.2The “coarse”model is a decomposed Sonnet version of the fine model.This model exploits a coarser grid than that used for the fine model.The physical parameters of the coarse and fine models are given in Table II.It is required to extract the coarse-model parameters corre-sponding to the fine-model parameters given in Table III.The values in this table are the optimal coarse-model design ob-2em ,Sonnet Software Inc.,Liverpool,NY,1997.(a)(b)(c)(d)Fig.15.The fine-model response (o)and the corresponding coarse-model response (—):(a)at the first point,(b)at the second point,(c)at the third point,and (d)at the fourth point utilized in the four-point parameter extraction for the HTS filter.Note that only points in the range from 3.967to 4.099GHz were actually used.TABLE IVT HE F INE -M ODEL P OINTS U SED IN THE A PE A LGORITHM FOR THE HTS FILTERtained using the minimax optimizer in OSA90/hope 3according to specifications given in [9].We utilize the responses at 15discrete frequencies in the range [3.967GHz,4.099GHz]in the parameter-extraction process.The algorithm first started by applying SPEwherecontains only the point given in the first column of Table IV.Thepointis given in Table V.Fig.12shows the fine-model responseatand the coarse-model responseat .The algorithm detected that this extracted point is a locally unique minimum.A new fine-model point is then generated3OSA90/hopeVersion 4.0,formerly Optimization Systems Associates Inc.,Dundas,Ont.,Canada,now HP EEsof Division,Santa Rosa,CA.TABLE VT HE V ARIATION IN THE E XTRACTED P ARAMETERS FOR THE HTS F ILTER WITHTHE N UMBER OF F INE -M ODEL POINTSTABLE VIT HE O PTIMAL C OARSE -M ODEL D ESIGN FOR THE DFS FILTERby solving the eigenvalue problem (23).A DPE step is thencarried out.Thesetincludes the points given in the second and third columns of Table IV.ThepointisTABLE VIIT HE F INE -M ODEL P OINTS U SEDIN THEA PE A LGORITHMFOR THEDFS FILTERTABLE VIIIT HE V ARIATIONIN THEE XTRACTED P ARAMETERS FOR THE DFSF ILTER WITH THEN UMBER OF F INE -M ODEL POINTSFig.16.The DFS filter [1].given in Table V.Fig.13shows the fine-model responses at the two utilized fine-model points and the responses at the corresponding extracted coarse-model points,respectively.Again,the algorithm detected that the extracted point is locally unique and a new fine-model point is generated and added to the set of points.The same steps were then repeated for three-and four-point parameter extraction.The points utilized are given in Table IV.The results are shown in the fourth and fifth columns of Table V.It is clear that the extracted parameters are approaching a limit.The fine-model responses and the responses at the corresponding extracted coarse-model points for the last two iterations are shown in Figs.14and 15,respectively.Fig.15(a)demonstrates that a good match between the responses of both models over a wider range of frequencies than that used for parameter extraction is achieved.C.Double-Folded Stub FilterWe consider the design of the double-folded stub (DFS)microstrip structure shown in Fig.16[1].Folding the stubs reduces the filter area with respect to the conventional double-stub structure [10].The filter is characterized by five param-eters:,are chosen as optimizationvariables.and the coarse-model response at thepoint .Thealgorithm detected that the extracted parameters are locally unique.A new fine-model point is generated using (23)and added to the set of fine-model points used for the MPE.The algorithm needed nine iterations to trust the extracted coarse-model parameters.The fine-model points utilized are given in Table VII and the extracted coarse-model points are given inTable VIII.Fig.19shows the fine-model responseatand the coarse-model response at thepoint.2438IEEE TRANSACTIONS ON MICROWA VE THEORY AND TECHNIQUES,VOL.47,NO.12,DECEMBER1999Fig.18.The fine-model response (o)and the corresponding coarse-modelresponse (—)at the point x e (1)os for the DFSfilter.Fig.19.The fine-model response (o)and the corresponding coarse-modelresponse (—)at the point x e (9)os for the DFSfilter.Fig.20.The variation of Q (x ;V (i ))for the DFS filter at the point x e (1)os(—3—)and at the point x e (9)os (—o —)with the number of points utilized for parameter extraction.Table VIII shows the large relative change in parametervalues between the first set of extractedparametersand the trusted set ofparameters.If the step taken by any SM optimization algorithmutilizes ,the algorithm would have probably failed.Fig.20shows the changeof,with .The valueofremains almost constant and small in value.On the otherhand,the valueofincreases significantly with each new point added to the set of utilized fine-model points signaling a false minimum.VI.C ONCLUSIONSAn APE algorithm has been proposed.Our APE algorithm addresses the optimal selection of parameter perturbations used to improve the uniqueness of a multipoint parameter-extraction procedure.New parameter perturbations are generated based on the nature of the minimum reached in the previous iteration.We consider possibly locally unique and locally nonunique minima.The suggested perturbations in each of these two cases are obtained either by solving a system of linear equations or by solving an eigenvalue problem.The APE algorithm continues until the extracted coarse-model parameters can be trusted.The algorithm is successfully demonstrated through the parameter extraction of microwave filters and impedance transformers.A PPENDIXLet the twosets.It followsthat(30)However,each gradient in thesetth response at thepointis the corresponding Hessian.It follows that thecondition (30)can be restatedasunknowns (the com-ponentsof).Thereare(33)wherethe(34)whereth componentof thevectorBAKR et al.:AGGRESSIVE APPROACH TO PARAMETER EXTRACTION 2439A CKNOWLEDGMENTThe authors thank Sonnet Software Inc.,Liverpool,NY,formakingavailable for this work.The authors also thank HP EEsof,Santa Rosa,CA,for making HP HFSS and HP Empipe3D available.R EFERENCES[1]J.W.Bandler,R.M.Biernacki,S.H.Chen,P.A.Grobelny,and R.H.Hemmers,“Space mapping technique for electromagnetic optimization,”IEEE Trans.Microwave Theory Tech.,vol.42,pp.2536–2544,Dec.1994.[2]J.W.Bandler,R.M.Biernacki,S.H.Chen,R.H.Hemmers,and K.Madsen,“Electromagnetic optimization exploiting aggressive space mapping,”IEEE Trans.Microwave Theory Tech.,vol.43,pp.2874–2882,Dec.1995.[3]M.H.Bakr,J.W.Bandler,R.M.Biernacki,S.H.Chen,and K.Madsen,“A trust region aggressive space mapping algorithm for EM optimiza-tion,”IEEE Trans.Microwave Theory Tech.,vol.46,pp.2412–2425,Dec.1998.[4]J.W.Bandler,S.H.Chen,and S.Daijavad,“Microwave devicemodeling using efficient `1optimization:A novel approach,”IEEE Trans.Microwave Theory Tech.,vol.MTT-34,pp.1282–1293,Dec.1986.[5]J.W.Bandler,R.M.Biernacki,and S.H.Chen,“Fully automated spacemapping optimization of 3D structures,”in IEEE MTT-S Int.Microwave Symp.Dig.,San Francisco,CA,1996,pp.753–756.[6]J.W.Bandler and A.E.Salama,“Fault diagnosis of analog circuits,”Proc.IEEE,vol.73,pp.1279-1325,Aug.1985.[7]R.Fletcher,Practical Methods of Optimization,2nd ed.New York:Wiley,1987.[8]J.W.Bandler,“Optimization methods for computer-aided design,”IEEE Trans.Microwave Theory Tech.,vol.MTT-17,pp.533–552,Aug.1969.[9]J.W.Bandler,R.M.Biernacki,S.H.Chen,W.J.Gestinger,P.A.Grobelny,C.Moskowitz,and S.H.Talisa,“Electromagnetic design of high-temperature superconducting filters,”Int.J.Microwave Millimeter-Wave Computer-Aided Eng.,vol.5,pp.331–343,Sept.1995.[10]J.C.Rautio,private communication,1992.[11] C.S.Walker,Capacitance,Inductance and Crosstalk Analysis.Nor-wood,MA:Artech House,1990.[12]M.Kirschning,R.Jansen,and N.Koster,“Measurement and computer-aided modeling of microstrip discontinuities by an improved resonator method,”in IEEE MTT-S Int.Microwave Symp.Dig.,Boston,MA,1983,pp.495–497.Mohamed H.Bakr (S’98)was born on November 7,1969.He received the B.Sc.degree (with distinc-tion)in electronics and communications engineering and the Master’s degree in engineering mathematics from Cairo University,Cairo,Egypt,in 1992and 1996,respectively,and is currently working toward the Ph.D.degree at McMaster University,Hamilton,Ont.,Canada.In October 1992,he joined the Department of Engineering Mathematics and Physics,Faculty of Engineering,Cairo University.In September 1996,he joined the Department of Electrical and Computer Engineering,McMas-ter University.His research is performed in the Simulation Optimization Systems Research Laboratory.He is interested in optimization methods,computer-aided design and modeling of microwave circuits,and neural network applications.Mr.Bakr has held the Ontario Graduate Scholarship (OGS)for two consecutive years.John W.Bandler (S’66–M’66–SM’74–F’78),for photograph and biography,see this issue,p.2426.Natalia Georgieva (S’93–M’97)received the Diploma in Engineering degree in electronics from the Technical University of Varna,Varna,Bulgaria,in 1989,and the Doctor of Engineering degree from the University of Electro-Communications,Tokyo,Japan,in 1997.From 1997to 1998,she was a Post-Doctoral Fellow in the Department of Electrical and Computer Engineering,Dalhousie University,Halifax,N.S.,Canada,where she was involved in teaching and research projects concerning time-domain electromagnetic (EM)field simulation and modeling of RF/microwave multilayer passive structures,printed circuit boards,and printed antennas.In May 1998,she joined the Simulation Optimization Systems Research Laboratory,McMaster University,Hamilton,Ont.,Canada.In 1999,she joined the Department of Electrical and Computer Engineering,McMaster University,as an Assistant Professor.Her research interests include numerical techniques for full-wave electromagnetic analysis and modeling as well as the implementation of efficient optimization algorithms to microwave design problems.。

相关文档
最新文档