CN103810366A - Rapid grouping method for precise elements - Google Patents
Rapid grouping method for precise elements Download PDFInfo
- Publication number
- CN103810366A CN103810366A CN201210451990.1A CN201210451990A CN103810366A CN 103810366 A CN103810366 A CN 103810366A CN 201210451990 A CN201210451990 A CN 201210451990A CN 103810366 A CN103810366 A CN 103810366A
- Authority
- CN
- China
- Prior art keywords
- precision element
- grouping
- group list
- precision
- test parameter
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Landscapes
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention belongs to the field of precise instruments for aviation and particularly relates to a rapid grouping method for precise elements. With the adoption of the rapid grouping method for the precise elements, provided by the invention, the automation of a grouping process can be realized. Data can be processed by using a strong computing capacity of a computer, so that the work, which needs to be finished for some hours originally, can be immediately finished; a result can be automatically stored. With the adoption of the rapid grouping method for the precise elements, the precise elements failing to meet the requirements can be randomly replaced, so that the grouping work can be finished in a maximum and optimal manner; an optimal scheme can be rapidly found out through random selection and random replacement by using the strong computing capacity of the computer, so that not only can the human resources can be released, but also the grouping quality and the grouping stability can be improved. Meanwhile, the working efficiency can be greatly improved.
Description
Technical field
The invention belongs to aviation field of precision instruments, particularly relate to a kind of precision element fast grouping method.
Background technology
Along with constantly improving and development of aeronautical product technology, be widely used as the redundance product sensor of system information feedback.Current redundance sensor be single lot sensor by artificial judgment performance quality, several be singlely divided into different combinations by what meet remaining coherence request, these are combined in and carry out general assembly and performance adjustment realizes remaining product function.Whether can realize the factors such as experience that maximized grouping, optimized grouping be limited by grouping personnel, method, working attitude, because artificial grouping process need to be put dozens or even hundreds of form together and be carried out corresponding data and carry out comparing calculation, selecting suitable one group puts aside, all the other forms are being processed equally, until complete.But can not meet grouping while requiring when having more than the single product of expection, the part combination being divided into group need to be upset and redistributes, work repeatedly, inefficiency, success ratio be low, also exists and miscopy, and misunderstands the possibility of miscalculation.
Summary of the invention
In the object of the invention is that all every batch products data are automatically kept at a electronic data file in the time testing, utilize program automatically to complete a kind of precision element fast grouping method of distinguishing combination by certain requirement.
The technical scheme that the present invention takes is: a kind of precision element fast grouping method, comprises the following steps:
Step 1, the precision element that each is processed carry out serial number, and the test parameter of each precision element is input to same form, form and treat group list;
Step 2, from treat group list, first take out from front to back the precision element of n, n is grouping radix;
Step 3, judge whether the test parameter of this n precision element meets allowable tolerance Δ: if the error of the test parameter of this n precision element between is mutually no more than allowable tolerance Δ, meet allowable tolerance Δ, the test parameter of this n precision element is deposited into group list, and at the test parameter for the treatment of to delete in group list this n precision element, enter step 4; If do not meet allowable tolerance Δ, enter step 5:
Step 4, from treat group list, again take out from front to back n precision element, repeating step three is to step 5, until treat the part precision element that all precision elements divide into groups successfully or only residue cannot be divided into groups in group list.
Step 5, from treating that group list chooses at random a precision element and replace at random this n and treat point set of pieces, return to step 3; Until the test parameter of this n precision element meets allowable tolerance Δ, enter step 4.
Described grouping radix n and allowable tolerance Δ are determined concrete numerical value according to the actual requirements.
The advantage that the present invention has and beneficial effect: traditional grouping pairing needs manually to calculate contrast and carries out, by the performance quality of the single sensor of artificial judgment lot, several be singlely divided into different combinations by what meet remaining coherence request.Whether can realize the factors such as experience that maximized grouping, optimized grouping be limited by grouping personnel, method, working attitude, workload is large, and error probability is large, and group result superiority-inferiority is not etc.This grouping process is realized robotization by the present invention.Utilize the powerful computing power of computing machine to process data, make the work that originally need to just can complete in a few hours, complete in moment, and saving result automatically.Undesirable precision element is replaced at random, can be maximized, optimization completes grouping work, utilizes the powerful arithmetic capability of computing machine, adopt and choose at random and replace and can find rapidly preferred plan at random.Not only liberating human resources improves grouping quality simultaneously, divides organizing, stability to improve greatly work efficiency simultaneously.
Accompanying drawing explanation
Fig. 1 is process flow diagram of the present invention.
Embodiment
Below in conjunction with instantiation, the present invention is described in further detail.
Step 1, the precision element that each is processed carry out serial number, and the test parameter of each precision element is input to same form, form and treat group list; The form of this form need to meet the set form that this method requires, and test parameter comprises the needed all parameters of this type product grouping
Step 2, from treat group list, first take out from front to back the precision element of n, " n " is the grouping radix of this type product requirement;
Step 3, judge this just the test parameter of this n precision element whether meet allowable tolerance Δ: all test parameters to this n precision element carry out across comparison, for product reaches best performance, allowable tolerance Δ is done to the suitable Δ that is reduced into according to actual conditions and experience
1, be generally 40%~60% of allowable tolerance Δ.If the error between the test parameter of this n precision element is mutual is no more than allowable tolerance Δ
1, meet allowable tolerance Δ
1, the test parameter of this n precision element is deposited into group list, and at the test parameter for the treatment of to delete in group list this n precision element, enters step 4; If do not meet allowable tolerance Δ
1, enter step 5:
Step 4: again take out from front to back n precision element from treat group list, repeating step three, until treat the part precision element that all precision elements divide into groups successfully or only residue cannot be divided into groups in group list.Cannot divide into groups to be divided into two kinds of situations: situation one, the test parameter between residue precision element differs too large, can not meet allowable tolerance requirement, situation two, the number of residue precision element is less than grouping radix n.
Step 5, from treating that group list chooses at random a precision element and replace at random this n and treat point set of pieces, return to step 3;
Described grouping radix n and require allowable tolerance Δ and actual allowable tolerance Δ
1according to the actual requirements and actual conditions determine concrete numerical value.
Example:
Treat that grouping products has 46 for this batch, the data that each product comprises needs grouping have 6, require one group of 4 production sharing, and the difference of these 4 all corresponding data of product is not more than 30,, sequence number is 2012001~2012046.
Determine now grouping radix Δ n=4, require allowable tolerance Δ=30, actual allowable tolerance Δ
1=15
2012001,2012002,2012003,2012004 numbers are judged, suppose that result is greater than Δ
1, do not meet grouping requirement;
from treat group list, precision element of random taking-up also replaces at random one and repeats previous step, suppose until replace No. 2012001 time with No. 2012006, these combination lattice meet grouping and judge requirement, write group list 2 by 2012002,2012003,2012004, No. 2012006, and these four numberings are deleted from treat group list 1;
again from treat group list, take out 4 precision elements in turn, the judgement of dividing into groups, writes group list 2 by these four numberings if meet point set condition, and these four numberings is deleted from treat group list 1;
repeat above step until residue is numbered 2012001,2,012,042 two and cannot successfully divides into groups;
Table 1 is treated group list
A | B | C | D | Error |
2012002 | 2012003 | 2012004 | 2012006 | 15 |
2012019 | 2012028 | 2012032 | 2012033 | 12 |
2012007 | 2012021 | 2012022 | 2012023 | 16 |
2012026 | 2012029 | 2012031 | 2012037 | 8 |
2012013 | 2012014 | 2012015 | 2012025 | 14 |
2012010 | 2012012 | 2012016 | 2012017 | 10 |
2012011 | 2012020 | 2012024 | 2012027 | 16 |
2012030 | 2012034 | 2012035 | 2012036 | 9 |
2012038 | 2012040 | 2012041 | 2012044 | 14 |
2012039 | 2012043 | 2012045 | 2012046 | 16 |
2012005 | 2012008 | 2012009 | 2012018 | 14 |
Table 2 group list
Table 3 remains list
Claims (2)
1. a precision element fast grouping method, is characterized in that, comprises the following steps:
Step 1, the precision element that each is processed carry out serial number, and the test parameter of each precision element is input to same form, form and treat group list;
Step 2, from treat group list, first take out from front to back the precision element of n, n is grouping radix;
Step 3, judge whether the test parameter of this n precision element meets allowable tolerance Δ: if the error of the test parameter of this n precision element between is mutually no more than allowable tolerance Δ, meet allowable tolerance Δ, the test parameter of this n precision element is deposited into group list, and at the test parameter for the treatment of to delete in group list this n precision element, enter step 4; If do not meet allowable tolerance Δ, enter step 5;
Step 4: again take out from front to back n precision element from treat group list, repeating step three is to step 5, until treat the part precision element that all precision elements divide into groups successfully or only residue cannot be divided into groups in group list;
Step 5, from treating that group list chooses at random a precision element and replace at random this n and treat point set of pieces, return to step 3; Until the test parameter of this n precision element meets allowable tolerance Δ, enter step 4.
2. a kind of precision element fast grouping method according to claim 1, is characterized in that, described grouping radix n and allowable tolerance Δ are determined concrete numerical value according to the actual requirements.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201210451990.1A CN103810366A (en) | 2012-11-12 | 2012-11-12 | Rapid grouping method for precise elements |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201210451990.1A CN103810366A (en) | 2012-11-12 | 2012-11-12 | Rapid grouping method for precise elements |
Publications (1)
Publication Number | Publication Date |
---|---|
CN103810366A true CN103810366A (en) | 2014-05-21 |
Family
ID=50707129
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201210451990.1A Pending CN103810366A (en) | 2012-11-12 | 2012-11-12 | Rapid grouping method for precise elements |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN103810366A (en) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN108734559A (en) * | 2018-05-23 | 2018-11-02 | 北京京东金融科技控股有限公司 | A kind of order processing method and apparatus |
Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101060535A (en) * | 2006-04-21 | 2007-10-24 | 深圳Tcl工业研究院有限公司 | A digital family network equipment automatic grouping method |
CN102184214A (en) * | 2011-05-04 | 2011-09-14 | 东南大学 | Data grouping quick search positioning mode |
CN102254067A (en) * | 2011-07-05 | 2011-11-23 | 重庆大学 | Large-scale grouping optimizing method of parts based on feed characteristic |
CN202167176U (en) * | 2011-01-21 | 2012-03-14 | 聊城博泰电子科技开发有限公司 | BT-FZ assembling test device according to method of grouping |
-
2012
- 2012-11-12 CN CN201210451990.1A patent/CN103810366A/en active Pending
Patent Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101060535A (en) * | 2006-04-21 | 2007-10-24 | 深圳Tcl工业研究院有限公司 | A digital family network equipment automatic grouping method |
CN202167176U (en) * | 2011-01-21 | 2012-03-14 | 聊城博泰电子科技开发有限公司 | BT-FZ assembling test device according to method of grouping |
CN102184214A (en) * | 2011-05-04 | 2011-09-14 | 东南大学 | Data grouping quick search positioning mode |
CN102254067A (en) * | 2011-07-05 | 2011-11-23 | 重庆大学 | Large-scale grouping optimizing method of parts based on feed characteristic |
Non-Patent Citations (6)
Title |
---|
吕盛鸽: "聚类判别法 统计分组的一种新方法", 《统计研究》, no. 4, 31 December 1993 (1993-12-31), pages 66 - 68 * |
李志钧: "微型计算机辅助成组技术——零件编码的检索统计和分组", 《成组技术》, no. 3, 31 December 1985 (1985-12-31), pages 21 - 24 * |
李霁等: "基于W函数的数据分组方法的算法实现", 《科技通报》, vol. 28, no. 5, 31 May 2012 (2012-05-31), pages 32 - 35 * |
莫爱贵: "轴套类零件自动检测和分选技术分析", 《机械》, vol. 29, no. 2, 31 December 2002 (2002-12-31), pages 79 - 81 * |
訾进锋等: "基于自动分组的机器人集中换电极帽工艺", 《2010全国机械装备先进制造技术(广州)高峰论坛论文汇编》, 28 November 2010 (2010-11-28), pages 187 - 190 * |
邢留伟: "K-Means算法在客户细分中的应用研究", 《中国优秀硕士学位论文全文数据库经济与管理科学辑》, no. 4, 15 October 2007 (2007-10-15), pages 145 - 88 * |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN108734559A (en) * | 2018-05-23 | 2018-11-02 | 北京京东金融科技控股有限公司 | A kind of order processing method and apparatus |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN102799486B (en) | Data sampling and partitioning method for MapReduce system | |
CN104239301A (en) | Data comparing method and device | |
CN105550225A (en) | Index construction method and query method and apparatus | |
CN103902544A (en) | Data processing method and system | |
EP1770620A3 (en) | Method for modelling processing procedures | |
WO2014055319A2 (en) | Efficient pushdown of joins in a heterogeneous database system involving a large-scale low-power cluster | |
CN106897409A (en) | Data point library storage method and device | |
CN104991741A (en) | Key value model based contextual adaptive power grid big data storage method | |
CN104281636A (en) | Concurrent distributed processing method for mass report data | |
CN106326005A (en) | Automatic parameter tuning method for iterative MapReduce operation | |
CN103810366A (en) | Rapid grouping method for precise elements | |
CN104036141B (en) | Open computing language (OpenCL)-based red-black tree acceleration method | |
CN107169138B (en) | Data distribution method for distributed memory database query engine | |
CN105550220A (en) | Fetching method and apparatus for heterogeneous system | |
CN109085804A (en) | It is a kind of for electronic product multiplexing factory manufacture process Optimization Scheduling | |
DE102015116036A1 (en) | Distributed real-time computational structure using in-memory processing | |
CN107657050A (en) | One kind is based on " with the one-to-one join of conflation algorithm calculating, one-to-many join " contraposition segmentation parallel method | |
CN105630778A (en) | DB data migration method and system | |
CN107423028A (en) | A kind of parallel scheduling method of extensive flow | |
CN104700435A (en) | Method for compressing layout data by using OASIS (organization for the advancement of structured information standards) graphic arrays | |
CN116578558A (en) | Data processing method, device, equipment and storage medium | |
Jiang et al. | Hierarchical solving method for large scale TSP problems | |
CN105095455A (en) | Data connection optimization method and data operation system | |
US20180129516A1 (en) | Parameter determination device, parameter determination method, and medium | |
CN102253861A (en) | Method for executing stepwise plug-in computation |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
C06 | Publication | ||
PB01 | Publication | ||
C10 | Entry into substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20140521 |
|
WD01 | Invention patent application deemed withdrawn after publication |