1461092294-165f49f4-80e1-4483-913f-b557641e8668

1. A method of manufacturing cigarette filter subassemblies comprising the steps of:
A. providing a filter member comprised of absorbent material surrounded by a cover, the filter member defining a longitudinal center axis;
B. passing a plunger axially through the absorbent material such that a generally pointed leading end of the plunger displaces the absorbent material radially outwardly, wherein the displaced absorbent material forms a liner along an inside surface of the cover and defines a hollow axial opening within the absorbent material;
C. axially inserting at least one absorbent member and at least one capsule into the hollow space, the capsule containing a releasable material for modifying characteristics of tobacco smoke during smoking.
2. The method according to claim 1, further including, prior to step C, providing a coating on an inner surface of the liner which is substantially impermeable to the releasable material in the at least one capsule.
3. The method according to claim 2, wherein the coating is provided by applying to an outer cylindrical surface of the plunger, a binder material which is transferred to the inner surface of the liner as the liner is being formed.
4. The method according to claim 3, wherein the binder material is triacetin.
5. The method according to claim 1, wherein a series of absorbent members are inserted during step C, with at least one capsule disposed between successive absorbent members, to form an elongate filter structure which is cut to suitable length; each length containing at least one absorbent member and at least one capsule.
6. The method according to claim 5, wherein only one capsule is provided between successive absorbent members.
7. The method according to claim 1 wherein each capsule includes an outer shell comprising a flexible wall covered by a more brittle coating.
8. The method according to claim 1, wherein said at least one absorbent member is substantially cylindrical.
9. The method according to claim 1, wherein said at least one absorbent member is comprised of cellulose acetate.
10. The method according to claim 1, wherein said fluid material contained within the at least one capsule is a liquid or a vapor.
11. The method according to claim 5, further comprising the step of:
cutting every other absorbent member in said series of absorbent members at its axial midpoint to provide two dual-filter structures, each of said dual-filter structures comprising, in series, one half of a first absorbent member of twice the length of the first absorbent member, a first capsule, a second absorbent member, a second capsule, and one half of a third absorbent member, all disposed within said outer cover.
12. A dual-filter structure formed by the method of claim 11.
13. A method of forming a cigarette comprising the step of forming a cigarette subassembly according to claim 1, and attaching a cigarette rod to one end thereof.
14. A method of forming cigarettes comprising the step of forming a dual-filter structure according to claim 11 and attaching cigarette rods to respective ends thereof, and cutting the second absorbent member in half.
15. The method according to claim 11, further comprising the steps of:
providing a series of additional absorbent members, with one of said dual-filter structures being provided between adjacent additional absorbent members; andor
providing a quantity of activated carbon between each of said additional absorbent members and said adjacent dual-filter structure.
16. The method according to claim 15, further comprising the step of:
cutting every other one of said series of additional absorbent members substantially midway between adjacent dual-filter structures, said step of cutting producing quad subassemblies,
each of said quad subassemblies comprising one half of a first additional absorbent member, a first quantity of activated carbon, a first dual-filter structure, a second quantity of activated carbon, a second additional absorbent member, a third quantity of activated carbon, a second dual-filter structure, a fourth quantity of activated carbon, and one half of a third additional absorbent member.
17. A quad subassembly formed by the method of claim 16.
18. The method according to claim 16, further comprising the steps of:
cutting each of said dual-filter structures midway between adjacent capsules; and
cutting each of said second additional absorbent members midway between adjacent dual-filter structures,
whereby an individual cigarette filter subassembly is provided.
19. An individual cigarette filter subassembly formed by the method of claim 18.
20. The method according to claim 18, further comprising the steps of:
providing an additional absorbent member between adjacent pairs of said individual cigarette filter subassemblies to form a dual cigarette filter assembly;
providing a tobacco rod generally adjacent each end of said dual cigarette filter assembly;
joining the tobacco rods to the dual cigarette filter assembly with tipping paper; and
cutting said additional absorbent member substantially midway between said adjacent pairs of said individual cigarette filter subassemblies to form individual cigarettes.
21. A cigarette formed by the method of claim 20.

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 computer-readable medium having computer-executable instructions for performing steps for retrieving data from a database having a plurality of objects, comprising:
receiving a database access request containing a location path expression identifying a data path to desired data in the database, the location path expression including a view name specifying a data view associated with a predefined relationship between object attributes in the database and a plurality of path elements denoting nodes in the data path to the desired data; and
performing database access operations to traverse the nodes in the data path based on the predefined relationship to locate the desired data.
2. A computer-readable medium as in claim 1, having further computer-executable instructions for performing the step of reviewing configuration information to identify the predefined relationship associated with the view name in the location path expression.
3. A computer-readable medium as in claim 2, wherein the step of reviewing configuration information further identifies a root level starting point associated with the view name.
4. A computer-readable medium as in claim 2, wherein the step of reviewing the configuration determines whether the client has permission to access the database based on the predefined relationship.
5. A computer-readable medium as in claim 1, wherein the step of performing database access operations includes generating a plurality of data queries for sequentially locating objects corresponding to the path elements in the location path expression, and sending the data queries to a database server of the database.
6. A computer-readable medium as in claim 5, wherein the data queries are according to the Lightweight Directory Access Protocol (LDAP).
7. A computer-readable medium as in claim 5, wherein the step of receiving receives the database access request in a message according to the Simple Object Access Protocol (SOAP).
8. A computer-readable medium as in claim 1, wherein one of the path elements of the location path expression is a wildcard element.
9. A computer-readable medium as in claim 1, wherein one of the path elements of the location path expression indicates a search in a reversed direction of the predefined relationship.
10. A computer-readable medium as in claim 1, wherein the predefined relationship is defined between attributes of two objects of a same class.
11. A computer-readable medium as in claim 10, wherein the predefined relationship is defined between attributes of two objects of different classes.
12. A computer-readable medium as in claim 1, wherein the database is a directory service database.
13. A computer-readable medium having computer-executable instructions for a client to perform steps to access data located in a database having a plurality of objects, comprising:
forming a request containing a location path expression identifying a data path to desired data, the location path expression including a view name specifying a data view associated with a predefined relationship between object attributes in the database and a plurality of path elements denoting nodes in the data path to the desired data; and
sending the request to a server for accessing the database.
14. A computer-readable medium as in claim 13, having further computer-executable instructions for performing the step of obtaining configuration information from the server defining relationships among attributes of objects in the database and associated view names thereof.
15. A computer-readable medium as in claim 14, wherein the step of sending sends the request in a message to the server according to the Simple Object Access Protocol (SOAP).
16. A computer-readable medium as in claim 13, wherein one of the path elements of the location path expression is a wildcard element.
17. A computer-readable medium having computer-executable instructions for a database server of a database containing a plurality of objects to perform steps to respond to database access requests, comprising:
receiving a database access request from a client, the database access request containing a location path expression identifying a data path to desired data, the location path expression including a view name specifying a data view associated with a predefined relationship between object attributes in the database and a plurality of path elements denoting nodes in the data path to the desired data; and
performing data retrieval operations to traverse the nodes in the data path based on the predefined relationship to locate the desired data.
18. A computer-readable medium as in claim 17, having further computer-executable instructions for performing the step of reviewing configuration information to identify the predefined relationship associated with the view name in the location path expression.
19. A computer-readable medium as in claim 18, wherein the step of reviewing configuration information further identifies a root level starting point associated with the view name.
20. A computer-readable medium as in claim 18, wherein the step of reviewing the configuration determines whether the client has permission to access the database based on the predefined relationship.
21. A computer-readable medium as in claim 17, wherein the database is a directory service database.
22. A method for a client to obtain data from a database containing a plurality of objects, comprising:
constructing, by the client, a database access request containing a location path expression identifying a data path to desired data, the location path expression including a view name associated with a predefined relationship between object attributes in the database and a plurality of path elements denoting nodes in the data path to the desired data;
sending, by the client, the database access request to a server for accessing the database;
performing, by the server, database access operations to traverse the nodes in the data path based on the predefined relationship to locate the desired data; and
returning, by the server, the located desired data to the client.
23. A method as in claim 22, further including the step of reviewing, by the server, configuration information to identify the predefined relationship associated with the view name of the location path expression.
24. A method as in claim 22, wherein the step of performing database operations by the server includes generating a plurality of data queries to locate objects corresponding to the path elements in the location path expression, and sending the data queries to a database server of the database.
25. A method as in claim 24, wherein the step of sending by the client sends the database access request in a message to the server according to the Simple Object Access Protocol (SOAP).
26. A database system for providing data in response to requests from clients, comprising:
a database containing a plurality of objects;
a server for accessing data in the database, the server being programmed for receiving a database access request from a client containing a location path expression identifying a data path to desired data, the location path expression including a view name associated with a predefined relationship between object attributes in the database and a plurality of path elements denoting nodes in the data path to the desired data, the server being further programmed for performing database access operations to traverse the nodes in the data path based on the predefined relationship to locate the desired data and returning the located desired data to the client.
27. A database system as in claim 26, wherein the server contains configuration information identifying the predefined relationship associated with the view name of the location path expression.
28. A database system as in claim 26, further including a database server for the database, and wherein the server performs the database access operations by generating a plurality of data queries to locate objects corresponding to the path elements in the location path expression, and sending the data queries to the database server.
29. A database system as in claim 26, wherein the server is a database server of the database.
30. A database system as in claim 26, wherein the database is a directory service database.

