[go: up one dir, main page]

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
grids
user
locked
lock
grid
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
Anticipated expiration legal-status Critical
Expired - Fee Related legal-status Critical Current

Links

Images

Landscapes

  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

本发明公开了一种图案协同设计中的系统锁的预测方法。本发明的方法是通过采用扩展锁定集合预测法帮助在线操作用户预测其在未来的操作区域,并提前锁定该区域,当锁定操作有冲突发生,则启动相应的冲突解决策略。本方法实现智能地协助用户提前加锁,从而保证用户实现设计的流畅操作,并预防可能发生的操作冲突。

Figure 200510023264

The invention discloses a method for predicting system locks in pattern collaborative design. The method of the present invention helps online operation users predict their future operation area by adopting the extended locking set prediction method, and locks the area in advance, and starts a corresponding conflict resolution strategy when a conflict occurs in the locking operation. The method realizes intelligently assisting the user to lock in advance, thereby ensuring smooth operation of the design by the user and preventing possible operation conflicts.

Figure 200510023264

Description

图案协同设计中的系统锁的预测方法Prediction method of system lock in pattern collaborative design

技术领域technical field

本发明涉及基于因特网的分布式图案协同设计技术领域,特别是涉及一种图案协同设计中的系统锁的预测方法。The invention relates to the technical field of Internet-based distributed pattern collaborative design, in particular to a method for predicting system locks in pattern collaborative design.

背景技术Background technique

20世纪人类的杰出成果之一计算机技术把人类社会带入了信息化时代。伴随着信息化进程的不断深入,通信技术、计算机及网络技术相融合,产生了一个新的研究领域—计算机支持的协同工作CSCW(Computer SupportedCooperative Work)。One of the outstanding achievements of mankind in the 20th century, computer technology has brought human society into the information age. With the continuous deepening of the informationization process, the integration of communication technology, computer and network technology has created a new research field - Computer Supported Cooperative Work CSCW (Computer Supported Cooperative Work).

群体协作方式的多样性为CSCW研究提供了丰富的内容。在CSCW系统中,人们围绕共同完成的任务要进行通信(Communication)、协调(Coordination)、协作(Collaboration)、协同(Cooperation)等基本活动。The diversity of group collaboration methods provides rich content for CSCW research. In the CSCW system, people carry out basic activities such as Communication, Coordination, Collaboration, and Cooperation around the tasks completed together.

CSCW有着广泛的应用领域和市场前景,CSCW已经应用到的领域有:军事、工业、协同计算机辅助设计、办公自动化和管理信息系统、医疗、远程教育、电子商务与商业、贸易、金融的应用、电子政务......CSCW has a wide range of application fields and market prospects. The fields that CSCW has been applied to include: military, industry, collaborative computer-aided design, office automation and management information systems, medical care, distance education, e-commerce and commerce, trade, financial applications, E-government......

在CSCW研究和应用的众多领域中,图案协同设计是分布式协同工作的一个重要应用。基于Internet的图案协同设计可以使位于不同地理位置的协同设计者借鉴、共享其他成员的知识和经验,实时同步对同一个任务作品进行共同操作,协同完成图案的设计和制作,从而极大地提高设计的质量和效率。In many fields of CSCW research and application, pattern collaborative design is an important application of distributed collaborative work. Internet-based pattern collaborative design can enable collaborative designers located in different geographical locations to learn from and share the knowledge and experience of other members, to jointly operate the same task and work synchronously in real time, and to collaboratively complete the design and production of patterns, thereby greatly improving design. quality and efficiency.

锁在图案协同设计系统中常常用来保持一致性,锁的使用能大大降低冲突操作发生的次数。当某一个用户试图操作一个对象/区域时,需要获得在这个对象/区域上的一个排他锁。例如,要移动一个对象,就首先要获得这个对象上的锁,这就保证了只有一个用户,即锁的拥有者操作这个对象,从而避免冲突的产生。锁按不同的标准有不同的分类,常见的分类有强制锁与可选锁,非立即锁与立即锁,前锁与后锁,对象锁与区域锁,用户锁与系统锁。Locks are often used to maintain consistency in pattern collaborative design systems, and the use of locks can greatly reduce the number of conflicting operations. When a user tries to operate an object/area, an exclusive lock on the object/area needs to be obtained. For example, if you want to move an object, you must first obtain the lock on the object, which ensures that only one user, that is, the owner of the lock, operates the object, thereby avoiding conflicts. Locks are classified according to different standards. Common classifications include mandatory locks and optional locks, non-immediate locks and immediate locks, front locks and back locks, object locks and area locks, user locks and system locks.

