text:
US 20030067935 A1 Abstract A "primal ascent" technique for scheduling the shared use of a limited resource may be applied to scheduling users in a high data rate (HDR) communication network, such as in a HDR network based on the TIA/EIA/IS-856 air interface standard. In a HDR network, active users share the air interface, and the network delivers data to individual users through the air interface one at a time. The primal ascent approach to user scheduling accommodates a flexible range of utility function types, including non-differentiable types, where utility functions describe the cost, benefit, or revenue gain associated with serving users. Primal ascent techniques allow service providers to, among other things, use different types of utility functions for differentiating between user types or associated grades of service, and allow them to use utility functions that change over time.
Claims(65) 1. A method of scheduling use of a resource shared by a plurality of user candidates, the method comprising:
assigning a utility function to each of the candidates; for each candidate, jointly evaluating the utility functions to determine an outcome that would arise from serving the candidate under consideration to the exclusion of the other candidates; and serving the candidate having the most favorable outcome. 2. The method of
3. The method of
4. The method of
5. The method of
6. The method of
7. The method of
8. The method of
9. The method of
10. The method of
11. The method of
12. The method of
13. The method of
14. The method of
15. The method of
16. The method of
17. The method of
18. A method of scheduling use of an air interface in a HDR communication network between a plurality of user candidates in each of a succession of service intervals, the method comprising:
tracking average served rates for the candidates, where said average served rates are dependent upon scheduling decisions made in past service intervals; for each candidate, evaluating an objective function having an initial value dependent upon said average served rates and a next value dependent upon an aggregate change that would arise from serving the candidate under consideration to the exclusion of the other candidates; and serving the candidate that yields the most favorable aggregate change in said objective function. 19. The method of
20. The method of
21. The method of
22. The method of
23. The method of
24. The method of
25. The method of
26. The method of
27. The method of
28. The method of
29. The method of
30. A method of scheduling use of a resource shared by a plurality of user candidates, the method comprising:
defining a set of two or more utility functions; assigning each candidate to a user class; assigning a utility function to each candidate based on the user class of said candidate; for each candidate, jointly evaluating said utility functions for all candidates to determine a selection metric associated with potentially serving the candidate under consideration; and allocating the shared resource for a designated time to the candidate having the most favorable selection metric. 31. The method of
32. The method of
33. The method of
34. The method of
35. The method of
36. The method of
37. The method of
38. A method of scheduling use of a resource shared by a plurality of user candidates, the method comprising:
defining a set of two or more utility functions; assigning a utility function to each of the candidates, wherein the utility function assigned to at least one of the candidates is a function of time; for each candidate, jointly evaluating the utility functions for all candidates to determine a selection metric associated with potentially serving the candidate under consideration; and allocating the shared resource for a designated time to the candidate having the most favorable selection metric. 39. The method of
40. The method of
41. The method of
assigning individual ones of said candidates to one of at least two user classes;
assigning time-dependent utility functions to candidates in at least one of said user classes, such that candidates in said at least one user class have scheduling priorities dependent upon the time of day.
42. The method of
43. A communication network entity for use in a HDR network and adapted to schedule use of an air interface shared by a plurality of user candidates, said network entity comprising a processor adapted to:
assign a utility function to each of the candidates; jointly evaluate the utility functions to determine an outcome that would arise from serving each candidate to the exclusion of the other the candidates for a defined time; and select the candidate having the most favorable outcome for service. 44. The network entity of
45. The network entity of
46. The network entity of
47. The network entity of
48. The network entity of
49. The network entity of
50. The network entity of
51. The network entity of
52. The network entity of
53. The network entity of
54. The network entity of
55. The network entity of
56. The network entity of
tracks an average served data rate for each of said candidates; and
defines said utility functions to be functions of said average served data rates, such that a change in benefit arising from serving a given one of said candidates is a function of an incremental change in said average served data rate that would result from serving said given one of said candidates.
57. The network entity of
associates a desired data rate with each of said candidates; and
determines said incremental change in said average served rate based on serving said given one of said candidates at said associated desired data rate.
58. The network entity of
59. The network entity of
60. The network entity of
61. The network entity of
62. A method of scheduling use of a resource shared by a plurality of access terminals, the method comprising:
assigning a utility function to each of the access terminals; for each access terminal, evaluating the utility functions of said plurality of access terminals to determine an outcome that indicates potential changes associated with said utility functions when said each access terminal is served and the remaining access terminals are excluded from service; and serving the access terminal having the outcome associated therewith that indicates the most favorable potential changes. 63. The method of claims 62, wherein evaluating the utility functions of said plurality of access terminals to determine an outcome includes jointly evaluating the utility functions of said plurality of access terminals to determine the outcome.
64. The method of claims 62, wherein each of the potential changes is a negative, positive, or neutral beneficial change associated with the respective utility function.
65. The method of claims 64, wherein serving the access terminal includes serving the access terminal having the outcome associated therewith that indicates the highest number of positive beneficial changes.
Description [0001] The present invention generally relates to wireless communication networks, and particularly relates to user scheduling in such networks. [0002] In some types of wireless communication networks, access terminals share the air interface between the terminals and the network. High data rate (HDR) networks configured according to the TIA/EIA/IS-856 standard exemplify this shared interface concept. With shared forward link resources, the network serves only one access terminal in a group at any given instant. By rapidly switching service between the terminals, the plurality of terminals is simultaneously, albeit discontinuously, served by the network. Deciding which terminal to serve in any given service interval is the function of a "scheduler." The scheduler typically comprises program logic or software services intended to fulfill this function. Scheduling operations are typically governed by a service goal or constraint. [0003] Selecting the "best" user for service at each scheduling decision point is an optimization problem. In optimization problems, utility functions are used to characterize the cost or benefit of a change. In scheduling air interface usage, utility functions define the utility of serving individual users. The optimization problem becomes one of maximizing an objective function whose value is dependent upon the set of utility functions. A scheduler repeatedly evaluates the objective function to move towards an optimum schedule for sharing the limited resources of the air interface between active users. [0004] Past approaches to network scheduling the use of shared resources within a communication network include so-called "proportional fair" scheduling techniques. Proportional fair scheduling seeks to maximize the objective function, and is essentially a maximum dual-ascent approach that reduces to finding the direction of maximum gradient for the objective function at each scheduling decision point. [0005] While proportional fair scheduling works well in some circumstances, its use places overly limiting restrictions on the nature of utility and objective functions that may be defined for serving users. These restrictions hamper a service provider's flexibility in terms of denying scheduling flexibility. Thus, alternative approaches that offer additional flexibility or impose fewer constraints on the type or types of scheduling functions that may be used are needed. [0006] The present invention comprises a system and method for scheduling use of the shared air interface in a communication network, preferably a HDR network, to maximize revenue or other service goal defined by one or more objective functions. For each service interval, there are a number of service scenarios equal to the number of users that are candidates for service in the current service interval. Each service scenario corresponds to serving one of the users to the exclusion of the remaining users. The "primal ascent" approach to scheduling described herein serves the user whose corresponding service scenario yields the greatest net gain in the objective function. [0007] By evaluating net gain rather than gradient, for example, the primal ascent scheduler allows tremendous flexibility in the selection of the utility functions that describe the incremental benefit or change in the objective function for individual users. With gradient-based approaches, utility functions must be differentiable, but with primal ascent scheduling, this restriction is removed. Thus, the objective function may be modified by one or more non-differentiable barrier functions that bound or restrict it in consideration of upper and/or lower data rates. Using barrier functions allows a system operator to bias the scheduling of users such that users on average do not exceed an upper data rate bound, or do not fall below a lower data rate bound if radio conditions permit. [0008] In addition to the flexibility of biasing average data rates through barrier function use, the primal ascent approach to scheduling allows system operators to simultaneously use different utility functions for different users. As the utility function describes the incremental cost or gain associated with serving a given user, this allows the service provider to offer users differing qualities of service. That is, a premium user might be assigned a utility function that causes that user to generally attain a higher average data rate while connected with the network than would be achieved by a non-premium user. [0009] This flexibility regarding utility functions further allows the system operator to use different utility functions at different times of the day, or to define utility functions whose weighting changes over time. Primal ascent scheduling easily accommodates non-separable utility functions, so the system operator may construct types or combinations of utility functions that may be awkward to use with conventional gradient-based scheduling optimization. [0010]FIG. 1 is a diagram of an exemplary HDR network. [0011]FIG. 2 is a graph of a conventional, differentiable utility function and a bounded, non-differentiable utility function. [0012]FIG. 3 is a graph of a non-monotonic objective function. [0013]FIG. 4 is a diagram of exemplary logic for implementing the primal ascent scheduling technique of the present invention. [0014]FIGS. 5A and 5B are diagrams of exemplary scheduling scenarios. [0015]FIG. 6 is a graph of a utility function modified by use of one or more barrier functions. [0016] In many types of communication systems, users compete for or otherwise share one or more limited resources. Scheduling techniques or algorithms decide how these limited resources are shared or allocated between users. Understandably, not all scheduling techniques are equally suitable in all circumstances. The scheduling technique of the present invention, referred to as "primal ascent" scheduling, has particular suitability for use in HDR networks, such as those networks based on the TIA/EIA/IS-856 standard. Reasons why the primal ascent approach has particular advantages within the framework of HDR networks are thoroughly discussed below, but it should be understood that the scheduling techniques and supporting ideas disclosed herein have utility in other types of communication networks, and for other types of shared resources. [0017] Turning now to the drawings, FIG. 1 illustrates an exemplary HDR network generally referred to by the numeral 10. The network 10 comprises one or more base station controllers (BSCs) 12, a plurality of radio base stations (RBSs) 14 for communicating with wireless access terminals (ATs) 18, one or more packet control functions (PCFs) 20, an IP network 22, and one or more packet data serving nodes (PDSNs) 24 for communicating with external public data networks (PDNs) 26, such as the Internet. [0018] In operation, the BSC 12 controls one or more RBSs 14 that provide the RF-based air interface 16 used to communicate with the users. The term "user" herein connotes an AT 18 or other wireless device, unless otherwise stated. For HDR and certain other types of communication networks, the air interface 16 represents a resource that is shared by the users of the network 10 (i.e., shared between ATs 18). Data to and from the ATs 18 is routed to the appropriate BSC 12 by the PCF 20. The PCF 20 communicates through the IP network 22 with the PDSN 24, which is communicatively coupled to the Internet or other PDNs 26. Thus, data passes between one or more PDNs 26 and individual ones of the ATs 18 through the network 10. [0019] The scheduler of the present invention may be implemented in software, hardware, other types of program logic, or in some combination thereof. For example, a processor 30 (or processors) in the BSC 12, or in the RBSs 14, may perform primal ascent scheduling based on execution of program code or software. In this manner, the BSC 12 or RBSs 14 can control use of the air interface 16 by users (i.e., ATs 18) in accordance with the present invention. However, it should be understood that other network entities, whether or not illustrated in FIG. 1, might be responsible for scheduling. [0020] To understand some of the advantages associated with scheduling use of the air interface 16 based on the primal ascent technique of the present invention, one must first understand something about the air interface as defined in HDR networks. At any given time, a plurality of users (e.g., ATs 18) is simultaneously connected with the network 10. However, the network 10 delivers data to only one user at a time. That is, the whole group of users shares the air interface 16, but the network 10 feeds data to only one user at any given instant. The trick comes in determining which particular user candidate to serve at any given instant. Making that service decision depends on any number of constraints, as well as on the service provider's objectives. [0021] HDR networks adopt a time division multiple access (TDMA) approach to the forward link air interface 16 used to transfer data from the network 10 to individual ones of the users. Thus, discussing the scheduling of users or user candidates practically means scheduling the times at which the particular users (i.e., ATs 18) are served within the time multiplexing scheme of the HDR air interface. [0022] HDR networks use rate control rather than power control on the forward link and each AT 18 sends updated rate requests to the network 10 indicating the rate at which the AT 18 desires service. Thus, an AT 18 generally requests data at the highest rate that is feasible for the current radio conditions at the terminal. One measure of radio conditions is expressed as the carrier-to-interference (C/I) ratio. Higher C/I ratios indicate favorable reception conditions at the AT 18 and support higher data rates. [0023] Each user (AT 18) updates its requested rate by periodically transmitting Data Rate Control (DRC) symbols to the network 10 on reverse link DRC channels. The DRC symbol value corresponds to one of a defined number of forward link data rates. At any given instant in time, some ATs 18 will request relatively high data rates, and some will request relatively low data rates, reflecting the differing reception conditions at various ones of the active terminals. The TIA/EIA/IS-856 standard provides for DRC symbol rates at up to 600 Hz, meaning that individual ATs 18 may request very rapid adjustments in the forward link data rate. [0024] The scheduler, in at least some embodiments uses the requested data rates to determine which user or users to serve in any given service interval. The historic or past average data rates of the individual users may also be considered. For this discussion, let ri represent the average throughput for the ith user, and let di represent the currently requested data rate for serving the ith user. Average throughput and requested rate are generally expressed in Kbits per second (kbps). With this notation, the entire sets of requested rates and average throughputs for all users are expressed in vector form as, (n) and (n), respectively. Here, the "n" generally indicates the nth time slot. It is assumed that user scheduling entails selecting the user or users to be served in each of a succession of service intervals. That is, it is assumed that user scheduling is an ongoing operation for so long as one or more users have connections to the network.[0025] For example, scheduling intervals might be based on the HDR frame rate of 26.6 ms, wherein the DRC information associated with each AT 18 determines the number of bits per frame and the number of time slots used to deliver data to the AT 18, if that terminal is to be served. For a detailed treatment of the air interface 16 and its frame/slot timing in HDR embodiments, the reader is referred to standard document 3GPP2 C.S0024, Version 2.0, dated Oct. 27, 2000, as promulgated by the 3rd Generation Partnership Project 2 (3GPP2). This standards document is entitled "cdma2000 High Rate Packet Data Air Interface Specification," and is incorporated in its entirety herein by reference. [0026] In HDR networks, if the scheduler chooses to serve a given terminal, the amount of service given to that terminal within that service interval is set by the DRC information associated with the terminal. For example, choosing to serve a given user might entail serving that user for a total of eight time slots, although these time slots may be interleaved with time slots dedicated to one or more other users. Overall, the scheduler might try to ensure that each user is selected for service often enough to insure that the average throughput for that user does not fall below some desired limit. However, this strategy reflects just one of many possible considerations that might bear on the scheduling strategy. [0027] A service provider (e.g., a network operator) may have a particular goal or goals in mind with regard to scheduling service to users. For example, the service provider may want to maximize its revenue, where revenue may be a function of maintaining the highest aggregate average data throughput, or by insuring that at least a subset of users achieve relatively high average throughput, perhaps at the expense of other users. Scheduling thus becomes an optimization problem wherein the goal is to control scheduling in a manner that attempts to optimize one or more service objectives. [0028] In optimization problems, a utility function is used to describe the measure of cost or benefit associated with a contemplated change in a variable or quantity bearing on the function to be optimized. The scheduler defines a utility function for each user, describing the benefit associated with serving that user. FIG. 2 plots a typical utility function U1(r) for th ith user as a function of data rate r in kbps (solid line), and further plots a bounded utility function U2(r) (dashed line) that is non-differentiable because of the upper limit placed on U2(r). By bounding U2(r), the gain in revenue or benefit as generated by evaluating U2(r) for individual users is capped at a given upper threshold. This has, in this example, the effect of reducing the incentive to serve users having an already high average served rate r. [0029] In a conventional approach to scheduling, such as in a proportional fair approach, the same U(r) function is associated with all users, and certain restrictions are placed on U(r). For example, because proportional fair scheduling is essentially a gradient-based approach, the utility function U(r) must be differentiable at all points. Thus, use of the bounded U2(r) would not be possible with any of the common gradient-based scheduling approaches. Use of bounded utility functions is discussed more fully below in the context of "barrier functions." [0030] If the objective function is non-separable, partial differentiation of the objective function as required in gradient-based approaches may require overly complex calculations. Avoiding this complexity limits the opportunity to use different utility functions to support groups of users at different scheduling priorities, and constrains the types of utility functions that may be used. This separability limitation is discussed more fully below, particularly in the context of scheduling users based on differing user classes and in time-of-day based scheduling. [0031] A further drawback to proportional fair scheduling in HDR networks arises from the essential operation of that type of scheduling. With proportional fair scheduling, an objective function F is based on the set of utility functions U(r) associated with the users. For N users, the objective function F exists in N-dimensional space. Thus, at each point along the objective function F, one can move in any one of N directions. At each scheduling interval, a proportional fair scheduler serves the user that moves the objective function in the direction of the steepest gradient. Because the user corresponding to that direction must be served by the amount requested in accordance with the DRC information for that user, the magnitude of movement in the chosen direction is set by the AT 18 and not by the scheduler. If the objective function F is not monotonic, moving in the direction of steepest gradient may actually reduce rather than increase the objective function. [0032]FIG. 3 illustrates an objective function F that is not monotonic, and is used to illustrate the consequence of considering only the gradient when selecting the user to be served. Here, moving in the direction of the steepest gradient by the amount required to meet the selected user's DRC request actually moves the objective function F(r) past a peak value, and on downwards on its reverse slope. Because the network 10 must serve the selected user by the requested amount, the change in objective function F(r) goes from a starting point P1 to an ending point P2. Here, with a non-monotonic objective function F(r), the change ΔF in the objective function F is actually negative. That is, the net change in the objective function F arising from the decision to serve the ith user in the particular service interval illustrated resulted in an overall decrease of F. While this ith user might correspond to the steepest gradient, the user does not correspond to the optimum service selection. Here, the primal ascent approach to scheduling would identify the undesirability of serving this user, where a gradient-based approach would not. [0033] Thus, the primal ascent technique in the present invention evaluates the net change in an objective function F that would result from serving each user by the required amount for a given service interval. The starting value of the objective function (point P1) is the same for all users before the next user is chosen for service, so the primal ascent approach evaluates the ending points (points P2) for all users and picks the user corresponding to the most favorable ending point. [0034] Essentially, then, primal ascent scheduling assigns one or more types of utility functions to users that are competing for the shared resource (e.g., the HDR air interface 16). These users may be thought of as candidates for service. By defining the utility function or functions assigned to the candidates as benefit functions, these functions define benefit curves associated with serving the candidates. As noted, all candidates may use the same curve, or different candidates may use different curves (functions). [0035] The average served data rate of a given candidate defines a current point (value) on that candidate's benefit curve. Selecting that candidate for service in a given service interval moves that candidate positively along the benefit curve, but also causes the other candidates to incrementally move negatively along their respective benefit curves. This latter result arises from not serving these other candidates during the service interval. Note that "positive" and "negative" as used here are relative terms and their absolute sense depends on the nature of the particular utility functions involved. [0036] Because the objective function depends on the overall set of utility functions associated with the candidates, its value changes as the aggregate of changes in the utility functions. At a given scheduling decision point, the value of the objective function F is based on the set of average throughputs (n) from the most recent time slot n. This objective function value may be considered a starting point. Then, for each user, the primal ascent approach determines the overall change in the objective function F for each user by comparing the ending point that the objective function F will move to if that user is served.[0037] Therefore, as noted, primal ascent considers the net or overall benefit that would be gained by serving each of the candidates at the expense of the other candidates for at least a portion of a given service interval, and serves the candidate having the most favorable or desirable net change. The net change may be considered a "selection metric." That is, selecting different candidates for service results in different values of net change in the objective function. The process or step of selecting a user depends on identifying the best or most favorable net change hence this may be thought of as considering each candidate's selection metric. [0038] By evaluating net or aggregate change, the primal ascent approach works to move the objective function F towards a maximum value with each service decision made, and removes the restrictions otherwise placed on the utility and objective functions. That is, by evaluating net changes in the objective function F, the objective function need not be monotonic, and the underlying user utility functions need not differentiable, and need not be separable. A further advantage detailed later is that the utility functions assigned to the users may be modified using so-called barrier functions that place constraints on upper or lower throughput such that users or selected groups of users may be biased toward desired average throughput values. [0039] Consider the HDR case of a separable objective function F comprising a sum of strictly concave differentiable utility functions. The change in the objective function F if user j is chosen may be denoted as,
[0040] Where Uj(r) and Ui(r) are utility functions for the jth and ith users, respectively, rj(n) and ri(n) are average throughputs of the nth time slot or service interval for the jth and ith users, respectively, and τc is a throughput filter time constant. [0041] The primal ascent approach selects the user j* that maximizes the net change in the objective function F. This selection may be expressed mathematically as follows,
[0042] where j* corresponds to the user that yields the greatest net change in the objective function F. [0043] If proportional fair scheduling were applied to (2), with the utility function defined as U(r)=1/r, the result would be,
[0044] which represents choosing the user having the largest ratio of requested data rate to past average data rate (i.e. requested rate to average throughput). For this particular U(r), primal ascent scheduling yields the same result (i.e., selects the same user j) as when the proportional fair scheduler is used. However, primal ascent scheduling arrives at this result by considering the actual changes associated with the different service scenarios, rather than simply choosing the user with the steepest gradient. [0045] Primal ascent scheduling also yields an equivalent result to the so-called maximum C/I scheduling algorithm when the maximum C/I utility function U(r)=r is used. [0046] However, primal ascent may be used where neither proportional fair nor maximum C/I scheduling is suitable. For example, consider the more general problem,
over r i εS, (6) [0047] where C represents an aggregate throughput capability or overall throughput limit for the portion of the network 10 supporting the set of users, and S represents the set of possible or defined data rates supported by the network 10. [0048] As before, unlike proportional fair or maximum C/I scheduling, the objective function F need not be differentiable or monotonic. FIG. 4 presents exemplary logic for the primal ascent approach to the scheduling problem framed by Eqs. 4-6. [0049] Processing begins (step 100) with initialization of the relevant variables , , (step 102). Here, represents the set of average throughputs for the users (i.e., ATs 18) being scheduled. Thus, (n) represents the value of the average served rate vector set in the nth time slot. If there are N users being scheduled, (n) comprises the individual average throughput value rj(n) for j=1 to N. Similarly, (n) represents the set of requested data rates for serving individual ones of the users in the nth time slot, and is referred to as the user request rate vector. The vector j(n) represents the served rate vector at the start of time slot n+1 if the jth user is served in slot n. That is, the conditional served rate vector j(n) represents the set of vectors over which the objective function F( j(n)) is to be maximized. In this example, the primal ascent approach evaluates net changes to determine which user j should be served to achieve the greatest gain in the objective function F( j(n)).[0050] After initialization, looping begins (step 104), with the algorithm repeatedly executing in an essentially infinite loop, repeating its objective function maximization over successive scheduling intervals by selecting the best user to serve at each scheduling decision point. In this context, a scheduling decision point is any point in time at which the primal ascent scheduler is required to make a scheduling decision. As will become clearer later, the scheduling intervals between scheduling decision points variably span a single and multiple HDR forward link time slots. Thus, in some circumstances, the scheduler makes scheduling decisions at each time slot, and in other circumstances, the scheduler makes scheduling decisions at multiples of individual time slots. With the dynamic nature of the radio environments associated with the users being scheduled and with changes in the constituency of the candidate set of users, the span of scheduling intervals is generally an ever-changing value. [0051] In HDR networks, the number of time slots required to serve a given user depends on the requested data rate associated with that user. Thus, the decision to serve a given user commits the network 10 to serving that user for the required number of time slots. For example, at a given scheduling decision point, the primal ascent scheduler may select user x for service. Given user x's requested data rate, this decision requires the allocation of a given number of future time slots for serving this user. If past users previously selected for service have remaining allocated time slots, the scheduler may interleave user x's needed time slots with those previously allocated. [0052] Further complicating this scenario, any one of the users which are currently allocated future time slots may report that some number of those future time slots is no longer needed as a result of successfully receiving data in a fewer number of time slots than was originally allocated. This circumstance might arise from radio conditions improving at the user's location. [0053]FIGS. 5A and 5B reflect some of these scheduling complexities. In FIG. 5A, the scheduler identifies the best (most favorable outcome in F) candidate for service (User 1), and the three next-best candidates for service (Users 2-4) at a given scheduling decision point. Here, all of the users selected for service require the same number y of time slots for delivering the associated data. This fact allows the scheduler to allocate 4y time slots in interleaved fashion. The next scheduling decision point is then fixed 4y time slots in the future, unless circumstances change, such as an early completion of data delivery to one or more of the users being served. [0054]FIG. 5B illustrates a circumstance where time slots for a newly scheduled user x must be interleaved with time slots previously allocated to a set of earlier scheduled users. At an earlier scheduling decision point, the scheduler allocated a given number of future time slots to each of Users 1-4. In this example, User 4 needed fewer time slots than Users 1-3, and therefore the scheduler had an opportunity to interleave time slots for user x with the remaining time slots allocated to Users 1-3 at the point where scheduled service to User 4 ended. This example illustrates that the scheduler may have multiple, overlapping scheduling intervals involving different users or groups of users. Thus, depending on the staggering of these overlapping intervals, the scheduler may make scheduling decisions on a per-time slot basis, or less frequently, depending on exigencies of the moment. [0055] With the above scheduling subtleties in mind, the discussion returns to the logic of FIG. 4. Within each time slot n, the average served rate vector and user request rate vector, (n) and (n) respectively, may be updated for the current time slot (step 106). Updating the average served rate vector (n) comprises calculating the average throughputs associated with the users being scheduled in light of which user was served in the last slot, which calculation may be expressed in exemplary form as,[0056] where τc is a time constant associated with filtering the computed value of the average served rate vector . Updating the user request rate vector comprises updating requested rate values based on DRC information received from or associated with each of the users in time slot n. Provisions may be made to accommodate instances where new DRC information is unavailable for one or more users, such as by using a past value or a default value.[0057] Next, the scheduler determines if a scheduling decision is required at this point in time (step 108). If not, the scheduler continues in accordance with the previously determined scheduling decisions and serves the appropriate one of the previously scheduled users. However, if a scheduling decision is required, the scheduler initializes its candidate user index variable j (step 112) in preparation for determining the best user to serve. [0058] In making this determination, the scheduler evaluates F( j(n)) for each one of N service scenarios, where there are N user candidates (step 114). The scheduler tracks and stores, or otherwise maintains the results of that evaluation (step 116) so that the user j* corresponding to the greatest desired change in the objective function F( j(n)) can be identified after evaluating all candidates. If there are more candidates to be evaluated (step 118), the user index variable is incremented (step 120), and the evaluation process repeats for the next user (steps 114-116).[0059] One subtlety in the process should be noted here. If there are Ntotal users and y users still have future allocated time slots arising from prior service selections, the actual number of users that are evaluated as possible candidates for service is N−y. Thus, it should be understood that users already being served are not considered in making the current scheduling decision. The index variable j can be manipulated such that it skips those values associated with any user already being served. [0060] After evaluating all users eligible for scheduling, the scheduler then selects the best user (i.e. user j*) corresponding to the maximum desired change in the objective function F( j(n)) (step 122). Processing then continues (step 124) by looping to the next time slot.[0061] As users are selected for service by the scheduler, it was earlier noted that the scheduler might apply overall constraints to its scheduling operations. For example, the scheduler might keep all users above a minimum data rate, assuming acceptable radio conditions for individual users. Further, the service provider might wish to avoid "over-serving" individual users, and thus the benefit of serving a user at an already high average throughput might be made to fall off according to some desired barrier function. [0062]FIG. 6 illustrates the use of upper and lower barrier functions as applied to an underlying utility function U(r). Here, it is desired to define an objective function Ui(ri) that maintains the rate of user i close to some target rate {tilde over (r)}, while still achieving some diversity gains by allowing fluctuations around this target value. [0063] The following utility function may be used to accomplish this desired action and is expressed as, U i(r i)=r i−η(r i −{tilde over (r)} i)2, (8) [0064] where {tilde over (r)}i is the target rate for user i, and where η may be configured as desired. When η is large, and if ri<<{tilde over (r)}i, then an increase in ri (i.e., serving user i) results in large increases of the objective function, thus encouraging service to that user. Conversely, if ri>>{tilde over (r)}i, then an increase in ri results in large decreases of the objective function, thus discouraging service to that user. [0065] As evident from the graph, the original utility function U(r) (solid line) was defined as a straight linear function of average throughput r. However, with the application of lower and upper barrier functions, the utility function U(r) (dashed line) takes on pronounced curvatures at lower and upper throughput rate thresholds R1 and R2, respectively. These curvatures modify the net change in the objective function associated with serving users that fall into the regions of U(r) modified by the barrier functions. That is, choosing to serve users with average throughputs ri that fall below the lower threshold R1 result in a relatively larger positive net change in the objective function. [0066] Conversely, choosing to serve users with average throughputs ri that are above the upper threshold R2 result in a relatively smaller positive net change in the objective function. This behavior has a tendency to favor users with low average throughput and disfavor serving users with high average throughput, resulting in the scheduler attempting to bias at least some users toward an acceptable middle range of data throughput. [0067] Because primal ascent allows the scheduler to use different utility functions U(r) for different sets of users, some users may be scheduled according to different priorities. For example, the service provider may define different utility functions corresponding to differing qualities of service (QoS), and then assign these different utility functions to different classes or groups of users. [0068] As a further illustration of the application of barrier functions to utility functions, a utility function may be defined as,
[0069] where γ represents some biasing factor having a configured magnitude corresponding to the extent by which low-rate users are to be biased towards a higher data throughput. The service provider may thus set γ to a fixed value, make it configurable on a per-user basis, configure it to change as a function of time or other parameter, or any combination of these techniques. Of course, the utility function Ui(ri) may also have barrier function modification for rmax similar to that shown for rmin in Eq. 9. Note that the utility function of Eq. 9 is not differentiable at ri=ri min and gradient-based scheduling approaches could not be easily used with this function. [0070] In addition to the flexibility of handling non-differentiable utility functions, the primal ascent approach accommodates non-separable functions. Suppose that the service provider wishes to restrict the amount of bandwidth used by a particular class of users denoted by Q. One approach is to introduce a hard constraint where users in the class Q are not scheduled if their total average served rate exceeds a target value set by the service provider, or otherwise configured by the scheduler. However, suppose that only users of the class Q are using the network 10, such that the possibility that there will be service intervals during which no user is served. [0071] The primal ascent approach can handle this scenario by falling back to a more relaxed constraint governing the service of users. However, because primal ascent techniques relieve many constraints on allowable utility and objective functions, one might incorporate a barrier function into the objective function F as,
[0072] The expression for the objective function given in Eq. 10 above has no effect on the objective function when the soft constraint is satisfied, but causes the objective function to decrease in value when the soft constraint is violated. If only users of the restricted class Q are using the network 10, then the barrier function has negligible effect on the scheduling decisions made. Note that the above objective function (including the barrier function) is non-separable and therefore potentially difficult to use with gradient-based schedulers. [0073] A further point of flexibility involves time-dependent user scheduling. That is, the service provider may want to use different scheduling priorities at different times during the day. Suppose that a combination of M different functions (possibly including barrier, reward, utility, and revenue functions) are required or desired. This set of functions may be denoted by F( ).[0074] Let T denote the time of day, and let
[0075] denote the weighting to be assigned to each function for each time of day T (e.g., for each hour). One may then use the following time-dependent objective function F to in user scheduling, F( )=Σαi(T)F i() (11)[0076] where αi represents the weighting factor for Fi, and represents the average served rate vector as discussed in conjunction with the logic flow diagram of FIG. 4.[0077] The service provider or network operator might set different weighting factors αi for different times of the day to effect changing scheduling priorities, and might further apply different sets of weighting factors to different classes of users. [0078] In general, the primal ascent scheduling techniques of the present invention are advantageously used to schedule users sharing the air interface in a HDR network. By calculating the net change(s) in the desired objective function(s) that would arise from serving each user, the primal ascent approach identifies the user to whom service would yield the greatest or most desirable benefit. Because primal ascent evaluates the net change (i.e., it considers the affect of actually providing the user, if selected, the requested amount of data), primal ascent allows great flexibility in the types of underlying cost or benefit functions that may be optimized. [0079] Of course, the above time-of-day details, like the earlier general developments of the primal ascent approach, are subject to significant variation. As such, the present invention is not limited by the foregoing details rather the present invention is limited only by the scope of the following claims, and the reasonable equivalents thereof. Referenced by
Legal Events
Rotate |


