System and method for optimization of a circuit breaker mechanism

Information

  • Patent Grant
  • 6496347
  • Patent Number
    6,496,347
  • Date Filed
    Wednesday, March 8, 2000
    24 years ago
  • Date Issued
    Tuesday, December 17, 2002
    22 years ago
Abstract
A system that implements a design process having a plurality of sub-processes each having a plurality of sub-steps. The system includes an independent application for implementing the design process. A series of independent sub-process applications each implements one sub-process of the design process. A communications path provides for communications between the design process and each of the sub-process applications. The communications path also provides for communications between each of said plurality of sub-processes. An application library containing a plurality of executable applications is accessible by the design process and sub-processes to access and execute the plurality of application tools.
Description




BACKGROUND OF THE INVENTION




The invention relates to a system for implementing a design for six sigma (DFSS) process. For any application (business, manufacturing, service, etc.), the sigma value is used to indicate variability. A sigma quality level indicates how well a process is performing. The higher the sigma value, the better the output. Sigma measures the capability of the process to perform defect-free-work, wherein a defect is synonymous with customer dissatisfaction. With six sigma the common measurement index is defects-per-unit where a unit can be virtually anything—a component, a piece part of a jet engine, an administrative procedure, etc. The sigma value indicates how often defects are likely to occur. As sigma increases, customer satisfaction goes up along with improvement of other metrics (e.g., cost and cycle time).




The six sigma methodology has been implemented for specific applications such as semiconductor manufacturing. However, a drawback to these specific applications is that there is a lack of flexibility to allow for the existing implementation to be applied to other applications, such as the manufacturing of a product having multiple operations, each of which affects the performance of another operation.




Moreover, the performance of such operations are sometimes customer sensitive and the performance of one operation is sometimes improved at the expense of the performance of another operation.




BRIEF SUMMARY OF THE INVENTION




An exemplary embodiment of the invention is a system for implementing a design for six sigma process having a plurality of sub-processes each having a plurality of sub-steps. The system includes an independent main application for implementing the design for six sigma process. A series of independent sub-process applications each implements one sub-process of the design for six sigma process.











BRIEF DESCRIPTION OF THE DRAWINGS





FIGS. 1 and 2

are a flowchart illustrating the circuit breaker mechanism optimization process that may be implemented by the present invention;





FIG. 3

is a block diagram of the system for implementing a design for six sigma process;





FIG. 4

is a block diagram of a system utilizing the design for six sigma process illustrated in

FIG. 3

; and





FIG. 5

is a block diagram of a design of experiment process.











DETAILED DESCRIPTION OF THE INVENTION




Using six-Sigma techniques, a series of transfer functions are developed for a circuit breaker mechanism under different modes of operation. These series of equations are then solved simultaneously to provide an optimal circuit breaker mechanism design.




Circuit breaker mechanisms are operated in several different modes. For example, on/off, off/on, trip and reset are just a few of the operational modes anticipated for a circuit breaker mechanism. In designing the mechanism, the engineer has to balance the many different customer requirements to achieve the desired performance.




Many times these requirements are contradictory, for example, if the customer requires a high withstand rating, but still desires low handle forces, one of the ways to increase the withstand force in a circuit breaker mechanism is to increase the contact pressure, however, this requires a stronger mechanism spring which in turn increases the circuit breaker handle forces. Thus, and in order to increase the withstand rating (a desired outcome) the required closing force is increased (an undesired outcome).




Accordingly, and in order to meet one of the customer's desired performances, the other one of the customer's requirements may not be met. Therefore, and in order to provide an optimal design, the operational parameters of each interdependent function must be so simultaneously.




Referring now to

FIG. 1

, a flowchart


10


illustrates the optimization process of the instant application. In an exemplary embodiment, a first step


12


identifies the mechanism actions which are to be optimized by the process of the instant application.




In an exemplary embodiment, step


12


identifies four actions to be optimized, 1) circuit breaker mechanism closing from an off position to an on position, 2) circuit breaker mechanism opening from an on position to an off position, 3) circuit breaker tripping function and 4) circuit breaker reset function. Of course, and as an application may require, is contemplated that the number of actions to be optimized may vary.




A second step


14


identifies desired output parameters of each action to be optimized.




