CN104052648A - Flow-directed collaborative communication - Google Patents
Flow-directed collaborative communication Download PDFInfo
- Publication number
- CN104052648A CN104052648A CN201410086667.8A CN201410086667A CN104052648A CN 104052648 A CN104052648 A CN 104052648A CN 201410086667 A CN201410086667 A CN 201410086667A CN 104052648 A CN104052648 A CN 104052648A
- Authority
- CN
- China
- Prior art keywords
- node
- inquiry
- section point
- response
- deadline date
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Landscapes
- Information Transfer Between Computers (AREA)
Abstract
A method for resolving a query received from a first node in a network includes accepting, by a second node in the network, ownership of the query from the first node, receiving, at the second node, an identification of a third node in the network, wherein the identification is received from a user of the second node and the user of the second node believes that a user of the third node has information necessary to resolve at least part of the query, and transferring, by the second node, ownership of the at least part of the query to the third node, wherein the accepting, the receiving, and the transferring dynamically generates a data structure that traces a propagation of the query, and the data structure is accessible to an origin of the query.
Description
Technical field
The present invention relates generally to collaboration communication, and relate more specifically to the stream bootup process for facilitating communications.
Background technology
The complexity growing with each passing day in modern global commerce market has been introduced new challenge to collection information with dealing with problems.Key business decision-making usually depends on for example, cooperation across the extensive network of individual (, colleague, client, supplier, business parnter etc.), and described individuality is provided for contributing to information and the answer of indivedual knowledge blocks of answering more extensive problem.Business is more complicated, may need the answer problem that more cooperates.In the net that the whole world is integrated truly, the delay of being introduced by different time zone also may be introduced further challenge.
Between the individuality of its input of needs, organize a meeting (for example, videoconference) for a kind of traditional solution that responds fast business demand.If relate to suitable personnel, answer immediately and decision-making that meeting is problem provide a kind of chance.But, ask any problem to obtain needed information if first a people does not know, it is difficult guaranteeing to relate to suitable personnel.And the validity of meeting also depends on organizes the individuality of this meeting well-defined agenda to be provided and to carry out detailed record.
Email (" email ") for another traditional solution that responds fast business demand.Email allows elementary stakeholder to arrive quickly larger audient compared with holding a meeting, and uses resource investment (thereby potential waste still less) still less.Email also utilizes collective knowledge base, allows problem to be forwarded to the other individuality that is considered to have answer.But, because Email tends to create open loop, so can not ensure to obtain answer (time zone difference also can increase the weight of this shortcoming) in required time.In addition, Email copy and forward the clue (thread) that may create bifurcated, make the history of rebuilding original query become difficulty.
Summary of the invention
The inquiry that the first node of solution from network receives comprises: accept the ownership from the described inquiry of described first node by the Section Point in described network; Receive the mark of the 3rd node in described network at described Section Point, wherein receive described mark from the user of described Section Point, and the described user of described Section Point believes that the user of described the 3rd node has the required information of at least a portion that solves described inquiry; And give described the 3rd node by described Section Point by the ownership transfer of described at least a portion of described inquiry, dynamically generated data structure of wherein said acceptance, described reception and described transfer, this data structure is followed the tracks of the propagation of described inquiry, and for the source of described inquiry, described data structure is addressable.For simple and clear reason, above description is with reference to three nodes, so that design of the present invention to be described; But, will be appreciated that, as become clearly from following more detailed description, can use any amount of node (comprise and be less than three nodes, and be greater than three nodes) to carry out said method.
Brief description of the drawings
For the more detailed mode of understanding in the above feature of the present invention of recording, can obtain description more specifically of the present invention with reference to embodiment, some of them embodiment is illustrated in the accompanying drawings.But, it should be noted that accompanying drawing has only illustrated exemplary embodiments of the present invention, and therefore can not be considered to the restriction of the scope of the invention, because the present invention can allow the embodiment of other effects equivalent.
Fig. 1 is the schematic diagram of a part for illustrated example network, in this network, can dispose embodiments of the invention;
Fig. 2 is explanation according to of the present invention for solving the flow chart of an embodiment of method of inquiry; And
Fig. 3 is the high level block diagram that uses the inquiry solution that realizes of universal computing device.
Embodiment
In one embodiment, the present invention is the method and apparatus of the collaboration communication for flowing guiding.Embodiments of the invention, by check ownership transfer series, effectively and efficiently provide the solution (for example, answer) for inquiry.In context of the present invention, " ownership " of inquiry (or response) means the responsibility that information is transmitted.In the situation that going wrong, this allows the path of tracking enquiry (or response) to return to arrival single " owner " at any time.
Especially, described process for example, starts from basis inquiry (, problem or demand), and naturally generates workflow with minimum effort, thereby causes extremely efficient data flow to feed back to elementary stakeholder (for example, the source of inquiry).Maximization provides the speed of information, and simultaneous minimization is during the course by the needed work of any individual, thereby overcomes the obstacle of organizational boundary, time zone and accessibility.
Fig. 1 is the schematic diagram of a part for illustrated example network, in this network, can dispose embodiments of the invention.Especially, a part for this network has represented the subset of network related in response inquiry.As shown, a part for this network comprises multiple nodes 102
1-102
n(being hereinafter referred to as " node 102 "), wherein each node represents a human user (hereinafter, using convertibly " user " and " node " human user to refer to be associated with node).For example, each user can be the employee of common commercial entity.This network can comprise other node, its not shown or do not participate in to inquiry response.Any node in node 102 can communicate by letter with other node 102 in network (personal messages transmission or like that for example, via e-mail); Communication link between node is indicated by the solid line in Fig. 1 and dotted line, and sets forth in more detail in conjunction with Fig. 2 hereinafter.Therefore, the connection between node 102 and node 102 jointly forms data structure, for example, set 100.Tree 100 has defined hierarchical structure, and wherein the node 102 in the lower level in hierarchical structure is follow-up (for example, sons) of the node (for example, father) in higher level.Described hierarchical structure only illustrates the inquiry from user to user and the propagation of the response that is associated, and any other relation between may not indicating user (for example, the role in commercial entity, or like that).
According to embodiments of the invention, the user represented by node 102 can cooperate, to form the solution for the inquiry being proposed by a user in these users.Further describe as following, inquiry propagates into one or more nodes of at least a portion that can respond inquiry from source node downwards along tree 100, and the response of described inquiry is upwards propagated and turned back to source node from responsive node.When from node-to-node forwarding inquiries and response, also shift their ownership.Therefore,, along with the proprietorial transfer of inquiry and response, the structure of tree 100 also dynamically develops.
Fig. 2 is explanation according to of the present invention for solving the flow chart of an embodiment of method of inquiry.For example, any Nodes implementation method 200 that can be in node illustrated in fig. 1 102.Therefore, in the discussion of method 200, with reference to the each element in Fig. 1.But method 200 be can't help network configuration illustrated in fig. 1 restriction, this network configuration is only exemplary.Advancing of method 200 caused tree, allly sets as illustrated in Figure 1 100.For ease of setting forth, suppose in the time of node 102 call method 200, at least set up and set beginning of 100 and (for example, comprise respectively first node 102
1at least one deck successor node, such as Section Point 102
2with the 3rd node 102
3).Therefore, method 200, from the visual angle of intermediate node 102, has described the process that solves inquiry, and this intermediate node 102 is neither the final destination that the source of inquiry neither be inquired about.
Method 200 starts from step 202.In step 204, Section Point 102 receives inquiry.For purposes of illustration, suppose the node 102 of Fig. 1
2the Section Point in step 204, although for example the 3rd node 102 of other node 102(
3) also can receive identical inquiry in the substantially the same time, and execution is similar to following discussed operation response.Inquiry originates from source node.In example illustrated in fig. 1, first node 102
1it is source node; But, may not be all this situation.For example, first node 102
1can be source node and the Section Point 102 that is arranged in tree 100
1between intermediate node.The user of source node can be called as inquiry " elementary stakeholder ", and this is because hypothesis he (or she) is the individuality of the information that need to be asked by inquiry.
The information (for example, the answer of problem) that elementary stakeholder is finding is identified in described inquiry.Other information is also specified in described inquiry, such as the deadline date that requires response, or any restriction (for example, confidentiality) being associated with asked information.In addition, the form (for example,, if the inquiry request date, the date can be the unique type of allowed response) of provided any response can be provided in inquiry.It should be noted that in step 204 by Section Point 102
2received inquiry can be not identical with the original query being sent by source node, if first node 102 particularly
1not the words of source node.For example,, by Section Point 102
2received inquiry can be the subquery (for example, only finding a part for the information of being found by original query) of original query.Alternately, to Section Point 102
2before forwarding inquiries, first node 102
1can not change inquiry (for example, first node 102 completely
1can believe Section Point 102
2can intactly respond this inquiry).Section Point 102
2to inquiry reception by the ownership of this inquiry from first node 102
1transfer to Section Point 102
2.Therefore, in the time receiving the ownership of inquiry, Section Point 102
2user become " secondary stakeholder ".Proprietorial transfer can for example, by receiving hint (, automatically), or can require the clearly acceptance of the node 102 that ownership is just being transferred to.
In step 206, Section Point 102
2the user at place determines whether he can respond inquiry.If this user determines that he can respond this inquiry, method 200 advances to step 208.In step 208, Section Point 102
2(under user's guiding) is to first node 102
1response is provided.This response can comprise supporting documentation alternatively.In one embodiment, if Section Point 102
2user can respond inquiry, but can not do so immediately (for example, he may need the time with polymerization and/or authorization information), he can be before providing real response, first to first node 102
1the deadline date of estimation is provided, and before the deadline date of described estimation, his expection responds.In this case, by Section Point 102
2deadline date of providing of user, and (before described any deadline date, any successor node is intended to Section Point 102 any deadline date
2information is provided), must be added together to meet any deadline date specified by source node.
Alternately, if Section Point 102
2user determine that he can not respond inquiry (for example, he need more information), method 200 advances to step 210.In step 210, Section Point 102
2user's recognition network at least one other user, described user's input may be that response inquiry is needed.
In step 212, for the each user who identifies in step 210, Section Point 102
2in tree 100, increase a new node 102.In example illustrated in fig. 1, for example, Section Point 102
2increase by the 4th node 102
4with the 5th node 102
5.Each new node 102 is associated with specific user and with the ad hoc inquiry (or " subquery ") for this specific user.Subquery with by the receiving node 102 in step 204
2received inquiry is associated; But subquery can only be found a part for the information of being found by inquiry received in step 204.By this way, Section Point 102
2user the different piece of inquiry can be directed to different users, described different user can have different information and/or special knowledge, instead of rely on unique user can be in response to the possibility of whole inquiry.Each subquery is limited by any regulation (for example, about deadline date, confidentiality etc.) that node 102 applies in original query (and subquery of any centre), and described node 102 is nodes that original query has now traveled through arrival.Each subquery is also limited by by Section Point 102
2any other regulation applying.
In step 214, Section Point 102
2send message to the each user who has created for it in user of a new node.In one embodiment, when increasing when new node, automatically send this message, as the machine-processed part of method 200 (for example,, in comparison with requiring Section Point 102
2user make certain clear and definite action).The ad hoc inquiry that the specific user that this message comprises the node being addressed to message is associated.Therefore, the ownership of subquery is from Section Point 102
2transfer to the new node being created.
In step 216, Section Point 102
2receive at least a portion user's that in comfortable step 214, message is sent to the response of returning.As mentioned above, before receiving actual response, Section Point 102
2can receive the deadline date that expecting of estimation receives response.In one embodiment, the one or more responses in described response can comprise supporting documentation.In one embodiment, the polymerization of the response being provided by the node 102 of tree 100 hierarchical structure Zhong Geng lower floor can be provided in response.In this case, Section Point 102
2the node that receives response from it may receive and process its response of subquery that creates and send (for example, being similar to step 212-214) for it.In step 216, transfer to Section Point 102 for the ownership of the response of subquery from responsive node 102
2.Owing to having shifted ownership, so responsive node 102 is closed (, becoming inactive in tree 100).
In optional step, 218(is shown in broken lines) in, Section Point 102
2user process received response.For example, response may be by Section Point 102
2examination and/or polymerization, to form the suitable response for inquiry received in step 204.In alternate embodiments, by Section Point 102
2the subquery creating can be walked around Section Point 102 by specified response
2and be directly passed to first node 102
1.
Then, method 200 advances to step 208, at this, as mentioned above, Section Point 102
2to first node 102
1transmit response.In step 208, the ownership of response is from Section Point 102
2transfer to first node 102
1.Owing to having shifted ownership, therefore Section Point 102
2close.Depend on first node 102
1send inquiry, first node 102 to how many other nodes
1can process its received any response to be similar to the described mode of integrating step 218.
In step 220, at least with respect to Section Point 102
2, method 200 finishes.For the more high-rise any node 102(that is arranged in hierarchical structure such as first node 102
1), some step of method 200 can continue (for example, receiving, process and/or transmit response), until source node has received the response for original query.
Therefore, the user of source node does not need to know who can respond original query; He only need to know to it and for example sends inquiry, to promote the next man (people of, directly or indirectly can access response required information) of response.Inquiry (for example, the subquery of original query or original query) be forwarded to everyone create the next part that generates the required workflow of response.The user of source node recognizes that the scope of the tree being created, the time range that response is expected and a part of possibility of inquiring about stop at the user place without response always.The user of source node can be at any time to tree modify (for example,, by non-key or probably cause the part of the structure of unacceptable delay to be pruned, by covering the deadline date of asking, or like that).
In one embodiment, send and transmit inquiry and the response of propagating according to method 200 by central server.Therefore, the progress of original query (and any subquery being associated) and the development of tree are followed the tracks of and safeguarded to central server.For example, this progress and development can be visual on the webpage by this server hosted (host).In one embodiment, the node 102 being traveled through by original query is controlled the access to webpage.For example, whom can limit its original query response of original query (and/or for) be visible to source node to.Creating the node 102 of subquery, whom can further limit the described subquery response of subquery (and/or for) be visible to.Therefore, can make some information only to directly applicable user-accessible of this information, thereby avoid information overload.This has also prevented errored response further upwards to propagate along tree.But, for source node, the full breadth of tree and can expect that for the time range of the response of original query be obtainable always.Therefore, source node can upgrade from current proprietorial any user's solicited status with inquiry (or the subquery being associated).Server also can be stored described tree, in the future, if generate similar inquiry, can seek advice from identical user.This type of knowledge base can promote the response more fast for future query, and is provided for the data of the statistical analysis (for example, abnormal detection and improved exploitation) of response process.
Comprising of server also can promote the best approach (for example, Email, text message etc.) and/or the identification of time (contact is added to the specific user of node before this time) (for example,, after the 5:00PM at non-weekend).For example, server can record those methods and/or time and generate response the most fast, and in the time being node for future query by user add, these methods and/or time is used as to default setting.Server is addressable user's calendar application also, and it walks around permission method 200 user of unavailable within the scope of required time (for example, on holiday or in session).
Although method 200 is carried out some action description user who is associated with node 102 that serves as reasons, in alternate embodiments, (, there is no user's intervention or help) can be automatically carried out by the computing equipment being operated by user in these actions.For example, user's computing equipment executable program, this program automatically scans computing equipment and obtains asked information, or automatically to other user's forwarding inquiries.
Fig. 3 is the high level block diagram that uses the inquiry solution that realizes of universal computing device 300.In one embodiment, universal computing device 300 comprises: processor 302, memory 304, inquiry solve module 305 and various I/O (I/O) equipment 306, such as display, keyboard, mouse, writing pen, wireless network access card etc.In one embodiment, at least one I/O equipment is memory device (for example, disc driver, CD drive, floppy disk, path selection tool and/or test pattern generation instrument).Should be understood that, inquiry can be solved to module 305 and be embodied as the physical equipment or the subsystem that are coupled to processor by communication port.
Alternately, can be by (or the even combination of software and hardware of one or more software application, for example use application-specific integrated circuit (ASIC) (ASIC)) represent that inquiry solves module 305, wherein from storage medium (for example, I/O equipment 306) load software, and move this software by processor 302 in the memory 304 of universal computing device 300.Therefore, in one embodiment, as described with reference to aforementioned figures in this article, can for example, solve module 305 in the upper storage of the computer-readable recording medium of nonvolatile (, RAM, magnetic or CD-ROM driver or floppy disc etc.) for the inquiry that generates the collaboration communication that flows guiding.
Although it should be noted that and do not explicitly point out, one or more steps of method described herein can comprise: according to the desired storage of application-specific, demonstration and/or calculation procedure.That is to say, desired according to application-specific, can be by any data of discussing in method, record, field and/or intermediate object program storage, show and/or output to another equipment.In addition, record decision or comprise step or the square frame in the accompanying drawing of decision-making, may not require the Liang Ge branch in decision all to carry out.That is to say, a branch in the branch in decision can be regarded as optional step.
Be for embodiments of the invention although above-mentioned, can design other or further embodiment of the present invention, and not deviate from base region of the present invention.The various embodiment or its part that present can be combined to create further embodiment herein.In addition, be relatively or position terms such as the term at top, limit, bottom, front portion, rear portion etc., and use with respect to exemplary embodiment illustrated in accompanying drawing, and therefore replaceable such these terms.
Claims (38)
1. for solving a method for the inquiry received from the first node of network, described method comprises:
Accept the ownership from the described inquiry of described first node by the Section Point in described network;
Received the mark of the 3rd node in described network by described Section Point, wherein receive described mark from the user of described Section Point, and the described user of described Section Point believes that the user of described the 3rd node has the required information of at least a portion that solves described inquiry; And
Give described the 3rd node by described Section Point by the ownership transfer of described at least a portion of described inquiry,
Wherein said acceptance, described reception and described transfer dynamically generate the data structure of propagation of following the tracks of described inquiry, and for the source of described inquiry, described data structure is addressable.
2. method according to claim 1, wherein said data structure comprises multiple nodes, described multiple node comprises: described first node, described Section Point and described the 3rd node, described multiple nodes are arranged to the hierarchical structure of the described propagation of explanation.
3. method according to claim 1, also comprises:
Accept the ownership from the first response of described the 3rd node by described Section Point, wherein said the first respond packet is containing the information of the described at least a portion in response to described inquiry; And
Give described first node by described Section Point by the ownership transfer of the second response, wherein said the second respond packet is containing at least a portion of the described information of the described at least a portion in response to described inquiry.
4. method according to claim 3, also comprises, before shifting the ownership of described the second response:
Examine described the first response by described Section Point; And
Generate described the second response according to described examination.
5. method according to claim 4, wherein said examination comprises:
Described in polymerization first response with by described Section Point from the received information of the 4th node.
6. method according to claim 4, also comprises:
Closed by described Section Point, wherein said closing causes described Section Point inertia in described data structure.
7. method according to claim 3, also comprises:
By described Section Point, before receiving described the first response, receive the deadline date from described the 3rd node, the wherein said deadline date provides described the 3rd node expection that the time range of described the first response is provided.
8. method according to claim 1, wherein said inquiry is limited by restrictive condition.
9. method according to claim 8, wherein said restrictive condition comprises the deadline date of described first node requirement for the response of described inquiry.
10. method according to claim 8, wherein said restrictive condition comprises restriction that can be shared with whom about described inquiry.
11. methods according to claim 8, wherein said restrictive condition comprises the constraint about the form of the response for described inquiry.
12. methods according to claim 8, described at least a portion of the wherein said described inquiry of transferring to described the 3rd node is also limited by described restrictive condition.
13. methods according to claim 1, also comprise:
Transmit the deadline date by described Section Point to described first node, the wherein said deadline date provides described Section Point expection that the time range for the response of described inquiry is provided.
14. methods according to claim 13, the wherein said deadline date has been considered any further deadline date of described Section Point expection reception for the response of described at least a portion of described inquiry.
15. methods according to claim 14, wherein said deadline date and described further deadline date are added together, and meet the original deadline date of described inquiry to meet described first node request.
16. methods according to claim 11, the wherein said deadline date can be changed by the described source of described inquiry.
17. methods according to claim 1, wherein data structure can be changed by the described source of described inquiry.
18. methods according to claim 1, also comprise:
In described inquiry, apply restrictive condition by described Section Point.
19. methods according to claim 1, once wherein solve described inquiry, store described data structure.
20. 1 kinds for solving the device of the inquiry received from the first node of network, and described device comprises:
Processor, it is arranged in the Section Point place of described network; And
Computer-readable recording medium, it comprises executable program, in the time carrying out described executable program by described processor, makes described processor execution step, and described step comprises:
Accept the ownership from the described inquiry of described first node by the Section Point in described network;
Received the mark of the 3rd node in described network by described Section Point, wherein receive described mark from the user of described Section Point, and the described user of described Section Point believes that the user of described the 3rd node has the required information of at least a portion that solves described inquiry; And
Give described the 3rd node by described Section Point by the ownership transfer of described at least a portion of described inquiry,
Wherein said acceptance, described reception and described transfer dynamically generate the data structure of propagation of following the tracks of described inquiry, and for the source of described inquiry, described data structure is addressable.
21. devices according to claim 20, wherein said data structure comprises multiple nodes, described multiple node comprises: described first node, described Section Point and described the 3rd node, described multiple nodes are arranged to the hierarchical structure of the described propagation of explanation.
22. devices according to claim 20, wherein said step also comprises:
Accept the ownership from the first response of described the 3rd node by described Section Point, wherein said the first respond packet is containing the information of the described at least a portion in response to described inquiry; And
Give described first node by described Section Point by the ownership transfer of the second response, wherein said the second respond packet is containing at least a portion of the described information of the described at least a portion in response to described inquiry.
23. devices according to claim 22, wherein said step also comprises, before shifting the ownership of described the second response:
Examine described the first response by described Section Point; And
Generate described the second response according to described examination.
24. devices according to claim 23, wherein said examination comprises:
Described in polymerization first response with by described Section Point from the received information of the 4th node.
25. devices according to claim 23, wherein said step also comprises:
Closed by described Section Point, wherein said closing causes described Section Point inertia in described data structure.
26. devices according to claim 22, wherein said step also comprises:
By described Section Point, before receiving described the first response, receive the deadline date from described the 3rd node, the wherein said deadline date provides described the 3rd node expection that the time range of described the first response is provided.
27. devices according to claim 20, wherein said inquiry is limited by restrictive condition.
28. devices according to claim 27, wherein said restrictive condition comprises the deadline date of described first node requirement for the response of described inquiry.
29. devices according to claim 27, wherein said restrictive condition comprises restriction that can be shared with whom about described inquiry.
30. devices according to claim 27, wherein said restrictive condition comprises the constraint about the form of the response for described inquiry.
31. devices according to claim 27, described at least a portion of the wherein said described inquiry of transferring to described the 3rd node is also limited by described restrictive condition.
32. devices according to claim 20, wherein said step also comprises:
Transmit the deadline date by described Section Point to described first node, the wherein said deadline date provides described Section Point expection that the time range for the response of described inquiry is provided.
33. devices according to claim 32, the wherein said deadline date has been considered any further deadline date of described Section Point expection reception for the response of described at least a portion of described inquiry.
34. devices according to claim 33, wherein said deadline date and described further deadline date are added together, and are required to meet the original deadline date of described inquiry to meet described first node.
35. devices according to claim 30, the wherein said deadline date can be changed by the described source of described inquiry.
36. devices according to claim 20, wherein data structure can be changed by the described source of described inquiry.
37. devices according to claim 20, wherein said step also comprises:
In described inquiry, apply restrictive condition by described Section Point.
38. devices according to claim 20, once wherein solve described inquiry, store described data structure.
Applications Claiming Priority (4)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| US13/795,063 US9258356B2 (en) | 2013-03-12 | 2013-03-12 | Flow-directed collaborative communication |
| US13/795,063 | 2013-03-12 | ||
| US13/969,970 | 2013-08-19 | ||
| US13/969,970 US9270739B2 (en) | 2013-03-12 | 2013-08-19 | Flow-directed collaborative communication |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN104052648A true CN104052648A (en) | 2014-09-17 |
Family
ID=51505032
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410086667.8A Pending CN104052648A (en) | 2013-03-12 | 2014-03-11 | Flow-directed collaborative communication |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104052648A (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1489480A2 (en) * | 1995-02-01 | 2004-12-22 | Macrovision Corporation | A method and system for managing a data object so as to comply with predetermined conditions for usage |
| US20060101133A1 (en) * | 2004-11-10 | 2006-05-11 | Patrick Sbrzesny | System and method for intermediation of services |
| CN101075266A (en) * | 2007-07-16 | 2007-11-21 | 华为技术有限公司 | Searching system and method |
| US20110106895A1 (en) * | 2009-10-30 | 2011-05-05 | Google Inc. | Social search engine |
-
2014
- 2014-03-11 CN CN201410086667.8A patent/CN104052648A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1489480A2 (en) * | 1995-02-01 | 2004-12-22 | Macrovision Corporation | A method and system for managing a data object so as to comply with predetermined conditions for usage |
| US20060101133A1 (en) * | 2004-11-10 | 2006-05-11 | Patrick Sbrzesny | System and method for intermediation of services |
| CN101075266A (en) * | 2007-07-16 | 2007-11-21 | 华为技术有限公司 | Searching system and method |
| US20110106895A1 (en) * | 2009-10-30 | 2011-05-05 | Google Inc. | Social search engine |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Hervas-Oliver et al. | Are technology gatekeepers renewing clusters? Understanding gatekeepers and their dynamics across cluster life cycles | |
| Khurum et al. | Extending value stream mapping through waste definition beyond customer perspective | |
| WO2007055810A2 (en) | Methods and systems for collaborating communities of practice | |
| Munasinghe | Computers and informatics in developing countries | |
| US20190102723A1 (en) | Systems for automated profile building, skillset identification, and service ticket routing | |
| US11689481B2 (en) | Automated, extensible natural-language conversational system | |
| Wagstrom et al. | Does latitude hurt while longitude kills? geographical and temporal separation in a large scale software development project | |
| US7209909B2 (en) | Knowledge management system and method | |
| Schneider et al. | Digital Technologies in the Workplace: A Ne (s) t of Paradoxes | |
| Dorn et al. | Analyzing runtime adaptability of collaboration patterns | |
| Antoni | Virtual teams and digital collaboration | |
| US9754233B1 (en) | Centralized employee data analytics | |
| Olsson et al. | Scale and responsiveness in large-scale software development | |
| WO2007055807A2 (en) | Methods and systems for providing knowledge documents | |
| Lasecki et al. | Real-time collaborative planning with the crowd | |
| Schallenmueller | Smart workplace technology buzz | |
| CN104052648A (en) | Flow-directed collaborative communication | |
| Walimbe | To overcome communication challenges in distributed/virtual scrum teams | |
| Filip et al. | Collaborative decision-making: concepts, methods, and supporting information and communication technologies | |
| Dlamini | The potential use of the Internet of Things (IoT) in South African retail businesses | |
| Bandi et al. | Future of work and work skills in knowledge-intensive services: impact of new media and technologies | |
| US10324994B2 (en) | Flow-directed collaborative communication | |
| Huber | 16 Information Technology and Organizational Decision Making | |
| Dalkir | Computer-mediated knowledge sharing | |
| US20240020608A1 (en) | Software-as-a-service innovation automation process and system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20140917 |
|
| WD01 | Invention patent application deemed withdrawn after publication |