Precificação da energia eólica offshore no Brasil

Offshore wind power emits low amounts of gases, is renewable and has better performance than onshore due to its greater stability and higher wind power density, less visual and noise impact, among others. Brazil has a high capacity of generation, but has not yet developed any offshore projects. High costs are a strong impediment. This study is an effort towards pricing offshore resources through Livelized Cost of Energy - LCOE, which represents the minimum return to cover the costs of development, production and maintenance of a wind project. Initially LCOE was calculated for all Brazilian onshore wind farms listed at Bloomberg New Energy Finance R○, accounting for 71 farms. Then hypothetical offshore wind farms were created from the onshore farms, tripling the cost of generation, which is consistent with the literature, and estimating the offshore energy for two locations off the Brazilian coast using satellite data extracted from National Oceanic and Atmospheric Administration. The results demonstrate that offshore resources have the potential to significantly reduce the energy price due to the better performance of the wind at sea

Precificação da energia eólica offshore no Brasil

Offshore wind power emits low amounts of gases, is renewable and has better performance than onshore due to its greater stability and higher wind power density, less visual and noise impact, among others. Brazil has a high capacity of generation, but has not yet developed any offshore projects. High costs are a strong impediment. This study is an effort towards pricing offshore resources through Livelized Cost of Energy - LCOE, which represents the minimum return to cover the costs of development, production and maintenance of a wind project. Initially LCOE was calculated for all Brazilian onshore wind farms listed at Bloomberg New Energy Finance R○, accounting for 71 farms. Then hypothetical offshore wind farms were created from the onshore farms, tripling the cost of generation, which is consistent with the literature, and estimating the offshore energy for two locations off the Brazilian coast using satellite data extracted from National Oceanic and Atmospheric Administration. The results demonstrate that offshore resources have the potential to significantly reduce the energy price due to the better performance of the wind at sea

Minimum Data Set (MDS) Section Q Education: Helping People Return to the Community, February 12, 2014

Explanation of Minimum Data Set (MDS), implementation of Section Q, overview of the program, local contacts and functions, Referral Agency information, role and assistance provided by Long-Term care Ombudsman

Meniscal repair in the elite athlete : results of 45 repairs with a minimum 5-year follow-up

Background The preservation of meniscal tissue is important to protect joint surfaces. Purpose We have an aggressive approach to meniscal repair, including repairing tears other than those classically suited to repair. Here we present the medium- to long-term outcome of meniscal repair (inside-out) in elite athletes. Study Design Case series; Level of evidence, 4. Methods Forty-two elite athletes underwent 45 meniscal repairs. All repairs were performed using an arthroscopically assisted inside-out technique. Eighty-three percent of these athletes had ACL reconstruction at the same time. Patients returned a completed questionnaire (including Lysholm and International Knee Documentation Committee [IKDC] scores). Mean follow-up was 8.5 years. Failure was defined by patients developing symptoms of joint line pain and/or locking or swelling requiring repeat arthroscopy and partial meniscectomy. Results The average Lysholm and subjective IKDC scores were 89.6 and 85.4, respectively. Eighty-one percent of patients returned to their main sport and most to a similar level at a mean time of 10.4 months after repair, reflecting the high level of ACL reconstruction in this group. We identified 11 definite failures, 10 medial and 1 lateral meniscus, that required excision; this represents a 24% failure rate. We identified 1 further patient who had possible failed repairs, giving a worst-case failure rate of 26.7% at a mean of 42 months after surgery. However, 7 of these failures were associated with a further injury. Therefore, the atraumatic failure rate was 11%. Age and size and location of the tears were not associated with a higher failure rate. Medial meniscal repairs were significantly more likely to fail than lateral meniscal repairs, with a failure rate of 36.4% and 5.6%, respectively (P < .05). Conclusion Meniscal repair and healing are possible, and most elite athletes can return to their preinjury level of activity.

Weighted fairness with MCR guarantee and a general-purpose explicit rate allocation algorithm for ATM ABR service

In this paper, weighted fair rate allocation for ATM available bit rate (ABR) service is discussed with the concern of the minimum cell rate (MCR). Weighted fairness with MCR guarantee has been discussed recently in the literature. In those studies, each ABR virtual connection (VC) is first allocated its MCR, then the remaining available bandwidth is further shared among ABR VCs according to their weights. For the weighted fairness defined in this paper, the bandwidth is first allocated according to each VC's weight; if a VC's weighted share is less than its MCR, it should be allocated its MCR instead of the weighted share. This weighted fairness with MCR guarantee is referred to as extended weighted (EXW) fairness. Certain theoretical issues related to EXW, such as its global solution and bottleneck structure, are first discussed in the paper. A distributed explicit rate allocation algorithm is then proposed to achieve EXW fairness in ATM networks. The algorithm is a general-purpose explicit rate algorithm in the sense that it can realise almost all the fairness principles proposed for ABR so far whilst only minor modifications may be needed.