前锁是在对对象操作之前锁定对象。后锁也叫冲突控制锁,在操作一个对象之前,不需要请求锁,如果冲突发生,系统自动上锁。Front lock is to lock the object before operating on the object. Back lock is also called conflict control lock. Before operating an object, there is no need to request a lock. If a conflict occurs, the system automatically locks it.

在使用前锁的系统中,如果加锁的操作由用户来完成,即用户如果试图编辑图案的一部分,必须先对该编辑的部分进行加锁操作,这势必会增加用户的负担,降低工作效率。所以,需要有一种能够预测用户的锁定意图,并帮助用户自动加锁的锁策略。而传统的锁定方法不可能预测用户的意图。In the system using front lock, if the locking operation is done by the user, that is, if the user tries to edit a part of the pattern, he must first perform the lock operation on the edited part, which will inevitably increase the burden on the user and reduce work efficiency . Therefore, it is necessary to have a locking strategy that can predict the user's locking intention and help the user to lock automatically. And the traditional locking method is impossible to predict the user's intention.

发明内容Contents of the invention

本发明的目的在于提供一种用于图案协同设计中的系统锁的预测方法。The object of the present invention is to provide a method for predicting system locks in pattern collaborative design.

本发明解决其技术问题采用的技术方案如下:The technical scheme that the present invention solves its technical problem adopts is as follows:

1)原始图案栅格化1) The original pattern is rasterized

系统将一个图案协同设计二维空间分割为m个栅格;The system divides a pattern collaborative design two-dimensional space into m grids;

2)初始化锁定2) Initialize the lock

确定了拥有其系统预测锁的用户,并以该用户Uk第一次点击的位置为基准,确定用户Uk的锁定区域,同时初始锁定操作;Determine the user who owns the predictive lock of the system, and use the position of the user U k's first click as a benchmark to determine the locking area of the user U k , and initially lock the operation;

3)确定扩展的基准栅格3) Determine the extended reference grid

处理采集到用户UK在待锁定的n个单位栅格中的操作信息,根据计算操作强度确定预测锁待锁定方向;Process the collected operation information of the user U K in the n unit grids to be locked, and determine the direction of the predicted lock to be locked according to the calculation operation intensity;

第一步,计算该用户在这n个单位栅格上的操作强度IRi UkThe first step is to calculate the user's operation intensity I Ri Uk on the n unit grids,

II RR ii Uu kk == ΣΣ jj == 00 nno NN jj RR ii αα jj ,, jj ∈∈ [[ 00 ,, nno ]] ,, nno ∈∈ [[ 1,2,31,2,3 .. .. .. ))

IRi Uk:用户UK在区域Ri上的操作强度I Ri Uk : the operation intensity of user U K on region R i

Nj Ri用户在区域Ri上,时间槽Timeslot j上的操作次数,以点击次数表示操作次数,N j Ri is the user's number of operations on time slot Timeslot j in area R i , and the number of operations is represented by the number of clicks,

时间槽长度n:由应用系统确定,即采样的对象为最近的n个时间槽,若在n个时间槽内用户没有操作则自动解锁,Time slot length n: Determined by the application system, that is, the sampled objects are the nearest n time slots, if the user does not operate within the n time slots, it will be automatically unlocked,

αj:表示权重,离当前时间越近,权重越大;α j : Indicates the weight, the closer to the current time, the greater the weight;

第二步,对这些计算过的栅格按操作强度进行排序,操作强度由高到低排序后分别记做I1st,I2nd,I3rd,I4th…,则得到新的序列,分别记为:R1st,R2nd,R3rd,R4th…,The second step is to sort these calculated grids according to the operation intensity. After the operation intensity is sorted from high to low, they are respectively recorded as I 1st , I 2nd , I 3rd , I 4th ..., and a new sequence is obtained, which is respectively recorded as : R 1st , R 2nd , R 3rd , R 4th …,

第三步,提取基准栅格集合,这个集合中的栅格就是扩展的基础,这些基准的栅格用来预测用户将要操作的栅格,选取基准栅格的总原则是:选取操作强度最大的一个或几个栅格;The third step is to extract the set of benchmark grids. The grids in this set are the basis for expansion. These benchmark grids are used to predict the grids that users will operate. The general principle of selecting benchmark grids is: select the most intensive operation one or several grids;