For example, the output parameters for closing are E


closing


, Torque


closing


and Force


handle


. For opening, the desired parameters are Force


handle


and for Tripping the desired parameters are Opening Time


contact arm


. For Reset the desired parameters are Force


handle


and Latch Engagement Force


latch


. Accordingly, the desired value for each of these output parameters must be determined.




A third step


16


identifies the input variables that will affect the output variables of step


14


. Again, the input variables for Closing, Opening, Tripping and Reset are identified. Based upon this information a plurality of steps


18


create Design of Experiment (DOE) tables for Closing, Opening, Tripping and Reset respectively.




Once completed, another plurality of steps


20


performs a mechanism simulation through the values of the entire Design of Experiment table corresponding to closing, opening, tripping and reset.




A plurality steps


22


each performs a polynomial fit for each input variable (step


16


) to form a transfer function for each Closing, Opening, Tripping and Reset input variables. The results of each step


22


is inputted into a step


24


which determines how each transfer function is to be optimized (i.e. maximum, nominal and minimum). In addition, goals are set for each parameter and the transfer functions are prioritized.




A step


26


solves all of the transfer functions simultaneously to determine the optimal mechanism parameters. Step


26


includes sub-steps


28


-


32


. Step


28


solves the transfer functions simultaneously. Once completed, an initial guess for each variable is made by step


30


and a final step


32


uses a computer algorithm or program such as Multi.xls or a similar program to solve the equations.




Final step


32


now provides the performance of a circuit breaker mechanism design in accordance with the desired output parameters identified in step


14


. This output is now analyzed for compliance with a desired range and if acceptable, the process is repeated.




The analysis process of the instant application involved a multidimensional optimization problem characterization and solution offering process for parameters of certain circuit breaker mechanisms. Such parameters include, and are not limited to the following: handle forces; closing energy; torque; latch force; contact arm velocity; and trip time. These parameters were identified as CTQs or critical to quality. The inherent qualities and interdependency of these CTQ's requires simultaneous optimization of the CTQs in order to provide an ideal final design.




In an exemplary embodiment, a series of analytical full factorial design of experiments (DOEs) with parameters affecting each of the CTQs is performed utilizing a dynamic simulator software package Working Model. In an exemplary embodiment, there are six CTQs. Of course, it is contemplated that the method of the instant application may be applied to applications other than circuit breaker designs having a higher or lower amount of CTQs.




The resulting analysis of variance (ANOVA) produced six transfer functions which are then simplified to “reduced models” which incorporate only the larger magnitude sensitivity coefficients.




These six equations were then optimized to target values via the multiple response optimization tool MULTIR.xls. Accordingly, various possible local optimal solutions were translated from coated values to natural (actual) values for use in design specifications.




The output parameters are defined for each mode (opening, closing, tripping and reset), steps


12


and


14


. The variables, which affect these parameters, are determined for each output (step


16


) and a series of screening DOE's are performed to eliminate any variables (steps


18


-


22


) that are not significant to the output parameter. Once the variables are finalized, a full factorial simulation DOE is performed for each mechanism operation mode. The use of DOE techniques is particularly important as it takes into consideration the second and third (occasional fourth) order interactions between the variables.




For purposes of this design, a script was written that allowed communication between the dynamic simulator and a DOE table in Excel. The values were pulled from the Excel table, the simulation was run, and the outputs were automatically transferred back to Excel. In this fashion, a large number of DOE runs were executed in an automated fashion.




The data generated from the DOE's is analyzed using a statistical analysis such as Minitab to determine the transfer function coefficients. Once the transfer functions were generated, variability of each parameter can be determined using Monte Carlo techniques. The final equations are then solved.




Referring now to

FIG. 3

, a flowchart


100


illustrates a design for six sigma (DFSS) process that may be implemented using an exemplary embodiment of the instant application.




The overall DFSS process of

FIG. 3

can be divided into four sub-processes indicated as Identify, Design, Optimize and Validate. Each sub-process utilizes a plurality of sub-steps. The Identify sub-process includes sub-steps


102


and


104


which are entitled identify customer/product requirements and identify technical requirements (CTQ variables) and limits, respectively. These sub-processes relate to steps


12


and


14