A systematic review of studies identifying predictors of poor return to work outcomes following workplace injury

BACKGROUND: Injuries occurring in the workplace can have serious implications for the health of the individual, the productivity of the employer and the overall economic community. OBJECTIVE: The objective of this paper is to increase the current state of understanding of individual demographic and psychosocial characteristics associated with extended absenteeism from the workforce due to a workplace injury. METHODS: Studies included in this systematic literature review tracked participants' return to work status over a minimum of three months, identified either demographic, psychosocial or general injury predictors of poor return to work outcomes and included a heterogeneous sample of workplace injuries. RESULTS: Identified predictors of poor return to work outcomes included older age, female gender, divorced marital status, two or more dependent family members, lower education levels, employment variables associated with reduced labour market desirability, severity or sensitive injury locations, negative attitudes and outcome perceptions of the participant. CONCLUSIONS: There is a need for clear and consistent definition and measurement of return to work outcomes and a holistic theoretical model integrating injury, psychosocial and demographic predictors of return to work. Through greater understanding of the nature of factors affecting return to work, improved outcomes could be achieved.

New approximation algorithms for minimum cycle bases of graphs

We consider the problem of computing an approximate minimum cycle basis of an undirected edge-weighted graph G with m edges and n vertices; the extension to directed graphs is also discussed. In this problem, a {0,1} incidence vector is associated with each cycle and the vector space over F-2 generated by these vectors is the cycle space of G. A set of cycles is called a cycle basis of G if it forms a basis for its cycle space. A cycle basis where the sum of the weights of the cycles is minimum is called a minimum cycle basis of G. Cycle bases of low weight are useful in a number of contexts, e.g. the analysis of electrical networks, structural engineering, chemistry, and surface reconstruction. We present two new algorithms to compute an approximate minimum cycle basis. For any integer k >= 1, we give (2k - 1)-approximation algorithms with expected running time 0(kmn(1+2/k) + mn((1+1/k)(omega-1))) and deterministic running time 0(n(3+2/k)), respectively. Here omega is the best exponent of matrix multiplication. It is presently known that omega < 2.376. Both algorithms are o(m(omega)) for dense graphs. This is the first time that any algorithm which computes sparse cycle bases with a guarantee drops below the Theta(m(omega)) bound. We also present a 2-approximation algorithm with O(m(omega) root n log n) expected running time, a linear time 2-approximation algorithm for planar graphs and an O(n(3)) time 2.42-approximation algorithm for the complete Euclidean graph in the plane.

Minimum enclosing spheres formulations for support vector ordinal regression

We present two new support vector approaches for ordinal regression. These approaches find the concentric spheres with minimum volume that contain most of the training samples. Both approaches guarantee that the radii of the spheres are properly ordered at the optimal solution. The size of the optimization problem is linear in the number of training samples. The popular SMO algorithm is adapted to solve the resulting optimization problem. Numerical experiments on some real-world data sets verify the usefulness of our approaches for data mining.

New Approximation Algorithms for Minimum Cycle Bases of Graphs

We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed graphs is also discussed. In this problem, a {0,1} incidence vector is associated with each cycle and the vector space over F-2 generated by these vectors is the cycle space of G. A set of cycles is called a cycle basis of G if it forms a basis for its cycle space. A cycle basis where the sum of the weights of the cycles is minimum is called a minimum cycle basis of G. Cycle bases of low weight are useful in a number of contexts, e.g. the analysis of electrical networks, structural engineering, chemistry, and surface reconstruction. Although in most such applications any cycle basis can be used, a low weight cycle basis often translates to better performance and/or numerical stability. Despite the fact that the problem can be solved exactly in polynomial time, we design approximation algorithms since the performance of the exact algorithms may be too expensive for some practical applications. We present two new algorithms to compute an approximate minimum cycle basis. For any integer k >= 1, we give (2k - 1)-approximation algorithms with expected running time O(kmn(1+2/k) + mn((1+1/k)(omega-1))) and deterministic running time O(n(3+2/k) ), respectively. Here omega is the best exponent of matrix multiplication. It is presently known that omega < 2.376. Both algorithms are o(m(omega)) for dense graphs. This is the first time that any algorithm which computes sparse cycle bases with a guarantee drops below the Theta(m(omega) ) bound. We also present a 2-approximation algorithm with expected running time O(M-omega root n log n), a linear time 2-approximation algorithm for planar graphs and an O(n(3)) time 2.42-approximation algorithm for the complete Euclidean graph in the plane.

