1460751013-673d3dd4-2d43-43f6-a15e-14feee682256

1. A method for guaranteeing a quality of service (QoS) in delivering real-time data across a transmission medium, comprising:
specifying a traffic requirement for a traffic stream in accordance with a generic first specification;
transforming the specified traffic requirement in accordance with a generic second specification based on the specified traffic requirement, an overhead requirement for the traffic stream and a condition of the transmission medium;
adjusting the generic second specification based on feedback obtained from monitoring the condition of the transmission medium;
aggregating a plurality of specifications for a plurality of traffic streams into a single specification to reduce resources required to maintain and process the plurality of specifications and overhead incurred in medium dedication;
generating a medium dedication schedule according to the single specification; and
performing medium dedication in accordance with the medium dedication schedule to coordinate transmission of the plurality of traffic streams.
2. The method according to claim 1, further comprising:
monitoring, after performing medium dedication, the transmission medium to further tune the single specification to improve medium dedication scheduling and achieve a guaranteed quality of service for the plurality of traffic streams based on feedback obtained from monitoring the transmission medium.
3. The method according to claim 2, further comprising:
monitoring the condition of the transmission medium; and
reporting the condition of the transmission medium to a scheduling entity.
4. The method according to claim 1,
wherein the generic first specification specifies traffic requirements and characteristics of real-time streaming applications, and
wherein the generic first specification specifies:
a highest bound and a lowest bound of bandwidth requirement;
an average data size in units of transmission;
a lifetime of a data unit;
a permitted variation on the duration for the data unit to reach a destination; and
a transmission rate used to deliver the data unit.
5. The method according to claim 1,
wherein the generic first specification specifies traffic requirements and characteristics of real-time block transfer applications, and
wherein the generic first specification specifies:
a highest bound and a lowest bound of bandwidth requirement;
an average data size in units of transmission;
a lifetime of a data unit; and
a transmission rate used to deliver the data unit.
6. The method according to claim 1,
wherein the generic second specification specifies:
a highest bound and a lowest bound of medium occupancy duration;
a highest bound and a lowest bound of dedication interval; and
a computation interval.
7. The method according to claim 1, further comprising:
generating a medium dedication frame according to a medium dedication time;
inserting the medium dedication frame into a first-in, first-out (FIFO) queue in a position to be transmitted prior to frames in other queues.
8. A method for guaranteeing a quality of service (QoS) in delivering real-time data across a transmission medium, comprising:
specifying a traffic requirement for a traffic stream in accordance with a generic first specification;
transforming the specified traffic requirement in accordance with a generic second specification based on the specified traffic requirement, an overhead requirement for the traffic stream and a condition of the transmission medium;
adjusting the generic second specification based on feedback obtained from monitoring the condition of the transmission medium;
aggregating a plurality of specifications for a plurality of traffic streams into a single specification to reduce resources required to maintain and process the plurality of specifications and overhead incurred in medium dedication;
generating a medium dedication schedule according to the single specification;
performing medium dedication in accordance with the medium dedication schedule to coordinate transmission of the plurality of traffic streams;
determining, in units of transmission, a number of units for an amount of traffic to be transmitted within a duration interval, as one of a single data packet transmission and a burst transmission of a series of data packets;
determining the duration required to transmit a unit of transmission; and
multiplying the determined number of units with the determined duration,
wherein the generic second specification specifies:
a highest bound and a lowest bound of medium occupancy duration;
a highest bound and a lowest bound of dedication interval; and
a computation interval.
9. The method according to claim 8, further comprising:
computing a medium occupancy duration required within a duration interval;
determining a number of medium dedications required within the duration interval in accordance with a medium dedication duration limit for an instance of medium dedication; and
dividing the duration interval by the determined number of medium dedications.
10. The method according to claim 9, further comprising:
computing a dedication interval for the generic second specification;
computing a scaling factor from a delay bound to the dedication interval;
scaling a jitter bound by the scaling factor;
dividing the scaled jitter bound in half; and
adding the dedication interval to the divided scaled jitter bound.
11. The method according to claim 9, further comprising:
computing a dedication interval for the generic second specification;
computing a scaling factor from a delay bound to the dedication interval;
scaling a jitter bound by the scaling factor, when the jitter bound is specified;
dividing the scaled jitter bound in half, when the jitter bound is specified; and
subtracting the divided jitter bound from the dedication interval, when the jitter bound is specified; and
setting the lowest bound of the dedication interval to zero, when the jitter bound is not specified.
12. The method according to claim 8, further comprising:
scaling each of the plurality of specifications for the plurality of traffic streams to a common specification duration interval;
summing corresponding medium occupancy duration parameters of each of the scaled plurality of specifications;
selecting a lowest dedication interval parameter from among the scaled plurality of specifications; and
specifying the single specification based on the summed corresponding medium occupancy duration parameters and the selected lowest dedication interval parameter.
13. The method according to claim 8, further comprising:
generating an individual medium dedication schedule for each of the plurality of traffic streams by:
determining a schedule period;
determining a medium dedication start time;
determining a medium dedication duration required for each instance of medium dedication;
computing a total medium dedication duration required during the schedule period;
computing N, a total number of medium dedication instances required during the schedule period, as N=Rounddown Int{TmddMdd}, Tmdd being the total medium dedication duration required during the schedule period and Mdd being the medium dedication duration required for each instance of medium dedication;
computing the medium dedication interval, MDI, as MDI=NpN, Np being the schedule period; and
creating N data structures to store N individual medium dedication schedules.
14. The method according to claim 13,
wherein each of the N data structures comprise:
identification of a destination device for a scheduled medium dedication, a time value at which the medium dedication is scheduled to begin, and a duration value allocated for the medium dedication.
15. The method according to claim 13, further comprising:
determining a smallest medium dedication interval from among the N individual medium dedication schedules;
determining a maximum number of medium dedications required from among the N individual dedication schedules, the maximum number of medium dedications being equal to the smallest non-prime integer value that is greater than the schedule period divided by the smallest medium dedication interval;
regenerating the individual medium dedication schedules for which a number of medium dedications required during the schedule period is not a factor of the determined maximum number of medium dedications; and
merging the individual medium dedication schedules into a unified medium dedication schedule.
16. The method according to claim 15, wherein merging further comprises:
determining a medium dedication start time for each of the individual medium dedication schedules, wherein the medium dedication start time and a medium dedication end time equal to the sum of the medium dedication start time and medium dedication duration, are not within a range of a medium dedication time and a medium dedication duration of a medium dedication schedule structure for a work-in-process unified medium dedication schedule;
updating the individual medium dedication schedules with the medium dedication start time;
determining a new value for the total number of required medium dedications and the determined medium dedication duration;
determining a maximum number of required medium dedications, the maximum number of required medium dedications being equal to the smallest non-prime integer value that is greater than the schedule period divided by the smallest medium dedication interval; and
merging the individual medium dedication schedule with the work-in-process unified medium dedication schedule.
17. The method according to claim 16,
wherein the medium dedication schedule structure comprises identification of a destination device for a medium dedication scheduled by the individual medium dedication schedule, a time value at which the medium dedication is scheduled to begin, and a duration value allocated to the medium dedication.
18. The method according to claim 16,
wherein the determined new value of medium dedication duration corresponds to the smallest medium dedication interval among all medium dedication schedules greater than a previous value of medium dedication interval.

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 PN sequence phase searching apparatus in a multi-carrier CDMA mobile communication system using the same PN code phase values, comprising:
at least two PN sequence phase searchers for searching for the PN sequence phase of one of at least two different band input signals using different assigned search conditions and for outputting PN phase and energy information; and
a controller for assigning said different search conditions to said at least two PN sequence phase searchers and for determining a minimum phase variation period based on the PN phase and energy information received from said at least two PN sequence phase searchers,
wherein said different search conditions include phases and search periods corresponding to a plurality of PN sequence phase search starting points determined by dividing the entire phase area into a number of sections, and
wherein said at least two PN sequence phase searchers perform a PN sequence phase search within a minimum phase variation period determined by said controller, and
wherein one of said at least two different band input signals is switched to said at least two PN sequence phase searchers at the time point when said different search conditions are assigned and the band input signals are switched to the corresponding PN sequence phase searchers at the time point when the minimum phase variation range is determined, under the control of the controller.
2. The PN sequence phase searching apparatus of claim 1, wherein said plurality of PN sequence phase search starting points in said different search conditions are assigned to said at least two PN sequence phase searchers by dividing a PN sequence by the number of the PN sequence phase searchers.
3. The PN sequence phase searching apparatus of claim 1, wherein said different search conditions are set by dividing a PN sequence into predetermined periods and the divided search periods are sequentially assigned to said at least two PN sequence phase searchers.
4. A PN sequence phase searching method in a multi-carrier CDMA mobile communication system using the same PN code phase values, comprising the steps of:
searching for the PN sequence phase of one of at least two different band input signals in parallel using different assigned search conditions;
outputting PN phase and energy information;
determining a minimum phase variation period based on the PN phase and energy information;
searching for the PN sequence phase of each input signal within the determined minimum phase variation period; and
transmitting PN sequence phases acquired in the search to an upper processor, after the minimum phase variation period determining step,
wherein the different assigned search conditions include phases and search periods corresponding to a plurality of PN sequence phase search starting points determined by dividing the entire phase area into a number of sections, and
wherein said minimum phase variation period is determined by phase information corresponding to the highest energy among the energy information.
5. The PN sequence phase searching method of claim 4, wherein the different search conditions are set by dividing a PN sequence by the number of the parallel PN sequence phase searches and assigning corresponding phases produced by the division as the PN sequence phase search starting points.
6. The PN sequence phase searching method of claim 4, wherein the different search conditions are set by dividing a PN sequence into predetermined periods and the divided search periods are sequentially assigned for the parallel PN sequence phase searches.
7. The PN sequence phase searching method of claim 4, further comprising the steps of:
searching for the PN sequence phase of each input signal within the determined minimum phase variation period; and
transmitting PN sequence phases acquired in the search to an upper processor, after the minimum phase variation period determining step.
8. A PN sequence phase searching method in a multi-carrier CDMA mobile communication system, comprising the steps of:
searching for the PN sequence phase of one of at least two different band input signals in parallel on assigned different search conditions and outputting information about PN phases and energies;
sorting the energies of each searcher and comparing each max energy with a threshold varied with the number of PN sequence phase searches;
assigning new corresponding search conditions to PN sequence phase searchers satisfying the threshold, and perform the PN sequence phase search with the new search condition if max energy satisfy the threshold;
repeat the same process as upper case the predetermined number of times if max energy and frequency error satisfy the corresponding thresholds;
determining a minimum phase variation period based on the PN phase information, if there’s a PN phase which satisfy all of the conditions;
assigning another search condition which include another search window size and starting point to the PN sequence phase searchers which does not satisfy a threshold and resume PN phase search if max energy or frequency error does not satisfy the thresholds at any stage.
9. The PN sequence phase searching method of claim 8, wherein the threshold is incremented stage by stage according to the number of the PN sequence phase searches.
10. The PN sequence phase searching method of claim 8, wherein only when an energy higher than the threshold is output, the PN sequence phase search is resumed.
11. The PN sequence phase searching method of claim 8, wherein the different search conditions include phases and search periods corresponding to a plurality of PN sequence phase search starting points.
12. The PN sequence phase searching method of claim 11, wherein the different search conditions are set by dividing a PN sequence by the number of the parallel PN sequence phase searches and assigning corresponding phases produced by the division as the PN sequence phase search starting points.
13. The PN sequence phase searching method of claim 11, wherein the different search conditions are set by dividing a PN sequence into predetermined periods and the divided search periods are sequentially assigned for the parallel PN sequence phase searches.
14. The PN sequence phase searching method of claim 8, further comprising the steps of:
searching for the PN sequence phase of each input signal within the determined minimum phase variation period; and
transmitting PN sequence phases acquired in the search to an upper processor, after the minimum phase variation period determining step.