of FIG.


1


.




The Design sub-process includes sub-steps


106


-


112


, which are entitled: Formulate Concept Design; Identify Potential Risks; For Each CTQ, Identify Design Parameters; and Find Critical Design Parameters and Their Influence on the CTQ (Transfer Functions), respectively. These sub-steps relate to step


16


of FIG.


1


.




The Optimize sub-process includes sub-steps


114


-


126


. Steps


120


and


122


relate to step


24


of FIG.


2


.




The Validate sub-process includes sub-steps


128


-


134


, which relate to steps


18


,


20


,


22


and


26


-


32


of

FIGS. 1 and 2

. The DFSS process shown in

FIG. 3

is useful for improving the process of designing a product or procedure. The invention can also be applied to other six sigma processes such as the Measure, Analyze, Improve and Control (MAIC) process used for improving processes (such as manufacturing processes or business processes). The invention is a system for implementing a design for six sigma process and may be used with other six sigma processes or similar processes.





FIG. 4

is a block diagram of a system for implementing a DFSS process in an exemplary embodiment of the invention. To implement the DFSS process in a generic manner, a number of stand-alone applications


200


,


202


,


204


,


206


and


208


are used. Each application is independent and can be executed or modified without interaction with other applications. Each application can be saved independently and re-used and can communicate with other applications over a communication path


212


. As will be described in more detail below, each application also has access (via communication path


212


) to a plurality of tools stored in a tool library


210


.




Main application


200


controls implementation of the overall DFSS process shown in

FIGS. 1-3

The main process application


200


can launch each of the sub-process applications


202


,


204


,


206


and


208


. The Identify sub-process application


202


implements steps


102


-


104


shown in

FIGS. 1-3

. The Design sub-process application


204


implements steps


106


-


112


shown in

FIGS. 1-3

. The Optimize sub-process application


206


implements steps


114


-


126


shown in

FIGS. 1-3

. The Validate sub-process application


208


implements steps


128


-


134


shown in

FIGS. 1-3

. The main process application


200


and the sub-process applications


202


-


208


are designed to communicate with each other over communication path


212


. The main application


200


and sub-process applications


202


-


208


can also access tools in tool library


210


over communications path


212


. The communications path


212


interconnects all the components of the system and allows the user to independently access only the portions that are needed for a particular task. Tools in tool library


210


can also access other tools through communications path


212


. It is understood that

FIG. 4

is an exemplary embodiment and other configurations may be used. For example, the number and types of stand-alone applications may be varied.




The main process application


200


and each sub-process application


202


-


208


can access and execute tools contained in a tool library


210


. Tool library


210


contains a variety of tools useful in implementing the DFSS process. Tool library


210


includes common engineering tools such as ANSYS (finite element tool), Minitab (general-purpose statistical tool), Working Model (general purpose rigid-body dynamic simulator) and Saber (electrical/electronic tool), as well as statistical tools and methods such as Quality Function Deployment (QFD), Failure Mode and Effect Analysis (FMEA), Design of Experiments (DOE), Monte-Carlo (MC) and many other tools. The QFD tool helps the user select critical-to-quality (CTQ) variables. The FMEA tool allows the user to perform a failure mode and effect analysis to identify major problems and risks associated with a given design. Each application also includes an automatic experimentation capability that allows the user to enter data in either a manual mode or an automatic mode. The automatic mode allows for easy integration of various engineering tools and also allows the user to automate repetitive processes and tasks.





FIG. 5

illustrates the DOE process. The DOE tool can be launched, for example, from step


110


of

FIG. 3

to screen design parameters or from step


114


. Accordingly, an individual executes one of the applications


200


-


208


and accesses the DOE tool in tool library


210


.

FIG. 5

shows the DOE process. A first step selects the critical to quality (CTQ) parameters. The CTQs identify features of the product that should be present in order to meet customer requirements. A number of key control parameters (KCPs) are identified as having an effect on CTQs. The designs are then selected and the experiments are run. The results are analyzed and the process is repeated until a satisfactory result is obtained. The DOE process is itself a process, and can have sub-processes, sub-steps, etc. It can also have access to other tools in tool library


210


via communications path


212


. Other tools in the tool library


210