Minimum sensor duty cycle with guaranteed estimator performance

In this paper, we consider Kalman filtering over a network and construct the optimal sensor data scheduling schemes which minimize the sensor duty cycle and guarantee a bounded error or a bounded average error at the remote estimator. Depending on the computation capability of the sensor, we can either give a closed-form expression of the minimum sensor duty cycle or provide tight lower and upper bounds of it. Examples are provided throughout the paper to demonstrate the results. © 2012 IEEE.

First record of minimum Irish hare (Lepus timidus hibernicus Bell 1837) longevity in the wild.

Average longevity of the mountain hare (Lepus timidus L., 1758) has been estimated at nine years in the wild (Macdonald D. and Barrett, P. 1993 Mammals of Britain and Europe. Harper Collins Publishers, London) with a maximum recorded age of 18 years for one marked animal (Angerbjörn, A. and Flux, J. E. C. 1995 Lepus timidus. Mammalian Species 495: 1–11). However, the longevity of the Irish hare (L. t. hibernicus Bell 1837) is entirely unknown. A total of 14 Irish hares was trapped and tagged at Belfast International Airport, Co. Antrim from February to April 2005. The sex, age (juvenile or adult) and weight of each animal were recorded. Adults were taken as those individuals >8-10 months old defined by the fusing of the notch between the apophysis and diaphysis of the tibia and humerus (Flux, J. E. C. 1970 Journal of Zoology 161: 75-123). Individual identification was made by a system of colourcoded ear tags (Roxan iD Ltd. Selkirk, Scotland) being inserted in the centre of the pinna of each ear. Each ear tag (6 × 34 mm) and puncture site was disinfected with 70 per cent ethanol prior to insertion. An adult male, #001/002 ‘Blue/Blue’, was tagged on 3 March 2005 weighing 3.8 kg and was sighted during a return site visit on 4 April 2007. An adult female, #026/003 ‘Green/Yellow’, was tagged on 15 April 2005 weighing 4.0 kg and was sighted during return visits on 25 March 2010 and 19 October 2010. The latest possible date of birth for both individuals was spring/summer 2004. Consequently, they were at least 3 years and 6.5 years old, respectively. This is the first record of minimum Irish hare longevity in the wild. These observations suggest that ear tagging does not compromise animal welfare and is an effective means of long-term monitoring. Future research may utilize capture-mark-recapture methods.

Plus ça change: (Post)Colonial Timor-Leste as a Return to (Pre)Colonial Realities in the Novels of Luis Cardoso

This article examines the novels of the East Timorese writer Luís Cardoso, and argues that their representations of a colonial past should not be simply interpreted as memorializations of Timor-Leste’s suffering at the hands of foreign aggressors. It proposes that underlying their revisiting of the past is a call for acknowledgement of the agency of East Timorese in the history of violent conflict that has troubled the nation, and that only this can guarantee true reconciliation, justice and national independence.

Fundamental Right to Freedom of Conscience without Objection? Some Notes for its Recognition as a Fundamental Guarantee

Conscientious objection is defined as the ability to depart from statutory mandates because of intimate convictions based on ethical or religious convictions. A discussion of this issue presents the conflict between the idea of a State concerned with the promotion of individual rights or the protection of general interests and an idea of law based on the maintenance of order and against a view of the law as a means to claim the protection of minimum conditions of the person. From this conflict is drawn the possibility to argue whether conscientious objection should be guaranteed as a fundamental right of freedom of conscience or as a statutory authority legislatively conferred upon persons. This paper sets out a discussion around the two views so as to develop a position that is more consistent with the context of social and constitutional law.

Pricing inefficiencies in private real estate markets using total return swaps

Efficient markets should guarantee the existence of zero spreads for total return swaps. However, real estate markets have recorded values that are significantly different from zero in both directions. Possible explanations might suggest non-rational behaviour by inexperienced market players or unusual features of the underlying asset market. We find that institutional characteristics in the underlying market lead to market inefficiencies and, hence, to the creation of a rational trading window with upper and lower bounds within which transactions do not offer arbitrage opportunities. Given the existence of this rational trading window, we also argue that the observed spreads can substantially be explained by trading imbalances due to the limited liquidity of a newly formed market and/or to the effect of market sentiment, complementing explanations based on the lag between underlying market returns and index returns.