text:
"Sanctified afflictions are spiritual promotions."
Mathew Henry
"A good End cannot sanctify evil Means; nor must we ever do Evil, that Good may come of it"
William Penn
"Each religion, so dear to those whose life it sanctifies, and fulfilling so necessary a function in the society that has adopted it, necessarily contradicts every other religion, and probably contradicts itself"
George Santayana
"Blood is a cleansing and sanctifying thing, and the nation that regards it as the final horror has lost its manhood... there are many things more horrible than bloodshed, and slavery is one of them!"
George Gissing
"And such were some of you: but ye are washed, but ye are sanctified, but ye are justified in the name of the Lord Jesus, and by the Spirit of our God."
"Countless sinners are sanctified, attaching their minds to the Feet of the Lord. "
Sri Guru Granth Sahib
"The nine holes pour out filth. Chanting the Lord's Name, they are all purified and sanctified."

subset: commoncrawl


text:
Very good rooms on a reasonable price! Elegant, clean and good service! only negative that the parking is very busy! We occupied two rooms, both were same level and everything was like it must be in a good hotel! For that the price was really not high!
- Reservation Options:
- TripAdvisor is proud to partner with Booking.com, Expedia, Hotels.com, Travelocity, Priceline and Odigeo so you can book your Deutsches Haus reservations with confidence. We help millions of travelers each month to find the perfect hotel for both vacation and business trips, always with the best discounts and special offers.