may have similar characteristics. Other tools in the tool library are accessed and executed in a similar fashion.




The tool library


210


may also contain custom tools developed by a user or group of users including quality function deployment tools, design generation tools for generating experimental designs, response surface tools for generating transfer functions, optimization tools for optimizing processes and scorecards for defect per unit calculation.




The DOE tool and or process is enhanced by including access to custom designs generated by a particular user. The tools can be customized for a particular user for example, the DOE tool is enhanced by including access to custom designs generated by a particular user (FIGS.


1


and


2


). Additional advantages of the DOE tool include access to a Microsoft access database (containing 300+experimental designs) and designs for large number of parameters. Moreover, the database provides access to special purpose designs such as mixed level and optimal designs (e.g. D-optimal).




Tools for advanced regression techniques may also be included in tool library


210


. These techniques help users determine transfer functions by providing automatic detection for confounding, a search algorithm for maximum R


2


(or adjusted R


2


or any other similar statistic or measure of the quality of fit).




To allow for communication with a variety of tools, each application


200


-


208


has a translator that allows it to communicate and execute various external tools (commercial applications such as ANSYS, Saber, Excel, etc.). The translator provides a standard communications interface to the application that enables other components of the system to access functions of that particular application in a standardized manner. In addition, the Java programming language and platform are used to implement each application


200


-


208


. The object oriented programming (OOP) approach used in the Java programming language allows for easy implementation of the DFSS process. The portability of the Java programming language to various platforms (PC, UNIX, etc.) allows the software to operate under different operating systems. The whole process is modeled in the form of an OOP data structure for easy implementation. A graphical user interface (GUI) is also implemented in the Java programming language in order to allow each application to communicate with other tools such as engineering tools and statistical tools. Communication with Microsoft object linking and embedding (OLE) and with dynamic data exchange (DDE) is provided via the Java programming language to OLE and DDE servers. For example, and as in the present invention, DDE was used in a script to exchange data between the spreadsheet and the dynamic simulator. The system has an open architecture allowing users to write their own translators. Thus, other communications methods (other than OLE, etc.) can be supported by the system.




Each application


200


-


208


used to implement the DFSS process has two main components. A first component of the application is a structured design that models processes and methods. The second component of the application is an unstructured design that serves as a documentation area for designers to document their processes and methods by entering notes, comments, etc. The information in the documentation area may be archived for future reference. Each application may also include an advisor to help the user make educated choices and judgments. Each application may include a database that documents information relevant to the application.




The present invention provides a generic implementation of DFSS process. The generic nature of the invention makes it easily adaptable to other engineering and quality processes such as systems engineering, tolerance analysis, etc. The use of object oriented programming and translators allows each application to communicate over a variety of platforms with a variety of tools.




The present invention can be embodied in the form of computer-implemented processes and apparatuses for practicing those processes. The present invention can also be embodied in the form of computer program code containing instructions embodied in tangible media, such as floppy diskettes, CD-ROMs, hard drives, or any other computer-readable storage medium, wherein, when the computer program code is loaded into and executed by a computer, the computer becomes an apparatus for practicing the invention. The present invention can also be embodied in the form of computer program code, for example, whether stored in a storage medium, loaded into and/or executed by a computer, or transmitted over some transmission medium, such as over electrical wiring or cabling, through fiber optics, or via electromagnetic radiation, wherein, when the computer program code is loaded into and executed by a computer, the computer becomes an apparatus for practicing the invention. When implemented on a general-purpose microprocessor, the computer program code segments configure the microprocessor to create specific logic circuits.




While the invention has been described with reference to a preferred embodiment, it will be understood by those skilled in the art that various changes may be made and equivalents may be substituted for elements thereof without departing from the scope of the invention. In addition, many modifications may be made to adapt a particular situation or material to the teachings of the invention without departing from the essential scope thereof. Therefore, it is intended that the invention not be limited to the particular embodiment disclosed as the best mode contemplated for carrying out this invention, but that the invention will include all embodiments falling within the scope of the appended claims.



