text
stringlengths 0
6.48M
| meta
dict |
|---|---|
<!-- This Source Code Form is subject to the terms of the Mozilla Public
- License, v. 2.0. If a copy of the MPL was not distributed with this
- file, You can obtain one at http://mozilla.org/MPL/2.0/. -->
<!ENTITY cutCmd.label "Cut">
<!ENTITY cutCmd.accesskey "t">
<!ENTITY copyCmd.label "Copy">
<!ENTITY copyCmd.accesskey "c">
<!ENTITY pasteCmd.label "Paste">
<!ENTITY pasteCmd.accesskey "p">
<!ENTITY undoCmd.label "Undo">
<!ENTITY undoCmd.accesskey "u">
<!ENTITY selectAllCmd.label "Select All">
<!ENTITY selectAllCmd.accesskey "a">
<!ENTITY deleteCmd.label "Delete">
<!ENTITY deleteCmd.accesskey "d">
<!ENTITY spellAddToDictionary.label "Add to Dictionary">
<!ENTITY spellAddToDictionary.accesskey "o">
<!ENTITY spellUndoAddToDictionary.label "Undo Add To Dictionary">
<!ENTITY spellUndoAddToDictionary.accesskey "n">
<!ENTITY spellCheckToggle.label "Check Spelling">
<!ENTITY spellCheckToggle.accesskey "g">
<!ENTITY spellNoSuggestions.label "(No Spelling Suggestions)">
<!ENTITY spellDictionaries.label "Languages">
<!ENTITY spellDictionaries.accesskey "l">
<!ENTITY searchTextBox.clear.label "Clear">
<!ENTITY fillLoginMenu.label "Fill Login">
<!ENTITY fillLoginMenu.accesskey "F">
<!ENTITY fillPasswordMenu.label "Fill Password">
<!ENTITY fillPasswordMenu.accesskey "F">
<!ENTITY fillUsernameMenu.label "Fill Username">
<!ENTITY fillUsernameMenu.accesskey "F">
<!ENTITY noLoginSuggestions.label "(No Login Suggestions)">
<!ENTITY viewSavedLogins.label "View Saved Logins">
| {
"pile_set_name": "Github"
} |
174 Ga. App. 488 (1985)
330 S.E.2d 598
CUNNINGHAM, TALLMAN, PENNINGTON, INC.
v.
CASE-HOYTE COLOR PRINTERS.
70008.
Court of Appeals of Georgia.
Decided April 3, 1985.
Michael A. Lewanski, for appellant.
Richard L. Chambers, for appellee.
BANKE, Chief Judge.
The appellant, Cunningham, Tallman, Pennington, Inc., brought suit against "Case-Hoyte Color Printers" for breach of contract. "Case-Hoyt Atlanta Corporation" filed an answer and moved to dismiss the complaint on the basis that "Case-Hoyte Color Printers" was neither a legal entity nor a trade name for "Case-Hoyt Atlanta Corporation." Thereafter, appellant moved to amend its complaint by substituting "Case-Hoyt Atlanta Corporation" for "Case-Hoyte Color Printers" as the named defendant. This appeal is from an order denying the motion to amend and granting the motion to dismiss. Held:
"Where the real defendant has been properly served, a plaintiff has the right to amend in order to correct a misnomer in the description of the defendant contained in the complaint. [Cits.] Correction of a misnomer involves no substitution of parties and does not add a new and distinct party. [Cit.]" Atlanta Veterans Transp. v. Westmoreland, 123 Ga. App. 466 (181 SE2d 504) (1971). See also Franklyn Gesner Fine Paintings v. Ketcham, 252 Ga. 537 (314 SE2d 903) (1984); Block v. Voyager Life Ins. Co., 251 Ga. 162 (1) (303 SE2d 742) (1983); London Iron &c. Co. v. Logan, 133 Ga. App. 692 (2) (212 SE2d 21) (1975). Accordingly, the trial court erred in denying appellant's motion to amend and in granting appellee's motion to dismiss.
Judgment reversed. McMurray, P. J., and Benham, J., concur.
| {
"pile_set_name": "FreeLaw"
} |
Preliminary results of aggressive multimodality therapy for metastatic osteosarcoma.
Ten patients with metastatic osteosarcoma were treated at the Joint Center for Radiation Therapy, the Sidney Farber Cancer Institute, and the Children's Hospital Medical Center from 1973 to 1976. Patients were treated with an aggressive multimodality approach with included surgery, chemotherapy, and radiation therapy. Three of 10 patients are alive with no evidence of disease, five are alive, with disease, and two are dead of disease. The median survival is 12+ months. Local control data for radiation combined with high dose methotrexate in metastatic osteosarcoma is shown. | {
"pile_set_name": "PubMed Abstracts"
} |
/*
* Copyright (c) 2015, 2016, Oracle and/or its affiliates. All rights reserved.
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* This code is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License version 2 only, as
* published by the Free Software Foundation. Oracle designates this
* particular file as subject to the "Classpath" exception as provided
* by Oracle in the LICENSE file that accompanied this code.
*
* This code is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
* version 2 for more details (a copy is included in the LICENSE file that
* accompanied this code).
*
* You should have received a copy of the GNU General Public License version
* 2 along with this work; if not, write to the Free Software Foundation,
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
* or visit www.oracle.com if you need additional information or have any
* questions.
*/
package com.sun.marlin.stats;
/**
* Generic monitor ie gathers time statistics as nanos.
*/
public final class Monitor extends StatLong {
private static final long INVALID = -1L;
private long start = INVALID;
public Monitor(final String name) {
super(name);
}
public void start() {
start = System.nanoTime();
}
public void stop() {
final long elapsed = System.nanoTime() - start;
if (start != INVALID && elapsed > 0l) {
add(elapsed);
}
start = INVALID;
}
}
| {
"pile_set_name": "Github"
} |
Q:
React Context consumer can't find props
I'm trying to use React Context API to pass props, however I got "undefined" error. The version of react is 16.3.2, and react-dom version is 16.3.2. The following is my code:
Provider.jsx:
import React from 'react';
export const PathContext = React.createContext({
rootPath: "http://localhost/example"
});
App.jsx:
import React from 'react';
import {PathContext} from './Provider.jsx';
class App extends React.Component {
constructor(props) {
super(props);
}
render() {
return(
<div>
<PathContext.Provider>
<AppRootPath />
</PathContext.Provider>
</div>
)
}
}
class AppRootPath extends React.Component {
render() {
return(
<div>
<span>App Root Path</span><br />
<PathContext.Consumer>
{
({rootPath}) => <span>{rootPath}</span>
}
</PathContext.Consumer>
</div>
)
}
}
export default App;
I can't find any problems in here, but the console reports this error: TypeError: Cannot read property 'rootPath' of undefined, and the error happens in here: ({rootPath}) => <span>{rootPath}</span>
A:
About using a default value:
If there is no Provider for this context above, the value argument
will be equal to the defaultValue that was passed to createContext().
But you are wrapping it with Provider. Try removing Provider:
class App extends React.Component {
constructor(props) {
super(props);
}
render() {
return(
<div>
<AppRootPath />
</div>
)
}
}
class AppRootPath extends React.Component {
render() {
return(
<div>
<span>App Root Path</span><br />
<PathContext.Consumer>
{
({rootPath}) => <span>{rootPath}</span>
}
</PathContext.Consumer>
</div>
)
}
}
| {
"pile_set_name": "StackExchange"
} |
using System;
using System.Collections.Generic;
using System.Linq;
using System.Net;
using System.Windows;
using System.Windows.Controls;
using System.Windows.Navigation;
using Microsoft.Phone.Controls;
using Microsoft.Phone.Shell;
namespace HslSliders.WinPhone
{
public partial class MainPage : global::Xamarin.Forms.Platform.WinPhone.FormsApplicationPage
{
public MainPage()
{
InitializeComponent();
SupportedOrientations = SupportedPageOrientation.PortraitOrLandscape;
global::Xamarin.Forms.Forms.Init();
LoadApplication(new HslSliders.App());
}
}
}
| {
"pile_set_name": "Github"
} |
Background {#Sec1}
==========
Models of infectious disease epidemiology are becoming ever more complex in their construction, in recognition of the importance of heterogeneity of individuals and their social interactions to transmission of infection \[[@CR1]\]. Such models have been informed by the increasing acquisition of data in a range of studies, describing patterns of human interaction at the level of age group \[[@CR2]\], within social networks \[[@CR3]\], or related to movements in geographical space and time \[[@CR4]\].
In earlier work, we piloted methods to acquire data on social encounters of individuals within the locations visited over the course of several days, comparing anticipated contacts with prospective records entered either in a paper diary (modified from European study instruments) or portable electronic device \[[@CR5], [@CR6]\]. While that study provided rich and detailed information, the scope of data collection was necessarily limited by budgetary and logistic constraints associated with the requirement for face-to-face recruitment and training, making detailed characterization of large population samples challenging.
In this project, we are seeking to document the influence of individual and area-level factors on social encounter profiles, which have been qualitatively observed to influence perceived social network characteristics \[[@CR7]\]. In particular, individuals from less advantaged neighbourhoods have been described as likely to have close local networks, and fewer 'bridging' ties beyond their immediate area in comparison with counterparts in socio-economically advantaged areas who are more likely to have broadly distributed connections \[[@CR7]\]. This project seeks to define in more detail the attributes of social encounters, beyond degree distribution, that might quantifiably capture such differences.
We recruited residents of two local government areas of metropolitan Melbourne (the state capital of Victoria, Australia) that differ markedly in terms of demographics and socio-economic status as 'proof of concept' of such influence. In order to reach as large and broadly representative a sample as possible, we employed telephone-based survey methods for recruitment and collection of encounter data. This paper reports on our experience of this survey approach, and initial findings summarising encounters in the two regions of interest.
Methods {#Sec2}
=======
Study population {#Sec3}
----------------
The study recruited participants from two local government areas (LGAs) in greater Melbourne between January and April 2013 (Fig. [1](#Fig1){ref-type="fig"}). Each area had a similar population size but markedly different population characteristics, as outlined below.Fig. 1Map showing geographical extent of Hume and Boroondara Local Government Areas, within the context of Greater Melbourne. The map was generated with QGIS software using data from the Australian Bureau of Statistics \[[@CR36], [@CR37]\]. *Red lines* depict the road network \[[@CR12]\], and *shading* denotes built-up areas \[[@CR38]\]
*Hume* is a growing fringe municipality 20 kms from Melbourne's central business district (CBD), retaining a rural character in its North. 43 % of its population was born overseas with the most frequent countries of origin being Turkey (5 %) and Iraq (5 %), and 31 % of residents were less than 18 years of age according to the 2011 census \[[@CR8]\]. Median household income for families with children was around AUD\$1,300 per week \[[@CR8]\]. In contrast, *Boroondara* incorporates a number of established inner-eastern suburbs, 5 kms east of the CBD, bounded by rivers and parkland. While 34 % of its residents were born overseas, the most common countries of origin were China (5 %) and the United Kingdom (3 %), and only 21 % were less than 18 years old in 2011 \[[@CR9]\]. Median household income for families with dependent children at that time exceeded AUD\$2,500 per week \[[@CR9]\]. Further details of the demographic and socioeconomic characteristics of each LGA can be found in the Additional file [1](#MOESM1){ref-type="media"}: Cleaning, Geocoding and Weighting.
Survey methods {#Sec4}
--------------
A market research company was contracted to conduct computer assisted telephone interviews (CATI) of 1000 respondents in each LGA to characterize social encounter profiles in locations visited over the course of a single day. Random digit dialling within local telephone exchanges was used to identify the sample, in order to avoid selection bias for longer-term resident individuals associated with the use of listed numbers (as short term tenants may change land lines frequently), as well as residents choosing to withhold their details from public listing. Unfortunately, individuals with only mobile phone or voice over internet protocol telephone access could not be included in the frame as it was not possible to assign such numbers to a residential location within the LGA boundaries*.* Respondents in Hume were given the option of completing the survey in either English or Turkish, given the high proportion (5 %) of Turkish born residents in that LGA, but resources were not available to offer interviews in other languages.
During a telephone interview (approximately 20--30 min in length), participants were asked to describe the basic demographic characteristics of their household including the number, age and occupational status of family members and key indicators of household economic status, including housing tenure. They were then asked to sequentially list all locations visited and movements between those locations on the previous day, including the type of location (e.g., home, work, retail, private transport) and when they left the location. They were also asked to list all social encounters with an individual or defined group (e.g., school class, workplace contacts, church congregation) for ease of reporting in each location. Encounters were defined as a two-way face-to-face conversation of more than three words or any physical contact. All interviews with participants were conducted by telephone and entered into an electronic form by employees of the market research company. Survey instruments are provided in Additional file [2](#MOESM2){ref-type="media"}: Questionnaire and Additional file [3](#MOESM3){ref-type="media"}: Contact diary.
Data preparation {#Sec5}
----------------
Addresses of visited locations were checked for accuracy and completeness, and corrected to a standard format. Where necessary, place name descriptions were assigned street addresses with reference to corporate websites (retail locations) and/or publicly available searchable mapping tools. Time data were similarly checked for logical order and consistency, and calculated in relation to expected travel time between locations as necessary for confirmation. Further details of standard procedures followed for data cleaning are provided in Additional file [1](#MOESM1){ref-type="media"} (Section 2 -- Address Accuracy and Cleaning and Section 3 -- Time Consistency and Cleaning).
Geocoding {#Sec6}
---------
Addresses were geocoded using a mix of API queries including Bing Maps \[[@CR10]\], Mapquest \[[@CR11]\] and OpenStreetMaps \[[@CR12]\], and manually via the Google Maps website \[[@CR13]\]. MATLAB 7.14 was used to script all work. Rules for geocoding, location matching and confirmation of accuracy are described in more detail in Additional file [1](#MOESM1){ref-type="media"} (Section 4 - Geocoding).
Weighting {#Sec7}
---------
Demographic and socio-economic characteristics of the LGAs under study were obtained from the Australian Bureau of Statistics 2011 census using publicly available methods \[[@CR14]\]. Iterative proportional fitting (i.e., raking) was used to determine sampling weights to reduce the effects of sample bias. Raking weights were computed and applied to the survey data using STATA 10 with reference to the following population descriptors.Joint distribution of five age categories and gender (10 categories);Marital status (coupled, never married, other);Australian born (yes/no);Household type (couple with children, couple without children, one parent family, other family, lone person household, other household);Household size (1, 2, 3, 4, 5, 6+);Home ownership (owned outright, owned with a mortgage, renting, other, missing).
Large weights were truncated at 7 (Boroondara) and 6 (Hume) to remove extreme weights. These cutoffs were the smallest values for which goodness-of-fit tests comparing raked variables with census totals did not reject at the 5 % level. Additional details and justification of the weighting procedure are available in Additional file [1](#MOESM1){ref-type="media"} (Section 5 -- Biased Sampling, Raking and Sampling Weights). In particular, goodness-of-fit results comparing the sample with the 2011 census both before and after raking are shown in Table S7 of Additional file [1](#MOESM1){ref-type="media"}.
Analysis of social encounters {#Sec8}
-----------------------------
Summary measures of recorded encounters with individuals and groups were characterised for comparison with our own and other previous studies, including separate description of the subset involving any physical contact as a proxy measure of intensity. The number and duration of contacts was reported by location type. Interactions within and between age groups were considered separately for men and women. Social heterogeneity was further assessed, by differentiating between contacts with household members, known individuals and strangers. The influence of household size on the number of encounters within and beyond the household unit was considered. These various measures were tabulated by LGA of residence, and differences between regions assessed using weight-adjusted Wald tests of the difference between group means.
Ethical approvals {#Sec9}
-----------------
The study protocol was approved by the University of Melbourne Human Research Ethics Committee (Ethics ID 1238477). Participants gave verbal informed consent to study participation prior to administration of the telephone questionnaire.
Results {#Sec10}
=======
Study population {#Sec11}
----------------
A total of 25,406 calls were made to 8567 numbers, of which 7129 were currently connected telephones in residential households (2755 of 3398 in Boroondara, 4374 of 5169 in Hume). Contact was made with an individual in 4580 of these households (1827 in Boroondara and 2753 in Hume), with a further 683 proving ineligible due to geographical location (out of area), communication difficulties or absence of an adult present at the time of call. Communication difficulties reported included language difficulty (*n* = 28) or other physical limitation such as hearing impairment or age (*n* = 131). Of the remaining 3897 eligible contacts, 1307 (650 in Boroondara, 657 in Hume) completed the survey, with 12 interviews conducted in Turkish. Responses were spread across days of the week such that the numbers are fairly even across weekdays (range: 191---211) and separately across weekends (range: 156---157). Response rates according to the 'all contacts' denominator were 36 % (650/1827) in Boroondara and 24 % (657/2753) in Hume. When calculated as all completed interviews over a denominator comprising completions, refusals and break-offs, the response rate overall was 37.6 %, remaining higher in Boroondara (46 %) than Hume (32 %).
While the final number in the sample was less than our initial target of 2000, a pragmatic decision was made to cease recruitment at 1307, given greater than anticipated time requirements per participant and finite budgetary constraints. Implications of study complexity related to the telephone interview format for missing and incomplete data are described in more detail below.
Weighting {#Sec12}
---------
Compared with 2011 Australian census data, characteristics of the sample differed significantly from those of the areas surveyed across a range of demographic and socio-economic factors in both Hume and Boroondara. Important differences included an over-representation of individuals who were aged over 50 years, female, Australian born, English speaking, educated to completion of secondary school, and married. In keeping with these characteristics, smaller households were over-represented. The anticipated bias towards longer resident individuals was also observed. Given this disparity, weighted results are presented for all aggregated data, in order to present results more likely to be representative of the populations under study. For more details, see Sections 5 *Biased sampling, raking and sampling weights* and 6 *Tables demonstrating bias in CATI data* of Additional file [1](#MOESM1){ref-type="media"}.
Characteristics of encounters, by location {#Sec13}
------------------------------------------
Unique addresses visited by participants over the course of the survey day were categorised and distributed as shown in Fig. [2](#Fig2){ref-type="fig"} (top left panel). All but six participants spent some time at their usual home, with retail/hospitality, and private transport being the next most common types of designated settings. Approximately one tenth of locations were assigned as 'other', of which about half were non-participant private homes, with the remainder comprising places such as medical centres and facilities, and places of worship. The weighted number of total listed encounters by location is reported in Fig. [2](#Fig2){ref-type="fig"} (top right panel) (and Additional file [4](#MOESM4){ref-type="media"}: Figure S1 for physical contact). These data demonstrate the high median number of contacts made in school and daycare settings, but also the marked heterogeneity in encounter profiles within several location types including home, private transport, retail/hospitality and 'other'. Figure [2](#Fig2){ref-type="fig"} (bottom left panel) highlights the greater length of interactions with workplace colleagues over the course of a working day, relative to those in most other domains. Figure [2](#Fig2){ref-type="fig"} (bottom right panel) similarly reports duration of encounters, but restricted to those involving any physical contact. This last figure strongly reasserts the importance of household settings in providing opportunities for close-contact transmission of infection.Fig. 2Characteristics of locations and encounters by location type. Summaries of locations and encounters from one study day for each participant, reported separately for each location type. The number of unique addresses visited by participants (*top left panel*). Boxplot for participants\' total (weighted) number of encounters with listed individuals, by location (*top right panel*). Boxplot for participants\' total (weighted) duration of encounters with listed individuals, by location (*bottom left panel*). Boxplot for participants\' total duration of encounters involving physical contact with listed individuals, by location (*bottom right panel*). For all boxplots, boxes denote the interquartile range, interior lines shown the median and the whiskers show adjacent values. Across the boxplots, marked heterogeneity is apparent in several location types. For total duration of contact, Work (and Home to a lesser degree) is the dominant location type. For total duration of physical contact, home is the dominant location type. Boxplots use raking weights to reduce the effects of sample bias. For each location type, participants with no time spent at that location type do not contribute to those results
Number and duration of social encounters, by age and gender {#Sec14}
-----------------------------------------------------------
Figure [3](#Fig3){ref-type="fig"} (left panel) reports the unweighted total number of listed encounters for each participant in the survey, with a mean of 8.4 (95 % CI: 7.9--8.8) and median of 7. The weighted total number of listed encounters for each participant across all participants (mean 8.5, 95 % CI: 7.9--9.1) and across days of the week (mean range 8.0--9.3, median range 6--8) was similar. In addition, the distinction between weekend and weekday is not a significant predictor for the number of listed encounters (*p* = 0.9). Figure [3](#Fig3){ref-type="fig"} (right panel) shows a boxplot of the weighted number of all encounters by age group. The highest reported number of median contacts was among individuals aged between 30 and 49 years. This trend was more evident for episodes involving physical contact (Additional file [4](#MOESM4){ref-type="media"}: Figures S2 and S3).Fig. 3Participants' total number of encounters with listed individuals. Histogram for participants' total (unweighted) number of encounters with listed individuals (*left panel*). Boxplot for participants' total (weighted) number of encounters with listed individuals by participant age (*right panel*). Heterogeneity is apparent across participants and across age groups. In general, participants\' number of encounters declines with age. The boxplot uses raking weights to reduce the effects of sample bias
Respondents frequently reported more than one encounter with the same individual over a 24 h period (Additional file [4](#MOESM4){ref-type="media"}: Figure S4). The weighted mean number of contacts (with 95 % confidence intervals) between participants and uniquely nominated individuals is shown in Fig. [4](#Fig4){ref-type="fig"}. Results are reported across six participant age categories and ten contact age categories, for male (left panel) and female (right panel) respondents. The number of participants contributing to each cell varies, and both weighted and unweighted counts for each gender can be found in the supporting information (Additional file [4](#MOESM4){ref-type="media"}: Tables S1--S4 for all encounters and Tables S5--S8 for physical encounters). While a generally assortative pattern of mixing is observed, we also note that females record many more encounters with children less than 15 years of age than males. Males aged 18--29, on the other hand, have the highest recorded within-age group interactions. Similar trends are observed for episodes involving any physical contact (Additional file [4](#MOESM4){ref-type="media"}: Figures S7 and S8).Fig. 4Age-based mixing matrices for participants' total number of encounters with listed individuals. Values are the mean of participants' total (weighted) number of encounters with listed individuals by age of participant and contact for male participants (*left panel*), and female participants (*right panel*). 95 % confidence intervals are shown in parentheses. Darker shading indicates larger values. Age-based assortative mixing is evident for both genders. Women notably have more numerous contacts with children less than 15 years old. Males 18--29 have the most numerous contacts within age groups. Raking weights are used to reduce the effects of sample bias
The duration of encounters, by age, is a further measure of mixing intensity, reported as mean hours (with 95 % confidence intervals) in Fig. [5](#Fig5){ref-type="fig"}. Again, values for men and women are reported separately. The striking difference between this figure and Fig. [4](#Fig4){ref-type="fig"} is the dominance of interactions between women in the 18--29 years group and children of pre-school age, most likely in household settings (Fig. [5](#Fig5){ref-type="fig"}- right panel). These prolonged mixing episodes are also associated with physical contact (Additional file [4](#MOESM4){ref-type="media"}: Figure S10 (right panel)). Encounters between males aged 18--29 years, previously noted to be both frequent and close, are also prolonged (Fig. [5](#Fig5){ref-type="fig"} (left panel), and Additional file [4](#MOESM4){ref-type="media"}: Figure S10 (left panel) for physical contact).Fig. 5Age-based mixing matrices for participants' total duration of encounters with listed individuals. Values are the mean of participants' total (weighted) duration of encounters with listed individuals by age of participant and contact for male participants (*left panel*) and female participants (*right panel*). 95 % confidence intervals are shown in parentheses. Darker shading indicates larger values. While age-based assortative mixing is evident, the large duration of contact between women and pre-school age children is most notable. Raking weights are used to reduce the effects of sample bias
Heterogeneity of encounters was further assessed by 692 reports of mixing with social groups of six people or more. The median age of participants reporting group contacts was 52 years (IQR 40, 62). Median reported group size was 12 (interquartile range 9, 20), with 40 % of such contacts occurring in the workplace. Retail and hospitality, sport and recreational settings, and educational environments each accounted for approximately 10 % of listed group encounters. A large 'other' category included places of worship, clubs and private social gatherings. Mixing matrices for unweighted numbers of encounters and duration of encounters (in person-contact-hours) for participant contact made in a group setting are available in Additional file [4](#MOESM4){ref-type="media"}: Sections 1.10 and 1.11, where each group was categorised with one typical age (0--19 years, 20--69, 70 or more) by the participant. Given uncertain overlap between mixing groups and individually reported contacts, subsequent analyses report only on uniquely identified individuals.
Encounters with known and unknown individuals {#Sec15}
---------------------------------------------
Participants were asked to differentiate between encounters with individuals known to them and strangers. Young men, and women aged 30--49 years, reported many more known contacts than other respondents (Fig. [6](#Fig6){ref-type="fig"} -left panel). In the former case, the majority of these contacts were non-household members, while among the women about half of the contacts involved family (Fig. [6](#Fig6){ref-type="fig"} - middle). For both sexes, the total number of known contacts both inside and outside the home tended to increase with household size (Fig. [6](#Fig6){ref-type="fig"} -bottom panel). (See Additional file [4](#MOESM4){ref-type="media"}: Figure S11 for participants' total duration of contacts by contact type and household size.) The vast majority (75 %) of group contacts (see above) involved individuals known to participants.Fig. 6Participants' total (weighted) number of listed encounters by type of contact individual. Boxplots for participants\' total number of listed encounters by known/unknown contacts for male (*left*) and female (*right*) participants (*top panel*), household/non-household contacts for male (*left*) and female (*right*) participants (*middle panel*), and by household size, known/unknown contacts, and location of contact (Home/Outside) for male (*left*) and female (*right*) participants (*bottom panel*). Young men and women aged 30--49 years reported many more encounters with listed people than other participants. For young men, the majority are non-household members. For women, about half involved household members. In general, the number of encounters with known individuals increases with household size. Raking weights are used to reduce the effects of sample bias
Influence of local government area of residence on encounter profiles {#Sec16}
---------------------------------------------------------------------
Summary measures of encounters, as presented in the Figures above, were compared between the LGAs surveyed in an initial exploratory analysis. While social characteristics of participants in both regions were broadly similar, some suggestions of difference emerged, warranting further evaluation. Key findings are reported in Table [1](#Tab1){ref-type="table"}, with caution recommended in the interpretation of estimates where sample sizes were \<60. Boroondara (B) residents reported mixing with more people on average in public spaces than Hume (H) residents, and similarly in retail and hospitality environments, of which more were visited \[B: 1.8 (1.6, 2.0) cf H: 1.4 (1.3, 1.6), *p = 0.007*\]. Hume residents tended to spend longer periods of time (hours) with others, particularly in arts and culture settings, although this latter estimate was based on a small sample size \[B: 15 cf H: 9\].Table 1Influence of local government area of residence on encounter profilesBoroondara meanHume mean*P*-value(95 % CI)(95 % CI)Number of listed encounters Public spaces2.2 (1.6--2.8)1.4 (0.9--1.8)0.029 Retail & hospitality3.3 (2.9--3.7)2.7 (2.3--3.0)0.013Number of unique addresses Retail & hospitality1.8 (1.6--2.0)1.4 (1.3--1.6)0.007Participants' total encounter duration (Hours) Participant total6.2 (5.5--6.9)7.5 (6.6--8.4)0.028Participants\' total physical encounter duration (Hours) Arts & culture0.5 (0.4--0.7)1.1 (0.8--1.5)0.004\*Participants\' total number of known contacts Female 18--196.5 (4.6--8.4)12.7 (6.9--18.5)0.048\*Participants\' total number of household contacts Female 18--192.4 (1.5--3.2)5.0 (2.5--7.6)0.05\*Participants\' total number of non-household contacts Male, age 20--292.9 (1.7--4.2)5.2 (3.7--6.8)0.025\*Participants\' total number of unknown contacts Female, age 50--592.8 (2.1--3.4)1.5 (1.0--1.9)0.002 Female, age 60--692.1 (1.5--2.7)1.2 (0.6--1.8)0.027 Female, age 70 or more1.7 (1.2--2.1)0.7 (0.3--1.0)\<0.001 Male, age 60--691.9 (1.2--2.6)0.9 (0.5--1.4)0.022\*Indicates both sample sizes are smaller than 60, which may affect validity of the *p* value
Women less than 20 years of age in Hume had contact with twice as many known individuals than in Boroondara, based on a limited number of participant reports \[B: 10 cf H: 9\]. Young men (20--29 years) in Hume socialised more with non-household members than those in Boroondara, although again, few participated in the study \[B: 18 cf H: 19\]. At the other end of the age spectrum, contact with unknown individuals was more frequent in Boroondara than Hume among females aged 50--59 and older, and males from 60 years of age.
Discussion {#Sec17}
==========
Better data about patterns of social contact is needed to enable more accurate parameterisation of disease transmission models \[[@CR15]\]. Ascertainment of conversational and physical encounters using a CATI format, while challenging to implement, yielded rich information across a large population sample. External factors known to influence mixing rates, including marked climatic variation \[[@CR16]\], peak periods of respiratory illness \[[@CR17]\] and school breaks \[[@CR18], [@CR19]\] were avoided by conducting the study over just a few months in summer and early autumn, and all in school term time. Within this context, marked heterogeneity of social behaviour was observed by location, age, gender and area of residence by attending to more detailed attributes of encounters including location, household membership and 'strangeness' than merely the number of contacts recorded.
Cost-efficiency was our primary motivation for trialling a CATI survey, allowing recruitment of a large and geographically well-defined population sample across two sites for this 'proof of concept' study. Limitations of the CATI approach included predictable biases in ascertainment \[[@CR20]\], leading to an unrepresentative sample from each of the study areas (Additional file [1](#MOESM1){ref-type="media"}). Complexity associated with verbal recall made the interviews longer than anticipated. Participants also expressed more privacy concerns than in face-to-face interviews, resulting in incomplete or missing information in many records. In consequence, substantial time was committed to weighting, cleaning and augmenting data.
Despite these challenges, we obtained extremely detailed information on the interactions of individuals and the types of settings in which these occur. The distribution of all encounters across types of locations is similar to that reported in a variety of European countries in the POLYMOD study \[[@CR2]\]. We did, however, note a much greater weighting of physical encounters towards the home environment than seen in that survey \[[@CR2]\], predominantly influenced by reports of female participants. This finding should be considered in the context of related work comparing sensor and diary recordings, showing that contacts of longer duration are more likely to be recalled, and that females as a group are more accurate reporters of social encounter information \[[@CR21]\]. It is unlikely that this difference reflects disparity in parenting behaviour between Europe and Australia, but may further relate to the nature of our diary instrument. While POLYMOD asked participants to estimate a single block of total time spent with a given individual, our respondents sequentially listed all locations and environments over the course of the day. It seems likely that this latter means of recall would allow for more accurate summation of repeat encounters, highly likely to occur in the household setting, and perhaps explaining the higher estimated proportion of household contacts.
While the overall mean number of contacts per individual was relatively low compared with a US telephone survey \[[@CR20]\] and our own earlier work \[[@CR5]\], this finding likely reflected the age distribution of the respondent population (Fig. [3](#Fig3){ref-type="fig"} -- right panel). When considered by age group, our observations accorded more closely with recent data from a postal and internet survey in the UK, and showed a steady decline with age \[[@CR22]\]. While a similar decrease in sociability with age was observed in both urban and rural settings in China \[[@CR23]\], this phenomenon is not universal. A study in rural Vietnam noted an increase in mixing rates among individuals over 40 years, persisting into older age \[[@CR24]\]. It is not known whether such cultural differences persist after migration.
We observed far closer mixing of women with household members than men, perhaps contributing to reported differences in patterns of infection transmission. In a classic study of *Haemophilus influenzae* from the 1940s, eight times higher concordance of bacterial carriage was noted between mothers and their children than between fathers and children \[[@CR25]\]. While times and social norms have changed substantially over the period, we recently found women to be more effective transmitters of infection than men \[[@CR26]\], even in households where children were not present. While few studies report encounters by gender, women in a 2009 US survey reported more conversational interactions than men, although the setting in which these occurred was not stated \[[@CR20]\]. Such disparity was not, however, observed in Vietnam suggesting that these differences cannot be universally assumed \[[@CR24]\].
Encounter studies involving large numbers of participants have generally been targeted at whole-country level, including POLYMOD (*n* = 7290) which recruited across 8 EU countries \[[@CR2]\], a 2010 study of almost 2000 Taiwanese residents \[[@CR27]\] and a recently published UK-wide survey of more than 5000 respondents \[[@CR22]\]. In contrast, a North Carolina telephone survey of social encounters recruited almost 4000 participants from four pre-specified counties, but no specific rationale was given for their selection \[[@CR20]\]. A large Chinese study recruited 1821 individuals across a geographical zone spanning urban and rural environments, to consider the influences of distance and population density on social interactions \[[@CR23]\]. Our explicit strategy was to densely sample two diverse areas of one major city in Australia, to understand qualitatively reported small area socio-demographic and environmental influences on social network heterogeneity \[[@CR7]\]. The preliminary analyses presented here suggest varying location preferences, and gendered differences in mixing beyond the household unit, by area of residence, that will be explored in more detail in subsequent work. In particular, the geographical extent of social networks, and the overarching influences of both household and area level advantage, are of interest.
Conclusions {#Sec18}
===========
Mixing matrices based on physical encounter data such as these have been incorporated in age-structured transmission models, and validated through their ability to reproduce age-dependent infection profiles in cross-sectional population serosurveys \[[@CR28]\]. More recently, encounter measures have also been correlated with laboratory confirmed evidence of respiratory infection at the individual level \[[@CR29], [@CR30]\]. Assumptions regarding the number, duration and clustering of contacts in model frameworks all have significant implications for the simulated spread of infection \[[@CR31]\], and optimal strategies for its control \[[@CR3]\]. Our hypothesis is that differences in social behaviour may contribute, at least in part, to the increasing infection risk observed with disadvantage \[[@CR32]\], mediated at the level of the household, neighbourhood or workplace \[[@CR33]\].
The incorporation of geographical space into representations of social networks is a recognised challenge in the field of infectious disease modelling \[[@CR34]\]. As diversity increases in modern cities \[[@CR35]\], location of residence encodes a far greater variety of attributes that may influence social behaviour than merely distance between individuals, or proximity to mixing locations. Spatial differences in culture, advantage and environment will likely exert pronounced effects on network characteristics, with local implications for infectious disease transmission and risk. Further evaluation of this dataset will involve detailed profiling of small areas, to seek additional evidence of both household and neighbourhood level influences on social behaviour and development of network models of infection spread, to investigate the likely implications of difference for disease.
Additional files {#Sec19}
================
Additional file 1:**Cleaning, Geocoding and Weighting.** Additional details on data cleaning, geocoding of addresses, sample bias and sample weighting using raking. (PDF 900 kb)Additional file 2:**Questionnaire.** Additional file descriptions text (including details of how to view the file, if it is in a non-standard format). (PDF 130 kb)Additional file 3:**Contact Diary.** Additional file descriptions text (including details of how to view the file, if it is in a non-standard format). (PDF 61 kb)Additional file 4:**Additional Results.** Additional results including details on number and duration of physical contact encounters, and duration of encounters for each household size by contact type (known/unknown) and location type (home/outside). (PDF 1275 kb)
David A. Rolls and Nicholas L. Geard contributed equally to this work.
**Competing interests**
The authors have no competing interests to declare.
**Authors' contributions**
NG, DW, GR, PP, JMcM and JMcV contributed to the design of the study. DW, PN, GR, JMcM and JMcV were involved in developing survey materials. DR cleaned the data and undertook all analyses, in consultation with NG, JMcM and JMcV. All authors were engaged in drafting the manuscript and have seen and approved the final version.
This project was supported by an ARC Linkage Project grant, with contributing partners VicHealth, the Victorian Government Department of Health, the City of Boroondara, and Lentara Uniting Care. We further acknowledge fellowship funding for NG (ARC Discovery Early Career Researcher Fellowship), DW and JMM (ARC Future Fellowships) and JMV (NHMRC Career Development Fellowship).
We are grateful to our participants, for sharing their information through the telephone survey, and to the Social Research Centre for their skill and diligence in assisting us with a challenging protocol. We thank Rebecca Bentley for helpful comments on the manuscript.
| {
"pile_set_name": "PubMed Central"
} |
Motherboard cmos died/Need to recover harddrive on new motherboard,HOW
My motherboard cmos-battery died and I was unable to transfer applications and data/text/doc files. The keyboard became usless. The drive is western digital 4gig. Operating sys-win95.
I installed a new motherboard and win98 operating system. Added a new 20 gig hard drive as master and the other drive as slave. Cmos setup sees the two drives, c & d. Windows 98 also sees the second drive but says it is not accessible, a device attached to the system is not functioning. What do I do now? The information on the 4gig hard drive is priceless. Need any and all suggestions to get up and going. reach me at : mailto:talkphil@mailcity.com | {
"pile_set_name": "Pile-CC"
} |
// Protocol Buffers for Go with Gadgets
//
// Copyright (c) 2013, The GoGo Authors. All rights reserved.
// http://github.com/gogo/protobuf
//
// Go support for Protocol Buffers - Google's data interchange format
//
// Copyright 2010 The Go Authors. All rights reserved.
// https://github.com/golang/protobuf
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
// * Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
// * Redistributions in binary form must reproduce the above
// copyright notice, this list of conditions and the following disclaimer
// in the documentation and/or other materials provided with the
// distribution.
// * Neither the name of Google Inc. nor the names of its
// contributors may be used to endorse or promote products derived from
// this software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
package proto
// Functions for parsing the Text protocol buffer format.
// TODO: message sets.
import (
"encoding"
"errors"
"fmt"
"reflect"
"strconv"
"strings"
"time"
"unicode/utf8"
)
// Error string emitted when deserializing Any and fields are already set
const anyRepeatedlyUnpacked = "Any message unpacked multiple times, or %q already set"
type ParseError struct {
Message string
Line int // 1-based line number
Offset int // 0-based byte offset from start of input
}
func (p *ParseError) Error() string {
if p.Line == 1 {
// show offset only for first line
return fmt.Sprintf("line 1.%d: %v", p.Offset, p.Message)
}
return fmt.Sprintf("line %d: %v", p.Line, p.Message)
}
type token struct {
value string
err *ParseError
line int // line number
offset int // byte number from start of input, not start of line
unquoted string // the unquoted version of value, if it was a quoted string
}
func (t *token) String() string {
if t.err == nil {
return fmt.Sprintf("%q (line=%d, offset=%d)", t.value, t.line, t.offset)
}
return fmt.Sprintf("parse error: %v", t.err)
}
type textParser struct {
s string // remaining input
done bool // whether the parsing is finished (success or error)
backed bool // whether back() was called
offset, line int
cur token
}
func newTextParser(s string) *textParser {
p := new(textParser)
p.s = s
p.line = 1
p.cur.line = 1
return p
}
func (p *textParser) errorf(format string, a ...interface{}) *ParseError {
pe := &ParseError{fmt.Sprintf(format, a...), p.cur.line, p.cur.offset}
p.cur.err = pe
p.done = true
return pe
}
// Numbers and identifiers are matched by [-+._A-Za-z0-9]
func isIdentOrNumberChar(c byte) bool {
switch {
case 'A' <= c && c <= 'Z', 'a' <= c && c <= 'z':
return true
case '0' <= c && c <= '9':
return true
}
switch c {
case '-', '+', '.', '_':
return true
}
return false
}
func isWhitespace(c byte) bool {
switch c {
case ' ', '\t', '\n', '\r':
return true
}
return false
}
func isQuote(c byte) bool {
switch c {
case '"', '\'':
return true
}
return false
}
func (p *textParser) skipWhitespace() {
i := 0
for i < len(p.s) && (isWhitespace(p.s[i]) || p.s[i] == '#') {
if p.s[i] == '#' {
// comment; skip to end of line or input
for i < len(p.s) && p.s[i] != '\n' {
i++
}
if i == len(p.s) {
break
}
}
if p.s[i] == '\n' {
p.line++
}
i++
}
p.offset += i
p.s = p.s[i:len(p.s)]
if len(p.s) == 0 {
p.done = true
}
}
func (p *textParser) advance() {
// Skip whitespace
p.skipWhitespace()
if p.done {
return
}
// Start of non-whitespace
p.cur.err = nil
p.cur.offset, p.cur.line = p.offset, p.line
p.cur.unquoted = ""
switch p.s[0] {
case '<', '>', '{', '}', ':', '[', ']', ';', ',', '/':
// Single symbol
p.cur.value, p.s = p.s[0:1], p.s[1:len(p.s)]
case '"', '\'':
// Quoted string
i := 1
for i < len(p.s) && p.s[i] != p.s[0] && p.s[i] != '\n' {
if p.s[i] == '\\' && i+1 < len(p.s) {
// skip escaped char
i++
}
i++
}
if i >= len(p.s) || p.s[i] != p.s[0] {
p.errorf("unmatched quote")
return
}
unq, err := unquoteC(p.s[1:i], rune(p.s[0]))
if err != nil {
p.errorf("invalid quoted string %s: %v", p.s[0:i+1], err)
return
}
p.cur.value, p.s = p.s[0:i+1], p.s[i+1:len(p.s)]
p.cur.unquoted = unq
default:
i := 0
for i < len(p.s) && isIdentOrNumberChar(p.s[i]) {
i++
}
if i == 0 {
p.errorf("unexpected byte %#x", p.s[0])
return
}
p.cur.value, p.s = p.s[0:i], p.s[i:len(p.s)]
}
p.offset += len(p.cur.value)
}
var (
errBadUTF8 = errors.New("proto: bad UTF-8")
)
func unquoteC(s string, quote rune) (string, error) {
// This is based on C++'s tokenizer.cc.
// Despite its name, this is *not* parsing C syntax.
// For instance, "\0" is an invalid quoted string.
// Avoid allocation in trivial cases.
simple := true
for _, r := range s {
if r == '\\' || r == quote {
simple = false
break
}
}
if simple {
return s, nil
}
buf := make([]byte, 0, 3*len(s)/2)
for len(s) > 0 {
r, n := utf8.DecodeRuneInString(s)
if r == utf8.RuneError && n == 1 {
return "", errBadUTF8
}
s = s[n:]
if r != '\\' {
if r < utf8.RuneSelf {
buf = append(buf, byte(r))
} else {
buf = append(buf, string(r)...)
}
continue
}
ch, tail, err := unescape(s)
if err != nil {
return "", err
}
buf = append(buf, ch...)
s = tail
}
return string(buf), nil
}
func unescape(s string) (ch string, tail string, err error) {
r, n := utf8.DecodeRuneInString(s)
if r == utf8.RuneError && n == 1 {
return "", "", errBadUTF8
}
s = s[n:]
switch r {
case 'a':
return "\a", s, nil
case 'b':
return "\b", s, nil
case 'f':
return "\f", s, nil
case 'n':
return "\n", s, nil
case 'r':
return "\r", s, nil
case 't':
return "\t", s, nil
case 'v':
return "\v", s, nil
case '?':
return "?", s, nil // trigraph workaround
case '\'', '"', '\\':
return string(r), s, nil
case '0', '1', '2', '3', '4', '5', '6', '7':
if len(s) < 2 {
return "", "", fmt.Errorf(`\%c requires 2 following digits`, r)
}
ss := string(r) + s[:2]
s = s[2:]
i, err := strconv.ParseUint(ss, 8, 8)
if err != nil {
return "", "", fmt.Errorf(`\%s contains non-octal digits`, ss)
}
return string([]byte{byte(i)}), s, nil
case 'x', 'X', 'u', 'U':
var n int
switch r {
case 'x', 'X':
n = 2
case 'u':
n = 4
case 'U':
n = 8
}
if len(s) < n {
return "", "", fmt.Errorf(`\%c requires %d following digits`, r, n)
}
ss := s[:n]
s = s[n:]
i, err := strconv.ParseUint(ss, 16, 64)
if err != nil {
return "", "", fmt.Errorf(`\%c%s contains non-hexadecimal digits`, r, ss)
}
if r == 'x' || r == 'X' {
return string([]byte{byte(i)}), s, nil
}
if i > utf8.MaxRune {
return "", "", fmt.Errorf(`\%c%s is not a valid Unicode code point`, r, ss)
}
return string(i), s, nil
}
return "", "", fmt.Errorf(`unknown escape \%c`, r)
}
// Back off the parser by one token. Can only be done between calls to next().
// It makes the next advance() a no-op.
func (p *textParser) back() { p.backed = true }
// Advances the parser and returns the new current token.
func (p *textParser) next() *token {
if p.backed || p.done {
p.backed = false
return &p.cur
}
p.advance()
if p.done {
p.cur.value = ""
} else if len(p.cur.value) > 0 && isQuote(p.cur.value[0]) {
// Look for multiple quoted strings separated by whitespace,
// and concatenate them.
cat := p.cur
for {
p.skipWhitespace()
if p.done || !isQuote(p.s[0]) {
break
}
p.advance()
if p.cur.err != nil {
return &p.cur
}
cat.value += " " + p.cur.value
cat.unquoted += p.cur.unquoted
}
p.done = false // parser may have seen EOF, but we want to return cat
p.cur = cat
}
return &p.cur
}
func (p *textParser) consumeToken(s string) error {
tok := p.next()
if tok.err != nil {
return tok.err
}
if tok.value != s {
p.back()
return p.errorf("expected %q, found %q", s, tok.value)
}
return nil
}
// Return a RequiredNotSetError indicating which required field was not set.
func (p *textParser) missingRequiredFieldError(sv reflect.Value) *RequiredNotSetError {
st := sv.Type()
sprops := GetProperties(st)
for i := 0; i < st.NumField(); i++ {
if !isNil(sv.Field(i)) {
continue
}
props := sprops.Prop[i]
if props.Required {
return &RequiredNotSetError{fmt.Sprintf("%v.%v", st, props.OrigName)}
}
}
return &RequiredNotSetError{fmt.Sprintf("%v.<unknown field name>", st)} // should not happen
}
// Returns the index in the struct for the named field, as well as the parsed tag properties.
func structFieldByName(sprops *StructProperties, name string) (int, *Properties, bool) {
i, ok := sprops.decoderOrigNames[name]
if ok {
return i, sprops.Prop[i], true
}
return -1, nil, false
}
// Consume a ':' from the input stream (if the next token is a colon),
// returning an error if a colon is needed but not present.
func (p *textParser) checkForColon(props *Properties, typ reflect.Type) *ParseError {
tok := p.next()
if tok.err != nil {
return tok.err
}
if tok.value != ":" {
// Colon is optional when the field is a group or message.
needColon := true
switch props.Wire {
case "group":
needColon = false
case "bytes":
// A "bytes" field is either a message, a string, or a repeated field;
// those three become *T, *string and []T respectively, so we can check for
// this field being a pointer to a non-string.
if typ.Kind() == reflect.Ptr {
// *T or *string
if typ.Elem().Kind() == reflect.String {
break
}
} else if typ.Kind() == reflect.Slice {
// []T or []*T
if typ.Elem().Kind() != reflect.Ptr {
break
}
} else if typ.Kind() == reflect.String {
// The proto3 exception is for a string field,
// which requires a colon.
break
}
needColon = false
}
if needColon {
return p.errorf("expected ':', found %q", tok.value)
}
p.back()
}
return nil
}
func (p *textParser) readStruct(sv reflect.Value, terminator string) error {
st := sv.Type()
sprops := GetProperties(st)
reqCount := sprops.reqCount
var reqFieldErr error
fieldSet := make(map[string]bool)
// A struct is a sequence of "name: value", terminated by one of
// '>' or '}', or the end of the input. A name may also be
// "[extension]" or "[type/url]".
//
// The whole struct can also be an expanded Any message, like:
// [type/url] < ... struct contents ... >
for {
tok := p.next()
if tok.err != nil {
return tok.err
}
if tok.value == terminator {
break
}
if tok.value == "[" {
// Looks like an extension or an Any.
//
// TODO: Check whether we need to handle
// namespace rooted names (e.g. ".something.Foo").
extName, err := p.consumeExtName()
if err != nil {
return err
}
if s := strings.LastIndex(extName, "/"); s >= 0 {
// If it contains a slash, it's an Any type URL.
messageName := extName[s+1:]
mt := MessageType(messageName)
if mt == nil {
return p.errorf("unrecognized message %q in google.protobuf.Any", messageName)
}
tok = p.next()
if tok.err != nil {
return tok.err
}
// consume an optional colon
if tok.value == ":" {
tok = p.next()
if tok.err != nil {
return tok.err
}
}
var terminator string
switch tok.value {
case "<":
terminator = ">"
case "{":
terminator = "}"
default:
return p.errorf("expected '{' or '<', found %q", tok.value)
}
v := reflect.New(mt.Elem())
if pe := p.readStruct(v.Elem(), terminator); pe != nil {
return pe
}
b, err := Marshal(v.Interface().(Message))
if err != nil {
return p.errorf("failed to marshal message of type %q: %v", messageName, err)
}
if fieldSet["type_url"] {
return p.errorf(anyRepeatedlyUnpacked, "type_url")
}
if fieldSet["value"] {
return p.errorf(anyRepeatedlyUnpacked, "value")
}
sv.FieldByName("TypeUrl").SetString(extName)
sv.FieldByName("Value").SetBytes(b)
fieldSet["type_url"] = true
fieldSet["value"] = true
continue
}
var desc *ExtensionDesc
// This could be faster, but it's functional.
// TODO: Do something smarter than a linear scan.
for _, d := range RegisteredExtensions(reflect.New(st).Interface().(Message)) {
if d.Name == extName {
desc = d
break
}
}
if desc == nil {
return p.errorf("unrecognized extension %q", extName)
}
props := &Properties{}
props.Parse(desc.Tag)
typ := reflect.TypeOf(desc.ExtensionType)
if err := p.checkForColon(props, typ); err != nil {
return err
}
rep := desc.repeated()
// Read the extension structure, and set it in
// the value we're constructing.
var ext reflect.Value
if !rep {
ext = reflect.New(typ).Elem()
} else {
ext = reflect.New(typ.Elem()).Elem()
}
if err := p.readAny(ext, props); err != nil {
if _, ok := err.(*RequiredNotSetError); !ok {
return err
}
reqFieldErr = err
}
ep := sv.Addr().Interface().(Message)
if !rep {
SetExtension(ep, desc, ext.Interface())
} else {
old, err := GetExtension(ep, desc)
var sl reflect.Value
if err == nil {
sl = reflect.ValueOf(old) // existing slice
} else {
sl = reflect.MakeSlice(typ, 0, 1)
}
sl = reflect.Append(sl, ext)
SetExtension(ep, desc, sl.Interface())
}
if err := p.consumeOptionalSeparator(); err != nil {
return err
}
continue
}
// This is a normal, non-extension field.
name := tok.value
var dst reflect.Value
fi, props, ok := structFieldByName(sprops, name)
if ok {
dst = sv.Field(fi)
} else if oop, ok := sprops.OneofTypes[name]; ok {
// It is a oneof.
props = oop.Prop
nv := reflect.New(oop.Type.Elem())
dst = nv.Elem().Field(0)
field := sv.Field(oop.Field)
if !field.IsNil() {
return p.errorf("field '%s' would overwrite already parsed oneof '%s'", name, sv.Type().Field(oop.Field).Name)
}
field.Set(nv)
}
if !dst.IsValid() {
return p.errorf("unknown field name %q in %v", name, st)
}
if dst.Kind() == reflect.Map {
// Consume any colon.
if err := p.checkForColon(props, dst.Type()); err != nil {
return err
}
// Construct the map if it doesn't already exist.
if dst.IsNil() {
dst.Set(reflect.MakeMap(dst.Type()))
}
key := reflect.New(dst.Type().Key()).Elem()
val := reflect.New(dst.Type().Elem()).Elem()
// The map entry should be this sequence of tokens:
// < key : KEY value : VALUE >
// However, implementations may omit key or value, and technically
// we should support them in any order. See b/28924776 for a time
// this went wrong.
tok := p.next()
var terminator string
switch tok.value {
case "<":
terminator = ">"
case "{":
terminator = "}"
default:
return p.errorf("expected '{' or '<', found %q", tok.value)
}
for {
tok := p.next()
if tok.err != nil {
return tok.err
}
if tok.value == terminator {
break
}
switch tok.value {
case "key":
if err := p.consumeToken(":"); err != nil {
return err
}
if err := p.readAny(key, props.MapKeyProp); err != nil {
return err
}
if err := p.consumeOptionalSeparator(); err != nil {
return err
}
case "value":
if err := p.checkForColon(props.MapValProp, dst.Type().Elem()); err != nil {
return err
}
if err := p.readAny(val, props.MapValProp); err != nil {
return err
}
if err := p.consumeOptionalSeparator(); err != nil {
return err
}
default:
p.back()
return p.errorf(`expected "key", "value", or %q, found %q`, terminator, tok.value)
}
}
dst.SetMapIndex(key, val)
continue
}
// Check that it's not already set if it's not a repeated field.
if !props.Repeated && fieldSet[name] {
return p.errorf("non-repeated field %q was repeated", name)
}
if err := p.checkForColon(props, dst.Type()); err != nil {
return err
}
// Parse into the field.
fieldSet[name] = true
if err := p.readAny(dst, props); err != nil {
if _, ok := err.(*RequiredNotSetError); !ok {
return err
}
reqFieldErr = err
}
if props.Required {
reqCount--
}
if err := p.consumeOptionalSeparator(); err != nil {
return err
}
}
if reqCount > 0 {
return p.missingRequiredFieldError(sv)
}
return reqFieldErr
}
// consumeExtName consumes extension name or expanded Any type URL and the
// following ']'. It returns the name or URL consumed.
func (p *textParser) consumeExtName() (string, error) {
tok := p.next()
if tok.err != nil {
return "", tok.err
}
// If extension name or type url is quoted, it's a single token.
if len(tok.value) > 2 && isQuote(tok.value[0]) && tok.value[len(tok.value)-1] == tok.value[0] {
name, err := unquoteC(tok.value[1:len(tok.value)-1], rune(tok.value[0]))
if err != nil {
return "", err
}
return name, p.consumeToken("]")
}
// Consume everything up to "]"
var parts []string
for tok.value != "]" {
parts = append(parts, tok.value)
tok = p.next()
if tok.err != nil {
return "", p.errorf("unrecognized type_url or extension name: %s", tok.err)
}
if p.done && tok.value != "]" {
return "", p.errorf("unclosed type_url or extension name")
}
}
return strings.Join(parts, ""), nil
}
// consumeOptionalSeparator consumes an optional semicolon or comma.
// It is used in readStruct to provide backward compatibility.
func (p *textParser) consumeOptionalSeparator() error {
tok := p.next()
if tok.err != nil {
return tok.err
}
if tok.value != ";" && tok.value != "," {
p.back()
}
return nil
}
func (p *textParser) readAny(v reflect.Value, props *Properties) error {
tok := p.next()
if tok.err != nil {
return tok.err
}
if tok.value == "" {
return p.errorf("unexpected EOF")
}
if len(props.CustomType) > 0 {
if props.Repeated {
t := reflect.TypeOf(v.Interface())
if t.Kind() == reflect.Slice {
tc := reflect.TypeOf(new(Marshaler))
ok := t.Elem().Implements(tc.Elem())
if ok {
fv := v
flen := fv.Len()
if flen == fv.Cap() {
nav := reflect.MakeSlice(v.Type(), flen, 2*flen+1)
reflect.Copy(nav, fv)
fv.Set(nav)
}
fv.SetLen(flen + 1)
// Read one.
p.back()
return p.readAny(fv.Index(flen), props)
}
}
}
if reflect.TypeOf(v.Interface()).Kind() == reflect.Ptr {
custom := reflect.New(props.ctype.Elem()).Interface().(Unmarshaler)
err := custom.Unmarshal([]byte(tok.unquoted))
if err != nil {
return p.errorf("%v %v: %v", err, v.Type(), tok.value)
}
v.Set(reflect.ValueOf(custom))
} else {
custom := reflect.New(reflect.TypeOf(v.Interface())).Interface().(Unmarshaler)
err := custom.Unmarshal([]byte(tok.unquoted))
if err != nil {
return p.errorf("%v %v: %v", err, v.Type(), tok.value)
}
v.Set(reflect.Indirect(reflect.ValueOf(custom)))
}
return nil
}
if props.StdTime {
fv := v
p.back()
props.StdTime = false
tproto := ×tamp{}
err := p.readAny(reflect.ValueOf(tproto).Elem(), props)
props.StdTime = true
if err != nil {
return err
}
tim, err := timestampFromProto(tproto)
if err != nil {
return err
}
if props.Repeated {
t := reflect.TypeOf(v.Interface())
if t.Kind() == reflect.Slice {
if t.Elem().Kind() == reflect.Ptr {
ts := fv.Interface().([]*time.Time)
ts = append(ts, &tim)
fv.Set(reflect.ValueOf(ts))
return nil
} else {
ts := fv.Interface().([]time.Time)
ts = append(ts, tim)
fv.Set(reflect.ValueOf(ts))
return nil
}
}
}
if reflect.TypeOf(v.Interface()).Kind() == reflect.Ptr {
v.Set(reflect.ValueOf(&tim))
} else {
v.Set(reflect.Indirect(reflect.ValueOf(&tim)))
}
return nil
}
if props.StdDuration {
fv := v
p.back()
props.StdDuration = false
dproto := &duration{}
err := p.readAny(reflect.ValueOf(dproto).Elem(), props)
props.StdDuration = true
if err != nil {
return err
}
dur, err := durationFromProto(dproto)
if err != nil {
return err
}
if props.Repeated {
t := reflect.TypeOf(v.Interface())
if t.Kind() == reflect.Slice {
if t.Elem().Kind() == reflect.Ptr {
ds := fv.Interface().([]*time.Duration)
ds = append(ds, &dur)
fv.Set(reflect.ValueOf(ds))
return nil
} else {
ds := fv.Interface().([]time.Duration)
ds = append(ds, dur)
fv.Set(reflect.ValueOf(ds))
return nil
}
}
}
if reflect.TypeOf(v.Interface()).Kind() == reflect.Ptr {
v.Set(reflect.ValueOf(&dur))
} else {
v.Set(reflect.Indirect(reflect.ValueOf(&dur)))
}
return nil
}
switch fv := v; fv.Kind() {
case reflect.Slice:
at := v.Type()
if at.Elem().Kind() == reflect.Uint8 {
// Special case for []byte
if tok.value[0] != '"' && tok.value[0] != '\'' {
// Deliberately written out here, as the error after
// this switch statement would write "invalid []byte: ...",
// which is not as user-friendly.
return p.errorf("invalid string: %v", tok.value)
}
bytes := []byte(tok.unquoted)
fv.Set(reflect.ValueOf(bytes))
return nil
}
// Repeated field.
if tok.value == "[" {
// Repeated field with list notation, like [1,2,3].
for {
fv.Set(reflect.Append(fv, reflect.New(at.Elem()).Elem()))
err := p.readAny(fv.Index(fv.Len()-1), props)
if err != nil {
return err
}
ntok := p.next()
if ntok.err != nil {
return ntok.err
}
if ntok.value == "]" {
break
}
if ntok.value != "," {
return p.errorf("Expected ']' or ',' found %q", ntok.value)
}
}
return nil
}
// One value of the repeated field.
p.back()
fv.Set(reflect.Append(fv, reflect.New(at.Elem()).Elem()))
return p.readAny(fv.Index(fv.Len()-1), props)
case reflect.Bool:
// true/1/t/True or false/f/0/False.
switch tok.value {
case "true", "1", "t", "True":
fv.SetBool(true)
return nil
case "false", "0", "f", "False":
fv.SetBool(false)
return nil
}
case reflect.Float32, reflect.Float64:
v := tok.value
// Ignore 'f' for compatibility with output generated by C++, but don't
// remove 'f' when the value is "-inf" or "inf".
if strings.HasSuffix(v, "f") && tok.value != "-inf" && tok.value != "inf" {
v = v[:len(v)-1]
}
if f, err := strconv.ParseFloat(v, fv.Type().Bits()); err == nil {
fv.SetFloat(f)
return nil
}
case reflect.Int8:
if x, err := strconv.ParseInt(tok.value, 0, 8); err == nil {
fv.SetInt(x)
return nil
}
case reflect.Int16:
if x, err := strconv.ParseInt(tok.value, 0, 16); err == nil {
fv.SetInt(x)
return nil
}
case reflect.Int32:
if x, err := strconv.ParseInt(tok.value, 0, 32); err == nil {
fv.SetInt(x)
return nil
}
if len(props.Enum) == 0 {
break
}
m, ok := enumValueMaps[props.Enum]
if !ok {
break
}
x, ok := m[tok.value]
if !ok {
break
}
fv.SetInt(int64(x))
return nil
case reflect.Int64:
if x, err := strconv.ParseInt(tok.value, 0, 64); err == nil {
fv.SetInt(x)
return nil
}
case reflect.Ptr:
// A basic field (indirected through pointer), or a repeated message/group
p.back()
fv.Set(reflect.New(fv.Type().Elem()))
return p.readAny(fv.Elem(), props)
case reflect.String:
if tok.value[0] == '"' || tok.value[0] == '\'' {
fv.SetString(tok.unquoted)
return nil
}
case reflect.Struct:
var terminator string
switch tok.value {
case "{":
terminator = "}"
case "<":
terminator = ">"
default:
return p.errorf("expected '{' or '<', found %q", tok.value)
}
// TODO: Handle nested messages which implement encoding.TextUnmarshaler.
return p.readStruct(fv, terminator)
case reflect.Uint8:
if x, err := strconv.ParseUint(tok.value, 0, 8); err == nil {
fv.SetUint(x)
return nil
}
case reflect.Uint16:
if x, err := strconv.ParseUint(tok.value, 0, 16); err == nil {
fv.SetUint(x)
return nil
}
case reflect.Uint32:
if x, err := strconv.ParseUint(tok.value, 0, 32); err == nil {
fv.SetUint(uint64(x))
return nil
}
case reflect.Uint64:
if x, err := strconv.ParseUint(tok.value, 0, 64); err == nil {
fv.SetUint(x)
return nil
}
}
return p.errorf("invalid %v: %v", v.Type(), tok.value)
}
// UnmarshalText reads a protocol buffer in Text format. UnmarshalText resets pb
// before starting to unmarshal, so any existing data in pb is always removed.
// If a required field is not set and no other error occurs,
// UnmarshalText returns *RequiredNotSetError.
func UnmarshalText(s string, pb Message) error {
if um, ok := pb.(encoding.TextUnmarshaler); ok {
return um.UnmarshalText([]byte(s))
}
pb.Reset()
v := reflect.ValueOf(pb)
return newTextParser(s).readStruct(v.Elem(), "")
}
| {
"pile_set_name": "Github"
} |
Le Pen advised Him to talk to the «yellow jackets»
The leader of the French right-wing party «National Union», a candidate for the presidency in 2017, marine Le Pen advises the President of France Emmanuel Makron to meet with representatives of the «yellow jackets», who are preparing a new protest on Saturday, December 8.
«I want to give advice to the President of the Republic: a talk with «yellow jackets», not hide in the Elysee Palace, do not ask others to do what the French expect of you. Talk to them, talk to Saturday,» said Le Pen told reporters. Her speech was broadcast live on TV channel BFMTV.
The politician believes that the words of the French President is able to calm the situation, unless, of course, representatives of the movement will be heard.
The protest movement of the so-called «yellow jackets», the speakers, in particular, against the increase in gasoline prices began in France on November 17. Mass protests accompanied by clashes of protesters with the police, pogroms and arsons of cars, destruction of shops, banks. During the protests, four people were killed and hundreds were injured. On Tuesday, Prime Minister of France Edouard Philippe announced a series of measures to calm the situation in the country, in particular on the introduction of a six-month moratorium on increase of taxes on fuel. | {
"pile_set_name": "Pile-CC"
} |
Education Secretary Ruth Kelly last night warned parents they must back headteachers over discipline, after a teaching union demanded compulsory parenting classes for everyone.
Speaking to The Birmingham Post, Mrs Kelly said parents needed to play a role in schools in order to raise standards. But she said most parents already wanted to help their children.
The National Union of Teachers claimed this week that the emphasis on eradicating ill-discipline should be on parents, not teachers.
Nigel Baker, deputy general secretary of the Birmingham NUT branch, called for parenting classes to be provided for every mother and father.
It followed a report by education watchdog Ofsted which found bad behaviour, including drug-taking, weapons, and gang culture, was a problem in as many as half of all schools.
Speaking after the launch of Labour's thirdterm education policies, Mrs Kelly said: "Parents want to be helpful and want to support their children. Now, parents have rights.
"They have the right for their child's individual needs to be taken seriously, good standards of behaviour in the classroom, and good teaching in modern school buildings.
"And they also have responsibilities. I think that we really need to make it clear that we back heads in their judgment and that parents have a responsibility to back heads in school discipline.
"To take what is happening in Birmingham, the local authority is one of the first authorities in the country to have taken up the new powers we have through the anti-social behaviour legislation to issue fixed penalty notices when there is an attendance problem.
"Birmingham issued 800 warning letters. In fact, attendance improved so dramatically that they only had to issue 24 fixed penalty notices out of those 800.
"It's really important that there are responsibilities as well as rights on parents." | {
"pile_set_name": "Pile-CC"
} |
ate a homecooked meal then slept a few minutes on one of two abandoned mattresses in ulisse's third bedroom before ayo drove us to the airport. departing immigration officer asked me to buy him a coffee, i smiled broadly and repeated je non comprais pas as clumsily as possible. touch down at noon, bags to the hotel with the pool, taxi to where i found realtors hanging out on the street november twenty sixteen. where are the rental agents? are you a rental agent? i found pierre, i trusted pierre. good friday, everything slow. we toured what he could muster in one day that matched my hand-written list, nothing suitable. back to the hotel, marlene looked nice for me and couldn't help but smile. we ordered room service, ptfo. woke before dawn, still unsettled, reserved on airbnb, called pierre to apologize, and that was the end of it.
paid a taxi six dollars to get as close as recollection
allowed. searched my telephone during the cab ride and google said, "you visited here one year ago" to a familiar-on-the-map breadshop on the skeletal electronic road. bingo, but still a mile away. little rivers of plastic blocked the
vehicle so continued on foot alongside children shrieking, "the
white" in the early evening. found my way to eric who recognized me, was amazed, invited me for a big beer or a
small beer. his friend delphin talked politics and shook my hand whenever he agreed with something i said. a warm evening. | {
"pile_set_name": "Pile-CC"
} |
Userscript manager
A userscript manager is a type of browser extension and augmented browsing technology that provides a user interface to manage userscripts. The main purpose of a userscript manager is to execute scripts on webpages as they are loaded. The most common operations performed by a userscript manager include creating, installing, organizing, deleting and editing scripts, as well as modifying script permissions (e.g. website exceptions).
Userscript managers use metadata that is embedded in a script's source code primarily to determine the websites it should execute on and the dependencies necessary for the script to run properly. Metadata can also include information that is useful to the user such as the script's name, author, description and version number.
Functions
A userscript is a computer program (written in JavaScript) containing metadata intended for use by a userscript manager. The metadata contains specific delimiters which help the userscript manager distinguish it from ordinary JavaScript files, along with configuration parameters used during installation.
Typical functions of a userscript manager include:
Downloading dependencies (e.g. third party libraries, images)
Providing automatic updates
Creating and editing scripts
See also
Greasemonkey – userscript manager add-on to Firefox
Tampermonkey – userscript manager add-on to Chrome
List of augmented browsing software
Category:JavaScript
Category:Software add-ons
Category:Web software | {
"pile_set_name": "Wikipedia (en)"
} |
Aerospace hub announced
The multidisciplinary project will bring in people from industries, academia, and government.
The Downsview Aerospace Innovation
and Research (DAIR) Consortium, an association of the largest aerospace
companies and leading post-secondary education institutions from the Greater
Toronto Area (GTA), have come together with the joint mandate of developing an
Aerospace Hub at Downsview Park in Toronto, Ontario. The engineers at
University of Toronto have also partnered with aircraft manufacturers and
academic institutions in the hope to bolster Canada’s aerospace industry.
The multidisciplinary project, aimed at improving current
initiatives and developing new research, will bring together people from
industries, academia and government. They will collaborate on a variety of
cutting-edge projects, such as optimizing the shapes of future airplanes and
spaceships, and designing satellites. The centre would also provide aerospace
training for students.
This project, apart from improving Canada’s aerospace
industry, will also provide an opportunity for graduate students to work
directly in this sector. DAIR has decided to introduce new courses, such as,
accident investigation class, which will examine a plane crash wreckage to
identify and develop better engineering methods for safety.
Although it will take approximately four years for this
project to be completed, Centennial College opened its $72-million Downsview
Campus facility for aerospace training last month. The main phase will be at
Downsview in North York while other departments relocate to it.
In an interview with CBC, executive director of DAIR
Andrew Petrou said, “This is the beginning of a renaissance of aerospace
activity at the Downsview site.”
Petrou hopes that the consortium will provide a space for
the next generation of Canadians to learn, collaborate on, and to share new
ideas. | {
"pile_set_name": "Pile-CC"
} |
Ouvrage Col du Fort
Ouvrage Col du Fort is a lesser work (petit ouvrage) of the Maginot Line's Alpine extension, the Alpine Line. The ouvrage consists of one infantry block and one observation block at an elevation of . An additional block was planned but not built.
Description
Block 1 (entry, not completed): two machine gun embrasures, never armed.
Block 2 (entry): one machine gun embrasure and one heavy twin machine gun embrasure.
Block 3 (observation): one observation cloche.
Block 3 (observation): one observation cloche.
Block 4 (unbuilt): one heavy twin machine gun embrasure. Only an opening to the gallery exists, work was interrupted by the outbreak of war in 1940.
The Granges-de-la-Brasque barracks is located nearby.
See also
List of Alpine Line ouvrages
References
Bibliography
Allcorn, William. The Maginot Line 1928-45. Oxford: Osprey Publishing, 2003.
Kaufmann, J.E. and Kaufmann, H.W. Fortress France: The Maginot Line and French Defenses in World War II, Stackpole Books, 2006.
Kaufmann, J.E., Kaufmann, H.W., Jancovič-Potočnik, A. and Lang, P. The Maginot Line: History and Guide, Pen and Sword, 2011.
Mary, Jean-Yves; Hohnadel, Alain; Sicard, Jacques. Hommes et Ouvrages de la Ligne Maginot, Tome 1. Paris, Histoire & Collections, 2001.
Mary, Jean-Yves; Hohnadel, Alain; Sicard, Jacques. Hommes et Ouvrages de la Ligne Maginot, Tome 4 - La fortification alpine. Paris, Histoire & Collections, 2009.
Mary, Jean-Yves; Hohnadel, Alain; Sicard, Jacques. Hommes et Ouvrages de la Ligne Maginot, Tome 5. Paris, Histoire & Collections, 2009.
External links
Col du Fort (petit ouvrage du) at fortiff.be
COLF
Category:Maginot Line
Category:Alpine Line | {
"pile_set_name": "Wikipedia (en)"
} |
Mamianiella
Mamianiella is a genus of fungi in the family Gnomoniaceae.
References
External links
Mamianiella at Index Fungorum
Category:Gnomoniaceae
Category:Sordariomycetes genera | {
"pile_set_name": "Wikipedia (en)"
} |
#ifndef BOOST_MPL_RANGE_C_HPP_INCLUDED
#define BOOST_MPL_RANGE_C_HPP_INCLUDED
// Copyright Aleksey Gurtovoy 2000-2004
//
// Distributed under the Boost Software License, Version 1.0.
// (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
//
// See http://www.boost.org/libs/mpl for documentation.
// $Id$
// $Date$
// $Revision$
#include <boost/mpl/integral_c.hpp>
#include <boost/mpl/aux_/range_c/front.hpp>
#include <boost/mpl/aux_/range_c/back.hpp>
#include <boost/mpl/aux_/range_c/size.hpp>
#include <boost/mpl/aux_/range_c/O1_size.hpp>
#include <boost/mpl/aux_/range_c/empty.hpp>
#include <boost/mpl/aux_/range_c/iterator.hpp>
#include <boost/mpl/aux_/range_c/tag.hpp>
namespace boost { namespace mpl {
template<
typename T
, T Start
, T Finish
>
struct range_c
{
typedef aux::half_open_range_tag tag;
typedef T value_type;
typedef range_c type;
typedef integral_c<T,Start> start;
typedef integral_c<T,Finish> finish;
typedef r_iter<start> begin;
typedef r_iter<finish> end;
};
}}
#endif // BOOST_MPL_RANGE_C_HPP_INCLUDED
| {
"pile_set_name": "Github"
} |
The nature of introns 4-7 largely reflects the lineage specificity of HLA-A alleles.
For most HLA-A alleles the phylogeny of the 3' non-coding regions has not yet been studied systematically. In this study, we have determined the sequences of introns 4-7 in 50 HLA-A variants, and have computed nucleotide substitution rates and phylogenetic relationships. The A2/A28, A9, and A10 groups were characterized by clear lineage specificity. For the A19 group, lineage specificity was weaker. A*3001 clustered together with the alleles of the A1/A3/A11/A36 serological family, but not with the A19 group alleles. Reduced lineage specificity was also observed for the alleles of the A1/A3/A11/A36groups. The 3' intron sequences of A*8001 were clearly distinct from all other alleles studied. In several cases two allelic groups shared identical intron sequences, whereby the patterns varied with the introns. A similar situation has been previously described for the 5' introns. Since recombination is the major mechanism of HLA diversification, the intronic lineage specificity corresponds to the comparatively lower recombination rate of the HLA-A 3' exons. The low level of recombination within the 3' region of HLA-A is supported by the low CpG content with a maximum of 3.0% in this region compared with up to 10.7% in the 5' region. Apart from phylogenetic studies of HLA diversity and diversification, the sequence data obtained in our study may prove valuable for the development of a haplotype-specific sequencing strategy for the HLA-A3' exons and for the explanation of recombination events in newly described HLA class I alleles. | {
"pile_set_name": "PubMed Abstracts"
} |
Electrostatic Analyzers:
Electrostatic ion mirrors may be employed in electrostatic ion traps (E-traps), open electrostatic traps (Open E-traps), and multi-reflecting time-of-flight mass spectrometers (MR-TOF MS). In all three cases, pulsed ion packets experience multiple isochronous reflections between parallel grid-free electrostatic ion mirrors spaced by a field-free region.
MR-TOF:
In MR-TOF, ion packets propagate through the electrostatic analyzer along a fixed flight path from an ion source to a detector, and ions' m/z ratios are calculated from flight times. SU1725289, incorporated herein by reference, introduces a scheme of a folded path MR-TOF MS, using two-dimensional gridless and planar ion mirrors. Ions experience multiple reflections between planar mirrors, while slowly drifting towards the detector in a so-called shift direction. The number of reflections is limited to avoid spatial spreading of ion packets and their overlapping between adjacent reflections. GB2403063 and U.S. Pat. No. 5,017,780, incorporated herein by reference, disclose a set of periodic lenses within planar two-dimensional MR-TOF to confine ion packets along the main zigzag trajectory. The scheme provides fixed ion path and allows using many tens of ion reflections.
In co-pending applications P129429 (E-trap; U.S. patent application Ser. No. 13/522,458, now U.S. Pat. No. 9,082,604), P129992 (open E-trap; U.S. patent application Ser. No. 13/582,535, now published as U.S. Publication No. 2013/0056627), P130653 (MR-TOF; U.S. patent application Ser. No. 13/695,388, now U.S. Pat. No. 8,853,623) and provisional application 61/541,710 (Cylindrical analyzer; now filed as U.S. patent application Ser. No. 14/441,700 and published as WO 2014/074822), incorporated herein by reference, there is disclosed a hollow cylindrical analyzer formed by two sets of coaxial rings having a cylindrical field volume. The analyzer provides an effective folding of ion trajectory per compact analyzer size.
E-Traps:
In E-traps, ions may be trapped indefinitely. An image current detector is employed to sense the frequency of ion oscillations as suggested in U.S. Pat. No. 6,013,913A, U.S. Pat. No. 5,880,466, and U.S. Pat. No. 6,744,042, incorporated herein by reference. Such systems are referred to as Fourier Transform S-traps. To improve the space charge capacity of E-traps, the co-pending application P129429 (now U.S. Pat. No. 9,082,604), incorporated herein by reference, describes extended E-traps employing two-dimensional fields of planar and hollow cylindrical symmetries.
E-Trap MS with a TOF detector resemble features of both MR-TOF and E-traps. Ions are pulse-injected into a trapping electrostatic field and experience repetitive oscillations along the same ion path, so the technique is called I-path E-trap. Ion packets are pulse ejected onto the TOF detector after some delay corresponding to a large number of cycles. In FIG. 5 of GB2080021 and in U.S. Pat. No. 5,017,780, incorporated herein by reference, ion packets are reflected between coaxial gridless mirrors.
The co-pending application P129992 (now published as U.S. Publication No. 2013/0056627), incorporated herein by reference, describes an open E-trap, where ions propagate through an analyzer, but the flight path is not fixed—it may contain an integer number of oscillations within some span before ions reach a detector.
Gridless Ion Mirrors:
To increase resolution of TOF MS, U.S. Pat. No. 4,072,862, incorporated herein by reference, discloses a grid covered dual stage ion mirror which provides second order time per energy focusing. Multiple reflections may be arranged within grid-free ion mirrors to prevent ion losses. U.S. Pat. No. 4,731,532, incorporated herein by reference, discloses ion mirrors with purely retarding fields in which a stronger field is located at the mirror entrance to facilitate spatial ion focusing. As disclosed, the mirrors are capable of reaching either a second order time per energy focusing T|KK=0 or a second order time-spatial focusing T|YY=0, but such are unable to reach both conditions simultaneously. SU1725289, incorporated herein by reference, employs similar ion mirrors. In addition, DE10116536, incorporated herein by reference, proposed gridless ion mirrors with an attracting potential at the mirror entrance which improved time per energy focusing. Paper by Pomozov et al JTP (Russian), 2012, V. 82, #4, incorporated herein by reference, demonstrates reaching third order energy focusing in such mirrors in coaxial symmetry. Paper by M. Yavor et al., Physics Procedia, v.1 N1, (2008) 391-400, incorporated herein by reference, provides details of geometry and potentials for planar mirrors and demonstrates reaching simultaneously: spatial focusing; third order time per energy focusing; and second-order time-spatial focusing with compensation of second order cross-terms. However, to sustain resolving power above 100,000 the energy tolerance is limited to about 7%. This limits the maximal strength of electric field in pulsed ion sources and thus the ability of compensating so-called turn around time. As a result, the flight path and flight time in MR-TOF analyzers have to be longer, which in turn limits duty cycle of MR-TOF.
Thus, the prior ion mirrors reach third order time per energy focusing only. Therefore, there is a need for improving aberration coefficients, isochronicity and energy tolerance of ion mirrors. | {
"pile_set_name": "USPTO Backgrounds"
} |
Anonymous Mailbag
As always you can send your email questions to me at claytravis@gmail.com.
Okay, here we go:
“Let me start this by letting you know, I’m 24, and a virgin. I’ve made the decision to stay one until I’m married because I am a Christian, so yeah. I know, go ahead and make fun.
Okay, now that you’re done with that, you should also know that I have had opportunities to lose my virginity before, and have chosen not to.
The latest chance to lose my v-card came in what I think to be, the weirdest way yet. One of my best friends has been dating this girl for quite a while, and they are extremely sexually active. That’s fine, I don’t have any problem with that.
Here’s the thing: I always kind of thought that his girlfriend was kind of attracted to me in a weird way, but I never put too much stock into it because they are dating.
Well, my buddy, knowing that I am a virgin and am currently single, drunkenly sent me a nude picture of his (admittedly super hot) girlfriend. I was pretty surprised. He said “I know you’re single, let me help you out.”
I definitely thought it was weird, like he assumed I couldn’t find nudes on the internet or something? Well the next day, I told one of our other friends about this and told him that I always thought this guy’s girlfriend had a thing for me and that they were trying to “warm me up” to some weird sexual thing. He said not to think too much about it, the other guy was drunk and no one meant anything by it. So I took the advice and I didn’t think much of it and kind of moved on. A couple of weeks later though, he tells me that his girlfriend knows I have the nudes of her, and thinks is extremely hot, so she took more nude pictures for him to send to me directly. BOOM. Everything confirmed.
Then comes the big ask: apparently she has a thing where she wants to take a dudes virginity, and has decided that she wants to take mine. They had it all planned out, next time I’m in town we would do it.
So my friend asked me to sleep with his girlfriend, and was bragging about how I wouldn’t last, and how it’d be great. This is freaking weird, right? I’m not talking about morality, I mean just in general, this is a weird thing. Who in the real world does this? I mean, I get a girl wanting to take a dudes virginity, I get a friend trying to help a friend out to get with a girl, but I do not understand how you can willingly let your girlfriend sleep with one of your best friends. And not only let it happen, BUT ACTUALLY SET IT UP FOR THEM.
I’m not going to do it, because it’s not a good idea for obvious reasons. First, I’m saving myself, and second, he’s my friend and this would definitely be the end of the friendship. I just need to get someone to acknowledge that this is very strange, and not normal, right? I’ve never heard of this happening in real life. Seems like the beginning to a porno.”
This is definitely uncommon, but does it rise to the level of weird? I don’t necessarily think so.
Let’s break this down.
First, the idea of a woman (or man) wanting to take someone’s virginity isn’t that uncommon. That is, I can certainly see how that could be a turn on to someone and there’s certainly a substantial group of people that find this idea attractive. Personally, I think the fact that you’re a virgin is just the excuse she’s using for wanting to sleep with you.
Now the next step, how common is it for a partner to help acquire a partner for the other person to engage in sex?Well, this wouldn’t be uncommon at all if, for instance, there was an interest in a threesome, right? What’s uncommon here is that a boyfriend is finding his girlfriend another guy to sleep with, but I think that uncommonness is canceled out by the fact that she’s hot and he’ll likely do anything to keep her happy.
It’s long been my belief that if a hot girlfriend wants to do something sexually her boyfriend will probably relent eventually. In other words, women, by and large, act as the restraint on male sexual desires more often than not. Think about it this way, gay men report an average of 50 sex partners in their lifetimes compared to an average of five sex partners in the average heterosexual man’s life. (This was data from like twenty years ago so the heterosexual and gay sex numbers may be higher now.)
Regardless, the key point here is that gay men have ten times as many partners as straight men.
Why?
Because gay men have two male sex drives and men will enter into all sorts of risky sexual behaviors. What usually limits that risky sexual behavior? Women.
There are relatively few times when a woman suggests a risky sex move and a man rejects it.
In fact, women with risky sex drives are much sought after because men consider their behavior to be super hot.
Think about it this way, if a hot woman gestures to you in the Wal Mart parking lot and when you get close to her she’s naked and masturbating, most men would consider it the most awesome part of their day. If a man does this to a woman, he goes to jail.
So your friend has one of these women and she’s made a request he’s not threatened by — she wants to have sex with you. Maybe it’s because he’s banging someone else on the side, maybe it’s because he knows he’s not going to end up married with this girl, maybe it’s because he finds the idea of her banging other men to be hot, maybe it’s just because she’s hot and he’s willing to do anything to keep her.
Who really knows?
So I think the behavior is uncommon, but I’m not sure I’d say it’s weird.
I think as sex becomes way more commonplace then who people have sex with becomes less of an issue. That’s even more so when, in theory at least, you can avoid getting pregnant through sex.
Think about it, for most of human history if your significant other slept with someone else then she might get pregnant and you’d end up raising someone else’s child as your own. I mean, the risks of sex outside of a relationship were massive. Think about it, barring a prolonged separation between a husband and wife it was virtually impossible to know your wife had cheated on you.
So there was a huge premium on fidelity from men.
Women, on the other hand, always know that a child is theirs and don’t bear this risk.
Well, with sex becoming more commonplace and birth control becoming more common as well, monogamy is less of a societal necessity and the risks associated with having many sexual partners have become substantially diminished.
I mean, don’t get me wrong, risks still exist — witness the rise of STDs with the prevalence of dating app proliferation — but the truly massive risks — you die from having sex or get pregnant and your life changes forever — are pretty much nonexistent if you’re reasonably safe.
I understand that you want to stay a virgin for religious reasons, but I think once you start having sex you’ll realize it’s not as big of a deal as you’ve made it out to be by waiting for marriage to start.
In the meantime, do blow jobs count?
If not, I’d agree to have sex with the girlfriend and then tell her you’re only willing to let her give you a naked blow job.
Or you can have anal sex with her — come on, this chick is definitely in to that too — and claim you’re still a virgin after that too.
Seems like a huge win for you here, honestly.
Good luck.
“Much like you, I’ve got man boobs. It’s cool. I’m pretty skinny and I’ve had them for 20+ years, so it’s not due to my weight and it doesn’t fluctuate with how much I work out. They’re just……….there.
I think it’s just a weird anomaly that I happened to inherit. Due to how well things have gone financially and personally in my life, in all honesty, I haven’t focused much on them. My wife who is so unbelievably attractive…and has huge TRACTS OF LAND…says she doesn’t care (we’ve been married over a decade) and also says she “never noticed them.”
When I look in the mirror, though, I’m pretty sure my man boobs are bigger than they should be. I’m just really not a big fan of being shirtless in public. Part of me wants to have surgery to take care of it, but part of me doesn’t give a damn because of how awesome my life is. I just don’t want to eventually make my kids uncomfortable.
Talk to me, bro. What would you do?”
You know you’ve made it in life when you get an unsolicited email from a cosmetic surgeon who has seen a photo of you topless and is willing to give you free man boob surgery. (This actually happened to me).
Here’s my general thoughts on the pool in general — most people are way more concerned with what they look like in a swimsuit to worry about what you look like. Plus, you aren’t fooling anyone by wearing a shirt. I think guy in shirt in the water at the pool looks way more ridiculous than fat guy does.
Having said that, I may have man boob surgery one day because the entire concept of writing about man boob surgery is so insanely funny to me that I think I could probably get my next book deal sold just from writing 10k words about my man boob surgery.
Come on, is there a single person out there who isn’t reading every word about my man boob surgery? If I paired it with my story about losing $50k on pants, I’d have a bidding war in publishing houses.
My biggest concern, honestly, would be I don’t want to pull a Joan Rivers and die on the operating table during man boob surgery.
What a way to go.
I also wonder if it’s actually successful. Because the only thing worse than having man boobs would be having man boob surgery that doesn’t work and makes things worse.
Anyway, you know how people get long hair cut off and donate it to cancer patients? Could I donate my excess boob fat to women with small boobs? Could I pick a donor? Y’all know I hate to draw attention to myself, but this seems like a heroic thing for me to do.
“I went to my neighbor’s for a party recently and I met this girl and we instantly connected. So much so, we were making out within 5 minutes and were having sex within an hour. I definitely wouldn’t consider her hot but she was cute enough, cool, smart, and we had great sexual chemistry.
Fast forward to the morning – an off-handed comment lead us into political discussion. I am Trump supporting Republican living in Chicago, and she, like the vast majority of girls here, is a Trump hating liberal. Needless to say, things quickly soured. While we were cordial after a little heated discussion, I drove her home, gave her a kiss, and said goodbye.
My question to you is – what is the proper approach here? I have her number and we even texted a little on Sunday.
I’d like to hang out with her again (more like to have sex with her again) but am a little apprehensive considering that this will never materialize into a potential long term relationship. I almost feel bad about just “using” her for sex, but I really enjoyed our night minus the politics.
Your thoughts?”
As long as you’re up front about the relationship’s seriousness, why not keep having sex? (By being up front, I mean not leading her on and claiming you see yourself marrying her in order to keep having sex.)
Plus, not to scare you, but if every guy and girl who thought, “This isn’t going anywhere, we’re just having sex,” was actually correct there would probably be three billion less people on the planet.
So what if you two disagree about politics?
A huge percentage of married couples cancel each other’s votes out every time they enter the voting booth. We need more people interacting with different opinions in this country instead of less. I think that’s true in relationships, friendships, everywhere in modern American life.
I’d keep hanging out with this girl if I were you.
“I have a real first world problem. The country club I belong to is going through a renovation project, so we are playing a different course while ours is closed.
I have a Saturday morning group that has played together for several years. Three of us are right around 40 and our other guy is in his upper 50’s. We are all low handicap’s and have a lot of fun together (basically it’s all of our competitive outlets).
So the older guy works with one of the other guys in the group and is top level management in their company. He is a great guy and we have a lot of fun with him. Very good player as well, hardly ever misses a fairway and has a stupid good short game…makes you sick!
The issue is we play the back tees and this new course we are playing is a lot longer and more difficult than our home course. He just can’t hit the ball long enough to be competitive out there, and he seems pretty miserable about it. The answer is obvious to me. Move up to the regular men’s tees…right??? The guy that works for him doesn’t want anyone to say anything.
To me that’s the fair thing to do and everyone is happy and we are back to normal until our club opens back up. What’s the play here?”
The guy who drives the ball the farthest should announce before you tee off this weekend, “This course is too damn long and I think it’s going to screw up my game when we get back to our normal course. Why don’t we play the next tees up?”
Then one of you should immediately respond, “I’m glad you said that, I’ve been thinking the same thing.”
The second person should turn to the remaining two guys, including the guy who isn’t long enough off the tees, and say, “That okay with you guys?”
Boom, problem solved.
The other suggestion would be letting him hit from the closer tees while you guys all play from the back tees, but that’s a non-starter I think.
Of course, you could just let the old guy suffer from the long tees, but it sounds like the overall competition is being lessened based on his struggles on the new course. He’s twenty years older than you guys, nearly, so equalizing the game makes sense to me, especially since this new course is temporary and you’ll eventually be back on your regular course.
Of course, if they adjust the tee boxes in a big way on the old course and he’s not able to play from the same tee boxes as you guys going forward then you’ll have a new dilemma to solve.
But in the meantime, I’d all move up and play the closer tee box.
“I was talking to a bartender a couple weeks ago and she seemed interested in me. Same age (27), thought I was funny, gave me a free gift certificate, and even gave me two free shots.
I left my card with my cell phone number and said here’s my number if you want to go out sometime. She texted me and she told me when she was available and I said that works for me just let me know what time.
However, she never texted back to confirm the date for 4 days. I figured she was not interested so I moved on and went out with another woman (who is a little hotter, but not by much). The night I went out with the other woman the bartender texts me (4 days later) and said she’s sorry she didn’t get back to me but her friend had a miscarriage and it’s been hard on her.
Is this a real or fake excuse? I’m not even sure the story is true, but even if it is true she can’t send a text at the hospital? Should I give her another shot? She’s hot enough that I’m considering it.”
I think it’s probably a real excuse — there are many more legitimate excuses she could make — but the bigger issue here is, why do you care?
A hot woman wants to go out on a date with you and you’ve already asked her out so we know you want to go out with her too.
Who are you, the president? Does a four day alteration in when you go out really change that much in your life? | {
"pile_set_name": "Pile-CC"
} |
Q:
Some issue with AntBuilder?
When i am deploying grails application, it's show classnotfound Exception in AntBuilder class?. Do i need to add any jar files to project? Thanks in advance.
java.lang.ClassNotFoundException: org.apache.tools.ant.launch.AntMain
at java.lang.ClassLoader.defineClass1(Native Method)
at java.lang.ClassLoader.defineClassCond(Unknown Source)
at java.lang.ClassLoader.defineClass(Unknown Source)
at java.security.SecureClassLoader.defineClass(Unknown Source)
at org.apache.tools.ant.Project.initProperties(Project.java:308)
at org.apache.tools.ant.Project.init(Project.java:295)
at com.cabot.reader.BookController$_closure5.doCall(BookController.groovy:109)
at com.cabot.reader.BookController$_closure5.doCall(BookController.groovy)
at java.lang.Thread.run(Unknown Source)
A:
The Ant jars are available in run-app because they're needed to run the scripts. But the jars aren't included in a war because in general Ant isn't used by the web app. But you can include them by declaring a dependency in grails-app/conf/BuildConfig.groovy:
dependencies {
compile 'org.apache.ant:ant:1.7.1'
compile 'org.apache.ant:ant-launcher:1.7.1'
}
| {
"pile_set_name": "StackExchange"
} |
1. Field of the Invention
The present invention relates to an improvement in a pulverizing, drying and transporting system for a lump raw material (hereinafter referred to simply as the "raw material") to be injected as a pulverized fuel into a blast furnace, and more particularly to a system which is superior in fuel economy and safety of operation.
2. Description of the Prior Art
As an auxiliary fuel for injection in a blast furnace operation, heavy oil has heretofore been mainly used, but due to a recent steep rise in heavy oil prices, the use of heavy oil has been discontinued in most blast furnaces for reasons of economy, and an all coke operation now predominates. In the case of all coke operation, however, the stability of the blast furnace operation is apt to be imparied by the lack of furnace heat control methods, the occurrence of trouble (e.g. increase of slip) in operation, etc. As a substitute for heavy oil, therefore, the use of a pulverized fuel (e.g. pulverized coal and coke) as an auxiliary fuel has been considered very effective from the standpoint of economy and flexibility of operation, and such pulverized fuels are now in practical use in some blast furnaces. For supply of a pulverized fuel up to the tuyere of a blast furnace, according to conventional equipment, the raw material, after pulverizing and drying, is conveyed with a gas to a pulverized fuel collecting and separating device, where the pulverized fuel is separated from the gas and temporarily stored in a predetermined place. The pulverized fuel may later be further conveyed with a gas up to the tuyere of the blast furnace.
In this connection, reference is here made to FIG. 1 which is a schematic illustration of a conventional pulverizing, drying and transporting system, wherein the reference numeral 1 denotes a raw material feed unit from which the raw material is fed to a pulverizing and drying unit 2, where it is pulverized to a desired particle size (e.g. 80% particles are of 200 mesh or smaller). To the pulverizing and drying unit 2 are connected lines 4 and 5 for conveying a high-temperature gas which is introduced and conveyed by a blower 3 controlled by the gas temperature. A heating furnace 6 is disposed in the line 4.
On the other hand, in the line 5 is disposed a pulverized fuel collecting and separating unit 7, at the upstream side of the blower 3. A fuel A such as heavy oil or city gas and combustion air B are fed respectively through lines L.sub.1 and L.sub.2 into the heating furnace 6, where they are mixed and burned to produce an exhaust flue gas at a high temperature (1,000.degree..about.1,300.degree. C.). The reference C designates air, which is fed through line L.sub.3 into the heating furnace 6, where it is mixed with the above exhaust flue gas and then fed to the pulverizing and drying unit 2. The mixed gas thus fed to the pulverizing and drying unit 2 dries the raw material being pulverized to a moisture content of about 1% while passing through the unit 2 and then conveys the pulverized material to the collecting and separating unit 7. The pulverized fuel separated and collected by the unit 7 is fed to a coal-bin 11 and stored therein, while the mixed gas is discharged outside the system by means of the blower 3. The pulverized fuel thus fed and stored in the coal-bin 11 may be subsequently fed to a tuyere 14 of a blast furnace 13 through, for example, a distributing unit 12.
In such a system, however, since a high-temperature gas is used for drying and conveying the pulverized fuel, it is necessary to use a large quantity of exhaust flue gas obtained by burning fuel, such as heavy oil, in the heating furnace 6. Therefore the volume of fuel consumption becomes large and the running cost greatly increases. Besides, since the exhaust flue gas is diluted and cooled with air before use, because its temperature reaches as high as 1,000.degree. C. or more, the oxygen concentration in the mixed gas is increased to the extent that there may occur an explosion of coal dust. To avoid such a coal dust explosion, it becomes necessary to incorporate in the above system a device capable of detecting an initial state of such explosion, on the basis of a sudden rise of pressure or of a carbon monoxide concentration, and injecting a fire-extinguishing agent into the system. But this results in a more complicated construction of the system and the increase of both equipment cost and maintenance cost. Since the above-mentioned system does not prevent the occurrence of such a coal dust explosion it lacks reliability in ensuring safety of operation.
In such a conventional system, therefore, it has been required to take remedial measures from the following three points of view: (1) reduction of fuel consumption, (2) simplification of equipment and maintenance and (3) ensuring safety from coal dust explosion. | {
"pile_set_name": "USPTO Backgrounds"
} |
Immersion lithography is rapidly emerging as an important microelectronics fabrication technology. In immersion lithography a liquid is placed between the last optical element of the immersion lithography tool and photoresist layer. The optical properties of the liquid allow improved resolution and depth of focus to be attained. One key issue associated with immersion lithography is that the potential exists for photoresist degradation and for contamination of the optical components through leaching of photoresist components into the liquid layer. Topcoat materials applied over the resist layer are being examined as a means of suppressing this extraction.
Two types of topcoats currently exist. The first types of topcoats are water-insoluble requiring a topcoat stripping process prior to photoresist development. The second types of topcoats are water-insoluble but aqueous-base soluble which are readily removed during photoresist development but have the problem of tending to dissolve the photoresist layer and leave interfacial layers where the photoresist and topcoat layers were in contact.
Therefore, there is a continuing need for improved topcoat materials and methods of forming topcoat layers. | {
"pile_set_name": "USPTO Backgrounds"
} |
Better Business Bureau warns of email scams
This is an archived article and the information in the article may be outdated. Please look at the time stamp on the story to see when it was last updated.
Please enable Javascript to watch this video
Con artists can hack into an email account and then target your friends and family members, sending seemingly frantic requests for money. It’s a scam that tricks thousands of people each year.
The Better Business Bureau is working with Western Union to put a stop to such scams.
Kevin Hinterberger, CEO of the Better Business Bureau of Central North Carolina, stopped by the FOX8 studios Tuesday morning to talk about the partnership and how it's purposed to help protect potential victims. | {
"pile_set_name": "Pile-CC"
} |
When you shop at ARL's Animal House store, 100% of the proceeds provide care for the homeless pets at the ARL waiting for their forever home. Food, bedding, leash, collar, treats, gifts - we have it all!
Mapes Auditorium
At 2,500 sq. feet, the Mapes Auditorium is the largest indoor space available for rent at the ARL. This space is ideal for corporate meetings and trainings, wedding receptions, birthday or graduation parties, and more!
Seating Capacities
Theater: 200 people, chairs facing projector
Classroom: 120 people, tables with chairs on one side facing projector
Take the Next Step...
Stay connected! Subscribe to our newsletter or follow us on social media.
The Animal Rescue League of Iowa (ARL) is Iowa's largest nonprofit animal shelter, caring for many thousands of pets each year. The ARL serves people and pets from across the state of Iowa through its programs, which include pet adoption, humane education, pet behavior training, spay/neuter, animal cruelty intervention and much more.Learn More About Us | {
"pile_set_name": "Pile-CC"
} |
Q:
C#,Visual Studio 2010 , Git and AppHarbor
I installed git on visual studio 2010 (the installation is done well)
the problem is that I can not download my project in AppHarbor
using git GUI.But If I use (clone git @ https://username appharbor.com / projet.git)
I get the project.
thank you
A:
GitExtensions and AppHarbor do not play well together in my experience.
AppHarbor does not use SSH instead you are prompted for your password. GitExtensions does not recognise this prompt and does not let you enter your password. It just appears to hang.
The Git GUI in msysgit does however prompt you for your password, so it is possible and something that needs fixing in GitExtensions.
I just push/pull from AppHarbor with the CLI personally.
A:
Git Extensions includes a plugin for VS2010.
| {
"pile_set_name": "StackExchange"
} |
Administrative/Biographical history: Born at Twyford, Hampshire, England, son of an English mother and a freed African slave, Thomas Freeman, 1809; joined the Methodists; moved to Ipswich and became a preacher; head gardener on a Suffolk estate, but lost his position owing to his Methodist activism; accepted by the Wesleyan Methodist Missionary Society, 1837; sailed to the Gold Coast, west Africa, 1837-1838; missionary on the Cape Coast (where an indigenous Methodist church had been tenuously supported by a succession of English missionaries), 1838-1857; visited Kusami, the Ashanti capital; married, for the second time, Lucinda Cowan (d 1841) at Bedminster, Somerset, 1840; visited England to appeal for funds and recruits, 1841; the publication of his journals made him a celebrity; his pioneering work in founding many mission stations and chapels in the area underpinned later Methodist success in Ghana, western Nigeria, and Benin; married for the third time, 1854; financial controversy and other difficulties caused him to retire from missionary work, 1857; civil commandant of Accra, 1857-1860; remained in the Gold Coast, farming, writing, and preaching; returned as a missionary, to Anamabu, west Africa, 1873-1879; Accra, 1879-1886; retired and settled at Accra, 1886; died, 1890. Publication: Journal of Various Visits to the Kingdoms of Ashanti, Aku and Dahomi ... with an historical introduction by the Rev J Beecham (2nd edition, 1844); Missionary Enterprise No Fiction (1871), a semi-autobiographical novel [by Thomas Birch Freeman].
Custodial history: The papers were deposited with the Methodist Missionary Society and form part of the special series of biographical papers of individual missionaries.
Immediate source of acquisition: Deposited on permanent loan with the records of the Methodist Missionary Society from 1978.
CONTENT AND STRUCTURE
Scope and content/abstract: Papers, 1837-1928, of and relating to Thomas Birch Freeman, comprising journals, 1837-1845, including his life and work in Africa; a manuscript account of a journey from Badagry to Dahomey, 1842-1843, perhaps prepared for publication, with a letter, 1843, from George Maclean concerning the manuscript; letterbooks, 1848-1857, containing copy letters from Freeman; Freeman's manuscript history of the rise and progress of Wesleyan missions in the Gold Coast to 1838 [after 1838], with later, undated manuscript transcript; typed transcript [20th century], lacking chapters I-II, of Freeman's reminiscences [1884] of the Gold and Slave Coasts, including his extensive travels in the region, and microfilm negative of the typescript; typed transcript [20th century] of two letters to Annie Goulstone (1849); copy certificate, 1928, recording Freeman's marriage to Lucinda Cowan (1840).
System of arrangement:
ACCESS AND USE
Language: English
Conditions governing access: Unrestricted, but only to be viewed on microfiche. Originals to be consulted only with written agreement from the Methodist Church.
Conditions governing reproduction: No publication without written permission. Apply to archivist in the first instance.
Physical characteristics: Some damage by bookworm.
Finding aids: Unpublished handlist.
ALLIED MATERIALS
Related material: The School of Oriental and African Studies holds the records of the Wesleyan Methodist Missionary Society (Ref: MMS/WMMS), including letters from individual missionaries, among them Freeman (Ref: MMS/WMMS West Africa Correspondence). SOAS also holds a transcript of a letter from Freeman to the Wesleyan missionary Robert Brooking, 1855, describing the work of the Cape Coast mission (Ref: MS 380587).
Copies: Published on microfiche by IDC Publishers (SOAS ref: Fiche Box Number Special Series 6-7). | {
"pile_set_name": "Pile-CC"
} |
<core:ActivityDesignerTemplate x:Class="Dev2.Activities.Designers2.WCFEndPoint.Small"
xmlns="http://schemas.microsoft.com/winfx/2006/xaml/presentation"
xmlns:x="http://schemas.microsoft.com/winfx/2006/xaml"
xmlns:mc="http://schemas.openxmlformats.org/markup-compatibility/2006"
xmlns:d="http://schemas.microsoft.com/expression/blend/2008"
xmlns:core="clr-namespace:Dev2.Activities.Designers2.Core"
xmlns:wcfEndPoint="clr-namespace:Dev2.Activities.Designers2.WCFEndPoint"
xmlns:designers2="clr-namespace:Dev2.Activities.Designers2"
xmlns:luna="clr-namespace:Warewolf.Studio.Themes.Luna;assembly=Warewolf.Studio.Themes.Luna"
MinWidth="250"
mc:Ignorable="d"
d:DesignWidth="250"
d:DataContext="{d:DesignInstance wcfEndPoint:WcfEndPointViewModel}">
<core:ActivityDesignerTemplate.Resources>
<ResourceDictionary>
<ResourceDictionary.MergedDictionaries>
<luna:SharedResourceDictionary Source="/Warewolf.Studio.Themes.Luna;component/Theme.xaml"/>
</ResourceDictionary.MergedDictionaries>
</ResourceDictionary>
</core:ActivityDesignerTemplate.Resources>
<Grid Margin="{StaticResource ElementBorder}">
<Grid.ColumnDefinitions>
<ColumnDefinition Width="*" />
<ColumnDefinition Width="Auto" />
</Grid.ColumnDefinitions>
<ItemsControl Grid.Column="0"
Grid.IsSharedSizeScope="True"
ItemsSource="{Binding Path=Properties}">
<ItemsControl.ItemTemplate>
<DataTemplate>
<Grid Margin="0,-4,0,-4">
<Grid.ColumnDefinitions>
<ColumnDefinition SharedSizeGroup="A" />
<ColumnDefinition SharedSizeGroup="B" />
</Grid.ColumnDefinitions>
<TextBlock Grid.Column="0" Margin="0,0,-2,0" Text="{Binding Path=Key, UpdateSourceTrigger=PropertyChanged}" />
<TextBlock Grid.Column="1" Text="{Binding Path=Value, UpdateSourceTrigger=PropertyChanged}" />
</Grid>
</DataTemplate>
</ItemsControl.ItemTemplate>
</ItemsControl>
<ContentControl Grid.Column="1"
VerticalAlignment="Bottom"
HorizontalAlignment="Right">
<ContentControl.ToolTip>
<ItemsControl ItemsSource="{Binding Path=DesignValidationErrors}"
ItemTemplate="{StaticResource ErrorListTemplate}" />
</ContentControl.ToolTip>
<Grid>
<Image Source="{Binding Path=WorstError, Converter={StaticResource ErrorTypeToImageConverter}}"
Visibility="{Binding Path=IsWorstErrorReadOnly, Converter={StaticResource BoolToVisibilityConverter}}"
Height="16"
Width="16"
Margin="0,0,4,4"
AutomationProperties.AutomationId="UI_ErrorsAdorner_AutoID" />
<Button Command="{Binding Path=FixErrorsCommand}"
Visibility="{Binding Path=IsWorstErrorReadOnly, Converter={StaticResource BoolToVisibilityConverterInverse}}"
Style="{StaticResource {x:Static ToolBar.ButtonStyleKey}}"
AutomationProperties.AutomationId="UI_FixErrors_AutoID">
<Button.ToolTip>
<ItemsControl ItemsSource="{Binding Path=DesignValidationErrors}" ItemTemplate="{StaticResource ErrorListTemplate}" />
</Button.ToolTip>
<Image Source="{Binding Path=WorstError, Converter={StaticResource ErrorTypeToImageConverter}}"
Height="16"
Width="16"
AutomationProperties.AutomationId="UI_ErrorsAdorner_AutoID" />
</Button>
<AutomationProperties.AutomationId>
<MultiBinding StringFormat="[UI_{0}_FixBtn_AutoID]">
<Binding Path="ModelItem.ServiceName" RelativeSource="{RelativeSource Self}" />
</MultiBinding>
</AutomationProperties.AutomationId>
</Grid>
</ContentControl>
</Grid>
</core:ActivityDesignerTemplate>
| {
"pile_set_name": "Github"
} |
# coding: utf-8
"""Information about nnvm."""
from __future__ import absolute_import
import sys
import os
import platform
if sys.version_info[0] == 3:
import builtins as __builtin__
else:
import __builtin__
def find_lib_path():
"""Find NNNet dynamic library files.
Returns
-------
lib_path : list(string)
List of all found path to the libraries
"""
if hasattr(__builtin__, "NNVM_BASE_PATH"):
base_path = __builtin__.NNVM_BASE_PATH
else:
base_path = os.path.dirname(os.path.abspath(os.path.expanduser(__file__)))
if hasattr(__builtin__, "NNVM_LIBRARY_NAME"):
lib_name = __builtin__.NNVM_LIBRARY_NAME
else:
lib_name = "nnvm_compiler" if sys.platform.startswith('win32') else "libnnvm_compiler"
api_path = os.path.join(base_path, '..', '..', 'lib')
cmake_build_path_win = os.path.join(base_path, '..', '..', '..', 'build', 'Release')
cmake_build_path = os.path.join(base_path, '..', '..', '..', 'build')
install_path = os.path.join(base_path, '..', '..', '..')
dll_path = [base_path, api_path, cmake_build_path_win, cmake_build_path,
install_path]
if sys.platform.startswith('linux') and os.environ.get('LD_LIBRARY_PATH', None):
dll_path.extend([p.strip() for p in os.environ['LD_LIBRARY_PATH'].split(":")])
elif sys.platform.startswith('darwin') and os.environ.get('DYLD_LIBRARY_PATH', None):
dll_path.extend([p.strip() for p in os.environ['DYLD_LIBRARY_PATH'].split(":")])
elif sys.platform.startswith('win32') and os.environ.get('PATH', None):
dll_path.extend([p.strip() for p in os.environ['PATH'].split(";")])
if sys.platform.startswith('win32'):
vs_configuration = 'Release'
if platform.architecture()[0] == '64bit':
dll_path.append(os.path.join(base_path, '..', '..', '..', 'build', vs_configuration))
dll_path.append(os.path.join(base_path, '..', '..', '..', 'windows', 'x64',
vs_configuration))
else:
dll_path.append(os.path.join(base_path, '..', '..', '..', 'build', vs_configuration))
dll_path.append(os.path.join(base_path, '..', '..', '..', 'windows', vs_configuration))
dll_path = [os.path.join(p, '%s.dll' % lib_name) for p in dll_path]
elif sys.platform.startswith('darwin'):
dll_path = [os.path.join(p, '%s.dylib' % lib_name) for p in dll_path]
else:
dll_path = [os.path.join(p, '%s.so' % lib_name) for p in dll_path]
lib_path = [p for p in dll_path if os.path.exists(p) and os.path.isfile(p)]
if not lib_path:
raise RuntimeError('Cannot find the files.\n' +
'List of candidates:\n' + str('\n'.join(dll_path)))
return lib_path
# current version
__version__ = "0.8.0"
| {
"pile_set_name": "Github"
} |
Droszów
Droszów is a village in the administrative district of Gmina Trzebnica, within Trzebnica County, Lower Silesian Voivodeship, in south-western Poland. Prior to 1945 it was in Germany.
It lies approximately west of Trzebnica, and north of the regional capital Wrocław.
References
Category:Villages in Trzebnica County | {
"pile_set_name": "Wikipedia (en)"
} |
/*
* Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except
* in compliance with the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software distributed under the License
* is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express
* or implied. See the License for the specific language governing permissions and limitations under
* the License.
*
* Copyright 2017 Nextdoor.com, Inc
*
*/
package com.nextdoor.bender.operation.json.key;
import java.util.HashSet;
import java.util.Map.Entry;
import java.util.Set;
import com.google.gson.JsonElement;
import com.google.gson.JsonObject;
import com.google.gson.JsonPrimitive;
import com.nextdoor.bender.operation.json.PayloadOperation;
/**
* In place recursively mutates a {@link JsonObject} keys to contain a suffix of the data type of
* the associated field value. Also replaces "." with "_" in keys.
*/
public class KeyNameOperation extends PayloadOperation {
protected void perform(JsonObject obj) {
Set<Entry<String, JsonElement>> entries = obj.entrySet();
Set<Entry<String, JsonElement>> orgEntries = new HashSet<Entry<String, JsonElement>>(entries);
for (Entry<String, JsonElement> entry : orgEntries) {
JsonElement val = entry.getValue();
obj.remove(entry.getKey());
String key = entry.getKey().toLowerCase().replaceAll("[ .]", "_");
if (val.isJsonPrimitive()) {
JsonPrimitive prim = val.getAsJsonPrimitive();
if (prim.isBoolean()) {
obj.add(key + "__bool", val);
} else if (prim.isNumber()) {
if (prim.toString().contains(".")) {
obj.add(key + "__float", val);
} else {
obj.add(key + "__long", val);
}
} else if (prim.isString()) {
obj.add(key + "__str", val);
}
} else if (val.isJsonObject()) {
obj.add(key, val);
perform(val.getAsJsonObject());
} else if (val.isJsonArray()) {
obj.add(key + "__arr", val);
}
}
}
}
| {
"pile_set_name": "Github"
} |
// go run mksyscall.go -tags freebsd,amd64 syscall_bsd.go syscall_freebsd.go syscall_freebsd_amd64.go
// Code generated by the command above; see README.md. DO NOT EDIT.
// +build freebsd,amd64
package unix
import (
"syscall"
"unsafe"
)
var _ syscall.Errno
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func getgroups(ngid int, gid *_Gid_t) (n int, err error) {
r0, _, e1 := RawSyscall(SYS_GETGROUPS, uintptr(ngid), uintptr(unsafe.Pointer(gid)), 0)
n = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func setgroups(ngid int, gid *_Gid_t) (err error) {
_, _, e1 := RawSyscall(SYS_SETGROUPS, uintptr(ngid), uintptr(unsafe.Pointer(gid)), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func wait4(pid int, wstatus *_C_int, options int, rusage *Rusage) (wpid int, err error) {
r0, _, e1 := Syscall6(SYS_WAIT4, uintptr(pid), uintptr(unsafe.Pointer(wstatus)), uintptr(options), uintptr(unsafe.Pointer(rusage)), 0, 0)
wpid = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func accept(s int, rsa *RawSockaddrAny, addrlen *_Socklen) (fd int, err error) {
r0, _, e1 := Syscall(SYS_ACCEPT, uintptr(s), uintptr(unsafe.Pointer(rsa)), uintptr(unsafe.Pointer(addrlen)))
fd = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func bind(s int, addr unsafe.Pointer, addrlen _Socklen) (err error) {
_, _, e1 := Syscall(SYS_BIND, uintptr(s), uintptr(addr), uintptr(addrlen))
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func connect(s int, addr unsafe.Pointer, addrlen _Socklen) (err error) {
_, _, e1 := Syscall(SYS_CONNECT, uintptr(s), uintptr(addr), uintptr(addrlen))
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func socket(domain int, typ int, proto int) (fd int, err error) {
r0, _, e1 := RawSyscall(SYS_SOCKET, uintptr(domain), uintptr(typ), uintptr(proto))
fd = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func getsockopt(s int, level int, name int, val unsafe.Pointer, vallen *_Socklen) (err error) {
_, _, e1 := Syscall6(SYS_GETSOCKOPT, uintptr(s), uintptr(level), uintptr(name), uintptr(val), uintptr(unsafe.Pointer(vallen)), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func setsockopt(s int, level int, name int, val unsafe.Pointer, vallen uintptr) (err error) {
_, _, e1 := Syscall6(SYS_SETSOCKOPT, uintptr(s), uintptr(level), uintptr(name), uintptr(val), uintptr(vallen), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func getpeername(fd int, rsa *RawSockaddrAny, addrlen *_Socklen) (err error) {
_, _, e1 := RawSyscall(SYS_GETPEERNAME, uintptr(fd), uintptr(unsafe.Pointer(rsa)), uintptr(unsafe.Pointer(addrlen)))
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func getsockname(fd int, rsa *RawSockaddrAny, addrlen *_Socklen) (err error) {
_, _, e1 := RawSyscall(SYS_GETSOCKNAME, uintptr(fd), uintptr(unsafe.Pointer(rsa)), uintptr(unsafe.Pointer(addrlen)))
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Shutdown(s int, how int) (err error) {
_, _, e1 := Syscall(SYS_SHUTDOWN, uintptr(s), uintptr(how), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func socketpair(domain int, typ int, proto int, fd *[2]int32) (err error) {
_, _, e1 := RawSyscall6(SYS_SOCKETPAIR, uintptr(domain), uintptr(typ), uintptr(proto), uintptr(unsafe.Pointer(fd)), 0, 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func recvfrom(fd int, p []byte, flags int, from *RawSockaddrAny, fromlen *_Socklen) (n int, err error) {
var _p0 unsafe.Pointer
if len(p) > 0 {
_p0 = unsafe.Pointer(&p[0])
} else {
_p0 = unsafe.Pointer(&_zero)
}
r0, _, e1 := Syscall6(SYS_RECVFROM, uintptr(fd), uintptr(_p0), uintptr(len(p)), uintptr(flags), uintptr(unsafe.Pointer(from)), uintptr(unsafe.Pointer(fromlen)))
n = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func sendto(s int, buf []byte, flags int, to unsafe.Pointer, addrlen _Socklen) (err error) {
var _p0 unsafe.Pointer
if len(buf) > 0 {
_p0 = unsafe.Pointer(&buf[0])
} else {
_p0 = unsafe.Pointer(&_zero)
}
_, _, e1 := Syscall6(SYS_SENDTO, uintptr(s), uintptr(_p0), uintptr(len(buf)), uintptr(flags), uintptr(to), uintptr(addrlen))
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func recvmsg(s int, msg *Msghdr, flags int) (n int, err error) {
r0, _, e1 := Syscall(SYS_RECVMSG, uintptr(s), uintptr(unsafe.Pointer(msg)), uintptr(flags))
n = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func sendmsg(s int, msg *Msghdr, flags int) (n int, err error) {
r0, _, e1 := Syscall(SYS_SENDMSG, uintptr(s), uintptr(unsafe.Pointer(msg)), uintptr(flags))
n = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func kevent(kq int, change unsafe.Pointer, nchange int, event unsafe.Pointer, nevent int, timeout *Timespec) (n int, err error) {
r0, _, e1 := Syscall6(SYS_KEVENT, uintptr(kq), uintptr(change), uintptr(nchange), uintptr(event), uintptr(nevent), uintptr(unsafe.Pointer(timeout)))
n = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func sysctl(mib []_C_int, old *byte, oldlen *uintptr, new *byte, newlen uintptr) (err error) {
var _p0 unsafe.Pointer
if len(mib) > 0 {
_p0 = unsafe.Pointer(&mib[0])
} else {
_p0 = unsafe.Pointer(&_zero)
}
_, _, e1 := Syscall6(SYS___SYSCTL, uintptr(_p0), uintptr(len(mib)), uintptr(unsafe.Pointer(old)), uintptr(unsafe.Pointer(oldlen)), uintptr(unsafe.Pointer(new)), uintptr(newlen))
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func utimes(path string, timeval *[2]Timeval) (err error) {
var _p0 *byte
_p0, err = BytePtrFromString(path)
if err != nil {
return
}
_, _, e1 := Syscall(SYS_UTIMES, uintptr(unsafe.Pointer(_p0)), uintptr(unsafe.Pointer(timeval)), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func futimes(fd int, timeval *[2]Timeval) (err error) {
_, _, e1 := Syscall(SYS_FUTIMES, uintptr(fd), uintptr(unsafe.Pointer(timeval)), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func fcntl(fd int, cmd int, arg int) (val int, err error) {
r0, _, e1 := Syscall(SYS_FCNTL, uintptr(fd), uintptr(cmd), uintptr(arg))
val = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func poll(fds *PollFd, nfds int, timeout int) (n int, err error) {
r0, _, e1 := Syscall(SYS_POLL, uintptr(unsafe.Pointer(fds)), uintptr(nfds), uintptr(timeout))
n = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Madvise(b []byte, behav int) (err error) {
var _p0 unsafe.Pointer
if len(b) > 0 {
_p0 = unsafe.Pointer(&b[0])
} else {
_p0 = unsafe.Pointer(&_zero)
}
_, _, e1 := Syscall(SYS_MADVISE, uintptr(_p0), uintptr(len(b)), uintptr(behav))
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Mlock(b []byte) (err error) {
var _p0 unsafe.Pointer
if len(b) > 0 {
_p0 = unsafe.Pointer(&b[0])
} else {
_p0 = unsafe.Pointer(&_zero)
}
_, _, e1 := Syscall(SYS_MLOCK, uintptr(_p0), uintptr(len(b)), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Mlockall(flags int) (err error) {
_, _, e1 := Syscall(SYS_MLOCKALL, uintptr(flags), 0, 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Mprotect(b []byte, prot int) (err error) {
var _p0 unsafe.Pointer
if len(b) > 0 {
_p0 = unsafe.Pointer(&b[0])
} else {
_p0 = unsafe.Pointer(&_zero)
}
_, _, e1 := Syscall(SYS_MPROTECT, uintptr(_p0), uintptr(len(b)), uintptr(prot))
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Msync(b []byte, flags int) (err error) {
var _p0 unsafe.Pointer
if len(b) > 0 {
_p0 = unsafe.Pointer(&b[0])
} else {
_p0 = unsafe.Pointer(&_zero)
}
_, _, e1 := Syscall(SYS_MSYNC, uintptr(_p0), uintptr(len(b)), uintptr(flags))
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Munlock(b []byte) (err error) {
var _p0 unsafe.Pointer
if len(b) > 0 {
_p0 = unsafe.Pointer(&b[0])
} else {
_p0 = unsafe.Pointer(&_zero)
}
_, _, e1 := Syscall(SYS_MUNLOCK, uintptr(_p0), uintptr(len(b)), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Munlockall() (err error) {
_, _, e1 := Syscall(SYS_MUNLOCKALL, 0, 0, 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func pipe2(p *[2]_C_int, flags int) (err error) {
_, _, e1 := RawSyscall(SYS_PIPE2, uintptr(unsafe.Pointer(p)), uintptr(flags), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Getcwd(buf []byte) (n int, err error) {
var _p0 unsafe.Pointer
if len(buf) > 0 {
_p0 = unsafe.Pointer(&buf[0])
} else {
_p0 = unsafe.Pointer(&_zero)
}
r0, _, e1 := Syscall(SYS___GETCWD, uintptr(_p0), uintptr(len(buf)), 0)
n = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func ioctl(fd int, req uint, arg uintptr) (err error) {
_, _, e1 := Syscall(SYS_IOCTL, uintptr(fd), uintptr(req), uintptr(arg))
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Access(path string, mode uint32) (err error) {
var _p0 *byte
_p0, err = BytePtrFromString(path)
if err != nil {
return
}
_, _, e1 := Syscall(SYS_ACCESS, uintptr(unsafe.Pointer(_p0)), uintptr(mode), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Adjtime(delta *Timeval, olddelta *Timeval) (err error) {
_, _, e1 := Syscall(SYS_ADJTIME, uintptr(unsafe.Pointer(delta)), uintptr(unsafe.Pointer(olddelta)), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func CapEnter() (err error) {
_, _, e1 := Syscall(SYS_CAP_ENTER, 0, 0, 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func capRightsGet(version int, fd int, rightsp *CapRights) (err error) {
_, _, e1 := Syscall(SYS___CAP_RIGHTS_GET, uintptr(version), uintptr(fd), uintptr(unsafe.Pointer(rightsp)))
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func capRightsLimit(fd int, rightsp *CapRights) (err error) {
_, _, e1 := Syscall(SYS_CAP_RIGHTS_LIMIT, uintptr(fd), uintptr(unsafe.Pointer(rightsp)), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Chdir(path string) (err error) {
var _p0 *byte
_p0, err = BytePtrFromString(path)
if err != nil {
return
}
_, _, e1 := Syscall(SYS_CHDIR, uintptr(unsafe.Pointer(_p0)), 0, 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Chflags(path string, flags int) (err error) {
var _p0 *byte
_p0, err = BytePtrFromString(path)
if err != nil {
return
}
_, _, e1 := Syscall(SYS_CHFLAGS, uintptr(unsafe.Pointer(_p0)), uintptr(flags), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Chmod(path string, mode uint32) (err error) {
var _p0 *byte
_p0, err = BytePtrFromString(path)
if err != nil {
return
}
_, _, e1 := Syscall(SYS_CHMOD, uintptr(unsafe.Pointer(_p0)), uintptr(mode), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Chown(path string, uid int, gid int) (err error) {
var _p0 *byte
_p0, err = BytePtrFromString(path)
if err != nil {
return
}
_, _, e1 := Syscall(SYS_CHOWN, uintptr(unsafe.Pointer(_p0)), uintptr(uid), uintptr(gid))
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Chroot(path string) (err error) {
var _p0 *byte
_p0, err = BytePtrFromString(path)
if err != nil {
return
}
_, _, e1 := Syscall(SYS_CHROOT, uintptr(unsafe.Pointer(_p0)), 0, 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Close(fd int) (err error) {
_, _, e1 := Syscall(SYS_CLOSE, uintptr(fd), 0, 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Dup(fd int) (nfd int, err error) {
r0, _, e1 := Syscall(SYS_DUP, uintptr(fd), 0, 0)
nfd = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Dup2(from int, to int) (err error) {
_, _, e1 := Syscall(SYS_DUP2, uintptr(from), uintptr(to), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Exit(code int) {
Syscall(SYS_EXIT, uintptr(code), 0, 0)
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func ExtattrGetFd(fd int, attrnamespace int, attrname string, data uintptr, nbytes int) (ret int, err error) {
var _p0 *byte
_p0, err = BytePtrFromString(attrname)
if err != nil {
return
}
r0, _, e1 := Syscall6(SYS_EXTATTR_GET_FD, uintptr(fd), uintptr(attrnamespace), uintptr(unsafe.Pointer(_p0)), uintptr(data), uintptr(nbytes), 0)
ret = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func ExtattrSetFd(fd int, attrnamespace int, attrname string, data uintptr, nbytes int) (ret int, err error) {
var _p0 *byte
_p0, err = BytePtrFromString(attrname)
if err != nil {
return
}
r0, _, e1 := Syscall6(SYS_EXTATTR_SET_FD, uintptr(fd), uintptr(attrnamespace), uintptr(unsafe.Pointer(_p0)), uintptr(data), uintptr(nbytes), 0)
ret = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func ExtattrDeleteFd(fd int, attrnamespace int, attrname string) (err error) {
var _p0 *byte
_p0, err = BytePtrFromString(attrname)
if err != nil {
return
}
_, _, e1 := Syscall(SYS_EXTATTR_DELETE_FD, uintptr(fd), uintptr(attrnamespace), uintptr(unsafe.Pointer(_p0)))
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func ExtattrListFd(fd int, attrnamespace int, data uintptr, nbytes int) (ret int, err error) {
r0, _, e1 := Syscall6(SYS_EXTATTR_LIST_FD, uintptr(fd), uintptr(attrnamespace), uintptr(data), uintptr(nbytes), 0, 0)
ret = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func ExtattrGetFile(file string, attrnamespace int, attrname string, data uintptr, nbytes int) (ret int, err error) {
var _p0 *byte
_p0, err = BytePtrFromString(file)
if err != nil {
return
}
var _p1 *byte
_p1, err = BytePtrFromString(attrname)
if err != nil {
return
}
r0, _, e1 := Syscall6(SYS_EXTATTR_GET_FILE, uintptr(unsafe.Pointer(_p0)), uintptr(attrnamespace), uintptr(unsafe.Pointer(_p1)), uintptr(data), uintptr(nbytes), 0)
ret = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func ExtattrSetFile(file string, attrnamespace int, attrname string, data uintptr, nbytes int) (ret int, err error) {
var _p0 *byte
_p0, err = BytePtrFromString(file)
if err != nil {
return
}
var _p1 *byte
_p1, err = BytePtrFromString(attrname)
if err != nil {
return
}
r0, _, e1 := Syscall6(SYS_EXTATTR_SET_FILE, uintptr(unsafe.Pointer(_p0)), uintptr(attrnamespace), uintptr(unsafe.Pointer(_p1)), uintptr(data), uintptr(nbytes), 0)
ret = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func ExtattrDeleteFile(file string, attrnamespace int, attrname string) (err error) {
var _p0 *byte
_p0, err = BytePtrFromString(file)
if err != nil {
return
}
var _p1 *byte
_p1, err = BytePtrFromString(attrname)
if err != nil {
return
}
_, _, e1 := Syscall(SYS_EXTATTR_DELETE_FILE, uintptr(unsafe.Pointer(_p0)), uintptr(attrnamespace), uintptr(unsafe.Pointer(_p1)))
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func ExtattrListFile(file string, attrnamespace int, data uintptr, nbytes int) (ret int, err error) {
var _p0 *byte
_p0, err = BytePtrFromString(file)
if err != nil {
return
}
r0, _, e1 := Syscall6(SYS_EXTATTR_LIST_FILE, uintptr(unsafe.Pointer(_p0)), uintptr(attrnamespace), uintptr(data), uintptr(nbytes), 0, 0)
ret = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func ExtattrGetLink(link string, attrnamespace int, attrname string, data uintptr, nbytes int) (ret int, err error) {
var _p0 *byte
_p0, err = BytePtrFromString(link)
if err != nil {
return
}
var _p1 *byte
_p1, err = BytePtrFromString(attrname)
if err != nil {
return
}
r0, _, e1 := Syscall6(SYS_EXTATTR_GET_LINK, uintptr(unsafe.Pointer(_p0)), uintptr(attrnamespace), uintptr(unsafe.Pointer(_p1)), uintptr(data), uintptr(nbytes), 0)
ret = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func ExtattrSetLink(link string, attrnamespace int, attrname string, data uintptr, nbytes int) (ret int, err error) {
var _p0 *byte
_p0, err = BytePtrFromString(link)
if err != nil {
return
}
var _p1 *byte
_p1, err = BytePtrFromString(attrname)
if err != nil {
return
}
r0, _, e1 := Syscall6(SYS_EXTATTR_SET_LINK, uintptr(unsafe.Pointer(_p0)), uintptr(attrnamespace), uintptr(unsafe.Pointer(_p1)), uintptr(data), uintptr(nbytes), 0)
ret = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func ExtattrDeleteLink(link string, attrnamespace int, attrname string) (err error) {
var _p0 *byte
_p0, err = BytePtrFromString(link)
if err != nil {
return
}
var _p1 *byte
_p1, err = BytePtrFromString(attrname)
if err != nil {
return
}
_, _, e1 := Syscall(SYS_EXTATTR_DELETE_LINK, uintptr(unsafe.Pointer(_p0)), uintptr(attrnamespace), uintptr(unsafe.Pointer(_p1)))
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func ExtattrListLink(link string, attrnamespace int, data uintptr, nbytes int) (ret int, err error) {
var _p0 *byte
_p0, err = BytePtrFromString(link)
if err != nil {
return
}
r0, _, e1 := Syscall6(SYS_EXTATTR_LIST_LINK, uintptr(unsafe.Pointer(_p0)), uintptr(attrnamespace), uintptr(data), uintptr(nbytes), 0, 0)
ret = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Fadvise(fd int, offset int64, length int64, advice int) (err error) {
_, _, e1 := Syscall6(SYS_POSIX_FADVISE, uintptr(fd), uintptr(offset), uintptr(length), uintptr(advice), 0, 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Faccessat(dirfd int, path string, mode uint32, flags int) (err error) {
var _p0 *byte
_p0, err = BytePtrFromString(path)
if err != nil {
return
}
_, _, e1 := Syscall6(SYS_FACCESSAT, uintptr(dirfd), uintptr(unsafe.Pointer(_p0)), uintptr(mode), uintptr(flags), 0, 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Fchdir(fd int) (err error) {
_, _, e1 := Syscall(SYS_FCHDIR, uintptr(fd), 0, 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Fchflags(fd int, flags int) (err error) {
_, _, e1 := Syscall(SYS_FCHFLAGS, uintptr(fd), uintptr(flags), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Fchmod(fd int, mode uint32) (err error) {
_, _, e1 := Syscall(SYS_FCHMOD, uintptr(fd), uintptr(mode), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Fchmodat(dirfd int, path string, mode uint32, flags int) (err error) {
var _p0 *byte
_p0, err = BytePtrFromString(path)
if err != nil {
return
}
_, _, e1 := Syscall6(SYS_FCHMODAT, uintptr(dirfd), uintptr(unsafe.Pointer(_p0)), uintptr(mode), uintptr(flags), 0, 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Fchown(fd int, uid int, gid int) (err error) {
_, _, e1 := Syscall(SYS_FCHOWN, uintptr(fd), uintptr(uid), uintptr(gid))
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Fchownat(dirfd int, path string, uid int, gid int, flags int) (err error) {
var _p0 *byte
_p0, err = BytePtrFromString(path)
if err != nil {
return
}
_, _, e1 := Syscall6(SYS_FCHOWNAT, uintptr(dirfd), uintptr(unsafe.Pointer(_p0)), uintptr(uid), uintptr(gid), uintptr(flags), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Flock(fd int, how int) (err error) {
_, _, e1 := Syscall(SYS_FLOCK, uintptr(fd), uintptr(how), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Fpathconf(fd int, name int) (val int, err error) {
r0, _, e1 := Syscall(SYS_FPATHCONF, uintptr(fd), uintptr(name), 0)
val = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func fstat(fd int, stat *stat_freebsd11_t) (err error) {
_, _, e1 := Syscall(SYS_FSTAT, uintptr(fd), uintptr(unsafe.Pointer(stat)), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func fstat_freebsd12(fd int, stat *Stat_t) (err error) {
_, _, e1 := Syscall(SYS_FSTAT_FREEBSD12, uintptr(fd), uintptr(unsafe.Pointer(stat)), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func fstatat(fd int, path string, stat *stat_freebsd11_t, flags int) (err error) {
var _p0 *byte
_p0, err = BytePtrFromString(path)
if err != nil {
return
}
_, _, e1 := Syscall6(SYS_FSTATAT, uintptr(fd), uintptr(unsafe.Pointer(_p0)), uintptr(unsafe.Pointer(stat)), uintptr(flags), 0, 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func fstatat_freebsd12(fd int, path string, stat *Stat_t, flags int) (err error) {
var _p0 *byte
_p0, err = BytePtrFromString(path)
if err != nil {
return
}
_, _, e1 := Syscall6(SYS_FSTATAT_FREEBSD12, uintptr(fd), uintptr(unsafe.Pointer(_p0)), uintptr(unsafe.Pointer(stat)), uintptr(flags), 0, 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func fstatfs(fd int, stat *statfs_freebsd11_t) (err error) {
_, _, e1 := Syscall(SYS_FSTATFS, uintptr(fd), uintptr(unsafe.Pointer(stat)), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func fstatfs_freebsd12(fd int, stat *Statfs_t) (err error) {
_, _, e1 := Syscall(SYS_FSTATFS_FREEBSD12, uintptr(fd), uintptr(unsafe.Pointer(stat)), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Fsync(fd int) (err error) {
_, _, e1 := Syscall(SYS_FSYNC, uintptr(fd), 0, 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Ftruncate(fd int, length int64) (err error) {
_, _, e1 := Syscall(SYS_FTRUNCATE, uintptr(fd), uintptr(length), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func getdirentries(fd int, buf []byte, basep *uintptr) (n int, err error) {
var _p0 unsafe.Pointer
if len(buf) > 0 {
_p0 = unsafe.Pointer(&buf[0])
} else {
_p0 = unsafe.Pointer(&_zero)
}
r0, _, e1 := Syscall6(SYS_GETDIRENTRIES, uintptr(fd), uintptr(_p0), uintptr(len(buf)), uintptr(unsafe.Pointer(basep)), 0, 0)
n = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func getdirentries_freebsd12(fd int, buf []byte, basep *uintptr) (n int, err error) {
var _p0 unsafe.Pointer
if len(buf) > 0 {
_p0 = unsafe.Pointer(&buf[0])
} else {
_p0 = unsafe.Pointer(&_zero)
}
r0, _, e1 := Syscall6(SYS_GETDIRENTRIES_FREEBSD12, uintptr(fd), uintptr(_p0), uintptr(len(buf)), uintptr(unsafe.Pointer(basep)), 0, 0)
n = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Getdtablesize() (size int) {
r0, _, _ := Syscall(SYS_GETDTABLESIZE, 0, 0, 0)
size = int(r0)
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Getegid() (egid int) {
r0, _, _ := RawSyscall(SYS_GETEGID, 0, 0, 0)
egid = int(r0)
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Geteuid() (uid int) {
r0, _, _ := RawSyscall(SYS_GETEUID, 0, 0, 0)
uid = int(r0)
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Getgid() (gid int) {
r0, _, _ := RawSyscall(SYS_GETGID, 0, 0, 0)
gid = int(r0)
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Getpgid(pid int) (pgid int, err error) {
r0, _, e1 := RawSyscall(SYS_GETPGID, uintptr(pid), 0, 0)
pgid = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Getpgrp() (pgrp int) {
r0, _, _ := RawSyscall(SYS_GETPGRP, 0, 0, 0)
pgrp = int(r0)
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Getpid() (pid int) {
r0, _, _ := RawSyscall(SYS_GETPID, 0, 0, 0)
pid = int(r0)
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Getppid() (ppid int) {
r0, _, _ := RawSyscall(SYS_GETPPID, 0, 0, 0)
ppid = int(r0)
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Getpriority(which int, who int) (prio int, err error) {
r0, _, e1 := Syscall(SYS_GETPRIORITY, uintptr(which), uintptr(who), 0)
prio = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Getrlimit(which int, lim *Rlimit) (err error) {
_, _, e1 := RawSyscall(SYS_GETRLIMIT, uintptr(which), uintptr(unsafe.Pointer(lim)), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Getrusage(who int, rusage *Rusage) (err error) {
_, _, e1 := RawSyscall(SYS_GETRUSAGE, uintptr(who), uintptr(unsafe.Pointer(rusage)), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Getsid(pid int) (sid int, err error) {
r0, _, e1 := RawSyscall(SYS_GETSID, uintptr(pid), 0, 0)
sid = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Gettimeofday(tv *Timeval) (err error) {
_, _, e1 := RawSyscall(SYS_GETTIMEOFDAY, uintptr(unsafe.Pointer(tv)), 0, 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Getuid() (uid int) {
r0, _, _ := RawSyscall(SYS_GETUID, 0, 0, 0)
uid = int(r0)
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Issetugid() (tainted bool) {
r0, _, _ := Syscall(SYS_ISSETUGID, 0, 0, 0)
tainted = bool(r0 != 0)
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Kill(pid int, signum syscall.Signal) (err error) {
_, _, e1 := Syscall(SYS_KILL, uintptr(pid), uintptr(signum), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Kqueue() (fd int, err error) {
r0, _, e1 := Syscall(SYS_KQUEUE, 0, 0, 0)
fd = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Lchown(path string, uid int, gid int) (err error) {
var _p0 *byte
_p0, err = BytePtrFromString(path)
if err != nil {
return
}
_, _, e1 := Syscall(SYS_LCHOWN, uintptr(unsafe.Pointer(_p0)), uintptr(uid), uintptr(gid))
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Link(path string, link string) (err error) {
var _p0 *byte
_p0, err = BytePtrFromString(path)
if err != nil {
return
}
var _p1 *byte
_p1, err = BytePtrFromString(link)
if err != nil {
return
}
_, _, e1 := Syscall(SYS_LINK, uintptr(unsafe.Pointer(_p0)), uintptr(unsafe.Pointer(_p1)), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Linkat(pathfd int, path string, linkfd int, link string, flags int) (err error) {
var _p0 *byte
_p0, err = BytePtrFromString(path)
if err != nil {
return
}
var _p1 *byte
_p1, err = BytePtrFromString(link)
if err != nil {
return
}
_, _, e1 := Syscall6(SYS_LINKAT, uintptr(pathfd), uintptr(unsafe.Pointer(_p0)), uintptr(linkfd), uintptr(unsafe.Pointer(_p1)), uintptr(flags), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Listen(s int, backlog int) (err error) {
_, _, e1 := Syscall(SYS_LISTEN, uintptr(s), uintptr(backlog), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func lstat(path string, stat *stat_freebsd11_t) (err error) {
var _p0 *byte
_p0, err = BytePtrFromString(path)
if err != nil {
return
}
_, _, e1 := Syscall(SYS_LSTAT, uintptr(unsafe.Pointer(_p0)), uintptr(unsafe.Pointer(stat)), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Mkdir(path string, mode uint32) (err error) {
var _p0 *byte
_p0, err = BytePtrFromString(path)
if err != nil {
return
}
_, _, e1 := Syscall(SYS_MKDIR, uintptr(unsafe.Pointer(_p0)), uintptr(mode), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Mkdirat(dirfd int, path string, mode uint32) (err error) {
var _p0 *byte
_p0, err = BytePtrFromString(path)
if err != nil {
return
}
_, _, e1 := Syscall(SYS_MKDIRAT, uintptr(dirfd), uintptr(unsafe.Pointer(_p0)), uintptr(mode))
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Mkfifo(path string, mode uint32) (err error) {
var _p0 *byte
_p0, err = BytePtrFromString(path)
if err != nil {
return
}
_, _, e1 := Syscall(SYS_MKFIFO, uintptr(unsafe.Pointer(_p0)), uintptr(mode), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func mknod(path string, mode uint32, dev int) (err error) {
var _p0 *byte
_p0, err = BytePtrFromString(path)
if err != nil {
return
}
_, _, e1 := Syscall(SYS_MKNOD, uintptr(unsafe.Pointer(_p0)), uintptr(mode), uintptr(dev))
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func mknodat(fd int, path string, mode uint32, dev int) (err error) {
var _p0 *byte
_p0, err = BytePtrFromString(path)
if err != nil {
return
}
_, _, e1 := Syscall6(SYS_MKNODAT, uintptr(fd), uintptr(unsafe.Pointer(_p0)), uintptr(mode), uintptr(dev), 0, 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func mknodat_freebsd12(fd int, path string, mode uint32, dev uint64) (err error) {
var _p0 *byte
_p0, err = BytePtrFromString(path)
if err != nil {
return
}
_, _, e1 := Syscall6(SYS_MKNODAT_FREEBSD12, uintptr(fd), uintptr(unsafe.Pointer(_p0)), uintptr(mode), uintptr(dev), 0, 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Nanosleep(time *Timespec, leftover *Timespec) (err error) {
_, _, e1 := Syscall(SYS_NANOSLEEP, uintptr(unsafe.Pointer(time)), uintptr(unsafe.Pointer(leftover)), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Open(path string, mode int, perm uint32) (fd int, err error) {
var _p0 *byte
_p0, err = BytePtrFromString(path)
if err != nil {
return
}
r0, _, e1 := Syscall(SYS_OPEN, uintptr(unsafe.Pointer(_p0)), uintptr(mode), uintptr(perm))
fd = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Openat(fdat int, path string, mode int, perm uint32) (fd int, err error) {
var _p0 *byte
_p0, err = BytePtrFromString(path)
if err != nil {
return
}
r0, _, e1 := Syscall6(SYS_OPENAT, uintptr(fdat), uintptr(unsafe.Pointer(_p0)), uintptr(mode), uintptr(perm), 0, 0)
fd = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Pathconf(path string, name int) (val int, err error) {
var _p0 *byte
_p0, err = BytePtrFromString(path)
if err != nil {
return
}
r0, _, e1 := Syscall(SYS_PATHCONF, uintptr(unsafe.Pointer(_p0)), uintptr(name), 0)
val = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Pread(fd int, p []byte, offset int64) (n int, err error) {
var _p0 unsafe.Pointer
if len(p) > 0 {
_p0 = unsafe.Pointer(&p[0])
} else {
_p0 = unsafe.Pointer(&_zero)
}
r0, _, e1 := Syscall6(SYS_PREAD, uintptr(fd), uintptr(_p0), uintptr(len(p)), uintptr(offset), 0, 0)
n = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Pwrite(fd int, p []byte, offset int64) (n int, err error) {
var _p0 unsafe.Pointer
if len(p) > 0 {
_p0 = unsafe.Pointer(&p[0])
} else {
_p0 = unsafe.Pointer(&_zero)
}
r0, _, e1 := Syscall6(SYS_PWRITE, uintptr(fd), uintptr(_p0), uintptr(len(p)), uintptr(offset), 0, 0)
n = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func read(fd int, p []byte) (n int, err error) {
var _p0 unsafe.Pointer
if len(p) > 0 {
_p0 = unsafe.Pointer(&p[0])
} else {
_p0 = unsafe.Pointer(&_zero)
}
r0, _, e1 := Syscall(SYS_READ, uintptr(fd), uintptr(_p0), uintptr(len(p)))
n = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Readlink(path string, buf []byte) (n int, err error) {
var _p0 *byte
_p0, err = BytePtrFromString(path)
if err != nil {
return
}
var _p1 unsafe.Pointer
if len(buf) > 0 {
_p1 = unsafe.Pointer(&buf[0])
} else {
_p1 = unsafe.Pointer(&_zero)
}
r0, _, e1 := Syscall(SYS_READLINK, uintptr(unsafe.Pointer(_p0)), uintptr(_p1), uintptr(len(buf)))
n = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Readlinkat(dirfd int, path string, buf []byte) (n int, err error) {
var _p0 *byte
_p0, err = BytePtrFromString(path)
if err != nil {
return
}
var _p1 unsafe.Pointer
if len(buf) > 0 {
_p1 = unsafe.Pointer(&buf[0])
} else {
_p1 = unsafe.Pointer(&_zero)
}
r0, _, e1 := Syscall6(SYS_READLINKAT, uintptr(dirfd), uintptr(unsafe.Pointer(_p0)), uintptr(_p1), uintptr(len(buf)), 0, 0)
n = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Rename(from string, to string) (err error) {
var _p0 *byte
_p0, err = BytePtrFromString(from)
if err != nil {
return
}
var _p1 *byte
_p1, err = BytePtrFromString(to)
if err != nil {
return
}
_, _, e1 := Syscall(SYS_RENAME, uintptr(unsafe.Pointer(_p0)), uintptr(unsafe.Pointer(_p1)), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Renameat(fromfd int, from string, tofd int, to string) (err error) {
var _p0 *byte
_p0, err = BytePtrFromString(from)
if err != nil {
return
}
var _p1 *byte
_p1, err = BytePtrFromString(to)
if err != nil {
return
}
_, _, e1 := Syscall6(SYS_RENAMEAT, uintptr(fromfd), uintptr(unsafe.Pointer(_p0)), uintptr(tofd), uintptr(unsafe.Pointer(_p1)), 0, 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Revoke(path string) (err error) {
var _p0 *byte
_p0, err = BytePtrFromString(path)
if err != nil {
return
}
_, _, e1 := Syscall(SYS_REVOKE, uintptr(unsafe.Pointer(_p0)), 0, 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Rmdir(path string) (err error) {
var _p0 *byte
_p0, err = BytePtrFromString(path)
if err != nil {
return
}
_, _, e1 := Syscall(SYS_RMDIR, uintptr(unsafe.Pointer(_p0)), 0, 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Seek(fd int, offset int64, whence int) (newoffset int64, err error) {
r0, _, e1 := Syscall(SYS_LSEEK, uintptr(fd), uintptr(offset), uintptr(whence))
newoffset = int64(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Select(n int, r *FdSet, w *FdSet, e *FdSet, timeout *Timeval) (err error) {
_, _, e1 := Syscall6(SYS_SELECT, uintptr(n), uintptr(unsafe.Pointer(r)), uintptr(unsafe.Pointer(w)), uintptr(unsafe.Pointer(e)), uintptr(unsafe.Pointer(timeout)), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Setegid(egid int) (err error) {
_, _, e1 := RawSyscall(SYS_SETEGID, uintptr(egid), 0, 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Seteuid(euid int) (err error) {
_, _, e1 := RawSyscall(SYS_SETEUID, uintptr(euid), 0, 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Setgid(gid int) (err error) {
_, _, e1 := RawSyscall(SYS_SETGID, uintptr(gid), 0, 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Setlogin(name string) (err error) {
var _p0 *byte
_p0, err = BytePtrFromString(name)
if err != nil {
return
}
_, _, e1 := Syscall(SYS_SETLOGIN, uintptr(unsafe.Pointer(_p0)), 0, 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Setpgid(pid int, pgid int) (err error) {
_, _, e1 := RawSyscall(SYS_SETPGID, uintptr(pid), uintptr(pgid), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Setpriority(which int, who int, prio int) (err error) {
_, _, e1 := Syscall(SYS_SETPRIORITY, uintptr(which), uintptr(who), uintptr(prio))
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Setregid(rgid int, egid int) (err error) {
_, _, e1 := RawSyscall(SYS_SETREGID, uintptr(rgid), uintptr(egid), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Setreuid(ruid int, euid int) (err error) {
_, _, e1 := RawSyscall(SYS_SETREUID, uintptr(ruid), uintptr(euid), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Setresgid(rgid int, egid int, sgid int) (err error) {
_, _, e1 := RawSyscall(SYS_SETRESGID, uintptr(rgid), uintptr(egid), uintptr(sgid))
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Setresuid(ruid int, euid int, suid int) (err error) {
_, _, e1 := RawSyscall(SYS_SETRESUID, uintptr(ruid), uintptr(euid), uintptr(suid))
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Setrlimit(which int, lim *Rlimit) (err error) {
_, _, e1 := RawSyscall(SYS_SETRLIMIT, uintptr(which), uintptr(unsafe.Pointer(lim)), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Setsid() (pid int, err error) {
r0, _, e1 := RawSyscall(SYS_SETSID, 0, 0, 0)
pid = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Settimeofday(tp *Timeval) (err error) {
_, _, e1 := RawSyscall(SYS_SETTIMEOFDAY, uintptr(unsafe.Pointer(tp)), 0, 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Setuid(uid int) (err error) {
_, _, e1 := RawSyscall(SYS_SETUID, uintptr(uid), 0, 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func stat(path string, stat *stat_freebsd11_t) (err error) {
var _p0 *byte
_p0, err = BytePtrFromString(path)
if err != nil {
return
}
_, _, e1 := Syscall(SYS_STAT, uintptr(unsafe.Pointer(_p0)), uintptr(unsafe.Pointer(stat)), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func statfs(path string, stat *statfs_freebsd11_t) (err error) {
var _p0 *byte
_p0, err = BytePtrFromString(path)
if err != nil {
return
}
_, _, e1 := Syscall(SYS_STATFS, uintptr(unsafe.Pointer(_p0)), uintptr(unsafe.Pointer(stat)), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func statfs_freebsd12(path string, stat *Statfs_t) (err error) {
var _p0 *byte
_p0, err = BytePtrFromString(path)
if err != nil {
return
}
_, _, e1 := Syscall(SYS_STATFS_FREEBSD12, uintptr(unsafe.Pointer(_p0)), uintptr(unsafe.Pointer(stat)), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Symlink(path string, link string) (err error) {
var _p0 *byte
_p0, err = BytePtrFromString(path)
if err != nil {
return
}
var _p1 *byte
_p1, err = BytePtrFromString(link)
if err != nil {
return
}
_, _, e1 := Syscall(SYS_SYMLINK, uintptr(unsafe.Pointer(_p0)), uintptr(unsafe.Pointer(_p1)), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Symlinkat(oldpath string, newdirfd int, newpath string) (err error) {
var _p0 *byte
_p0, err = BytePtrFromString(oldpath)
if err != nil {
return
}
var _p1 *byte
_p1, err = BytePtrFromString(newpath)
if err != nil {
return
}
_, _, e1 := Syscall(SYS_SYMLINKAT, uintptr(unsafe.Pointer(_p0)), uintptr(newdirfd), uintptr(unsafe.Pointer(_p1)))
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Sync() (err error) {
_, _, e1 := Syscall(SYS_SYNC, 0, 0, 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Truncate(path string, length int64) (err error) {
var _p0 *byte
_p0, err = BytePtrFromString(path)
if err != nil {
return
}
_, _, e1 := Syscall(SYS_TRUNCATE, uintptr(unsafe.Pointer(_p0)), uintptr(length), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Umask(newmask int) (oldmask int) {
r0, _, _ := Syscall(SYS_UMASK, uintptr(newmask), 0, 0)
oldmask = int(r0)
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Undelete(path string) (err error) {
var _p0 *byte
_p0, err = BytePtrFromString(path)
if err != nil {
return
}
_, _, e1 := Syscall(SYS_UNDELETE, uintptr(unsafe.Pointer(_p0)), 0, 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Unlink(path string) (err error) {
var _p0 *byte
_p0, err = BytePtrFromString(path)
if err != nil {
return
}
_, _, e1 := Syscall(SYS_UNLINK, uintptr(unsafe.Pointer(_p0)), 0, 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Unlinkat(dirfd int, path string, flags int) (err error) {
var _p0 *byte
_p0, err = BytePtrFromString(path)
if err != nil {
return
}
_, _, e1 := Syscall(SYS_UNLINKAT, uintptr(dirfd), uintptr(unsafe.Pointer(_p0)), uintptr(flags))
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func Unmount(path string, flags int) (err error) {
var _p0 *byte
_p0, err = BytePtrFromString(path)
if err != nil {
return
}
_, _, e1 := Syscall(SYS_UNMOUNT, uintptr(unsafe.Pointer(_p0)), uintptr(flags), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func write(fd int, p []byte) (n int, err error) {
var _p0 unsafe.Pointer
if len(p) > 0 {
_p0 = unsafe.Pointer(&p[0])
} else {
_p0 = unsafe.Pointer(&_zero)
}
r0, _, e1 := Syscall(SYS_WRITE, uintptr(fd), uintptr(_p0), uintptr(len(p)))
n = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func mmap(addr uintptr, length uintptr, prot int, flag int, fd int, pos int64) (ret uintptr, err error) {
r0, _, e1 := Syscall6(SYS_MMAP, uintptr(addr), uintptr(length), uintptr(prot), uintptr(flag), uintptr(fd), uintptr(pos))
ret = uintptr(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func munmap(addr uintptr, length uintptr) (err error) {
_, _, e1 := Syscall(SYS_MUNMAP, uintptr(addr), uintptr(length), 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func readlen(fd int, buf *byte, nbuf int) (n int, err error) {
r0, _, e1 := Syscall(SYS_READ, uintptr(fd), uintptr(unsafe.Pointer(buf)), uintptr(nbuf))
n = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func writelen(fd int, buf *byte, nbuf int) (n int, err error) {
r0, _, e1 := Syscall(SYS_WRITE, uintptr(fd), uintptr(unsafe.Pointer(buf)), uintptr(nbuf))
n = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func accept4(fd int, rsa *RawSockaddrAny, addrlen *_Socklen, flags int) (nfd int, err error) {
r0, _, e1 := Syscall6(SYS_ACCEPT4, uintptr(fd), uintptr(unsafe.Pointer(rsa)), uintptr(unsafe.Pointer(addrlen)), uintptr(flags), 0, 0)
nfd = int(r0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
// THIS FILE IS GENERATED BY THE COMMAND AT THE TOP; DO NOT EDIT
func utimensat(dirfd int, path string, times *[2]Timespec, flags int) (err error) {
var _p0 *byte
_p0, err = BytePtrFromString(path)
if err != nil {
return
}
_, _, e1 := Syscall6(SYS_UTIMENSAT, uintptr(dirfd), uintptr(unsafe.Pointer(_p0)), uintptr(unsafe.Pointer(times)), uintptr(flags), 0, 0)
if e1 != 0 {
err = errnoErr(e1)
}
return
}
| {
"pile_set_name": "Github"
} |
Year: 2011
We are on-track to deliver SP1 in mid-summer 2011 (here is the official announcement). We definitely recommend this update for all Office 2010 users. If you’re one of the few 64-bit Access users working with compiled Access databases (ACCDE, MDE, and ADE files), be sure to check out this KB article that details an update… | {
"pile_set_name": "Pile-CC"
} |
A current process to manufacture MEMS devices, such as micro-machined relays, involves the steps of depositing and patterning a copper or other electrically conductive sacrificial layer on a substrate, depositing and patterning a nickel or other electrically conductive structural layer at least partially over the sacrificial layer, and depositing and patterning a polymer insulating structural layer over the nickel structural layer. Then the copper sacrificial layer is removed to release the micro-machined parts. Since the copper is an electric conductor, incomplete etching of the copper can cause undesired electric shorts in the system in addition to preventing the structures from moving. | {
"pile_set_name": "USPTO Backgrounds"
} |
'use strict';
const tls = require('tls');
const utils = require('../utils');
const Client = require('../client');
/**
* Constructor for a Jayson TLS-encrypted TCP Client
* @class ClientTls
* @constructor
* @extends Client
* @param {Object|String} [options] Object goes into options for tls.connect, String goes into options.path. String option argument is NOT recommended.
* @return {ClientTls}
*/
const ClientTls = function(options) {
if(typeof(options) === 'string') {
options = {path: options};
}
if(!(this instanceof ClientTls)) {
return new ClientTls(options);
}
Client.call(this, options);
const defaults = utils.merge(this.options, {
encoding: 'utf8'
});
this.options = utils.merge(defaults, options || {});
};
require('util').inherits(ClientTls, Client);
module.exports = ClientTls;
ClientTls.prototype._request = function(request, callback) {
const self = this;
// copies options so object can be modified in this context
const options = utils.merge({}, this.options);
utils.JSON.stringify(request, options, function(err, body) {
if(err) {
return callback(err);
}
let handled = false;
const conn = tls.connect(options, function() {
conn.setEncoding(options.encoding);
// wont get anything for notifications, just end here
if(utils.Request.isNotification(request)) {
handled = true;
conn.end(body + '\n');
callback();
} else {
utils.parseStream(conn, options, function(err, response) {
handled = true;
conn.end();
if(err) {
return callback(err);
}
callback(null, response);
});
conn.write(body + '\n');
}
});
conn.on('error', function(err) {
self.emit('tcp error', err);
callback(err);
});
conn.on('end', function() {
if(!handled) {
callback();
}
});
});
};
| {
"pile_set_name": "Github"
} |
OomphHQ
To improve the safety of landing aeroplanes around the world
Jacobson Flare App
The Jacobson Flare technique for landing aeroplanes was developed by ex-Qantas pilot David Jacobson in 1987. In 2014, Captain Jacobson used Oomph to create an App for the Jacobson Flare – giving access to his teachings to pilots around the world.
Using the Oomph platform, Jacobson Flare produced an interactive App that acts as a manual for pilots wanting to learn his innovative and consistently reliable technique. The Oomph platform enabled the App with videos, calculators and two distinct presentations and has won him accolades in the industry for being so professional and beautifully presented.
Objectives:
Improve the safety of landing aeroplanes around the world.
Assist with education and improve landing techniques for pilots and enthusiasts.
The Jacobson Flare App includes:
A 350 slide interactive app with vital aim point and flare point calculator tools
Lots of graphics using images overlayed with triangulations to prove the point
Specially designed calculators
Videos – real world and simulator – to show the technique in action
Two distinct presentations in landscape and portrait
Results:
Sold hundreds of copies of the App in over 35 countries.
Received accolades and praise from the Aviation industry (pilots and magazines) for App brilliance.
Rated in Apple’s ‘Best New Apps’.
“We chose Oomph because of its brilliance and capabilities compared to other world-class publishing platforms. The professionalism and presentation of the App has won us accolades in the industry”
- David Jacobson, Founder,The Jacobson Flare
“One of the best Aviation Apps on the market”
- Australian Flying Magazine,Oct 2014
“The producers of this app have thought of everything an outstanding app needs to consist of!” | {
"pile_set_name": "Pile-CC"
} |
A check on the Star Wars project preparations at Disneyland today (2/19)
A check on the Stars Wars project from this afternoon (Friday Feb 19, 2016). These are cell phone pictures posted as I walked around the park, visit the full Disneyland Picture set for more taken with the SLR camera. The Rivers of America themselves look the same this week.
A closer look up river
From the Hungry Bear you can see more clearing this week and fences around some trees they are saving.
Moving around to the Big Thunder side only the rock work at the former entrance is left.
Related
About the Geek’s Blog @ disneygeek.com
This is a companion site to https://disneygeek.com featuring live pictures from the parks, reviews, movie news, and more from the world of Disney destinations, films, merchandise and beyond. For full picture sets, park news, trip reports and park guides visit our full site https://disneygeek.com
disneygeek.com is not affiliated with The Walt Disney Company in any way. The official Disney site is available at disney.com All Disney parks, attractions, characters, titles, etc. are registered trademarks of The Walt Disney Company. This site provides independent news articles, commentary, editorials, reviews, and unofficial guides primarily about the theme parks of the Walt Disney Company. | {
"pile_set_name": "Pile-CC"
} |
Physiological adaptation of Escherichia coli after transfer onto refrigerated ground meat and other solid matrices: a molecular approach.
Bacteria on meat are subjected to specific living conditions that differ drastically from typical laboratory procedures in synthetic media. This study was undertaken to determine the behavior of bacteria when transferred from a rich-liquid medium to solid matrices, as is the case during microbial process validation. Escherichia coli cultured in Brain-Heart Infusion (BHI) broth to different growth phases were inoculated in ground beef (GB) and stored at 5°C for 12 days or spread onto BHI agar and cooked meat medium (CMM), and incubated at 37°C for several hours. We monitored cell densities and the expression of σ factors and genes under their control over time. The initial growth phase of the inoculum influenced growth resumption after transfer onto BHI agar and CMM. Whatever the solid matrix, bacteria adapted to their new environment and did not perceive stress immediately after inoculation. During this period, the σ(E) and σ(H) regulons were not activated and rpoD mRNA levels adjusted quickly. The rpoS and gadA mRNA levels did not increase after inoculation on solid surfaces and displayed normal growth-dependent modifications. After transfer onto GB, dnaK and groEL gene expression was affected more by the low temperature than by the composition of a meat environment. | {
"pile_set_name": "PubMed Abstracts"
} |
The best style of advising to offer students has been questioned over and over. The
literature review revealed uncertainty related to national surveys of advisors and students and
encouraged smaller institutional reviews. The Academic Advising... | {
"pile_set_name": "Pile-CC"
} |
This subproject is one of many research subprojects utilizing the resources provided by a Center grant funded by NIH/NCRR. The subproject and investigator (PI) may have received primary funding from another NIH source, and thus could be represented in other CRISP entries. The institution listed is for the Center, which is not necessarily the institution for the investigator. Our goal for this project is to design and synthesize novel peptide and peptidomimetic inhibitors, specifically targeted against proteases central to the pathogenesis of malaria, schistosomiasis and hepatitis A. In the absence of X-ray structure of cysteine protease of our interest, we have simulated the enzyme model based on sequence homology to other cysteine proteases. We have designed and synthesized a wide variety of chemical compounds which include heteroaromatic inhibitors, peptide-based and peptidomimetic inhibitors. Mass spectrometry has played an important role in association with 1NMR, 13C NMR, 19F NMR and 31P NMR in characterizing these lead compounds of diverse chemical nature and background. Mass Spectrometry will remain an integral part of our research in analyzing the next generation of inhibitors. | {
"pile_set_name": "NIH ExPorter"
} |
Thymidylate synthase levels as a therapeutic and prognostic predictor in breast cancer.
5-Fluorouracil (5-FU) is a commonly used adjuvant therapeutic drug in treating breast cancer. 5-FU is metabolically converted to 5-fluorouracil-2'-deoxyuridine-5'-monophosphate-(FdUMP) which is believed to inhibit DNA synthesis in neoplastic cells by forming a tightly bound ternary complex with thymidylate synthase (TS). In the present study, we examined the possible relationship between TS levels and clinico-pathologic and prognostic features in breast disease. Mean TS levels of 2.9 pmol/g, 6.1 pmol/g, and 23.1 pmol/g were obtained in cases of benign breast disease (3 cases), primary breast cancer (115 cases), and recurrent tumors (4 cases), respectively. In breast cancer, mean TS levels significantly correlated with S-phase fraction (SPF), DNA polymerase a and lymphatic invasion. Thus, TS levels in breast cancer significantly reflected cell proliferation and malignancy. Regarding the survival rate, patients with TS values above 10 pmol/g showed an unfavorable prognosis. The effectiveness of adjuvant 5-FU derivatives chemotherapy was reflected in a higher disease-free survival rate in node (+) cases showing TS levels between 5 and 10 pmol/g (p < 0.1), but not in node (-) cases. In conclusion, TS levels in neoplastic tissues of the breast were highest in recurrent tumors, followed by those in primary cancer, benign breast disease and in breast cancer which reflected proliferative activity. Breast cancers with extremely high TS levels were accompanied by an unfavorable prognosis; however, those with moderately high TS levels tended to respond to adjuvant chemotherapy with 5-FU derivatives. | {
"pile_set_name": "PubMed Abstracts"
} |
Let a = 0.13 - 0.191. Round a to two decimal places.
-0.06
Let v = -1.7088 - -1.7. Round v to three dps.
-0.009
Let t = -8 - -7.7. Let f = t + -3.7. Let v = 4.00000028 + f. What is v rounded to 7 dps?
0.0000003
Let x = 32 + -31.58. Let n = 0.3 - x. Round n to one dp.
-0.1
Let u = -249749.93 - -249745.93000025. Let a = u + 4. Round a to seven dps.
0.0000003
Let r = -6 - -2. Let b(y) be the third derivative of 11*y**6/120 - y**5/10 - y**4/6 + 2*y**3/3 - 8*y**2. Let u be b(r). Round u to the nearest 100.
-800
Let g = -3.6 - -3.62. What is g rounded to one decimal place?
0
Let b = -0.31 + 0.31358. What is b rounded to 4 decimal places?
0.0036
Let d = -0.79 + 53.79. Let z = -0.1105609 - 52.8927391. Let s = z + d. Round s to 3 decimal places.
-0.003
Suppose 2*c - 45 = 2*x - x, -4*c - x + 81 = 0. Let d = c - 101. Round d to the nearest 10.
-80
Suppose 9*i + 29440 = -7*i. Round i to the nearest 1000.
-2000
Let q = -3.80157 + 3.8. Round q to 4 decimal places.
-0.0016
Let b(k) = 1743*k - 1. Let u be b(7). What is u rounded to the nearest 1000?
12000
Let c = 23.0620583 - 25.36205776. Let l = 0.01 + -2.31. Let k = c - l. Round k to seven decimal places.
0.0000005
Let h be 2792/(-2)*5/10. Let d = 458 + h. What is d rounded to the nearest 10?
-240
Suppose -5*j + 53 = 43. Suppose -4*m = -0*m - 20. Suppose j*i + 1415 = -5*d, 0*d = -m*i + 4*d - 3620. What is i rounded to the nearest 100?
-700
Let f = 10.53 - 2.52. Let h = 8 - f. Let v = -0.01092 - h. Round v to 4 dps.
-0.0009
Let l = 26.4 + -26.1168. Let s = l - 0.27. What is s rounded to 3 decimal places?
0.013
Let d = 4580.945 + -4565. Let r = d + -16. Let b = r + 0.006. Round b to 2 dps.
-0.05
Let v = 66817 - 66817.1700085. Let d = v + 0.17. Round d to 6 dps.
-0.000009
Let q = -0.2149 - -0.206. What is q rounded to 3 decimal places?
-0.009
Let n(f) = 57777*f - 7. Let q be n(-9). Round q to the nearest 100000.
-500000
Let d = -40519320690108215.00000001 - -40519320487271541. Let m = d + 202836676. Let c = m - 2. Round c to 7 decimal places.
0
Let a(v) = -18245*v**2 + 19*v - 4. Let g be a(-4). What is g rounded to the nearest one hundred thousand?
-300000
Let p be ((-72)/1)/((-4)/15154). Suppose 3*a = 3*j - 314994, 4*j = 3*a + p + 147222. Round j to the nearest ten thousand.
110000
Let i = -0.007005332239845 + -214511.046995077760155. Let b = -214466.054 - i. Let z = 45 - b. What is z rounded to seven decimal places?
-0.0000004
Let x = 24.07 - 93.51. Let c = x - -71. What is c rounded to 1 decimal place?
1.6
Let m = 19 + 15. Let r = m + -77. Let b = 43.00041 + r. What is b rounded to four decimal places?
0.0004
Let g = -39.3 - -24.2. Let i = 13 + g. Round i to the nearest integer.
-2
Let b be 2 + (3/1 - -1). Let o = b - 11. Let a(g) = -18401*g**3 - 6*g**2 - 6*g - 5. Let d be a(o). What is d rounded to the nearest 1000000?
2000000
Let c = -626555 + 1989633. Suppose c + 956922 = b. Round b to the nearest one hundred thousand.
2300000
Suppose 2*f = -8, -3*f - 10 = -2*q + 3*q. Suppose -q*s + 350000 = -4*s. What is s rounded to the nearest 10000?
-180000
Let l = -0.05 + -0.082. Let a = 0.658 - l. What is a rounded to one decimal place?
0.8
Let r(u) = -u**3 + 9*u**2 + 13*u - 6. Let m be r(10). Let i(b) = 180*b - m*b + 29*b. Let g be i(-2). Round g to the nearest one hundred.
-400
Let a(z) = 9*z**2 + 4*z + 2. Let l be a(-4). What is l rounded to the nearest one hundred?
100
Let f(d) = 4889*d**2 + d + 2. Let u be f(-3). Round u to the nearest ten thousand.
40000
Suppose -4 = -4*a + 4. Let p = a - -3. What is p rounded to the nearest 10?
10
Let b = 8247.56742963 + -8239.36743. Let x = -8.2 + b. Round x to 7 dps.
-0.0000004
Let b = -43.000037 - -43. What is b rounded to 5 dps?
-0.00004
Let v be (-17)/(-119) + (-559999)/(-7). Round v to the nearest 100000.
100000
Let v = 28.999548 - 29. Round v to four dps.
-0.0005
Let w = -309514 - -508514. Round w to the nearest ten thousand.
200000
Let k = 2011.9 - 1481. Let z = -564 + k. Round z to zero decimal places.
-33
Let u = 241.0000238 - 241. Round u to 6 decimal places.
0.000024
Let x = -4 + 3.5. Let h = 0.3 + x. Let i = h + 0.199996. What is i rounded to five dps?
0
Let m = -0.059 - 23.941. Let h = -24.000014 - m. What is h rounded to 6 decimal places?
-0.000014
Let p = -250 + 362. Suppose 5*o - o = -p. Round o to the nearest 10.
-30
Let v(w) = -3*w**3 - 2*w**2 - 4*w - 2. Let d be (-3)/9*2*3. Let f be v(d). What is f rounded to the nearest 10?
20
Let t be 72001/(-3) + 16/48. Round t to the nearest 10000.
-20000
Let p = 87 - 80.7. Round p to zero dps.
6
Let m = -1 - 0. Let w(h) = h**3 + 6*h**2 - 8*h - 5. Let p be w(-7). Let k be 29199998/p + 2 + m. Round k to the nearest one million.
15000000
Let j = 0.1 - -1. Let r = j + -1.10000065. Round r to seven dps.
-0.0000007
Let b = 3.22 + -1.2. Let l = 0.004 + b. Let p = 2 - l. Round p to two decimal places.
-0.02
Suppose 2*o = -2*o + 2*w - 1966, 0 = 4*o - 3*w + 1969. Round o to the nearest 100.
-500
Let n(w) = 24999*w - 1. Let u be n(-1). What is u rounded to the nearest ten thousand?
-30000
Let r = 7.9 + -7. Let s = r + -0.90000014. What is s rounded to 7 decimal places?
-0.0000001
Let o = 34.99999993 + -35. Round o to 7 dps.
-0.0000001
Let s = -481 + 481.229. Let n = 0.152 - s. Let f = -0.0769911 - n. Round f to six decimal places.
0.000009
Suppose -6 = -4*n + 2. Suppose n*o + 2*o - 3*l = 20, -o + 5*l = 12. Let c be 881/2 + (-4)/o. What is c rounded to the nearest 100?
400
Suppose 7444 = 3*n + 634. What is n rounded to the nearest 100?
2300
Let r = 35 - 35.000077. Round r to five decimal places.
-0.00008
Let n = 0.088 + -0.0880061. What is n rounded to six decimal places?
-0.000006
Let p = -4 - -6. Suppose -p*z + 6*z - 25199990 = 2*t, z + t = 6300005. What is z rounded to the nearest one million?
6000000
Let n = -4.399992 - -4.4. What is n rounded to five decimal places?
0.00001
Let z = 3295 + -1583. Let t = z + -1112. Round t to the nearest 100.
600
Let u = 34 - 39. Let h(q) = q**3 + 5*q**2 + 3*q + 4. Let x be h(-4). Let v be x/(-20) - (-498)/u. What is v rounded to the nearest 100?
-100
Let z = -540.1878 - -454.2. Let j = z + 86. What is j rounded to 3 decimal places?
0.012
Suppose -3*c - 1 = -4. Let p be 330 - (-3)/3*c. Let m = p + 409. What is m rounded to the nearest one hundred?
700
Let u be 3/((-4)/((-10094232)/9)). Suppose -3*r = -x - 198770 - u, 2*x + 1733260 = 5*r. Suppose r + 93348 = -5*p. Round p to the nearest 10000.
-90000
Let s = -2064.994 - -2064.3339949. Let m = s - -0.66. Round m to 6 dps.
-0.000005
Let j = 13.88 + -11. Let z = j - 4.11. Round z to one dp.
-1.2
Let c(s) = -s**2 - s + 2. Let p be c(-4). Let l = -19 - p. Let n = 79 + l. Round n to the nearest one hundred.
100
Let x = 15.67 - 16. Let y = 0.3394 + x. Round y to 3 decimal places.
0.009
Let p = 12422071 + -12422083.078387. Let g = -6.07839 - p. Let l = g - 6. What is l rounded to five decimal places?
0
Let n(y) = -3*y**2 + 122*y**3 - 7*y - y**2 - 1 + 6. Let k be n(7). Let a = k + -62606. What is a rounded to the nearest 10000?
-20000
Let n = -21.3 - 1.7. Let q = n - -29.7. Round q to the nearest integer.
7
Let r = 1.5 - 1.514. Round r to three decimal places.
-0.014
Suppose -5*l - 2*a + 265012 = a, -5*l + 4*a + 264984 = 0. Round l to the nearest 10000.
50000
Let c = 13 - 4.6. What is c rounded to 0 decimal places?
8
Let i = 0.300006 - 0.3. Round i to five decimal places.
0.00001
Let o be ((-7)/(-14))/((-1)/4). Let q be (-55)/1 + 1 + o. Round q to the nearest 10.
-60
Let w = -164.1 - -404. Let j = w - 228. Round j to the nearest integer.
12
Let r = 0.22 - 3.03. Let c = -3 - r. Let w = c - -0.2. What is w rounded to one decimal place?
0
Let r = -11811495005549 - -11811498023040.7200031. Let m = r + -3017492. Let o = -0.28 - m. What is o rounded to six decimal places?
-0.000003
Let z = 0.08 + -1.38. Let a = -5.9 + z. Round a to the nearest integer.
-7
Let x = 6491.93 + -6491.8760097. Let n = -0.054 + x. Round n to 6 decimal places.
-0.00001
Suppose -4*p - 9 = -3*p. Let n(z) = -z**2 - 5*z - 7. Let f be n(p). What is f rounded to the nearest 10?
-40
Let m = 35.9917 - 36. Round m to 3 dps.
-0.008
Let h = -2.94 - 0.06. Let w = h + 3.0015. Round w to three decimal places.
0.002
Let n = 3.34 - 2.9. Let d = -0.04 + n. Let g = -0.3998 + d. What is g round | {
"pile_set_name": "DM Mathematics"
} |
(**************************************************************************)
(* *)
(* OCaml *)
(* *)
(* Xavier Leroy, projet Cristal, INRIA Rocquencourt *)
(* *)
(* Copyright 1996 Institut National de Recherche en Informatique et *)
(* en Automatique. *)
(* *)
(* All rights reserved. This file is distributed under the terms of *)
(* the GNU Lesser General Public License version 2.1, with the *)
(* special exception on linking described in the file LICENSE. *)
(* *)
(**************************************************************************)
(** {1 Source code locations (ranges of positions), used in parsetree}
{b Warning:} this module is unstable and part of
{{!Compiler_libs}compiler-libs}.
*)
open Format
type t = Warnings.loc = {
loc_start: Lexing.position;
loc_end: Lexing.position;
loc_ghost: bool;
}
(** Note on the use of Lexing.position in this module.
If [pos_fname = ""], then use [!input_name] instead.
If [pos_lnum = -1], then [pos_bol = 0]. Use [pos_cnum] and
re-parse the file to get the line and character numbers.
Else all fields are correct.
*)
val none : t
(** An arbitrary value of type [t]; describes an empty ghost range. *)
val in_file : string -> t
(** Return an empty ghost range located in a given file. *)
val init : Lexing.lexbuf -> string -> unit
(** Set the file name and line number of the [lexbuf] to be the start
of the named file. *)
val curr : Lexing.lexbuf -> t
(** Get the location of the current token from the [lexbuf]. *)
val symbol_rloc: unit -> t
val symbol_gloc: unit -> t
(** [rhs_loc n] returns the location of the symbol at position [n], starting
at 1, in the current parser rule. *)
val rhs_loc: int -> t
val rhs_interval: int -> int -> t
val get_pos_info: Lexing.position -> string * int * int
(** file, line, char *)
type 'a loc = {
txt : 'a;
loc : t;
}
val mknoloc : 'a -> 'a loc
val mkloc : 'a -> t -> 'a loc
(** {1 Input info} *)
val input_name: string ref
val input_lexbuf: Lexing.lexbuf option ref
(* This is used for reporting errors coming from the toplevel.
When running a toplevel session (i.e. when [!input_name] is "//toplevel//"),
[!input_phrase_buffer] should be [Some buf] where [buf] contains the last
toplevel phrase. *)
val input_phrase_buffer: Buffer.t option ref
(** {1 Toplevel-specific functions} *)
val echo_eof: unit -> unit
val reset: unit -> unit
(** {1 Printing locations} *)
val rewrite_absolute_path: string -> string
(** rewrite absolute path to honor the BUILD_PATH_PREFIX_MAP
variable (https://reproducible-builds.org/specs/build-path-prefix-map/)
if it is set. *)
val absolute_path: string -> string
val show_filename: string -> string
(** In -absname mode, return the absolute path for this filename.
Otherwise, returns the filename unchanged. *)
val print_filename: formatter -> string -> unit
val print_loc: formatter -> t -> unit
val print_locs: formatter -> t list -> unit
(** {1 Toplevel-specific location highlighting} *)
val highlight_terminfo:
Lexing.lexbuf -> formatter -> t list -> unit
(** {1 Reporting errors and warnings} *)
(** {2 The type of reports and report printers} *)
type msg = (Format.formatter -> unit) loc
val msg: ?loc:t -> ('a, Format.formatter, unit, msg) format4 -> 'a
type report_kind =
| Report_error
| Report_warning of string
| Report_warning_as_error of string
| Report_alert of string
| Report_alert_as_error of string
type report = {
kind : report_kind;
main : msg;
sub : msg list;
}
type report_printer = {
(* The entry point *)
pp : report_printer ->
Format.formatter -> report -> unit;
pp_report_kind : report_printer -> report ->
Format.formatter -> report_kind -> unit;
pp_main_loc : report_printer -> report ->
Format.formatter -> t -> unit;
pp_main_txt : report_printer -> report ->
Format.formatter -> (Format.formatter -> unit) -> unit;
pp_submsgs : report_printer -> report ->
Format.formatter -> msg list -> unit;
pp_submsg : report_printer -> report ->
Format.formatter -> msg -> unit;
pp_submsg_loc : report_printer -> report ->
Format.formatter -> t -> unit;
pp_submsg_txt : report_printer -> report ->
Format.formatter -> (Format.formatter -> unit) -> unit;
}
(** A printer for [report]s, defined using open-recursion.
The goal is to make it easy to define new printers by re-using code from
existing ones.
*)
(** {2 Report printers used in the compiler} *)
val batch_mode_printer: report_printer
val terminfo_toplevel_printer: Lexing.lexbuf -> report_printer
val best_toplevel_printer: unit -> report_printer
(** Detects the terminal capabilities and selects an adequate printer *)
(** {2 Printing a [report]} *)
val print_report: formatter -> report -> unit
(** Display an error or warning report. *)
val report_printer: (unit -> report_printer) ref
(** Hook for redefining the printer of reports.
The hook is a [unit -> report_printer] and not simply a [report_printer]:
this is useful so that it can detect the type of the output (a file, a
terminal, ...) and select a printer accordingly. *)
val default_report_printer: unit -> report_printer
(** Original report printer for use in hooks. *)
(** {1 Reporting warnings} *)
(** {2 Converting a [Warnings.t] into a [report]} *)
val report_warning: t -> Warnings.t -> report option
(** [report_warning loc w] produces a report for the given warning [w], or
[None] if the warning is not to be printed. *)
val warning_reporter: (t -> Warnings.t -> report option) ref
(** Hook for intercepting warnings. *)
val default_warning_reporter: t -> Warnings.t -> report option
(** Original warning reporter for use in hooks. *)
(** {2 Printing warnings} *)
val formatter_for_warnings : formatter ref
val print_warning: t -> formatter -> Warnings.t -> unit
(** Prints a warning. This is simply the composition of [report_warning] and
[print_report]. *)
val prerr_warning: t -> Warnings.t -> unit
(** Same as [print_warning], but uses [!formatter_for_warnings] as output
formatter. *)
(** {1 Reporting alerts} *)
(** {2 Converting an [Alert.t] into a [report]} *)
val report_alert: t -> Warnings.alert -> report option
(** [report_alert loc w] produces a report for the given alert [w], or
[None] if the alert is not to be printed. *)
val alert_reporter: (t -> Warnings.alert -> report option) ref
(** Hook for intercepting alerts. *)
val default_alert_reporter: t -> Warnings.alert -> report option
(** Original alert reporter for use in hooks. *)
(** {2 Printing alerts} *)
val print_alert: t -> formatter -> Warnings.alert -> unit
(** Prints an alert. This is simply the composition of [report_alert] and
[print_report]. *)
val prerr_alert: t -> Warnings.alert -> unit
(** Same as [print_alert], but uses [!formatter_for_warnings] as output
formatter. *)
val deprecated: ?def:t -> ?use:t -> t -> string -> unit
(** Prints a deprecation alert. *)
val alert: ?def:t -> ?use:t -> kind:string -> t -> string -> unit
(** Prints an arbitrary alert. *)
(** {1 Reporting errors} *)
type error = report
(** An [error] is a [report] which [report_kind] must be [Report_error]. *)
val error: ?loc:t -> ?sub:msg list -> string -> error
val errorf: ?loc:t -> ?sub:msg list ->
('a, Format.formatter, unit, error) format4 -> 'a
val error_of_printer: ?loc:t -> ?sub:msg list ->
(formatter -> 'a -> unit) -> 'a -> error
val error_of_printer_file: (formatter -> 'a -> unit) -> 'a -> error
(** {1 Automatically reporting errors for raised exceptions} *)
val register_error_of_exn: (exn -> error option) -> unit
(** Each compiler module which defines a custom type of exception
which can surface as a user-visible error should register
a "printer" for this exception using [register_error_of_exn].
The result of the printer is an [error] value containing
a location, a message, and optionally sub-messages (each of them
being located as well). *)
val error_of_exn: exn -> [ `Ok of error | `Already_displayed ] option
exception Error of error
(** Raising [Error e] signals an error [e]; the exception will be caught and the
error will be printed. *)
exception Already_displayed_error
(** Raising [Already_displayed_error] signals an error which has already been
printed. The exception will be caught, but nothing will be printed *)
val raise_errorf: ?loc:t -> ?sub:msg list ->
('a, Format.formatter, unit, 'b) format4 -> 'a
val report_exception: formatter -> exn -> unit
(** Reraise the exception if it is unknown. *)
| {
"pile_set_name": "Github"
} |
Toward engineering a human neoendothelium with circulating progenitor cells.
Tissue-engineered vascular grafts may one day provide a solution to many of the limitations associated with using synthetic vascular grafts. However, identifying a suitable cell source and polymer scaffold to recreate the properties of a native blood vessel remains a challenge. In this work, we assess the feasibility of using endothelial progenitor cells (EPCs) found in circulating blood to generate a functional endothelium on poly(1,8-octanediol-co-citrate) (POC), a biodegradable elastomeric polyester. EPCs were isolated from human blood and biochemically differentiated into endothelial-like cells (HE-like) in vitro. The differentiated cell phenotype and function was confirmed by the appearance of the characteristic endothelial cell (EC) cobblestone morphology and positive staining for EC markers, von Willebrand factor, vascular endothelial cadherin, flk-1, and CD31. In addition, HE-like cells cultured on POC express endothelial nitric oxide synthase at levels comparable to aortic ECs. Furthermore, as with mature endothelial cells, HE-like cell populations show negligible expression of tissue factor. Similarly, HE-like cells produce and secrete prostacyclin and tissue plasminogen activator at levels comparable to venous and aortic ECs. When compared to fibroblast cells, HE-like cells cultured on POC show a decrease in the rate of plasma and whole-blood clot formation as well as a decrease in platelet adhesion. Finally, the data show that HE-like cells can withstand physiological shear stress of 10 dynes/cm(2) when cultured on POC-modified expanded poly(tetrafluoroethylene) vascular grafts. Collectively, these data are the foundation for future clinical studies in the creation of an autologous endothelial cell-seeded vascular graft. | {
"pile_set_name": "PubMed Abstracts"
} |
Q:
What's "bimodal" about BEC velocity distributions?
I was just reviewing some papers discussing Bose-einstein condensation, specifically "Creation of a Bose-condensed gas of 87Rb by laser cooling" by Hu et al., and I saw repeated references to the emergence of a "bimodal" velocity distribution being a hallmark of the BEC transition. However, I realized that none of the distributions look remotely bimodal, i.e. having two modes, i.e. prominent peaks or local maxima (See figure 2 here).
Trying to track this down a bit better, I realized that Wolfgang Ketterle's original paper also called their measured BEC velocity distribution bimodal (in the abstract no less!) (see figure 3 here).
As far as I can tell, with any reasonable reference to the normal definition of a "mode", all these distributions unambiguously have exactly 1 mode (at zero velocity), and are not bimodal. I get that the distribution is non-gaussian and that to fit the distribution they typically have a sum of two distributions, and maybe this is what they are trying to get at, but I feel that I'm missing something. What's "bimodal" about BEC velocity distributions?
A:
Bimodal refers to the fact that the velocity distribution is described by the sum of two terms, a Gaussian, which captures the behavior of the non-condensed fraction which looks thermal (follows Maxwell-Boltzmann distribution for velocity, hence the Gaussian velocity distribution) and a second component which is much more sharply peaked and captures the behavior of the macroscopic condensed fraction of atoms in the ground state of the trap.
One striking feature of the velocity distributions is as follows. Consider thermal (non-condensed) atoms in a non-isotropic trap. For long time of flight the thermal expansion will be isotropic since the velocity distrbutions in the three dimensions are thermalized together. Thus, you will see a spherical cloud even for an oblong trap. However, for the condensed BEC in the ground state you will observe anisotropy of the velocity distribution after long time of flight because the ground state has anisotropic velocity distribution.
Thus the two modes directly refer to the two different behaviors: Gaussian and thermal on the one hand and sharply peaked/condensed on the other hand.
| {
"pile_set_name": "StackExchange"
} |
About
This blog is concerned with the origins, history, spread and contemporary developments in relation to the Buggy surname/last name. I have posted some of the most interesting research as permanent pages and will blog about future developments as they come to fruition. I welcome documented information from anyone that can contribute to the study of the Buggy name.
Share this:
Like this:
One Response to About
HI Joe, I am from Sydney Australia,married to a Buggy girl,my wife’s GGG grandfather, Loughlin Buggy(B 1816) and his brother Thomas came to Sydney in 1841,they were from Ballyreget, County Kilkenny , Ireland,there were four brothers from this family who left Ireland,two came to Australia and two to USA ,so says the family history.
Loughlin and Thomas parents were James Buggy and Catherine,nee Ryan,and my research prior to 1841 indictes only two other persions of that ‘Buggy’ name ,had arrived in the colony,the two male persons were convicts.
I have not been able to trace any family history In Ireland as yet!
Regards
Mark Hillier
PS My Mothers ancestors are from Wicklow, the famous Byrne Clan,three Byrne boys were political prisoners sent to Australia in the early 1800’s,after the rebellion in 1798. | {
"pile_set_name": "Pile-CC"
} |
Preeclampsia is a life-threatening complication of pregnancy affecting maternal and fetal health of millions worldwide. Consequences of preeclampsia include both short- and long-term adverse health effects for both the mother and her baby. Despite decades of research providing evidence of a strong heritability component, specific genetic contributions have yet to be identified. A critical barrier to our understanding o the genetics of preeclampsia has been a nearly exclusive focus on maternal genetic contributions. The fetus is now known to be an active participant in pregnancy, and the central role of the placenta in the pathogenesis of preeclampsia implies that the fetus is likely to play a pivotal role in the disease process. The broad long-term goal of this research is to advance substantially our current and limited understanding of the genetic etiology of preeclampsia. Utilizing existing DNA from a previous case-control study of preeclampsia, together with genotyping data available in dbGAP on mother-baby pairs who have been similarly characterized on case and control status, we propose to build upon a preliminary genome-wide study of maternal genetic contributions to preeclampsia; this will be among the first studies to specifically examine fetal genetic contributions to preeclampsia and explore joint maternal-fetal gene effects. Utilizing contemporary, methodologically rigorous approaches, we will address the following specific aims: Aim 1: Develop a Pathway Analysis database for preeclampsia incorporating genetic information from published literature, expression databases, and biological pathways to identify an informative set of candidate fetal SNPs or CNVs for association studies of preeclampsia; Aim 2: To identify distinct fetal genetic variants associated with the maternal syndrome of preeclampsia. As a secondary aim, we propose to explore methodologies for identifying joint maternal-fetal genetic effects. The proposed research will develop and advance our understanding of the genetics of preeclampsia by studying the fetal contributions to preeclampsia using a combined genome-wide and candidate gene approach. In addition, we will explore individual and joint contributions of both maternal and fetal genotypes. Identifying distinct fetal genetic contributions to preeclampsia will inform biological understanding of the disease process, and could have a major impact on clinical practice by enabling early identification of at-risk pregnancies defined by fetal and maternal genetics. The data from this R21 will provide pilot data to inform development of an R01 to extend the findings of this study and to target and confirm the biological basis for genetic variants through placental expression studies and re-sequencing of relevant genes. The proposed research has tremendous potential to impact knowledge and practice in this area with its pioneering emphasis on fetal genetics and a carefully planned, interdisciplinary and integrated phased approach using state-of-the-art methodologies from the fields of statistical genetics, epidemiology, and clinical medicine. | {
"pile_set_name": "NIH ExPorter"
} |
1. Field of the Invention
This invention generally relates to a bicycle wheel. More specifically, the present invention relates to a reinforced rim of the bicycle wheel and a method of making the rim.
2. Background Information
Bicycling is becoming an increasingly more popular form of recreation as well as a means of transportation. Moreover, bicycling has become a very popular competitive sport for both amateurs and professionals. Whether the bicycle is used for recreation, transportation or competition, the bicycle industry is constantly improving the various components of the bicycle as well as the frame of the bicycle. One component that has been extensively redesigned is the bicycle wheel. Bicycle wheels are constantly being redesigned to be strong, lightweight and more aerodynamic in design as well as to be simple to manufacture and assemble.
There are many different types of bicycle wheels, which are currently available on the market. Most bicycle wheels have a hub portion, a plurality of spokes and an annular rim. The hub portion is attached to a part of the frame of the bicycle for relative rotation. The inner ends of the spokes are coupled to the hub and extend outwardly from the hub. The annular rim is coupled to the outer ends of the spokes and has an outer portion for supporting a pneumatic tire thereon. Typically, the spokes of the bicycle wheel are thin metal wire spokes. The ends of the hub are usually provided with flanges that are used to couple the spokes to the hub. In particular, holes are provided in the hub flanges. The wire spokes are usually bent on their inner end and provided with a flange that is formed in the shape of a nail head. The inner end is supported in one of the holes in one of the hub flanges. The outer ends of the spokes typically are provided with threads for engaging spoke nipples, which secure the outer ends of the wire spokes to holes in the rim.
The above types of wheels have been designed for use with tube tires or tubeless tires. Typically, tubeless tire wheels have an annular seal arranged to seal the spoke attachment openings of the rim. Rims designed for tube tires also often have an annular member covering the spoke attachments. In any case, these typical types of wheels can be expensive and complicated to manufacture and assemble. Moreover, these typical wheels are not always as strong and lightweight, as desired. Furthermore, with these typical wheels it can be difficult, complicated and/or expensive to replace a spoke or spokes.
In view of the above, it will be apparent to those skilled in the art from this disclosure that there exists a need for an improved bicycle rim for a bicycle wheel and method of making such a rim. This invention addresses this need in the art as well as other needs, which will become apparent to those skilled in the art from this disclosure. | {
"pile_set_name": "USPTO Backgrounds"
} |
Q:
Reading nmap output with Ruby (basic issue)
I want to build something that does a ping scan with nmap periodically to detect hosts showing up and dropping off the network. Is there an easy way to read the nmap output for Ruby? My preference is avoiding 3rd party libraries.
Thanks a lot!
A:
Have learned that simply employing backticks around the command will allow me to capture the output as a variable:
test = nmap -sP 192.168.1.0/24
p 'test:'
puts test.split("\n")
Seems to work perfectly. However, as bonsaiviking pointed out, it would be wise to investigate nmap's XML functionality.
| {
"pile_set_name": "StackExchange"
} |
Reliability of Oronasal Fistula Classification.
Oronasal fistula is an important complication of cleft palate repair that is frequently used to evaluate surgical quality, yet reliability of fistula classification has never been examined. The objective of this study was to determine the reliability of oronasal fistula classification both within individual surgeons and between multiple surgeons. Using intraoral photographs of children with repaired cleft palate, surgeons rated the location of palatal fistulae using the Pittsburgh Fistula Classification System. Intrarater and interrater reliability scores were calculated for each region of the palate. Eight cleft surgeons rated photographs obtained from 29 children. Within individual surgeons reliability for each region of the Pittsburgh classification ranged from moderate to almost perfect (κ = .60-.96). By contrast, reliability between surgeons was lower, ranging from fair to substantial (κ = .23-.70). Between-surgeon reliability was lowest for the junction of the soft and hard palates (κ = .23). Within-surgeon and between-surgeon reliability were almost perfect for the more general classification of fistula in the secondary palate (κ = .95 and κ = .83, respectively). This is the first reliability study of fistula classification. We show that the Pittsburgh Fistula Classification System is reliable when used by an individual surgeon, but less reliable when used among multiple surgeons. Comparisons of fistula occurrence among surgeons may be subject to less bias if they use the more general classification of "presence or absence of fistula of the secondary palate" rather than the Pittsburgh Fistula Classification System. | {
"pile_set_name": "PubMed Abstracts"
} |
Tag Archives: #localgov
Post navigation
In March, the London Borough of Croydon was named Digital Council of the Year at the Local Government Chronicle (LGC) Awards – a showcase event for sharing innovation and improvement in local government.
The LGC Award judges commended Croydon Council’s ‘no one gets left behind mantra’ and highlighted that they were impressed with:
“the breadth of its community empowerment and the range of digital activities, which had a material impact on changing people’s lives in different ways.”
Council leader Tony Newman said that he was ‘absolutely delighted’ that Croydon had been recognised as a digital leader in local government. However, he also congratulated the other shortlisted councils, explaining that:
“These awards are as much about sharing good practice as they are receiving the prizes, and not only will Croydon continue to share our learning with other councils, but we will also look at what others have done to see if we can improve still further.”
My Account
Introducing new online services has been a major success for Croydon Council. In-person visits to the council have been reduced by 30% each year, reducing staffing costs and increasing customer satisfaction from 57% to 98%.
My Account, a service which helps people access online council services (without having to re-enter their personal information) is just one example of this success. Launched in July 2013, the service now has 180,000 registered users – over half of Croydon’s population – and the My Croydon app has been downloaded almost 20,000 times.
My Account and My Croydon allow people to carry out a variety of tasks, including:
making council tax payments;
booking appointments;
reporting problems; and
registering for school admissions.
These services alone have saved the council £8m, and it’s expected that a further £1.2m of savings will be made in the coming year.
The solution used is ‘government certified’ and used by 30 out of 33 of London’s boroughs. This level of security is particularly important for local councils who often share sensitive data such as social care records.
Apart from the benefits to the environment, becoming paperless has saved the council £100,000 per year on storage costs alone.
Digital inclusion
To ensure everyone can participate in the digital age, Croydon Council partnered with Doteveryone (formerly GO-ON UK) to help people who struggle with technology or lack digital skills.
The Go ON Croydon project was introduced to support the 85,000 people in Croydon who do not have basic digital skills. Reaching out to organisations such as community and faith groups, this year-long programme set out to highlight and promote the council’s digital skills initiatives. One scheme promoted by the project was digital zones. Staffed by volunteer digital champions and located in banks or retail stores, these physical spaces provided places where people could go to have their questions answered and to improve their basic skills.
The Go ON Croydon project clearly made an impact, with digital skills levels in Croydon increasing from 70% to 79% within one year.
The council also made the decision to distribute 1,000 of its old computers to community groups, providing further opportunities for people to develop their digital skills.
TMRW
At the opposite end of the technology spectrum, the council has opened up a state of the art technology hub, known as TMRW, aimed at encouraging tech start-ups to locate to Croydon.
The hub, which was part funded by £927,940 from the Mayor of London’s Regeneration Fund, offers entrepreneurs and small businesses affordable co-working and office space, as well as other facilities such as event space, Gigabit internet services, and access to a 3D printing lab.
TMRW has been described as the UK’s official “fastest growing Tech City” and is home to a range of companies including one person entrepreneurs, developing virtual reality simulators and games, rockstar vloggers with over 1 million followers, and technology companies working with Samsung to develop the latest in connected car technologies.
Croydon iStreet
Recently, Croydon have partnered with The Architects’ Journal (AJ) to create a competition which encourages proposals for innovative technologies that will “transform the public realm”.
With a guide budget of £2 million, the proposal should help the council:
improve the area’s challenging post-war streetscape;
upgrade pedestrian movement and wayfinding; and
provide visitors with information about upcoming local events.
Councillor Alison Butler explains that Croydon will be undergoing significant redevelopment in the coming years, but highlights that this competition provides an opportunity to use technology to make Croydon a better place to live.
Final thoughts
To address a problem, you have to first admit that you have one. For most local councils, finding problems is not difficult: whether that’s substantial budget cuts, increased demand on services, a lack of digital skills, or outdated and antiquated processes and structures.
The answer to many of these problems is to introduce digital technologies and to encourage digital participation from local people, as well as council employees. This is what Croydon Council have been successful at doing over the past few years.
Local councils who are still at the beginning of their digital transformation journey should look to Croydon, to learn from their experience, and to see how they could become a successful digital council.
Follow us on Twitterto see what developments in public and social policy are interesting our research team. If you found this article interesting, you may also like to read our other digital articles.
Daniel MacIntyre, from Glasgow City Marketing Bureau (the city’s official marketing organisation), opened the event by highlighting Glasgow’s ambitious target of increasing visitor numbers from two million to three million by 2023.
To achieve this goal, Mr MacIntyre explained that the city would be looking to develop a city data plan, which would outline how the city should use data to solve its challenges and to provide a better experience for tourists.
In many ways, Glasgow’s tourism goal set the context for the presentations that followed, providing the attendees – who included professionals from the technology and tourism sectors, as well as academia and local government – with an understanding of the city’s data needs and how it could be used.
Identifying the problem
From very early on, there was a consensus in the room that tourism bodies have to identify their problems before seeking out data.
A key challenge for Glasgow, Mr MacIntyre explained, was a lack of real time data. Much of the data available to the city’s marketing bureau was historic (sometimes three years old), and gathered through passenger or visitor experience surveys. It was clear that Mr MacIntrye felt that this approach was rather limiting in the 21st century, highlighting that businesses, including restaurants, attractions, and transport providers were all collecting data, and if marketing authorities could work in collaboration and share this data, it could bring a number of benefits.
In essence, Mr MacIntyre saw Glasgow using data in two ways. Firstly, to provide a range of insights, which could support decision making in destination monitoring, development, and marketing. For instance, having data on refuse collection could help ensure timely collections and cleaner streets. A greater understanding of restaurant, bar, and event attendances could help develop Glasgow’s £5.4 million a year night time economy by producing more informed licensing policies. And the effectiveness of the city’s marketing could be improved by capturing insights from social media data, creating more targeted campaigns.
Secondly, data could be used to monitor or evaluate events. For example, the impact of sporting events such as Champions League matches – which increase visitor numbers to Glasgow and provide an economic boost to the city – could be far better understood.
Urban Big Data Centre (UBDC)
One potential solution to Glasgow City Marketing Bureau’s need for data may be organisations such as the Urban Big Data Centre.
The UBCD is also involved in a number of projects, including the integrated Multimedia City Data (iMCD) project. One interesting aspect of this work involved the extraction of Glasgow-related data streams from multiple online sources, particularly Twitter. The data covers a one year period (1 Dec 2015 – 30 Nov 2015) and could provide insights into the behaviour of citizens or their reaction to particular events; all of which, could be potentially useful for tourism bodies.
Predictive analytics
Predictive analytics, i.e. the combination of data and statistical techniques to make predictions about future events, was a major theme of the day.
Faical Allou, Business Development Manager at Skyscanner, and Dr John Wilson, Senior Lecturer at the University of Strathclyde, presented their Predictive Analytics for Tourism project, which attempted to predict future hotel occupancy rates for Glasgow using travel data from Glasgow and Edinburgh airport.
Glasgow City Marketing Bureau also collaborated on the project – which is not too surprising as there a number of useful applications for travel data, including helping businesses respond better to changing events, understanding the travel patterns of visitors to Glasgow, and recommending personalised products and services that enhance the traveller’s experience (increasing visitor spending in the city).
However, Dr Wilson advised caution, explaining that although patterns could be identified from the data (including spikes in occupancy rates), there were limitations due to the low number of datasets available. In addition, one delegate, highlighted a ‘data gap’, suggesting that the data didn’t cover travellers who flew into Glasgow or Edinburgh but then made onward journeys to other cities.
Uber
Technology-enabled transport company, Uber, has been very successful at using data to provide a more customer oriented service. Although much of Uber’s growth has come from its core app – which allows users to hire a taxi service – they are also introducing innovative new services and integrating their app into platforms such as Google Maps, making it easier for customers to request taxi services.
And in some locations, whilst Uber users are travelling, they will receive local maps, as well as information on nearby eateries through their UberEATS app.
Uber Movement, an initiative which provides access to the anonymised data of over two billion urban trips, has the potential to improve urban planning in cities. It includes data which helps tourism officials, city planners, policymakers and citizens understand the impact of rush hours, events, and road closures in their city.
Chris Yiu, General Manager at Uber, highlighted that people lose weeks of their lives waiting in traffic jams. He suggested that the future of urban travel will involve a combination of good public transport services and car sharing services, such as uberPOOL (an app which allows the user to find local people who are going in their direction), providing the first and last mile of journeys.
Final thoughts
The event was a great opportunity to find out about the data challenges for tourism bodies, as well as initiatives that could potentially provide solutions.
Although a number of interesting issues were raised throughout the day, two key points kept coming to the forefront. These were:
The need to clarify problems and outcomes – Many felt it was important that cities identified the challenges they were looking to address. This could be looked at in many ways, from addressing the need for more real-time data, to a more outcome-based approach, such as the need to achieve a 20% reduction in traffic congestion.
Industry collaboration – Much of a city’s valuable data is held by private sector organisations. It’s therefore important that cities (and their tourism bodies) encourage collaboration for the mutual benefit of all partners involved. Achieving a proposition that provides value to industry will be key to achieving smarter tourism for cities.
Follow us on Twitterto see what developments in public and social policy are interesting our research team. If you enjoyed this article, you may also be interested in:
Data has the potential to revolutionise the delivery of local services. Just like the private sector – where organisations such as Amazon and Facebook have leveraged user data – local councils have the opportunity to reap significant benefits from analysing their vast silos of data. Improving efficiencies, increasing levels of transparency, and providing services which better meet people’s needs, are just some of the potential benefits.
Although many councils are still at the early stages of utilising their data, some are innovating and introducing successful data initiatives.
Wise Councils
In November 2016, the charity NESTA published a report highlighting the most ‘pioneering’ uses of data in local government. The report emphasised that most local services would benefit from data analysis and that a ‘problem-oriented’ approach is required to generate insights that have an impact on services. The case studies included:
Kent County Council
Kent County Council (KCC), alongside Kent’s seven Clinical Commissioning Groups (CCGs), have created the Kent Integrated Dataset (KID) – one of the largest health and care databases in the UK, covering the records of 1.5 million people. The core requirement of the dataset was to link data from multiple sources to a particular individual, i.e. that information held about a person in hospital, should also be linked to records held by other public bodies such as GPs or the police.
This integrated dataset has enabled the council to run sophisticated data analysis, helping them to evaluate the effectiveness of services and to inform decisions on where to locate services. For example, Kent’s Public Health team investigated the impact of home safety visits by Kent Fire and Rescue Service (KFRS) on attendances at accident and emergency services (A&E). The data suggested that home safety visits did not have a significant impact on an individual’s attendance at A&E.
Leeds City Council
Leeds City Council have focused their efforts on supporting open innovation – the concept that good ideas may come from outside an organisation. This involved the initiatives:
Data Mill North (DMN) – this collaborative project between the city council and private sector is the city’s open data portal (growing from 50 datasets in 2014 to over 300 data sets, in over 40 different organisations). To encourage a culture change, Leeds City Council introduced an ‘open by default’ policy in November 2015, requiring all employees to make data available to the public. A number of products have been developed from data published on DMN, including StreetWise.life, which provides local information online, such as hospital locations, road accidents, and incidents of crime.
Innovation Labs – the city has introduced a series of events that bring together local developers and ‘civic enthusiasts’ to tackle public policy problems. Leeds City Council has also provided funding, allowing some ideas to be developed into prototypes. For example, the waste innovation lab created the app, Leeds Bins, which informs residents which days their bins should be put out for collection.
Newcastle City Council
Newcastle City Council have taken a data-led approach to the redesign of their children’s services. The Family Insights Programme (FIP) used data analysis to better understand the demand and expenditure patterns in the children’s social care system. Its aim was to use this insight to support the redesign of services and to reduce the city’s high re-referrals and the number of children becoming looked-after.
The FIP uses data in three different ways:
Grouping families by need – The council have undertaken cluster analysis to identify common grouping of concerning behaviours, such as a child’s challenging behaviour or risk of physical abuse. When a child is referred to long term social work, senior social workers analyse the concerning behaviours of the case, and then make a referral to a specialist social work unit. Since introducing this data-led approach, social work units have been organised based on needs and concerning behaviours. This has resulted in social workers becoming specialists in supporting particular needs and behaviours, providing greater expertise in the management of cases.
Embedding data analysts – Each social work unit has an embedded data analyst, who works alongside social workers. Their role is to test what works, as well as providing insights into common patterns for families.
Enabling intelligent case management – Social workers have access to ChildSat, a tool which social workers use to help manage their cases. It also has the capability to monitor the performance of individual social work units.
Investing in data
Tom Symons, principal researcher in government innovation at Nesta, has suggested that councils need support from central government if they are to accelerate their use of data. He’s suggested that £4 million – just £1% of the Government Digital Service (GDS) budget – is spent on pilot schemes to embed data specialists into councils.
Mr Symons has also proposed that all combined authorities should develop Offices of Data Analytics, to support data analysis across counties. Over the past few months, Nesta has been working on this idea with the Greater London Authority, and a number of London boroughs, to tackle the problem of unlicensed HMOs (Houses in Multiple Occupation). Early insights highlight that data analytics could be used to show that new services would provide value for money.
Final thoughts
After successive years of cuts, there has never been a greater need for adopting a data-led approach. Although there are undoubtedly challenges in using council data – including changing a culture where data sharing is not the norm, and data protection – the above examples highlight that overcoming these challenges is achievable, and that data analysis can be used to bring benefits to local councils.
Follow us on Twitterto see what developments in public and social policy are interesting our research team. If you found this article interesting, you may also like to read our other digital articles.
As cities realise the need to improve sustainability, many are turning to innovative technologies to address challenges such as traffic congestion and air pollution. Here, the ‘smart agenda’, with its focus on technology and urban infrastructure, overlaps with the ‘sustainability agenda’ – usually associated with energy, waste management, and transport.
In 2015, an international research project – coordinated by the University of Exeter and involving teams from the UK, China, the Netherlands, France, and Germany – was launched to investigative how smart-eco initiatives can be used to promote the growth of the green economy. As part of this work, the report ‘Smart-eco cities in the UK: trends and city profiles 2016’ was published.
Below we’ve highlighted some interesting case studies from this report.
Glasgow
Glasgow’s smart city approach has been described as ‘opportunistic’ (as opposed to strategy-led) by the report’s authors. New initiatives are often linked to creative organisations/individuals and competition funding, such as Future City Glasgow, which was awarded £24 million by the Technology Strategy Board (now Innovate UK).
Nonetheless, this has helped Glasgow become a smart city leader, not just in the UK, but globally.
Almost half of the £24 million Innovate UK funding was spent on the Operations Centre, located in Glasgow’s east end. The new state-of-the-art facility integrates traffic and public safety management systems, and brings together public space CCTV, security for the city council’s museums and art galleries, traffic management and police intelligence. As well as helping the police and emergency services, the centre can prioritise buses through traffic (when there are delays) and has recently supported the Clean Glasgow initiative, a project to tackle local environmental issues, such as littering.
Intelligent street lighting was also a major part of Future City Glasgow. Three sections of the city have been fitted with new lighting: a walkway along the River Clyde; a partly pedestrianised section of Gordon Street; and Merchant City, a popular retail and leisure district. The new lighting includes built-in sensors which provide real-time data on sound levels, air quality, and pedestrian footfall. ‘Dynamic’ lights, which use motion sensors to vary lighting – increasing levels when pedestrians walk by – have also been introduced.
London
London’s smart city programme is linked to the challenges it faces as a leading global city. Its need for continuous growth and remaining competitive has to be balanced with providing infrastructure, services, and effective governance.
The Greater London Authority (GLA) is behind both the strategy, through the Smart London Board, and the practical delivery of various activities. Much of their work focuses on encouraging collaboration between business, the technology sector, and the residents of London. For example, the London Datastore, which includes over 650 governmental (and some non-governmental) data sets, plays an important role in ensuring the city’s data is freely available to all. Visitors can view a wide variety of statistics and data graphics, on areas such as recycling rates, numbers of bicycles hired, and carbon dioxide emission levels by sector.
In 2014, the Smart London District Network was established to explore how technology could be used in four regeneration projects: Croydon; Elephant & Castle; Imperial West; and the London Olympic Park. To support this, the Institute for Sustainability was commissioned to run a competition asking technology innovators to pitch innovative ideas for these projects. Winners of this competition included the company Stickyworld, who created an online platform which supports stakeholder engagement through a virtual environment, and Placemeter, who developed an intelligent online platform which analyses the data taken from video feeds and provides predictive insights.
Manchester
Recently, the City of Manchester Council consolidated their smart city initiatives into the Smarter City Programme. The Smart-eco cities report explains that the programme draws on the city’s 2012 submission to the ‘Future Cities Demonstrator’ competition, focusing on the development of Manchester’s Oxford Road ‘Corridor’ around five main themes:
enhanced low carbon mobility
clean energy generation and distribution
more efficient buildings
integrated logistics and resource management
community and citizen engagement
Manchester’s approach to becoming a smarter city involves a wide range of partners. For instance, Triangulum is a €25m European Commission project involving Manchester and two other cities (Eindhoven and Stavanger) to transform urban areas into ‘smart quarters’.
In Manchester, the council-led project will integrate mobility, energy, and informations and communications technology (ICT) systems into the infrastructure along the Corridor. It will introduce a range of technologies into assets such as the University of Manchester Electrical Grid, with the aim of showing their potential for supplying, storing and using energy more effectively in urban environments. Data visualisation techniques, based on the use of real-time data, will also be developed.
In 2016, Manchester launched CityVerve, a £10 million collaborative project to demonstrate internet of things technologies. The project will involve several smart city initiatives, including:
talkative bus stops, which use digital signage and sensors, to provide information to passengers and provide data to bus operators on the numbers waiting for buses
air quality sensors in the street furniture
‘Community Wellness’ sensors in parks, along school and commuter routes, to encourage exercise
a ‘biometric sensor network’, to help people manage their chronic respiratory conditions
Final thoughts
There is great excitement about the potential for smart city technologies. However, as is highlighted by the smart-eco cities report, many are limited in scale, short term, and based on competition funding. If we want to create sustainable cities, which meets challenges of the future, greater investment will be needed from both public and private sector.
Follow us on Twitterto see what developments in public and social policy are interesting our research team. If you found this article interesting, you may also like to read our other smart cities articles.
Bringing local government into the 21st century is fraught with well documented challenges. In 2015, the Department for Communities and Local Government (DCLG) carried out a survey into local government leaders’ views on digital transformation. The research identified six key barriers to digital adoption:
Legacy systems and ICT infrastructure
Lack of development funds
Unwillingness to change / non-cooperation of colleagues
Lack of in-house digital skills
Culturally uncomfortable for the organisation
Supplier inflexibility
However, there have been signs we are heading in the right direction. LocalGov Digital, a network of digital practitioners in local government, published a common approach for delivering services – an issue we discussed on our blog in June. Their hope is that this new standard (known as the Local Government Digital Service Standard) will support the sharing of good practice and lead to better public services.
In addition, many councils are involved in pilot projects and introducing new services. For example, Cambridge City Council have launched Cambridgeshire Insight, a shared research knowledge base which allows over 20 public and third sector organisations to publish their data and make it freely available. We have also seen 18 councils coming together to collaborate on a project which aims to keep electoral registers up-to-date, potentially saving £20 million a year.
Over the past year, commentators have provided their views on what’s holding back digital transformation in local government. Below we’ve highlighted some of these.
Digital inclusion
At a TechUK event in November, Labour councillor for Harrow Council, Niraj Dattani, argued that councils should ‘aim for digital first and think about digital exclusion later’.
He suggested that if local government focused too much on the 15% of people who can’t access services, then, ultimately, nobody will have access to better services. In his view:
“It’s better to serve the 85% than serve nobody at all”
Theo Blackwell, Labour councillor for Camden Council, supported this view, and although he acknowledges there are legitimate digital exclusion concerns, he argued this should not limit innovation. In his blog article, ‘Scaling digital change for better public services — reflections on UK local government digital strategies’, Mr Blackwell also expresses his fear that council leaders are setting the pace of digital transformation by their digital inclusion priorities.
Interestingly, Mr Dattani emphasises that digital exclusion cannot be solved by one service or one local council, but requires cross-government collaboration.
Local leadership
Stephen Curtis, head of The Centre of Excellence for Information Sharing, has suggested that public sector leaders are ‘holding back digital revolution’. He explained that with digital transformation, technology is less important than the vision and leadership provided by senior officials. Encouraging data sharing across organisations, empowering employees, and importantly, investing in digital services, are just some of the key ingredients.
Similarly, a council chief executive has suggested that the public sector lacks people with the necessary skills to lead digital transformation. He highlighted that in many cases, anything to do with digital is given to the head of IT. As such, digital projects are often poorly planned and systems which are not fit for purpose are being digitised, when a radical rethink of a whole service is needed.
National leadership
In the March 2015 Budget, former Chancellor George Osborne confirmed that there would be a role for the Government Digital Service (GDS) in helping local government achieve their digital transformation ambitions (the success of which is up for debate). However, in Philip Hammond’s most recent Autumn Statement, there was no mention of local government.
In a recent blog article, Theo Blackwell, argues that this omission should be corrected in the upcoming Government Digital Transformation Strategy and the 2017 Budget. In his view, central government, including the GDS, have an important role to play in supporting local government. He also highlights that a coherent digital strategy has not been included in any of the agreed devolution deals.
Fear over job losses
One of the major challenges highlighted for implementing artificial intelligence (AI) is the fear over a reduction in jobs. However, Richard Sargeant, Director of ASI Data Science, suggests this isn’t necessarily the case. In his experience, AI will usually be used for tasks that are repetitive and that most staff members don’t enjoy. Staff can then be re-targeted to areas of work best suited to people, such as human interaction, making complex decisions or thinking creatively.
Security concerns
High profile data breaches – such as the 13,000 email addresses stolen from Edinburgh City Council’s database in 2015 – are one of the main concerns for local government.
However, Martyn Wallace, new chief digital officer for 28 of Scotland’s local councils, argues that local authorities need to move away from their negative thinking on this issue. Although he acknowledges the potential harm which could come from a data breach, he emphasises the need to focus on the facts and to take an ‘appropriate view’. For him, if you have appropriate security measures, then there is no reason why security fears should limit your digital progress.
Final thoughts
Although digital change requires overcoming a variety of challenges, such as those highlighted here, the opportunities they present have the potential to create efficiencies and provide better public services. Achieving digital transformation won’t be easy, but, by building partnerships with central government and the private sector, local councils are more likely to make a success of it.
Despite the prospect of Brexit and ongoing budgetary pressures, investing in digital transformation is not an option for local government, but a necessity.
Follow us on Twitterto see what developments in public and social policy are interesting our research team. If you found this article interesting, you may also like to read our other digital articles.
In August, Hampshire County Council were fined £100,000 by the Information Commissioner’s Office (ICO) after social care files and 45 bags of confidential waste were found in a building, previously occupied by the council’s adults’ and children’s services team.
Steve Eckersley, the ICO’s head of enforcement, explained that this data protection breach affected over 100 people, with much of the information “highly sensitive” and about adults and children in vulnerable circumstances. In his view:
“The council’s failure to look after this information was irresponsible. It not only broke the law, but put vulnerable people at risk.”
A widespread problem
In 2015, Big Brother Watch, an organisation which encourages more control over personal data, published a report highlighting that local authorities commit four data breaches every day. It found that between April 2011 and April 2014 there were at least 4,236 data breaches. This included, at least:
401 instances of data loss or theft
159 examples of data being shared with a third party
99 cases of unauthorised people accessing or disclosing data
658 instances of children’s personal data being breached
In the past year, local authorities have reported a 14% increase from the previous year in security breaches to the ICO. The figures show that 64% of all reported breaches involved accidentally disclosing data. This supports research which suggests that human error is a major cause of data protection breaches.
These statistics are both positive and negative for the ICO. Peter Woollacott, CEO of Huntsman Security, suggests that it could show that local government is becoming better at identifying security breaches. However, he also acknowledges that most organisations are subject to multiple attacks, with only some being detected.
Areas for improvement
In 2014, the ICO conducted nine advisory visits and four audits of social housing organisations. It found that improvements could be made in ten areas, including:
Data sharing – organisations regularly share personal data but few have formal policies and procedures to govern this sharing.
Data retention – few organisations have data retention schedules for personal data, which provide details on when records should be disposed of, although most only extend to physical records. Data protection legislation sets out that data must not be stored for ‘longer than necessary’.
Monitoring – there is little evidence that organisations monitor their compliance with data protection policies.
Homeworking – where organisations allow staff to work flexibly, it often wasn’t formalised.
Training – there are varying levels of data protection training found in organisations.
Public confidence
Unsurprisingly, high-profile data breaches, such as the loss of 25,000,000 child benefit claimants’ details in the post by HM Revenue and Customs (HMRC), have left the public concerned about their data.
In October, a YouGov poll showed that 57% of people believed that government departments could not share personal data securely. And 78% of people didn’t believe or didn’t know whether the government had the resources and technology to stop cyber-attacks.
A poll by Ipsos Mori has also shown that 60% of the public are more concerned about online privacy than a year ago. The three main reasons given were: private companies sharing data; private companies tracking data; and the reporting of government surveillance programmes.
The cost of data protection failures
The implications of failing to protect the public’s data are serious. Not only could local government be heavily fined by the ICO, but it could also have an emotional or economic impact on individuals if their data enters the wrong hands and is used maliciously (e.g. to commit an act of fraud). However, there are wider issues for government.
At the moment, both local and central government are undergoing digital transformation programmes, digitising their own operations and moving public services online. Examples include social workers using electronic social care records and the public paying council tax or booking appointments through their local council’s website.
If the public buy into ‘digital by default’ (the policy of ensuring online is the most convenient way of interacting with government), then services could be delivered a lot more efficiently, resulting in significant savings. However, if the public are concerned over the security of their personal data, they may be less willing to consent to its use by government.
We’ve already seen this in some areas. In 2014, the Scottish Government announced plans to expand an NHS register to cover all residents and share access with more than 100 public bodies, including HMRC. This year, the Scottish Government attempted to bring into effect the ‘Named Person Scheme’, where every child in Scotland would be assigned a state guardian, such as a teacher or health visitor.
With both of these schemes concerns have been raised over privacy, including from the ICO in Scotland. The Supreme Court has also ruled against the Named Person Scheme, over the data sharing proposals.
Final thoughts
Local government needs to be robust in ensuring compliance with data protection legislation. The financial costs could be great for local government, but the bigger concern should be public trust. If councils fail to meet their legal obligations, they may find it challenging to implement policies that use public data, even if it brings the public benefits.
Follow us on Twitterto see what developments in public and social policy are interesting our research team. If you found this article interesting, you may also like to read our other data related articles.
According to research by Lucy Zodion, a leading designer and manufacturer of streetlighting equipment, smart cities are not deemed a priority for local government. The findings show that 80% of local authorities have little or no involvement with smart cities, and that only a few had specific teams managing smart city initiatives.
The research explains that the challenging financial environment was the main reason for the lack of prioritisation. However, it also finds despite funding challenges, some local councils have been successful at introducing initiatives, through working in partnership with private organisations and universities and encouraging local businesses to participate in developing solutions.
On our blog today, we’re going to look at the Royal Borough of Greenwich, a local council quietly leading the way in the smart cities revolution.
Greenwich Smart City Strategy
On the 22nd October 2015, Greenwich council officials launched their smart city strategy at the Digital Greenwich hub. Denise Hyland, Leader of the Royal Borough of Greenwich, outlined the council’s reasoning for investing in technology, explaining that:
“In the face of the rapid increase in the borough’s population and in the face of globalization and technological change, we have to invest in the future and face these challenges head on, right now.”
The strategy introduces four key principles:
Inclusivity – the strategy will benefit all citizens, communities and neighbourhoods.
Citizen centric – citizen engagement will be transformed to ensure citizens are at the heart of policies and that their needs are met.
Transparency – citizens will be informed of changes and desired outcomes and accessible information will be provided to all citizens.
Standards and good practice – the Royal Borough of Greenwich will become a ‘learning organisation’, willing to listen and share ideas, and using evidence to inform decision-making.
The strategy also explains that it will transform four main areas:
Transforming Neighbourhoods and Communities – the council will reach out to the Boroughs diverse communities, including strengthening links with key organisations to improve the quality of life for citizens, and introducing projects to reduce digital exclusion and promote digital skills.
Transforming Infrastructure – the council will improve fixed and mobile connectivity in the Borough and encourage the widespread use of sensors in the built environment, to provide the building blocks for smart city projects.
Transforming Public Services – innovative pilot projects will be introduced to help ensure public services are co-ordinated and citizen-centric.
Transforming the Greenwich Economy – many jobs in Greenwich’s economy are vulnerable to automation, therefore the council will look to make businesses more resilient to technological change, as well as encourage the development of digital SMEs.
Bringing together the right team
Digital Greenwich has been established to develop and take forward Greenwich’s smart city strategy. The in-house, multidisciplinary team, provides expertise in the areas related to smart cities, such as the modern built environment, implementing Government as a Platform, and economic regeneration in the digital age.
The team will play an important role in shaping thinking, managing pilot projects to mitigate the risks of innovation, and ensuring that the council’s strategy is aligned with emerging practice.
Partnerships
The ‘Sharing Cities’ Lighthouse programme
The ‘Sharing Cities’ Lighthouse programme is a €25m project, which involves cities from across Europe investigating how innovative technology can be used to improve the lives of citizens. As part of this programme, Greenwich will act as a demonstrator area and trial several initiatives, including:
developing a shared electric bicycle and car scheme to reduce the number of citizens using private cars
installing solar panels in local homes to improve energy efficiency
using the River Thames to provide affordable heating for local homes.
Digital Greenwich and Surrey University
On 27th July 2016, Digital Greenwich and the University of Surrey set up a partnership to develop smart city technologies, with a focus on creating ‘resource-efficient, low-carbon, healthy and liveable neighbourhoods’. The Digital Greenwich team will now have access to the university’s 5G Innovation Centre (5GIC), which will enable it to develop and trial smart city solutions. The university have highlighted that the centre’s 5G infrastructure (the next generation of communications technology) will provide the opportunity to scale solutions to a city or national level.
The university’s 5GIC is funded by a £12 million grant from the Higher Education Funding Council.
Leader of the Royal Borough of Greenwich, Denise Hyland, commented that the new partnership will act as a ‘valuable catalyst’ to their smart city strategy and help strength the Borough’s economy and improve services.
Involving industry
GATEway (Greenwich Automated Transport Environment)
GATEway is a collaborative project involving academia, government and industry in the field of automated vehicle research. It’s led by TRL, the UK’s transport research centre, and has several aims, including:
safely and efficiently integrating automated transport systems into real life smart city environments
inspiring industry, government and the wider public to engage with using autonomous transport technology
understanding the technical, legal, cultural and social barriers that impact the adoption of autonomous transport technology
One of the companies involved in the research (based at the Digital Greenwich Innovation Centre) is Phoenix Wings Ltd, who specialise in innovative mobility solutions, fleet management and autonomous vehicle technology. In 2014, they announced ‘Navia’, the first commercially available 100% driverless shuttle.
The GATEway project is funded by an £8 million grant by industry and Innovate UK.
Final thoughts
The Institute of Fiscal Studies (IFS) have highlighted that local council spending power reduced by 23.4% in real terms between 2009–10 and 2014–15. This is clearly significant, particularly when there is pressure to meet greater demands.
However, to conclude, we’ll leave you with the comments of Professor Gary Hamel, a leading management expert,
“My argument is the more difficult the economic times, the more one is tempted to retrench, the more radical innovation becomes the only way forwards. In a discontinuous world, only radical innovation will create new wealth.”
Follow us on Twitterto see what developments in public and social policy are interesting our research team. If you found this interesting, you may also like to read our other digital articles:
When most people think of public-private sector technology collaboration the word ‘controversy’ isn’t too far behind. High profile failures such as the Home Office’s immigration computer system (which cost the taxpayer £224 million) and NHS Connecting for Health (which cost £9 billion over 10 years), have made both the public and politicians wary of investing in large-scale digital projects.
So, it wasn’t too surprising when the Cabinet Office announced in January that it was conducting a review of government IT contracts.
Why do digital projects fail?
In 2003, the Parliamentary Office of Science and Technology published a report outlining the key reasons why digital projects struggle to meet expectations:
Fast moving technology – technology differs from other projects in that advances are so rapid that technologies can become obsolete by the time a project is complete.
Defining requirements – a study by the British Computing Society found poor management of requirements as the main reason for failure of the Home Office’s immigration system.
Complexity – IT projects can be complex, and it’s not always possible to estimate the full extent of the difficulty of a project.
Oversight – staff can find it difficult to judge the success of project during its development (particularly non-technical staff).
Interoperability – IT projects generally involve different systems. It can be challenging to ensure that these systems interact, particularly if no plan has been developed.
Limited skills – many software developers do not have formal qualifications and there is a shortage of senior developers to undertake projects.
Why should the public-private sector collaborate?
In a recent interview with Business Voice, Stephen Foreshew-Cain, Government Digital Service (GDS) executive director, explained his views on the private sector. He stated:
“I want the private sector to understand that we are open for business and we need suppliers as part of the ecosystem”
In some respects, Mr Foreshew-Cain was addressing his remarks to those involved in the digital sector interested in new opportunities. But he understands that the government cannot achieve digital transformation on its own, not just because of the rapid changes in technology, but also the challenges in recruiting the right skills. For instance, the traditionally long recruitment process in the civil service can act as a barrier when digital skills are in high demand.
He also suggests that ‘insourcing’ (only developing projects within the public sector) is not the way forward, and that government should be tapping into the UK’s world leading digital sector.
Digital Marketplace
The GDS has created the Digital Marketplace, an online platform which aims to make procurement as simple and fast as possible for the public sector and suppliers. In his interview, Mr Foreshew-Cain explained that the marketplace allows the public sector bodies to access the skills and services they need, whilst providing digital innovators with an opportunity to grow and develop their ideas, in a way that directly benefits the government.
He also highlighted the success of the Digital Marketplace, with over £1 billion in contracts being awarded, including over half to small and medium-sized enterprises (SMEs).
Key factors for successful collaboration
Rob Lamb, Cloud Business Director at the EMC multinational data storage corporation, has outlined a number of actions that the UK must take to benefit from digital technology. These include:
Information – It’s important that technology is more than just websites, and that data is used to provide meaningful insights to business and the public sector.
Clustering experts – traditional organisations and digital innovators need to be given opportunities to collaborate to solve problems and share good practice.
Government role – public sector organisations should embrace new technologies, open up as many data sets as possible, as well as introduce a framework for data analytics (so customers can be assured that data is being managed appropriately).
Innovative practice – Civtech
In July 2016, the Scottish Government announced the launch of Civtech, a pilot project which encourages entrepreneurs, start-ups and small and medium-sized businesses (SMEs) to develop innovative solutions to public sector problems.
Unconventionally, the tender does not include pre-determined solutions, instead opting to pose six open questions, known as ‘challenges’, and inviting participants to provide answers. These include:
How can we get health and social care data and analysis to the widest possible audience?
How can we make our data publications more accessible and appealing?
How can we use technology to design smart roads?
The project involves a number of stages, including the ‘exploration stage’ where sponsoring public sector organisations work with teams to develop their solutions. At each stage funding is available, with companies keeping their own intellectual property and equity.
This approach may provide a viable alternative to the more traditional methods of procuring digital services.
Final thoughts
Public-private sector collaborative projects fail for a number of reasons. However, if the public sector is to progress with digital transformation, it must allow the private sector to play active role in the ‘eco-system’. The real debate going forward should focus on how we address challenges and provide the environment for successful public-private sector collaboration.
Follow us on Twitterto see what developments in public and social policy are interesting our research team. If you found this article interesting, you may also like to read:
The standard, introduced by practitioner network LocalGov Digital, aims to provide a ‘common approach for local authorities to deliver good quality, user centred, and value for money digital services’.
According to Phil Rumens, Vice Chair of LocalGov Digital, the new standard provides a “big step forward” for local government digital services. He also highlights that it not only helps create better services, but enables this in a more joined up way.
In total, there are fifteen standards, including:
Understand user needs. Research to develop deep knowledge of who the service users are and what that means for the design of the service.
Ensure a suitably skilled, sustainable multidisciplinary team, led by a senior service manager with decision-making responsibility, can design, build and improve the service.
Many will have welcomed the collaboration between LocalGov Digital and the Government Digital Service (GDS), the body responsible for digital transformation in central government. During the consultation stage, the GDS hosted a workshop with participants from over 30 local councils.
The Local Government Digital Service Standard is also heavily based on the GDS Digital by Default Service Standard, with only a few notable differences. For instance, in the local government standard, accountability for digital services lies with the appropriate council member or a senior manager responsible for the service, rather than a government minister (which is the case with the GDS standard). The local government standard also includes an additional requirement to re-use existing authoritative data and registers and to make data openly available.
Will local councils adopt the new standards?
Local government is under no legal obligation to implement the Local Government Digital Service Standards. Gill Hitchcock, reporter at Public Technology.net, suggests that, although the standards look like a great initiative, they may lack the teeth to have any real impact.
Interestingly, in a recent interview, Phil Rumens appears to agree with this sentiment, highlighting that LocalGov Digital need to make the case for the new standards. He explains that regional peer networks will be created to allow councils to share their experiences of implementing standards and to promote their value to digital leaders. In September, a ‘standards summit’ will be held, bringing together local councils who have adopted the standards and the GDS.
TechUK view
TechUK, the industry body for the technology sector, has voiced support for the underlying principles of the new Local Government Digital Service Standard, and said it’s been encouraged by the involvement of GDS in the initiative.
However, techUK have highlighted their concerns over the wording of one particular standard:
“Where possible, use or buy open source tools and consider making source code open and reusable, publishing it under appropriate licences”
They contend that this goes against the government’s policy of creating a level playing field, and could lead to unintended consequences for SMEs trying to work with local government.
Jos Creese’s view
Jos Creese, an independent IT consultant and the man described as the ‘most influential and innovative UK Chief Information Officer’ by CIO UK, has written a briefing on the need for local GDS standards.
Similarly to techUK, Jos Creese welcomes the new local government digital service standards. Yet, he also highlights their limitations, noting that they are primarily focused on on-line transactions and channel shift (encouraging people to make use of digital services) and that they don’t consider the difficult issue of information flows across local public services.
For him, standards need to be accompanied by some form of practical guidance, and they must address ‘digital by design’ challenges, including digitising the high cost, high value, ‘relational services’, such as adult care, safeguarding, and adoption services.
In his concluding comments, he states that introducing standards may not be enough to transform services and that local government must consider outcomes, rather than just the methods used to develop services. He provides examples of suggested outcomes, including:
take up of digital services relevant to target user base
satisfaction of service users and reduced complaints
lower operating costs and greater measurable efficiency of operation
integration and linkage of related transactions, services and information
‘Digital Council of the Year’ – Wigan Council
This year, Wigan Council has been recognised by the Digital Leaders’ 2016 Awards for their successful digital transformation. Their new website provides a seamless user experience and services such as the Report It app and MyAccount have revolutionised the way residents interact with the council.
They have also been commended for their attempts to tackle digital exclusion by helping hundreds of residents, including the elderly, access the internet.
Additionally, the council’s strategy has focused on supporting business through introducing superfast broadband, encouraging businesses to build efficient websites, and funding digital apprenticeships.
Final thoughts
The new Local Government Digital Service Standard is a step in the right direction and provides a basis for developing good quality, cost-effective and user-centred digital services. There are, however, still many challenges that local government needs to face as they progress with their digital transformation journeys.
Wigan Council shows that when you put the ideas of the new standard into practice, it is possible to create excellent digital services that benefit residents and business.
Follow us on Twitterto see what developments in public and social policy are interesting our research team. If you found this article interesting, you may also like to read:
In March, a report by Nesta and the Public Service Transformation Network suggested that local councils could save £14.7 billion by going ‘digital by default’ by 2020, i.e. moving all transactional services online and digitising back office functions.
However, this is not the first report to highlight the potential savings in going digital. In 2015, the Policy Exchange think tank published a report outlining how £10 billion could also be saved by councils by 2020, if they made smarter use of data and technology. Similarly, the Local Government Association (LGA) has published guidance on the benefits of digital technologies for councils, including financial savings.
All these documents make the positive case for digital. Yet, as discussed in a previous blog article, local government is still lagging behind when it comes to implementing new technologies. Jos Creese, Chief Information Officer (CIO) at Hampshire County Council and Chair of the Local CIO Council, explains that:
“It’s doubtful if any local authority is not making savings from digital investment. The challenge is being able to quantify savings.”
This suggests that if local government is ever going to achieve its ambition of becoming ‘’digital by default’, then attempts must be made to evaluate projects, to develop a strong evidence base, and to share examples of best practice. Below I’ve highlighted some projects which provide a strong case for investment.
Manchester City Council
In 2012, Manchester City Council decided to create a more responsive ‘mobile first’ website that citizens could access from free Wi-Fi spots around the city via smartphones and tablets. The website was developed by an integrated team comprising IT and marketing staff from Manchester City Council, and developers from the supplier. From the beginning, the team reviewed how people interacted with the council, such as how they asked for services and how they reported problems. The website was tested by members of the public, as well as accessibility experts and representatives from organisations representing blind and partially sighted people.
This website redesign has led to Manchester City Council saving £500,000 in the first nine months and winning a European award for website design and functionality.
Nottingham City Council
Nottingham City Council has introduced a workflow management app, replacing an inefficient paper-based system. The new app allows staff from customer services, highway inspectors and response teams to enter faults, such as potholes or damaged street lights, directly into the system. It then automatically allocates the fault to the relevant inspector and, once the work is completed, digitally signs it off. Residents are also kept informed via updates, as the progress of the work is linked to the initial order raised.
The council has reported that the app has created £100,000 in savings in less than one year. In addition, the improved monitoring of productivity has led to 40% field efficiency savings and 60% back office savings in the Highways department.
London Borough of Camden
In 2013, the London Borough of Camden introduced a programme to create a single source of residents’ data. The Camden Residents Index (CRI) used a technological solution to match different types of data with individual residents (allowing the council to have a single point of view for each resident’s data).
The CRI has been used for a number of purposes, including detecting fraud and managing the electoral roll. For instance, the index was able to identify 752 council properties that could have been illegally sublet. The council estimated that a quarter of these properties were reclaimed, saving approximately £18,000 per property and £3.4 million in total. The CRI was also able to validate 80% of data from the electoral roll (which is higher than the 50% rate of the Department for Work and Pensions, which usually validates the council’s electoral data). This increased match rate resulted in less manual checking, which saved Camden council £25,000.
Poole County Council
Poole Borough Council has recently moved towards using cloud-based services. They highlighted three main drivers for this change: complying with the Cabinet Office’s Cloud First Directive; improving the agility of services; and making the necessary savings to the information and communications technologies (ICT) budget. The move has already saved the council £60,000; with an additional £750,000 worth of savings possible over the next three years.
Conclusion
Local council leaders may be anxious about making the case for investment, but investing in digital should be considered as a necessity, rather than a luxury, for meeting growing citizen demands with fewer resources.
These are just a few, of the many examples, of how local councils have benefited from digital transformation.
Follow us on Twitter to see the developments in policy and practice currently interesting our research team.
Further reading: if you liked this blog post, you might also want to read our other posts on digital. | {
"pile_set_name": "Pile-CC"
} |
A 2 Mb deletion in 14q13 associated with severe developmental delay and hemophagocytic lymphohistiocytosis.
Interstitial deletions of chromosome 14 have rarely been described. We report on a boy in whom a 2 Mb deletion in 14q13 was discovered by array CGH. The deletion was a de novo event. The boy presented with asymmetrical growth retardation at birth. There was severe developmental delay with muscular hypotonia and focal epilepsy with apneic episodes progressing to serial tonic seizures. At the age of 3 3/12 years he was diagnosed with pneumonia. In the further course he developed symptoms of hemophagocytic lymphohistiocytosis. He died due to organ failure. Herein the clinical findings are compared to patients with cytogenetic visible deletions encompassing the region deleted in the proband and the possible connection with the deleted genes. | {
"pile_set_name": "PubMed Abstracts"
} |
Q:
What are the major differences between Data Access Application Block, NHibernate, ADO.NET Entity Framework and LINQ to SQL?
What are the major differences between Data Access Application Block, NHibernate, ADO.NET Entity Framework and LINQ to SQL with respect to performance, business logic, scalability and flexibility?
A:
What you are asking is a pretty large question. Here's a similar question and my answer to that question can give you a lot of good reading to do on the various .NET ORMs:
NHibernate, Entity Framework, active records or linq2sql
You won't notice a ton of difference in performance between the various options in the large majority of scenarios. All of the options are built on ADO.NET and allow you do use raw ADO.NET to get the best possible performance.
All solutions are flexible to the extent you are willing to write your own code. NHibernate provides the most features out of the box, by far.
Scalability is difficult to answer, there are ways to achieve scale with all of the options, but some make it easier than others. Again, NHibernate is the most feature rich from a scalability standpoint out of the box, providing features like both a level 1 and level 2 cache.
For business logic, the three ORMs will work approximately the same, but the Data Access Application Block is not an ORM and doesn't provide any of the features of an ORM, so you are completely on your own mapping your relational table data into objects from Data Readers or DataSets.
| {
"pile_set_name": "StackExchange"
} |
Q:
Compression in node.js
I'm putting some bigger JSON values in my caching layer (redis), and I think they could use some compression to cut down my memory usage a bit.
Which compression modules for node.js do you use? For some reason everything that's listed on the joyent/node Modules wiki looks fishy - either 404s, no commits for more than a year, very few people watching, or open reports of memory leaks.
Snappy looks nice, but I'd rather go for something more portable.
I'd naturally prefer an async compression/decompression API over a blocking one, but I'm also curious if you think it makes a big difference for low compression levels.
Thanks in advance for your replies!
EDIT:
About portability: what I really meant is that the module can be installed via npm and has no external dependencies that are not present on generic *NIX setups.
Why? Because certain PaaS setups (currently only heroku's celadon-cedar to my knowledge, but perhaps more in the future) don't provide traditional admin access to the instance environment via ssh or the like, and the only way to bring in dependencies is via npm.
Ideally, the module should also run on cygwin.
So what would you use?
A:
When you say 'more portable' I assume you're referring to the C++ code with snappy. Unfortunately a native javascript implementation of most compression algorithms would be an order of magnitude slower than a native C/C++ implementation, which is why nearly all of the node compression libraries use it. Snappy is extremely portable (I've built it on Solaris, Linux and OSX) and fairly active. I would strongly recommend it over anything else.
| {
"pile_set_name": "StackExchange"
} |
104 F.3d 358
NOTICE: Fourth Circuit Local Rule 36(c) states that citation of unpublished dispositions is disfavored except for establishing res judicata, estoppel, or the law of the case and requires service of copies of cited unpublished dispositions of the Fourth Circuit.Robert Morris COCHRAN, a/k/a Michael The Archangel,Plaintiff-Appellant,v.Jesse BROWN, Secretary of Veteran Affairs; MichaelBosworth, Assistant District Counsel; UnitedStates of America, Defendants-Appellees.
No. 96-6575.
United States Court of Appeals, Fourth Circuit.
Submitted Oct. 15, 1996.Decided Dec. 24, 1996.
Appeal from the United States District Court for the Eastern District of North Carolina, at Raleigh. Malcolm J. Howard, District Judge. (CA-96-70-5-H)
Before HALL and MURNAGHAN, Circuit Judges, and PHILLIPS, Senior Circuit Judge.
Robert Morris Cochran, Appellant Pro Se.
E.D.N.C.
AFFIRMED.
PER CURIAM:
1
Robert Morris Cochran, a North Carolina inmate, appeals the district court's order denying relief on his 42 U.S.C. § 1983 (1994) complaint under 28 U.S.C. § 1915(d) (1994), amended by Prison Litigation Reform Act, Pub.L. No. 104-134, 110 Stat. 1321 (1996). We have reviewed the record, and we conclude that the district court's dismissal of Cochran's complaint as frivolous was not an abuse of its discretion. Accordingly, we affirm on the reasoning of the district court. Cochran v. Brown, No. CA-96-70-5-H (E.D.N.C. Mar. 19, 1996). We dispense with oral argument because the facts and legal contentions are adequately presented in the materials before the court and argument would not aid the decisional process.
AFFIRMED
| {
"pile_set_name": "FreeLaw"
} |
Structure-function relations of antithrombin III-heparin interactions as assessed by biophysical and biological assays and molecular modeling of peptide-pentasaccharide-docked complexes.
The serine proteinase inhibitor antithrombin III (ATIII) is a key regulatory protein of intrinsic blood coagulation. ATIII attains its full biological activity only upon binding polysulfated glycosaminoglycans, such as heparin. Peptide K121-A134, based on the sequence of ATIII in the D helix region, was previously shown by us (Tyler-Cross et al., Protein Sci. 3, 620-627, 1994) to encompass part (or all) of the purported high-affinity heparin binding region of ATIII. A series of peptide analogs has now been prepared whose sequences are identical to K121-A134 except that single cationic residues of K121-A134 have been successively replaced with Ala. In one case, the Arg residue of the reference peptide corresponding to R129 of ATIII has been replaced by Gln (R129deltaQ peptide), thus mimicking the naturally occurring mutant protein, ATIII Geneva. The heparin affinity of all peptides was quantitated by isothermal titration calorimetry and by peptide/ATIII competition binding assays. Replacement of any single cationic residue with Ala had a deleterious effect on heparin binding. The greatest reduction in heparin affinity (more than 30-fold) was observed with the R129deltaQ peptide (KD = 1.5 +/- 0.06 microM vs 51 +/- 2 nM for the reference peptide, K121-A134). Furthermore, each of the Ala-replacement peptides was a less-effective inhibitor of ATIII-heparin complex formation than the reference peptide. The poorest inhibitor was the R129deltaQ peptide which showed nearly 30% decrease in inhibition potency (60% inhibition at 100 microM peptide vs 90% inhibition with the reference peptide). The relative heparin affinities of the peptides measured by biological assay were the same as determined by titration calorimetry. Consequently, we modeled the complexes formed between the pentasaccharide unit structure and the R129deltaQ peptide or the reference peptide, K121-A134. In the "docked" complex, the assumed conformation of K121-A134 permitted juxtaposition of the cationic residues of the peptide with functional anionic groups of the pentasaccharide known to be involved in binding. A docked complex could also be formed between the R129deltaQ peptide and the pentasaccharide, but misalignment of critical peptide and saccharide functional groups was observed. The structure of the R129deltaQ-pentasaccharide complex was highly irregular because F123 and Y131 were completely surface exposed, likely yielding an unfavorable structure in aqueous solution. The observations from molecular modeling allow us to suggest that ATIII Geneva displays decreased heparin binding affinity due to its inability to form a productive binding complex in which essential electrostatic contacts are made between suitably juxtaposed saccharide anionic functional groups and cationic amino acid side chains. | {
"pile_set_name": "PubMed Abstracts"
} |
Q:
Why autocorrelation affects OLS coefficient standard errors?
It seems that OLS residuals autocorrelation is not always an issue, depending on the problem at hand. But why residuals autocorrelation would affect the coefficient standard errors? From the Wikipedia article on autocorrelation:
While it does not bias the OLS coefficient estimates, the standard
errors tend to be underestimated (and the t-scores overestimated) when
the autocorrelations of the errors at low lags are positive.
A:
Suppose your OLS regression is well specified and contains all the right explanatory variables, but you have an unspecified correlation structure of the residuals:
$$
y_t = x_t' \beta + \epsilon_t, \mathbb{V}[\mathbf{\epsilon}]=\Omega
$$
The OLS estimates are
$$
\hat\beta = (X'X)^{-1} X'Y = \beta + (X'X)^{-1} X'\mathbf{\epsilon}
$$
and their variance is
$$
\mathbb{V}[\hat\beta] = \mathbb{E} [ (X'X)^{-1} X'\mathbf{\epsilon}\mathbf{\epsilon}'X (X'X)^{-1} ]
$$
Typically, at this stage, we'd have to assume something like existence of the probability limit of $\frac1T (X'X) \to \Sigma$, so that
$$
T \mathbb{V}[\hat\beta] \to \Sigma^{-1} {\rm plim} \bigl[ \frac1T X'\mathbf{\epsilon}\mathbf{\epsilon}'X \bigr] \Sigma^{-1}
= \Sigma^{-1} {\rm plim} \bigl[ \frac1T X'\Omega X \bigr] \Sigma^{-1}
$$
This expression is different from what the naive OLS standard errors produce, and so in general the OLS standard errors are wrong.
Of course, if $X$ can be considered fixed, then there is no need for asymptotic approximations, and $X$ can be carried through the expectations, so that
$$
\mathbb{V}[\hat\beta] = (X'X)^{-1} X'\Omega X (X'X)^{-1}
$$
to the same effect.
| {
"pile_set_name": "StackExchange"
} |
Our Mission
The Mission of the Institute is to provide an independent forum for those who dare to read, think, speak, and write in order to advance the professional, literary, and scientific understanding of sea power and other issues critical to national defense.
Holy Mackerel, Not Again!
As the U.S. Navy’s submarine force faces tighter budgets, it could learn a thing or two from solutions that surfaced from an informal Submarine Officers Conference in the 1920s.
Rear Admiral C. S. Freeman, Commander U.S. Submarine Force, could not believe it. Despite a decade of development on the Navy’s fleet submarine, some senior naval officers still insisted on building smaller, cheaper, but far less capable versions. In response, Freeman wrote to Admiral William D. Leahy, the Chief of the Naval Operations:
While it is true that we have some very large and some very small submarines, this is the result of prolonged experimentation to determine the size most adaptable to our needs. In other words, this experimentation has not represented an objective search for a large submarine or a small submarine as such, but a seeking for the submarine to fit our special requirements, much as we have sought after a battleship type and a destroyer type to meet the needs of the fleet . . . this command believes that our energies should be concentrated on the development and perfection of a single type submarine sufficiently flexible to carry out any of the duties as outlined by our war plans. . . . 1
The date was 27 July 1938. Freeman’s opposition to the small submarines proved prophetic: The 800-ton (surfaced displacement) USS Mackerel (SS-204) and Marlin (SS-205) proved to be utterly unsatisfactory for operations and ended up as training vessels during World War II. 2
Freeman’s words could have been written today by almost any career submariner in response to the frequent argument, made on an annual basis in the pages of Proceedings , about adopting conventional attack submarines (SSKs). But as we enter an age of limited budgets and tough choices about what weapon systems are truly necessary, the submarine force is going to be pushed to strongly consider cheaper alternatives like the SSK.
Consequently, it’s worth reviewing how the interwar submarine force, faced with similar choices regarding limited tonnage and funding, determined the right characteristics and produced the fleet submarine that won the decisive undersea campaign in World War II.
Submarines between the World Wars
The interwar force was charged with supporting the rest of the Navy by scouting ahead of the battle fleet and skirmishing with the enemy, presumably in the Western Pacific Ocean. This was a tall order, given that the predominant type of submarines built at the end of World War I (the S -class) did not have the surface speed or endurance to make a long trans-Pacific transit and stay ahead of the battle fleet. Therefore, the Navy used a 1916 congressional authorization to build nine “fleet submarines” to investigate the characteristics necessary for future subsurface vessels. 3 Those were known as the V -submarines, though they were all different from each other in design.
After significant disappointment with the first three V-boats, which were designed with limited input from the submarine force, Secretary of the Navy Curtis D. Wilbur and Admiral Edward W. Eberle, Chief of Naval Operations, directed the Submarine Officers Conference—an informal advisory group established after World War I—to advise the Navy’s leadership in 1926. 4 By 1930, the conference had identified the ideal characteristics of a fleet submarine: long range, high surfaced-speed, and sufficient weaponry. 5
Achieving the necessary range required a large enough displacement to carry the fuel and supplies needed for extended operations. In terms of speed, submarines had to be able to keep ahead of the U.S. Fleet under normal conditions. In 1930, Admiral William V. Pratt, Commander-in-Chief of the U.S. Fleet, identified the optimum speed as 15 knots, the cruising speed of battleships. As long as the submarines left before the Fleet, they could stay far ahead of it. 6
But just as the Navy finally settled on the characteristics it wanted in its submarines, the submariners found their ability to experiment limited by treaty restrictions. In 1930, the United States signed the London Naval Treaty, limiting the amount of tonnage displaced by all American submarines combined to only 52,700. 7
Unfortunately, the Navy had already devoted a significant amount of tonnage to submarines. As the service continued to build V -boats, they had become progressively larger, with the V-5 and V-6 displacing an incredible 3,158 tons when fully loaded on the surface. The massive displacement had been considered necessary to install large diesel engines for the V-boats to achieve surface speeds up to 17 knots. 8 Because of the bulky handling characteristics of those large submarines and the constraints of the treaty, submariners began looking for smaller designs that could still operate with the necessary speed and deliver a significant load of torpedoes.
Downsizing, Speed-Rising
The first of the smaller and experimental submarines was the USS Dolphin (SS-169), displacing only 1,550 tons on the surface. Its layout foreshadowed the future Fleet submarines. In a continuing trend to decrease size in order to make as many as possible, the next two submarines, the USS Cachalot (SS-170) and Cuttlefish (SS-171), displaced only 1,110 tons on the surface. 9 Unfortunately, their twin foreign-made MAN engines performed poorly, and commanders were uncomfortable with the thought of being in enemy waters with only two main engines. 10 Consequently, the submarine force reversed the trend of decreasing size. Using the Cachalot and Cuttlefish as a bottom line, the force started adding better engines and additional components to meet the required characteristics.
In 1933, with new technology available from the General Motors Winton diesel division, the Bureau of Engineering installed four engines and an all-electric drive into the new Porpoise –class submarines. The all-electric drive transferred energy directly from the diesels to the electric motors that turned the propeller shafts, allowing the USS Porpoise (SS-172) to reach 19 knots on the surface, a speed American submarines had never attained before. 11 The all-electric drive went on to power the mainstay U.S. submarines of World War II, far surpassing the modest 15-knot speed requirement Admiral Pratt had called for in 1930. In fact, starting with the 1940 Tambor class, American submarines regularly made up to 20.25 knots on the surface. 12
A combination of submariners and industry together created innovative technological advancements that made the smaller fleet submarines more capable than their larger V -class predecessors. For example, in 1930 submariners were using rudimentary “is-was” circular slide rules to aim torpedo salvoes. 13 But starting in 1932, the Bureau of Ordnance coordinated with Arma and Ford Instruments to develop a small but advanced analog fire-control computer. The Arma Mk 1 torpedo data computer, or TDC, was completed in 1938, and further competition between Arma and Ford Instruments produced the Arma Mk 3 TDC, which turned out to be pivotal to the success of the U.S. submarine campaign during World War II. 14
And perhaps the most important advance that allowed for operations in the tropics of the Pacific Ocean was the inclusion of air conditioning. In addition to eliminating electrical short circuits, metal corrosion, and mildew in mattresses and clothing, that technology genuinely improved the habitability of U.S. submarines. 15
The Right Submarine for the Job
When war came, the 1,500-ton (surface displacement) Gato -class fleet submarine fully met the Navy’s needs in the Pacific. Its high speed not only allowed it to proceed far ahead of American surface forces and maintain contact with the enemy, but it also allowed submarines to outflank slower merchant convoys. With their displacement, fuel capacity, and technological innovations, submarines had the range to shadow Japanese movements all the way from the Sea of Japan or stay on station for almost two months. U.S. submarines eventually sank 55 percent of all Japanese shipping.
Those characteristics still guide our submarine design. With the exception of three permanently forward-deployed fast-attack nuclear-powered submarines out of Guam, and the four Ohio –class guided-missile submarines that operate forward-deployed and periodically return to Bangor, Washington, and King’s Bay, Georgia, for upkeep, the rest of the force still has to transit long distances, remain on station for extended periods, and carry enough weapons and sensors to make the trips worthwhile. To a degree that could not have been imagined in the 1930s, nuclear power permits U.S. submarines to accomplish these tasks with remarkable high speed and long range.
Any one of the Fleet’s nuclear-powered submarines can transit continuously at speeds that even the best conventional submarines can only maintain for a brief time, and they can do it for weeks on end. As a result, much as Admiral Freeman opposed the Marlin and Mackerel , our current submarine force has strongly resisted any attempt to adopt a less capable design.
But much as the London Naval Treaty forced the U.S. force to develop a smaller submarine that incorporated most of the desired capabilities, our current force faces a similar challenge over the coming years with a combination of the budget crunch coupled with the need to replace the retiring Los Angeles –class submarines. Secretary of Defense Robert Gates summed up the budgetary shortfall at the Eisenhower Library in May 2010: “Given America’s difficult economic circumstances and parlous fiscal condition, military spending on things large and small can and should expect closer, harsher scrutiny. The gusher has been turned off, and will stay off for a good period of time.” 16
Only a few days before, Secretary Gates had specifically targeted the Navy’s spending: “At the end of the day, we have to ask whether the nation can really afford a Navy that relies on $3 to $6 billion destroyers, $7 billion submarines, and $11 billion carriers.” 17 He was referring to the expected cost per unit of the next-generation ballistic-missile submarine. But meanwhile, the Virginia –class submarines cost about $2 billion, with some expected cost savings as more are built. Because of these high costs, our force is constrained to making only two additional attack submarines a year, with possible additional pressure coming from the development of the next-generation ballistic-missile submarine. 18
What’s the Mission?
This means that our force will fall below the minimum number of 48 attack submarines, which provide the unified combatant commanders their daily requirement of 10 fast attack submarines, sometime around 2024. The numbers will drop into the 30s and may remain fewer than 48 indefinitely. If we do not find a way to cut costs and build additional capable but cheaper submarines, our force will be stretched thin for an unacceptable amount of time. 19
Today’s force needs to replicate the successful response to the London Naval Treaty of 1930 by seriously considering what sort of missions our submarines must carry out and what sort of capabilities they entail. Anything extra must be removed in the interest of reducing cost.
In addition, the very size of our submarines should be seriously reconsidered. From the Skipjack (SSN-585) to the Virginia (SSN-774), our nuclear attack submarines have jumped in size from 3,500 tons to 7,800 tons submerged. Admittedly the size increase was accompanied by a boost in capabilities, sensors, weapon load-out, and auxiliary equipment like water-distillation plants and oxygen generators. But this expanded crew size by almost 50 percent and required an increase in engine-room size to allow newer submarines to make the same speed as the much smaller Skipjack class.
So it seems worthwhile to investigate if we can build a smaller submarine, using a true Albacore -like teardrop hull and hydrodynamic advances to maximize propulsion as well as using the advances in engineering technology and modular design showcased by the Virginia . And just as the original Los Angeles –class submarines were not built with a retractable towed array or ARCI (acoustic rapid commercial off-the-shelf insertion) systems, which were installed well after construction, we can leave open the possibility of backfitting cutting-edge technologies.
Similarly, this might mean eliminating capabilities like vertical launch tubes or Special Operations Forces transport. But reducing some optional capabilities should be considered if we can possibly construct two smaller nuclear attack submarines for the cost of one Virginia class. After all, every submarine does not need to do everything.
The Trouble with SSKs
Some naval thinkers, such as Naval War College Professor Milan Vego and then-Navy Commander Henry J. Hendrix, argue that the answer to this pressing question is the SSK. In recent articles in Proceedings , both Dr. Vego and now-Captain Hendrix argued that a few SSKs could supplement the current SSN force and prove to be more capable in the littorals. Current foreign-built SSKs have the advantage of being much cheaper than the Virginia –class submarine, costing between $365 million to $500 million. They require a smaller crew of about 30 people, as opposed to the 150 personnel on board a U.S. Navy fast-attack submarine. Moreover, advances in air-independent-propulsion technology, fire-control computer systems, and sonar systems have arguably shrunk the tactical gap between nuclear attack submarines and SSKs. 20
But before we blindly accept these promised advantages, we need to ask the following questions:
Will these submarines really be significantly cheaper? Does the cost savings of foreign SSKs stem from the lack of a nuclear power plant and nuclear-related components, or are the savings actually realized because foreign countries do not build their submarines to the high but expensive standards of SUBSAFE shipbuilding and maintenance practices? In short, will this really be a worthwhile and cheaper option if we take into account the stringent requirements, tested in blood, of the U.S. submarine force?
When we ask these questions, we need to look at not just the construction but also the life costs of the ship. A nuclear reactor may cost a significant amount of money, but advances in reactor design and technology mean that current reactors will never have to be refueled for the life of the ship, while the only direction conventional fuel prices seem to be going is up. Another question to ask is: How much will the fuel for a conventional submarine cost in 30 years?
Can this submarine provide the necessary power to support the fire-control, sonar-processing, and crew amenities we desire? Advances in sonar sensors and fire-control computer processing provide U.S. nuclear submarines with a decided advantage against many adversaries. A conventional submarine without sufficient electrical power to run and cool the advanced-sonar and fire-control processing of a nuclear submarine would be a definite drop in capabilities and not a worthwhile investment. And once again, the cost involved with installing and maintaining these systems must be taken into account. If foreign-built SSKs are significantly cheaper because they do not have this sort of processing, then maybe they’re not worth buying.
Will a reduced crew be able to deal with the challenges of intense missions vital to national security? A smaller crew means less space required for berthing, messing, and stores, as well as diminished trash production. But this also means that even with automation, there is still a lot of strain each crew member must deal with, including day-to-day tasks such as field days, stores loads, preventive maintenance, and all-hands evolutions like mooring and under ways. And during periods of high stress, such as war and overcoming major casualties, the small crew size will mean each person will be cycled excessively.
More Subs for Less Money
To their credit, Dr. Vego and Captain Hendrix acknowledge that conventional submarines would take too long to reach their operational areas without being based in forward-deployed foreign ports. Among logical candidates for such places are ports in Japan and Bahrain. The question is, can we make this long-term concept work at those ports with a minimum of lifetime maintenance back in Pearl Harbor or on the mainland? And can we be sure these ports will remain open to us in the future?
The SSK concept is only worthwhile if it is genuinely cheaper and can be based out of areas that will make up for the SSK’s lack of sustained speed and endurance. If the absence of nuclear components means only a marginally cheaper submarine with less processing, weapons, and sustained speed, then it isn’t worth it. Instead, the better option is an innovative and cheaper nuclear submarine applying a number of the lessons that have been learned on board other innovative nuclear submarines, such as the NR-1 , and incorporate the technological advances of the Virginia .
The bottom line is: We need to buy more submarines for less money. But to do so, we need to seriously ask what missions and capabilities we absolutely require. Having decided that, we can move ahead and produce an innovative and cheaper submarine, with a minimal loss of capabilities, that is our era’s Gato -class fleet submarine, not an ineffective Marlin or Mackerel .
6. Testimony of ADM W. V. Pratt, 27 May 1930, “Testimony of Commander-in-Chief, U.S. Fleet, in Regard to Needs of the Fleet,” Hearings Before the General Board of the Navy, 1917–1950 (hereafter cited as General Board), p. 181.
13. NS402: Junior Officer Submarine Practicum Distinguished Speaker Lecture by RADM Maurice Rindskopf, speech presented to students at the U.S. Naval Academy, 28 January 2003, in which he stated: “It was called an ‘Is-Was’ because when you got an answer that is where he was .”
Lieutenant Holwitt is the navigator/operations officer on board the USS New Mexico (SSN-779). He has a Ph.D. in history from Ohio State University and is the author of ‘Execute Against Japan’: The U.S. Decision to Conduct Unrestricted Submarine Warfare (Texas A&M University Press, 2009). | {
"pile_set_name": "Pile-CC"
} |
Let me know of any changes, this would be your trip with John
-----Original Message-----
From: Anabel Soria <anabel.soria@travelpark.com>@ENRON
Sent: Thursday, October 18, 2001 4:24 PM
To: Garcia, Ava
Subject: REVIEW AND APPROVE GRACE LYNN BLAIR TRAVEL FOR 29OCT01
AGENT AM/AM BOOKING REF YPRGXO
BLAIR/GRACE LYNN
EB 4266
ENRON CORP
DATE: OCT 18 2001
SERVICE DATE FROM TO DEPART ARRIVE
CONTINENTAL AIRLINES 29OCT HOUSTON TX OMAHA NE 932A 1150A
CO 3767 K MON G.BUSH INTERCO EPPLEY AIRFIEL
TERMINAL B
SNACK NON STOP
RESERVATION CONFIRMED 2:18 DURATION
FLIGHT OPERATED BY EXPRESSJET AIRLINES IN
AIRCRAFT: EMBRAER RJ135/140/145
SEAT 06A NO SMOKING CONFIRMED BLAIR/GRACE
LYN
CONTINENTAL AIRLINES 29OCT OMAHA NE HOUSTON TX 633P 855P
CO 4277 K MON EPPLEY AIRFIEL G.BUSH INTERCO
TERMINAL B
SNACK NON STOP
RESERVATION CONFIRMED 2:22 DURATION
FLIGHT OPERATED BY EXPRESSJET AIRLINES IN
AIRCRAFT: EMBRAER RJ135/140/145
SEAT 06A NO SMOKING CONFIRMED BLAIR/GRACE
LYN
RESERVATION NUMBER(S) CO/UDHQG3
BLAIR/GRACE LYNN S1C0179R1113
CO FREQUENT FLYER COGH928041
ASSISTANT: AVA GARCIA 713 853-5842
*******************************************
INTL TVLRS: CARRY SOS WALLET CARD W/ENRON ASSISTANCE INFO
CALL SOS MEDICAL EMERGENCY:IN U.S 800 523-6586
CALL SOS MEDICAL EMERGENCY:INTL 215 245-4707 (COLLECT)
*********************************************
LL FARES ARE SUBJECT TO CHANGE UNTIL TICKETED/PURCHASED
Anabel Soria
713-860-1147
713-860-1847-fax
Anabel@travelpark.com
**********************************************************************
This e-mail is the property of Enron Corp. and/or its relevant affiliate and
may contain confidential and privileged material for the sole use of the
intended recipient (s). Any review, use, distribution or disclosure by
others is strictly prohibited. If you are not the intended recipient (or
authorized to receive for the recipient), please contact the sender or reply
to Enron Corp. at enron.messaging.administration@enron.com and delete all
copies of the message. This e-mail (and any attachments hereto) are not
intended to be an offer (or an acceptance) and do not create or evidence a
binding and enforceable contract between Enron Corp. (or any of its
affiliates) and the intended recipient or any other party, and may not be
relied on by anyone as the basis of a contract by estoppel or otherwise.
Thank you.
********************************************************************** | {
"pile_set_name": "Enron Emails"
} |
I realized that as soon as the phone returned home and re-connected to WiFi, there were no cached entries on the Tracker map. Further investigation showed that there were zero cached entries on the phone as well.
Testing:
1. Turned off Screen Lock (no security)
2. Set screen Timeout to maximum of 10 minutes.
3. Set Hot GPS to on to ensure frequent GPS trackings.
4. Turned off any and all Power Save features on phone.
5. Ensured AT App is active and in foreground (not closed or "clicked the back button" on phone)
Testing conditions:
1. Samsung Galaxy S4- no cell service, no SIM card. WiFi/GPS only.
2. Device placed in car out in the open and tests successfully.
3. All security and power saving functions disabled.
4. AT APP is left open and running at all times.
5. Smart Sending turned off.
6. Hot GPS turned on for fast rates/testing purposes.
Testing observations:
1. While screen is lit up, AT pings out for GPS coords. - SUCCESS
2. Cell is not enabled, therefore no connection can be established, AT caches entry - SUCCESS
3. Being in Hot GPS mode, #2 happens frequently and each attempt is cached - SUCCESS
4. After 10 minutes, I write down the value of cached entries - for example 330.
5. At that time of screen shut-off, AT stops all attempts at GPS tracking and therefore no caching happens - FAILURE
6. I wait another 10 minutes and the quantity of cached tracks equals the amount previously recorded at screen shut-off. - FAILURE
7. I tap any button and the screen lights back up, no security screen, directly to the already (and still) open AT program. The program NEVER shut down.
Summary - Works great if phone never goes into screen dark state. As soon as the screen on the device goes out, all tracking stops and therefore no caching. Once device reconnects to WiFi(car returns home), all previously cached events (previous to car leaving or WiFi being turned off in testing environment) upload to site successfully and then continues to track GPS pings, without having to "open" up phone again! It appears that the logic is as follows (this is not actual code! This is just how my brains sees it!):
IF ScreenTurnedOff = TRUE AND ActiveConnection = TRUE /Screen is lit up and active WiFi connection
THEN ContinueTracking = TRUE
ELSE
IF = ActiveConnection = FALSE AND ScreenTurnedOff = FALSE /This is where the APP still tracks and caches if screen is lit up
THEN ActiveTracking = TRUE
CacheTracks = TRUE
ELSE
IF = ActiveConnection = FALSE AND ScreenTurnedOff = TRUE /This is where the APP stops tracking and caching if screen is dark
THEN ActiveTracking = FALSE /Stops all tracking even if APP is open
CacheTracks = FALSE /Does not cache since active tracking is disabled
Returning home and connects to WiFi WITHOUT touching phone/opening up/making screen light up:
IF = ActiveConnection = FALSE AND ScreenTurnedOff = TRUE /This is where the APP stops tracking and caching if screen is dark
THEN ActiveTracking = FALSE /Stops all tracking even if APP is open
CacheTracks = FALSE /Does not cache since active tracking is disabled
ELSE
UponReconnectionWithWIFI = TRUE AND ScreenTurnedOff = TRUE AND ActiveTracking = FALSE /This is where no "opening" of phone happens and is still in car but App is still running in forground
THEN RestartTracking = TRUE AND DumpCacheToServer = TRUE /if there's any previously cached items in cache from the short time between leaving Wifi area and screen going dark.
Have you tried just put it into background (regardless of screen on or off)?
There's an interesting setup here as well (no SIM card, no cell data network). I wonder that might play a role here as well. | {
"pile_set_name": "Pile-CC"
} |
Conventionally, various types of cooling structures with improved cooling performance for a cylinder head of a multi-cylinder internal combustion engine have been proposed. For example, Patent Document 1 discloses a cooling structure in which a coolant passage in a cylinder head is divided into an intake-side passage and an exhaust-side passage, and the exhaust-side passage is divided into exhaust-side lateral passages and an exhaust-side longitudinal passage. The intake-side passage is arranged below intake ports and extends along the arranging direction of cylinders. Each of the exhaust-side lateral passages is provided between a corresponding adjacent pair of the cylinders and extends along a direction substantially perpendicular to the arranging direction of the cylinders. A coolant inlet of each exhaust-side lateral passage is arranged between the corresponding adjacent cylinders and in the vicinity of the intake-side passage. The exhaust-side longitudinal passage is provided in the vicinities of exhaust ports and extends in the arranging direction of the cylinders. The downstream end of each exhaust-side lateral passage is connected to the exhaust-side longitudinal passage.
In the cooling structure, a sufficient flow of low-temperature coolant is sent from a radiator to the intake-side passage. The coolant thus cools the intake air flowing through the intake ports, suppressing knocking. Further, since an upstream side of the exhaust-side passage is formed by the exhaust-side lateral passages, a sufficient amount of coolant is provided to heated portions corresponding to the sections between the cylinders. The heated portions are thus efficiently cooled.
Each of the exhaust-side lateral passages and the inlet of the exhaust-side lateral passage of this cooling structure of the cylinder head are provided between the corresponding adjacent pair of the cylinders. This arrangement allows the coolant flowing in the exhaust-side lateral passages to cool the portions corresponding to the sections between the cylinders and the vicinities of these portions, which are, for example, the portions in the proximities of combustion chambers. However, the cooling structure does not appropriately send the coolant to the vicinity of the top of each of the combustion chambers, which are formed in the respective cylinders. This makes it difficult for the coolant to cool, particularly, most heated portions such as a section between each adjacent pair of the exhaust ports, a section between each adjacent pair of the exhaust valves, and the proximity of the ignition plug of each of the cylinders.
Patent Document 1: Japanese Utility Model Registration No. 2526038 | {
"pile_set_name": "USPTO Backgrounds"
} |
Approximately two-thirds of plasma cholesterol in humans is transported on low-density lipoprotein (LDL) molecules. The concentration of LDL in the bloodstream is strongly correlated with the risk of developing premature heart disease to the extent that drugs are designed to lower serum LDL levels. Drugs that reduce the level of LDL in the bloodstream have been shown in numerous clinical trials to be effective in reducing the risk of developing heart disease. The most notable examples are the “statins” (e.g. Zocor, Simvastatin, Lovastatin, Atorvastatin, Pravastatin), drugs that inhibit the activity of 3-hydroxy-3-methyl-glutaryl-coenzymeA reductase, an enzyme in the cholesterol biosynthetic pathway. However, people vary in their responsiveness to these drugs. In particular, some patients with severe forms of hypercholesterolemia are not very responsive to statins or to any other known drug therapy.
An elevation in serum LDL levels can be caused by diminished clearance of LDL particles from the circulation or by increased production of LDL or both. The clearance of LDL from the circulation is largely mediated by the LDL receptor. Thus, patients with familial hypercholesterolemia, a disease caused by LDL receptor mutations, have LDL levels 8-10-fold elevated (in the homozygous form) or 2-4-fold elevated (in the heterozygous form), as compared to patients with normal LDL receptor. This observation provides strong support for the key role of the LDL receptor in LDL metabolism.
LDL particles are not directly synthesized. Rather, the liver produces very low density lipoprotein (VLDL), which is secreted into the bloodstream. While the bloodstream, VLDL is converted into LDL. This occurs through the action of lipoprotein lipase (LPL), an enzyme residing on the lumenal surface of the capillary endothelium. LPL catalyzes the hydrolysis of the triglycerides in the VLDL particle, thus shrinking the diameter of the particle and enriching it for cholesterol and cholesterol ester (cholesterol ester is not a substrate for LPL). VLDL also acquires cholesterol ester through the action of cholesterol ester transfer protein (CETP). CETP is in the bloodstream and promotes the transfer of cholesterol ester from HDL to VLDL and the reciprocal transfer of triglyceride from VLDL to HDL. Thus, the actions of LPL and CETP lead to the conversion of a triglyceride-rich particle, VLDL, to a cholesterol-rich particle, LDL.
Excessive secretion of VLDL can lead to high levels of plasma VLDL and/or high levels of plasma LDL. Overproduction of VLDL has been seen as a metabolic consequence of many mutations in the LDL receptor. In addition, a separate metabolic disorder, termed “familial combined hyperlipidemia”, also involves the overproduction of VLDL. Consequently, another strategy for dealing with disorders resulting in excessive VLDL (hypertriglyceridemia), excessive LDL (hypercholesterolemia), or both (combined hyperlipidemia) is to interfere with the production and/or secretion of VLDL. | {
"pile_set_name": "USPTO Backgrounds"
} |
A Psalm of Lament from Pre Junior Camp
Our journey through the Psalms continues. On Wednesday morning of Pre Junior Camp (3rd/4th grade), campers were invited to pick up a stone and carry it with them until Quest (morning worship). The stone represented something that weighs heavy on them; something that causes them to lament.
During Quest, campers and their counselors spent time writing their own Psalm of Lament, based on Psalm 13. The campers in Beech Cabin wrote the following, which might be words that each of us can pray today.
How long, O Lord?
Will you forget me forever?
How long until we can see you?
How long must I wait for the world to change?
How long must we wait for the war to be over?
Consider and answer me, O Lord my God!
Give us peace and kindness or the war will still go on
And the world will be filled with hatred.
But where are you God?
I can’t see you but I know you’re close.I feel your weight in my rock. | {
"pile_set_name": "Pile-CC"
} |
46 F.2d 452 (1931)
SOUTH CAROLINA ASPARAGUS GROWERS' ASS'N
v.
SOUTHERN RY. CO.
No. 3058.
Circuit Court of Appeals, Fourth Circuit.
January 13, 1931.
*453 James A. Kennedy, of Williston, S. C., and John F. Williams, of Aiken, S. C. (L. E. Croft and Henry Busbee, both of Aiken, S. C., on the brief), for appellant.
J. E. Harley, of Barnwell, S. C. (Frank G. Tompkins, of Columbia, S. C., Harley & Blatt and Sol Blatt, all of Barnwell, S. C., and L. M. Abbot, of Washington, D. C., on the brief), for appellee.
Before PARKER and NORTHCOTT, Circuit Judges, and COLEMAN, District Judge.
NORTHCOTT, Circuit Judge.
In March, 1929, appellant, South Carolina Asparagus Growers' Association, which was the plaintiff below, and which will be here referred to as the plaintiff, delivered to the appellee, the Southern Railway Company, which was the defendant below and which will be here referred to as the defendant, at Williston, S. C., for transportation a refrigerator car load of fresh asparagus, containing 910 crates. The car was delivered, in accordance with the shipping contract to Philadelphia, where it arrived promptly and in due time. On opening the car at Philadelphia the asparagus was found to be in a very bad condition, and the consignee refused to accept the shipment. The terminal carrier disposed of the same and realized $694 net after defraying the usual incidental expenses. The plaintiff brought this suit for the value of the goods, and upon the first trial below the jury rendered a verdict for the amount claimed in favor of the plaintiff. The trial judge set aside the verdict and granted a new trial. The second trial was had in February, 1930, the defendant in the meantime having paid into court the said sum of $694 admittedly received from the shipment. The trial judge directed a verdict for the plaintiff for the said sum of $694 and costs up to the time of the tender, and a judgment was entered in favor of the defendant for the costs subsequent to the tender, from which action of the court this appeal was taken.
The rule has been uniformly laid down by the United States Supreme Court that the trial judge not only may but should direct a verdict where the evidence is of such a conclusive character that if a verdict were rendered for one party, whether plaintiff or defendant, it would have to be set aside in the exercise of a sound judicial discretion. What is known as the scintilla rule has never been approved by the federal courts. Marion County v. Clark, 94 U. S. 278, 24 L. Ed. 59; Small Co. v. Lamborn & Co., 267 U. S. 248, 254, 45 S. Ct. 300, 69 L. Ed. 597; Gunning v. Cooley, 281 U. S. 90, 50 S. Ct. 231, 74 L. Ed. 720; Empire State Cattle Co. v. Atchison, T. & S. F. R. Co., 210 U. S. 1, 28 S. Ct. *454 607, 52 L. Ed. 931, 15 Ann. Cas. 70; Barrett v. Virginian Ry. Co., 250 U. S. 473, 476, 39 S. Ct. 540, 63 L. Ed. 1092.
This rule has been followed and approved by this court on a number of occasions. Anderson v. Southern Railway Co. (C. C. A.) 20 F.(2d) 71; Lamborn v. Woodard (C. C. A.) 20 F.(2d) 635; Flannagan v. Provident Life & Accident Ins. Co. (C. C. A.) 22 F. (2d) 136; Livingston v. Atlantic Coast Line R. Co. (C. C. A.) 28 F.(2d) 563; Standard Oil Co. v. Cates (C. C. A.) 28 F.(2d) 718.
Bearing in mind that in considering a motion for a directed verdict, the evidence must be regarded in the light most favorable to the opponent of the motion, and that the weight of the testimony is for the jury, after a study of the record in this case, we have reached the conclusion that the action of the trial judge was proper. There are certain physical facts, undisputed and indisputable, that forbid the plaintiff recovering in this case.
It is admitted that on the day of this shipment the plaintiff received an unusually large amount of asparagus for shipment, and had not ordered sufficient cars in which to load it. It is also admitted that this was the largest number of crates of asparagus that plaintiff ever shipped in any one car. The width of the car was 100 inches, and the evidence shows that in the car were packed 910 crates, filled with green asparagus tips. These crates measured 11 inches in width, and nine rows were placed across the car five rows high piled on top of each other. A simple mathematical calculation shows that there was only one inch of space to be distributed between the nine rows. This was clearly inadequate, showed bad packing and loading, and undoubtedly prevented proper circulation of air for the purposes of ventilation.
When the car reached its destination and was opened, the temperature in the car was taken by a food inspector, which showed the temperature at the bottom of the load to be 44 degrees, at the top of the loading 85 degrees, and in the middle (the third layer) to be 105 degrees, with a temperature on the outside of about 50 degrees. This proved conclusively lack of circulation of air, resulting from improper loading of the car. Had the cold air of 44 degrees circulated through the car, it is apparent there could have been nowhere in the car a temperature of 105 degrees.
The evidence seems conclusive that the car was transported with all due dispatch and properly iced at all points where icing was necessary.
The bill of lading, under which the car was shipped, provided that the shipment was made shipper's "load and count." This placed upon the shipper the obligation of seeing that the car was properly loaded. Specifications of standard containers for fresh fruits and vegetables filed with the Interstate Commerce Commission also required that the car be packed so that air could freely circulate between the crates. Under all these circumstances, it would be manifestly improper, in absence of any proof of negligence on the part of defendant, to permit the plaintiff to recover.
It is contended that the court erred in refusal to admit certain evidence of experts, based upon the hypothetical questions. We do not think the court erred in this respect, as the questions were not properly based upon the evidence in the case, and the experts' evidence that was excluded was only to the effect that the deterioration of the asparagus might have resulted from improper icing. While this is obvious, the evidence, as above stated, is to the effect that the car was properly iced at all points.
The point is also raised that the agent of the defendant saw the car before it was shipped, and the court refused to allow testimony to this effect to be given. The action of the court in this was manifestly proper. The agent did not attempt to undertake in behalf of the carrier the responsibility of proper loading; and had he done so, parol evidence should not have been received to vary the terms of the bill of lading which placed this responsibility upon the shipper. Old Dominion S. Co. v. Blakeman, 129 Va. 206, 105 S. E. 752; 10 C. J. p. 198, § 260, and cases there cited. And as the bill of lading was in a form and upon a rate approved by the Interstate Commerce Commission, no agent of a carrier could have been authorized to vary its terms for the advantage of a shipper by undertaking additional responsibility on behalf of the carrier. Chicago & Alton R. Co. v. Kirby, 225 U. S. 155, 165, 32 S. Ct. 648, 56 L. Ed. 1033, Ann. Cas. 1914A, 501; Adams Express Co. v. Burr Oak Jersey Farm, 182 Ky. 116, 206 S. W. 173. Mere knowledge on the part of the local agent of the carrier of the negligent manner in which the shipment had been packed could not impose liability for this negligence on the carrier, where the shipper itself had expressly undertaken the packing and the injury sustained was due to negligence in *455 this regard and not to any negligence on the part of the carrier. Ross v. Troy, etc., R. Co., 49 Vt. 364, 24 Am. Rep. 144. As said by the Supreme Court of Vermont in the case cited:
"It seems incongruous for the plaintiff to claim that the defendant should overjudge him in a matter in which he assumed to judge and to do all that he required or supposed necessary to be done in the premises, and that the defendant should be responsible for the inadequacy of what the plaintiff adjudged and did. If things continued to be just as the plaintiff had fixed them, and nothing occurred in the transportation, against which the defendant was bound to exercise precautions beyond what the plaintiff had done, there would seem to be no ground for holding the defendant liable for the plaintiff's shortcoming."
There was no error in the trial, and the learned judge below properly directed the verdict. The case is accordingly affirmed.
| {
"pile_set_name": "FreeLaw"
} |
AMERICAN ASSOCIATION OF CLINICAL ENDOCRINOLOGISTS AND AMERICAN COLLEGE OF ENDOCRINOLOGY PROTOCOL FOR STANDARDIZED PRODUCTION OF CLINICAL PRACTICE GUIDELINES, ALGORITHMS, AND CHECKLISTS - 2017 UPDATE.
Clinical practice guideline (CPG), clinical practice algorithm (CPA), and clinical checklist (CC, collectively CPGAC) development is a high priority of the American Association of Clinical Endocrinologists (AACE) and American College of Endocrinology (ACE). This 2017 update in CPG development consists of (1) a paradigm change wherein first, environmental scans identify important clinical issues and needs, second, CPA construction focuses on these clinical issues and needs, and third, CPG provide CPA node/edge-specific scientific substantiation and appended CC; (2) inclusion of new technical semantic and numerical descriptors for evidence types, subjective factors, and qualifiers; and (3) incorporation of patient-centered care components such as economics and transcultural adaptations, as well as implementation, validation, and evaluation strategies. This third point highlights the dominating factors of personal finances, governmental influences, and third-party payer dictates on CPGAC implementation, which ultimately impact CPGAC development. The AACE/ACE guidelines for the CPGAC program is a successful and ongoing iterative exercise to optimize endocrine care in a changing and challenging healthcare environment. AACE = American Association of Clinical Endocrinologists ACC = American College of Cardiology ACE = American College of Endocrinology ASeRT = ACE Scientific Referencing Team BEL = best evidence level CC = clinical checklist CPA = clinical practice algorithm CPG = clinical practice guideline CPGAC = clinical practice guideline, algorithm, and checklist EBM = evidence-based medicine EHR = electronic health record EL = evidence level G4GAC = Guidelines for Guidelines, Algorithms, and Checklists GAC = guidelines, algorithms, and checklists HCP = healthcare professional(s) POEMS = patient-oriented evidence that matters PRCT = prospective randomized controlled trial. | {
"pile_set_name": "PubMed Abstracts"
} |
Paul Korir (bishop)
Paul Korir is a Kenyan Anglican bishop: since 2016 he has been the inaugural Bishop of Kapsabet.
References
Category:Living people
Category:Kenyan Anglicans
Category:21st-century Anglican bishops
Category:Bishops of Kapsabet | {
"pile_set_name": "Wikipedia (en)"
} |
Case: 13-11052 Document: 00512940123 Page: 1 Date Filed: 02/19/2015
IN THE UNITED STATES COURT OF APPEALS
FOR THE FIFTH CIRCUIT
United States Court of Appeals
Fifth Circuit
FILED
No. 13-11052 February 19, 2015
Lyle W. Cayce
CONTENDER FARMS, L.L.P.; MIKE MCGARTLAND, Clerk
Plaintiffs - Appellants
v.
UNITED STATES DEPARTMENT OF AGRICULTURE,
Defendant - Appellee
Appeal from the United States District Court
for the Northern District of Texas
Before JOLLY and JONES, Circuit Judges, and GODBEY*, District Judge.
E. GRADY JOLLY, Circuit Judge:
Contender Farms, L.L.P. and Mike McGartland appeal the district
court’s order granting summary judgment in favor of the United States
Department of Agriculture (“USDA”). McGartland owns Contender Farms,
and each actively participates in the Tennessee walking horse industry by
buying, selling, and exhibiting horses. They challenge a USDA regulation (the
“Regulation”) promulgated under the Horse Protection Act (“HPA”), 15 U.S.C.
§§ 1821–31, requiring that private entities, known as Horse Industry
Organizations (“HIOs”), impose mandatory suspensions on those participants
* District Judge of the Northern District of Texas, sitting by designation.
Case: 13-11052 Document: 00512940123 Page: 2 Date Filed: 02/19/2015
No. 13-11052
found to engage in a practice known as “soring.” 1 Soring is prohibited by the
HPA, and the USDA, through various contractual arrangements, has long
relied on HIOs to provide inspectors at Tennessee walking horse events.
According to Contender Farms and McGartland, this new Regulation
exceeds the USDA’s rulemaking authority under Chevron, U.S.A., Inc. v.
Natural Resources Defense Council, Inc., 467 U.S. 837 (1984), violates the
Administrative Procedure Act, 5 U.S.C. §§ 701–06, and fails to account for its
impact on small businesses under the Regulatory Flexibility Act, 5 U.S.C. §§
601–12. They also argue that the Regulation deprives them of due process and
violates the separation of powers. The USDA disputes each contention, and it
further argues that Contender Farms and McGartland fail to present a
justiciable controversy on grounds of standing and ripeness.
At summary judgment, the district court held that Contender Farms and
McGartland presented a justiciable controversy, but it entered a final
judgment in favor of the USDA on the merits of the challenge, concluding that
the Regulation is valid. The parties renew these arguments on appeal. For
the reasons that follow, we AFFIRM the district court’s holding as to
justiciability, REVERSE and VACATE its ruling on the merits, and REMAND
the case for entry of judgment in favor of Contender Farms and McGartland.
I.
To resolve this appeal, we must interpret both the HPA and the USDA
regulations promulgated under the HPA. Ultimately, we must decide whether
1 “Soring” is a process through which trainers may artificially achieve the distinctive
gait prized in Tennessee walking horses. A trainer can teach a horse to attain this gait
through legitimate means, but some trainers may produce a similar gait in a horse by
applying chemical agents to the skin or utilizing other methods to induce pain in a horse’s
legs. These latter practices are known as soring.
2
Case: 13-11052 Document: 00512940123 Page: 3 Date Filed: 02/19/2015
No. 13-11052
the Regulation falls within the scope of the USDA’s authority under the HPA.
We begin with a summary of the statutory and regulatory framework.
The HPA requires the USDA to “prescribe by regulation requirements
for the appointment by the management of any horse show, horse exhibition,
or horse sale or auction of persons qualified to detect and diagnose a horse
which is sore or to otherwise inspect horses for the purposes of enforcing this
chapter.” 15 U.S.C. § 1823(c). Under the HPA, the management of each horse
show serves as primary enforcer of the HPA. The HPA provides to the
respective managements a choice: (1) decline to hire USDA-approved
inspectors and accept liability for failing to disqualify a sored horse,
irrespective of whether such management knows that the horse is a sore; or (2)
hire USDA-approved inspectors and face liability only if management allows
the horse to compete after being told that it is a sore. Id. at §§ 1824(3) & (5).
Most of the major Tennessee walking horse events have chosen to avoid “strict
liability” and followed the second option.
Pursuant to the provisions of § 1823(c), the USDA does not employ its
own inspectors. Instead, the USDA created, by regulation, what the parties
call the “DQP program.” The USDA authorizes designated qualified persons
(“DQPs”), private individuals holding a valid DQP license, to inspect horses at
events. 9 C.F.R. § 11.7(a). In turn, the USDA requires that “[l]icensing of
DQP’s will be accomplished only through DQP programs certified by the
Department and initiated and maintained by horse industry organizations or
associations [i.e., HIOs].” Id. at § 11.7(b). The USDA established various
requirements for HIO-administered training programs, including required
hours of classroom instruction in particular topics, production of a sample
examination, criteria for maintaining qualifications and performance abilities,
methods for insuring uniform interpretation and enforcement of the HPA, and
3
Case: 13-11052 Document: 00512940123 Page: 4 Date Filed: 02/19/2015
No. 13-11052
standards of conduct for inspectors. Id. HIOs must also submit their rulebooks
to the USDA. Id. at § 11.41.
Under this program, an event’s management that wishes to have DQPs
perform inspections contracts with an HIO, which then provides the DQPs who
perform the inspections. To participate in the event, a competitor must agree
to be bound by that HIO’s procedures. Traditionally, HIOs imposed penalties
for soring violations and provided procedures for appealing those penalties.
HIOs were free, however, to vary their penalties and appeals procedures, and
competitors had a choice to select events, which could be based in part on a
particular HIO’s penalties and procedures. Both parties admit that HIO
penalties varied, with some imposing mandatory suspensions for certain soring
violations and others declining to impose the more stringent penalties.
For years the USDA has sought to reduce such disparities among HIOs.
Initially, the USDA entered into voluntary “Operating Plans” with HIOs
whereby cooperating HIOs agreed to impose certain penalties for particular
violations and honor suspension lists from other HIOs. In 2010, the HIOs could
not agree with the USDA on an operating plan. That same year the USDA
Office of Inspector General released a report (the “OIG Report”), which
concluded that the private system of HPA enforcement through HIOs yielded
inconsistent enforcement of the HPA and failed to address adequately the
problem of soring.
As a result of the OIG Report, the USDA proposed the Regulation. It
solicited public comments on the Regulation and adopted it as a Final Rule in
June 2012. The Regulation requires that HIOs adopt mandatory minimum
penalties for a number of soring violations as a condition of certification for
participation in the DQP program. 9 C.F.R. § 11.25(c). Additionally, the
Regulation requires HIOs to adopt an appeals process that “must be approved
by the [USDA],” and “the appeal must be granted and the case heard and
4
Case: 13-11052 Document: 00512940123 Page: 5 Date Filed: 02/19/2015
No. 13-11052
decided by the HIO or the violator must begin serving the penalty within 60
days of the date of the violation.” Id. at § 11.25(e). The Regulation also
reiterates that the USDA may institute its own enforcement proceedings
pursuant to its authority under the HPA “with respect to any violation of the
[HPA], including violations for which penalties are assessed in accordance with
this section.” Id. at § 11.25(f).
II.
We first consider whether Contender Farms and McGartland present a
justiciable controversy. The USDA has raised an issue of standing and an issue
of ripeness. We review both issues de novo, and we examine each in turn.
Roark & Hardee LP v. City of Austin, 522 F.3d 533, 542 (5th Cir. 2008).
A.
We begin with the basic proposition that the Constitution limits our
jurisdiction to “Cases” and “Controversies.” U.S. Const. Art. III, § 2. The
doctrine of standing flows from this constitutional limitation and is an
essential aspect of it. Lujan v. Defenders of Wildlife, 504 U.S. 555, 560 (1992);
Simon v. E. Ky. Welfare Rights Org., 426 U.S. 26, 37 (1976). “At bottom, ‘the
gist of the question of standing’ is whether [the parties invoking standing] have
‘such a personal stake in the outcome of the controversy as to assure that
concrete adverseness which sharpens the presentation of issues upon which
the court so largely depends for illumination.’” Massachusetts v. Envtl. Prot.
Agency, 549 U.S. 497, 517 (2007) (quoting Baker v. Carr, 369 U.S. 186, 204
(1962)).
Contender Farms and McGartland can satisfy the constitutional
elements of standing by “present[ing] (1) an actual or imminent injury that is
concrete and particularized, (2) fairly traceable to the defendant’s conduct, and
(3) redressable by a judgment in [their] favor.” Duarte ex rel. Duarte v. City of
Lewisville, Tex., 759 F.3d 514, 517 (5th Cir. 2014). They must also support
5
Case: 13-11052 Document: 00512940123 Page: 6 Date Filed: 02/19/2015
No. 13-11052
each standing element “in the same way as any other matter on which the
plaintiff bears the burden of proof, i.e., with the manner and degree of evidence
required at the successive stages of the litigation.” Lujan, 504 U.S. at 561. 2
We conclude that Contender Farms and McGartland satisfy each of the three
elements.
1.
We initiate our discussion by addressing a basic question that underlies
all three elements of standing—“whether the plaintiff is himself an object” of
the challenged regulation. Id. at 561. If a plaintiff is an object of a regulation
“there is ordinarily little question that the action or inaction has caused him
injury, and that a judgment preventing or requiring the action will redress it.”
Id. at 561–62. By contrast, “when the plaintiff is not himself the object of the
government action or inaction he challenges, standing is not precluded, but it
is ordinarily substantially more difficult to establish.” Id. at 562 (internal
quotation marks omitted). As this distinction is often a helpful guidepost in
the standing inquiry, we examine this matter first and conclude that
Contender Farms and McGartland are objects of the Regulation. See Duarte,
759 F.3d at 518.
Whether someone is in fact an object of a regulation is a flexible inquiry
rooted in common sense. For example, in Duarte, we addressed a city
ordinance prohibiting registered sex offenders from establishing residence
near areas where children gather. Id. at 515. A registered sex offender, along
2 As this case is before us on a motion for summary judgment, Contender Farms and
McGartland must set forth sufficient facts that comply with Rule 56 of the Federal Rules of
Civil Procedure. Lujan, 504 U.S. at 561. We note, however, that the district court considered
this case through a unique procedure that was, in its terms, “in effect, a bench trial on the
written briefs.” Neither party indicates that this procedure alters our standard of review on
the standing issue. The district court concluded that Contender Farms and McGartland
clearly presented a justiciable controversy, and as we explain infra, we agree.
6
Case: 13-11052 Document: 00512940123 Page: 7 Date Filed: 02/19/2015
No. 13-11052
with his wife and daughters, challenged the ordinance. We concluded that the
registered sex offender was a target of the ordinance, and we “reach[ed] the
same conclusion with respect to [his] wife and daughters.” Id. at 518. The city
made the argument that the USDA makes today: that the ordinance applies
by its terms only to the individual regulated and not to aggrieved, yet
unnamed, parties. We rejected this argument, noting that it “overlooks the
practical impact of the Lewisville ordinance on the family [of the sex offender].”
Id. Thus, we concluded that the family members demonstrated a level of
interference as to their lives that was sufficient to establish standing to
challenge the regulation.
The Third Circuit applied a similar analysis when a number of sports
leagues challenged a New Jersey statute permitting betting on many types of
sporting events. Nat’l Collegiate Athletic Ass’n v. Governor of New Jersey, 730
F.3d 208 (3d Cir. 2013) (“NCAA”). In NCAA, the court noted that New Jersey’s
law “does not directly regulate the Leagues, but instead regulates the activities
that may occur at the State’s casinos and racetracks.” Id. at 219. Although
the court expressed reluctance in concluding that the sports leagues could
satisfy the standing requirements merely by pointing to the statute, it noted
that the law is “in a sense, as much directed at the Leagues’ events as it is
aimed at the casinos.” Id. Thus, “[t]his is not a generalized grievance like
those asserted by environmental groups over regulation of wildlife in cases
where the Supreme Court has found no standing.” Id.
Applying this commonsense approach to the facts in this case, it is clear
that Contender Farms and McGartland are objects of the Regulation. By its
terms, the Regulation requires an HIO to enforce USDA-approved minimum
suspension penalties for many types of soring violations. 9 C.F.R. § 11.25(a).
This requirement targets participants in Tennessee walking horse events like
Contender Farms and McGartland. The Regulation states that in the event a
7
Case: 13-11052 Document: 00512940123 Page: 8 Date Filed: 02/19/2015
No. 13-11052
DQP discovers a violation, “any individuals who are responsible for showing
the horse, exhibiting the horse, entering or allowing the entry of the horse in a
show or exhibition, selling the horse, auctioning the horse, or offering the horse
for sale or auction must be suspended.” Id. at § 11.25(b)(1). Thus, the
suspensions target participants in Tennessee walking horse events like
Contender Farms and McGartland, and they are as much objects of the
Regulation as the HIOs themselves.
The Regulation requires that an HIO “provide a process in its rulebook
for alleged violators to appeal penalties.” Id. at § 11.25(e). Contender Farms
and McGartland must accept an HIO’s rulebook as a condition of entry. In the
event of any soring violation, they would be subject to the USDA-approved
appeal procedures. To compete in an event, Contender Farms and McGartland
must agree to be bound by the appeal process found in the HIO’s rulebook.
Although the HIOs must maintain the appeal procedures, event participants
are actually subject to them. Contender Farms and McGartland indicate that
they will continue to participate in these events, and they will be bound by
these procedures.
We find unpersuasive the USDA’s argument that the Regulation targets
only those horse owners who sore horses, not owners like Contender Farms
and McGartland who purportedly do not. All participants in a competition that
uses HIOs agree at the outset to be bound by the terms of the HIO’s rulebook,
which includes the now-mandatory suspension and appeal procedures. The
participants also agree to be bound by the inspection procedures. As the record
indicates, inspections are far more art than science. In many cases, inspectors,
veterinarians, and other professionals will disagree as to whether a horse is
actually a sore. The record also suggests that those who actually sore their
horses will go to great lengths to hide the results in order to avoid detection,
which further muddies the waters with regard to inspections.
8
Case: 13-11052 Document: 00512940123 Page: 9 Date Filed: 02/19/2015
No. 13-11052
Finally, we also reject the USDA’s argument that Contender Farms and
McGartland lack standing because they are not “forced” to use HIO-affiliated
shows. The record establishes that the preeminent events in the Tennessee
walking horse industry affiliate with HIOs; Contender Farms and McGartland
suggest that they could neither earn a living nor compete recreationally
without participating in these events. Contender Farms and McGartland are
objects of the Regulation because they participate in the type of events that the
Regulation seeks to regulate, i.e., the major Tennessee walking horse events.
To be clear, this Regulation actually depends on the participation of parties
like Contender Farms and McGartland. Thus, we conclude that they are
objects of the Regulation.
2.
Next, we find no reason to depart from the ordinary rule that Contender
Farms and McGartland, as objects of the Regulation, may challenge it.
Contender Farms and McGartland demonstrate a concrete injury resulting
from the Regulation that would be redressable by a favorable decision of this
Court.
An increased regulatory burden typically satisfies the injury in fact
requirement. See Ass’n of Am. R.R.s v. Dep’t of Transp., 38 F.3d 582 (D.C. Cir.
1994) (“American Railroads”). In American Railroads, challengers to a
regulation argued that a new rule required them to comply with two sets of
regulations enforced by two agencies instead of one. Id. at 585. The court
concluded that the assertion that railroads “are materially harmed by the
additional regulatory burden imposed upon them as the result of a federal
agency’s unlawful adoption of a rule” established standing. Id. at 586.
The Regulation amounts to an increased regulatory burden. Under the
Regulation, competitors like Contender Farms and McGartland now face
harsher, mandatory penalties from HIOs. Additionally, they may also face
9
Case: 13-11052 Document: 00512940123 Page: 10 Date Filed: 02/19/2015
No. 13-11052
prosecution from the USDA pursuant to its own enforcement authority.
Naturally, Contender Farms and McGartland, along with any other
competitors, must take additional measures to avoid even the appearance of
soring. Contender Farms and McGartland must also agree to the new
procedures when they enter a competition, and they forfeit their rights under
the previous regulatory framework to “shop around” among competitions
employing different HIOs.
Causation and redressability then flow naturally from the injury. The
record indicates that HIOs offered a range of penalties and appeals procedures
before the USDA adopted the Regulation. Although the USDA correctly notes
that HIOs could impose penalties before the promulgation of the Regulation,
the record indicates that a number of the HIOs previously opposed mandatory
minimum suspensions. 3 If we find that the Regulation is invalid, Contender
Farms and McGartland can again participate in competitions with a range of
available sanctions and appellate processes.
In sum, Contender Farms and McGartland have standing to challenge
the Regulation because they are objects of the Regulation, and they have
independently satisfied the three prongs of constitutional standing.
B.
Alternatively, the USDA contends that Contender Farms and
McGartland have not presented a ripe controversy even if they can meet the
elements of standing. According to the USDA, the dispute is unripe because
there is only a remote possibility that Contender Farms and McGartland will
actually be subject to the mandatory minimum suspensions under the
3 SHOW, Inc., which was a party before the district court, resisted the Regulation.
SHOW had not imposed mandatory suspensions prior to the Regulation, and it opposed such
penalties after the USDA promulgated the Regulation. Although it was once the largest HIO,
it is apparently now inactive.
10
Case: 13-11052 Document: 00512940123 Page: 11 Date Filed: 02/19/2015
No. 13-11052
Regulation because they do not purport to sore horses. We conclude, however,
that the dispute is ripe for review.
The ripeness and standing analyses are closely related, as ripeness
inquires as to “‘whether the harm asserted has matured sufficiently to warrant
judicial intervention.’” Miss. State Democratic Party v. Barbour, 529 F.3d 538,
544–45 (5th Cir. 2008) (quoting Warth v. Seldin, 422 U.S. 490, 499 n.10 (1975)).
The USDA argues that this is a pre-enforcement challenge to the Regulation,
and in such cases “[a]n allegation of future injury may suffice if the threatened
injury is certainly impending, or there is a substantial risk that the harm will
occur.” Susan B. Anthony List v. Driehaus, 134 S. Ct. 2334, 2341 (2014)
(internal quotation marks omitted). When the parties challenge a regulation,
the ripeness inquiry seeks
to prevent the courts, through avoidance of premature
adjudication, from entangling themselves in abstract
disagreements over administrative policies, and also to protect the
agencies from judicial interference until an administrative
decision has been formalized and its effects felt in a concrete way
by the challenging parties.
Abbott Laboratories v. Gardner, 387 U.S. 136, 148–49 (1967) (abrogated on
other grounds by Califano v. Sanders, 430 U.S. 99, 105 (1977)).
First, we observe that Contender Farms and McGartland raise a purely
legal challenge to the Regulation. If we adopt their view, the Regulation
exceeds the USDA’s authority as granted by Congress and violates various
constitutional principles. Thus, “[i]t is unnecessary to wait for the [Regulation]
to be applied in order to determine its legality.” Nat’l Envtl. Dev. Ass’n’s Clean
Air Project v. Envtl. Prot. Agency, 752 F.3d 999, 1008 (D.C. Cir. 2014).
Moreover, the USDA has promulgated a final rule, and it appears from this
litigation that it has every intention of requiring HIOs to adopt these
11
Case: 13-11052 Document: 00512940123 Page: 12 Date Filed: 02/19/2015
No. 13-11052
requirements or face decertification from the DQP program. As we explained
above, this will affect Contender Farms and McGartland.
As the Supreme Court noted in Driehaus, “[n]othing in this Court’s
decisions requires a plaintiff who wishes to challenge the constitutionality of a
law to confess that he will in fact violate that law.” 134 S. Ct. at 2345. The
challenge here is similar to that in Driehaus, where a public interest group
challenged an Ohio law prohibiting false advertising about a political
candidate. The group had accused a congressional candidate of supporting a
measure that included “taxpayer-funded abortion,” and the candidate filed a
challenge based on the false advertising law. Id. at 2339. A panel found
probable cause that the group violated the law, but the candidate lost and
dropped his challenge before it could be finally resolved. Id. at 2339–40. To
support justiciability, the group claimed that it intended to engage in similar
future activity, and it sought to proceed with its challenge to the law. Id. at
2343. The Supreme Court concluded that the alleged future conduct was
“arguably” proscribed by the law, particularly given its broad reach. Id. at
2344. This Regulation targets soring, which is a practice that yields a large
number of “false positives.” Inspectors face significant difficulties
distinguishing violators from non-violators. As in Driehaus, Contender Farms
and McGartland will encounter these risks because they intend to participate
in these events in the future.
Accordingly, we hold that the dispute is ripe for review. We therefore
AFFIRM the district court’s ruling as to justiciability, and we proceed to
analyze the merits of the challenge to the Regulation.
III.
Because the USDA is statutorily authorized to administer the HPA, we
review the merits of the regulation under the well-established principles of
Chevron, U.S.A., Inc. v. Natural Resources Defense Council, Inc., 467 U.S. 837
12
Case: 13-11052 Document: 00512940123 Page: 13 Date Filed: 02/19/2015
No. 13-11052
(1984). Dhuka v. Holder, 716 F.3d 149, 154 (5th Cir. 2013). Under Chevron,
we must first decide whether “Congress has directly spoken to the precise
question at issue,” and if it has, we apply Congress’s answer to the question.
467 U.S. at 842–43. Alternatively, “if the statute is silent or ambiguous with
respect to the specific issue, the question for the court is whether the agency’s
answer is based on a permissible construction of the statute.” Id. at 843. Our
goal at all times is to effectuate congressional intent, as we presume “that
Congress, when it left ambiguity in a statute administered by an agency,
understood that the ambiguity would be resolved, first and foremost, by the
agency, and desired the agency (rather than the courts) to possess whatever
degree of discretion the ambiguity allows.” City of Arlington, Tex. v. Fed.
Commc’ns Comm’n, 133 S. Ct. 1863, 1868 (2013) (internal quotation marks
omitted).
The district court concluded that the HPA did not address the precise
question at issue and, proceeding to the second prong of Chevron, it found that
the USDA’s construction of the statute was reasonable. On appeal, the USDA
and its amici urge us to adopt the district court’s interpretation of the HPA.
Contender Farms and McGartland argue that the HPA addresses this issue
and the statute clearly prohibits the Regulation. For the reasons that follow,
we agree with Contender Farms and McGartland, and thus we REVERSE and
VACATE the district court’s ruling on this ground without reaching either the
second prong of Chevron or the various other issues that Contender Farms and
McGartland raise. See Texas v. United States, 497 F.3d 491, 499 (5th Cir. 2007)
(avoiding various constitutional issues by finding that the regulation at issue
failed under Chevron). We outline the relevant law, parse the Regulation, and
then apply the law to the HPA to decide this case.
13
Case: 13-11052 Document: 00512940123 Page: 14 Date Filed: 02/19/2015
No. 13-11052
A.
To determine whether a statute is ambiguous, we evaluate it using the
“traditional tools of statutory construction.” Chevron, 467 U.S. at 843 n.9.
Unlike the deference given to agency interpretations of ambiguous statutes,
“[t]he judiciary is the final authority on issues of statutory construction and
must reject administrative constructions which are contrary to clear
congressional intent.” Id. Indeed, “[w]here Congress has established a clear
line, the agency cannot go beyond it.” City of Arlington, 133 S. Ct. at 1874.
We determine whether a statute is ambiguous based in part on “the text
itself, its history, and its purpose.” Bellum v. PCE Constructors, Inc., 407 F.3d
734, 739 (5th Cir. 2005). Canons of statutory interpretation further assist us
in assessing the meaning of a statute. See Miss. Poultry Ass’n, Inc. v. Madigan,
31 F.3d 293, 307 (5th Cir. 1994). Several basic considerations guide our inquiry
under these canons: (1) we begin with the statute’s language; (2) we give
undefined words “their ordinary, contemporary, common meaning;” (3) we read
the statute’s words in proper context and consider them based on the statute
as a whole; and (4) we consider a statute’s terms in the light of the statute’s
purposes. Wilderness Soc’y v. U.S. Fish & Wildlife Serv., 353 F.3d 1051, 1060
(9th Cir. 2003) (internal quotation marks omitted); see also Bell Atl. Tel. Cos.
v. Fed. Commc’ns Comm’n, 131 F.3d 1044, 1047 (D.C. Cir. 1997) (explaining
that “text, legislative history, and structure” are traditional tools of statutory
interpretation).
Our review is ultimately “‘bound, not only by the ultimate purposes
Congress has selected but by the means it has deemed appropriate, and
prescribed, for the pursuit of those purposes.’” Texas, 497 F.3d at 502 (quoting
MCI Telecomm. Corp. v. AT&T Co., 512 U.S. 218, 231 n.4 (1994)) (emphasis
removed). We do not merely presume that a power is delegated if Congress
does not expressly withhold it, as then “‘agencies would enjoy virtually
14
Case: 13-11052 Document: 00512940123 Page: 15 Date Filed: 02/19/2015
No. 13-11052
limitless hegemony, a result plainly out of keeping with Chevron and quite
likely with the Constitution as well.’” Id. at 503 (quoting Ethyl Corp. v. EPA,
51 F.3d 1053, 1060 (D.C. Cir. 1995)). Thus, an administrative agency does not
receive deference under Chevron merely by demonstrating that “a statute does
not expressly negate the existence of a claimed administrative power (i.e., when
the statute is not written in “thou shalt not” terms).” Ry. Labor Execs.’ Ass’n
v. Nat’l Mediation Bd., 29 F.3d 655, 671 (D.C. Cir. 1994) (emphasis in the
original).
With these principles in mind, we turn first to the challenged Regulation
and then to the USDA’s regulatory authority under the HPA.
B.
Speaking somewhat broadly, we can say that the Regulation alters but
does not eliminate the longstanding practices surrounding the DQP program:
HIOs train and certify DQPs according to USDA requirements, which persons
then inspect horses at those shows at which the management has contracted
with an HIO to provide DQPs. We will now proceed to the relevant aspects of
the Regulation.
First, the Regulation imposes mandatory minimum penalties that must
be assessed by HIOs for soring violations. Previously, HIOs developed and
enforced their own penalties according to their rulebooks. Although HIOs were
required to provide copies of these rulebooks to the USDA, the USDA was not
formally involved in writing or imposing penalty assessments. See 9 C.F.R. §
11.41 (requiring HIOs to annually furnish the USDA with their rulebooks and
disciplinary procedures). Instead, the USDA attempted to influence HIOs
through voluntary agreements. Under this Regulation, however, “[e]ach HIO
that licenses DQPs . . . must include in its rulebook, and enforce, penalties for
the violations listed in this section that equal or exceed the penalties listed in
paragraph (c) of this section and must also enforce the requirement in
15
Case: 13-11052 Document: 00512940123 Page: 16 Date Filed: 02/19/2015
No. 13-11052
paragraph (d) of this section.” Id. at § 11.25(a) (emphasis added). Thus, the
Regulation establishes the penalties that HIOs must impose as a condition of
HIO participation in the DQP program. 4
Second, the Regulation requires that HIOs establish particular appeals
procedures to address disagreements over DQP findings of violations.
Specifically, the Regulation provides:
The HIO must provide a process in its rulebook for alleged
violators to appeal penalties. The process must be approved by the
Department. For all appeals, the appeal must be granted and the
case heard and decided by the HIO or the violator must begin
serving the penalty within 60 days of the date of the violation. The
HIO must submit to the Department all decisions on penalty
appeals within 30 days of the completion of the appeal. When a
penalty is overturned on appeal, the HIO must also submit
evidence composing the record of the HIO’s decision on the appeal.
Id. at § 11.25(e). Contender Farms and McGartland primarily argue that the
sixty-day requirement imposed by the USDA makes it nearly impossible for
HIOs adequately to consider the complex issues that often arise with soring
allegations. They also argue that the USDA has not given the HIOs sufficient
time to adopt appropriate appeal procedures. Finally, Contender Farms and
McGartland argue that there is insufficient judicial review of these procedures.
4 These mandatory penalties are significant. Contender Farms and McGartland focus
on suspensions for bilateral soring violations, where a horse is sore in both forelimbs or
hindlimbs, unilateral soring violations, where a horse is sore in one of its forelimbs or
hindlimbs, and violations of the scar rule. Bilateral soring violations require mandatory
suspensions of one year for a first time violation, two years for a second violation, and four
years for any subsequent violations. 9 C.F.R. § 11.25(c)(1). Unilateral soring violations
require mandatory suspensions of sixty days for a first offense, one hundred twenty days for
a second offense, and one year for subsequent offenses. Id. at § 11.25(c)(2). For scar rule
violations, violators receive mandatory suspensions of fourteen days for a first offense, sixty
days for a second offense, and one year for subsequent offenses. Id. at § 11.25(c)(3).
16
Case: 13-11052 Document: 00512940123 Page: 17 Date Filed: 02/19/2015
No. 13-11052
Third, the Regulation authorizes the USDA to initiate its own
prosecutions for HPA violations, even if the HIOs penalize a violator in
accordance with § 11.25(c). Indeed, the Regulation provides:
The Department retains the authority to initiate enforcement
proceedings with respect to any violation of the Act, including
violations for which penalties are assessed in accordance with this
section, and to impose the penalties authorized by the Act if the
Department determines that such actions are necessary to fulfill
the purpose of the Act and this part. In addition, the Department
reserves the right to inform the Attorney General of any violation
of the Act or of this part, including violations for which penalties
are assessed in accordance with this section.
Id. at § 11.25(f). As the USDA asserts on appeal, it has not delegated its
enforcement power under the HPA because it expressly reserves its own right
to seek civil or criminal penalties. Similarly, it appears that a violator could
be exonerated by the HIO yet still prosecuted by the USDA on its own authority
under the HPA. Indeed, the appeals procedure requires the HIO to submit its
records to the USDA, and it appears that the Regulation may encourage such
prosecutions. See id. at §§ 11.25(e)–(f).
In sum, the Regulation is an indisputably significant effort by the USDA
to become involved in HIO enforcement procedures. Although participants in
horse shows have always been subject to regulations from both HIOs and the
USDA, the USDA has now taken intrusive steps into the private scheme to
strengthen the penalties that HIOs must levy against those found to sore
horses. Additionally, the USDA significantly increased its oversight of HIO
review procedures. In the past the HIOs could develop their own appeal
procedures, but these procedures must now be approved by the USDA and
reconfigured in accordance with the USDA’s specific requirements. So, we now
move on to decide whether the HPA contemplates such USDA involvement in
17
Case: 13-11052 Document: 00512940123 Page: 18 Date Filed: 02/19/2015
No. 13-11052
HIO enforcement mechanisms and, as we explain below, we conclude that it
does not.
C.
The USDA purports to draw its authority to adopt the Regulation from
several provisions of the HPA. Upon examining these provisions, we conclude
that none of these provisions authorizes the Regulation but conversely, that
these provisions plainly prohibit the Regulation.
1.
First, to justify the extension of its authority asserted in the Regulation,
the USDA invokes its statutory duty to regulate horse inspectors under §
1823(c). The HPA provides as follows:
The Secretary shall prescribe by regulation requirements for the
appointment by the management of any horse show, horse
exhibition, or horse sale or auction of persons qualified to detect
and diagnose a horse which is sore or to otherwise inspect horses
for the purposes of enforcing this chapter.
15 U.S.C. § 1823(c) (emphasis added). The USDA invoked this provision when
it issued its notice of a Final Rule, stating that “requiring HIOs to implement
a minimum penalty protocol would strengthen our enforcement of the [HPA]
by ensuring that minimum penalties are assessed and enforced consistently by
all HIOs that are certified under the regulations pursuant to [§ 1823] of the
[HPA].” 77 Fed. Reg. at 33,608. The Regulation plainly imposes conditions of
certification for HIOs that build upon the more general regulations the USDA
already imposes. See 9 C.F.R. § 11.25(a) (referencing the certification
conditions in 9 C.F.R. § 11.7).
As always, we begin our initial inquiry by looking to the plain language
of § 1823(c). Here, when reduced to its essence, the provision permits the
USDA to promulgate “requirements for the appointment by the management .
. . of persons qualified to detect and diagnose a horse . . . or to otherwise inspect
18
Case: 13-11052 Document: 00512940123 Page: 19 Date Filed: 02/19/2015
No. 13-11052
horses.” 15 U.S.C. § 1823(c). Its meaning hinges on two terms undefined by
the statute—“requirements” and “qualified.” Thus, turning to the common
understanding of these words, a “requirement” is commonly: “1. That which is
required; something needed. 2. Something obligatory: a prerequisite.” The
American Heritage Dictionary of the English Language 1105 (William Morris
ed. 1981). A person is “qualified” if he or she is “[c]ompetent, suited, or having
met the requirements for a specific position or task.” Id. at 1067. 5
The USDA relies heavily on the broad definition of “requirements,”
arguing that the Regulation merely adopts new “requirements for HIOs” that
participate in the DQP program. This may well be true, but the argument is
off target. The statutory authorization to promulgate “requirements” refers,
not to requirements for HIOs, but requirements for “persons” to perform
inspections of horses. Section 1823(c) does not authorize the USDA to adopt,
carte blanche, any condition that it wishes for participation in the DQP
program. Instead, a “requirement” promulgated pursuant to § 1823(c) must
relate to whether “persons” are “qualified” to inspect horses for evidence of
soring. Thus, an event’s management must appoint inspectors deemed
“qualified” by the USDA pursuant to its regulations.
The Regulation here extends the authority of the USDA beyond that
statutorily defined mission. Although federal agencies often possess broad
authorities to regulate behavior, an agency may not “create from whole cloth
new liability provisions.” Nat’l Pork Producers Council v. U.S. Envtl. Prot.
Agency, 635 F.3d 738, 753 (5th Cir. 2011) (“Pork Producers”). For example, in
Pork Producers the EPA attempted to impose liability on certain animal
5 Indeed, other dictionaries define both terms using similar language. See, e.g., The
Random House Dictionary of the English Language, The Unabridged Edition 1174, 1219
(Jess Stein ed. 1981).
19
Case: 13-11052 Document: 00512940123 Page: 20 Date Filed: 02/19/2015
No. 13-11052
feeding operations under the Clean Water Act if those operations “propose” to
discharge various pollutants into waterways. 635 F.3d at 750–51. We
concluded that the Clean Water Act only regulates those who discharge and
not those who propose to discharge; thus, the regulation violated the Clean
Water Act. Id. at 751. We concluded that the EPA could not stray beyond the
statute, which evinces the intent of Congress. Id. at 751–52.
The USDA urges that its new enforcement regime is a proper assertion
of its statutory authority because the HPA anticipates the DQP program, and
consequently, this parallel enforcement scheme is within its statutory
authorization. But nothing in § 1823(c) contemplates USDA involvement in
the enforcement procedures of HIOs. Although nothing in the HPA prohibits
HIOs from voluntarily adopting such procedures, such statutory silence is far
from a grant of authority that permits the USDA to promulgate regulations
imposing uniform penalties. Section 1823(c) plainly allows the USDA only to
impose those requirements that relate to the certification and inspection
process for individual inspectors.
By contrast, and contrary to the statute, the Regulation establishes a
parallel enforcement scheme. 6 It is purportedly a private scheme, but the
USDA interjects itself into each layer of enforcement. At the bottom end, it
imposes mandatory suspensions on competitors, enforced through the HIOs.
Then, the Regulation requires that the HIOs adopt appeal procedures that
6 Indeed, Congress expressly conferred civil and criminal enforcement authority to the
USDA elsewhere in the HPA. Such violators of the HPA could be disqualified from
participating in horse shows “by order of the Secretary, after notice and an opportunity for a
hearing before the Secretary.” 15 U.S.C. § 1825(c). By its plain language, the HPA confers
upon the USDA the ability to disqualify competitors from participating in the Tennessee
walking horse industry following notice and a hearing before the USDA. This provision
addresses the issue of enforcement, and it provides that only the USDA has enforcement
power, not HIOs. In the light of § 1825, the USDA possesses only the authority: (1) to provide
qualifications for inspectors; and (2) to, itself, assess penalties for HPA violations.
20
Case: 13-11052 Document: 00512940123 Page: 21 Date Filed: 02/19/2015
No. 13-11052
meet the USDA’s approval and comply with its timeline. The plain language
of § 1823(c) simply does not support these measures. 7
2.
Having decided that § 1823(c) does not support the Regulation, we turn
to the rest of the HPA to decide whether any other provision supports the
Regulation. The USDA points us to its general rulemaking authority under
the HPA, which provides that “[t]he Secretary is authorized to issue such rules
and regulations as he deems necessary to carry out the provisions of this
chapter.” 15 U.S.C. § 1828. According to the USDA and its amici, this broad
authority permits this Regulation.
We focus on the terms “provisions of this chapter.” By its terms, § 1828
authorizes the USDA to regulate when necessary to effectuate the other
provisions in the HPA. As counsel for the USDA conceded at oral argument, §
1828 does not purport to allow the USDA to amend the HPA. Thus, this
provision is not a stand-alone source of authority to validate any rule the
USDA wishes; the provision authorizes the USDA only to regulate in order to
carry out the other provisions in the HPA. As we explained above, § 1823(c)
does not extend to enforcement-related regulation, and the enforcement
provisions in § 1825 apply only to the USDA and do not contemplate delegation
to third parties.
7 Both parties direct us to passages from the HPA’s legislative history, which they
submitted as part of the record. These passages suggest that § 1823(c) was passed so that
the USDA could provide minimum qualification and certification requirements for horse
inspectors. Thus, we agree with Contender Farms and McGartland that the legislative
history provides support for our reading of the provision. Congress contemplated that the
USDA would exercise its authority to establish training and education programs for horse
inspectors. Although § 1823(c) permits the USDA to establish duties for inspectors, such
duties must be related to their physical inspections of horses. Nothing in this legislative
history supports the wholesale creation of an enforcement regime carried out by the HIOs.
21
Case: 13-11052 Document: 00512940123 Page: 22 Date Filed: 02/19/2015
No. 13-11052
We find the District of Columbia Circuit’s decision in American Bar
Association v. Federal Trade Commission, 530 F.3d 457 (D.C. Cir. 2005),
persuasive. In American Bar, the court addressed a challenge to an act
requiring that financial institutions establish certain privacy protections. Id.
at 459. The law also gave the Federal Trade Commission and other agencies
broad authority to “‘prescribe . . . such regulations as may be necessary to carry
out the purposes of this subchapter with respect to the financial institutions
subject to their jurisdiction.’” Id. at 459 (quoting 15 U.S.C. § 6804(a)(1)). The
Federal Trade Commission subsequently asserted that it would apply the law
“to regulate attorneys engaged in the practice of their profession,” and various
bar associations brought suit. Id. at 466. The court concluded that the plain
language of the statute did not apply to attorneys, and it declined to apply
Chevron deference. Id. at 470–73.
Thus, a broad grant of general rulemaking authority does not allow an
agency to make amendments to statutory provisions. As in American Bar, the
Regulation addresses an area that is plainly outside the USDA’s statutory
authority. The HPA authorizes the USDA to develop a private inspection
system carried out by DQPs who are certified by HIOs, but it does not imply
that the USDA may then establish a mandatory private enforcement system
administered by those HIOs. The USDA’s reading of its rulemaking authority
under § 1828 of the HPA stretches beyond the statute’s plain language. We
also reject the USDA’s argument that it can maintain this scheme merely
because Congress did not expressly disallow such regulation. See id. at 468.
Thus, we hold that § 1828 does not authorize the Regulation. 8
8The district court also pointed to Congress’s broad factual findings that outlined the
problems associated with soring in § 1822, and the USDA points out that the HPA contains
a broad prohibition on soring in § 1824. Neither provision supports the Regulation, though,
because the USDA is bound by the means that Congress has chosen to prevent soring under
the HPA. See Texas v. United States, 497 F.3d 491, 502 (5th Cir. 2007). It is clear that
22
Case: 13-11052 Document: 00512940123 Page: 23 Date Filed: 02/19/2015
No. 13-11052
In sum, the plain language of the HPA suggests that Congress intended
a private horse inspection system. This statutory regime does not support the
USDA’s position that Congress authorized it to promulgate the Regulation,
which requires private parties to impose government-mandated suspensions
as an arm of HPA enforcement.
IV.
After review, we AFFIRM the district court’s holding as to justiciability.
Contender Farms and McGartland, regular participants in the Tennessee
walking horse industry, have standing to challenge the Regulation and present
a ripe challenge to it. On the merits, we hold that the district court erred in
concluding that the Regulation is a valid application of USDA regulatory
authority under the HPA, and accordingly, we REVERSE and VACATE its
judgment. Finally, we REMAND the case for entry of judgment in favor of
Contender Farms and McGartland.
AFFIRMED in part; REVERSED and VACATED in part;
and REMANDED for entry of judgment for the Plaintiffs.
Congress did not authorize the USDA to develop a private enforcement scheme administered
by HIOs as a means of policing the HPA.
23
| {
"pile_set_name": "FreeLaw"
} |
# Contributor Covenant Code of Conduct
## Our Pledge
In the interest of fostering an open and welcoming environment, we as contributors and maintainers pledge to making participation in our project and our community a harassment-free experience for everyone, regardless of age, body size, disability, ethnicity, gender identity and expression, level of experience, nationality, personal appearance, race, religion, or sexual identity and orientation.
## Our Standards
Examples of behavior that contributes to creating a positive environment include:
* Using welcoming and inclusive language
* Being respectful of differing viewpoints and experiences
* Gracefully accepting constructive criticism
* Focusing on what is best for the community
* Showing empathy towards other community members
Examples of unacceptable behavior by participants include:
* The use of sexualized language or imagery and unwelcome sexual attention or advances
* Trolling, insulting/derogatory comments, and personal or political attacks
* Public or private harassment
* Publishing others' private information, such as a physical or electronic address, without explicit permission
* Other conduct which could reasonably be considered inappropriate in a professional setting
## Our Responsibilities
Project maintainers are responsible for clarifying the standards of acceptable behavior and are expected to take appropriate and fair corrective action in response to any instances of unacceptable behavior.
Project maintainers have the right and responsibility to remove, edit, or reject comments, commits, code, wiki edits, issues, and other contributions that are not aligned to this Code of Conduct, or to ban temporarily or permanently any contributor for other behaviors that they deem inappropriate, threatening, offensive, or harmful.
## Scope
This Code of Conduct applies both within project spaces and in public spaces when an individual is representing the project or its community. Examples of representing a project or community include using an official project e-mail address, posting via an official social media account, or acting as an appointed representative at an online or offline event. Representation of a project may be further defined and clarified by project maintainers.
## Enforcement
Instances of abusive, harassing, or otherwise unacceptable behavior may be reported by contacting the project team at dl_oss_dev@linecorp.com. The project team will review and investigate all complaints, and will respond in a way that it deems appropriate to the circumstances. The project team is obligated to maintain confidentiality with regard to the reporter of an incident. Further details of specific enforcement policies may be posted separately.
Project maintainers who do not follow or enforce the Code of Conduct in good faith may face temporary or permanent repercussions as determined by other members of the project's leadership.
## Attribution
This Code of Conduct is adapted from the [Contributor Covenant][homepage], version 1.4, available at [http://contributor-covenant.org/version/1/4][version]
[homepage]: http://contributor-covenant.org
[version]: http://contributor-covenant.org/version/1/4/
| {
"pile_set_name": "Github"
} |
Tragocephala nobilis
Tragocephala nobilis is a species of beetle in the family Cerambycidae. It was described by Johan Christian Fabricius in 1787, originally under the genus Lamia. It has a wide distribution in Africa. It feeds on Coffea arabica. It is preyed on by the parasitic wasp Aprostocetus lamiicidus, and the parasitic fly Billaea vanemdeni.
Varietas
Tragocephala nobilis var. bifasciata Baguena Corella, 1952
Tragocephala nobilis var. fasciata Kolbe, 1893
Tragocephala nobilis var. chloris Chevrolat, 1858
Tragocephala nobilis var. diamenta Gilmour, 1956
Tragocephala nobilis var. fuscovelutina Fairmaire, 1893
Tragocephala nobilis var. basosuturalis Gilmour, 1956
Tragocephala nobilis var. galathea Chevrolat, 1855
Tragocephala nobilis var. fontanai Baguena, 1942
References
Category:Tragocephalini
Category:Beetles described in 1787 | {
"pile_set_name": "Wikipedia (en)"
} |
Tuesday, January 24, 2012In Palestine, to Exist Is to ResistMelinda Tuhus, In These Times 1/24/2012Behind the headlines, Palestinians are using nonviolent direct action to protest the status quo. Few readers of mainstream media are aware of Palestinians' longstanding creative efforts to use non-violent direct action in their struggle for self-determination. WEST BANK, PALESTINE – On November 15, Mazin Qumsiyeh and other Palestinian activists boarded public bus number 148, an Israelis-only bus that normally takes Jews from the Israeli West Bank settlement of Ariel to Jerusalem. The bus took the group to the Hizma checkpoint, just outside the northern entrance of Jerusalem, where activists resisted authorities’ efforts to remove them. Eventually, as a camera broadcast the action online, eight people were pulled from the bus and arrested. They were charged with “illegal entry to Jerusalem” and “obstructing police business.” Qumsiyeh hopes this recent “freedom ride” – possible because a bus driver let them ride by mistake, he said – will spark the same kind of response that its namesake did across the United States in the early 1960s, when interstate bus trips helped end racial segregation in the South. Qumsiyeh, author of Popular Resistance in Palestine: A History of Hope and Empowerment, says other examples of nonviolent resistance include protests of the separation barrier (which many Palestinians call an “apartheid wall”) that has effectively turned 10 percent of Palestinian land into Israeli land since its construction began in 2002; school girls holding class in the street when they can’t get to their schools because of Israeli interference; and farmers braving Israeli intimidation to harvest olives. “For us to exist on this land is to resist,” says Qumsiyeh, who teaches at Bethlehem and Birzeit universities. Most readers of mainstream media in the United States think of the First Intifada (1987-92) as the stone-throwing uprising and the Second Intifada (2000-2004) as the attack of the suicide bombers....more..e-mail
Would another Obama term be better for Israel/Palestine than Romney?Noam Sheizaf, +972 Magazine 1/23/2012The answer: Not necessarily. In a side note to my post on Newt Gingrich yesterday, I wrote that as far as the Israeli-Palestinian issue is concerned, I don’t see a big difference between a second Obama term and a Romney presidency. This remark got more attention than my comments on Gingrich, which were at the center of the post, so I’d like to elaborate on them a bit. If I were an American citizen, I would probably vote for Barack Obama in 2012, mainly due to his positions on domestic issues. While far from being perfect – especially on personal freedoms – Obama is way better than Republican alternatives on abortion, healthcare, gay rights and more – at least as far as I can tell from afar. Plus, future nominations to the Supreme Court alone provide a good reason to prefer him. The sad reality of the two-party system is that the liberal base has very little bargaining power against an incumbent president. Still, I am not American, and this blog deals mainly with local politics. On that front, Barack Obama wasn’t able to produce better results than George W. Bush. In fact, if you deal only with the Israeli-Palestinian issue, he might have actually been worse. I say “might,” because Bush had to deal with Prime Minister Ehud Olmert, and Barack Obama with Netanyahu, so it’s very hard to compare the two. President Obama made at least one critical mistake – the appointment of Dennis Ross as special envoy – and many tactical ones, ending up with the worst of all scenarios: he is perceived as anti-Israeli and pays the political price for it, while in fact his policies are more comfortable for the Israeli right than those of any other president before him....more..e-mail
Israel, Iran and the US: Axis of instabilityAhmed Moor, Al Jazeera.com 1/24/2012Ratcheting up geopolitical tension isn't likely to contribute to peace or stability. Cairo, Egypt - In Iran, it doesn't take much to capture the interest of "terrorists". The pursuit of a career in material sciences, for instance, is enough to animate their small minds. Mostafa Ahmadi-Roshan was a 32-year-old Iranian father and a nuclear scientist. Earlier this month, an assassin attached a magnetic explosive device to his car in Tehran. The bomb was detonated and both Ahmadi-Roshan and his driver were killed in the explosion. In the civilised world, the lives of scientists and other civilians are formally protected from directed inter-state violence. Numerous international norms and conventions are designed to isolate civilians from the most brutal consequences of armed conflicts. In war, the act of deliberately targeting civilians or their infrastructure is a criminal one. In the absence of war, however, the act of targeting civilians is terrorism. And assassinating civilians in order to affect political subterfuge is an especially ugly kind of terrorism. Events unfolded predictably after Ahmadi-Roshan's murder. The Iranian government quickly blamed the US and Israelis for perpetrating the assassination (the British were tacked on for good measure). The US and the British responded with fast and vociferous denials, while the Israelis only offered mealy mouthed non-denials. Unsurprisingly, it has been reported that Israeli Mossad agents were responsible for killing the young scientist; the hit had all the agency's flamboyant and theatrical hallmarks. Equally unsurprising was the extent to which the US went to distance themselves from the ill-advised Israeli decision to terrorise civilians in Tehran. After all, the two countries have vastly different interests when it comes to igniting another war in the Gulf.more..e-mail
Interview: rapper Sphinx on why Egypt uprising had a hip-hop soundtrackElectronic Intifada: 24 Jan 2012 - Alexander Billet 24 January 2012 Hesham Alofoq (aka Sphinx) of the Egyptian hip-hop group Arabian Knightz speaks to The Electronic Intifada about the history of hip-hop in Egypt and the Middle East, the future of the Egyptian uprising, and the role that music plays in the revolt.more
Stop the Pro-Israel LobbyPalestine Chronicle: 24 Jan 2012 - By Stuart Littlewood The Queen needs a new royal yacht. But the British government says it can't afford to buy her one. The £80 million for the project must come from private sources. "Leading British companies will... be asked to donate funds in exchange for naming rights to various decks and facilities on board," says The Guardian. Does this mean Her Majesty will be seen entertaining in the Goldman Sachs stateroom and sipping daiquiris on the Starbucks sun-deck? Will she shelter from squalls in the Murdoch salon and arrive and depart via the Revlon helipad? The last royal yacht, Britannia, was a highly successful tool for promoting Great Britain Limited. That being the case, such an important national asset ought to be government funded, not sponsored by tacky brand names. £80 million is chickenfeed in the great scheme of things. Why are we so hard up that there’s not enough...more
The Puzzling Matter of the Israeli LiberalsPalestine Chronicle: 24 Jan 2012 - By Ramzy Baroud Regardless of who may rule Israel, little change ever occurs in the country's foreign policy. Winning parties remain obsessed with demographics and retaining absolute military dominance. They also remain unfailingly focused on their quest to initiate racist laws against non-Jewish residents of the state, and continue to hone the art of speaking of peace, while actually maintaining a permanent state of war. Every few years the media become captivated by Israeli democracy. Commentators speak of right, left, center, and anything in between. Despite Israeli elections still being a year and a half away, media pundits are already discussing possible outcomes of the vote against the peace process, economic reforms, social equality, and so on. In a recent article, Israeli columnist Uri Avnery decried the fact that the main opposition to the right-wing parties — “the Likud, the Lieberman party and various ultra-nationalist, pro-settlement and religious factions” —...more
The Jirga Medal of HonorPalestine Chronicle: 24 Jan 2012 - By Ralph Nader The U.S. war in Afghanistan is testing so much futuristic detect and destroy weaponry that it can be called the most advanced all-seeing invasion in military history. From blanket satellite surveillance to soldiers’ infra-red vision to the remotely guided photographing, killer drones to the latest fused ground-based imagery and electronic signal intercepts, the age of robotic land, sea, and air weaponry is at hand. U.S. and NATO soldiers and contractors greatly outnumber the Taliban, whose sandals and weapons are from the past century. Still, with the most sophisticated arsenals ever deployed, why are U.S. generals saying that less than 30,000 Taliban fighters, for almost a decade, have fought the U.S. led forces to a draw? Perhaps one answer can be drawn from a ceremony that could be happening in various places in that tormented country. That is, a Jirga of elders awarding a young fighter the Jirga...more
Disclaimer: The views expressed in the
material posted on this site are the sole responsibility of the author(s) and
do not necessarily reflect the views of the webmaster or Vermonters for a Just
Peace in Palestine/Israel.
FAIR USE
NOTICE: This site may contain copyrighted material the use of which has not always been specifically authorized by the copyright owner. We are making such material available in our efforts to advance understanding of environmental, political, human rights, economic, democracy, scientific, and social justice issues. We believe this constitutes a 'fair use' of any such copyrighted material as provided for in section 107 of the US Copyright Law. In accordance with Title 17 U.S.C. Section 107, the material on this site is distributed without profit to those who have expressed a prior interest in receiving the included information for research and educational purposes. For more information go to: http://www4.law.cornell.edu/uscode/17/107.html
If you wish to use copyrighted material from this site for purposes of your own
that go beyond 'fair use', you must obtain permission from the copyright owner. | {
"pile_set_name": "Pile-CC"
} |
'use strict';
/**
* logic
* @param {} []
* @return {} []
*/
export default class extends think.logic.base {
/**
* index action logic
* @return {} []
*/
indexAction(){
}
} | {
"pile_set_name": "Github"
} |
Great Read for eReaders: Alicewinks eBook is a modern update to Alice in Wonderland. apps
Did you know it is the 150th anniversary of Alice in Wonderland, the legendary Lewis Carroll children's novel?
Looking for ebook recommendations for kids? In celebration, Alice's Adventures in Wonderland is now a multimedia iBook. Alicewinks brings the timeless illustrations of Alice’s Adventures to life for a new generation. Take a look and check out this interactive media book in iBooks.
Alice Winks is a great ebook recommendation for kids.
The beautiful, early 20th-century pictures include one-hundred and ninety-three original, animated illustrations from twelve different artists, and the images are brought to life by nineteen voice actors. It is more like watching a movie than reading an ebook.
What we love about the book:
Cultural Immersion. My kids associate Johnny Depp with Alice and Wonderland. While, they love the Cheshire Cat, they thought he was the "Thresher Cat". With Alicewinks, they learn about classical literature in it's purist form.
The voice of Alice brings the story to life. Hearing the inflection as she speaks makes some of the subtle humor easier for kids to understand.
The story is long, but reading the iBook version allows you to pause whenever you like.
In May of 2013, Alicewinks received the Kirkus Star for exceptional merit.
The book is interactive. Kids can easily skip forwarded and back among the pages.
When I asked the kids if they wanted to skip ahead, they both shouted "no". Translation = 1-hour of peace and quiet.
"Everything's got a moral, if only you can find it."
- The Duchess.
So, what is the moral to this post? "One story is good until another is told." The re-telling of Alice in Wonderland in digital format is a great way to share a good, classical story with your kids.
In celebration of the 150th Anniversary of Alice’s Adventure’s in Wonderland, Alicewinks brings the story’s classic illustrations to life for digital audiences through animated video and rich narration. To download this one of a kind app iBook, click here.
This is a sponsored conversation written by me on behalf of Alicewinks. The opinions and text are all mine.
ADS DISCLOSURE: We've partnered with some wonderful advertisers who may sponsor blog posts or send us samples to test. Some companies pay us to review their products.*We also use affiliate links, if you make a purchase we get a tiny commission. Kids Creative Chaos participates in the Amazon LLC Associates Program*, an affiliate advertising program designed to provide a mean for blogs to earn advertising fees by linking to Amazon properties, including, but not limited to, amazon.com, endless.com, myhabit.com, smallparts.com, or amazonwireless.com. We also offer Tapinfluence, Google Adsense, SoFab, and Izea ads here. Thanks so much for helping us keep the lights on! :) | {
"pile_set_name": "Pile-CC"
} |
Q:
Draw a byte array in a image control
Is there anyway to convert a byte array to an image and display it directly in an image control without saving it on the disk?
Here is the code a I have developed so far:
protected void btnShow_Click(object sender, System.EventArgs e)
{
Byte[] blobEncryptedImage = Signature.Get(txSaleGUID.Text);
Crypto crypto = new Crypto("mypass");
Byte[] decryptedImage = Encoding.ASCII.GetBytes(crypto.Decrypt(blobEncryptedImage));
MemoryStream ms = new MemoryStream(decryptedImage);
Image img = Image.FromStream(ms);
//Image1.ImageUrl = System.Drawing.Image.FromStream(ms);
}
public static Image byteArrayToImage(byte[] data)
{
using (System.IO.MemoryStream ms = new System.IO.MemoryStream(data))
{
return new System.Drawing.Bitmap(Image.FromStream(ms));
}
}
Update 1
this is my crypto class:
public class Crypto
{
private ICryptoTransform rijndaelDecryptor;
// Replace me with a 16-byte key, share between Java and C#
private static byte[] rawSecretKey = {0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00};
public Crypto(string passphrase)
{
byte[] passwordKey = encodeDigest(passphrase);
RijndaelManaged rijndael = new RijndaelManaged();
rijndaelDecryptor = rijndael.CreateDecryptor(passwordKey, rawSecretKey);
}
public string Decrypt(byte[] encryptedData)
{
byte[] newClearData = rijndaelDecryptor.TransformFinalBlock(encryptedData, 0, encryptedData.Length);
return Encoding.ASCII.GetString(newClearData);
}
public string DecryptFromBase64(string encryptedBase64)
{
return Decrypt(Convert.FromBase64String(encryptedBase64));
}
private byte[] encodeDigest(string text)
{
MD5CryptoServiceProvider x = new System.Security.Cryptography.MD5CryptoServiceProvider();
byte[] data = Encoding.ASCII.GetBytes(text);
return x.ComputeHash(data);
}
}
Could anyone give a clue?
A:
Using what George said in in his comment, you need to have a page or preferably a simple handler (.ashx) that will return the image in the response stream. You could then put that code you have in that handler, but instead of converting the byte array to an image, just write the bytes to the response stream.
Then, in your .aspx page, set the URL for the image to call that handler.
Example: <img src="~/GetImage.ashx?ImageID=1" />
GetImage.ashx is the handler that will return the image bytes.
| {
"pile_set_name": "StackExchange"
} |
North Slave Correctional Complex
The North Slave Correctional Complex is a prison in Yellowknife, and the largest correctional facility in Northwest Territories, Canada.
It consists of an adult male unit and a youth unit, and it houses inmates with security ratings from minimum to maximum security, as well as those awaiting trial. Since the closure of the Arctic Tern Young Offender Facility in 2011, the youth unit holds both male and female young offenders. The adult male unit has a capacity of 148 inmates, and the youth unit has a capacity of 25 inmates.
History
The complex is the result of the merger of the North Slave Correctional Centre and the North Slave Young Offender Facility in 2016. Previously, the two facilities were formally separate, though they were connected by a corridor and shared a gym.
The North Slave Lake Correctional Centre (now the Adult Male Unit) was built in 2004, replacing the Yellowknife Correctional Centre.
In 2015, the Auditor General's report on prisons in the Northwest Territories found that short-term prisoners in the complex were not receiving access to rehabilitation programs.
In August 2016, the prison had its first escape, when an inmate climbed a fence in the exercise yard, and onto the roof. Following the escape, the yard was closed to inmates, leaving them with less access to the outdoors or to cultural programs practiced there. In 2017, inmates began a letter writing campaign to demand better access to programs and recreational opportunities.
References
Further reading
Inside Canada's Arctic Prison, Patrick Kane, 14 Oct 2015, Vice Magazine
Not much rehab, not much hope – report damns NWT’s jails, Ollie Williams, 3 Mar 2015, My Yellowknife Now
Category:Prisons in Canada
Category:Buildings and structures in Yellowknife | {
"pile_set_name": "Wikipedia (en)"
} |
Good News in the War on Poverty
Global poverty good news? Yes! And lots of it. In 2015, countries all over the world adopted the United Nation’s Sustainable Development Goals, a set of 17 targets to combat poverty, reduce inequality, improve global health outcomes and protect the planet by 2030. The SDGs are successors to the incredibly successful Millennium Development Goals, which concluded in 2015 after 25 years of remarkable achievements in tackling global poverty. The SDGs seek to further expand on these accomplishments, with a key target to end extreme poverty for all people by 2030.
In honor of the new 17 SDG goals, let’s take a look at 17 incredible facts about the progress made so far in the global war on poverty.
In 2015, the percentage of the global population living in extreme poverty fell below 10 percent for the first time.
In 2015, 702 million people lived in extreme poverty, down from 902 million in 2012 and 1.9 billion in 1990.
In East Asia and the Pacific, the proportion of people living in extreme poverty took a nosedive from 60.2 percent in 1990 to just 3.5 percent in 2013.
According to the World Health Organization (WHO), new malaria cases in 2015 fell by 21 percent compared to 2010 levels and during the same period, global malaria mortality rates plummeted 29 percent.
Since 2003, annual AIDS-related deaths have fallen by 43 percent and, in the worst-affected areas, the number of people currently on life-saving treatment has more than doubled since 2010.
According to June 2017 figures, world internet usage now stands at 51 percent, up from 43 percent in 2015 and continuing the incredible growth rate since 2000, when only 7 percent of the global population was online.
The cost of starting a business in sub-Saharan Africa decreased dramatically from 300 percent of Gross National Income (GNI) per capita in 2003 to roughly 50 percent in 2016, a decrease of more than 80 percent.
The number of underweight children under the age of five dropped from 160 million in 1990 to 93 million in 2015, despite the rise in global population.
Women made up a quarter of all parliamentary seats in 2016, a fourfold increase over the previous 20 years.
In more than half the countries measured in the World Bank’s 2017 World Development Indicators report, the poorest 40 percent of the population experienced faster income growth than the national average between 2008 and 2013.
From 1999-2012, primary school enrollment in sub-Saharan Africa rose by 75 percent, to 144 million children.
According to the Brookings Institution, the amount spent on foreign aid now exceeds the amount needed to lift all people out of extreme poverty. | {
"pile_set_name": "Pile-CC"
} |
We bring people together to meet, socialize and exchange ideas. And we also have the goal of educating future leaders of atheism by bringing in student representatives from college campuses and we educate the public at large in an attempt to dispel myths about atheists. It is extremely difficult in the United States and in some parts of the world to dismiss the notion of believing in a supernatural god.
Some people would say that thesecular, if not atheist, mindset, is already too dominant in American culture. How do you respond?
I don’t see that. From the perspective of the Christian community, it looks like sure, it looks like we’re a dominant force. But when you look around the world at the overtly religious countries and the problems they have, it’s obvious that secularism should be dominant. We’re looking at world problems such as fundamentalists who think nothing of flying airplanes into buildings.
Some prominent conservatives — like Leo Strauss and Ayn Rand — have been atheists. So why do so many people associate atheism with liberalism?
It is a liberal mindset. We have conservative as well as liberal secularists. But the entire philosophy is a live-and-let-live mindset.
Notable Quotes
"Compliments are just one way to give a person positive reenforcement. Another way is to simply let them know that you care about them. Take the time to keep in touch with your atheist friends. Call them periodically. Write them a note once in a while; send them a joke on a postcard. There are many inexpensive and quick ways to keep in touch and express your friendship."
Margaret Videos
This website is a compilation of works involving Margaret Downey. It is being created following the Fair Use Guidelines for Educational Material as well as other Fair Use content. It is being hosted and created by atheist activists. | {
"pile_set_name": "Pile-CC"
} |
140 Ga. App. 612 (1976)
231 S.E.2d 541
GOODEN
v.
BLANTON.
52440.
Court of Appeals of Georgia.
Submitted July 7, 1976.
Decided December 1, 1976.
Richard K. Greenstein, for appellant.
William Boyd Lyons, for appellee.
McMURRAY, Judge.
This is an appeal from the refusal of the trial judge to vacate a judgment in a tort case. Appellant and his father were sued in the State Court of DeKalb County, Georgia, in a negligence action involving an automobile in the alleged amount of $1,189.80. Both defendants were served. No answer was filed by either of the defendants. The case being in default, the court entered the following order: "The case coming on regularly to be heard before the Judge Presiding without the intervention of a Jury, and after hearing evidence, and it appearing that the plaintiff is entitled to recover of the defendants jointly and severally the principal sum of $1,189.80,... judgment is hereby rendered in favor of the plaintiff and against" the defendants, etc.
The appellant moved to vacate the judgment on the grounds that Section 55 (a) of the Civil Practice Act (Code Ann. § 81A-155 (a)) requires that in cases of default in actions ex delicto, the issue of damages is required to be submitted to a jury and that the record in the present case on its face shows the statute was not complied with in that the case was not submitted to a jury as to the amount of damages.
The sole question for decision is whether or not in a suit for damages (action ex delicto seeking unliquidated *613 damages) the defendant, although properly served, in failing to answer and who suffers a default judgment, waives trial by jury in a state court which requires a written demand for jury trial. Our Constitution allows judgment without a jury verdict in civil cases, "except actions ex delicto, where no issuable defense is filed." See Constitution of 1945 (Code Ann. § 2-3907).
The local Act creating the Civil Court (now State Court) of DeKalb County (Ga. L. 1951, Vol. 2, pp. 2401, 2405), provides that if the defendant fails to make a written demand for trial by jury on or before the date upon which he is required to appear in court in response to the civil action, "he will be held to have waived the same." But, upon the creation of the state court system below the superior court level (Ga. L. 1970, p. 679 et seq.) the rules of practice and procedure applicable to the superior courts "shall be the rules which govern practice and procedure" of the state courts coming under the provisions of that law. See Code Ann. § 24-2107a (Ga. L. 1970, pp. 679, 681).
Accordingly, the case of Pittman v. McKinney, 135 Ga. App. 192 (1) (2) (3) (4) (217 SE2d 446), completely controls this case as to a requirement by the Constitution and the Civil Practice Act (CPA, § 55; Code Ann. § 81A-155) that an ex delicto claim as to the amount of judgment must be "proved before a jury" even though the case be in default. This does not mean that the defendant cannot expressly waive a jury trial, but the law cannot waive it for the defendants as here.
Nothing is found in such cases as Morrison v. Brown, 21 Ga. App. 217 (94 SE 85); Wadley Southern R. Co. v. Wright, 31 Ga. App. 289 (120 SE 551); Boland v. Barge, 108 Ga. App. 689 (134 SE2d 463); or Ewart Bros., Inc. v. Philips & Son, 44 Ga. App. 675 (4) (162 SE 634), which controls the above ruling. The case of Greene v. Greene, 76 Ga. App. 225 (45 SE2d 713), is authority for our view that the judgment rendered is void even though the appellant therein did not appeal at the first opportunity but waited and filed an affidavit of illegality to a levy instead of as in the case sub judice, moving to vacate and set the judgment aside. It clearly cannot be said that the appellant here has waited too late to raise this issue or has raised it for the first time on appeal.
*614 It is also argued that Centennial Equities Corp. v. Hollis, 132 Ga. App. 44, 45 (2) (207 SE2d 573), a seven to two decision, is authority that the correct rule is set forth in Boland v. Barge, supra, 691. But this decision does not so hold, as Judge Webb so clearly points out in the Pittman case. It involved the foreclosure of a lien, a special statutory proceeding, for a definite money judgment, not unliquidated damages as in the case sub judice.
Further, the cases cited by Centennial, such as Cherry v. McCutchen, 68 Ga. App. 682, 690 (23 SE2d 587), was one in trover, again a special statutory proceeding, seeking return of the article or its value; not strictly an ex delicto action. The case of Owen v. Stevenson, 18 Ga. App. 391 (89 SE 435), does not disclose what type of action it was in the Municipal Court of Atlanta as that case was in the superior court by certiorari. Again, the case of Lamar v. Bankers Health &c. Ins. Co., 32 Ga. App. 528 (123 SE 919), cited in Cherry v. McCutchen, supra, was an action in the Municipal Court of the City of Macon on review by certiorari from the superior court, and we do not have information as to the type of action.
We have likewise examined the cases of Hudgins v. Pure Oil Co., 115 Ga. App. 543 (2) (154 SE2d 768), and Marler v. C & S Bank of Milledgeville, 139 Ga. App. 851, both of which concern the waiver of jury trials in state courts. Neither has anything to do with default judgments in an ex delicto action as we have here, and neither falls afoul of the Georgia Constitution and the Civil Practice Act, nor are we holding that the parties cannot expressly waive a jury trial. Parties to litigation may also expressly waive findings of fact and conclusions of law as required by Code Ann. § 81A-152 (a) (Ga. L. 1969, pp. 645, 646; 1970, pp. 170, 171). It is noted here that the trial judge, even if the bench trial had been properly held, failed to obey the mandate of Code Ann. § 81A-152 (a), and there was no waiver of this requirement, simply because defendant was not aware of the trial. But the judgment was void, and a remand for this reason is unnecessary.
Judgment reversed. Bell, C. J., Quillian, P. J., Clark, Stolz, Webb and Marshall, JJ., concur. Deen, P. J., and Smith, J., dissent.
*615 DEEN, Presiding Judge, dissenting.
1. I do not agree that anything in the Georgia Constitution requires that the issue of amount of damages in cases ex delicto which are in default must be tried by a jury. Statutes which provide that jury trial is waived unless demanded are constitutional. And the constitutional right to jury trial may be waived by proceeding to trial without demanding a jury. Clarke v. Cobb, 195 Ga. 633 (24 SE2d 782). Code § 2-3907 does not say that default cases ex delicto must be tried by jury; it specifies only that cases other than these shall be tried by the court without a jury. But the converse, which is that the ex delicto default must be so tried, cannot be read into the language. As to ex delicto actions in default, this constitutional provision puts them in neither category and might as well not exist.
2. Code § 81A-155 is not definitive because it has nothing to say about waiver. It states a general rule that when the action is ex delicto the plaintiff shall introduce evidence before a jury "with the right of the defendant to introduce evidence as to damages." This language is susceptible of the construction that it applies to cases where a defendant seeks to be heard on the question of damages. Harrell v. Davis Wagon Co., 140 Ga. 127, 128 (78 SE 713), notes that the statute (former Code § 110-401) and the constitutional provision (Code § 2-3907) "merely authorize judgments in the class of cases mentioned to be rendered by the court without the intervention of a jury." Certainly they are not intended to abolish the right to waive a jury trial.
3. This leaves only the question of whether, in a court which by statute provides that jury trial is waived if not demanded, a jury need not be demanded in ex delicto default cases. In the Civil Court of DeKalb County, where this case originated and where the litigation in Hudgins v. Pure Oil Co., 115 Ga. App. 543 (154 SE2d 768) originated, it was specifically held in that case that the identical statute dealt with here resulted in waiver of jury trial where jury trial was not demanded. Unless there is a constitutional or statutory provision, which I am convinced there is not, forbidding waiver of jury trial in an ex delicto default, this is a false distinction and should not *616 be made. Further, it rewards the negligent rather than the diligent. In Marler v. C & S Bank of Milledgeville, 139 Ga. App. 851 it was held that a late demand for jury trial was a nullity, and jury trial was waived. A litigant who does in fact file a defense must file his demand for a jury on time or waive it. What logic can give a defendant who suffers his case to go to judgment by default without taking any steps at all the right to a new trial before a jury on the theory that the right to jury trial cannot be waived? This court and the Supreme Court have consistently held to the contrary. "Waiver may be made of the right of trial by jury, and where a party has the right to demand a jury trial and neglects to do so he will be held to have waived the right." Williams v. Leonard Heating &c. Co., 137 Ga. App. 16, 17 (223 SE2d 2) and cit.
4. "Conversion is a tort for which the action of trover is maintainable." Carithers v. Maddox, 80 Ga. App. 230 (5) (55 SE2d 775). I therefore respectfully disagree with the statement in the majority opinion relating to Cherry v. McCutchen, 68 Ga. App. 682 (23 SE2d 587) seeking to distinguish it on the ground that it is "not strictly an ex delicto action." It is indeed an ex delicto action. (89 CJS, 534, Trover and Conversion, § 4, and see Black's Law Dictionary, ex delicto: "In both the civil and the common law, obligations and causes of action are divided into two great classes those arising ex contractu,... and those ex delicto. The latter are such as grow out of or are founded upon a wrong or tort, e.g. trespass, trover, replevin.") The holding in Cherry is that a defendant who did not demand a jury trial within the time limited could not do so thereafter.
Here the case is in default because of the defendant's negligence. He is not entitled to rights greater than those of one who acted, though tardily.
SMITH, Judge, dissenting.
This is an appeal from the refusal of the trial judge to vacate a judgment. There is no transcript of the proceeding. The record disclosed the appellant and his father were sued on March 18, 1974, in the State Court of DeKalb County, Georgia, in a negligence action involving an automobile collision seeking recovery of damages to *617 his automobile in the alleged amount of $1,189.80. Both defendants were served. The record does not disclose an answer was filed by either of the defendants. On November 21, 1974, the following judgment was entered: "The case coming on regularly to be heard before the Judge Presiding without the intervention of a Jury, and after hearing evidence, and it appearing that the plaintiff is entitled to recover of the defendants jointly and severally the principal sum of $1,189.80,... judgment is hereby rendered in favor of the plaintiff and against" the defendants, etc. The appellant, on March 1, 1976, filed his motion to vacate the judgment on the grounds that Section 55 (a) of the Civil Practice Act (Code Ann. § 81A-155 (a)) requires that in cases of default in actions ex delicto, the issue of damages is required to be submitted to a jury and that the record in the present case on its face shows the statute was not complied with.
1. A jury trial may be waived even though it is guaranteed by the Constitution and an Act establishing a court which requires a demand for a jury trial, otherwise it is waived, is constitutional.
"Even where a mode of affirmative waiver is prescribed, a trial by jury may be waived in civil cases in other ways. `The clause in the constitution that the right to a jury trial in civil cases may be waived in the manner to be prescribed by law, has not been regarded as precluding courts from holding parties to have waived by their conduct or silence the right to a jury trial, upon general principles of law applicable to the subject, although the case is not provided for by any statute.' Baird v. Mayor, 74 N. Y. 383. The statute touching the city court of Macon treats all parties to civil cases, whether plaintiffs or defendants, as waiving the right unless they demand it. No affirmative act by a party to a pending cause is required to set the trying functions of the court in motion, but an affirmative act is required to put a jury in motion. Under such a system every party is presumed to desire his case tried by the court if he fails to signify that he wishes a jury. Surely this is imposing a very mild condition. It is a reasonable regulation. Garrison v. Hollins, 2 Lea, 684; Lawrence v. Born, 86 Pa. St. 225; Foster v. Morse, 132 Mass. 354; Cooley Const. Lim., 6 ed. *618 505. Much more onerous terms might be exacted by statute without infringing upon the constitutional sacredness of trial by jury. Flint River Steamboat Co. v. Foster, 5 Ga. 194." Sutton v. Gunn, 86 Ga. 652, 657 (2(a)) (12 SE 979).
Certainly, if a constitutional requirement of trial by jury may be waived, a statutory requirement of trial by jury may also be waived.
We do not have a case here where no proof of damages was submitted, but only the absence of a jury.
2. The order recites the matter came on "regularly to be heard before the Judge Presiding without a jury." In the absence of something in the record from the court below, disputing that regularity, we must assume that the parties consented to the trial by the judge without a jury. See Boland v. Barge, 108 Ga. App. 689, 690 (4) (134 SE2d 463); Centennial Equities Corp. v. Hollis, 132 Ga. App. 44, 45 (2) (207 SE2d 573). This last case cited is a full-court case in which Presiding Judge Eberhardt and Judge Clark dissented; however, their dissent was based upon a lack of evidence. The record on its face, therefore, presents no grounds for setting aside the judgment. See Boland v. Barge, supra, 691. Anything to the contrary stated in Pittman v. McKinney, 135 Ga. App. 192, 193 (4) (217 SE2d 446) must yield to the prior ruling in Boland v. Barge, supra, and the full-bench decision in Centennial Equities Corp. v. Hollis, supra. The burden is on the appellant to show error. The judgment overruling his motion to set aside or vacate the prior judgment rendered in the case should, in my opinion, be affirmed.
I concur with the dissent of Judge Deen.
| {
"pile_set_name": "FreeLaw"
} |
Springville, Utah— DecisionWise is proud to recognize Accumen Inc. as a top-performing organization through its 2018 Employee Engagement Best Practice Awards. Accumen Inc. is one of five organizations that received the award based on a review of over 6.3 million survey responses in the DecisionWise international employee engagement survey benchmark database.
Results were analyzed by measuring the number of fully engaged, key contributor, opportunity group, and disengaged employees in each organization using a set of employee engagement anchor questions. Those organizations with the most fully engaged and key contributor employees were eligible to receive the award. Final winners were confirmed by evaluating the overall culture of the organization as well as best practices and company initiatives that contributed to the scores.
DecisionWise recognizes Accumen Inc. because it exemplifies best practices in employee engagement, both through its annual employee engagement results and through its actions to create an engaged workplace.
“We’re privileged that Accumen Inc. has made DecisionWise a strategic partner for creating employee engagement initiatives, and we’re proud that it has taken clear, measurable actions to leverage employee feedback and create a positive, engaging, and energizing workplace for its employees,” said DecisionWise Chief Executive Officer, Dr. Tracy Maylett.
DecisionWise, Inc. is a management consulting firm specializing in building engaged employees at the organizational, team and individual levels using assessments, feedback, coaching and training. DecisionWise services include employee engagement surveys, 360-degree feedback, engagement leadership coaching and organization development. DecisionWise was founded in 1996 and is privately held. With offices in the United States and affiliate offices throughout the world, DecisionWise operates in over 70 countries and conducts surveys in over 30 languages.
About Accumen Inc.
Accumen Inc. is a leading healthcare performance partner providing end-to-end strategy and services to drive value and sustainability for the clinical lab, patient blood management and imaging services. Accumen offers health system partners consulting, execution, utilization, and outreach solutions using a proven blueprint, innovative approach, and insight-driven proprietary technology. We partner with hospitals and health systems to set new standards of performance for healthcare delivery in speed, higher quality, increased patient safety, and a better patient experience that is sustainable. Accumen adds unprecedented value to its healthcare partners, helping them create healthier hospitals, and ultimately, healthier communities.
Accumen® – Accelerating Performance Delivered™
Find out more at Accumen.com | {
"pile_set_name": "Pile-CC"
} |
955 acorn triode
The type 955 triode "acorn tube" is a small triode thermionic valve (vacuum tube in USA) designed primarily to operate at high frequency. Although data books specify an upper limit of 400–600 MHz, some circuits may obtain gain up to about 900 MHz. Interelectrode capacitances and Miller capacitances are minimized by the small dimensions of the device and the widely separated pins. The connecting pins are placed around the periphery of the bulb and project radially outward: this maintains short internal leads with low inductance, an important property allowing operation at high frequency. The pins fit a special socket fabricated as a ceramic ring in which the valve itself occupies the central space. The 955 was developed by RCA and was commercially available in 1935.
The 955 is one of about a dozen types of "acorn valve", so called because their size and shape is similar to the acorn (nut of the oak tree), introduced starting in 1935 and designed to work in the VHF range. The 954 and 956 types are sharp and remote cut-off pentodes, respectively, both also with indirect 6.3 V, 150 mA heaters. Types 957, 958 and 959 are for portable equipment and have 1.25 V NiCd battery heaters. The 957 is a medium-μ signal triode, the 958 is a transmitting triode with dual, paralleled filaments for increased emission, and the 959 is a sharp cut-off pentode like the 954. The 957 and 959 draw 50 mA heater current, the 958 twice as much. In 1942, the 958A with tightened emission specs was introduced after it turned out that 958s with excessively high emission kept working after the filament power was turned off, the filament still sufficiently heating on the anode current alone.
Pin connections
When viewing the device from above (the end without the exhaust tip), the pins are arranged in a group of three and a group of two, starting with the centre pin in the group of three and going in a clockwise direction, the pins are cathode, heater, grid, anode, heater.
Ratings
The 955 is an indirectly heated triode with heater electrically isolated from the cathode. The heater has a 6.3 volt rating, which it shares with many other common thermionic valves/electron tubes, and it draws about 150 mA.
The maximum anode voltage is 250 V, with an anode current of 420 microamperes and anode load 250 kilohm, and the maximum anode current is 4.5 mA at a voltage of 180 V with an anode load of 20 kilohm. The 955 is designed to be used in the frequency range of 60–600 MHz (5-0.5 metres wavelength).
The amplification factor obtained is between 20 and 25 depending on details of the specific stage design and operating voltage.
See also
Micropup
References
Category:Vacuum tubes | {
"pile_set_name": "Wikipedia (en)"
} |
TLLI
The TLLI (Temporary Logical Link Identifier) is used in GSM and GPRS services. It provides the signaling address used for communication between the user equipment and the SGSN (Serving GPRS Support Node) and is specified in 3GPP specification 23.003.
The TLLI can be classified into four groups:
Local TLLI: for normal operation between SGSN and user equipment.
Foreign TLLI: primarily used when crossing a routing area boundary.
Random TLLI: used for initial access or if the user equipment does not possess any of the above.
Auxiliary TLLI: is selected by the SGSN, but is not used as of now.
References
Category:GSM standard | {
"pile_set_name": "Wikipedia (en)"
} |
Extracellular glutamate levels increase with age in the lateral striatum: potential involvement of presynaptic D-2 receptors.
In the lateral striatum of aged rats, dopamine D-2 receptor density is reduced and glutamate tissue content is elevated. D-2 receptor agonists have been shown to inhibit stimulated glutamate release. In the present study, microdialysis was used to investigate a potential role for D-2 receptors in the modulation of striatal glutamate efflux from 4-, 12-, 18-, and 24-26-month-old Fischer 344 rats. Extracellular basal glutamate concentrations significantly increased as a function of age in the lateral, but not medial, striatum. Neither the D-2 agonist, LY 163502, nor the D-2 antagonist, sulpiride, influenced basal glutamate efflux, suggesting that the dopaminergic system is not involved in the observed age-related increase in extracellular basal glutamate levels. In contrast to basal efflux, potassium-evoked glutamate release was not altered with age. However, LY 163502 significantly inhibited stimulated glutamate release in 4-month-old rats. This inhibitory action was not observed at any other age. Sulpiride alone did not alter stimulated glutamate release, but it did block the inhibitory effect of LY 163502 in the 4-month-old rats. These results provide in vivo evidence for an age-related functional loss in the modulation of striatal glutamate release by dopamine D-2 receptors in addition to increased basal glutamate efflux, which is not related to D-2 receptor modulation. Such mechanisms could be important in the pathophysiology of striatal cell death during aging and age-related neurodegenerative diseases. | {
"pile_set_name": "PubMed Abstracts"
} |
[Fetoscopic guided laser occlusion for twin-to-twin transfusion syndrome in 33 cases].
To evaluate the clinical effect of fetoscopic laser occlusion of chorioangiopagous vessels (FLOC) for monochorionic diamniotic twins (MCDA) pregnancies complicated with twin-to-twin transfusion syndrome(TTTS). The clinical data of 33 consecutive cases of TTTS from Mainland China, who had FLOC in the Department of Obstetrics and Gynaecology of Prince of Wales Hospital (The Chinese University of Hong Kong) from November 2003 to December 2010, were reviewed and analyzed for peri-operative complications, perinatal outcomes and fetal survival rate. Clinical stage of TTTS was according to the Quintero staging system. (1) Pregnancy characteristics: the mean maternal age was 30; the median gestational age at FLOC was 23(+4) weeks; according to the Quintero staging system, 3 cases were Quintero staging I, 14 cases were Quintero staging II, 7 cases were Quintero staging III and 9 cases were Quintero staging IV. For the 3 stage I cases, FLOC was performed for severe maternal symptoms of polyhyramnios or severe fetal cardiac dysfunction. (2) COMPLICATIONS: intraoperative complications occurred in 5 patients including four uterine bleedings at the puncture site, one placental vascular anastomosis bleeding. Postoperative complications occurred in 6 patients including 2 abortions and 1 intrauterine death within one week after operation, 2 abortions and 1 amniotic band syndrome occurred from two to four weeks after operation. (3) Perinatal outcome and fetal survival rate: the median interval of 33 patients between FLOC and delivery was 9(+4) weeks; the median gestational age at delivery was 31(+6) weeks; the gestation at delivery was less than 24 weeks in 6% (2/33), 24 to 28 weeks in 21% (7/33), 28 to 32 weeks in 18% (6/33), 32 to 37 weeks in 55% (18/33). The mean birth weight of the donor was 1600 g (350 - 2520 g); the mean birth weight of the recipiert was 1930 g (400 - 3040 g). The overall survival rate, the double infant survival rate, the single survival rate and survival rate for at least one twin was 59% (39/66), 52% (17/33), 15% (5/33) and 67% (22/33), respectively. The overall survival rate dropped from 61% (17/28) in Quintero staging II to 9/18 in Quintero staging IV. FLOC for MCDA complicated with TTTS is associated with an overall survival of about 60%. Major complications are rare. The outcome is not only related to Quintero staging but also the close monitoring and timely termination of pregnancy. | {
"pile_set_name": "PubMed Abstracts"
} |
The delay-reduction hypothesis: effects of informative events on response rates and choice.
The present study replicated a prior one by Pearce and Collins (1985) in which informative events displayed greater reinforcing strength than did uninformative ones despite higher rates of reinforcement on the uninformative alternative, both in a choice test and in a test that presented the events successively. The delay-reduction hypothesis of choice and conditioned reinforcement is consistent with results from the successive test but cannot account for the choice results. As the original study conducted the choice test following the successive test for all subjects, and as no reversals of the choice procedure were carried out, the present study replicated Pearce and Collins (1985) while controlling for order effects. Pigeons' relative rate of responding on the informative side was significantly greater in the successive procedure than in the choice procedure (as in the prior study); however, the uninformative side was significantly preferred to the informative side in the choice procedure when order of exposure to the two types of procedures was controlled. Both findings are consistent with the delay-reduction hypothesis. | {
"pile_set_name": "PubMed Abstracts"
} |
Sun Exposure Behavior, Seasonal Vitamin D Deficiency, and Relationship to Bone Health in Adolescents.
Vitamin D is essential for bone health in adolescence, when there is rapid bone mineral content accrual. Because cutaneous sun exposure provides vitamin D, there is no recommended oral intake for UK adolescents. Our objective was to assess seasonal vitamin D status and its contributors in white Caucasian adolescents and examine bone health in those found deficient. Prospective cohort study was undertaken. Six schools in Greater Manchester, UK, were included. Participants were 131 adolescents between 12 and 15 years of age. Seasonal assessment of circulating 25-hydroxyvitamin D (25OHD), personal sun exposure, and dietary vitamin D. Adolescents deficient (25OHD <10 ng/ml/25 nmol/liter) in at least one season underwent dual-energy X-ray absorptiometry (lumbar spine, femoral neck), with bone mineral apparent density correction for size, and peripheral quantitative computed tomography (distal radius) for volumetric bone mineral density (BMD). Serum 25OHD and BMD measurements. Mean 25OHD was highest in September: 24.1 (SD, 6.9) ng/ml and lowest in January: 15.5 (5.9) ng/ml. Over the year, 16% were deficient in ≥ one season and 79% insufficient (25OHD <20 ng/ml/50 nmol/liter) including 28% in September. Dietary vitamin D was low year-round, whereas personal sun exposure was seasonal and predominantly across the school week. Holidays accounted for 17% variation in peak 25OHD (P < .001). Nineteen adolescents underwent bone assessment, which showed low femoral neck bone mineral apparent density vs matched reference data (P = .0002), three with Z less than or equal to -2.0 distal radius trabecular volumetric BMD. Sun exposure levels failed to provide adequate vitamin D, with approximately one-quarter of adolescents insufficient even at summer peak. Seasonal vitamin D deficiency was prevalent and those affected had low BMD. Recommendations on vitamin D acquisition are indicated in this age-group. | {
"pile_set_name": "PubMed Abstracts"
} |
//
// Generated by class-dump 3.5 (64 bit) (Debug version compiled Oct 15 2018 10:31:50).
//
// class-dump is Copyright (C) 1997-1998, 2000-2001, 2004-2015 by Steve Nygard.
//
#import <Foundation/NSUserDefaults.h>
@interface NSUserDefaults (SpecificDomainAdditions)
+ (id)_IMObjectForKey:(id)arg1 inDomain:(id)arg2;
+ (void)_IMSetObject:(id)arg1 forKey:(id)arg2 inDomain:(id)arg3;
+ (id)_IMAppObjectForKey:(id)arg1;
+ (id)_IMAgentObjectForKey:(id)arg1;
@end
| {
"pile_set_name": "Github"
} |
National multi-stakeholder processes and their relation to the IGF
Agenda
The WSIS Plan of Action (para 8b) encourages the development at national level of a structured dialogue involving all relevant stakeholders and the experience of the IGF is beginning to replicate in several countries.
On the basis of a few real-life experiences, this workshop will explore different national initiatives facilitating interaction with the IGF or using multi-stakeholder methods to address national policy choices. It will also provide an opportunity to identify similar initiatives already implemented or under way in other countries. Its purpose is to document, inter alia:
the diversity of frameworks adopted according to the local context, the actors who took the initiative and the challenges encountered;
the purposes of these structures or processes and the corresponding methodologies they have adopted;
their articulation with the global IGF and also the emerging regional ones.
This will hopefully illustrate the benefits of strengthening and enhancing the engagement of all stakeholders in existing and future Internet governance mechanisms, but also allow for exchanges of good practices and the dissemination of useful information to actors who intend to launch similar initiative in their own country or region.
Efforts have been made to gather panelists belonging to the different stakeholder groups and the format will be highly interactive to encourage participants in the workshop to share their own experiences. | {
"pile_set_name": "Pile-CC"
} |
---
abstract: 'In this paper we examine some aspects of the field of a scalar point charge in curved spacetimes. First we find the closed form solution for the scalar field due to a point charge in Schwarzschild spacetime. Then we expand it locally in powers of r (coordinate distance from the charge) and compare it to Quinn’s local expansion for the field of scalar charge. We show a term by term match, except for a mismatch in one term arising due to an error in a Riemann tensor term in Quinn’s expression. We show the correct expression, the detailed derivation of which will be subject of a later paper.'
author:
- Swapnil Tripathi
title: Examining the Field of Static Point Scalar Charge in Schwarzschild Spacetime
---
Introduction
============
Notations and Conventions
=========================
Field Equation
===============
Solution of field equation
==========================
Quinn’s Local Expansion of Scalar Field
=======================================
Conversion of Coordinates
=========================
Comparison
==========
Conclusion
==========
Acknowledgments
===============
It is a pleasure to thank Alan Wiseman for suggesting this problem and providing guidance in solving the problem. I would also like to thank John Friedman for many useful conversations and helpful suggestions. I would like to thank Gonzalo Olmo for providing help in overcoming some mathematical hurdles and Tobias Keidl for proofreading the manuscript and suggesting ways to improve the paper.
| {
"pile_set_name": "ArXiv"
} |
<?xml version="1.0" encoding="UTF-8"?>
<ui version="4.0">
<class>DesktopShareDlg</class>
<widget class="QDialog" name="DesktopShareDlg">
<property name="geometry">
<rect>
<x>0</x>
<y>0</y>
<width>481</width>
<height>277</height>
</rect>
</property>
<property name="windowTitle">
<string>Desktop Sharing</string>
</property>
<layout class="QVBoxLayout" name="verticalLayout_2">
<item>
<widget class="QGroupBox" name="groupBox">
<property name="title">
<string>Window to Share</string>
</property>
<layout class="QVBoxLayout" name="verticalLayout">
<item>
<widget class="QRadioButton" name="desktopRadioBtn">
<property name="text">
<string>Share entire desktop</string>
</property>
<property name="checked">
<bool>true</bool>
</property>
</widget>
</item>
<item>
<widget class="QRadioButton" name="actwndRadioButton">
<property name="text">
<string>Share active window</string>
</property>
</widget>
</item>
<item>
<layout class="QHBoxLayout" name="horizontalLayout" stretch="0,1">
<item>
<widget class="QRadioButton" name="specificwndRadioButton">
<property name="text">
<string>Share specific window</string>
</property>
</widget>
</item>
<item>
<widget class="QComboBox" name="windowComboBox">
<property name="enabled">
<bool>false</bool>
</property>
<property name="maximumSize">
<size>
<width>400</width>
<height>16777215</height>
</size>
</property>
</widget>
</item>
</layout>
</item>
</layout>
</widget>
</item>
<item>
<widget class="QGroupBox" name="groupBox_2">
<property name="title">
<string>Shared Window Look</string>
</property>
<layout class="QVBoxLayout" name="verticalLayout_3">
<item>
<layout class="QHBoxLayout" name="horizontalLayout_3">
<item>
<widget class="QLabel" name="label">
<property name="text">
<string>Color mode</string>
</property>
<property name="buddy">
<cstring>rgbComboBox</cstring>
</property>
</widget>
</item>
<item>
<widget class="QComboBox" name="rgbComboBox"/>
</item>
<item>
<spacer name="horizontalSpacer_2">
<property name="orientation">
<enum>Qt::Horizontal</enum>
</property>
<property name="sizeHint" stdset="0">
<size>
<width>40</width>
<height>20</height>
</size>
</property>
</spacer>
</item>
</layout>
</item>
<item>
<layout class="QHBoxLayout" name="horizontalLayout_2">
<item>
<widget class="QCheckBox" name="updintervakChkBox">
<property name="text">
<string>Update interval</string>
</property>
<property name="checked">
<bool>true</bool>
</property>
</widget>
</item>
<item>
<widget class="QSpinBox" name="intervalSpinBox">
<property name="minimumSize">
<size>
<width>50</width>
<height>0</height>
</size>
</property>
<property name="minimum">
<number>50</number>
</property>
<property name="maximum">
<number>60000</number>
</property>
<property name="singleStep">
<number>100</number>
</property>
<property name="value">
<number>250</number>
</property>
</widget>
</item>
<item>
<widget class="QLabel" name="label_2">
<property name="text">
<string>msec</string>
</property>
</widget>
</item>
<item>
<spacer name="horizontalSpacer">
<property name="orientation">
<enum>Qt::Horizontal</enum>
</property>
<property name="sizeHint" stdset="0">
<size>
<width>40</width>
<height>20</height>
</size>
</property>
</spacer>
</item>
</layout>
</item>
<item>
<widget class="QCheckBox" name="cursorChkBox">
<property name="text">
<string>Share desktop cursor</string>
</property>
</widget>
</item>
</layout>
</widget>
</item>
<item>
<spacer name="verticalSpacer">
<property name="orientation">
<enum>Qt::Vertical</enum>
</property>
<property name="sizeHint" stdset="0">
<size>
<width>20</width>
<height>40</height>
</size>
</property>
</spacer>
</item>
<item>
<widget class="QDialogButtonBox" name="buttonBox">
<property name="orientation">
<enum>Qt::Horizontal</enum>
</property>
<property name="standardButtons">
<set>QDialogButtonBox::Cancel|QDialogButtonBox::Ok</set>
</property>
</widget>
</item>
</layout>
</widget>
<tabstops>
<tabstop>desktopRadioBtn</tabstop>
<tabstop>actwndRadioButton</tabstop>
<tabstop>specificwndRadioButton</tabstop>
<tabstop>windowComboBox</tabstop>
<tabstop>rgbComboBox</tabstop>
<tabstop>updintervakChkBox</tabstop>
<tabstop>intervalSpinBox</tabstop>
<tabstop>buttonBox</tabstop>
</tabstops>
<resources/>
<connections>
<connection>
<sender>buttonBox</sender>
<signal>accepted()</signal>
<receiver>DesktopShareDlg</receiver>
<slot>accept()</slot>
<hints>
<hint type="sourcelabel">
<x>236</x>
<y>199</y>
</hint>
<hint type="destinationlabel">
<x>157</x>
<y>181</y>
</hint>
</hints>
</connection>
<connection>
<sender>buttonBox</sender>
<signal>rejected()</signal>
<receiver>DesktopShareDlg</receiver>
<slot>reject()</slot>
<hints>
<hint type="sourcelabel">
<x>304</x>
<y>199</y>
</hint>
<hint type="destinationlabel">
<x>286</x>
<y>181</y>
</hint>
</hints>
</connection>
<connection>
<sender>specificwndRadioButton</sender>
<signal>toggled(bool)</signal>
<receiver>windowComboBox</receiver>
<slot>setEnabled(bool)</slot>
<hints>
<hint type="sourcelabel">
<x>84</x>
<y>89</y>
</hint>
<hint type="destinationlabel">
<x>202</x>
<y>90</y>
</hint>
</hints>
</connection>
<connection>
<sender>updintervakChkBox</sender>
<signal>clicked(bool)</signal>
<receiver>intervalSpinBox</receiver>
<slot>setEnabled(bool)</slot>
<hints>
<hint type="sourcelabel">
<x>68</x>
<y>132</y>
</hint>
<hint type="destinationlabel">
<x>154</x>
<y>132</y>
</hint>
</hints>
</connection>
</connections>
</ui>
| {
"pile_set_name": "Github"
} |
Markus Schopp
Markus Schopp (born 22 February 1974) is an Austrian football coach and a former midfielder. He is the head coach of TSV Hartberg.
Club career
He last played for New York Red Bulls of Major League Soccer (USA). He was on a loan from its sister football club Red Bull Salzburg (Austria).
Schopp played for Sturm Graz and Red Bull Salzburg (Austria), as well as Hamburger SV (Germany) and Brescia Calcio (Italy).
He retired from football in December 2007 due to chronic back problems.
International career
He made his debut for Austria in an August 1995 European Championship qualifying match against Latvia and was a participant at the 1998 FIFA World Cup. He earned 56 caps, scoring 6 goals. His final international was an October 2005 World Cup qualifying match against Northern Ireland.
National team statistics
Managerial career
On April 2013, he was named temporary as the new coach of SK Sturm Graz until the end of the season, following Peter Hyballa's sacking.
Honours
Austrian Football Bundesliga (1):
1999
References
External links
Category:1974 births
Category:Living people
Category:Sportspeople from Graz
Category:Austrian footballers
Category:Austria international footballers
Category:Association football midfielders
Category:1998 FIFA World Cup players
Category:SK Sturm Graz players
Category:Hamburger SV players
Category:Brescia Calcio players
Category:FC Red Bull Salzburg players
Category:New York Red Bulls players
Category:Austrian Football Bundesliga players
Category:Serie A players
Category:Major League Soccer players
Category:Austrian football managers
Category:Austrian expatriate footballers
Category:Expatriate footballers in Germany
Category:Expatriate footballers in Italy
Category:Expatriate soccer players in the United States
Category:Bundesliga players | {
"pile_set_name": "Wikipedia (en)"
} |
Q:
Why am I getting a parse error in this PHP code?
Here is my error:
Parse error: syntax error, unexpected T_ENCAPSED_AND_WHITESPACE, expecting T_STRING or T_VARIABLE or T_NUM_STRING in /home/socia125/public_html/poke.php on line 19
This is line 19 of my code:
$sql="INSERT INTO feed (user_id, feed_text, time) VALUES($user,'You'.mysql_real_escape_string($_POST['kiss_option']).'yourself',UNIX_TIMESTAMP())";
Why am I getting this error?
A:
$sql = "INSERT INTO feed (user_id, feed_text, time)
VALUES($user, 'You ".mysql_real_escape_string($_POST['kiss_option'])." yourself', UNIX_TIMESTAMP())";
| {
"pile_set_name": "StackExchange"
} |
/** -*- linux-c -*- ***********************************************************
* Linux PPP over X/Ethernet (PPPoX/PPPoE) Sockets
*
* PPPoX --- Generic PPP encapsulation socket family
* PPPoE --- PPP over Ethernet (RFC 2516)
*
*
* Version: 0.5.2
*
* Author: Michal Ostrowski <mostrows@speakeasy.net>
*
* 051000 : Initialization cleanup
*
* License:
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation; either version
* 2 of the License, or (at your option) any later version.
*
*/
#include <linux/string.h>
#include <linux/module.h>
#include <linux/kernel.h>
#include <linux/errno.h>
#include <linux/netdevice.h>
#include <linux/net.h>
#include <linux/init.h>
#include <linux/if_pppox.h>
#include <linux/ppp_defs.h>
#include <linux/if_ppp.h>
#include <linux/ppp_channel.h>
#include <linux/kmod.h>
#include <net/sock.h>
#include <asm/uaccess.h>
static const struct pppox_proto *pppox_protos[PX_MAX_PROTO + 1];
int register_pppox_proto(int proto_num, const struct pppox_proto *pp)
{
if (proto_num < 0 || proto_num > PX_MAX_PROTO)
return -EINVAL;
if (pppox_protos[proto_num])
return -EALREADY;
pppox_protos[proto_num] = pp;
return 0;
}
void unregister_pppox_proto(int proto_num)
{
if (proto_num >= 0 && proto_num <= PX_MAX_PROTO)
pppox_protos[proto_num] = NULL;
}
void pppox_unbind_sock(struct sock *sk)
{
/* Clear connection to ppp device, if attached. */
if (sk->sk_state & (PPPOX_BOUND | PPPOX_CONNECTED)) {
ppp_unregister_channel(&pppox_sk(sk)->chan);
sk->sk_state = PPPOX_DEAD;
}
}
EXPORT_SYMBOL(register_pppox_proto);
EXPORT_SYMBOL(unregister_pppox_proto);
EXPORT_SYMBOL(pppox_unbind_sock);
int pppox_ioctl(struct socket *sock, unsigned int cmd, unsigned long arg)
{
struct sock *sk = sock->sk;
struct pppox_sock *po = pppox_sk(sk);
int rc;
lock_sock(sk);
switch (cmd) {
case PPPIOCGCHAN: {
int index;
rc = -ENOTCONN;
if (!(sk->sk_state & PPPOX_CONNECTED))
break;
rc = -EINVAL;
index = ppp_channel_index(&po->chan);
if (put_user(index , (int __user *) arg))
break;
rc = 0;
sk->sk_state |= PPPOX_BOUND;
break;
}
default:
rc = pppox_protos[sk->sk_protocol]->ioctl ?
pppox_protos[sk->sk_protocol]->ioctl(sock, cmd, arg) : -ENOTTY;
}
release_sock(sk);
return rc;
}
EXPORT_SYMBOL(pppox_ioctl);
static int pppox_create(struct net *net, struct socket *sock, int protocol,
int kern)
{
int rc = -EPROTOTYPE;
if (protocol < 0 || protocol > PX_MAX_PROTO)
goto out;
rc = -EPROTONOSUPPORT;
if (!pppox_protos[protocol])
request_module("pppox-proto-%d", protocol);
if (!pppox_protos[protocol] ||
!try_module_get(pppox_protos[protocol]->owner))
goto out;
rc = pppox_protos[protocol]->create(net, sock);
module_put(pppox_protos[protocol]->owner);
out:
return rc;
}
static const struct net_proto_family pppox_proto_family = {
.family = PF_PPPOX,
.create = pppox_create,
.owner = THIS_MODULE,
};
static int __init pppox_init(void)
{
return sock_register(&pppox_proto_family);
}
static void __exit pppox_exit(void)
{
sock_unregister(PF_PPPOX);
}
module_init(pppox_init);
module_exit(pppox_exit);
MODULE_AUTHOR("Michal Ostrowski <mostrows@speakeasy.net>");
MODULE_DESCRIPTION("PPP over Ethernet driver (generic socket layer)");
MODULE_LICENSE("GPL");
| {
"pile_set_name": "Github"
} |
Kevin Parke
Kevin W. Parke is an American lawyer and business executive. He is best known as President of the Todd Wagner Foundation.
Biography
Kevin Parke was born in Wilmington, Delaware, USA, in May 1959, the oldest son of Lowell W. Parke and Lois A. Parke. Parke attended Alexis I duPont High School, graduating in 1977. Parke attended Vanderbilt University in Nashville, where he received a Bachelor of Arts degree in Economics and Psychology in 1981. He subsequently received a J.D. degree in 1985 from Southern Methodist University in University Park, Texas. He began his legal career with Akin Gump Strauss Hauer & Feld in Dallas, Texas. He later became a corporate partner with the law firm Hopkins & Sutter.
Parke left full-time law practice and eventually joined a start-up company, AudioNet, where he was responsible for all broadcast operations, streaming technology and business development. AudioNet was renamed Broadcast.com in 1998 shortly before its initial public offering. That company was acquired by Yahoo! in 1999 for $5.7 billion. Following that merger, Parke became vice-president and general manager of Yahoo! Broadcast. Parke left Yahoo! in 2003 to join Broadcast.com co-founder Todd Wagner's private foundation as President. In addition to his role with the Todd Wagner Foundation, Parke was executive vice president of the Wagner/Cuban Companies. and president of Landmark Theatres, which operated up to 70 theatres in 23 markets. Parke joined 2M Capital Management in 2011 as operating partner for several of its portfolio investments including Alpha Dominche Ltd. and Altior.
References
Category:Living people
Category:American businesspeople
Category:Year of birth missing (living people) | {
"pile_set_name": "Wikipedia (en)"
} |
Metabolic relationships between lipolysis and respiration in rat brown adipocytes. The role of long chain fatty acids as regulators of mitochondrial respiration and feedback inhibitors of lipolysis.
The calorigenic action of norepinephrine in isolated brown adipocytes was selectively mimicked by theophylline, dibutyryl cyclic AMP, and the principal fatty acids known to be present in the acyl moieties of brown adipose tissue triglycerides (palmitic, oleic, and linoleic acids). The stimulatory effects of fatty acids were entirely reversible, occurred at physiological concentrations, and were critically dependent upon the molar ratio of extracellular fatty acids to albumin. The calorigenic potency of fatty acids increased with their chain length. The apparent synchrony between the switching "on and off" of lipolysis and respiration by norepinephrine and propranolol indicated that the two phenomena are functionally inter-related and that they are both mediated by beta-adrenoreceptors. Respiratory stimulation by palmitic acid was accompanied by an inhibition of glycerol release suggesting that fatty acids retroinhibit lipolysis while simultaneously activating respiration. Studies with 2-tetradecylglycidic acid, oligomycin, and uncouplers of oxidative phosphorylation support the view that fatty acids exert their calorigenic effects by increasing mitochondrial proton permeability and by simultaneously serving as substrates for beta-oxidation via carnitine-dependent pathways. Since fatty acids mimicked the calorigenic action of norepinephrine even when beta-adrenoreceptors were blocked by propranolol, it is concluded that cyclic AMP controls respiration indirectly, most probably by modulating lipolysis. It is suggested that endogenous long chain fatty acids released in consequence of cyclic AMP activation of lipolysis play a fundamental role in the control of brown adipose tissue metabolism by self-regulating lipolysis and by serving as physiological modulators of mitochondrial oxygen consumption. | {
"pile_set_name": "PubMed Abstracts"
} |
#!/bin/bash
CMD=$0
DEV=
help () {
echo -e "\n Create a data volume for postgres data"
echo -e "\n Usage:"
echo -e "\n $CMD [--dev] [-h]"
echo -e "\n --dev: dev-specific"
echo -e " -h: show this message\n"
exit 1
}
while [ $# -gt 0 ]; do
if [ $1 == "--dev" ]; then
DEV="-dev"
elif [ $1 == "-h" ]; then
help
else
echo -e "\nERROR: do not understand $1\n"
help
fi
shift
done
./prune.sh
docker volume rm -f "postgresql-data$DEV"
docker volume create "postgresql-data$DEV"
docker volume ls
| {
"pile_set_name": "Github"
} |
601 S.E.2d 873 (2004)
STATE of North Carolina
v.
John Jacob MORTON.
No. COA03-1150.
Court of Appeals of North Carolina.
September 21, 2004.
*874 Attorney General Roy A. Cooper, III, by Special Deputy Attorney General George W. Boylan, for the State.
Law Offices of J. Darren Byers, P.A., by J. Darren Byers, Winston-Salem, for defendant-appellant.
HUNTER, Judge.
John Jacob Morton ("defendant") appeals from a judgment filed on 22 January 2003 consistent with a jury verdict finding him guilty of possession of stolen goods. Defendant was sentenced to eight to ten months incarceration. We conclude that the trial court erred in allowing inadmissible hearsay into evidence and remand the case for a new trial.
The evidence tends to show that in August 2001, Johnny Isenhour ("Isenhour") reported that about $20,000.00 worth of his stored tools, equipment and repair parts for vehicles and tractors were stolen from a garage owned by his mother-in-law in Catawba County. He had not visited the garage in approximately two weeks before he discovered his missing property and had not given anyone permission to take it. At the beginning of the investigation, Isenhour gave Catawba County Detective Doug Carter ("Detective Carter") a very detailed description of every item taken, including makes, colors, and any markings Isenhour had put on them. Within seven to ten days, Isenhour identified some of his property in Alexander County, recovered by the sheriff's department.
A couple of days later Detective Carter called Isenhour and told him that the Catawba County Sheriff's Department had discovered other items for him to identify in photographs. Isenhour identified and retrieved more of his tools.
Later, Detective Freddy Sloan ("Detective Sloan") was able to secure a search warrant for defendant's cargo trailer at Vintage Flea Market. Detective Sloan and other officers inventoried, numbered, and photographed 256 items from defendant's trailer. The items that were recovered from the trailer included tools. Detective Sloan contacted Isenhour, *875 who identified some of the property as belonging to him.
Before the trial, the State filed notice that it intended to offer William Miller's ("Miller") and James Watters' ("Watters") statements into evidence because it was unable to procure their attendance by process or other reasonable means. Defendant filed two motions in limine. One motion requested that the court confine the scope of the trial to the events that constituted the indictable offense and not include investigations and actions of law enforcement, alleged victims or perpetrators in other jurisdictions since the Yadkin County investigator's reports revealed that there was a multi-county investigation surrounding stolen goods. That motion was granted. The other motion moved the court to prohibit the introduction of Miller's and Watters' written statements and it was not granted by the trial court.
At trial, Miller was present and testified. He had already pled guilty to breaking into Isenhour's garage. He was defendant's friend and a former friend of Watters. He testified that he and another friend, Wayne Probst, committed the crime. He stored Isenhour's property in a storage building rented by Watters. Further, Miller testified that he sold the stolen property to Watters, but he never took any property to defendant and did not know Watters was selling property to defendant.
Watters was not present during the trial. Detective Carter had interviewed Watters on 24 August 2001 at approximately 3:54 p.m. because he was a suspect in the investigation of the break-in. The trial court allowed Watters' statements to be read into evidence by Detective Carter. Again, defendant objected to the reading of it to the jury, but the trial court overruled the objection. During the interview, Watters said he sold stolen property to defendant and defendant knew that it was stolen. Defendant also allowed Watters to use his blue Astro van to haul stolen property from Watters' storage shed to defendant's home. Watters stated that Isenhour's stolen property was the first load of merchandise that he had taken to defendant. He further stated that defendant knew the merchandise was stolen and defendant kept harassing him about getting more of it.
Chasity Prather ("Prather") was the only witness for defendant. She was Watters' ex-wife and defendant's former employee. She testified that she had spoken to Watters the morning of the trial and she knew where he was, in Hickory, North Carolina. She also testified that she was present one time when defendant paid Watters for merchandise.
Defendant assigns error to (I) the trial court admitting Watters' statements into evidence when he was not actually unavailable, (II) the trial court not granting defendant's motions to dismiss because the State failed to show defendant's knowing possession of stolen goods, and (III) the trial court admitting evidence of criminal investigations of defendant in other counties.
I.
Defendant first argues that the trial court erred in allowing the hearsay statements of Watters to be introduced into evidence. We agree. Watters' statements to Carter were inadmissible hearsay even if the witness was unavailable. The Confrontation Clause of the United States Constitution, as interpreted by Crawford v. Washington, 541 U.S. ___, 124 S.Ct. 1354, 158 L.Ed.2d 177 (2004), provides "[w]here testimonial evidence is at issue,... the Sixth Amendment demands what the common law required: unavailability and a prior opportunity for cross-examination." Id. at ___, 124 S.Ct. at 1373, 158 L.Ed.2d at 203. It also provides that:
Admitting statements deemed reliable by a judge is fundamentally at odds with the right of confrontation. To be sure, the Clause's ultimate goal is to ensure reliability of evidence, but it is a procedural rather than a substantive guarantee.
Id. at ___, 124 S.Ct. at 1370, 158 L.Ed.2d at 199.
Here, Crawford applies because Watters' statements to Carter, a detective for a sheriff's department, were testimonial in nature. They were made during an interview at the Catawba County Sheriff's Department after Watters' Miranda rights *876 were given. Crawford does not define "testimonial" but clearly held, "[w]hatever else the term covers, it applies at a minimum to prior testimony at a preliminary hearing, before a grand jury, or at a former trial; and to police interrogations. These are the modern practices with closest kinship to the abuses at which the Confrontation Clause was directed." Id. at ___, 124 S.Ct. at 1374, 158 L.Ed.2d at 203. "Statements taken by police officers in the course of interrogations are also testimonial under even a narrow standard." Id. at ___, 124 S.Ct. at 1364, 158 L.Ed.2d at 193.
Therefore, in the case now before us, we hold that Watters' statements to Carter are inadmissible because defendant did not have a prior opportunity to cross-examine Watters regarding his statements and that the admission of those statements during the trial was a violation of defendant's right to confrontation under the Sixth Amendment.
"[W]here there is an alleged violation of the defendant's constitutional rights, the State has the burden of showing that the error was `harmless beyond a reasonable doubt.'" State v. Dunn, 154 N.C.App. 1, 17-18, 571 S.E.2d 650, 661 (2002) (quoting N.C. Gen.Stat. § 15A-1443 (2001)).
The principles of due process of law require the State to prove beyond a reasonable doubt every essential element of the crime charged. See State v. White, 300 N.C. 494, 499, 268 S.E.2d 481, 485 (1980). The elements of the crime with which defendant is charged, possession of stolen property, are (I) possession of personal property, (II) worth more than $1,000.00, (III) which has been stolen, (IV) knowing or having reasonable grounds to believe the property was stolen, and (V) having possession for a dishonest purpose. N.C. Gen.Stat. § 14-71.1; see also State v. Bailey, 157 N.C.App. 80, 86, 577 S.E.2d 683, 688 (2003). As the State offered no evidence that defendant knew the items were stolen, in the absence of Watters' inadmissible statements, we cannot conclude the trial court's error was harmless beyond a reasonable doubt. We therefore grant a new trial.
II.
Defendant next contends that the trial court erred in denying his motions to dismiss at the close of the State's evidence and at the close of all of the evidence because there was insufficient proof that he knew or had reasonable grounds to believe that the property in his possession was stolen. See N.C. Gen.Stat. § 14-71.1 (2003). We disagree.
In order to survive a motion to dismiss in a criminal action, the evidence must be "substantial evidence (a) of each essential element of the offense charged, or of a lesser offense included therein, and (b) of defendant's being the perpetrator of the offense." State v. Earnhardt, 307 N.C. 62, 65-66, 296 S.E.2d 649, 651 (1982). All evidence actually admitted, whether competent or not, must be viewed in the light most favorable to the State, drawing every reasonable inference in favor of the State. See State v. Benson, 331 N.C. 537, 544, 417 S.E.2d 756, 761 (1992); State v. Jones, 342 N.C. 523, 540, 467 S.E.2d 12, 23 (1996) (citing State v. Vause, 328 N.C. 231, 237, 400 S.E.2d 57, 61 (1991)). Whether the evidence presented is substantial is a question of law for the court. State v. Stephens, 244 N.C. 380, 384, 93 S.E.2d 431, 433 (1956). It is not a sufficient basis for granting a motion to dismiss that some of the evidence was erroneously admitted by the trial court. See Jones at 540, 467 S.E.2d at 23.
Defendant contends there was insufficient evidence presented of the knowledge element of the crime, as the only evidence produced by the State indicating that defendant knew the items were stolen came from Watters' statements, read by Detective Carter. Although such statements were improperly admitted by the trial court, they must be considered when reviewing the evidence on a motion to dismiss.
Watters' testimony tended to show that defendant knew he was purchasing stolen property, harassed Watters to obtain more, and loaned Watters the use of his van to haul the stolen property to his home. We therefore conclude that substantial evidence was presented that supports the inference that defendant knew the items were stolen, and *877 therefore the trial court did not err in denying defendant's motions to dismiss.
As the trial court erred in admitting Watters' hearsay testimony into evidence, and such an error was prejudicial to defendant, we therefore conclude defendant is entitled to a new trial.
The questions raised by defendant's additional assignment of error may not recur during a new trial and hence, will not be considered in this appeal.
New trial.
Chief Judge MARTIN and Judge TIMMONS-GOODSON concur.
| {
"pile_set_name": "FreeLaw"
} |
Q:
Count all numbers inside Parent div, and then sort them on Totals
I want to calculate the total per "row-counts" of all "counts" inside, and then sort "row" based on the "row-totals". But the totals add up all numbers with class="count" instead of 'for each' only those within it's parent "row-counts".
<div id="container">
<div class="row">
<div class="row-counts">
<span class="count">12</span>
<span class="count">4</span>
<span class="count">5</span>
<span class="count">7</span>
</div>
<div class="row-totals">
</div>
</div>
<div class="row">
<div class="row-counts">
<span class="count">4</span>
<span class="count">66</span>
<span class="count">0</span>
<span class="count">12</span>
</div>
<div class="row-totals">
</div>
</div>
<div class="row">
<div class="row-counts">
<span class="count">7</span>
<span class="count">99</span>
<span class="count">42</span>
<span class="count">17</span>
</div>
<div class="row-totals">
</div>
</div>
</div>
<script>
// to calculate sum of all numbers in .row-counts
$('.row-counts').each(function(){
var sum = 0;
var select = $(this).find('.count');
select.each(function()
{
sum += parseFloat($(this).text());
});
$('.row-totals').html(sum);
});
// to sort on .row-totals
$(".row-totals").orderBy(function() {return +$(this).text();}).appendTo("#container");
jQuery.fn.orderBy = function(keySelector)
{
return this.sort(function(a,b)
{
a = keySelector.apply(a);
b = keySelector.apply(b);
if (a > b)
return 1;
if (a < b)
return -1;
return 0;
});
};
</script>
Sorting plugin is from this topic: Sorting divs by number inside div tag and jQuery
A:
Here you go. Code commented with some pointers. Hope this helps.
http://jsfiddle.net/N5Sd2/
// to calculate sum of all numbers in .row-counts
$('.row').each(function(index,RowElement){ // For each row
var thisRowTotal = $(RowElement).find('.row-totals'); // set output div in variable
var thisRowCounts = $(RowElement).find('.row-counts'); // set row count parent div in variable
var sum = 0; // create sum var
thisRowCounts.each(function(i,RowCountParent){ // for each row count parent
var select = $(RowCountParent).find('.count'); // find counts
select.each(function(i,e){ // for each count found
sum = sum + parseInt($(e).html()); // convert into integer and add to sum
}); // when finished
thisRowTotal.html(sum); // output sum to output div
});
});
// to sort on .row-totals
jQuery.fn.orderBy = function(keySelector) // MAKE SURE YOU INIT THE PLUGIN...
{
return this.sort(function(a,b)
{
a = keySelector.apply(a);
b = keySelector.apply(b);
if (a > b)
return 1;
if (a < b)
return -1;
return 0;
});
};
// ....BEFORE YOU CALL IT IN YOUR CODE! This line moved UNDER the plugin.
$(".row-totals").orderBy(function() {return +$(this).text();}).appendTo("#container");
| {
"pile_set_name": "StackExchange"
} |
Q:
How to add selected numbers in a list in Python
I have a list of numbers , and I want to add up the numbers, but I don't want to add all the numbers from the list, just the selected numbers, like the first three.
list = [2, 3, 7, 11, 15, 21]
for i in list:
sum += i
My code obviously adds up all the numbers from the list. I've tried changing the for loop to in range(0,4) but that just added together numbers 0, 1, 2, 3 and not the numbers from my list. So how can I modify my code to add up the first three numbers from my list.
A:
You could slice your list...
list[0:3]
You could do it like...
sum(list[0:3])
It also appears you don't need the start 0 there.
A:
You need to iterate through the first three elements of your list. You can do this using list slicing
total = 0
for i in lst[:3]:
total += i
As a side note, don't name your variables list or sum as they will override the built in type/function and could cause problems down the track.
| {
"pile_set_name": "StackExchange"
} |
Q:
How to elegantly ignore some return values of a MATLAB function?
Is it possible to get the 'nth' return value from a function without having to create dummy variables for all n-1 return values before it?
Let's say, I have the following function in MATLAB:
function [a,b,c,d] = func()
a = 1;
b = 2;
c = 3;
d = 4;
Now suppose, I'm only interested in the third return value. This can be accomplished by creating one dummy variable:
[dummy, dummy, variableThatIWillUse, dummy] = func;
clear dummy;
But I think this is kind of ugly. I would think that you might be able to do something like one of the following things, but you can't:
[_, _, variableThatIWillUse, _] = func;
[, , variableThatIWillUse, ] = func;
variableThatIWillUse = func(3);
variableThatIWillUse = func()(3);
Are there any elegant ways to do this that do work?
So far, the best solution is to simply use the variableThatIWillUse as a dummy variable. This saves me from having to create a real dummy variable that pollutes the work-space (or that I would need to clear). In short: the solution is to use the variableThatIWillUse for every return value up until the interesting one. Return values after can simply be ignored:
[variableThatIWillUse, variableThatIWillUse, variableThatIWillUse] = func;
I still think this is very ugly code, but if there is no better way, then I guess I'll accept the answer.
A:
With MATLAB Version 7.9 (R2009b) you can use a ~, e.g.,
[~, ~, variableThatIWillUse] = myFunction();
Note that the , isn't optional. Just typing [~ ~ var] will not work, and will throw an error.
See the release notes for details.
A:
This is somewhat of a hack but it works:
First a quick example function:
Func3 = @() deal(1,2,3);
[a,b,c]=Func3();
% yields a=1, b=2, c=3
Now the key here is that if you use an variable twice in the left hand side of a multiple-expression assignment, an earlier assignment is clobbered by the later assignment:
[b,b,c]=Func3();
% yields b=2, c=3
[c,c,c]=Func3();
% yields c=3
(edit: just to check, I also verified that this technique works with [mu,mu,mu]=polyfit(x,y,n) if all you care about from polyfit is the 3rd argument)
edit: there's a better approach; see ManWithSleeve's answer instead.
A:
If you wish to use a style where a variable will be left to fall into the bit bucket, then a reasonable alternative is
[ans,ans,variableThatIWillUse] = myfun(inputs);
ans is of course the default junk variable for matlab, getting overwritten often in the course of a session.
While I do like the new trick that MATLAB now allows, using a ~ to designate an ignored return variable, this is a problem for backwards compatibility, in that users of older releases will be unable to use your code. I generally avoid using new things like that until at least a few MATLAB releases have been issued to ensure there will be very few users left in the lurch. For example, even now I find people are still using an old enough MATLAB release that they cannot use anonymous functions.
| {
"pile_set_name": "StackExchange"
} |
299/28)
Simplify ((c*c/((c/(c*c**(-4/7)))/c*c)*c)/((c**(-3/11)*c)/c)*c*c**(3/2)*c**(1/18))**(-3/22) assuming c is positive.
c**(-3643/5082)
Simplify j**(-1)/j*(j/j**(1/3))/j*(j*j**1/j)**(-3/10) assuming j is positive.
j**(-79/30)
Simplify ((c*(c*c**4*c)/c*c/(c/(c**(2/11)/c)))/(((c/c**4)/c*c)/((c**(-6)/c)/c)))**(2/9) assuming c is positive.
c**(4/99)
Simplify (g**(-4))**(2/37)/((g/((g*g*g**8*g)/g))/g*g*g**(1/21)*g*g) assuming g is positive.
g**(5234/777)
Simplify ((v*v*v*v**(9/4)*v*(v**(-17)/v)/v)**(-1/8))**(-6/13) assuming v is positive.
v**(-153/208)
Simplify (((i/i**(-3))/i)/i*i**(9/5))/(i**(1/7)*i**8) assuming i is positive.
i**(-152/35)
Simplify ((r*r**(-13/5))**(-47))**(2/99) assuming r is positive.
r**(752/495)
Simplify ((((m**(2/11)/m)/m*m*m)/((m/(m*m*m/m**(3/2)*m))/m*m))**(-1/21))**(-9/2) assuming m is positive.
m**(111/308)
Simplify ((((i/(i**(-7)/i))/i)/i*i)/(i*i**13*i*i))/((((i/(i/(i**(-15)*i*i)))/i)/i)/(i/i**(-19))) assuming i is positive.
i**27
Simplify (k*(k**(-21)/k)/k*k*k**22)**(-46) assuming k is positive.
k**(-46)
Simplify (g**(-13)*g**(-1)/g)/((g*(g**2/g)/g*g*g*g)/(g/(g*g*(g*g/g**(2/5))/g))) assuming g is positive.
g**(-103/5)
Simplify (h**(-2/25)*h**(2/15)/h)/(h**(3/10)/(h/(h/h**(-1/13)*h*h))) assuming h is positive.
h**(-6481/1950)
Simplify (q**(2/7))**(7/5)*q/q**7*q*(((q**(-10/3)*q)/q)/q)/q*q assuming q is positive.
q**(-134/15)
Simplify q**(-3/5)*q*q**(-1/3)*q*(q/(q/q**0))**(-29) assuming q is positive.
q**(16/15)
Simplify (z/(z**(-15/2)*z)*z*z/(z*(z**(-2/3)/z)/z*z)*z)/(z/z**(-7))**(-12/5) assuming z is positive.
z**(911/30)
Simplify (x**1)**(-2/135)*((x/x**(1/2))/x)/(x*x*x/((x*x**(6/7)/x*x*x)/x)) assuming x is positive.
x**(-3133/1890)
Simplify ((j/j**(-17))**(-50))**(-31) assuming j is positive.
j**27900
Simplify (w**(2/23))**(1/8)/((w*w**(-24)*w*w)/w**(-20)) assuming w is positive.
w**(93/92)
Simplify (f**(-1/7)*f**(-2/3)*(f**(1/3)*f)**13)**(-2) assuming f is positive.
f**(-694/21)
Simplify (c**(-1/35)/(c*c/(c*c/(c/(c/c**(8/7))*c)*c)))/((c**(-5/2)/c*c)/c*c*c/c**(-10)*c*c) assuming c is positive.
c**(-817/70)
Simplify ((a**3*a/(a*a/a**(-5)))/((a/(a/a**(2/5)))/(a/(a*a**(-1/8)))))**(-1/26) assuming a is positive.
a**(131/1040)
Simplify (v**(1/5))**28/(v**(-3))**(-14) assuming v is positive.
v**(-182/5)
Simplify (f**(7/2)*(f*(f/f**(2/3))/f)/f*f/(f**2*f)*f**(-1))**(2/95) assuming f is positive.
f**(-1/285)
Simplify ((s**(1/3))**6*(s*s/(s*s*s/(s/(s*((s**0/s*s)/s)/s*s*s))*s))**(-3/10))**(2/15) assuming s is positive.
s**(26/75)
Simplify (((t/t**(-1))/(t*t/(t/(t*t*t**3*t))))**(2/17))**(-8/3) assuming t is positive.
t**(80/51)
Simplify (((j/j**(-5))/j**(-4))**36)**(-6/13) assuming j is positive.
j**(-2160/13)
Simplify (y*y**(-2/11))**14/(y**2)**(-20/3) assuming y is positive.
y**(818/33)
Simplify ((u**(2/3)*u)**(-12)*(u/(u**(-3)*u*u*u))**(-18/13))**(13/2) assuming u is positive.
u**(-139)
Simplify ((t/t**(15/7)*t**(-2/5)*t)**(-5/3))**33 assuming t is positive.
t**(209/7)
Simplify ((c/(((c*c*c/(c*c**9*c)*c)/c)/c))/((c*(c/(c**(-30)*c))/c)/c))/(c**(-14)/c*c*c*(c**(1/17)*c)/c) assuming c is positive.
c**(-103/17)
Simplify (y**(-7))**(1/5)/(y*y**(1/3))**(-3/2) assuming y is positive.
y**(3/5)
Simplify ((j/j**(2/11))/(j**(19/5)*j))/(j**(2/5)*j)**(-2/23) assuming j is positive.
j**(-4883/1265)
Simplify ((j/j**(-26))**(-35/6))**(5/12) assuming j is positive.
j**(-525/8)
Simplify (x**0*x)**49*(x**(2/9)*x)**35 assuming x is positive.
x**(826/9)
Simplify (l**(-27)*l/(l**(-18)*l))/((l*l/l**(9/4))/(l/l**(-1/14))) assuming l is positive.
l**(-215/28)
Simplify (b**(-4/11))**3/(b**(-5))**(9/7) assuming b is positive.
b**(411/77)
Simplify (u**(3/10))**(-5/3)/((u*u*u**(-2/5)*u*u)/u*u*u**(-21)) assuming u is positive.
u**(169/10)
Simplify g**(5/4)/g**(-12/11)*(g**(-13)/g)/(g*g*g**(-8)/g) assuming g is positive.
g**(-205/44)
Simplify ((x/(x**(-22)/x*x))/x)**1*(x*x**(3/4))/x**(2/19) assuming x is positive.
x**(1797/76)
Simplify p*p/p**(-2/13)*p*p**(-3)*(p*p/p**(-1/3))**9 assuming p is positive.
p**(275/13)
Simplify ((g**(2/5)/(g/(g*g**(3/11))))/(g**(-6)*g**(-2/3)))**(2/53) assuming g is positive.
g**(2422/8745)
Simplify ((o**(2/17)/o)**14)**0 assuming o is positive.
1
Simplify ((u*u*u**(2/7))/((u**0/u)/u*u)*(u**2)**22)**48 assuming u is positive.
u**(15888/7)
Simplify ((p/(p/(p/(p*p*p**(-2/31)*p))*p*p))/(p*p/p**(-3)*p))/(p/(p/(p**8*p))*p*p**15/p*p*p) assuming p is positive.
p**(-1114/31)
Simplify (a**(-12)/a**(5/11))**27 assuming a is positive.
a**(-3699/11)
Simplify (((u*u**1*u*u)/u)**37*(u**(-1)*u)**(-2/39))**(-4/7) assuming u is positive.
u**(-444/7)
Simplify (((s/(s/s**(1/4))*s)**(-41))**(-2/27))**(-2/79) assuming s is positive.
s**(-205/2133)
Simplify (i**(-1)*i)**(-5/3)*((i/i**(1/4))/i)/((i/i**(-1/4))/i) assuming i is positive.
1/sqrt(i)
Simplify ((g**(26/7)/g)/g)/g**(-1)*(g**(-2/7)/g)/g**(-10) assuming g is positive.
g**(80/7)
Simplify (d**(-2/5)*d*d**10)/(d**4)**(-45) assuming d is positive.
d**(953/5)
Simplify (((c**(2/9)/c)/c)/(c/c**(-30)))/(c**8)**(-5/3) assuming c is positive.
c**(-175/9)
Simplify i*i**(-9)*i*i/i**(-23)*i**(-15)/(i**(-1/6)/i*i) assuming i is positive.
i**(13/6)
Simplify t**(-1/9)/t*t**(-2/5)*t**5/t**(-4) assuming t is positive.
t**(337/45)
Simplify (k**(7/4)*k**29*k)/(k**(-31)*k/(k**(2/3)/k)) assuming k is positive.
k**(737/12)
Simplify (o**4)**37/(o**0)**35 assuming o is positive.
o**148
Simplify (((l/(l/l**(1/3))*l)/(((l**(2/7)*l)/l)/l))**(-1/27))**15 assuming l is positive.
l**(-215/189)
Simplify ((l**(-9)/(l/(l/((l*l/(l/((l**(-3/2)*l)/l)))/l))))**(-40))**(1/18) assuming l is positive.
l**(50/3)
Simplify u**(-5)*u**(-7)*(u**(-2/7)*u*u*u)**(-46) assuming u is positive.
u**(-958/7)
Simplify ((f*f/f**(-2/3))**45/(f**7/(f/((f/((f**6*f)/f*f))/f))))**(30/13) assuming f is positive.
f**(3630/13)
Simplify ((u/((u/u**(-2/5)*u*u)/u))**24/(u*(u/((u/u**(-2/5))/u)*u)/u*u)**(-2/3))**(1/23) assuming u is positive.
u**(-478/345)
Simplify (f*f**(-5/2))**(-2/27)*(f/(f**(-13)/f))**(-5/16) assuming f is positive.
f**(-659/144)
Simplify ((s*(s*s*s**(1/6))/s)/s*s*(s**(-1/3)/s)/s)/((s/(s*s/(s*s*s**1)))/(s**7/s)) assuming s is positive.
s**(23/6)
Simplify (s**7*s)**(-2/73)*(s/s**(-4))**(18/11) assuming s is positive.
s**(6394/803)
Simplify (p**0/((p/p**7)/p))/((p*p**(-3/11))/((p/(p*p/(p*p**(-8))*p))/p*p*p)) assuming p is positive.
p**(-19/11)
Simplify (q**(2/5)/q**(-18))/((q**(-7/5)*q)/q**(1/8)) assuming q is positive.
q**(757/40)
Simplify (((b*b**(2/27)/b*b)/b*(b*b**(-7))/b)/(b**7/(b**(2/15)*b)))**4 assuming b is positive.
b**(-6908/135)
Simplify g/((g**(-2/13)*g)/g)*g/g**(-11)*g/(g/g**11)*g*g**(-10) assuming g is positive.
g**(197/13)
Simplify (((c**(1/3))**(-3/8))**39)**25 assuming c is positive.
c**(-975/8)
Simplify (f/(f*f/(f*f**(4/5)*f*f))*f/f**(-17))/(((f/((f**(1/2)*f)/f))/f)/f**(-22)) assuming f is positive.
f**(-7/10)
Simplify (q*(q*q**(2/11)/q)/q)**(-20/9)/(q**(4/5))**(-35) assuming q is positive.
q**(2732/99)
Simplify j*j/j**(1/16)*j*j**(-16)*j/(j/(j/((j**(-1/3)/j)/j*j)))*j**8/j assuming j is positive.
j**(-179/48)
Simplify (y**(-2)*y**(2/3)*y)/(y**(-10)*y**(5/7)/y) assuming y is positive.
y**(209/21)
Simplify (((w/(w/((w/(w/(w*w**5))*w)/w)))/w)/(w/(((w**24/w)/w)/w*w)))/(((w*w/(w*w*w**9)*w*w)/w)/w**16) assuming w is positive.
w**50
Simplify ((j*(j*j**(6/11))/j)/j**(8/7))/(j**5)**(-7/5) assuming j is positive.
j**(570/77)
Simplify (((s**(-44)/s)/s*s)/s**(1/11))**(5/6) assuming s is positive.
s**(-1240/33)
Simplify ((h**30/h)/h**(-32))**(-31) assuming h is positive.
h**(-1891)
Simplify (((c*c/((c*c**(-23))/c))/c)/(c*c**(-26)))**(-29) assuming c is positive.
c**(-1421)
Simplify ((u**(2/3))**(-41)/((u**(1/7)/u)/u*(u*u**(3/5))/u*u))**(-2/145) assuming u is positive.
u**(5686/15225)
Simplify (k**(-2/7)*k)/k**(-2/15)*((k*k**(-1)*k)/k)**(-10/3) assuming k is positive.
k**(89/105)
Simplify (((v*v**1)/v)**34*(v**(-4)*v*v)/v**(-1/10))**(-5/4) assuming v is positive.
v**(-321/8)
Simplify ((i/(i*i/(i*(i*i**(-6/11))/i)*i*i)*i)/(i*(i*i**(-1/20)/i)/i))**(-9) assuming i is positive.
i**(2961/220)
Simplify (j**(2/17))**(13/5)/(((j/j**(-8))/j)/(j/(j/(j**(4/17)*j))*j)) assuming j is positive.
j**(-464/85)
Simplify ((l**1)**(-17/3)*l**(-3)*l*l/l**(-1))**(-2) assuming l is positive.
l**(34/3)
Simplify (z*z/(z*z**(-11))*z*z*z/(z/(z*z**(1/3)*z))*z | {
"pile_set_name": "DM Mathematics"
} |
[Spatial distribution pattern and stock estimation of nutrients during bloom season in Lake Taihu].
Based on the data of high density spatial sampling in July 2013, we analyzed the spatial distribution pattern of nutrients and estimated their amount during bloom season in Lake Taihu to discuss the correlation of algal bloom in different types of ecological water and nutrients in large shallow lake and the representative of its sampling sites. The research showed that nutrients and chlorophyll-a concentration (CHL) in Lake Taihu tended to reduce from northwest to southeast in general during bloom season. Nitrogen was mainly present in dissolved form, accounting for 76.28 percent of the total nitrogen (TN), and phosphorus was mainly present in particulate form, accounting for 66.38 percent of the total phosphorus (TP). The sampling points in the whole lake could be divided into four sections with significant difference between each other using principal component analysis and cluster analysis: The first section was located in the district of northwestern Lake Taihu, which represented the heavy eutrophic lake areas with serious blooms; the second section mainly included Meiliang Bay and area of river inflow into lake in South of Lake Taihu, which stood for moderate eutrophication of water quality; The third section included the central area and the southwest of lake, which represented the water area with medium water pollution, but blooms were frequent; And the fourth area was the remainder areas including Gonghu Bay, Xukou Bay, and Eastern Taihu, which stood for the region of weaker blooms and better water quality. Different factors also affected the growth of planktonic algae in different sections: From the point of the whole lake, CHL was significantly correlated with TP, TN, total dissolved nitrogen (TDN) and nitrate nitrogen (NO3(-) -N); while in the first section, CHL was significantly correlated to TP and TDN; CHL was correlated to TN and TDN in the second section; in the third section, the influencing factors were TP, reactive phosphate (PO4(3-) -P), TDN; PO4(3-)-P, total dissolved phosphorus (TDP) and nitrite nitrogen (NO2(-) -N) were the influencing factors for the fourth section. The study showed that the values of TN, TDN, TP and TDP respectively were 12 800 tons, 9 800 tons, 445 tons and 150 tons during the research period. As a large shallow lake, Lake Taihu showed high spatial heterogeneity in nutrients during bloom season, which was resulted from the space migration accumulation characteristics of cyanobacteria blooms and the alienation characteristics of ecological type. Therefore, when monitoring and evaluating the large shallow lakes, sampling points should be set rationally and the results should be interpreted properly, to avoid overgeneralization due to improper monitoring points and statistical methods. | {
"pile_set_name": "PubMed Abstracts"
} |