1461092283-71e8c78f-7b19-42c1-afa1-1d7a9311ea83

1. A method for scheduling the streaming of data chunks in a peer-to-peer streaming system having N peers, the method comprising, for each time slot:
a) determining whether data chunk transmissions scheduled in previous time slots will have finished at the start of the current time slot;
b) for each data chunk which will have finished transmission,
1) indicating that the source peer of the transmission is idle for the current time slot, and
2) indicating the data chunk which will have finished transmission as belonging to a buffered data chunk set of the destination peer of the transmission;

c) determining a demand factor dk for a data chunk k that has been generated by the data source server, but has not been scheduled for uploading to all peers, wherein demand factor dk is proportional to a number of the N peers which will be without the data chunk k, and is inversely proportional to a number of the N peers which will have the data chunk;
d) determining an expected workload for each peer to upload data chunks to peers without them using a sum of demand factors for any data chunks that the peer is buffering;
e) for each of the data chunks that will not have been received by all of the N peers and starting with the oldest of these data chunks,
1) determining an idle peer with a lowest expected workload per offered upload capacity factor that has the data chunk;
2) defining the determined idle peer with the lowest expected workload per offered upload capacity factor that has the data chunk as a source peer for the data chunk,
3) determining a peer that does not yet have the data chunk, that does not have a scheduled delivery of the data chunk, and a lowest expected workload per offered upload capacity factor,
4) defining the determined peer that does not yet have the data chunk, that does not have a scheduled delivery of the data chunk, and a lowest expected workload per offered upload capacity factor as a destination peer for the data chunk,
5) scheduling having the source peer transmit the data chunk to the destination peer during the time slot by marking the source peer as being busy and marking the destination peer with a scheduled delivery of the data chunk, and
6) repeating (e)(1)-(e)(5) while there are peers missing the data chunk, until no source peer destination peer pair for the data chunk can be determined.
2. The method of claim 1 wherein the demand factor dk is a ratio of the number of peers without data chunk k to the number of peers with data chunk k.
3. The method of claim 1 wherein the total expected workload for peer i is
W
i

