1. A substantially planar glazing, comprising:
a ply of glazing material;
a ply of plastic material bonded to the ply of glazing material;
at least first and second antennas, embedded in the ply of plastic material;
at least first and second conductors, connected to the first and second antennas;
wherein the first and second conductors are in direct current isolation from each other, configured so that the first conductor runs adjacent to, and substantially parallel to, the second conductor, so that alternating current coupling occurs therebetween;
wherein the first and second conductors are embedded at different depths in the thickness of the ply of plastic material such that when viewed along a line perpendicular to the plane of the glazing one conductor is at least partially obscured by the other.
2. A glazing according to claim 1, wherein the average distance between the first and second conductors is less than 1 millimetre.
3. A glazing according to claim 1, wherein the first and second conductors fully overlap each other in the direction of the thickness of the ply of plastic material.
4. A glazing according to claim 1, wherein a contact is on a surface of the ply of glazing material in direct current isolation from the first and second conductors and the contact overlaps at least one conductor so that alternating current coupling occurs therebetween.
5. A glazing according to claim 1, wherein a contact has conductive connection to the first conductor and is in direct current isolation from the second conductor, so that the first and second conductors share a single connection to an external circuit via the contact so enabling a transfer of signals from the first and second conductors to the external circuit.
6. A glazing according to claim 1, wherein a flexible conductor in direct current connection with a contact is folded around an edge of the ply of glazing material.
7. A glazing according to claim 1, wherein the second conductor is thinner than the first conductor.
8. A glazing according to claim 7, wherein the thin second conductor is connected to a thin second antenna which is positioned in a vision area of the glazing.
9. A glazing according to claim 1, wherein at least one conductor is at least partially hidden from view by an obscuration band.
10. A glazing according to claim 1, wherein a third conductor is configured adjacent to a portion of the first conductor, wherein the first and second conductors are in direct current isolation from the third conductor and the third conductor is substantially parallel to the portion, so that alternating current coupling occurs therebetween.
11. A glazing according to claim 1, wherein the length of the second conductor is selected to be approximately equal to an odd multiple of a quarter of an effective wavelength in the glazing Lambda Effective corresponding to a resonant frequency f, such that the second conductor and the first conductor form a transmission line acting as a band-pass filter, and signals in the second conductor in a bandwidth centred on frequency f are transferred to the first conductor by alternating current coupling.
12. A glazing according to claim 1, wherein at least one conductor is insulated wire and the wire diameter, including insulation, is less than 0.21 millimetres.
13. A method of manufacturing a glazing, comprising:
providing a ply of glazing material;
providing a ply of plastic material, bonded to the ply of glazing material;
providing at least first and second antennas, embedded in the ply of plastic material;
providing at least first and second conductors, connected to the first and second antennas;
wherein the first and second conductors are in direct current isolation from each other, configured so that at least a portion of the first conductor runs adjacent to, and substantially parallel to, a portion of the second conductor, so that alternating current coupling occurs therebetween; and
embedding the first and second conductors at different depths in the ply of plastic material such that when viewed along a line perpendicular to the plane of the glazing one conductor is at least partially obscured by the other.
14. A method according to claim 14, further comprising configuring the first and second conductors to fully overlap each other in the direction of the thickness of the ply of plastic material.
15. A method according to claim 13, wherein the embedding of the first and second conductors comprises embedding the first and second conductors by means of an ultrasonic soldering tool having a tip of width less than or equal to 4 millimetres.
16. A glazing according to claim 1, wherein at least one conductor is insulated wire and the wire diameter, including insulation, is less than 0.16 millimetres.
17. A glazing according to claim 1, wherein at least one conductor is insulated wire and the wire diameter, including insulation, is less than 0.09 millimetres.
The claims below are in addition to those above.
All refrences to claim(s) which appear below refer to the numbering after this setence.
1. A method, comprising:
at a computer system:
formatting for display a hierarchical data structure associated with a transaction, wherein the hierarchical data structure comprises a plurality of structural elements;
spawning, from a first sub-node in a plurality of sub-nodes to a second sub-node in the plurality of sub-nodes, a branch in a directed acyclic graph, the directed acyclic graph including: (a) a root node corresponding to a master instance of the hierarchical data structure, (b) the plurality of sub-nodes, and (c) a plurality of branches, wherein each respective sub-node in the plurality of sub-nodes corresponds to an edited version of the hierarchical data structure in a plurality of edited versions of the hierarchical data structure, and wherein a respective sub-node in the plurality of sub-nodes is connected with another sub-node in the plurality of sub-nodes by at least one branch in the plurality of branches;
wherein a respective edited version in the plurality of edited versions of the hierarchical data structure is associated with (a) a respective secondary instance of the hierarchical data structure, and (b) a respective change set corresponding to the secondary instance; and
wherein the respective change set includes one or more edits, by a user associated with the respective edited version of the hierarchical data structure, to the hierarchical data structure;
obtaining (a) a first change set associated with a first edited version of the hierarchical data structure, wherein the first change set is also associated with the first sub-node; and (b) a second change set associated with a second edited version of the hierarchical data structure, wherein the second change set is associated with a third sub-node in the plurality of sub-nodes, the third sub-node having at least one common ancestor node with the first sub-node in the directed acyclic graph; and wherein the first change set is associated with a first user and the second change set is associated with a second user and wherein the first edited version and the second edited version are in the plurality of edited versions;
responsive to a predefined user selection:
merging a portion of the first change set with a portion of the second change set to produce a third change set;
generating an additional secondary instance of the hierarchical data structure by applying one or more edits included in the third change set to the plurality of structural elements included in the master instance of the hierarchical data structure;
associating the additional secondary instance of the hierarchical data structure with an edited version of the hierarchical data structure; and
associating the edited version of the hierarchical data structure with the second sub-node in the directed acyclic graph.
2. The method of claim 1, wherein the first user and the second user have a competing or an adverse interest in the transaction.
3. The method of claim 2, wherein
an access of the first user encompasses both the first and the second change sets, and
an access of the second user is limited to the second change set.
4. The method of claim 1, wherein the first user and the second user are on a common side of the transaction.
5. The method of claim 1, wherein the predefined user selection is made by a third user having responsibility for approving edits by the first user or the second user.
6. The method of claim 1, wherein merging the portion of the first change set with the portion of the second change set includes:
when the merging does not result in a conflict,
merging, without user intervention, the portion of the first change set with the portion of the second change set; and
when the merging does result in a conflict between edits in the portion of the first change set and the edits in the portion of the second change set,
requesting a user to resolve the conflict.
7. The method of claim 1, wherein merging the portion of the first change set with the portion of the second change set includes:
when the merging does not result in a change of semantics of the master instance of the hierarchical data structure,
merging, without user intervention, the portion of the first change set with the portion of the second change set; and
when the merging does result in a change of semantics of the master hierarchical data structure,
requesting a user to accept or reject the change of semantics.
8. The method of claim 1, wherein the transaction includes one of: an IPO transaction, a merger or acquisition transaction, a rights issue transaction, a debt issuance transaction, or a security related transaction.
9. The method of claim 1, wherein content of the master instance of the hierarchical data structure does not change.
10. The method of claim 1, wherein the hierarchical data structure further includes one or more sections, and each section in the one or more sections includes one or more structural elements in the plurality of structural elements.
11. The method of claim 1, wherein a structural element in the plurality of structural elements corresponds to a paragraph having one or more text or non-text elements in the hierarchical data structure.
12. The method of claim 1, wherein the applying one or more edits included in the third change set to the plurality of structural elements included in the master instance of the hierarchical data structure comprises:
incorporating, into the hierarchical data structure, some, but not all, edits in the one or more edits.
13. The method of claim 1, wherein the respective secondary instance of the hierarchical data structure is associated with a compliance checklist,
wherein the compliance checklist includes one or more compliance items associated with a portion of the respective secondary instance of the hierarchical data structure; and
wherein the one or more compliance items correspond to one or more requirements that need to be fulfilled before completing the transaction.
14. The method of claim 13, further comprising:
updating, without user intervention, the compliance checklist in accordance with a change to the portion of the respective secondary instance of the hierarchical data structure.
15. The method of claim 1, wherein the respective secondary instance of the hierarchical data structure is associated with a verification checklist,
wherein the verification checklist includes information identifying one or more documents associated with a portion of the respective secondary instance of the hierarchical data structure; and
wherein the one or more documents verify, as deemed by a user, the portions of the hierarchical data structure.
16. The method of claim 15, wherein the verification includes, in accordance with a determination that a respective portion of the one or more portions of the hierarchical data structure constitutes an assertion of fact or is based on an explicit or implicit assumption of fact, confirming accuracy of the assertion or the assumption of fact using the first document.
17. The method of claim 15, further comprising:
updating, without user intervention, the verification checklist in accordance with a change to the portion of the respective secondary instance of the hierarchical data structure.
18. A computer system, comprising:
one or more processors;
memory storing one or more programs for execution by the one or more processors, the one or more programs including instructions for:
formatting for display a hierarchical data structure associated with a transaction, wherein the hierarchical data structure comprises a plurality of structural elements;
spawning, from a first sub-node in a plurality of sub-nodes to a second sub-node in the plurality of sub-nodes, a branch in a directed acyclic graph, the directed acyclic graph including: (a) a root node corresponding to a master instance of the hierarchical data structure, (b) the plurality of sub-nodes and (c) a plurality of branches; wherein each sub-node in the plurality of sub-nodes corresponds to an edited version of the hierarchical data structure in a plurality of edited versions of the hierarchical data structure and wherein a respective sub-node in the plurality of sub-nodes is connected with another sub-node in the plurality of sub-nodes by at least one branch in the plurality of branches;
wherein a respective edited version in the plurality of edited versions of the hierarchical data structure is associated with (a) a respective secondary instance of the hierarchical data structure, and (b) a respective change set corresponding to the secondary instance; and
wherein the respective change set includes one or more edits, by a user associated with the respective edited version of the hierarchical data structure, to the hierarchical data structure;
obtaining (a) a first change set associated with a first edited version of the hierarchical data structure, wherein the first change set is also associated with the first sub-node; and (b) a second change set associated with a second edited version of the hierarchical data structure, wherein the second change set is associated with a third sub-node in the plurality of sub-nodes, the third sub-node having at least one common ancestor node with the first sub-node in the directed acyclic graph; and wherein the first change set is associated with a first user and the second change set is associated with a second user and wherein the first edited version and the second edited version are in the plurality of edited versions;
responsive to a predefined user selection:
merging a portion of the first change set with a portion of the second change set to produce a third change set;
generating an additional secondary instance of the hierarchical data structure by applying one or more edits included in the third change set to the plurality of structural elements included in the master instance of the hierarchical data structure;
associating the additional secondary instance of the hierarchical data structure with an edited version of the hierarchical data structure; and
associating the edited version of the hierarchical data structure with the second sub-node in the directed acyclic graph.
19. The system of claim 18, wherein the first user and the second user have a competing or an adverse interest in the transaction.
20. The system of claim 18, wherein
an access of the first user encompasses both the first and the second change sets, and
an access of the second user is limited to the second change set.
21. The system of claim 18, wherein the first user and the second user are on a common side of the transaction.
22. The system of claim 18, wherein the predefined user selection is made by a third user having responsibility of approving edits by the first user or the second user.
23. The system of claim 18, wherein the instructions for merging the portion of the first change set with the portion of the second change set include instructions for:
when the merging does not result in a conflict,
merging, without user intervention, the portion of the first change set with the portion of the second change set; and
when the merging does result in a conflict between edits in the portion of the first change set and the edits in the portion of the second change set,
requesting a user to resolve the conflict.
24. The system of claim 18, wherein the instructions for merging the portion of the first change set with the portion of the second change set include instructions for:
when the merging does not result in a change of semantics of the hierarchical data structure,
merging, without user intervention, the portion of the first change set with the portion of the second change set; and
when the merging does result in a change of semantics of the hierarchical data structure,
requesting a user to accept or reject the change of semantics.
25. The system of claim 18, wherein the transaction includes one of: an IPO transaction, a merger or acquisition transaction, a rights issue transaction, a debt issuance transaction, or a security related transaction.
26. The system of claim 18, wherein content of the master instance of the hierarchical data structure does not change.
27. The system of claim 18, wherein the hierarchical data structure further includes one or more sections, and each section in the one or more sections includes one or more structural elements in the plurality of structural elements.
28. The system of claim 18, wherein a respective structural element in the plurality of structural elements corresponds to a paragraph having one or more text or non-text elements in the hierarchical data structure.
29. The system of claim 18, wherein the instructions for applying one or more edits included in the third change set to the plurality of structural elements included in the master instance of the hierarchical data structure include instructions for:
incorporating, into the hierarchical data structure, some, but not all, edits in the one or more edits.
30. The system of claim 18, wherein the respective secondary instance of the hierarchical data structure is associated with a compliance checklist,
wherein the compliance checklist includes one or more compliance items associated with a portion of the respective secondary instance of the hierarchical data structure; and
wherein the one or more compliance items correspond to one or more requirements that need to be fulfilled before completing the transaction.
31. The system of claim 30, wherein the one or more programs further comprise instructions for:
updating, without user intervention, the compliance checklist in accordance with a change to the portion of the respective secondary instance of the hierarchical data structure.
32. The system of claim 18, wherein the respective secondary instance of the hierarchical data structure is associated with a verification checklist,
wherein the verification checklist includes information identifying one or more documents associated with a portion of the secondary instance of the hierarchical data structure; and
wherein the one or more documents verify, as deemed by a user, the portions of the hierarchical data structure.
33. The system of claim 32, wherein the verification includes: in accordance with a determination that a respective portion of the one or more portions of the hierarchical data structure constitutes an assertion of fact or is based on an explicit or implicit assumption of fact: confirming accuracy of the assertion or the assumption of fact using the first document.
34. The system of claim 32, wherein the one or more programs further comprise instructions for:
updating, without user intervention, the verification checklist in accordance with a change to the portion of the respective secondary instance of the hierarchical data structure.
35. A non-transitory computer readable storage medium storing one or more programs for execution by the one or more processors of a computer system, the one or more programs including instructions for:
formatting for display a hierarchical data structure associated with a transaction, wherein the hierarchical data structure comprises a plurality of structural elements;
spawning, from a first sub-node in a plurality of sub-nodes to a second sub-node in the plurality of sub-nodes, a branch in a directed acyclic graph, the directed acyclic graph including: (a) a root node corresponding to a master instance of the hierarchical data structure, (b) the plurality of sub-nodes and (c) a plurality of branches, wherein each respective sub-node in the plurality of sub-nodes corresponds to an edited version of the hierarchical data structure in a plurality of edited versions of the hierarchical data structure, and wherein a respective sub-node in the plurality of sub-nodes is connected with another sub-node in the plurality of sub-nodes by at least one branch in the plurality of branches;
wherein a respective edited version in the plurality of edited versions of the hierarchical data structure is associated with (a) a respective secondary instance of the hierarchical data structure, and (b) a respective change set corresponding to the secondary instance; and
wherein the respective change set includes one or more edits, by a user associated with the respective edited version of the hierarchical data structure, to the hierarchical data structure;
obtaining (a) a first change set associated with a first edited version of the hierarchical data structure, wherein the first change set is also associated with the first sub-node, and (b) a second change set associated with a second edited version of the hierarchical data structure, wherein the second change set is associated with a third sub-node in the plurality of sub-nodes, the third sub-node having at least one common ancestor node with the first sub-node in the directed acyclic graph; and wherein the first change set is associated with a first user and the second change set is associated with a second user and wherein the first edited version and the second edited version are in the plurality of edited versions;
responsive to a predefined user selection:
merging a portion of the first change set with a portion of the second change set to produce a third change set;
generating an additional secondary instance of the hierarchical data structure by applying one or more edits included in the third change set to the plurality of structural elements included in the master instance of the hierarchical data structure;
associating the secondary instance of the hierarchical data structure with an edited version of the hierarchical data structure; and
associating the edited version of the hierarchical data structure with the second sub-node in the directed acyclic graph.
36. The non-transitory computer readable storage medium of claim 35, wherein the first user and the second user have a competing or an adverse interest in the transaction.
37. The non-transitory computer readable storage medium of claim 36, wherein
an access of the first user encompasses both the first and the second change sets, and
an access of the second user is limited to the second change set.
38. The non-transitory computer readable storage medium of claim 35, wherein the first user and the second user are on a common side of the transaction.
39. The non-transitory computer readable storage medium of claim 35, wherein the predefined user selection is made by a third user having responsibility of approving edits by the first or the second user.
40. The non-transitory computer readable storage medium of claim 35, wherein the instructions for merging the portion of the first change set with the portion of the second change set include instructions for:
when the merging does not result in a conflict,
merging, without user intervention, the portion of the first change set with the portion of the second change set; and
when the merging does result in a conflict between edits in the portion of the first change set and the edits in the portion of the second change set,
requesting a user to resolve the conflict.
41. The non-transitory computer readable storage medium of claim 35, wherein the instructions for merging the portion of the first change set with the portion of the second change set include instructions for:
when the merging does not result in a change of semantics of the hierarchical data structure,
merging, without user intervention, the portion of the first change set with the portion of the second change set; and
when the merging does result in a change of semantics of the hierarchical data structure,
requesting a user to accept or reject the change of semantics.
42. The non-transitory computer readable storage medium of claim 35, wherein the transaction includes one of: an IPO transaction, a merger or acquisition transaction, a rights issue transaction, a debt issuance transaction, or a security related transaction.
43. The non-transitory computer readable storage medium of claim 35, wherein content of the master instance of the hierarchical data structure does not change.
44. The non-transitory computer readable storage medium of claim 35, wherein the hierarchical data structure further includes one or more sections, and each section in the one or more sections includes one or more structural elements in the plurality of structural elements.
45. The non-transitory computer readable storage medium of claim 35, wherein a respective structural element in the plurality of structural element corresponds to a paragraph having one or more text or non-text elements in the hierarchical data structure.
46. The non-transitory computer readable storage medium of claim 35, wherein the instructions for applying one or more edits included in the third change set to the plurality of structural elements included in the master instance of the hierarchical data structure include instructions for:
incorporating, into the hierarchical data structure, some, but not all, edits in the one or more edits.
47. The non-transitory computer readable storage medium of claim 35, wherein the respective secondary instance of the hierarchical data structure is associated with a compliance checklist,
wherein the compliance checklist includes one or more compliance items associated with a portion of the secondary instance of the hierarchical data structure; and
wherein the one or more compliance items correspond to one or more requirements that needs to be fulfilled before completing the transaction.
48. The non-transitory computer readable storage medium of claim 47, wherein the one or more programs further comprise instructions for:
updating, without user intervention, the compliance checklist in accordance with a change to the portion of the secondary instance of the hierarchical data structure.
49. The non-transitory computer readable storage medium of claim 35, wherein the secondary instance of the hierarchical data structure is associated with a verification checklist,
wherein the verification checklist includes information identifying one or more documents associated with a portion of the secondary instance of the hierarchical data structure; and
wherein the one or more documents verify, as deemed by a user, the portions of the hierarchical data structure.
50. The non-transitory computer readable storage medium of claim 49, wherein the verification includes, in accordance with a determination that a respective portion of the one or more portions of the hierarchical data structure constitutes an assertion of fact or is based on an explicit or implicit assumption of fact, confirming accuracy of the assertion or the assumption of fact using the first document.
51. The non-transitory computer readable storage medium of claim 49, wherein the one or more programs further comprise instructions for:
updating, without user intervention, the verification checklist in accordance with a change to the portion of the respective secondary instance of the hierarchical data structure.