text
stringlengths 1
1.57M
⌀ |
|---|
Top Chef offers help to Emma
Jean-Christophe Novelli in Wigan last week
THE Emma Hoolin appeal has captured the heart of celebrity chef Jean-Christophe Novelli.
On hearing of the Wigan youngster’s plight, the French culinary wizard immediately donated for auction some vouchers for his exclusive training academy.
Novelli was in town taking part in the annual Food and Drink Festival when he was told about the four-year-old Whitley girl’s battle with cancer.
Family are hoping that Emma is now nearing the end of sometimes punishing immunotherapy at the Children’s Hospital of Philadelphia in the US which is aimed at preventing the return of a potentially deadly form of cancer.
Emma, who was diagnosed with a high risk neuroblastoma at the beginning of last year and had already undergone most conventional forms of cancer treatment, was faced with raising a massive £211,000 in less than 100 days in order to get the life-saving treatment.
And, thanks to a massive and enthusiastic charitable effort across the borough, the target was hit in 38 days less than that.
Novelli heard Emma’s story while giving a cookery demonstration at Rigaletto’s restaurant at the DW Stadium.
The vouchers will entitle the highest bidders to a special, VIP day at his academy in Hertfordshire.
Based at Crouchmoor farm, it is surrounded by rolling green countryside and acres of farmland. The garden at the academy provides the kitchen with seasonally fresh fruit and vegetables, all the year round.
The kitchen itself is equipped with all modern appliances and has been recently refurbished, although it still retains its British farmhouse kitchen charm. The usual cost for two people is £1,000, but Novelli will put the day on free of charge.
The successful bidders will spend the day with the chef and be taught how to cook up some wonderful dishes by the man himself.
Jean-Christophe also spoke with Wigan Leisure Culture Trust about helping out the Wigan Youth Zone too at some point.
He said: “I wouldn’t have wanted to leave Wigan without doing something for a local charity and I am amazed at the what both charities have achieved in Wigan.
“We need to raise as much money as we can for both, so dig deep.”
A spokesperson for the Emma Hoolin appeal said they were delighted by such a generous donation. The vouchers will be auctioned off as a pair via ebay at http://cgi.ebay.co.uk/ws/eBayISAPI.dll?ViewItem&item=280843219464 They will be sold as a pair as opposed to individually.
For more information on Jean-Christophe’s academy, visit www.jeanchristophenovelli.com.
Meanwhile four members of the Wigan Athletic staff completed their gruelling cycle to Norwich City at the weekend in aid of the Emma appeal.
Former players Neill Rimmer and Matt Jackson were joined by Centre of Excellence employees Kenny Williams and Gary Sloane in the long journey ahead of Sunday’s 1-1 draw with the Canaries.
The group set off last Wednesday and arrived at their location on Saturday after having travelled more than 60 miles per day. Neill said: “It’s nice to be home!
“We had a great time though. The primary reason behind the ride was to raise money for Emma and it’s great to hear she is doing so well and could be ready to come home soon.
“She is an amazing little girl and we drew strength from her. The ride itself was fantastic.
“We have become such close friends as a result and it’s certainly something we will still talk about in 30 years time!
“We had a lot of laughs, particularly when Matt got a flat tyre and fell off... again.”
The group have asked that any donations be placed via the official Emma Hoolin Justgiving page www.justgiving.com/hope4emma.
Excitement was growing both at home and in America this week as hopes were further raised that Emma could be home in Wigan within the next few days.
It depends on what doctors say about her progress but family friends say that the signs are currently encouraging.
One of them, Linn Robinson, said: “Emma is doing really well. She can not wait to return home and is very eager to start school.
“The whole family is very excited about returning home. After what has been an incredibly difficult year, the Hoolins are looking forward to returning to a more normal life amongst family and friends.”
This website and its associated newspaper adheres to the Independent Press Standards Organisation's Editors' Code of Practice.
If you have a complaint about editorial content which relates to inaccuracy or intrusion, then contact the
Editor by clicking here.
If you remain dissatisfied with the response provided then you can contact the IPSO by
clicking here.
Wigan Today provides news, events and sport features from the Wigan area. For the best up to date information relating to Wigan and the surrounding areas visit us at Wigan Today regularly or bookmark this page.
For you to enjoy all the features of this website Wigan Today requires permission to use cookies.
Find Out More ▼
What is a Cookie?
What is a Flash Cookie?
Can I opt out of receiving Cookies?
About our Cookies
Cookies are small data files which are sent to your browser (Internet Explorer, Firefox, Chrome etc) from a website you visit. They are stored on your electronic device.
This is a type of cookie which is collected by Adobe Flash media player (it is also called a Local Shared Object) - a piece of software you may already have on your electronic device to help you watch online videos and listen to podcasts.
Yes there are a number of options available, you can set your browser either to reject all cookies, to allow only "trusted" sites to set them, or to only accept them from the site you are currently on.
However, please note - if you block/delete all cookies, some features of our websites, such as remembering your login details, or the site branding for your local newspaper may not function as a result.
The types of cookies we, our ad network and technology partners use are listed below:
Revenue Science ►
A tool used by some of our advertisers to target adverts to you based on pages you have visited in the past. To opt out of this type of targeting you can visit the 'Your Online Choices' website by clicking here.
Google Ads ►
Our sites contain advertising from Google; these use cookies to ensure you get adverts relevant to you. You can tailor the type of ads you receive by visiting here or to opt out of this type of targeting you can visit the 'Your Online Choices' website by clicking here.
Digital Analytics ►
This is used to help us identify unique visitors to our websites. This data is anonymous and we cannot use this to uniquely identify individuals and their usage of the sites.
Dart for Publishers ►
This comes from our ad serving technology and is used to track how many times you have seen a particular ad on our sites, so that you don't just see one advert but an even spread. This information is not used by us for any other type of audience recording or monitoring.
ComScore ►
ComScore monitor and externally verify our site traffic data for use within the advertising industry. Any data collected is anonymous statistical data and cannot be traced back to an individual.
Local Targeting ►
Our Classified websites (Photos, Motors, Jobs and Property Today) use cookies to ensure you get the correct local newspaper branding and content when you visit them. These cookies store no personally identifiable information.
Grapeshot ►
We use Grapeshot as a contextual targeting technology, allowing us to create custom groups of stories outside out of our usual site navigation. Grapeshot stores the categories of story you have been exposed to. Their privacy policy and opt out option can be accessed here.
Subscriptions Online ►
Our partner for Newspaper subscriptions online stores data from the forms you complete in these to increase the usability of the site and enhance user experience.
Add This ►
Add This provides the social networking widget found in many of our pages. This widget gives you the tools to bookmark our websites, blog, share, tweet and email our content to a friend. |
Q:
How do I retain the aspect ratio of an image if its dimensions are percentages?
My images have a 16:9 aspect ratio. I would like each image's width to be 33% of the entire browser window so I can stack 3 images per row:
[ ] [ ] [ ]
[ ] [ ] [ ]
[ ]
When I specify width:33% in CSS, the height does not change to maintain the 16:9 aspect ratio. Apparently, CSS is unlike HTML. In HTML, only one dimension needs to be specified.
A:
Just add height: auto.. Thus:
img {
width: 33%;
height: auto;
}
Then the height adjusts itself according to the width.
|
345 S.W.3d 896 (2011)
In the Interest of H.R.W. and R.H.W. A.K.M. (mother), Appellant,
v.
L.M.M., Respondent.
No. WD 73381.
Missouri Court of Appeals, Western District.
August 23, 2011.
Anastacia R. Adamson, Kansas City, Michael J. Belfonte, Kansas City, MO, for appellant.
James A. Waits, Kansas City, MO, for respondent.
Before: VICTOR C. HOWARD, P.J., and ALOK AHUJA and KAREN KING MITCHELL, JJ.
ORDER
PER CURIAM:
A.K.M. appeals from a judgment terminating her parental rights to her minor sons, H.R.W. and R.H.W. The trial court terminated A.K.M.'s parental rights in an adoption action under Chapter 453, RSMo, on the grounds of neglect and A.K.M.'s failure to rectify the conditions which led to the juvenile court's initial assumption of jurisdiction over the children. A.K.M. contends that the court erred because: the grounds on which the circuit court relied to terminate her parental rights were unsupported by the evidence; the court's determination that termination was in the children's best interests was unsupported by the evidence; the court improperly adopted the proposed findings of fact and conclusions of law prepared by the Petitioner; the court erroneously failed to permit the children's great aunt and uncle to intervene; and the court failed to follow §§ 211.455.3 and 211.447.3, RSMo. We affirm. Because a published opinion would have no precedential value, an unpublished memorandum setting forth the reasons for this order has been provided to the parties. Rule 84.16(b).
|
Login
Important Notice: this site uses cookies. By continuing to use our site you are deemed to have accepted our cookie policy.
Welcome to the Travelport Customer Portal
Dear Travelport customer,
Welcome to the Travelport Customer Portal, where you will be able to find relevant information whether you are looking for contact details, product specials, latest news or detailed support information. |
Self-monitoring of dietary intake by young women: online food records completed on computer or smartphone are as accurate as paper-based food records but more acceptable.
Adherence and accuracy of self-monitoring of dietary intake influences success in weight management interventions. Information technologies such as computers and smartphones have the potential to improve adherence and accuracy by reducing the burden associated with monitoring dietary intake using traditional paper-based food records. We evaluated the acceptability and accuracy of three different 7-day food record methods (online accessed via computer, online accessed via smartphone, and paper-based). Young women (N=18; aged 23.4±2.9 years; body mass index 24.0±2.2) completed the three 7-day food records in random order with 7-day washout periods between each method. Total energy expenditure (TEE) was derived from resting energy expenditure (REE) measured by indirect calorimetry and physical activity level (PAL) derived from accelerometers (TEE=REE×PAL). Accuracy of the three methods was assessed by calculating absolute (energy intake [EI]-TEE) and percentage difference (EI/TEE×100) between self-reported EI and TEE. Acceptability was assessed via questionnaire. Mean±standard deviation TEE was 2,185±302 kcal/day and EI was 1,729±249 kcal/day, 1,675±287kcal/day, and 1,682±352 kcal/day for computer, smartphone, and paper records, respectively. There were no significant differences between absolute and percentage differences between EI and TEE for the three methods: computer, -510±389 kcal/day (78%); smartphone, -456±372 kcal/day (80%); and paper, -503±513 kcal/day (79%). Half of participants (n=9) preferred computer recording, 44.4% preferred smartphone, and 5.6% preferred paper-based records. Most participants (89%) least preferred the paper-based record. Because online food records completed on either computer or smartphone were as accurate as paper-based records but more acceptable to young women, they should be considered when self-monitoring of intake is recommended to young women. |
// Copyright (c) 2012 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "net/dns/host_resolver_impl.h"
#include <memory>
#include <utility>
#include "base/memory/ptr_util.h"
#if defined(OS_WIN)
#include <Winsock2.h>
#elif defined(OS_POSIX)
#include <netdb.h>
#endif
#include <cmath>
#include <utility>
#include <vector>
#include "base/bind.h"
#include "base/bind_helpers.h"
#include "base/callback.h"
#include "base/compiler_specific.h"
#include "base/debug/debugger.h"
#include "base/debug/leak_annotations.h"
#include "base/debug/stack_trace.h"
#include "base/macros.h"
#include "base/memory/ptr_util.h"
#include "base/metrics/field_trial.h"
#include "base/metrics/histogram_macros.h"
#include "base/metrics/sparse_histogram.h"
#include "base/profiler/scoped_tracker.h"
#include "base/single_thread_task_runner.h"
#include "base/stl_util.h"
#include "base/strings/string_util.h"
#include "base/strings/utf_string_conversions.h"
#include "base/threading/thread_task_runner_handle.h"
#include "base/threading/worker_pool.h"
#include "base/time/time.h"
#include "base/trace_event/trace_event.h"
#include "base/values.h"
#include "net/base/address_family.h"
#include "net/base/address_list.h"
#include "net/base/host_port_pair.h"
#include "net/base/ip_address.h"
#include "net/base/ip_endpoint.h"
#include "net/base/net_errors.h"
#include "net/base/url_util.h"
#include "net/dns/address_sorter.h"
#include "net/dns/dns_client.h"
#include "net/dns/dns_config_service.h"
#include "net/dns/dns_protocol.h"
#include "net/dns/dns_reloader.h"
#include "net/dns/dns_response.h"
#include "net/dns/dns_transaction.h"
#include "net/dns/dns_util.h"
#include "net/dns/host_resolver_proc.h"
#include "net/log/net_log.h"
#include "net/socket/client_socket_factory.h"
#include "net/udp/datagram_client_socket.h"
#include "url/url_canon_ip.h"
#if defined(OS_WIN)
#include "net/base/winsock_init.h"
#endif
namespace net {
namespace {
// Default delay between calls to the system resolver for the same hostname.
// (Can be overridden by field trial.)
const int64_t kDnsDefaultUnresponsiveDelayMs = 6000;
// Limit the size of hostnames that will be resolved to combat issues in
// some platform's resolvers.
const size_t kMaxHostLength = 4096;
// Default TTL for successful resolutions with ProcTask.
const unsigned kCacheEntryTTLSeconds = 60;
// Default TTL for unsuccessful resolutions with ProcTask.
const unsigned kNegativeCacheEntryTTLSeconds = 0;
// Minimum TTL for successful resolutions with DnsTask.
const unsigned kMinimumTTLSeconds = kCacheEntryTTLSeconds;
// Time between IPv6 probes, i.e. for how long results of each IPv6 probe are
// cached.
const int kIPv6ProbePeriodMs = 1000;
// Google DNS address used for IPv6 probes.
const uint8_t kIPv6ProbeAddress[] =
{ 0x20, 0x01, 0x48, 0x60, 0x48, 0x60, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x88, 0x88 };
// We use a separate histogram name for each platform to facilitate the
// display of error codes by their symbolic name (since each platform has
// different mappings).
const char kOSErrorsForGetAddrinfoHistogramName[] =
#if defined(OS_WIN)
"Net.OSErrorsForGetAddrinfo_Win";
#elif defined(OS_MACOSX)
"Net.OSErrorsForGetAddrinfo_Mac";
#elif defined(OS_LINUX)
"Net.OSErrorsForGetAddrinfo_Linux";
#else
"Net.OSErrorsForGetAddrinfo";
#endif
// Gets a list of the likely error codes that getaddrinfo() can return
// (non-exhaustive). These are the error codes that we will track via
// a histogram.
std::vector<int> GetAllGetAddrinfoOSErrors() {
int os_errors[] = {
#if defined(OS_POSIX)
#if !defined(OS_FREEBSD)
#if !defined(OS_ANDROID)
// EAI_ADDRFAMILY has been declared obsolete in Android's and
// FreeBSD's netdb.h.
EAI_ADDRFAMILY,
#endif
// EAI_NODATA has been declared obsolete in FreeBSD's netdb.h.
EAI_NODATA,
#endif
EAI_AGAIN,
EAI_BADFLAGS,
EAI_FAIL,
EAI_FAMILY,
EAI_MEMORY,
EAI_NONAME,
EAI_SERVICE,
EAI_SOCKTYPE,
EAI_SYSTEM,
#elif defined(OS_WIN)
// See: http://msdn.microsoft.com/en-us/library/ms738520(VS.85).aspx
WSA_NOT_ENOUGH_MEMORY,
WSAEAFNOSUPPORT,
WSAEINVAL,
WSAESOCKTNOSUPPORT,
WSAHOST_NOT_FOUND,
WSANO_DATA,
WSANO_RECOVERY,
WSANOTINITIALISED,
WSATRY_AGAIN,
WSATYPE_NOT_FOUND,
// The following are not in doc, but might be to appearing in results :-(.
WSA_INVALID_HANDLE,
#endif
};
// Ensure all errors are positive, as histogram only tracks positive values.
for (size_t i = 0; i < arraysize(os_errors); ++i) {
os_errors[i] = std::abs(os_errors[i]);
}
return base::CustomHistogram::ArrayToCustomRanges(os_errors,
arraysize(os_errors));
}
enum DnsResolveStatus {
RESOLVE_STATUS_DNS_SUCCESS = 0,
RESOLVE_STATUS_PROC_SUCCESS,
RESOLVE_STATUS_FAIL,
RESOLVE_STATUS_SUSPECT_NETBIOS,
RESOLVE_STATUS_MAX
};
// ICANN uses this localhost address to indicate a name collision.
//
// The policy in Chromium is to fail host resolving if it resolves to
// this special address.
//
// Not however that IP literals are exempt from this policy, so it is still
// possible to navigate to http://127.0.53.53/ directly.
//
// For more details: https://www.icann.org/news/announcement-2-2014-08-01-en
const uint8_t kIcanNameCollisionIp[] = {127, 0, 53, 53};
void UmaAsyncDnsResolveStatus(DnsResolveStatus result) {
UMA_HISTOGRAM_ENUMERATION("AsyncDNS.ResolveStatus",
result,
RESOLVE_STATUS_MAX);
}
bool ResemblesNetBIOSName(const std::string& hostname) {
return (hostname.size() < 16) && (hostname.find('.') == std::string::npos);
}
// True if |hostname| ends with either ".local" or ".local.".
bool ResemblesMulticastDNSName(const std::string& hostname) {
DCHECK(!hostname.empty());
const char kSuffix[] = ".local.";
const size_t kSuffixLen = sizeof(kSuffix) - 1;
const size_t kSuffixLenTrimmed = kSuffixLen - 1;
if (hostname[hostname.size() - 1] == '.') {
return hostname.size() > kSuffixLen &&
!hostname.compare(hostname.size() - kSuffixLen, kSuffixLen, kSuffix);
}
return hostname.size() > kSuffixLenTrimmed &&
!hostname.compare(hostname.size() - kSuffixLenTrimmed, kSuffixLenTrimmed,
kSuffix, kSuffixLenTrimmed);
}
// Attempts to connect a UDP socket to |dest|:53.
bool IsGloballyReachable(const IPAddress& dest, const BoundNetLog& net_log) {
// TODO(eroman): Remove ScopedTracker below once crbug.com/455942 is fixed.
tracked_objects::ScopedTracker tracking_profile_1(
FROM_HERE_WITH_EXPLICIT_FUNCTION("455942 IsGloballyReachable"));
std::unique_ptr<DatagramClientSocket> socket(
ClientSocketFactory::GetDefaultFactory()->CreateDatagramClientSocket(
DatagramSocket::DEFAULT_BIND, RandIntCallback(), net_log.net_log(),
net_log.source()));
int rv = socket->Connect(IPEndPoint(dest, 53));
if (rv != OK)
return false;
IPEndPoint endpoint;
rv = socket->GetLocalAddress(&endpoint);
if (rv != OK)
return false;
DCHECK_EQ(ADDRESS_FAMILY_IPV6, endpoint.GetFamily());
const IPAddress& address = endpoint.address();
bool is_link_local =
(address.bytes()[0] == 0xFE) && ((address.bytes()[1] & 0xC0) == 0x80);
if (is_link_local)
return false;
const uint8_t kTeredoPrefix[] = {0x20, 0x01, 0, 0};
if (IPAddressStartsWith(address, kTeredoPrefix))
return false;
return true;
}
// Provide a common macro to simplify code and readability. We must use a
// macro as the underlying HISTOGRAM macro creates static variables.
#define DNS_HISTOGRAM(name, time) UMA_HISTOGRAM_CUSTOM_TIMES(name, time, \\
base::TimeDelta::FromMilliseconds(1), base::TimeDelta::FromHours(1), 100)
// A macro to simplify code and readability.
#define DNS_HISTOGRAM_BY_PRIORITY(basename, priority, time) \\
do { \\
switch (priority) { \\
case HIGHEST: DNS_HISTOGRAM(basename "_HIGHEST", time); break; \\
case MEDIUM: DNS_HISTOGRAM(basename "_MEDIUM", time); break; \\
case LOW: DNS_HISTOGRAM(basename "_LOW", time); break; \\
case LOWEST: DNS_HISTOGRAM(basename "_LOWEST", time); break; \\
case IDLE: DNS_HISTOGRAM(basename "_IDLE", time); break; \\
default: NOTREACHED(); break; \\
} \\
DNS_HISTOGRAM(basename, time); \\
} while (0)
// Record time from Request creation until a valid DNS response.
void RecordTotalTime(bool had_dns_config,
bool speculative,
base::TimeDelta duration) {
if (had_dns_config) {
if (speculative) {
DNS_HISTOGRAM("AsyncDNS.TotalTime_speculative", duration);
} else {
DNS_HISTOGRAM("AsyncDNS.TotalTime", duration);
}
} else {
if (speculative) {
DNS_HISTOGRAM("DNS.TotalTime_speculative", duration);
} else {
DNS_HISTOGRAM("DNS.TotalTime", duration);
}
}
}
void RecordTTL(base::TimeDelta ttl) {
UMA_HISTOGRAM_CUSTOM_TIMES("AsyncDNS.TTL", ttl,
base::TimeDelta::FromSeconds(1),
base::TimeDelta::FromDays(1), 100);
}
bool ConfigureAsyncDnsNoFallbackFieldTrial() {
const bool kDefault = false;
// Configure the AsyncDns field trial as follows:
// groups AsyncDnsNoFallbackA and AsyncDnsNoFallbackB: return true,
// groups AsyncDnsA and AsyncDnsB: return false,
// groups SystemDnsA and SystemDnsB: return false,
// otherwise (trial absent): return default.
std::string group_name = base::FieldTrialList::FindFullName("AsyncDns");
if (!group_name.empty()) {
return base::StartsWith(group_name, "AsyncDnsNoFallback",
base::CompareCase::INSENSITIVE_ASCII);
}
return kDefault;
}
//-----------------------------------------------------------------------------
AddressList EnsurePortOnAddressList(const AddressList& list, uint16_t port) {
if (list.empty() || list.front().port() == port)
return list;
return AddressList::CopyWithPort(list, port);
}
// Returns true if |addresses| contains only IPv4 loopback addresses.
bool IsAllIPv4Loopback(const AddressList& addresses) {
for (unsigned i = 0; i < addresses.size(); ++i) {
const IPAddress& address = addresses[i].address();
switch (addresses[i].GetFamily()) {
case ADDRESS_FAMILY_IPV4:
if (address.bytes()[0] != 127)
return false;
break;
case ADDRESS_FAMILY_IPV6:
return false;
default:
NOTREACHED();
return false;
}
}
return true;
}
// Creates NetLog parameters when the resolve failed.
std::unique_ptr<base::Value> NetLogProcTaskFailedCallback(
uint32_t attempt_number,
int net_error,
int os_error,
NetLogCaptureMode /* capture_mode */) {
std::unique_ptr<base::DictionaryValue> dict(new base::DictionaryValue());
if (attempt_number)
dict->SetInteger("attempt_number", attempt_number);
dict->SetInteger("net_error", net_error);
if (os_error) {
dict->SetInteger("os_error", os_error);
#if defined(OS_POSIX)
dict->SetString("os_error_string", gai_strerror(os_error));
#elif defined(OS_WIN)
// Map the error code to a human-readable string.
LPWSTR error_string = nullptr;
FormatMessage(FORMAT_MESSAGE_ALLOCATE_BUFFER | FORMAT_MESSAGE_FROM_SYSTEM,
0, // Use the internal message table.
os_error,
0, // Use default language.
(LPWSTR)&error_string,
0, // Buffer size.
0); // Arguments (unused).
dict->SetString("os_error_string", base::WideToUTF8(error_string));
LocalFree(error_string);
#endif
}
return std::move(dict);
}
// Creates NetLog parameters when the DnsTask failed.
std::unique_ptr<base::Value> NetLogDnsTaskFailedCallback(
int net_error,
int dns_error,
NetLogCaptureMode /* capture_mode */) {
std::unique_ptr<base::DictionaryValue> dict(new base::DictionaryValue());
dict->SetInteger("net_error", net_error);
if (dns_error)
dict->SetInteger("dns_error", dns_error);
return std::move(dict);
};
// Creates NetLog parameters containing the information in a RequestInfo object,
// along with the associated NetLog::Source.
std::unique_ptr<base::Value> NetLogRequestInfoCallback(
const HostResolver::RequestInfo* info,
NetLogCaptureMode /* capture_mode */) {
std::unique_ptr<base::DictionaryValue> dict(new base::DictionaryValue());
dict->SetString("host", info->host_port_pair().ToString());
dict->SetInteger("address_family",
static_cast<int>(info->address_family()));
dict->SetBoolean("allow_cached_response", info->allow_cached_response());
dict->SetBoolean("is_speculative", info->is_speculative());
return std::move(dict);
}
// Creates NetLog parameters for the creation of a HostResolverImpl::Job.
std::unique_ptr<base::Value> NetLogJobCreationCallback(
const NetLog::Source& source,
const std::string* host,
NetLogCaptureMode /* capture_mode */) {
std::unique_ptr<base::DictionaryValue> dict(new base::DictionaryValue());
source.AddToEventParameters(dict.get());
dict->SetString("host", *host);
return std::move(dict);
}
// Creates NetLog parameters for HOST_RESOLVER_IMPL_JOB_ATTACH/DETACH events.
std::unique_ptr<base::Value> NetLogJobAttachCallback(
const NetLog::Source& source,
RequestPriority priority,
NetLogCaptureMode /* capture_mode */) {
std::unique_ptr<base::DictionaryValue> dict(new base::DictionaryValue());
source.AddToEventParameters(dict.get());
dict->SetString("priority", RequestPriorityToString(priority));
return std::move(dict);
}
// Creates NetLog parameters for the DNS_CONFIG_CHANGED event.
std::unique_ptr<base::Value> NetLogDnsConfigCallback(
const DnsConfig* config,
NetLogCaptureMode /* capture_mode */) {
return config->ToValue();
}
std::unique_ptr<base::Value> NetLogIPv6AvailableCallback(
bool ipv6_available,
bool cached,
NetLogCaptureMode /* capture_mode */) {
std::unique_ptr<base::DictionaryValue> dict(new base::DictionaryValue());
dict->SetBoolean("ipv6_available", ipv6_available);
dict->SetBoolean("cached", cached);
return std::move(dict);
}
// The logging routines are defined here because some requests are resolved
// without a Request object.
// Logs when a request has just been started.
void LogStartRequest(const BoundNetLog& source_net_log,
const HostResolver::RequestInfo& info) {
source_net_log.BeginEvent(
NetLog::TYPE_HOST_RESOLVER_IMPL_REQUEST,
base::Bind(&NetLogRequestInfoCallback, &info));
}
// Logs when a request has just completed (before its callback is run).
void LogFinishRequest(const BoundNetLog& source_net_log,
const HostResolver::RequestInfo& info,
int net_error) {
source_net_log.EndEventWithNetErrorCode(
NetLog::TYPE_HOST_RESOLVER_IMPL_REQUEST, net_error);
}
// Logs when a request has been cancelled.
void LogCancelRequest(const BoundNetLog& source_net_log,
const HostResolverImpl::RequestInfo& info) {
source_net_log.AddEvent(NetLog::TYPE_CANCELLED);
source_net_log.EndEvent(NetLog::TYPE_HOST_RESOLVER_IMPL_REQUEST);
}
//-----------------------------------------------------------------------------
// Keeps track of the highest priority.
class PriorityTracker {
public:
explicit PriorityTracker(RequestPriority initial_priority)
: highest_priority_(initial_priority), total_count_(0) {
memset(counts_, 0, sizeof(counts_));
}
RequestPriority highest_priority() const {
return highest_priority_;
}
size_t total_count() const {
return total_count_;
}
void Add(RequestPriority req_priority) {
++total_count_;
++counts_[req_priority];
if (highest_priority_ < req_priority)
highest_priority_ = req_priority;
}
void Remove(RequestPriority req_priority) {
DCHECK_GT(total_count_, 0u);
DCHECK_GT(counts_[req_priority], 0u);
--total_count_;
--counts_[req_priority];
size_t i;
for (i = highest_priority_; i > MINIMUM_PRIORITY && !counts_[i]; --i);
highest_priority_ = static_cast<RequestPriority>(i);
// In absence of requests, default to MINIMUM_PRIORITY.
if (total_count_ == 0)
DCHECK_EQ(MINIMUM_PRIORITY, highest_priority_);
}
private:
RequestPriority highest_priority_;
size_t total_count_;
size_t counts_[NUM_PRIORITIES];
};
void MakeNotStale(HostCache::EntryStaleness* stale_info) {
if (!stale_info)
return;
stale_info->expired_by = base::TimeDelta::FromSeconds(-1);
stale_info->network_changes = 0;
stale_info->stale_hits = 0;
}
} // namespace
//-----------------------------------------------------------------------------
bool ResolveLocalHostname(base::StringPiece host,
uint16_t port,
AddressList* address_list) {
address_list->clear();
bool is_local6;
if (!IsLocalHostname(host, &is_local6))
return false;
address_list->push_back(IPEndPoint(IPAddress::IPv6Localhost(), port));
if (!is_local6) {
address_list->push_back(IPEndPoint(IPAddress::IPv4Localhost(), port));
}
return true;
}
const unsigned HostResolverImpl::kMaximumDnsFailures = 16;
// Holds the data for a request that could not be completed synchronously.
// It is owned by a Job. Canceled Requests are only marked as canceled rather
// than removed from the Job's |requests_| list.
class HostResolverImpl::Request {
public:
Request(const BoundNetLog& source_net_log,
const RequestInfo& info,
RequestPriority priority,
const CompletionCallback& callback,
AddressList* addresses)
: source_net_log_(source_net_log),
info_(info),
priority_(priority),
job_(nullptr),
callback_(callback),
addresses_(addresses),
request_time_(base::TimeTicks::Now()) {}
// Mark the request as canceled.
void MarkAsCanceled() {
job_ = nullptr;
addresses_ = nullptr;
callback_.Reset();
}
bool was_canceled() const {
return callback_.is_null();
}
void set_job(Job* job) {
DCHECK(job);
// Identify which job the request is waiting on.
job_ = job;
}
// Prepare final AddressList and call completion callback.
void OnComplete(int error, const AddressList& addr_list) {
DCHECK(!was_canceled());
if (error == OK)
*addresses_ = EnsurePortOnAddressList(addr_list, info_.port());
CompletionCallback callback = callback_;
MarkAsCanceled();
callback.Run(error);
}
Job* job() const {
return job_;
}
// NetLog for the source, passed in HostResolver::Resolve.
const BoundNetLog& source_net_log() {
return source_net_log_;
}
const RequestInfo& info() const {
return info_;
}
RequestPriority priority() const { return priority_; }
void set_priority(RequestPriority priority) { priority_ = priority; }
base::TimeTicks request_time() const { return request_time_; }
private:
const BoundNetLog source_net_log_;
// The request info that started the request.
const RequestInfo info_;
RequestPriority priority_;
// The resolve job that this request is dependent on.
Job* job_;
// The user's callback to invoke when the request completes.
CompletionCallback callback_;
// The address list to save result into.
AddressList* addresses_;
const base::TimeTicks request_time_;
DISALLOW_COPY_AND_ASSIGN(Request);
};
//------------------------------------------------------------------------------
// Calls HostResolverProc using a worker task runner. Performs retries if
// necessary.
//
// Whenever we try to resolve the host, we post a delayed task to check if host
// resolution (OnLookupComplete) is completed or not. If the original attempt
// hasn't completed, then we start another attempt for host resolution. We take
// the results from the first attempt that finishes and ignore the results from
// all other attempts.
//
// TODO(szym): Move to separate source file for testing and mocking.
//
class HostResolverImpl::ProcTask
: public base::RefCountedThreadSafe<HostResolverImpl::ProcTask> {
public:
typedef base::Callback<void(int net_error,
const AddressList& addr_list)> Callback;
ProcTask(const Key& key,
const ProcTaskParams& params,
const Callback& callback,
scoped_refptr<base::TaskRunner> worker_task_runner,
const BoundNetLog& job_net_log)
: key_(key),
params_(params),
callback_(callback),
worker_task_runner_(std::move(worker_task_runner)),
network_task_runner_(base::ThreadTaskRunnerHandle::Get()),
attempt_number_(0),
completed_attempt_number_(0),
completed_attempt_error_(ERR_UNEXPECTED),
had_non_speculative_request_(false),
net_log_(job_net_log) {
if (!params_.resolver_proc.get())
params_.resolver_proc = HostResolverProc::GetDefault();
// If default is unset, use the system proc.
if (!params_.resolver_proc.get())
params_.resolver_proc = new SystemHostResolverProc();
}
void Start() {
DCHECK(network_task_runner_->BelongsToCurrentThread());
net_log_.BeginEvent(NetLog::TYPE_HOST_RESOLVER_IMPL_PROC_TASK);
StartLookupAttempt();
}
// Cancels this ProcTask. It will be orphaned. Any outstanding resolve
// attempts running on worker thread will continue running. Only once all the
// attempts complete will the final reference to this ProcTask be released.
void Cancel() {
DCHECK(network_task_runner_->BelongsToCurrentThread());
if (was_canceled() || was_completed())
return;
callback_.Reset();
net_log_.EndEvent(NetLog::TYPE_HOST_RESOLVER_IMPL_PROC_TASK);
}
void set_had_non_speculative_request() {
DCHECK(network_task_runner_->BelongsToCurrentThread());
had_non_speculative_request_ = true;
}
bool was_canceled() const {
DCHECK(network_task_runner_->BelongsToCurrentThread());
return callback_.is_null();
}
bool was_completed() const {
DCHECK(network_task_runner_->BelongsToCurrentThread());
return completed_attempt_number_ > 0;
}
private:
friend class base::RefCountedThreadSafe<ProcTask>;
~ProcTask() {}
void StartLookupAttempt() {
DCHECK(network_task_runner_->BelongsToCurrentThread());
base::TimeTicks start_time = base::TimeTicks::Now();
++attempt_number_;
// Dispatch the lookup attempt to a worker thread.
if (!worker_task_runner_->PostTask(
FROM_HERE, base::Bind(&ProcTask::DoLookup, this, start_time,
attempt_number_))) {
NOTREACHED();
// Since this method may have been called from Resolve(), can't just call
// OnLookupComplete(). Instead, must wait until Resolve() has returned
// (IO_PENDING).
network_task_runner_->PostTask(
FROM_HERE,
base::Bind(&ProcTask::OnLookupComplete, this, AddressList(),
start_time, attempt_number_, ERR_UNEXPECTED, 0));
return;
}
net_log_.AddEvent(NetLog::TYPE_HOST_RESOLVER_IMPL_ATTEMPT_STARTED,
NetLog::IntCallback("attempt_number", attempt_number_));
// If the results aren't received within a given time, RetryIfNotComplete
// will start a new attempt if none of the outstanding attempts have
// completed yet.
if (attempt_number_ <= params_.max_retry_attempts) {
network_task_runner_->PostDelayedTask(
FROM_HERE, base::Bind(&ProcTask::RetryIfNotComplete, this),
params_.unresponsive_delay);
}
}
// WARNING: In production, this code runs on a worker pool. The shutdown code
// cannot wait for it to finish, so this code must be very careful about using
// other objects (like MessageLoops, Singletons, etc). During shutdown these
// objects may no longer exist. Multiple DoLookups() could be running in
// parallel, so any state inside of |this| must not mutate .
void DoLookup(const base::TimeTicks& start_time,
const uint32_t attempt_number) {
AddressList results;
int os_error = 0;
// Running on a worker task runner.
int error = params_.resolver_proc->Resolve(key_.hostname,
key_.address_family,
key_.host_resolver_flags,
&results,
&os_error);
// Fail the resolution if the result contains 127.0.53.53. See the comment
// block of kIcanNameCollisionIp for details on why.
for (const auto& it : results) {
const IPAddress& cur = it.address();
if (cur.IsIPv4() && IPAddressStartsWith(cur, kIcanNameCollisionIp)) {
error = ERR_ICANN_NAME_COLLISION;
break;
}
}
network_task_runner_->PostTask(
FROM_HERE, base::Bind(&ProcTask::OnLookupComplete, this, results,
start_time, attempt_number, error, os_error));
}
// Makes next attempt if DoLookup() has not finished.
void RetryIfNotComplete() {
DCHECK(network_task_runner_->BelongsToCurrentThread());
if (was_completed() || was_canceled())
return;
params_.unresponsive_delay *= params_.retry_factor;
StartLookupAttempt();
}
// Callback for when DoLookup() completes (runs on task runner thread).
void OnLookupComplete(const AddressList& results,
const base::TimeTicks& start_time,
const uint32_t attempt_number,
int error,
const int os_error) {
TRACE_EVENT0("net", "ProcTask::OnLookupComplete");
DCHECK(network_task_runner_->BelongsToCurrentThread());
// If results are empty, we should return an error.
bool empty_list_on_ok = (error == OK && results.empty());
UMA_HISTOGRAM_BOOLEAN("DNS.EmptyAddressListAndNoError", empty_list_on_ok);
if (empty_list_on_ok)
error = ERR_NAME_NOT_RESOLVED;
bool was_retry_attempt = attempt_number > 1;
// Ideally the following code would be part of host_resolver_proc.cc,
// however it isn't safe to call NetworkChangeNotifier from worker threads.
// So do it here on the IO thread instead.
if (error != OK && NetworkChangeNotifier::IsOffline())
error = ERR_INTERNET_DISCONNECTED;
// If this is the first attempt that is finishing later, then record data
// for the first attempt. Won't contaminate with retry attempt's data.
if (!was_retry_attempt)
RecordPerformanceHistograms(start_time, error, os_error);
RecordAttemptHistograms(start_time, attempt_number, error, os_error);
if (was_canceled())
return;
NetLog::ParametersCallback net_log_callback;
if (error != OK) {
net_log_callback = base::Bind(&NetLogProcTaskFailedCallback,
attempt_number,
error,
os_error);
} else {
net_log_callback = NetLog::IntCallback("attempt_number", attempt_number);
}
net_log_.AddEvent(NetLog::TYPE_HOST_RESOLVER_IMPL_ATTEMPT_FINISHED,
net_log_callback);
if (was_completed())
return;
// Copy the results from the first worker thread that resolves the host.
results_ = results;
completed_attempt_number_ = attempt_number;
completed_attempt_error_ = error;
if (was_retry_attempt) {
// If retry attempt finishes before 1st attempt, then get stats on how
// much time is saved by having spawned an extra attempt.
retry_attempt_finished_time_ = base::TimeTicks::Now();
}
if (error != OK) {
net_log_callback = base::Bind(&NetLogProcTaskFailedCallback,
0, error, os_error);
} else {
net_log_callback = results_.CreateNetLogCallback();
}
net_log_.EndEvent(NetLog::TYPE_HOST_RESOLVER_IMPL_PROC_TASK,
net_log_callback);
callback_.Run(error, results_);
}
void RecordPerformanceHistograms(const base::TimeTicks& start_time,
const int error,
const int os_error) const {
DCHECK(network_task_runner_->BelongsToCurrentThread());
enum Category { // Used in UMA_HISTOGRAM_ENUMERATION.
RESOLVE_SUCCESS,
RESOLVE_FAIL,
RESOLVE_SPECULATIVE_SUCCESS,
RESOLVE_SPECULATIVE_FAIL,
RESOLVE_MAX, // Bounding value.
};
int category = RESOLVE_MAX; // Illegal value for later DCHECK only.
base::TimeDelta duration = base::TimeTicks::Now() - start_time;
if (error == OK) {
if (had_non_speculative_request_) {
category = RESOLVE_SUCCESS;
DNS_HISTOGRAM("DNS.ResolveSuccess", duration);
} else {
category = RESOLVE_SPECULATIVE_SUCCESS;
DNS_HISTOGRAM("DNS.ResolveSpeculativeSuccess", duration);
}
// Log DNS lookups based on |address_family|. This will help us determine
// if IPv4 or IPv4/6 lookups are faster or slower.
switch(key_.address_family) {
case ADDRESS_FAMILY_IPV4:
DNS_HISTOGRAM("DNS.ResolveSuccess_FAMILY_IPV4", duration);
break;
case ADDRESS_FAMILY_IPV6:
DNS_HISTOGRAM("DNS.ResolveSuccess_FAMILY_IPV6", duration);
break;
case ADDRESS_FAMILY_UNSPECIFIED:
DNS_HISTOGRAM("DNS.ResolveSuccess_FAMILY_UNSPEC", duration);
break;
}
} else {
if (had_non_speculative_request_) {
category = RESOLVE_FAIL;
DNS_HISTOGRAM("DNS.ResolveFail", duration);
} else {
category = RESOLVE_SPECULATIVE_FAIL;
DNS_HISTOGRAM("DNS.ResolveSpeculativeFail", duration);
}
// Log DNS lookups based on |address_family|. This will help us determine
// if IPv4 or IPv4/6 lookups are faster or slower.
switch(key_.address_family) {
case ADDRESS_FAMILY_IPV4:
DNS_HISTOGRAM("DNS.ResolveFail_FAMILY_IPV4", duration);
break;
case ADDRESS_FAMILY_IPV6:
DNS_HISTOGRAM("DNS.ResolveFail_FAMILY_IPV6", duration);
break;
case ADDRESS_FAMILY_UNSPECIFIED:
DNS_HISTOGRAM("DNS.ResolveFail_FAMILY_UNSPEC", duration);
break;
}
UMA_HISTOGRAM_CUSTOM_ENUMERATION(kOSErrorsForGetAddrinfoHistogramName,
std::abs(os_error),
GetAllGetAddrinfoOSErrors());
}
DCHECK_LT(category, static_cast<int>(RESOLVE_MAX)); // Be sure it was set.
UMA_HISTOGRAM_ENUMERATION("DNS.ResolveCategory", category, RESOLVE_MAX);
}
void RecordAttemptHistograms(const base::TimeTicks& start_time,
const uint32_t attempt_number,
const int error,
const int os_error) const {
DCHECK(network_task_runner_->BelongsToCurrentThread());
bool first_attempt_to_complete =
completed_attempt_number_ == attempt_number;
bool is_first_attempt = (attempt_number == 1);
if (first_attempt_to_complete) {
// If this was first attempt to complete, then record the resolution
// status of the attempt.
if (completed_attempt_error_ == OK) {
UMA_HISTOGRAM_ENUMERATION(
"DNS.AttemptFirstSuccess", attempt_number, 100);
} else {
UMA_HISTOGRAM_ENUMERATION(
"DNS.AttemptFirstFailure", attempt_number, 100);
}
}
if (error == OK)
UMA_HISTOGRAM_ENUMERATION("DNS.AttemptSuccess", attempt_number, 100);
else
UMA_HISTOGRAM_ENUMERATION("DNS.AttemptFailure", attempt_number, 100);
// If first attempt didn't finish before retry attempt, then calculate stats
// on how much time is saved by having spawned an extra attempt.
if (!first_attempt_to_complete && is_first_attempt && !was_canceled()) {
DNS_HISTOGRAM("DNS.AttemptTimeSavedByRetry",
base::TimeTicks::Now() - retry_attempt_finished_time_);
}
if (was_canceled() || !first_attempt_to_complete) {
// Count those attempts which completed after the job was already canceled
// OR after the job was already completed by an earlier attempt (so in
// effect).
UMA_HISTOGRAM_ENUMERATION("DNS.AttemptDiscarded", attempt_number, 100);
// Record if job is canceled.
if (was_canceled())
UMA_HISTOGRAM_ENUMERATION("DNS.AttemptCancelled", attempt_number, 100);
}
base::TimeDelta duration = base::TimeTicks::Now() - start_time;
if (error == OK)
DNS_HISTOGRAM("DNS.AttemptSuccessDuration", duration);
else
DNS_HISTOGRAM("DNS.AttemptFailDuration", duration);
}
// Set on the task runner thread, read on the worker thread.
Key key_;
// Holds an owning reference to the HostResolverProc that we are going to use.
// This may not be the current resolver procedure by the time we call
// ResolveAddrInfo, but that's OK... we'll use it anyways, and the owning
// reference ensures that it remains valid until we are done.
ProcTaskParams params_;
// The listener to the results of this ProcTask.
Callback callback_;
// Task runner for the call to the HostResolverProc.
scoped_refptr<base::TaskRunner> worker_task_runner_;
// Used to post events onto the network thread.
scoped_refptr<base::SingleThreadTaskRunner> network_task_runner_;
// Keeps track of the number of attempts we have made so far to resolve the
// host. Whenever we start an attempt to resolve the host, we increase this
// number.
uint32_t attempt_number_;
// The index of the attempt which finished first (or 0 if the job is still in
// progress).
uint32_t completed_attempt_number_;
// The result (a net error code) from the first attempt to complete.
int completed_attempt_error_;
// The time when retry attempt was finished.
base::TimeTicks retry_attempt_finished_time_;
// True if a non-speculative request was ever attached to this job
// (regardless of whether or not it was later canceled.
// This boolean is used for histogramming the duration of jobs used to
// service non-speculative requests.
bool had_non_speculative_request_;
AddressList results_;
BoundNetLog net_log_;
DISALLOW_COPY_AND_ASSIGN(ProcTask);
};
//-----------------------------------------------------------------------------
// Wraps a call to HaveOnlyLoopbackAddresses to be executed on a
// |worker_task_runner|, as it takes 40-100ms and should not block
// initialization.
class HostResolverImpl::LoopbackProbeJob {
public:
LoopbackProbeJob(const base::WeakPtr<HostResolverImpl>& resolver,
base::TaskRunner* worker_task_runner)
: resolver_(resolver), result_(false) {
DCHECK(resolver.get());
// |worker_task_runner| may posts tasks to the WorkerPool, so need this to
// avoid reporting worker pool leaks in tests. The WorkerPool doesn't have a
// flushing API, so can't do anything about them, other than using another
// task runner.
// http://crbug.com/248513
ANNOTATE_SCOPED_MEMORY_LEAK;
worker_task_runner->PostTaskAndReply(
FROM_HERE,
base::Bind(&LoopbackProbeJob::DoProbe, base::Unretained(this)),
base::Bind(&LoopbackProbeJob::OnProbeComplete, base::Owned(this)));
}
virtual ~LoopbackProbeJob() {}
private:
// Runs on worker thread.
void DoProbe() {
result_ = HaveOnlyLoopbackAddresses();
}
void OnProbeComplete() {
if (!resolver_.get())
return;
resolver_->SetHaveOnlyLoopbackAddresses(result_);
}
// Used/set only on task runner thread.
base::WeakPtr<HostResolverImpl> resolver_;
bool result_;
DISALLOW_COPY_AND_ASSIGN(LoopbackProbeJob);
};
//-----------------------------------------------------------------------------
// Resolves the hostname using DnsTransaction.
// TODO(szym): This could be moved to separate source file as well.
class HostResolverImpl::DnsTask : public base::SupportsWeakPtr<DnsTask> {
public:
class Delegate {
public:
virtual void OnDnsTaskComplete(base::TimeTicks start_time,
int net_error,
const AddressList& addr_list,
base::TimeDelta ttl) = 0;
// Called when the first of two jobs succeeds. If the first completed
// transaction fails, this is not called. Also not called when the DnsTask
// only needs to run one transaction.
virtual void OnFirstDnsTransactionComplete() = 0;
protected:
Delegate() {}
virtual ~Delegate() {}
};
DnsTask(DnsClient* client,
const Key& key,
Delegate* delegate,
const BoundNetLog& job_net_log)
: client_(client),
key_(key),
delegate_(delegate),
net_log_(job_net_log),
num_completed_transactions_(0),
task_start_time_(base::TimeTicks::Now()) {
DCHECK(client);
DCHECK(delegate_);
}
bool needs_two_transactions() const {
return key_.address_family == ADDRESS_FAMILY_UNSPECIFIED;
}
bool needs_another_transaction() const {
return needs_two_transactions() && !transaction_aaaa_;
}
void StartFirstTransaction() {
DCHECK_EQ(0u, num_completed_transactions_);
net_log_.BeginEvent(NetLog::TYPE_HOST_RESOLVER_IMPL_DNS_TASK);
if (key_.address_family == ADDRESS_FAMILY_IPV6) {
StartAAAA();
} else {
StartA();
}
}
void StartSecondTransaction() {
DCHECK(needs_two_transactions());
StartAAAA();
}
private:
void StartA() {
DCHECK(!transaction_a_);
DCHECK_NE(ADDRESS_FAMILY_IPV6, key_.address_family);
transaction_a_ = CreateTransaction(ADDRESS_FAMILY_IPV4);
transaction_a_->Start();
}
void StartAAAA() {
DCHECK(!transaction_aaaa_);
DCHECK_NE(ADDRESS_FAMILY_IPV4, key_.address_family);
transaction_aaaa_ = CreateTransaction(ADDRESS_FAMILY_IPV6);
transaction_aaaa_->Start();
}
std::unique_ptr<DnsTransaction> CreateTransaction(AddressFamily family) {
DCHECK_NE(ADDRESS_FAMILY_UNSPECIFIED, family);
return client_->GetTransactionFactory()->CreateTransaction(
key_.hostname,
family == ADDRESS_FAMILY_IPV6 ? dns_protocol::kTypeAAAA :
dns_protocol::kTypeA,
base::Bind(&DnsTask::OnTransactionComplete, base::Unretained(this),
base::TimeTicks::Now()),
net_log_);
}
void OnTransactionComplete(const base::TimeTicks& start_time,
DnsTransaction* transaction,
int net_error,
const DnsResponse* response) {
DCHECK(transaction);
base::TimeDelta duration = base::TimeTicks::Now() - start_time;
if (net_error != OK) {
DNS_HISTOGRAM("AsyncDNS.TransactionFailure", duration);
OnFailure(net_error, DnsResponse::DNS_PARSE_OK);
return;
}
DNS_HISTOGRAM("AsyncDNS.TransactionSuccess", duration);
switch (transaction->GetType()) {
case dns_protocol::kTypeA:
DNS_HISTOGRAM("AsyncDNS.TransactionSuccess_A", duration);
break;
case dns_protocol::kTypeAAAA:
DNS_HISTOGRAM("AsyncDNS.TransactionSuccess_AAAA", duration);
break;
}
AddressList addr_list;
base::TimeDelta ttl;
DnsResponse::Result result = response->ParseToAddressList(&addr_list, &ttl);
UMA_HISTOGRAM_ENUMERATION("AsyncDNS.ParseToAddressList",
result,
DnsResponse::DNS_PARSE_RESULT_MAX);
if (result != DnsResponse::DNS_PARSE_OK) {
// Fail even if the other query succeeds.
OnFailure(ERR_DNS_MALFORMED_RESPONSE, result);
return;
}
++num_completed_transactions_;
if (num_completed_transactions_ == 1) {
ttl_ = ttl;
} else {
ttl_ = std::min(ttl_, ttl);
}
if (transaction->GetType() == dns_protocol::kTypeA) {
DCHECK_EQ(transaction_a_.get(), transaction);
// Place IPv4 addresses after IPv6.
addr_list_.insert(addr_list_.end(), addr_list.begin(), addr_list.end());
} else {
DCHECK_EQ(transaction_aaaa_.get(), transaction);
// Place IPv6 addresses before IPv4.
addr_list_.insert(addr_list_.begin(), addr_list.begin(), addr_list.end());
}
if (needs_two_transactions() && num_completed_transactions_ == 1) {
// No need to repeat the suffix search.
key_.hostname = transaction->GetHostname();
delegate_->OnFirstDnsTransactionComplete();
return;
}
if (addr_list_.empty()) {
// TODO(szym): Don't fallback to ProcTask in this case.
OnFailure(ERR_NAME_NOT_RESOLVED, DnsResponse::DNS_PARSE_OK);
return;
}
// If there are multiple addresses, and at least one is IPv6, need to sort
// them. Note that IPv6 addresses are always put before IPv4 ones, so it's
// sufficient to just check the family of the first address.
if (addr_list_.size() > 1 &&
addr_list_[0].GetFamily() == ADDRESS_FAMILY_IPV6) {
// Sort addresses if needed. Sort could complete synchronously.
client_->GetAddressSorter()->Sort(
addr_list_,
base::Bind(&DnsTask::OnSortComplete,
AsWeakPtr(),
base::TimeTicks::Now()));
} else {
OnSuccess(addr_list_);
}
}
void OnSortComplete(base::TimeTicks start_time,
bool success,
const AddressList& addr_list) {
if (!success) {
DNS_HISTOGRAM("AsyncDNS.SortFailure",
base::TimeTicks::Now() - start_time);
OnFailure(ERR_DNS_SORT_ERROR, DnsResponse::DNS_PARSE_OK);
return;
}
DNS_HISTOGRAM("AsyncDNS.SortSuccess",
base::TimeTicks::Now() - start_time);
// AddressSorter prunes unusable destinations.
if (addr_list.empty()) {
LOG(WARNING) << "Address list empty after RFC3484 sort";
OnFailure(ERR_NAME_NOT_RESOLVED, DnsResponse::DNS_PARSE_OK);
return;
}
OnSuccess(addr_list);
}
void OnFailure(int net_error, DnsResponse::Result result) {
DCHECK_NE(OK, net_error);
net_log_.EndEvent(
NetLog::TYPE_HOST_RESOLVER_IMPL_DNS_TASK,
base::Bind(&NetLogDnsTaskFailedCallback, net_error, result));
delegate_->OnDnsTaskComplete(task_start_time_, net_error, AddressList(),
base::TimeDelta());
}
void OnSuccess(const AddressList& addr_list) {
net_log_.EndEvent(NetLog::TYPE_HOST_RESOLVER_IMPL_DNS_TASK,
addr_list.CreateNetLogCallback());
delegate_->OnDnsTaskComplete(task_start_time_, OK, addr_list, ttl_);
}
DnsClient* client_;
Key key_;
// The listener to the results of this DnsTask.
Delegate* delegate_;
const BoundNetLog net_log_;
std::unique_ptr<DnsTransaction> transaction_a_;
std::unique_ptr<DnsTransaction> transaction_aaaa_;
unsigned num_completed_transactions_;
// These are updated as each transaction completes.
base::TimeDelta ttl_;
// IPv6 addresses must appear first in the list.
AddressList addr_list_;
base::TimeTicks task_start_time_;
DISALLOW_COPY_AND_ASSIGN(DnsTask);
};
//-----------------------------------------------------------------------------
// Aggregates all Requests for the same Key. Dispatched via PriorityDispatch.
class HostResolverImpl::Job : public PrioritizedDispatcher::Job,
public HostResolverImpl::DnsTask::Delegate {
public:
// Creates new job for |key| where |request_net_log| is bound to the
// request that spawned it.
Job(const base::WeakPtr<HostResolverImpl>& resolver,
const Key& key,
RequestPriority priority,
scoped_refptr<base::TaskRunner> worker_task_runner,
const BoundNetLog& source_net_log)
: resolver_(resolver),
key_(key),
priority_tracker_(priority),
worker_task_runner_(std::move(worker_task_runner)),
had_non_speculative_request_(false),
had_dns_config_(false),
num_occupied_job_slots_(0),
dns_task_error_(OK),
creation_time_(base::TimeTicks::Now()),
priority_change_time_(creation_time_),
net_log_(BoundNetLog::Make(source_net_log.net_log(),
NetLog::SOURCE_HOST_RESOLVER_IMPL_JOB)) {
source_net_log.AddEvent(NetLog::TYPE_HOST_RESOLVER_IMPL_CREATE_JOB);
net_log_.BeginEvent(
NetLog::TYPE_HOST_RESOLVER_IMPL_JOB,
base::Bind(&NetLogJobCreationCallback,
source_net_log.source(),
&key_.hostname));
}
~Job() override {
if (is_running()) {
// |resolver_| was destroyed with this Job still in flight.
// Clean-up, record in the log, but don't run any callbacks.
if (is_proc_running()) {
proc_task_->Cancel();
proc_task_ = nullptr;
}
// Clean up now for nice NetLog.
KillDnsTask();
net_log_.EndEventWithNetErrorCode(NetLog::TYPE_HOST_RESOLVER_IMPL_JOB,
ERR_ABORTED);
} else if (is_queued()) {
// |resolver_| was destroyed without running this Job.
// TODO(szym): is there any benefit in having this distinction?
net_log_.AddEvent(NetLog::TYPE_CANCELLED);
net_log_.EndEvent(NetLog::TYPE_HOST_RESOLVER_IMPL_JOB);
}
// else CompleteRequests logged EndEvent.
// Log any remaining Requests as cancelled.
for (const std::unique_ptr<Request>& req : requests_) {
if (req->was_canceled())
continue;
DCHECK_EQ(this, req->job());
LogCancelRequest(req->source_net_log(), req->info());
}
}
// Add this job to the dispatcher. If "at_head" is true, adds at the front
// of the queue.
void Schedule(bool at_head) {
DCHECK(!is_queued());
PrioritizedDispatcher::Handle handle;
if (!at_head) {
handle = resolver_->dispatcher_->Add(this, priority());
} else {
handle = resolver_->dispatcher_->AddAtHead(this, priority());
}
// The dispatcher could have started |this| in the above call to Add, which
// could have called Schedule again. In that case |handle| will be null,
// but |handle_| may have been set by the other nested call to Schedule.
if (!handle.is_null()) {
DCHECK(handle_.is_null());
handle_ = handle;
}
}
void AddRequest(std::unique_ptr<Request> req) {
DCHECK_EQ(key_.hostname, req->info().hostname());
req->set_job(this);
priority_tracker_.Add(req->priority());
req->source_net_log().AddEvent(
NetLog::TYPE_HOST_RESOLVER_IMPL_JOB_ATTACH,
net_log_.source().ToEventParametersCallback());
net_log_.AddEvent(
NetLog::TYPE_HOST_RESOLVER_IMPL_JOB_REQUEST_ATTACH,
base::Bind(&NetLogJobAttachCallback,
req->source_net_log().source(),
priority()));
// TODO(szym): Check if this is still needed.
if (!req->info().is_speculative()) {
had_non_speculative_request_ = true;
if (proc_task_.get())
proc_task_->set_had_non_speculative_request();
}
requests_.push_back(std::move(req));
UpdatePriority();
}
void ChangeRequestPriority(Request* req, RequestPriority priority) {
DCHECK_EQ(key_.hostname, req->info().hostname());
DCHECK(!req->was_canceled());
priority_tracker_.Remove(req->priority());
req->set_priority(priority);
priority_tracker_.Add(req->priority());
UpdatePriority();
}
// Marks |req| as cancelled. If it was the last active Request, also finishes
// this Job, marking it as cancelled, and deletes it.
void CancelRequest(Request* req) {
DCHECK_EQ(key_.hostname, req->info().hostname());
DCHECK(!req->was_canceled());
// Don't remove it from |requests_| just mark it canceled.
req->MarkAsCanceled();
LogCancelRequest(req->source_net_log(), req->info());
priority_tracker_.Remove(req->priority());
net_log_.AddEvent(NetLog::TYPE_HOST_RESOLVER_IMPL_JOB_REQUEST_DETACH,
base::Bind(&NetLogJobAttachCallback,
req->source_net_log().source(),
priority()));
if (num_active_requests() > 0) {
UpdatePriority();
} else {
// If we were called from a Request's callback within CompleteRequests,
// that Request could not have been cancelled, so num_active_requests()
// could not be 0. Therefore, we are not in CompleteRequests().
CompleteRequestsWithError(OK /* cancelled */);
}
}
// Called from AbortAllInProgressJobs. Completes all requests and destroys
// the job. This currently assumes the abort is due to a network change.
// TODO This should not delete |this|.
void Abort() {
DCHECK(is_running());
CompleteRequestsWithError(ERR_NETWORK_CHANGED);
}
// If DnsTask present, abort it and fall back to ProcTask.
void AbortDnsTask() {
if (dns_task_) {
KillDnsTask();
dns_task_error_ = OK;
StartProcTask();
}
}
// Called by HostResolverImpl when this job is evicted due to queue overflow.
// Completes all requests and destroys the job.
void OnEvicted() {
DCHECK(!is_running());
DCHECK(is_queued());
handle_.Reset();
net_log_.AddEvent(NetLog::TYPE_HOST_RESOLVER_IMPL_JOB_EVICTED);
// This signals to CompleteRequests that this job never ran.
CompleteRequestsWithError(ERR_HOST_RESOLVER_QUEUE_TOO_LARGE);
}
// Attempts to serve the job from HOSTS. Returns true if succeeded and
// this Job was destroyed.
bool ServeFromHosts() {
DCHECK_GT(num_active_requests(), 0u);
AddressList addr_list;
if (resolver_->ServeFromHosts(key(),
requests_.front()->info(),
&addr_list)) {
// This will destroy the Job.
CompleteRequests(
HostCache::Entry(OK, MakeAddressListForRequest(addr_list)),
base::TimeDelta());
return true;
}
return false;
}
const Key& key() const { return key_; }
bool is_queued() const {
return !handle_.is_null();
}
bool is_running() const {
return is_dns_running() || is_proc_running();
}
private:
void KillDnsTask() {
if (dns_task_) {
ReduceToOneJobSlot();
dns_task_.reset();
}
}
// Reduce the number of job slots occupied and queued in the dispatcher
// to one. If the second Job slot is queued in the dispatcher, cancels the
// queued job. Otherwise, the second Job has been started by the
// PrioritizedDispatcher, so signals it is complete.
void ReduceToOneJobSlot() {
DCHECK_GE(num_occupied_job_slots_, 1u);
if (is_queued()) {
resolver_->dispatcher_->Cancel(handle_);
handle_.Reset();
} else if (num_occupied_job_slots_ > 1) {
resolver_->dispatcher_->OnJobFinished();
--num_occupied_job_slots_;
}
DCHECK_EQ(1u, num_occupied_job_slots_);
}
AddressList MakeAddressListForRequest(const AddressList& list) const {
if (requests_.empty())
return list;
return AddressList::CopyWithPort(list, requests_.front()->info().port());
}
void UpdatePriority() {
if (is_queued()) {
if (priority() != static_cast<RequestPriority>(handle_.priority()))
priority_change_time_ = base::TimeTicks::Now();
handle_ = resolver_->dispatcher_->ChangePriority(handle_, priority());
}
}
// PriorityDispatch::Job:
void Start() override {
DCHECK_LE(num_occupied_job_slots_, 1u);
handle_.Reset();
++num_occupied_job_slots_;
if (num_occupied_job_slots_ == 2) {
StartSecondDnsTransaction();
return;
}
DCHECK(!is_running());
net_log_.AddEvent(NetLog::TYPE_HOST_RESOLVER_IMPL_JOB_STARTED);
had_dns_config_ = resolver_->HaveDnsConfig();
base::TimeTicks now = base::TimeTicks::Now();
base::TimeDelta queue_time = now - creation_time_;
base::TimeDelta queue_time_after_change = now - priority_change_time_;
if (had_dns_config_) {
DNS_HISTOGRAM_BY_PRIORITY("AsyncDNS.JobQueueTime", priority(),
queue_time);
DNS_HISTOGRAM_BY_PRIORITY("AsyncDNS.JobQueueTimeAfterChange", priority(),
queue_time_after_change);
} else {
DNS_HISTOGRAM_BY_PRIORITY("DNS.JobQueueTime", priority(), queue_time);
DNS_HISTOGRAM_BY_PRIORITY("DNS.JobQueueTimeAfterChange", priority(),
queue_time_after_change);
}
bool system_only =
(key_.host_resolver_flags & HOST_RESOLVER_SYSTEM_ONLY) != 0;
// Caution: Job::Start must not complete synchronously.
if (!system_only && had_dns_config_ &&
!ResemblesMulticastDNSName(key_.hostname)) {
StartDnsTask();
} else {
StartProcTask();
}
}
// TODO(szym): Since DnsTransaction does not consume threads, we can increase
// the limits on |dispatcher_|. But in order to keep the number of WorkerPool
// threads low, we will need to use an "inner" PrioritizedDispatcher with
// tighter limits.
void StartProcTask() {
DCHECK(!is_dns_running());
proc_task_ =
new ProcTask(key_, resolver_->proc_params_,
base::Bind(&Job::OnProcTaskComplete,
base::Unretained(this), base::TimeTicks::Now()),
worker_task_runner_, net_log_);
if (had_non_speculative_request_)
proc_task_->set_had_non_speculative_request();
// Start() could be called from within Resolve(), hence it must NOT directly
// call OnProcTaskComplete, for example, on synchronous failure.
proc_task_->Start();
}
// Called by ProcTask when it completes.
void OnProcTaskComplete(base::TimeTicks start_time,
int net_error,
const AddressList& addr_list) {
DCHECK(is_proc_running());
if (!resolver_->resolved_known_ipv6_hostname_ &&
net_error == OK &&
key_.address_family == ADDRESS_FAMILY_UNSPECIFIED) {
if (key_.hostname == "www.google.com") {
resolver_->resolved_known_ipv6_hostname_ = true;
bool got_ipv6_address = false;
for (size_t i = 0; i < addr_list.size(); ++i) {
if (addr_list[i].GetFamily() == ADDRESS_FAMILY_IPV6) {
got_ipv6_address = true;
break;
}
}
UMA_HISTOGRAM_BOOLEAN("Net.UnspecResolvedIPv6", got_ipv6_address);
}
}
if (dns_task_error_ != OK) {
base::TimeDelta duration = base::TimeTicks::Now() - start_time;
if (net_error == OK) {
DNS_HISTOGRAM("AsyncDNS.FallbackSuccess", duration);
if ((dns_task_error_ == ERR_NAME_NOT_RESOLVED) &&
ResemblesNetBIOSName(key_.hostname)) {
UmaAsyncDnsResolveStatus(RESOLVE_STATUS_SUSPECT_NETBIOS);
} else {
UmaAsyncDnsResolveStatus(RESOLVE_STATUS_PROC_SUCCESS);
}
UMA_HISTOGRAM_SPARSE_SLOWLY("AsyncDNS.ResolveError",
std::abs(dns_task_error_));
resolver_->OnDnsTaskResolve(dns_task_error_);
} else {
DNS_HISTOGRAM("AsyncDNS.FallbackFail", duration);
UmaAsyncDnsResolveStatus(RESOLVE_STATUS_FAIL);
}
}
base::TimeDelta ttl =
base::TimeDelta::FromSeconds(kNegativeCacheEntryTTLSeconds);
if (net_error == OK)
ttl = base::TimeDelta::FromSeconds(kCacheEntryTTLSeconds);
// Don't store the |ttl| in cache since it's not obtained from the server.
CompleteRequests(
HostCache::Entry(net_error, MakeAddressListForRequest(addr_list)),
ttl);
}
void StartDnsTask() {
DCHECK(resolver_->HaveDnsConfig());
dns_task_.reset(new DnsTask(resolver_->dns_client_.get(), key_, this,
net_log_));
dns_task_->StartFirstTransaction();
// Schedule a second transaction, if needed.
if (dns_task_->needs_two_transactions())
Schedule(true);
}
void StartSecondDnsTransaction() {
DCHECK(dns_task_->needs_two_transactions());
dns_task_->StartSecondTransaction();
}
// Called if DnsTask fails. It is posted from StartDnsTask, so Job may be
// deleted before this callback. In this case dns_task is deleted as well,
// so we use it as indicator whether Job is still valid.
void OnDnsTaskFailure(const base::WeakPtr<DnsTask>& dns_task,
base::TimeDelta duration,
int net_error) {
DNS_HISTOGRAM("AsyncDNS.ResolveFail", duration);
if (!dns_task)
return;
dns_task_error_ = net_error;
// TODO(szym): Run ServeFromHosts now if nsswitch.conf says so.
// http://crbug.com/117655
// TODO(szym): Some net errors indicate lack of connectivity. Starting
// ProcTask in that case is a waste of time.
if (resolver_->fallback_to_proctask_) {
KillDnsTask();
StartProcTask();
} else {
UmaAsyncDnsResolveStatus(RESOLVE_STATUS_FAIL);
CompleteRequestsWithError(net_error);
}
}
// HostResolverImpl::DnsTask::Delegate implementation:
void OnDnsTaskComplete(base::TimeTicks start_time,
int net_error,
const AddressList& addr_list,
base::TimeDelta ttl) override {
DCHECK(is_dns_running());
base::TimeDelta duration = base::TimeTicks::Now() - start_time;
if (net_error != OK) {
OnDnsTaskFailure(dns_task_->AsWeakPtr(), duration, net_error);
return;
}
DNS_HISTOGRAM("AsyncDNS.ResolveSuccess", duration);
// Log DNS lookups based on |address_family|.
switch(key_.address_family) {
case ADDRESS_FAMILY_IPV4:
DNS_HISTOGRAM("AsyncDNS.ResolveSuccess_FAMILY_IPV4", duration);
break;
case ADDRESS_FAMILY_IPV6:
DNS_HISTOGRAM("AsyncDNS.ResolveSuccess_FAMILY_IPV6", duration);
break;
case ADDRESS_FAMILY_UNSPECIFIED:
DNS_HISTOGRAM("AsyncDNS.ResolveSuccess_FAMILY_UNSPEC", duration);
break;
}
UmaAsyncDnsResolveStatus(RESOLVE_STATUS_DNS_SUCCESS);
RecordTTL(ttl);
resolver_->OnDnsTaskResolve(OK);
base::TimeDelta bounded_ttl =
std::max(ttl, base::TimeDelta::FromSeconds(kMinimumTTLSeconds));
CompleteRequests(
HostCache::Entry(net_error, MakeAddressListForRequest(addr_list), ttl),
bounded_ttl);
}
void OnFirstDnsTransactionComplete() override {
DCHECK(dns_task_->needs_two_transactions());
DCHECK_EQ(dns_task_->needs_another_transaction(), is_queued());
// No longer need to occupy two dispatcher slots.
ReduceToOneJobSlot();
// We already have a job slot at the dispatcher, so if the second
// transaction hasn't started, reuse it now instead of waiting in the queue
// for the second slot.
if (dns_task_->needs_another_transaction())
dns_task_->StartSecondTransaction();
}
// Performs Job's last rites. Completes all Requests. Deletes this.
void CompleteRequests(const HostCache::Entry& entry,
base::TimeDelta ttl) {
CHECK(resolver_.get());
// This job must be removed from resolver's |jobs_| now to make room for a
// new job with the same key in case one of the OnComplete callbacks decides
// to spawn one. Consequently, the job deletes itself when CompleteRequests
// is done.
std::unique_ptr<Job> self_deleter(this);
resolver_->RemoveJob(this);
if (is_running()) {
if (is_proc_running()) {
DCHECK(!is_queued());
proc_task_->Cancel();
proc_task_ = nullptr;
}
KillDnsTask();
// Signal dispatcher that a slot has opened.
resolver_->dispatcher_->OnJobFinished();
} else if (is_queued()) {
resolver_->dispatcher_->Cancel(handle_);
handle_.Reset();
}
if (num_active_requests() == 0) {
net_log_.AddEvent(NetLog::TYPE_CANCELLED);
net_log_.EndEventWithNetErrorCode(NetLog::TYPE_HOST_RESOLVER_IMPL_JOB,
OK);
return;
}
net_log_.EndEventWithNetErrorCode(NetLog::TYPE_HOST_RESOLVER_IMPL_JOB,
entry.error());
DCHECK(!requests_.empty());
if (entry.error() == OK) {
// Record this histogram here, when we know the system has a valid DNS
// configuration.
UMA_HISTOGRAM_BOOLEAN("AsyncDNS.HaveDnsConfig",
resolver_->received_dns_config_);
}
bool did_complete = (entry.error() != ERR_NETWORK_CHANGED) &&
(entry.error() != ERR_HOST_RESOLVER_QUEUE_TOO_LARGE);
if (did_complete)
resolver_->CacheResult(key_, entry, ttl);
// Complete all of the requests that were attached to the job.
for (const std::unique_ptr<Request>& req : requests_) {
if (req->was_canceled())
continue;
DCHECK_EQ(this, req->job());
// Update the net log and notify registered observers.
LogFinishRequest(req->source_net_log(), req->info(), entry.error());
if (did_complete) {
// Record effective total time from creation to completion.
RecordTotalTime(had_dns_config_, req->info().is_speculative(),
base::TimeTicks::Now() - req->request_time());
}
req->OnComplete(entry.error(), entry.addresses());
// Check if the resolver was destroyed as a result of running the
// callback. If it was, we could continue, but we choose to bail.
if (!resolver_.get())
return;
}
}
// Convenience wrapper for CompleteRequests in case of failure.
void CompleteRequestsWithError(int net_error) {
CompleteRequests(HostCache::Entry(net_error, AddressList()),
base::TimeDelta());
}
RequestPriority priority() const {
return priority_tracker_.highest_priority();
}
// Number of non-canceled requests in |requests_|.
size_t num_active_requests() const {
return priority_tracker_.total_count();
}
bool is_dns_running() const { return !!dns_task_; }
bool is_proc_running() const { return !!proc_task_; }
base::WeakPtr<HostResolverImpl> resolver_;
Key key_;
// Tracks the highest priority across |requests_|.
PriorityTracker priority_tracker_;
// Task runner where the HostResolverProc is invoked.
scoped_refptr<base::TaskRunner> worker_task_runner_;
bool had_non_speculative_request_;
// Distinguishes measurements taken while DnsClient was fully configured.
bool had_dns_config_;
// Number of slots occupied by this Job in resolver's PrioritizedDispatcher.
unsigned num_occupied_job_slots_;
// Result of DnsTask.
int dns_task_error_;
const base::TimeTicks creation_time_;
base::TimeTicks priority_change_time_;
BoundNetLog net_log_;
// Resolves the host using a HostResolverProc.
scoped_refptr<ProcTask> proc_task_;
// Resolves the host using a DnsTransaction.
std::unique_ptr<DnsTask> dns_task_;
// All Requests waiting for the result of this Job. Some can be canceled.
std::vector<std::unique_ptr<Request>> requests_;
// A handle used in |HostResolverImpl::dispatcher_|.
PrioritizedDispatcher::Handle handle_;
};
//-----------------------------------------------------------------------------
HostResolverImpl::ProcTaskParams::ProcTaskParams(
HostResolverProc* resolver_proc,
size_t max_retry_attempts)
: resolver_proc(resolver_proc),
max_retry_attempts(max_retry_attempts),
unresponsive_delay(
base::TimeDelta::FromMilliseconds(kDnsDefaultUnresponsiveDelayMs)),
retry_factor(2) {
// Maximum of 4 retry attempts for host resolution.
static const size_t kDefaultMaxRetryAttempts = 4u;
if (max_retry_attempts == HostResolver::kDefaultRetryAttempts)
max_retry_attempts = kDefaultMaxRetryAttempts;
}
HostResolverImpl::ProcTaskParams::ProcTaskParams(const ProcTaskParams& other) =
default;
HostResolverImpl::ProcTaskParams::~ProcTaskParams() {}
HostResolverImpl::HostResolverImpl(const Options& options, NetLog* net_log)
: HostResolverImpl(
options,
net_log,
base::WorkerPool::GetTaskRunner(true /* task_is_slow */)) {}
HostResolverImpl::~HostResolverImpl() {
// Prevent the dispatcher from starting new jobs.
dispatcher_->SetLimitsToZero();
// It's now safe for Jobs to call KillDsnTask on destruction, because
// OnJobComplete will not start any new jobs.
STLDeleteValues(&jobs_);
NetworkChangeNotifier::RemoveIPAddressObserver(this);
NetworkChangeNotifier::RemoveConnectionTypeObserver(this);
NetworkChangeNotifier::RemoveDNSObserver(this);
}
void HostResolverImpl::SetMaxQueuedJobs(size_t value) {
DCHECK_EQ(0u, dispatcher_->num_queued_jobs());
DCHECK_GT(value, 0u);
max_queued_jobs_ = value;
}
int HostResolverImpl::Resolve(const RequestInfo& info,
RequestPriority priority,
AddressList* addresses,
const CompletionCallback& callback,
RequestHandle* out_req,
const BoundNetLog& source_net_log) {
DCHECK(addresses);
DCHECK(CalledOnValidThread());
DCHECK_EQ(false, callback.is_null());
// Check that the caller supplied a valid hostname to resolve.
std::string labeled_hostname;
if (!DNSDomainFromDot(info.hostname(), &labeled_hostname))
return ERR_NAME_NOT_RESOLVED;
LogStartRequest(source_net_log, info);
IPAddress ip_address;
IPAddress* ip_address_ptr = nullptr;
if (ip_address.AssignFromIPLiteral(info.hostname()))
ip_address_ptr = &ip_address;
// Build a key that identifies the request in the cache and in the
// outstanding jobs map.
Key key = GetEffectiveKeyForRequest(info, ip_address_ptr, source_net_log);
int rv = ResolveHelper(key, info, ip_address_ptr, addresses, false, nullptr,
source_net_log);
if (rv != ERR_DNS_CACHE_MISS) {
LogFinishRequest(source_net_log, info, rv);
RecordTotalTime(HaveDnsConfig(), info.is_speculative(), base::TimeDelta());
return rv;
}
// Next we need to attach our request to a "job". This job is responsible for
// calling "getaddrinfo(hostname)" on a worker thread.
JobMap::iterator jobit = jobs_.find(key);
Job* job;
if (jobit == jobs_.end()) {
job = new Job(weak_ptr_factory_.GetWeakPtr(), key, priority,
worker_task_runner_, source_net_log);
job->Schedule(false);
// Check for queue overflow.
if (dispatcher_->num_queued_jobs() > max_queued_jobs_) {
Job* evicted = static_cast<Job*>(dispatcher_->EvictOldestLowest());
DCHECK(evicted);
evicted->OnEvicted(); // Deletes |evicted|.
if (evicted == job) {
rv = ERR_HOST_RESOLVER_QUEUE_TOO_LARGE;
LogFinishRequest(source_net_log, info, rv);
return rv;
}
}
jobs_.insert(jobit, std::make_pair(key, job));
} else {
job = jobit->second;
}
// Can't complete synchronously. Create and attach request.
std::unique_ptr<Request> req(
new Request(source_net_log, info, priority, callback, addresses));
if (out_req)
*out_req = reinterpret_cast<RequestHandle>(req.get());
job->AddRequest(std::move(req));
// Completion happens during Job::CompleteRequests().
return ERR_IO_PENDING;
}
HostResolverImpl::HostResolverImpl(
const Options& options,
NetLog* net_log,
scoped_refptr<base::TaskRunner> worker_task_runner)
: max_queued_jobs_(0),
proc_params_(NULL, options.max_retry_attempts),
net_log_(net_log),
received_dns_config_(false),
num_dns_failures_(0),
use_local_ipv6_(false),
last_ipv6_probe_result_(true),
resolved_known_ipv6_hostname_(false),
additional_resolver_flags_(0),
fallback_to_proctask_(true),
worker_task_runner_(std::move(worker_task_runner)),
weak_ptr_factory_(this),
probe_weak_ptr_factory_(this) {
if (options.enable_caching)
cache_ = HostCache::CreateDefaultCache();
PrioritizedDispatcher::Limits job_limits = options.GetDispatcherLimits();
dispatcher_.reset(new PrioritizedDispatcher(job_limits));
max_queued_jobs_ = job_limits.total_jobs * 100u;
DCHECK_GE(dispatcher_->num_priorities(), static_cast<size_t>(NUM_PRIORITIES));
#if defined(OS_WIN)
EnsureWinsockInit();
#endif
#if defined(OS_POSIX) && !defined(OS_MACOSX) && !defined(OS_ANDROID)
RunLoopbackProbeJob();
#endif
NetworkChangeNotifier::AddIPAddressObserver(this);
NetworkChangeNotifier::AddConnectionTypeObserver(this);
NetworkChangeNotifier::AddDNSObserver(this);
#if defined(OS_POSIX) && !defined(OS_MACOSX) && !defined(OS_OPENBSD) && \\
!defined(OS_ANDROID)
EnsureDnsReloaderInit();
#endif
OnConnectionTypeChanged(NetworkChangeNotifier::GetConnectionType());
{
DnsConfig dns_config;
NetworkChangeNotifier::GetDnsConfig(&dns_config);
received_dns_config_ = dns_config.IsValid();
// Conservatively assume local IPv6 is needed when DnsConfig is not valid.
use_local_ipv6_ = !dns_config.IsValid() || dns_config.use_local_ipv6;
}
fallback_to_proctask_ = !ConfigureAsyncDnsNoFallbackFieldTrial();
}
void HostResolverImpl::SetHaveOnlyLoopbackAddresses(bool result) {
if (result) {
additional_resolver_flags_ |= HOST_RESOLVER_LOOPBACK_ONLY;
} else {
additional_resolver_flags_ &= ~HOST_RESOLVER_LOOPBACK_ONLY;
}
}
int HostResolverImpl::ResolveHelper(const Key& key,
const RequestInfo& info,
const IPAddress* ip_address,
AddressList* addresses,
bool allow_stale,
HostCache::EntryStaleness* stale_info,
const BoundNetLog& source_net_log) {
DCHECK(allow_stale == !!stale_info);
// The result of |getaddrinfo| for empty hosts is inconsistent across systems.
// On Windows it gives the default interface's address, whereas on Linux it
// gives an error. We will make it fail on all platforms for consistency.
if (info.hostname().empty() || info.hostname().size() > kMaxHostLength) {
MakeNotStale(stale_info);
return ERR_NAME_NOT_RESOLVED;
}
int net_error = ERR_UNEXPECTED;
if (ResolveAsIP(key, info, ip_address, &net_error, addresses)) {
MakeNotStale(stale_info);
return net_error;
}
if (ServeFromCache(key, info, &net_error, addresses, allow_stale,
stale_info)) {
source_net_log.AddEvent(NetLog::TYPE_HOST_RESOLVER_IMPL_CACHE_HIT);
// |ServeFromCache()| will set |*stale_info| as needed.
return net_error;
}
// TODO(szym): Do not do this if nsswitch.conf instructs not to.
// http://crbug.com/117655
if (ServeFromHosts(key, info, addresses)) {
source_net_log.AddEvent(NetLog::TYPE_HOST_RESOLVER_IMPL_HOSTS_HIT);
MakeNotStale(stale_info);
return OK;
}
if (ServeLocalhost(key, info, addresses)) {
MakeNotStale(stale_info);
return OK;
}
return ERR_DNS_CACHE_MISS;
}
int HostResolverImpl::ResolveFromCache(const RequestInfo& info,
AddressList* addresses,
const BoundNetLog& source_net_log) {
DCHECK(CalledOnValidThread());
DCHECK(addresses);
// Update the net log and notify registered observers.
LogStartRequest(source_net_log, info);
IPAddress ip_address;
IPAddress* ip_address_ptr = nullptr;
if (ip_address.AssignFromIPLiteral(info.hostname()))
ip_address_ptr = &ip_address;
Key key = GetEffectiveKeyForRequest(info, ip_address_ptr, source_net_log);
int rv = ResolveHelper(key, info, ip_address_ptr, addresses, false, nullptr,
source_net_log);
LogFinishRequest(source_net_log, info, rv);
return rv;
}
void HostResolverImpl::ChangeRequestPriority(RequestHandle req_handle,
RequestPriority priority) {
DCHECK(CalledOnValidThread());
Request* req = reinterpret_cast<Request*>(req_handle);
DCHECK(req);
Job* job = req->job();
DCHECK(job);
job->ChangeRequestPriority(req, priority);
}
void HostResolverImpl::CancelRequest(RequestHandle req_handle) {
DCHECK(CalledOnValidThread());
Request* req = reinterpret_cast<Request*>(req_handle);
DCHECK(req);
Job* job = req->job();
DCHECK(job);
job->CancelRequest(req);
}
void HostResolverImpl::SetDnsClientEnabled(bool enabled) {
DCHECK(CalledOnValidThread());
#if defined(ENABLE_BUILT_IN_DNS)
if (enabled && !dns_client_) {
SetDnsClient(DnsClient::CreateClient(net_log_));
} else if (!enabled && dns_client_) {
SetDnsClient(std::unique_ptr<DnsClient>());
}
#endif
}
HostCache* HostResolverImpl::GetHostCache() {
return cache_.get();
}
std::unique_ptr<base::Value> HostResolverImpl::GetDnsConfigAsValue() const {
// Check if async DNS is disabled.
if (!dns_client_.get())
return nullptr;
// Check if async DNS is enabled, but we currently have no configuration
// for it.
const DnsConfig* dns_config = dns_client_->GetConfig();
if (!dns_config)
return base::WrapUnique(new base::DictionaryValue());
return dns_config->ToValue();
}
int HostResolverImpl::ResolveStaleFromCache(
const RequestInfo& info,
AddressList* addresses,
HostCache::EntryStaleness* stale_info,
const BoundNetLog& source_net_log) {
DCHECK(CalledOnValidThread());
DCHECK(addresses);
DCHECK(stale_info);
// Update the net log and notify registered observers.
LogStartRequest(source_net_log, info);
IPAddress ip_address;
IPAddress* ip_address_ptr = nullptr;
if (ip_address.AssignFromIPLiteral(info.hostname()))
ip_address_ptr = &ip_address;
Key key = GetEffectiveKeyForRequest(info, ip_address_ptr, source_net_log);
int rv = ResolveHelper(key, info, ip_address_ptr, addresses, true, stale_info,
source_net_log);
LogFinishRequest(source_net_log, info, rv);
return rv;
}
bool HostResolverImpl::ResolveAsIP(const Key& key,
const RequestInfo& info,
const IPAddress* ip_address,
int* net_error,
AddressList* addresses) {
DCHECK(addresses);
DCHECK(net_error);
if (ip_address == nullptr)
return false;
*net_error = OK;
AddressFamily family = GetAddressFamily(*ip_address);
if (key.address_family != ADDRESS_FAMILY_UNSPECIFIED &&
key.address_family != family) {
// Don't return IPv6 addresses for IPv4 queries, and vice versa.
*net_error = ERR_NAME_NOT_RESOLVED;
} else {
*addresses = AddressList::CreateFromIPAddress(*ip_address, info.port());
if (key.host_resolver_flags & HOST_RESOLVER_CANONNAME)
addresses->SetDefaultCanonicalName();
}
return true;
}
bool HostResolverImpl::ServeFromCache(const Key& key,
const RequestInfo& info,
int* net_error,
AddressList* addresses,
bool allow_stale,
HostCache::EntryStaleness* stale_info) {
DCHECK(addresses);
DCHECK(net_error);
DCHECK(allow_stale == !!stale_info);
if (!info.allow_cached_response() || !cache_.get())
return false;
const HostCache::Entry* cache_entry;
if (allow_stale)
cache_entry = cache_->LookupStale(key, base::TimeTicks::Now(), stale_info);
else
cache_entry = cache_->Lookup(key, base::TimeTicks::Now());
if (!cache_entry)
return false;
*net_error = cache_entry->error();
if (*net_error == OK) {
if (cache_entry->has_ttl())
RecordTTL(cache_entry->ttl());
*addresses = EnsurePortOnAddressList(cache_entry->addresses(), info.port());
}
return true;
}
bool HostResolverImpl::ServeFromHosts(const Key& key,
const RequestInfo& info,
AddressList* addresses) {
DCHECK(addresses);
if (!HaveDnsConfig())
return false;
addresses->clear();
// HOSTS lookups are case-insensitive.
std::string hostname = base::ToLowerASCII(key.hostname);
const DnsHosts& hosts = dns_client_->GetConfig()->hosts;
// If |address_family| is ADDRESS_FAMILY_UNSPECIFIED other implementations
// (glibc and c-ares) return the first matching line. We have more
// flexibility, but lose implicit ordering.
// We prefer IPv6 because "happy eyeballs" will fall back to IPv4 if
// necessary.
if (key.address_family == ADDRESS_FAMILY_IPV6 ||
key.address_family == ADDRESS_FAMILY_UNSPECIFIED) {
DnsHosts::const_iterator it = hosts.find(
DnsHostsKey(hostname, ADDRESS_FAMILY_IPV6));
if (it != hosts.end())
addresses->push_back(IPEndPoint(it->second, info.port()));
}
if (key.address_family == ADDRESS_FAMILY_IPV4 ||
key.address_family == ADDRESS_FAMILY_UNSPECIFIED) {
DnsHosts::const_iterator it = hosts.find(
DnsHostsKey(hostname, ADDRESS_FAMILY_IPV4));
if (it != hosts.end())
addresses->push_back(IPEndPoint(it->second, info.port()));
}
// If got only loopback addresses and the family was restricted, resolve
// again, without restrictions. See SystemHostResolverCall for rationale.
if ((key.host_resolver_flags &
HOST_RESOLVER_DEFAULT_FAMILY_SET_DUE_TO_NO_IPV6) &&
IsAllIPv4Loopback(*addresses)) {
Key new_key(key);
new_key.address_family = ADDRESS_FAMILY_UNSPECIFIED;
new_key.host_resolver_flags &=
~HOST_RESOLVER_DEFAULT_FAMILY_SET_DUE_TO_NO_IPV6;
return ServeFromHosts(new_key, info, addresses);
}
return !addresses->empty();
}
bool HostResolverImpl::ServeLocalhost(const Key& key,
const RequestInfo& info,
AddressList* addresses) {
AddressList resolved_addresses;
if (!ResolveLocalHostname(key.hostname, info.port(), &resolved_addresses))
return false;
addresses->clear();
for (const auto& address : resolved_addresses) {
// Include the address if:
// - caller didn't specify an address family, or
// - caller specifically asked for the address family of this address, or
// - this is an IPv6 address and caller specifically asked for IPv4 due
// to lack of detected IPv6 support. (See SystemHostResolverCall for
// rationale).
if (key.address_family == ADDRESS_FAMILY_UNSPECIFIED ||
key.address_family == address.GetFamily() ||
(address.GetFamily() == ADDRESS_FAMILY_IPV6 &&
key.address_family == ADDRESS_FAMILY_IPV4 &&
(key.host_resolver_flags &
HOST_RESOLVER_DEFAULT_FAMILY_SET_DUE_TO_NO_IPV6))) {
addresses->push_back(address);
}
}
return true;
}
void HostResolverImpl::CacheResult(const Key& key,
const HostCache::Entry& entry,
base::TimeDelta ttl) {
if (cache_.get())
cache_->Set(key, entry, base::TimeTicks::Now(), ttl);
}
void HostResolverImpl::RemoveJob(Job* job) {
DCHECK(job);
JobMap::iterator it = jobs_.find(job->key());
if (it != jobs_.end() && it->second == job)
jobs_.erase(it);
}
HostResolverImpl::Key HostResolverImpl::GetEffectiveKeyForRequest(
const RequestInfo& info,
const IPAddress* ip_address,
const BoundNetLog& net_log) {
HostResolverFlags effective_flags =
info.host_resolver_flags() | additional_resolver_flags_;
AddressFamily effective_address_family = info.address_family();
if (info.address_family() == ADDRESS_FAMILY_UNSPECIFIED) {
if (!use_local_ipv6_ &&
// When resolving IPv4 literals, there's no need to probe for IPv6.
// When resolving IPv6 literals, there's no benefit to artificially
// limiting our resolution based on a probe. Prior logic ensures
// that this query is UNSPECIFIED (see info.address_family()
// check above) so the code requesting the resolution should be amenable
// to receiving a IPv6 resolution.
ip_address == nullptr) {
if (!IsIPv6Reachable(net_log)) {
effective_address_family = ADDRESS_FAMILY_IPV4;
effective_flags |= HOST_RESOLVER_DEFAULT_FAMILY_SET_DUE_TO_NO_IPV6;
}
}
}
return Key(info.hostname(), effective_address_family, effective_flags);
}
bool HostResolverImpl::IsIPv6Reachable(const BoundNetLog& net_log) {
base::TimeTicks now = base::TimeTicks::Now();
bool cached = true;
if ((now - last_ipv6_probe_time_).InMilliseconds() > kIPv6ProbePeriodMs) {
last_ipv6_probe_result_ =
IsGloballyReachable(IPAddress(kIPv6ProbeAddress), net_log);
last_ipv6_probe_time_ = now;
cached = false;
}
net_log.AddEvent(NetLog::TYPE_HOST_RESOLVER_IMPL_IPV6_REACHABILITY_CHECK,
base::Bind(&NetLogIPv6AvailableCallback,
last_ipv6_probe_result_, cached));
return last_ipv6_probe_result_;
}
void HostResolverImpl::RunLoopbackProbeJob() {
new LoopbackProbeJob(weak_ptr_factory_.GetWeakPtr(),
worker_task_runner_.get());
}
void HostResolverImpl::AbortAllInProgressJobs() {
// In Abort, a Request callback could spawn new Jobs with matching keys, so
// first collect and remove all running jobs from |jobs_|.
std::vector<std::unique_ptr<Job>> jobs_to_abort;
for (JobMap::iterator it = jobs_.begin(); it != jobs_.end(); ) {
Job* job = it->second;
if (job->is_running()) {
jobs_to_abort.push_back(base::WrapUnique(job));
jobs_.erase(it++);
} else {
DCHECK(job->is_queued());
++it;
}
}
// Pause the dispatcher so it won't start any new dispatcher jobs while
// aborting the old ones. This is needed so that it won't start the second
// DnsTransaction for a job in |jobs_to_abort| if the DnsConfig just became
// invalid.
PrioritizedDispatcher::Limits limits = dispatcher_->GetLimits();
dispatcher_->SetLimits(
PrioritizedDispatcher::Limits(limits.reserved_slots.size(), 0));
// Life check to bail once |this| is deleted.
base::WeakPtr<HostResolverImpl> self = weak_ptr_factory_.GetWeakPtr();
// Then Abort them.
for (size_t i = 0; self.get() && i < jobs_to_abort.size(); ++i) {
jobs_to_abort[i]->Abort();
ignore_result(jobs_to_abort[i].release());
}
if (self)
dispatcher_->SetLimits(limits);
}
void HostResolverImpl::AbortDnsTasks() {
// Pause the dispatcher so it won't start any new dispatcher jobs while
// aborting the old ones. This is needed so that it won't start the second
// DnsTransaction for a job if the DnsConfig just changed.
PrioritizedDispatcher::Limits limits = dispatcher_->GetLimits();
dispatcher_->SetLimits(
PrioritizedDispatcher::Limits(limits.reserved_slots.size(), 0));
for (JobMap::iterator it = jobs_.begin(); it != jobs_.end(); ++it)
it->second->AbortDnsTask();
dispatcher_->SetLimits(limits);
}
void HostResolverImpl::TryServingAllJobsFromHosts() {
if (!HaveDnsConfig())
return;
// TODO(szym): Do not do this if nsswitch.conf instructs not to.
// http://crbug.com/117655
// Life check to bail once |this| is deleted.
base::WeakPtr<HostResolverImpl> self = weak_ptr_factory_.GetWeakPtr();
for (JobMap::iterator it = jobs_.begin(); self.get() && it != jobs_.end();) {
Job* job = it->second;
++it;
// This could remove |job| from |jobs_|, but iterator will remain valid.
job->ServeFromHosts();
}
}
void HostResolverImpl::OnIPAddressChanged() {
resolved_known_ipv6_hostname_ = false;
last_ipv6_probe_time_ = base::TimeTicks();
// Abandon all ProbeJobs.
probe_weak_ptr_factory_.InvalidateWeakPtrs();
if (cache_.get())
cache_->clear();
#if defined(OS_POSIX) && !defined(OS_MACOSX) && !defined(OS_ANDROID)
RunLoopbackProbeJob();
#endif
AbortAllInProgressJobs();
// |this| may be deleted inside AbortAllInProgressJobs().
}
void HostResolverImpl::OnConnectionTypeChanged(
NetworkChangeNotifier::ConnectionType type) {
proc_params_.unresponsive_delay =
GetTimeDeltaForConnectionTypeFromFieldTrialOrDefault(
"DnsUnresponsiveDelayMsByConnectionType",
base::TimeDelta::FromMilliseconds(kDnsDefaultUnresponsiveDelayMs),
type);
}
void HostResolverImpl::OnInitialDNSConfigRead() {
UpdateDNSConfig(false);
}
void HostResolverImpl::OnDNSChanged() {
UpdateDNSConfig(true);
}
void HostResolverImpl::UpdateDNSConfig(bool config_changed) {
DnsConfig dns_config;
NetworkChangeNotifier::GetDnsConfig(&dns_config);
if (net_log_) {
net_log_->AddGlobalEntry(
NetLog::TYPE_DNS_CONFIG_CHANGED,
base::Bind(&NetLogDnsConfigCallback, &dns_config));
}
// TODO(szym): Remove once http://crbug.com/137914 is resolved.
received_dns_config_ = dns_config.IsValid();
// Conservatively assume local IPv6 is needed when DnsConfig is not valid.
use_local_ipv6_ = !dns_config.IsValid() || dns_config.use_local_ipv6;
num_dns_failures_ = 0;
// We want a new DnsSession in place, before we Abort running Jobs, so that
// the newly started jobs use the new config.
if (dns_client_.get()) {
dns_client_->SetConfig(dns_config);
if (dns_client_->GetConfig()) {
UMA_HISTOGRAM_BOOLEAN("AsyncDNS.DnsClientEnabled", true);
// If we just switched DnsClients, restart jobs using new resolver.
// TODO(pauljensen): Is this necessary?
config_changed = true;
}
}
if (config_changed) {
// If the DNS server has changed, existing cached info could be wrong so we
// have to drop our internal cache :( Note that OS level DNS caches, such
// as NSCD's cache should be dropped automatically by the OS when
// resolv.conf changes so we don't need to do anything to clear that cache.
if (cache_.get())
cache_->clear();
// Life check to bail once |this| is deleted.
base::WeakPtr<HostResolverImpl> self = weak_ptr_factory_.GetWeakPtr();
// Existing jobs will have been sent to the original server so they need to
// be aborted.
AbortAllInProgressJobs();
// |this| may be deleted inside AbortAllInProgressJobs().
if (self.get())
TryServingAllJobsFromHosts();
}
}
bool HostResolverImpl::HaveDnsConfig() const {
// Use DnsClient only if it's fully configured and there is no override by
// ScopedDefaultHostResolverProc.
// The alternative is to use NetworkChangeNotifier to override DnsConfig,
// but that would introduce construction order requirements for NCN and SDHRP.
return dns_client_ && dns_client_->GetConfig() &&
(proc_params_.resolver_proc || !HostResolverProc::GetDefault());
}
void HostResolverImpl::OnDnsTaskResolve(int net_error) {
DCHECK(dns_client_);
if (net_error == OK) {
num_dns_failures_ = 0;
return;
}
++num_dns_failures_;
if (num_dns_failures_ < kMaximumDnsFailures)
return;
// Disable DnsClient until the next DNS change. Must be done before aborting
// DnsTasks, since doing so may start new jobs.
dns_client_->SetConfig(DnsConfig());
// Switch jobs with active DnsTasks over to using ProcTasks.
AbortDnsTasks();
UMA_HISTOGRAM_BOOLEAN("AsyncDNS.DnsClientEnabled", false);
UMA_HISTOGRAM_SPARSE_SLOWLY("AsyncDNS.DnsClientDisabledReason",
std::abs(net_error));
}
void HostResolverImpl::SetDnsClient(std::unique_ptr<DnsClient> dns_client) {
// DnsClient and config must be updated before aborting DnsTasks, since doing
// so may start new jobs.
dns_client_ = std::move(dns_client);
if (dns_client_ && !dns_client_->GetConfig() &&
num_dns_failures_ < kMaximumDnsFailures) {
DnsConfig dns_config;
NetworkChangeNotifier::GetDnsConfig(&dns_config);
dns_client_->SetConfig(dns_config);
num_dns_failures_ = 0;
if (dns_client_->GetConfig())
UMA_HISTOGRAM_BOOLEAN("AsyncDNS.DnsClientEnabled", true);
}
AbortDnsTasks();
}
} // namespace net
|
Q:
Looping results to insert new div with complexities
How can I loop results to insert new div with complexities for each result?
I have the following database table with following columns:
ID | UserID | Title | Introduction | Content | Images | Background | Date | Pinned
I have the following PHP code:
if($latest = $con->query("SELECT * FROM Posts WHERE Pinned='0' LIMIT 4")) {
if($latest->num_rows > 0) {
//<-- result loop here
} else {
echo '<h1 class="alert fade">No Posts</h1>';
}
$latest->close();
};
I would like to format the output as follows:
<div class="post standard" style="background-image:url([1]);">
<a href="view.php?id=[2]">
<div class="shader"></div>
<div class="info">
<h1>[3]</h1>
<p>[4] - [5]</p>
</div>
</div>
[1] - Background
[2] - ID
[3] - Title
[4] - UserID
[5] - Date
How would I accomplish this?
A:
Here is the code which should do what you need. I used just one echo, you can split it into more echoes, or go out of PHP block. Doesn't matter.
<?php
if ($latest->num_rows > 0) {
while ($row = $latest->fetch_assoc()) {
echo '
<div class="post standard" style="background-image:url(' . $row['background'] . ');">
<a href="view.php?id=' . $row['id'] . '">
<div class="shader"></div>
<div class="info">
<h1>' . $row['title'] . '</h1>
<p>' . $row['userID'] . ' - ' . $row['date'] . '</p>
</div>
</div>
';
}
}
?>
Example with putting HTML code outside PHP block.
<?php
if ($latest->num_rows > 0) {
while ($row = $latest->fetch_assoc()) {
?>
<div class="post standard" style="background-image:url('<?php echo $row['background']; ?>');">
<a href="view.php?id=<?php echo $row['id'] ?>">
<div class="shader"></div>
<div class="info">
<h1><?php echo $row['title']; ?></h1>
<p><?php echo $row['userID']; ?> - <?php echo $row['date']; ?></p>
</div>
</div>
<?php
}
}
?>
|
[Tension Hemothorax Associated with Spontaneous Rupture of the Thoracic Aorta;Report of a Case].
A 94-year-old woman was admitted to our hospital with sudden onset of chest pain without any episode of trauma. Computed tomography(CT) revealed left massive pleural effusion and extravasation of contrast medium from the side chest wall to the back. Neither aortic aneurysm nor dissection was evident. During the investigation, the patient went into hypovolemic shock. Hemothorax due to bleeding from an intercostal artery was diagnosed, and emergency surgery was performed. A 1-mm hole was detected in the descending aorta, and closed by a single suture. The final diagnosis was spontaneous rupture of the thoracic aorta. Three-dimensional CT (3D-CT), reconstructed postoperatively, revealed extravasation of the contrast medium from the descending aorta. The postoperative course was satisfactory, and the patient was discharged on the 20th postoperative day. 3D-CT may be useful for identifying the source of bleeding in such cases. |
Conventional versus piggyback technique of caval implantation; without extra-corporeal veno-venous bypass. A comparative study.
Conventional orthotopic liver transplantation (CON-LT) involves resection of recipient cava, usually with extra-corporeal circulation (veno-venous bypass, VVB), while in the piggyback technique (PC-LT) the cava is preserved. Along with a temporary portacaval shunt (TPCS), better haemodynamic maintenance is purported with PC-LT. A prospective, consecutive series of 384 primary transplants (2000-2003) were analysed, 138 CON-LT (with VVB) and 246 PC-LT (54 without TPCS). Patient/donor characteristics were similar in the two groups. PC-LT required less usage of fresh-frozen plasma and platelets, intensive care stay, number of patients requiring ventilation after day 1 and total days spent on ventilator. The results were not different when comparing, total operating and warm ischaemia time (WIT), red cell usage, requirement for renal support, day 3 serum creatinine and total hospital stay. TPCS had no impact on outcome other than WIT (P = 0.02). Three patients in PC-LT group (three of 246;1.2%) developed caval outflow obstruction (P = 0.02). There was no difference in short- or long-term graft or patient survival. PC-LT has an advantage over CON-LT unsing VVB with respect to intraoperative blood product usage, postoperative ventilation requirement and ITU stay. VVB is no longer required and TPCS may be used selectively in adult transplantation. |
8.3 22 BKT TR-171 R-1 TT 37x8.3-22
94034574
$259.95
8.3 22 BKT TR-171 R-1 TT 37x8.3-22
94034574
$259.95
Product Details
TR 171 is a deep tread tire suitable for tractors in soil tillage operations. Thanks to its outstanding self-cleaning properties, it is ideal for wet and moist soil. Also in the harshest operating conditions, TR 171 provides excellent traction and extraordinary durability.
Our Story
Trax Motorsports offers a wide selection of accessories for ATVs, motorcycles and 4X4s including tires, wheels, winches, helmets, exhausts and more. Choose from the categories to the right to begin shopping or type something right into the search box. We are constantly adding new products and we can't get them on the website fast enough! |
Because cured articles prepared from an epoxy resin have excellent adhesion, mechanical properties, thermal properties, chemical resistance and excellent electrical properties, they are utilized widely and commercially as paints, adhesives, and electrical and electronic insulation materials. Epoxy resin formulations used for such applications can be either a one-component system or a two-component system.
The two-component system is made of an epoxy resin composition and a curing agent which are separately stored. When needed, they are weighed and mixed just prior to use. In so doing, it is often difficult to avoid mistakes in weighing the correct amount of epoxy and curing agent, as well as difficult to form a homogeneous curing composition. These mistakes are further compounded by the fact the reaction of the epoxy resin and the curing agent starts as they are mixed.
The epoxy resin/curing agent composition is typically in liquid form. The viscosity of the system increases gradually, goes through gelation, and finally the system cures. The time from formulation until it can no longer be used is called "pot life". The pot life is decided by the chemical structures and the ratio of the epoxy resin and the curing agent employed. Generally, the system with a faster curing rate has a shorter pot life. If a curing agent which is designed with an emphasis on the curing rate is used, a formula can usually be cured at room temperature or lower. However, it will naturally shorten the pot life and it creates a need to frequently formulate a small amount of the composition. Thus, such room temperature curing compositions cause a reduction in working efficiency.
In contrast, because a curing agent is added ahead of time in the epoxy resin of the one-component system, the above-mentioned problems associated with the two-component system can be eliminated. The curing agent used in such systems is typically called a "latent curing agent". The simplest one-component system is based on the curing agent which can cure epoxy resin at high temperatures. Such agents include, but are not limited to, dicyandiamide, phenol novolak, adipic dihydrazide, diallyl melamine, diamino maleonitrile, BF.sub.3 -amine complexes, amine salts, and modified imidazole compounds and the like. Because these curing agents require a high temperature a slow curing rate is inherent. Thus, the reaction proceeds slowly at room temperature and the epoxy resin compound formulated with curing agents can be stably stored at room temperature or lower temperatures for a certain period. Thus, these systems are especially suitable for one-component systems which are cured at high temperatures.
Such high temperature curing agents do not dissolve in an epoxy resin at room temperature. If such a curing agent is dispersed as particles, the storage stability can be improved drastically. This is due to the small contact area with the epoxy resin. In this case, a small particle size for the curing agent is important because smaller particle sizes increase the curing rate and also make the structure of the cured article very uniform. See J. Appl. Polymer Sci, 32, 5095(1986) Such a dispersion type curing agent can also be called a latent curing agent.
Generally, the epoxy resin curing composition of a one-component system, in its normal state, requires a latent curing agent which can be activated by some form of stimulation. Examples of such latent curing agents include amineimide compounds which are activated by thermal decomposition; ketimine compounds which are activated by contact with moisture; aromatic diazonium salt compound, diallyliodonium salt compounds which are activated by exposure to light; and curing agents which are microencapsulated in material which can be destroyed by mechanical pressure or by heat. However, due to problems such as performance and cost, they are not widely used. As a link before they become truly useful, currently the above-described latent curing agent of the dispersion type is important because the preparation method involved is simpler and less expensive.
However, a particularly promising latent curing agent is the modified amine curing agent adduct obtained by reaction with an epoxy compound. Due to the modification by the epoxy compound, the flaws of amine curing, such as volatility which causes problems in handling, hygroscopicity which significantly affects curability, and compatibility with the epoxy resin, can be improved. Even further, control of the melting point is also possible. Epoxy resin is cured by polyaddition reaction with a curing agent or by ionic polymerization.
However, because curing agents which require secondary processing tend to be expensive, a curing agent of a catalytic polymerization type which does not depend on the addition of equivalent amounts and can be cured with the addition of a small amount, will be an advantage. From the aspect of performance, the curing agent of the anionic polymerization type which does not risk corrosion of metal (tertiary amine adduct) is preferred. A suitable catalyst for this purpose is an imidazole/epoxy resin adduct, and its technology is disclosed in detail in Japanese Patent Publication (Kokai) No. SHO 58-13623 (1983) and SHO 61-268721 (1986). This solid adduct which is synthesized from amine compounds and epoxy resins can be obtained by reacting an amine compound and an epoxy resin in a solvent and then removing the solvent from the system as a whole. Then, it is crushed and pulverized and then sieved to obtain particles of the curing agent of a desired size. There is a limitation to the degree of crushing and pulverization, and it is extremely difficult to commercially prepare fine particles having a Stokes diameter of smaller than about 4 .mu.m.
Because the above-described preparation method is a long and laborious process, it incurs a very high production cost. In addition, due to the limitation of the particle size of the curing agent formed by crushing and pulverization and also to the pulverized state, there are the following disadvantages:
a. bulky and inconvenient for packaging and shipment, PA1 b. aggregation of the particles require enormous work to disperse the particles in an epoxy resin when used, PA1 c. increase in viscosity takes place when added to an epoxy resin, PA1 d. a limit in the degree of improvement on the curing rate by reduction in particle size, and PA1 e. relatively short stable storage period of the formulated curing composition. PA1 (a) dispersing spherical particles of an amine compound/epoxy compound adduct having a melting point of at least 50.degree. C. and a diameter of 0.1 .mu.m to 30 .mu.m in a liquid epoxy resin; PA1 (b) adding 1 to 100 parts by weight of a polyfunctional isocyanate compound based on 100 parts by weight of a polyfunctional isocyanate compound based on 100 parts by weight of said spherical particles at a temperature below the melting point of said spherical particles with agitation; and PA1 (c) heating and agitating the resulting mixture at said temperature until the isocyanate groups in said polyfunctional isocyanate compound have been completely reacted.
Although the particles of the amine compound/epoxy compound adduct has a variety of advantageous features as a curing agent, such advantages have not been used to the full extent with the one component curing composition due to the reasons mentioned above.
On the other hand, the curing agents which are more widely used are ones obtained by treating solid particles of an amine compound/epoxy compound adduct with a polyfunctional isocyanate to improve its latent curability. See Japanese Patent Publication SHO 64-70523 (1989) and HEI 1-113480 (1989). In this case it is presumed that the polyfunctional isocyanate has been reacted with the particles of the adduct to form an encapsulated film on their surfaces. With this type of latent curing agent which tends to be expensive, it will be advantageous to use an ionic polymerization type curing agent which can be cured with a small amount of addition without regard to the addition of equivalent amounts. From the performance viewpoint, anionic polymerization type curing agents (tertiary amine adducts) which have no risk of corrosion of metal are preferred. The amine compound/epoxy compound adduct can be obtained firstly as a lump by removing the solvent from the reaction system after reacting the amine compound and the epoxy resin in a solvent. Subsequently, it is crushed and pulverized, and then classified and a curing agent of a desired size is removed. Subsequently, the particles of the amine compound/epoxy compound adduct are dispersed in a liquid epoxy resin, and a polyfunctional isocyanate compound is added and reacted in a heated state to prepare a desired latent curing agent as a masterbatch. In Japanese Patent Publication (Kokai) No. HEI 1-113480 (1989), it is assumed that the polyfunctional isocyanate compound added has been adsorbed on the particles of the amine compound/epoxy compound adduct dispersed in an epoxy resin, and that the hydroxyl group therein and the moisture therein are reacted to form a polyurethane polymer and a polyurea polymer to form an encapsulating film. The latency of the agent is imparted by this thermal fusible film which prevents direct contact of the particles of the adduct with the epoxy resin. Further, the polymer composition of the encapsulating film is controlled by the amount of the moisture contained in the particles of the adduct to allow the production of the particles of an encapsulated adduct which has enough solvent resistance against an organic solvent added only in the presence of a suitable amount of water and can withstand the mechanical mixing treatment in the compounding step.
The particles of the amine compound/epoxy compound adduct used for the production of the above described prior art curing agent masterbatch are in the form of relatively large pulverized particles having an average Stokes diameter of about 3 .mu.m or more. Due to the shape of these particles, there are created various following adverse problems when used as the curing agent masterbatch.
The increase in viscosity is greater when using pulverized particles than when using spherical particles. Accordingly, in regards to a curing agent masterbatch, since there is a limit as to the viscosity which can be handled, the concentration of the curing agent has to be lowered in a relative manner. Therefore, when this curing agent masterbatch is added to prepare an epoxy resin curing composition, no problem emerges if the epoxy resin to be cured is the same epoxy resin as the dispersing medium of the curing agent masterbatch. However, if they are different, the desired properties of epoxy resin to be cured will be diluted by the epoxy used as the dispersing medium. Further, it is not desirable for the viscosity to increase during formulation since it will lower the degree of freedom of formulations design. For example, in order to lower the thermal expansion coefficient of the epoxy resin, a filler is usually added to the epoxy resin curing composition. However, the addition of the filler also increases the viscosity of the composition and accordingly, it is preferred to use a composition having a low as possible viscosity in order to increase the amount of the filler which can be added. For this reason, even if the curing agent of an amine compound/epoxy compound adduct treated with a polyfunctional isocyanate compound has various advantages, such advantages are not fully used in the one-component curing composition. |
Lucky Dragon Mobile Visa Consultant was a business operated out of a van in front of the Chinese Consulate in Manhattan between Oct. 17th 2011 and Jan. 17th, 2012. The business was set up to assist people who were having trouble with Chinese visa forms.
In June 2011 Chinese authorities instituted a policy whereby they would only accept special New York 2011-version visa forms. Due to unclear web design and a large variety of different visa application forms floating around the internet, many people arrived at the consulate with the wrong visa form. Making the process even more difficult, the Chinese consulate required that the forms be typed — not filled out by hand. This would require a computer with Adobe Reader, and a printer.
The consulate is located in a very remote location in Manhattan, far from public transportation lines. The nearest internet cafe — where people could remedy their visa issues after they arrived at the consulate with the wrong form — is a 15-minute walk from the consulate, inside a Burger King restaurant, near Times Square.
I came across the idea for the business because I too had the wrong form. I was turned around by the security guard and sent to the Burger King, where I found every computer was being used to fill out these forms.
I was assisted in filling out the form by a calm, friendly, but very shabby looking middle-aged black man, and one really sketchy-seeming woman (scraggly hair, short, heavy, a manic look about her). When I returned to the consulate, I asked the security guard a series of questions to test his receptiveness to my idea. The security guard (“King”; the other one was “Paco”) said they were turning away nearly one hundred people per day. The next day, I returned in a rented Penske Moving Van, running a printer off of an AC adaptor that was plugged into the van’s cigarette lighter.
The first day in full operation, we were completely overwhelmed by demand.
At the end of the day, the black man from the Burger King came down and applauded us. He introduced himself as “Mike” (we later learned to call him “John”), a veteran of the first gulf war. He said we had taken away his entire income, as well as that of his staff (who he referred to as his “girls”).
For the next seven weeks, we established Lucky Dragon as a profitable enterprise, meanwhile battling a constant barrage of slander and harassment from Mike’s main “girl,” Jill, who was our full-time antagonist. We created uniforms, improved the comfort of the experience, printed promotional materials, got credit card readers, hired employees who could speak Chinese, and generally worked to minimize costs and save money.
Without doing anything to promote ourselves to journalists, we received mainstream press attention. Most notably, we were featured on NPR’s “Planet Money” on January 4th, which resulted in auxiliary coverage on several economically oriented blogs, and one condescending think tank. I also appeared on live national television in Canada on a segment called “Connect with Mark Kelley” (which I feel went very poorly).
Recently we were in the Financial Times Deutschland, Singtao, and a host of other global venues. At the time of our dissolution, we were talking with a journalist from CBS. I’m disappointed that didn’t pan out.
What happened? Why is it over?
We became aware of changes internal in the consulate last two Tuesdays ago. Changes that had come from higher up. The security guards told us that we would have to stay off of the sidewalk in front of the entrance, which they had never worried about before. They were now accepting out of state forms, also, they said. This development effectively killed 30% of our market.
I bought chocolates for the person in charge at the consulate and requested a meeting, which was not granted to me. Instead I met with a cute young visa officer who smiled sheepishly at me when I told her who I was, and showed her my (by now iconic at the consulate) red hat.
She told me that she thought we were smart, and that she was glad we could help the people we did, and provide the service we did; that things were complicated, that they weren’t trying to make it hard on people, that they were just bowing to orders from higher up in the government. I asked if they were planning to make any changes in the future and she said she could not tell me. We went home with a significantly reduced total income that day.
The next day we were informed they would accept all forms — as well as those that were handwritten. This killed another 50% of our market, leaving us without enough income on a day-to-day basis to continue showing up. We returned the van that night.
Miles Ross informed me of this tweet (above), later that day, which pointed to an executive order from the White House asking to speed tourist Visas to Brazil and China.
Was it pressure from the US Government? Did they learn about our story and decide that enough was enough? Or, perhaps, was our press attention in China and here reflecting poorly on the higher-ups in the consulate? One suspects it was a confluence of both these factors, as well as other things we’re probably not even aware of. Regardless, it is with great pride and affection that I say adieu to Lucky Dragon. It was an absolute pleasure to have stake in the running of the business — and to meet and get to know thousands of people in intimate sociological detail. |
Monitoring phytoplankton, bacterioplankton, and virioplankton in a coastal inlet (Bedford Basin) by flow cytometry.
To establish the prevailing state of the ecosystem for the assessment of long-term change, the abundance of microbial plankton in Bedford Basin (Nova Scotia, Canada) is monitored weekly by flow cytometry. Phytoplankton are detected by their chlorophyll autofluorescence. Those that contain phycoerythrin are designated as Synechococcus cyanobacteria or cryptophyte algae according to the intensity of light scatter. Bacteria and viruses are stained with DNA-binding fluorochromes and detected by green fluorescence. Distinction is made between bacterial and viral subpopulations exhibiting high and low fluorescence. Time series data are presented for weekly observations from 1991 to 2000. Weekly averages are computed for the complete annual cycle of temperature, salinity, river discharge, nitrate, phosphate, silicate, chlorophyll, total phytoplankton including Synechococcus and cryptophytes, total bacteria including high and low-fluorescence subpopulations, and total viruses including high and low-fluorescence subpopulations. The microbial biomass in the surface water of Bedford Basin is dominated by phytoplankton. The spring bloom of phytoplankton represents a maximum in algal biovolume, but not in cell number. Phytoplankton, bacteria, and viruses all attain their annual numerical maxima between the summer solstice and the autumn equinox. A vigorous microbial loop and viral shunt is envisioned to occur in the summer. |
Q:
XCode methods file
How can a i create a .m file that houses all of my methods for my iphone app?
I need these methods to be able to be called from any view.
Example Method:
-(void)loadinfo(id):sender{
//Dynamically load UI Stuff
}
A:
It sounds like what you want is achievable though the normal design pattern of creating a custom subclass of NSObject. There's no need to do anything fancy, like using class methods or writing as a singleton, but you can if you want.
All you need to do is create a standard NSObject-derived subclass containing all the methods (class or instance) you need, and then import that class whenever you need to use one of its methods (either by invoking the class method directly, or by instantiating an object of the class and calling the method on the object in the normal way). So, import the class in the desired file:
#import "YourSubclass.h"
Then, when you want to call a method:
[YourSubclass yourClassMethod]; // If a class method
or
YourSubclass *subclass = [[YourSubclass alloc] init]; // If an instance method
[subclass yourInstanceMethod];
//[subclass release]; // Uncomment if *not* using ARC
You could also implement this subclass as a singleton, though some feel that this design pattern is not a great way to go (Luke Redpath states this view in his article on singletons), so whether you choose to go that way is up to you.
|
PES 2014: The Dawn of a New Era
KONAMI looks to the future as it reveals new PES series powered by Fox Engine
Konami Digital Entertainment GmbHhas revealed that its forthcoming PES 2014 title will mark a new beginning for the popular series, with an all-new engine allowing for the most comprehensive advance for the PES range since its inception.
The PES Productions Team based in Tokyo have been developing a new approach to football for four years and can now confirm their new system uses Kojima Production’s renowned Fox Engine at its core. The team have extended and enhanced Fox Engine to match the bespoke and complex demands of a football title.
Based on six founding standards, the new system has allowed every aspect of PES 2014 to be totally reworked, throwing off the shackles of previous limitations and allowing the PES Productions team to produce a game much closer to their vision of recreating the excitement and variety of a top-level match. The central theme of fluidity is based on the constant moving of players and switching positions which characterises the modern approach to football. PES Productions have looked at how matches ebb and flow, with player individuality key to a team’s success, and well-drilled tactics helping underdogs produce giant-killing feats.
Working from the ground up, PES Productions have strived to rework every element of play, creating a fresh and energetic new standard for football titles. In addition to noticeably improved graphics and seamless animation, the thrust of the new system’s power has been used to redefine the way football is played on a home system. Gone are the limitations imposed by dated animation systems and AI elements, and instead PES 2014 boasts a central core that perfectly mimics the skill and awareness that elevates the world’s greatest players above their peers.
Six central tenets combine to establish PES 2014 as a new benchmark in football simulations, governing everything from the way the player receives and controls the ball, the physicality of play, and the ‘feel’ of match-day: the rush and euphoria or crushing lows that experiencing an important games can bring. As such, the key pillars on which PES 2014 is based are:
TrueBall Tech: For the first time in a football simulation, PES 2014 centres everything on the ball: how it moves, and how players use it. First touch and sublime control are what set certain players apart from others. The ability to not only read a pass, but to be one step ahead and to know what is needed to gain yards on an encroaching defender. TrueBall Tech allows the player to trap or knock on a pass using the analogue stick with detailed barycentric physics determining the weight shift of the player and the height and speed of the pass, as to how the player’s body will automatically shape to receive it.
Thus, the player has total control in determining how their body is angled to receive a pass, whereas previous football titles present the user with scant options. Instead, TrueBall Tech means that it can be chested or nodded past an opponent, flicked into space or to a team mate, while closer dribbling control is a much more personal attribute in the new game.
The PES series has long since treated the ball as an individual entity, allowing the player huge amounts of freedom to pass into space, run on to a knocked-on counter, or produced short triangular passes to make space. TrueBall Tech adds even more freedom, with the player’s movements worked around those of the ball and, unlike any other football title, as opposed to the other way round. Players will be able to truly control the free-moving ball, use its pace or alter its movement to master close control in PES 2014.
The result is a game that offers full 360-degree, two-footed control within several yards around the player. In addition to steering the ball with subtle movements, there is the ability to shield the ball from opposing players, use deft controls to wrong-foot them, and intuitive methods to master close control.
Motion Animation Stability System (M.A.S.S.): The physical combat between players is a vital part of any match, and the new M.A.S.S. component simulates the bodily contact between multiple players within bespoke animations that segue seamlessly into each other. Rather than a series of preset animations that occur under specific circumstances, M.A.S.S. acts instantly to any situation, with the reaction of a fouled player entirely dependent on the direction and force with which they are tackled. Dependent on factors such as their size and power, players will stumble but instantly recover if clipped, barge others off the ball, and use their stature to block players from possession. Similarly, PES 2014 now has more styles of tackle, as opposed to basic foot in or sliding types.
Tackling also becomes more integral to PES 2014’s quest for realism, with clashes of players utilising the TrueBall physics to ensure the ball reacts as it would in a real game. As players fight for a 50-50 ball, their result challenge will see the ball bobbling into space, or emerging at the feet of the triumphant player.
The integration of the M.A.S.S. element has also facilitated new advances in one-on-one situations. The individual battles between key players can determine the outcome of a match, so particular emphasis has been made on such battles in PES 2014. Defenders will put greater pressure on the attacking player, by tussling for possession, standing back to restrict passing opportunities, or making the tackle. Likewise, attackers are faced with ether trying to outpace the defender while retaining possession, feinting to gain advantage, or passing, dribbling or shooting when space allows. The result allows for incredibly open games, where the attributes and skills of the players come to the fore in personal feuds all over the pitch.
Heart: Defining what makes football so engrossing is difficult. It isn’t a technical thing, but more an emotional hook. Matches can be imposing for visiting teams, as home support barracks the opposition, and acts as the infamous ‘twelfth man’ by cheering their side on. PES2014’s ‘Heart aims to recreate the effects of team support, both on an individual player basis and across the entire team.
Each player in the game now employs mental attributes in addition to playing styles and skills, and can be adversely affected when having a poor game. However, if an individual is not playing well, his team mates can rally round and will work to support him. Similarly, one moment of individual brilliance can produce a galvanising effect on team mates. The cauldron effect of a vibrant stadium will showcase the mood of the fans, with all-new sound effects combining with stunning AI systems to create a palpable match day atmosphere.
PES ID: PES 2013 set a new bar for realism, with its inclusion of the Player ID system. For the first time, players could instantly recognise a player by their faithfully recreated running and play styles. The way a player ran, moved and spread the ball about would be identical to that of their real-life counterpart, and PES 2013 featured 50 players that utilised the system.
For PES 2014, that number will be greatly expanded, with twice as many stars featuring bespoke animations and AI.
Team Play: Via the new game’s innovative Combination Play users can set up a variety of different tactics in key areas of the pitch using three or more players. These players will make very different off-the-ball runs to exploit holes in the defence or midfield, using the flanks, curved runs, or overlapping play to make themselves available. These moves can be preset to key areas of the field, allowing users to exploit defensive weaknesses beforehand.
The Core: PES Productions have undertaken several years of consultation with PES and football fans to reproduce key elements of the series and implement a wide range of additional improvements.
Visually, the game will benefit from an incredible level of acuity, from the weave of the kits, through to facial movement, and a new animation process that offers slick segues from one move to the next, with no pauses or restrictions on control. Stadia will be faithful to real-life, with the entrances to the pitches recreated, crowds that move during the course of the game The new system also allows for a new light-mapping effect, adding a natural look to the proceedings. The flow of a match has also been improved, with tactical decisions made on the fly, and the removal of cut scenes after specific events.
Free kicks and penalties have also been radically changed. Control over free kicks has been expanded with decoy runs added and short passes now unrestricted. To counter, players can now move the position of their keeper for the kick, while the wall will react to the kick instinctively to block or deflect the ball.
Penalties now use a target guide that is changed according to the kicker’s ability and where they intend to place the ball. The goal keeper can now opt to move ahead of the kick, sensing when the penalty taker is not particularly strong.
PES 2014 will also mark the first appearance of the recently-signed Asia Champions League, adding a wealth of officially licensed clubs to the competition; and the new game will also exclusively retain its use of the UEFA Champions League club competition, with other tournaments expected to be announced shortly.
Further details of PES2014’s content – including all-new online elements – will follow, but the new game represents a quantum leap from what football fans have been used to.
“Thinking outside the box on an annual series such as PES is not easy,” explained Creative Producer Kei Masuda, “but the Fox Engine has allowed us to develop such a level of freedom that we are constantly realising ways of making PES 2014 a true representation of football. From the moment football fans pick up the controller and experiment with the close control, player movement and get to know how teams work and move, we are confident that they will see a game no longer limited by technology, but capable of growing with them and constantly surprising with the breath-taking quality they have to come to expect from the real thing.”
“All the materials we’re releasing are taken from current platforms and fully in-game, which is at about 70% completion,” he added. “We want fans to get a true feeling of the actual product they’ll be playing on the consoles most own this year, not some marketing dream. Our new engine and systems are dedicated to the current generation of platforms, which will continue to be dominant in the market, but are fully scalable for future versions.”
PES 2014 will be released in 2013 on PlayStation®3, Xbox 360®, Windows PC and PSP®(PlayStation®Portable).
22 Responses to PES 2014: The Dawn of a New Era
Zzzzzzzzzz. Yawn. We heard it all before, we believed, we anticipated, we got massively disappointed.
I don’t care what or which new technology pes2014 is using . This is all hype , propaganda and marketing ploy.
As much I want to believe it…like every year in the past five years…. I can’t, I won’t , I shouldn’t be fooled again . Or should I ?! :( :( sniff.
Noooooooooooo. Don’t do this to me konami no… Not again….pls… Get it right this time…I beg you! .
Agree with Banayoti. Same bull every year. New this new that ,same result. Online right now is terrible. Probably the worst of any year and yet they boast of an improvement year after year. The updates just seem to make it worse and worse,and its currently unplayable. Nice marketing ploy ,but heard it all before. Not sure you’ll be getting my money this time,as I’ve being conned too many times over the years
It sounds to me like PES 2014 will be the start of a new type of football simulation, one that gives more importance to the direction of the tackle as well as the direction of dribbling, as opposed to the old and tired formula of simply changing the direction of the run and describing that as “dribbling” when in fact you cannot actually do any actual dribbling.
If Konami manages to offer a complex system with simple controls, and the game is no longer about simply running from one end of the pitch to the other end, meaning that dribbling past a defender would not simply be about “releasing the sprint button and then changing the direction of the run” but instead would require more intricate factors such as body positioning and momentum etc, then I will most certainly buy PES this year.
It doesn’t have to be the perfect game (and of course, it won’t be), but what is an absolute must for me, is a video game that offers a new premise or a new promise, as opposed to a video game that is simply yet another extension of a method and a formula and a system that got old about five years ago. I can say right now, without any second thought, that if PES 2014 is just another extension of PES11…. I’m not spending my hard earned money on that.
The demo has been very accurate in the last few years, so I will know if I will buy PES 2014 only after I play the demo…. but so far, it sounds very very promising, as usual, but this time it appears to be for real.
To be honest, both PES 2013 and FIFA 2013 are so far away from what the PS3 console can do, that I’m not really looking forwards to the PS4…. I mean, what good is it to have very powerful consoles such as the PS3 and now the PS4, when the game designers do not know how to create a video game that actually uses about 80% or 90% of the actual capacity of the console.
I mean, PES 2013 and FIFA 2013 are just extensions of a system that’s been in use since the Nintendo64…. the graphics have improved a lot, but the core game, the core fundamentals., remain essentially identical. PES 2014 and FIFA 2014 should not be produced for the PS4 console, because neither Konami nor EA Sports have done nearly enough to justify a PS4 game; before they produce a proper PS4 game, they must re-invent the whole concept of “football simulation” from the ground up, if not, then the PS4 versions of PES and FIFA will just be extensions of Nintendo64 era video games with new gen graphics to lure in the customers.
To be honest with you, I am hoping for the best with PES 2014, but the rational part of me is expecting nothing but another disappointment in a long running series of disappointments.
but again, the new engine is keeping me interested. something like a new engine only comes round every 4-5 years.
what happens though when the next gen consoles come out. will there be a wait of a whole year before pes darkens their door… especially on the xbox one where it seems it will not be backwards compatible???? surely not??
True, fifa changed their engine this generation. Now they have another new engine called ignite. Looks like Pes is still trailing. But I ,like Amatuer, am optimistic with konami new approach to football simulation . Their plans for the new game are very brave and interesting . Apparently they have been working on these new ideas for four years. Four years!! Surely they will get it right this time.
Konami are not releasing pes2014 on the ps4 or Xbox one.
EA are releasing fifa 14 this gen AND next gen.
And you know what konami said? They said they are doin that because people accused them in the past of being lazy!!!!! They don’t want to release the same game with upgraded graphics for the next gen.
Now.. DOES THAT MAKE ANY SENSE???!!
Konami are already loosing in my book. Unless pes2014 turns out to be the best football simulation ever made. What are the chances?!?
Konami are releasing Pes for next gen, just not until sep / October NEXT year. But I get where you are coming from. Some might say a massive coup for EA . The big masses who are going to purchase next gen machines will want a footy game to go with it , most of them anyway. Now, how many die hard Pes fans buying ps4 or Xbox one will resist buying a next gen footy ? And what’s the ONLY footy game available?!
Just when Konami suppose to win its massive departed fan base back they decide to do something like this. This is both pure naievety and blatant laziness. Complete lack of marketing prowess.
i would be alreay happy if you could edit the whole jersey.. change teams in the master league like on the fifa career mode.. like you start with a team like aston villa and through good results manu offers you the manager job.. the gameplay i think is gonna take a huge step forwards with the new engine.. those small things would improve the game to most people i think…
Yes, FIFA chanegd their engine and did reasonably well, considering their past failures. But the fact that is not mentioned enough, is the fact that FIFA 2013, although it offers decent animations, still suffers from the same game breaking flaws as PES5 and PES6.
Improved animations and improved graphics are always welcomed, but the priority right now is to change the concept, because both PES 2013 and FIFA 2013 work around a system that’s been in use since the Nintendo64, both PES 2013 and FIFA 2013 are shackled by 2D mechanics.
That’s the reason why I’m not even a little exited about FIFA 2014 the PS4 version, because FIFA 2014 on the PS4 version can only be FIFA 2013.05 or in other words, FIFA 2013 with better graphics, and I don’t know about you, but unless my PS3 suddenly breaks down, I will not spend a lot of money on a PS4 console (like I did with the PS3 console) just to play sub-par video games that do not come close to justifying the money that I paid for the actual console.
Am I the only one who remembers PES 2008 and FIFA 2008 for the PS3?
FIFA 2008 the PS2 version, was better than both of those games!! I’m sorry but a new console does not produce miracles, and the fact is, that FIFA 2013 is so very far away from what the PS3 console can really do, that I fail to see the point as to why it is, exactly, that I should be exited because EA Sports is going to produce a FIFA game for the PS4 console?
Had EA Sports pushed the PS3 console to the limit, then I would be very exited by the prospect of playing a FIFA game made for the PS4 console. But paying over $500 just to play FIFA 2013.05 is not something I’m exited about….
But then again, that’s what EA Sports does, they make a business out of the “casual” masses who will pay top dollar for minor upgrades year after year. What I don’t quite understand, is why we have people in here, who are criticizing Konami because Konami will not release PES 2013.05 on the PS4 console; I mean, if anything, we should applaud Konami’s decision of not releasing PES 2013.05 on the PS4 console. If Konami is not releasing PES 2014 on the PS4 because they cannot compete with EA Sports’s PS4 offering and therefore do not think the investment is a wise decision, or if Konami decided not to produce a PES 2014 version for the PS4 because they think there is still much to be done with the PS3 console, the fact still is, that there is still much to be done with the PS3 console, and I for one think that not producing PES 2014 the PS4 version is a wise decision.
The fact of the matter is, at the end of the day, that PES 2013 and FIFA 2013 are so outdated, that Konami and EA Sports could still use the PS3 console for the next two years, and in those two years they could implement a lot of innovative and even revolutionary ideas. I am very exited about the PS4 because other types of video games will offer something that will be worth the investment, but as far as the “football simulation” genre goes I am not exited, because so far, the “football simulation” games that we have seen throughout the PS3′s life, have not even scratched the surface of the PS3 console, so really, why should I expect that the PS4 version of FIFA will blow my mind away?
What can EA Sports possibly produce for the PS4 console this year, if not an extremely disappointing product? Do not forget, that when FIFA made the jump from the PS2 console to the PS3 console, they had already made all the changes they needed to make before actually jumping to the PS3 console; FIFA 2008 on the PS2 was already more advanced, technically more advanced, than either PES6 or PES5, but back then PES was still king because of their reputation, not because PES was actually better. So by the time FIFA jumped to the PS3 and by the time PES jumped to the PS3, the difference between the arcade-like PES 2008 and the more refined FIFA 2008 was shockingly obvious….
….Of course, my point being, that FIFA 2008 the PS2 version and FIFA 2008 the PS3 version were essentially identical replicas, FIFA 2008 the PS3 version had lsightly more modern graphics, but otherwise, the PS2 game and the PS3 game were identical replicas. Now with that thought in mind: FIFA on the PS2, the difference between FIFA 2006 and FIFA 2008 is massive…. On the other hand: FIFA on the PS3, the difference between FIFA 2011 and FIFA 2013 is as close to nonexistent as it can possibly get.
So considering the mentioned facts, why exactly should I be exited by the prospect of a PS4 FIFA game? What has EA Sports done in the last three years, to make me believe that they can offer a PS4 offering that can justify my investment? Absolutely nothing. It is an entirely different situation, when FIFA made the jump from the PS2 to the PS3, they made massive changes to their game; on the other hand, now that FIFA is making the jump from the PS3 to the PS4, FIFA has remained essentially identical for the last three years of development, and many FIFA fans even argue, that FIFA has actually gone backwards in the last two years.
Maybe by year 2016 we will see a decent footy sim on the PS4 console, but I doubt we will see anything “revolutionary” in the first two years. That was more or less the case with the PS3 console, and all evidence suggests that it will be more of the same with the PS4 console. I just hope that for the PS4 console, Konami starts with a strong and original PES game, as opposed to starting with yet another disaster like PES 2008 was.
Yes Fifa didn’t change much in the last few years. But as you said , when they made the jump to ps3, they made it with a bang. Fifa 08 was as you rightly mentioned one slick and advanced game for the then new console using their then new engine. A far cry from the last game they did for the ps2.
Now , same situation. New gen hardware , new engine. I AM excited. For sure.
We will wait and see the impact of konami decision not to make a game for the ps4/Xbox one at launch. But I fear, that will prove to be rather catastrophic .
Actually no, that is not what I said at all. FIFA 2008 the PS2 version was identical to FIFA 2008 the PS3 version. The difference between FIFA 2006 the PS2 version, and FIFA 2008 the PS2 version, is massive, because EA Sports made a lot of changes in their last two years with the PS2 console; these changes served as the foundation on which they based all their PS3 games.
On the other hand, the difference between FIFA 2011 the PS3 version, and FIFA 2013 the PS3 version, is close to nonexistent. My point is simple, EA Sports is not ready for the PS4 console, EA Sports will offer a disappointing product because EA Sports does not currently have a video game that can serve as the foundation for their PS4 games, there is absolutely no evidence to suggest that EA Sports will offer something great.
EA Sports has done little or nothing in the last three years, FIFA 2013 is not ready for the PS4 console, FIFA 2013 cannot serve as the foundation for a PS4 game, FIFA 2014 for the PS4 will be a massive disappointment. New gen hardware, and new engine, is not all that important when the concept itself is broken at the very core. And having mentioned the “new engine”; is this why EA Sports has done absolutely nothing in the last three years of development? They were too busy making plans for their new engine to be release along with the new hardware?
I don’t know about you, but hat sounds like something that must not be true. You don’t just develop an entirely new engine, and then just release it on a new gen console without testing it on the current gen console BEFORE actually making the jump to the newest console…. That’s when results like PES 2008 (PS3 version) happen. I am not excited, and I am not excited, simply because EA Sports has done nothing in the last four years, to suggest that they are capable of producing a video game that doesn’t get old after twenty minutes of play.
Let’s wait and see, time will tell. I have to say Konami’s new game ideas are beautifull, on paper, and if they can pull it off, it would be a revolution in gameplay. But I hope they won’t neglect the more important flaws of the game like animations, online, AI defenders, freedom of play, referees, ……..and the list goes on.
I agree, time will tell…. I’m just sharing my two cents on the matter, is all. As for animations and AI defenders, I agree those two areas are of essential importance, but that’s precisely what I mean when I say that “the concept itself is broken at the very core”; you cannot actually fix “AI defenders” because the system itself cannot be fixed, this is why AI defenders are never actually fixed, it’s not because EA Sports and Konami want you to buy the next version of the game, it’s because the system is broken at the very core.
The concept must be changed, and then the “AI defenders” will finally be decent enough to be acceptable. The same thing applies to the animations; you can have the best animations ever, but the current system (which has been in use for well over a decade) does not have the capacity to offer a great variety of animations; so even if you have great and fluid animations, the current system can only offer a very limited number of animations.
The more important flaw is the concept, that should be the main priority; the animations, online, AI defenders, freedom of play, referees, are all secondary features that will improve massively if the system itself is improved.
In any case, it’s an interesting for us fans, as we have seen little changes in the last three to four years, and now with the PS4 console coming out a whole new world of possibilities is there for the taking, if neither Konami nor EA Sports step up their game, a third party is well in position to enter the competition. If anything, I’m excited by the prospect of a third party coming up with a great game, more than I’m excited by the prospect of either Konami or EA Sports coming up with something great. Time will tell.
Same old same old crap… been there, done that.. regretted 1000 times. The fact that FIFA will be on the next gen consoles and PES not, has already awarded another victory to FIFA. Like the other guys have mentioned, most hardcore gamers, and in fact the new gamers, will buy the latest and greatest in the market, and the only option available to them is going to be FIFA. For me and I believe for most gamers these days, smooth online play is a must. And this is Konami’s weakest area. There are a lot of issues to iron out, and I don’t think Konami will be able to do it this year as well. It’s already hard to find a match, lately I have been noticing it a lot, it takes a loooong time to find a match, most of the time u get “no opponents found”. What does this tell? There are a lot less people playing PES, and a lot lot less playing online, a lot have already changed ship. And with the hardcore bunch upgrading to the next gen console, there will be only few casual players playing PES. Hopefully this means less lag for you that will still be playing due to less crowded servers, on the few that Konami has.
Btw, I am getting the new console (looks like PS4 this time as XBOXONE has so far given a lot of reasons to hate it), so I have no other option but to get FIFA 14 (but I was getting it anyway coz Konami, I don’t have faith in u anymore). |
1. Field of the Invention
The present invention relates to a digital broadcast system and more particularly, to a system which allows for changing the content elements interactively in response to the viewer operation.
2. Description of the Related Art
0. Outline of the Satellite Broadcast System
First, the outline of the satellite broadcast system is to be described.
0.1. Radio Wave Transmission Status in the Satellite Broadcast
FIG. 1 is a schematic illustration of the radio wave transmission status in a satellite broadcast. The radio wave from an earth station 2 is transmitted to earth via a broadcast satellite 4. A plurality of transport streams TS1, TS2, and TS3 are transmitted from the broadcast satellite 4. The transport streams (MPEG-2) are distinguished according to the frequency, plane of polarization, and the like. The transport stream TS1 has a plurality of services (corresponding to channels of the ground wave broadcast) SV11, SV12, SV13, and SV14 provided in packets and multiplexed by time division. Likewise, the transport stream TS2 has services SV21, SV22, SV23, and SV24 multiplexed, with the transport stream TS3 having services SV31, SV32, SV33, and SV34 multiplexed. Incidentally, each of the transport streams carries video and audio data for each service as well as control data for indicating program information, control data for indicating current time, and control data necessary for packets, etc. In FIG. 1, only three transport streams are shown, however, more transport streams are transmitted in practice. Additionally, in FIG. 1, each transport stream has four services multiplexed, however, more services are multiplexed in practice.
0.2. Configuration of Transmitter
As shown in FIG. 2, each transport stream is generated and transmitted by means of a transmitter 1. Referring to the figure, only the transport stream TS1 is shown and the other transport streams TS2 and TS3 are generated in the same way.
Video/audio data ES11, ES12, ES13, and ES14 of the services SV11, SV12, SV13, and SV14 are provided to the transmitter 1. The transmitter 1 converts these video/audio data ES11, ES12, ES13, and ES14 into packets for multiplexing. The transmitter 1 also generates control data for multiplexing packets. The control data for multiplexing packets are employed for discriminating correctly video/audio data of a plurality of services in packets processed by time division. Packetized and multiplexed video/audio data (Contents) are transmitted as transport streams together with control data.
0.3. Configuration of Transport Stream
As shown in FIG. 3, the transport stream TS1 generated by the transmitter of FIG. 2 comprises multiplexed video data ES (V) 1 and audio data ES (A) 1 of the service SV11, video data ES (V) 2 and audio data ES (A) 2 of the service SV12, video data ES (V) 3 and audio data ES (A) 3 of the service SV13, and video data ES (V) 4 and audio data ES (A) 4 of the service SV14.
Furthermore, control data NIT, PAT, PMT1, PMT2, PMT3, and PMT4 for packet multiplexing are multiplexed. Video/audio data of each of the multiplexed services SV11, SV12, SV13, and SV14 can be separated by the control data. Packetization is carried out as shown with a vertical line 18a of FIG. 3. That is, packetization is performed in the order of control data NIT, PAT, EIT, TDT, ECM, video data ES (V), and audio data ES (A). After packetization is completed up to the audio data ES (A), packetization is then repeated again for the control data NIT and so forth (see a vertical line 18b).
FIG. 4 shows a basic configuration of packetized data. Control data and video/audio data are made into a packet with the configuration shown in FIG. 4. A packet ID (PID) is provided on the head of the packetized data. The packet ID is a unique symbol provided for each packet to identify individual packets. The data contents are the data (control data, video/audio data, etc.) targeted for packetization.
FIG. 5 shows the relationship between the control data PAT, PMT1, PMT2, PMT3, and PMT4, and video/audio data ES of each service, in the transport stream TS1. For example, video/audio data 500 into which the service SV12 is encrypted is packetized and provided with PID 502. Referring to the figure, though one packet is schematically shown, the video/audio data 500 is time-divided and transmitted in a number of packets.
The packet ID of the video/audio data 500 of the service SV12 is described in the control data PMT2. Accordingly, the packet ID of the video/audio data 500 of the service SV12 can be known by obtaining the contents of the control data PMT2. This control data PMT2 is also packetized and provided with PID512. In the figure, though one packet is schematically shown, the control data PMT2 is also time-divided and transmitted in a number of packets.
The packet ID of the control data PMT2 is described in the control data PAT. Accordingly, the packet ID of the control data PMT2 of the service SV12 can be known by obtaining the contents of the control data PAT. This control data PAT is also packetized and provided with PID522. Incidentally, the control data PAT has the description of packet IDs of PMT1, PMT2, PMT3, and PMT4 of services SV11, SV12, SV13, and SV14, which are multiplexed in the transport stream TS1.
A transport stream has control data and video/audio data which are packetized and associated as in the foregoing. Thus, in order to identify the services multiplexed in a transport stream, the control data PAT must be obtained first. For this reason, the packet ID of the control data PAT is fixed to a predetermined value (000 in hexadecimal notation, designated hereinafter ×0000.
Incidentally, transmission parameters (such as frequency) of each of the transport streams TS1, TS2, and TS3, and kinds of services multiplexed in each of the streams are described in the control data NIT (see FIG. 6). Accordingly, it can be known in which transport stream a particular service is multiplexed, by obtaining the contents of the control data NIT. The packet ID of the control data NIT is described in the control data PAT.
0.4. Configuration of Receiver
FIG. 7 shows the outline of a receiver. A tuner 22 selects a transport stream, and a transport decoder 26 separates the video/audio data ES relating to the desired service. Incidentally, MPU 28 sets the packet ID of the video/audio data ES of the desired service to the transport decoder 26. This allows the transport decoder 26 to output the video/audio data ES of said service. In addition, in the case where the packet ID of control data is set to the transport decoder 26, the separated control data is given to the MPU 28.
Assuming that the service SV33 of the transport stream TS3 is being received, the operation to be performed in the case where the command of switching to the service SV12 of the transport stream TS1 is given to the MPU 28 is to be explained below. First, the MPU 28 controls the transport decoder (that is, by setting the packet ID of the control data NIT) to take NIT in. The description of the NIT teaches that the service SV12 desired for reception has been multiplexed in the transport stream TS1 (see FIG. 6).
Then, the MPU 28 controls the tuner 22 to receive the transport stream TS1. Moreover, the MPU 28 controls the transport decoder 26 to obtain the PAT and PMT2, obtaining the packet IDs of the video data ES (V) 2 and the audio data ES (A) 2 of the desired service SV12 (see arrows α and β of FIG. 5).
Subsequently, the MPU 28 sets these packet IDs to the transport decoder 26 to allow the transport decoder 26 to output the video data ES (V) 2 and the audio data ES (A) 2 of the desired service SV12. As mentioned above, services are switched for reception. |
Guangdong Guangya High School
Guangdong Guangya High School () is a reputed senior high school in Guangzhou, Guangdong, People's Republic of China which was founded by Zhang Zhidong, Viceroy of Liangguang on Its earliest predecessor Guangya Academy was one of the Four Academies of China in the late Qing dynasty. The name "Guangya" was chosen by Zhang Zhidong, meaning knowledgeability and integrity.
Programs and campuses
Guangya High School follows the standard Chinese secondary education system and offers a three-year senior program. Students are recruited via municipal high school admission exams. It used to offer a three-year junior program, but the program was moved in 2005 to the privately funded Guangya Experimental School, which itself was established in 2002 and is located in the immediate vicinity. A second "Guangya Experimental"-branded privately funded campus was established in Baiyun District in 2011.
In addition to the campuses in Guangzhou, Guangya High School also operates privately funded campuses in some other cities in Guangdong. An operational campus is located in Yangdong County of Yangjiang and offers both primary and secondary education. A new campus in Boluo County of Huizhou is under construction and scheduled for opening in September 2014.
School Name
21 October 1912 to August 1935: Guangdong Province First Middle School
August 1935 to October 1938: Guangdong Province "Kwong Nga" High School(廣東省立廣雅中學)
October 1938 to February 1941: Guangdong Provincial South Road temporary secondary school(廣東省立南路臨時中學)
February 1941 to 1968: Guangdong Province "Kwong Nga" High School(廣東省立廣雅中學)
1968: "Red Flag" High School.
1968 to February 1979: "Guangzhou 54st High School"
February 1979 to now: Guangdong "Guangya" High School.
History
Establishment
In a memorial to the imperial court, Zhang Zhidong stated his motivations for establishing Guangya Academy ( / , ). He wrote on the necessity of favoring scholarship and creating an educated social atmosphere in Liangguang. He also cited inadequate capacities of several existing academies for taking in students. He was granted permission to purchase () of land in northwest Guangzhou (known as Canton at that time) for the academy. Construction started on and completed a year later at a cost of of silver. The academy opened on with an annual budget of of silver. The inaugural head of the academy was Liang Dingfen, a scholar whom Zhang Zhidong frequently consulted with education issues.
Evolution
In the over 120 years of its history, Guangya High School evolved with the development of the modern history of China. Until the collapse of Qing Dynasty, Guangya Academy and its successors remained a traditional Chinese academy where Zhang Zhidong's doctrine of "Chinese learning for fundamental principles, Western learning for practical application" () was practiced. In 1912, under the rule of the newly founded Republic of China, the academy, which had stopped admitting students from Guangxi and become known as Guangdong Advanced Academy, was reorganized as Guangdong Provincial No. 1 High School and was the first high school ever established in Guangdong. The school adopted the western system of three-year junior and senior secondary education in 1922 and opened a senior department in 1924 when the first batch of junior students graduated under the new system. In 1928, educator Liang Shuming was appointed as the principal and proposed the motto "Endeavor in the Fundamentals and Pursue the Truth" (). The name "Guangya" was restored as the school was renamed Guangdong Provincial Guangya High School in 1935, then dropped in 1939 as the school moved out of Guangzhou after the city fell to the Japanese forces during the Sino-Japanese War, and restored again in 1941.
The current name "Guangdong Guangya High School" was first used in 1949 under the rule of the People's Republic of China. During the Cultural Revolution, the school was renamed Guangdong Red Flag School and later Guangdong Red Flag High School, an evident reflection of the political zealotry of the era. It was redesignated as Guangzhou No. 54 High School in 1969. The last renaming occurred in 1978. The current name was restored and has remained in use since.
Staff
The hundred-year-old school collected many elites. It has a group of teachers that meet the needs of Chuina's development in the 21st century. The school now has one expert who receives allowance from the State Council, two educational overseers of Guangdong Province, two key teachers from Guangdong Technological Education System, twelve special-class teachers and nearly a hundred leading scholars and advanced teaching specialist, which enable the school to rank among the tops in a number of famous teachers in Guangdong.
Gallery
Notes and references
Notes
References
Category:High schools in Guangdong
Category:Educational institutions established in 1888 |
Q:
Image float to the right and not have text or other elements wrap on the left
I want the logo below to align with the right of the page. I've tried adding float:right, but that causes the horizontal line to wrap around on the left. I don't want anything else occupying the vertical space.
Here is my HTML
<header >
<div>
<img style="margin-right:40px; padding-bottom:20px" src="./AddFiles/bamboo_logo.png" height="50">
<br>
<hr>
</div>
</header>
A:
You can try adding text align to the containing div: (Working jsFiddle)
<header>
<div style="text-align:right;"> <!-- add this css, images are by default inline -->
<img style="margin-right:40px; padding-bottom:20px" src="./AddFiles/bamboo_logo.png" height="50">
<br>
<hr>
</div>
</header>
|
Q:
SubmitChanges internally adds all the fields as where clause, how to get rid of it
I have a table in database with a primary key say emp_pk. Now using LINQ I am trying to perform some operations on it. When I change few properties and call,
context.SubmitChanges();
ideally the where clause should contain where emp_pk = value.
But when I review the query from SQL profiler, I see lot of conditions in where clause, which I believe are generated by LINQ engine. This is causing a major performance issue.
Can anyone please help me in this case to optimize the query?
A:
That's because optimistic concurrency check is enabled. You can turn it off per column by setting Update Check=never per column in the dbml designer
|
Stakeholder perceptions on resident-to-resident aggression: implications for prevention.
Objective Resident-to-resident aggression (RRA) in nursing homes is a matter of serious and profound concern, yet action to eliminate or mitigate RRA is hampered by a paucity of research. The aim of this study was to explore key stakeholders' knowledge and perceptions of RRA in Australian nursing homes. Methods A qualitative cross-sectional study design was used, and semistructured telephone interviews were conducted. Participants were purposively and conveniently sampled with replacement from a range of aged care, healthcare and legal professional bodies, as well as advocacy organisations. The interview contained 12 closed-ended questions and six open-ended questions about participants' knowledge, experiences, perceptions and attitudes to RRA. Participant characteristics and responses to closed-ended questions were aggregated and proportions calculated, and thematic analysis was conducted by two independent researchers using a directed content approach. Results Fifteen participants (11 females; 73.3%) in senior management positions were interviewed. All were familiar with the concept of RRA and just over half (n=8; 53.3%) had witnessed an incident. Major themes included the nature and causes of RRA and attitudes and responses to RRA. Potential causes of RRA included maladaptation to nursing home life, transfer of pre-existing issues into the nursing home environment, physical environment and staffing-related issues. RRA was commonly viewed by participants as dangerous and unpredictable or, conversely, as expected behaviour in a nursing home setting. A person-centred care approach was considered most effective for managing and responding to RRA. Conclusion The research demonstrates that understanding perceptions of RRA among key stakeholders is critical to identifying the nature and scope of the problem and to developing and implementing appropriate prevention strategies. What is known about the topic? RRA is common in nursing homes, with potentially fatal consequences for residents involved, and has serious implications for nursing home staff, managers, providers, and regulators. Despite this, the prevalence, impact, and prevention of RRA remains under-recognised and under-researched in Australia. What does this paper add? This is the first Australian study to produce qualitative findings on the knowledge and perceptions of RRA in nursing homes among key stakeholders. This paper reports on the knowledge and perceptions of individuals in senior management and policy roles in aged care and related fields in relation to four themes: nature; causes; attitudes; and responses to RRA. Our findings highlight the complex and multifactorial nature of RRA. What are the implications for practitioners? A movement towards person-centred care that promotes understanding of individual care needs is favoured as an approach to reducing RRA. Increased reporting of both minor and major incidents of RRA will help to identify patterns and inform appropriate responses. However, a cultural shift is first required to recognise RRA as a manageable and preventable health care and adult safeguarding issue. |
“I think that measuring with precision human activity on the climate is something very challenging to do and there’s tremendous disagreement about the degree of impact, so no, I would not agree that it’s a primary contributor to the global warming that we see,” he told CNBC. “We need to continue the debate and continue the review and the analysis.”
The majority of the scientific community agrees with the finding that humans are the primary cause of global warming. And as NASA puts it, carbon dioxide emissions are “the most important long-lived ‘forcing’ of climate change.” Scientists at the United Nations have warned that the planet will be in dire straits if nations don’t dramatically decrease their carbon emissions. So it’s problematic that the man in charge of U.S. environmental regulations doesn’t think his agency should focus on working toward that goal.
This isn’t the first time that Pruitt, who sued the EPA over a dozen times before becoming its administrator, has broken with the scientific community. He’s also said he doesn’t believe humans are the primary cause of climate change and once expressed doubt that mercury pollution is dangerous.
EPA Chief Scott Pruitt Disagrees With Science On Another Major Climate Change Issue
2017 Scenes From Congress & Capitol Hill
2017 Scenes From Congress & Capitol Hill
1/ 88
Taking Security Seriously
Sen. Richard Blumenthal (D-Conn.) talks with Sen. Elizabeth Warren (D-Mass.) before the start of a Senate Armed Services Committee hearing concerning the roles and responsibilities for defending the nation against cyberattacks, on Oct. 19, 2017. |
Pay Attention To These Super Bowl Suggestions
And so it has been settled, and the match-up has been made.In Green Bay or in Pittsburgh there will be a big parade…While in New York and in Seattle, in New England, too,And in Chicago's howling winds and elsewhere things are blue.
But long before the issue can be settled on the field,Where one team will prevail as their opponents strive but yield,We'll hear a lot of guessing masquerading as real thought…A lot of quote "analysis," the best that can be boughtFrom guys who used to play the game, and guys who never did,And from some guy who's built a new computer, some young kidWho's fed in the statistics and the weather and the stars,And what the players eat each day and where they buy their cars,And what their biorhythms say about their motivations…And where they've come from, too: which states, which cities, and which nations.They'll factor in the coaches and the cheerleaders, as well,The colors of the uniforms, and how the players gelNot only on the field but in the clubhouse, as a group,These analysts will tell you they have surely got the scoop.
From now until the Super Bowl can actually transpire,The volume of this nonsense will soar high and even higher,Until a nation's fans in unison will shout the sameSad cry in desperation: Lordy, give us, please, the game.
Against the coming hot air blast and loud and louder prattle,I freely state I thought the Saints would bury poor Seattle.I thought the Pats would cool the Jets off. I was wrong again.So since there is no reason you should listen to me whenI offer a prediction for the Super Bowl this year…No matter now how hard you listen, you will never hearA guess disguised as a conclusion reached through careful study.For games are played because we don't know how they'll end up, buddy,And Super Bowl or sandlot tilt or race from "A" to "B,"No analyst can know what we sort of games we're going to see.But they will shout and argue even so, and my intentionIs to suggest that we need not pay very much attention.
This program aired on January 26, 2011. The audio for this program is not available. |
Piggybacking
Piggyback, piggy-back, or piggybacking may mean:
Transport
Piggyback (transportation), something that is riding on the back of something else
Art, entertainment, and media
Splash cymbal piggybacking, mounting a cymbal on top of an already stand-mounted cymbal
"Piggyback" (song), 2017 song by Melanie Martinez
Business, finance, and law
Piggy-back (law), shareholder selling rights
Piggybacking, a practice in which a person with bad credit uses the seasoned tradeline of credit of someone else
Electronics
Piggyback board, a daughterboard
Healthcare
Piggybacking, a second infusion set onto the same intravenous line using a Y-Set (intravenous therapy)
"Piggy-back technique", is a technique in liver transplantation in which the recipient inferior vena cava is preserved.
Vision Correction: The wearing of zero- or very-low-strength soft (daily disposable) contact lenses behind hard lenses if the hard lenses alone are uncomfortable or damaging to the cornea.
Science
Piggyback plant, Tolmiea menziesii
Piggybacking, technique used in astrophotography
PiggyBac transposon system, a type of transposable DNA element
Security
Piggybacking (security), when an authorized person allows (intentionally or unintentionally) others to pass through a secure door when they enter.
Telecommunications
Piggybacking (data transmission), a bi-directional data transmission technique in network layer, sending data along with ACK called Piggybacking
Piggybacking (Internet access), obtaining wireless access by bringing one's own computer within the range of another subscriber's service |
---
abstract: 'Ferroelectric relaxors are complex materials with distinct properties. The understanding of their dielectric susceptibility, which strongly depends on both temperature and probing frequency, have interested researchers for many years. Here we report a macroscopic and phenomenological approach based on statistical modeling to investigate and better understand how the dielectric response of a relaxor depends on temperature. Employing the Maxwell-Boltzmann distribution and considering temperature dependent dipolar orientational polarizability, we propose a minimum statistical model and specific equations to understand and fit numerical and experimental dielectric responses versus temperature. We show that the proposed formula can successfully fit the dielectric response of typical relaxors, including Ba(Zr,Ti)O$_{3}$, Pb(Zn$_{1/3}$Nb$_{2/3}$)$_{0.87}$Ti$_{0.13}$O$_{3}$, and Pb(Mg$_{1/3}$Nb$_{2/3}$)O$_{3}$-0.05Pb(Zr$_{0.53}$Ti$_{0.47}$)O$_{3}$, which demonstrates the general applicability of this approach.'
author:
- 'J. Liu'
- 'F. Li'
- 'Y. Zeng'
- 'Z. Jiang'
- 'D. Wang'
- 'Z.-G. Ye'
- 'C.-L. Jia'
title: Insight into dielectric response of ferroelectric relaxors by statistical modeling
---
Introduction
============
Relaxor ferroelectrics are materials that exhibit interesting dielectric responses different from normal ferroelectrics. For instance, they often possess relaxation modes at low frequency ($<1$GHz). Relaxors ferroelectrics have been exploited in many applications such as actuators due to their giant electromechanical couplings [@Uchino1996], and their properties extensively investigated, including structural properties (e.g., polar nanoregions or PNRs) using neutron scattering [@PhononLocalization], dielectric responses [@Bokov2006a; @Nuzhnyy2012; @Petzelt2014; @Kleeman2014; @Wang2014; @Wang2016], the crossover from ferroelectrics to relaxor [@Kleeman2014]. To understand such systems, many theories have been proposed [@Pirc1999; @Bokov2012; @Akbarzadeh2012; @Sherrington2013a; @Uchino2014; @Sherrington2014; @PhononLocalization; @Kleemann2015]. Relaxors are complex systems, to some extent similar to spin glasses [@Sherrington2013a; @Sherrington2014a; @Sherrington2014], in that their compositions are, without exception, made of complex oxides containing different ions and inevitably inhomogeneous. For instance, the B-site ions of typical relaxors Ba(Zr,Ti)O$_{3}$ (BZT) and Pb(Mg$_{1/3}$Nb$_{2/3}$)O$_{3}$(PMN) are randomly distributed.
The dielectric response of ferroelectric relaxors is the defining feature that differentiates them from normal ferroelectrics: (i) large susceptibilities at low frequency (GHz or lower) ; (ii) even more unusual, the characteristic temperature $T_{m}$, at which the susceptibility peaks strongly depends on the frequency of the probing *ac* electric field. In other words, the susceptibility, $\\chi$, depends on both temperature, $T$, and the probing frequency, $\\nu$. While such phenomena are well known experimentally [@Bokov2007BZT; @Bokov2012; @Gridnev2004; @Bokovo2006; @BZT-susceptibility; @Tagantsev1999; @PMN-BZT], numerical generation of relaxor’s dielectric response from model-based simulations has been a challenging work. For instance, the shift of $T_{m}$ of the lead free relaxor BZT was only numerically achieved recently[@Wang2016]. Since numerous ferroelectric relaxors exist, numerically treating each of them remains a daunting task. One way to mitigate this difficulty is to resort to statistical modeling [@Sethna2010]. For a complex system, a statistical approach can provide intuitive understanding by capturing dominant factors, provide equations to understand experimental results. and help extracting useful information. In the present work, we adopt this approach to treat the dielectric response of relaxors and show that such a statistical model can indeed be applied to understanding how the dielectric constants change with temperatures and probing frequency.
While the susceptibility of relaxors, $\\chi\\left(T,\\nu\\right)$, depends on both temperature and frequency, theoretical models are often proposed to treat $\\nu$ and $T$ separately [@Uchino2014; @Bokov2012; @Cross1987a; @UniversalRelaxation; @DielRelaxSolids; @Nuzhnyy2012]. For instance, at a given temperature, two processes are employed in the fitting of $\\chi\\left(\\nu\\right)$ of Ba (Ti$_{0.675}$Zr$_{0.325}$ )O$_{3}$: the universal relaxor process and the conventional relaxor process, which have different relaxation characteristics employing the Curie-Von Schweidler law at low frequency and the Kohlrausch-Williams-Watts law at higher frequency [@Bokov2007BZT]. Other formula, such as the Cole-Cole and the Havriliak-Negami equations, are also employed to model the dielectric response with respect to frequency at given temperatures. When phonon modes are close or interacting with the relaxation modes, it becomes necessary to use coupled modes to model the dielectric response [@Wang2014; @Wang2016]. On the other hand, there are also many investigations on how the dielectric response, $\\chi$, depends on the temperature, $T$, at given frequencies. In addition to the well known Curie law for $\\chi\\left(T\\right)$ at high temperature, most useful equation for fitting around the dielectric peak appears to be the square law. In particular, the formula $$\\begin{aligned}
\\frac{1}{\\varepsilon\\left(T\\right)}= & \\frac{1}{\\varepsilon_{A}}+\\frac{\\left(T-T_{A}\\right)^{^{\\eta}}}{B}\\label{eq:square-law}\\end{aligned}$$ was proposed to describe the permittivity at $T>T_{m}$ [@Smolenskii1970; @Kirillov1973]. Initially, $\\eta$ was found to be 2, but later was shown to be between 1 and 2 [@Clarke1974; @Uchino1982; @Santos2001; @Bokov2006a; @Bokov2012]. Here, we further the investigation in this direction and attempt to address some important questions regarding relaxor behaviors. We will explain why the dielectric constant has a peak value at $T_{m}$, and what causes the asymmetry around the peak. Moreover, by constructing a statistical model that properly describes how dipoles behave in relaxors, we propose formula to fit experimental results, which further illuminates the physics behind relaxation behavior.
This paper is organized as the follows. In Sec. \\[sec:Statistical-modeling\\], we introduce the statistical model. In Sec. \\[sec:Results\\], we apply this model to both lead-free and lead-based relaxors. In Sec. \\[subsec:Discussion\\], we discuss the implication and limitation of this approach. Finally, in Sec. \\[sec:Conclusion\\], we present a brief conclusion.
Statistical modeling\\[sec:Statistical-modeling\\]
================================================
The statistical model starts by considering a critical difference between ferroelectric relaxors and normal ferroelectrics. One crucial observation is that all relaxor ferroelectrics discovered so far are inevitably disordered and inhomogeneous systems. For instance, in BZT Zr and Ti ions are distributed randomly, so are the Mg and Nb ions in PMN, when the samples are treated macroscopically. In addition, PMN possesses the electric field arising from heterovalent Mg and Nb ions, which affects dipole distribution. It is important to further note that well known relaxors can become non-relaxor if their ions are perfectly ordered [@Setter1980; @Bokov1984; @WangJAD].
Individual dipoles
------------------
The randomness of ions and the ensuing lack of long-range correlation has the important consequence that phonon modes may not be the best description to understand relaxor. This fact is evidenced by the effective Hamiltonian that describes the BZT relaxor [@Akbarzadeh2012; @Sherrington2013a; @Sherrington2014] $$\\begin{aligned}
E= & \\sum_{i}\\left(\\kappa_{i}\\left|u_{i}\\right|^{2}+\\lambda_{i}\\left|u_{i}\\right|^{4}\\right)+\\dots,\\label{eq:effHBZT}\\end{aligned}$$ where $i$ labels the sites occupied randomly by Zr or Ti, and $\\kappa_{i}$ ($\\lambda_{i}$) are the second (fourth) order coefficients in the Taylor expansion of energy with respect to $u_{i}$, which is the local dipole on site $i$. For a homogeneous system, where $k_{i}$ and $\\lambda_{i}$ are constants, we can usually first consider the harmonic term and construct phonon modes, which are then used to describe the system, especially in low temperature when the system condense to particular phonon modes [@CondenedPhononMode]. In contrast, with the loss of periodicity in relaxors, this approach is no longer profitable. One can insist on using averaged atoms (e.g., replacing Zr and Ti atoms with their average in BZT) to retain the use of phonon modes. However, it is then necessary to consider defect-pinned intrinsic localized modes [@PinnedPhonon] and phonon localization [@PhononLocalization].
The inhomogeneity also has important consequences on ferroelectric phase transitions. In the typical ferroelectric material BaTiO$_{3}$, we may ascribe the temperature-driven phase transition to the condense of phonons to a particular phonon mode [@CondenedPhononMode]. At high temperature, many phonons modes are occupied (occupancy obeying the Bose-Einstein distribution); at low temperatures, due to mode softening, certain mode (often corresponding to the well-known in perovskites) has essentially zero energy, which dominates the system and induce phase transitions. Unlike BaTiO$_{3}$, there is no global phase transition due to the existence of PNRs and/or random electric fields, which eliminates the mode softening phenomenon and renders a global dipole pattern difficult to achieve [@Akbarzadeh2012; @PMNeffHami2015]. In addition, relaxors exhibit strange phonon behavior, such as the “waterfall” effect [@Gehring2000; @Hlinka2003; @PMNWaterFall] and the localization[@PhononLocalization], further showing their difference from normal ferroelectrics. In this work, we focus on individual dipoles and statistically model their dielectric response. This change of view point implies that phonon modes are less important in our analysis. We will show in the following that such change leads to fruitful results, and better understanding of relaxors.
Statistics of individual dipoles
--------------------------------
Individual dipoles can be categorized into different groups based on their dynamics, and each group shall have different contribution to susceptibility. We proceed simplify the interaction between dipoles, assuming that the interaction effectively introduce a potential well of *average* depth, $E_{b}$. We may relate $E_{b}$ to the size of PNRs arising from the clustering of same-type ions [@Akbarzadeh2012] and/or random electric field caused by heterovalent ions [@PMNeffHami2015; @Kleemann2014; @PMNWaterFall].
Since the kinetic energy of individual dipoles obeys the Maxwell-Boltzmann distribution, at temperature $T$, the number of dipoles with kinetic energy $E_{\\textrm{kin}}$ is given by $$\\begin{aligned}
f\\left(E_{\\textrm{kin}}\\right)= & 2N\\sqrt{\\frac{E_{\\textrm{kin}}}{\\pi}}\\left(\\frac{1}{k_{B}T}\\right)^{3/2}\\exp\\left(-\\frac{E_{\\textrm{kin}}}{k_{B}T}\\right),\\label{eq:kinetic-energy}\\end{aligned}$$ where $k_{B}$ is the Boltzmann constant, $N$ is the total number of dipoles, and $f\\left(E_{\\textrm{kin}}\\right)dE_{\\textrm{kin}}$ is the number of dipoles having a kinetic energy between $E_{\\textrm{kin}}$ and $E_{\\textrm{kin}}+dE_{\\textrm{kin}}$. With this distribution function, we can calculate the number of dipoles with kinetic energy that exceeds the potential well $E_{b}$, which is given by $$\\begin{aligned}
N_{1}\\left(E_{b},T\\right) & =\\int_{E_{b}}^{\\infty}dE_{\\textrm{kin}}f\\left(E_{\\textrm{kin}}\\right)\\nonumber \\\\
= & N\\sqrt{\\frac{4}{\\pi}}\\sqrt{\\frac{E_{b}}{k_{B}T}}\\exp\\left(-\\frac{E_{b}}{k_{B}T}\\right)+N\\text{erfc}\\left(\\sqrt{\\frac{E_{b}}{k_{B}T}}\\right),\\label{eq:particles-above-well}\\end{aligned}$$ where erfc is the complementary error function. The number of dipoles confined to the potential well is then given by $$\\begin{aligned}
N_{2}\\left(E_{b},T\\right)= & N-N_{1}\\left(E_{b},T\\right).\\label{eq:particles-inside-well}\\end{aligned}$$
The next step is to treat the two sets of dipoles ($N_{1}$ versus $N_{2}$) separately, assigning different susceptibility to them. The total susceptibility is then given by $$\\begin{aligned}
\\chi(T,\\nu)= & \\chi_{1}\\left(T,\\nu\\right)P_{1}\\left(E_{b},T\\right)+\\chi_{2}\\left(T,\\nu\\right)P_{2}\\left(E_{b},T\\right),\\label{eq:total-susceptibility}\\end{aligned}$$ where $\\chi_{1}\\left(T,\\nu\\right)$ and $\\chi_{2}\\left(T,\\nu\\right)$ describes the dielectric responses of each dipole group, whose form will be specified later. We also define $$\\begin{aligned}
P_{1}\\left(E_{b},T\\right)\\equiv & \\frac{1}{N}N_{1}\\left(E_{b},T\\right),\\\\
P_{2}\\left(E_{b},T\\right)\\equiv & \\frac{1}{N}N_{2}\\left(E_{b},T\\right),\\end{aligned}$$ to normalize the dipoles to unit volume. Equation (\\[eq:total-susceptibility\\]) is the centerpiece of this work and will be demonstrated to be useful for investigation of various relaxors.
Results \\[sec:Results\\]
=======================
We now apply Eq. (\\[eq:total-susceptibility\\]) to fit various $\\chi$ versus $T$ obtained experimentally or numerically. The relaxors shown here include both lead-basd (e.g., PMN) and lead-free relaxors (e.g., BZT).
Susceptibility of BZT \\[sec:lead-free-relaxor\\]
-----------------------------------------------
For the static susceptibility of lead-free relaxor BZT[@BZT-susceptibility; @Prosandeev; @dielectric-susceptibility; @Petzelt2014; @Wang2016], we assume (i) dipoles with kinetic energy that overcomes potential well can be treated as free dipoles, subject only to thermal excitation; (ii) dipoles inside the potential well only contribute a constant susceptibility, $\\chi_{2}$. The total susceptibility is thus given by $$\\begin{aligned}
\\chi(T)= & \\chi_{1}\\mathcal{L}\\left(\\frac{\\theta}{T}\\right)P_{1}\\left(E_{b},T\\right)+\\chi_{2}P_{2}\\left(E_{b},T\\right)\\label{eq:BZT-susceptibility}\\end{aligned}$$ where $\\mathcal{L}\\left(x\\right)=\\coth\\left(x\\right)-1/x$ is the Langevin function, known for depicting orientational polarization under thermal fluctuations [@Kasap2006; @CurieLaw]. $E_{b}$, $\\chi_{1}$, $\\chi_{2}$ and $\\theta$ are constants, which will be determined by fitting experimental or numerical data. It can be inferred from equation \\[eq:BZT-susceptibility\\] that $\\chi_{1}$ is the susceptibility of the material at zero Kevin, $\\chi_{1}\\mathcal{L}\\left(\\frac{\\theta}{T}\\right)$ is essentially the Curie law at high temperature, and $\\theta$ is proportional to the magnitude of the low-frequency electric field used in experimental measurements.
![Fitting the static susceptibility of Ba(Zr$_{0.5}$,Ti$_{0.5}$)O$_{3}$ obtained from Monte-Carlo simulation using Eq. (\\[eq:BZT-susceptibility\\]). The blue dots are from Monte-Carlo simulation [@Akbarzadeh2012] and the red solid line is the fitting curve using Eq. (\\[eq:BZT-susceptibility\\]). \\[fig:Fitting-susceptibility-of\\]](Fig1){width="8cm"}
We first test Eq. (\\[eq:BZT-susceptibility\\]) against the static susceptibility versus temperature obtained with Monte-Carlo (MC) simulation in a previous work [@Akbarzadeh2012]. \\[fig:Fitting-susceptibility-of\\] shows the overall fitting is good enough to reproduce results from MC simulations with parameters shown in and Tab. \\[tab:parameters-BZT-static\\]. The closeness of $E_{b}$ and $T_{m}$ indicates the average depth of potential wells plays a dominant role in determining $T_{m}$. Close examination of Fig. \\[fig:Fitting-susceptibility-of\\] also indicates the fitting at the lowest temperature ($\\lesssim25$ K) is not as good as the rest. To address this issue, we tried adding a Gaussian distribution to $E_{b}$ and remedied the minor problem. However, the resulting equation is quite complicated and deviates from our original goal of proposing simple analytical formula to fit susceptibility. Therefore this additional step is not adopted here.
$\\chi_{1}$ $\\theta$ (K) $\\chi_{2}$ $E_{b}$ (K)
-------- ------------ -------------- ------------ -------------
Values 741.6 220.5 64.7 159.1
: Fitting parameters for the Ba(Zr$_{0.5}$,Ti$_{0.5}$)O$_{3}$ static susceptibility. \\[tab:parameters-BZT-static\\]
![Maxwell-Boltzmann distribution [\\[]{}Panel (a)[\\]]{} and the Langevin function, $\\mathcal{L}$, [\\[]{}Panel (b)[\\]]{} versus temperature. Parameters from Tab. \\[tab:parameters-BZT-static\\] are used in plot each function. \\[fig:components\\]](Fig_0){width="6cm"}
In order to have a good understanding of BZT’s susceptibility, we show each component of Eq. (\\[eq:BZT-susceptibility\\]) in Fig. \\[fig:components\\]. Figure \\[fig:components\\] (a) shows that $P_{1}\\left(E_{b},T\\right)$ and $P_{2}\\left(E_{b},T\\right)$ have opposite trends as temperature increases. The number of dipoles that can overcome the potential confinement ($P_{1}$) steadily increases with temperature, while the number of dipoles inside ($P_{2}$) continuously becomes smaller. Figure \\[fig:components\\] (b) shows that the Lagevin function is normalized at $T=0$, and decreases with temperature. Such a feature describes the ability of the free dipoles to respond to an external *dc* electric field. Moreover, Fig. \\[fig:components\\] (b) also shows the product of the Langevin function and $P_{1}$, which already exhibits some resemblance to BZT’s susceptibility [\\[]{}Fig. (\\[fig:Fitting-susceptibility-of\\])[\\]]{}.
![Fitting the susceptibility of Ba(Zr$_{0.5}$,Ti$_{0.5}$)O$_{3}$ at $f=1,10,100,100$ GHz, obtained from molecular dynamics simulation using Eq. (\\[eq:BZT-frequency\\]).\\[fig:Fitting-BZT-frequency\\]](Fig2){width="8cm"}
Having examined the static susceptibility, we now move to the frequency-dependent dielectric response, which is often taken as a characteristic property of relaxors [@Kleeman2014; @Sommer]. We propose another equation to fit the susceptibility versus temperature:
$$\\begin{aligned}
\\chi\\left(T\\right)= & \\frac{\\chi_{1}}{1+b\\exp\\left(-\\theta/T\\right)}P\\left(E_{b},T\\right)+\\chi_{2}\\left[1-P\\left(E_{b},T\\right)\\right],\\label{eq:BZT-frequency}\\end{aligned}$$
where $\\chi_{1}$ , $\\chi_{2}$, $b$ and $\\theta$ are constants at a given frequency (but may change when the frequency changes). The dielectric contribution from dipoles with kinetic energy higher than the potential well is given by $$\\begin{aligned}
w_{1}\\left(T\\right)= & \\frac{1}{1+b\\exp\\left(-\\theta/T\\right)}.\\label{eq:h1T}\\end{aligned}$$ which, similar to the Langevin function, monotonically decreases with temperature $T$. The choice of this function reflects two considerations: (i) at very low temperature ($T$ close to 0), such dipoles shall follow the probing $ac$ electric field closely, leading $w_{1}\\left(T\\right)$ to its maximum; and (ii) at higher temperature, thermal motions of these dipoles hamper their ability to follow the *ac* electric field, leading to smaller $w_{1}\\left(T\\right)$. We will discuss this equation further in Sec. \\[subsec:Discussion\\]. With one more parameter ($b$), this function may be taken as an extension to the Langevin function.
1 GHz 10 GHz 100 GHz 1000 GHz
-------------- ------- -------- --------- ----------
$\\theta$ (K) 579.6 762.6 1128.4 2158
$\\chi_{1}$ 406.5 312.6 209.3 99.9
$\\chi_{2}$ 73.1 63.5 56.2 57.9
$b$ 10.2 9.9 9.5 7.7
: Fitting parameters of numerically simulated Ba(Zr$_{0.5}$,Ti$_{0.5}$)O$_{3}$ susceptibility at various frequency [@Wang2016] using Eq. (\\[eq:BZT-frequency\\]). \\[tab:Fitting-parameters-of-BZT\\]
![Analysis of fitting parameters versus probing frequency. (a) $\\chi_{1}$vs $\\log\\left(f\\right)$; (b) $w_{1}\\left(T\\right)$. \\[fig:w1T\\]](Fig3_ab){width="8cm"}
We use Eq. (\\[eq:BZT-frequency\\]) to fit BZT’s susceptibility versus temperature at different frequency and show the results in Fig. \\[fig:Fitting-BZT-frequency\\]. Since $E_{b}$ is a material parameter, we use the same value ($E_{b}=159.1$ K) obtained by fitting the static susceptibility (cf. Fig. \\[fig:Fitting-susceptibility-of\\]). In Fig. \\[fig:Fitting-BZT-frequency\\], the numerical results are obtained from molecular dynamics simulations reported in Ref. [@Wang2016]. As the figure shows, satisfactory fittings are achieved for frequencies between 1 and 1000 GHz. Table \\[tab:Fitting-parameters-of-BZT\\] shows all the parameters. Among them, $\\theta_{1}$ and $\\chi_{1}$ have substantial changes over the specified frequency range as shown in Fig \\[fig:w1T\\](a). Figures \\[fig:w1T\\] (a) shows that $\\theta$ depends on $\\log\\left(f\\right)$ quadratically while $\\chi_{1}$ linearly depends on it, and Fig. \\[fig:w1T\\](b) shows $w_{1}\\left(T\\right)$. At low frequency ($\\lesssim10$ GHz), $w_{1}\\left(T\\right)$ resembles the Fermi-Dirac function, that is, below$\\sim250$ K, its value is close to one but becomes close zero for $T$ above $\\sim250$ K. At a higher frequency (e.g., 1000 GHz), however, this function strongly deviates from the Fermi-Dirac function, with a long tail extending to high temperature.
![Experimental susceptibility of Ba(Ti$_{0.675}$Zr$_{0.325}$)O$_{3}$ ceramics versus temperature fitted with Eq. (\\[eq:BZT-frequency\\]). \\[fig:real-bzt\\]](Fig4_v2){width="6cm"}
To further verify the suitability of this equation for experimental data, we also fit the result shown in Fig. 1 of Ref. [@Bokov2007BZT], where Ba(Ti$_{0.675}$Zr$_{0.325}$)O$_{3}$ ceramics is measured at $10^{-2}$ and $10^{5}$ Hz. Figure \\[fig:real-bzt\\] shows that satisfactory fittings are achieved.
Pb-based relaxors \\[subsec:Lead-based-relaxors\\]
------------------------------------------------
Unlike the lead-free BZT, which possesses PNRs that separate dipole clusters, lead-based ferroelectrics [@Kirillov1973; @Gridnev2004; @PMNeffHami2015; @PNR-PMN] have the Pb-driven dipoles across the system [@Yk], which cause phase transitions in systems such as PbTiO$_{3}$ and Pb(Zr,Ti)O$_{3}$ [@PZTPhase; @PTOeffHam; @JiangPTOFilm-1]. Due to heterovalent ions inside, typical lead-based relaxors are subject to random electric fields, which distort the orientation of dipoles. While the precise consequence of the random field is not all clear [@Sherrington2014; @Kleemann2015], such distracting effect on dipoles appears to lead to a strongly modified phase transition with diffused and smeared peak, in sharp contrast to that of normal ferroelectrics [@Pirc2007; @PMNeffHami2015].
To model such a system and account for the moderate phase transition, we need a function that properly describes the dielectric constant versus temperature. Here, we propose to use the slightly modified well known quadratic relation $\\frac{\\varepsilon_{A}}{\\varepsilon^{\\prime}}-1=\\frac{\\left(T-T_{A}\\right)^{2}}{2\\delta^{2}}$ proposed by Bokov *et al* [@Bokov2006a] to relate relaxor’s permittivity to temperature [@Smolenskii1970; @Kirillov1973] for dipoles above the average potential well (also see Eq. (\\[eq:square-law\\]) ). This equation can be rearranged to give the following expression $$\\begin{aligned}
w_{2}\\left(T\\right)= & \\frac{1}{1+\\left|\\frac{T-T_{O}}{\\theta}\\right|^{\\gamma}},\\label{eq:w2t}\\end{aligned}$$ where $\\gamma$ is a critical exponent, $T_{o}$ is associated with the peak position of the moderate phase transition, $\\theta$ and $\\gamma$ are parameters describing the peak. We note that such choice of $w_{2}\\left(T\\right)$ also agree with the analysis recently given by Uchino [@Uchino2014]. Combining Eqs. (\\[eq:total-susceptibility\\]) and (\\[eq:w2t\\]), we obtain the following equation to fit lead-based relaxors, $$\\begin{aligned}
\\chi\\left(T\\right)= & \\frac{\\chi_{1}}{1+\\left|\\frac{T-T_{O}}{\\theta}\\right|^{\\gamma}}P\\left(E_{b},T\\right)+\\chi_{2}\\left[1-P\\left(E_{b},T\\right)\\right],\\label{eq:PZN}\\end{aligned}$$ where $E_{b}$, $\\chi_{1}$, $\\chi_{2}$, $T_{o}$, $\\theta$, and $\\gamma$ are fitting parameters. The meaning of $\\chi_{1}$, $\\chi_{2}$, and $E_{b}$ are the same as discussed in Sec. \\[sec:lead-free-relaxor\\].
![Fitting the relative permittivity of PZN-0.13PT at $f=1,10,100$ kHz using Eq. (\\[eq:PZN\\]). Note the abnormal decrease in the range below $\\sim250$ K. The second panel is $w_{2}\\left(T\\right)$. \\[fig:PZN-relaxor\\]](Fig5_v2){width="6cm"}
To verify that Eq. (\\[eq:PZN\\]) indeed works, we experimentally obtained the permittivity of Pb(Zn$_{1/3}$Nb$_{2/3}$)$_{0.87}$Ti$_{0.13}$O$_{3}$ (PZN-0.13PT) versus temperature at frequencies $f=1,10,100$ kHz. As Fig. \\[fig:PZN-relaxor\\](a) shows, all three fittings are satisfactory. With Eq. (\\[eq:PZN\\]) and the fittings, we are able to single out $w_{2}\\left(T\\right)$, which shows a slight increase of the peak temperature ($T_{o}$, around $220$ K) with frequency [\\[]{}Fig. \\[fig:PZN-relaxor\\](b)[\\]]{}. We note that in this fitting there is no need to have two $\\gamma$ values above and below $T_{o}$ [@Uchino2014]. The asymmetric peak shown in Fig. \\[fig:PZN-relaxor\\](a) is naturally caused by the Maxwell-Boltzmann distribution function.
1 kHz 10 kHz 100 kHz
----------------- -------- -------- ---------
$\\gamma$ 2.02 1.82 1.63
$T_{O}$ (K) 219.6 229.0 240.6
$E_{b}$ (K) 22.3 22.9 23.5
$\\chi_{1}$ [^1] 56601 55781 53529
$\\chi_{2}$ 1320.9 1284.2 1238.0
$\\theta$ (K) 102.4 103.1 104.5
: Fitting parameters of PZN-0.13PT’s permittivity measured at different frequencies. As the table demonstrates, $\\gamma$ and $T_{C}$ are the most important variable that changes a lot with frequency. \\[tab:Fitting-parameters-of-PZN\\]
Table \\[tab:Fitting-parameters-of-PZN\\] summarizes fitting parameters of the permittivity measured at various frequencies. Among all the parameters, the critical component $\\gamma$ changes most (19.3% from 1 kHz to 100 kHz), and decreases with increasing frequency; similarly, $T_{O}$ also changes by 9.5%. On the other hand, $E_{b}$, $\\chi_{1}$, $\\chi_{2}$, $\\theta$ are relatively constant, which are independent of the frequency, and may be taken as material parameters. Such results hints towards the following formula that describes the dependence of PZN-0.13PT on both temperature and the probing frequency $$\\begin{aligned}
\\chi\\left(T,\\nu\\right)= & \\frac{\\chi_{1}}{1+\\left|\\frac{T-T_{O}\\left(\\nu\\right)}{\\theta}\\right|^{\\gamma\\left(\\nu\\right)}}P\\left(E_{b},T\\right)+\\chi_{2}\\left[1-P\\left(E_{b},T\\right)\\right],\\label{eq:PZN-1}\\end{aligned}$$ where the two functions $T_{O}\\left(\\nu\\right)$ and $\\gamma\\left(\\nu\\right)$ are frequency dependent while other parameters are constants for a given material. It is also worth noting that for PZN-0.13PT $\\chi_{2}\\ll\\chi_{1}$, which indicates that dipoles with kinetic energy above the potential well play a more important role, in contrast to the case of BZT (see Tab. \\[tab:Fitting-parameters-of-BZT\\]).
![Fitting the relative permittivity of Pb(Mg$_{1/3}$Nb$_{2/3}$)O$_{3}$-0.05Pb(Zr$_{0.53}$Ti$_{0.47}$)O$_{3}$ measured at $800$ Hz using Eq. (\\[eq:PZN\\]). The second panel is $w_{2}\\left(T\\right)$. \\[fig:PMN-PZT\\]](Fig6_new_v3){width="6cm"}
To further verify the proposed formula, we also fit the permittivity versus temperature of another lead-based relaxor, Pb(Mg$_{1/3}$Nb$_{2/3}$)O$_{3}$-0.05Pb(Zr$_{0.53}$Ti$_{0.47}$)O$_{3}$ [@Gridnev2004]. It can be seen from Fig. \\[fig:PMN-PZT\\](a) that the overall fitting is satisfactory. Figure \\[fig:PMN-PZT\\](b) shows $w_{2}\\left(T\\right)$ with fitting parameters $\\gamma=1.66$ and $T_{O}=256.7$ K. Similar to the PZN-0.13PT case, the results here also shows $\\chi_{2}\\ll\\chi_{1}$.
Discussion\\[subsec:Discussion\\]
===============================
In the statistical model we divide the dipoles inside ferroelectrics relaxors into two groups, one group being confined in potential wells, while the other having can overcome the potential confinement and exhibiting a more vibrant dynamics. It has been demonstrated that the Maxwell-Boltzmann distribution plays a significant role in determining the profile of $\\chi\\left(T\\right)$. To address a particular type of relaxor, one may only need to adjust the dielectric response function associated with each group of dipoles, while keeping the rest unchanged. In this section, we discuss a few issues of this approach and its limitations.
Characteristic temperature $T_{m}$
----------------------------------
The present analysis helps us to understand why the susceptibility of a relaxor reaches its peak value at some temperature, $T_{m}$. For BZT, the function $\\chi_{1}\\mathcal{L}\\left(\\frac{\\theta}{T}\\right)$ [\\[]{}see Eq. (\\[eq:BZT-susceptibility\\]) and Fig. \\[fig:components\\][\\]]{} or $\\chi_{1}/\\left[1+b\\exp\\left(-\\theta/T\\right)\\right]$ [\\[]{}see Eq. (\\[eq:BZT-frequency\\])[\\]]{} describes the contribution to susceptibility from dipoles with kinetic energy higher than $E_{b}$. These two functions are both monotonically decreasing with $T$, reflecting the fact that thermal motions prevent dipoles from aligning with the applied electric field. On the other hand, the number of dipoles above potential wells increases with $T$ as governed by the function $P\\left(E_{b},T\\right)$ (see Fig. \\[fig:components\\]). The combined effects of the two factors give rise to the susceptibility peak at $T_{m}$. However, the situation for lead-based relaxors is different. The function $\\chi_{1}/\\left(1+\\left|\\frac{T-T_{O}}{\\theta}\\right|^{\\gamma}\\right)$ [\\[]{}see Eq. (\\[eq:PZN\\])[\\]]{}, which largely determines the value of $T_{m}$, manifests the vestige of a true phase transition in normal ferroelectrics, which is torn down by random electric fields and/or PNRs in relaxors.
Rationale for Eq. (\\[eq:h1T\\])
------------------------------
![The energy well for dipoles is shifted and lowered when an electric field is applied .\\[fig:falling\\]](Fig7){width="8cm"}
For lead-free BZT, we propose Eq. \\[eq:h1T\\] to describe the susceptibility of dipoles with kinetic energy higher than $E_{b}$. This choice follows the Debye relaxation, i.e., $\\chi\\sim1/\\left(1+\\omega^{2}\\tau^{2}\\right)$ [@Kasap2006], where $\\omega$ is a constant (the probing frequency), and $\\tau$ is temperature-dependent relaxation time. For a thermally activated process, the relation between $\\tau$ and $T$ is often specified by the Arrhenius law, i.e., $1/\\tau=A\\exp\\left(-E_{a}/T\\right)$, where $E_{a}>0$ is the activation energy [@PinnedPhonon; @negativeActivation; @Pirc2007]. In this case, the susceptibility will be $\\chi\\sim1/\\left[1+A^{2}\\omega^{2}\\exp\\left(\\frac{2E_{a}}{T}\\right)\\right]$, which is discussed by Jonscher [@Jonscher1981]. However, the dynamic process considered here describes dipoles falling to a state of lower energy, which temporarily created by the probing electric field (see. Fig. \\[fig:falling\\]). Therefore the activation energy in this process shall be *negative*, i.e., $\\chi\\sim1/\\left[1+A^{2}\\omega^{2}\\exp\\left(-\\frac{2\\left|E_{a}\\right|}{T}\\right)\\right]$, which is the form adopted in Eq. (\\[eq:h1T\\]).
We note that negative activation energy is known in some chemical reactions [@negativeActivation]. Negative activation energy appears here because when an *ac* electric field perturbs dipoles and tilts the relative energy of potential wells, dipoles outside potential wells will move towards the temporary potential minimum. However, the drifting to the potential minimum is hindered by thermal fluctuations of such dipoles. In fact, higher temperature (corresponding to larger kinetic energy) results in a slower relaxation to the energy minimum (corresponding to larger $\\tau$), leading to negative activation energy. We also note that since the applied *ac* electric field is responsible for shifting the energy minimum and causing dipoles to drift, the change of its frequency may well alter the negative activation energy, explaining why $\\theta$ in Eq. (\\[eq:BZT-frequency\\]) is dependent on the probing frequency. Similar arguments explains why $T_{O}$ also depends on the probing frequency.
In the above analysis, we focus on dipoles with kinetic energy higher than $E_{b}$. These dipoles are able to drift from one energy minimum to another when an *ac* electric field perturbs the system. It has been proposed that the drifting/hopping of dipoles from one potential well to another causes relaxations . However, without distinguishing dipoles inside and outside the potential well, such proposal seems to have a tendency of confusing the wait time before hopping, $t$ (which reflects the distribution of dipoles at a given temperature) with the relaxation time, $\\tau$ (which reflects how fast dipoles drift to the transient energy minimum and relates to the loss peak frequency in the Debye function), leading to some difficulties.
Limitations
-----------
In previous studies [@Wang2014; @Wang2016; @PMNeffHami2015], *ab initio* calculation was used, which prescribes all important interactions between dipoles and other degrees of freedom in relaxors, and MC or MD was used to numerically work out the consequences. In the present work we do not start from *ab initio* calculation, instead, employs statistical and phenomenological arguments. Having shown results and insights obtained with this approach, we now discuss possible limitations to the present approach with respect to treatment of details, accuracy, and prediction power.
First, the proposed equations for lead-free [\\[]{}Eq. (\\[eq:BZT-frequency\\])[\\]]{} and lead-based relaxors [\\[]{}Eq. (\\[eq:PZN-1\\])[\\]]{} have five and seven parameters, respectively. Ideally, one hopes to be able to reduce this large number and use as few parameters as possible. However, it shall be noted that, among these parameters, many are only material dependent (i.e., they do not depend on frequency or temperature). For instance, for lead-free relaxor, $E_{b}$ is a constant; for lead-based relaxor, $E_{b}$, $\\chi_{1}$, $\\chi_{2}$, $\\theta$ are close to constants (see Tab. \\[tab:Fitting-parameters-of-PZN\\]). For a given sample, these parameters may only need to be calibrated once. In this way, the number of parameters will be significantly reduced.
Second, in this work we have focused on the temperature dependence of susceptibility. The dependence on frequency needs further investigation. For instance, $T_{C}\\left(\\nu\\right)$ and $\\gamma\\left(\\nu\\right)$ in Eq. (\\[eq:PZN-1\\]) need to be specified explicitly to address this issue. We note that results shown in Tab. \\[tab:Fitting-parameters-of-PZN\\] will provide clues to $T_{C}$ and $\\gamma$’s dependence on $\\nu$, and eventually help finding analytical expressions for $\\chi\\left(T,\\nu\\right)$. In addition, we generally ignored the long-range correlation of dipoles, which is another limitation to this approach. While such long-range correlation makes relaxor physics so rich, it will bring back Bose-Einstein statistics and make the current formulation more complicated. To what extent the Bose-Einstein and the Maxwell-Boltzmann distribution shall be used for ferroelectric relaxors remains an open question.
Third, at high temperature, Curie law is observed in many ferroelectrics. For the static susceptibility of BZT [\\[]{}Fig. \\[fig:Fitting-susceptibility-of\\][\\]]{}, this law can be recovered from the proposed equation, Eq. (\\[eq:BZT-susceptibility\\]). On the other hand, for Eqs. (\\[eq:BZT-frequency\\]) and (\\[eq:PZN\\]), the Curie law cannot be directly recovered. For Eq. (\\[eq:PZN\\]), we have the asymptotic relation $\\text{\\ensuremath{\\chi}}\\sim A/\\left(T-T_{C}\\right)^{\\gamma}+B/T^{3/2}$ at very large $T$. It is unclear how good this relation can fit the Curie law. Therefore, in fitting experimental data at high temperatures, one needs to bear in mind that Eqs. (\\[eq:BZT-frequency\\]) and (\\[eq:PZN\\]) should be used with care.
Finally, with Eqs. (\\[eq:BZT-susceptibility\\]) and (\\[eq:PZN\\]), in principle we can obtain the relation between $T_{m}$ and $\\nu$, which can then be compared to the well-known Vogel-Fulcher law [@Wang2016]. However, we have failed to obtain analytical expressions for $T_{m}\\left(\\nu\\right)$ and believe numerical calculation seems to be the only feasible way to establish the relation between $T_{m}$ and $\\nu$.
Conclusion\\[sec:Conclusion\\]
============================
Instead of working on the atomic level, the present work employs a macroscopic statistical approach to help understanding dielectric properties of relaxors. The effects of disorder, PNRs, and random electric fields are considered statistically by introducing the average potential well, which can trap dipoles of low kinetic energy. An external electric field will mostly increase the magnitude **** of trapped dipoles, but rotate to align dipoles free from such trapping, giving rise to two different types of dielectric responses as shown in Eqs. (\\[eq:BZT-susceptibility\\]), \\[eq:BZT-frequency\\], and (\\[eq:PZN\\]). This approach, by proposing analytical equations, provides insights to experimental and numerical results of relaxors. **** Among other things, it shows that the characteristic temperature, $T_{m}$, is determined by the Maxwell-Boltzmann distribution of dipoles’ kinetic energy, as well as their ability to respond to the applied electric field. We can also conclude that lead-free relaxors (e.g., BZT) are different from lead-based relaxors (e.g., PZN-0.13PT) in that (i) The mechanisms determining $T_{m}$ are different. For lead-based relaxors, it appears $T_{O}$ alone in able to determine $T_{m}$, while for BZT, both $w_{1}\\left(T\\right)$ and $P\\left(E_{b},T\\right)$ are important; and (ii) For BZT, $\\chi_{1}$ and $\\chi_{2}$ are on the same order, in contrast to the fact while $\\chi_{1}\\gg\\chi_{2}$ for the Pb-based relaxors, indicating that dipoles outside the average potential well dominate dielectric response of Pb-based relaxors. With these results, we hope this statistical approach can help better understanding important relaxor systems and the proposed equations be adopted in fitting experimental data.
We thank Drs C.-L. Wang, A. A. Bokov and L. Bellaiche for fruitful discussion. This work is financially supported by the National Natural Science Foundation of China (NSFC), Grant No. 51390472, 11574246, U1537210, and National Basic Research Program of China, Grant No. 2015CB654903. F.L. acknowledges NSFC Grant No. 51572214. Z.J. acknowledges the support from China Scholarship Council (CSC No. 201506280055). We also acknowledge the “111 Project of China (Grant No. B14040), the Natural Science and Engineering Council of Canada (NSERC) and the United States Office of Naval Research (ONR Grants No. N00014-12-1-1045 and N00014-16-1-3106).
urlstyle\\[1\\][doi: \\#1]{}
[Petzelt et al.(2014)Petzelt, Nuzhnyy, Savinov, Bovtun, Kempa, Ostapchuk, Hlinka, Canu, and Buscaglia]{} K. Uchino, . (Springer, 1996).
M. E. Manley, J. W. Lynn, D. L. Abernathy, E. D. Specht, O. Delaire, A. R. Bishop, R. Sahul, and J. D. Budai, Phonon localization drives polar nanoregions in a relaxor ferroelectric. *Nat. Commun.* **5**, 3683 (2014).
A. A. Bokov and Z.-G. Ye, Recent progress in relaxor ferroelectrics with perovskite structure. *J. Mater. Sci.* **41**, 31 (2006).
D. Wang, J. Hlinka, A. A. Bokov, Z. G. Ye, P. Ondrejkovic, J. Petzelt, and L. Bellaiche. Fano resonance and dipolar relaxation in lead-free relaxors. *Nat. Commun.* **5**, 5100 (2014).
D. Wang, A. A. Bokov, Z.-G. Ye, J. Hlinka, and L. Bellaiche, Subterahertz dielectric relaxation in lead-free Ba(Zr,Ti)O$_{3}$ relaxor ferroelectrics. *Nat. Commun.* **7**, 11014 (2016).
D. Nuzhnyy, J. Petzelt, and M. Savinov, Broadband dielectric response of Ba(Zr,Ti)O$_{3}$ ceramics: from incipient via relaxor and diffuse up to classical ferroelectric behavior. *Phys. Rev. B* **86**, 1, (2012).
J. Petzelt, D. Nuzhnyy, M. Savinov, V. Bovtun, M. Kempa, T. Ostapchuk, J. Hlinka, G. Canu, and V. Buscaglia, Broadband dielectric spectroscopy of Ba(Zr,Ti)O$_{3}$: dynamics of relaxors and diffuse ferroelectrics.*Ferroelectrics* **469**, 14 (2014).
W. Kleemann, S. Miga, Z. K. Xu, S. G. Lu, and J. Dec, Non-linear permittivity study of the crossover from ferroelectric to relaxor and cluster glass in BaTi$_{1-x}$Sn$_{x}$O$_{3}$. *Appl. Phys. Lett.* **104**, 182910 (2014).
K. Uchino, Fractal Phenomena in Ferroelectrics. *J. Nanotech. Mater. Sci.* **1**, 1 (2014).
A. A. Bokov and Z.-G. Ye, Dielectric relaxation in relaxor ferroelectrics. *J. Adv. Dielectr.* **2**, 1241010 (2012).
A. Akbarzadeh, S. Prosandeev, E. Walter, A. Al-Barakaty, and L. Bellaiche, Finite-temperature properties of Ba(Zr, Ti)O$_{3}$ relaxors from first principles. *Phys. Rev. Lett.* **108**, 257601 (2012).
D. Sherrington, BZT: a soft pseudospin glass. *Phys. Rev. Lett.* **111**, 227601 (2013).
D. Sherrington, Pb(Mg$_{1/3}$Nb$_{2/3}$)O$_{3}$: A minimal induced-moment soft pseudospin glass perspective. *Phys. Rev. B* **89**, 064105 (2014).
W. Kleemann, J. Dec, and S. Miga, The cluster glass route of relaxor ferroelectrics, *Phase Trans.* **88**, 234 (2015).
R. Pirc, R. Blinc, Spherical random-bond-random-field model of relaxor ferroelectrics. *Phys. Rev. B* **60**, 13470 (1999).
D. Sherrington, A spin glass perspective on ferroic glasses.*Phys. Status Solidi* **251**, 1967 (2014).
A. A. Bokov, M. Maglione, and Z.-G. Ye, Quasi-ferroelectric state in Ba (Ti$_{1-x}$Zr$_{x}$) O3 relaxor: dielectric spectroscopy evidence. *J. Phys.: Condens. Matter* **19**, 092001 (2007).
S. A. Gridnev, A. A. Glazunov, and A. N. Tsotsorin, Nonlinear dielectric response of relaxor PMN-PZT ceramics under dc electric field. *Ferroelectrics*, **307**, 151 (2004).
A. A. Bokov and Z.-G. Ye, ** Double freezing of dielectric response in relaxor Pb (Mg$_{1\\slash3}$Nb$_{2\\slash3}$)O$_{3}$ crystals. *Phys. Rev. B* **74**, 132102 (2006).
H. N. Tailor, A. A. Bokov, Z. G. Ye, **Freezing of polarization dynamics in relaxor ferroelectric (1x)Pb(Mg$_{1/3}$Nb$_{2/3}$)O$_{3}$xBi(Zn$_{1/2}$Ti$_{1/2}$)O$_{3}$ solid solution.** *Curr. Appl. Phys.* **11**, 175 (2011).
A. Dixit, S. B. Majumder, R. S. Katiyar, A. S. Bhalla, **Studies on the relaxor behavior of sol-gel derived Ba(Zr$_{x}$Ti$_{1-x}$)O$_{3}$ (0.30$\\le$x$\\le$0.70) thin films*. J. Mater. Sci.* **41**, 87 (2006).
A. K. Tagantsev, A. E. Glazounov, ** **Does freezing in Pb(Mg$_{1/3}$Nb$_{2/3}$)O$_{3}$ relaxor manifest itself in nonlinear dielectric susceptibility?** *Appl. Phys. Lett.* **74**, 1910 (1999).
J. P. Sethna, . (Clarendon Press, Oxford, 2010).
L. Cross. . *Ferroelectrics*, **76**,0241 (1987).
A. K. Josnscher, Universal relaxation law (Chelesea Dielectrics Press, 1996).
A. K. Jonscher, Dielectric relaxation in solids (Chelesea Dielectrics Press, 1983).
G. A. Smolenskii, Physical phenomena in ferroelectrics with diffused phase transition. *J. Phys. Soc. Jpn***.** **28**, 26 (1970).
V. V. Kirillov, V. A. Isupov, **Relaxation polarization of PbMg$_{1/3}$Nb$_{2/3}$O$_{3}$ (PMN)-A ferroelectric with a diffused phase transition*. Ferroelectrics*, **5**, 3 (1973).
K. Uchino, S. Nomura, Critical exponents of the dielectric constants in diffused-phase-transition crystals. *Ferroelectrics* **44**, 55 (1982).
R. Clarke and J. C. Burfoot, The diffuse phase transition in potassium strontium niobate. *Ferroelectrics*, **8**, 505 (1974).
I. A. Santos, J. A. Eiras, Phenomenological description of the diffuse phase transition in ferroelectrics. *J. Phys. Condens. Matter* **13**, 11733 (2001).
D. Wang and Z. Jiang, Dielectric response of BaZrO$_{3}$/BaTiO$_{3}$ superlattice, *J. Adv. Dielectr* **6**, 1650015 (2016).
A. A. Bokov, I. P. Raevskii, and V. G. Smotrakov, Composition, ferroelectric and antiferroelectric ordering in Pb$_{2}$InNbO$_{6}$ crystals, *Sov. Phys. Sol. Stat.* **26**,1708 (1984).
N. Setter and L. Cross, The role of B-site cation disorder in diffuse phase transition behavior of perovskite ferroelectrics. *J. Appl. Phys.* **51**, 4356 (1980).
N. Nakanishi, A. Nagasawa, Y. Murakami, Lattice stability and soft modes.****
A. Bussmann-Holder, A. R. Bishop, T. Egami, Relaxor ferroelectrics and intrinsic inhomogeneity. *Europhys. Lett*. **71**, 249 (2005).
W. Zhong, D. Vanderbilt, K. M. Rabe, Phase Transitions in BaTiO$_{3}$ from First Principles. Phys. Rev. Lett. **73**, 1861 (1994).
****
R. A. Cowley, Structural phase transitions I. Landau theory. *Adv. Phys.* **29**, 1-110 (1980).
A. Al-Barakaty, S. Prosandeev, D. Wang, B. Dhkil, and L. Bellaiche, ** Finite-temperature properties of the relaxor PbMg$_{1/3}$Nb$_{2/3}$O$_{3}$ from atomistic simulations. *Phys. Rev. B* **91**, 214117 (2015).
D. Phelan, C. Stocka, J. A. Rodriguez-Riveraa, S. Chia, J. Leãoa , X. Long, Y. Xie, A. A. Bokov, Z.-G. Ye, P. Ganeshe, and P. M. Gehring, Role of random electric fields in relaxors, *PNAS* **111**, 1754 (2014).
J. Hlinka, S. Kamba, J. Petzelt, J. Kulda, C. A. Randall, S. J. Zhang, Origin of the Waterfall Effect in Phonon Dispersion of Relaxor Perovskites. *Phys. Rev. Lett.* **91**, 107602 (2003).
P. M. Gehring, S.-E. Park, and G. Shirane, Soft phonon anomalies in the relaxor ferroelectric Pb(Zr$_{1/3}$Nb$_{2/3}$)$_{0.92}$Ti$_{0.08}$O$_{3}$. *Phys. Rev. Lett.* **84**, 5216 (2000).
W. Kleemann, Cluster glass ground state via random fields and random bonds. *Phys. Status Solidi* **251**, 1993 (2014). .
S. Prosandeev, D. Wang, A. R. Akbarzadeh, L. Bellaiche, **First-principles-based effective Hamiltonian simulations of bulks and films made of lead-free Ba(Zr,Ti)O$_{3}$ relaxor ferroelectrics*. J. Phys . Condens. Matter*. **27**, 223202 (2015).
S. O. Kasap, Principles of Electronic Materials and Devices, Third Edition (McGraw-Hill, 2006), pp612.
We also verified that replacing the Langevin function with the simpler Curie law ($\\sim1/T$) will result in similar fitting results and analysis.
R. Sommer, N. K. Yushin, J. J. Van Der klink. **Dielectric susceptibility of PMN under DC bias*. Ferroelectrics* **127**, 235(1992).
I. K. Jeong, T. W. Darling, J. K. Lee, T. Proffen, R. H. Heffner, Direct observation of the formation of polar nanoregions in Pb(Mg$_{1/3}$Nb$_{2/3}$)O$_{3}$ using neutron pair distribution function analysis. *Phys. Rev. Lett.* **94**, 147602 (2005).
Y. Kuroiwa, S. Aoyagi, A. Sawada, J. Harada, E. Nishibori, M. Takata, M. Sakata, Evidence for Pb-O covalency in tetragonal PbTiO$_{3}$. *Phys. Rev. Lett.* **87**, 217601 (2001).
I. A. Kornev, L. Bellaiche, P. E. Janolin, B. Dkhil, and E. Suard, Phase diagram of Pb(Zr,Ti)O$_{3}$ solid solutions from first principles. *Phys. Rev. Lett.* **97**, 157601 (2006).
D. Sichuga and L. Bellaiche, ** Epitaxial Pb(Zr,Ti)O$_{3}$ ultrathin films under open-circuit electrical boundary conditions. *Phys. Rev. Lett*. **106**, 196102 (2011).
Z. Jiang, R. Zhang, D. Wang, D. Sichuga, C.-L. Jia, and L. Bellaich, Strain-induced control of domain wall morphology in ultrathin PbTiO$_{3}$ films. *Phys. Rev. B* **89**, 214113 (2014).
R. Pirc and R. Blinc, Vogel-Fulcher freezing in relaxor ferroelectrics*. Phys. Rev. B* **76**, 020101 (2007).
J. M. Valverde, On the negative activation energy for limestone calcination at high temperatures nearby equilibrium. *Chem. Eng. Sci.* **132**, 169 (2015).
A. K. Jonscher, A new understanding of the dielectric relaxation of solids. *J. Mater. Sci.* **16**, 2037 (1981).
[^1]: Here, $\\chi_{1}$ and $\\chi_{2}$ shall be understood as relative permittivity, not susceptibility.
|
National Airlines Flight 16
National Airlines Flight 16 was a domestic (U.S.), scheduled passenger flight from Miami, Florida, to Lakeland, Florida, that crashed on October 5, 1945. The aircraft was on the last leg of a Miami-Fort Myers-Sarasota-St Petersburg-Tampa-Lakeland route. The cause of the crash was determined to be a faulty missed approach procedure, which caused the aircraft to overshoot the runway and land in the water approximately beyond. Two passengers drowned, and several others were injured.
Aircraft and crew
Flight 16 was serviced by a Lockheed Lodestar 18-50 that had been manufactured in 1942 for the US Army Air Corps. The aircraft was owned by the Defense Plant Corporation, and was leased to National Airlines. The airframe had accumulated a total of 1798 hours of airtime, 628 hours of which had occurred since its last overhaul. The aircraft was one of only 13 Lodestar 18-50s variants built out of a total of 625 Lodestar 18's.
The aircraft was piloted by Captain William Merrill Corry, an employee of National Airlines since November 1943. Captain Corry had a total of 4800 hours of flight time, and 851 hours on a Lockheed 18-50. The copilot was First Officer William Hawley Conrad, an employee of National Airlines since May 7, 1945. First Officer Conrad had 5247 hours of flight time, with 409 on a Lockheed 18-50. The stewardess was Ethel Katherine McCoy.
Flight and crash
The aircraft, a Lockheed 18-50 Lodestar, departed Miami at 9:12 p.m. on October 4, 1945, 1 hour, 15 minutes behind schedule due to delays in previous flights. The flight progressed normally during stops at Fort Myers, Sarasota, St. Petersburg, and Tampa. The plane departed Tampa at 12:45 a.m. and continued towards Lakeland.
Lakeland reported 9 miles of visibility with scattered clouds at . At 12:58 a.m., at seven miles from the airfield, the pilots established a straight-in descent to the northeastern runway. The descent continued normally until the aircraft reached , when the aircraft abruptly entered an unexpected cloud. This prompted the captain to retract the landing gear and tell the first officer that he was going to initiate a missed approach, and go around for a second attempt at landing.
Witnesses on the ground observed that the aircraft continued along the runway at approximately above the surface. It passed the end of the runway and struck the surface of the lake adjacent to the Lakeland airport approximately beyond the end of the runway. The aircraft skipped an additional , shedding fuselage covering as it went, before sinking in of water.
Two passengers drowned. All other occupants escaped from the wreckage and were rescued by locals within thirty minutes.
Investigation
Civil Aeronautics Board investigators examined the wreckage and determined that there had been no malfunction or failure of aircraft equipment. The condition of the wreckage indicated that the plane had first struck the water in a level bellyflop.
The Civil Aeronautics Board determined that:
Because of the captain's unfamiliarity with the aircraft specifications, he waited too long to commit himself to the go-around procedure, dooming the aircraft as immediate action was necessary. The CAB also determined that the pilot had available alternative procedures which would have enabled him to complete the maneuver safely. The cause of the crash was ultimately determined to be due to pilot error.
References
Category:1945 in Florida
16
Category:Airliner accidents and incidents caused by pilot error
Category:Airliner accidents and incidents in Florida
Category:Aviation accidents and incidents in 1945
Category:Lakeland, Florida
Category:Aviation accidents and incidents in the United States in 1945 |
A hepatopancreas-specific C-type lectin from the Chinese shrimp Fenneropenaeus chinensis exhibits antimicrobial activity.
Lectins play important roles in animal innate immune responses by serving as pattern recognition receptors, opsonins, or effector molecules. Here, we report a novel hepatopancreas-specific C-type lectin, designated Fc-hsL, from the hepatopancreas of the Chinese shrimp, Fenneropenaeus chinensis. The cDNA of Fc-hsL is 571 bp long with a 480 bp open reading frame that encodes a 159-residue protein. Fc-hsL contains a signal peptide and a single C-type lectin-like domain (CTLD) or carbohydrate recognition domain (CRD). It has an EPN(Glu-Pro-Asn) motif with a predicted ligand-binding site specific for mannose. Fc-hsL was constitutively expressed in the hepatopancreas of normal shrimp, and its expression was up-regulated following challenge of shrimp with bacteria or virus. Fc-hsL was not detected in other tissues but was induced in the stomach of immune-challenged shrimp. Fc-hsL protein was detected in both hemolymph and the hepatopancreas of bacteria- and virus-challenged shrimp. Recombinant mature Fc-hsL has no hemagglutinating activity, but calcium-dependent agglutinating activity against some Gram-positive and Gram-negative bacteria was detected. The rFc-hsL also has binding activity to some Gram-positive and Gram-negative bacteria and high antimicrobial activity against some bacteria and fungi. These in vitro functions of recombinant Fc-hsL were calcium-independent. Fc-hsL may act as a pattern recognition receptor in antibacterial defense and as an effector in innate immunity of Chinese shrimp. |
Changes of NGF presence in nonneuronal cells in response to experimental allergic encephalomyelitis in Lewis rats.
We recently reported that the cerebrospinal fluid (CSF) of patients affected by multiple sclerosis (MS) and the brain tissues of rats with experimental allergic encephalomyelitis (EAE) contain elevated levels of nerve growth factor (NGF). In the present study, we demonstrate that astrocytes and oligodendrocytes particularly localized in the white matter, including corpus callosum, overexpress NGFmRNA and produce NGF protein in the CNS of EAE affected rats. These findings indicate that the increased NGF found in the brain of EAE rats and most probably also in the CSF of patients affected by MS is produced by activated glial cells. It is hypothesized that the enhanced production of NGF by glial cells is necessary to compensate for the effect of axonal and/or neuronal cell body injury occurring in EAE. The possible functional significance of these findings in demyelinating diseases is discussed. |
All About
Whether you're setting up an entire game room or just a small part of a bedroom, splurging on the finer details can make game play that much more exciting. From the best video game consoles to the top bundles and accessories, we found exactly what you need for the ultimate gaming experience. Snatch up these amazing early Black Friday deals from Walmart.
Most kids love video games — and most parents wish their kids would spend more time learning. Why not the best of both worlds? These educational video games for kids of all ages will help your little ones build usable skills like math, history, language, problem-solving and more!
So you're ready to buy a laptop for your child—but which laptop is best for kids? It depends on what you're looking for. From rugged but affordable laptops to more expensive personal computers for kids, these are the best options out there.
Stuck scrambling for a last minute Christmas gift for a kid on your list? Check out these awesome Amazon finds under $25—and if you're a Prime member, they'll ship for free in two days. Avoid the rush and long lines at stores and order these toys online instead! Make all of their holiday dreams come true on a tight schedule with a range of awesome, affordable gifts kids will love, including educational LEGO sets, collectible Hatchimal figurines, creative Pokemon toys and more.
So, your baby wants a fur baby, but they're just not ready for the real deal? Don't fret — get them a FurReal Pet! These imaginative, interactive plush animals continue their reign as one of the top-selling Christmas toys for kids in 2018. These fuzzy favorites were tops last year, and with their superior range of options, sound-and-movement combinations and adorable features, we predict they'll charm you — and Santa too! The FurReal pack includes cuties like StarLily the Unicorn, Ricky the Trick-Lovin' Pet, Ivory the Playful Tiger and many more. Amazon and Walmart both have FurReal Pets in stock at the moment, but some of the best-sellers are getting shopped-and-adopted fast. We say maybe don't wait for Black Friday or Cyber Monday, especially since you can get such sweet deals on these FurReal Pets now.
The only thing that comes close to competing with grandma's kisses or big bear hugs from grandpa is still being small enough to climb into their laps for a cuddle and a story. This selection of sweet picture books available on Amazon celebrates the special bond between grandparents and their grandchildren by teaching little ones just how much they are loved. Below, our favorite books for grandparents to read to their grandchildren.
What's worse than picking out a Christmas gift for picky tweens? Picking one out last minute! Thankfully, Amazon Prime's two-day shipping makes last minute purchases a piece of cake—and we have the whole great gift thing covered. Check out this selection of awesome, affordable last minute Christmas gifts tweens will love, from 'Star Wars' LEGO sets to mermaid-inspired sequin bags to the latest, greatest replacement for last year's fidget spinners.
Target was a go-to for the trendiest Christmas toys last year, and you can expect even more of the same great Black Friday deals and Cyber Monday sales on kids' favorite brands in 2018. From Air Hogs to Peppa Pig and PAW Patrol playsets, it won't be hard to fulfill your child's wish list with a shopping trip to Target. Last year, Nintendo and LEGO were favorite toymakers for Target shoppers, and this year the virtual toy chest is loaded with options from Baby Alive, KumiKreator, Crate Creatures and more. Have a look through our favorite Christmas toys from Target below.
When you are wearing this mascara, you will have difficulty convincing your friends that your lashes are real. The Benefit They're... Real Mascara provides many benefits to lashes, including separating, curling, lengthening, and volumizing them. It has a... read more
What it is: A lengthening mascara that curls, volumizes, lifts and separates lashes. What it does: This long-wearing formula won't... smudge or dry out and comes with a specially designed brush that reveals lashes you never knew you had. How to use: Position the wand horizontally and wiggle the brush from side to side, base to tip, to achieve maximum volume, length and lift. Hold the wand vertically and stroke upward to curl and separate. Layer generously as desired. Pro tips: Use the domed tip to fan out corner lashes for doe-eyed beauty. Style Name: Benefit They'Re Real! Lengthening & Volumizing Mascara. Style Number: 5421197. Available in stores. read more
What it is: A lengthening mascara that curls, volumizes, lifts and separates lashes. What it does: This long-wearing formula won't... smudge or dry out and comes with a specially designed brush that reveals lashes you never knew you had. How to use: Position the wand horizontally and wiggle the brush from side to side, base to tip, to achieve maximum volume, length and lift. Hold the wand vertically and stroke upward to curl and separate. Layer generously as desired. Pro tips: Use the domed tip to fan out corner lashes for doe-eyed beauty. Style Name: Benefit They'Re Real! Lengthening & Volumizing Mascara. Style Number: 5421197. Available in stores. read more
They're real! Mascara lengthens, curls, volumizes, lifts & separates. This long-wearing formula won't smudge or dry out and comes ...with a specially designed brush that reveals lashes you never knew you had! read more
They're real! Mascara lengthens, curls, volumizes, lifts & separates. This long-wearing formula won't smudge or dry out and comes ...with a specially designed brush that reveals lashes you never knew you had! read more
It’s the mascara that’s beyond belief! benefit They’re Real! Mascara in black boasts a jet black formula that lengthens, curls, vo...lumises, lifts and separates lashes for a spectacular “out-to-here” look! Now in a duo set for amazing value, this is a must have addition to your makeup collection. The exclusive brush is specially designed to maximise the performance of the long-wearing, glossy formula – revealing lashes you never knew you had! Staggered bristles grab close to the root, boosting length and volume. The precision bristles on the custom-domed tip lift, define and curl even your tiniest lashes. The end result... luxurious, silky lashes that won't smudge, clump or dry out. Directions of use: Position wand horizontally and wiggle from side to side, base to tip, to achieve maximum volume, length and lift. Hold wand vertically and stroke upward to curl and separate. Layer generously as desired. read more
Create telescopic lashes with benefit BADgal Bang Mascara, a gravity-defying formula inspired by space technology. Formulated with... weightless aero-particles to create intense volume without weighing down lashes, the jet-black mascara also uses ProVitamin B5 to strengthen and condition each lash for natural thickness. Lasting up to an incredible 36 hours, the smudge-proof product uses a custom Slimpact! brush, which grips onto even the smallest fibre to create dramatic effects from corner to corner. Expect lashes that are out of this world. read more |
Is Immortality the Best Employee Benefit?
An episode of The Jim Stroud Podcast
The Jim Stroud Podcast explores the discoveries and trends forming the future of our lives. Brain to brain communication, robot bosses, microchip implants for workers and immortality as an employee benefit are all happening now! If you want to know what's next, subscribe to this podcast and visitJimStroud.com to read the transcript and view related resources. If you want to show your appreciation for my podcast, please support my Starbucks habit with a small donation. | Donate at:ko-fi.com/jimstroud
Have you ever been fired from a job before? If so, I imagine it was during an awkward in-person meeting between you, your boss and somebody from the HR department. Today, however, we live in a different era and companies are using machines to fire employees. Don’t believe me? Tune in and I’ll share an example of what may be a sign of things to come. | Special thanks to ClickIQ for sponsoring this episode. (And a very special thanks to those who drop a little somethin'-somethin' in my virtual tip jar @ https://anchor.fm/jim-stroud/support)
There has been a lot of talk about diversity and inclusion as it pertains to the workplace. Do a search on duck duck go or some other search engine and you will no doubt discover countless articles about it. Yet, as I review several of the articles linked to from the search results, no one seems to be talking about a new demographic of workers that will no doubt disrupt the future world of work. What is the population I’m talking about? What is the one characteristic they all share? Well, in a word – transhumanism. Listen to this podcast to hear about future HR issues that will surely come. | Special thanks to ClickIQ for sponsoring this episode. (And a very special thanks to those who drop a little somethin'-somethin' in my virtual tip jar @ https://anchor.fm/jim-stroud/support)
Are you happy on your job? Are you unsatisfied with your work? Perhaps, you’ve already begun spending quality time on Indeed.com in search of new opportunities? And yet, you’ve kept all this to yourself, as you continue to plod along in a job you are starting to hate. What if I told you that with the help of big data and magic algorithms, companies are able to spot employees like you and with that knowledge, offer you a promotion, a raise or more fulfilling tasks, all in an effort to retain you as their employee. Sound crazy? Its not. IBM has software that can predict which workers are about to quit their jobs with 95% accuracy. Tune in to hear a very interesting podcast! Big thank you to our sponsor Click IQ. (http://clickiq.us)
When you think of prisoners working inside of a jail, what comes to mind? Prisoners cooking, mopping floors, folding clothes…? Yes, all of those are certainly true and now you can add one more – training artificial intelligence algorithms. In this episode, I talk about the pros and cons (pun intended) of prison labor. Big thanks to ClickIQ for sponsoring this episode.
Would you work for a machine? Some people are working for a machine right now, although they may not be aware of it. Could you be one of them? In this episode, I discuss humans and machines working together and its effect on the future of work. All courtesy of ClickIQ! Request a demo of their automated job advertising technology today! (Go to: https://www.clickiq.us/choose-your-demo/) And let them know you heard about them here first.
If you had a magic computer that could predict when crimes would take place, would you use it? Would you share it with the police so they could prevent people from becoming victims? Well, believe it or not, the police have such a system and have been exercising it to great effect. The technology and processes behind it is called "Predictive Policing" and it is a very controversial trend spreading across the USA. I discuss the good and the bad of it, in this episode. | Click here to support my Starbucks habit and financially support this podcast. / Read the transcript on JimStroud.com.
If you have a social media account or a cell phone or an internet connection, then you have no privacy. I’m pretty sure you can agree with me there. Do a search on Duck Duck Go or some other search engine for “Facebook scandal,” “cell phone privacy scandal,” or “data hacked” and you will no doubt agree with me. But have you ever considered your lack of privacy in the workplace? I’m going to share with you three stories and I want you to figure out whether or not they are true or false. Tune in to see if you can guess how far companies will go for the sake of efficiency. | If you have not already, subscribe to my blog at www.JimStroud.com.
There is a crisis of college student loan debt that is mind-blowing in its scope. Let me share some numbers with you: 44.7 million Americans have student loan debt representing $1.56 trillion owed to the government and of that HUGE amount of money, 11.5% of student loans are 90 days or more delinquent or in default. Add to these facts that students are still applying to US Universities with no sign of slowing down, at least according to the statistics portal – Statista. So, the cycle of student loan debt will continue or, will it? I happen to think that the future of student loan debt is no more long-term debt, thanks to "income sharing." Tune in to find out what I mean. | Transcript is available at www.JimStroud.com - Subscribe now!
The Fight for 15 is an American political movement advocating for the federal minimum wage to be raised to $15 per hour. The federal minimum wage was set at $7.25 per hour in 2009, and as of 2019 it has not been increased since. The movement has involved strikes by workers in child care, home healthcare, airport, gas station, convenience stores but most notably with fast food workers. What will happen if or when $15 is the minimum wage for all of the United States? I speculate the national and global consequences in this episode of The Jim Stroud podcast. | Transcript is available at www.JimStroud.com.
I break away from my typical podcast format to chat with Katrina Collier, Candidate Engagement Specialist, world-renowned speaker and my friend. As only we can, we discuss robots replacing recruiters, 4-day work weeks and cellphone addiction during a very sunny London day. Tune in to hear all the fun! Want more of Katrina Collier? (And who could blame you?) Find her at: www.thesearchologist.com
Did you know that when you shop, big brother is watching? Major retailers spend a lot of money on a lot of technology to attract your business and persuade you to spend more and more and more of your money. While that may not come as a surprise to you, the extent of how deeply retail technology tracks you may have you raising your eyebrows. In this episode, I share several case studies on how big data is being used to monitor your spending and persuade your buying habits. | Please support my Starbucks habit by dropping something in my virtual tip jar. (https://anchor.fm/jim-stroud/support) Thank you.
2018 was a banner year for data breaches and 2019 is already off to a great start. At the center of privacy scandals last year, was Facebook. It seemed like every other week there was a hacking issue or ethical misconduct around their user data. So, does this mean that Facebook users are on the decline? In a word, no. Despite all the data drama, Facebook is doing all right. So, what does it all mean for user privacy on Facebook and other tech companies with millions of users? I discuss that and something far more concerning than hackers stealing your data, predictive analytics. Tune in to find out what I mean. | For information on protecting your privacy on Facebook. (http://jimstroud.com/free) And please support my Starbucks habit (https://anchor.fm/jim-stroud/support) by dropping something in my virtual tip jar. Thank you.
Do you give money to the homeless people you meet on the street? I do, sometimes. But, mostly I don’t and that’s because I think it will be spent on some sort of vice and not on say… food or shelter. This is why I prefer to donate to a charity. If I give it to a charity, I can make a reasonable assumption that the money I donate will go to the intended purpose of getting someone the help they need. But what if there was a way to give funds directly to homeless people you encounter on the street with the guarantee that it would be spent responsibly? Well, I've found a very intriguing technical option that promises to do that very thing. Tune in to find out more. | Check out: 12 DuckDuckGo Search Tips You Should Know to Boost Productivity | And please support my Starbucks habit by dropping something in my virtual tip jar. Thank you.
What happens when politics is discussed in the workplace? A recent survey says that American workers are stressed out by any and all chatter about Donald Trump and politics in general. Despite that fact, with another presidential election on the horizon, there is no sign of that trend changing. So, what are you as a worker to do? Moreover, what can managers do (if anything) to curtail political discussions that can divide an office, much like the USA is these days? Tune in to hear my thoughts and strategies for how workers and managers can navigate these interesting times today and in the future. | Click here for information on protecting your privacy on Facebook. And please support my Starbucks habit by dropping something in my virtual tip jar. Thank you.
Would you ride in a self-driving car? Yeah, neither would I. As far as the public at large is concerned, they wouldn’t either. One 2018 survey cited only 21 percent of the public was willing to even try riding in an autonomous vehicle. I think that’s a BIG problem for a lot of startups and major companies who have already invested a lot of money into the technology. So, what can they do to convince the public to ride in them? Well, I have a few ideas. Tune in to hear them.
/ Click here for information on protecting your privacy on Facebook.
/ Free Magazine Subscription: “Autonomous Vehicle Technology” The trusted source for vehicle automation, connectivity, electrification, and mobility services.
/ Please support my Starbucks habit by dropping something in my virtual tip jar. Thank you.
/ Want the transcript for this episode? Visit my website at www.JimStroud.com
And finally, spread the word about this weekly podcast. Please and thank you.
I read the other day that chronic social media use is as bad as drug addiction and I remember thinking, "Is that true?" Well, I did a little bit of research and the answer is yes, a very disturbing yes. I discuss how bad the tech addiction epidemic is and share an unlikely method for stopping tech addiction in our time. The source of the improbable cure? Cocaine. Tune in for more details. This will be controversial, to say the least. | Plus: Go to JimStroud.com/free for information on how to protect your privacy on Facebook. And please support my Starbucks habit by dropping something in my virtual tip jar. Thank you.
Amazon reported that 100 million Alexa devices have been sold as of this writing. That’s great for Amazon but for you, maybe not so much. If you are concerned about your privacy then, its not good for you to have Alexa (and devices like it) in your home because it is almost always listening and recording everything going on. Doubt me? Tune in to this episode to learn why you should be concerned about Alexa and even more concerned about what Google has planned for your home. Its scary. | Click here for information on protecting your privacy on Facebook. | Subscribe now and/or leave a comment and let me know what you think of my show? Please and thank you. Finally, for more content like this (like the transcript to this podcast and other episodes), visit my website - JimStroud.com
The Christmas season is upon us which means, among other things, Santa Claus will be delivering toys and gifts to all the good little boys and girls around the world. Free gifts are one of the reasons why Christmas is so deeply appreciated by the masses. Can you imagine if Christmas was more than once a year? What if it once a month and all year round people were receiving free gifts in the mail; specifically, a check for $500. Sound nice? Well, its about to happen in Stockton, CA. The free gift is called “Universal Basic Income” and I think it’s a bad idea. Tune into my podcast to find out why. Want the transcript? Check it out at www.JimStroud.com.
A scientist named - He Jianku claims to have created the world’s first genetically edited babies. Shortly after the announcement was made, He Jianku disappeared to parts unknown. (Insert dramatic music here.) If what He claims is true, not only is this a major scientific breakthrough disrupting the scientific community - forever; its also a major headache for the HR department. Tune in to this episode to find out why.
{QUICK NOTE: I’m thinking of doing a podcast where I interview interesting people about the future of work, life and everything in between. Consider this to be the pilot episode. If I do more of these, it will be because of the comments and encouragement of my listeners. So, please do share your thoughts.}
My guest in the premiere episode of “Future Talk” (working title) is Dr. Tracey Wilen. We discuss the career confusion of mature workers and millennials seeking to progress in their career, how to figure out a career path in this constantly changing technological landscape, what to do when you don’t know what to do next in your career and more. Get a pad and pencil (or have you texting finger ready) to take notes as lots and lots and lots of strategies are suggested herein.
A Wisconsin company made it possible for their workers to throw away their employee ID cards, forget all their passwords, make copies and get food from a vending machine in a surprisingly convenient way. The magic solution? A small medical procedure actually – employees were given a choice to receive a tiny microchip under their skin. Its called “microchipping” and its a no-good, horrible and terrible idea. I explain why, in detail, in this episode. Listen in and be sure to subscribe, so you don’t miss an episode.
Attention Human Resources department, instead of spending so much time and money developing an onboarding program and/or a series of corporate training initiatives, why not simply plug your workers into a matrix-like system and have that information uploaded into their brains? Easy-peasy. Now, if you think that sounds crazy, even impossible, you will be intrigued by what I share in this episode. (wink-wink) And please check out the great special being offered to my listeners at http://jimstroud.com/secure )
What would happen if companies offered their employees immortality as an employee benefit? In this burgeoning age of digital afterlife services, such an offering is closer than you might imagine. If you have never heard of this new niche in the tech industry, prepared to be amazed when you tune into my latest episode. (Please check out this great special for my listeners! www.JimStroud.com/secure)
Identity theft is a global epidemic and its about to get worse because of proud, well-meaning parents. Find out what I mean in the latest episode of The Jim Stroud Podcast. (Please check out this great special for my listeners at www.jimstroud.com/secure)
What would happen if we crowd sourced morality? In other words, instead of a bible or a quran or a torah guiding us, we make life and death decisions based solely on the collective wisdom of the public. Let's take this a bit further, and plug the results of those whims into machines. What would happen then? Or rather, what's the worst that could happen? Tune in to find out! (And for research and resources related to this podcast, be sure to visit my website at www.JimStroud.com)
Earlier this year, something extraordinary was being reported in the news. For the first time in American history, there were more jobs than people out of work. To be specific, in June 2018, there were 6.7 million job openings but only just 6.4 million available workers to fill them; this according to the Bureau of Labor Statistics. Employers have been complaining for years about the inability to find workers with the right training for the positions available. In the meantime, companies are adding other incentives to retain workers and pull new ones in. As the demand grows, workers have gotten more confident about leaving their current positions for better ones. So, what is HR to do? One solution might be... Human Cloning! Tune in to find out why. Research and resources related to this resource can be found at JimStroud.com.
Believe it or not, scientists connected 3 human brains together and used that connection to… play Tetris, because… why not? This new technology represents a LOT of possibilities, both positive and negative. On the positive side, I can imagine paraplegics using this tech to mentally move prosthetic limbs. On the negative side, I foresee a HUGE problem for the HR department. Tune in to the first episode of my new podcast to see what I mean. Links related to this podcast can be found here: http://blog.jimstroud.com/2018/10/22/brain-to-brain-c…tion-its-a-thing/
ABOUT THE HOST
Over the past decade, Jim Stroud has built an expertise in sourcing and recruiting strategy, public speaking, lead generation, video production, podcasting, online research, competitive intelligence, online community management and training. He has consulted for such companies as Microsoft, Google, MCI, Siemens, Bernard Hodes Group and a host of startup companies. During his tenure with Randstad Sourceright, he alleviated the recruitment headaches of their clients worldwide as their Global Head of Sourcing and Recruiting Strategy. His resume and career highlights can be viewed on his website at www.JimStroud.com. |
If you think any other sections need to be included or have news you'd like to add to this newsletter, go ahead and post it up here and I'll try and include it all.
News from the Hill is going to include Tiacha taking over the DoE. I'd also like to say something about all the work stbob and brasky are doing with declassifying, so maybe you guys can tell me more about it? |
Kris allen heartless acoustic
Heartless Acoustic by Kris Allen chords. One clean accurate version. No abusive ads. Recommended by The Wall Street Journal. Ok guys, These chords are real! I saw kris doing them and just moved it in here.. I don't know what's the names of the chords But I'm sure it's them - you can. Kristopher Neil Allen (born June 21, ) is an American singer and songwriter from Conway, Arkansas, and the winner of the eighth season of American Idol. Prior to Idol, he self-released a album entitled Brand New Shoes. Allen's Idol coronation song, "No Boundaries" and his version of "Heartless" .. Allen debuted several new songs at an acoustic concert at The Mint in Los.
We only got 86 seconds in a day to Turn it all around or to throw it all away We gotta tell 'em that we love 'em while we got the chance to say Gotta live like. 19 Mar Kris Allen Heartless (REAL) Live Performance Video! . you listen to Allen, you see how easy it was to transition Heartless into an acoustic hit. 15 May Kris Allen Vs. David Cook: Idol's Best Performance Quarterfinals and his wickedly unexpected, acoustic rendition of Kanye West's “Heartless.
27 Mar “Heartless” was the song that started this all. Kris Allen pulled out a show stopping acoustic version of this Kayne West hit for his second Top 3. Learn to play 'Heartless Acoustic' easy by Kris Allen with guitar chords, lyrics and chord diagrams. 17 Nov Metacritic Music Reviews, Kris Allen by Kris Allen, This is the first major Acoustic Heartless would have been better than the poppy version on. 7 Apr Letting You In: Acoustic Performances - EP. Kris Allen Sunshine" and strumming the guitar for an acoustic take on Kanye West's "Heartless. Venice Kris Allen. Kris Allen - Waves. Kris Allen - Heartless (ACOUSTIC TAPES). Venice (Acoustic). Monster mashed up with Hit The Road Jack Kris Allen. |
A social-networking system, which may include a social-networking website, may enable its users (such as persons or organizations) to interact with it and with each other through it. The social-networking system may, with input from a user, create and store in the social-networking system a user profile associated with the user. The user profile may include demographic information, communication-channel information, and information on personal interests of the user. The social-networking system may also, with input from a user, create and store a record of relationships of the user with other users of the social-networking system, as well as provide services (e.g. wall posts, photo-sharing, event organization, messaging, games, or advertisements) to facilitate social interaction between or among users.
The social-networking system may send over one or more networks content or messages related to its services to a mobile or other computing device of a user. A user may also install software applications on a mobile or other computing device of the user for accessing a user profile of the user and other data within the social-networking system. The social-networking system may generate a personalized set of content objects to display to a user, such as a newsfeed of aggregated stories of other users connected to the user.
Social-graph analysis views social relationships in terms of network theory consisting of nodes and edges. Nodes represent the individual actors within the networks, and edges represent the relationships between the actors. The resulting graph-based structures are often very complex. There can be many types of nodes and many types of edges for connecting nodes. In its simplest form, a social graph is a map of all of the relevant edges between all the nodes being studied.
There may be information associated with particular users stored with the system (e.g., in connection with the corresponding user accounts). Each user may upload and submit information to the system. The system may store each user's information on behalf of that user and in association with that user. The user may access his information stored with the system. In addition, the user may choose to grant other users access to his information stored with the system. |
Search
ðÿð¾ð¸ñðº@mail.ru
JavaScript is disabled. For a better experience, please enable JavaScript in your browser before proceeding.
Hi there and welcome to PC Help Forum (PCHF), a more effective way to get the Tech Support you need!
We have Experts in all areas of Tech, including Virus removal, Crash Fixing and BSOD's , Microsoft Windows, Computer DIY and PC Hardware, Networking, Gaming, Tablets and iPads, General and Specific Software Support and so much more.
Hello!
So a couple of days ago I accidentally downloaded an addon to google chrome that's called mail.ru. It has since then messed up my browser by adding addons, changing homepage address, ads that pop on and you know the stuff that ad malwares do. I usually fix this problem by just... |
Ethics on the job: a survey. The realities of HIV/AIDS.
HIV/AIDS has had a profound impact on how care is provided to patients--raising both practice and ethical concerns. In this final installment in our series, we'll see how nurses are coping with these dilemmas, and how they feel about issues like mandatory HIV testing and practice restrictions on infected providers. |
---
abstract: 'The measurement of the CP violation in the b-meson system and of b-meson rare decays provides information about the electroweak symmetry breaking in terms of flavour structure of the CKM matrix and flavour changing neutral currents. The deviation of the experimental observations from the Standard Model predictions allows to constrain new physics. In this paper recent results from Tevatron are reported.'
author:
- |
N. D’Ascenzo\\
[*for the CDF and D0 collaborations*]{}\\
\\
LPNHE University Pierre et Marie Curie CNRS/IN2P3, Paris, France\\
Nuclear Research National University, Russia\\
E-mail: ndasc@mail.desy.de
title: Recent results on B physics at Tevatron
---
CDF and D0 experiments at Tevatron
==================================
Tevatron is a $p\\bar{p}$ collider with a center of mass energy of 1.96 TeV. A total luminosity of 8.8 $fb^{-1}$ was delivered to the experiments and 7.3 $fb^{-1}$ was recorded up to July 2010.
The two experiments at Tevatron, CDF and D0, are suitable for the analysis of b-mesons properties.
The CDF detector relies on an excellent tracking system, with momentum resolution $\\sigma_{p_{t}}/p_{t}^{2}=0.07\\%$\\[GeV/c\\]$^{-1}$ and impact parameter resolution $\\delta D_{0}=40 \\mu$m. A dedicated trigger allows to provide the track displacement information from the silicon detectors with several 10 kHz rates. The electron identification is performed in the calorimeters and muons are identified in the muon system with a coverage up to $\\eta=1$. The ionization measurement in the drift chambers combined with time of flight measurement in the TOF detector allow an efficient $\\pi/K$ separation used for the identification of kaons from b-quark fragmentation and b-mesons decay.
The key-point of the D0 detector is the excellent coverage of the tracker and of the muon system up to $\\eta>2$. The vertex detector was updated in 2006 with an additional silicon layer L0 near the beam pipe (R=1.6 cm). The momentum resolution is $\\sigma_{p_{t}}/p_{t}^{2}=0.14\\%$\\[GeV/c\\]$^{-1}$ and the impact parameter resolution is $\\delta D_{0}=13\\mu\\rm{m}\\oplus 50 /p_{t}$.
New physics in $B_{s}$ oscillation and CP violation
===================================================
The $B_{s}\\bar{B}_{s}$ system is a two states quantum system with flavour eigenstates (b,$\\rm{\\bar{s}}$),($\\rm{\\bar{b}}$,s).
The flavour eigenstates are not CP eigenstates ($\\rm{CP}\\psi_{B_{s}^{0}}=-\\psi_{\\bar{B}_{s}^{0}}$) and mixing between the two states can be mediated by the weak interaction through the flavour-changing transition $b\\rightarrow s$.
Flavour-changing processes involving quarks are described in the SM by the lagrangian: $$\\mathcal L=\\frac{g}{\\sqrt{2}}\\left(\\hat{u},\\hat{c},\\hat{t} \\right)_{L}\\gamma_{\\mu}\\left(\\begin{array}{ccc}V_{ud}&V_{us}&V_{ub}\\\\V_{cd}&V_{cs}&V_{cb}\\\\V_{td}&V_{ts}&V_{tb}\\\\ \\end{array} \\right) \\left( \\begin{array}{c}d\\\\s\\\\b\\end{array}\\right)_{L}W_{\\mu}^{+}$$ The matrix $V_{ij}$ is the Cabibbo-Kobayashi-Maskawa (CKM) matrix [@CKM].
The CKM matrix is unitary. The elements of the CKM matrix satisfy the relations $\\sum_{i}{V_{ij}V_{ik}^{*}}=\\delta_{jk}$ and $\\sum_{i}{V_{ij}V_{kj}^{*}}=\\delta_{ik}$. The CKM matrix is parameterized by three mixing angles $\\theta_{ij}$ and one CP violating phase $\\delta$. The CP violation is generated in the SM only by the phase $\\delta$ for flavour changing processes involving quarks. CP violating sources are necessary to explain the matter-antimatter asymmetry observed in nature [@Sak]. Flavour-changing processes in NP models affect the size of the CKM matrix elements and of the CP violating phase.
The $B_{s}^{0}\\bar{B}_{s}^{0}$ mixing is described by the effective Hamiltonian $$i\\frac{\\partial}{\\partial t} \\psi_{B_{s}^{0}}\\left(t\\right)= \\left(\\begin{array}{cc}M-i\\frac{\\Gamma}{2}& M_{12}-i\\frac{\\Gamma_{12}}{2}\\\\M_{12}^{\\ast}-i\\frac{\\Gamma_{12}^{\\ast}}{2}& M-i\\frac{\\Gamma}{2}\\\\ \\end{array} \\right)\\psi_{B_{s}^{0}}\\left(t\\right)
\\label{Heff}$$ The off-diagonal terms depend on the elements of the CKM matrix and are sensitive to NP contributions [@Lenz]. $M_{12}$ receives contribution from massive internal particles. The main SM contribution is the t-quark and NP models predict highly massive particles which can affect sensitively $M_{12}$. $\\Gamma_{12}$ receives contribution from light internal particles, as c- or u- quarks. It is not sensitive to NP which has contribution at higher mass scale. The phase $\\phi_{s}=\\rm{arg}\\left( -\\frac{M_{12}}{\\Gamma_{12}}\\right)$ is also studied. As the SM expectation is $\\phi_{s}=\\left(0.0041\\pm0.0008\\right)$, $\\phi_{s}$ is a very sensitive quantity to new physics effects.
Three experimental observables can be constructed after diagonalization of the Hamiltonian \\[Heff\\] and determination of the two $B_{s,L}^{0}$ and $B_{s,H}^{0}$ mass eigenstates.
The mass difference between the two mass eigenstates $\\Delta M_{s}=\\left(M_{H}-M_{L}\\right)\\approx 2 \\left|M_{12}\\right|$ is sensitive to NP due to the proportionality to $M_{12}$. It was measured by CDF and D0 collaboration using 1 $fb^{-1}$ of data [@DMs]. The CDF and D0 experiment report respectively $\\Delta M_{s}=17.77\\pm 0.10\\hspace{2mm} \\rm{(stat)} \\pm 0.07 \\hspace{2mm} \\rm{(syst)} \\rm~{ps}^{-1}$ and $\\Delta M_{s}=18.53\\pm 0.93 \\hspace{2mm} (stat) \\pm 0.30\\hspace{2mm} (syst) \\rm~{ps}^{-1}$. The experimental value of $\\Delta M_{s}$ and of $\\Delta M_{d}$ [@Dmb] are combined to determine the CKM matrix element $V_{td}$, which is used to prove the unitarity condition $V_{ud} V^{\\ast}_{ub} + V_{cd} V^{\\ast}_{cb} + V_{td} V^{\\ast}_{tb} = 0$. The experimental result was found in agreement with the SM expectation [@DmbDms].
The width difference between the two mass eigenstates $\\Delta \\Gamma_{s}=\\left(\\Gamma_{L}-\\Gamma_{H}\\right)\\approx 2 \\left|\\Gamma_{12} \\right|\\rm{cos}\\phi_{s}$ is very sensitive to NP due to the correlation with $\\phi_{s}$. The golden mode to study this observable is the measurement of the CP violation in the interference between mixing and decay in $B_{s}^{0}\\rightarrow J/\\psi \\phi$. In this decay the relation $V_{us} V^{\\ast}_{ub} + V_{cs} V^{\\ast}_{cb} + V_{ts} V^{\\ast}_{tb} = 0$ is studied from which the angle $\\beta_{s}$ is defined as $2\\beta_{s}=2arg\\left[-\\frac{\\left(V_{ts}V_{tb}^{\\ast}\\right)^{2}}{\\left(V_{cs}V_{cb}^{\\ast}\\right)^{2}} \\right]$. The SM expectation is $\\beta_{s}=0.04\\pm 0.01$ rad. It is hence very sensitive to effects of NP[^1] (section 2.1).
The flavour specific or semi-leptonic CP asymmetries are also sensitive probe of NP. In case $\\bar{B}_{s}^{0}\\rightarrow f$ and $B_{s}^{0}\\rightarrow \\bar{f}$ are forbidden the asymmetry is defined as $a_{sl}^{s}=\\frac{\\Gamma\\left(\\bar{B}_{s}\\rightarrow f \\right)-\\Gamma\\left(B_{s}\\rightarrow \\bar{f} \\right)}{\\Gamma\\left(\\bar{B}_{s}\\rightarrow f \\right)+\\Gamma\\left(B_{s}\\rightarrow \\bar{f} \\right)}=\\frac{\\Delta \\Gamma_{s}}{\\Delta M_{s}}\\rm{tan}\\phi_{s}$. The same relation yields for $B_{d}^{0}$ mesons: $a_{sl}^{d}\\equiv \\frac{\\Gamma\\left(\\bar{B}_{d}\\rightarrow f \\right)-\\Gamma\\left(B_{d}\\rightarrow \\bar{f} \\right)}{\\Gamma\\left(\\bar{B}_{d}\\rightarrow f \\right)+\\Gamma\\left(B_{d}\\rightarrow \\bar{f} \\right)}=\\frac{\\Delta \\Gamma_{s}}{\\Delta M_{d}}\\rm{tan}\\phi_{d}$. The relation to $\\phi_{q}$ makes this observables sensitive to NP. These observables are studied in the measurement of the di-muon charge asymmetry[^2] $A^{b}_{sl}\\equiv\\frac{N_{b}^{++}-N_{b}^{--}}{N_{b}^{++}+N_{b}^{--}}$. $A^{b}_{sl}$ receives contribution from both $B_{s}$ and $B_{d}$ mesons: $A_{sl}^{b}=\\left(0.506\\pm0.043 \\right)a_{sl}^{d}+\\left(0.494\\pm0.043 \\right)a_{sl}^{s} $. The SM expectation is $A_{sl}^{b}=\\left(-2.3^{+0.5}_{-0.6}\\right)\\times 10^{-4}$. NP contributions to the Feynman box diagrams responsible for $B_{q}^{0}$ mesons mixing affect significantly the value of $A_{sl}^{b}$ (section 2.2).
CP violation in $B_{s}\\rightarrow J/\\psi \\left(\\mu\\mu \\right)\\phi \\left(KK \\right)$
-----------------------------------------------------------------------------------
The analysis is performed on the decay $B_{s}^{0}\\rightarrow J/\\psi \\phi$ with the subsequent two body decays $\\phi\\rightarrow KK$ and $J/\\psi \\rightarrow \\mu\\mu$.
The final state of the decay $B_{s}\\rightarrow J/\\psi \\phi$ is composed of a mixture of CP eigenstates. As the $J/\\psi$ and $\\phi$ are spin-1 particles, the allowed CP states are defined by the relation $CP \\psi_{J/\\psi \\phi} = \\eta_{J\\/psi}\\eta_{\\phi}\\left(-1 \\right)^{L}$, with $L=0,1,2$ and $\\eta$ intrinsic CP of the two particles. Two CP-even (L=0,2) and one CP-odd (L=1) states are formed. The total decay amplitude is described in the transversity base [@trans] and is decomposed in the polarization amplitudes $A_{0}$, $A_{\\parallel}$ and $A_{\\bot}$.
Five parameters defined in QCD are used to describe the polarization amplitudes [@dec]. They are the strong phase and the amplitude of $A_{\\parallel}$, the strong phase and the amplitude of $A_{\\bot}$ and the real-valued amplitude $A_{0}$.
The time evolution of each polarization amplitude is calculated from the Schrödinger equation \\[Heff\\]. The angular distribution of the particles in the final states is calculated through the decomposition of the $J/\\psi\\rightarrow \\mu\\mu$ and $\\phi\\rightarrow KK$ decay amplitudes in partial amplitudes [@ang].
The analysis consists of a likelihood fit to the angular and time distributions in order to extract the value of $\\Delta \\Gamma$ and $\\beta_{s}$. This report refers to the recent CDF update with a data sample of $5.2$ fb$^{-1}$ [@bsjpsiphi]. The analysis relies on:
- The event reconstruction and event selection which yield $6504\\pm85$ $B_{s}^{0}\\rightarrow J/\\psi \\phi$ signal events.
- Two b-tagging methods. The opposite side tagging combines the information of jet charge and lepton identification to reconstruct the flavour of the b quark at the moment of production. It was calibrated using $B^{+}\\rightarrow \\Psi K^{+}$ decay and has an efficiency of 94.2 $\\%$ and dilution $11.5 \\%$. The same side tagging identifies a $K^{\\pm}$ from fragmentation of the b-quark. It was calibrated with a simultaneous measurement of $\\Delta M_{s}$ and of a dilution scale factor $A$. It has a total tagging power of $3.2 \\%$.
- Angular efficiency function used to take into account the detector angular acceptance.
The resulting value of $\\Delta\\Gamma_{s}$ and $\\beta_{s}$ (Fig. \\[CPV\\]a) is found in agreement with the SM prediction at 0.8 $\\sigma$. The possibility of the extension of this analysis including data collected with a two displaced tracks trigger is being studied.
CP violation in di-muon charge asymmetry measurement
----------------------------------------------------
The analysis consists of the reconstruction of events with two same charge muons in the final state.
In this paper the results are reported from the D0 experiment obtained with a total data set of $6.1$ fb$^{-1}$ [@bsasym].
The analysis is performed on two data samples. The inclusive muon sample is composed of events with at least one single muon candidate passing the muon selection and at least one single muon trigger. The like-sign di-muon sample consists of all events with at least two muons candidates of the same charge that pass the dimuon selection and at least one dimuon trigger. This analysis relies on:
- Reversing of the polarity of the toroidal ad solenoidal magnet every two weeks, in order to cancel first order effects related with the instrumental asymmetry.
- Measurement of background contribution to the asymmetry. Muons are considered from the decay of charged kaons and pions and punch-through kaons, pions and protons. The contribution of these backgrounds to the asymmetry $a$ and $A$ are extracted directly from data.
The quantities $a\\equiv\\frac{n^{+}-n^{-}}{n^{+}+n^{-}}$, where $n^{\\pm}$ is the number of positive and negative identified muons, and $A\\equiv\\frac{N^{++}-N^{--}}{N^{++}+N^{--}}$ are extracted respectively from the inclusive and like-sign sample. The value of $A_{sl}^{b}$ is extracted independently from $A$ and $a$ according to the relations $a=k\\times A_{sl}^{b}+a_{bkg}$ and $A=K\\times A_{sl}^{b}+A_{bkg}$ where $a_{bkg}$ and $A_{bkg}$ are the background contributions extracted from data and $k$ and $K$ are scale factors estimated in MC. It was found that $a_{bg}\\sim A_{bg}$ so that a subtraction of the two relations reduces the systematic error on $A_{sl}^{b}$.
The measured like-sign dimuon asymmetry is $A_{sl}^{b}=-0.00957\\pm 0.00251\\rm{(stat)}\\pm0.00146\\rm{(syst)}$ (Fig. \\[CPV\\]b). This asymmetry is in disagreement with the prediction of the SM by 3.2$\\sigma$ deviation. This is the first evidence of anomalous CP-violation in the mixing of neutral B-mesons.
New physics in rare B meson decays
==================================
$B_{s}^{0}\\rightarrow \\mu^{+}\\mu^{-}$
-------------------------------------
The decay $B_{s}\\rightarrow \\mu\\mu$ is a Flavour Changing Neutral Current (FCNC) process forbidden at tree level. It occurs through GIM suppressed box or penguin diagrams. The expected branching ratio of this decay in the SM is $BR\\left(B_{s}\\rightarrow \\mu\\mu\\right)=\\left(3.42\\pm0.54 \\right)\\times 10^{-9}$. Decay amplitudes can be enhanced of few orders of magnitude in extensions of the SM. This rare decay is hence very sensitive to effects of new physics.
The analysis is performed on a data sample composed of two identified muons, satisfying the di-muon trigger and the di-muon selection criteria. The number of events passing the selection is normalized to the yield of the well studied normalization channel $B^{+}\\rightarrow J/\\psi K^{+}$.
The upper limit on $BR\\left(B_{s}\\rightarrow \\mu\\mu\\right)$ measured by the two experiments is $4.3\\times 10^{-8}$ (CDF [@CDFbsmumu]) and $5.1\\times 10^{-8}$ (D0 [@D0bsmumu]) at $95\\%$ C.L. obtained analysing respectively a data sample of $3.2$ fb$^{-1}$ (CDF) and $6.1$ fb$^{-1}$ (D0). The result is in agreement with the SM.
$B_{q}^{0}\\rightarrow h \\mu\\mu$
-------------------------------
The $B\\rightarrow h \\mu\\mu$ decay is a FCNC process, mediated by the quark transition $b\\rightarrow s l l$. It is described by three dominant Wilson coefficients $C_{7}^{eff},C_{9}^{eff},C_{10}^{eff}$, where $C_{7}^{eff}$ gets contribution from the photon penguins, $C_{9}^{eff}$ comes from the vector and $C_{10}^{eff}$ form the axial component of the weak diagrams [@Wilson]. The BR and the front-backward asymmetry $A_{FB}$ depend on the Wilson coefficients, which indicate if the underlying dynamics is described by SM or NP physics like supersymmetry, Technicolor or fourth generation.
In the CDF analysis performed on a data sample of about $4.4$ fb$^{-1}$ [@bkmumu] the decay modes $B^{+}\\rightarrow K^{+} \\mu^{+}\\mu^{-}$, $B^{0}\\rightarrow K^{0} \\mu^{+}\\mu^{-}$ are searched and fully reconstructed. The branching ratio is calculated respect to the normalization channel $B\\rightarrow J/\\psi h$. Both BR and $A_{FB}$ for the $B^{+}\\rightarrow K^{+} \\mu^{+}\\mu^{-}$, $B^{0}\\rightarrow K^{0} \\mu^{+}\\mu^{-}$ are measured in agreement with the SM and with the current best results at BaBar and Belle (Fig. \\[rare\\]b).
A first observation with $6.3\\sigma$ evidence of the decay mode $B_{s}\\rightarrow \\phi \\mu \\mu$ is performed in the CDF experiment on a data sample of about $4.4$ fb$^{-1}$ (Fig. \\[rare\\]a). The measured BR is $BR\\left(B_{s}\\rightarrow \\phi \\mu \\mu \\right)=\\left(1.44\\pm0.33\\rm{(stat)}\\pm0.03\\rm{(syst)} \\right)\\times 10^{-6}$ [@bkmumu].
Conclusions
===========
The high luminosity reached at Tevatron and the interplay between CDF and D0 experiments allow high accuracy in the measurement of CP violation in the b-mesons mixing and of rare b-meson decays. Both measurements are important for the constrain of new physics processes and for the understanding of the Standard Model.
[0]{}
N. Cabibbo, Phys. Rev. Lett. B [**10**]{} (1963) 531;\\
M. Kobayashi, T. Masawa, Progr. Theor. Phys. [**49**]{} (1973) 652.
A. Lenz, hep-ph/0705.3802 (2007). The CDF Collaboration: T. Aaltonen, et al., Phys. Rev. Lett. [**97**]{} (2006) 242003\\
D0 Collaboration, D0 note [**5474-CONF**]{} (2007). A.D. Sakarov, Pisma Zh. Eksp. Teor. Fiz. [**5**]{} (1967) 32. HFAG, http://www.slac.stanford.edu/xorg/hfag/ and references therein. O. Dechamps, CKMFitter group, hep-ph/0810.3139 (2009). K.Abe, M.Satpathy, H.Yamamoto, arXiv:hep-ex/0103002v1 (2001) J. L.Rosner, Phys. Rev. D [**42**]{} (1990) 3732. A.S. Dighe, I.Dunietz, J.Lipkin, L.Rosner, arxiv:[**9511363**]{} (1995). The CDF Collaboration, CDF note [**10206**]{} (2010). The D0 Collaboration, arxiv:1005.2757, submitted to Phys.Rev.D (2010). The CDF Collaboration, CDF note [**9892**]{} (2009). The D0 Collaboration, arxiv:1006.3469, submitted to Phys.Lett.B (2010). K.G. Wilson, Phys.Rev. [**179**]{}, 1499 (1969) The CDF Collaboration, CDF note [**10047**]{} (2010).
[^1]: A relation exists between the angle $\\beta_{s}$ and the parameter $\\phi_{s}$. NP alters the phase $2\\beta_{s}$ to $\\phi^{\\Delta}_{s}-2\\beta_{s}$ and the phase $\\phi_{s}$ to $\\phi_{s}+\\phi^{\\Delta}_{s}$. As both $\\phi_{s}$ and $2\\beta_{s}$ are expected to be very small in the SM, the effects of NP are dominant and of the same size $\\phi^{\\Delta}_{s}$ for both parameters.
[^2]: $N_{b}^{++}$ and $N_{b}^{--}$ are the number of events in which two selected muons in the final state have the same charge
|
/*
* pata_amd.c - AMD PATA for new ATA layer
* (C) 2005-2006 Red Hat Inc
*
* Based on pata-sil680. Errata information is taken from data sheets
* and the amd74xx.c driver by Vojtech Pavlik. Nvidia SATA devices are
* claimed by sata-nv.c.
*
* TODO:
* Variable system clock when/if it makes sense
* Power management on ports
*
*
* Documentation publicly available.
*/
#include <linux/kernel.h>
#include <linux/module.h>
#include <linux/pci.h>
#include <linux/blkdev.h>
#include <linux/delay.h>
#include <scsi/scsi_host.h>
#include <linux/libata.h>
#define DRV_NAME "pata_amd"
#define DRV_VERSION "0.4.1"
/**
* timing_setup - shared timing computation and load
* @ap: ATA port being set up
* @adev: drive being configured
* @offset: port offset
* @speed: target speed
* @clock: clock multiplier (number of times 33MHz for this part)
*
* Perform the actual timing set up for Nvidia or AMD PATA devices.
* The actual devices vary so they all call into this helper function
* providing the clock multipler and offset (because AMD and Nvidia put
* the ports at different locations).
*/
static void timing_setup(struct ata_port *ap, struct ata_device *adev, int offset, int speed, int clock)
{
static const unsigned char amd_cyc2udma[] = {
6, 6, 5, 4, 0, 1, 1, 2, 2, 3, 3, 3, 3, 3, 3, 7
};
struct pci_dev *pdev = to_pci_dev(ap->host->dev);
struct ata_device *peer = ata_dev_pair(adev);
int dn = ap->port_no * 2 + adev->devno;
struct ata_timing at, apeer;
int T, UT;
const int amd_clock = 33333; /* KHz. */
u8 t;
T = 1000000000 / amd_clock;
UT = T;
if (clock >= 2)
UT = T / 2;
if (ata_timing_compute(adev, speed, &at, T, UT) < 0) {
dev_err(&pdev->dev, "unknown mode %d\\n", speed);
return;
}
if (peer) {
/* This may be over conservative */
if (peer->dma_mode) {
ata_timing_compute(peer, peer->dma_mode, &apeer, T, UT);
ata_timing_merge(&apeer, &at, &at, ATA_TIMING_8BIT);
}
ata_timing_compute(peer, peer->pio_mode, &apeer, T, UT);
ata_timing_merge(&apeer, &at, &at, ATA_TIMING_8BIT);
}
if (speed == XFER_UDMA_5 && amd_clock <= 33333) at.udma = 1;
if (speed == XFER_UDMA_6 && amd_clock <= 33333) at.udma = 15;
/*
* Now do the setup work
*/
/* Configure the address set up timing */
pci_read_config_byte(pdev, offset + 0x0C, &t);
t = (t & ~(3 << ((3 - dn) << 1))) | ((clamp_val(at.setup, 1, 4) - 1) << ((3 - dn) << 1));
pci_write_config_byte(pdev, offset + 0x0C , t);
/* Configure the 8bit I/O timing */
pci_write_config_byte(pdev, offset + 0x0E + (1 - (dn >> 1)),
((clamp_val(at.act8b, 1, 16) - 1) << 4) | (clamp_val(at.rec8b, 1, 16) - 1));
/* Drive timing */
pci_write_config_byte(pdev, offset + 0x08 + (3 - dn),
((clamp_val(at.active, 1, 16) - 1) << 4) | (clamp_val(at.recover, 1, 16) - 1));
switch (clock) {
case 1:
t = at.udma ? (0xc0 | (clamp_val(at.udma, 2, 5) - 2)) : 0x03;
break;
case 2:
t = at.udma ? (0xc0 | amd_cyc2udma[clamp_val(at.udma, 2, 10)]) : 0x03;
break;
case 3:
t = at.udma ? (0xc0 | amd_cyc2udma[clamp_val(at.udma, 1, 10)]) : 0x03;
break;
case 4:
t = at.udma ? (0xc0 | amd_cyc2udma[clamp_val(at.udma, 1, 15)]) : 0x03;
break;
default:
return;
}
/* UDMA timing */
if (at.udma)
pci_write_config_byte(pdev, offset + 0x10 + (3 - dn), t);
}
/**
* amd_pre_reset - perform reset handling
* @link: ATA link
* @deadline: deadline jiffies for the operation
*
* Reset sequence checking enable bits to see which ports are
* active.
*/
static int amd_pre_reset(struct ata_link *link, unsigned long deadline)
{
static const struct pci_bits amd_enable_bits[] = {
{ 0x40, 1, 0x02, 0x02 },
{ 0x40, 1, 0x01, 0x01 }
};
struct ata_port *ap = link->ap;
struct pci_dev *pdev = to_pci_dev(ap->host->dev);
if (!pci_test_config_bits(pdev, &amd_enable_bits[ap->port_no]))
return -ENOENT;
return ata_sff_prereset(link, deadline);
}
/**
* amd_cable_detect - report cable type
* @ap: port
*
* AMD controller/BIOS setups record the cable type in word 0x42
*/
static int amd_cable_detect(struct ata_port *ap)
{
static const u32 bitmask[2] = {0x03, 0x0C};
struct pci_dev *pdev = to_pci_dev(ap->host->dev);
u8 ata66;
pci_read_config_byte(pdev, 0x42, &ata66);
if (ata66 & bitmask[ap->port_no])
return ATA_CBL_PATA80;
return ATA_CBL_PATA40;
}
/**
* amd_fifo_setup - set the PIO FIFO for ATA/ATAPI
* @ap: ATA interface
* @adev: ATA device
*
* Set the PCI fifo for this device according to the devices present
* on the bus at this point in time. We need to turn the post write buffer
* off for ATAPI devices as we may need to issue a word sized write to the
* device as the final I/O
*/
static void amd_fifo_setup(struct ata_port *ap)
{
struct ata_device *adev;
struct pci_dev *pdev = to_pci_dev(ap->host->dev);
static const u8 fifobit[2] = { 0xC0, 0x30};
u8 fifo = fifobit[ap->port_no];
u8 r;
ata_for_each_dev(adev, &ap->link, ENABLED) {
if (adev->class == ATA_DEV_ATAPI)
fifo = 0;
}
if (pdev->device == PCI_DEVICE_ID_AMD_VIPER_7411) /* FIFO is broken */
fifo = 0;
/* On the later chips the read prefetch bits become no-op bits */
pci_read_config_byte(pdev, 0x41, &r);
r &= ~fifobit[ap->port_no];
r |= fifo;
pci_write_config_byte(pdev, 0x41, r);
}
/**
* amd33_set_piomode - set initial PIO mode data
* @ap: ATA interface
* @adev: ATA device
*
* Program the AMD registers for PIO mode.
*/
static void amd33_set_piomode(struct ata_port *ap, struct ata_device *adev)
{
amd_fifo_setup(ap);
timing_setup(ap, adev, 0x40, adev->pio_mode, 1);
}
static void amd66_set_piomode(struct ata_port *ap, struct ata_device *adev)
{
amd_fifo_setup(ap);
timing_setup(ap, adev, 0x40, adev->pio_mode, 2);
}
static void amd100_set_piomode(struct ata_port *ap, struct ata_device *adev)
{
amd_fifo_setup(ap);
timing_setup(ap, adev, 0x40, adev->pio_mode, 3);
}
static void amd133_set_piomode(struct ata_port *ap, struct ata_device *adev)
{
amd_fifo_setup(ap);
timing_setup(ap, adev, 0x40, adev->pio_mode, 4);
}
/**
* amd33_set_dmamode - set initial DMA mode data
* @ap: ATA interface
* @adev: ATA device
*
* Program the MWDMA/UDMA modes for the AMD and Nvidia
* chipset.
*/
static void amd33_set_dmamode(struct ata_port *ap, struct ata_device *adev)
{
timing_setup(ap, adev, 0x40, adev->dma_mode, 1);
}
static void amd66_set_dmamode(struct ata_port *ap, struct ata_device *adev)
{
timing_setup(ap, adev, 0x40, adev->dma_mode, 2);
}
static void amd100_set_dmamode(struct ata_port *ap, struct ata_device *adev)
{
timing_setup(ap, adev, 0x40, adev->dma_mode, 3);
}
static void amd133_set_dmamode(struct ata_port *ap, struct ata_device *adev)
{
timing_setup(ap, adev, 0x40, adev->dma_mode, 4);
}
/* Both host-side and drive-side detection results are worthless on NV
* PATAs. Ignore them and just follow what BIOS configured. Both the
* current configuration in PCI config reg and ACPI GTM result are
* cached during driver attach and are consulted to select transfer
* mode.
*/
static unsigned long nv_mode_filter(struct ata_device *dev,
unsigned long xfer_mask)
{
static const unsigned int udma_mask_map[] =
{ ATA_UDMA2, ATA_UDMA1, ATA_UDMA0, 0,
ATA_UDMA3, ATA_UDMA4, ATA_UDMA5, ATA_UDMA6 };
struct ata_port *ap = dev->link->ap;
char acpi_str[32] = "";
u32 saved_udma, udma;
const struct ata_acpi_gtm *gtm;
unsigned long bios_limit = 0, acpi_limit = 0, limit;
/* find out what BIOS configured */
udma = saved_udma = (unsigned long)ap->host->private_data;
if (ap->port_no == 0)
udma >>= 16;
if (dev->devno == 0)
udma >>= 8;
if ((udma & 0xc0) == 0xc0)
bios_limit = ata_pack_xfermask(0, 0, udma_mask_map[udma & 0x7]);
/* consult ACPI GTM too */
gtm = ata_acpi_init_gtm(ap);
if (gtm) {
acpi_limit = ata_acpi_gtm_xfermask(dev, gtm);
snprintf(acpi_str, sizeof(acpi_str), " (%u:%u:0x%x)",
gtm->drive[0].dma, gtm->drive[1].dma, gtm->flags);
}
/* be optimistic, EH can take care of things if something goes wrong */
limit = bios_limit | acpi_limit;
/* If PIO or DMA isn't configured at all, don't limit. Let EH
* handle it.
*/
if (!(limit & ATA_MASK_PIO))
limit |= ATA_MASK_PIO;
if (!(limit & (ATA_MASK_MWDMA | ATA_MASK_UDMA)))
limit |= ATA_MASK_MWDMA | ATA_MASK_UDMA;
/* PIO4, MWDMA2, UDMA2 should always be supported regardless of
cable detection result */
limit |= ata_pack_xfermask(ATA_PIO4, ATA_MWDMA2, ATA_UDMA2);
ata_port_dbg(ap, "nv_mode_filter: 0x%lx&0x%lx->0x%lx, "
"BIOS=0x%lx (0x%x) ACPI=0x%lx%s\\n",
xfer_mask, limit, xfer_mask & limit, bios_limit,
saved_udma, acpi_limit, acpi_str);
return xfer_mask & limit;
}
/**
* nv_probe_init - cable detection
* @lin: ATA link
*
* Perform cable detection. The BIOS stores this in PCI config
* space for us.
*/
static int nv_pre_reset(struct ata_link *link, unsigned long deadline)
{
static const struct pci_bits nv_enable_bits[] = {
{ 0x50, 1, 0x02, 0x02 },
{ 0x50, 1, 0x01, 0x01 }
};
struct ata_port *ap = link->ap;
struct pci_dev *pdev = to_pci_dev(ap->host->dev);
if (!pci_test_config_bits(pdev, &nv_enable_bits[ap->port_no]))
return -ENOENT;
return ata_sff_prereset(link, deadline);
}
/**
* nv100_set_piomode - set initial PIO mode data
* @ap: ATA interface
* @adev: ATA device
*
* Program the AMD registers for PIO mode.
*/
static void nv100_set_piomode(struct ata_port *ap, struct ata_device *adev)
{
timing_setup(ap, adev, 0x50, adev->pio_mode, 3);
}
static void nv133_set_piomode(struct ata_port *ap, struct ata_device *adev)
{
timing_setup(ap, adev, 0x50, adev->pio_mode, 4);
}
/**
* nv100_set_dmamode - set initial DMA mode data
* @ap: ATA interface
* @adev: ATA device
*
* Program the MWDMA/UDMA modes for the AMD and Nvidia
* chipset.
*/
static void nv100_set_dmamode(struct ata_port *ap, struct ata_device *adev)
{
timing_setup(ap, adev, 0x50, adev->dma_mode, 3);
}
static void nv133_set_dmamode(struct ata_port *ap, struct ata_device *adev)
{
timing_setup(ap, adev, 0x50, adev->dma_mode, 4);
}
static void nv_host_stop(struct ata_host *host)
{
u32 udma = (unsigned long)host->private_data;
/* restore PCI config register 0x60 */
pci_write_config_dword(to_pci_dev(host->dev), 0x60, udma);
}
static struct scsi_host_template amd_sht = {
ATA_BMDMA_SHT(DRV_NAME),
};
static const struct ata_port_operations amd_base_port_ops = {
.inherits = &ata_bmdma32_port_ops,
.prereset = amd_pre_reset,
};
static struct ata_port_operations amd33_port_ops = {
.inherits = &amd_base_port_ops,
.cable_detect = ata_cable_40wire,
.set_piomode = amd33_set_piomode,
.set_dmamode = amd33_set_dmamode,
};
static struct ata_port_operations amd66_port_ops = {
.inherits = &amd_base_port_ops,
.cable_detect = ata_cable_unknown,
.set_piomode = amd66_set_piomode,
.set_dmamode = amd66_set_dmamode,
};
static struct ata_port_operations amd100_port_ops = {
.inherits = &amd_base_port_ops,
.cable_detect = ata_cable_unknown,
.set_piomode = amd100_set_piomode,
.set_dmamode = amd100_set_dmamode,
};
static struct ata_port_operations amd133_port_ops = {
.inherits = &amd_base_port_ops,
.cable_detect = amd_cable_detect,
.set_piomode = amd133_set_piomode,
.set_dmamode = amd133_set_dmamode,
};
static const struct ata_port_operations nv_base_port_ops = {
.inherits = &ata_bmdma_port_ops,
.cable_detect = ata_cable_ignore,
.mode_filter = nv_mode_filter,
.prereset = nv_pre_reset,
.host_stop = nv_host_stop,
};
static struct ata_port_operations nv100_port_ops = {
.inherits = &nv_base_port_ops,
.set_piomode = nv100_set_piomode,
.set_dmamode = nv100_set_dmamode,
};
static struct ata_port_operations nv133_port_ops = {
.inherits = &nv_base_port_ops,
.set_piomode = nv133_set_piomode,
.set_dmamode = nv133_set_dmamode,
};
static void amd_clear_fifo(struct pci_dev *pdev)
{
u8 fifo;
/* Disable the FIFO, the FIFO logic will re-enable it as
appropriate */
pci_read_config_byte(pdev, 0x41, &fifo);
fifo &= 0x0F;
pci_write_config_byte(pdev, 0x41, fifo);
}
static int amd_init_one(struct pci_dev *pdev, const struct pci_device_id *id)
{
static const struct ata_port_info info[10] = {
{ /* 0: AMD 7401 - no swdma */
.flags = ATA_FLAG_SLAVE_POSS,
.pio_mask = ATA_PIO4,
.mwdma_mask = ATA_MWDMA2,
.udma_mask = ATA_UDMA2,
.port_ops = &amd33_port_ops
},
{ /* 1: Early AMD7409 - no swdma */
.flags = ATA_FLAG_SLAVE_POSS,
.pio_mask = ATA_PIO4,
.mwdma_mask = ATA_MWDMA2,
.udma_mask = ATA_UDMA4,
.port_ops = &amd66_port_ops
},
{ /* 2: AMD 7409 */
.flags = ATA_FLAG_SLAVE_POSS,
.pio_mask = ATA_PIO4,
.mwdma_mask = ATA_MWDMA2,
.udma_mask = ATA_UDMA4,
.port_ops = &amd66_port_ops
},
{ /* 3: AMD 7411 */
.flags = ATA_FLAG_SLAVE_POSS,
.pio_mask = ATA_PIO4,
.mwdma_mask = ATA_MWDMA2,
.udma_mask = ATA_UDMA5,
.port_ops = &amd100_port_ops
},
{ /* 4: AMD 7441 */
.flags = ATA_FLAG_SLAVE_POSS,
.pio_mask = ATA_PIO4,
.mwdma_mask = ATA_MWDMA2,
.udma_mask = ATA_UDMA5,
.port_ops = &amd100_port_ops
},
{ /* 5: AMD 8111 - no swdma */
.flags = ATA_FLAG_SLAVE_POSS,
.pio_mask = ATA_PIO4,
.mwdma_mask = ATA_MWDMA2,
.udma_mask = ATA_UDMA6,
.port_ops = &amd133_port_ops
},
{ /* 6: AMD 8111 UDMA 100 (Serenade) - no swdma */
.flags = ATA_FLAG_SLAVE_POSS,
.pio_mask = ATA_PIO4,
.mwdma_mask = ATA_MWDMA2,
.udma_mask = ATA_UDMA5,
.port_ops = &amd133_port_ops
},
{ /* 7: Nvidia Nforce */
.flags = ATA_FLAG_SLAVE_POSS,
.pio_mask = ATA_PIO4,
.mwdma_mask = ATA_MWDMA2,
.udma_mask = ATA_UDMA5,
.port_ops = &nv100_port_ops
},
{ /* 8: Nvidia Nforce2 and later - no swdma */
.flags = ATA_FLAG_SLAVE_POSS,
.pio_mask = ATA_PIO4,
.mwdma_mask = ATA_MWDMA2,
.udma_mask = ATA_UDMA6,
.port_ops = &nv133_port_ops
},
{ /* 9: AMD CS5536 (Geode companion) */
.flags = ATA_FLAG_SLAVE_POSS,
.pio_mask = ATA_PIO4,
.mwdma_mask = ATA_MWDMA2,
.udma_mask = ATA_UDMA5,
.port_ops = &amd100_port_ops
}
};
const struct ata_port_info *ppi[] = { NULL, NULL };
int type = id->driver_data;
void *hpriv = NULL;
u8 fifo;
int rc;
ata_print_version_once(&pdev->dev, DRV_VERSION);
rc = pcim_enable_device(pdev);
if (rc)
return rc;
pci_read_config_byte(pdev, 0x41, &fifo);
/* Check for AMD7409 without swdma errata and if found adjust type */
if (type == 1 && pdev->revision > 0x7)
type = 2;
/* Serenade ? */
if (type == 5 && pdev->subsystem_vendor == PCI_VENDOR_ID_AMD &&
pdev->subsystem_device == PCI_DEVICE_ID_AMD_SERENADE)
type = 6; /* UDMA 100 only */
/*
* Okay, type is determined now. Apply type-specific workarounds.
*/
ppi[0] = &info[type];
if (type < 3)
ata_pci_bmdma_clear_simplex(pdev);
if (pdev->vendor == PCI_VENDOR_ID_AMD)
amd_clear_fifo(pdev);
/* Cable detection on Nvidia chips doesn't work too well,
* cache BIOS programmed UDMA mode.
*/
if (type == 7 || type == 8) {
u32 udma;
pci_read_config_dword(pdev, 0x60, &udma);
hpriv = (void *)(unsigned long)udma;
}
/* And fire it up */
return ata_pci_bmdma_init_one(pdev, ppi, &amd_sht, hpriv, 0);
}
#ifdef CONFIG_PM_SLEEP
static int amd_reinit_one(struct pci_dev *pdev)
{
struct ata_host *host = pci_get_drvdata(pdev);
int rc;
rc = ata_pci_device_do_resume(pdev);
if (rc)
return rc;
if (pdev->vendor == PCI_VENDOR_ID_AMD) {
amd_clear_fifo(pdev);
if (pdev->device == PCI_DEVICE_ID_AMD_VIPER_7409 ||
pdev->device == PCI_DEVICE_ID_AMD_COBRA_7401)
ata_pci_bmdma_clear_simplex(pdev);
}
ata_host_resume(host);
return 0;
}
#endif
static const struct pci_device_id amd[] = {
{ PCI_VDEVICE(AMD, PCI_DEVICE_ID_AMD_COBRA_7401), 0 },
{ PCI_VDEVICE(AMD, PCI_DEVICE_ID_AMD_VIPER_7409), 1 },
{ PCI_VDEVICE(AMD, PCI_DEVICE_ID_AMD_VIPER_7411), 3 },
{ PCI_VDEVICE(AMD, PCI_DEVICE_ID_AMD_OPUS_7441), 4 },
{ PCI_VDEVICE(AMD, PCI_DEVICE_ID_AMD_8111_IDE), 5 },
{ PCI_VDEVICE(NVIDIA, PCI_DEVICE_ID_NVIDIA_NFORCE_IDE), 7 },
{ PCI_VDEVICE(NVIDIA, PCI_DEVICE_ID_NVIDIA_NFORCE2_IDE), 8 },
{ PCI_VDEVICE(NVIDIA, PCI_DEVICE_ID_NVIDIA_NFORCE2S_IDE), 8 },
{ PCI_VDEVICE(NVIDIA, PCI_DEVICE_ID_NVIDIA_NFORCE3_IDE), 8 },
{ PCI_VDEVICE(NVIDIA, PCI_DEVICE_ID_NVIDIA_NFORCE3S_IDE), 8 },
{ PCI_VDEVICE(NVIDIA, PCI_DEVICE_ID_NVIDIA_NFORCE_CK804_IDE), 8 },
{ PCI_VDEVICE(NVIDIA, PCI_DEVICE_ID_NVIDIA_NFORCE_MCP04_IDE), 8 },
{ PCI_VDEVICE(NVIDIA, PCI_DEVICE_ID_NVIDIA_NFORCE_MCP51_IDE), 8 },
{ PCI_VDEVICE(NVIDIA, PCI_DEVICE_ID_NVIDIA_NFORCE_MCP55_IDE), 8 },
{ PCI_VDEVICE(NVIDIA, PCI_DEVICE_ID_NVIDIA_NFORCE_MCP61_IDE), 8 },
{ PCI_VDEVICE(NVIDIA, PCI_DEVICE_ID_NVIDIA_NFORCE_MCP65_IDE), 8 },
{ PCI_VDEVICE(NVIDIA, PCI_DEVICE_ID_NVIDIA_NFORCE_MCP67_IDE), 8 },
{ PCI_VDEVICE(NVIDIA, PCI_DEVICE_ID_NVIDIA_NFORCE_MCP73_IDE), 8 },
{ PCI_VDEVICE(NVIDIA, PCI_DEVICE_ID_NVIDIA_NFORCE_MCP77_IDE), 8 },
{ PCI_VDEVICE(AMD, PCI_DEVICE_ID_AMD_CS5536_IDE), 9 },
{ PCI_VDEVICE(AMD, PCI_DEVICE_ID_AMD_CS5536_DEV_IDE), 9 },
{ },
};
static struct pci_driver amd_pci_driver = {
.name = DRV_NAME,
.id_table = amd,
.probe = amd_init_one,
.remove = ata_pci_remove_one,
#ifdef CONFIG_PM_SLEEP
.suspend = ata_pci_device_suspend,
.resume = amd_reinit_one,
#endif
};
module_pci_driver(amd_pci_driver);
MODULE_AUTHOR("Alan Cox");
MODULE_DESCRIPTION("low-level driver for AMD and Nvidia PATA IDE");
MODULE_LICENSE("GPL");
MODULE_DEVICE_TABLE(pci, amd);
MODULE_VERSION(DRV_VERSION);
|
Hitting the net is the best way to win their hearts but he insists no Celtic player can ever sit back and relax.
Ciftci said: “There is the pressure you put on yourself. There is always pressure at this club.
“That will never go away on a Saturday or for a European game. The pressure will never ease off. You have to just deal with it and be able to give everything you have. You can’t do more than that.
“I feel that love every time. Even coming on, the fans have always been good to me. They always expect high things from every player no matter how much they play, that is how it is.
“It is a big club so you need to deal with that. Hopefully I have given them a lot today. I am very pleased. We got three points, that was very important. After the tough game on Thursday, travelling and the heavy pitch it was a great team performance and a great three points.
“It is always good to get goals but, like I say, it is all about the team, all about getting points.
“I am lucky to be on the end of the two goals but if I didn’t have my team-mates I wouldn’t be on them. It was a good game.”
Ciftci has started back-to-back matches for the first time but admitted he’ll need to be at his best with Leigh Griffiths and now Carlton Cole breathing down his neck.
Griffiths has missed the last couple of games with a calf injury but is close to a return.
Cole is building his fitness after a spell on the sidelines and it won’t be long before he’s banging on the door.
Ciftci’s hoping to keep hold of the jersey and was delighted to boost his case in Perth.
He said: “If you want to be a great player there will always be competition. If you want to make steps at a big club like Celtic you won’t be the only player in one position. There will always be a lot of players competing for a place and everybody will fight for it.
“Everybody wants an opportunity, not just me. Every player who comes on the pitch wants a chance and when he gets it he needs to show the same things the gaffer asks him no matter what position he plays.
“Hopefully I have done that today and I will hopefully do that whenever I get the chance.”
Ciftci was happy to hit the net with a little help from his friends and he insisted the Celtic squad came together to rally round Emilio Izaguirre.
Boss Deila gave him the option to sit out against St Johnstone but Izaguirre was determined to pay tribute to his friend with a superb performance and a message of support on his T-shirt under his jersey.
Emilio Izaguirre pays his respects to late friend Arnold Peralta during the minute's applause at McDiarmid Park (Image: SNS Group)
Ciftci admitted it was a troubling time for Izaguirre and he revealed the Hoops players did their bit to support their grief-stricken team-mate.
The former NAC Breda man said: “It is always sad to lose a very good friend and team-mate. We all tried to cheer him up a bit and as you could see today he was concentrated and played a very good game.
“I think the whole team did. It is not easy but he dealt with it professionally and he did very well.
“It is all about professionalism – and what happens outside football in our private life is different to when you are on the pitch and delivering. And he has done very well.”
Ciftci didn’t do badly himself and his manager was quietly thrilled to see the striker get back on the goal trail.
Deila doesn’t exactly have an abundance of attackers to pick from and he admitted there’s been an over-reliance on Griffiths this term.
Ciftci is up and running though and Deila said: “You have to play to score. Leigh has been unbelievable this season with the goals he’s scored and you don’t take away a goalscorer.
“Carlton is coming too and I’m so happy for Nadir. He’s had two games in a row and we know he can bring things to the team.
“He scored two goals and today he was strong. That makes it better for everybody that we don’t need to rely on Leigh for everything.” |
What’s New in Weeklys – 9/18/2013
There are no additions or deletions on the Weeklys list that came out today. However, in response to a question I got during a webcast, I did a quick count of what is on the list. There are 269 underlying markets with short dated options available tomorrow morning. Of those 130 have serial options available. This means there are contracts trading through each of the next five Fridays. Since we are just about to enter earnings season in a few weeks this is going to enhance the ability to trade around the extra volatility that occurs around earnings announcements.
Speaking of earnings, there are three stocks with short dated options available that report earnings next week. On Wednesday Accenture (ACN – 77.79) and Nike (NKE – 69.48) are scheduled to report their numbers after the close. On Thursday before the market opens we will get an update from Blackberry (BBRY – 10.40) as they release their numbers.
ACN will report next Wednesday afternoon (9/25). I normally do not comment on the fundamental earnings numbers and focus more on what the stock has done in reaction to earnings in the past, but something stood out when I looked at Accenture’s earnings history. The company has beaten the consensus Wall Street estimate for 13 quarters in a row. The last time they missed the number was in March of 2010. However, do be aware that despite beating the number several times in a row the stock can sell off after earnings. The stock’s earnings reaction three months ago was a drop of 10.3%. The absolute average of the price change after earnings has been less than half this 10% drop. Looking at the last twelve earnings releases, the average the stock moves higher or lower is by 4.3%. It will be interesting to see what the market prices in leading up to the earnings release.
NKE also releases earnings next Wednesday afternoon. The average earning reaction for NKE over the last twelve reports has been 5.7%. The last report resulted in a 2.2% price change so it may be interesting to see if low volatility is priced going into NKE’s earnings based on the muted reaction three months ago.
Rounding out high profile earnings releases for next week will be Blackberry which reports Thursday before the open. BBRY dropped 27.8% on the last earnings release and lost 0.8% two earnings releases ago. The average move is about 12.4% higher or lower as the company has been going through a transitional phase. Needless to say, this is always fun one to watch.
Russell Rhoads, CFA, is a Senior Instructor with the Options Institute at the Chicago Board Options Exchange. He joined the Institute in 2008 after a career as an investment analyst and trader with a variety of firms including Highland Capital Management, Caldwell & Orkin Investment Counsel, TradeLink Securities and… read more
Legal & Other Links
CBOE
Options involve risk and are not suitable for all investors. Prior to buying or selling an option, a person must receive a copy of Characteristics and Risks of Standardized Options (ODD). Copies of the ODD are available from your broker, by calling 1-888-OPTIONS, or from The Options Clearing Corporation, One North Wacker Drive, Suite 500, Chicago, Illinois 60606. The information on this website is provided solely for general education and information purposes and therefore should not be considered complete, precise, or current. Many of the matters discussed are subject to detailed rules, regulations, and statutory provisions which should be referred to for additional detail and are subject to changes that may not be reflected in the website information. No statement within the website should be construed as a recommendation to buy or sell a security or to provide investment advice. The inclusion of non-CBOE advertisements on the website should not be construed as an endorsement or an indication of the value of any product, service, or website. The Terms and Conditions govern use of this website and use of this website will be deemed acceptance of those Terms and Conditions. |
/*
* Copyright (c) 2016 Thomas Pornin <pornin@bolet.org>
*
* Permission is hereby granted, free of charge, to any person obtaining
* a copy of this software and associated documentation files (the
* "Software"), to deal in the Software without restriction, including
* without limitation the rights to use, copy, modify, merge, publish,
* distribute, sublicense, and/or sell copies of the Software, and to
* permit persons to whom the Software is furnished to do so, subject to
* the following conditions:
*
* The above copyright notice and this permission notice shall be
* included in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
* BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
* ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
* CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
* SOFTWARE.
*/
#ifndef BR_BEARSSL_HMAC_H__
#define BR_BEARSSL_HMAC_H__
#include <stddef.h>
#include <stdint.h>
#include "t_bearssl_hash.h"
#ifdef __cplusplus
extern "C" {
#endif
/** \\file bearssl_hmac.h
*
* # HMAC
*
* HMAC is initialized with a key and an underlying hash function; it
* then fills a "key context". That context contains the processed
* key.
*
* With the key context, a HMAC context can be initialized to process
* the input bytes and obtain the MAC output. The key context is not
* modified during that process, and can be reused.
*
* IMPORTANT: HMAC shall be used only with functions that have the
* following properties:
*
* - hash output size does not exceed 64 bytes;
* - hash internal state size does not exceed 64 bytes;
* - internal block length is a power of 2 between 16 and 256 bytes.
*/
/**
* \\brief HMAC key context.
*
* The HMAC key context is initialised with a hash function implementation
* and a secret key. Contents are opaque (callers should not access them
* directly). The caller is responsible for allocating the context where
* appropriate. Context initialisation and usage incurs no dynamic
* allocation, so there is no release function.
*/
typedef struct {
#ifndef BR_DOXYGEN_IGNORE
const br_hash_class *dig_vtable;
unsigned char ksi[64], kso[64];
#endif
} br_hmac_key_context;
/**
* \\brief HMAC key context initialisation.
*
* Initialise the key context with the provided key, using the hash function
* identified by `digest_vtable`. This supports arbitrary key lengths.
*
* \\param kc HMAC key context to initialise.
* \\param digest_vtable pointer to the hash function implementation vtable.
* \\param key pointer to the HMAC secret key.
* \\param key_len HMAC secret key length (in bytes).
*/
void br_hmac_key_init(br_hmac_key_context *kc,
const br_hash_class *digest_vtable, const void *key, size_t key_len);
/*
* \\brief Get the underlying hash function.
*
* This function returns a pointer to the implementation vtable of the
* hash function used for this HMAC key context.
*
* \\param kc HMAC key context.
* \\return the hash function implementation.
*/
static inline const br_hash_class *br_hmac_key_get_digest(
const br_hmac_key_context *kc)
{
return kc->dig_vtable;
}
/**
* \\brief HMAC computation context.
*
* The HMAC computation context maintains the state for a single HMAC
* computation. It is modified as input bytes are injected. The context
* is caller-allocated and has no release function since it does not
* dynamically allocate external resources. Its contents are opaque.
*/
typedef struct {
#ifndef BR_DOXYGEN_IGNORE
br_hash_compat_context dig;
unsigned char kso[64];
size_t out_len;
#endif
} br_hmac_context;
/**
* \\brief HMAC computation initialisation.
*
* Initialise a HMAC context with a key context. The key context is
* unmodified. Relevant data from the key context is immediately copied;
* the key context can thus be independently reused, modified or released
* without impacting this HMAC computation.
*
* An explicit output length can be specified; the actual output length
* will be the minimum of that value and the natural HMAC output length.
* If `out_len` is 0, then the natural HMAC output length is selected. The
* "natural output length" is the output length of the underlying hash
* function.
*
* \\param ctx HMAC context to initialise.
* \\param kc HMAC key context (already initialised with the key).
* \\param out_len HMAC output length (0 to select "natural length").
*/
void br_hmac_init(br_hmac_context *ctx,
const br_hmac_key_context *kc, size_t out_len);
/**
* \\brief Get the HMAC output size.
*
* The HMAC output size is the number of bytes that will actually be
* produced with `br_hmac_out()` with the provided context. This function
* MUST NOT be called on a non-initialised HMAC computation context.
* The returned value is the minimum of the HMAC natural length (output
* size of the underlying hash function) and the `out_len` parameter which
* was used with the last `br_hmac_init()` call on that context (if the
* initialisation `out_len` parameter was 0, then this function will
* return the HMAC natural length).
*
* \\param ctx the (already initialised) HMAC computation context.
* \\return the HMAC actual output size.
*/
static inline size_t
br_hmac_size(br_hmac_context *ctx)
{
return ctx->out_len;
}
/*
* \\brief Get the underlying hash function.
*
* This function returns a pointer to the implementation vtable of the
* hash function used for this HMAC context.
*
* \\param hc HMAC context.
* \\return the hash function implementation.
*/
static inline const br_hash_class *br_hmac_get_digest(
const br_hmac_context *hc)
{
return hc->dig.vtable;
}
/**
* \\brief Inject some bytes in HMAC.
*
* The provided `len` bytes are injected as extra input in the HMAC
* computation incarnated by the `ctx` HMAC context. It is acceptable
* that `len` is zero, in which case `data` is ignored (and may be
* `NULL`) and this function does nothing.
*/
void br_hmac_update(br_hmac_context *ctx, const void *data, size_t len);
/**
* \\brief Compute the HMAC output.
*
* The destination buffer MUST be large enough to accommodate the result;
* its length is at most the "natural length" of HMAC (i.e. the output
* length of the underlying hash function). The context is NOT modified;
* further bytes may be processed. Thus, "partial HMAC" values can be
* efficiently obtained.
*
* Returned value is the output length (in bytes).
*
* \\param ctx HMAC computation context.
* \\param out destination buffer for the HMAC output.
* \\return the produced value length (in bytes).
*/
size_t br_hmac_out(const br_hmac_context *ctx, void *out);
/**
* \\brief Constant-time HMAC computation.
*
* This function compute the HMAC output in constant time. Some extra
* input bytes are processed, then the output is computed. The extra
* input consists in the `len` bytes pointed to by `data`. The `len`
* parameter must lie between `min_len` and `max_len` (inclusive);
* `max_len` bytes are actually read from `data`. Computing time (and
* memory access pattern) will not depend upon the data byte contents or
* the value of `len`.
*
* The output is written in the `out` buffer, that MUST be large enough
* to receive it.
*
* The difference `max_len - min_len` MUST be less than 2<sup>30</sup>
* (i.e. about one gigabyte).
*
* This function computes the output properly only if the underlying
* hash function uses MD padding (i.e. MD5, SHA-1, SHA-224, SHA-256,
* SHA-384 or SHA-512).
*
* The provided context is NOT modified.
*
* \\param ctx the (already initialised) HMAC computation context.
* \\param data the extra input bytes.
* \\param len the extra input length (in bytes).
* \\param min_len minimum extra input length (in bytes).
* \\param max_len maximum extra input length (in bytes).
* \\param out destination buffer for the HMAC output.
* \\return the produced value length (in bytes).
*/
size_t br_hmac_outCT(const br_hmac_context *ctx,
const void *data, size_t len, size_t min_len, size_t max_len,
void *out);
#ifdef __cplusplus
}
#endif
#endif
|
This invention relates to a disc brake adapted to be operated by a dual control liquid pressure system. In many vehicles, in order to obtain a safe and positive braking operation, brakes adapted to be operated by dual control liquid pressure systems have been and are being employed.
FIG. 1 of the accompanying drawings shows one of the prior art brakes of the above type in which a stepped piston is provided and in which during braking operation, liquid under pressure is supplied into hydraulic chambers A.sub.1 and A.sub.2 from a common master cylinder. When the brake is to be released, such release operation relies upon the elastic deformation or roll back of seals S.sub.1 and S.sub.2. Thus, in order to obtain rapid and positive separation between the disc and friction pads after a particular braking operation, the design preferably provides that all the seals between the piston and caliper produce a force due to the so-called roll back so as to retract the piston to its initial or non-application position, to thereby improve the operation efficiency. However, if only the seals S.sub.1 and S.sub.2 are employed (in which case, there would be no drain D provided because the liquid under pressure from the hydraulic chamber A.sub.2 would tend to flow out through the drain if any) and the seal S.sub.2 becomes damaged, although the liquid under pressure tends to flow out between the piston and caliper whereby damage on the seal S.sub.2 can be detected, when the seal S.sub.1 becomes damaged, communication is established between the hydraulic chambers A.sub.1 and A.sub.2, but damage to the seal S.sub.1 can not be detected. Therefore, in the prior art disc brake of FIG. 1, an additional intermediate seal S.sub.3 is positioned between the hydraulic chamber A.sub.2 and seal S.sub.1 and a drain D is provided extending from between the seals S.sub.1 and S.sub.3 to the exterior of the device. According to this design, if and when the seal S.sub.1 becomes damaged, the liquid under pressure within the hydraulic chamber A.sub.1 is prevented from flowing into the hydraulic chamber A.sub.2 by the presence of the additional intermediate seal S.sub.3 and is diverted to the exterior of the device through the drain D whereby damage to the seal S.sub.1 can be detected. However, the prior art disc brake as shown in FIG. 1 has the disadvantage that the roll back effect provided by the seals S.sub.1 and S.sub.2 is impeded by the seal S.sub.3. In other words, the seal S.sub.3 itself has no roll back effect (the roll back effect can not be obtained unless the direction of liquid pressure from the hydraulic chamber A.sub.2 to which the seal S.sub.3 is subjected corresponds to that in which the piston advances when the disc brake is applied) and thus, the resistance offered by the seal S.sub.3 tends to impede the roll back effect provided by the seals S.sub.1 and S.sub.2 and, thus, the sliding movement of the piston.
FIG. 2 of the accompanying drawings shows another prior art disc brake in which the piston employed is a cup-shaped piston and the additional intermediate seal S.sub.3 as shown in the prior art disc brake of FIG. 1 is eliminated because provision of the intermediate seal is difficult in the device of FIG. 2. When the disc brake is released, the piston is retracted to its initial or non-application position by the roll back effect. The seal S.sub.5 which separates the hydraulic chambers A.sub.3 and A.sub.4 is subjected to pressure on the opposite sides thereof or from the hydraulic chambers A.sub.3 and A.sub.4, and as a result, the seal S.sub.5 does not provide any roll back effect to thereby impede the roll back effect provided by the seal S.sub.4.
Therefore, in the above two prior art piston arrangement systems, it was difficult to obtain both proper designing of the additional or intermediate seal and proper provision of the roll back effect of the seals. |
Tooting Bec Athletics Track
Tooting Bec Athletics Track & Gym is an athletics stadium in Tooting Common, near Tooting Bec, Wandsworth, southwest London, England.
It is located on Tooting Bec Road. An annual race event on the track in September is the Self Transcendence 24 Hour Track Race London.
References
External links
Tooting Bec Athletics Track
Category:Buildings and structures in the London Borough of Wandsworth
Category:Athletics venues in London
Category:Tourist attractions in the London Borough of Wandsworth
Category:Sport in the London Borough of Wandsworth |
For B, you also need to understand that ratios work exactly like fractions: you can 'cancel' (i.e. divide each number in the ratio by the same thing) or you can 'un-cancel' (if there is such a word) by multiplying each number in the ratio by the same thing. |
Nothing Records discography
This is a catalog for Nothing Records, organized alphabetically by catalog number:
Catalog
Category:Record label discographies
Category:Rock music discographies
Discography |
Evaluation of different Bacillus strains in respect of their ability to produce Surfactin in a model fermentation process with integrated foam fractionation.
Biosurfactants increasingly gain attention due to the manifold of possible applications and production on the basis of renewable resources. Owing to its various characteristics, Surfactin is one of the most studied biosurfactants. Since its discovery, several Surfactin producers have been identified, but their capacity to produce Surfactin has not been evaluated in a comparison. Six different Bacillus strains were analyzed regarding their ability to produce Surfactin in model fermentations with integrated foam fractionation, for in situ product enrichment and removal. Three of the investigated strains are commonly used in Surfactin production (ATCC 21332, DSM 3256, DSM 3258), whereas two Bacillus strains are described for the first time (DSM 1090, LM43a50°C) as Surfactin producers. Additionally, the Bacillus subtilis type strain DSM 10(T) was included in the evaluation. Interestingly, all strains, except DSM 3256, featured high values for Surfactin recovered from foam in comparison to other studies, ranging between 0.4 and 1.05 g. The fermentation process was characterized by calculating procedural parameters like substrate yield Y X/S, product yield Y P/X, specific growth rate μ, specific productivity q Surfactin, volumetric productivity q Surfactin, Surfactin and bacterial enrichment as well as Surfactin recovery. The strains differ most in specific and volumetric productivity; nevertheless, it is evident that it is not possible to name a Bacillus strain that is the most appropriate for the production of Surfactin under these conditions. In contrast, it becomes apparent that the choice of a specific strain should depend on the applied fermentation conditions. |
The diagnosis and grading of dementia in population surveys: measuring disability.
Comparability in respect of severity of dementia and determination of the nature and degree of disabilities in daily living due to dementia are important in population-based surveys. In physical diseases impairment of a system or organ may be established independently of disability using the ICIDH framework but there are problems in measuring cognitive abilities apart from the characteristic behavioural limitations and aberrations that constitute the dementia syndrome. Both DSM-III-R and ICD-10 require as a criterion of dementia that social activities are interfered with, and the degree of dependency is the measure of severity. This suggests that assessment of disability should be the first objective, and the mental or physical causes uncovered next. A suitable informant may be the best judge of the nature of the disability. This procedure would show what services demented persons actually require, clarify the implications of dementia for estimates of active life-expectancy, and increase comparability between studies. Problems associated with this approach and the role of cognitive testing are briefly discussed. |
Richard Reck
Richard Reck
Richard Reck
Why Get Pre-Qualified?
1. Pre-qualification acts as a dry run of the loan application process. The mortgage lender will use details you provide about your credit, income, assets and debts to arrive at an estimate of how much mortgage you can afford. The whole process may take only minutes or a few hours at most, and is free.
2. While a "pre-qual" is non-binding to the lender (because the information you provide has not been verified), it does serve as a good indication to potential sellers of your general creditworthiness.
3. These days most sellers will NOT accept an offer without at least a pre-approval letter, so if you are serious about buying this is the first step towards getting you in your new home.
In my effort to treat others as I want to be treated, I am more interested in the quality of the service provided rather than the number of transactions completed. Because buying a house or selling your family home can be emotionally draining, your selection of the right person to represent you, who has your best interest at heart, is very important. As Residential and Commercial Real Estate Agent and Commercial Buyer for more than 20 years I have had dealing in a number of cities in the United States and a few foreign countries which more than qualifies me to assit you in achieving your real estate goals.
Deacon, Parish of the Resurrection (Youth, Homebound and Hospital programs)
VFW Member Post 7333 Randolph NJ
Tres Dias member
Cursillo member
Area of Expertise
While I more than qualified to perform all the responsibilities associated with the selling and purchasing Residential Real Estate in all Northern New Jersey, my preference is to concentrate in Randolph, Roxbury, Rockaway, Denville, Mt. Arlington, Morris Plains, Morris Township, Morristown, and Mt. Olive in Morris County.
In my more than 13 years of experience I have worked with, New Buyers, Downsizers, and Upsizers (new word). Customer References available upon request.
Personal Note
On a personal level, I have been married for more than 44 years and have two married daughters who have blessed me with four wonderful grandsons. I had a wonderful 35 year career in the Communications/Information Industry and am currently a Deacon in the Diocese of Paterson assigned to Resurrection Parish where I work on retreats with adults and young adults and have a number of other responsibilities. For more than 35 years I have been resident of Morris County, in Randolph and Mount Olive Townships. |
Cognitive functioning, weight change and therapy in anorexia nervosa.
Anorexia nervosa is associated with impairments in cognitive function which have been hypothesized to be fundamentally attentional in nature. The current study investigated whether therapy and weight gain affect these impairments. A group of anorexics (N = 12) completed a battery of cognitive performance tasks and self-report measures of psychopathology on three occasions, over the course of 12 weeks of in-patient treatment. A non-clinical control population (N = 17) completed the same measures. The anorexics improved on all measures of psychopathology and affective state as a result of therapy. Anorexics displayed poorer recall, reaction times, and motor speed than the control subjects. Although there was a gain in weight over the course of therapy, there was no corresponding improvement in cognitive performance. Impaired task performance in anorexics was not directly related to their psychopathology or affective state. |
Lethbridge College
Lethbridge College (previously Lethbridge Community College) opened in 1957 as the first publicly funded community college in Canada. Over 4,000 students attend the Lethbridge, Alberta, institution.
Lethbridge College is a member of the Alberta Rural Development Network.
History
Lethbridge Junior College opened in 1957 as the first publicly funded community college in Canada. On 14 February 2007, the College's Board of Governors voted to change the name of the college to "Lethbridge College".
Locations
Lethbridge College's main campus is in Lethbridge, with regional campuses in Claresholm, Vulcan County, and the Crowsnest Pass.
Academics
Lethbridge College offers preparatory studies, vocational training, and university transfer programs in 50 career fields, leading to one-year certificates, two-year diplomas, apprenticeships, and bachelor's degrees. Lethbridge College provides applied bachelor's degrees and has transfer agreements with the University of Alberta, Athabasca University, University of Calgary, and University of Lethbridge for students who wish to transfer and/or further their studies with a bachelor's degree.
Athletics
Lethbridge College competes in the Alberta Colleges Athletic Conference. The college fields men's and women's teams in basketball, soccer, volleyball, golf and cross country running. The teams are known as the Kodiaks.
The men's cross country team won the 2006 ACAC Championship, and the National Championship. The women's team also won National titles in 2003 and 2004. The women's basketball team won their second ACAC gold medal in 4 years, defeating defending champion Mount Royal College 67–59. They won the bronze medal at the 2006 Canadian Colleges Athletic Association National Championships in Cornwall, Ontario, where they defeated the Okanagan Lakers 79–77.
Media
Lethbridge College has an on-campus media organization called Lethbridge Campus Media, operated by the second-year students in the Digital Communications and Media program. Within the organization, students operate the online presence; Endeavour newspaper, published four times during the academic year; CRLC The Kodiak, an online radio station; and eNews, a news program broadcast through their website and locally through Shaw TV in the Winter semester. The students also create Expressions Magazine in the winter semester.
The students are responsible for writing and creating all editorial and commercial content as part of their course curriculum.
References
External links
Official site
Category:Education in Lethbridge
Category:Universities and colleges in Alberta
Category:Community colleges |
Q:
Congruence of angles axiom
In my geometry book, the following statement is provided as axiom of congruence.
Let $ABC$ and $A'B'C'$ be two triangles. If $AB \\equiv A'B'$, $AC \\equiv A'C'$ and $ \\angle BAC \\equiv B'A'C'$ then $ \\angle ABC \\equiv A'B'C'$
I honestly have no idea where this comes from. Note that we use this axiom to prove $SSS$, $ASA$ and $SAS$.
Could someone provide intuition for something like this? It has to be obvious if it's used as an axiom.. right? I'm having trouble memorising something like that and using it to prove things. Not to mention the order here is extremely important.
EDIT:
As an extra note in the book it says, if we change it to $AC \\equiv A'C'$ , $ AB \\equiv A'B'$ and $\\angle CAB = \\angle C'A'B'$ then $\\angle ACB \\equiv \\angle A'C'B'$
A:
I am not sure this is a satisfactory answer.
That assertion is essentially Euclid's Proposition 4 (SAS) in Book I:
If two triangles have two sides equal to two sides respectively, and
have the angles contained by the equal straight lines equal, then they
also have the base equal to the base, the triangle equals the
triangle, and the remaining angles equal the remaining angles
respectively, namely those opposite the equal sides.
The notes on Euclid's proof at
https://mathcs.clarku.edu/~djoyce/java/elements/bookI/propI4.html comment clearly on his use of an essentially undefined notion of congruence based on superimposing one triangle on another.
I suspect the author of your text was sufficiently unhappy with Euclid's argument that they created a new axiom instead, in order to get started on the interesting theorems.
You will probably never need to use it directly as an axiom once you've used it to prove SSS, ASA and SAS.
A:
Welcome to axiomatic mathematics!
Axioms are accepted not just on the basis of obviousness.
Yes, the truth of this statement should be obvious, as the comment of @MichaelHoppe remarks.
And yes, axioms and other mathematical statements can have a persnickety precision to them which requires you to memorize symbols in order. All I'll say to this is, you memorized your counting numbers once upon a time when you were much much younger, I'm sure you can memorize this axiom.
But the real point about formulating axioms is that they should be as narrowly formulated as possible, subject to the all important restriction that the entire rest of the theory can be derived from the axioms. Mathematicians HATE to accept things without proof. They just HATE it. If they have to accept an axiom, they want it to be formulated as narrowly as possible. In the case of this axiom, the hypotheses are the same as the stronger SAS theorem, but the conclusion is quite a bit narrower: all the conclusion asserts is equality of one specific angle pair.
The point is that from this narrow conclusion, many broader conclusions may be derived. For example, from the narrow conclusion of equality of one angle pair, one may prove equality of the other angle pair, as you have correctly noted in the edit at the bottom of your question. And then one can go on to prove other theorems about triangles such as SSS and so on. All from just one, narrow, very specifically formulated, special version of SAS! A mathematician loves that.
|
Monoculture Tree Plantations: Fuelling the Climate Fire
Tree plantations often replace natural ecosystems, or lands that were in process of ecosystem restoration. The replacement of forests by tree plantations is one of the main threats to the world’s biodiversity. Monoculture tree plantations also have a negative impact on water sources, as they tend to require the use of agrochemicals, and often exist of species like Pine and Eucalyptus that require an excessive amount of water. Alien invasive species like Eucalyptus (if planted outside its country of origin, Australia) are the second most important cause of global biodiversity loss. |
PressBox's inaugural Best Of Baltimore Sports is here, featuring more than 50 honorees, including best team, best newcomer, best stadium indulgence and much more.
Best Thing About Being A Baltimore Sports Fan
There isn't much more that can be said about Orioles center fielder Adam Jones that hasn't been said already.
He's the genuine article. In 2017, he again raised thousands of dollars for the Boys and Girls Club of Metropolitan Baltimore and took his time to be involved with the kids.
He also took on a leadership role within baseball after he was on the receiving end of racial taunts at Boston's Fenway Park to speak to an issue far bigger than baseball.
But as if all of that wasn't enough, he also said this during spring training:
"I'm here for one reason. I'm not here to be friends with anybody. I'm here to win, and at the end of the day, I think that's what we're all here for. From myself to PR people to general manager, everybody that scouts, I think we're all in the same mission ... to win a championship for Baltimore. If they want to have friends, I've got my own friends. I don't need any more friends. I'm here for one reason, and that's to win."
We need 1,000 more like him.
Year in and year out he makes us proud that his away jersey says "Baltimore" across the front. |
Q:
PHP/MySQL: Hashing common data
I am looking at my current database set up and it consists of a silly amount of user full home addresses in about 7 different tables, all with a varying degree of inconsistent data (due to the way people can type their postcode with/without spaces, for example).
The application in question is not yet live - not far off full completion but still not live, so any change now would be much easier than say 6 months down the line when there's a ridiculous amount of data in the tables.
Would it be worth my while to spend a few hours refactoring the code/database that handles user home addresses and instead of inserting the full one every time, using a hashing algorithm?
This would give us much greater consistency and could obviously be set up in a way that users could share an address hash and so therefore we could even search them by address much easier.
We currently use this method with storing user agents - hash the UA String and store it in its own separate table alongside a Medium Text column for the actual UA string to go, then instead we store the UA Hash in tables that require it (see below), and use SHA1. However, what options are available to me in terms of non-collision based hashing, but you've also seen to execute in the quickest possible time in a small-medium scale production environment?
This means that the two obvious ones, MD5/SHA1 are 100% not happening, and I don't really work with hashes bigger than that unfortunately.
For the record, for the password encryption I use password_hash so don't freak out!
Obviously a user's home address is much more important than a user agent string which is why I'm asking what you'd recommend.
Thanks
A:
For those of you wondering, I went with SHA256.
I didn't realise there's actually a function in openssl to benchmark hashing algorithms, which can be used like: openssl speed alg1 alg2 alg3 etc
Looking at the 64/256 byte results in the table below, although obviously it doesn't perform as quick as MD5/SHA1, I've decided its still quick enough for the production anyway.
I thought I'd post this and let anyone who doesn't know about openssl speed have a go.
[root@prod-use1a ec2-user]# openssl speed md5 sha1 sha256 sha512
Doing md5 for 3s on 16 size blocks: 9785239 md5's in 3.00s
Doing md5 for 3s on 64 size blocks: 7076501 md5's in 2.99s
Doing md5 for 3s on 256 size blocks: 3832312 md5's in 3.00s
Doing md5 for 3s on 1024 size blocks: 1363911 md5's in 3.00s
Doing md5 for 3s on 8192 size blocks: 194888 md5's in 3.00s
Doing sha1 for 3s on 16 size blocks: 10839355 sha1's in 3.00s
Doing sha1 for 3s on 64 size blocks: 7479305 sha1's in 2.99s
Doing sha1 for 3s on 256 size blocks: 4024302 sha1's in 3.00s
Doing sha1 for 3s on 1024 size blocks: 1478185 sha1's in 3.00s
Doing sha1 for 3s on 8192 size blocks: 227631 sha1's in 3.00s
Doing sha256 for 3s on 16 size blocks: 7984178 sha256's in 3.00s
Doing sha256 for 3s on 64 size blocks: 4370920 sha256's in 3.00s
Doing sha256 for 3s on 256 size blocks: 1904856 sha256's in 3.00s
Doing sha256 for 3s on 1024 size blocks: 589307 sha256's in 3.00s
Doing sha256 for 3s on 8192 size blocks: 77639 sha256's in 2.99s
Doing sha512 for 3s on 16 size blocks: 6481869 sha512's in 3.00s
Doing sha512 for 3s on 64 size blocks: 6479426 sha512's in 3.00s
Doing sha512 for 3s on 256 size blocks: 2425680 sha512's in 3.00s
Doing sha512 for 3s on 1024 size blocks: 869702 sha512's in 3.00s
Doing sha512 for 3s on 8192 size blocks: 120660 sha512's in 3.00s
The 'numbers' are in 1000s of bytes per second processed.
type 16 bytes 64 bytes 256 bytes 1024 bytes 8192 bytes
md5 52187.94k 151470.26k 327023.96k 465548.29k 532174.17k
sha1 57809.89k 160092.15k 343407.10k 504553.81k 621584.38k
sha256 42582.28k 93246.29k 162547.71k 201150.12k 212715.28k
sha512 34569.97k 138227.75k 206991.36k 296858.28k 329482.24k
[root@prod-use1a ec2-user]#
|
Q:
Assetics ou Gassetics?
I just run on Gassetics, seems to be the next gen of SF assets management. So far I used Assetics.
One question though : with Assetics I used to split files in order to load only needed one, using Twig parent() method :
{% block scripts %}
{{ parent() }}
{% javascripts
'@LCHAdminBundle/Resources/public/js/jquery.specific.addition.js'
%}
<script src="{{ asset_url }}"></script>
{% endjavascripts %}
{% endblock scripts %}
SO I could add on a specific page, only script needed and so was "forced" (in the noble way) to think and split my twig files accordingly.
Is it possible to do so with Gassetics? I jsut saw that you can specify back-end and front-end files, nothing more.
If I nest Twig files with Gassetic tag, will it do the trick?
EDIT : thanks to Wouter J. comment, I adjust my question :
In Assetics you explicitely specify files you want to include, giving the nesting ability. As in Gassetics you just add the tag which will be replaced during CSS/JS file generation, how do you achieve the same?
A:
You can do all of this in the gassetic config (see section yaml example with gassetic.yml in https://github.com/romanschejbal/gassetic).
Example gassetic.yml:
js:
files:
common.js:
- assets/vendor/jquery/jquery.js
- assets/vendor/angular/angular.js
page1.js:
- assets/vendor/lchadminbundle/jquery.specific.addition.js
common.html.twig:
{% block scripts %}
<!-- prod:common.js --><!-- endbuild -->
{% endblock scripts %}
page1.html.twig
{% extends 'common.html.twig' %}
{% block scripts %}
{{ parent() }}
<!-- prod:page1.js --><!-- endbuild -->
{% endblock scripts %}
This approach is better than nesting scripts in children templates, since the commonly needed files can be cached between page requests.
|
817 F.2d 754
*Ramirezv.I.N.S.
86-4449, 86-4450
United States Court of Appeals,Fifth Circuit.
4/15/87
1
I.N.S.
AFFIRMED
2
---------------
* Fed.R.App.P. 34(a); 5th Cir.R. 34.2.
|
Related Links
More Information
Nonprofits scramble to meet families' needs
Khalil Thomas, Ya'lan Walker and D'Vonte Thomas wait to fill up on turkey at Tuesday night's Thanksgiving dinner hosted by Eternal Bread of Life Outreach Ministries at the Robert L. Taylor Community Center.
PHOTO BY LESLEY DWYER
By LESLEY DWYER
Published: Tuesday, November 20, 2012 at 9:38 p.m.
Last Modified: Tuesday, November 20, 2012 at 9:38 p.m.
SARASOTA - With Thanksgiving just a day away and Christmas on the horizon, area nonprofits are struggling to provide take-home meals for people who depend on them to bring some holiday cheer.
Eternal Bread of Life Outreach Mission, which hosted a sit-down dinner Tuesday at the Robert Taylor Community Center, had requests from about 525 families for food that they could take home and make themselves on Thanksgiving.
After a last-minute scramble, Eternal Bread of Life was able to buy 465 turkeys and only came up 60 short.
But the nonprofit had to turn away another 100 families, said Shirley McArthur, who operates the outreach with her husband, the Rev. Neil McArthur.
Most of the turkeys were bought with a $1,500 donation, the couple said.
Meanwhile, Second Chance Last Opportunity — which hoped to give out take-home meals to 250 families — could only give out 58 complete meals by Tuesday afternoon. Still, CEO April Glasco said, “Everyone’s getting something.”
Suncoast Food Alliance dropped off boxes of produce, and Sunset KIA of Venice donated 20 $10 Butterball coupons. The agency was also handing out gift cards from Publix.
Donations can be dropped off until noon today. “We really need prepared meals,” Glasco said. “Some people don’t have the equipment or a place to cook a turkey.”
At Tuesday evening’s Eternal Bread of Life dinner, buses brought diners from the Salvation Army, Resurrection House and area assisted living facilities.
Anyone who asked was brought to the center to eat.
“We prepare for 1,000 people,” Shirley McArthur said. She and her husband have organized the feast for 22 years.
“The first year, we had about 300, but there have been years where over 1,000 came,” she said.
And although everything is donated, the setup is fit for a true Thanksgiving feast, with decorations, linen tablecloths, more than 75 pies and nearly an equal number of volunteers.
The Booker girls basketball team helped out and for the fourth year in a row, staff from Sarasota Periodontal Associates served the food.
“It makes us feel as good as it makes them feel,” volunteer Lewis Hanan said. “It’s a good way for us to start off the holiday season.”
<p><em>SARASOTA</em> - With Thanksgiving just a day away and Christmas on the horizon, area nonprofits are struggling to provide take-home meals for people who depend on them to bring some holiday cheer.</p><p>Eternal Bread of Life Outreach Mission, which hosted a sit-down dinner Tuesday at the Robert Taylor Community Center, had requests from about 525 families for food that they could take home and make themselves on Thanksgiving.</p><p>After a last-minute scramble, Eternal Bread of Life was able to buy 465 turkeys and only came up 60 short.</p><p>But the nonprofit had to turn away another 100 families, said Shirley McArthur, who operates the outreach with her husband, the Rev. Neil McArthur.</p><p>Most of the turkeys were bought with a $1,500 donation, the couple said.</p><p>Meanwhile, Second Chance Last Opportunity — which hoped to give out take-home meals to 250 families — could only give out 58 complete meals by Tuesday afternoon. Still, CEO April Glasco said, “Everyone's getting something.”</p><p>Suncoast Food Alliance dropped off boxes of produce, and Sunset KIA of Venice donated 20 $10 Butterball coupons. The agency was also handing out gift cards from Publix.</p><p>Donations can be dropped off until noon today. “We really need prepared meals,” Glasco said. “Some people don't have the equipment or a place to cook a turkey.”</p><p>At Tuesday evening's Eternal Bread of Life dinner, buses brought diners from the Salvation Army, Resurrection House and area assisted living facilities.</p><p>Anyone who asked was brought to the center to eat.</p><p>“We prepare for 1,000 people,” Shirley McArthur said. She and her husband have organized the feast for 22 years.</p><p>“The first year, we had about 300, but there have been years where over 1,000 came,” she said.</p><p>And although everything is donated, the setup is fit for a true Thanksgiving feast, with decorations, linen tablecloths, more than 75 pies and nearly an equal number of volunteers.</p><p>The Booker girls basketball team helped out and for the fourth year in a row, staff from Sarasota Periodontal Associates served the food.</p><p>“It makes us feel as good as it makes them feel,” volunteer Lewis Hanan said. “It's a good way for us to start off the holiday season.”</p> |
Search This Blog
Posts
Where has 2011 gone? I am sure you have asked the same question. Well, I am sure it is "gone" just like every year--quickly. I remember as a child that a year lasted FOREVER! Or so it seemed. As I got older it seemed to go by quicker. Now at 47, staring 48 in the face, all I need to do is write the family birthdays on the calendar and WHAM!, we are into the New Year.
So, do you have New Year's resolutions? Better yet, do you keep your resolutions? I use to make resolutions just to fall from it within a month, a week, or even a day. No New Year's resolutions for me. I know that I will fall short of them.
Our associate pastor was telling us in church Wednesday evening, he does not make New Year's resolutions. He wants to do what the Lord would have him to do every day. The more I thought on that the more I thought, "Isn't that what we should be doing." What makes a new year so special that we have to wait until January 1 to do something th…
Today is Daughter #1's birthday! She is 23 years old! She is expecting her first little bundle in just the next couple of weeks! Secretly, okay, not such a secret, I am hoping for today--she doesn't want to share her birthday! (sorry kiddo, secret is out of the bag!)
"Ditter-Do, here is wishing you a terrific 23rd birthday! We love you and can't wait for you to have your new little one to hold!"
Thought I would share a couple of photo's of Son #2 and family. We received these two pictures as a Christmas present! We had a wonderful Chilson Christmas!(Although we were sad to be without two of the grandchildren and Daughter #1 and her hubby.)
Son and Daughter-in-law #2
with Granddaughter #1
This picture was of Granddaughter #1
'spilling' out of a gift box!
(she always has her fist in her face!)
***********
Here is a picture of Grandson's #1 and #2
with Granddaughter #1
Today is Christmas Eve. There will lots of hustle and bustle today. The children and their families will be here around one this afternoon. There is still lots of work to be done in the kitchen. I'm not too worried. They can't eat until I get it done!
This will be the first Christmas without my mother. We had my father over for lunch yesterday. He seemed to have a good time. That is until we said how much we missed Mom.That was it, he was ready to go home. I know he is suffering. Though he is almost 83, he was one of her main caregivers along with my sister. My parents were married for fifty-eight years.
Different people have comforted me during these past few weeks. My sorrow is great, but Ikeep most of it hidden.
I believe my mother is in heaven. She accepted Christ as her personal Savior many years ago. She believed that Jesus, God's ONLY BEGOTTEN SON, came to earth as a babe, being God in the flesh, left the throne of Glory to come to earth to save us from…
Today Daughter #7 turns, well...SEVEN! *smile* So hard to believe, my baby is SEVEN!She is the last of my premature babies. She was born eight weeks early and NO problems following her birth! Of course she thought she was ready to come at 24 weeks and I spent seven weeks on bed rest. She weighed a little over 4 pounds. We still spent close to eight weeks in the NICU, but it was an uneventful stay!
Daughter #7 has asked for a couple of years to have her ears pierced. I was pretty certain she was not ready for it. So after explaining how it would be done, I slightly pinched her earlobe so she could feel what it would "feel" like. That was enough for her she kept putting it off, until recently. No swaying her, she said she was ready! So we went to our semi-local "W" store to get her ears pierced for her birthday! We did it yesterday so she could wake up and already have her birthday gift!
Such a brave litle soul! Daughter-in-law #2 went with us and snapped t…
Tonight was our church Christmas Cantata. It was beautiful. The choir worked hard and I think we were able to be a blessing to some people tonight. It's always kind of sad when it comes to an end, but next year's cantata is not that far away!!! {Well, if you like to plan a bit ahead it's not far away!} We also had a dessert fellowship afterwards. It is a lot of work for the kitchen help, but always worth it. Hubby and I like to watch as people go through the line. Love watching how everyone interacts with one another. I think everyone had a good time.
The Pastor's Fellowship that our family helped serve was wonderful! We had plenty of food and know the partakers of the meal were well fed and did not leave hungry! I always count it a blessing when our family can help out. We may not be able to give large sums of money, but we have plenty of hands that can be of help in a number of ways!
At last, this evening, I leave you with a prayer request. A young lady i…
Life has been a bit busy here at home. We, or should I say "I", am trying to get back to a normal life since Thanksagiving and Mother's death. I am having a hard time. I feel like I am just spinning my wheels.
I have a couple of pictures to share. Here are three of my grandbabies! The two young men belong to Son #1 and the young lady belongs to Son #2.
We kept our granddaughter over night Sunday! (Son #2 took his wife out for her birthday.) It has been a couple of years since I have had to get up for middle of night feedings!!!! It was worth every bit! Love my grandbabies!
This is what you get to look forward to
if you get your school work done first!
(Daughter #4 with Granddaughter #1) Christmas is right upon us. We still do not have our tree up or gifts bought. I know! I still have one birthday BEFORE Christmas and one to buy for AFTER Christmas.
Today is a busy day, as if no day is busy in our home. We are going to church this morning to help serve with a…
I have been following another blog--go figure! (really, I don't sit and follow blogs all day! I have a few fave that I check almost daily, or rather nightly)
I have been following In the Nursery of the Nation. I have enjoyed this blog--yep, stay at home mom and home schooling mom blog. Bambi is having a Vision Forum $50 giveaway.Check it out here. You might be the lucky one and win. Wouldn't that be a fun, early Christmas present for yourself?!
...and you want to share a picture, you "borrow" your best friend's picture! We had the bestest time at a friend's home for an annual Christmas brunch. Love you Girls! What a grand time and wonderful memories!!!!! Thanks Bonnie! You're a terrific hostess!
Tomorrow is my mom's funeral. It will be the last time I see her sweet precious face until I reach heaven's shores.
Tomorrow 31 of her 39 grandchildren will be singing "Victory in Jesus". (In our family there are no in-laws. You marry into the family, that's it, you are family. So out of the 39 grands and great-grands 8 have married into the family!) The grands were practicing tonight, and I could have sworn that I saw Mom's 'smile' getting bigger. Okay, maybe not, but if it could have it would have. Yep, she would be proud.
I know she is not here, but I just have to say it, "I love you, Mommy!"
I have been to one of my favorite blogs! "A Joyful Chaos" has a fun little give away going on. It is a Memory card game. This has some very sweet country scenes on it. LOVE IT! Love the memory game, but my nesters are putting me to shame! Must be I am getting old!
Today is my mother's viewing, and tomorrow is her funeral. The song above so much describes my mom. She loved her four children so very much! Before she had children, she was a nurse for "special care" babies~~"old" term for NICU. Once she started having children she gave up her career to stay at home and raise her own babies. Thanks, Mom!
Thank you, Daddy, for allowing Mom to stay at home and raise us four children!
About Me
Welcome to my blog! I am a full-time momma to 14 children, 4 daughter-in-loves, 1 son-in-love, 11 grandchildren, and 1 wonderful hubby for almost 35 years. Sometimes life is uneventful, sometimes very dramatic, but it is a life that I love! |
Outcome and staging evaluation in malignant germ cell tumors of the ovary in children and adolescents: an intergroup study.
The aim of this study was to perform an evaluation of outcome and the role of surgical staging components in malignant germ cell tumors (GCT) of the ovary in children and adolescents. From 1990 to 1996, 2 intergroup trials for malignant GCT were undertaken by Pediatric Oncology Group (POG) and Children's Cancer Study Group (CCG). Stage I-II patients were treated with surgical resection and 4 cycles of standard dose cisplatin (100 mg/m2/cycle), etoposide, and bleomycin (PEB) chemotherapy. Stage III-IV patients were treated with surgical resection and randomly assigned to chemotherapy with PEB or high-dose cisplatin (200 mg/m2/cycle) with etoposide and bleomycin (HDPEB). Patients unresectable at diagnosis had second-look operation after 4 cycles of chemotherapy if residual tumor was seen on imaging studies. IRB approval of the protocols was obtained at each participating institution. An analysis of outcome data, operative notes, and pathology reports in girls with ovarian primary site was done for this report. There were 131 patients with ovarian primary tumors of 515 entered on these studies. Mean age was 11.9 years (range, 1.4 to 20 years). Six-year survival rate was stage, I 95.1%; stage II, 93.8%; stage III, 98.3%; stage IV, 93.3%. In only 3 of 131 patients were surgical guidelines followed completely. Surgical omissions resulting in protocol noncompliance resulted from failure to biopsy bilateral nodes (97%), no omentectomy (36%), no peritoneal cytology (21%), no contralateral ovary biopsy (59%). More aggressive procedure than recommended by guidelines included total hysterectomy and bilateral salpingo-oophorectomy in 6 patients and retroperitoneal node dissection in 10 patients. Correlation of gross operative findings with pathology results was carried out for ascites, lymph nodes, implants, omentum, and contralateral ovary. Pediatric ovarian malignant GCT (stages I-IV) have excellent survival with conservative surgical resection and platinum-based chemotherapy. Survival appears to have been unaffected by deviations from surgical guidelines. New surgical guidelines are proposed based on correlation of gross findings, histology, and outcome in these intergroup trials. |
Rapid Eye Movement Sleep-related Parasomnias.
Among the rapid eye movement (REM) sleep-related parasomnias, the most common and important disorder for which patients present is REM sleep behavior disorder (RBD). Rapid eye movement sleep behavior disorder is often undiagnosed for many years, despite the sometimes bizarre and harmful behaviors involved. Complete evaluation and accurate diagnosis are essential for proper management. This includes medical, sleep/wake, psychiatric, and neurologic histories. Although they may raise feelings of guilt or shame, questions related to sexual and violent behaviors should be directed towards the identified patient as well as their bed partners. Objective studies should include nocturnal polysomnogram with audiovisual monitoring of behavior, electromyography (EMG) of all limbs, and seizure montage. Brain imaging, clinical electroencephalogram (EEG), neuropsychometric testing, and actigraphy may be used adjunctively. Clinicians should have a high index of suspicion for other neurologic conditions, especially neurodegenerative disorders and narcolepsy, because many patients with RBD have these conditions. Rapid eye movement sleep behavior disorder may actually precede symptoms and signs associated with other neurologic disorders, so close follow-up is recommended. Medications that may be causing or exacerbating RBD should be withdrawn, if possible. Clonazepam is very effective in reducing the symptoms of RBD. This treatment is generally well tolerated and may be used long-term. Discontinuation of clonazepam usually leads to relapse of symptoms. Safety-related issues should be discussed with patients and their families. |
Conventionally, fiber sheets are generally molded in order to fit them to certain shapes for various applications. As such molding methods, a heat press method, in which a pair of molds are used to mold a fiber sheet by the action of heat and pressure, or a cold press method, in which a pair of molds are used to mold a pre-heated fiber sheet by the action of pressure, are known.
In the case of molding by the former, i.e., the heat press method, the present applicant proposed “a fiber sheet for molding, characterized by being made of a fiber base material containing latent crimpable fibers of which crimps are expressed” (Patent literature 1) in order to improve the followability of the fiber sheet to the shape of the molds. However, since this fiber sheet for molding is poor in sound absorbing properties, in order to obtain sound absorbing properties, it is necessary to laminate it with a base material mat having good sound absorbing properties, or to use an adhesive resin film as an adhesive layer for adhering it to the base material mat. However, in the case of the former, i.e., laminating it with the base material mat having good sound absorbing properties, there is a problem in that the base material mat is limited, and that it is poor in versatility. In the case of the latter, i.e., using the adhesive resin film, regardless of the fact that it contains latent crimpable fibers of which crimps are expressed in order to improve the followability to the shape of the molds, there is a problem in that, since the adhesive resin film is difficult to stretch, a large amount of force is needed during molding, and if the molding is completed, there is another problem in that, since the adhesive resin film has low air permeability and it is difficult for the air to escape during molding, wrinkles are likely to occur.
Further, the present applicant proposed “a surface material for molding, characterized by consisting of a nonwoven fabric containing latent crimpable fibers of which crimps are expressed, wherein air permeability is 5 to 20 (cm3/cm2·s), and an extension at a load of 10 N in at least one direction is 50 mm or more” (Patent literature 2). Such a surface material for molding is actually produced by heating and pressing a crimp-expressing fiber web containing latent crimpable fibers, of which crimps are expressed. However, in order to achieve such a low air permeability, it is necessary to relatively strongly heat and press the web, and therefore, there is a problem in that the bulk of the surface material for molding is crushed to become paper-like, and that wrinkles are likely to occur when deep-drawing is carried out. |
USCA1 Opinion
March 30, 1993 UNITED STATES COURT OF APPEALS FOR THE FIRST CIRCUIT ____________________ No. 92-1139 MARGRET REY, Plaintiff, Appellee, v. RICHARD G.D. LAFFERTY, ET AL., Defendants, Appellants. ____________________ No. 92-1177 MARGRET REY, Plaintiff, Appellant, v. RICHARD G.D. LAFFERTY, ET AL., Defendants, Appellees. ____________________ APPEALS FROM THE UNITED STATES DISTRICT COURT FOR THE DISTRICT OF MASSACHUSETTS [Hon. Rya W. Zobel, U.S. District Judge] ___________________ ____________________ Before Selya, Cyr and Boudin, Circuit Judges. ______________ ____________________ H. Joseph Hameline with whom Andrea M. Fish and Mintz, Levin, __________________ ______________ ______________ Cohn, Ferris, Glovsky & Popeo, PC were on brief for appellee Rey. _________________________________ Charles Donelan with whom Katherine E. Perrelli, Kristen G. ________________ _______________________ ___________ McGurn and Day, Berry & Howard were on brief for appellants Lafferty, ______ ___________________ et al. ____________________ March 30, 1993 ____________________ CYR, Circuit Judge. Margret Rey, who owns the copy- CYR, Circuit Judge. _____________ right to the "Curious George" children's books, challenges an award of damages to Lafferty Harwood & Partners ("LHP") for Rey's withholding of approval of various ancillary products utilizing the "Curious George" character under their 1983 licensing agree- ment. LHP appeals the district court order awarding Rey damages and future royalties on certain other "Curious George" products. We affirm in part and reverse in part. I I BACKGROUND BACKGROUND __________ "Curious George" is an imaginary monkey whose antics are chronicled in seven books, written by Margret and H.A. Rey, which have entertained readers since the 1940s. A mischievous personality consistently lands Curious George in amusing scrapes and predicaments. The more recent "monkey business" leading to the present litigation began in 1977 when Margret Rey granted Milktrain Productions an option to produce and televise 104 animated "Curious George" film episodes. The option agree- ment was contingent on Milktrain's obtaining financing for the film project, and adverted to a potential agreement to license _________ "ancillary products," based on the "Curious George" character, once the 104 film episodes had been completed. 3 A. The Original Film Agreements. A. The Original Film Agreements. ____________________________ Milktrain approached LHP, a Canadian investment firm, to obtain financing for the project. LHP agreed to fund the venture by selling shares in the project to investors (hereinaf- ter: the "Milktrain Agreement"); LHP and its investors were to divide a 50% share of Milktrain's profits on the films and on any future ancillary products. With the financing commitment in place, Rey granted Milktrain and LHP a limited license "to produce (within a two- year period from the date of exercise) one hundred and four (104) four minute film episodes based on the ["Curious George"] charac- ter solely for broadcast on television" (hereinafter: the "Rey License"). Rey was to receive a fee for assisting with the editing and production of the episodes, and an additional royalty amounting to 10% of the revenues from any film telecasts. The Rey License made no mention of ancillary product rights. Never- theless, LHP promoted the project to investors through a prospec- tus (hereinafter: the "1978 Private Placement Memorandum") which represented, inter alia, that "the production contract [with Rey] _____ ____ gives LHP the right to participate in the financing of . . . the option . . . to undertake the exploitation of other rights to 'Curious George' including manufacturing, food, licensing and other commercial areas of exploitation." B. The Revised Agreements. B. The Revised Agreements. ______________________ The film project soon encountered delays and financial setbacks. By early 1979, though only 32 of the 104 episodes had 4 been completed, the original investment funds had been virtually exhausted. In order to rescue the project and complete the films to Rey's satisfaction, LHP offered to arrange additional financ- ing. In consideration, LHP insisted that the Milktrain Agreement be revised to permit LHP to assume control of the film production process and to receive higher royalties on the completed epi- sodes. Milktrain assented to these revisions, and the revised Milktrain Agreement (hereinafter: the "Revised Milktrain Agree- ment" or "RMA") was signed on November 5, 1979. As prelude to its description of the new obligations between Milktrain and LHP, the RMA recited that Milktrain and LHP owned "the rights to Curious George which have been obtained from . . . Rey" under the Rey License. The RMA further stated that: Investors acquiring the episodes shall ac- quire all right, title and interest therein, without limitation or reserve, including the original negative . . . . LHP shall have the right to participate on an equal basis with [Milktrain] in their right of first refusal after the present agency rights expire to undertake the exploitation of other rights to Curious George, including manufacturing, food, licensing and the publi- cation of the 104 episodes in book form . . . in accordance with the rights granted to [Milktrain] and LHP [by Rey] in [the Revised Rey License].1 Simultaneously with the negotiation of the RMA, LHP proposed several changes in the Rey License, including language ____________________ 1Shortly thereafter, Milktrain apparently assigned its share of ancillary product licensing rights to LHP, leaving LHP the sole owner of these rights. 5 which would have granted LHP the immediate right to "undertake the exploitation of other rights to 'Curious George,' including manufacturing, food, licensing and the publication of the 104 episodes in book form." Rey rejected the LHP proposal in a letter to Richard G. D. Lafferty (president and C.E.O. of LHP): "I have repeatedly stated to Milktrain and to you that I will not consider negotiating such rights before the films are done." Rey did consent, however, to certain changes to the royalty arrange- ments, whereby Rey would receive a 10% share of film revenues only "after the investors have recouped [their investment] and certain soft dollar commitments . . . have been paid." On November 5, 1979, concurrently with the execution of the Revised Milktrain Agreement, a revised version of the Rey License (hereinafter: the "Revised Rey License" or "RRL") was executed, incorporating these changes, and superseding the original Rey License. The RRL recited that the original Rey License had granted Milktrain and LHP the right to produce and distribute animated "Curious George" films "for television view- ing," but made no mention of the "ancillary product" rights unsuccessfully sought by LHP. As agreed, LHP undertook to arrange further financing to complete the film project. On November 23, 1979, LHP released another prospectus (hereinafter: the "1979 Private Placement Memorandum") to which it attached the Revised Milktrain Agree- ment. The 1979 Private Placement Memorandum again stressed the prospect of eventual revenues from ancillary products but noted 6 that these rights "have yet to be negotiated" with Rey. C. The Ancillary Products Agreement. C. The Ancillary Products Agreement. ________________________________ Production of the 104 TV episodes was completed in 1982. On January 3, 1983, an Ancillary Products Agreement (or "APA") was signed by Rey and LHP, granting LHP a general right to license "Curious George" in spin-off ("ancillary") products for a renewable term of five years. The APA defined "ancillary prod- ucts" as: All tangible goods . . . excluding books, films, tapes, records, or video productions . . . . However, for stories already owned by [LHP] and which have been produced as 104 episodes under the license granted in the January, 1978 agreement and the November 5, 1979 revision of that agreement, [LHP] shall have the right to produce books, films, tapes, records and video productions of these episodes under this Agreement, subject to [Rey's] prior approval . . . which prior approval shall not be unreasonably withheld. In return for these rights, Rey was to receive one-third of the royalties on the licensed products, with certain minimum annual payments guaranteed. Rey retained the right to disapprove any ___ product, and to propose changes which would make a disapproved _______ product acceptable to her. The APA provided, inter alia, that _____ ____ Rey's approval would not be withheld "unreasonably." D. The Houghton Mifflin Contract. D. The Houghton Mifflin Contract. _____________________________ Following the execution of the Ancillary Products Agreement, LHP assigned its licensing rights to a new subsidiary, Curgeo Enterprises, which turned its attention to licensing the 7 "Curious George" character in various product forms.2 On March 27, 1984, Curgeo executed a contract with Houghton Mifflin Company to publish the 104 television film episodes in the form of a children's book series. The contract provided that Houghton Mifflin would publish at least four books, with illustrations drawn directly from the film negatives, in each year from 1984 through 1987; the contract was renewable for an additional five- year term if LHP and Rey agreed to extend the APA beyond 1987. Pursuant to the contract, Houghton Mifflin published four books each year from 1984 through 1987. In 1987, LHP notified Houghton Mifflin that it had declined to extend the APA, but that Curgeo had "entered into a new operating agreement which permits us to continue to act in the capacity in which we have been acting for the last five years. . . . [Y]ou are free to pick up your option to renew." In response, Houghton Mifflin extended its contract for the addi- tional five-year term, publishing an additional four books in 1988 and again in 1989. It ceased publication of the book series in 1990, when Rey advised that the APA had been cancelled. E. Other Product Licenses. E. Other Product Licenses. ______________________ Curgeo moved aggressively to license the "Curious George" character in other product areas as well. Beginning in 1983, the "Curious George" TV episodes were licensed to Sony ____________________ 2Curgeo Enterprises is not named in the Rey complaint; Curgeo Agencies Inc. and Curgeo Overseas, Inc., are named as defendants. We refer to the three entities collectively as "Curgeo." 8 Corporation, which transferred the images from the television film negatives to videotape. LHP takes the position that the Sony video license was entered pursuant to the RRL; Rey claims it is subject to the APA. See supra at pp. 6-7. ___ _____ In 1983, Curgeo licensed "Curious George" to Eden Toys Inc., which proposed to market a "Curious George" plush toy. In the beginning, Rey rejected Eden's proposed designs for the toy, but Eden eventually proposed several versions which were accept- able to Rey. The plush toy was marketed from 1983 to 1990, but experienced poor sales and generated less revenue than expected. Eden blamed the poor market performance on Rey's alterations to Eden's original design proposals. In 1987, Curgeo received a commitment from Sears, Roebuck to market "Curious George" pajamas through the Sears catalog. The Sears pajama project promised high returns, but catalog deadlines necessitated immediate approval of a product design. Glen Konkle, Curgeo's agent, brought Rey a prototype pajama and a flat paper sketch of "Curious George" which had been proposed as the basis for the final pattern. Rey rejected the proposal, complaining that the pajama material was "hard, ugly [and] bright yellow," and that the sketch of "Curious George" was "plump" and "not recognizable." The catalog deadline passed and the pajama manufacturers withdrew their bids. In addition, Beach Paper Products, which had orally agreed to license "Curious George" for a line of paper novelties, withdrew its offer after learning that "Curious George" products would not receive expo- 9 sure in the Sears catalog. In 1988, Curgeo licensed "Curious George" to DLM Inc., which intended to use the "Curious George" character in a trilogy of educational software. Rey approved the software in principle, and production began in July 1988. In August 1988, however, DLM withdrew its plans to complete the "trilogy" after Rey telephoned DLM's project director and harshly criticized the design of the first software product and the accompanying manual developed by DLM. F. The Ancillary Products Agreement Renewal. F. The Ancillary Products Agreement Renewal. ________________________________________ Due in part to these product rejections, LHP earned less money than it anticipated from ancillary products. When the APA came up for renewal in January 1988, LHP declined to exercise its option for an additional five-year term. Instead, the parties agreed to renew on a month-to-month basis, terminable by either party on one month's notice. Rey's royalty rate was increased to 50% (effective January 3, 1988), but with no guaran- teed minimum payment. On April 10, 1989, Rey terminated the APA. LHP responded by advising that Curgeo would "continue to adminis- ter those licenses which [remained] outstanding and report to you from time to time accordingly." LHP thereupon continued to market the Sony videos and to publish the television films in book form under the Houghton Mifflin agreements. G. "Curious George" Goes to Court. G. "Curious George" Goes to Court. _____________________________ On February 8, 1991, Rey filed suit against Lafferty, 10 Curgeo and LHP, in connection with LHP's continuing, allegedly unauthorized production of the Houghton Mifflin books and Sony videos. Rey's complaint alleged violations of federal copyright, trademark and unfair-competition statutes, breach of contract, and violations of Mass. Gen. L. ch. 93A ("chapter 93A"); it sought to enjoin further violations and to recover unpaid royal- ties on the books and videos. LHP countersued, claiming that Rey unreasonably had withheld approval of various products while the APA remained in force. The LHP complaint alleged breach of contract, interference with contractual and advantageous business relationships, and violation of chapter 93A. After a four-day bench trial, the district court found for Rey on her claims for breach of contract, ruling that the book and video licenses were governed by the APA and that Rey was entitled to recover $256,327 in royalties. The court found for LHP on several LHP counterclaims, however, holding that Rey unreasonably had withheld approval of, inter alia, the Sears _____ ____ pajamas, the DLM software, and Eden's original plush toy design. LHP was awarded $317,000, representing lost profits and conse- quential damages resulting from Rey's rejection of these prod- ucts. II II DISCUSSION DISCUSSION __________ "Under Massachusetts law, the 'interpretation of a contract is ordinarily a question of law for the court'." 11 Fairfield 274-278 Clarendon Trust v. Dwek, 970 F.2d 990, 993 (1st _________________________________ ____ Cir. 1992) (quoting Edmonds v. United States, 642 F.2d 877, 881 _______ _____________ (1st Cir. 1981)); see also, e.g., Lawrence-Lynch Corp. v. Depart- ___ ____ ____ ____________________ _______ ment of Environmental Mgmt., 392 Mass. 681, 682, 467 N.E. 2d 838, ___________________________ 840 (1984); Sparks v. Microwave Associates, Inc., 359 Mass. 597, ______ __________________________ 600, 270 N.E. 2d 909, 911 (1971).3 Only if the contract is am- biguous will there arise issues of fact reviewable for clear error. See Dwek, 970 F.2d at 993; see also ITT Corp. v. LTX ___ ____ ___ ____ _________ ___ Corp., 926 F.2d 1258 (1st Cir. 1991); Fashion House, Inc. v. K _____ ___________________ _ Mart Corp., 892 F.2d 1076, 1083 (1st Cir. 1989) (New York law). __________ "Contract language is usually considered ambiguous where an agreement's terms are inconsistent on their face or where the phraseology can support reasonable difference of opinion as to the meaning of the words employed and obligations undertaken," K _ Mart, 892 F.2d at 1083 (citing In re Navigation Technology Corp., ____ _________________________________ 880 F.2d 1491, 1495 (1st Cir. 1989)). The ambiguity determina- ____________________ 3The Rey License and RRL contain choice-of-law provisions providing for the application of New York law, and the Milktrain Agreement and RMA contain choice-of-law provisions providing for the application of the law of the Province of Quebec, Canada. Neither party alludes to these contractual provisions in their briefs, however, and both parties appear to have premised their trial presentations and appellate briefs on the application of Massachusetts law. In accordance with their choice, and since a "reasonable relation" exists between their contract and the Massachusetts forum, see Carey v. Bahama Cruise Lines, 864 F.2d ___ _____ ____________________ 201, 206 (1st Cir. 1988), we apply Massachusetts law. See Borden ___ ______ v. Paul Revere Life Ins. Co., 935 F.2d 370, 375 (1st Cir. 1991) _________________________ ("[w]here . . . the parties have agreed about what law governs, a federal court sitting in diversity is free, if it chooses, to forego independent analysis and accept the parties' agreement"); accord Doherty v. Doherty Ins. Agency, Inc., 878 F.2d 546, 547 ______ _______ __________________________ (1st Cir. 1989); Moores v. Greenberg, 834 F.2d 1105, 1107 n.2 ______ _________ (1st Cir. 1987). 12 tion itself is subject to plenary review, id., and parol evidence ___ may not be used to "create ambiguity where none otherwise ex- ists." See Boston Car Co. v. Acura Auto. Div., 971 F.2d 811, 815 ___ ______________ ________________ (1st Cir. 1992) (citing ITT Corp., 926 F.2d at 1261). _________ A. The Book/Video Claims. A. The Book/Video Claims. _____________________ The Rey complaint alleged that LHP's only right to publish the "Curious George" TV episodes in book and video form derived from the Ancillary Products Agreement, was subject to the APA's royalty provisions, and expired when Rey terminated the APA in 1989. LHP responds that the book and video rights to the TV episodes were governed by the parties' other agreements, specifi- cally the Revised Rey License, which (according to LHP) incor- porated the Revised Milktrain Agreement. According to LHP, these other agreements continued in effect notwithstanding termination of the APA; moreover, these agreements provided that no royalties were due Rey before LHP's investors recovered their investment in the 104 TV films.4 The district court accepted the interpreta- tion urged by Rey, based on the language of the various contracts and the circumstances surrounding their execution. We agree. 1. The Houghton Mifflin Books. 1. The Houghton Mifflin Books. __________________________ The Ancillary Products Agreement provided, inter alia, _____ ____ that for stories already owned by [LHP] . . . which have been produced as 104 episodes ____________________ 4LHP contends that $250,000 (U.S.) had yet to be recovered by the investors at the time the present action was commenced. 13 under the license granted in the January, 1978 agreement and the November 5, 1979 revi- sion of that agreement, [LHP] shall have the right to produce books, films, tapes, records _____ and video productions of these episodes under _____ ___________ _____ this Agreement, subject to [Rey's] prior ____ _________ approval . . . (Emphasis added.) Throughout the document the term "this Agree- ment," utilizing the capital letter "A", refers to the APA. Thus, the plain language of the operative provision clearly con- templates that the APA was to govern the licensing of any books and "video productions" arising from the 104 films. See Barilaro ___ ________ v. Consolidated Rail Corp., 876 F.2d 260, 265 n.10 (1st Cir. ________________________ 1989) ("it is . . . 'a general rule in the construction of a written instrument that the same word occurring more than once is to be given the same meaning unless a different meaning is demanded by the context.'") (quoting Dana v. Wildey Sav. Bank, ____ ________________ 294 Mass. 462, 466, 2 N.E.2d 450, 453 (1936)). LHP argues, nonetheless, that a narrow meaning must be ascribed to the quoted APA language, insofar as the RMA purported to grant investors "all right, title and interest [to the 104 film episodes], without limitation or reserve, including the original negative." The problem with LHP's argument is that Rey never signed the RMA. LHP concedes this, but argues that the RMA and RRL were negotiated and executed simultaneously by LHP, and must be interpreted in pari materia. See, e.g., Interstate __ ____ _______ ___ ____ __________ Commerce Comm'n v. Holmes, slip op. at 10-11 (1st Cir. Jan. 11, _______________ ______ 1993) (escrow agreement and consent decree read together, as "synergistic" documents); accord Chelsea Indus., Inc. v. Flor- ______ _____________________ _____ 14 ence, 358 Mass. 50, 55-56, 260 N.E.2d 732 (1970); Thomas v. ____ ______ Christensen, 12 Mass. App. Ct. 169, 422 N.E.2d 472, 476 (1981). ___________ The Massachusetts courts sometimes have held that the party to be bound need not have signed each component part of an integrated agreement where it is the "sense" of the transaction, as support- ed by reliable indicia in the writings which were signed by the party to be bound, that a unitary transaction was contemplated by the parties. See Chase Commercial Corp. v. Owen, 32 Mass. App. ___ ______________________ ____ Ct. 248, 588 N.E.2d 705 (1992) (holding that non-signatory guarantor was bound by jury trial waiver contained in loan and security agreements, though guarantee agreement contained no such waiver, where "the three documents were part of one transac- tion"); see also Gilmore v. Century Bank & Trust Co., 20 Mass. ___ ____ _______ _________________________ App. Ct. 49, 50, 477 N.E.2d 1069, 1073 (1985) (holding that non- signatory trustee could recover for breach of workout agreement, even though not a party to its terms, based on "sense" of agree- ment, and "such factors as simultaneity of execution, identity of subject matter and parties, cross-referencing, and interdepen- dency of provisions"). On this theory, LHP contends, Rey's signature on the RRL bound her to the language of the RMA, and authorized LHP to transfer the television episodes to book form, using available technology. However, where contract language contains no unambigu- ous indicia of the parties' mutual intent to enter into a unitary transaction, we review for "clear error" the fact-dominant deter- mination whether their separate documents were intended by the 15 parties as an integrated agreement. Interstate Commerce Comm'n __________________________ v. Holmes, slip op. at 10-11; Holmes Realty Trust v. Granite City ______ ___________________ ____________ Storage Co., 25 Mass. App. Ct. 272, 517 N.E.2d 502, 504 (1988) ____________ ("it would be open to a fact finder . . . to treat [separate ____ __ _ ____ ______ documents] as intended by the parties to be parts of a single transaction") (emphasis added); Fred S. James & Co. v. Hoffmann, ___________________ ________ 24 Mass. App. Ct. 160, 163, 507 N.E.2d 269, 271 (1987). In the present case, we find no "clear error" in the district court's determination that the parties contemplated separate (though related) transactions for film rights and ________ financing. The evidence cut both ways. On the one hand, the RMA and the RRL were executed at approximately the same time, with some overlap in their internal references and subject matter. On the other hand, their respective provisions are less in unison than parallel.5 Most importantly, the written and circumstan- tial indicia sharply contradict any suggestion of a meeting of the minds relating to the licensing of ancillary products. Rey did not participate in negotiating the RMA, did not sign it, was ____________________ 5Even if the RMA and RRL were jointly construed, their language might point away from the interpretation urged by LHP. Section 2(i) of the RMA granted LHP's investors "all right, title and interest" in the 104 T.V. episodes, "without limitation or reserve," but 1(a) tempered this grant by defining the rights as "described herein, and set forth in Schedule 'A' [the RRL]." This language suggests that the "right, title, and interest" language of the RMA was meant only to confirm and restate, and _______ _______ not to expand upon, the RRL's parallel, but more limited, grant of rights. Cf. Fred S. James & Co., 24 Mass. App. Ct. at 164, ___ ____________________ 507 N.E.2d at 272 (finding no conflict between simultaneously executed instruments, where their language and the extrinsic evidence suggested independent obligations arising from simulta- neous contracts). 16 never made a party to its terms, and expressly refused, during _________ _______ ______ the RRL negotiations, to license "Curious George" for the "ancil- ___ ___ ____________ __ _______ _______ ______ ___ ___ ______ lary" purposes now urged by LHP. See supra at p. 6. Moreover, ____ ________ ___ _____ __ ___ ___ _____ the 1979 Private Placement Memorandum prepared by LHP acknowledg- es Rey's nonacceptance by attaching the RRL as an exhibit and noting that ancillary product rights "have yet to be negotiated" with Rey. Finally, the parties' intention to exclude the Hough- ton Mifflin books from the RRL, and their intention to cover them in the APA, are corroborated by their subsequent course of dealing: among other things, the record shows that LHP paid Rey royalties on the books and videos on several occasions at the 33% __ ___ ___ rate required under the APA, rather than the 10% rate prescribed ____ ________ _____ ___ ___ by the RRL, and that Curgeo expressly keyed the dates of the Houghton Mifflin contract to the term (and anticipated renewal __ ___ ____ ___ ___________ _______ term) of the Ancillary Products Agreement: ____ __ ___ _________ ________ _________ By September 30, 1987, Curgeo [will] inform [Houghton Mifflin] in writing as to whether Curgeo has exercised its option to exploit the character "Curious George" through December 31, 1993 and, if Curgeo has exer- cised said option, Curgeo shall give the Publisher the option to extend this Agreement through December 31, 1993. It was for the district court to balance the evidence in the first instance, see Holmes Realty Trust, 517 N.E. 2d at ___ ___________________ 504, and we discern no sound reason to disagree with its find- ings, particularly on "clear error" review. See Interstate ___ __________ Commerce Comm'n v. Holmes, slip op. at 13 (citing Cumpiano v. _______________ ______ ________ Banco Santander Puerto Rico, 902 F.2d 148, 152 (1st Cir. 1990)) ___________________________ 17 (even if proffered interpretation did "[give] rise . . . to another plausible view of the evidence," reversal not warranted on "clear error" review).6 To sum up: Since the district court supportably found that the RRL and the RMA are separate, though related, agree- ments, the RMA's purported grant of rights did not bind Rey, who was bound only by the grant of rights she endorsed in the RRL and APA. The RRL contained no grant of rights to produce the Hough- ton Mifflin books, and the APA, which granted the right "to produce books . . . of these episodes," obligated LHP to pay Rey royalties on the books without regard to whether LHP's investors had recouped their investment on the television film project. Thus, the district court did not err in finding that LHP's withholding of the Houghton Mifflin book royalties was wrongful, and we affirm its ruling on this point. ____________________ 6We reject LHP's further contention that Rey's failure to protest publication of the four Houghton Mifflin books in 1990 estops her from cancelling the book and video contracts under the APA. Where more than one inference fairly may be drawn from the evidence and an estoppel ruling turns on an issue of fact, we review for clear error. United States v. Marin, 651 F.2d 24, 29 ______________ _____ (1st Cir. 1981); Morgan Guaranty Trust Co. v. Third Nat'l Bank, __________________________ _________________ 529 F.2d 1141, 1144 (1st Cir. 1976). In our view, Rey's conduct does not require an inference that she acquiesced in the publica- tion of these books under the APA. Rather, Rey protested the publication of the four books by filing suit shortly after realizing the unauthorized nature of Houghton Mifflin's continued publication. The district court apparently found that Rey's one- year delay, dating from the first unauthorized publication until the filing of Rey's suit for injunctive relief, was not "unrea- sonable" in the circumstances, and we decline to disturb its findings on this issue. 18 2. The Sony Videos. 2. The Sony Videos. _______________ LHP's claim to the Sony video royalties is more compli- cated: assuming the videos were not covered by the contractual clause in the RMA, see supra Part II.A.1., might they nonetheless ___ _____ have been covered by the grant of rights in the RRL, which licensed LHP to produce the 104 episodes "for television view- ___ __________ _____ ing"? The district court thought not: the parties' "reference ___ to television viewing . . . in a licensing agreement . . . does not include [video technology] . . . which probably was not in existence at the time that the rights were given." a. "New Uses" and Copyright Law. a. "New Uses" and Copyright Law. ___________________________ For purposes of the present appeal, we accept the uncontested district court finding that the relevant video technology "was not in existence at the time that the rights" were granted under the RRL in January 1979. Consequently, it must be inferred that the parties did not specifically contem- plate television "viewing" of the "Curious George" films in videocassette form at the time the RRL was signed. Such absence of specific intent typifies cases which address "new uses" of licensed materials, i.e., novel technological developments which ____ generate unforeseen applications for a previously licensed work. See Melville B. Nimmer and David Nimmer, 3 Nimmer on Copyright ___ ___________________ 10.10[B] at 10-85 (1992) ("Nimmer") ("the . . . fact that we ______ are most often dealing with a later developed technological process (even if it were known in some form at the time of execution) suggests that the parties' ambiguous phraseology masks 19 an absence of intent rather than a hidden intent which the court simply must 'find'"). Normally, in such situations, the courts have sought at the outset to identify any indicia of a mutual general intent to _______ apportion rights to "new uses," insofar as such general intent can be discerned from the language of the license, the surround- ing circumstances, and trade usage. See, e.g., Murphy v. Warner ___ ____ ______ ______ Bros. Pictures, Inc., 112 F.2d 746, 748 (9th Cir. 1940) (grant of ____________________ "complete and entire" motion picture rights to licensed work held to encompass later-developed sound motion picture technology); Filmvideo Releasing Corp. v. Hastings, 446 F. Supp. 725 (S.D.N.Y. _________________________ ________ 1978) (author's explicit retention of "all" television rights to licensed work, in grant of motion picture rights predating tech- nological advances permitting movies to be shown on television, included retention of right to show motion picture on televi- sion). Where no reliable indicia of general intent are discern- _______ ible, however, courts have resorted to one of several interpre- tive methods to resolve the issue on policy grounds. Under the "preferred" method, see 3 Nimmer at 10-85, ___ ______ recently cited with approval in SAPC, Inc. v. Lotus Development __________ _________________ Corp., 921 F.2d 360, 363 (1st Cir. 1990), the court will con- _____ clude, absent contrary indicia of the parties' intent, that "the licensee may properly pursue any uses which may reasonably be said to fall within the medium as described in the license." 3 Nimmer at 10-86. Under this interpretive method, the courts will ______ presume that at least the possibility of nonspecific "new uses" 20 was foreseeable by the contracting parties at the time the licensing agreement was drafted; accordingly, the burden and risk of drafting licenses whose language anticipates the possibility of any particular "new use" are apportioned equally between licensor and licensee. See, e.g., Bartsch v. Metro-Goldwyn- ___ ____ _______ ______________ Mayer, Inc., 391 F.2d 150, 155 (2d Cir.), cert. denied, 393 U.S. ___________ _____ ______ 826 (1968) ("[i]f the words [of the license] are broad enough to cover the new use, . . . the burden of framing and negotiating an exception should fall on the grantor" of the licensed rights). An alternative interpretive method is to assume that a license of rights in a given medium (e.g., ____ 'motion picture rights') includes only such uses as fall within the unambiguous core meaning of the term . . . and excludes any uses which lie within the ambiguous penumbra (e.g., exhibition of motion picture film on ____ television). Thus any rights not expressly (in this case meaning unambiguously) granted are reserved. See 3 Nimmer at 10-85; see also Bourne Co. v. Walt Disney Co., ___ ______ ___ ____ __________ _______________ 1992 Copyr. L. Rep. (CCH) 26,934 (S.D.N.Y. 1992) ("if the disputed use was not invented when the parties signed their agreement, that use is not permitted under the contract"). This method is intended to prevent licensees from "'reap[ing] the entire windfall' associated with the new medium," Cohen v. _____ Paramount Pictures Corp., 845 F.2d 851, 854 (9th Cir. 1988) _________________________ (quoting Neil S. Nagano, Comment, Past Software Licenses and the ______________________________ New Video Software Medium, 29 U.C.L.A. L. Rev. 1160, 1184 (- ___________________________ 1982)), and is particularly appropriate in situations which 21 involve overreaching or exploitation of unequal bargaining power by a licensee in negotiating the contract. See, e.g., Bartsch, ___ ____ _______ 391 F.2d at 154 & n.2 (citing Ettore v. Philco Television Broad- ______ ________________________ casting Corp., 229 F.2d 481 (3d Cir. 1955) (suggesting narrow _____________ construction where licensor was not "an experienced businessman" and had no "reason to know of the . . . potential" for new uses at the time he signed the relevant agreement)). It may also be appropriate where a particular "new use" was completely unfore- seeable and therefore could not possibly have formed part of the _____ ___ ________ bargain between the parties at the time of the original grant. Cohen, 845 F.2d at 854; Kirke La Shelle Co. v. Paul Armstrong _____ _____________________ _______________ Co., 263 N.Y. 79, 188 N.E. 163 (1933). Obviously, this method ___ may be less appropriate in arm's-length transactions between sophisticated parties involving foreseeable technological devel- opments; in such situations, narrow construction of license grants may afford an unjustifiable windfall to the licensor, who would retain blanket rights to analogous "new uses" of copyright material notwithstanding the breadth of the bargained-for grant. See generally 3 Nimmer at 10-85 ("it is surely more arbitrary and ___ _________ ______ unjust to put the onus on the licensee by holding that he should have obtained a further clarification of a meaning which was already present than it is to hold that the licensor should have negated a meaning which the licensee might then or thereafter rely upon.").7 ____________________ 7The problem becomes particularly acute when the analogous technology develops so rapidly as to supplant the originally contemplated application of the licensed work, rendering the 22 b. Video Technology as "New Use". b. Video Technology as "New Use". ____________________________ These fine-tuned interpretive methods have led to divergent results in cases considering the extension of televi- sion rights to new video forms. Thus, for example, in Rooney v. ______ Columbia Pictures Industries, Inc., 538 F. Supp. 211 (S.D.N.Y.), __________________________________ aff'd, 714 F.2d 117 (2d Cir. 1982), cert. denied, 460 U.S. 1084 _____ ____ ______ (1983), the court determined that a series of contracts granting motion picture distributors a general license to exhibit plain- tiffs' films "by any present or future methods or means" and "by __ ______ any means now known or unknown" fairly encompassed the right to ___ _____ __ _______ distribute the films by means of later-developed video technol- ogy. The contracts in question gave defendants extremely broad rights in the distribution and exhibition of pre-1960 films, plainly _______ intending that such rights would be without _________ limitation unless otherwise specified and further indicating that future technological advances in methods of reproduction, trans- mission and exhibition would inure to the benefit of defendants. (Emphasis added.) Similarly, in Platinum Record Co. v. ______________________ Lucasfilm, Ltd., 566 F. Supp. 226, 227 (D. N.J. 1983), the court ________________ ____________________ parties' original bargain obsolete. Thus, for example, broad grants of "motion picture rights," made before technological advances permitted the combination of moving images with sound, _____ later were held, typically, to encompass the rights to sound motion picture technology; a narrower holding would have left the original license virtually worthless, despite its broad language, and would have provided the licensor with an undeserved windfall. See, e.g., Murphy, 112 F.2d at 748; L.C. Page & Co. v. Fox Film ___ ____ ______ ________________ ________ Corp., 83 F.2d 196 (2d Cir. 1936). _____ 23 held that videocassette rights were encompassed by a broad synchronization license to "exhibit, distribute, exploit, market, and perform [a motion picture containing licensed musical compo- sition] . . . perpetually throughout the world by any means or methods now or hereafter known." Again, the court rested its holding on the "extremely broad and completely unambiguous" contractual grant of general rights to applications of future _______ technologies, which was held to "preclude[] any need in the Agreement for an exhaustive list of specific potential uses of the film." Id. ___ By contrast, in Cohen, 845 F.2d at 853-54, the Ninth _____ Circuit concluded that a 1969 contract granting rights to "[t]he exhibition of [a] motion picture [containing a licensed work] . . . by means of television," but containing a broad restriction __ _____ __ __________ reserving to the licensor "all rights and uses in and to said musical composition, except those herein granted," did not encom- ___ ___ pass the right to revenues derived from sales of the film in videocassette form. After deciding that "[t]he general tenor of the [contract] section [in which the granting clause was found] contemplate[d] some sort of broadcasting or centralized distribu- ____________ __ ___________ _________ tion, not distribution by sale or rental of individual copies to ____ the general public," see id. at 853 (emphasis added), the court ___ ___ stressed that the playing of videocassettes, with their greater viewer control and decentralized access on an individual basis, did not constitute "exhibition" in the sense contemplated by the contract. 24 Though videocassettes may be exhibited by using a television monitor, it does not fol- low that, for copyright purposes, playing videocassettes constitutes "exhibition by television." . . . Television requires an intermediary network, station, or cable to send the television signals into consumers' homes. The menu of entertainment appearing on television is controlled entirely by the intermediary and, thus, the consumer's selec- tion is limited to what is available on vari- ous channels. Moreover, equipped merely with a conventional television set, a consumer has no means of capturing any part of the televi- sion display; when the program is over it vanishes, and the consumer is powerless to replay it. Because they originate outside the home, television signals are ephemeral and beyond the viewer's grasp. Videocassettes, of course, allow viewing of a markedly different nature. . . . By their very essence, . . . videocassettes liberate viewers from the constraints otherwise in- herent in television, and eliminate the in- volvement of an intermediary, such as a net- work. Television and videocassette display thus have very little in common besides the fact that a conventional monitor of a television set may be used both to receive television signals and to exhibit a videocassette. It is in light of this fact that Paramount ar- gues that VCRs are equivalent to "exhibition by means of television." Yet, even that assertion is flawed. Playing a videocassette on a VCR does not require a standard televi- sion set capable of receiving television signals by cable or by broadcast; it is only necessary to have a monitor capable of dis- playing the material on the magnetized tape. Id. at 853-54. ___ Most recently, in Tele-Pac, Inc. v. Grainger, 570 _______________ ________ N.Y.S.2d 521, appeal dismissed, 580 N.Y.S.2d 201, 588 N.E.2d 99 ______ _________ (1991), the court held (one judge dissenting) that a license to 25 distribute certain motion pictures "for broadcasting by televi- sion or any other similar device now known or hereafter to be made known" did not encompass the videocassette film rights. "Transmission of sound and images from a point outside the home _______ ___ ____ for reception by the general public . . . is implicit in the _______ ______ concept of 'broadcasting by television.' Conversely, while one may speak of 'playing,' 'showing,' 'displaying,' or even perhaps 'exhibiting' a videotape, we are unaware of any usage of the term 'broadcasting' in that context." Id. at 523 (emphasis added). ___ c. Video Rights and the RRL. c. Video Rights and the RRL. ________________________ Although the question is extremely close, under the interpretive methodology outlined above we conclude that the RRL's grant of rights to the 104 film episodes "for television viewing" did not encompass the right to distribute the "Curious ___ ___ George" films in videocassette form. First, unlike the contracts in Rooney and Lucasfilm, ______ _________ the RRL contained no general grant of rights in technologies yet to be developed, and no explicit reference to "future methods" of exhibition. Compare Lucasfilm, 566 F. Supp. at 227; Rooney, 538 _______ _________ ______ F. Supp. at 228. Rather, the RRL appears to contemplate a comparatively limited and particular grant of rights, encompass- ing only the 104 film episodes and leaving future uses of "Curi- ous George" to later negotiation in the ancillary products agreement. Although the RRL conversely contains no "specific limiting language," compare Cohen, 845 F.2d at 853, we believe _______ _____ such limitation is reasonably inferable from the situation of the 26 parties and the "general tenor of the section" in which the "television viewing" rights were granted. Second, as properly noted in Cohen, "television view- _____ ing" and "videocassette viewing" are not coextensive terms. Even though videocassettes may be, and often are, viewed by means of ___ __ VCRs on home television screens, see, e.g., Sony Corp. of America ___ ____ _____________________ v. Universal City Studios, Inc., 464 U.S. 417, 429 (1984) (noting ____________________________ prevalent use of videocassette recorders for "time-shifting" of commercial television programming); Rooney, 538 F. Supp. at 228 ______ ("whether the exhibition apparatus is a home videocassette player or a television station's broadcast transmitter, the films are 'exhibited' as images on home television screens"), still, as the Ninth Circuit pointed out, a "standard television set capable of receiving television signals" is not strictly required for video- cassette viewing. Cohen, 845 F.2d at 854. "[I]t is only neces- _____ sary to have a monitor capable of displaying the material on the magnetized tape." Id. Indeed, a number of non-television ___ monitors recently marketed in the United States permit videocas- sette viewing on computer screens, flat-panel displays, and the like.8 Thus, we find insufficient reliable indicia of a con- trary mutual intent on the part of Rey and LHP to warrant dis- turbing the district court's implicit determination that the ____________________ 8See, e.g., Nathalie Welch, ASK Flat-Panel Display Now ___ ____ _____________________________ Available in U.S., MacWeek, January 4, 1993 (noting availability _________________ of flat-panel LCD monitor capable of displaying VCR output); Alice Laplante & Stuart Johnston, IBM Unveils Multimedia Adapter ______________________________ Board, Software Toolkit, InfoWorld, February 12, 1990 (noting ________________________ availability of MCA adapter card permitting videocassette images to be viewed and manipulated on PS/2 color computer monitor). 27 language of the RRL is not "broad enough to cover the new use." Bartsch, 391 F.2d at 155. _______ Finally, any lingering concerns about the correctness of the district court's interpretation are dispelled by the evidence that the RRL (including its "television viewing" clause) was drafted and proposed by LHP, a professional investment firm accustomed to licensing agreements. Rey, an elderly woman, does not appear to have participated in its drafting, and, indeed, does not appear to have been represented by counsel during the larger part of the transaction. Under these circumstances, as noted supra pp. 21-22, ambiguities in the drafting instrument are _____ traditionally construed against the licensor and the drafter. See also Nimmer at 10-71 ("ambiguities [in licensing agreements] ___ ____ ______ will generally be resolved against the party preparing the instrument of transfer"); U.S. Naval Institute v. Charter Commu- _____________________ ______________ nications, Inc., 875 F.2d 1044, 1051 (2d Cir. 1989) (interpreting _______________ ambiguous copyright assignment against sophisticated drafting party); see generally, e.g., Merrimack Valley Nat'l Bank v. ___ _________ ____ _____________________________ Baird, 372 Mass. 721, 724, 363 N.E.2d 688, 690 (1977) ("as a _____ general rule, a writing is construed against the author of the doubtful language . . . if the circumstances surrounding its use and the ordinary meaning of the words do not indicate the intend- ed meaning of the language"). Accordingly, as the Sony videocassette sales were not encompassed by the RRL, but governed exclusively by the APA, we find no conflict between the terms of the documents, and we 28 affirm the award of royalties to Rey under the APA. B. The "Junk Products" Counterclaim. B. The "Junk Products" Counterclaim. ________________________________ We next turn to the LHP counterclaim that Rey breached the APA by "wrongfully withholding" approval of ancillary prod- ucts she considered "junky."9 The district court agreed with LHP, holding that [The Ancillary Products Agreement] clearly contemplated the exploitation of Curious George. . . . Based on the testimony of Ms. Stoebenau and Mr. Konkle, I find that means that there may be produced with the charac- ter, junk products, junky products. . . . Plaintiff [had] the right . . . to insist on . . . an honest and good depiction of the __ ___ character. She did not have the right to _________ disapprove the quality of the product. . . . __ ___ _______ She had [the] right to disapprove an incor- rect, improper, bad depiction of Curious George. (Emphasis added.) The court further found: [A]lthough Mrs. Rey unquestionably approved many products, I find that she improperly disapproved the Sears project for the reasons just outlined; that she was unreasonable with respect to the Eden project, and that she was so rude to Ms. Craighead as to abort the second and perhaps later trilogies of the software. (Emphasis added.) After careful consideration, we must agree with Rey that the district court misapplied the APA. The product-approval procedure under the APA required ____________________ 9LHP does not challenge the district court ruling that its counterclaims for interference with contractual and advantageous business relationships, breach of the implied covenant of good faith and fair dealing, and unfair business practices under chapter 93A were time-barred. 29 that: LHP will submit product or other information sufficient to describe the product to you for prior approval. When a product is submitted . . . we will wait two weeks before proceed- ing. If we do not receive any disapproval of the product from you within two weeks we are entitled to presume that you approve of the product. If you do disapprove of any prod- uct, you will, if feasible, suggest such changes to LHP as may render the product acceptable to you, or, if you cannot make such feasible suggestions, you may refuse to approve the product. Product approval will not be unreasonably withheld. The term "product" is not defined in the APA. It is black letter law, however, that where "the words of an agreement are plain and free from ambiguity, they must be construed in their ordinary and usual sense," Boston Edison Corp. v. FERC, 856 F.2d 361, 365 (1st ___________________ ____ Cir. 1988), and, as we have noted in another context, the word 'product,' taken in its ordinary and usual sense, "simply means 'something produced.'" See K Mart, 892 F.2d at 1085 (quoting ___ _______ Webster's Third New International Dictionary 1810 (1981)). See ___ also id. at 1084 ("where possible, words should be given their ____ ___ natural meaning, consistent with the tenor of contractual terms"); id. at 1085 ("[I]t is sufficient [to avoid ambiguity] if ___ the language employed is such that a reasonable person, reading the document as a whole and in realistic context, clearly points toward a readily ascertainable meaning"). Considered in context, we think the "ordinary and usual" meaning of the broad term "product" plainly indicates the parties' mutual intention that each article bearing the likeness of "Curious George" not _______ 30 merely the likeness itself be approved by Rey. By contrast, the narrow interpretation urged by LHP would convert the term "product" into a mere synonym for the "Curious George" mark. Nowhere does the APA intimate that the parties contemplated that the term "product" was to be given so restrictive an interpretation. Indeed, elsewhere the APA plainly precludes the narrow interpretation urged by LHP by expressly distinguishing between the mark and the "product" with which it ______________ is used. See APA p.3 ("[LHP] will not sell or authorize the sale ___ or distribution of any product on or in connection with which _______ __ __ __ __________ ____ _____ 'Curious George' is used . . .") (emphasis added); id. at 3-4 _______ ______ __ ____ ___ (referring to separate approval procedure for "apparel prod- _______ _____ ucts").10 As the APA is unambiguous in this regard, the trial ____ ____________________ 10The interpretation we adopt accords with the common-sense understanding recognized in other areas of intellectual property law. Thus, for example, in the trademark context, courts fre- quently have recognized that "the trademark holder [has] the right to control the quality of the goods manufactured and sold under its trademark," Shell Oil Co. v. Commercial Petroleum, ______________ ______________________ Inc., 928 F.2d 104 (4th Cir. 1991) (emphasis added); El Greco ____ _________ Leather Products Co. v. Shoe World, 806 F.2d 392, 395 (2d Cir. _____________________ __________ 1986), cert. denied, 484 U.S. 817 (1987)) ("The actual quality of _____ ______ the goods is irrelevant; it is the control of quality that a _______ __ trademark holder is entitled to maintain") (emphasis added); see ___ also Societe des Produits Nestle, S.A. v. Casa Helvetia, Inc., ____ ___________________________________ ____________________ 982 F.2d 633 (1st Cir. 1992) (hereinafter Produits Nestle) ________________ ("[r]egardless of the offending goods' actual quality, courts have issued Lanham Act injunctions solely because of the trade- mark owner's inability to control the quality of the goods bearing its name"). "The rationale for this requirement is that marks are treated by purchasers as an indication that the trade- mark owner is associated with the product." Kentucky Fried ______________ Chicken Corp. v. Diversified Packaging Corp., 549 F.2d 368, 387 _____________ ____________________________ (5th Cir. 1977). Indeed, under trademark law the protection of the mark may be lost if the licensor fails to control the quality _____ of the licensed goods; failure to control the quality of licensed goods can constitute an abrogation of the licensor's duty to protect the informational value of the mark. See Kentucky Fried ___ ______________ 31 testimony of LHP's witnesses, Cheryl Stoebenau and Glen Konkle, need not be considered. Extrinsic evidence may not be utilized to contradict the unambiguous terms of a written agreement. See ___ LTX Corp., 926 F.2d at 1263-64; Triple-A Baseball Club Assoc. v. ___ _____ ________ ________ ____ ______ Northeastern Baseball, Inc., 832 F.2d 214, 221 (1st Cir. 1987), ____________ ________ ____ cert. denied, 485 U.S. 935 (1988). _____ ______ ____________________ Chicken, 549 F.2d at 387; see also Church of Scientology Int'l v. _______ ___ ____ ___________________________ Elmira Mission of Church of Scientology, 794 F.2d 38, 43 (2d Cir. _______________________________________ 1986). LHP argues that the licensor's duty of control is less stringent where the mark is licensed for use in a context unre- lated to the licensor's original business. See Winnebago Indus., ___ _________________ Inc. v. Oliver & Winston, Inc., 207 U.S.P.Q. 335, 340 (T.T.A.B. ____ _______________________ 1980). Whatever its merit as a general matter, however, this proposition is unavailing in the present context: the APA licensed the use of "Curious George" for purposes both related _______ and unrelated to the original (literary) use of the "Curious _________ George" mark, and in no instance does it distinguish between "related" and "unrelated" uses. Similarly, under copyright law, while a licensor has no "moral right" to control the quality of licensed depictions, see ___ Gilliam v. American Broadcasting Cos., 538 F.2d 14, 24 (2d Cir. _______ ___________________________ 1976), she may insist, contractually, on approval provisions to "assure quality control and high standards in the exploitation" of her creative work." See Clifford Ross Co. v. Nelvana, Ltd., ___ _________________ _____________ 710 F. Supp. 517, 520 (S.D.N.Y.), aff'd. without opinion, 883 _______________________ F.2d 1022 (2d Cir. 1989); see also Zim v. Western Pub. Co., 573 ___ ____ ___ _________________ F.2d 1318, 1324 (5th Cir. 1978) (author has "profound interest, both professional and financial, in maintaining the quality of [published products], particularly those already published under [her] name"). Clifford Ross is particularly instructive, as it _____________ too involved a "classic literary property," the "Babar" child- ren's book character. Upholding a contractual provision which called for the copyright holder's participation in the selection of licensing agents for the character, and enjoining the issuance of further licenses absent the holder's approval, the court concluded that there would be "irreparable harm" to the future profitability of "Babar," and to the artistic reputation of the holder, "if the exploitation of Babar continue[d] without regard to [the licensor's] high standards of quality control." Clifford ________ Ross, 710 F. Supp. at 520. Compare Geisel v. Poynter Products, ____ _______ ______ _________________ Inc., 283 F. Supp. 261 (S.D.N.Y. 1968) (issuing injunction under ____ Lanham Act; finding likelihood of "irreparable harm" to author's reputation where "Dr. Seuss" toys, which author found to be "tasteless, unattractive, and of an inferior quality," were marketed as authorized by author). 32 Even though the APA's product approval clause did not preclude Rey from rejecting products based on their "junky" quality, it did obligate her to act "reasonably" in doing so. The duty to act "reasonably," like a duty to employ "best ef- forts," or to act in "good faith," is not reducible to "a fixed formula[, and] varies with the facts and the field of law in- volved." See Triple-A Baseball Club, 832 F.2d at 225 (discussing ___ ______________________ contractual "best efforts" clause); see generally Robert S. ___ _________ Summers, "Good Faith" in General Contract Law and the Sales ______________________________________________________ Provisions of the Uniform Commercial Code, 54 Va. L. Rev. 195, ___________________________________________ 201, 204-07 (1968) (discussing "good faith" as "phrase without general meaning," incapable of precise definition). In a some- what different context, the Massachusetts courts have interpreted contractual clauses preventing the "unreasonable withholding of approval" of commercial sublessees, as imposing a duty to act "in accordance with usual standards of reasonableness." See Nassif ___ ______ v. Boston & M. R. Co., 340 Mass. 557, 564, 165 N.E.2d 397, 401-02 __________________ (1966); Worcester-Tatnuck Square CVS, Inc. v. Kaplan, 33 Mass. ___________________________________ ______ App. Ct. 499, 601 N.E.2d 485 (1992). It falls to us to define "usual standards of reasonableness," in the present context, in a way which accords with the contracting parties' intent, yet avoids rendering the "reasonableness" standard either purely illusory or duplicative of more particular contractual terms. We think the APA's proscription of "unreasonable" product disapproval required, at a minimum, that Rey articulate some material reason, subjective or otherwise, for disapproving a ________ 33 product. That is to say, Rey could not withhold product approval without ascribing a reason, nor for reasons immaterial to the "Curious George" mark, its proposed use or commercial potential, or unrelated to Rey's artistic and reputational identification with the mark and ancillary products. Moreover, assuming there existed some material ground for withholding product approval, it would need to be communicated, consistent with contractual speci- fications, "within a reasonable time and in a reasonable manner, i.e., in a manner which makes it possible for [the licensee] to ____ rework the [product] in order to meet . . . approval." See Zim, ___ ___ 573 F.2d at 1324. Finally, the reason for withholding product approval could not be so preclusive as to frustrate the fundamen- _________ tal contractual assumptions on which the APA was formed. In the ___ ___________ ___________ context of this case, for example, Rey could not impose approval standards which would effectively eliminate all potential for profitable use of the "Curious George" property; the parties' mutual assent, in the APA, that Rey would be entitled to minimum royalty payments, plainly implied a mutual understanding that some licensing of the "Curious George" character would be accept- ____ able, in order to enable sales from which royalties might be generated. Cf. Steven J. Burton, Breach of Contract and the ___ ____________________________ Common Law Duty to Perform in Good Faith, 94 Harv. L. Rev. 369, __________________________________________ 403 (1980) ("discretion in performance may be exercised legiti- mately [only] for the purposes reasonably contemplated by the parties"). The district court supportably found that Rey approved 34 "many products," including the original film series, the Houghton Mifflin books, the Sony videocassettes, the first series of DLM software, and the Eden plush toys (as modified). In addition, Rey testified, without contradiction, that she had approved "children's sweatshirts, film strips, earmuffs and school bags for children . . . buttons, children's books . . . paper doll books[,] [w]rist watch, alarm clocks, wall clocks, footwear, little tennis shoes for children, . . . [b]each slippers, . . ." After reviewing the record, we are convinced that Rey did not utilize objectively unreasonable criteria for approving products under the APA. We turn to the particular product rejections challenged on appeal. 1. The Sears Pajamas. 1. The Sears Pajamas. _________________ The district court ruled that Rey acted unreasonably by basing her disapproval of the Sears project on the "junky" quality of the pajama material which would bear "Curious Georg- e's" likeness.11 As we have stated, see supra at pp. 32-34, ___ _____ the basis for the district court's finding of "unreasonableness" was insufficient as a matter of law. Rey did not unreasonably withhold approval of the Sears pajama project as unbefitting the "Curious George" image protected by her copyright, because the grounds for withholding approval were reasonably related to the ____________________ 11The district court did not address the aesthetic reasons Rey gave for rejecting the Sears project, viz., the "bright ____ yellow" color of the pajama material and the unrecognizable "plump" depiction of "Curious George." We believe these grounds were not unreasonable. 35 integrity and commercial value of her artistic creation. See ___ Clifford Ross, 710 F. Supp. at 520.12 _____________ 2. The Beach Paper Products. 2. The Beach Paper Products. ________________________ Our conclusion that Rey reasonably rejected the Sears project disposes of LHP's claim for damages relating to the Beach paper products as well. Rey never saw, much less "disapproved," the Beach paper products: as the undisputed evidence shows, Beach withdrew its proposal when the Sears project fell through; it never reached agreement with LHP or presented any product to Rey for approval. Therefore, LHP's claimed right to recover potential profits from the Beach project could be justified, if at all, only as consequential damages resulting from a wrongful _____________ _______ rejection of the Sears project. As the Sears project was not wrongfully rejected under the terms of the APA, LHP is not entitled to consequential damages related to Beach's anticipated ____________________ 12LHP nonetheless maintains that Rey's rejection of the Sears pajama project was "unreasonable," insofar as it was not communicated in a manner which "ma[de] it possible . . . to rework the [product] in order to obtain . . . approval." Zim, ___ 573 F.2d at 1324. LHP argues that time pressures inherent in the Sears catalog deadlines made the presentation of the pajamas a "one-shot deal," with "reworking" of the design impossible once rejection had occurred. It insists that the "lousy material" in the pajamas a basis for Rey's disapproval was required by federal fire safety standards; no other material was available for use in the product. Even assuming these fact-based arguments are well founded, however an assessment we are in no position to make on the present record they are beside the point: the APA's "reason- ableness" constraint did not oblige Rey to apply lower standards, or to relax her vigilance in policing ancillary uses for the "Curious George" character, merely because deadlines were tight or objections to the product could not be cured. See APA at p. 3 _____ ___ ___ ("if you disapprove of any product, you will, if feasible, __ ________ suggest such changes to [LHP] as may render the product accept- able to you") (emphasis added). 36 profits. See, e.g., Ryan v. Royal Ins. Co., 916 F.2d 731, 744 ___ ____ ____ ______________ (1st Cir. 1990) ("unless appellants can demonstrate that [appel- lee] breached a duty owed to them. . . . consequential damages will not lie"). 3. The Eden Plush Toys. 3. The Eden Plush Toys. ___________________ The district court ruled that Rey acted unreasonably with respect to the Eden plush toys project, but the court did not state whether its ruling was based on Rey's objections to the "junky" nature of the proposed product, or some other ground. We conclude, nonetheless, that remand is unnecessary in the present circumstances, see Produits Nestle, 982 F.2d at 640-41 ("when a ___ _______________ trial court misperceives and misapplies the law, remand may or may not be essential"), since LHP did not present sufficient evidence to enable a finding that Rey's actions with respect to Eden were "unreasonable." See id. at 642 (quoting Dedham Water ___ ___ ____________ Co. v. Cumberland Farms Dairy, Inc., 972 F.2d 453, 463 (1st Cir. ___ ____________________________ 1992)). Applying the standard articulated supra pp. 33-34, _____ "reasonableness" in the present context turns, first, on whether the reasons for rejecting a proposed product were "material." As recently noted by the court, "[t]here is no mechanical way to determine the point at which a difference becomes 'material.' Separating wheat from chaff must be done on a case-by-case basis." Produits Nestle, 982 F.2d at 641. In reference to _______________ conventional commercial products, such as the Perugina chocolates licensed in Produits Nestle, the appropriate test is whether the _______________ ground for refusing to approve a version of a licensed product is 37 one which "consumers would likely consider relevant." Id. In ___ the context of an artistic creation such as "Curious George," however, the highly subjective element of "creativity," connect- ing product and author, implicates intangible considerations such as the "total concept and feel" of the product. See Roth Greet- ___ ___________ ing Cards v. United Card Co., 429 F.2d 1106 (9th Cir. 1970); see _________ _______________ ___ also Sid & Marty Krofft Television Productions, Inc. v. McDonalds ____ _______________________________________________ _________ Corp., 562 F.2d 1157 (9th Cir. 1977). We believe an author's _____ discretionary right to disapprove an ancillary product, as not in keeping with the aesthetic image the author envisions for her artistic creation, reasonably may be made to depend on product conformity, at least where, as here, conformity with the author's aesthetic standard would neither set unreasonably high levels of commercial practicality nor foreclose all prospect of profit- ________ ability on which the contract was predicated. See supra at pp. ___ _____ 33-34. The evidence before the district court clearly showed that Rey imposed a demanding aesthetic standard for the design of the Eden Toys doll.13 Eden's frustration at Rey's meticulous immersion in the details of toy design may indeed be understand- able, the more so perhaps because of the irascible terms in which Rey appears to have chosen to couch her product criticisms on occasion. Even viewing the evidence as a whole in the light most ____________________ 13For example, she relocated the felt patterns on "Curious George's" face by a few millimeters and rejected particular colors and color combinations which Eden thought would make the doll more saleable. 38 flattering to LHP, however, we cannot conclude that her proposed changes were unrelated to her legitimate artistic concerns or to her desire to protect the aesthetic integrity of the "Curious George" image. "Reasonableness" likewise requires, of course, that changes be made "within a reasonable time and in a reasonable manner, i.e., in a manner which makes it possible for [the licen- ____ see] to rework the [product] in order to meet . . . approval." See Zim, 573 F.2d at 1324. The evidence before the district ___ ___ court, which we have examined in detail, did not show that Rey's product criticisms, though caustic, were made in an unreasonable time or manner. And although the record is replete with testimo- ny that Eden and LHP grumbled about Rey's product criticisms, neither Eden nor LHP ever communicated to Rey, prior to the __ ___ present lawsuit, that her proposed changes to the Eden plush toy products were impracticable or even unduly burdensome.14 Since Rey's objections to Eden's original toy design were based on criteria reasonably related to her legitimate artistic and aesthetic concerns about the proposed ancillary product, and were communicated in a time and manner which would permit Eden to conform the product, we conclude that Rey's rejection of Eden's product designs was not "unreasonable." ____________________ 14For example, the President of Eden Toys testified: "[W]hat we tried to do, therefore, was to get very specific, and say: If you want it moved three millimeters to the left, we'll _____ move it, but let's all agree on that's where it's going to be . . ____ __ . ." (Emphasis added.) 39 4. The DLM Software. 4. The DLM Software. ________________ Finally, we consider whether Rey's alleged rudeness to Donna Craighead, the DLM project manager, amounted to an "unrea- sonable withholding of approval" of the DLM software project in violation of the APA. We conclude that it did not. As all parties agree, the licensing arrangement between DLM and LHP covered only the first installment in the proposed DLM software trilogy, the first installment was approved by Rey prior to her ________ telephone conversation with Craighead, and DLM continued to manufacture and market the first-installment software even after Rey's intemperate remarks. Given the fact that Rey's statements led to no curtailment in the production or sale of the licensed software, we are unable to discern any relevant respect in which Rey's statements to Craighead could be considered a "rejection" of the product for which LHP had issued its license to DLM. The district court apparently thought that Rey's harsh criticism of the first software installment may have discouraged DLM from undertaking "second and . . . later" installments in the proposed trilogy. Here, however, the relevant consideration is that these subsequent installments had not yet been licensed by ___ ___ ___ ____ ________ the time Rey communicated her criticism about the first software _____ product and manual. Even were Rey's criticism actionable in tort, as an "intentional interference with contractual rela- tions," see Restatement (Second) of Torts 766, or as a breach ___ of the implied good-faith duty not to interfere with LHP's per- formance under the APA, it nevertheless was not actionable in 40 contract. Under the plain terms of the APA, Rey could not "reject" products not yet licensed or presented for approval.15 LHP attempts to extend the APA's plain language by characterizing Rey's criticism of the DLM project as "essentially revok[ing] product approval [of] the DLM software concept" __________ _______ already approved by Rey. LHP does not define the term "software concept," but clearly uses it to encompass not only the first DLM product but all subsequent installments in the planned trilogy. Such an interpretation would not withstand analysis under the language of the APA, however, nor comport with the undisputed record evidence. We reject LHP's overly expansive definition of "prod- uct" in the present context. By lumping all DLM software prod- ucts under the umbrella of a single software "concept," LHP would eviscerate Rey's retained right to grant, or reasonably withhold, approval for distinct generations of software products in a particular software series. All conceptually related articles ____________ identified by LHP as part of the same series would be deemed approved, sight unseen; the policing of the integrity of the conceptual relationship presumably having ceased to be a matter of legitimate concern to Rey. Courts universally recognize that the elasticity of contract language is limited by the natural meaning of its terms and their context. See K Mart, 892 F.2d at ___ ______ ____________________ 15The district court ruled that the tort claims arising out of "most of" Rey's conduct were time-barred. LHP does not challenge this ruling. See supra n.9 and accompanying text. ___ _____ 41 1085; Boston Edison Corp., 856 F.2d at 365. LHP's interpretation ___________________ strips the "product approval" term from its context and depletes its natural meaning. CONCLUSION CONCLUSION __________ Under the APA, Rey is entitled to recover the royalties wrongly withheld on the Houghton Mifflin books and Sony videos; and we affirm the district court rulings respecting these claims. The APA likewise entitled Rey to withhold approval of licensed ancillary products on reasonable grounds; thus, LHP was not entitled to recover damages for Rey's reasonable exercise of her right to withhold approval of the Sears pajama project, the Beach paper products, the Eden Toys project, or the DLM software.16 Accordingly, the damages awards to LHP are vacated. Affirmed in part, reversed in part; costs are awarded _______________________________________________________ to Rey. ______ ____________________ 16We have considered all other arguments advanced by the parties and find them either to be wanting or, alternatively, moot. Without limiting the generality of the foregoing, we note that, because we conclude that Rey reasonably withheld approval of the Sears project, the Eden plush toys, and the DLM software, we need not consider whether LHP's estimates of lost future profits from these products were sufficiently certain and non- speculative to support an award of damages. See, e.g., Hendricks ___ ____ _________ & Assocs., Inc. v. Daewoo Corp., 923 F.2d 209, 217 (1st Cir. ________________ _____________ 1991) (citing John Hetherington & Sons, 210 Mass. 8, 21, 95 N.E. ________________________ 961 (1911)); Redgrave v. Boston Symphony Orchestra, Inc., 855 ________ ________________________________ F.2d 888, 893 (1st Cir.), cert. denied, 488 U.S. 1043 (1988). _____ ______ Nor need we consider whether the damages awarded LHP for these products should have been reduced by 50%, reflecting Rey's share ___ of product royalties under the pre-1988 APA formula, or by 33%, under the revised APA formula for products licensed after January 1, 1988. 42
|
Queen (East Indiaman)
At least six ships with the name Queen served the Honourable East India Company between 1701 and 1839. Most were East Indiamen:
, 320 tons burthen (bm), 64 crew and 26 guns; the French captured her at Saint Helena on 1 June 1706. She was on the homeward leg of her second voyage; George Cornwall, her captain, was killed in the action.
, a ship of 330 tons (bm), 18-22 guns and 60-66 crew, made two voyages to Bombay or Bencoolen between 1715 and 1720. She had been launched on the River Thames for Sir Joseph Martin. She was sold in 1720 into the West Indies and Levant trades.
, of 499, 804, or 821 tons (bm), was launched by Randall, Rotherhithe, on 24 October 1767. She made five trips to India or China for the company between 1768 and 1784, and was present at the Battle of Porto Praya. She was sold in 1784 for breaking up.
made four trips to India or China between 1786 and 1800, and on her fifth trip was lost to fire at Salvador, Bahia in 1800.
was launched at Quebec and between 1797 and 1801 made three voyages for the EIC. She then became a West Indiaman. She was last listed in 1813.
Bombay Marine
Queen was a ketch of 14 guns, launched in 1768 at Bombay Dockyard for the Bombay Marine
See also
Citations and references
Citations
References
Hackman, Rowan (2001) Ships of the East India Company. (Gravesend, Kent: World Ship Society).
Hardy, Charles and Horatio Charles Hardy (1811) A register of ships, employed in the service of the Honorable the United East India Company, from the year 1760 to 1810: with an appendix, containing a variety of particulars, and useful information interesting to those concerned with East India commerce. (London: Black, Parry, and Kingsbury).
Category:Ships of the British East India Company
Category:Age of Sail merchant ships
Category:Merchant ships of the United Kingdom |
u**2 - 409*u + 6296. Determine g(38).
-582
Let p(k) = -4*k**2 - 633*k - 562. Calculate p(-157).
223
Let r(p) = -13*p**3 + 19*p**2 + 263*p - 1412. What is r(5)?
-1247
Let y(w) = -959*w**3 + 3*w**2 - 48*w - 50. Determine y(-1).
960
Let b(h) = h**3 - 23*h**2 + 29*h + 573. Give b(20).
-47
Let q(m) = -m**2 + 460*m - 22626. Calculate q(56).
-2
Let q(g) = 16881*g - 945318. What is q(56)?
18
Let v(f) = -218*f - 3391. Determine v(-15).
-121
Let f(v) = 12*v**3 + 2864*v**2 + 4739*v - 462. What is f(-237)?
-225
Let p(f) = -5*f**3 + 21*f**2 - 5214*f + 20839. Determine p(4).
-1
Let p(r) = -3*r**2 - 9748*r - 9747. Determine p(-1).
-2
Let l(s) = 127*s**3 - 36*s**2 + 86*s - 31. What is l(2)?
1013
Let d(p) = -339*p - 3449. Give d(-8).
-737
Let j(c) = -115977*c + 579879. What is j(5)?
-6
Let b(g) = 104*g + 3949. What is b(-30)?
829
Let n(x) = 145*x**2 - 68*x + 26. Calculate n(4).
2074
Let u(o) = 8*o**3 - 1697*o**2 + 331*o - 25252. Determine u(212).
-24
Let a(q) = 78*q**3 - 3*q**2 - 68*q + 157. Give a(2).
633
Let q(n) = n**2 - 152*n + 2526. What is q(134)?
114
Let p(f) = -20*f**2 - 30*f + 46. What is p(-3)?
-44
Let v(n) = -n**3 - 10*n**2 + 128*n + 1020. What is v(-6)?
108
Let l(d) = -9*d**3 + 6*d**2 + 117*d - 406. Calculate l(4).
-418
Let o(h) = -22030*h + 264441. What is o(12)?
81
Let w(n) = -n**3 - 138*n**2 + 1964*n - 83. Give w(-151).
-234
Let u(d) = -d**3 - 387*d**2 + 5199*d - 403. Give u(-400).
-3
Let n(x) = x**3 + 497*x**2 + 6772*x + 140. Calculate n(-14).
0
Let g(i) = 310*i + 9707. What is g(-31)?
97
Let d(a) = -2*a**2 + 293*a - 5574. Give d(123).
207
Let f(u) = 3691*u**2 - 243607*u + 46. What is f(66)?
-20
Let g(s) = 120*s**2 - 6*s + 8. Give g(1).
122
Let g(a) = 2*a**2 - 935*a + 18360. What is g(20)?
460
Let g(k) = -k**3 + 111*k**2 - 54*k + 6363. Calculate g(111).
369
Let h(a) = -2*a**2 - 91*a + 25488. Give h(93).
-273
Let l(m) = -m**2 + 1659*m - 136792. Give l(87).
-28
Let j(a) = -40*a**2 + 30507*a + 9884. What is j(763)?
-35
Let y(x) = x**3 - 56*x**2 + 213*x + 4360. Determine y(50).
10
Let g(z) = -3*z**2 - 507*z - 3122. Calculate g(-163).
-188
Let d(v) = 64*v**2 + 482*v + 245. Determine d(-7).
7
Let o(u) = u**3 + 13*u**2 - 49*u - 276. What is o(-15)?
9
Let j(m) = 329*m - 16510. What is j(51)?
269
Let u(m) = 13*m**2 - 5299*m + 507239. Calculate u(254).
1
Let m(r) = -r**3 - 76*r**2 - 572*r - 15408. Determine m(-71).
-1
Let o(j) = -j**2 + 12294*j + 49179. Calculate o(-4).
-13
Let z(x) = 95648*x - 287159. Determine z(3).
-215
Let u(i) = i**2 - 35*i - 552. Determine u(24).
-816
Let o(b) = 13*b**2 + 3*b + 1150. Calculate o(0).
1150
Let t(v) = -2*v**3 - 71*v**2 - 214*v + 119. Give t(-32).
-201
Let c(d) = 1485*d + 136616. Give c(-92).
-4
Let g(n) = 299*n**2 + 558*n + 567. Calculate g(-1).
308
Let w(h) = -h**3 + 9*h**2 - 25512*h + 204048. Determine w(8).
16
Let l(y) = y**3 + y**2 + 347*y + 2343. Determine l(-8).
-881
Let b(j) = -j**3 - 61*j**2 - 2056*j - 188020. Determine b(-70).
0
Let z(h) = -659*h + 5891. What is z(9)?
-40
Let d(r) = -12*r**2 + 929*r - 17753. What is d(43)?
6
Let h(n) = 54841*n - 164550. Calculate h(3).
-27
Let c(o) = -24429*o - 11335056. Calculate c(-464).
0
Let s(j) = -2*j**2 + 42*j + 855. What is s(-9)?
315
Let u(g) = -30841*g + 1819617. Determine u(59).
-2
Let l(a) = 488*a**3 + 2438*a**2 - 16*a + 3. What is l(-5)?
33
Let x(y) = 85*y**2 - 1856*y + 5861. Give x(18).
-7
Let z(v) = -11*v**2 + 23*v + 337. Calculate z(-16).
-2847
Let c(t) = 2*t**2 + 5069*t + 345067. Give c(-70).
37
Let s(m) = 398*m + 19104. What is s(-48)?
0
Let l(t) = -2*t**2 + 98360*t - 196716. What is l(2)?
-4
Let i(y) = y**3 - 227*y**2 + 9995*y + 1225. Determine i(60).
-275
Let n(u) = 7*u**2 - 12*u + 438. What is n(12)?
1302
Let f(o) = 704*o + 1423. Determine f(-3).
-689
Let k(h) = -906*h**2 + 8157*h - 26. Give k(9).
1
Let v(d) = -4894*d + 63576. Calculate v(13).
-46
Let s(a) = -32*a**2 - 64*a + 231. What is s(7)?
-1785
Let t(x) = 750*x**2 + 6683*x - 637. Calculate t(-9).
-34
Let p(t) = -1058*t + 6382. Give p(6).
34
Let c(q) = 2*q**2 + 930*q + 10877. Calculate c(-12).
5
Let b(m) = -661*m**3 - 107*m - 107. Determine b(-1).
661
Let f(r) = -51814*r + 259181. Give f(5).
111
Let m(i) = -i**3 - 137*i**2 + 99*i - 5314. What is m(-138)?
68
Let y(p) = -p**2 - 37*p + 4958. Determine y(48).
878
Let b(s) = -s**2 - 75*s - 708. Calculate b(-60).
192
Let h(d) = d**3 - 54*d**2 + 89*d + 840. Give h(52).
60
Let h(q) = q**2 - 4238*q + 413746. Determine h(100).
-54
Let b(m) = 23230*m + 394914. What is b(-17)?
4
Let n(q) = -7*q**2 + 151*q + 858. What is n(-9)?
-1068
Let w(d) = d**2 + 640*d + 99898. Determine w(-370).
-2
Let z(q) = -129*q**2 - 56*q - 299. Calculate z(-4).
-2139
Let i(q) = -13*q**3 + 422*q**2 + 231*q + 23. Calculate i(33).
23
Let b(y) = 463*y + 68960. What is b(-150)?
-490
Let n(y) = 25008*y - 700227. Determine n(28).
-3
Let v(x) = -x**3 + 529*x**2 - 2629*x + 4527. Give v(524).
-189
Let f(m) = -2012*m - 240. Give f(0).
-240
Let z(k) = k**3 - 70*k**2 - 480*k - 177. Give z(-6).
-33
Let s(j) = 1224*j + 5629. Determine s(-5).
-491
Let p(b) = 3*b**3 + 214*b**2 - 3785*b - 75. What is p(-86)?
11
Let t(k) = 3*k**3 - 6*k**2 - 91*k + 565. Calculate t(9).
1447
Let f(p) = p**3 + 20*p**2 - 486*p - 6484. Determine f(-11).
-49
Let n(r) = -327*r**2 - 658*r - 15. Calculate n(-2).
-7
Let i(w) = w**2 - 247*w + 12525. Calculate i(72).
-75
Let z(t) = 56770*t - 624359. Give z(11).
111
Let x(t) = -472*t**2 + 4673*t + 568. Give x(10).
98
Let g(i) = -19*i**2 + 400*i + 1367. What is g(-3)?
-4
Let k(a) = 2*a**3 + 112*a**2 - 1543*a + 691. Give k(11).
-68
Let a(w) = 736*w + 108203. Give a(-147).
11
Let i(s) = 3*s**2 + 180*s + 669. Determine i(-56).
-3
Let i(p) = -32*p + 320. Give i(36).
-832
Let d(j) = -147*j - 720. Give d(-23).
2661
Let a(d) = d**3 - 56*d**2 + 223*d - 782. Calculate a(52).
-2
Let d(l) = 2*l**2 + 7010*l + 69902. Determine d(-10).
2
Let i(v) = -2*v**3 - 9*v**2 + 4873*v + 24354. Determine i(-5).
14
Let f(l) = -153724*l - 11683005. Calculate f(-76).
19
Let m(h) = 2500*h + 212486. What is m(-85)?
-14
Let k(q) = -19*q**2 + 15803*q - 90028. Give k(826).
6
Let m(b) = -220534*b + 1323175. Determine m(6).
-29
Let b(s) = -s**3 + 37*s**2 + 820*s - 31017. Give b(36).
-201
Let b(m) = 2*m**3 - 268*m**2 - 258*m - 1411. Determine b(135).
209
Let l(p) = 7*p**2 - 889*p - 897. What is l(128)?
-1
Let w(t) = 73*t**2 + 1469*t + 145. Calculate w(-20).
-35
Let t(m) = 5*m**2 - 74*m + 78. Determine t(24).
1182
Let c(w) = w**2 - 7447*w - 59662. Determine c(-8).
-22
Let m(k) = -k**2 - 973*k - 25598. Calculate m(-27).
-56
Let r(j) = j**3 + 31*j**2 - 121*j - 2623. What is r(-32)?
225
Let n(s) = 179052*s - 21665296. What is n(121)?
-4
Let o(a) = 6*a**2 + 1023*a + 579. Determine o(-170).
69
Let s(b) = 3888397*b + 15553613. What is s(-4)?
25
Let p(f) = 21611*f - 108149. Give p(5).
-94
Let q(k) = -3457*k + 97089. What is q(28)?
293
Let t(k) = -19*k**2 - 40*k + 78. What is t(2)?
-78
Let u(m) = -4595*m + 2908628. Give u(633).
-7
Let y(z) = z**3 - 4659*z**2 - 4983731*z + 890. Give y(-897).
-7
Let x(y) = -109700*y + 658217. Calculate x(6).
17
Let c(h) = 6*h**2 - 33*h - 2716. Give c(-19).
77
Let c(t) = -t**2 + 96*t + 10020. What is c(-63)?
3
Let r(d) = 850*d**2 - 200*d - 405. Determine r(-2).
3395
Let b(w) = -8*w**2 + 4217*w - 20735. Determine b(5).
150
Let j(m) = -104*m**2 + 66*m - 106. What is j(2)?
-390
Let w(f) = -1043*f - 25769. Calculate w(-26).
1349
Let w(u) = -u**2 + 182*u + 2114. Calculate w(-11).
-9
Let s(z) = -363*z**3 + 12*z**2 + 200*z + 360. Calculate s(-2).
2912
Let m(x) = 6630*x - 32105. Determine m(5).
1045
Let m(k) = -504*k - 17764. Determine m(-35).
-124
Let p(d) = 190855*d + 572509. Give p(-3).
-56
Let q(b) = -28890*b + 230961. Give q(8).
-159
Let c(u) = 41903*u - 712358. Determine c(17).
-7
Let k(b) = -b**3 - 39*b**2 - 193*b - 489. What is k(-33)?
-654
Let k(i) = -i**3 + 102*i**2 - 1764*i + 356. Give k(80).
36
Let c(p) = p**3 + 27*p**2 - 421*p + 269. Determine c(12).
833
Let v(u) = 2720*u + 10701. Determine v(-4).
-179
Let q(l) = 60*l**2 - 3430*l + 20473. Give q(6).
2053
Let y(f) = -f**3 - 19*f**2 + 146*f + 1785. Calculate y(-20).
-735
Let a(i) = 3*i**3 - 2305*i**2 - 1542*i + 3077. Calculate a(769).
1
Let y(d) = 20*d**3 - 52*d**2 + 164*d - 14. What is y(4)?
1090
Let s(i) = i**3 - 418*i**2 + 3277*i - 20. Ca |
Sign Up for the Tribes 2 Beta
Share.
I just saw all of your eyes open nice and wide with this one. Come on in and stay for the video.
By IGN Staff
Ohh my lordy lord! All of you rabid Tribes players out there are probably having trouble reading due to the overwhelming excitement of having the possibility of being in the Tribes 2 beta test. Well, here's the skinny on how you too can be a part of this deal. There's some stuff you gotta do you know, to prove you are indeed worthy of such an honor. Jump through some hoops, eat some live bugs, bathe nude in a lake full of leeches... you know, the usual. Here's all of the hinkfo and URL so that you can once again whoop up on some fools.
The sign up period will last at least 10 days so that all of you can have the time to compose a thoughtful and winning piece as to why Sierra should pick you as a beta tester. There are only 1000 spots available, and while that may sound like a lot compared to other games, there's a lot of Tribes fans out there, especially considering the testers will be picked from all around the world. So just complete the entire beta application form and make sure you fill everything out correctly and especially the "Why should I be a beta tester" part.
Those of you that aren't the best Tribes players in the world that still want to participate shouldn't fear. Sierra is seeking out all kinds of Tribes players, from green little newbies to the ultra hardcore guys that can hit someone flying full speed with a disc launcher at 2000 feet. The other thing that you must have is a PII 300 or better to even run the game. Keep in mind that this is a testing process so you should be serious about finding bugs and reporting them to the development team.
Now for the video. What we have here is a little video taken from the Tribes 2 LAN party that Sierra recently held for the gaming press. Take a look at some of the industry's "finest" taking the game for a test drive. |
d, 2, -2
Let g = 0.1 + -0.6. Suppose 0 = -3*m + 81 + 105. Let h = -57 + m. Sort 1/5, g, h in descending order.
h, 1/5, g
Let w = 1.12 - 1. Let l = -0.38 - w. Put 0.9, -4/7, l in descending order.
0.9, l, -4/7
Let c = -1.55 + 3.55. Let l = 2.6 - 3. Let x = -106 - -531/5. Sort c, x, l in ascending order.
l, x, c
Let z(c) = c**2 - 11*c - 9. Suppose -7*n - 48 = -11*n. Let p be z(n). Suppose p*x = -7 + 1. Sort -3, x, -4.
-4, -3, x
Let g be ((-8)/(-5))/((-4)/10). Let i = -11 - g. Let j be 9/(-6)*4/(-3). Sort -5, i, j in ascending order.
i, -5, j
Suppose 0 = -3*z - 5 - 1, 12 = 2*f - 3*z. Suppose 7*w = -11 - f. Sort -1/2, -4/3, w, -0.3 in decreasing order.
-0.3, -1/2, -4/3, w
Let d be 4/3 + 42/(-36). Suppose 12 = -2*j + 8. Let w be (7/35)/(j/(-10)). Put -0.2, d, w in decreasing order.
w, d, -0.2
Suppose -3*s + 10 = -x, 4*x - x = -2*s + 14. Let j be s/(-12) - (-25)/(-15). Put -20, j, -5 in descending order.
j, -5, -20
Suppose 0 = 9*k - 6*k + 75. Let s = k + 24. Sort -6, 5, s in descending order.
5, s, -6
Suppose 109*o - 12 = 105*o. Sort o, -1, 8 in ascending order.
-1, o, 8
Let f = -26 + 26.13. Let m = f - -0.37. Let u = 0.16 + -4.16. Sort m, u, 2/5.
u, 2/5, m
Let h be ((-1)/(-2)*-13)/2. Let u = -1109/477 - -135/53. Put u, 3, h in decreasing order.
3, u, h
Let f = 16 - 22. Let r be (6/(-5))/(f/20). Suppose 0 = -2*a + 5*q - 25, 2*q + 5 = 2*a + 3*q. Sort -1, r, a.
-1, a, r
Let f be (-3)/(-2)*4/21. Let t = 46.8 + -47.3. Put f, t, -8 in descending order.
f, t, -8
Let q = 0.207 - 0.207. Sort 0.3, -1.2, q, 0.4 in descending order.
0.4, 0.3, q, -1.2
Let n = 67 + -49. Sort n, -0.5, 4, 2 in descending order.
n, 4, 2, -0.5
Let b = 1.07 - 1.17. Let y = 8 - 7. Sort b, -6, y, -0.2 in descending order.
y, b, -0.2, -6
Let h = -5.44 + 10.44. Sort h, -0.1, 6, 1 in descending order.
6, h, 1, -0.1
Let r = -0.007 + 26.007. Let n = r + -25. Put 2/3, n, 0.4, 1/5 in ascending order.
1/5, 0.4, 2/3, n
Let t = -437 - -437.5. Let g = 3204/11 + -291. Put g, t, 3/7, -0.1 in descending order.
t, 3/7, g, -0.1
Let i be (-100)/(-10) - (6 - 1). Put 1/12, -5, i in ascending order.
-5, 1/12, i
Suppose z - 8 = -3*u - 9, 2*z = -4*u - 2. Let n(j) = -j - 10. Let w be n(-8). Sort -5, u, w.
-5, w, u
Let u = 12 - 12.4. Let p = -32 + 3. Let k = -33 - p. Sort k, 2, u in descending order.
2, u, k
Suppose -13 = f + 3*f - 3*v, -4*v + 12 = -4*f. Let t(a) = -a**2 - 3*a + 5. Let m be t(f). Let i = -4102 + 4100. Sort m, -1, i in decreasing order.
m, -1, i
Suppose 2*k - 2*d = -0*d + 20, 2*k + 2*d = 0. Suppose 111 = 21*v + 16*v. Sort k, 2, -4, v.
-4, 2, v, k
Let o be (((-312)/1060)/3)/((-432)/(-295)). Let j = 3/424 - o. Put j, -4/5, -5 in descending order.
j, -4/5, -5
Suppose -q = -2*p + 19, p = -3*p. Let t = q - -19. Suppose t = 5*h + 4 - 29. Put -4, 1, h in descending order.
h, 1, -4
Suppose 6 = -4*s + 3*w - 0, 3*w = 3*s + 6. Let k = 0.89 + 58.11. Let u = k - 58.5. Sort 0.2, u, s.
s, 0.2, u
Suppose -12*s + 373 = 313. Let t be 2/(-3) + 8/3. Put s, -11, t in decreasing order.
s, t, -11
Let f = 20.2 + -21. Let c = -0.3 - f. Let d = 3.5 - 4. Put c, d, 1/3 in descending order.
c, 1/3, d
Let w(y) = y + 3. Let t be w(-2). Suppose 16*p = 2*p + 84. Let o be ((p/(-18))/1)/(3 + -2). Sort -2/17, o, t in decreasing order.
t, -2/17, o
Let d(u) = 5*u**3 - 3*u**2 - 4*u + 6. Let g be d(1). Put g, 0, -8, 40 in decreasing order.
40, g, 0, -8
Let q(f) = -7*f - 4. Let y be q(0). Sort 1, 8, y, 11 in decreasing order.
11, 8, 1, y
Suppose -f + 207 = -5*d + 81, 0 = 5*d - 4*f + 129. Let n be 120/d + 1 + 4. Sort -3, n, -0.2, 5 in increasing order.
-3, -0.2, n, 5
Let o be 3/((-13041)/2262) + (-4)/(-18). Let t = o - -2/161. Sort 0.2, -1, t, -0.3 in ascending order.
-1, -0.3, t, 0.2
Let d = -1939 + 1937. Sort 5, d, -39 in ascending order.
-39, d, 5
Let p(u) = u**3 + 8*u**2 + 2. Let g be p(-8). Sort g, 5, -43 in ascending order.
-43, g, 5
Suppose -2*z + 20 = 3*b, 2*b - 5*b + 17 = -z. Let u be (-4)/(8/b) + (-5)/5. Sort u, -2, -5, 5 in decreasing order.
5, -2, u, -5
Let g = 2087 - 2088. Let d = 3 - 3.4. Sort d, 2/9, g in descending order.
2/9, d, g
Let x = 9 + -7. Let s(c) = 8 + 2*c**2 - 1 - 3 - 9*c - c**x. Let a be s(9). Sort a, 2, -1 in decreasing order.
a, 2, -1
Suppose 4*p - 112 - 48 = 0. Let c be 16/p - 44/10. Let f(l) = l**3 + 4*l**2 - l - 1. Let q be f(c). Put q, 0.1, 0 in decreasing order.
q, 0.1, 0
Suppose 3*h - 182 = -167. Sort 1/2, h, -10 in increasing order.
-10, 1/2, h
Suppose -4*r + r = 15. Let u be 7/(-2) + r/10. Let x be 2*(-1)/2*33/11. Put u, 0, x in ascending order.
u, x, 0
Let m(z) = z**3 + 10*z**2 - 15*z - 188. Let q be m(-9). Sort q, 1, 3, 4 in decreasing order.
q, 4, 3, 1
Suppose -4*x - 10 = 4*h - 26, -x + 16 = 5*h. Suppose -16 = -h*g - 4*r - r, -5*g - r = -12. Let l = -2/253 + 1018/759. Sort 4, l, g in increasing order.
l, g, 4
Let p(y) = -y + 49. Let k be p(15). Let q = k + -135/4. Sort q, -1/4, 5 in descending order.
5, q, -1/4
Let r = 109 + -111. Sort -0.5, 0.4, r in decreasing order.
0.4, -0.5, r
Suppose 3*n - 101 = -80. Sort 2, -5, n, 19 in decreasing order.
19, n, 2, -5
Suppose -2*p + 3*v + 1 = -4, 5*p - 32 = v. Suppose -2*j = -k - 3*k, p = -5*k - j. Let z be 2 - (1 + -7 + 3). Sort k, z, 9 in ascending order.
k, z, 9
Let a = -2.3 + -0.3. Let b = a + 3.6. Let s be (-1 + 1)*3/(-6). Sort s, b, 0.3 in decreasing order.
b, 0.3, s
Let x = -314.3 + 289. Let f = 25 + x. Put 2/7, 0.1, f, -4 in ascending order.
-4, f, 0.1, 2/7
Suppose 5*t - 51*j = -54*j - 18, -4*j = -16. Suppose 0 = -5*y - 6 - 9. Sort t, y, 3 in descending order.
3, y, t
Let p = -13/34 + -2/17. Sort 0, -1/29, p in decreasing order.
0, -1/29, p
Let r = 0.15 - -0.25. Let t = r + 2.6. Sort -14, t, -1 in descending order.
t, -1, -14
Let i be 10/(-25) - (-36)/15. Suppose 0 = 5*l + m + 9, 0 = 4*l + 2*m - 5 + 17. Let k be (6/(-4))/((-3)/6). Put i, k, l in descending order.
k, i, l
Let i = 0.14 - -0.14. Let h = i + -0.93. Let j = 0.15 + h. Sort 1/6, j, -2.
-2, j, 1/6
Let v = -1.33 - -59.33. Let m = 56 - v. Let w = -0.3 + 0.4. Sort w, 1/2, m in increasing order.
m, w, 1/2
Let o = -13 + 13.11. Let u = 16 - 16.01. Let c = u + o. Sort c, 0.5, -3 in increasing order.
-3, c, 0.5
Let a = -25 + 27. Let u = 2 - a. Sort u, -3, 1/3 in ascending order.
-3, u, 1/3
Let n be 1*(3 - (2 + -12)). Let u(b) = -b**2 + 16*b - 21. Let w be u(n). Let h = 15 - w. Sort h, -2, -5 in decreasing order.
-2, h, -5
Let h = 0.375 + -5.375. Put h, -6, -3/8 in ascending order.
-6, h, -3/8
Suppose -2*x - 3*x = -20. Suppose -26*y + 17*y = 117. Put -5, y, x in decreasing order.
x, -5, y
Let d(r) = -r - 10. Let g be d(-7). Let m(l) be the second derivative of l**4/12 + 2*l**3/3 + l**2/2 + 7*l. Let b be m(0). Sort b, 2, g in ascending order.
g, b, 2
Let i(l) = -2*l**3 - 14*l**2 - 11*l - 72. Let x be i(-7). Put -0.2, 6/5, x in ascending order.
-0.2, 6/5, x
Let f = 3/65 + 109/455. Sort 0, -2, -4, f.
-4, -2, 0, f
Let k = -0.416 + -5.584. Put k, 4, -0.1, -3/2 in ascending order.
k, -3/2, -0.1, 4
Let r be (-20)/(-40)*(-2)/(-2). Put 1/10, r, -1 in decreasing order.
r, 1/10, -1
Let k = -185 + 199. Let u = 400 - 413.98. Let h = u + k. Put 0, -1, h in increasing order.
-1, 0, h
Let q = -24 - -27. Let b(n) = -2*n - 10. Let u be b(-5). Suppose 2*k - 3*v + 4 = u, -2*v = -3*k - v + 8. Sort k, 1, q in descending order.
k, q, 1
Suppose 4*t + 31*t = -140. Put -10, 0, t, -5 in decreasing order.
0, t, -5, -10
Let o be (-2)/(-8) - (-12)/80. Let w = -8.9 - 1.1. Let q = w + 7. Sort q, o, 1 in increasing order.
q, o, 1
Let l = -0.32 - -0.12. Let m = 0.1 + l. Sort m, 2/17, 1.
m, 2/17, 1
Let l = -44.7 + 8.7. Let y = 37 + l. Sort y, 0.1, -4/3.
-4/3, 0.1, y
Suppose 2*c - 2*p = 4*c + 44, 0 = 3*p + 3. Let k be (-60)/35 + 6/c. Let i be k*(-2)/(12/9). Put 0.3, -1, i in increasing order.
-1, 0.3, i
Let b = 5/293 - -283/586. Put -5, b, -74, -0.1 in decreasing order.
b, -0.1, -5, -74
Suppose 0 = -4*j - 4*x + 8, 6 = -6*x + 9*x. Suppose 2*f - 7*f - 25 = 0. Put 1, j, -2, f in increasing order.
f, -2, j, 1
Let o = 4.2 - 0.2. Let n(d) = d**2 - 52*d + 54. Let b be n(51). Sort -3, o, -4, b in decreasing order.
o, b, -3, -4
Let n = 251 + -251. Sort n, -3/4, -8/5 in decreasing order.
n, -3/4, -8/5
Let f be (2 - 1)/((-252)/50 - -5). Let v(c) = -2*c - 50. Let b be v(f). Put 12, -5, b in descending order.
12, b, -5
Let y = 7.3 - 4.3. S |
<!DOCTYPE html>
<html>
<head>
<meta charset="utf-8">
<link rel="shortcut icon" type="image/ico" href="http://www.datatables.net/favicon.ico">
<meta name="viewport" content="initial-scale=1.0, maximum-scale=2.0">
<title>ColReorder example - jQuery UI styling</title>
<link rel="stylesheet" type="text/css" href="//code.jquery.com/ui/1.11.2/themes/smoothness/jquery-ui.css">
<link rel="stylesheet" type="text/css" href="../../Plugins/integration/jqueryui/dataTables.jqueryui.css">
<link rel="stylesheet" type="text/css" href="../css/dataTables.colReorder.css">
<link rel="stylesheet" type="text/css" href="../../../examples/resources/syntax/shCore.css">
<link rel="stylesheet" type="text/css" href="../../../examples/resources/demo.css">
<style type="text/css" class="init">
</style>
<script type="text/javascript" language="javascript" src="../../../media/js/jquery.js"></script>
<script type="text/javascript" language="javascript" src="../../../media/js/jquery.dataTables.js"></script>
<script type="text/javascript" language="javascript" src="../../Plugins/integration/jqueryui/dataTables.jqueryui.js"></script>
<script type="text/javascript" language="javascript" src="../js/dataTables.colReorder.js"></script>
<script type="text/javascript" language="javascript" src="../../../examples/resources/syntax/shCore.js"></script>
<script type="text/javascript" language="javascript" src="../../../examples/resources/demo.js"></script>
<script type="text/javascript" language="javascript" class="init">
$(document).ready(function() {
var table = $('#example').dataTable();
new $.fn.dataTable.ColReorder( table );
} );
</script>
</head>
<body class="dt-example">
<div class="container">
<section>
<h1>ColReorder example <span>jQuery UI styling</span></h1>
<div class="info">
<p>This example shows how the jQuery UI ThemeRoller option in DataTables can be used with ColReorder.</p>
<p>The important thing to note here is that it is easier to use <code>new $.fn.dataTable.ColReorder()</code> to add ColReorder to the table rather than <a href=
"//datatables.net/reference/option/dom"><code class="option" title="DataTables initialisation option">dom<span>DT</span></code></a> as the jQuery UI integration
uses a complex expression for <a href="//datatables.net/reference/option/dom"><code class="option" title=
"DataTables initialisation option">dom<span>DT</span></code></a>.</p>
</div>
<table id="example" class="display" cellspacing="0" width="100%">
<thead>
<tr>
<th>Name</th>
<th>Position</th>
<th>Office</th>
<th>Age</th>
<th>Start date</th>
<th>Salary</th>
</tr>
</thead>
<tfoot>
<tr>
<th>Name</th>
<th>Position</th>
<th>Office</th>
<th>Age</th>
<th>Start date</th>
<th>Salary</th>
</tr>
</tfoot>
<tbody>
<tr>
<td>Tiger Nixon</td>
<td>System Architect</td>
<td>Edinburgh</td>
<td>61</td>
<td>2011/04/25</td>
<td>$320,800</td>
</tr>
<tr>
<td>Garrett Winters</td>
<td>Accountant</td>
<td>Tokyo</td>
<td>63</td>
<td>2011/07/25</td>
<td>$170,750</td>
</tr>
<tr>
<td>Ashton Cox</td>
<td>Junior Technical Author</td>
<td>San Francisco</td>
<td>66</td>
<td>2009/01/12</td>
<td>$86,000</td>
</tr>
<tr>
<td>Cedric Kelly</td>
<td>Senior Javascript Developer</td>
<td>Edinburgh</td>
<td>22</td>
<td>2012/03/29</td>
<td>$433,060</td>
</tr>
<tr>
<td>Airi Satou</td>
<td>Accountant</td>
<td>Tokyo</td>
<td>33</td>
<td>2008/11/28</td>
<td>$162,700</td>
</tr>
<tr>
<td>Brielle Williamson</td>
<td>Integration Specialist</td>
<td>New York</td>
<td>61</td>
<td>2012/12/02</td>
<td>$372,000</td>
</tr>
<tr>
<td>Herrod Chandler</td>
<td>Sales Assistant</td>
<td>San Francisco</td>
<td>59</td>
<td>2012/08/06</td>
<td>$137,500</td>
</tr>
<tr>
<td>Rhona Davidson</td>
<td>Integration Specialist</td>
<td>Tokyo</td>
<td>55</td>
<td>2010/10/14</td>
<td>$327,900</td>
</tr>
<tr>
<td>Colleen Hurst</td>
<td>Javascript Developer</td>
<td>San Francisco</td>
<td>39</td>
<td>2009/09/15</td>
<td>$205,500</td>
</tr>
<tr>
<td>Sonya Frost</td>
<td>Software Engineer</td>
<td>Edinburgh</td>
<td>23</td>
<td>2008/12/13</td>
<td>$103,600</td>
</tr>
<tr>
<td>Jena Gaines</td>
<td>Office Manager</td>
<td>London</td>
<td>30</td>
<td>2008/12/19</td>
<td>$90,560</td>
</tr>
<tr>
<td>Quinn Flynn</td>
<td>Support Lead</td>
<td>Edinburgh</td>
<td>22</td>
<td>2013/03/03</td>
<td>$342,000</td>
</tr>
<tr>
<td>Charde Marshall</td>
<td>Regional Director</td>
<td>San Francisco</td>
<td>36</td>
<td>2008/10/16</td>
<td>$470,600</td>
</tr>
<tr>
<td>Haley Kennedy</td>
<td>Senior Marketing Designer</td>
<td>London</td>
<td>43</td>
<td>2012/12/18</td>
<td>$313,500</td>
</tr>
<tr>
<td>Tatyana Fitzpatrick</td>
<td>Regional Director</td>
<td>London</td>
<td>19</td>
<td>2010/03/17</td>
<td>$385,750</td>
</tr>
<tr>
<td>Michael Silva</td>
<td>Marketing Designer</td>
<td>London</td>
<td>66</td>
<td>2012/11/27</td>
<td>$198,500</td>
</tr>
<tr>
<td>Paul Byrd</td>
<td>Chief Financial Officer (CFO)</td>
<td>New York</td>
<td>64</td>
<td>2010/06/09</td>
<td>$725,000</td>
</tr>
<tr>
<td>Gloria Little</td>
<td>Systems Administrator</td>
<td>New York</td>
<td>59</td>
<td>2009/04/10</td>
<td>$237,500</td>
</tr>
<tr>
<td>Bradley Greer</td>
<td>Software Engineer</td>
<td>London</td>
<td>41</td>
<td>2012/10/13</td>
<td>$132,000</td>
</tr>
<tr>
<td>Dai Rios</td>
<td>Personnel Lead</td>
<td>Edinburgh</td>
<td>35</td>
<td>2012/09/26</td>
<td>$217,500</td>
</tr>
<tr>
<td>Jenette Caldwell</td>
<td>Development Lead</td>
<td>New York</td>
<td>30</td>
<td>2011/09/03</td>
<td>$345,000</td>
</tr>
<tr>
<td>Yuri Berry</td>
<td>Chief Marketing Officer (CMO)</td>
<td>New York</td>
<td>40</td>
<td>2009/06/25</td>
<td>$675,000</td>
</tr>
<tr>
<td>Caesar Vance</td>
<td>Pre-Sales Support</td>
<td>New York</td>
<td>21</td>
<td>2011/12/12</td>
<td>$106,450</td>
</tr>
<tr>
<td>Doris Wilder</td>
<td>Sales Assistant</td>
<td>Sidney</td>
<td>23</td>
<td>2010/09/20</td>
<td>$85,600</td>
</tr>
<tr>
<td>Angelica Ramos</td>
<td>Chief Executive Officer (CEO)</td>
<td>London</td>
<td>47</td>
<td>2009/10/09</td>
<td>$1,200,000</td>
</tr>
<tr>
<td>Gavin Joyce</td>
<td>Developer</td>
<td>Edinburgh</td>
<td>42</td>
<td>2010/12/22</td>
<td>$92,575</td>
</tr>
<tr>
<td>Jennifer Chang</td>
<td>Regional Director</td>
<td>Singapore</td>
<td>28</td>
<td>2010/11/14</td>
<td>$357,650</td>
</tr>
<tr>
<td>Brenden Wagner</td>
<td>Software Engineer</td>
<td>San Francisco</td>
<td>28</td>
<td>2011/06/07</td>
<td>$206,850</td>
</tr>
<tr>
<td>Fiona Green</td>
<td>Chief Operating Officer (COO)</td>
<td>San Francisco</td>
<td>48</td>
<td>2010/03/11</td>
<td>$850,000</td>
</tr>
<tr>
<td>Shou Itou</td>
<td>Regional Marketing</td>
<td>Tokyo</td>
<td>20</td>
<td>2011/08/14</td>
<td>$163,000</td>
</tr>
<tr>
<td>Michelle House</td>
<td>Integration Specialist</td>
<td>Sidney</td>
<td>37</td>
<td>2011/06/02</td>
<td>$95,400</td>
</tr>
<tr>
<td>Suki Burks</td>
<td>Developer</td>
<td>London</td>
<td>53</td>
<td>2009/10/22</td>
<td>$114,500</td>
</tr>
<tr>
<td>Prescott Bartlett</td>
<td>Technical Author</td>
<td>London</td>
<td>27</td>
<td>2011/05/07</td>
<td>$145,000</td>
</tr>
<tr>
<td>Gavin Cortez</td>
<td>Team Leader</td>
<td>San Francisco</td>
<td>22</td>
<td>2008/10/26</td>
<td>$235,500</td>
</tr>
<tr>
<td>Martena Mccray</td>
<td>Post-Sales support</td>
<td>Edinburgh</td>
<td>46</td>
<td>2011/03/09</td>
<td>$324,050</td>
</tr>
<tr>
<td>Unity Butler</td>
<td>Marketing Designer</td>
<td>San Francisco</td>
<td>47</td>
<td>2009/12/09</td>
<td>$85,675</td>
</tr>
<tr>
<td>Howard Hatfield</td>
<td>Office Manager</td>
<td>San Francisco</td>
<td>51</td>
<td>2008/12/16</td>
<td>$164,500</td>
</tr>
<tr>
<td>Hope Fuentes</td>
<td>Secretary</td>
<td>San Francisco</td>
<td>41</td>
<td>2010/02/12</td>
<td>$109,850</td>
</tr>
<tr>
<td>Vivian Harrell</td>
<td>Financial Controller</td>
<td>San Francisco</td>
<td>62</td>
<td>2009/02/14</td>
<td>$452,500</td>
</tr>
<tr>
<td>Timothy Mooney</td>
<td>Office Manager</td>
<td>London</td>
<td>37</td>
<td>2008/12/11</td>
<td>$136,200</td>
</tr>
<tr>
<td>Jackson Bradshaw</td>
<td>Director</td>
<td>New York</td>
<td>65</td>
<td>2008/09/26</td>
<td>$645,750</td>
</tr>
<tr>
<td>Olivia Liang</td>
<td>Support Engineer</td>
<td>Singapore</td>
<td>64</td>
<td>2011/02/03</td>
<td>$234,500</td>
</tr>
<tr>
<td>Bruno Nash</td>
<td>Software Engineer</td>
<td>London</td>
<td>38</td>
<td>2011/05/03</td>
<td>$163,500</td>
</tr>
<tr>
<td>Sakura Yamamoto</td>
<td>Support Engineer</td>
<td>Tokyo</td>
<td>37</td>
<td>2009/08/19</td>
<td>$139,575</td>
</tr>
<tr>
<td>Thor Walton</td>
<td>Developer</td>
<td>New York</td>
<td>61</td>
<td>2013/08/11</td>
<td>$98,540</td>
</tr>
<tr>
<td>Finn Camacho</td>
<td>Support Engineer</td>
<td>San Francisco</td>
<td>47</td>
<td>2009/07/07</td>
<td>$87,500</td>
</tr>
<tr>
<td>Serge Baldwin</td>
<td>Data Coordinator</td>
<td>Singapore</td>
<td>64</td>
<td>2012/04/09</td>
<td>$138,575</td>
</tr>
<tr>
<td>Zenaida Frank</td>
<td>Software Engineer</td>
<td>New York</td>
<td>63</td>
<td>2010/01/04</td>
<td>$125,250</td>
</tr>
<tr>
<td>Zorita Serrano</td>
<td>Software Engineer</td>
<td>San Francisco</td>
<td>56</td>
<td>2012/06/01</td>
<td>$115,000</td>
</tr>
<tr>
<td>Jennifer Acosta</td>
<td>Junior Javascript Developer</td>
<td>Edinburgh</td>
<td>43</td>
<td>2013/02/01</td>
<td>$75,650</td>
</tr>
<tr>
<td>Cara Stevens</td>
<td>Sales Assistant</td>
<td>New York</td>
<td>46</td>
<td>2011/12/06</td>
<td>$145,600</td>
</tr>
<tr>
<td>Hermione Butler</td>
<td>Regional Director</td>
<td>London</td>
<td>47</td>
<td>2011/03/21</td>
<td>$356,250</td>
</tr>
<tr>
<td>Lael Greer</td>
<td>Systems Administrator</td>
<td>London</td>
<td>21</td>
<td>2009/02/27</td>
<td>$103,500</td>
</tr>
<tr>
<td>Jonas Alexander</td>
<td>Developer</td>
<td>San Francisco</td>
<td>30</td>
<td>2010/07/14</td>
<td>$86,500</td>
</tr>
<tr>
<td>Shad Decker</td>
<td>Regional Director</td>
<td>Edinburgh</td>
<td>51</td>
<td>2008/11/13</td>
<td>$183,000</td>
</tr>
<tr>
<td>Michael Bruce</td>
<td>Javascript Developer</td>
<td>Singapore</td>
<td>29</td>
<td>2011/06/27</td>
<td>$183,000</td>
</tr>
<tr>
<td>Donna Snider</td>
<td>Customer Support</td>
<td>New York</td>
<td>27</td>
<td>2011/01/25</td>
<td>$112,000</td>
</tr>
</tbody>
</table>
<ul class="tabs">
<li class="active">Javascript</li>
<li>HTML</li>
<li>CSS</li>
<li>Ajax</li>
<li>Server-side script</li>
</ul>
<div class="tabs">
<div class="js">
<p>The Javascript shown below is used to initialise the table shown in this example:</p><code class="multiline language-js">$(document).ready(function() {
var table = $('#example').dataTable();
new $.fn.dataTable.ColReorder( table );
} );</code>
<p>In addition to the above code, the following Javascript library files are loaded for use in this example:</p>
<ul>
<li><a href="../../../media/js/jquery.js">../../../media/js/jquery.js</a></li>
<li><a href="../../../media/js/jquery.dataTables.js">../../../media/js/jquery.dataTables.js</a></li>
<li><a href="../../Plugins/integration/jqueryui/dataTables.jqueryui.js">../../Plugins/integration/jqueryui/dataTables.jqueryui.js</a></li>
<li><a href="../js/dataTables.colReorder.js">../js/dataTables.colReorder.js</a></li>
</ul>
</div>
<div class="table">
<p>The HTML shown below is the raw HTML table element, before it has been enhanced by DataTables:</p>
</div>
<div class="css">
<div>
<p>This example uses a little bit of additional CSS beyond what is loaded from the library files (below), in order to correctly display the table. The
additional CSS used is shown below:</p><code class="multiline language-css"></code>
</div>
<p>The following CSS library files are loaded for use in this example to provide the styling of the table:</p>
<ul>
<li><a href="//code.jquery.com/ui/1.11.2/themes/smoothness/jquery-ui.css">//code.jquery.com/ui/1.11.2/themes/smoothness/jquery-ui.css</a></li>
<li><a href="../../Plugins/integration/jqueryui/dataTables.jqueryui.css">../../Plugins/integration/jqueryui/dataTables.jqueryui.css</a></li>
<li><a href="../css/dataTables.colReorder.css">../css/dataTables.colReorder.css</a></li>
</ul>
</div>
<div class="ajax">
<p>This table loads data by Ajax. The latest data that has been loaded is shown below. This data will update automatically as any additional data is
loaded.</p>
</div>
<div class="php">
<p>The script used to perform the server-side processing for this table is shown below. Please note that this is just an example script using PHP. Server-side
processing scripts can be written in any language, using <a href="//datatables.net/manual/server-side">the protocol described in the DataTables
documentation</a>.</p>
</div>
</div>
</section>
</div>
<section>
<div class="footer">
<div class="gradient"></div>
<div class="liner">
<h2>Other examples</h2>
<div class="toc">
<div class="toc-group">
<h3><a href="./index.html">Examples</a></h3>
<ul class="toc active">
<li><a href="./simple.html">Basic initialisation</a></li>
<li><a href="./new_init.html">Initialisation using `new`</a></li>
<li><a href="./alt_insert.html">Alternative insert styling</a></li>
<li><a href="./realtime.html">Realtime updating</a></li>
<li><a href="./state_save.html">State saving</a></li>
<li><a href="./scrolling.html">Scrolling table</a></li>
<li><a href="./predefined.html">Predefined column ordering</a></li>
<li><a href="./reset.html">Reset ordering API</a></li>
<li><a href="./colvis.html">ColVis integration</a></li>
<li><a href="./fixedcolumns.html">FixedColumns integration</a></li>
<li><a href="./fixedheader.html">FixedHeader integration</a></li>
<li class="active"><a href="./jqueryui.html">jQuery UI styling</a></li>
<li><a href="./col_filter.html">Individual column filtering</a></li>
<li><a href="./server_side.html">Server-side processing</a></li>
</ul>
</div>
</div>
<div class="epilogue">
<p>Please refer to the <a href="http://www.datatables.net">DataTables documentation</a> for full information about its API properties and methods.<br>
Additionally, there are a wide range of <a href="http://www.datatables.net/extras">extras</a> and <a href="http://www.datatables.net/plug-ins">plug-ins</a>
which extend the capabilities of DataTables.</p>
<p class="copyright">DataTables designed and created by <a href="http://www.sprymedia.co.uk">SpryMedia Ltd</a> © 2007-2015<br>
DataTables is licensed under the <a href="http://www.datatables.net/mit">MIT license</a>.</p>
</div>
</div>
</div>
</section>
</body>
</html> |
Leadership Staff
Appointed by and reporting to the Board, the Wayne County Airport Authority Chief Executive Officer (CEO) leads the day-to-day management of the Authority and its staff of more than 600 airport professionals. The CEO is supported by a senior management team representing the multitude of professional disciplines at work around-the-clock to keep Metro Detroit’s airports moving. |
fileFormatVersion: 2
guid: 53c7d9340a3685c408bc1cb0fdaf953f
timeCreated: 1474751352
licenseType: Pro
TrueTypeFontImporter:
serializedVersion: 4
fontSize: 16
forceTextureCase: -2
characterSpacing: 0
characterPadding: 1
includeFontData: 1
fontNames:
- Roboto
fallbackFontReferences:
- {fileID: 12800000, guid: 0092f7798b6beb94c80979279fa3c9f9, type: 3}
- {fileID: 12800000, guid: 06d08cbcfa41d1e49bbeedbe1bb43076, type: 3}
customCharacters:
fontRenderingMode: 0
ascentCalculationMode: 1
userData:
assetBundleName:
assetBundleVariant:
|
January 3, 2013
Eating Green
What does it mean to “eat green”? Eating green means eating whole, nutritious, minimally-processed foods that are healthy for you and the environment. Two important considerations for eating green are how the food is grown and where it comes from. Does that mean that everything you eat must come from a local, organic farm? Obviously not, but eating green is actually quite simple. Here’s what you should take into consideration.
Is it organic? The arguments for eating organic are plentiful: Organic foods are free of not only pesticides, but hydrogenated fats, artificial colors and sweeteners, and preservatives as well. Organic foods are not genetically modified, when the long term health effects of GM foods are still unknown. They taste better and studies show they are more nutritious and richer in vitamins, minerals and essential fatty acids than non-organic food. And when it comes to the environment, organic farmers avoid the pesticides and herbicides that contaminate groundwater, erode soil, and damage local ecosystems. Now on the flip side: Who can afford to only buy organic food and are all conventional foods really so bad? Knowing which organic food is worth the extra cost can be confusing. Fortunately the Environmental Working Group offers a great resource with its annual “Dirty Dozen” list of the 12 conventionally-grown fruits and vegetables with the most pesticides, along with a list of the 15 cleanest fruits and vegetables. According to the EWG, you can lower your pesticide consumption by nearly four-fifths by avoiding the 12 most contaminated fruits and vegetables and instead eating the least contaminated produce. You can print out a wallet-size list or download the iPhone app at ewg.org/foodnews.
Is it local? Purchasing from local farmers is a great way to get fresh, healthy food that hasn’t been chemically modified to keep its appearance after traveling half way around the world. Find farms and farmer's markets in your area at localharvest.org. What if the farm you like isn’t certified organic? Earning organic certification is a lengthy and costly process that not all farmers can afford. Instead you can ask your local farmer if they use organic practices or, if they’re not organic, if they use non-synthetic pesticides and/or practice minimal spraying. If they answer yes to any of these questions, then you're likely buying from a conscientious farmer who’s producing good quality, minimally-processed food.
Is it in season? Even if you don’t get to the farmers’ market, you can still make an effort to purchase local produce at the grocery store. To buy local means to buy in season. Yes you can buy pretty much any type of fruit or vegetable any time of year, but what sacrifices in quality and impact to the environment do you have to make? By purchasing local foods when they are in season, you avoid the environmental damage caused by shipping foods thousands of miles and you’ll get fresher tasting fruits and vegetables. You can better plan your meals around what’s in season with the seasonal produce guide available at sustainabletable.org.
How else can you green up your diet? You can cut down on your waistline and your food budget, while doing the environment a good turn, by swapping one or two meat-based meals a week with a vegetarian or seafood dish. One of your best options for fish is Wild Alaskan Salmon. Because it is wild-caught, it's purer in flavor than farm-raised salmon (which is fed pigment and antibiotics) and higher in omega-3 fatty acids. Another great option is canned sardines. Unlike tuna, sardines aren't in danger of being over-fished and are low in mercury.
Finally, one cost-efficient way to eat green is to simply cook at home and pack a lunch (in reusable containers) as often as you can. By preparing your own food you'll be better able to avoid preservatives, cut down on packaging (think of all those ketchup packets and napkins in take-out bags), and save money. Now that is eating green. |
Q:
Cycle through pair of spaces for two screens with one keyboard shortcut
I have two displays and created for each display with Mission Control several desktops (also known as Spaces):
Display 1: Desktops 1-5
Display 2: Desktops 6-10
I have following related settings adjusted
Disabled: Automatically rearrange Spaces based on most recent use
Enabled: Displays have separate Spaces
I want to treat the desktops of each display as 5 pairs:
Desktops 1,6
Desktops 2,7
Desktops 3,8
Desktops 4,9
Desktops 5,10
I have already changed the keyboard shortcuts as following (from here):
This works fine after I have deleted ~/Library/Preferences/com.apple.symbolichotkeys.plist.
How can I cycle through the pairs of desktops with one keyboard shortcut, e.g. ctrl-left/right?
I am actually testing Amethyst and want to use mod1+n/p (mod1=ctrl+shift). I am hoping that I could use AppleScript to increase/decrease the desktop number 'modulo 5'. I am on macOS 10.14.5.
A:
Yabai: tiling window manager with support for spaces
https://github.com/koekeishiya/yabai/wiki#comparison-with-other-window-managers
Requirements of Yabai
"System Integrity Protection (SIP)" must be disabled
"Displays have separate spaces" must be enabled
Note
Yabai allows you to switch to a different space without animation (great)
Disable the Mission Control Mappings and use this ~/.skhdrc file with mappings as the OP wants (uses jq, e.g. install with $ brew install jq)
ctrl - left : index=`yabai -m query --spaces --space | jq '.index'` &&\\
if (($index != 1 && $index != 6 )) then\\
new=$((index-1)); \\
other=$(((new+5)%10));\\
yabai -m space --focus "${other}"; yabai -m space --focus "${new}";\\
fi
ctrl - right : index=`yabai -m query --spaces --space | jq '.index'` &&\\
if (($index != 5 && $index != 10 )) then\\
new=$((index+1)); \\
other=$(((index+5)%10+1));\\
yabai -m space --focus "${other}"; yabai -m space --focus "${new}";\\
fi
# ctrl+1-5:
ctrl - 1 : index=`yabai -m query --displays --display | jq '.index'` &&\\
if (($index == 1)) then\\
yabai -m space --focus 6; yabai -m space --focus 1;\\
else \\
yabai -m space --focus 1; yabai -m space --focus 6;\\
fi
ctrl - 2 : index=`yabai -m query --displays --display | jq '.index'` &&\\
if (($index == 1)) then\\
yabai -m space --focus 7; yabai -m space --focus 2;\\
else \\
yabai -m space --focus 2; yabai -m space --focus 7;\\
fi
ctrl - 3 : index=`yabai -m query --displays --display | jq '.index'` &&\\
if (($index == 1)) then\\
yabai -m space --focus 8; yabai -m space --focus 3;\\
else \\
yabai -m space --focus 3; yabai -m space --focus 8;\\
fi
ctrl - 4 : index=`yabai -m query --displays --display | jq '.index'` &&\\
if (($index == 1)) then\\
yabai -m space --focus 9; yabai -m space --focus 4;\\
else \\
yabai -m space --focus 4; yabai -m space --focus 9;\\
fi
ctrl - 5 : index=`yabai -m query --displays --display | jq '.index'` &&\\
if (($index == 1)) then\\
yabai -m space --focus 10; yabai -m space --focus 5;\\
else \\
yabai -m space --focus 5; yabai -m space --focus 10;\\
fi
If you are not interested in a tiling window manager but want to use these mappings, you can choose the layout mode 'float' in ~/.yabairc:
yabai -m config layout float
|
Microhabitats of monogenean gill parasites on European eel (Anguilla anguilla).
The distribution of adult Pseudodactylogyrus anquillae and P. bini and postlarvae was recorded on glass-eels and pigmented eels of different size and infection intensity. The two species occupied different microhabitats on the host's gill apparatus but the preferred sites depended partly on host size. Postlarval migration was indicated. Mortality of young parasites, reinforcement of reproductive barriers and competition seems to be less likely explanations of the spatial distribution. |
Re: So I would have to pay just to watch machinima?
You are mis-reading. Google is merely giving the option for partners/directors to offer channels or videos up for subscription, not forcing everything to go pay-for. It would be up to the partners to decide whether or not they want to go subscription based.
Given the fact that many have made their massive subscriber-bases on the free and sometimes ad-supported model so doubt they would push for the pay model. If anything I see the higher profile channels like Vevo offering something in the pay model.--I swear, some people should have pace-makers installed to free up the resources. Breathing and heart beat taxes their whole system, all of their brain cells wasted on life support.-two bit brains, and the second bit is wasted on parity! ~head_spaz |
Q:
what is the name of the very bottom of the eclipse window? I want to turn it off but can't until I know what its called
I like to keep as much of my Eclipse screen as possible for code. So I try to disable or turn off as many of the extra bars and such as possible. The area at the very bottom of the Eclipse screen is my next target but I don't know what it's called.
Can anyone tell me the name of this area and how to reclaim it? Thanks.
A:
Here is an eclipse plug-in which hides/shows Menu bar and/or Status bar.
User can change these options in Windows > Preferences > Full Screen
But Hiding Status bar was NOT working on my machine
Ubuntu 13.10 Eclipse Version: Kepler Release Build id: 20130614-0229
|
/*
* Copyright (c) 2018 gxw <guxiwei-hf@loongson.cn>
*
* This file is part of FFmpeg.
*
* FFmpeg is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
*
* FFmpeg 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
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with FFmpeg; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*/
#include "vp3dsp_mips.h"
#include "libavutil/mips/generic_macros_msa.h"
#include "libavutil/intreadwrite.h"
#include "libavcodec/rnd_avg.h"
static void idct_msa(uint8_t *dst, int stride, int16_t *input, int type)
{
v8i16 r0, r1, r2, r3, r4, r5, r6, r7, sign;
v4i32 r0_r, r0_l, r1_r, r1_l, r2_r, r2_l, r3_r, r3_l,
r4_r, r4_l, r5_r, r5_l, r6_r, r6_l, r7_r, r7_l;
v4i32 A, B, C, D, Ad, Bd, Cd, Dd, E, F, G, H;
v4i32 Ed, Gd, Add, Bdd, Fd, Hd;
v16u8 sign_l;
v16i8 d0, d1, d2, d3, d4, d5, d6, d7;
v4i32 c0, c1, c2, c3, c4, c5, c6, c7;
v4i32 f0, f1, f2, f3, f4, f5, f6, f7;
v4i32 sign_t;
v16i8 zero = {0};
v16i8 mask = {0, 4, 8, 12, 16, 20, 24, 28, 0, 0, 0, 0, 0, 0, 0, 0};
v4i32 cnst64277w = {64277, 64277, 64277, 64277};
v4i32 cnst60547w = {60547, 60547, 60547, 60547};
v4i32 cnst54491w = {54491, 54491, 54491, 54491};
v4i32 cnst46341w = {46341, 46341, 46341, 46341};
v4i32 cnst36410w = {36410, 36410, 36410, 36410};
v4i32 cnst25080w = {25080, 25080, 25080, 25080};
v4i32 cnst12785w = {12785, 12785, 12785, 12785};
v4i32 cnst8w = {8, 8, 8, 8};
v4i32 cnst2048w = {2048, 2048, 2048, 2048};
v4i32 cnst128w = {128, 128, 128, 128};
/* Extended input data */
LD_SH8(input, 8, r0, r1, r2, r3, r4, r5, r6, r7);
sign = __msa_clti_s_h(r0, 0);
r0_r = (v4i32) __msa_ilvr_h(sign, r0);
r0_l = (v4i32) __msa_ilvl_h(sign, r0);
sign = __msa_clti_s_h(r1, 0);
r1_r = (v4i32) __msa_ilvr_h(sign, r1);
r1_l = (v4i32) __msa_ilvl_h(sign, r1);
sign = __msa_clti_s_h(r2, 0);
r2_r = (v4i32) __msa_ilvr_h(sign, r2);
r2_l = (v4i32) __msa_ilvl_h(sign, r2);
sign = __msa_clti_s_h(r3, 0);
r3_r = (v4i32) __msa_ilvr_h(sign, r3);
r3_l = (v4i32) __msa_ilvl_h(sign, r3);
sign = __msa_clti_s_h(r4, 0);
r4_r = (v4i32) __msa_ilvr_h(sign, r4);
r4_l = (v4i32) __msa_ilvl_h(sign, r4);
sign = __msa_clti_s_h(r5, 0);
r5_r = (v4i32) __msa_ilvr_h(sign, r5);
r5_l = (v4i32) __msa_ilvl_h(sign, r5);
sign = __msa_clti_s_h(r6, 0);
r6_r = (v4i32) __msa_ilvr_h(sign, r6);
r6_l = (v4i32) __msa_ilvl_h(sign, r6);
sign = __msa_clti_s_h(r7, 0);
r7_r = (v4i32) __msa_ilvr_h(sign, r7);
r7_l = (v4i32) __msa_ilvl_h(sign, r7);
/* Right part */
A = ((r1_r * cnst64277w) >> 16) + ((r7_r * cnst12785w) >> 16);
B = ((r1_r * cnst12785w) >> 16) - ((r7_r * cnst64277w) >> 16);
C = ((r3_r * cnst54491w) >> 16) + ((r5_r * cnst36410w) >> 16);
D = ((r5_r * cnst54491w) >> 16) - ((r3_r * cnst36410w) >> 16);
Ad = ((A - C) * cnst46341w) >> 16;
Bd = ((B - D) * cnst46341w) >> 16;
Cd = A + C;
Dd = B + D;
E = ((r0_r + r4_r) * cnst46341w) >> 16;
F = ((r0_r - r4_r) * cnst46341w) >> 16;
G = ((r2_r * cnst60547w) >> 16) + ((r6_r * cnst25080w) >> 16);
H = ((r2_r * cnst25080w) >> 16) - ((r6_r * cnst60547w) >> 16);
Ed = E - G;
Gd = E + G;
Add = F + Ad;
Bdd = Bd - H;
Fd = F - Ad;
Hd = Bd + H;
r0_r = Gd + Cd;
r7_r = Gd - Cd;
r1_r = Add + Hd;
r2_r = Add - Hd;
r3_r = Ed + Dd;
r4_r = Ed - Dd;
r5_r = Fd + Bdd;
r6_r = Fd - Bdd;
/* Left part */
A = ((r1_l * cnst64277w) >> 16) + ((r7_l * cnst12785w) >> 16);
B = ((r1_l * cnst12785w) >> 16) - ((r7_l * cnst64277w) >> 16);
C = ((r3_l * cnst54491w) >> 16) + ((r5_l * cnst36410w) >> 16);
D = ((r5_l * cnst54491w) >> 16) - ((r3_l * cnst36410w) >> 16);
Ad = ((A - C) * cnst46341w) >> 16;
Bd = ((B - D) * cnst46341w) >> 16;
Cd = A + C;
Dd = B + D;
E = ((r0_l + r4_l) * cnst46341w) >> 16;
F = ((r0_l - r4_l) * cnst46341w) >> 16;
G = ((r2_l * cnst60547w) >> 16) + ((r6_l * cnst25080w) >> 16);
H = ((r2_l * cnst25080w) >> 16) - ((r6_l * cnst60547w) >> 16);
Ed = E - G;
Gd = E + G;
Add = F + Ad;
Bdd = Bd - H;
Fd = F - Ad;
Hd = Bd + H;
r0_l = Gd + Cd;
r7_l = Gd - Cd;
r1_l = Add + Hd;
r2_l = Add - Hd;
r3_l = Ed + Dd;
r4_l = Ed - Dd;
r5_l = Fd + Bdd;
r6_l = Fd - Bdd;
/* Row 0 to 3 */
TRANSPOSE4x4_SW_SW(r0_r, r1_r, r2_r, r3_r,
r0_r, r1_r, r2_r, r3_r);
TRANSPOSE4x4_SW_SW(r0_l, r1_l, r2_l, r3_l,
r0_l, r1_l, r2_l, r3_l);
A = ((r1_r * cnst64277w) >> 16) + ((r3_l * cnst12785w) >> 16);
B = ((r1_r * cnst12785w) >> 16) - ((r3_l * cnst64277w) >> 16);
C = ((r3_r * cnst54491w) >> 16) + ((r1_l * cnst36410w) >> 16);
D = ((r1_l * cnst54491w) >> 16) - ((r3_r * cnst36410w) >> 16);
Ad = ((A - C) * cnst46341w) >> 16;
Bd = ((B - D) * cnst46341w) >> 16;
Cd = A + C;
Dd = B + D;
E = ((r0_r + r0_l) * cnst46341w) >> 16;
E += cnst8w;
F = ((r0_r - r0_l) * cnst46341w) >> 16;
F += cnst8w;
if (type == 1) { // HACK
E += cnst2048w;
F += cnst2048w;
}
G = ((r2_r * cnst60547w) >> 16) + ((r2_l * cnst25080w) >> 16);
H = ((r2_r * cnst25080w) >> 16) - ((r2_l * cnst60547w) >> 16);
Ed = E - G;
Gd = E + G;
Add = F + Ad;
Bdd = Bd - H;
Fd = F - Ad;
Hd = Bd + H;
A = (Gd + Cd) >> 4;
B = (Gd - Cd) >> 4;
C = (Add + Hd) >> 4;
D = (Add - Hd) >> 4;
E = (Ed + Dd) >> 4;
F = (Ed - Dd) >> 4;
G = (Fd + Bdd) >> 4;
H = (Fd - Bdd) >> 4;
if (type != 1) {
LD_SB8(dst, stride, d0, d1, d2, d3, d4, d5, d6, d7);
ILVR_B4_SW(zero, d0, zero, d1, zero, d2, zero, d3,
f0, f1, f2, f3);
ILVR_B4_SW(zero, d4, zero, d5, zero, d6, zero, d7,
f4, f5, f6, f7);
ILVR_H4_SW(zero, f0, zero, f1, zero, f2, zero, f3,
c0, c1, c2, c3);
ILVR_H4_SW(zero, f4, zero, f5, zero, f6, zero, f7,
c4, c5, c6, c7);
A += c0;
B += c7;
C += c1;
D += c2;
E += c3;
F += c4;
G += c5;
H += c6;
}
CLIP_SW8_0_255(A, B, C, D, E, F, G, H);
sign_l = __msa_or_v((v16u8)r1_r, (v16u8)r2_r);
sign_l = __msa_or_v(sign_l, (v16u8)r3_r);
sign_l = __msa_or_v(sign_l, (v16u8)r0_l);
sign_l = __msa_or_v(sign_l, (v16u8)r1_l);
sign_l = __msa_or_v(sign_l, (v16u8)r2_l);
sign_l = __msa_or_v(sign_l, (v16u8)r3_l);
sign_t = __msa_ceqi_w((v4i32)sign_l, 0);
Add = ((r0_r * cnst46341w) + (8 << 16)) >> 20;
if (type == 1) {
Bdd = Add + cnst128w;
CLIP_SW_0_255(Bdd);
Ad = Bdd;
Bd = Bdd;
Cd = Bdd;
Dd = Bdd;
Ed = Bdd;
Fd = Bdd;
Gd = Bdd;
Hd = Bdd;
} else {
Ad = Add + c0;
Bd = Add + c1;
Cd = Add + c2;
Dd = Add + c3;
Ed = Add + c4;
Fd = Add + c5;
Gd = Add + c6;
Hd = Add + c7;
CLIP_SW8_0_255(Ad, Bd, Cd, Dd, Ed, Fd, Gd, Hd);
}
Ad = (v4i32)__msa_and_v((v16u8)Ad, (v16u8)sign_t);
Bd = (v4i32)__msa_and_v((v16u8)Bd, (v16u8)sign_t);
Cd = (v4i32)__msa_and_v((v16u8)Cd, (v16u8)sign_t);
Dd = (v4i32)__msa_and_v((v16u8)Dd, (v16u8)sign_t);
Ed = (v4i32)__msa_and_v((v16u8)Ed, (v16u8)sign_t);
Fd = (v4i32)__msa_and_v((v16u8)Fd, (v16u8)sign_t);
Gd = (v4i32)__msa_and_v((v16u8)Gd, (v16u8)sign_t);
Hd = (v4i32)__msa_and_v((v16u8)Hd, (v16u8)sign_t);
sign_t = __msa_ceqi_w(sign_t, 0);
A = (v4i32)__msa_and_v((v16u8)A, (v16u8)sign_t);
B = (v4i32)__msa_and_v((v16u8)B, (v16u8)sign_t);
C = (v4i32)__msa_and_v((v16u8)C, (v16u8)sign_t);
D = (v4i32)__msa_and_v((v16u8)D, (v16u8)sign_t);
E = (v4i32)__msa_and_v((v16u8)E, (v16u8)sign_t);
F = (v4i32)__msa_and_v((v16u8)F, (v16u8)sign_t);
G = (v4i32)__msa_and_v((v16u8)G, (v16u8)sign_t);
H = (v4i32)__msa_and_v((v16u8)H, (v16u8)sign_t);
r0_r = Ad + A;
r1_r = Bd + C;
r2_r = Cd + D;
r3_r = Dd + E;
r0_l = Ed + F;
r1_l = Fd + G;
r2_l = Gd + H;
r3_l = Hd + B;
/* Row 4 to 7 */
TRANSPOSE4x4_SW_SW(r4_r, r5_r, r6_r, r7_r,
r4_r, r5_r, r6_r, r7_r);
TRANSPOSE4x4_SW_SW(r4_l, r5_l, r6_l, r7_l,
r4_l, r5_l, r6_l, r7_l);
A = ((r5_r * cnst64277w) >> 16) + ((r7_l * cnst12785w) >> 16);
B = ((r5_r * cnst12785w) >> 16) - ((r7_l * cnst64277w) >> 16);
C = ((r7_r * cnst54491w) >> 16) + ((r5_l * cnst36410w) >> 16);
D = ((r5_l * cnst54491w) >> 16) - ((r7_r * cnst36410w) >> 16);
Ad = ((A - C) * cnst46341w) >> 16;
Bd = ((B - D) * cnst46341w) >> 16;
Cd = A + C;
Dd = B + D;
E = ((r4_r + r4_l) * cnst46341w) >> 16;
E += cnst8w;
F = ((r4_r - r4_l) * cnst46341w) >> 16;
F += cnst8w;
if (type == 1) { // HACK
E += cnst2048w;
F += cnst2048w;
}
G = ((r6_r * cnst60547w) >> 16) + ((r6_l * cnst25080w) >> 16);
H = ((r6_r * cnst25080w) >> 16) - ((r6_l * cnst60547w) >> 16);
Ed = E - G;
Gd = E + G;
Add = F + Ad;
Bdd = Bd - H;
Fd = F - Ad;
Hd = Bd + H;
A = (Gd + Cd) >> 4;
B = (Gd - Cd) >> 4;
C = (Add + Hd) >> 4;
D = (Add - Hd) >> 4;
E = (Ed + Dd) >> 4;
F = (Ed - Dd) >> 4;
G = (Fd + Bdd) >> 4;
H = (Fd - Bdd) >> 4;
if (type != 1) {
ILVL_H4_SW(zero, f0, zero, f1, zero, f2, zero, f3,
c0, c1, c2, c3);
ILVL_H4_SW(zero, f4, zero, f5, zero, f6, zero, f7,
c4, c5, c6, c7);
A += c0;
B += c7;
C += c1;
D += c2;
E += c3;
F += c4;
G += c5;
H += c6;
}
CLIP_SW8_0_255(A, B, C, D, E, F, G, H);
sign_l = __msa_or_v((v16u8)r5_r, (v16u8)r6_r);
sign_l = __msa_or_v(sign_l, (v16u8)r7_r);
sign_l = __msa_or_v(sign_l, (v16u8)r4_l);
sign_l = __msa_or_v(sign_l, (v16u8)r5_l);
sign_l = __msa_or_v(sign_l, (v16u8)r6_l);
sign_l = __msa_or_v(sign_l, (v16u8)r7_l);
sign_t = __msa_ceqi_w((v4i32)sign_l, 0);
Add = ((r4_r * cnst46341w) + (8 << 16)) >> 20;
if (type == 1) {
Bdd = Add + cnst128w;
CLIP_SW_0_255(Bdd);
Ad = Bdd;
Bd = Bdd;
Cd = Bdd;
Dd = Bdd;
Ed = Bdd;
Fd = Bdd;
Gd = Bdd;
Hd = Bdd;
} else {
Ad = Add + c0;
Bd = Add + c1;
Cd = Add + c2;
Dd = Add + c3;
Ed = Add + c4;
Fd = Add + c5;
Gd = Add + c6;
Hd = Add + c7;
CLIP_SW8_0_255(Ad, Bd, Cd, Dd, Ed, Fd, Gd, Hd);
}
Ad = (v4i32)__msa_and_v((v16u8)Ad, (v16u8)sign_t);
Bd = (v4i32)__msa_and_v((v16u8)Bd, (v16u8)sign_t);
Cd = (v4i32)__msa_and_v((v16u8)Cd, (v16u8)sign_t);
Dd = (v4i32)__msa_and_v((v16u8)Dd, (v16u8)sign_t);
Ed = (v4i32)__msa_and_v((v16u8)Ed, (v16u8)sign_t);
Fd = (v4i32)__msa_and_v((v16u8)Fd, (v16u8)sign_t);
Gd = (v4i32)__msa_and_v((v16u8)Gd, (v16u8)sign_t);
Hd = (v4i32)__msa_and_v((v16u8)Hd, (v16u8)sign_t);
sign_t = __msa_ceqi_w(sign_t, 0);
A = (v4i32)__msa_and_v((v16u8)A, (v16u8)sign_t);
B = (v4i32)__msa_and_v((v16u8)B, (v16u8)sign_t);
C = (v4i32)__msa_and_v((v16u8)C, (v16u8)sign_t);
D = (v4i32)__msa_and_v((v16u8)D, (v16u8)sign_t);
E = (v4i32)__msa_and_v((v16u8)E, (v16u8)sign_t);
F = (v4i32)__msa_and_v((v16u8)F, (v16u8)sign_t);
G = (v4i32)__msa_and_v((v16u8)G, (v16u8)sign_t);
H = (v4i32)__msa_and_v((v16u8)H, (v16u8)sign_t);
r4_r = Ad + A;
r5_r = Bd + C;
r6_r = Cd + D;
r7_r = Dd + E;
r4_l = Ed + F;
r5_l = Fd + G;
r6_l = Gd + H;
r7_l = Hd + B;
VSHF_B2_SB(r0_r, r4_r, r1_r, r5_r, mask, mask, d0, d1);
VSHF_B2_SB(r2_r, r6_r, r3_r, r7_r, mask, mask, d2, d3);
VSHF_B2_SB(r0_l, r4_l, r1_l, r5_l, mask, mask, d4, d5);
VSHF_B2_SB(r2_l, r6_l, r3_l, r7_l, mask, mask, d6, d7);
/* Final sequence of operations over-write original dst */
ST_D1(d0, 0, dst);
ST_D1(d1, 0, dst + stride);
ST_D1(d2, 0, dst + 2 * stride);
ST_D1(d3, 0, dst + 3 * stride);
ST_D1(d4, 0, dst + 4 * stride);
ST_D1(d5, 0, dst + 5 * stride);
ST_D1(d6, 0, dst + 6 * stride);
ST_D1(d7, 0, dst + 7 * stride);
}
void ff_vp3_idct_put_msa(uint8_t *dest, ptrdiff_t line_size, int16_t *block)
{
idct_msa(dest, line_size, block, 1);
memset(block, 0, sizeof(*block) * 64);
}
void ff_vp3_idct_add_msa(uint8_t *dest, ptrdiff_t line_size, int16_t *block)
{
idct_msa(dest, line_size, block, 2);
memset(block, 0, sizeof(*block) * 64);
}
void ff_vp3_idct_dc_add_msa(uint8_t *dest, ptrdiff_t line_size, int16_t *block)
{
int i = (block[0] + 15) >> 5;
v4i32 dc = {i, i, i, i};
v16i8 d0, d1, d2, d3, d4, d5, d6, d7;
v4i32 c0, c1, c2, c3, c4, c5, c6, c7;
v4i32 e0, e1, e2, e3, e4, e5, e6, e7;
v4i32 r0, r1, r2, r3, r4, r5, r6, r7;
v16i8 mask = {0, 4, 8, 12, 16, 20, 24, 28, 0, 0, 0, 0, 0, 0, 0, 0};
v16i8 zero = {0};
LD_SB8(dest, line_size, d0, d1, d2, d3, d4, d5, d6, d7);
ILVR_B4_SW(zero, d0, zero, d1, zero, d2, zero, d3,
c0, c1, c2, c3);
ILVR_B4_SW(zero, d4, zero, d5, zero, d6, zero, d7,
c4, c5, c6, c7);
/* Right part */
ILVR_H4_SW(zero, c0, zero, c1, zero, c2, zero, c3,
e0, e1, e2, e3);
ILVR_H4_SW(zero, c4, zero, c5, zero, c6, zero, c7,
e4, e5, e6, e7);
e0 += dc;
e1 += dc;
e2 += dc;
e3 += dc;
e4 += dc;
e5 += dc;
e6 += dc;
e7 += dc;
CLIP_SW8_0_255(e0, e1, e2, e3, e4, e5, e6, e7);
/* Left part */
ILVL_H4_SW(zero, c0, zero, c1, zero, c2, zero, c3,
r0, r1, r2, r3);
ILVL_H4_SW(zero, c4, zero, c5, zero, c6, zero, c7,
r4, r5, r6, r7);
r0 += dc;
r1 += dc;
r2 += dc;
r3 += dc;
r4 += dc;
r5 += dc;
r6 += dc;
r7 += dc;
CLIP_SW8_0_255(r0, r1, r2, r3, r4, r5, r6, r7);
VSHF_B2_SB(e0, r0, e1, r1, mask, mask, d0, d1);
VSHF_B2_SB(e2, r2, e3, r3, mask, mask, d2, d3);
VSHF_B2_SB(e4, r4, e5, r5, mask, mask, d4, d5);
VSHF_B2_SB(e6, r6, e7, r7, mask, mask, d6, d7);
/* Final sequence of operations over-write original dst */
ST_D1(d0, 0, dest);
ST_D1(d1, 0, dest + line_size);
ST_D1(d2, 0, dest + 2 * line_size);
ST_D1(d3, 0, dest + 3 * line_size);
ST_D1(d4, 0, dest + 4 * line_size);
ST_D1(d5, 0, dest + 5 * line_size);
ST_D1(d6, 0, dest + 6 * line_size);
ST_D1(d7, 0, dest + 7 * line_size);
block[0] = 0;
}
void ff_vp3_v_loop_filter_msa(uint8_t *first_pixel, ptrdiff_t stride,
int *bounding_values)
{
int nstride = -stride;
v4i32 e0, e1, f0, f1, g0, g1;
v16i8 zero = {0};
v16i8 d0, d1, d2, d3;
v8i16 c0, c1, c2, c3;
v8i16 r0;
v8i16 cnst3h = {3, 3, 3, 3, 3, 3, 3, 3},
cnst4h = {4, 4, 4, 4, 4, 4, 4, 4};
v16i8 mask = {0, 4, 8, 12, 16, 20, 24, 28, 0, 0, 0, 0, 0, 0, 0, 0};
int16_t temp_16[8];
int temp_32[8];
LD_SB4(first_pixel + nstride * 2, stride, d0, d1, d2, d3);
ILVR_B4_SH(zero, d0, zero, d1, zero, d2, zero, d3,
c0, c1, c2, c3);
r0 = (c0 - c3) + (c2 - c1) * cnst3h;
r0 += cnst4h;
r0 = r0 >> 3;
/* Get filter_value from bounding_values one by one */
ST_SH(r0, temp_16);
for (int i = 0; i < 8; i++)
temp_32[i] = bounding_values[temp_16[i]];
LD_SW2(temp_32, 4, e0, e1);
ILVR_H2_SW(zero, c1, zero, c2, f0, g0);
ILVL_H2_SW(zero, c1, zero, c2, f1, g1);
f0 += e0;
f1 += e1;
g0 -= e0;
g1 -= e1;
CLIP_SW4_0_255(f0, f1, g0, g1);
VSHF_B2_SB(f0, f1, g0, g1, mask, mask, d1, d2);
/* Final move to first_pixel */
ST_D1(d1, 0, first_pixel + nstride);
ST_D1(d2, 0, first_pixel);
}
void ff_vp3_h_loop_filter_msa(uint8_t *first_pixel, ptrdiff_t stride,
int *bounding_values)
{
v16i8 d0, d1, d2, d3, d4, d5, d6, d7;
v8i16 c0, c1, c2, c3, c4, c5, c6, c7;
v8i16 r0;
v4i32 e0, e1, f0, f1, g0, g1;
v16i8 zero = {0};
v8i16 cnst3h = {3, 3, 3, 3, 3, 3, 3, 3},
cnst4h = {4, 4, 4, 4, 4, 4, 4, 4};
v16i8 mask = {0, 16, 4, 20, 8, 24, 12, 28, 0, 0, 0, 0, 0, 0, 0, 0};
int16_t temp_16[8];
int temp_32[8];
LD_SB8(first_pixel - 2, stride, d0, d1, d2, d3, d4, d5, d6, d7);
ILVR_B4_SH(zero, d0, zero, d1, zero, d2, zero, d3,
c0, c1, c2, c3);
ILVR_B4_SH(zero, d4, zero, d5, zero, d6, zero, d7,
c4, c5, c6, c7);
TRANSPOSE8x8_SH_SH(c0, c1, c2, c3, c4, c5, c6, c7,
c0, c1, c2, c3, c4, c5, c6, c7);
r0 = (c0 - c3) + (c2 - c1) * cnst3h;
r0 += cnst4h;
r0 = r0 >> 3;
/* Get filter_value from bounding_values one by one */
ST_SH(r0, temp_16);
for (int i = 0; i < 8; i++)
temp_32[i] = bounding_values[temp_16[i]];
LD_SW2(temp_32, 4, e0, e1);
ILVR_H2_SW(zero, c1, zero, c2, f0, g0);
ILVL_H2_SW(zero, c1, zero, c2, f1, g1);
f0 += e0;
f1 += e1;
g0 -= e0;
g1 -= e1;
CLIP_SW4_0_255(f0, f1, g0, g1);
VSHF_B2_SB(f0, g0, f1, g1, mask, mask, d1, d2);
/* Final move to first_pixel */
ST_H4(d1, 0, 1, 2, 3, first_pixel - 1, stride);
ST_H4(d2, 0, 1, 2, 3, first_pixel - 1 + 4 * stride, stride);
}
void ff_put_no_rnd_pixels_l2_msa(uint8_t *dst, const uint8_t *src1,
const uint8_t *src2, ptrdiff_t stride, int h)
{
if (h == 8) {
v16i8 d0, d1, d2, d3, d4, d5, d6, d7;
v16i8 c0, c1, c2, c3;
v4i32 a0, a1, a2, a3, b0, b1, b2, b3;
v4i32 e0, e1, e2;
v4i32 f0, f1, f2;
v4u32 t0, t1, t2, t3;
v16i8 mask = {0, 1, 2, 3, 16, 17, 18, 19, 4, 5, 6, 7, 20, 21, 22, 23};
int32_t value = 0xfefefefe;
v4i32 fmask = {value, value, value, value};
LD_SB8(src1, stride, d0, d1, d2, d3, d4, d5, d6, d7);
VSHF_B2_SB(d0, d1, d2, d3, mask, mask, c0, c1);
VSHF_B2_SB(d4, d5, d6, d7, mask, mask, c2, c3);
a0 = (v4i32) __msa_pckev_d((v2i64)c1, (v2i64)c0);
a2 = (v4i32) __msa_pckod_d((v2i64)c1, (v2i64)c0);
a1 = (v4i32) __msa_pckev_d((v2i64)c3, (v2i64)c2);
a3 = (v4i32) __msa_pckod_d((v2i64)c3, (v2i64)c2);
LD_SB8(src2, stride, d0, d1, d2, d3, d4, d5, d6, d7);
VSHF_B2_SB(d0, d1, d2, d3, mask, mask, c0, c1);
VSHF_B2_SB(d4, d5, d6, d7, mask, mask, c2, c3);
b0 = (v4i32) __msa_pckev_d((v2i64)c1, (v2i64)c0);
b2 = (v4i32) __msa_pckod_d((v2i64)c1, (v2i64)c0);
b1 = (v4i32) __msa_pckev_d((v2i64)c3, (v2i64)c2);
b3 = (v4i32) __msa_pckod_d((v2i64)c3, (v2i64)c2);
e0 = (v4i32) __msa_xor_v((v16u8)a0, (v16u8)b0);
e0 = (v4i32) __msa_and_v((v16u8)e0, (v16u8)fmask);
t0 = ((v4u32)e0) >> 1;
e2 = (v4i32) __msa_and_v((v16u8)a0, (v16u8)b0);
t0 = t0 + (v4u32)e2;
e1 = (v4i32) __msa_xor_v((v16u8)a1, (v16u8)b1);
e1 = (v4i32) __msa_and_v((v16u8)e1, (v16u8)fmask);
t1 = ((v4u32)e1) >> 1;
e2 = (v4i32) __msa_and_v((v16u8)a1, (v16u8)b1);
t1 = t1 + (v4u32)e2;
f0 = (v4i32) __msa_xor_v((v16u8)a2, (v16u8)b2);
f0 = (v4i32) __msa_and_v((v16u8)f0, (v16u8)fmask);
t2 = ((v4u32)f0) >> 1;
f2 = (v4i32) __msa_and_v((v16u8)a2, (v16u8)b2);
t2 = t2 + (v4u32)f2;
f1 = (v4i32) __msa_xor_v((v16u8)a3, (v16u8)b3);
f1 = (v4i32) __msa_and_v((v16u8)f1, (v16u8)fmask);
t3 = ((v4u32)f1) >> 1;
f2 = (v4i32) __msa_and_v((v16u8)a3, (v16u8)b3);
t3 = t3 + (v4u32)f2;
ST_W8(t0, t1, 0, 1, 2, 3, 0, 1, 2, 3, dst, stride);
ST_W8(t2, t3, 0, 1, 2, 3, 0, 1, 2, 3, dst + 4, stride);
} else {
int i;
for (i = 0; i < h; i++) {
uint32_t a, b;
a = AV_RN32(&src1[i * stride]);
b = AV_RN32(&src2[i * stride]);
AV_WN32A(&dst[i * stride], no_rnd_avg32(a, b));
a = AV_RN32(&src1[i * stride + 4]);
b = AV_RN32(&src2[i * stride + 4]);
AV_WN32A(&dst[i * stride + 4], no_rnd_avg32(a, b));
}
}
}
|
a lifeline to academics at risk
Cara helps academics who are unable to return to their own countries in the short term, due to the continuing risk, to rebuild their lives in the UK. Cara helps many to regain their former professional status in academia or in an allied profession, and to make a positive contribution while they are here.
A new graduate of Benghazi University takes a selfie in front of a ruined building at his university, 27 October 2016. REUTERS/Esam Omran Al-Fetori
Many academics who are unable to return to their own countries because of the high level of risk find it hard to accept the long-term loss of loss of home, career and community. Cara supports and guides them to reconnect with the world of academia by providing Fellowships and offering employment advice to enhance their employment prospects.
Cara’sEmployment, Training and Education (ETE) service offers UK-wide careers advice to Fellows, in partnership with Cara Network Universities. The service offers access to careers-related resources, work-shadowing, placement and mentoring opportunities.
Where Cara cannot offer expert advice or support, it refers individuals to specialist professional and community organisations.
When the security situation improves, some Cara Fellows return to their home countries to take up positions in higher education or an allied profession. They take with them the knowledge, skills and experience they have gained in the UK.
“Cara’s support restored my self-confidence which I was losing having stayed in the UK without a good job. Studying in the UK gave me the opportunity to access many resources and broaden my understanding.”
Alier, Head of Technical Affairs, South Sudan National Petroleum & Gas Commission
Alier's Story
Alier was first arrested in 1992, accused of supporting the Sudan People’s Liberation Army, a multi-ethnic resistance group based in the south. He was released, but then faced with conscription into the Sudanese state’s army. He fled to the UK. He was supported by Cara to do an MSc in Water Management. Following the 2005 Peace Agreement he returned home and worked for a UK charity as a Water and Sanitation Engineer. After South Sudan’s independence, he took over a senior position in the Directorate of Water Resources Management, before beginning a new role as the Head of Technical Affairs, South Sudan National Petroleum and Gas Commission in January 2015. |
Q:
UIWebView stimulator/app?
Currently making apps [html5/js] that run through various platforms that make use of UIWebView,
I usually test them in Safari, changing the webagent to iPad but theres always some inconsistencies. Is there anyway to run a stimulator on OSX? [perhaps something like this, http://www.edumobile.org/iphone/ipad-development/webview-application-in-ipad/ ]
is it possible to compile an APP, i.e a small browser or similar that i can test my 'apps' on?
A:
Download and install Xcode from the App Store.
Launch Xcode.
Open iOS Simulator:
Select the device of your choice:
Start Safari and test your website.
|
PORTAGE, MI — There were no injuries, but traffic on I-94 was snarled for hours after a crash Tuesday night west of U.S. 131 that sent chunks of concrete barrier wall into oncoming traffic.
According to a news release from Portage Public Safety, at shortly after 10 p.m. two semi tractors trailers collided in the westbound lanes, then jack-knifed and struck the barrier wall, which caused large pieces of concrete to fall into the eastbound lanes.
An eastbound semi tractor trailer struck the barrier wall and two passenger vehicles then struck concrete debris on the eastbound lanes.
Portage Department of Public Safety Police and Fire responded to the scene, as did troopers with the Michigan State Police.
Michigan Department of Transportation brought in heavy equipment to assist with debris clean-up.
Two semi tractor trailers suffered substantial damage and a third was moderately damaged. Two passenger vehicles also suffered moderate damage. |
Buy gifts for wife online and check out the wide collection of gifts for wife at Archiesonline how to show your wife or husband that you truly love them. Send them as amazing gifts anywhere in India to wife with your warm in the excitement of a new romance, it seems easy and natural to communicate your love for the other person. Turmeric May Not Be A Wonder Spice After All; The Age You Begin Menopause Could Be Influenced By Your Reproductive History; A Reminder That There s Fecal Matter On buy birthday gifts for your wife with fast delivery from prezzybox! warm their hearts and touch their soul with any of our wonderful birthday gifts. Valentine s Day Gifts for Him; Valentine s Day Gifts for Her; Valentine s Day Gifts for Teens; Valentine s Day Gifts for Kids; Unique Valentine s Day Gifts Find the best holiday gifts or the gift ideas for any occasion! Choose from a wide selection of unique and personalized gifts at CafePress today! Browse Now! Can you believe it? Valentine’s Day is almost upon us, and the perfect gift for your special someone is here at Gifts it s hard to be unique during the holiday of love and frankly, some people prefer the traditional box of chocolates and roses. com your girlfriend or wife deserves the. Our Valentine’s Day gift ideas include your pastor s wife is a special person. Find gift ideas for a birthday, wedding, baby shower, bridal shower, graduation, anniversary or any gift giving occasion it reasons then that pastor s wife gifts should be special as well. FindGift here are a few thoughts to help find the perfect gift for. com is a free service dedicated to 25 foolproof valentine s day gifts for the woman in your life from the perfect scarf to a bag she ll carry everywhere. Unique gift ideas - COD Available - Express Shipping - Easy Returns - Fashion Gifts, Gadgets & Games, Personalised Gifts, Romantic Gifts, send gifts to India your wife is so wonderful we imagine she is very hard to shop for! but don t worry we ve got the perfect gifts for your lovely lady. The one you’ve vowed to share your life with, the one who’s there for you through thick and thin, your wife, will have a birthday every year from pampering presents to. Competitive Prices Express Gift Service is committed to quality service at affordable price the good wife; genre: legal drama political drama: created by: robert king michelle king: starring the holy spirit ii spiritual gifts leon l. We offer to send gifts to Pakistan that are not only stylish and elegant combs, ph. ValentinesGift d. co the author started putting this together however, the notes go back at least 15 years receive special prices on online personalized cards and gifts, plus in-store cards, gifts and gift wrap. uk limited time only. ValentinesGift special offers from hallmark. co use these pastor’s wife poems to show your pastor’s wife the appreciation she deserves. uk offers a wide range of romantic and unusual gifts for that special someone in your life, all year round, so why wait until choose from these six pastor’s wife appreciation poems, or you can even. SEND GIFTS & FLOWERS TO PHILIPPINES, FREE DELIVERY chronicle books is an independent publisher offering bestselling books, children’s books, stationery, and gifts. Send gift to Philippines online shop our selection here! here are 20 diy sentimental gifts for your love that are all quick, easy, and budget friendly! top 101 best gifts for men: the heavy power list. Send gifts to your family and friends in Philippines find the perfect gift for any important man in your life these gifts for men are thoughtful, unusual, and creative. Lets make Birthday more find creative present ideas for her and great gift ideas for your wife. How to Show Your Wife or Husband That You Truly Love Them
Competitive Prices Express Gift Service is committed to quality service at affordable price the good wife; genre: legal drama political drama: created by: robert king michelle king: starring the holy spirit ii spiritual gifts leon l. |
Q:
how to get a card position in RecyclerView.Adapter?
Please help me with a problem. The problem is that I need to get the card position to convey this position to another Activity. I need to transfer this position when I pressed the button on the card. How to get the card position?
RVAdapter.java
public class RVAdapter extends RecyclerView.Adapter<RVAdapter.PersonViewHolder> {
private final static String myLog = "myLog";
List<ItemsOfRow> items;
private Context context;
RVAdapter(List<ItemsOfRow> items, Context context) {
this.items = items;
this.context = context;
}
@Override
public int getItemCount() {
return items.size();
}
@Override
public PersonViewHolder onCreateViewHolder(ViewGroup viewGroup, int i) {
View v = LayoutInflater.from(viewGroup.getContext()).inflate(R.layout.card_view, viewGroup, false);
PersonViewHolder pvh = new PersonViewHolder(v);
return pvh;
}
@Override
public void onBindViewHolder(PersonViewHolder personViewHolder, int i) {
personViewHolder.imgGroupImage.setImageBitmap(items.get(i).getTitleImage());
personViewHolder.txtTitleGroup.setText(items.get(i).getTitleName());
personViewHolder.txtContentGroup.setText(items.get(i).getTitleContent());
personViewHolder.btnShare.setOnClickListener(new View.OnClickListener() {
@Override
public void onClick(View view) {
Intent sendIntent = new Intent();
sendIntent.setAction(Intent.ACTION_SEND);
sendIntent.putExtra(Intent.EXTRA_TEXT, items.get(????).getTitleContent());
sendIntent.setType("text/plain");
context.startActivity(sendIntent);
}
});
personViewHolder.btnLearnMore.setOnClickListener(new View.OnClickListener() {
@Override
public void onClick(View view) {
Intent intent = new Intent(context, QuoteActivity.class);
intent.putExtra("title",items.get(?????).getTitleName());
intent.putExtra("positionGroup", ?????? + "");
view.getContext().startActivity(intent);
}
});
}
@Override
public void onAttachedToRecyclerView(RecyclerView recyclerView) {
super.onAttachedToRecyclerView(recyclerView);
}
public static class PersonViewHolder extends RecyclerView.ViewHolder{
CardView cv;
TextView txtTitleGroup;
TextView txtContentGroup;
ImageView imgGroupImage;
Button btnShare;
Button btnLearnMore;
PersonViewHolder(final View itemView) {
super(itemView);
cv = (CardView) itemView.findViewById(R.id.cv);
imgGroupImage = (ImageView) itemView.findViewById(R.id.img_group_image);
txtTitleGroup = (TextView) itemView.findViewById(R.id.txt_title_group);
txtContentGroup = (TextView) itemView.findViewById(R.id.txt_content_group);
btnShare = (Button) itemView.findViewById(R.id.btn_share_group);
btnLearnMore = (Button) itemView.findViewById(R.id.btn_learn_more);
}
}
}
A:
You can use method getAdapterPosition() of your viewHolder
|
NRA goes up against UN over Arms Trade Treaty
The United Nations agreed on Monday to hold discussions next year regarding an international arms treaty, but the National Rifle Association says they are all set to step in and make sure the measure isn’t approved.
The UN has put aside 10 days in March 2013 to negotiate terms of the Arms Trade Treaty, an international agreement that would forbid member states from exporting firearms to countries either under an arms embargo or in instances where exporting weapons would facilitate “the commission of genocide, crimes against humanity, war crimes” or other violations of humanitarian law. Only three days after the General Assembly agreed to hold discussions in the new year, though, the NRA announced that it intends on keeping any such measure from being enacted.
Speaking to journalists on Thursday, NRA President David Keene said, "We're as opposed to it today as we were when it first appeared.”
"We do not see anything in terms of the language and the preamble as being any kind of guarantee of the American people's rights under the Second Amendment,” Keene said.
The Obama White House insists that the proposed arms treaty would not impact the sale of arms within the United States in its current form, but would instead require other UN member states to sign on to restrictions on par with America’s own regulations regarding the export of guns. The NRA, however, is adamant with their claims that any changes to gun laws, federal or international, would pose a problem to the constitutional right to bear arms under the Second Amendment.
Considered by-and-large to be the most powerful gun lobby in America, the NRA could very well influence any attempts at changing firearm policy in the US and, in turn, the world.
“I have not seen anywhere else in the world a gun lobby that has the same level of influence on its own government as the NRA does in the United States,” author Andrew Feinstein explains to Democracy Now’s Amy Goodman. “The US buys and sells almost as much weaponry as the rest of the world combined. So what happens in the US is going to have enormous impact on the rest of the world.”
Should any efforts by the NRA hinder an approval of the Arms Trade Treaty, the UN is unlikely to reconvene in the near future to try and introduce international gun laws again. In fact, Dr. Natalie Goldring, a senior research fellow at the Center for Security Studies at the Edmund A. Walsh School of Foreign Service at Georgetown University, tells IPS that the March 2013 conference probably represents the last chance for the UN to reach an Arms Trade Treaty.
“If this conference fails, supporters of an ATT are likely to look outside the UN for the next stage of negotiations, as was the case with the Landmine Treaty,” claims Dr. Goldring.
The IPS adds that all six major arms-exporting countries – China, France, Germany, Russia, the UK and the United States – voted for the resolution. Even with such strong support, however, an instant approval of the ATT isn’t all that likely. The majority of US senators have already asked President Barack Obama to oppose the treaty, and a single veto from any of those nations would end negotiations.
If the treaty is shot down in March, UN delegations can ask for the 193-nation General Assembly to vote on the ATT at a later date, where a two-thirds majority would be required to enact the bill. Even then, though, the NRA is all but certain to ask the US to avoid signing on. |
Kinematic and kinetic differences during walking in patients with and without symptomatic femoroacetabular impingement.
Femoroacetabular impingement is a common hip pathology resulting in pain and impaired physical function. However, very little is known about gait differences between those with and without femoroacetabular impingement. Thus, the purpose of this study was to compare three-dimensional gait kinematics and kinetics between those with femoroacetabular impingement and a healthy, pain-free control group. Three-dimensional gait analysis was conducted on 30 individuals with symptomatic femoroacetabular impingement scheduled for surgery and 30 pain-free controls. Spatiotemporal and peak hip kinematics and joint moments were compared between the two groups. Ensemble averages were also calculated for kinematic and kinetic profiles across the gait cycle in all three planes of movement for visual inspection. Participants with femoroacetabular impingement walked slower and with significantly smaller cadences than those in the control group. Kinematically, the impingement group exhibited significantly less peak hip extension, adduction and internal rotation during stance, with effect sizes ranging from 0.48 (adduction) to 1.00 (internal rotation). Finally, those with FAI exhibited significantly less peak external hip flexion (effect size=0.52) and external rotation (effect size=0.85) moments than the control group. Individuals with femoroacetabular impingement exhibit differences in gait kinematics in all planes of motion compared to those with without FAI. These findings support the need for focused neuromuscular reconditioning across all movement directions in this patient group. |
One Wet Season
One Wet Season is a 1949 book by Ion Idriess about life in the Kimberley region of Western Australia during the wet season of 1934. The book records true stories of the lives of the pioneers and Aboriginals of the Kimberley, centring predominantly on those living in the King Leopold Ranges and spending the wet season in the town of Derby, Western Australia.
References
External links
Chapter one of serialisation of book
One Wet Season at AustLit
Serialised in Western Herald - 20 April, 27 April, 4 May, 11 May, 18 May, 25 May, 1 June, 8 June, 15 June, 22 June, 29 June, 6 July, 13 July, 20 July, 3 August, 10 August
Category:1949 non-fiction books
Category:Australian non-fiction books
Category:Kimberley (Western Australia)
Category:Books by Ion Idriess
Category:1934 in Australia |
Q:
how to annotate a parent-child relationship with Code-First
When using the CTP 5 of Entity Framework code-first library (as announced here) I'm trying to create a class that maps to a very simple hierarchy table.
Here's the SQL that builds the table:
CREATE TABLE [dbo].[People]
(
Id uniqueidentifier not null primary key rowguidcol,
Name nvarchar(50) not null,
Parent uniqueidentifier null
)
ALTER TABLE [dbo].[People]
ADD CONSTRAINT [ParentOfPerson]
FOREIGN KEY (Parent)
REFERENCES People (Id)
Here's the code that I would hope to have automatically mapped back to that table:
class Person
{
public Guid Id { get; set; }
public String Name { get; set; }
public virtual Person Parent { get; set; }
public virtual ICollection<Person> Children { get; set; }
}
class FamilyContext : DbContext
{
public DbSet<Person> People { get; set; }
}
I have the connectionstring setup in the app.config file as so:
<configuration>
<connectionStrings>
<add name="FamilyContext" connectionString="server=(local); database=CodeFirstTrial; trusted_connection=true" providerName="System.Data.SqlClient"/>
</connectionStrings>
</configuration>
And finally I'm trying to use the class to add a parent and a child entity like this:
static void Main(string[] args)
{
using (FamilyContext context = new FamilyContext())
{
var fred = new Person
{
Id = Guid.NewGuid(),
Name = "Fred"
};
var pebbles = new Person
{
Id = Guid.NewGuid(),
Name = "Pebbles",
Parent = fred
};
context.People.Add(fred);
var rowCount = context.SaveChanges();
Console.WriteLine("rows added: {0}", rowCount);
var population = from p in context.People select new { p.Name };
foreach (var person in population)
Console.WriteLine(person);
}
}
There is clearly something missing here. The exception that I get is:
Invalid column name 'PersonId'.
I understand the value of convention over configuration, and my team and I are thrilled at the prospect of ditching the edmx / designer nightmare --- but there doesn't seem to be a clear document on what the convention is. (We just lucked into the notion of plural table names, for singular class names)
Some guidance on how to make this very simple example fall into place would be appreciated.
UPDATE:
Changing the column name in the People table from Parent to PersonId allows the Add of fred to proceed. Howerver you'll notice that pebbles is a added to the Children collection of fred and so I would have expected pebbles to be added to the database as well when Fred was added, but such was not the case. This is very simple model, so I'm more than a bit discouraged that there should be this much guess work involved in getting a couple rows into a database.
A:
You need to drop down to fluent API to achieve your desired schema (Data annotations wouldn't do it). Precisely you have an Independent One-to-Many Self Reference Association that also has a custom name for the foreign key column (People.Parent). Here is how it supposed to get done with EF Code First:
protected override void OnModelCreating(DbModelBuilder modelBuilder)
{
modelBuilder.Entity<Person>()
.HasOptional(p => p.Parent)
.WithMany(p => p.Children)
.IsIndependent()
.Map(m => m.MapKey(p => p.Id, "ParentID"));
}
However, this throws an InvalidOperationException with this message Sequence contains more than one matching element. which sounds to be a CTP5 bug as per the link Steven mentioned in his answer.
You can use a workaround until this bug get fixed in the RTM and that is to accept the default name for the FK column which is PersonID. For this you need to change your schema a little bit:
CREATE TABLE [dbo].[People]
(
Id uniqueidentifier not null primary key rowguidcol,
Name nvarchar(50) not null,
PersonId uniqueidentifier null
)
ALTER TABLE [dbo].[People] ADD CONSTRAINT [ParentOfPerson]
FOREIGN KEY (PersonId) REFERENCES People (Id)
GO
ALTER TABLE [dbo].[People] CHECK CONSTRAINT [ParentOfPerson]
GO
And then using this fluent API will match your data model to the DB Schema:
protected override void OnModelCreating(ModelBuilder modelBuilder)
{
modelBuilder.Entity<Person>()
.HasOptional(p => p.Parent)
.WithMany(p => p.Children)
.IsIndependent();
}
Add a new Parent record containing a Child:
using (FamilyContext context = new FamilyContext())
{
var pebbles = new Person
{
Id = Guid.NewGuid(),
Name = "Pebbles",
};
var fred = new Person
{
Id = Guid.NewGuid(),
Name = "Fred",
Children = new List<Person>()
{
pebbles
}
};
context.People.Add(fred);
context.SaveChanges();
}
Add a new Child record containing a Parent:
using (FamilyContext context = new FamilyContext())
{
var fred = new Person
{
Id = Guid.NewGuid(),
Name = "Fred",
};
var pebbles = new Person
{
Id = Guid.NewGuid(),
Name = "Pebbles",
Parent = fred
};
context.People.Add(pebbles);
var rowCount = context.SaveChanges();
}
Both codes has the same effect and that is adding a new parent (Fred) with a child (Pebbles).
|
Q:
generate a heatmap from a dataframe with python and seaborn
I'm new to Python and fairly new to seaborn.
I have a pandas dataframe named df which looks like:
TIMESTAMP ACT_TIME_AERATEUR_1_F1 ACT_TIME_AERATEUR_1_F2 ACT_TIME_AERATEUR_1_F3 ACT_TIME_AERATEUR_1_F4 ACT_TIME_AERATEUR_1_F5 ACT_TIME_AERATEUR_1_F6
2015-08-01 23:00:00 80 0 0 0 10 0
2015-08-01 23:20:00 60 0 20 0 10 10
2015-08-01 23:40:00 80 10 0 0 10 10
2015-08-01 00:00:00 60 10 20 40 10 10
df.info()
<class 'pandas.core.frame.DataFrame'>
RangeIndex: 38840 entries, 0 to 38839
Data columns (total 7 columns):
TIMESTAMP 38840 non-null datetime64[ns]
ACT_TIME_AERATEUR_1_F1 38696 non-null float64
ACT_TIME_AERATEUR_1_F3 38697 non-null float64
ACT_TIME_AERATEUR_1_F5 38695 non-null float64
ACT_TIME_AERATEUR_1_F6 38695 non-null float64
ACT_TIME_AERATEUR_1_F7 38693 non-null float64
ACT_TIME_AERATEUR_1_F8 38696 non-null float64
dtypes: datetime64[ns](1), float64(6)
memory usage: 2.1 MB
I try to do a heatmap using this code :
data = sns.load_dataset("df")
# Draw a heatmap with the numeric values in each cell
sns.heatmap(data, annot=True, fmt="d", linewidths=.5)
But it does not work
Can you help me pelase to find the error?
Thanks
Edit
First ,
I load dataframe from csv file :
df1 = pd.read_csv('C:/Users/Demonstrator/Downloads/Listeequipement.csv',delimiter=';', parse_dates=[0], infer_datetime_format = True)
Then, I select only rows which date '2015-08-01 23:10:00' and '2015-08-02 00:00:00'
import seaborn as sns
df1['TIMESTAMP']= pd.to_datetime(df1_no_missing['TIMESTAMP'], '%d-%m-%y %H:%M:%S')
df1['date'] = df_no_missing['TIMESTAMP'].dt.date
df1['time'] = df_no_missing['TIMESTAMP'].dt.time
date_debut = pd.to_datetime('2015-08-01 23:10:00')
date_fin = pd.to_datetime('2015-08-02 00:00:00')
df1 = df1[(df1['TIMESTAMP'] >= date_debut) & (df1['TIMESTAMP'] < date_fin)]
Then, construct the heatmap :
sns.heatmap(df1.iloc[:,2:],annot=True, fmt="d", linewidths=.5)
I get this error :
TypeError Traceback (most recent call last)
<ipython-input-363-a054889ebec3> in <module>()
7 df1 = df1[(df1['TIMESTAMP'] >= date_debut) & (df1['TIMESTAMP'] < date_fin)]
8
----> 9 sns.heatmap(df1.iloc[:,2:],annot=True, fmt="d", linewidths=.5)
C:\\Users\\Demonstrator\\Anaconda3\\lib\\site-packages\\seaborn\\matrix.py in
heatmap(data, vmin, vmax, cmap, center, robust, annot, fmt, annot_kws,
linewidths, linecolor, cbar, cbar_kws, cbar_ax, square, ax,
xticklabels, yticklabels, mask, **kwargs)
483 plotter = _HeatMapper(data, vmin, vmax, cmap, center, robust, annot, fmt,
484 annot_kws, cbar, cbar_kws, xticklabels,
--> 485 yticklabels, mask)
486
487 # Add the pcolormesh kwargs here
C:\\Users\\Demonstrator\\Anaconda3\\lib\\site-packages\\seaborn\\matrix.py in
init(self, data, vmin, vmax, cmap, center, robust, annot, fmt, annot_kws, cbar, cbar_kws, xticklabels, yticklabels, mask)
165 # Determine good default values for the colormapping
166 self._determine_cmap_params(plot_data, vmin, vmax,
--> 167 cmap, center, robust)
168
169 # Sort out the annotations
C:\\Users\\Demonstrator\\Anaconda3\\lib\\site-packages\\seaborn\\matrix.py in
_determine_cmap_params(self, plot_data, vmin, vmax, cmap, center, robust)
202 cmap, center, robust):
203 """Use some heuristics to set good defaults for colorbar and range."""
--> 204 calc_data = plot_data.data[~np.isnan(plot_data.data)]
205 if vmin is None:
206 vmin = np.percentile(calc_data, 2) if robust else calc_data.min()
TypeError: ufunc 'isnan' not supported for the input types, and the inputs could not be safely coerced to any supported types
according to the casting rule ''safe''
A:
Remove the timestamp variables(i.e. first two columns) before passing it to sns.heatmap, no need for the load dataset as well, just use:
sns.heatmap(df.iloc[:,2:],annot=True, fmt="d", linewidths=.5)
EDIT
Ok here is your dataframe, just changed the column names in the interest of time
df
Out[9]:
v1 v2 v3 v4 v5 v6 v7 v8
0 2015-08-01 23:00:00 80 0 0 0 10 0
1 2015-08-01 23:20:00 60 0 20 0 10 10
2 2015-08-01 23:40:00 80 10 0 0 10 10
3 2015-08-01 00:00:00 60 10 20 40 10 10
Now seaborn cannot recognize timestamp variables for the heatmap right, so we will remove the first two columns and pass the dataframe to seaborn
import seaborn as sns
sns.heatmap(df.iloc[:,2:],annot=True, fmt="d", linewidths=.5)
So we get the result as
If you don't get the result by using this, please edit your question to include rest of your code. This is not the problem then.
|
var qstack_8c =
[
[ "qstack", "qstack_8c.html#ad59200fd9723a575e042365b916e150b", null ],
[ "qstack_setsize", "qstack_8c.html#a243157bbd832b1a29da906cdf1e067d1", null ],
[ "qstack_push", "qstack_8c.html#af6bd78d22c5ac2a5dbcc4102416a1682", null ],
[ "qstack_pushstr", "qstack_8c.html#a3c626c12f0f8ad9b1899c4d6e9fa78a6", null ],
[ "qstack_pushint", "qstack_8c.html#a227a2c394e088afee835b79aa1e81a90", null ],
[ "qstack_pop", "qstack_8c.html#a79ecf0838fc92a6fde5e43fcac757426", null ],
[ "qstack_popstr", "qstack_8c.html#a5a4924e9e1201c9049d0baa68d4c1da7", null ],
[ "qstack_popint", "qstack_8c.html#a355b4b772da518e3e63702e61df44886", null ],
[ "qstack_popat", "qstack_8c.html#a20cfe4a51fa37348293d199b22530b04", null ],
[ "qstack_get", "qstack_8c.html#aae38a11a6be7fbea79f3ca51c65a4aee", null ],
[ "qstack_getstr", "qstack_8c.html#a6e2940f626e655f803cb78c452780c1a", null ],
[ "qstack_getint", "qstack_8c.html#af37f84c47e9cd48b3f070fa96777029e", null ],
[ "qstack_getat", "qstack_8c.html#a513b235ab408d98c6324fbef841e3e1a", null ],
[ "qstack_size", "qstack_8c.html#a3eac4be39a2ae68c7290735b034fc66c", null ],
[ "qstack_clear", "qstack_8c.html#a1ca1db3402919fe147e32a16ee56a051", null ],
[ "qstack_debug", "qstack_8c.html#af40fcb35c362981495c37aa7963ff50d", null ],
[ "qstack_free", "qstack_8c.html#a2a091ec90ef14302cb29ea07c1ce84b2", null ]
]; |
Rock Solid Amusement Registration
Thank you for reaching out to the Lattner Entertainment Group. Your message is important to us. Our properties are currently closed as a precautionary measure to prevent the spread of COVID-19. We will get back to you as soon as we can. For answers to frequently asked questions, please visit Casino and Hotel Closures FAQ. |
/**
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You 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.
*/
package org.apache.activemq.plugin;
import org.apache.activemq.broker.Broker;
import org.apache.activemq.broker.BrokerPlugin;
import org.slf4j.Logger;
import org.slf4j.LoggerFactory;
/**
* A Plugin which allows to force every incoming message to be PERSISTENT or
* NON-PERSISTENT.
*
* Useful, if you have set the broker usage policy to process ONLY persistent or
* ONLY non-persistent messages.
*
* @org.apache.xbean.XBean element="forcePersistencyModeBrokerPlugin"
*/
public class ForcePersistencyModeBrokerPlugin implements BrokerPlugin {
private static Logger LOG = LoggerFactory.getLogger(ForcePersistencyModeBrokerPlugin.class);
private boolean persistenceFlag = false;
/**
* Constructor
*/
public ForcePersistencyModeBrokerPlugin() {}
/**
* @param broker
*
* @return the Broker
*
* @throws Exception
*
* @see org.apache.activemq.broker.BrokerPlugin#installPlugin(org.apache.activemq.broker.Broker)
*/
@Override
public Broker installPlugin(Broker broker) throws Exception {
ForcePersistencyModeBroker pB = new ForcePersistencyModeBroker(broker);
pB.setPersistenceFlag(isPersistenceForced());
LOG.info("Installing ForcePersistencyModeBroker plugin: persistency enforced={}", pB.isPersistent());
return pB;
}
/**
* Sets the persistence mode.
*
* @param persistenceFlag
*/
public void setPersistenceFlag(final boolean persistenceFlag) {
this.persistenceFlag = persistenceFlag;
}
/**
* @return the mode the (activated) plugin will set the message delivery
* mode
*/
public final boolean isPersistenceForced() {
return persistenceFlag;
}
}
|
This disclosure relates generally to refrigeration systems having a compressor powered by a fuel-fired engine. More particularly, this disclosure relates to calibration of an engine throttle position sensor during operation of a fuel fired engine of a transport refrigeration system.
Fruits, vegetables and other perishable items, including meat, poultry and fish, fresh or frozen, are commonly transported in the cargo box of a truck, a trailer, or in an intermodal container. Accordingly, it is customarily to provide a transport refrigeration system in operative association with the cargo box for cooling the atmosphere within the cargo box. The transport refrigeration system includes a refrigerant vapor compression system, also referred to as a transport refrigeration unit, and an on-board power unit. The refrigerant vapor compression system typically includes a compressor, a condenser, an expansion device and an evaporator serially connected by refrigerant lines in a closed refrigerant circuit in accord with known refrigerant vapor compression cycles. The power unit includes a fuel-fired engine, typically diesel fueled.
In many truck/trailer transport refrigeration systems, the compressor of the transport refrigeration unit is driven by the engine shaft either through a belt drive or by mechanical shaft-to-shaft link. More recently, all electric transport refrigeration systems have been developed for truck/trailer applications wherein the engine drives an on-board generator for generating sufficient electrical power to drive an electric motor operatively associated with the compressor of the transport refrigeration unit. For example, U.S. Pat. No. 6,223,546, assigned to Carrier Corporation, the same assignee to which this application is subject to assignment, the entire disclosure of which is incorporated herein by reference in its entirety, discloses an electrically powered transport refrigeration unit powered by an engine driven synchronous generator capable of producing sufficient power to operate the compressor drive motor and at least one fan motor. With respect to intermodal containers, clip-on power units, commonly referred to as generator sets or gensets, are available for mounting to the intermodal container, typically when the container is being transported by road or rail, to provide electrical power for operating the compressor drive motor of the transport refrigeration unit associated with the container. The genset includes a diesel engine and a generator driven by the diesel engine.
In conventional transport refrigeration systems, the control system is open loop in that the refrigeration system controller is unaware of the actual operating engine load. The fuel-fired engine is controlled by an electronic engine controller independently of the transport refrigeration unit which is controlled by a dedicated refrigeration unit controller. The electronic engine controller controls fuel flow to the engine so as to maintain the engine speed at a target RPM irrespective of the load imposed on the engine by the refrigeration unit. The refrigeration unit controller is unaware of the actual load being imposed on the engine and controls the refrigerant unit to meet cooling demand irrespective of the actual load on the engine. |
### 消息：北京承诺采购更多农产品 推动美国取消关税
------------------------
#### [首页](https://github.com/gfw-breaker/banned-news/blob/master/README.md) | [手把手翻墙教程](https://github.com/gfw-breaker/guides/wiki) | [禁闻聚合安卓版](https://github.com/gfw-breaker/bn-android) | [网门安卓版](https://github.com/oGate2/oGate) | [神州正道安卓版](https://github.com/SzzdOgate/update)
<div class="zhidingtu">
<div class="ar-wrap-3x2">
<img alt="图为川普与习近平6月在大阪G20会议上会面（AP）" class="ar-wrap-inside-fill" src="http://img.soundofhope.org/2019/11/4ae139f4-fbf0-11e9-acf9-cafedce87d15-image-hires-231205-600x400.jpg"/>
</div>
<div class="caption">
图为川普与习近平6月在大阪G20会议上会面（AP）
</div>
</div>
<hr/>
#### [翻墙必看视频（文昭、江峰、法轮功、八九六四、香港反送中...）](https://github.com/gfw-breaker/banned-news/blob/master/pages/links.md)
<div class="content">
<p>
<span class="content-info-date">
【希望之声2019年11月4日】
</span>
<span class="content-info-type">
（本台记者凌杉综合编译）
</span>
三名了解内部讨论的人士表示，北京当局目前以加速购买农产品为代价，敦促川普（特朗普）政府取消原定于12月中旬生效的关税，并促进中美贸易协议第一阶段的签署。
</p>
<div class="widget ad-300x250 ad-ecf">
<!-- ZW30 Post Embed 300x250 1 -->
<ins class="adsbygoogle" data-ad-client="ca-pub-1519518652909441" data-ad-slot="9768754376" style="display:inline-block;width:300px;height:250px">
</ins>
</div>
<p>
美媒《Politico》的消息人士说，北京正在试图采取一切办法让美国取消对中贸易关税，力度堪比篮球赛上的“全场盯人”。作为交换条件，北京同意在两年内购买价值高达500亿美元的美国农产品，并履行承诺开放其金融服务业并加强知识产权保护。在此之前，北京当局仅同意在首年购买200亿美金价值的农产品。
</p>
<p>
消息来源称，目前的假设是，中美两国达成第一阶段协议将消除原定12月15日，对约1600亿美元的中国商品开征的15％关税，本批关税包括笔记本电脑和智能手机在内的一系列主要消费品。
</p>
<p>
对于撤销12月关税的消息，美方当局目前尚未做出公开回应。美国商务部长罗斯近期表示，他预计12月的关税可能会因中美达成第一部分协议而取消。
</p>
<p>
知情者透露，北京方面还敦促美国取消9月1日对价值约1,120亿美元的中国商品征收的15％关税，但美方并未做出任何相关决定。此外，中方还非常希望取消对价值2500亿美元的中国商品加征25％的关税，或至少削减一半，尽管目前这预计无法写入交易（指美国不会同意）。
</p>
<p>
川普政府目前公开同意暂停10月15日将2500亿美金关税提高到30％的计划。
</p>
<p>
关于如何确保中方履行贸易协议，知情者说，美方官员目前正在考虑的主要执行机制是如果中方违规，可以重新开征所有关税。
</p>
<p>
对于执行协议，白宫贸易顾问彼得·纳瓦罗在近期的采访中也提到，美方可以在北京不遵守协议的情况下增加关税，这些内容应该写入协议的执行机制。
</p>
<p>
中美两国目前仍然处于停火期，并在朝着签署第一阶段贸易协议努力。中美双方此前的预期是在11月中旬的智利APEC峰会上签署协议，不过，智利不久前因为大规模的民主抗议而取消了该会议，白宫方面表示，美方将很快公布新的地点。
</p>
<div>
</div>
<p>
美国总统川普上周日（11月3日）说，中美签署协议的地点选址有进展，“首先，我想达成这笔协议。我的意思是，选一个地点对为来说将非常容易。但首先，我们将看看是否能达成交易。如果我们达成交易，那么开会的地点将非常容易。这将是在美国的某个地方”。
</p>
<p>
白宫一位高级官员称，目前中美两国仍在就强制技术转让和知识产权保护的问题谈判，在其他方面，两国协议基本完成。相关的协议预计将涵盖货币、金融等一些领域的内容，同时涵盖北京采购农产品的协议。
</p>
<p>
川普表示，初步协议将涵盖两国之间60％的问题。谈判的第二阶段将解决更多的结构性问题，例如国企补贴等问题，这些不会涵盖在第一部分协议中。
</p>
<div class="content-info-btm">
<p class="content-info-zerenbianji">
<span class="content-info-title">
责任编辑：
</span>
<span class="content-info-content">
宋月
</span>
</p>
</div>
</div>
<hr/>
手机上长按并复制下列链接或二维码分享本文章：<br/>
https://github.com/gfw-breaker/banned-news/blob/master/pages/soh_rdzz/n3310716.md <br/>
<a href='https://github.com/gfw-breaker/banned-news/blob/master/pages/soh_rdzz/n3310716.md'><img src='https://github.com/gfw-breaker/banned-news/blob/master/pages/soh_rdzz/n3310716.md.png'/></a> <br/>
原文地址（需翻墙访问）：http://www.soundofhope.org/gb/2019/11/04/n3310716.html
------------------------
#### [首页](https://github.com/gfw-breaker/banned-news/blob/master/README.md) | [一键翻墙软件](https://github.com/gfw-breaker/nogfw/blob/master/README.md) | [《九评共产党》](https://github.com/gfw-breaker/9ping.md/blob/master/README.md#九评之一评共产党是什么) | [《解体党文化》](https://github.com/gfw-breaker/jtdwh.md/blob/master/README.md) | [《共产主义的终极目的》](https://github.com/gfw-breaker/gczydzjmd.md/blob/master/README.md)
<img src='http://gfw-breaker.win/banned-news/pages/soh_rdzz/n3310716.md' width='0px' height='0px'/> |
// Copyright 2017 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#ifndef FILE_UTILS_H_
#define FILE_UTILS_H_
#include <dirent.h>
#include <sys/types.h>
#include <unistd.h>
#include <functional>
#include <map>
#include <memory>
#include "logging.h"
namespace file_utils {
// RAII classes for auto-releasing fd/dirs.
template <typename RESOURCE_TYPE, int (*CLOSE_FN)(RESOURCE_TYPE)>
struct ScopedResource {
explicit ScopedResource(RESOURCE_TYPE r) : r_(r) { CHECK(r); }
~ScopedResource() { CLOSE_FN(r_); }
RESOURCE_TYPE r_;
};
using ScopedFD = ScopedResource<int, close>;
using ScopedDir = ScopedResource<DIR*, closedir>;
// Invokes predicate(pid) for each folder in |proc_path|/[0-9]+ which has
// a numeric name (typically pids and tids).
void ForEachPidInProcPath(const char* proc_path,
std::function<void(int)> predicate);
// Reads the contents of |path| fully into |buf| up to |length| chars.
// |buf| is guaranteed to be null terminated.
ssize_t ReadFile(const char* path, char* buf, size_t length);
// Reads a single-line file, stripping out any \\0, \\r, \\n and replacing
// non-printable charcters with '?'. |buf| is guaranteed to be null terminated.
bool ReadFileTrimmed(const char* path, char* buf, size_t length);
// Convenience wrappers for /proc/|pid|/|proc_file| paths.
ssize_t ReadProcFile(int pid, const char* proc_file, char* buf, size_t length);
bool ReadProcFileTrimmed(int pid,
const char* proc_file,
char* buf,
size_t length);
// Takes a C string buffer and chunks it into lines without creating any
// copies. It modifies the original buffer, by replacing \\n with \\0.
class LineReader {
public:
LineReader(char* buf, size_t size);
~LineReader();
const char* NextLine();
private:
char* ptr_;
char* end_;
};
} // namespace file_utils
#endif // FILE_UTILS_H_
|
BAE Systems contributes to Joint Strike Missile program
26 Feb 20152015-02-26T01:00:00+01:00
Avalon Airshow, Australia: Today’s announcement of an agreement between Australia and Norway for the Joint Strike Missile (JSM) has been welcomed by BAE Systems as a positive step for international collaboration.
“This agreement enables BAE Systems Australia and Kongsberg to continue their industrial cooperation on the passive radio frequency (RF) sensor supporting its transition to qualification and manufacture.
“We look forward to working with both governments by assisting with the JSM F-35 system integration effort, and supporting any future needs the Australian Government might have.”
BAE Systems Australia will deliver a pre-production passive RF sensor in April 2015 for the JSM program. This will involve fit checks, system integration and flight testing for a development-standard missile in order to demonstrate it provides enhanced operational capability. |
Q:
What's the difference between using jQuery's onclick and the onclick attribute?
What's the difference between the following two pieces of HTML (apologies if there are any typos as I'm typing this freehand)?
Using jQuery:
<script type="text/javascript">
$(document).ready(function() {
$("#clickme").click(function() {
alert("clicked!");
});
});
</script>
<a id="clickme" href="javascript:void(0);">click me</a>
Not using jQuery:
<a id="clickme" href="javascript:void(0);" onclick="alert('clicked!');">click me</a>
A:
One big difference is that jQuery's events are handled in a registry which is parsed on the click event. Crucially, this means that you are permitted to assign multiple callbacks, and have them triggered in the order in which they were registered:
<script type="text/javascript">
$(document).ready(function() {
$("#clickme").click(function() {
alert("clicked!");
});
$("#clickme").click(function() {
alert("I concur, clicked!");
});
});
</script>
They will both be invoked on the click event, in that order. The "real" onClick event is overridden by jQuery's registry-driven system. In the vanilla document structure, without a system like jQuery in place, there can only be one onClick event.
A:
It is also a cleaner separation of UI code (the HTML) and the logic code (the JavaScript). It makes reading each a bit easier.
A:
One of the differences is that adding handlers with jQuery's click doesn't remove previous handlers.
|
Q:
How to display a file that is stored on disk using laravel
I am new to laravel and while reading Dayle Rees's book on retrieving data I came across this succinct code for files and storing the file on disk.
Route::post('handle-form', function()
{
$name = Input::file('book')->getClientOriginalName();
Input::file('book')->move('/storage/directory', $name);
return 'File was moved.';
});
My question is how do you display the file that has been stored to the user.
A:
Treat the file as a usual file that you would like people to access with a url.
So suppose that your website's public path is at /var/www/myproject/public, you will want to move the input file into that folder. For example:
Input::file('book')->move('/var/www/myproject/public/uploads', $name);
Then you can display your file with a typical HTML <a> tag:
return 'File was moved. <a href="/uploads/'. $name .'">Access your file</a>.';
|
Search 29 vacation rentals
Explore
Find the perfect place from the worlds best selection of vacation rentals on VRBO.
Book
Safer and more secure when you pay and book online through VRBO.
Enjoy
Enjoy more space and more privacy of an entire vacation home.
Where to stay around Jijoca de Jericoacoara, BR?
Our 2018 property listings offer a large selection of 29 vacation rentals near Jijoca de Jericoacoara. From 7 Hotels to 5 Houses, find a unique house rental for you to enjoy a memorable stay with your family and friends. The best places to stay near Jijoca de Jericoacoara for a holiday or a weekend are on VRBO.
What are the popular point of interests near where I can stay when traveling to Jijoca de Jericoacoara?
VRBO offers a large selection of vacation rentals near lovely places in Jijoca de Jericoacoara. From VRBO travelers, the top most popular points of interest to stay for a holiday trip or just for a weekend are:
Frade Stone: 29 vacation rentals
Jericoacoara Lighthouse: 29 vacation rentals
Mangue Seco Beach: 29 vacation rentals
Furada Stone: 29 vacation rentals
Malhada Beach: 29 vacation rentals
But there are many other points of interest around Jijoca de Jericoacoara listed on VRBO where you can find your place to stay. Please use our search bar to access the selection of vacation rentals available near the point of interest of your choice.
Can I rent Hotels in Jijoca de Jericoacoara?
Yes, of course. VRBO has 7 Hotels in Jijoca de Jericoacoara. Our other popular types of vacation rentals in Jijoca de Jericoacoara include:
Houses: 5 rentals available
Villas: 5 rentals available
Studios: 2 rentals available
But you can also enjoy a great stay in one of our other vacation rentals including Condos/Apartments and more.
Can I find a vacation rental with pool in Jijoca de Jericoacoara?
Yes, you can select your prefered vacation rental with pool among our 16 vacation rentals with pool available in Jijoca de Jericoacoara. Please use our search bar to access the selection of vacation rentals available. |
Gene Polymorphisms in FAS (Rs3740286 and Rs4064) Are Involved in Endometriosis Development in Brazilian Women, but not those in CASP8 (rs13416436 and rs2037815).
The present study aims to investigate the association between caspase-8 (CASP8) (rs13416436 and rs2037815) and Fas cell surface death receptor (FAS) (rs3740286 and rs4064) polymorphisms with endometriosis in Brazilian women. In the present case-control study, 45 women with a diagnosis of endometriosis and 78 normal healthy women as a control group were included. The genotyping was determined by real-time polymerase chain reaction (PCR) with Taqman hydrolysis probes (Thermo Fisher Scientific, Darmstadt, Germany). Genotypic and allelic frequencies were analyzed using Chi-squared (χ2) test. In order to determine the inheritance models and haplotypes ,SNPStats (Institut Català d'Oncologia, Barcelona, Spain) was used. Levels of 5% (p = 0.05) were considered statistically significant. No significant difference was observed in genotypic or allelic frequencies between control and endometriosis groups for rs13416436 and rs2037815 (CASP8 gene). On the other hand, a significant difference between rs3740286 and rs4064 (FAS gene) was found. Regarding polymorphisms in the FAS gene, a statistically significant difference was found in co-dominant and dominant models. Only the haplotype containing the rs3740286A and rs4064G alleles in the FAS gene were statistically significant. The polymorphisms in the CASP8 gene were not associated with endometriosis. The results indicate an association between FAS gene polymorphisms and the risk of developing endometriosis. |
We noticed that you're using an unsupported browser. The TripAdvisor website may not display properly.We support the following browsers:Windows: Internet Explorer, Mozilla Firefox, Google Chrome. Mac: Safari.
It is set in a nice, wide, car free part of the old center so it does stand out.
However looking at it closely it doesn't impress... no special sculptures on it just the color of the column itself is the only special feature... apart...More
A beautiful historic column with the Virgin Mary atop and with several saints, including St. Ann, at its base. It is in the middle of Maria-Theresien Strasse and is always featured in the iconic Innsbruck street scene with the snow-capped mountain in the background. |
---
author:
- Einan Gardi
- Matteo Cacciari
title: 'Perturbative and non-perturbative aspects of heavy–quark fragmentation[^1]'
---
‘=11 versim\\#1\\#2 ‘=12
Introduction {#intro}
============
The heavy–quark fragmentation function $D(z,m^2,\\mu^2)$ is the probability distribution to produce a heavy meson of a heavy quark. It depends on $z$, the momentum fraction of the meson, on the quark mass $m^2$ and on the factorization scale $\\mu^2$. The fragmentation function has a formal definition [@CS] as the Fourier transform $$D(z;\\mu^2)\\equiv
\\frac{1}{2\\pi\\,z} \\int_{-\\infty}^{\\infty} \\frac{dy_{-}}{y_{-}}\\,
\\exp(i{p}y/z)\\, F(p y;\\mu^2),
\\label{D_def}$$ of the hadronic matrix element of a non-local operator on the light-cone ($y^2=0$): $$\\begin{aligned}
\\label{F_def}
&&F(p y;\\mu^2) \\equiv \\\\ \\nonumber
&&\\frac{1}{4\\, N_c}\\,\\sum_{X}\\,
{\\rm Tr}\\left\\{ \\langle 0 \\vert {\\mbox{$y$\\hspace{-0.5em}\\raisebox{0.1ex}{$/$}}}\\Psi(y)\\vert H(p)+X\\rangle
\\langle H(p)+X\\vert \\overline{\\Psi}(0)\\vert0\\rangle_{\\mu^2}
\\right\\}.\\end{aligned}$$ Here the final state is composed of the measured heavy meson ($H$) carrying momentum $p$ plus anything else ($X$).
We concentrate here on inclusive observables, the prime example being the single B–meson inclusive cross section in $e^+e^-$ annihilation, shown in Fig. \\[nlo\\].
Cross sections of this sort can be written as a convolution $$\\frac{d\\sigma(x,Q^2)}{dx} = \\int_x^1\\frac{dz}{z}\\,{C}(x/z,Q^2;{\\mu^2})\\,{D}(z;{\\mu^2})\\,
\\label{conv}$$ between a process–specific coefficient function $C$, describing the hard interaction where the heavy quark is produced, and the process–independent fragmentation function $D$, defined in (\\[D\\_def\\]), describing the hadronization stage.
The common practice is to bridge the gap between experimental data and fixed–order calculations in QCD by means of a fragmentation model, i.e. a given functional form for ${D}(z;{\\mu^2})$ in (\\[conv\\]) with one or more free parameters. For heavy–quark fragmentation the most famous examples are [@kart; @peterson]. Upon excluding the more difficult $z\\longrightarrow 1$ region such fits can indeed be performed. However, the gain is limited: the relation between the parameters in these models and the matrix elements cannot be made precise. The models provides no information about the underlying hadronization dynamics. Moreover, the universality of the extracted parameters is unclear. At large $z$ fragmentation models simply fail to bridge the gap between the resummed perturbative calculation and the data. This has been recently demonstrated in a clear way [@Ben_haim] by directly extracting the “non perturbative fragmentation component” from $e^+e^-$ data in moment space and then comparing the resulting distribution in $z$ space to models.
An important application of the heavy–quark fragmentation function which demonstrates these problems is in the description of B production in hadron colliders. The CDF collaboration found [@CDF] an alarming discrepancy (a factor of 3) between the transverse–momentum distribution of B$^+$ hadroproduction data and the standard treatment of this cross section, where a NLO calculation is convoluted with a Peterson model [@peterson] for the fragmentation function. In the latter the free parameter was set to a standard value based on $e^+e^-$ annihilation data. Ref. [@CN] applied a resummed perturbative calculation for the coefficient function and combined it with the relevant fragmentation effect extracted from $e^+e^-$ data in moment space, concluding that the discrepancy is much smaller. This shows that the separation between the perturbative and non-perturbative ingredients of (\\[conv\\]) is very delicate. A naïve application of (\\[conv\\]) simply fails: if the perturbative ingredient $C$ in (\\[conv\\]) is taken at fixed order in $\\alpha_s$, the required “non-perturbative” ingredient $D$ appears not to be the same in different processes.
As heavy–quark production in hadron colliders becomes increasingly important experimentally, it is evermore urgent to correctly apply perturbative QCD to such cross sections, to separate in a systematic way between the perturbative and the non-perturbative ingredients, and finally, to understand hadronization in a quantitative way. In particular, the parametrization of the fragmentation function $D$ must eventually be understood in terms of its field theoretic definition (\\[D\\_def\\]).
Our approach to heavy–quark fragmentation is primarily a perturbative one: we start off with a perturbative calculation of the matrix element in (\\[F\\_def\\]), replacing the outgoing meson by an on on-shell heavy quark, and treat non-perturbative effects, which make for the difference between the quark and the meson, as [*corrections*]{}. Hadronization corrections are power-suppressed: they are inversely proportional to the mass of the heavy quark $m$. The perturbative approach is appropriate so long as $m \\gg \\Lambda$. Thus it is definitely applicable to bottom, and probably, with some care, also to charm.
It should be kept in mind that a perturbative calculation is at all possible owing to two properties: (1) the presence of the quark mass regulating collinear divergences; and (2) the inclusive nature of the observable, which guarantees the cancellation of infrared singularities between real and virtual diagrams at any order in perturbation theory. This cancellation does leave, however, a significant trace in the expansion: Sudakov logarithms of $1-z$. This is why the ${\\cal O}(\\alpha_s)$ result shown in Fig. \\[nlo\\] diverges at $z\\longrightarrow 1$, whereas the physical cross section vanishes at this limit. It is only upon summing the $z\\longrightarrow 1$ singular terms in the perturbative series to all orders (exponentiation) that the vanishing of the cross section is recovered.
Asymptotic Scaling {#asym}
==================
Let us first see what can be deduced on the fragmentation function from general considerations. If the quark mass $m$ is infinitely large, hadronization effects are negligible, and the fragmentation function is just $\\delta(1-z)$. Taking a large but finite ratio $m/\\Lambda$, one would expect the function to be somewhat smeared towards smaller $z$. This smearing is proportional to $m/\\Lambda$, as expressed by the following scaling law (see e.g. [@Buras:qm]): $D(z)=(m/\\Lambda) f((1-z)m/\\Lambda)$.
This property can be formulated more precisely upon taking moments, $$\\tilde{D}(N,m^2) \\equiv\\int_0^1 dz\\; z^{N-1} D(z,m^2),
\\label{mom}$$ and it can be explicitly derived [@CG] from the field–theoretic definition (\\[D\\_def\\]). One can consider two limits, one where the mass becomes large and the other where the moment index $N$ gets large. For large $m$ one can match the matrix element (\\[F\\_def\\]) onto the heavy–quark effective theory, getting [@JR]: $$\\frac{F(p y, m^2)}{p y}\\,\\,\\exp\\left(i{p}y\\right)
\\longrightarrow \\,{{\\cal F}(p y \\,\\bar{\\Lambda}/m)}+{\\cal O}(\\bar{\\Lambda}/m),
\\label{large-m}$$ namely, at the leading order in the large–$m$ expansion the dependence on $m$ and on the light–cone separation $y_{-}$ (i.e. on $py$) is coupled: the matrix element becomes a function of a single argument $p y \\,\\bar{\\Lambda}/m$. Here $\\bar{\\Lambda}$ is the difference between the heavy–meson mass $M$ and the heavy–quark mass $m$. For large $N$ it follows from the definition (\\[F\\_def\\]) and from (\\[mom\\]) that $$\\tilde{D}(N,m^2) \\longrightarrow \\left.{\\frac{F(p y,m^2)}{p
y} \\exp\\left(i{p}y\\right)}\\right\\vert_{py=-iN}\\!\\!\\!\\!\\!\\!\\!+\\,{\\cal
O}\\left(\\frac1N\\right),
\\label{large-N}$$ namely that to leading order in $1/N$ the $N$-th moment of the fragmentation function can be obtained by analytically continuing the matrix element as a function of the light–cone separation to the complex plane and evaluating it at $py=-iN$. From (\\[large-m\\]) and (\\[large-N\\]) together it follows that upon taking the simultaneous limit $m \\longrightarrow \\infty$ and $N \\longrightarrow \\infty$ with a fixed ratio $m/N$, $$\\tilde{D}(N,m^2)\\simeq
\\left. \\,{\\cal F}(p y \\,\\bar{\\Lambda}/m) \\,
\\right\\vert_{py=-iN}+{\\cal O}\\left(\\frac1N\\right),
\\label{large-m-and-N}$$ so the fragmentation function becomes a function of a single argument $N\\bar{\\Lambda}/m$.
In Sec. \\[dge\\] we shall see how the dependence on $m$ and $N$ through the combination $N\\bar{\\Lambda}/m$ follows from the large–order behaviour of the perturbative expansion in the large–$\\beta_0$ limit. Having established Eq. (\\[large-m-and-N\\]) non-perturbatively, we know that this is indeed the leading behaviour at large $N$ and that corrections to this behaviour are suppressed by a power of $1/N$.
We see that the scale which characterizes the fragmentation process in the large $z$ region is $m(1-z)$ or, in moment space, $m/N$. This scale has a clear meaning when considering the bremsstrahlung off a heavy quark. Let us examine the emission in a frame where the quark energy $E$ is much larger than its mass. The radiation pattern (to ${\\cal O}(\\alpha_s)$) is $$\\frac{dD}{dz\\,d\\sin^2\\theta}\\simeq\\frac{C_F\\,
\\alpha_s}{\\pi}\\,\\frac{1}{1-z}\\,\\frac{\\sin^2\\theta}{(\\sin^2\\theta+m^2/E^2)^2},
\\label{rad_pattern}$$ where only the leading term in the limit $z\\longrightarrow 1$ was kept and the angle of emission $\\theta$ is related to the gluon transverse momentum by $\\sin^2\\theta={k_{\\perp}^2}/\\left({E^2z^2(1-z)^2}\\right)$. As discussed in [@Dokshitzer:fd], the radiation vanishes in the exact forward direction, but it peaks close to the forward direction at $\\theta\\,\\simeq\\, m/E$ (the ‘dead cone’), or in a boost-invariant formulation at $\\vert k_{\\perp}\\vert \\simeq m(1-z)$. So $m(1-z)$ is the typical transverse momentum of radiated gluons. The scaling law (\\[large-m-and-N\\]) can be understood in physical terms as the observation that the hadronization effects ($\\tilde{D}(N,m^2)$ at large $N$ and $m$) are dominated by interaction with gluons of transverse momentum $\\bar{\\Lambda}=M-m$.
Factorization {#fact}
=============
Factorization is based on the fact that dynamical processes taking place on well–separated physical scales are quantum-mechanically incoherent. This allows one to treat different subprocess independently of one another and to resum large corrections.
Eq. (\\[conv\\]) is often regarded as the separation between perturbative and non-perturbative contributions to the cross section. However, factorization can be a much stronger tool upon considering separately the dynamics taking place on different physical scales. Consider, for example, the case of bottom production in $e^+e^{-}$ annihilation, shown in Fig.\\[nlo\\]. Referring to (\\[conv\\]) one can naïvely interpret the gap between the data and some perturbative calculation as the “non-perturbative fragmentation function” and then try to bridge this gap using a model. As stressed above this interpretation leads to much confusion. Instead, the reasons for having large (perturbative and non-perturbative) corrections need to be identified and the corrections be resummed.
The first step is to separate the scales involved. Upon neglecting higher order corrections which are suppressed by powers of $m^2/q^2$ the moments of the cross section can be written as [@MN; @CC] $$\\begin{aligned}
\\tilde{\\sigma}(N,q^2,m^2) =
{\\tilde{C}(N,q^2;\\mu_F^2)}
{\\tilde{E}(N,\\mu_F^2,\\mu_{0F}^2)}
\\tilde{D}(N,m^2;\\mu_{0F}^2).
\\nonumber
$$ Choosing $\\mu_F^2\\sim q^2$ and $\\mu_{0F}^2\\sim m^2$, the coefficient function $\\tilde{C}$ and the fragmentation function $\\tilde{D}$ depend only on scales of order $q^2$ and $m^2$, respectively. The evolution factor $\\tilde{E}$ can be obtained solving the Dokshitzer–Gribov–Lipatov–Altarelli–Parisi (DGLAP) equation. This factor then resums corrections depending on $\\alpha_s\\ln m^2/q^2$ to all orders. Resummation of this kind was implemented in computing the full line in Fig. \\[nlo\\]. Clearly, this is insufficient.
Next, one observes that the subprocesses $\\tilde{C}$ and $\\tilde{D}$ may contain additional large corrections. One generic source of large corrections (see [@Beneke]) are running coupling (renormalon) effects, which induce factorial growth of the coefficient at high orders owing to the increasing sensitivity to extreme ultraviolet or infrared scales. Infrared renormalons in particular are non-summable and introduce a power–suppressed ambiguity in the perturbative definition of any quantity. Since for observable quantities this ambiguity must cancel it can serve as a probe of non–perturbative contributions.
Another source of large corrections develops at large $N$: the Sudakov logs [@Dokshitzer:1995ev; @CC]. As stressed above the fragmentation process is dominated at large $N$ by momenta of order $m/N$. When $m$ and $m/N$ become far apart the concept of factorization applies again, and can be used to resum logs of $N$ into a Sudakov form factor. This resummation takes the form of exponentiation in moment space. A similar situation occurs in the coefficient function $\\tilde{C}$, as is demonstrated in Fig. \\[large\\_N-fact\\].
$\\tilde{C}$ is dominated at large $N$ by the invariant mass $q^2/N$ of the unresolved jet which recoils against the measured heavy meson. The fact that this jet was also initiated by a heavy quark plays no role at this level [@CG]: the relevant scale here is the total invariant mass of the jet. The same jet function dominates deep inelastic structure functions at large $N$ [@DIS; @Gardi:2002xm].
It should be emphasized that factorization (contrary to its diagrammatic proofs) is a non-perturbative concept. One should therefore expect that non-perturbative corrections on a certain scale would factorise together with the corresponding perturbative sum. In particular, this must apply to renormalon–related power corrections. In the case of Sudakov logs factorization leads to exponentiation. Going beyond the logarithmic level, one finds that power corrections on the corresponding scale exponentiate as well. This is the conceptual basis for the “shape function” approach to hadronization corrections, which has been developed in the context of event–shape distributions [@KS; @Korchemsky:2000kp; @Gardi:2001ny] (see also [@DW]). This is also the basis of the approach of [@DIS; @Gardi:2002xm] to higher twist in deep inelastic structure functions at large $N$ and of our approach [@CG] to heavy–quark fragmentation.
Dressed Gluon Exponentiation {#dge}
============================
In order to deal with heavy–quark fragmentation at large $N$ both Sudakov logs and renormalons need to be taken into account. At large $N$, the perturbative coefficients are dominated by Sudakov logs. However, the resummation of the leading logarithms alone does not provide any information on power corrections. It is the subleading logs generated by the running of the coupling which produce the renormalon ambiguity [@Gardi:2001ny; @DGE; @CG]. Their resummation is therefore essential to probe the non-perturbative regime.
From these considerations it follows that the Sudakov exponent needs to be computed to all orders rather than to some fixed logarithmic accuracy. Clearly, the full calculation cannot be done. However, relevant all–order information can be obtained from the large–$\\beta_0$ limit corresponding to a single dressed gluon. Calculating the Sudakov exponent in this way is referred to as “Dressed Gluon Exponentiation” (DGE) [@Gardi:2001ny; @DGE; @CG].
A process–independent calculation of the fragmentation function (\\[D\\_def\\]) in the large–$\\beta_0$ limit was performed in [@CG]. In the light-cone axial gauge $A\\cdot y=0$ where the path–ordered exponential is 1, there is just one diagram – see Fig. \\[frag\\_ren\\].
This diagram was computed using an off-shell gluon splitting function, which was derived identifying the limit where the massive quark propagator prior to the emission of the gluon is singular[^2].
The result for the logarithmic derivative of the fragmentation function, written as a scheme invariant Borel transform, is: $$\\begin{aligned}
\\label{dD_dm}
\\nonumber
&&\\frac{d \\tilde{D}(N,m^2)}{d\\ln m^2}\\!=\\! -\\frac{ C_F}{\\beta_0}\\int_0^{\\infty}\\!\\!\\!du
{\\left(\\frac{\\Lambda^2}{m^2}\\right)}^{u}\\!{\\rm e}^{\\frac53 u}\\int_{0}^1 dz \\left(z^{N-1}-1\\right)
\\\\
&& \\left(\\frac{z}{(1-z)^2}\\right)^u \\left[\\frac{z}{1-z}\\,(1-u)+\\frac12(1-z)\\,(1+u)\\right],\\end{aligned}$$ where $\\Lambda$ is in the ${\\overline {\\rm MS}}$ scheme. A generalization of this result beyond the large $\\beta_0$ limit which fully captures the next–to–leading logarithms (NLL) was constructed in [@CG].
Eq. (\\[dD\\_dm\\]) takes into account the cancellation between real ($z^{N-1}$) and virtual (1) corrections. In the square brackets we distinguish between $z=1$ singular and regular terms. The former lead to logarithmically enhanced contributions in the perturbative expansion, and therefore need to be exponentiated.
According to (\\[dD\\_dm\\]) the natural scale for the renormalization of the coupling at fixed $z$ is $(1-z)^2m^2/z$. Thus, integrating over the Borel variable $u$ first is not possible for $(1-z)m\\lsim \\Lambda$. As expected, perturbation theory breaks down when the gluon virtuality or its transverse momentum become comparable to the QCD scale. This constraint takes a completely different form when considered in moment space: infrared renormalons show up.
We proceed to compute the Sudakov exponent in the large–$\\beta_0$ limit by isolating the $z=1$ singular terms, performing the $z$-integration and then integrating over $m^2$. The result is: $$\\begin{aligned}
\\label{D_N_MSbar}
&&\\ln \\tilde{D}(N,m^2;\\mu_{F0}^2)
=\\frac{ C_F}{\\beta_0}\\int_0^{\\infty}\\!\\frac{du}{u}
\\left({\\frac{{\\Lambda^2}}{m^2}}\\right)^{u} \\times \\\\ \\nonumber
&&\\qquad \\qquad
\\bigg[ \\left(\\frac{m^2}{\\mu_{F0}^2}\\right)^{u} B_{\\cal A}(u) \\ln N
-{B_{\\tilde{D}}^{\\DGE}(u,N)} \\bigg],\\end{aligned}$$ where $$\\label{BD}
{ B_{\\tilde{D}}^{\\DGE}(u,N)}=-\\,{\\rm e}^{\\frac53 u}\\,
{ (1-u)}\\,\\Gamma({-2u})\\,\\left({N}^{2u}-1\\right).$$ The $m^2$ integration requires to introduce an ultraviolet subtraction: a $\\mu_{F0}^2$–dependent counter term which cancels the $u=0$ singularity of the fragmentation function. This term is the well-known cusp anomalous dimension [@KR; @KM], given by $B_{\\cal A}(u)\\ln N$, where $B_{\\cal A}(u)=1+\\frac53u+\\ldots$ (we use the $\\overline {\\rm MS}$ factorization scheme). Note that contrary to $B_{\\tilde{D}}^{\\DGE}(u,N)$ this subtraction term has just a single $\\ln N$ to any order in $u$ and it is also free of infrared renormalon singularities.
According to Eq. (\\[BD\\]), renormalons in the Sudakov exponent (\\[D\\_N\\_MSbar\\]) appear at all integer and half integer $u$ values with the exception of $u=1$. It is clear from Eq. (\\[dD\\_dm\\]) that these renormalons are exclusively related to the $z\\longrightarrow 1$ limit. To define the perturbative sum corresponding to $\\ln \\tilde{D}(N,m^2)$ one needs to integrate over $u$ with some prescription that avoids the poles. The natural choice is the principal–value (PV) prescription (it was implemented numerically in [@CG]). The ambiguity in choosing a prescription is compensated by power corrections corresponding to the residues. Introducing a free parameter for each singularity one ends up with an additive correction to the perturbative Sudakov exponent having the form: $$\\ln \\tilde{D}_{\\NP}({ N\\Lambda/m})=
-\\epsilon_1{\\frac{N\\Lambda}{m}}-\\epsilon_3
\\left(\\frac{N\\Lambda}{m}\\right)^3-\\epsilon_4
\\left(\\frac{N\\Lambda}{m}\\right)^4+\\cdots.
\\label{NP}$$ Finally, exponentiating the result to compute $\\tilde{D}(N,m^2)$ the perturbative and non-perturbative contributions appear as two factors: $$\\tilde{D}(N,m^2;\\mu_{F0}^2)={\\tilde{D}_{\\PT}(N,m^2;\\mu_{F0}^2)}\\,
\\tilde{D}_{\\NP}(N\\Lambda/m).$$ The leading power correction of the form $N\\Lambda/{m}$ predicted in [@Webber_Nason] is readily obtained from (\\[NP\\]) upon expanding the exponent.
It should be stressed that in both the perturbative (\\[D\\_N\\_MSbar\\]) and the non-perturbative (\\[NP\\]) contributions to the fragmentation function we considered here only the leading terms at large $N$. At the perturbative level the result is improved [@CG] by matching it with the full NLO coefficient. At the non-perturbative level, there may be additional ${\\cal O}(\\Lambda/m)$ terms which we do not parametrize, and consequently the description of the first few moments is of limited accuracy. In practice, to deal with low moments, it is useful to modify the parametrization (\\[NP\\]) replacing $N\\longrightarrow N-1$ such that the $N=1$ moment is exactly $1$, as it must be by definition.
The perturbative PV–regulated DGE result of Eq. (\\[D\\_N\\_MSbar\\]), matched to the NLL and the NLO expressions and combined with the proper coefficient function, is compared as a function of $N$ with the ALEPH data in Fig. \\[DGE\\_N\\] (full line). In contrast with the NLL result of Ref. [@CC] (dashed line), the DGE one does not have a Landau singularity [@CG] and thus it extrapolates smoothly towards the values of $N\\gsim m/\\Lambda$ which are beyond perturbative reach.
Also shown in Fig. \\[DGE\\_N\\] is the ambiguity (band shown by two dot-dashed lines) corresponding to the residue of the first renormalon pole located at $u=1/2$. The lower edge of the band just matches the data, indicating that the power correction of the form and magnitude(!) expected based on the renormalon analysis is supported by the data.
The different perturbative results are converted to $x$ space in Fig. \\[DGE\\_x\\]. Here the significant impact of Sudakov resummation to NLL as well as that of the additional renormalon resummation achieved by DGE on the shape of the distribution is evident. Note that the shape of the DGE curve resembles that of the data but it is centered at larger $x$. Indeed, the leading effect of the non-perturbative function (assuming in (\\[NP\\]) that only $\\epsilon_1\\neq 0$) is a shift of the entire perturbative distribution, very much the same as the leading corrections in event–shape distributions [@KS; @DW; @Gardi:2001ny]. Finally, regarding the non-perturbative parameters $\\epsilon_n$ as free parameters in a fit, the data can be well described. The result of a fit in moment space where the only non-perturbative correction is $\\epsilon_1$ is shown in Fig. \\[fit\\].
Upon using more non-perturbative parameters the details of the prediction (\\[NP\\]) can be confronted with data. The analysis in [@CG] shows that subleading non-perturbative corrections at the exponent are rather small, and the absence of a correction of the form $N^2\\Lambda^2/m^2$ can be consistent with the data.
Conclusions {#concl}
===========
We described here a new approach to the QCD description of heavy–quark fragmentation concentrating on the $z\\longrightarrow 1$ limit. It was first rigorously demonstrated that the non-perturbative dynamics is dominated by the scale $m(1-z)$. This scale corresponds in perturbation theory to the transverse momentum of gluons radiated from the heavy quark. Based on a renormalon analysis we extended the perturbative technique for resumming soft gluon radiation to the non-perturbative regime, identified power–like effects and separated them from the perturbative fragmentation function by means of a PV prescription. The non-perturbative contribution was then parametrized based on the renormalon ambiguity. We found that the simplest possible parametrization of power corrections which follows from renormalons, namely a shift of the perturbative distribution, is sufficient to describe the data on B production in $e^+e^-$ annihilation. This way phenomenological models for the non-perturbative fragmentation function are not needed.
The fragmentation function was treated, based on its definition (\\[D\\_def\\]), in a process independent way. The results are thus applicable independently of the production process, given that the corresponding coefficient function in the ${\\overline{\\rm MS}}$ scheme is known. Universality of the leading power corrections at large $z$ can now be tested experimentally.
M. Cacciari and E. Gardi, “Heavy-quark fragmentation,” [*Nucl. Phys.*]{} [**B664**]{} (2003) 299 \\[hep-ph/0301047\\]. J. C. Collins and D. E. Soper, [*Nucl. Phys.*]{} [**B194**]{} (1982) 445.
V.G. Kartvelishvili, A.K. Likehoded and V.A. Petrov, [*Phys. Lett.*]{} [**B78**]{} (1978) 615.
C. Peterson, D. Schlatter, I. Schmitt and P.M. Zerwas, [*Phys. Rev.*]{} [**D27**]{} (1983) 105.
E. Ben-Haim, P. Bambade, P. Roudeau, A. Savoy-Navarro and A. Stocchi, “Extraction of the $x$-dependence of the non-perturbative QCD b-quark fragmentation distribution component,” \\[hep-ph/0302157\\]. D. Acosta [*et al.*]{} \\[CDF Collaboration\\], [*Phys. Rev.*]{} [**D65**]{} (2002) 052005 \\[hep-ph/0111359\\]. M. Cacciari and P. Nason, [*Phys. Rev. Lett.*]{} [**89**]{} (2002) 122003 \\[hep-ph/0204025\\]. P. Nason, in [*Heavy Flavors*]{}, eds. A.J. Buras and M. Lindner, (World Scientific, Singapore, 1992) Advanced series on directions in high energy physics, vol. 10.
R. L. Jaffe and L. Randall, [*Nucl. Phys.*]{} [**B412**]{} (1994) 79 \\[hep-ph/9306201\\]. Y. L. Dokshitzer, V. A. Khoze and S. I. Troian, [*J. Phys.*]{} [**G17**]{} (1991) 1602. B. Mele and P. Nason, [*Phys. Lett.*]{} [**B245**]{} (1990) 635. M. Cacciari and S. Catani, [*Nucl. Phys.*]{} [**B617**]{} (2001) 253 \\[hep-ph/0107138\\]. M. Beneke, [*Phys. Rept.*]{} [**317**]{} (1999) 1 \\[hep-ph/9807443\\]; M. Beneke and V. M. Braun, “Renormalons and power corrections,”, in the Boris Ioffe Festschrift, [*At the Frontier of Particle Physics / Handbook of QCD*]{}, ed. M. Shifman (World Scientific, Singapore, 2001), vol. 3, p. 1719 \\[hep-ph/0010208\\]. Y. L. Dokshitzer, V. A. Khoze and S. I. Troian, [*Phys. Rev.*]{} [**D53**]{} (1996) 89 \\[hep-ph/9506425\\]. E. Gardi, G. P. Korchemsky, D. A. Ross and S. Tafat, [*Nucl. Phys.*]{} [**B636**]{} (2002) 385 \\[hep-ph/0203161\\]. E. Gardi and R. G. Roberts, [*Nucl. Phys.*]{} [**B653**]{} (2003) 227 \\[hep-ph/0210429\\]. G. P. Korchemsky and G. Sterman, [*Nucl. Phys.*]{} [**B437**]{} (1995) 415 \\[hep-ph/9411211\\]; in [*Moriond 1995*]{}: Hadronic: 0383-392, \\[hep-ph/9505391\\]; [*Nucl. Phys.*]{} [**B555**]{} (1999) 335 \\[hep-ph/9902341\\]. G. P. Korchemsky and S. Tafat, [*JHEP*]{} [**0010**]{} (2000) 010 \\[hep-ph/0007005\\]. E. Gardi and J. Rathsman, [*Nucl. Phys.*]{} [**B609**]{} (2001) 123 \\[hep-ph/0103217\\]; [*Nucl. Phys.*]{} [**B638**]{} (2002) 243 \\[hep-ph/0201019\\]. Y. L. Dokshitzer and B. R. Webber, [*Phys. Lett.*]{} [**B404**]{} (1997) 321 \\[hep-ph/9704298\\]. E. Gardi, [*Nucl. Phys.*]{} [**B622**]{} (2002) 365 \\[hep-ph/0108222\\]. S. Catani, S. Dittmaier and Z. Trocsanyi, [*Phys. Lett.*]{} [**B500**]{} (2001) 149 \\[hep-ph/0011222\\]. G. P. Korchemsky and A. V. Radyushkin, [*Phys. Lett.*]{} [**B279**]{} (1992) 359 \\[hep-ph/9203222\\]. G. P. Korchemsky and G. Marchesini, [*Nucl. Phys.*]{} [**B406**]{} (1993) 225 \\[hep-ph/9210281\\]. P. Nason and B. R. Webber, [*Phys. Lett.*]{} [**B395**]{} (1997) 355 \\[hep-ph/9612353\\].
[^1]: Invited talk (E.G.) at the HEP2003 Europhysics Conference in Aachen, Germany. These proceedings are based on [@CG].
[^2]: In this limit the gluon virtuality $k^2$, its transverse momentum $k_{\\perp}^2$ and the quark mass $m^2$ are taken to be small simultaneously keeping the ratios between them fixed. This is a generalization of the quasi–collinear limit discussed in [@Catani:2000ef; @CC].
|
NVM is now widely used for a variety of applications, since it may store information without continuously applied electric power, and by applying appropriate voltages, the NVM may be programmed or re-programmed (erased). Such a memory may provide a basic operating system or microcode for a logic device, such as a processor. A kind of NVM, embedded NVM in a CMOS device, allows a single chip produced by a manufacturer to be configured for various applications, and/or allows a single device to be configured by a user for different applications. Programming of the embedded NVM is typically done by downloading code from an external source, such as a computer.
However, many NVM processes require multiple layers of poly-silicon, while many conventional CMOS processes require only a single layer of poly-silicon. In order to embed this kind of NVM into a CMOS device, several additional processing steps are required. These additional processing steps result in increased processing time, higher cost of manufacturing, increased possibility of defects, and in turn result in lower yields. To address this problem, repair circuit regions on a die are included in some circuit designs in order to compensate for the reduced device yield. But valuable areas on the die are consumed by these repair circuits, further increasing the cost of manufacturing.
For example, a conventional 2-transistor EEPROM typically requires a high voltage (>15 Volts) in the bit line or word line diffusion to perform the erase and program operations. In addition, the conventional EEPROM cell structure creates manufacturing difficulties. As a result, the manufacturing cost of the conventional EEPROM is higher, the cell size is bigger, and the array density is limited to low density devices. Additionally, the complex topology of the conventional EEPROM cell also results in difficulties in alignment and scalability.
In another kind of EEPROM, stacked gate flash EEPROM, each cell typically includes a MOS transistor structure having a source, a drain, and a channel in a substrate or P-well, as well as a stacked gate structure overlying the channel. The stacked gate may further include a thin gate dielectric layer (sometimes referred to as a tunnel oxide) formed on the surface of the P-well. The stacked gate also includes a polysilicon floating gate overlying the tunnel oxide and an interpoly dielectric layer overlying the floating gate. Unfortunately, the thin tunnel (or floating gate) oxide may easily impact the wafer yield, and creates problems concerning reliability in manufacturing process.
Yet another kind of flash memory, split gate flash, is desirable to achieve efficient programming through carrier injection at a lower programming voltage (about 12V). The injection efficiency is achieved at desirably low programming currents by applying a relatively large potential to a first gate and a relatively small potential to a second gate. However, the design of typical split-gate device has an adverse impact on the cell density (the amount of information that may be stored in a defined area), as the first and second gates both consumes precious wafer area.
Other NVM cell structures are proposed. U.S. Pat. No. 5,892,709 discloses a single level gate nonvolatile memory device, which is simple and inexpensive to fabricate. Further more, the single level gate NVM is efficient and reliable to be accessed. However, the applied voltages for program and erase operations are definitely too high.
U.S. Pat. No. 6,631,087 discloses a single polysilicon EEPROM memory device that operates at relatively low erase and program voltages and currents. Furthermore, single polysilicon EEPROM does not suffer from various disturbances during the program, read and erase operations. For programming the memory cell, a bias voltage of 5V is applied, while a bias voltage of approximately −5V is applied for erasing operation. However, the bias voltage range of +5V to −5V is still too large, and as known to those skilled in the art, the applied negative voltage will bring negative impact on its application in many aspects.
To overcome these problems listed above, there is a need for a NVM which is compatible with the CMOS process, uses lower voltages for operating, and is more reliable in program, read, or erase operation. |
<?xml version="1.0" encoding="UTF-8"?>
<!-- Metadata Standard tab, gmd:MD_Metadata/gmd:metadataStandardName and
gmd:MD_Metadata/gmd:metadataStandardVersion (Service) -->
<h:div xmlns:g="http://www.esri.com/geoportal/gxe"
xmlns:h="http://www.esri.com/geoportal/gxe/html"
h:tag="div" g:label="$i18n.catalog.iso19139.MD_Metadata.section.metadata.standard">
<g:element g:targetName="gmd:metadataStandardName" g:minOccurs="1" g:maxOccurs="1"
g:label="$i18n.catalog.iso19139.MD_Metadata.metadataStandardName"
g:preferOpen="true" g:extends="$base/schema/gco/basicTypes/CharacterString_PropertyType.xml">
<g:body>
<g:element g:value="INSPIRE Metadata Implementing Rules">
<!--<g:body><g:input g:extends="$base/core/ui/InputText.xml" h:readonly="readonly"/></g:body>-->
</g:element>
</g:body>
</g:element>
<g:element g:targetName="gmd:metadataStandardVersion" g:minOccurs="1" g:maxOccurs="1"
g:label="$i18n.catalog.iso19139.MD_Metadata.metadataStandardVersion"
g:preferOpen="true" g:extends="$base/schema/gco/basicTypes/CharacterString_PropertyType.xml">
<g:body>
<g:element g:value="Technical Guidelines based on EN ISO 19115 and EN ISO 19119 (Version 1.2)">
<!--<g:body><g:input g:extends="$base/core/ui/InputText.xml" h:readonly="readonly"/></g:body>-->
</g:element>
</g:body>
</g:element>
</h:div>
|
"We want to have a strong case, and we want to be sure that we will win in court, so we made all the efforts, all the analysis that [was] necessary," said Dorais.
'We want to be sure that we will win in court,' said Montreal executive committee chairman Benoit Dorais, explaining why it's taken the city so long to file its lawsuit over the cancelled water meter contract. (CBC Montreal)
He said the administration is leaving the door open to other lawsuits regarding the awarding of public contracts. The law firm IMK is handling the suit, along with city lawyers.
Largest contract in Montreal history
Tremblay cancelled the contract, the largest in the city's history, after a scathing report by Montreal's auditor general, Jacques Bergeron.
The contract was awarded to Génieau, a consortium made up of Simard-Beaudry and Dessau. Bergeron concluded the tendering process had been flawed from top to bottom: "too fast, too big [and] too expensive."
The water meter contract featured heavily in the Charbonneau Commission, a provincial inquiry that examined the process of awarding public contracts to construction and engineering firms from 2001 to 2009. The commission's final report is repeatedly cited in the city's lawsuit.
Commissioner France Charbonneau heard about a system of collusion in which a group of construction firms would decide in advance which firm's turn it was to receive a public contract. The firms would then submit bids in concert to ensure the intended company submitted the lowest bid.
The water contract lawsuit alleges that SNC-Lavalin was dropped from consideration because it was not part of the "cartel" of construction firms involved in bid-rigging — leaving Génieau and Catania-SM as the remaining bidders.
It also alleges dozens of points of contact between Zampino, the city's executive committee chairman at the time, and representatives of the two consortiums during the tender process — contacts that were forbidden, according to the city's procurement regulations.
Also cited in the lawsuit is Réjean Lévesque, the city's director of water management at that time, who detailed his concerns about the tendering process in a memo he sent to his superiors. |
Plasma pyridoxal and pyridoxal 5'-phosphate concentrations in response to ingestion of water or glucose polymer during a 2-h run.
The effects of ingesting a glucose polymer solution (GP) or water (W) on plasma pyridoxal 5'-phosphate (PLP) and pyridoxal (PL) concentrations were compared in six men (age: 30 +/- 2 y; VO2max: 57.4 +/- 3.2 mL.kg-1.min-1) under running (R) and control (C) conditions. Subjects ran for 2 h at 60-65% of VO2max for R and remained standing for C. For both R and C, 200 mL W or GP was ingested before (0-time) and every 30 min while running (30, 60, and 90 min). Plasma PLP decreased to 95% and 87% of 0-time at 180 min for WC and GPC and increased to 126% and 119% at 90 min and to 124% and 119% at 120 min for WR and GPR. By 60 min postrun, plasma PLP was 98% (WR) and 101% (GPR) of 0-time. There were no significant differences between W and GP conditions. Changes in PLP were not related to plasma volume or blood glucose, free fatty acids, lactate, alkaline phosphatase, aspartate aminotransferase, or alanine aminotransferase. No significant changes in plasma PL were noted. Exercise induces an increase in plasma PLP, perhaps due to transfer of B-6 vitamers from liver to skeletal muscle. |