Claims
  • 1. A system for optimizing a circuit breaker mechanism, comprising:an application for identifying a plurality of output parameters of said circuit breaker mechanism, said output parameters being identified as candidates for optimization; an application for identifying a plurality of input variables whose value affects the value of said plurality of output parameters; an application for implementing a design of experiments table for each of said input variables, said design of experiments table generating a plurality of output values; an application utilizing each of said plurality of output values and generating a series of values comparable to said plurality of output parameters; and an application for comparing said series of values to said plurality of output parameters, said application determining whether said series of values are within predetermined tolerances.
  • 2. The system as in claim 1, wherein said plurality of output parameters affect the performance of the following circuit breaker actions:i) the closing action of a circuit breaker; ii) the opening action of a circuit breaker; iii) the tripping action of a circuit breaker; and iv) the reset action of a circuit breaker.
  • 3. The system has in claim 2, wherein said plurality of output parameters affect the value of said plurality of output parameters.
  • 4. The system as in claim 1, further comprising:f) an application for defining a range for each output parameter.
  • 5. The system as in claim 4, wherein said range includes a maximum, nominal and minimal value for each output parameter.
  • 6. A method for optimizing a circuit breaker mechanism, comprising:identifying a plurality of functions of said circuit breaker mechanism, said functions being identified as candidates for optimization; identifying a plurality of input variables whose value affects the value of said plurality of functions; implementing a design of experiments table for each of said input variables, said design of experiments table generating a plurality of output values; utilizing each of said plurality of output values and generating a series of values comparable to said plurality of said functions; and comparing said series of values to said plurality of functions; and determining whether said series of values are within a plurality of predetermined tolerances.
  • 7. The method as in claim 6, wherein said plurality of predetermined tolerances includes a maximum, nominal and minimal value.
  • 8. The method as in claim 7, wherein said series of values are within said predetermined tolerances when said series of values are closest to said nominal value.
  • 9. A system for implementing a design process having a plurality of sub-processes each having a plurality of sub-steps, said system comprising:a) an independent application for implementing a design process; b) a plurality of independent sub-process applications, each implementing one sub-process of the design process; c) an application library containing a plurality of executable applications, said design process and said sub-process applications are configured to access and execute said plurality of executable applications; and d) a communications path for interconnecting said design process, said sub-process applications and said application library.
  • 10. A system for optimizing a circuit breaker mechanism, comprising:an application for identifying a plurality of actions of said circuit breaker mechanism, said actions being identified as candidates for optimization; an application for defining a plurality of desired output parameters for each of said plurality of actions; an application for identifying a plurality of input variables for each of said plurality of output parameters, wherein said input variables affect at least one of said plurality of output parameters; an application for creating a design of experiments table for each of said plurality of actions; an application for performing a simulation corresponding to each of said plurality of actions; an application for developing a transfer function for each of said plurality of input variables; an application for optimizing said transfer functions; and an application for simultaneously solving said transfer functions.
  • 11. A system as in claim 10, wherein said actions comprise:a first action corresponding to the closing action of a circuit breaker; a second action corresponding to the opening action of a circuit breaker; a third action corresponding to the tripping action of a circuit breaker; and a fourth action corresponding to the reset action of a circuit breaker.
  • 12. A system as in claim 10, further comprising an application for transferring a first plurality of values from said table to said simulation and for transferring a second plurality of values from said simulation to said table.
  • 13. A system as in claim 10 or 12, wherein said simulation is a full factorial simulation.
  • 14. A system as in claim 10, wherein said transfer function is developed by performing a polynomial line fit for each said input variable.
  • 15. A system as in claim 10, wherein said table is developed using at least one spreadsheet application.
  • 16. A method for optimizing a circuit breaker mechanism, comprising:identifying a plurality of actions of said circuit breaker mechanism, said actions being identified as candidates for optimization; defining a plurality of desired output parameters for each of said plurality of actions; identifying a plurality of input variables for each of said plurality of output parameters, wherein said input variables affect at least one of said plurality of output parameters; creating a design of experiments table for each of said plurality of actions; performing a simulation corresponding to each of said plurality of actions; developing a transfer function for each of said plurality of input variables; optimizing said transfer functions; and simultaneously solving said transfer functions.
  • 17. A method as in claim 16, wherein said actions comprise:a first action corresponding to the closing action of a circuit breaker; a second action corresponding to the opening action of a circuit breaker; a third action corresponding to the tripping action of a circuit breaker; and a fourth action corresponding to the reset action of a circuit breaker.
  • 18. A method as in claim 16, wherein said simulation receives a first plurality of values from said table corresponding to said operation, further wherein said table receives a second plurality of values from said simulation.
  • 19. A method as in claim 16 or 18, wherein said simulation is a full factorial simulation.
  • 20. A method as in claim 16, wherein said transfer function is developed by performing a polynomial line fit for each said input variable.
  • 21. A method as in claim 16, wherein said table is developed using at least one spreadsheet application.
  • 22. A system for optimizing a circuit breaker mechanism, comprising:an application for identifying a plurality of output parameters of said circuit breaker mechanism, said output parameters being identified as candidates for optimization; an application for identifying a plurality of input variables whose value affects the value of said plurality of output parameters; an application for implementing a design of experiments table for each of said actions, said design of experiments table generating a plurality of output values; an application utilizing each of said plurality of output values and generating a series of values comparable to said plurality of output parameters; and an application for comparing said series of values to said plurality of output parameters, said application determining whether said series of values are within predetermined tolerances.
  • 23. A method for optimizing a circuit breaker mechanism, comprising:identifying a plurality of functions of said circuit breaker mechanism, said functions being identified as candidates for optimization; identifying a plurality of input variables whose value affects the value of said plurality of functions; implementing a design of experiments table for each of said actions, said design of experiments table generating a plurality of output values; utilizing each of said plurality of output values and generating a series of values comparable to said plurality of said functions; and comparing said series of values to said plurality of functions; and determining whether said series of values are within a plurality of predetermined tolerances.