=
\u2211

k
\u2208

B
i
\u2062

d
k
,
where dk is the demand factor and wherein B is a set of data chunks buffered by the peer that have not yet been sent to all of the N peers.
4. The method of claim 1 further comprising repeating the method until each of the peers is scheduled to receive each of the data chunks of the data stream.
5. The method of claim 1 further comprising:
f) transmitting the data chunks in accordance with the scheduling.
6. The method of claim 1 further comprising:
f) signaling the scheduling to the N peers; and
g) transmitting the data chunks in accordance with the scheduling.
7. The method of claim 1 wherein the offered upload capacity factor is set to a fixed value for all peers.
8. A method for streaming data chunks in a peer-to-peer streaming system having N peers, in which at least some peers only exchange data with a subset of the N peers, the method comprising:
a) for each of the peers, exchanging data chunk availability information with any other peers of the subset;
b) for each of the peers,
(1) estimating an active data chunk set, using the data chunk availability information, defining data chunks not yet received by at least one peer of the subset of peers,
(2) estimating a demand factor for each data chunk of the active data chunk set using the data chunk availability information, wherein demand factor for a given data chunk K is proportional to a number of the subset of peers which will be without the given data chunk K, and is inversely proportional to a number of the subset of peers which will have the given data chunk K,
(3) estimating, for any other peers of the subset, an expected workload of the peer using a sum of demand factors for any data chunks that the other peer is buffering,
(4) sending at least one request for a data chunk to at least one peer of the subset, and
(5) receiving at least one request for a data chunk from at least one peer of the subset; and