text:
Tinchy Stryder's music video Off The Record. Off The Record is the lead single off Tinchy Stryder's imminent forth studio album. Off The Record is produced by the beloved Calvin Harris and is all about what happens in Vegas stays in Vegas. With huge commercial success from his recording career Stryder also finds time for other roles as Music Executive, A&R Executive, Founder of Star In The Hood clothing brand, and the highly respected Co-Founder and Co-Chief Executive Officer (CEO) of Takeover Roc Nation with partner Jay-Z.
Saving Playlist
We are saving your playlist, please wait.
Choose a Player Format. You can include scrollable thumbs with the player showing all videos that are availabe for the artist / playlist.
Click the Autofill icon and let us fill your queue.
Don't worry, we will only add similar artists ;)
Switch on DJ MODE to create your queue and watch the videos you like.
Click on video thumbnails around the site and add them to your queue.
Signing In
We are signing you in, please wait.
Signing you out...


text:
Sign In to Your Account
Shop The Large Selection Of All Bulldog Holsters At Rock Bottom Low Prices...Guaranteed at Sportsman's Guide
In Stock
9mm / .45 cal Belt Slide Holster
Cebeci Beretta 84, 85 Taurus PT58 Leather Snap
Homeland Conceal Large Belt Slide Holster
Classic Old West Styles Black Hawk Belt Slide
Leather, left or right handed, dual-carry Belt Slide Holsters. PRICED LOW!
A universal, fast and easy design... Genuine, high-grade black leather with belt slots to fit up to 1 3/4" belt. Includes a removable clip for wearing inside the waistband when preferable. Fits most mid-size 9mm and .45 ACP handguns, including the 1911 and clones.
State Color, as available in the Shopping Cart. Order Today!
More Details...
Why are all sizes not listed? We only display sizes that are currently available for you to order.
Cebeci® Leather Snap Holsters.
Homeland Conceal Large Belt Slide Holster. SAVE BIG!
A universal, fast and easy design. It's compact and fits close to your body, so it conceals well.
State Color, as available in the Shopping Cart.
Expected availability: 5/4/2015
Classic Old West Styles® Black Hawk Belt Slide Holster.
Carrying comfort and security. No thumb breaks or hidden retention... this unit offers fast access when seconds count. Crafted from top-grain cowhide leather, sure to break in well.


