CN1300691C - Predicting method for system lock in pattern coordinate design - Google Patents

Predicting method for system lock in pattern coordinate design Download PDF

Info

Publication number
CN1300691C
CN1300691C CNB200510023264XA CN200510023264A CN1300691C CN 1300691 C CN1300691 C CN 1300691C CN B200510023264X A CNB200510023264X A CN B200510023264XA CN 200510023264 A CN200510023264 A CN 200510023264A CN 1300691 C CN1300691 C CN 1300691C
Authority
CN
China
Prior art keywords
grid
locked
user
lock
benchmark
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.)
Expired - Fee Related
Application number
CNB200510023264XA
Other languages
Chinese (zh)
Other versions
CN1645333A (en
Inventor
卜佳俊
陈纯
杨建旭
惠怀海
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Zhejiang University ZJU
Original Assignee
Zhejiang University ZJU
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Zhejiang University ZJU filed Critical Zhejiang University ZJU
Priority to CNB200510023264XA priority Critical patent/CN1300691C/en
Publication of CN1645333A publication Critical patent/CN1645333A/en
Application granted granted Critical
Publication of CN1300691C publication Critical patent/CN1300691C/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Abstract

The present invention discloses a prediction method for system locking in distribution type pattern cooperative design. A prediction method of an expansion locking assembly helps on-line operation users to predict a future operating area, and locks the area in advance. When the locking operation has conflicts, a corresponding conflict-solving strategy is started. The method can help the users to lock the areas in advance in an intelligent way, guarantee the users to fluently design, and prevent the contingent operation conflicts.

Description

The Forecasting Methodology of the system lock in the pattern collaborative design
Technical field
The present invention relates to distributed pattern collaborative design technical field, particularly relate to the Forecasting Methodology of the system lock in a kind of pattern collaborative design based on the Internet.
Background technology
One of 20th century mankind's outstanding achievement computer technology has been brought human society into the information age.Be accompanied by deepening continuously of IT application process, the communication technology, computing machine and network technology merge mutually, have produced a new research field-computer supported cooperative work CSCW (Computer SupportedCooperative Work).
The diversity of group collaboration mode provides abundant content for CSCW research.In the CSCW system, people will communicate (Communication), coordinate (Coordination), cooperate (Collaboration), work in coordination with basic activities such as (Cooperation) around finishing jointly of task.
CSCW have a wide range of applications field and market outlook, the field that CSCW has been applied to has: application, the E-Government of military affairs, industry, synergetic computer Aided Design, office automation and management information system, medical treatment, long-distance education, ecommerce and commerce, trade, finance ...
In the various fields of CSCW research and application, the pattern collaborative design is an important application of distributed collaboration work.Pattern collaborative design based on Internet can make the collaborative design person who is positioned at diverse geographic location use for reference, share other members' knowledge and experience, synchronously same task works are carried out co-operate in real time, work in coordination with and finish design of patterns and making, thereby greatly improve the quality and the efficient of design.
Be locked in and usually be used in the pattern collaborative design system keeping consistency, the use of lock can reduce the number of times that conflict operation takes place greatly.When some users attempt to operate an object, need the exclusive lock of acquisition on this object.For example, move an object, just at first will obtain the lock on this object, this has just guaranteed to have only a user, and promptly Suo owner operates this object, thus the generation that avoids conflict.Lock has different classification by different standards, and common classification has forces lock and optional lock, non-lock immediately and lock immediately, preceding lock and back lock, object lock and zone lock, Subscriber Application Barring Lock and system lock.
Before lock be lock object before to Object Operations.The back lock also is the conflict control lock, before object of operation, does not need the request lock, if conflict takes place, system automatically locks.
Before use in Suo the system, if the operation that locks is finished by the user, if i.e. user's part of attempting edit pattern must be earlier add latching operation to this editor's part, this will certainly increase user's burden, reduces work efficiency.So, need a kind of locking intention that can predictive user, and help the lock strategy of user's automatic lockout.And the intention of the impossible predictive user of traditional locking means.
Summary of the invention
The object of the present invention is to provide a kind of Forecasting Methodology that is used for the system lock of pattern collaborative design.
The technical scheme that the present invention solves its technical matters employing is as follows:
1) master pattern rasterizing
System is divided into m grid with a pattern collaborative design two-dimensional space;
2) initialization locking
Determined to have the user of its system prediction lock, and with this user U kThe position of clicking is a benchmark for the first time, determines user U k' locked ' zone, initial lock operation simultaneously;
3) the benchmark grid of definite expansion
Processing collects user U KOperation information in a n to be locked elementary cell is determined prediction lock direction to be locked according to calculating operation intensity;
The first step is calculated the manipulation strength I of this user on this n elementary cell Ri Uk,
I R i U k = Σ j = 0 n N j R i α j , j ∈ [ 0 , n ] , n ∈ [ 1,2,3 . . . )
I Ri Uk: user U KIn region R iOn manipulation strength
N j RiThe user is in region R iOn, the number of operations on the time slot Timeslot j is represented number of operations with number of clicks,
Time slot length n: determine that by application system promptly Cai Yang object is a n nearest time slot, if the user does not operate then automatic unlocking in n time slot,
α j: the expression weight, near more from the current time, weight is big more;
Second step, these grids that calculated are sorted by manipulation strength, remember respectively after manipulation strength sorts from high to low and be I 1st, I 2nd, I 3rd, I 4th, then obtain new sequence, be designated as respectively: R 1st, R 2nd, R 3rd, R 4th,
The 3rd step, extract the set of benchmark grid, the grid in this set is exactly the basis of expansion, and the grid of these benchmark is used for the grid that predictive user will be operated, and the general principle of choosing the benchmark grid is: one or several grid of selection operation intensity maximum;
4) determine grid to be locked, system adds latching operation
Determine that system prediction locks regional ForecL to be locked sUk RegionPromptly determine the grid set W that system is to be locked, specific practice is to be starting point with the benchmark grid, unblocked grid that will be adjacent with the benchmark grid adds set W, if the new folded grid of grid that adds set W does not have locked, then that these are folded grid also adds set W to be locked, is that grid locks to the element in the set to be locked then.
The present invention compares with background technology, and the useful effect that has is:
The present invention is a kind of intelligence lock based on prediction, its major function is that system adopts expansion locking set predicted method to help its operating area in future of on-line operation user in predicting, and lock this zone in advance, and when locking, there is conflict to take place, just start corresponding conflict-solving strategy.By this lock mechanism, system can be to a certain extent intelligently assisting users lock in advance, thereby guarantee that the user realizes the smooth operation that designs, and prevent contingent operating collision.
(1) intelligent.System predicts automatically the user and locks, and regular hour section automatic unlocking, and can allow the user freely select to adopt system prediction whether to lock, and it is certain intelligent that the system prediction lockset is had.
(2) practicality.Select to lock suitable operating area rightly when the system prediction lock can allow the user begin to operate relievedly, good practicability is arranged through the repetition test proof.
Have system prediction lock to help its locking future operation zone because the user knows, so he can lock a suitable zone relievedly and get final product when beginning to design, rather than seek bigger zone of disposable locking.So both can avoid influencing other user's operation, and also can not influenced the own fluency of operating by other Subscriber Locked in future because of the zone of oneself wanting to operate because user locks a bigger zone (most of idle) in advance.Add access customer after also having guaranteed simultaneously and still can begin new design operation, be unlikely to waste " locking " and cause new user not have operating area or operating area too small owing to other online user.
(3) preventative.Because the system prediction lock is preceding lock mechanism, the therefore effectively generation of pre-anti-collision, and most of conflict can be solved by the mode of system lock with implicit expression, thereby significantly reduces the user causes design time because of conflict waste.
Description of drawings
Fig. 1 is a synoptic diagram of representing the number of operations time slot with number of clicks;
Fig. 2 is that the position that user Uk clicked for the first time during system lock was realized is a benchmark, locks the synoptic diagram of its bottom-right L*L grid;
Fig. 3 is the case 1 of for example middle Step4 of system lock: the synoptic diagram that at first adds R5 and R6;
Fig. 4 is the case 1 of for example middle Step4 of system lock: the synoptic diagram that adds R7 again;
Fig. 5 is the case 2 of for example middle Step4 of system lock: the synoptic diagram that at first adds R5, R6, R7 and R8.
Fig. 6 is the case 2 of for example middle Step4 of system lock: the synoptic diagram that adds R9 and R0 again.
Embodiment
When the distributed pattern collaborative design technology of implementing based on internet (the Internet), lock mechanism is used widely.
Relate to relevant symbolic interpretation in the method:
ForecL sUk: the owner of system prediction lock.
ForecL sUk Orientation: the direction that the system prediction lock is to be locked.
ForecL sUk Region: the zone that the system prediction lock is to be locked.
ForecCoEdL sUk Region: the zone of competing locking after the system prediction conflict each other.
ForecEdL sUk Region: the final ' locked ' zone after the system prediction conflict solves.
L uUx Region: the locked zone of certain user.
L uUx Time: the locked time of certain user.
The specific implementation flow process of system prediction lock is as follows.
The first step: master pattern rasterizing.System is divided into m grid with a pattern collaborative design two-dimensional space.
Second step: initialization locking.
Determine certain Subscriber Application Barring Lock area L uUk RegionWith its system prediction lock ForecL sUk.
The position of clicking for the first time with certain user Uk is a benchmark, locks its 8 grids on every side, determines the ' locked ' zone L of user Uk uUk Region, determined the owner ForecL that its system prediction is locked simultaneously sUk.Algorithm for the purpose of simplifying the description, at this only with bottom-right L*L elementary cell { R 1, R 2, R 3, R 4Carry out initial lock operation for example, as shown in Figure 2.
The 3rd step: determine that system prediction locks direction ForecL to be locked sUk Orientation
Processing collects user U K, the operation information in an above-mentioned L*L elementary cell is determined prediction lock direction ForecL to be locked according to calculating operation intensity sUk Orientation
(1) calculates each grid manipulation strength I Ri Uk
I R i U k = Σ j = 0 n N j R i α j , j ∈ [ 0 , n ] , n ∈ [ 1,2,3 . . . )
I Ri Uk: user U KIn region R iOn manipulation strength.
N j Ri: the user is in region R iOn, the number of operations on the time slot Timeslot j is represented number of operations with number of clicks, time slot is as shown in Figure 1.
The value of n determines that by system promptly Cai Yang object is a n nearest time slot, if do not operate then automatic unlocking with corpse in n time slot.
α j: the expression weight, by α j=2 α J+1Definition, α jAlong the contrary direction linear decrease of coordinate axis.
(2) grid ordering
After obtaining the manipulation strength of L*L grid, these grids are sorted from high to low.With set { R 1, R 2, R 3, R 4Be example, its respective operations intensity is set { I R1, I R2, I R3, I R4.Remember respectively after manipulation strength sorts from high to low and be I 1st, I 2nd, I 3rd, I 4thIf relation is arranged I R 2 > I R 1 > I R 4 > I R 3 , then obtain new sequence: R 2, R 1, R 4, R 3, be designated as respectively: R 1st, R 2nd, R 3rd, R 4th
(3) extract the set of benchmark grid
Grid in this set is exactly the basis of expansion, and the grid of these benchmark is used for the zone (grid) that predictive user will be operated, and the general principle of choosing the benchmark grid is: one or several grid of selection operation intensity maximum.For example:
Figure C20051002326400071
In case determined benchmark grid set, determined that promptly system prediction locks direction ForecL to be locked sUk Orientation
The 4th step: determine that system prediction locks regional ForecL to be locked sUk Region
Determine that system prediction locks regional ForecL to be locked sUk RegionPromptly determine the grid set W that system is to be locked, specific practice is to be starting point with the benchmark grid, and unblocked grid that will be adjacent with the benchmark grid adds set W.If locked set { R 1, R 2, R 3, R 4, then:
1: if the set of benchmark grid is { R 1st, i.e. { R 2, then this moment at first will with R 2Adjacent unblocked { R 5, R 6Add set W, as shown in Figure 3.
Secondly, locked if the new folded grid of grid that adds set W does not have, then that these are folded grid also adds set W to be locked.{ R among Fig. 4 7Be { R 5, R 6Folded there is not a blocked grid, then with { R 7Add and gather W.
Final grid set W to be locked is { R 5, R 6, R 7, will gather W and lock, if lock successfully, add locked set { R 1, R 2, R 3, R 4, obtain set { R 1, R 2, R 3, R 4, R 5, R 6, R 7.
2: if the set of benchmark grid is { R 1st, R 2nd, i.e. { R 2, R 1, then at first will with { R 2, R 1Adjacent unblocked { R 5, R 6, R 7, R 8Add set W, as shown in Figure 5.
Secondly, do not have lockedly if newly add the folded grid of grid of set W to be locked, then that these are folded grid also adds set W to be locked.{ R among Fig. 6 9Be { R 5, R 6Folded there is not a blocked grid, then with { R 9Add and gather W, { R 0Be { R 7, R 8Folded there is not a blocked grid, then with { R 0Add and gather W.
Final grid set W to be locked is { R 5, R 6, R 7, R 8, R 9, R 0, will gather W and lock, if lock successfully, add locked set { R 1, R 2, R 3, R 4, obtain locking set { R 1, R 2, R 3, R 4, R 5, R 6, R 7, R 8, R 9, R 0.
Therefore, this method has been saved the step of Subscriber Locked target, has improved user's work efficiency and has significantly reduced the user causes design time because of conflict waste.

Claims (1)

1. the Forecasting Methodology of the system lock in the pattern collaborative design is characterized in that:
1) master pattern rasterizing
System is divided into m grid with a pattern collaborative design two-dimensional space;
2) initialization locking
Determined to have the user of its system prediction lock, and with this user U kThe position of clicking is a benchmark for the first time, determines user U k' locked ' zone, initial lock operation simultaneously;
3) the benchmark grid of definite expansion
Processing collects user U KOperation information in a n to be locked elementary cell is determined prediction lock direction to be locked according to calculating operation intensity;
The first step is calculated the manipulation strength I of this user on this n elementary cell Ri Uk,
I R i U k = Σ j = 0 n N j R i α j , j ∈ [ 0 , n ] , n ∈ [ 1,2,3 . . . )
I Ri Uk: user U KIn region R iOn manipulation strength
N j Ri: the user is in region R iOn, the number of operations on the time slot Timeslot j is represented number of operations with number of clicks,
Time slot length n: determine that by application system promptly Cai Yang object is a n nearest time slot, if the user does not operate then automatic unlocking in n time slot,
α j: the expression weight, near more from the current time, weight is big more;
Second step, these grids that calculated are sorted by manipulation strength, remember respectively after manipulation strength sorts from high to low and be I 1st, I 2nd, I 3rd, I 4th, then obtain new sequence, be designated as respectively: R 1st, R 2nd, R 3rd, R 4th,
The 3rd step, extract the set of benchmark grid, the grid in this set is exactly the basis of expansion, and the grid of these benchmark is used for the grid that predictive user will be operated, and the general principle of choosing the benchmark grid is: one or several grid of selection operation intensity maximum;
4) determine grid to be locked, system adds latching operation
Determine that system prediction locks regional ForecL to be locked SUk RegionPromptly determine the grid set W that system is to be locked, specific practice is to be starting point with the benchmark grid, unblocked grid that will be adjacent with the benchmark grid adds set W, if the new folded grid of grid that adds set W does not have locked, then that these are folded grid also adds set W to be locked, is that grid locks to the element in the set to be locked then.
CNB200510023264XA 2005-01-10 2005-01-10 Predicting method for system lock in pattern coordinate design Expired - Fee Related CN1300691C (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CNB200510023264XA CN1300691C (en) 2005-01-10 2005-01-10 Predicting method for system lock in pattern coordinate design

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CNB200510023264XA CN1300691C (en) 2005-01-10 2005-01-10 Predicting method for system lock in pattern coordinate design

Publications (2)

Publication Number Publication Date
CN1645333A CN1645333A (en) 2005-07-27
CN1300691C true CN1300691C (en) 2007-02-14

Family

ID=34875817

Family Applications (1)

Application Number Title Priority Date Filing Date
CNB200510023264XA Expired - Fee Related CN1300691C (en) 2005-01-10 2005-01-10 Predicting method for system lock in pattern coordinate design

Country Status (1)

Country Link
CN (1) CN1300691C (en)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN100346341C (en) * 2005-09-16 2007-10-31 浙江大学 Complex locking method in pattern cooperative design
CN100405360C (en) * 2006-06-23 2008-07-23 浙江大学 Adaptive display method for graphic image in cooperative design in pervasive environment
CN100416552C (en) * 2006-06-23 2008-09-03 浙江大学 Region-of-interest prediction method in pattern cooperative design in pervasive environment

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5339389A (en) * 1991-12-31 1994-08-16 International Business Machines Corporation User selectable lock regions
US5526524A (en) * 1993-12-23 1996-06-11 International Business Machines Corporation Method and system for management of locked objects in a computer supported cooperative work environment
US5694544A (en) * 1994-07-01 1997-12-02 Hitachi, Ltd. Conference support system which associates a shared object with data relating to said shared object
US5966512A (en) * 1997-06-05 1999-10-12 International Business Machines Corporation Groupware save operation
US6151020A (en) * 1997-10-24 2000-11-21 Compaq Computer Corporation Real time bit map capture and sharing for collaborative tools
CN1414497A (en) * 2002-11-26 2003-04-30 西安交通大学 Network manufacture cooperative supporting tool
WO2004015897A2 (en) * 2002-08-07 2004-02-19 Global Apparel Network, Inc Multi-user collaboration system and method

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5339389A (en) * 1991-12-31 1994-08-16 International Business Machines Corporation User selectable lock regions
US5526524A (en) * 1993-12-23 1996-06-11 International Business Machines Corporation Method and system for management of locked objects in a computer supported cooperative work environment
US5694544A (en) * 1994-07-01 1997-12-02 Hitachi, Ltd. Conference support system which associates a shared object with data relating to said shared object
US5966512A (en) * 1997-06-05 1999-10-12 International Business Machines Corporation Groupware save operation
US6151020A (en) * 1997-10-24 2000-11-21 Compaq Computer Corporation Real time bit map capture and sharing for collaborative tools
WO2004015897A2 (en) * 2002-08-07 2004-02-19 Global Apparel Network, Inc Multi-user collaboration system and method
CN1414497A (en) * 2002-11-26 2003-04-30 西安交通大学 Network manufacture cooperative supporting tool

Also Published As

Publication number Publication date
CN1645333A (en) 2005-07-27

Similar Documents

Publication Publication Date Title
Bao et al. A novel non-dominated sorting algorithm for evolutionary multi-objective optimization
East Size and foreign policy behavior: a test of two models
Li et al. Two-stage knowledge-driven evolutionary algorithm for distributed green flexible job shop scheduling with type-2 fuzzy processing time
CN1300691C (en) Predicting method for system lock in pattern coordinate design
Talbi et al. A parallel adaptive tabu search approach
Drezner et al. Tabu search model selection in multiple regression analysis
Warnars Mining patterns with attribute oriented induction
CN104933473A (en) City intelligent traffic dispatching method based on variable neighborhood search ant colony algorithm
Sun et al. Research on flexible job-shop scheduling problem based on a modified genetic algorithm
CN109034716A (en) A kind of concurrent locking method of packet-based collaborative editing
CN100346341C (en) Complex locking method in pattern cooperative design
Alzaqebah et al. Self-adaptive bee colony optimisation algorithm for the flexible job-shop scheduling problem
CN1300683C (en) Method for maintaining semantics consistency in figure synergistic design
CN1645380A (en) Machine-tool structure coordinating treatment based on network
Bolaji et al. The effect of neighborhood structures on examination timetabling with artificial bee colony
Akpan Resource smoothing: A cost minimization approach
CN115526417A (en) Multi-unmanned vehicle task allocation method and device, vehicle and storage medium
Yuan et al. A memetic algorithm for the multi-objective flexible job shop scheduling problem
Varela et al. Solving job-shop scheduling problems by means of genetic algorithms
CN1694409A (en) Cooperation perceptive method based on cooperation perceptive intensity Agent mechanism
CN1719775A (en) Method for solving post-problem of dynamic key in pattern design coordinate conference
Yang et al. Solving large-scale TSP using adaptive clustering method
Liu et al. Discrete differential evolution algorithm for the job shop scheduling problem
CN1648858A (en) Semantic keeping method in realizing figure synergistic design based semantic lock
Babrdelbonb et al. Data analysis by combining the modified k-means and imperialist competitive algorithm

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20070214

Termination date: 20160110

CF01 Termination of patent right due to non-payment of annual fee