CN102567432A - Intelligent information adaptation method and device for the same - Google Patents
Intelligent information adaptation method and device for the same Download PDFInfo
- Publication number
- CN102567432A CN102567432A CN2010106244529A CN201010624452A CN102567432A CN 102567432 A CN102567432 A CN 102567432A CN 2010106244529 A CN2010106244529 A CN 2010106244529A CN 201010624452 A CN201010624452 A CN 201010624452A CN 102567432 A CN102567432 A CN 102567432A
- Authority
- CN
- China
- Prior art keywords
- role
- decomposition
- current
- minimal
- node
- 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.)
- Granted
Links
Images
Landscapes
- Machine Translation (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses an intelligent information adaptation method and a device for the same. The method comprises the following steps of: determining each role in an operational analysis system, wherein each role comprises at least two objects, and each object corresponds to one attribute at a user level; decomposing the smallest elements of each role to get a smallest element set corresponding to each role; decomposing the smallest data granularity of the data according to the corresponding relation between each smallest element in the smallest element set and the data in the operational analysis system in the horizontal and longitudinal dimensions, obtaining the corresponding relation between the smallest element and the smallest data granularity, and further obtaining a smallest data granularity set corresponding to each role; integrating and packaging the smallest data granularity set corresponding to each role so as to obtain the data information corresponding to each role; and based on at least one role inherited by the user, adapting the valid data information in the corresponding role to the user. The technical scheme provided by the invention can organize the information of the operational analysis system more effectively.
Description
Technical field
The present invention relates to a kind of business support technology, relate in particular to a kind of intelligent information adaptation method and device towards the role.
Background technology
China's telecommunications industry has got into the full-service operation epoch, and full-service operation is had higher requirement to operation analysis system, promptly need provide more comprehensively to all types of user, more efficiently, more accurately, more in time, richer personalized information service.
In the prior art, no matter the information organization method of operation analysis system is decomposition (or classification, division etc.) or the reorganization of data (or integrated, set, combination etc.) of data, and major part all is to adopt subject-oriented or user oriented mode.
Wherein, The mode of subject-oriented is based on that the aspect angle of structure and the system architecture of information itself designs, and promptly stores separately to data qualification, and query composition is carried out in application; Do not take into full account user's demand; Its drawback shows: along with increasing newly of various application (like functions such as report customization, specific analyses), it is more and more huger too fat to move that system becomes, and these application many times are not that each user needs yet.Under many circumstances, the user need carry out switching repeatedly usually in order to obtain own needed information between a plurality of application, also need in each application item, carry out the selection inquiry of various dimensions sometimes.
User oriented mode is based on the user's request of operation analysis system, customized personal information.Though this mode can solve the above-mentioned drawback of subject classification mode; But have the company of a large amount of different institutions and function for those; And other has than labyrinth and than the tissue of large user colony, along with user group's quick growth, all need carry out authorizing of authority for each user; Organizing of its data also all has various singularity; Thereby the situation that causes confusion easily, and system's poor efficiency more and more under the processing of original mode are difficult to accomplish comprehensively, high-efficiency information supports.
Therefore, how to provide a kind of analytic system information organization of efficient management more scheme to become present urgent problem.
Summary of the invention
In view of this, on the one hand a kind of intelligent information adaptation method is provided among the present invention, a kind of intelligent information adaptive device is provided on the other hand, so that more effectively the information of operation analysis system is organized.
Intelligent information adaptation method provided by the present invention comprises:
Confirm to comprise each role of the operation analysis system of different objects, each role comprises at least two objects, an attribute on each object respective user aspect; Wherein, each object of operation analysis system comprises the node of different levels respectively;
Each object to each role carries out the decomposition up to the minimal decomposition node layer of setting, and obtains the corresponding least member set of each role; Wherein, a minimal decomposition node of each object of role under each least member comprises;
Corresponding relation according to horizontal vertical two dimensions of data in each least member and the operation analysis system in the said least member set carries out the decomposition of minimum data granularity to said data, obtains the corresponding relation of said least member and minimum data granularity; According to the corresponding relation of said least member and minimum data granularity, obtain the corresponding minimum data granularity set of each role;
Encapsulation is integrated in minimum data granularity set to each role is corresponding, obtains the corresponding data message of each role;
According at least one role that the user inherits, that the legal data message in the corresponding role is adaptive to said user.
Intelligent information adaptive device provided by the present invention comprises:
Role's determination module is used to confirm comprise each role of the operation analysis system of different objects, and each role comprises at least two objects, an attribute on each object respective user aspect; Wherein, each object of operation analysis system comprises the node of different levels respectively;
Role's decomposing module is used for each object of each role is carried out the decomposition up to the minimal decomposition node layer of setting, and obtains the corresponding least member set of each role; Wherein, a minimal decomposition node of each object of role under each least member comprises;
The data map module; Be used for corresponding relation according to horizontal vertical two dimensions of data in said least member each least member of set and the operation analysis system; Said data are carried out the decomposition of minimum data granularity, obtain the corresponding relation of said least member and minimum data granularity; According to the corresponding relation of said least member and minimum data granularity, obtain the corresponding minimum data granularity set of each role;
The data encapsulation module is used for encapsulation is integrated in the corresponding minimum data granularity set of each role, obtains the corresponding data message of each role;
The information adaptation module is used at least one role according to user's succession, and the legal data message in the corresponding role is adaptive to said user.
Can find out from such scheme; Among the present invention through each role who confirms is carried out the decomposition of least member; Obtain the corresponding least member set of each role, and, set up the mapping relations of role and data according to the corresponding relation of horizontal vertical two dimensions of data in each least member in the said least member set and the operation analysis system; Thereby at least one role that can inherit according to the user gives said user with the legal data message in the corresponding role is adaptive.Technical scheme among the present invention, its method for organizing can provide the user to pay close attention to the information that needs most most towards the role.And after the present technique scheme is decomposed data, set up the mapping mechanism of role's least member, can accelerate the location of minimum data granularity set, improve the overall operation efficiency of system the minimum data granularity.
Description of drawings
Fig. 1 is the exemplary process diagram of intelligent information adaptation method in the embodiment of the invention.
Fig. 2 is for carrying out the schematic flow sheet that least member decomposes to single role in the embodiment of the invention.
Fig. 3 is the various data granularity shapes of data set in the embodiment of the invention.
Fig. 4 is the exemplary process diagram of intelligent information adaptive device in the embodiment of the invention.
Fig. 5 is an inner structure synoptic diagram of role's decomposing module in the device shown in Figure 4.
Fig. 6 is another inner structure synoptic diagram of role's decomposing module in the device shown in Figure 4.
Fig. 7 is another inner structure synoptic diagram of role's decomposing module in the device shown in Figure 4.
Fig. 8 is an inner structure synoptic diagram of the first object decomposing module in the embodiment of the invention.
Embodiment
In the embodiment of the invention, introduced role's abstract concept, as a summary on user level; It is in the nature a set; Object wherein (i.e. element in the set) is any attribute on the user level, like mechanism, function etc., can be expressed as with mathematic sign:
Role ROLE=(DEPARTMENT=mechanism, the JOB=function ...).
Generally, each object in the operation analysis system comprises the node of different levels respectively, for example, constitutes a similar tree-shaped structure sometimes.In order to set up the corresponding relation of data in role and the operation analysis system; At first each role who confirms is carried out the decomposition of least member in the embodiment of the invention; Obtain the corresponding least member set of each role; Wherein, a minimal decomposition node (the minimal decomposition node layer is predefined minimum decomposition node layer) of each object of role under each least member comprises.Afterwards; Corresponding relation according to horizontal vertical two dimensions of data in each least member and the operation analysis system in the said least member set; Set up the mapping relations of role and data; So that it is, that the legal data message in the corresponding role is adaptive to said user according at least one role that the user inherits.
For making the object of the invention, technical scheme and advantage clearer, below in conjunction with embodiment and accompanying drawing, to further explain of the present invention.
Fig. 1 is the exemplary process diagram of intelligent information adaptation method in the embodiment of the invention.As shown in Figure 1, this method comprises the steps:
In this step, based on different operation analysis systems, the included object of role can be inequality.Comprise that specifically which object can confirm according to actual needs.
For example, for a company, the role of its operation analysis system can comprise two objects of Organizations And Functions, and the different node layer of corresponding mechanism and corresponding different function can be provided with different roles.
Fig. 1 shows the part body hierarchy chart of certain company.As shown in Figure 1, mechanism's level of the said firm has been represented to come out with tree-shaped mode.Wherein, province company is positioned at the first node layer of mechanism, promptly high node layer; Comprised the element that prefecture-level company, market department of province company etc. are in the Section Point layer below the province company again; Prefecture-level company has comprised the element of district, market department's grade in an imperial examination three node layer again; The district comprises two elements of customer manager and section; The section comprises two elements of customer manager and business hall; The customer manager comprises big customer manager and two elements of group customer manager.Can see that from Fig. 1 the customer manager has crossed over district and these two nodes of section, visible, be not strict tree structure.For large-scale company, when particularly mechanism was complicated, it is very complicated and too fat to move that this tree structure can become.
When confirming the role of the said firm's operation analysis system, the role of any amount can be set as required.For example, role 1=(DEPARTMENT=province company, JOB=are responsible for the corporate business development), role 2=(DEPARTMENT=district, JOB=is responsible for the district business development), role 3=(DEPARTMENT=section, JOB=is responsible for the Fetion business development) ....
Wherein, the minimal decomposition node layer of each object is the minimum decomposition node layer of predefined this object.For example; For the part body hierarchy chart of certain company shown in Figure 1, the minimal decomposition node layer of this mechanism can be the residing node layer in business hall, also can be the residing node layer in section; Can also be for the residing node layer in district etc., being specially which layer can confirm according to actual needs in advance.Correspondingly, when each object of persona decomposes, decompose its corresponding minimal decomposition node layer and get final product.
Be example to decompose role=(Z of DEPARTMENT=province company, JOB=are responsible for the corporate business development), suppose that the minimal decomposition node is the residing node layer in business hall, then wherein object " Z of DEPARTMENT=province company " can progressively be decomposed into:
Z={A=prefecture-level company of province company, market department of B=province company, department of major clients of D=province company ...
The A={A1=district, A2=market department, A3=client service center ..., B=... ...
A1={A11=customer manager, the A12=section ..., A2=... ...
Because A11 and A12 can down decompose mutually, so can not decompose simultaneously, need decompose bottom from one, decompose another again, that is:
A1={A11=customer manager, the A12=section ...={ A111=big customer manager, A112=group customer manager, A12=section } or A1={A11=customer manager, the A12=section ...={ A11=customer manager, A121=business hall }
Continue to decompose, arrive the minimal decomposition node always and finish, then the form of final province company is following:
Final Z={A111=big customer manager, A112=group customer manager, A121=business hall ...
In the practical application, when persona was carried out the decomposition of least member, concrete decomposition method can have multiple, just listed below and lifted a kind of preferable implementation.
In the embodiment of the invention when persona is carried out the decomposition of least member; Introduced the notion of partial ordering relation
; As a kind of mathematical tool; It defines as follows: for any one object S; To itself satisfying
it is carried out the decomposition of certain relation (as belong to, succession, mapping etc.); Resulting all subobject Sk; All satisfy partial ordering relation
and for the outer element Yk of all subobjects of Sk; Then do not satisfy partial ordering relation,
promptly arranged
Correspondingly, utilize partial ordering relation that each object of each role is carried out the decomposition up to the minimal decomposition node layer of setting in the embodiment of the invention, obtain the corresponding least member set of each role.
When specifically certain role being carried out the least member decomposition, its process can be as shown in Figure 2, comprising:
Be example to decompose role=(Z of DEPARTMENT=province company, JOB=are responsible for the corporate business development), then can be at first this role's mechanism be decomposed as current object; At this moment; For the part body hierarchy chart of certain company shown in Figure 1, Z={A=prefecture-level company of province company is then arranged, market department of B=province company; Department of major clients of D=province company ... }.When decomposing, can not make to decompose to have redundancy through partial ordering relation.Because when adopting other is olation; Might make that decomposition result is a Z={A=prefecture-level company; Market department of B=province company, C=district, department of major clients of D=province company; ...; And when utilizing partial ordering relation, because prefecture-level company comprises the district,
promptly arranged therefore can delete C.
Step 1026 judges whether all objects of this role have all decomposed, if all do not decomposed, then returns execution in step 1021; If all decomposed, then obtain the minimal decomposition node set of this each object of role, execution in step 1027 afterwards.
More than certain role's decomposable process is described in detail.In the practical application, can carry out above-mentioned operation shown in Figure 2 respectively to each role, promptly respectively with each role as current role; Utilize partial ordering relation that each object of current role is carried out the decomposition up to the minimal decomposition node layer of setting, obtain the minimal decomposition node set of current each object of role; According to the minimal decomposition node set of said current each object of role, obtain the set of the corresponding least member of forming by each object minimal decomposition node of current role.
In addition, owing to have relation of inclusion usually between most of role of same operation analysis system, for example; Above-mentioned three roles that enumerate: role 1=(DEPARTMENT=province company, JOB=are responsible for the corporate business development), role 2=(DEPARTMENT=district; JOB=is responsible for the district business development) and role 3=(DEPARTMENT=section; JOB=is responsible for the Fetion business development), just there is role 1 to comprise role 2 and role 3, role 2 comprises role 3.In the practical application, also has the such role of many groups.For example; Be provided with 6 roles, promptly except above-mentioned three roles, also comprise three roles; Be role 4, role 5 and role 6; But do not have relation of inclusion between these three roles and the above-mentioned role 1～role 3, but have role 4 to comprise role 5, and role 6 all do not have relation of inclusion with other role.Therefore for this each role,, when specifically realizing, can also take following two kinds of implementations in order to simplify calculating with relation of inclusion:
Mode one: decompose top role earlier, utilize top role's decomposition result, obtain lower level role's least member set.Specifically comprise:
To every group of role with relation of inclusion, therefrom choose the role that included object is in high node layer, as the based decomposition role, for example the role 1, role 4 and role 6.
Respectively with each based decomposition role as current role; Utilize partial ordering relation that each object of current role is carried out the decomposition up to the minimal decomposition node layer of setting; Obtain the minimal decomposition node set of current each object of role; According to the minimal decomposition node set of said current each object of role, obtain the set of the corresponding least member of forming by each object minimal decomposition node of current role.
According to the minimal decomposition node set of each each object of based decomposition role, obtain the set of the corresponding least member of forming by each object minimal decomposition node of other role.
In this mode, after persona 1 was decomposed, role 2 and role 3 can obtain the corresponding least member set of self-role from role 1 decomposition result.
Mode two: decompose the lowermost layer role earlier, utilize lowermost layer role's decomposition result, obtain higher level role's least member set.Specifically comprise:
A, from every group of role with relation of inclusion, choose the role that included object is in minimum node layer, decompose the role as n; Wherein, n=1.
B, respectively each n is decomposed role as current role; Utilize partial ordering relation that each object of current role is carried out the decomposition up to the minimal decomposition node layer of setting; Obtain the minimal decomposition node set of current each object of role; According to the minimal decomposition node set of said current each object of role, obtain the set of the corresponding least member of forming by each object minimal decomposition node of current role.
C, from undecomposed role, choose the role that included object is in minimum node layer, decompose the role as n+1.
D, respectively each n+1 is decomposed role as current role; Utilize each object the decomposition up to the minimal decomposition node layer set except that the minimal decomposition node set of corresponding n decomposition role each object of partial ordering relation to current role; The minimal decomposition node set of decomposing each object of role according to the decomposition result of current each object of role and corresponding n; Obtain the minimal decomposition node set of current each object of role; According to the minimal decomposition node set of said current each object of role, obtain the set of the corresponding least member of forming by each object minimal decomposition node of current role.
E, if also have undecomposed role, then make n=n+1, and return execution in step C.
In this mode, at first persona 3 is decomposed, and persona 2 is decomposed on role 3 decomposition base afterwards, and persona 1 is decomposed on role 2 decomposition base.Promptly superposed part among each role is no longer repeated to decompose, and only once decompose.
In above-mentioned dual mode; When confirming the minimal decomposition node set of other each object of role according to the minimal decomposition node set of decomposing each object of role; Any two least member (I for role's same target; J); If satisfy partial ordering relation; Even there be
then to delete J, if there be
then to delete I.(be minimum principle, delete big).
For example, suppose that the role only contains A=mechanism, 2 objects such as B=function (describe, down with) for convenient, then a section data service manager's role constructs as follows:
R1＝{
(A11=section, B1=is responsible for the data service development),
(A11=section, B11=is responsible for the Fetion business development),
(A11=section, B12=is responsible for the development of mobile phone mailbox service)
}
Because
therefore needs first least member (A11 with R1; B1) deletion avoids redundant.Therefore the expression formula after R1 decomposes through function is:
R1＝{
(A11=section, B11=is responsible for the Fetion business development),
(A11=section, B12=is responsible for the development of mobile phone mailbox service)
}
In aforesaid way two, when specifically realizing, the least member set of also can be directly among the step D decomposing the role according to the decomposition result and the corresponding n of current each object of role utilizes partial ordering relation to obtain current role's least member set.
For example; If current role comprises a plurality of roles simultaneously; Before then structure deserves during the role; Can judge at first whether each role in current role's scope satisfies partial ordering relation between any two, and the bigger role of scope among two roles that satisfy partial ordering relation is deleted, make each sub-role of the current role of structure satisfy the requirement that least member decomposes.Promptly for any two roles among the current role,, then will satisfy the bigger role's deletion of scope among two roles of partial ordering relation if satisfy partial ordering relation.As for any two role (Ri; Rj); If satisfy partial ordering relation,
promptly arranged then corresponding deletion Rj.Wherein, Role Ri; Rj satisfies partial ordering relation
and is meant for any least member I among the Ri; There is a least member J in Rj, satisfies the following example of partial ordering relation
:
Suppose that for the general service person role R11 that is responsible for Fetion and mobile phone mailbox income index its least member set is:
R11＝{
(A112=business hall, B11=is responsible for the Fetion business development),
(A112=business hall, B12=is responsible for the development of mobile phone mailbox service)
}
For role's combination (R1; R11); Owing to satisfy
promptly for 2 least members of R11; There is least member in R1, satisfies
and
so partial ordering relation
and sets up.The design of system should keep complete principle in principle; All decomposition that are data service development B1 should comprise Fetion business development B11; The union of all data service subitems such as mobile phone mailbox service development B12, and section A11 comprises the union of all business halls such as A112 etc.
Therefore current role finally decomposes the expression formula after the completion and is:
R＝{
(A112=business hall, B11=is responsible for the Fetion business development),
(A112=business hall, B12=is responsible for the development of mobile phone mailbox service)
}
This expression formula will be stored in the system as current role's truly expressed.
Some special roles are also arranged, crossed over a plurality of objects of role separately, as:
R12＝{
(A11=section, B1=is responsible for the data service development),
(A1=district, B11=is responsible for the Fetion business development)
}
Though two decomposition of
so R12 are not satisfy partial ordering relation, need to keep simultaneously.In addition,
and
so R11 and R12 also keep simultaneously.
Can find out that from said process after the decomposition through this step, each role's decomposition all must be satisfied the principle of least member, it finally decomposes resulting least member set can not comprise two least members that satisfy partial ordering relation simultaneously.For example; If the least member that the final decomposition of certain role R* obtains set is R*={R1; R11; ...; Then this decomposition does not meet the least member principle, because
so R1 should be from the decomposable process of R* deleted, can not appear at R* simultaneously with R11 and decompose among the least member set that finally obtains.
After all roles' of system decomposition is accomplished; Promptly all roles exist legal least member to decompose; And be equivalent to these all sub-roles' of role least member union of sets collection; And it is consistent; When promptly role with implication two different least members can not occur and decomposes, then finally also can satisfy
Sequencing for all roles in the system decompose can come algorithm for design (from top to bottom perhaps from the bottom to the top layer) according to the structure of system actor, should reduce the process that repeats to decompose, to increase the performance of system as far as possible.On the system principle each role is only decomposed once, but, all need upgrade accordingly when the part role of system revises, when increase, deletion action, then have all roles of partial ordering relation with this role.
In this step, can at first confirm the corresponding relation of least member and minimum data granularity, and then, obtain the pairing minimum data granularity set of each role according to the corresponding relation of role and least member set.
As shown in table 1, table 1 shows a kind of decomposing schematic representation of minimum data granularity.Suppose role R11 (A112 B11) is a least member, and the section data in ID1 and ID2 certain district that to be R11 corresponding.Through (A112, B11) → ((ID1, ID2), ($1)), then can obtain a minimum data granularity DATA1; In like manner, through (A112, B12) → ((ID1, ID2), ($2)), then obtain another minimum data granularity DATA2.In addition, through (A112, B1) → ((ID1, ID2), ($1 ， $2 ... ， $n)), also can obtain whole two row of ID1 and ID2, but its data granularity is not minimum, and B1 neither least member, does not therefore adopt such decomposition here.In like manner, for role R12, its corresponding data granularity set is: R12 → ((ID1, ID2), ($1 ， $2...$n))+((ID1, ID2...), ($1)).
Table 1
Data are mapped on the corresponding role the most at last with the form of minimum data granularity set.The shape of data granularity will depend on the role decomposition and with the mapping relations of data.Fig. 3 has showed the various data granularity shapes of data set.
Step 104 is integrated encapsulation to the minimum data granularity set that each role is corresponding, obtains the corresponding data message of each role.
In this step, can carry out vertical consolidation, laterally merge and remove heavily (promptly removal is redundant) the minimum data granularity in the corresponding minimum data granularity set of each role, and the value of relevant minimum data granularity is added up to, obtain the corresponding data message of each role.
For example,, can know that its corresponding minimum data granularity set is for { DATA1, DATA2}, DATA1 and DATA2 do not have cross section, therefore can directly laterally merge according to step 103 for role R11.But for special role R12, DATA1-DATAn all satisfies condition, and simultaneously, DATAm also satisfies condition; Therefore need laterally merge DATA1-DATAn, DATA1+DATAm is carried out vertical consolidation, and laterally vertical (DATA1; DATA2 ... when DATAn)+(DATA1+DATAm) recombinating, will delete the DATA1 (promptly going heavily) of overlapping; Become (DATA1, DATA2 ... DATAn)+(DATAm).
When the value of the relevant minimum data granularity of each role is added up to, for the role who comprises two objects of Organizations And Functions, can the data granularity be added up to, and the result is encapsulated to the application integration of its corresponding function.Total wherein comprises the calculating of all indexs that function is comprised among the role; Scope comprises between single minimum data granularity or a plurality of minimum data granularity; Basic total has summation, asks poor; Simple statistics such as ratio, average, variance, complicated total has indexs such as liveness, lifting rate to calculate.
In the last example, the function that R11 is corresponding is the professional and mobile phone mailbox service of Fetion, so its role's service application demand can obtain Fetion and mobile phone mailbox income respectively as calculating income.In like manner, R12 obtains the data service income of section and the professional income of Fetion in district respectively.The calculating of present technique scheme is owing to the data based on minimum particle size, so its total mode is very flexibly.For example,, B11+B12 (Fetion income+mobile phone mailbox income) can be comprised,, the not strong index of practicality can also be obtained for R12 for R11, like B1+B11 (the professional gross income of section data service gross income+district Fetion), or even B11/B1.In a word, only need define through role's function, just can the various indexs calculating of definition on the data granularity set neatly.
In the practical application, the user can inherit one or more role, thereby obtains all objects of corresponding role, and as above the mechanism in the example, function etc. are represented the user with USER, and Ri representes the role, inherits and also can represent with partial order, and is as follows:
All roles' that the user inherits mechanism has indicated the level and corresponding function of its mechanism, makes it have all corresponding data granularity set of these role-map, supposes that the corresponding data granularity of each role-map is:
Ri1→DATAi1，Ri2→DATAi2，Ri3→DATAi3...
Then the corresponding data granularity set of user USER mapping is:
USER→(DATAi1，DATAi2，DATAi3...)。
In the present embodiment, can define different roles in advance and have different authorities, then in this step, at least one role that can inherit according to the user, all data messages that said role is corresponding are adaptive gives said user.
Perhaps; In order to reduce role's quantity as far as possible; Each role can only define the maximum magnitude of the minimum data granularity set that the user can obtain, and does not define the user to the access rights of certain minimum data granularity wherein, and this moment, the user need provide the access rights of self; Then can be in this step according at least one role of user's succession and said user's access rights, the data message under these access rights that said role is corresponding is adaptive to said user.
For example, the user's data access rights can be by mechanism's authority decision at user place.For example: certain user has inherited role " prefecture-level company section manager ", but this role is not reflected this user and belonged to which districts and cities, which district, which section.Therefore need on the user, define actual mechanism, its data access authority can only be visited the client's of intrinsic region data.The main cause that adopts this mode is to avoid the identical post of different districts and cities to be defined as different role, causes the too much and role conception confusion of role in the system.
In the present embodiment, further, be pushed to said user through the access mode interface that the user selects for said user's data information with adaptive.Can be according to various users' under each role requirement and preference; Various clients (like web access mode, wap access mode, note access mode, multimedia message access mode, electronic mail access mode and electronic information screen access mode etc.) according to user's request; Set up corresponding regulation engine and carry out the propelling movement of Adapted information, at last the form of adaptive information with the best shown.
More than the intelligent information adaptation method in the embodiment of the invention is described in detail, again the intelligent information adaptive device in the embodiment of the invention is described in detail below.
Fig. 4 shows the exemplary block diagram of intelligent information adaptive device in the embodiment of the invention.As shown in Figure 4, this device comprises: role's determination module, role's decomposing module, data map module, data encapsulation module and information adaptation module.
Wherein, role's determination module is used for confirming each role of operation analysis system, and each role comprises at least two objects, an attribute on each object respective user aspect.Wherein, the specific operation process of role's determination module can be consistent with the operating process of description in the step 101.
Role's decomposing module is used for each object of each role is carried out the decomposition up to the minimal decomposition node layer of setting, and obtains the corresponding least member set of each role.Wherein, a minimal decomposition node of each object of role under each least member comprises.Wherein, the specific operation process of role's decomposing module can be consistent with the operating process of description in the step 102.
The data map module is used for the corresponding relation according to horizontal vertical two dimensions of data in said least member each least member of set and the operation analysis system; Said data are carried out the decomposition of minimum data granularity, obtain the corresponding relation of said least member and minimum data granularity; According to the corresponding relation of said least member and minimum data granularity, obtain the corresponding minimum data granularity set of each role.Wherein, the specific operation process of data map module can be consistent with the operating process of description in the step 103.
The data encapsulation module is used for encapsulation is integrated in the corresponding minimum data granularity set of each role, obtains the corresponding data message of each role.Wherein, the specific operation process of data encapsulation module can be consistent with the operating process of description in the step 104.
The information adaptation module is used at least one role according to user's succession, and the legal data message in the corresponding role is adaptive to said user.Further, this information adaptation module can be pushed to said user through the access mode interface that the user selects for said user's data information with adaptive.Wherein, the specific operation process of information adaptation module can be consistent with the operating process of description in the step 105.
During concrete the realization, role's decomposing module can have multiple inner structure way of realization.Fig. 5 shows an inner structure synoptic diagram of role's decomposing module.As shown in Figure 5, this role's decomposing module comprises:
First role's extraction module was used for before all roles have decomposed, and from undecomposed each role, extracted a role as current role.
The first object decomposing module is used to utilize partial ordering relation that each object of current role is carried out the decomposition up to the minimal decomposition node layer of setting, and obtains the minimal decomposition node set of current each object of role.
The first least member acquisition module is used for the minimal decomposition node set according to said current each object of role, obtains the set of the corresponding least member of being made up of each object minimal decomposition node of current role.
Fig. 6 shows another inner structure synoptic diagram of role's decomposing module.As shown in Figure 6, this role's decomposing module comprises:
First role chooses module, is used for choosing the role that included object is in high node layer from every group of role with relation of inclusion, as the based decomposition role.
Second role's extraction module was used for before all basic roles have decomposed, and from undecomposed based decomposition role, extracted a based decomposition role as current role.
The first object decomposing module is used to utilize partial ordering relation that each object of current role is carried out the decomposition up to the minimal decomposition node layer of setting, and obtains the minimal decomposition node set of current each object of role.
The first least member acquisition module; Be used for minimal decomposition node set according to said current each object of role; Obtain the set of the corresponding least member of forming by each object minimal decomposition node of current role, the current role's who obtains least member is gathered offered the second least member acquisition module.
The second least member acquisition module is used for the minimal decomposition node set according to each each object of based decomposition role, obtains the set of the corresponding least member of being made up of each object minimal decomposition node of other role.
Fig. 7 shows another inner structure synoptic diagram of role's decomposing module.As shown in Figure 7, this role's decomposing module comprises:
Second role chooses module, is used for choosing the role that included object is in minimum node layer from every group of role with relation of inclusion, decomposes the role as n.Wherein, n=1.
The 3rd role's extraction module was used for before all n decomposition roles have decomposed, and decomposed the role from undecomposed n and chose a n decomposition role as current role.
The first object decomposing module is used to utilize partial ordering relation that each object of current role is carried out the decomposition up to the minimal decomposition node layer of setting, and obtains the minimal decomposition node set of current each object of role.
The first least member acquisition module is used for the minimal decomposition node set according to said current each object of role, obtains the set of the corresponding least member of being made up of each object minimal decomposition node of current role.
The 3rd role chooses module, is used for choosing the role that included object is in minimum node layer from undecomposed role, decomposes the role as n+1.
The 4th role's extraction module, be used for all n+1 decompose the role undecomposed intact before, decompose from undecomposed n+1 and to choose a n+1 the role and decompose the role as current role.
The second object decomposing module; Be used to utilize each object the decomposition up to the minimal decomposition node layer set except that the minimal decomposition node set of corresponding n decomposition role each object of partial ordering relation, obtain the decomposition result of current each object of role current role.
The 3rd least member acquisition module; Be used for the minimal decomposition node set of decomposing each object of role according to the decomposition result of current each object of role and corresponding n; Obtain the minimal decomposition node set of current each object of role; According to the minimal decomposition node set of said current each object of role, obtain the set of the corresponding least member of forming by each object minimal decomposition node of current role.
Judge module is used to judge whether also exist undecomposed role, then makes n=n+1, and notifies the 3rd role to choose module and carry out the role and choose.
During concrete the realization; The 3rd least member acquisition module in role's decomposing module shown in Figure 7 also can be the least member set of decomposing the role according to the decomposition result of current each object of role and corresponding n, utilizes partial ordering relation to obtain the set of the corresponding least member of being made up of each object minimal decomposition node of current role.
Wherein, the first object decomposing module also can have multiple inner structure way of realization, Fig. 8 to show an inner structure synoptic diagram of the first object decomposing module when concrete the realization.As shown in Figure 8, this first object decomposing module comprises:
The first daughter element decomposing module is used for extracting a object that current role is not decomposed as current object, and obtains all daughter elements of this object, obtains m level element.
The second daughter element decomposing module, all that are used for never being decomposed m level element is chosen an element as currentElement, obtains all daughter elements of currentElement, has been decomposed up to all m level elements, obtains all daughter elements of all m level elements.
First judge module; Be used to judge whether m level element is in the minimal decomposition node layer of setting; If not the minimal decomposition node layer; All daughter elements of the m level element that then will obtain are as m+1 level daughter element, and make m=m+1, and notify the second daughter element decomposing module to proceed to decompose; Otherwise, notify second judge module to judge.
Second judge module is used to judge whether all objects of this role have all decomposed, if all do not decomposed, then notifies the first daughter element decomposing module to proceed to decompose; Otherwise, all daughter element outputs of notifying the second daughter element decomposing module to obtain.
During concrete the realization; The second object decomposing module can have and the identical inner structure of the first object decomposing module; Just first judging unit can be used for judging whether m level element is in the minimal decomposition node layer of setting or is in the corresponding included object corresponding nodes of n decomposition role layer, if not, all daughter elements of the m level element that then will obtain are as m+1 level daughter element; And make m=m+1, and notify the second daughter element decomposing module to proceed to decompose; Otherwise, notify second judging unit to judge.
" reception " speech in the embodiment of the invention is appreciated that for initiatively obtaining from other modules also can be to receive the information that other modules are sent.
It will be appreciated by those skilled in the art that accompanying drawing is the synoptic diagram of a preferred embodiment, module in the accompanying drawing or flow process might not be that embodiment of the present invention is necessary.
It will be appreciated by those skilled in the art that the module in the device among the embodiment can be distributed in the device of embodiment according to the embodiment description, also can carry out respective change and be arranged in the one or more devices that are different from present embodiment.The module of the foregoing description can be merged into a module, also can further split into a plurality of submodules.
The invention described above embodiment sequence number is not represented the quality of embodiment just to description.
Part steps in the embodiment of the invention can utilize software to realize that corresponding software programs can be stored in the storage medium that can read, like CD or hard disk etc.
Above-described specific embodiment; The object of the invention, technical scheme and beneficial effect have been carried out further explain, and institute it should be understood that the above is merely preferred embodiment of the present invention; Be not to be used to limit protection scope of the present invention; All within spirit of the present invention and principle, any modification of being done, be equal to replacement, improvement etc., all should be included within protection scope of the present invention.
Claims (14)
1. an intelligent information adaptation method is characterized in that, this method comprises:
Confirm to comprise each role of the operation analysis system of different objects, each role comprises at least two objects, an attribute on each object respective user aspect; Wherein, each object of operation analysis system comprises the node of different levels respectively;
Each object to each role carries out the decomposition up to the minimal decomposition node layer of setting, and obtains the corresponding least member set of each role; Wherein, a minimal decomposition node of each object of role under each least member comprises;
Corresponding relation according to horizontal vertical two dimensions of data in each least member and the operation analysis system in the said least member set carries out the decomposition of minimum data granularity to said data, obtains the corresponding relation of said least member and minimum data granularity; According to the corresponding relation of said least member and minimum data granularity, obtain the corresponding minimum data granularity set of each role;
Encapsulation is integrated in minimum data granularity set to each role is corresponding, obtains the corresponding data message of each role;
According at least one role that the user inherits, that the legal data message in the corresponding role is adaptive to said user.
2. method according to claim 1; It is characterized in that; Said each object to each role carries out the decomposition up to the minimal decomposition node layer of setting; Obtaining the corresponding least member set of each role comprises: utilize partial ordering relation that each object of each role is carried out the decomposition up to the minimal decomposition node layer of setting, obtain the corresponding least member set of each role.
3. method according to claim 2 is characterized in that, the said partial ordering relation that utilizes carries out the decomposition up to the minimal decomposition node layer of setting to each object of each role, obtains the corresponding least member set of each role and comprises:
Respectively with each role as current role;
Utilize partial ordering relation that each object of current role is carried out the decomposition up to the minimal decomposition node layer of setting, obtain the minimal decomposition node set of current each object of role;
According to the minimal decomposition node set of said current each object of role, obtain the set of the corresponding least member of forming by each object minimal decomposition node of current role.
4. method according to claim 2 is characterized in that, the said partial ordering relation that utilizes carries out the decomposition up to the minimal decomposition node layer of setting to each object of each role, obtains the corresponding least member set of each role and comprises:
From every group of role with relation of inclusion, choose the role that included object is in high node layer, as the based decomposition role;
Respectively with each based decomposition role as current role; Utilize partial ordering relation that each object of current role is carried out the decomposition up to the minimal decomposition node layer of setting; Obtain the minimal decomposition node set of current each object of role; According to the minimal decomposition node set of said current each object of role, obtain the set of the corresponding least member of forming by each object minimal decomposition node of current role;
According to the minimal decomposition node set of each each object of based decomposition role, obtain the set of the corresponding least member of forming by each object minimal decomposition node of other role.
5. method according to claim 2 is characterized in that, the said partial ordering relation that utilizes carries out the decomposition up to the minimal decomposition node layer of setting to each object of each role, obtains the corresponding least member set of each role and comprises:
A, from every group of role with relation of inclusion, choose the role that included object is in minimum node layer, decompose the role as n; Wherein, n=1;
B, respectively each n is decomposed role as current role; Utilize partial ordering relation that each object of current role is carried out the decomposition up to the minimal decomposition node layer of setting; Obtain the minimal decomposition node set of current each object of role; According to the minimal decomposition node set of said current each object of role, obtain the set of the corresponding least member of forming by each object minimal decomposition node of current role;
C, from undecomposed role, choose the role that included object is in minimum node layer, decompose the role as n+1;
D, respectively each n+1 is decomposed role as current role; Utilize each object the decomposition up to the minimal decomposition node layer set except that the minimal decomposition node set of corresponding n decomposition role each object of partial ordering relation to current role; The minimal decomposition node set of decomposing each object of role according to the decomposition result of current each object of role and corresponding n; Obtain the minimal decomposition node set of current each object of role; According to the minimal decomposition node set of said current each object of role, obtain the set of the corresponding least member of forming by each object minimal decomposition node of current role;
E, if also have undecomposed role, then make n=n+1, and return execution in step C.
6. method according to claim 5 is characterized in that, the said partial ordering relation that utilizes carries out the decomposition up to the minimal decomposition node layer of setting to each object of each role, obtains the corresponding least member set of each role and comprises:
A, from every group of role with relation of inclusion, choose the role that included object is in minimum node layer, decompose the role as n; Wherein, n=1;
B, respectively each n is decomposed role as current role; Utilize partial ordering relation that each object of current role is carried out the decomposition up to the minimal decomposition node layer of setting; Obtain the minimal decomposition node set of current each object of role; According to the minimal decomposition node set of said current each object of role, obtain the set of the corresponding least member of forming by each object minimal decomposition node of current role;
C, from undecomposed role, choose the role that included object is in minimum node layer, decompose the role as n+1;
D, respectively each n+1 is decomposed role as current role; Utilize each object the decomposition up to the minimal decomposition node layer set except that the minimal decomposition node set of corresponding n decomposition role each object of partial ordering relation to current role; Decompose role's least member set according to the decomposition result of current each object of role and corresponding n, utilize partial ordering relation to obtain current role's least member set;
E, if also have undecomposed role, then make n=n+1, and return execution in step C.
7. method as claimed in claim 6 is characterized in that, decomposes role's least member set described in the step D according to the decomposition result of current each object of role and corresponding n, and the least member set that utilizes partial ordering relation to obtain current role comprises:
For any two roles that current role comprised,, the bigger role of scope among two roles that satisfy partial ordering relation is deleted if satisfy partial ordering relation.
8. method according to claim 1 is characterized in that, encapsulation is integrated in the minimum data granularity set that each role is corresponding, obtains the corresponding data message of each role and comprises:
Minimum data granularity in the corresponding minimum data granularity set of each role is carried out vertical consolidation, laterally merges and is gone heavily, and the value of relevant minimum data granularity is added up to, and obtains the corresponding data message of each role.
9. method according to claim 1 is characterized in that, said at least one role who inherits according to the user comprises for said user with the legal data message in the corresponding role is adaptive:
According at least one role of user's succession and said user's access rights, the data message under these access rights that said role is corresponding is adaptive to said user.
Perhaps comprise:
According at least one role that the user inherits, all data messages that said role is corresponding are adaptive to said user.
10. according to each described method in the claim 1 to 9, it is characterized in that said at least two objects comprise: Organizations And Functions.
11. an intelligent information adaptive device is characterized in that, this device comprises:
Role's determination module is used to confirm comprise each role of the operation analysis system of different objects, and each role comprises at least two objects, an attribute on each object respective user aspect; Wherein, each object of operation analysis system comprises the node of different levels respectively;
Role's decomposing module is used for each object of each role is carried out the decomposition up to the minimal decomposition node layer of setting, and obtains the corresponding least member set of each role; Wherein, a minimal decomposition node of each object of role under each least member comprises;
The data map module; Be used for corresponding relation according to horizontal vertical two dimensions of data in said least member each least member of set and the operation analysis system; Said data are carried out the decomposition of minimum data granularity, obtain the corresponding relation of said least member and minimum data granularity; According to the corresponding relation of said least member and minimum data granularity, obtain the corresponding minimum data granularity set of each role;
The data encapsulation module is used for encapsulation is integrated in the corresponding minimum data granularity set of each role, obtains the corresponding data message of each role;
The information adaptation module is used at least one role according to user's succession, and the legal data message in the corresponding role is adaptive to said user.
12. device as claimed in claim 11 is characterized in that, said role's decomposing module comprises:
First role's extraction module was used for before all roles have decomposed, and from undecomposed each role, extracted a role as current role;
The first object decomposing module is used to utilize partial ordering relation that each object of current role is carried out the decomposition up to the minimal decomposition node layer of setting, and obtains the minimal decomposition node set of current each object of role;
The first least member acquisition module is used for the minimal decomposition node set according to said current each object of role, obtains the set of the corresponding least member of being made up of each object minimal decomposition node of current role.
13. device as claimed in claim 11 is characterized in that, said role's decomposing module comprises:
First role chooses module, is used for choosing the role that included object is in high node layer from every group of role with relation of inclusion, as the based decomposition role;
Second role's extraction module was used for before all basic roles have decomposed, and from undecomposed based decomposition role, extracted a based decomposition role as current role;
The first object decomposing module is used to utilize partial ordering relation that each object of current role is carried out the decomposition up to the minimal decomposition node layer of setting, and obtains the minimal decomposition node set of current each object of role;
The first least member acquisition module; Be used for minimal decomposition node set according to said current each object of role; Obtain the set of the corresponding least member of forming by each object minimal decomposition node of current role, the current role's who obtains least member is gathered offered the second least member acquisition module;
The second least member acquisition module is used for the minimal decomposition node set according to each each object of based decomposition role, obtains the set of the corresponding least member of being made up of each object minimal decomposition node of other role.
14. device as claimed in claim 11 is characterized in that, said role's decomposing module comprises:
Second role chooses module, is used for choosing the role that included object is in minimum node layer from every group of role with relation of inclusion, decomposes the role as n.Wherein, n=1;
The 3rd role's extraction module was used for before all n decomposition roles have decomposed, and decomposed the role from undecomposed n and chose a n decomposition role as current role;
The first object decomposing module is used to utilize partial ordering relation that each object of current role is carried out the decomposition up to the minimal decomposition node layer of setting, and obtains the minimal decomposition node set of current each object of role;
The first least member acquisition module is used for the minimal decomposition node set according to said current each object of role, obtains the set of the corresponding least member of being made up of each object minimal decomposition node of current role;
The 3rd role chooses module, is used for choosing the role that included object is in minimum node layer from undecomposed role, decomposes the role as n+1;
The 4th role's extraction module, be used for all n+1 decompose the role undecomposed intact before, decompose from undecomposed n+1 and to choose a n+1 the role and decompose the role as current role;
The second object decomposing module; Be used to utilize each object the decomposition up to the minimal decomposition node layer set except that the minimal decomposition node set of corresponding n decomposition role each object of partial ordering relation, obtain the decomposition result of current each object of role current role;
The 3rd least member acquisition module; Be used for the minimal decomposition node set of decomposing each object of role according to the decomposition result of current each object of role and corresponding n; Obtain the minimal decomposition node set of current each object of role; According to the minimal decomposition node set of said current each object of role, obtain the set of the corresponding least member of forming by each object minimal decomposition node of current role;
Judge module is used to judge whether also exist undecomposed role, then makes n=n+1, and notifies the 3rd role to choose module and carry out the role and choose.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201010624452.9A CN102567432B (en) | 2010-12-31 | 2010-12-31 | Intelligent information adaptation method and device for the same |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201010624452.9A CN102567432B (en) | 2010-12-31 | 2010-12-31 | Intelligent information adaptation method and device for the same |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102567432A true CN102567432A (en) | 2012-07-11 |
| CN102567432B CN102567432B (en) | 2014-11-05 |
Family
ID=46412861
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201010624452.9A Active CN102567432B (en) | 2010-12-31 | 2010-12-31 | Intelligent information adaptation method and device for the same |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102567432B (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105631608A (en) * | 2016-02-02 | 2016-06-01 | 明博教育科技股份有限公司 | Multistage mechanism mapping and synchronization method and system |
| CN109165518A (en) * | 2018-09-12 | 2019-01-08 | 浪潮软件集团有限公司 | Data authority division management method and device |
| CN113255000A (en) * | 2021-06-04 | 2021-08-13 | 曙光信息产业(北京)有限公司 | Data access control method and device, electronic equipment and readable storage medium |
| CN113297617A (en) * | 2021-05-26 | 2021-08-24 | 杭州安恒信息技术股份有限公司 | Authority data acquisition method and device, computer equipment and storage medium |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070157077A1 (en) * | 2005-12-22 | 2007-07-05 | International Business Machines Corporation | Accessible role and state information in HTML documents |
| CN101866360A (en) * | 2010-06-28 | 2010-10-20 | 北京用友政务软件有限公司 | Data warehouse authentication method and system based on object multidimensional property space |
-
2010
- 2010-12-31 CN CN201010624452.9A patent/CN102567432B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070157077A1 (en) * | 2005-12-22 | 2007-07-05 | International Business Machines Corporation | Accessible role and state information in HTML documents |
| CN101866360A (en) * | 2010-06-28 | 2010-10-20 | 北京用友政务软件有限公司 | Data warehouse authentication method and system based on object multidimensional property space |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105631608A (en) * | 2016-02-02 | 2016-06-01 | 明博教育科技股份有限公司 | Multistage mechanism mapping and synchronization method and system |
| CN109165518A (en) * | 2018-09-12 | 2019-01-08 | 浪潮软件集团有限公司 | Data authority division management method and device |
| CN113297617A (en) * | 2021-05-26 | 2021-08-24 | 杭州安恒信息技术股份有限公司 | Authority data acquisition method and device, computer equipment and storage medium |
| CN113255000A (en) * | 2021-06-04 | 2021-08-13 | 曙光信息产业(北京)有限公司 | Data access control method and device, electronic equipment and readable storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102567432B (en) | 2014-11-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110688348B (en) | File management system | |
| CN102521386B (en) | Method for grouping space metadata based on cluster storage | |
| US9369533B2 (en) | System and method for location monitoring based on organized geofeeds | |
| CN101840400B (en) | Multilevel classification retrieval method and system | |
| CN1609853A (en) | Context association diagram for computer system architecture | |
| CN102467521A (en) | Easily-extensible multi-level classification search method and system | |
| CN102906751A (en) | Method and device for data storage and data query | |
| CN108804602A (en) | A kind of distributed spatial data storage computational methods based on SPARK | |
| WO2005098654A3 (en) | User-definable hierarchy for database management | |
| WO2005111780A3 (en) | Property metadata navigation and assigment | |
| CN102541529A (en) | Query page generating device and method | |
| CN107391652A (en) | A kind of templating form interface defines system and method | |
| CN102567432A (en) | Intelligent information adaptation method and device for the same | |
| CN109074388A (en) | The priority of thumbnail preview is divided based on message content | |
| Ritchie et al. | Which countries are most densely populated? | |
| CN102779138A (en) | Hard disk access method of real time data | |
| Mythily et al. | Clustering models for data stream mining | |
| CN101814064B (en) | Establishment method of report template, report generation method and report system | |
| CN106156044A (en) | Data base's changing method and device | |
| CN105574204B (en) | Retrieval method and system for distributed power grid regulation and control operation data | |
| CN102110139A (en) | Analytic algorithm for geographic grid in telecommunication field | |
| CN102103600A (en) | Map building method and map system | |
| CN107273443A (en) | A kind of hybrid index method based on big data model metadata | |
| Trisolini et al. | Data integration and warehousing in Telecom Italia | |
| CN115587084A (en) | Comprehensive management system and method for geographic information data |
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 |