text:
Post-game breakdown: SMU
The Huskies secured a signature victory that they so desperately needed.
Are you ready for some more late night drama?
UConn's NCAA tournament East Region third round game with former Big East rival Villanova should be very entertaining.
It will be hard to top Thursday's overtime thriller against Saint Joseph's University.
Both teams expect a real intense game.
"It's going to be a fight," coach Kevin Ollie said. "We've got to be ready for that, and we've got to keep throwing punches."
Here's a pre-game preview
-- Tip-off time: approximately 9:40 p.m. (TBS)
-- Location: First Niagara Center, Buffal0
-- Records: Seventh-seeded UConn 27-8, No. 2 Villanova (29-4)
-- Last game: UConn beat Saint Joseph's, 89-81 (OT), Thursday; Villanova defeated Milwaukee, 73-53, Thursday
-- Probable starters: UConn, 6-1 sr. guard Shabazz Napier (17.6 pts, 6.0 rebs, 5.0 assists), 6-0 jr. guard Ryan Boatright (12 pts, 3.5 assists), 6-9 jr. forward DeAndre Daniels (12.7 pts, 5.7 rebs), 6-7 sr. forward Niels Giffey (8.6 pts, 3.5 rebs), 6-10 so. center Phil Nolan (3.7 pts, 2.5 rebs)
Villanova, 6-3 jr guard Darrun Hilliard (14.3 pts), 6-3 so. guard Ryan Arcidiacono (9.7 pts), 6-6 sr. guard James Bell (14.5 pts, 6.1 rebs), 6-7 jr. forward JayVaughn Pinkston (14.2 pts, 6.1 rebs), 6-11 so. forward Daniel Ochefu (5.7 pts, 6.1 rebs)
-- This is the first meeting between UConn and Villanova in the NCAA tournament.
-- Series: UConn trails 33-30, losing last meeting 70-61 on Feb. 16, 2013, at the XL Center. The Huskies have won four of last five overall.
-- Giffey on Villanova: "They're one of the typical former Big East teams, real scrappy, really aggressive. I know they play a double-team, and they trap on defense. So they really try to bring the game to you.
"They're not going to just sit back and relax and wait for stuff to fall. That's just the kind of basketball we expect."
-- The Wildcats are second in Big East in scoring at 78.5 points and make nine 3-pointers per game.
"They're a great, amazing three-point shooting team…," Ollie said. "So we're going to have our work cut out for us. We've got to run them off the 3-point line. We've got to play Pinkston down low. He's a great player also. That's what gives them balance, and that's what makes them tough to guard."
-- For the fourth time in the last five games, UConn will play a ranked opponent. Villanova is sixth in the Associated Press top 25 poll. The Huskies are 6-4 against ranked teams this season.
-- Top reserve: 6-5 freshman guard Josh Hart (8 pts, 4.5 rebs).
-- Common opponents:Temple (UConn swept, 90-66 and 68-55; Villanova won 90-74), Saint Joseph's (UConn won 89-81, Villanova won 98-68).
-- The Huskies own a 33-8 record in last 12 NCAA trips, dating back to 1999.
-- Hot: Freshman Amida Brimah is averaging nine points, 6.7 rebounds and 2.3 blocks in last three games. Cold: Reserve Lasan Kromah is shooting 33 percent (14-for-43) in last 10 games.
-- The Huskies are 3-0 in NCAA tourney games in Buffalo.
-- Tonight's winner advances to the Sweet Sixteen Friday at Madison Square Garden in New York. The next opponent will be Sunday's winner of the Iowa State-North Carolina game.
-- Napier expects a typical Big East type game.
"The team that's going to be giving the most effort and the most aggressiveness on the court is going to end up winning because that's what the Big East is all about."
-- Villanova's James Bell on Napier: "He's a great player, a great point guard. He gets everybody involved as well as himself…. He's been in this position before and just won a national championship. He knows what it takes to win. He's just a great opponent, one of the best players in the country. It should be interesting playing against him, trying to stop him."
-- Villanova coach Jay Wright on his team's familiarity with UConn:
"UConn, they know, and these guys were recruited by UConn, and they've watched UConn. So I think our guys are very dialed in because they have great respect for the tradition and also the current team."
-- Check back after the game for a post-game breakdown.
-- Follow me on Twitter @GavinKeefe
Former UConn great Richard "Rip" Hamilton announced his retirement today.
UConn took a difficult route to victory on Sunday. So it was a typical win for the Huskies, who held off Tulane, 67-60, at Gampel Pavilion.
UConn senior Ryan Boatright and Providence sophomore Kris Dunn are two of 17 finalists for the Bob Cousy Point Guard of the Year Award in college basketball.
Freshman Daniel Hamilton is a rising star. The latest evidence came in UConn's 75-72 loss at Memphis on Thursday night.
UConn and Memphis meet twice over the final few weeks of the regular season.
UConn played its most complete game this season on Thursday night. Its near perfect performance couldn't have come at a better time.
UConn begins a make-or-break stretch tonight.The Huskies host Tulsa, the American Athletic Conference leader, at the XL Center.
UConn released a statement late Sunday from Jim Calhoun on the passing of fellow Hall of Fame coach Dean Smith, the North Carolina legend.
Here's a revealing statistic: UConn is 7-1 when Rodney Purvis scores in double figures.
UConn played about 13 minutes of nearly perfect basketball on Wednesday night.
UConn has never lost more than two games in a season at Gampel Pavilion since the building opened in 1989. That streak is in jeopardy.
1 | |
2 | |
3 | |
4 | |
5 | |
6 | |
7 | |
8 | |
9 | |
10 |
1 | |
2 | |
3 | |
4 | |
5 |
1 |
Fitch High School students hold Black History Month 'die-in' |
2 | |
3 | |
4 | |
5 |
Hospitals balk at latest tax increase, other Malloy budget moves |


text:
For more information on KPFA's archiving policy go here: Learn More.
Co-hosted by Khalil and Malihe.
« Previous Month July 2014 | Current Month: August 2014 | Next Month » September 2014 |
There are no recent archives available.
Looking for more? Click here to browse all available archives of this program.