1460751005-17c2e702-1111-421e-afff-85d717ce89c9

1. A method for closing an opening in tissue, comprising:
forming an opening in tissue having an upper surface and a lower surface, the lower surface being disposed distally from an exterior skin with the upper surface being disposed proximal the lower surface;
performing a medical procedure;
disposing an entirety of a length of suture, having a proximal end, a distal end, and an intermediate portion extending from the proximal end to the distal end, distally from the lower surface and through the opening before a portion of the length of suture and a needle associated with the length of suture are withdrawn proximally through tissue adjacent the opening to be closed;
retrieving the portion of the length of suture by advancing the needle disposed proximal to the upper surface distally through the tissue; and
suturing the opening closed with a suturing device, the length of suture being initially disposed across the opening to be closed with the suturing device, the entire length of suture and the needle associated with the length of suture being withdrawn proximally through tissue adjacent the opening.
2. The method of claim 1, further including the step of delivering a pre-tied knot adjacent the opening.
3. The method according to claim 2, further including the step of applying tension to the length of suture to cinch the knot.
4. The method according to claim 3, further including the step of trimming the suture adjacent the knot.
5. The method according to claim 2, further including the step of using a knot pusher to advance the knot to the opening.
6. The method according to claim 1, wherein the step of suturing further comprises, inserting the suturing device through the opening in the tissue, causing the device to place the length of suture across the opening and through tissue adjacent the opening, such that ends of the suture element extend from the tissue adjacent the opening.
7. The method according to claim 6, further including the step of passing one of the ends of the length of suture through a bight to form a knot.
8. The method according to claim 7, further including the step of tightening the knot, thereby to at least partially close the opening in the tissue.
9. The method according to claim 8, wherein the tightening of the knot formation comprises pulling on one of the ends of the suture.
10. The method according to claim 1, wherein the medical procedure is a diagnostic procedure andor an interventional procedure.
11. The method of claim 1, wherein the intermediate portion of the length of suture is disposed in a slot of the suturing device, the slot being disposed below the lower surface of the tissue to be sutured before the entirety of the length of suture is withdrawn through tissue adjacent the opening to be closed.
12. A method for closing an opening in tissue, comprising:
performing a medical procedure through an opening formed in tissue, the tissue having an upper surface and a lower surface, the lower surface being disposed distally from an exterior skin with the upper surface being disposed proximal the lower surface; and
closing the opening in the tissue by providing a suturing device, the suturing device being configured to dispose a length of suture across the opening, the length of suture having a proximal end, a distal end, and an intermediate portion extending from the proximal end to the distal end, the entirety of the length of suture being disposed distally from the lower surface of the tissue to be sutured and through the opening before the entire length of suture and a needle associated with the length of suture are withdrawn through tissue adjacent the opening to be closed to close the opening, the needle being disposed proximal to the upper surface of the tissue and advanced distally through the tissue to retrieve the length of suture, the suturing device comprising:
a shaft having a proximal end and a distal end;
at least one foot on the distal end of the shaft, the at least one foot being movable with respect to the shaft; and
a flexible guidebody extending from the distal end of the shaft.
13. The method according to claim 12, wherein the suturing device is further configured to form a knot in the suture adjacent the opening.
14. The method according to claim 13, further comprising tensioning the suture across the opening.
15. A method according to claim 12 wherein the suturing device further comprises both a first foot on the distal end of the shaft and a second foot on the distal end of the shaft, both the first and the second foot being movable with respect to the shaft.

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 paper sheet having on the surface thereof calcium carbonate, said calcium carbonate having a maximum mean average size of 200 nm, said paper sheet having less than 20 voids per 12.6 in2 in the 6000th sheet when tested in a Void Test.
2. The paper sheet of claim 1 wherein said calcium carbonate has a maximum mean average size of 100 nm.
3. The paper sheet of claim 1 wherein said calcium carbonate has a maximum mean average size of 50 nm.
4. The paper sheet of claim 1 having less than 15 voids per 12.6 in2.
5. The paper sheet of claim 4 wherein said calcium carbonate has a maximum mean average size of 100 nm.
6. The paper sheet of claim 4 wherein said calcium carbonate has a maximum mean average size of 50 nm.
7. The paper sheet of claim 1 having less than 10 voids per 12.6 in2.
8. The paper sheet of claim 7 wherein said calcium carbonate has a maximum mean average size of 100 nm.
9. The paper sheet of claim 7 wherein said calcium carbonate has a maximum mean average size of 50 nm.
10. The paper sheet of claim 1 in which said paper has a Gurley stiffness 10% greater than a paper not coated with said calcium carbonate.
11. A paper sheet having on the surface thereof calcium carbonate,
said calcium carbonate having a maximum mean average size of 200 nm,
said paper sheet having a Gurley stiffness 10% greater than a paper not coated with said calcium carbonate.
12. The paper sheet of claim 11 wherein said calcium carbonate has a maximum mean average size of 100 nm.
13. The paper sheet of claim 11 wherein said calcium carbonate has a maximum mean average size of 50 nm.
14. The paper sheet of claim 11 wherein said paper sheet has a Gurley stiffness 25% greater than a paper not coated with said calcium carbonate.
15. The paper sheet of claim 14 wherein said calcium carbonate has a maximum mean average size of 100 nm.
16. The paper sheet of claim 14 wherein said calcium carbonate has a maximum mean average size of 50 nm.