4)确定待锁定的栅格,系统进行加锁操作4) Determine the grid to be locked, and the system performs the locking operation

确定系统预测锁待锁定区域ForecLs Ukregion即确定系统待锁定的栅格集合W,具体做法是以基准栅格为出发点,将与基准栅格相邻的未被锁定的栅格加入集合W,如果新加入集合W的栅格所夹的栅格没有被锁定,则将这些所夹的栅格亦加入待锁定集合W,然后对待锁定集合中的元素即栅格进行锁定。Determining the ForecL s Uk region of the system prediction lock to be locked is to determine the grid set W to be locked by the system. The specific method is to start from the reference grid and add the unlocked grids adjacent to the reference grid to the set W. If the grids contained by the grids that are newly added to the set W are not locked, these grids are also added to the set W to be locked, and then the elements in the set to be locked, that is, the grids, are locked.

本发明与背景技术相比,具有的有益的效果是:Compared with the background technology, the present invention has the beneficial effects that:

本发明是一种基于预测的智能锁,其主要功能是系统采用扩展锁定集合预测法帮助在线操作用户预测其在未来的操作区域,并提前锁定该区域,当锁定时有冲突发生,就启动相应的冲突解决策略。通过该锁机制,系统可以在一定程度上智能地协助用户提前加锁,从而保证用户实现设计的流畅操作,并预防可能发生的操作冲突。The present invention is an intelligent lock based on prediction. Its main function is that the system adopts the extended locking set prediction method to help online operation users predict their future operation area, and lock the area in advance. conflict resolution strategy. Through this lock mechanism, the system can intelligently assist the user to lock in advance to a certain extent, so as to ensure the smooth operation of the user's design and prevent possible operation conflicts.

(1)智能性。系统对用户自动进行预测加锁,并一定的时间段自动解锁,且可以让用户自由选择采用系统预测锁与否,使系统预测锁具有一定的智能性。(1) Intelligence. The system automatically predicts and locks the user, and automatically unlocks it within a certain period of time, and allows the user to freely choose whether to use the system predictive lock or not, so that the system predictive lock has a certain degree of intelligence.

(2)实用性。系统预测锁可以让用户开始操作时放心地选择锁定合适恰当地操作区域,经过反复试验证明有很好的实用性。(2) Practicality. The system predictive lock allows users to safely choose to lock the appropriate operating area when they start to operate, and it has been proved to be very practical through repeated trials.

由于用户知道有系统预测锁帮助其锁定未来操作区域,因此他可以在开始设计时放心地锁定一个合适的区域即可,而不是贪图一次性锁定一个较大的区域。这样就既可以避免因为一个用户提前锁定一个较大的区域(大部分闲置)而影响其它用户的操作,也不会因为自己未来想要操作的区域被别的用户锁定而影响自己操作的流畅性。同时还保证了后加入用户仍可以开始新的设计操作,不至于由于其它在线用户的浪费“锁定”而致使新用户没有操作区域或者操作区域过小。Since the user knows that there is a system predictive lock to help him lock the future operation area, he can safely lock a suitable area at the beginning of the design, instead of trying to lock a large area at once. In this way, it can avoid affecting the operation of other users because a user locks a large area (mostly idle) in advance, and will not affect the fluency of his own operation because the area he wants to operate in the future is locked by other users . At the same time, it also ensures that users who join later can still start new design operations, so that new users will not have no operation area or the operation area is too small due to the wasteful "locking" of other online users.

(3)预防性。由于系统预测锁是前锁机制,因此可以有效的预防冲突的发生,并且大多数冲突可以由系统锁以隐式的方式解决,从而大大减少用户因冲突而造成设计时间的浪费。(3) Preventive. Because the system predictive lock is a pre-lock mechanism, it can effectively prevent conflicts, and most conflicts can be resolved implicitly by the system lock, thus greatly reducing the waste of design time caused by conflicts.

附图说明Description of drawings

图1是以点击次数表示操作次数时间槽的示意图;Figure 1 is a schematic diagram of a time slot representing the number of operations by the number of clicks;