c) for each of the peers, determining, for any other peers of the subset, a per-time slot uploading schedule by
1) determining, from among the data chunks for which it has received an unfilled request, the oldest data chunk belonging to the active data chunk set,
2) determining, from among peers that have sent the peer a request for the determined oldest data chunk, a peer with a lowest expected workload per offered upload capacity factor, and
3) scheduling sending at least the determined oldest data chunk to at least the determined peer with the lowest expected workload per offered upload capacity factor.
9. The method of claim 8 further comprising:
d) sending the scheduled at least the determined oldest data chunk to at least the determined peer with the lowest expected workload per offered upload capacity factor.
10. The method of claim 8 wherein for each of the peers, the act of determining, for any other peers of the subset, a per-time slot uploading schedule includes
determining a number C of data chunks that the peer can transmit in one time slot,
determining, from among the data chunks for which it has received an unfilled request, the oldest data chunk belonging to the active data chunk set,
determining a number X of peers that have sent the peer a request for the determined oldest data chunk
if the determined number X of peers that have sent the peer a request for the determined oldest data chunk is greater than the determined number C of data chunks that the peer can transmit in one time slot, then
determining, from among peers that have sent the peer a request for the determined oldest data chunk, a number C of peers with a lowest expected workload per offered upload capacity factor, and
sending the determined oldest data chunk to the determined number C of peers with the lowest expected workload per offered upload capacity factor,

otherwise,
sending the determined oldest data chunk to all of the peers that have sent the peer a request for the determined oldest data chunk, and
if X<C sending at least one other data chunk to at least one other peer using the age of the data chunk and the workload per offered upload capacity factors of the peers of the subset, otherwise, not sending any further data chunks in the time slot.
11. The method of claim 8 wherein each peer exchanges, periodically, the data chunk availability information with any other peers of the subset.
12. The method of claim 8 wherein the estimated active data chunk set is a system-wide estimate.
13. The method of claim 8 wherein the estimated active data chunk set is an estimate across the peer, and the peers of the subset.
14. The method of claim 8 wherein the estimated active data chunk set is an estimate across the peer, the peers with which it communicates, and peers with which those peers communicate thereby defining a set of peers including the peer and peers within two hops of the peer.
15. The method of claim 8 wherein the offered upload capacity factor is set to a fixed value for all peers.
16. A method for streaming data chunks in a peer-to-peer streaming system having N peers, in which at least some peers only exchange information with a subset of the N peers the method comprising:
a) for each of the peers, exchanging data chunk availability information with any other peers of a subset of peers;
b) for each of the peers,
(1) estimating a demand factor for each of a plurality of the data chunks using the data chunk availability information, and
(2) receiving requests for data chunks from at least some other peers of the subset; and

c) for each of the peers of the subset, determining, for any other peers of the subset, a per-time slot uploading schedule using (1) ages of requested data chunks, and (2) expected workloads of the peers of the subset,
wherein the expected workload of a peer is a function of demand factors of data chunks buffered by the peer.
17. The method of claim 16 wherein the demand factor for a kth data chunk, dk is the ratio of the number of peers of the subset without data chunk k to the number of peers of the subset with data chunk k.
18. The method of claim 16 wherein the total expected workload for peer i is
W
i