US Referenced Citations (172)
Number Name Date Kind
2340682 Powell Feb 1944 A
2719203 Gelzheiser et al. Sep 1955 A
2937254 Ericson May 1960 A
3158717 Jencks et al. Nov 1964 A
3162739 Klein et al. Dec 1964 A
3197582 Norden Jul 1965 A
3307002 Cooper Feb 1967 A
3517356 Hanafusa Jun 1970 A
3631369 Menocal Dec 1971 A
3803455 Willard Apr 1974 A
3883781 Cotton May 1975 A
4129762 Bruchet Dec 1978 A
4144513 Shafer et al. Mar 1979 A
4158119 Krakik Jun 1979 A
4165453 Hennermann Aug 1979 A
4166988 Ciarcia et al. Sep 1979 A
4220934 Wafer et al. Sep 1980 A
4255732 Wafer et al. Mar 1981 A
4259651 Yamat Mar 1981 A
4263492 Maier et al. Apr 1981 A
4276527 Gerbert-Gaillard et al. Jun 1981 A
4297663 Seymour et al. Oct 1981 A
4301342 Castonguay et al. Nov 1981 A
4360852 Gilmore Nov 1982 A
4368144 Preuss et al. Jan 1983 A
4375021 Pardini et al. Feb 1983 A
4375022 Daussin et al. Feb 1983 A
4376270 Staffen Mar 1983 A
4383146 Bur May 1983 A
4392036 Troebel et al. Jul 1983 A
4393283 Masuda Jul 1983 A
4401872 Boichot-Castagne et al. Aug 1983 A
4409573 DiMarco et al. Oct 1983 A
4435690 Link et al. Mar 1984 A
4467297 Boichot-Castagne et al. Aug 1984 A
4468645 Gerbert-Gaillard et al. Aug 1984 A
4470027 Link et al. Sep 1984 A
4479143 Watanabe et al. Oct 1984 A
4488173 McClellan et al. Dec 1984 A
4492941 Nagel Jan 1985 A
4541032 Schwab Sep 1985 A
4546224 Mostosi Oct 1985 A
4550360 Dougherty Oct 1985 A
4562419 Preuss et al. Dec 1985 A
4589052 Dougherty May 1986 A
4595812 Tamaru et al. Jun 1986 A
4611187 Banfi Sep 1986 A
4612430 Sloan et al. Sep 1986 A
4616198 Pardini Oct 1986 A
4622444 Kandatsu et al. Nov 1986 A
4631625 Alexander et al. Dec 1986 A
4642431 Tedesco et al. Feb 1987 A
4644438 Puccinelli et al. Feb 1987 A
4649247 Preuss et al. Mar 1987 A
4658322 Rivera Apr 1987 A
4672501 Bilac et al. Jun 1987 A
4675481 Markowski et al. Jun 1987 A
4682264 Demeyer Jul 1987 A
4689712 Demeyer Aug 1987 A
4694373 Demeyer Sep 1987 A
4710845 Demeyer Dec 1987 A
4717985 Demeyer Jan 1988 A
4733211 Castonguay et al. Mar 1988 A
4733321 Lindeperg Mar 1988 A
4764650 Bur et al. Aug 1988 A
4768007 Mertz et al. Aug 1988 A
4780786 Weynachter et al. Oct 1988 A
4831221 Yu et al. May 1989 A
4870531 Danek Sep 1989 A
4883931 Batteux et al. Nov 1989 A
4884047 Baginski et al. Nov 1989 A
4884164 Dziura et al. Nov 1989 A
4900882 Bernard et al. Feb 1990 A
4910485 Bolongeat-Mobleu et al. Mar 1990 A
4914541 Tripodi et al. Apr 1990 A
4916420 Bartolo et al . Apr 1990 A
4916421 Pardini et al. Apr 1990 A
4926282 McGhie May 1990 A
4935590 Malkin et al. Jun 1990 A
4937706 Schueller et al. Jun 1990 A
4939492 Raso et al. Jul 1990 A
4943691 Mertz et al. Jul 1990 A
4943888 Jacob et al. Jul 1990 A
4950855 Bolonegeat-Mobleu et al. Aug 1990 A
4951019 Gula Aug 1990 A
4952897 Barnel et al. Aug 1990 A
4958135 Baginski et al. Sep 1990 A
4965543 Batteux Oct 1990 A
4983788 Pardini Jan 1991 A
5001313 Leclerq et al. Mar 1991 A
5004878 Seymour et al. Apr 1991 A
5029301 Nebon et al. Jul 1991 A
5030804 Abri Jul 1991 A
5057655 Kersusan et al. Oct 1991 A
5077627 Fraisse Dec 1991 A
5083081 Barrault et al. Jan 1992 A
5095183 Raphard et al. Mar 1992 A
5103198 Morel et al. Apr 1992 A
5115371 Tripodi May 1992 A
5120921 DiMarco et al. Jun 1992 A
5132865 Mertz et al. Jul 1992 A
5138121 Streich et al. Aug 1992 A
5140115 Morris Aug 1992 A
5153802 Mertz et al. Oct 1992 A
5155315 Malkin et al. Oct 1992 A
5166483 Kersusan et al. Nov 1992 A
5172087 Castonguay et al. Dec 1992 A
5178504 Falchi Jan 1993 A
5184717 Chou et al. Feb 1993 A
5187339 Lissandrin Feb 1993 A
5198956 Dvorak Mar 1993 A
5200724 Gula et al. Apr 1993 A
5210385 Morel et al. May 1993 A
5239150 Bolongeat-Mobleu et al. Aug 1993 A
5260533 Livesey et al. Nov 1993 A
5262744 Arnold et al. Nov 1993 A
5280144 Bolongeat-Mobleu et al. Jan 1994 A
5281776 Morel et al. Jan 1994 A
5296660 Morel et al. Mar 1994 A
5296664 Crookston et al. Mar 1994 A
5298874 Morel et al. Mar 1994 A
5300907 Nereau et al. Apr 1994 A
5310971 Vial et al. May 1994 A
5313180 Vial et al. May 1994 A
5317471 Izoard et al. May 1994 A
5331500 Corcoles et al. Jul 1994 A
5334808 Bur et al. Aug 1994 A
5341191 Crookston et al. Aug 1994 A
5347096 Bolongeat-Mobleu et al. Sep 1994 A
5347097 Bolongeat-Mobleu et al. Sep 1994 A
5350892 Rozier Sep 1994 A
5357066 Morel et al. Oct 1994 A
5357068 Rozier Oct 1994 A
5357394 Piney Oct 1994 A
5361052 Ferullo et al. Nov 1994 A
5373130 Barrault et al. Dec 1994 A
5379013 Coudert Jan 1995 A
5424701 Castonguary et al. Jun 1995 A
5438176 Bonnardel et al. Aug 1995 A
5440088 Coudert et al. Aug 1995 A
5449871 Batteux et al. Sep 1995 A
5450048 Leger et al. Sep 1995 A
5451729 Onderka et al. Sep 1995 A
5457295 Tanibe et al. Oct 1995 A
5467069 Payet-Burin et al. Nov 1995 A
5469121 Payet-Burin Nov 1995 A
5475558 Barjonnet et al. Dec 1995 A
5477016 Baginski et al. Dec 1995 A
5479143 Payet-Burin Dec 1995 A
5483212 Lankuttis et al. Jan 1996 A
5485343 Santos et al. Jan 1996 A
D367265 Yamagata et al. Feb 1996 S
5493083 Olivier Feb 1996 A
5504284 Lazareth et al. Apr 1996 A
5504290 Baginski et al. Apr 1996 A
5510761 Boder et al. Apr 1996 A
5512720 Coudert et al. Apr 1996 A
5515018 DiMarco et al. May 1996 A
5519561 Mrenna et al. May 1996 A
5534674 Steffens Jul 1996 A
5534832 Duchemin et al. Jul 1996 A
5534835 McColloch et al. Jul 1996 A
5534840 Cuingnet Jul 1996 A
5539168 Linzenich Jul 1996 A
5543595 Mader et al. Aug 1996 A
5552755 Fello et al. Sep 1996 A
5581219 Nozawa et al. Dec 1996 A
5604656 Derrick et al. Feb 1997 A
5608367 Zoller et al. Mar 1997 A
5777841 Stone et al. Jul 1998 A
5784233 Bastard et al. Jul 1998 A
6253115 Martin et al. Jun 2001 B1
Foreign Referenced Citations (62)
Number Date Country
819 008 Dec 1974 BE
897 691 Jan 1984 BE
12 27 978 Nov 1966 DE
30 47 360 Jun 1982 DE
38 02 184 Aug 1989 DE
38 43 277 Jun 1990 DE
44 19 240 Jan 1995 DE
0 061 092 Sep 1982 EP
0 064 906 Nov 1982 EP
0 066 486 Dec 1982 EP
0 076 719 Apr 1983 EP
0 117 094 Aug 1984 EP
0 140 761 May 1985 EP
0 174 904 Mar 1986 EP
0 196 241 Oct 1986 EP
0 224 396 Jun 1987 EP
0 235 479 Sep 1987 EP
0 239 460 Sep 1987 EP
0 258 090 Mar 1988 EP
0 264 313 Apr 1988 EP
0 264 314 Apr 1988 EP
0 283 189 Sep 1988 EP
0 283 358 Sep 1988 EP
0 291 374 Nov 1988 EP
0 295 155 Dec 1988 EP
0 295 158 Dec 1988 EP
0 309 923 Apr 1989 EP
0 313 106 Apr 1989 EP
0 313 422 Apr 1989 EP
0 314 540 May 1989 EP
0 331 586 Sep 1989 EP
0 337 900 Oct 1989 EP
0 342 133 Nov 1989 EP
0 367 690 May 1990 EP
0 371 887 Jun 1990 EP
0 375 568 Jun 1990 EP
0 394 144 Oct 1990 EP
0 394 922 Oct 1990 EP
0 399 282 Nov 1990 EP
0 407 310 Jan 1991 EP
0 452 230 Oct 1991 EP
0 555 158 Aug 1993 EP
0 560 697 Sep 1993 EP
0 567 416 Oct 1993 EP
0 595 730 May 1994 EP
0 619 591 Oct 1994 EP
0 665 569 Aug 1995 EP
0 700 140 Mar 1996 EP
0 889 498 Jan 1999 EP
2 410 353 Jun 1979 FR
2 512 582 Mar 1983 FR
2 553 943 Apr 1985 FR
2 592 998 Jul 1987 FR
2 682 531 Apr 1993 FR
2 697 670 May 1994 FR
2 699 324 Jun 1994 FR
2 714 771 Jul 1995 FR
2 233 155 Jan 1991 GB
1 227 978 Apr 1986 RU
9200598 Jan 1992 WO
9205649 Apr 1992 WO
9400901 Jan 1994 WO