图2是系统锁实现中用户Uk第一次点击的位置为基准,锁定其右下方的L*L个栅格的示意图;Fig. 2 is a schematic diagram of locking the L*L grids at the bottom right of the user Uk in the implementation of the system lock based on the first click position;

图3是系统锁举例中Step4的case 1:首先加入R5和R6的示意图;Figure 3 is the case 1 of Step4 in the system lock example: first add R5 and R6;

图4是系统锁举例中Step4的case 1:再加入R7的示意图;Figure 4 is a schematic diagram of case 1 of Step4 in the system lock example: adding R7;

图5是系统锁举例中Step4的case 2:首先加入R5、R6、R7和R8的示意图。Figure 5 is a schematic diagram of case 2 of Step 4 in the system lock example: first add R5, R6, R7, and R8.

图6是系统锁举例中Step4的case 2:再加入R9和R0的示意图。Figure 6 is a schematic diagram of case 2 of Step 4 in the system lock example: adding R9 and R0.

具体实施方式Detailed ways

在实施基于internet(因特网)的分布式图案协同设计技术时,锁机制被广泛的应用。The lock mechanism is widely used when implementing the internet-based distributed pattern collaborative design technology.

方法中涉及到相关的符号解释:The method involves related symbol interpretation:

ForecLs Uk:系统预测锁的拥有者。ForecL s Uk: The owner of the system forecast lock.

ForecLs Ukorientation:系统预测锁待锁定的方向。ForecL s Uk orientation : The system predicts the orientation of the lock to be locked.

ForecLs Ukregion:系统预测锁待锁定的区域。ForecL s Uk region : The region where the system forecasts the lock to be locked.

ForecCoEdLs Ukregion:系统预测冲突后彼此竞争锁定的区域。ForecCoEdL s Uk region : Regions that the system predicts compete with each other for lock after a collision.

ForecEdLs Ukregion:系统预测冲突解决后的最终锁定区域。ForecEdL s Uk region : The system predicts the final locked region after conflict resolution.

Lu Uxregion:某用户已锁定的区域。L u Ux region : The region that a user has locked.

Lu Uxtime:某用户已锁定的时间。L u Ux time : the time a user has been locked.

系统预测锁的具体实现流程如下。The specific implementation process of the system predictive lock is as follows.

第一步:原始图案栅格化。系统将一个图案协同设计二维空间分割为m个栅格。Step 1: Rasterize the original pattern. The system divides a pattern collaborative design two-dimensional space into m grids.

第二步:初始化锁定。Step 2: Initialize the lock.

确定某用户锁区域Lu Ukregion和其系统预测锁ForecLs Uk。Determine a user lock region L u Uk region and its system predictive lock ForecL s Uk.

以某用户Uk第一次点击的位置为基准,锁定其周围的8个栅格,确定用户Uk的锁定区域Lu Ukregion,同时确定了其系统预测锁的拥有者ForecLs Uk。为了简化说明算法,在此仅以右下方的L*L个单位栅格{R1,R2,R3,R4}为例进行初始锁定操作,如图2所示。Based on the position of the first click of a certain user Uk, lock the 8 grids around it, determine the locked area L u Uk region of the user Uk, and determine the owner of the system predictive lock ForecL s Uk at the same time. In order to simplify the description of the algorithm, here only the L*L unit grids {R 1 , R 2 , R 3 , R 4 } on the lower right are taken as an example to perform the initial locking operation, as shown in FIG. 2 .

第三步:确定系统预测锁待锁定方向ForecLs UkorientationStep 3: Determine the ForecL s Uk orientation that the system predicts to be locked.

处理采集到用户UK,在上述L*L个单位栅格中的操作信息,根据计算操作强度确定预测锁待锁定方向ForecLs UkorientationProcess the collected operation information of the user U K in the above L*L unit grids, and determine the predicted lock-to-be-locked orientation ForecL s Uk orientation according to the calculation operation intensity.

(1)计算各个栅格操作强度IRi Uk (1) Calculate the operation intensity I Ri Uk of each grid

II RR ii Uu kk == ΣΣ jj == 00 nno NN jj RR ii αα jj ,, jj ∈∈ [[ 00 ,, nno ]] ,, nno ∈∈ [[ 1,2,31,2,3 .. .. .. ))

IRi Uk:用户UK在区域Ri上的操作强度。I Ri Uk : the operation intensity of the user U K on the region R i .