text: No recent wiki edits to this page. The opening story arc concludes in this action-packed issue. Guatemala City literally explodes as the People's Revolution kicks into high gear. The C.I.A.-backed military butchers fight a street-by-street battle against the Communist insurgents and it's up to Harry Kraft to level the playing field. Luckily, Harry knows a thing or two about flying fighter planes and he takes to the air to rain down some serious hellfire.


text:
Not many hotels built in 1924 qualify as new, but the Roosevelt in New York City is a glamorous exception.
In 1995 the 1,040-room hotel, named for the first President Roosevelt, closed, dirty and worn, for a vast renovation. Since April, it has been reopening gradually, a few floors at a time, and the refurbishment is nearly complete.
The hotel is an efficient blend of old and new. With floral bedspreads, mahogany television armoires and dual-line telephones, the traditionally furnished rooms are quite solidly planted in the latter half of the 20th century. Bathrooms are provided with pedestal sinks, cream-colored tiles and, in the larger rooms, separate tubs and stall showers. And all the Jazz Era radiators, wiring and plumbing are gone.
But in the public rooms it is possible to sit back, ignore the passing parade of sweatsuits and jeans, and imagine a more majestic era. The restored Palm Room, an elegant oval surrounded by a dozen fluted columns, seems designed for tea dancing. Look up and you see a ceiling painted to evoke a Fragonard sky. Look toward the lobby, and you see guests pass under the hotel's original pendant clock, shaped like an elaborately decorated pocket watch. It inspired the old suggestion ''Meet me under the clock at the Roosevelt.''
Still to come later this year are a 12,000-square-foot health club and a restaurant. For now, meals are served in the conservatively decorated Colonial Room. The introductory room rate is $199 a night. For information call (888) 833-3969. TERRY TRUCCO
Photo: The lobby of the Roosevelt. (The Roosevelt)


text:
Encapsulation of NASA's Orbiting Carbon Observatory-2, or OCO-2, into the Delta II payload fairing nears completion in the mobile service tower at Space Launch Complex 2 on Vandenberg Air Force Base in California. The fairing will protect OCO-2 during launch aboard a United Launch Alliance Delta II rocket, scheduled for 5:56 a.m. EDT on July 1. OCO-2 is NASA's first mission dedicated to studying atmospheric carbon dioxide, the leading human-produced greenhouse gas driving changes in Earth's climate. OCO-2 will provide a new tool for understanding the human and natural sources of carbon dioxide emissions and the natural "sinks" that absorb carbon dioxide and help control its buildup. The observatory will measure the global geographic distribution of these sources and sinks and study their changes over time.
Image credit: NASA/30th Space Wing, U.S. Air Force


text:
So remember than 70-1 shot that SB 'labored so hard to beat' what a dud he's turned out to be -_- what say the nay Sayers now ?
Seeing as there are about 3xs as many dirt races as Poly races, why would they not run him on both. Especially if they want any award of any kind any year they HAVE to run him on the dirt - and guess what he still wins. Surprise. Sorry he doesn't win by 10 + lengths every time. I don't believe batteries were included in his anatomical assembly. He is not a machine. He isn't going to win an award this year. Even his staunchest fan will admit to that. Enough. People be damned that they are happy he ran a good race. I don't understand.
This horse would have to win by 15 lengths to even slightly impress you, We get it.You don't have to post a degrading post EVERY SINGLE time he runs.
"Boots" is the name of the dart board he uses to choose the 'Flavor of the week'. Because if it isn't obvious by now, this game is nothing but dancing dollar signs to mr. Tmallios. And if for some unthinkable reason you happen to post an observation or opinion that differs for him - be prepared to get a mouthful of horsecrud that he steals from some de-motivational poster. Unless his precious Rudy Rodriguez has a horse running, and then all bets are off.
Good, another easy Baffert Classic toss horse.
You are so right. You are the only person in this big wide world that ever liked CC. Every one else trash talked and though he was scum so much so he was the heavy favorite in the derby. You and your inflated ego must have quite the impact. The over generalizations on this site are hysterical.
oh tmallios , what a joke you are. About 2/3 months ago you were leading the charge on the Princess winning front- and then your BELOVED Rudy's horse won ONE- stakes race in her entire career, and all the sudden she is a crown jewel and Princess of Sylmar is nothing but a lowly peasant? Where do you get off calling out others on having favorites. (On a fairly innocent post no less) You would know all about that though.
She was stuck behind a wall of horses that interrupted her late run Javier should have known better. For a horse that was thrown off her game, to end up 3 + lengths in front of the next horse is still pretty darn good. she was hardly 'exposed' Keep trying to find ways discredit her though, it's fun to see you fail.
Game over dud
of course. Especially the fact that Curlin couldn't get the job done in ther derby either. Great selling point there, lol. And ROC isnt even a quarter of the horse Curlin was at this point. ROC is an easy toss.
Join 39,331
other passionate horse racing fans!


text:
Love Nature NYC! Debuts Bohème Candle CollectionTuesday September 10th, 2013 - 12:42PM
These are shortcuts to your favorite social networking and bookmark sites. Add this story to your Facebook page, del.icio.us, DiggIt, and many others!
The Bohème candle introduction from Love Nature NYC! won a Best New Product award in the Personal Care + Wellness: Cosmetic & Fragrance category at this year's NY NOW show. Made from a natural soy wax, the Bohème Collection is packaged in artistically designed glass jars that can be reused as a vase or votive holder. At a suggested retailer price of $28, each 11-ounce Bohème candle is hand poured in the United States and composed of a phthalate-free essential and fragrance oil blend. Completed with a cotton wick, candles in the collection burn for 80 hours. Bohème candles come in three fragrances, as described by Love Nature NYC!: Dore, a blend of sophisticated vanilla, musk and delicate white flowers; Joie, a sweet and crisp blend with notes of champagne, pomegranate and vetiver; and Femme, a sexy, feminine blend with notes of soothing chamomile, sage, subtle florals and a hint of vanilla. Tags: Love Nature NYC • NY Now • candle • Boheme • natural candle • soy candle • Housewares • Home DĂ©cor • |
Wayfair Marks Q4, Full Year With Sales Gain, Net Loss »
Target Plans Major Restructuring, Slates Job Cuts, Rethinks Grocery
StoreBound Extends Maytag Licensing Agreement
Las Vegas Market Partners With Gourmet Catalog For C11 Launch
Best Buy Finishes Fiscal Year Strong, Points To Investing
Kate Spade Expands Home Categories, To Launch Housewares Line
The Housewares Show will culminate what for many in this business has been a busy, compressed winter trade show schedule. The big question at every trade show big and small this year— and every year— ultimately boils down to "What's new?"


text:
I am at the most amazing thing today. I'm at the New York City Wine and Food Festival. It's the grand tasting as you can see behind me. There are hundreds of people here and we're just gonna go in and mingle and try us some great eats. Hey, this is Cooper with Paula Deen, yes, Paula Deen the Butter Queen.
The one thing that I wanna leave when I walk out the building is hope, because I'm living proof that the American dream still exists, y'all. You don't have to be 25 years old, you don't have to weigh 110 pounds, and you don't have to be blonde.
Go and get me a tissue. Oh, my God. It's been a long day. And we are gonna be signing off, we'll catch you guys real soon. Thanks.
Bye, y'all.
Find the Horseshoe Contest April 2015
Enter for a chance to win a Samsung washer and dryer!


text:
Minnesota Firefighters Rescue Dog From Fire
Firefighters rescued a dog from a townhome fire in Coon Rapids on May 29.
Crews found the fire burning in the living room of the townhome on Eagle Circle around 12:30 p.m. A general alarm was sounded for addtional crews.
The fire was placed under control in about 20 minutes and when firefighters were searching the home they found a 130-pound dog hiding in a closet.The dog was removed from the structure by firefighters and reunited with its owner.
Paramedics from Allina EMS gave the dog oxygen and then doused the canine with a a hoseline to clean the soot from its fur coat.


text:
Battle of Faventia
From Wikipedia, the free encyclopedia
(Redirected from Battle of Faventia (542))
This article does not cite any references or sources. (December 2009) |
Battle of Faventia | |||||||
Part of the Gothic War | |||||||
Belligerents | |||||||
Ostrogothic Kingdom | Byzantine Empire | ||||||
Commanders and leaders | |||||||
Totila | Constantian Alexander |
Strength | |||||||
5,000 | 12,000 |
In the spring of 542, at the Battle of Faventia (modern Faenza), an Ostrogothic army under king Totila scattered the larger Roman forces of generals Constantian and Alexander, beginning the resurgence of Gothic resistance to the Roman reconquest of Italy. Before the battle, Valaris, a gigantic Goth, challenged any Roman to do single combat with him. Valaris was slain by the Byzantine (Armenian) soldier Artabazes, who was also mortally wounded.
This Byzantine Empire-related article is a stub. You can help Wikipedia by expanding it. |
This article about a battle is a stub. You can help Wikipedia by expanding it. |


text:
Watch Arsenal 2-0 Everton match highlights [VIDEO]
Arsenal manager Arsene Wenger felt his side answered the critics by getting 'back to basics' after their midweek European nightmare to grind out a 2-0 victory over Everton and move back to third in the Barclays Premier League.
Wenger had slammed Arsenal's "suicidal defending" which cost them in a 3-1 home defeat by Monaco in the first leg of their Champions League last-16 clash on Wednesday.
There was, though, no repeat against the Toffees at the Emirates Stadium as Olivier Giroud, who missed several chances in midweek, netted a fine volley on 39 minutes, with a late deflected effort from substitute…