=
\u2211

k
\u2208

B
i
\u2062

d
k
,
where dk is the demand factor for the kth data chunk and wherein B is a set of data chunks buffered by the peer that have not yet been sent to all peers of the subset.
19. The method of claim 16 wherein the act of determining a per-time slot uploading schedule further uses an offered upload capacity factor for each of the peers.

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 system for managing torque in a vehicle driveline coupled to an internal combustion engine and to a hybrid motorgenerator, the system comprising:
a transmission defining at least part of the vehicle driveline, the transmission including at least one electronically controllable friction device,
a transmission control circuit configured to control operation of the transmission,
an engine control circuit configured to control operation of the engine, and
a hybrid control circuit configured to control operation of the hybrid motorgenerator,
wherein the engine control circuit includes a memory having instructions stored therein that are executable by the engine control circuit to provide to the transmission control circuit an engine torque value corresponding to torque applied by the engine to the driveline,
and wherein the hybrid control circuit includes a memory having instructions stored therein that are executable by the hybrid control circuit to provide to the transmission control circuit a motor torque value corresponding to torque applied by the hybrid motorgenerator to the driveline,
and wherein the transmission control circuit includes a memory having stored therein friction device control and shift schedule instructions that are executable by the transmission control circuit to control operation of the at least one friction device and to control shifting of the transmission respectively, and also having stored therein instructions that are executable by the transmission control circuit to manage torque applied to the drive line by the engine and by the hybrid motorgenerator based on the engine torque value and the motor torque value such that the friction device control and shift schedule instructions do not require modification to accommodate inclusion of the hybrid motorgenerator in the system or exclusion of the hybrid motorgenerator from the system.
2. The system of claim 1 wherein at least two of the transmission control circuit, the engine control circuit and the hybrid control circuit are combined to form a single controller.
3. The system of claim 1 further comprising a communications link coupled to each of the engine control circuit, the transmission control circuit and the hybrid control circuit,
wherein the engine control circuit, the transmission control circuit and the hybrid control circuit are each configured to communicate with at least one other of the engine control circuit, the transmission control circuit and the hybrid control circuit via the communications link.
4. The system of claim 1 wherein the instructions stored in the memory of the transmission control circuit include instructions that are executable by the transmission control circuit to determine and transmit a motor torque limit value to the hybrid control circuit via the communication link when the transmission control circuit determines that the torque produced by the hybrid motorgenerator should be reduced,
and wherein the instructions stored in the memory of the hybrid control circuit include instructions that are executable by the hybrid control circuit to limit torque applied by the hybrid motorgenerator to the driveline in accordance with the motor torque limit value.
5. The system of claim 1 wherein the instructions stored in the memory of the transmission control circuit include instructions that are executable by the transmission control circuit to determine and provide an engine torque limit value to the engine control circuit when the transmission control circuit determines that the torque produced by the engine should be reduced,
and wherein the instructions stored in the memory of the engine control circuit include instructions that are executable by the engine control circuit to limit torque applied by the engine to the driveline in accordance with the engine torque limit.
6. The system of claim 1 wherein the instructions stored in the memory of the transmission control circuit include instructions that are executable by the transmission control circuit to process the engine torque value and determine a driver demanded node torque value corresponding to torque applied to point in the driveline to which the hybrid motorgenerator is coupled, and to provide the driver demanded node torque value to the hybrid control circuit.
7. The system of claim 6 wherein the instructions stored in the memory of the hybrid control circuit include instructions that are executable by the hybrid control circuit to control the hybrid motorgenerator to apply torque to the driveline and to determine a torque adjustment value based on the node torque value, the torque adjustment value corresponding to an amount of torque by which the torque produced by the engine should be modified to take into account the torque being applied by the hybrid motorgenerator to the driveline, and to provide the torque adjustment value to the transmission control circuit.
8. The system of claim 7 wherein the instructions stored in the memory of the transmission control circuit include instructions that are executable by the transmission control circuit to process the torque adjustment value to determine a corresponding engine torque limit or command, and to provide the engine torque limit or command to the engine control circuit.
9. The system of claim 8 wherein the instructions stored in the memory of the engine control circuit include instructions that are executable by the engine control circuit to control torque applied by the engine to the driveline in accordance with the engine torque limit or command.
10. The system of claim 1 wherein the engine includes a rotatable output shaft that is driven by the engine and that is coupled to a rotatable input shaft of the transmission,
and wherein the hybrid motorgenerator is coupled to the driveline at the input shaft of the transmission.
11. The system of claim 1 wherein the transmission includes a power take off gear,
and wherein the hybrid motorgenerator is coupled to the driveline at the power take off gear.
12. The system of claim 1 wherein the transmission includes a rotatable output shaft,
and wherein the hybrid motorgenerator is coupled to the driveline at the output shaft of the transmission.
13. A system for managing torque in a vehicle driveline coupled to an internal combustion engine and to a hybrid motorgenerator, the system comprising:
a transmission defining at least part of the vehicle driveline,
a transmission control circuit configured to control operation of the transmission,
an engine control circuit configured to control operation of the engine, and
a hybrid control circuit configured to control operation of the hybrid motorgenerator, and
wherein the engine control circuit includes a memory having instructions stored therein that are executable by the engine control circuit to provide to the transmission control circuit an engine torque value corresponding to torque applied by the engine to the driveline,
and wherein the transmission control circuit receives one or more torque limit requests from one or more systems other than the hybrid control circuit,
and wherein the transmission control circuit includes a memory having instructions stored therein that are executable by the transmission control circuit to determine a modified engine torque value based on the engine torque value and the one or more torque limit requests, and to control operation of the transmission in accordance with the modified engine torque value.
14. The system of claim 13 wherein at least two of the transmission control circuit, the engine control circuit and the hybrid control circuit are combined to form a single controller.
15. The system of claim 13 further comprising a communications link coupled to each of the engine control circuit, the transmission control circuit and the hybrid control circuit,
wherein the engine control circuit, the transmission control circuit and the hybrid control circuit are each configured to communicate with at least one other of the engine control circuit, the transmission control circuit and the hybrid control circuit via the communications link.
16. The system of claim 13 wherein the instructions stored in the memory of the transmission control circuit include instructions that are executable by the transmission control circuit to process the modified engine torque value and determine a node torque value corresponding to torque applied to the point in the driveline to which the hybrid motorgenerator is coupled, and to transmit the node torque value to the hybrid control circuit via the communication link.
17. The system of claim 16 wherein the instructions stored in the memory of the hybrid control circuit includes instructions that are executable by the hybrid control circuit to control the hybrid motorgenerator to apply torque to the driveline and to determine a torque adjustment value based on the node torque value, the torque adjustment value corresponding to an amount of torque by which the torque produced by the engine should be modified to take into account the torque being applied by the hybrid motorgenerator to the driveline, and to provide the torque adjustment value to the transmission control circuit.
18. The system of claim 17 wherein the instructions stored in the memory of the transmission control circuit include instructions that are executable by the transmission control circuit to process the torque adjustment value to determine a corresponding engine torque limit or command, and to provide the engine torque limit or command to the engine control circuit.
19. The system of claim 18 wherein the instructions stored in the memory of the engine control circuit include instructions that are executable by the engine control circuit to control torque applied by the engine to the driveline in accordance with the engine torque limit or command.
20. The system of claim 19 wherein the instructions stored in the memory of the transmission control circuit include instructions that are executable by the transmission control circuit to determine and provide a motor torque limit value to the hybrid control circuit when the transmission control circuit determines that the torque produced by the hybrid motorgenerator should be reduced,
and wherein the instructions stored in the memory of the hybrid control circuit include instructions that are executable by the hybrid control circuit to limit torque applied by the hybrid motorgenerator to the driveline in accordance with the motor torque limit value.