Nj Ri:用户在区域Ri上,时间槽Timeslot j上的操作次数,以点击次数表示操作次数,时间槽如图1所示。N j Ri : The number of operations performed by the user on the time slot Timeslot j in the area R i . The number of operations is represented by the number of clicks. The time slot is shown in Figure 1.

n的值由系统确定,即采样的对象为最近的n个时间槽,若在n个时间槽内用尸没有操作则自动解锁。The value of n is determined by the system, that is, the sampling object is the nearest n time slots, and if there is no operation by the user within n time slots, it will be automatically unlocked.

αj:表示权重,由αj=2αj+1定义,αj沿坐标轴逆方向线性递减。α j : represents the weight, defined by α j =2α j+1 , and α j decreases linearly along the reverse direction of the coordinate axis.

(2)栅格排序(2) Grid sorting

得到L*L个栅格的操作强度后,对这些栅格由高到低进行排序。以集合{R1,R2,R3,R4}为例,其对应操作强度为集合{IR1,IR2,IR3,IR4}。操作强度由高到低排序后分别记做I1st,I2nd,I3rd,I4th。若有关系 I R 2 > I R 1 > I R 4 > I R 3 ,则得到新的序列:R2,R1,R4,R3,分别记为:R1st,R2nd,R3rd,R4thAfter obtaining the operation intensity of the L*L grids, sort these grids from high to low. Taking the set {R 1 , R 2 , R 3 , R 4 } as an example, the corresponding operation intensity is the set {I R1 , I R2 , I R3 , I R4 }. The operating intensity is sorted from high to low and recorded as I 1st , I 2nd , I 3rd , and I 4th . If relevant I R 2 > I R 1 > I R 4 > I R 3 , then get a new sequence: R 2 , R 1 , R 4 , R 3 , denoted as: R 1st , R 2nd , R 3rd , R 4th .

(3)提取基准栅格集合(3) Extract the reference grid set

这个集合中的栅格就是扩展的基础,这些基准的栅格用来预测用户将要操作的区域(栅格),选取基准栅格的总原则是:选取操作强度最大的一个或几个栅格。例如:The grids in this collection are the basis of the expansion. These reference grids are used to predict the area (grid) that the user will operate. The general principle of selecting the reference grid is: select one or several grids with the greatest operation intensity. For example:

Figure C20051002326400071
Figure C20051002326400071

一旦确定了基准栅格集合,即确定了系统预测锁待锁定方向ForecLsUkorientationOnce the set of reference grids is determined, the system predictive locking orientation ForecL s Uk orientation is determined.

第四步:确定系统预测锁待锁定区域ForecLs UkregionStep 4: Determine the ForecL s Uk region of the system predictive lock to be locked.

确定系统预测锁待锁定区域ForecLs Ukregion即确定系统待锁定的栅格集合W,具体做法是以基准栅格为出发点,将与基准栅格相邻的未被锁定的栅格加入集合W。如果已锁定集合{R1,R2,R3,R4},则:Determining the ForecL s Uk region to be locked by the system is to determine the grid set W to be locked by the system. The specific method is to start from the reference grid and add the unlocked grids adjacent to the reference grid to the set W. If the set {R 1 , R 2 , R 3 , R 4 } is locked, then:

1:若基准栅格集合为{R1st},即{R2},则此时首先将与R2相邻的未被锁定的{R5,R6}加入集合W,如图3所示。1: If the reference grid set is {R 1st }, that is, {R 2 }, then first add the unlocked {R 5 , R 6 } adjacent to R 2 to the set W, as shown in Figure 3 .

其次,如果新加入集合W的栅格所夹的栅格没有被锁定,则将这些所夹的栅格亦加入待锁定集合W。图4中{R7}为{R5,R6}所夹的没有被锁定的栅格,则将{R7}加入集合W。Secondly, if the grids contained by the grids newly added to the set W are not locked, these grids are also added to the set W to be locked. In Fig. 4, {R 7 } is an unlocked grid clamped by {R 5 , R 6 }, then add {R 7 } to the set W.

最终待锁定栅格集合W为{R5,R6,R7},将集合W进行加锁,若锁定成功,加入已锁定集合{R1,R2,R3,R4},得到集合{R1,R2,R3,R4,R5,R6,R7}。The final grid set W to be locked is {R 5 , R 6 , R 7 }, and the set W is locked. If the lock is successful, join the locked set {R 1 , R 2 , R 3 , R 4 } to obtain the set {R 1 , R 2 , R 3 , R 4 , R 5 , R 6 , R 7 }.

