1. Method for manufacturing a breathable sole assembly, comprising the steps of:
providing a ventilating sole element having a structure or material allowing for air flow through it,
placing the ventilating sole element in a mould, said mould having pins (221) projecting in a lateral direction;
closing the mould such that the pins contact a side wall of the ventilating sole element, and injection moulding so as to form a surrounding sole element being fixed to the ventilating sole element, said surrounding sole element comprising lateral passages from the outside of the surrounding sole element to the side wall of the ventilating sole element formed by the pins; and
after injection moulding, connecting the lateral passages of the surrounding sole element to the structure or material of the ventilating sole element.
2. Method for manufacturing a breathable shoe, comprising the steps of:
providing an upper assembly with an upper portion comprising an outer material and a breathable bottom portion;
providing a ventilating sole element having a structure or material allowing for air flow through it;
placing the ventilating sole element in a mould, said mould having pins projecting in a lateral direction;
positioning the ventilating sole element and the upper assembly such that an upper part of the ventilating sole element contacts the bottom portion of the upper assembly;
closing the mould such that the pins contact a side wall of the ventilating sole element, and injection moulding so as to form a surrounding sole element being fixed to the upper assembly and to the ventilating sole element, said surrounding sole element comprising lateral passages from the outside of the surrounding sole element to the side wall of the ventilating sole element formed by the pins; and
after injection moulding, connecting the lateral passages of the surrounding sole element to the structure or material of the ventilating sole element.
3. Method of claim 1, wherein the lateral passages of the surrounding sole element are connected to the structure or material of the ventilating sole element by making at least one opening through the side wall of the ventilating sole element through the lateral passages of the surrounding sole element, particularly by drilling, puncturing, lasering or other thermal removal.
4. The method of claim 1, wherein the ventilating sole element has a channel structure at least at an upper side thereof allowing for communication of air between the channels and the lateral passages of the surrounding sole element.
5. The method of claim 1 wherein the ventilating sole element is made as a container element having a bottom part and a side wall so as to form an inner space of the container element, wherein in the inner space there is positioned a structure or material allowing for air flow through it.
6. The method of claim 2 wherein the ventilating sole element has a functional layer attached to the surface facing the bottom portion of the upper assembly.
7. The method of claim 2, wherein the upper assembly comprises a breathable outer material and a waterproof, breathable functional layer arrangement extending over said upper portion and said bottom portion.
8. The method of claim 7, wherein a side end area of a bottom functional layer of said functional layer arrangement and a lower end area of an upper functional layer of said functional layer arrangement are connected to one another with a waterproof seal being provided at the connection.
9. The method of claim 8, wherein the side end area of said bottom functional layer and the lower end area of said upper functional layer are stitched to one another to form a stitched seam.
10. The method of claim 9, wherein said surrounding sole element is moulded so as to penetrate to the upper functional layer so as to form a seal at the stitched seam by material of the surrounding sole element formed by the injection moulding.
11. The method of claim 8, wherein a netband is provided, said netband connecting a lower end area of the breathable outer material with the side end area of the bottom functional layer, and wherein said netband is penetrated by material of the surrounding sole element in the moulding step.
12. The method of claim 7, wherein said bottom functional layer is provided with supporting members, particularly knobs, at its lower surface.
13. The method of claim 1, wherein the ventilating sole element comprises at least one lip protruding from the side wall of the ventilating sole element.
14. The method of claim 13, wherein positioning of the ventilating sole element is done with a bottom piston pressing and deforming said protruding lip of the ventilating sole element against the bottom portion of the upper assembly.
15. The method of claim 1 wherein the ventilating sole element is attached to the bottom portion of the upper assembly in a first injection-moulding step, and connected to the surrounding sole element formed in a second injection-moulding step.
16. The method of claim 1, wherein a comfort layer is provided on top of said ventilating sole element towards the upper assembly.
17. The method of claim 16, wherein the comfort layer is attached to the top of said ventilating sole element, in particular by spotwise or circumferential gluing.
18. The method of claim 1, wherein the underside of said ventilating sole element forms at least a part of an outer sole.
19. The method of claim 1, wherein the undersides of said surrounding sole element and of said ventilating sole element form at least a part of an outer sole.
20. The method of claim 1, wherein the underside of said ventilating sole element is arranged at a higher position as compared to the underside of said surrounding sole element.
21. The method of claim 1, wherein an additional sole element is provided forming at least a part of an outer sole, said additional sole element being arranged below said ventilating sole element.
22. The method of claim 21, wherein said additional sole element is arranged below said surrounding sole element and said ventilating sole element.
23. The method of claim 1, wherein said surrounding sole element extends below said ventilating sole element.
24. The method of claim 23, wherein said surrounding sole element forms at least a part of an outer sole.
25. The method of claim 23, wherein an additional outer sole element forming at least a part of an outer sole is arranged below said surrounding sole element.
26. The method of claim 23, wherein supporting members are formed in portions of said surrounding sole element below said ventilating sole element, said supporting members extending substantially vertically through said surrounding sole element.
27. The method of claim 2, wherein a comfort layer is provided on top of said ventilating sole element towards the upper assembly, wherein the comfort layer has an upper side and a lower side, where the upper side is facing the bottom portion of the upper assembly, and the lower side is facing the ventilating sole element, wherein the lower side is stiffer than the upper side, particularly the lower side being stiff and the upper side being soft.
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 for producing a delta-file encoding differences between a first data file and a second data file, each formed of data bytes, comprising:
determining a set of elemental data strings defined as pseudo-matches present in the two data files in a partial match;
modeling a graph of network nodes and network edges in which each network node represents a data processing operation based on the first data file for producing one of the data bytes of the second data file, and each related node, associated with a data byte of the second data file in the graph, is connected by related network edges to all preceding network nodes associated with a directly preceding data byte of the second data file;
assigning the network nodes and the network edges, respectively, a cost value;
ascertaining a cost-optimized path in the graph which, for all data bytes of the second data file, contains only one network node per data byte; and
generating a delta-file, based on the cost-optimized path, containing a series of data processing operations and data fields corresponding to a successive sequence of network nodes in the cost-optimized path.
2. The method as claimed in claim 1, wherein the data processing operations based on the first data file for producing one of the data bytes of the second data file are respectively specific to a pseudo-match.
3. The method as claimed in claim 2,
wherein the data processing operations based on the first data file for producing one of the data bytes of the second data file include ADD-operations and Diff-operations,
wherein reading of an ADD data field associated with an ADD-operation from the delta-file is effected by an ADD-operation, and storage thereof is effected at a first position in the second data file corresponding to a second position of the data byte with which the ADD-operation is associated, and
wherein said generating includes storing a data byte sum, totaled from a DIFF data field of a DIFF-operation and a corresponding data byte of the pseudo-match of the first data file, by a specific DIFF-operation for a specific pseudo-match at a third position in the second data file which corresponds to a fourth position of the data byte to which the specific DIFF-operation is assigned.
4. The method as claimed in claim 1, wherein said modeling of the graph uses a matrix formed of lines and columns with successive columns of the graph assigned to successive data bytes of the second data file.
5. The method as claimed in claim 1, wherein a non-zero cost value is assigned to each network node for which a state associated with the network node produces an associated data byte in the delta-file that is not equal to zero and a zero cost value is assigned to each network node for which the state associated with the network node produces the associated data byte in the delta-file that is equal to zero.
6. The method as claimed in claim 1, wherein the zero cost value is assigned to each network edge for which the network nodes connected thereby belong to same or compatible pseudo-matches, and the non-zero value is assigned to each network edge for which the network nodes connected thereby belong to different pseudo-matches.
7. The method as claimed in claim 1, further comprising producing pseudo-matches by
producing of a set of exactly matching maximum elemental data regions, defined as matches, present in the first and second data files;
ascertaining compatible matches with positions thereof respectively differing in the first and second data files by a same amount;
producing pseudo-matches by combining respectively compatible matches to form a combined data region.
8. The method as claimed in claim 1, wherein said ascertaining the cost-optimized path includes reducing the pseudo-matches based on a cost comparison of costs, which occur if a match is used or not known within a gap of one of the pseudo-matches.
9. The method as claimed in claim 1, further comprising selecting a set of non-overlapping pseudo-matches from the pseudo-matches to maximize overlapping of the second data file by exact matches.
10. The method as claimed in claim 1, further comprising compressing the delta-file.
11. A non-transitory computer-readable medium encoded with a computer program that when executed by an electronic data processing device causes the electronic data processing device to carry out a method comprising:
determining a set of elemental data strings defined as pseudo-matches present in the two data files in a partial match;
modeling a graph of network nodes and network edges in which each network node represents a data processing operation based on the first data file for producing one of the data bytes of the second data file, and each related node, associated with a data byte of the second data file in the graph, is connected by related network edges to all preceding network nodes associated with a directly preceding data byte of the second data file;
assigning the network nodes and the network edges, respectively, a cost value;
ascertaining a cost-optimized path in the graph which, for all data bytes of the second data file, contains only one network node per data byte; and
generating a delta-file, based on the cost-optimized path, containing a series of data processing operations and data fields corresponding to a successive sequence of network nodes in the cost-optimized path.
12. The computer-readable medium as claimed in claim 11, wherein the data processing operations based on the first data file for producing one of the data bytes of the second data file are respectively specific to a pseudo-match.
13. The computer-readable medium as claimed in claim 12,
wherein the data processing operations based on the first data file for producing one of the data bytes of the second data file include ADD-operations and Diff-operations,
wherein reading of an ADD data field associated with an ADD-operation from the delta-file is effected by an ADD-operation, and storage thereof is effected at a first position in the second data file corresponding to a second position of the data byte with which the ADD-operation is associated, and
wherein said generating includes storing a data byte sum, totaled from a DIFF data field of a DIFF-operation and a corresponding data byte of the pseudo-match of the first data file, by a specific DIFF-operation for a specific pseudo-match at a third position in the second data file which corresponds to a fourth position of the data byte to which the specific DIFF-operation is assigned.
14. The computer-readable medium as claimed in claim 11, wherein said modeling of the graph uses a matrix formed of lines and columns with successive columns of the graph assigned to successive data bytes of the second data file.
15. The computer-readable medium as claimed in claim 11, wherein a non-zero cost value is assigned to each network node for which a state associated with the network node produces an associated data byte in the delta-file that is not equal to zero and a zero cost value is assigned to each network node for which the state associated with the network node produces the associated data byte in the delta-file that is equal to zero.
16. The computer-readable medium as claimed in claim 11, wherein the zero cost value is assigned to each network edge for which the network nodes connected thereby belong to same or compatible pseudo-matches, and the non-zero value is assigned to each network edge for which the network nodes connected thereby belong to different pseudo-matches.
17. The computer-readable medium as claimed in claim 11, the method further comprising producing pseudo-matches by
producing of a set of exactly matching maximum elemental data regions, defined as matches, present in the first and second data files;
ascertaining compatible matches with positions thereof respectively differing in the first and second data files by a same amount;
producing pseudo-matches by combining respectively compatible matches to form a combined data region.
18. The computer-readable medium as claimed in claim 11, wherein said ascertaining the cost-optimized path includes reducing the pseudo-matches based on a cost comparison of costs, which occur if a match is used or not known within a gap of one of the pseudo-matches.
19. The computer-readable medium as claimed in claim 11, the method further comprising selecting a set of non-overlapping pseudo-matches from the pseudo-matches to maximize overlapping of the second data file by exact matches.
20. The computer-readable medium as claimed in claim 11, the method further comprising compressing the delta-file.