text:
Subscribe and get the latest issue every Wednesday by email.
Nikolai Roerich Apartment Museum
History of St. Petersburg Museum
By Delphine d'Amora
The St. Petersburg Times
Published: July 12, 2014 (Issue # 1819)
Onexim Group, owned by billionaire and Brooklyn Nets owner Mikhail Prokhorov, has bid to purchase 100 percent of shares in the influential Russian business daily Vedomosti, Russian media reported, citing sources close to the tender.
Vedomosti — which is published in tandem with the Financial Times and the Wall Street Journal — is one of a handful of Russian newspaper and magazine assets owned by Sanoma Independent Media, or SIM, a subsidiary of struggling Finnish media group Sanoma, which is unloading its Russian operations in an effort to firm up its bottom line.
Citibank, which was hired to manage the sale of SIM, is expected on Friday to close the call for bids on Vedomosti and other assets included in the company's portfolio, the report said.
SIM also publishes The St. Petersburg Times and a series of glossy magazines such as Cosmopolitan, Esquire, Harper's Bazaar and National Geographic through a cluster of Russian publishing houses.
Onexim has sent an official letter to Citibank offering to buy a 100 percent stake in Vedomosti, ITAR-Tass reported Thursday, citing a source who had seen the document and confirmation from a media executive familiar with the negotiations.
Prokhorov, whose wealth is estimated by Forbes at $11 billion, has already made multiple attempts to buy Vedomosti, several of his acquaintances told the paper. The sources also told Vedomosti that Derk Sauer, the Dutch founder of The Moscow Times and SIM, has been nudging him in this direction.
Sauer himself — who two years ago left SIM to head Russian media group RBC, in which Prokhorov holds a controlling stake — expressed interest in buying Vedomosti in an interview with The St. Petersburg Times in November last year.
"Vedomosti is a good business, it has good prospects and it is important for the market and for the media," Sauer said at the time.
While Onexim is primarily interested in Vedomosti, other SIM assets could also potentially be part of the sale, ITAR-Tass reported.
SIM owns only a 33 percent share in Vedomosti, so if Prokhorov wants operational control of the newspaper he would also need to purchase two equal stakes owned by Dow Jones and the FT Group, owners of The Wall Street Journal and The Financial Times, respectively.
SIM had been negotiating with Dow Jones and FT Group to sell its stake in Vedomosti, but talks were delayed earlier this year due to the crisis in Ukraine, ITAR-Tass reported.
Representatives of Onexim, Citibank, Sanoma and SIM declined Vedomosti's requests for comment.
Friday, Jan. 30 through Wednesday, Feb. 4
A retrospective of the films of Roman Polanski starts today at Loft-Project Etagi, 74 Ligovsky Prospekt, with a screening of 'Repulsion' at 7 p.m. and 'Rosemary's Baby' at 9:15 p.m. The series runs through Feb. 4 and will include Polanski's eminently creepy 'The Tenant,' the cult comedy 'The Fearless Vampire Killers' and 'Cul-de-sac' among others. Tickets are 150-200 rubles and the complete schedule is available at www.vk.com/artpokaz/


text:
Our People:
Our Leadership Our Faculty Our Staff
Andris Koh
An outstanding musician from Singapore, Andris Koh began studying the cello at the age of eight, and piano at the age of four. Ms. Koh holds a Diploma in Cello and Piano Performance from the Associate Board of the Royal Schools of Music in London, and a Bachelor of Music degree (with Academic Honors and a Minor in Dalcroze Eurhythmics) from the Cleveland Institute of Music. Upon graduating, she was awarded the Jim Hall Graduate Scholarship, and the Dr. Bennett Levine Memorial Award in Chamber Music. She is now pursuing her Master of Music degree in Cello Performance and Suzuki Pedagogy with Mark Kosower and Melissa Kraut at the Cleveland Institute of Music. She has also studied piano with Elizabeth DeMio, and Suzuki Pedagogy. She has been recently appointed as a Suzuki Cello instructor at the Sato Center for Suzuki Studies in Cleveland, Ohio.
Ms. Koh is a fellowship recipient of the Aspen Music Festival and School, where she studies with Darrett Adkins. In past summers, she has participated in the Sarasota Music Festival, National Orchestral Institute, the Pacific Music Festival in Japan, and the Pan Pacific International Music Festival in Australia. She has held Principal, Assistant Principal, section cello and substitute positions in various regional orchestras in Singapore and Ohio. She is currently a member of the Akron Symphony Orchestra. As a chamber musician, Ms. Koh was a member of the Cleveland Institute of Music's Intensive Quartet Seminar, where she worked closely with Peter Salaff and the Cavani String Quartet. She has also participated in master classes with Desmond Hoebig, Ronald Leonard, Clive Greensmith, Alisa Weilerstein, Joel Smirnoff, Masao Kawasaki, Donald Weilerstein, Takacs Quartet, Daedalus Quartet, Colorado Quartet, Julliard String Quartet and the Tokyo String Quartet. Ms. Koh was part of a quartet which won 2nd Prize at the Alexander & Buono International String Competition in 2010.
Back to Faculty Listings.
Conservatory Studies
Assistant Registrar
International Student Advisor
216.791.5000 ext. 233
For a complete list of our Conservatory departments, please see our Departments page.
For a complete list of faculty members and bios, please see our Faculty page.
CIM Online
Become a fan of CIM on Facebook
Hear live CIM concerts online at InstantEncore
Watch streaming CIM videos on Vimeo
Follow CIM on Twitter
Upcoming Events
Celebrating American Classics
March 7, 2015, 8:00 pm
Severance Hall
A CIM Women's Committee Benefit
Faculty Recital: Carolyn Warner & Friends XI
March 18, 2015, 8:00 pm
Mixon Hall
Carolyn Gadiel Warner, piano/violinPeter Salaff, violinDaniel Shapiro, pianoStephen Warner, violin, guest artistKim Nolen Gomez, violin, guest artistJames Umble, soprano/alto saxophone, guest artistDavid Lakirovich, violin, student artistIgnacio Cuello, viola, student artistTimothy Paek, cello, guest artist -
Chamber Music Master Class
March 19, 2015, 7:00 pm
Studio 217
Cavani String Quartet
Annie Fullard, violin
Mari Sato, violin
Kirsten Docter, viola
Merry Peckham, cello


text:
Burton makes plea for 'Reading Rainbow'
LOS ANGELES - LeVar Burton's campaign to bring "Reading Rainbow" to the online masses is off to an impressive start.
The effort to raise $1 million by July 2 received donations totaling nearly $900,000 within 10 hours of its launch Thursday on Kickstarter, according to the fundraising website.
Burton was the host of "Reading Rainbow," the children's literacy series that aired on public TV through 2009.
Contributors can claim rewards ranging from autographed memorabilia to a private dinner with Burton to a chance to put on the visor the actor wore on "Star Trek: The Next Generation."
A "Reading Rainbow" app for tablets was released in 2012. The Kickstarter campaign is intended to pay for an online version available to more children, including those at needy schools, said Mark Wolfe, Burton's business partner.
O'Reilly book to look at George Patton's death
NEW YORK - Fox News host Bill O'Reilly's fourth book in his multimillion-selling history series will examine the mysterious death surrounding famed World War II Gen. George Patton.
Stephen Rubin, president and publisher of Henry Holt and Company, announced that "Killing Patton" will be published Sept. 23. Martin Dugard will be the co-author.
Patton was a charismatic yet controversial commander who led an armored drive across France and into Nazi Germany after the invasion of Normandy. He died following an automobile accident in 1945.
O'Reilly's best-sellers include "Killing Kennedy: The End of Camelot," "Killing Lincoln: The Shocking Assassination That Changed America Forever" and "Killing Jesus: A History."
LaBelle, Sparks set for July 4 show
WASHINGTON - Patti LaBelle, Jordin Sparks, Michael McDonald and others will join headliner Frankie Valli at "A Capitol Fourth" concert.
Organizers say the July 4 celebration at the National Mall will be hosted by Tom Bergeron of "Dancing with the Stars."
Composer John Williams will conduct a new arrangement for orchestra and chorus of the "Star-Spangled Banner" to mark its 200th anniversary.
"A Capitol Fourth" will be broadcast live on PBS from the West Lawn of the U.S. Capitol from 8 p.m. to 9:30 p.m.
Associated Press
- Keywords
Notice about comments:
The Post and Courier is pleased to offer readers the enhanced ability to comment on stories. Some of the comments may be reprinted elsewhere in the site or in the newspaper. We ask that you refrain from profanity, hate speech, personal comments and remarks that are off point.
We do not edit user submitted statements and we cannot promise that readers will not occasionally find offensive or inaccurate comments posted in the comments area. If you find a comment that is objectionable, please click the X that appears in the upper right corner when you hover over a comment. This will send the comment to Facebook for review. Please be reminded, however, that in accordance with our Terms of Use and federal law, we are under no obligation to remove any third party comments posted on our website. Read our full terms and conditions.


text:
Learn how MacUpdate Desktop can install apps on MacUpdate with the simple click of the icon. Plus, keep all your apps updated.
SmoothCursor is a menu-bar application that provides separate controls for customizing the mouse and trackpad accelerations. It is the perfect tool to use in combination with drawing applications and FPS games!
System Notifications: SmoothCursor will display a system notification every time a different profile is activated using Growl or OS X 10.8 Mountain Lion's Notification Center. (This feature is optional and can be disabled by the user)
User-definable Hotkey: One of the most relevant features in version 2.0 is the ability to alternate between 2 profiles using an more...
What's New
- Updated copyright and URLs to 9Labs.
- OS X 10.7 or later


text:
Tony Award-Winning Urinetown: The Musical at the Lounge Theatre
* Additional fees apply. No coupon or promo codes necessary to enjoy the displayed discount price.
The last date listed for Urinetown: The Musical was Sunday October 28, 2012 / 2:00pm.
Most Popular Theater Event Nearby
Cinderella: Rodgers and Hammerstein's Magical, Musical Fairy Tale
- Full Price:
- $75.00 - $85.00
- Our Price:
- $53.00 - $60.00
When Rodgers and Hammerstein, perhaps the greatest composing team in history (The Sound of Music, … More
Venue Details
Reviews & Ratings
Featured review from Kenyon At Work
Red Velvetview more less of this reviewDefinitely recommend. Very good production. I put off seeing this show for so long because of the name. Don't make the same mistake!
star this review starred report as inappropriateActors amazing, venue perfect, voices outrageous! Don/t miss
star this review starred report as inappropriateWell acted, excellent choreograph, good music and band, funny yet thought provoking. Well worth it.
star this review starred report as inappropriateEven though the singing and acting was fair the script was pretty awful. Would not recommend it at all. G.H.
Book by Greg Kotis
Music by Mark Hollman
Directed by Jessica Aquila Cymerman


text:
Jack Mordino July 22, 2014 2:19 PM MotoGP » Herve Poncharal (Tech 3) - Q&A I like Poncharal's interviews, a lot - he always has something interesting to say, from his perspective at least. Wanting to "extract" a Moto3 rider and get him directly on a factory Yamaha is a risky but bold move. I think it's his way to "steal" potential super-talents from the factory teams, at least for a certain period. Reply Report abuse 3 agree 1 disagree
Jack Mordino July 13, 2014 2:18 PM MotoGP » German MotoGP - Race Results I liked that pit exit pile-up. completely fresh. A few laps later... yawn.... Honda&Marquez really make the rest seem plainly inadequate. Reply Report abuse 4 agree 1 disagree
Jack Mordino July 11, 2014 11:28 PM MotoGP » Understeer, 'trapped nerve' hamper Crutchlow "the Ducati bikes seem to be struggling with understeer, but we are trying hard to resolve the problem." I know this is Episode No 9, I've just forgotten which season we are currently watching from this serial Reply Report abuse 1 agree 0 disagree
Jack Mordino July 02, 2014 5:01 PM MotoGP » Rossi, Yamaha confirm two-year deal The contract was 2 years because it appeases both parties fears: From Rossi's side, in the event of 2015 not being a good year, he wouldn't want to be searching for a ride for 2016. The joy and gratitude in his message, is indicative of him being somewhat worried about being considered as a top-spec factory rider. From Yamaha's side, given that they may lose Lorenzo to Honda they wouldn't want to be looking for 2 competitive riders - which Vale has shown to be this year. They keep a "safe" spot with Vale, and will play with either Pedrosa (less likely) or another talent (more likely) to fill Jorge's void position. All the above, of course on the background of the unknowns, which are the mandatory use of spec-ECU in 2015, and of course, more importantly, the introduction of the Michelin tyres in 2016. We might see interesting things/results that year. Reply Report abuse 7 agree 1 disagree
Jack Mordino June 16, 2014 10:59 PM MotoGP » Lorenzo finally overcomes edge grip problems I really wish the MotoGP teams shared more technical information with the public, specifically concerning what solutions they implement to solve the problems they have. Would make insight in technical and set-up matters so much easier to build for those of us with a strong interest in them. Reply Report abuse 3 agree 0 disagree
Jack Mordino June 15, 2014 7:29 PM Last Edited 259 days ago MotoGP » Catalunya MotoGP - Race Results What a change of wind and racing paradigm Marquez has brought. In the "petrified" Stoner years, this race would be unthinkable without bad blood, whining and bitter comments afterwards. I was so glad to see them all shaking hands after the race, all having enjoyed the paint-scraping and having somehting to be happy about (except for Lorenzo perhaps). The race was an amazing edge-of-the-seat thriller. A little bit of more variation in the results in relation to the previous races and it would have been sublime racing perfection. Reply Report abuse 6 agree 2 disagree
Jack Mordino June 16, 2014 12:10 AM MotoGP » Catalunya MotoGP - Race Results 1050cc: In 2006 Rossi had a major problem with tyres. He DNF a few times because of them. Nicky Hayden won and he deserved it (he rode great that year)! If you think MotoGP in 2006 was boring then you really should give up on this sport. Yeah, I still remember Assen from that year..., Valencia, Catalunya (with that Gibernau-Capirossi first turn super-accident)... and that race where Pedrosa took out Hayden, severely hampering his title effort. That year was awesome, really. Reply Report abuse 3 agree 1 disagree
Jack Mordino May 31, 2014 2:47 PM MotoGP » Marquez extends pole run, Rossi misery Having good race pace but miserable starting position, might mean a stressed Rossi which in turn means strong chance of a serious mistake. Rossi's mistakes almost always happen in this fashion - an urge to reach the front when knowing he's got the pace. Reply Report abuse 6 agree 3 disagree
Jack Mordino May 30, 2014 12:57 PM MotoGP » Marquez straight up to speed in Mugello Rockstar84: MotoGP has become like F1, Marquez becoming another Vettel! Waiting for the booing to start! Vettel's booing isn't because he won so constistently, it's because he always has this uncool look on his face. A racer isn't just about speed. MotoGP's Vettel was Stoner, not Marquez. Marquez is passionate, always smiling, and always eager to scrap paint with fellow racers. He lacks Rossi's flamboyance and fan rapport of course but his riding is so passionate that he always strikes me with awe. He's the only guy on the grid who can ride a MotoGP bike in a way that is visibly wiggling and moving. With Marquez you can almost... feel the limit the bike is being ridden at. Reply Report abuse 8 agree 1 disagree
Jack Mordino May 29, 2014 1:35 PM MotoGP » Six of the best: Mugello MotoGPs JimmyTheRealOne: Meh. I never really liked Mugello. Just a bunch of annoying tightening corners What are you talking about? Mugell is fast and flowing, only surpassed by Philip Island in that regard. Reply Report abuse 0 agree 0 disagree


text:
Acrassicauda -- Leesburg, VA -- October 6th, 2013
The Iraqi metal band Acrassicauda kicked off their tour in Leesburg, Virginia on Sunday, October 6th at the Tally Ho Theatre. The recently renovated and reopened venue was pretty nice. I think this was their first metal show. I missed the opening band, Silence The Blind, and the black metal band Dispellment was already playing when I got there. The excellent prog band Iris Divine was next and finally Acrassicauda headlined. They played some new songs from their upcoming full length for the first time. While it appears that their line up has changed some since I saw them in 2011 they were still pretty great live. Their set was about 1 hour long. Here's their set list and below that is a photo of it that I shot at the show.
The Unholy Lie Garden Of Stones Massacre ----------------------- Sinbad Message From Baghdad The Unknown What's Worth Tyrant's Philosophy Remember [URL="http://farm4.staticflickr.com/3788/10143689183_7e43a0db28_k.jpg"][IMG]http://farm4.staticflickr.com/3788/10143689183_bcd7c10975_z.jpg[/IMG][/URL] |
Very cool.. saw the documentary on these guys.. i wonder if they'll be coming near me in Philly
All times are GMT -8. The time now is 01:32 PM. |
Blah Blah Blah Copyright WWW.METALSETLISTS.COM 2008


text:
Re: Negative affects of adding an AU?
The negative effects of adding an AU goes well beyond possible AA from creditors.
Read over in the Relationships and Money forums. Women are strange creatures. Would you give unlimited spending power to a strange creature? lol.
JP Morgan Select $10k | CSP $10k | Citi TY Premier $15k | BofA 3-2-1 $15k | Chase Freedom $10k | Discover IT $10k | Barclaycard $15k | AMEX SPG $5k | AMEX PRG NPSL | NASA Platinum-Advantage $10k | CapOne Quicksilver $3k | Walmart Card $5k | Amazon Card $10k | Chase Auto 1.49% | Joined myFICO 6/12 with a 540 FICO & today I'm over 750!
(691 Views)


text:
...(Insert charming witticism here) My name is Wesley. I'm a man of
many cliches, and contradictions, bad boy with a heart of gold...
you know, all that crap. :) I love bad jokes, and good
conversation. I'm extremely politically INcorrect. I'm also a blast
to talk to (considering you're bored, or irrevocably drunk). Oh,
and if you haven't noticed, I enjoy the self deprecating
humor...and the thesaurus. :)
I am Naughty, unpredictable, and smiling
I am Naughty, unpredictable, and smiling


text:
DDESS Public Affairs Office
700 Westpark Drive
Peachtree City GA, 30269
Phone: 678-364-8044 Fax: 770-632-8720
NC: Camp Lejeune District News
Thu, Feb 26, 2015 | Area teen in running for Military Child of the Year
Resiliency and leadership. Those were the characteristics that qualified 17-year-old Christopher Raul Rodriguez as a semi-finalist for the 2015 Military Child of the Year Award, presented by Operation Home Front.
Thu, Feb 5, 2015 | Monthly class empowers parents of students
The faculty and staff of Camp Lejeune District Schools are offering parents the opportunity to learn tips, ask questions and receive advice through informational classes.
Thu, Jan 29, 2015 | Hand-made Arcade to Open at DeLalio Elmentary
DeLalio Elementary School students aboard Marine Corps Air Station New River are creating arcade games in support of the Global Cardboard Challenge and will host and event open to the community Feb. 4.
Thu, Jan 29, 2015 | College Fair Prepares Lejeune Students for Success
Educators and various college representatives visited Lejeune High School to set students up for success during a college and career fair aboard Marine Corps Base Camp Lejeune Monday.
Thu, Jan 22, 2015 | Work Underway to Replace Delalio Elementary School
Construction of a new building for DeLalio Elementary School is underway.
Fri, Jan 16, 2015 | Camp Lejeune schools offer Parent University
Faculty and staff with Camp Lejeune District Schools are giving parents a chance for a classroom-based informational session starting in January.
Tue, Jan 6, 2015 | Schwartz steps down as Devilpups' football coach
After 38 years as a coach, Darryl Schwartz said it was time for him to "focus on" himself and his family.
Thu, Dec 18, 2014 | DeLalio Host Hour of Code
Over the course of the past week, students participated in a 20-hour introductory computer science class, learning the basics of computer programming.
Wed, Dec 17, 2014 | Camp Lejeune Schools to Transition to Uniforms
The transition to school uniforms will occur at the start of the 2015-2016 school year in all grade levels
Thu, Dec 4, 2014 | Lejeune HS Students Dance, Mime Across Stage
LHS students are gearing up for a weekend of traditional fairy tales and improvisation during the fall production of Paul Sills 'Story Theater' aboard Marine Corps Base Camp Lejeune, Friday and Saturday.
Wed, Nov 26, 2014 | Devil Pups kick-off season with intensity, drive
The Lejeune Devil Pups competed against the Trask Titans to kick off the 2014 basketball season.
Thu, Nov 13, 2014 | Lejeune Devil Pups Wrestling Seeks Team Members
New head coach, Ben Reichert and assistant coach, Joe Sheffield are breathing new life into the LHS wrestling team.
Thu, Nov 6, 2014 | Johnson Primary families kick off season, celebrate Halloween
Students and families celebrated autumn with games, costumes and family-fun during the annual Fall Festival at the Johnson PS
Wed, Oct 29, 2014 | Reichert back coaching wrestling at Lejeune
Two years after leaving the job as Swansboro High School's wrestling coach Reichert is back on the mat – as the head coach at Lejeune High School.
Fri, Jun 20, 2014 | Lejeune HS - Richardson to play football for Lacawanna
LHS graduating senior, Jamaz Richardson, is headed to Lackawanna College to play football.
Thu, May 1, 2014 | Lejeune Theater Guild presents "Footloose"
The Lejeune Theater Guild will present their spring production of 'Footloose' at Lejeune High School aboard Marine Corps Base Camp Lejeune, Friday and Saturday.
Wed, Apr 30, 2014 | Lejeune HS Students Recognized as American Red Cross Volunteers
LHS Career Practicum Students regognized at American Red Cross 2014 Volunteer Recognition Ceremony.
Tue, Apr 15, 2014 | Lejeune High School graduate selected to serve on Cisco 'dream team'
A Lejeune High School graduate now studying at East Carolina University has been selected as one of 10 students nationwide to serve on a "Dream Team" at an international education and training event.
Wed, Mar 12, 2014 | Changes to NC-Camp Lejeune Schools Dress Code
The Camp Lejeune School Board will host a town hall Thursday at Camp Lejeune High School to discuss the possibility of changes to dress code requirements.
Wed, Mar 5, 2014 | Delalio Elementary participates in Jump Rope for Heart
With bright, smiling faces, students in Jump Rope for Heart during their gym classes, Feb. 13-14.
Fri, Jan 31, 2014 | Camp Lejeune schools offer personalized educational program for children with disabilities
NC-Camp Lejeune District ISS spoke to parents about the IEP Program during the EFMP Quarterly Forum
Wed, Dec 18, 2013 | Inspiring confidence in youth through running
Marine Aviation Logistics Squadron (MALS) 29 and Delalio ES have joined forces to help build a community in which girls of all ages know and activate their limitless potential and boldly pursue their dreams.
Tue, Dec 17, 2013 | Career Practicum Red Cross Holiday Party
Last week the Red Cross workers in Career Practicum at LHS were invited to a Holiday Party at the General's house
Wed, Nov 6, 2013 | Lejeune High School Honored at the 2013 NCTC High School Play Festival
Lejeune High School's Theatre Department made the school and community proud by bringing home honors from the 2013 NCTC High School Play Festival, held at Washington High School on November 2.
Tue, Jun 25, 2013 | Class of 2013: LHS graduates dream big
They learned so much throughout the years, but only one thing resonated in their final hours as students – don't be afraid to dream big.
Sun, Jun 2, 2013 | Lejeune HS Students Tour the USNS Comfort
A group of LHS students traveled to Naval Base Norfolk, VA to tour the U.S. Naval Ship Comfort as a part of the schools Nurse Aide I program.
Sat, Jun 1, 2013 | Mayor's Office announces contest winners
DoDEA students among winners announced by the Jacksonville Mayor's Office for the Onslow Commission for Persons with Disabilities poster, poetry and essay contest to promote "Disabilities Awareness Week"
Thu, May 23, 2013 | Brewster MS: Student program honors members, volunteers
More than 200 base residents and guests attended the Hoops-N-Dreams program recognition and achievement banquet at Brewster MS.
Thu, May 16, 2013 | Lejeune Shines at State Meet
Lejeune boys' and girls' track teams showed what they have worked for the entire season at the 1-A track and field state championship meet.
Fri, Apr 26, 2013 | Earth Day Splash for Trash event t-shirts, designed by Brewster Middle School and Lejeune High School.
Nearly 100 service members and civilians gathered in the early morning for the Splash for Trash event at Engineer Point.
Fri, Apr 26, 2013 | STEAM week heats up DeLalio
STEAM week took place April 15-19 and every student from kindergarten up to fifth grade participated in the daily activities at DeLalio.
Thu, Apr 25, 2013 | Lejeune Theatre Guild graces stage with musical gospel
Members of the Lejeune Theater Guild will make the most ambitious move the drama department has ever attempted with their spring production of the Broadway hit "Godspell" at Lejeune High School aboard Marine Corps Base Camp Lejeune April 26 and 27.
Thu, Apr 25, 2013 | Marines teach navigation fundamentals to middle schoolers
Marines with Combat Logistics Regiment 27, 2nd Marine Logistics Group traveled to Brewster Middle School, here, to teach seventh-grade students about land navigation.
Wed, Apr 24, 2013 | Artwork displays teach Lejeune students about the environment
More than 1,000 Department of Defense elementary and high school students attended the 10th Annual Earth Day Fair and Art Contest at the Marston Pavilion aboard Marine Corps Base Camp Lejeune to learn how they can play their part to help the earth.
Thu, Apr 11, 2013 | Drama queens qualify for national competition
2 Lejeune HS actresses were awarded top honors at the state competition for high school theater November 2012
Wed, Apr 10, 2013 | DeLalio Elementary students celebrate STEAM week
DeLalio Elementary School students celebrate Science, Technology, Engineering, Art and Math week April 15-19 at the school aboard Marine Corps Air Station New River.


text:
WEBSTA - Instagram Web Viewer
If you want to sing out, sing out. And if you want to be free, be free.
New Message
The user you are sending this message to is not on Websta. To receive your message, send a request to use Websta Messages. The request will appear as a comment on his/her latest post.
You need to be following madison_z to like or comment.


text:
The Mile Marker Murders by C.W. Saari
The novel is fast-paced as the plot shifts between Atlanta and Washington, DC, taking the reader behind the scenes with the FBI and into Bannister's life.
Before it was published, the book was a grand prize winner with the Public Safety Writers Association for best unpublished fiction. Saari first self-published the novel before turning to BQB Publishing in 2011 to have it professionally restructured, edited, and made available for national distribution.
To book him for an appearance or book signing, contact email@example.com
About The Mile Marker Murders
When Caleb Williamson, a career officer with the CIA, disappears, officials are left wondering whether he is a spy who has defected or the victim of a crime. Meanwhile, Williamson's friend, FBI agent Tyler Bannister, is focused on catching an extortionist who has threatened to unleash a biological poison if a multimillion dollar demand is not met.
When Williamson turns up dead alongside the corpses of two women near a northern Virginia highway, Bannister is assigned to a task force to identify what looks to be a cunning serial killer.
While Bannister becomes obsessed with finding the murder before he strikes again, a fourth body is discovered. The stakes become personal when the killer targets a beautiful woman at the FBI Academy who is Banister's new love interest. To learn more about The Mile Marker Murders, click here. The book is available to purchase through BQB's online store http://www.shop.boutiqueofqualitybooks.com, Amazon, Barnes & Noble and other brick and mortar and online book stores.
About BQB Publishing
Founded in August of 2010, BQB was created to be "the writer's publisher," focusing on quality writing from new authors. An independent hybrid publisher, BQB combines the quality processes of traditional publishing with hands-on author involvement to bring today's new writers and tomorrow's best sellers into the hands of booksellers and the reading public. To learn more about BQB, visit http://www.bqbpublishing.com


text:
Group velocity and dispersion model of coupled-cavity waveguides in photonic crystals
JOSA A, Vol. 20, Issue 1, pp. 147-150 (2003)
Enhanced HTML Acrobat PDF (174 KB)
A theoretical model of the group velocity, dispersion parameter, and dispersion slope of coupled-cavity waveguides in photonic crystals is reported. Results arising from closed-form expressions show a good agreement with simulation results obtained by employing a plane-wave expansion method. Coupled-cavity waveguides present interesting dispersion properties that may be employed in applications such as optical signal processing, dispersion compensation, and optical delay lines.
© 2003 Optical Society of America
OCIS Codes
(130.2790) Integrated optics : Guided waves
(130.3120) Integrated optics : Integrated optics devices
(260.2030) Physical optics : Dispersion
Original Manuscript: June 11, 2002
Revised Manuscript: July 31, 2002
Manuscript Accepted: August 1, 2002
Published: January 1, 2003
Alejandro Martı́nez, Andrés Garcı́a, Pablo Sanchis, and Javier Martı́, "Group velocity and dispersion model of coupled-cavity waveguides in photonic crystals," J. Opt. Soc. Am. A 20, 147-150 (2003)
Sort: Year | Journal | Reset
- E. Yablonovitch, "Inhibited spontaneous emission in solid-state physics and electronics," Phys. Rev. Lett. 58, 2059–2062 (1987). [CrossRef] [PubMed]
- S. John, "Strong localization of photons in certain disordered dielectric superlattices," Phys. Rev. Lett. 58, 2486–2489 (1987). [CrossRef] [PubMed]
- J. D. Joannopoulos, R. D. Meade, J. N. Winn, Photonic Crystals: Molding the Flow of Light (Princeton U. Press, New Brunswick, N.J., 1995).
- T. F. Krauss, R. M. de la Rue, S. Brand, "Two-dimensional photonic-bandgap structures operating at near infrared wavelengths," Nature 383, 699–702 (1996). [CrossRef]
- A. Yariv, Y. Xu, R. K. Lee, A. Scherer, "Coupled-resonator optical waveguide: a proposal and analysis," Opt. Lett. 24, 711–713 (1999). [CrossRef]
- N. Stefanou, A. Modinos, "Impurity bands in photonic insulators," Phys. Rev. B 57, 12127–12133 (1998). [CrossRef]
- N. W. Ashcroft, N. D. Mermin, Solid State Physics (Saunders, Philadelphia, Pa., 1976).
- M. Bayindir, B. Temelkuran, E. Ozbay, "Tight-binding description of the coupled defect modes in three-dimensional photonic crystals," Phys. Rev. Lett. 84, 2140–2143 (2000). [CrossRef] [PubMed]
- S. Olivier, C. Smith, M. Rattier, H. Benisty, C. Weisbuch, T. Krauss, R. Houdre, U. Oesterle, "Miniband transmission in a photonic crystal coupled-resonator optical waveguide," Opt. Lett. 26, 1019–1021 (2001). [CrossRef]
- V. Yannopapas, A. Modinos, N. Stefanou, "Waveguides of defect chains in photonic crystals," Phys. Rev. B 65, 23501-1–235201-6 (2002). [CrossRef]
- S. G. Johnson, J. D. Joannopoulos, "Block-iterative frequency-domain methods for Maxwell's equations in a planewave basis," Opt. Express. 8, 173–190 (2001); http://www.opticsexpress.org . [CrossRef] [PubMed]
- A. Taflove, Computational Electrodynamics (Artech House, Boston, Mass., 1995).
- A. Chutinan, S. Noda, "Waveguides and waveguide bends in two-dimensional photonic crystal slabs," Phys. Rev. B 62, 4488–4492 (2000). [CrossRef]
- V. N. Astratov, R. M. Stevenson, I. S. Culshaw, D. M. Whittaker, M. S. Skolnick, T. F. Krauss, R. M. de la Rue, "Heavy photon dispersion in photonic crystal waveguides," Appl. Phys. Lett. 77, 178–180 (2000). [CrossRef]
Cited By |
Alert me when this paper is cited |
OSA is able to provide readers links to articles that cite this paper by participating in CrossRef's Cited-By Linking service. CrossRef includes content from more than 3000 publishers and societies. In addition to listing OSA journal articles that cite this paper, citing articles from other participating publishers will also be listed.


text:
Sign In | Sign Up
Some Businesses Prefer To Pay Obamacare Penalty
Description:Since the Affordable Care Act passed, an increasing number of small businesses now say paying the government's penalty to break the law will be cheaper than following it. Nate Hindman joins Mike on set to discuss. (3:52)
Source: HuffPost Live Highlights
Tags: ACA , Affordable Care Act , Barack Obama , coverage