2:若基准栅格集合为{R1st,R2nd},即{R2,R1},则首先将与{R2,R1}相邻的未被锁定的{R5,R6,R7,R8}加入集合W,如图5所示。2: If the reference grid set is {R 1st , R 2nd }, that is, {R 2 , R 1 }, then first set the unlocked {R 5 , R 6 , adjacent to {R 2 , R 1 } R 7 , R 8 } join the set W, as shown in Figure 5.

其次,如果新加入待锁定集合W的栅格所夹的栅格没有被锁定,则将这些所夹的栅格亦加入待锁定集合W。图6中{R9}为{R5,R6}所夹的没有被锁定的栅格,则将{R9}加入集合W,{R0}为{R7,R8}所夹的没有被锁定的栅格,则将{R0}加入集合W。Secondly, if the grids sandwiched by the grids newly added to the set W to be locked are not locked, these grids are also added to the set W to be locked. In Figure 6, {R 9 } is the unlocked grid clamped by {R 5 , R 6 }, then add {R 9 } to the set W, and {R 0 } is the grid clamped by {R 7 , R 8 } If there is no locked grid, add {R 0 } to the set W.

最终待锁定栅格集合W为{R5,R6,R7,R8,R9,R0},将集合W进行加锁,若锁定成功,加入已锁定集合{R1,R2,R3,R4},得到锁定集合{R1,R2,R3,R4,R5,R6,R7,R8,R9,R0}。The final raster set W to be locked is {R 5 , R 6 , R 7 , R 8 , R 9 , R 0 }, and the set W is locked. If the lock is successful, join the locked set {R 1 , R 2 , R 3 , R 4 }, to obtain a locked set {R 1 , R 2 , R 3 , R 4 , R 5 , R 6 , R 7 , R 8 , R 9 , R 0 }.

因此,该方法省去了用户锁定目标的步骤,提高了用户的工作效率并大大减少用户因冲突而造成设计时间的浪费。Therefore, this method saves the step of the user locking the target, improves the user's work efficiency and greatly reduces the waste of design time caused by the user's conflict.

Claims (1)

1.一种图案协同设计中的系统锁的预测方法,其特征在于:1. A method for predicting system locks in pattern collaborative design, characterized in that: 1)原始图案栅格化1) The original pattern is rasterized 系统将一个图案协同设计二维空间分割为m个栅格;The system divides a pattern collaborative design two-dimensional space into m grids; 2)初始化锁定2) Initialize the lock 确定了拥有其系统预测锁的用户,并以该用户Uk第一次点击的位置为基准,确定用户Uk的锁定区域,同时初始锁定操作;Determine the user who owns the predictive lock of the system, and use the position of the user U k's first click as a benchmark to determine the locking area of the user U k , and initially lock the operation; 3)确定扩展的基准栅格3) Determine the extended reference grid 处理采集到用户UK在待锁定的n个单位栅格中的操作信息,根据计算操作强度确定预测锁待锁定方向;Process the collected operation information of the user U K in the n unit grids to be locked, and determine the direction of the predicted lock to be locked according to the calculation operation intensity; 第一步,计算该用户在这n个单位栅格上的操作强度IRi UkThe first step is to calculate the user's operation intensity I Ri Uk on the n unit grids, II RR ii Uu kk == ΣΣ jj == 00 nno NN jj RR ii αα jj ,, jj ∈∈ [[ 00 ,, nno ]] ,, nno ∈∈ [[ 1,2,31,2,3 .. .. .. )) IRi Uk:用户UK在区域Ri上的操作强度I Ri Uk : the operation intensity of user U K on region R i Nj Ri:用户在区域Ri上,时间槽Timeslot j上的操作次数,以点击次数表示操作次数,N j Ri : the number of operations performed by the user on time slot Timeslot j in area R i , the number of operations is represented by the number of clicks, 时间槽长度n:由应用系统确定,即采样的对象为最近的n个时间槽,若在n个时间槽内用户没有操作则自动解锁,Time slot length n: Determined by the application system, that is, the sampled objects are the nearest n time slots, if the user does not operate within the n time slots, it will be automatically unlocked, αj:表示权重,离当前时间越近,权重越大;α j : Indicates the weight, the closer to the current time, the greater the weight; 第二步,对这些计算过的栅格按操作强度进行排序,操作强度由高到低排序后分别记做I1st,I2nd,I3rd,I4th…,则得到新的序列,分别记为:R1st,R2nd,R3rd,R4th…,The second step is to sort these calculated grids according to the operation intensity. After the operation intensity is sorted from high to low, they are respectively recorded as I 1st , I 2nd , I 3rd , I 4th ..., and a new sequence is obtained, which is respectively recorded as : R 1st , R 2nd , R 3rd , R 4th …, 第三步,提取基准栅格集合,这个集合中的栅格就是扩展的基础,这些基准的栅格用来预测用户将要操作的栅格,选取基准栅格的总原则是:选取操作强度最大的一个或几个栅格;The third step is to extract the set of benchmark grids. The grids in this set are the basis for expansion. These benchmark grids are used to predict the grids that users will operate. The general principle of selecting benchmark grids is: select the most intensive operation one or several grids; 4)确定待锁定的栅格,系统进行加锁操作4) Determine the grid to be locked, and the system performs the locking operation 确定系统预测锁待锁定区域ForecLS Ukregion即确定系统待锁定的栅格集合W,具体做法是以基准栅格为出发点,将与基准栅格相邻的未被锁定的栅格加入集合W,如果新加入集合W的栅格所夹的栅格没有被锁定,则将这些所夹的栅格亦加入待锁定集合W,然后对待锁定集合中的元素即栅格进行锁定。Determining the ForecL S Uk region of the system prediction lock to be locked is to determine the grid set W to be locked by the system. The specific method is to start from the reference grid and add the unlocked grids adjacent to the reference grid to the set W. If the grids contained by the grids that are newly added to the set W are not locked, these grids are also added to the set W to be locked, and then the elements in the set to be locked, that is, the grids, are locked.
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
CN100416552C (en) * 2006-06-23 2008-09-03 浙江大学 A Prediction Method for Areas of Interest in Pattern Collaborative Design in Ubiquitous Environment
CN100405360C (en) * 2006-06-23 2008-07-23 浙江大学 Adaptive Display Method of Graphics and Images in Collaborative Design in Ubiquitous 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
Wadeson et al. Savu: a Python-based, MPI framework for simultaneous processing of multiple, N-dimensional, large tomography datasets
Von Buelow ParaGen: Performative Exploration of generative systems
CN103488537B (en) Method and device for executing data ETL (Extraction, Transformation and Loading)
CN101034362A (en) Method for implementing network job scheduling using mobile proxy
Ulnicane Ever-changing big science and research infrastructures: Evolving European Union policy
CN105550825B (en) Flexible factory job scheduling method based on MapReduce parallelization in cloud computing environment
CN1300691C (en) Predicting method for system lock in pattern coordinate design
CN104537713B (en) A kind of novel three-dimensional reconfiguration system
Terzo et al. HPC, Big Data, and AI Convergence Towards Exascale: Challenge and Vision
Sood et al. Mapping the future: a scientometric review of 3D/4D printing research trends
Alevizos et al. Systematic review on sustainable design thinking through biomimetic approach
CN108280578A (en) Building project management system and method
CN1317664C (en) Method for building random stroke database and online handwritten Chinese character recognition evaluation system
CN114327853A (en) Low-cost user association and computation migration method facing complex tasks in cloud-side hybrid system
Ababneh et al. On Static Scheduling of Tasks in Real Time Multiprocessor Systems: An Improved GA-Based Approach.
CN100346341C (en) Complex locking method in pattern cooperative design
Sun et al. Integrated mapping and scheduling optimization with genetic algorithms based on a novel encoding scheme
Rouhi et al. CSO-GA: a new scheduling technique for cloud computing systems based on cat swarm optimization and genetic algorithm
CN1300683C (en) Method for maintaining semantics consistency in figure synergistic design
CN1645380A (en) Machine-tool structure coordinating treatment based on network
Shao et al. Heuristic approach for a combined transfer line balancing and buffer allocation problem considering uncertain demand
Li et al. A cloud computing-based approach for efficient processing of massive machine tool diagnosis data
Han et al. IEEE Access special section editorial: scalable deep learning for big data
Sadowsky MASH: A computer system for microanalytic simulation for policy exploration.
Fallacara et al. AI-driven image generation for enhancing design in digital fabrication: Urban furnishings in historic city centres

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
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20070214

Termination date: 20160110