text
stringlengths 9
4.92M
|
|---|
Bipartisan action likely into leaks of US ‘kill list’
The Obama administration is facing a potentially hazardous inquiry into leaks of secret national security information after Democrats and Republicans in Congress came together in a rare show of bipartisanship.
Members of the House and Senate intelligence committees vowed to get to the bottom of the leaks about a presidential “kill list" for drone attacks, cyber warfare and the Yemeni underwear bomber, and let the “chips fall" where they may.
They said at a press conference the leaks had endangered officials on risky assignments, jeopardised co-operation with allies and sources and compromised national security.
The leaks about the drone kill list formed the basis of a New York Times series about the processes by which the US President authorises assassination attempts against suspected high-level terrorists.
The stories sparked a debate about the propriety and legality of the assassinations because innocent lives are risked and the decision-making process lacks normal checks and balances.
Senior Republicans such as senator
John McCain
have accused
Barack Obama
’s administration of putting national security at risk for political purposes by leaking the information to enhance the President’s image as a tough national security leader. White House spokesman Jay Carney dismissed this, saying: “Any suggestion that the White House has leaked sensitive information for political purposes has no basis in fact and has been denied by the authors themselves."
House intelligence committee chair Mike Rogers, a Republican, said an outside investigator was needed because the CIA had said it could not respond to the committee’s requests for information about the leaks and the Department of Justice’s national security division had excused itself from part of the investigation.
Mr Rogers said this suggested leaks could have come from within the Department or the FBI, from sources in a position to influence the investigations. He described the CIA’s refusal “very troubling".
Related Quotes
Company Profile
Senate intelligence committee chairman
Dianne Feinstein
, a Democrat, said: “When people say they don’t want to work with the United States because they can’t trust us to keep a secret, that’s serious."
But she said committee members were still deciding the best way to proceed to quick results. “A special prosecutor can take years," she said. “We don’t have years. We need to legislate. We need to get some solutions before us very quickly."
Asked if she was worried about embarrassing the administration in an election year, she said: “Wherever the chips fall, they fall." |
Caltrans is improving the I-5 in Glendale and Burbank between State Route 134 and Buena Vista Street. There will be a Community Open House for the I-5 Widening Project on Wednesday, September 26, 2018, from 6 p.m. to 8 p.m. at the Burbank Community Services Building (150 N. Third St., Burbank). Caltrans will provide a project update and talk one-on-one with attendees.
The I-5 Widening Project in Glendale and Burbank will enhance safety, improve traffic flow, reduce congestion, encourage ridesharing, decrease surface street traffic and improve air quality. Learn more about the project at My5LA.com.
Additionally, Caltrans crews will be working on the I-5 and SR-134 causing a closure of lanes. All northbound I-5 lanes will be closed at the L.A. River on the night of September 28-29 (Friday Night-Saturday morning). All northbound I-5 lanes and all westbound SR-134 lanes will be closed at the L.A. River on the night of September 29-30 (Saturday night- Sunday morning). Connectors will also be closed.
Current Construction Activities:
Work will occur during daytime hours unless otherwise noted.
SR-134 to Magnolia Boulevard
Sonora Avenue, Alameda Avenue, Western Avenue, Providencia Avenue, and LA River Bridges: Crews continue working in the I-5 median to widen the bridges.
Providencia Avenue: Crews are installing fence barriers and removing overhang brackets on the pedestrian bridge.
I-5 Median: Crews are installing drainage at night and during the day. Crews are placing concrete pavement at night.
Magnolia Boulevard to Buena Vista Street
Northbound I-5 near Old San Fernando Boulevard Tunnel: Crews are constructing the concrete bridge barrier and approach slabs.
Northbound I-5 between Burbank Boulevard and Cohasset Street: Crews are paving.
Empire Avenue: Crews are paving the new Empire Avenue between Victory Place and Maria Street.
Old Front Street/Burbank Boulevard/I-5 Southbound Future On Ramp: Crews are removing utilities
Southbound I-5 Empire Avenue On- and Off-Ramps: Crews are grading and placing aggregate base and paving lean concrete base
Closures and Detours:
SR-134 to Magnolia Boulevard
Alameda Avenue, Sonora Avenue and Western Avenue Lane Closures:
Intermittent daytime and nighttime street and lane closures on Alameda Avenue, Sonora Avenue and Western Avenue through 2018. Detours are posted.
Northbound and Southbound I-5 Lane Closures:
Intermittent northbound and southbound lane closures between 10 p.m. and 6 a.m., at times reducing I-5 to one or two lanes in either direction.
Northbound I-5 and Westbound SR-134 Full Freeway Closures:
On the night of Sept. 28-29 (Friday night to Saturday morning), all northbound I-5 lanes will be closed at the L.A. River from 1 a.m. to 6 a.m. The westbound SR-134 connector to northbound I-5 also will be closed. Detours will be posted.
On the night of Sept. 29-30 (Saturday night to Sunday morning), all northbound I-5 lanes and all westbound SR-134 lanes will be closed at the L.A. River from 1 a.m. to 6 a.m. The westbound SR-134 connector to northbound I-5 will be closed, and the northbound I-5 connector to westbound SR-134 will be closed. Detours will be posted.
If a third night is necessary, the Sept. 29-30 closures will be repeated on the night of Sept. 30-Oct. 1, except the full freeway closures will be from 12:01 a.m. to 5 a.m.
Magnolia Boulevard to Buena Vista Street
Northbound and Southbound I-5 Lane Closures:
Intermittent nighttime northbound and southbound lane closures reducing I-5 to one or two lanes in either direction from 9 p.m. to 6 a.m.
Front Street Long-Term Closure:
Front Street between Magnolia Boulevard and Burbank Boulevard is a northbound-only one-way street. For access to the Metrolink Station from northbound I-5 use the Olive Avenue exit to 1st Street and cross under the freeway on Verdugo Avenue. From southbound I-5, use the Verdugo Avenue off-ramp exit.
Buena Vista Street Closures:
Intermittent daytime and nighttime closures of Buena Vista Street, in both directions, between San Fernando Boulevard and Winona Avenue.
On- and Off-Ramp Closures:
Intermittent on- and off-ramp closures at Buena Vista Street, San Fernando Boulevard and Burbank Boulevard from 9 p.m. to 6 a.m. Detours will be provided.
Empire Avenue Closure:
Empire Avenue between Wilson Avenue and Victory Place will remain closed through 2018.
#I5 #Caltrans #CommunityOpenHouse #Glendale #Burbank #I5WideningProject #My5LA #MyGlendale |
EBA’s LCR approach to ABS is coming under fire
Following the October 23rd public hearing held by the EBA on the liquidity cover ratios (LCRs), the authority’s approach to ABS seems to be coming under a growing amount of public criticism. This can be seen, for example, in this article published by Euroweek here. |
Matt writes in to warn us all not to fly on June 29th and 30th if we can help it, because the 29th is when flight plans for all domestic flights have to switch over to the international standard. Matt adds that it’s just his personal opinion, so we’re not sure how worried we should really be (remember the fake-out of the Y2K bug?). But then again, we’re talking about airlines, so at the very least you should pack some extra energy bars if you’re traveling on the day of the switchover. |
This dude just said the Battlestar Galactica finale was "great storytelling." WTF!? And then his friend started lecturing you about why your phone sucks. Are you starting to hyperventilate? You've got nerd rage! But just how wrathful are you?
Answer the following questions as honestly as possible. Then add up your score and find out just how angry you really are.
For each "yes" give yourself one point.
1. Have you ever experienced a spike in your blood pressure when overhearing other people (especially strangers) getting their facts wrong when they talk about a science fiction story, game, or software?
Dwight Faces Nerd Torture Of The Highest Form Click to view Our beloved Dwight Schrute, lover of bears, beets and Battlestar Galactica faced the… Read more
2. Have you ever been permanently banned from an online forum for arguing about the right way to interpret a TV series, movie, or comic book?
3. Have you ever argued for more than an hour straight over the merits of a piece of software or hardware? Give yourself two points if you were also arguing about open source vs. free software at the same time.
4. Is there only one right answer to the question, "Which Star Trek movie is the best?"
5. Do you agree that it is impossible to fully appreciate the Lord of the Rings movie trilogy without reading the books?
6. Have you ever broken something worth more than $20 after getting killed in a video game?
7. "Apple sucks." "Apple rules." Are those fighting words?
8. Have you ever tried to punch somebody after arguing about Batman, Superman, or any Marvel Comics character?
9. Do you own a collectible whose loss or destruction would put you in an extremely, extremely bad mood that lasts for more than one day?
10. Have you ever gotten into a friendship-ending fight with somebody over software, games, or science fiction?
11. Have you ever screamed at somebody for more than five minutes for making a really bad move in a video game or RPG?
12. Have you ever gotten so frustrated with a gadget or computer that you have thrown it across the room or out a window?
13. When somebody screws you over, do they deserve to have their email/Facebook/Twitter/blog account hacked? Not by you, of course, but by somebody who just happens to have your DNA and occupies the exact same spot as you do in space and time?
Add up your score.
Here's where you are on the Geek Rage Scale (GRS):
0-3 points: Grumpy Fan
You might occasionally suffer from nerd grumpiness, but you keep your anger mostly in check. Nobody will see your dark side unless they really provoke you. You are able to behave in mixed nerd/non-nerd company.
4-5 points: Touchy Geek
Woe to the person who finds herself on the wrong end of an argument with you about your favorite thing, whether that's New X-Men or the Android OS. You've got really strong opinions, and you're not afraid to share them. Even in a really quiet place where everybody is looking at you. Luckily, there are only a few things that really set you off.
6-8 points: Dangerous Dork
It's hard for you to be around non-geeks sometimes. First of all, they don't know the difference between Firefox and Windows. Which is just - what the hell. And second of all, they don't know WTF they are talking about when they say Next Gen is better than original Trek. Sometimes you just can't stop yourself from correcting them, and then they get these really weird looks on their faces which just make them even more hard to understand. Better to hang out with geeks who understand why you are angry.
9-11 points: Complete Freakazoid
Did that guy mess up your game? How about that writer who totally borked your favorite show? Well, this means war. Seriously, WHAT THE FUCK IS UP WITH THAT GODDAMN TRAVESTY THAT DARES TO CALL ITSELF A MOVIE? You really want to know. And you're going to keep yelling about it until everybody sees things your way. Even if it comes to blows, or a major flame war that will result in moderators being called in, banhammers, and certain people's addresses being posted online.
12-14 points: Nerd Berserker
What the hell, dude. Chill the fuck out. Seriously - it's only a movie, OK? I can't take you anywhere without you flying off the handle and breaking shit because people don't take games as seriously as you do, and I can't even hang out with you online anymore because you got kicked out of every freakin fan forum we're on together. Maybe you should see a counselor to deal with your geek rage issues. Seriously - it might help. Ow! Jeez! Hey, that's my super valuable 1970s Ghidorah action figure! Don't - ! AAAAAAAAAAAA!
Click to view |
Visiting Professors in Semester 1, Academic Year 2006-2007
The Faculty warmly welcomes the following Visiting Professors for Semester 1 of AY 2006-07:
1.
Dang Xuan Hop
Commercial Law in Vietnam
Mr Dang Xuan Hop has an LLB from Vietnam, an LLB from Bond University and an LLM from Melbourne University. He has had several years’ experience in international commercial practice with a top Australian law firm. Hop was a Visiting Fellow in our Faculty in AY 2004-05, before leaving for Oxford to pursue a PhD. He will be returning to NUS to offer an intensive course on Commercial Law in Vietnam.
2.
Daniel Fitzpatrick
Law of Contract / Principles of Property Law
Dr Daniel Fitzpatrick is an Associate Professor at the Faculty of Law of the Australian National University (ANU), where he teaches Contract Law, Property Law and Indonesian Law. Dr Fitzpatrick has been with ANU since 1998 and became an Associate Professor in 2006. He will tutor both Contract Law and Principles of Property Law, and offer an elective module in Semester 2 on his main area of research and expertise, "Land, Law & Development in Asia".
3.
Stephen Girvin
Maritime Law / Admiralty Law & Practice
Dr Stephen Girvin is a Professor of Maritime Law at the School of Law of the University of Birmingham. He joined Birmingham in January 2006 after two years as an Associate Professor with us at NUS. He will offer intensive courses on Maritime Law and Admiralty Law & Practice. Stephen will be assisted by Adjunct Associate Professor Neale Gregson in Maritime Law and by Adjunct Asssociate Professor Toh Kian Sing ’90 in Admiralty Law & Practice.
4.
Kevin Gray
Principles of Property Law
Professor Kevin Gray is a Professor of Law at the Faculty of Law of Cambridge University and a Fellow of Trinity College, Cambridge. He specializes in land law and has published widely on land law and property law. Professor Gray will visit for two months and will assist in the teaching of Principles of Property Law.
5.
Wael Hallaq
Islamic Law
Professor Wael Hallaq is a Professor at the Institute of Islamic Studies (IIS) of McGill University in Montreal, Canada. He is a renowned authority on Islamic Law. Wael will be returning to NUS for the third time to offer an intensive course in Islamic Law and to assist in the teaching of Comparative Legal Traditions.
6.
Andrew Harding LLM '84
Law, Governance & Development
Professor Andrew Harding is Professor of Asia-Pacific Legal Relations at the Faculty of Law of the University of Victoria in Canada. Andrew has an LLM from NUS, and started his teaching career at the Faculty of Law of the University of Singapore. He is a former Head of Department and Professor of Law in the Law Department at the School of Oriental and African Studies (SOAS) in London. Andrew will offer an intensive course in Law, Governance and Development in Asia.
7.
Michael Trebilcock
Law, Institutions and Developmen
Professor Michael J. Trebilcock is University Professor and Professor of Law at the University of Toronto, where he holds a Chair in Law and Economics. Professor Trebilcock specializes in law and economics, international trade and contract and commercial law. He serves as Director of the Law and Economics Program in Toronto. Professor Trebilcock will be teaching an intensive course in Law, Institutions and Development.
8.
Martin Vranken
Civil Law Tradition
Dr Martin Vranken is an Associate Professor and Reader at the Faculty of Law of the University of Melbourne, where he teaches European Civil Law and European Union Law. He is a recognized expert in this area and one of his books is on the Fundamentals of European Civil Law. Dr Vranken will offer an intensive course in the Civil Law Tradition.
9.
Zhu Lanye
Chinese IP Law
Professor Zhu Lanye is a Professor of Law at the East China University of Politics and Law (ECUPL) in Shanghai and an arbitrator with the China International Economic & Trade Arbitration Commission (CIETAC). She has visited NUS several times in the past, and is involved with the teaching of the NUS LLM in International Business Law programme in Shanghai. She will be teaching Chinese Intellectual Property Law.
10.
Zhang Qianfan
Chinese Public Law
Professor Zhang Qianfan is a Professor of Law at the School of Law of Peking University and is an expert in Chinese constitutional and administrative law. He will be teaching Chinese Public Law. |
1st place in design competition with chase design
Brief
PACKAGING
MATERIAL RESEARCH
SUSTAINABILITY
We reimagined the 12 oz + 16 oz coffee packages to delivered a new design experience that enhances the functionality, strengthens the brand portfolio and drives customers to purchase Starbucks premium coffee. By researching new, sustainable packaging forms and focusing on a premium coffee experience, our team created a new packaging system that stands out on shelves and boosted consumer engagement.
During our process, we focused on four areas: iconic design; portfolio driven Starbucks design; functionality and experience; and brand loyalty.
Process + Ideation
Throughout the project we made over 50 structural and graphic mockups that explored a variety of packaging forms and functionalities, reflecting the desires and needs from our interviewed consumers. Many of them struggled with pouring their coffee out of a flexible foil laminate pouch. With this in mind, we tested different pour and funnel capabilities that would still allow for scooping. Additionally, we needed to stand out in stores that used warm, dim lighting and not blend into other coffee packaging that used beiges, browns, and warm colors.
Veranda Blend
Blonde Roast
Cocoa beans and leaves pattern
Emphasizes the feelingof the light taste enjoyed by the farmers themselves
Breakfast Blend
Medium Roast
Sunburst pattern
Highlights waking up and the beginning of a new, bright day
Caffe Verona
Dark Roast
Floral pattern
Inspire the sweetness and romance found in the city that sparked the flavor
Usability + Function
Because our consumers regularly handle the packaging, we wanted to design something that had easy, sturdy handling and storage. The directions can be found on the easy funnel side as the user picks it up. Meanwhile the new funnel pour option allows for them to pour their coffee out, also retaining scooping abilities, and reseals with a fold over panel closed by a tin tie to form a more hermetic seal to maintain freshness.
Design Features
For design we kept consistent with the established color, illustration, and design style of other Starbucks products while bringing in the minimalistic approach some of Starbucks newer products are using. The different patterns subtly show the different flavors while the breakdown of information allows for shoppers to quickly browse the coffee flavors and environmentally conscious decisions. A simple rich brown dot pattern creates another layer of texture that is cleaner than current background textures.
In-Store + Retail
Our design stands out among the other coffee brands currently available. In the warm, dim lighting of grocery stores, the rich brown and bold colors grabs consumers eyes while the white flavor bands link them across the shelf. The diagonal carton design also differentiates itself from other brands and adds to the premium quality. Finally, the sturdy nature of our packaging allows it to work well in pushers or stay in shape on open shelves and allows for consumers to easily interact with them. |
Q:
Store file content into arrays
What i'm trying to do is to take content form the file "test" modify it and display it again.
So the test file looks like this:
test
test.com
And i want to modify it, so it would look like this:
DNS.1 = test
DNS.2 = test.com
so i am trying to it with something like this:
$(i=1
for alt in "${alts[@]}"; do
echo "DNS.$((i++)) = $alt"
done)
I just don't have an idea how i could take the content from a file and connect it with the code right above.
Does someone has an idea how it could work or knows where i can search for that problem.
A:
As pointed out in the comments, there are better ways than a loop when your input is a file. However, if you really want an array use mapfile:
< file mapfile -t alts
echo "array alts has ${!alts[@]} entries"
echo "the entries are"
printf '"%s\n"' "${alts[@]}"
By the way: Cyrus' awk script can also be used when your input is not a file but just an array:
# for files
awk '{print "DNS." NR " = " $0}' file
# for arrays (use only if your input is not a file)
(IFS=$'\n'; awk '{print "DNS." NR " = " $0}' <<< "${array[*]}")
# or
awk '{print "DNS." NR " = " $0}' < <(printf %s\\n "${array[@]}")
|
Rheumatoid elbow.
The elbow is often involved in the progression of rheumatoid arthritis. Because of the elbow's unique role in maneuvering and positioning the hand in space, loss of normal elbow motion, loss of stability, or increased pain with the use of the elbow are all significant sources of impairment in patients with rheumatoid arthritis. The improvements in disease-modifying medications have greatly diminished the prevalence of severe elbow degeneration among patients with rheumatoid arthritis. However, it hasn't been eliminated. In this article the authors discuss strategies for managing it. |
/*
* Copyright (c) 2011-2018, Meituan Dianping. All Rights Reserved.
*
* 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 com.site.helper;
import java.lang.reflect.Field;
import java.lang.reflect.Type;
import java.sql.Timestamp;
import java.text.DateFormat;
import java.text.ParseException;
import java.text.SimpleDateFormat;
import java.util.Date;
import com.google.gson.FieldNamingStrategy;
import com.google.gson.Gson;
import com.google.gson.GsonBuilder;
import com.google.gson.JsonDeserializationContext;
import com.google.gson.JsonDeserializer;
import com.google.gson.JsonElement;
import com.google.gson.JsonParseException;
import com.google.gson.JsonPrimitive;
import com.google.gson.JsonSerializationContext;
import com.google.gson.JsonSerializer;
public class JsonBuilder {
private FieldNamingStrategy m_fieldNamingStrategy = new FieldNamingStrategy() {
@Override
public String translateName(Field f) {
String name = f.getName();
if (name.startsWith("m_")) {
return name.substring(2);
} else {
return name;
}
}
};
private Gson m_gson = new GsonBuilder().registerTypeAdapter(Timestamp.class, new TimestampTypeAdapter())
.setDateFormat("yyyy-MM-dd HH:mm:ss").setFieldNamingStrategy(m_fieldNamingStrategy).create();
@SuppressWarnings({ "unchecked", "rawtypes" })
public Object parse(String json, Class clz) {
return m_gson.fromJson(json, clz);
}
public String toJson(Object o) {
return m_gson.toJson(o);
}
public String toJsonWithEnter(Object o) {
return m_gson.toJson(o) + "\n";
}
public class TimestampTypeAdapter implements JsonSerializer<Timestamp>, JsonDeserializer<Timestamp> {
private final DateFormat format = new SimpleDateFormat("yyyy-MM-dd HH:mm:ss");
public Timestamp deserialize(JsonElement json, Type typeOfT, JsonDeserializationContext context)
throws JsonParseException {
if (!(json instanceof JsonPrimitive)) {
throw new JsonParseException("The date should be a string value");
}
try {
Date date = format.parse(json.getAsString());
return new Timestamp(date.getTime());
} catch (ParseException e) {
throw new JsonParseException(e);
}
}
public JsonElement serialize(Timestamp src, Type arg1, JsonSerializationContext arg2) {
String dateFormatAsString = format.format(new Date(src.getTime()));
return new JsonPrimitive(dateFormatAsString);
}
}
}
|
{
"id": "estimator",
"criterion" : "Method(`POST`) && Path(`/estimate`)",
"endpoint" : {
"shard_expr": ".currency",
"matcher": "body",
"shard_func": "lookup",
"shard_config": {
"IDR": {
"backend_name": "indonesia-cluster",
"backend":"http://indonesia-cluster-estimator"
},
"SGD": {
"backend_name": "singapore-cluster",
"backend":"http://singapore-cluster-estimator"
}
}
}
}
|
Q:
How to Add a Checkbox to a List View Column Header in c# Winform App?
I want to add checkbox in header and also if I checked in header checkbox it should be like select all and deselect All... just like above image!
I want to create this type of listview header with checkbox in c#
A:
You can set OwnerDraw property of ListView to true and draw a ChceckBox on first column header and handle ColumnClick to perform select/deselect all.
For drawing the ListView you need to handle DrawColumnHeader, DrawItem and DrawSubItem events.
Draw checkbox in DrawColumnHeader event.
Set e.DrawDefault = true; for other drawing events to draw default rendering.
Handle ColumnClick event and store the checked state of column header in tag of column. Also for each item of list view, set Checked property to perform select/deselect all.
Code:
private void listView1_DrawColumnHeader(object sender,
DrawListViewColumnHeaderEventArgs e)
{
if (e.ColumnIndex == 0)
{
e.DrawBackground();
bool value = false;
try
{
value = Convert.ToBoolean(e.Header.Tag);
}
catch (Exception)
{
}
CheckBoxRenderer.DrawCheckBox(e.Graphics,
new Point(e.Bounds.Left + 4, e.Bounds.Top + 4),
value ? System.Windows.Forms.VisualStyles.CheckBoxState.CheckedNormal :
System.Windows.Forms.VisualStyles.CheckBoxState.UncheckedNormal);
}
else
{
e.DrawDefault = true;
}
}
private void listView1_DrawItem(object sender, DrawListViewItemEventArgs e)
{
e.DrawDefault = true;
}
private void listView1_DrawSubItem(object sender, DrawListViewSubItemEventArgs e)
{
e.DrawDefault = true;
}
private void listView1_ColumnClick(object sender, ColumnClickEventArgs e)
{
if (e.Column == 0)
{
bool value = false;
try
{
value = Convert.ToBoolean(this.listView1.Columns[e.Column].Tag);
}
catch (Exception)
{
}
this.listView1.Columns[e.Column].Tag = !value;
foreach (ListViewItem item in this.listView1.Items)
item.Checked = !value;
this.listView1.Invalidate();
}
}
Screenshot:
In the above image I have 3 columns.
I set empty text for first column.
I Set CheckBoxes property of ListView to true.
I Set empty text for items and added 2 sub items for each item.
|
Im Ballerspiel-Klassiker Doom II von 1994 sind etliche Secrets versteckt, die man zum Durchspielen eines Levels aber nicht aufdecken muss – außer man will die gesamte Levelstatistik makellos mit 100 Prozent abschließen. Genau das ist nun 24 Jahre nach Erscheinen des Spiels für MS-DOS-PCs einem Spieler unter dem Pseudonym "Zero-Master" gelungen: Er hat offenbar als Erster ein bislang als unlösbar geltendes Problem in Map 15 (Industrial Zone) gemeistert und per Aktivieren eines Teleporters einen geheimen Bereich zugänglich gemacht.
WTF Das Internet ist voll von heißen IT-News und abgestandenem Pr0n. Dazwischen finden sich auch immer wieder Perlen, die zu schade sind für /dev/null. Mehr WTF-Meldungen
Glückwünsche vom Entwickler
Der zu entdeckende Bereich war zuvor schon bekannt, nur hat ihn bisher niemand regelkonform per Teleporter erschlossen, lediglich per No-Clip-Cheat (der den Spieler durch Wände gehen lässt). Der Teleporter ist zwar als Secret markiert, aber wenn man ihn berührt, gibt es keinen Zugang. "Zero-Master" stolperte jedoch mehr zufällig über den Trick, sich von einem Gegner darauf schubsen zu lassen, was ihm das Secret Nummer 4 dieses Levels sicherte.
Der Mitgründer von Spielehersteller id Software und Doom-Mitentwickler John Romero gratulierte dem Spieler per Twitter und lobte den Trick, mit dem die Auflage erfüllt wurde: "To win the game you must get 100% on level 15 by John Romero". In einem zweiten Tweet erklärt er den Trick für das Secret genauer. Erst kürzlich hatte Romera Original-Disketten von Doom II versteigert.
Im Video dokumentiert
Die Spielrunde von "Zero-Master" in Level 15 ist in einem YouTube-Video dokumentiert – die entscheidende Stelle folgt kurz nach der Drei-Minuten-Marke. In der Beschreibung des Videos stehen außerdem weitere Details zur Entdeckung.
(tiw) |
Bowen's disease: epidemiological and clinical study of 9 Tunisian cases.
Bowen's disease (BD) is a form of in situ SCC, characterized by chronic and progressive course, with low potential for invasive malignancy. To assess epidemiology and clinical features of BD in a Tunisian cohort. A retrospective study of 9 cases of BD managed in a Tunisian dermatology department. There were 7 males (77.8%) and 2 females (22.2%). The mean age of patients was about 68.8 years (46-89). Lesions were solitary in 7 cases and occurred in various sites: face (1 patient), trunk (2 patients), limbs (6 patients). The mean diameter of the tumour was about 3.4 cm. Lesions presented clinically as an enlarging well demarcated erythematous plaque with irregular borders and crusted or scaling surface. Histological examination showed in all cases abnormal keratinocytes with disordered maturation and loss of polarity replacing the epidermis in its whole thickness. The main treatment was surgery (N=5). Only one patient had radiotherapy (case 1). Outcome was mentioned in 2 patients who remained free from recurrence respectively after a follow-up of 1 and 12 years. Our series outlines epidemiological and clinical features of BD in Tunisia through a small but representative sample. As in the literature, this condition prevailed mainly over 60 years. In our study, BD occurred predominantly in men and affected nonexposed sites in 8 cases. This profile is uncommon in a sunny country in Tunisia, in the absence of other aetiological agents. |
MaterialViews has New Features to Help Materials Scientists Keep up with the Latest Research
MaterialsViews.com, the news service from Wiley
covering the latest developments in materials science, chemistry, and physics,
has been updated with new features that help materials scientists keep up with
the latest research.
MaterialsViews.com's professional scientific editors scan the materials
science, chemistry, and physics literature, looking for the most interesting,
exciting, and relevant breakthroughs in all of materials science as soon as they
are published. They then distil the best papers into concise summaries that can
be quickly scanned and uploaded on to the website, so busy scientists can
identify the papers they want to spend more time reading.
The new MaterialsViews.com, with its improved navigation and layout, will
also enable readers to find articles more quickly. It's new individual channels
for hot subject areas - including nanotechnology, polymers, energy, electronics,
photonics, surfaces, and more - let scientists focus on the stories most
relevant to their research.
"Scientists could spend so much time reading papers relevant to their
research that they wouldn't have time for anything else, so we updated the site
to make it even easier to find key results." said Adrian Miller, editor of
MaterialsViews.com. "And once you find something interesting, we want you to be
able to process it quickly and decide whether you want to invest more time
reading the original paper."
It will also easier to find upcoming events and conferences on the revamped
website. The new MaterialsViews.com jobs page can also help scientists locate
the perfect career opportunity anywhere in the world.
Single Wall Carbon Nanotubes (SWCNTs) are extremely effective additives for improving the conductivity of polymer based materials. When compared to the current most popoular additive, carbon black, they are up to 1,000 times more powerful and don't result in any loss in material strength.
With a multitude of different designs on offer, determining what hot zone is best for your application is becoming increasingly difficult. To address this problem, Plansee have developed a range of three different, customizable, hot-zones.
The Metals edition of Aeris is PANalytical’s X-ray diffractometer for everyone in the metals industry. With Aeris X-ray diffraction (XRD) becomes as easy as making a cup of coffee: Aeris is the most intuitive benchtop diffractometer with the results of your measurements directly being displayed on the built-in touch screen. |
178 So.2d 608 (1965)
Winifred Huey KIMMONS, Appellant,
v.
STATE of Florida, Appellee.
Nos. F-137, F-138.
District Court of Appeal of Florida. First District.
September 14, 1965.
Rehearing Denied October 13, 1965.
*609 Robert R. Hendry, of Harrell, Caro, Middlebrooks & Wiltshire, Pensacola, for appellant.
Earl Faircloth, Atty. Gen., and George R. Georgieff, Asst. Atty. Gen., for appellee.
CARROLL, DONALD K., Judge.
This is an appeal from two judgments entered by the Circuit Court for Escambia County, based upon a jury verdict, convicting the appellant of manslaughter in the slaying of his wife and her paramour.
The three points raised by the appellant for our determination in this appeal are whether the trial court committed reversible, prejudicial error: (a) in admitting into evidence an alleged confession taken while the appellant was under the influence of drugs; (b) in ordering the bailiff to deliver to the jury a written copy of the charges during a court recess and after the jury had retired to deliberate; or (c) in allowing the State to reopen its case after the defense had rested, and call a new witness for further affirmative testimony.
Briefly stated, the evidence at the trial established the following facts: The 28-year-old appellant and his wife, the parents of three young children, had been married ten years as of the date in question, September 10, 1963, and lived near the City of Pensacola. At about 10 o'clock in the morning of the said date he left his house and started to drive to work at a filling station which he owned and operated in Pensacola. Recalling that he needed to make a telephone call, he returned to his house, picked up an extension phone, and overheard his wife and a man discussing plans to meet around noon that day in a wooded section near Pensacola. The appellant then hung up the telephone receiver, left the house, and drove to his filling station, where he remained for most of the morning. Around noon he decided to return home and discuss the overheard telephone conversation with his wife, but, as he neared his house, he observed his wife driving off. He followed her car to the mentioned wooded section, and there saw her car, which was parked adjacent to the car of one Peters. As the appellant approached the two cars on foot, he held a loaded .38 calibre pistol in his hand and had a box of shells in his shirt pocket. From some bushes he observed his wife and Peters in a compromising position in her car, whereupon the appellant approached her car, the occupants of which got out and stood up, and he shot his wife four times and then shot Peters a total of seven times, causing the deaths of both.
After these shootings the appellant drove to his mother's house, where he was observed by his mother, his sister, and two attorneys to be in a state of shock, to be talking incoherently, and to be obviously in need of medical attention. This was around 1:30 P.M., about 30 minutes after the fatal shootings.
The appellant soon thereafter was taken to a hospital, where he received two shots of tranquilizers during the hour from 2 to 3 P.M. He was then taken to the county sheriff's office, where, at approximately 4:30 P.M., in the presence of officers and his attorney, he made a confession into a recording machine.
*610 Two weeks later the appellant was charged by separate indictments with the crime of murder in the first degree for the deaths of his wife and Peters. At his arraignment the appellant pleaded to each indictment not guilty and not guilty by reason of insanity. The two cases were consolidated for trial, which was held on January 6 to 10, 1964. The jury found the appellant guilty of manslaughter under each indictment, and the court sentenced him to confinement at hard labor for 12 years under each conviction, the said terms to run consecutively. Later the court denied the appellant's motion for a new trial, and this appeal followed.
With regard to the appellant's first point in this appeal concerning the trial court's admission of the said confession into evidence the appellee contends that there was no evidence at the trial that the appellant was under the influence of the tranquilizers or other drugs at the time he made his confession. Besides, the appellee points out, the confession amounts to nothing more than the appellant's acknowledgement that he shot his wife and her lover at a particular place and in particular circumstances, and he said all of this and more at the trial when he testified in his own behalf upon the advice of his counsel. Our examination of the record of the trial proceedings convinces us that the appellee's position is sound as to this point and that the appellant has failed to demonstrate prejudice resulting to him in the court's admission into evidence of the said confession.
The second point raised by the appellant in this appeal concerning the delivery of the written charge to the jury after the jurors had retired is more troublesome to resolve.
At the trial, after both sides had presented their evidence and argued to the jury, the trial court orally gave its charge to the jury, after which the jury retired to consider its verdicts. Later the jury returned to the courtroom and requested the trial judge to give them a written copy of the charges which he had orally given them. The judge ordered the bailiff to give them such a written copy, which the latter did. All this took place while the court was in recess and while neither the appellant nor his counsel was present in the courtroom.
In support of its contention concerning this second point, the appellant relies chiefly upon the decision of the Supreme Court of Florida in the early case of Holton v. State, 2 Fla. 476 (1849). In that case the Supreme Court held that a copy of the charge to the jury, admitting it to be a full and true copy, cannot rightfully be sent to the jury in a criminal case after their retirement, for the charge of the court is part and parcel of the trial of the case, the whole of which the Constitution requires to be public. In that case the written copy was given to the jury without the consent of the defendant or his counsel. The court further declared that, if a charge in such a case and under such circumstances "may be sent by the judge to the jury, it should be the original one, and not a copy."
Another Florida case cited and relied upon by the appellant in support of his position on the second point is the more recent case of Holzapfel v. State, 120 So.2d 195 (1960), in which the District Court of Appeal, Third District of Florida, held that, if the jurors in the trial of a criminal case communicate with the officer in charge of the jury and receive from him certain instructions concerning the law of the case before them, outside of the presence of the defendant and of the presiding judge, such misconduct would constitute substantial error, and the fact that the instructions given by such officer were a correct statement of the law would not excuse it, citing as authority for this holding the provisions in Sections 918.07, 919.05, and 920.05(1) (a), Florida Statutes, F.S.A. In the Holzapfel case, in which the appellant was tried for and convicted of breaking and entering with intent to commit grand larceny, the bailiff, at the jury's request, orally explained *611 to them the difference between grand larceny and other larceny. We agree fully with this holding of our sister court, for no rule is more fundamental in the trial of cases than that the instructions to the jury on the law of the case must come exclusively from the judicial officer presiding at the trial. Any other rule would, we think, lead to endless confusion, error, and injustice. That holding, however, is not applicable to the case at bar, for in this case the presiding judge directed and approved the delivery to the jury of the written copy of the charges that he had given.
The holding of our Supreme Court in Holton v. State, supra, cannot, however, be so readily distinguished, for the language used in expressing its above holding appears to outlaw the giving of a written copy of the charges to a jury after their retirement, at least in the absence of the defendant and his attorney.
When confronted with an apparently-applicable rule laid down more than a century ago by the highest court of the state, an appellate court, we think, has the right and duty, in fulfilling its judicial function, to examine closely that rule in an effort to determine whether the reason for the rule still exists today, and also to study the subsequent decisions of the appellate courts of the state to see whether that rule has been recognized and applied in appropriate cases.
The reason stated by the Supreme Court in the Holton case, supra, for the rule in question is that the court's charges are part and parcel of the trial of the case, the whole of which the Constitution requires to be public. Such a reason, if carried further, would logically prohibit a jury's taking into the jury room exhibits and documentary evidence a practice universally upheld and would even require that jurors conduct their deliberations in public.
We are inclined to surmise that an unspoken reason for the rule laid down in the Holton case, supra, is the fact that in 1849, when that decision was rendered, a written copy of instructions usually meant a copy written by pen or pencil in the sometimes illegible or confusing handwriting of the presiding judge or of a court attache. We judicially know that the typewriter was not invented until many years after the said decision was rendered, which machine, now so universally used in court proceedings, has contributed greatly to the accuracy and readability of reports of proceedings, together with vast improvements in shorthand reporting.
Another unexpressed reason for the holding in the Holton case may have been the illiteracy of many persons called to jury duty at the time (1849) when that decision was rendered. This reason was given for such a holding in some of the early decisions from other states. For instance, the Supreme Court of Indiana in 1862 said in the case of Smith v. McMillen, 19 Ind. 391, that, if the court sends written instructions to the jury, "inasmuch as the jurors are not upon equality in their ability to read and interpret writing, it puts it in the power of sharp ones on the jury to read, and become the interpreters for the Court; and mislead their less skillful fellow-jurors." This reason, we must admit, has some logical force in times and places where illiteracy is widespread, except for the fact that even then the power of the "sharp ones" to mislead their "less skillful fellow-jurors" is much greater when the memories of the jurors vary as to exactly what the trial judge said in his oral instructions. In addition, everyone knows, and so we judicially know, that the rate of illiteracy in this country and state is much lower today than more than a century ago, when the decisions in the Holton and McMillen cases, supra, were rendered, and hence the reason for the rule, as stated in the McMillen case, has lost most of whatever force it may have ever had.
The sole purpose of a trial court's instructions to the jury is to advise them of the law applicable to the case being tried before them in order that the verdict which *612 they reach shall be in conformity with the law. Without such instructions the most precious and fundamental concept in our civilization today the rule of law would be impossible of attainment in jury trials.
Dedicated jurists and students in the field of the administration of justice have long been concerned with the fact that an almost impossible burden is placed upon these untrained laymen on the jury to remember and correctly apply all of the often-complex law which is rattled off by the presiding judge in his jury instructions. Everyone knows, and so we know, of the unreliability of the human memory especially as to matters in an unfamiliar area. When the jurors in a case recognize the frailty of their memories and the vital importance of faithfully following the law as given them by the court, and they request the court to let them have a written copy of the charges, we think that, in the interest of the administration of justice, the trial court may, in its discretion, give them a written copy of its instructions, assuming, of course, that such copy reflects with substantial accuracy the instructions actually given orally. We agree with the Holton decision, however, that it would be error for the court to give the jury such a written copy other than in open court and in the presence of the defendant and his counsel, so that objection can be made by the counsel if he finds any material and prejudicial discrepancies between the oral instructions and the written copy, or if he finds any markings, notations, or anything else on the written copy that might prejudice his client's cause. The said error may become a reversible error if the said objections of the accused's counsel are held to be meritorious on appeal.
Before thus departing from the strict holding in the Holton case, supra, on the ground that the apparent reasons for such holding no longer exists today, and on the ground discussed below that such holding is contrary to the trend of modern authority and to what we conceive to be the better view, we have "Shepardized" the Holton case and found that, since 1849, the date of that case, in no decision has a Florida appellate court cited and relied upon that holding that a written copy of the trial court's instructions cannot lawfully be given to the jury after their retirement. In several decisions, however, those courts have cited and relied upon that case for the general proposition that in the trial of a capital case the defendnat must be present during the whole trial. See, for instance, Irvin v. State, 19 Fla. 872 (1883), and Morey v. State, 72 Fla. 45, 72 So. 490 (1916).
A reading of the general textbooks and encyclopedias on the subject of the legality of giving to the jury a written copy of the instructions they have orally received, discloses that there are respectable authorities on both sides of this proposition. One of the most accurate statements of this split of authorities is found in 53 Am.Jur., Trial, Sec. 935, as follows:
"It is clearly error for a court to permit the jury to take with them to the jury room instructions refused. According to some authorities, instructions given on the trial should not be sent to the jury room without consent of the parties, but according to others, the matter, in the absence of statute, rests in the discretion of the trial judge. Some statutes specifically authorize the jury to take with them written instructions given."
The general rule is thus stated in 23A C.J.S. Criminal Law § 1369, pages 986 and 987:
"As a general rule, it is proper for the court, within its discretion, to permit the written instructions to be taken to the jury room for the consideration of the jury while deliberating on their verdict, at least if the parties do not object; but in the absence of any request for the instruction, or of a special necessity therefor, the failure to send *613 the instructions to the jury room is not error, except where it is required by statute that the jury must be permitted to take the written instructions with them to the jury room."
One of the cases cited in American Jurisprudence in support of the modern view, and apparently a leading case on the subject, is State v. Peters, 44 Haw. 1, 352 P.2d 329, 81 A.L.R.2d 1137 (1959), in which the Supreme Court of the State of Hawaii said:
"Defendant's last specification of error is that the trial court erred in permitting the jury to take a copy of the instructions to the jury room. Although in the absence of statute there is no uniform practice, the authorities hold that the trial court may, in its discretion, permit the jury to take instructions to their deliberation. One court has held the practice to be not only permissible but commendable. Valley National Bank v. Witter, 58 Ariz. 491, 121 P.2d 414.
"It is the view of this court that as long as there is no abuse of discretion and the manner in which it is done is not prejudicial, the trial court may permit instructions to be taken by the jury. In the case at bar, the jury was permitted to take a copy of the given instructions holus bolus without separation or markings to indicate who requested them. The copy had been previously examined by counsel on both sides, who expressly admitted having no objections as to the accuracy of the same. The position which this court takes on the subject is fully supported by Copeland v. United States, 80 U.S.App.D.C. 308, 152 F.2d 769; Carrado v. United States, 93 U.S.App. D.C. 183, 210 F.2d 712; State v. Stracner, 190 La. 457, 182 So. 571; Lindsey v. State, [229] Ark. [450], 316 S.W.2d 349. The cases cited by defendant have been carefully examined and found to be here inapplicable or distinguishable, in that they involved facts showing that the trial court had either given supplemental instructions or entered the jury room with no notice to and in the absence of counsel."
Some authorities treat the subject of written instructions by considering them to be in the category of other documents forming a part of the record of the trial. For instance, Anderson in his "Wharton's Criminal Law and Procedure," vol. V, page 294, states the rule as follows:
"The judge may allow documents forming part of the record of the trial, or properly used before the jury on the trial, such as the indictment, and the plea, and bills of particulars, and the judge's written instructions, to be taken out, provided the jury understand that they are not evidence. Whether other papers may be taken out depends on the particular use made of them in the trial."
Cases from Arkansas, Illinois, and Missouri are cited in support of the above statement concerning written instructions.
A most persuasive factor in this consideration in Florida is the fact that, ninety years after the Holton decision was rendered, the Florida Legislature enacted a law that expressly authorizes the sending of written instructions to juries in trials of criminal cases. Section 219 of Chapter 19554, Laws of Florida, Acts of 1939 (now reported as Section 919.04, Florida Statutes, F.S.A.), provides as follows:
"What jurors may have with them. Upon retiring for deliberation the jurors may, if the court permits, take or later have sent to them:
"(1) Forms of verdict approved by the court, after being first submitted to counsel.
"(2) Any written instructions given; but if any such instruction is taken or sent all the instructions shall be taken or sent.
*614 "(3) All things received in evidence, other than depositions. If the thing received in evidence is a public record or a private document which in the opinion of the court, ought not to be taken from the person having it in custody, a copy shall be taken or sent instead of the original."
In Brown v. State, 152 Fla. 508, 12 So.2d 292 (1943), the Supreme Court of Florida said that it was within the trial court's discretion to grant the motion of the defendant's counsel to permit the jury to take to the jury room all charges that had been given by the court, but that the denial of such motion was not an abuse of discretion. The Supreme Court said with reference to the above-quoted statute (Section 919.04, Florida Statutes, F.S.A.):
"This is ample authority for delivering to the jury the charges of the court, however, it was within the court's discretion to grant the motion of counsel and we cannot decide from the record in this case that any abuse was committed by his denial."
The split of authority on the question of sending written charges to the jury during their deliberations is delineated in 89 C.J.S. Trial § 468, where also is described a third view, which we share, that the sending of the written instructions to the jury in the absence of the defendant and his attorney is at most an irregularity which does not require a reversal if no prejudice is shown to have resulted.
In the appeal before us the appellant has failed to demonstrate that he was prejudiced in any way by the court's sending to the jury the written copy of the instructions. Seemingly the most serious deviation of the written copy from the oral instructions is the failure to include in such copy the following sentence in the oral instructions: "Finally the Indictment includes the still lesser degree of unlawful homicide known as manslaughter." Obviously the omission of that sentence could not conceivably have prejudiced the appellant, for the jury actually brought in a verdict of guilty of the said lesser offense of manslaughter.
In addition to the above considerations, we think that the appellant here waived his objection to the delivery of the written charges to the jury by failing to make timely and prompt objection to that procedure. While the transcript of the trial proceedings does not cover the events involved in the delivery of the written charges to the jury, the trial court recites in its order denying the appellant's motion for a new trial the following facts, which are not controverted elsewhere in the record: "* * * and the Court further taking judicial knowledge of the fact that said written charge handed to the jury was the same written charge delivered to the jury by the Court at the conclusion of the case, and to which the defendant had taken no exception, and before the jury retired to deliberate its verdict, and upon inquiry by" the defendant's counsel "as to what had been given the jury, the Court advised him that the jury had requested and had been handed the Court's written charge; that thereupon said counsel voiced no objection thereto * * *." If such delivery had been in any way prejudicial to the defendant, the latter's counsel should have promptly interposed an objective so that the court might, if error or prejudice was demonstrated, take timely steps to eliminate any prejudicial effect.
Our conclusion as to this second point on appeal is that the trial court's sending of the written copy of the charges to the jury at their request constituted at most an irregularity and was in keeping with modern concepts in the administration of justice, and did not constitute reversible error in the absence of a showing that the defendant was prejudiced by the said act, such as a showing of substantial and prejudicial deviations between the oral and the written charges or a showing of prejudicial markings or notations on the written charges. *615 In the case at bar we hold that the required showing of prejudice has not been made and that, in any event, the defendant's right to object was waived by his counsel's failure to make timely objection to the said procedure.
In his third point on appeal the appellant claims that the trial court committed reversible error in allowing the State to reopen its case and call a certain witness for further affirmative testimony after the appellant had rested his case. The State contended before the trial court that the said witness had not been located until the late afternoon or night before, a short time after the defense had opened its case, but the State admitted that it had not notified the defense of its intention to call the witness, although the defendant had requested the names of witnesses to be used at the trial.
In this appeal the appellant contends, and we agree in principle, that to be entitled to the privilege of reopening, a party must exhibit candor and fairness and not utilize such circumstances to surprise the other party. On its part the State contends that it would have been pointless for the prosecutor to have provided the defense counsel with the name of the said witness unless and until, after his examination of her, he determined that he was in fact going to be able to use her as a witness, which examination he could not undertake through the balance of the day since he was engaged in the trial; and that, when it became apparent to him that the witness' testimony was necessary or proper, her identity was made known to the court and to the defense counsel, and the court, out of an abundance of caution and consideration, made her available to the defense counsel for examination prior to the time she was permitted to take the stand and testify.
The question of permitting a party to reopen its case is one of the questions arising during trials that rest primarily within the sound judicial discretion of the trial judge in carrying out his sacred duty to assure that the trials over which he presides are conducted in accordance with the precepts of justice and fairness to all parties concerned, in order that truth and justice the objects of our court system may be attained. Because of this sacred duty, which we think the trial judges of this State unremittingly endeavor to carry out with devotion and ability, and because the judge presiding at a trial is in a much better position than the members of an appellate court, who are confined in their consideration to the "cold record," the appellate court should not ordinarily substitute its judgment for that of the trial judge in matters that might be categorized as the "incidents" of a trial, such as the reopening of the case by one of the parties.
In the case at bar we find that there is no showing that the trial judge clearly abused his discretion in allowing the State to reopen its case. We further think that whatever surprise the new testimony might have been to the defense counsel was to some extent lessened by the wise decision of the judge to grant that counsel an opportunity to examine the witness before she took the stand.
Since the appellant has failed to establish the commission of any reversible error in entering the final judgments appealed from herein, those judgments must be and they are
Affirmed.
RAWLS, C.J., and WIGGINTON, J., concur.
|
How To Automate Your SEO Reporting By Directly Exporting your Leads Into Excel?
How To Automate Your SEO Reporting By Directly Exporting your Leads Into Excel?
In case of any SEO professional who prefers to collect email leads from web forms, the most dreaded part comes in the end of the month, when they need to report conversion results to clients- verifying, re-verifying, downloading and exporting them to create the useful month-end report. However, there are ample of reasons to optimize the work flow to the point that it almost reduces your time to half and a project that usually takes hours is now completed into minutes. Let’s find out how to do it.
Ways to scrape leads from Gmail-
There are various ways through which you can scrape leads from gmail. Either you can shell out bucks to get a program like U Bot that will play an imperative role in automating the task without putting much effort. Also, you can get the program like Imacros and can learn how to create right macros that will then scrape from your email box. Whatever way you use, you want a definite solution that can help you in automating the task without putting much effort. There is a program on black hat world that can easily work on windows, therefore, your Mac users will need to install windows in order to use it. Though, the name sounds weird and you may be hesitate in downloading anything from black-hat websites but in fact, comments and reviews do not say anything negative.
How it works?
Choose the email settings which you want to use to download your emails. Then you need to choose to:, From:, Subject, and Date. Then the ‘body’ export is disabled and according to the creation of the tool, it would then result into scrapping all the HTML.
Then you need to enter your full email address
Enter the password
Then enter the server and port number which you wish to use
Decide whether or not you are interested in using a secure connection. If your email doesnot need a secure connection then make sure you are unchecking the box
After selection these settings, it will then save a file in email extractor folder
Make sure you are not violating your host’s terms & conditions-
This program works favourably for other email hosts also. While, trying it make sure you are putting your applicable login details and you should be able to easily scrape email from your host. Before making use of egregious scraping on your email account, you should make sure you are carefully checking your terms of service in order to avoid getting banned from your email service. Many times, email service does not allow scrapping because it can create bandwidth issues, if you are having thousands of email to export. So, make sure that you are in fact keen to do this if you want to put a large load of use on the email services.
How to import scrapped file into excel?
After scrapping all your email as it saves as a text file, now you need to import it into excel so that it shows all tab-delimited items as columns and you can save yourself from manually copying and pasting every single one. In order to do this, you need to open up your file in excel by clicking on file>import. Then it will ask you: what type of file you are interested to import? By default, it will choose the CSV format but you can choose the text file format as our program has saved this to a text file.
Now, you need to click onto the file that you are interested to open and click on ”Get Data.” The text import wizard will give you settings to choose from. Choose the ”Delimited” option unless it is already checked by default. Then click on Next. At this step, you will see the set of delimiters that your data is having.
Technique to download leads from outlook to excellence:
Those who are using outlook, depending on the version, it can be a daunting task to get the data out of the program. Outlook features macros, that allow you to export all your data in a very short span of time in few seconds!
To sum up, by using the above methods, it is possible to curtail the time that you have spent on manually verifying and copying/pasting leads directly from your email box. The entire process will be completely automated and will make your reports impressive.
VN:F [1.9.22_1171]
please wait...
Rating: 10.0/10 (1 vote cast)
VN:F [1.9.22_1171]
Rating: +1 (from 1 vote)
How To Automate Your SEO Reporting By Directly Exporting your Leads Into Excel?, 10.0 out of 10 based on 1 rating |
Big Sioux Rec Area Disc Golf Scores
Update Course InformationCourse Description:Beautiful river bottom along the Big Sioux River. Open, grassy prairie areas with the final 3 holes in a large mowed area. Water in play on 5 holes. Several very tight holes through the trees.
Tees are about 50/50 cement/dirt
Mach 3 baskets
Course Location:State: SDStreet Address: 410 Park St.
Zip/Postal Code: 57005
Local Directions: I-90; Brandon exit. South Splitrock Blvd. to a right on S. Sioux Blvd. to W. Park St. and State Park entrance (fee). |
// Copyright (c) 2014-2016 Titanium I.T. LLC. All rights reserved. For license, see "README" or "LICENSE" file.
// WORKAROUND IE 8: Copied from the npm module 'big-object-diff' v0.7.0 by James Shore and revised to work on IE 8.
"use strict";
var shim = require("./shim.js");
var INDENT_TEXT = " ";
exports.renderDiff = function(expected, actual) {
return renderDiffWithIndent("", expected, actual);
};
function renderDiffWithIndent(indent, expected, actual) {
if (exports.match(expected, actual)) return "";
if (isArray(expected) && isArray(actual)) return arrayRenderDiff(indent, expected, actual);
if (isObject(actual) && isObject(expected)) return objectRenderDiff(indent, expected, actual);
else return flatRenderDiff(expected, actual);
}
function flatRenderDiff(expected, actual) {
var renderedActual = flatRender(actual);
var renderedExpected = flatRender(expected);
if (isFunction(expected) && isFunction(actual) && renderedActual === renderedExpected) {
renderedExpected = "different " + renderedExpected;
}
return renderedActual + " // expected " + renderedExpected;
}
function arrayRenderDiff(indent, expected, actual) {
return "[" + renderPropertiesDiff(indent, expected, actual, true) + "\n" + indent + "]";
}
function objectRenderDiff(indent, expected, actual) {
return "{" + renderPropertiesDiff(indent, expected, actual, false) + "\n" + indent + "}";
}
function renderPropertiesDiff(oldIndent, expected, actual, ignoreLengthProperty) {
var indent = oldIndent + INDENT_TEXT;
var unionKeys = [];
var extraKeys = [];
var missingKeys = [];
analyzeKeys();
return incorrectProperties() + missingProperties() + extraProperties() + mismatchedPrototype();
function analyzeKeys() {
var expectedKeys = shim.Object.keys(expected);
var actualKeys = shim.Object.keys(actual);
expectedKeys.forEach(function(key) {
if (actual.hasOwnProperty(key)) unionKeys.push(key);
else missingKeys.push(key);
});
extraKeys = actualKeys.filter(function(key) {
return (!expected.hasOwnProperty(key));
});
}
function incorrectProperties() {
return unionKeys.reduce(function(accumulated, key) {
if (ignoreLengthProperty && key === "length") return accumulated;
var diff = renderDiffWithIndent(indent, expected[key], actual[key]);
if (!diff) return accumulated;
return accumulated + "\n" + indent + key + ": " + diff;
}, "");
}
function missingProperties() {
return propertyBlock(expected, missingKeys, "missing properties");
}
function extraProperties() {
return propertyBlock(actual, extraKeys, "extra properties");
}
function propertyBlock(obj, keys, title) {
if (keys.length === 0) return "";
return "\n" + indent + "// " + title + ":" + renderProperties(oldIndent, obj, keys, false, true);
}
function mismatchedPrototype() {
var expectedProto = shim.Object.getPrototypeOf(expected);
var actualProto = shim.Object.getPrototypeOf(actual);
if (expectedProto !== actualProto) return "\n" + indent + "// objects have different prototypes";
else return "";
}
}
exports.render = function(obj) {
return renderWithIndent("", obj, false);
};
function renderWithIndent(indent, obj, collapseObjects) {
if (collapseObjects) return flatRender(obj);
else if (isArray(obj)) return arrayRender(indent, obj);
else if (isObject(obj)) return objectRender(indent, obj);
else return flatRender(obj);
}
function flatRender(obj) {
if (obj === undefined) return "undefined";
if (obj === null) return "null";
if (typeof obj === "string") {
var str = JSON.stringify(obj);
if (str.length > 61) str = str.substr(0, 60) + '"...'; // >61, not >60, because of trailing quote
return str;
}
if (isArray(obj)) {
if (obj.length === 0) return "[]";
return "[...]";
}
if (isObject(obj)) {
if (shim.Object.keys(obj).length === 0) return "{}";
else return "{...}";
}
if (isFunction(obj)) {
if (!obj.name) return "<anon>()";
else return obj.name + "()";
}
return obj.toString();
}
function arrayRender(indent, obj) {
if (obj.length === 0) return "[]";
var properties = renderProperties(indent, obj, shim.Object.keys(obj), true, false);
return "[" + properties + "\n" + indent + "]";
}
function objectRender(indent, obj) {
if (shim.Object.keys(obj).length === 0) return "{}";
var properties = renderProperties(indent, obj, shim.Object.keys(obj), false, false);
return "{" + properties + "\n" + indent + "}";
}
function renderProperties(indent, obj, keys, ignoreLengthProperty, collapseObjects) {
var newIndent = indent + INDENT_TEXT;
var properties = keys.reduce(function(accumulated, key) {
if (ignoreLengthProperty && key === "length") return accumulated;
return accumulated + "\n" + newIndent + key + ": " + renderWithIndent(newIndent, obj[key], collapseObjects);
}, "");
return properties;
}
exports.match = function(a, b) {
if (typeof a === "object" && typeof b === "object") return objectAndArrayMatch(a, b);
else return flatMatch(a, b);
};
function flatMatch(a, b) {
if (typeof a === "number" && isNaN(a)) return isNaN(b);
return a === b;
}
function objectAndArrayMatch(a, b) {
if (a === b) return true;
if (a === null) return b === null;
if (b === null) return a === null;
if (!exports.match(shim.Object.getPrototypeOf(a), shim.Object.getPrototypeOf(b))) return false;
var aKeys = shim.Object.keys(a);
var bKeys = shim.Object.keys(b);
if (aKeys.length !== bKeys.length) return false;
return shim.Array.every(aKeys, function(key) {
return exports.match(a[key], b[key]);
});
}
function isArray(obj) {
return Array.isArray(obj);
}
function isObject(obj) {
return typeof obj === "object" && obj !== null && !isArray(obj);
}
function isFunction(obj) {
return typeof obj === "function";
}
|
The fake picture was circulated after controversy ignited last week when President Donald Trump said at an Alabama rally that NFL owners should fire any "son of a bitch" who refuses to stand for the national anthem.
Trump appeared to be referencing former 49ers quarterback Colin Kaepernick, who last year knelt during the national anthem as a protest against police violence toward minorities, which inspired others to protest.
Since Trump made his comments, players, coaches, and team owners have fired back, saying the president is being divisive, and linking arms or kneeling during the anthem.
Over the weekend, Trump retweeted a tweet that implied protesters who knelt or sat during the national anthem were dishonoring veterans. Afterwards, some veterans used the hashtag #VetsForKaepernick to show theirsupport for the right to protest.
The original photo that has now been photoshopped appears to be taken from the Seattle Seahawks website and was shot by Rod Mar in 2015. It shows defensive end Michael Bennett leading his team in a victory dance in the locker room.
A lot of people online pointed out that the photo with the burning flag was obviously fake because a fire would have set off the sprinklers in the locker room.
Just two days ago, a Facebook post by a woman who said she spotted Bennett talking with a group of veterans at the side of the road started going viral. She said seeing "Michael and a veteran shaking hands and smiling" made her very emotional and she started crying. She described how Bennett came over to her, whereupon she expressed how torn she felt, and he offered her a hug. |
Q:
Public subnet routing
I have one public IP from my ISP 198.51.100.123/21 and a public 203.0.113.1/29 subnet routed by my ISP through the first IP.
OS: CentOS 7.
I want to assign each IP from the /29 subnet to a virtual NIC. How can I do that?
Thank you.
A:
This question requires some understanding of IP routing. First you need to verify that the ISP routes the IP block to the public IP address of your linux server -- which it apparently does. Next you need to enable routing on your linux server so that it can handle the packets it receives on its public interface destinated for different networks.
Finally, you can create loopback interfaces for each public IP address using the method described here.
Edited to expand on the answer as per the comments below.
|
Sorption behaviors of aromatic anions on loess soil modified with cationic surfactant.
Modification of soils with hydrophobic cationic surfactants is an effective approach for enhancing the sorptive capabilities of soil in the vadose zone for the purpose of retaining organic contaminants prior to cleanup. The objective of this study was to examine the sorptive behavior of the cationic surfactant-modified loess soil for aromatic anions in the aqueous phase in an attempt to define the sorptive mechanisms. Some dominant factors governing the sorption, such as ionic strength and divalent heavy metal cation, were investigated. The sorption isotherms of 2,4-dinitrophenol (DNP) and benzoic acid (BA) in the modified soil samples were obtained using the batch equilibration method. Under the laboratory conditions, the modified loess soil utilized in this study was prepared by replacing the cations of loess soil with a cationic surfactant-hexadecyltrimethylammonium (HDTMA) bromide. The acidic aromatic compounds, DNP and BA existing as aromatic anions in the natural mixture of loess soil and aqueous phase, were selected as indicator compounds to measured the sorption behaviors of aromatic anions on the HDTMA-modified loess soil. The results confirmed that the sorptive capabilities of aromatic anions in loess soil were greatly enhanced by modification with HDTMA. The increase of ionic strength and the addition of divalent heavy metal cation Zn(2+) significantly increased the sorption of aromatic anions on the HDTMA-modified loess soil. In binary solute systems, the sorbed amounts either of DNP or BA on the HDTMA-modified loess soil were reduced if two compounds existed simultaneously in the soil. This results indicated that competitive adsorption between the two aromatic anions occurred in soil matrix. |
Due to the lapse in appropriations, Department of Justice websites will not be regularly updated. The Department’s essential law enforcement and national security functions will continue. Please refer to the Department of Justice’s contingency plan for more information.
Ride or Die Gang Member Sentenced on Firearm and Drug Violations
U.S. Attorney Kenneth A. Polite announced that MORRIS SUMMERS, age 25, aresident of New Orleans, was sentenced today after having previously pled guilty to federal firearm and drug violations.
U.S. District Judge Susie Morgan sentenced SUMMERS to 60 months in prison, to be followed by four years of supervised release.
SUMMERS was one of twelve defendants charged with conspiring to distribute cocaine base in the St. Roch neighborhood. In addition, all twelve defendants were charged with conspiring to possess firearms in furtherance of their drug trafficking crimes. Three defendants were also charged with conspiring to violate the Racketeer Influenced Corrupt Organization Act, as well as substantive acts of violence.
To date, nine defendants charged in this case have pled guilty to various charges and have been sentenced. Co-defendant ANDREALIE LEWIS was previously sentenced to 48 months incarceration; TYONE BURTON was previously sentenced to 121 months of incarceration; ERVIN SPOONER was previously sentenced to 108 months of incarceration; PERRY WILSON was previously sentenced to 108 months of incarceration; TRE CLEMENTS was previously sentenced to 96 months of incarceration; NYSON JONESwas previously sentenced to 87 months of incarceration; ROMALIS PARKER was previously sentenced to 70 months of incarceration; and TYRONE BURTON was previously sentenced to 60 months of incarceration. Three defendants were convicted following trial and are awaiting sentencing: DELOYD JONES, a/k/a “Puggy,” age 23; BYRON JONES, a/k/a/ “Big Baby,” age 25; and SIDNEY PATTERSON, a/k/a “Duda Man,” age 24.
According to court documents and evidence presented at the above-stated trial, the defendants were members and associates of the “Ride or Die” gang, which they also referred to as “R.O.D.” The Ride or Die gang was initially formed in or about 2007 and continued to exist through in or about 2013. During the course of the federal investigation into the gang, agents learned that the defendants used a house, located at 1632 Mandeville Street, among other locations, as a base of operations to package, sell, and store narcotics, as well as store firearms.
U.S. Attorney Polite praised the work of the Bureau of Alcohol, Tobacco, Firearms and Explosives as part of the metro area’s Multi-Agency Gang Unit (MAG) in investigating this matter. As an integral component of NOLA FOR LIFE’s Group Violence Reduction Strategy, the MAG Unit consists of a partnership with New Orleans Police Department (NOPD); Orleans Parish District Attorney’s Office (DA); Orleans Parish Sheriff’s Office (OPSO); Louisiana State Police (LSP); Parole Board of the Louisiana Department of Corrections; United States Attorney’s Office (USAO); Federal Bureau of Investigation (FBI); Drug Enforcement Administration (DEA); United States Marshal’s Service (USMS); and the United States Probation & Parole Office for the Eastern District of Louisiana. Assistant United States Attorneys Nolan D. Paige and Marquest Meeks, along with former Special Assistant United States Attorney Brian Ebarb, who was assigned from the Orleans Parish District Attorney’s Office, were responsible for the prosecution. |
Missing vulture Arthur still missing despite numerous 'sightings' over a large area
A vulture that went missing after being blown away from a countryside show in Somerset last week is still at large.
Sightings of the 11-year-old bird of prey, named Arthur, have been reported across a fifty-mile area after he flew away while taking part in the opening day of the Royal Bath and West Show in Shepton Mallet.
The white-headed vulture’s owner, Birds of Prey Displays, is asking anyone who sees the bird not to approach him but to contact them instead.
He’s a 12lb vulture with a six foot wingspan – you can’t miss himBen Potter, of Birds of Prey Displays
“He’s a 12lb vulture with a six foot wingspan – you can’t miss him,” said Ben Potter, from the company.
He described Arthur as a “massive great big glove puppet of a vulture” that should be easy to spot.
“He will make himself really obvious to people because he knows people are part of his life so he will be quite visual.
Since he went missing on Wednesday June 1, Arthur has been reportedly sighted in a field in Castle Cary, as well as flying over Sparkford, where he was apparently being “harassed by two rooks”, as well as in Devizes in neighbouring Wiltshire, where he startled a driver.
“If you see it give me a call and I’ll come and get it,” said Mr Potter.
“The only thing I do ask is that people don’t go to him.
“Not because he’s dangerous – mainly because he’ll be spooked and keep moving and moving and moving.”
It has been an unlucky year for bird-related features the Bath and West show.
Organisers announced last week that up to 1,200 birds had been removed due an outbreak of infectious bronchitis, meaning the poultry competition had to be called off. |
Climate Change Impacts, Adaptation and Modelling - CCIAM
Helena Maria Santos
Post-Doc Researcher
I received a Ph.D. in Forestry from the University of Lisbon (School of Agriculture) in 2012, and I am currently working in the Climate Change Impacts, Adaptation and Modelling research group (CCIAM) of cE3c. My research focuses on climate change in agriculture and forests. For many years I have been involved in research related to forest entomology and ecology, expansion, genetics and control measures of forest pests. My current research is driven by the objective of identifying vulnerabilities of agriculture and forests to climate change and to develop adaptation strategies to climate change. |
Topological characterization of signal in brain images using min-max diagrams.
We present a novel computational framework for characterizing signal in brain images via nonlinear pairing of critical values of the signal. Among the astronomically large number of different pairings possible, we show that representations derived from specific pairing schemes provide concise representations of the image. This procedure yields a "min-max diagram" of the image data. The representation turns out to be especially powerful in discriminating image scans obtained from different clinical populations, and directly opens the door to applications in a variety of learning and inference problems in biomedical imaging. It is noticed that this strategy significantly departs from the standard image analysis paradigm--where the 'mean' signal is used to characterize an ensemble of images. This offers robustness to noise in subsequent statistical analyses, for example; however, the attenuation of the signal content due to averaging makes it rather difficult to identify subtle variations. The proposed topologically oriented method seeks to address these limitations by characterizing and encoding topological features or attributes of the image. As an application, we have used this method to characterize cortical thickness measures along brain surfaces in classifying autistic subjects. Our promising experimental results provide evidence of the power of this representation. |
Tuesday, January 25, 2011
Okay, get prepared for a major tear-jerker with this one. I first learned about this Australian couple on Oprah the other day, so some of you have probably seen a clip of this video already. For those of you who haven't, the background goes something like this. The father, Kristian, has cancer. The doctors told him he couldn't work, so the Mom, Rachel, went back to work and supports Kristian and their 2 sons by herself. For Rachel's birthday, Kristian created this video as a love letter to his wife, as a token of his appreciation for all she has done. On a side note, Rachel is from New Zealand, so the beginning of the video begins with a personal message from the Prime Minister, and then in the middle a message from Hugh Jackman, an Australian actor. So cool!!
It seriously makes me want to cry every time. It's so beautiful, and so romantic. I can only imagine what it must have felt like to watch this video love letter from your best friend. Hope you all enjoy "Rachel's birthday video"...
Wednesday, January 19, 2011
I am absolutely in love with my new necklace. It's incredibly long, and made up of beautiful granite colored beads with a few diamond accent beads. It's a custom piece from the fabulous jewelry company, Honesty, which you can see here. The designer, Nicole Jones, is the wife of Atlanta Braves baseball player Andruw Jones, and is absolutely adorable. She came and did a jewelry show at my aunt's Christmas party over the holidays, and was just so adorable to hang out with. She allowed me to pick the beads I wanted and modify one of her signature necklaces just a little bit! It's so very me, and I just adore it!! Can't wait to sport my new bling in my oh-so-glamourous-teacher life. Hey, a girl can dream, huh?
Tuesday, January 18, 2011
Back to your regularly scheduled programming here at the Kizziah Blog! This week's YouTube Tuesday is brought to you by my oh so lovely Spanish II students who manage to get their very gullible teacher off-task far too easily. Here is there Tuesday lesson?!?!? I know, I know! But it certainly won't be the last time that that the "If someone walked in my classroom right now, I'd probably be fired" thought goes through my head. Nonetheless, this is truly something. I am not sure if I am supposed to laugh, or feel some sort of sympathy for him, but I guarantee you'll spend the next 30 minutes looking for other videos by this star in the making (or is that just me???). Here is "Firework" for you viewing pleasure...
Wednesday, January 12, 2011
So it's done! Complete! Terminado! Hallelujah! My gently used brand new china hutch is in the house, painted, stocked with goodies, and I. Am. So. Relieved... and so in love. This was probably my most ambitious undertaking to date, which was only compounded by the fact that I absolutely, positively, HAD to have it complete before Christmas!! (sorry for the late posting, I've been a little lazy) This was a Craig's List find, and it definitely started a little rough...
Ugly oak, broken glass, and a busted back....but it was a GREAT deal, and my thrifty self knew it could be transformed. I guess beauty really is in the eye of the beholder :)
After A LOT of sanding, priming, and about 10 cans of spray paint, she's a new woman!
I painted the inside of the cabinets a beautiful shade of blue to highlight all of my white dishes. I also removed the side glass doors and replaced it with chicken wire that was spray painted oil rubbed bronze along with the original hardware. Then with some light distressing and some glaze, she took on a whole new life.
So what do you all think? I am so happy to have a place to store all of my beautiful wedding presents! Here is one last view in the now completed (well, minus the horrendous light fixture) dining room!
Close-up of the tablescape...
And this little cutie hiding in the corner. Not really sure what I'm going to do with her, but I luhv her!!
I'll share more on the updated curtains soon! Have a fabulous hump day!
Tuesday, January 4, 2011
I intrrupt your regularly scheduled blog post of Youtube Tuesday because I have absolutely nothing worthy of a blog post to share I wanted to share publicly my goals for 2011. Still weird to type that. 2011, 2011, 2011, 2011. It will only take me 11.5 months and several hundred voided checks later to get the year correct, and then it will be 2012. Whoa. Even weirder. I digress.
I actually really did want to write out my goals for the year. I have tried the typical New Year's Resolution more times than I can actually count, only to tire of the pressure, forget about them, or realize that I never really cared about a "resolution" to begin with. So this year, I hope to just set realistic goals for the betterment of my life, and share them with you all for some accountability :) Are you tired of my lists yet?!?! I am SOOOO Type A, I just can't help myself. I have lists floating around every room of the house. Anyway, here goes...
{1} Start Running. I want to be able to run to stay in shape, but also come to that place where I actually enjoy the activity. I always watch in awe at the women I see running. They must have so much time to think or not thing, whichever is more relaxing. So my goal is to run a 5k by the end of the year, or at least be able too, and then we'll see what happens.
{2} Drink 64 ounces of water each day. Anyone who knows me well, knows this will be QUITE the challenge.
{3} Only order water when I'm out to dinner. Primarily to cut back on the budget and on soft drink intake, but also to aide in goal #2.
{4} Read through the Bible in one year. I am already behind on the schedule, but that's why there's a whole year right?!?! Or atleast I am telling myself that. Seriously, though, I too often forget about the not so "popular" (for lack of a better word) parts of the Bible that really help paint the whole picture of just how great God's plan has been, is, and always will be.
{5} Fold the clean laundry within 1 hour of its completion in the dryer. I have developed a bad habit of leaving them in the dryer, because I already did all the work/ they are clean/ I'm lazy. The hubs and I both despise the putting away of the laundry, but I have decided that if I start the load, I will see it through to completion. Sounds so deep, huh?? Not sure if this will result in more or less laundry actually getting done :)
{6} Learn to like my hair. This has been a life-long battle for me. I wish I could say "Love" but I think that might be pushing it a little. So for now, I want to like my hair, learn to deal with its "do whatever it wants too attitude" (yes it has attitude), and accept that I just don't have super model hair like my adorable twin sissy. I like to think of it as eccentric!!
{7} Excercise 3 times a week or more. Kinda goes along with #1, but it doesn't always have to be running.
{8} Smile and Kiss the hubs when he comes home from work every day. Even if its been one of those never ending horror story kind of days, or one of those I can't believe I am picking up all YOUR crap kind of days, or I really don't feel like talking kind of days...even still I will put on my big girl panties and greet my wonderful man with a smile and a kiss.
{9} Play with Macy more. Well play might be an exxageration as she simply doesn't like to move very much, but at least I could give her a little more attention in between her snoring fests.
{10} Organize the office/junk hole/ crafting area/ tractor graveyard!!! I have plans, but gotta get on it!!
So what are your goals for the new year?? Do you think I am a crazy woman yet??
Monday, January 3, 2011
Hello long lost friends! I promise I didn't fall off the face of the planet, just disappeared to a little place I lovingly refer to as Gainesvegas (aka my home town) for the Holidays. After nearly 2 weeks of Grizwald style family bonding, the hubs and I are back to our wonderfully boring quiet home gearing up for another fun-filled work week. After today's first Monday back to work, I was definitely harshly reminded of why my body so prefers the 10 am wake-up call to the 5 am torture call :)
With all that being said, I wanted to give you all a little summary of the shenanigans that occurred in my estrogen overloaded family during the Holidays (There are 10 girls, more if you include the dogs, and only 3 males). So without further ado, I bring you the top 10 funniest moments from the 2010 Holidays...
{1} Following in our Christmas Eve tradition, I frolicked upstairs to put on my matching pajama outfit (yes, we still get matching pajamas every year) only to catch a brief glimpse in the mirror and discover that my pajama top had quite the unsightly rip stretching from armpit to belly button. Needless to say, "Santa's Elf" was not G-rated!! Thankfully great minds think a like, and so after about 10 minutes of hysterically laughing, I simply went out to my car to pull out the identical pair opened from my grandmother only hours before :)
{2} My adorable cousin, Peaches, and her friend discovered a hysterical Youtube video that they insisted on quoting every other second for the entire extent of my stay at home. The video is not exactly G-rated, so watch at your will....but if you so choose, please picture 2 teenagers parading around the house singing, "I aint got no candies for you, no cookies for you!"
{3} My husband dancing like a crazy person to Kesha's "tik tok" on the WII dance game at our neighbor's house that made me almost pee my pants. I seriously didn't think those moves were humanly possible, nor do I think that the makers of "You Can Dance 2" intended for a grown man to require an oxygen mask and a sweat rag upon completion of one level!
{4} My twin sister retelling my whole family the stories of our mom bribing us to go to her step-aerobics classes by feeding us double cheeseburgers and milkshakes in the back of the room while the rest of the 80's spandex-clad women "traveled"and "squatted"! It was absolutely hilarious complete with a remarkable imitation that would have brought out the Jane Fonda in all of us!!
{5} Anyone who knows my grandfather has most certainly been introduced to his wide array of musical "skills" including but not limited to the air horn, the air trombone, the thumb drum, and my most favorite, the whistle. You also must know that my grandfather does not easily back down from a challenge, thus brought on the Whistle War at the dinner table on Christmas Eve with my youngest sister. It was quite possibly the most scarring annoying experience of my life. We'll call it a tie since 99% of the family forced it to end before a real winner could be declared.
{6} I was feeling so proud of all my massive amounts of Christmas shopping completed, wrapped beautifully, and delivered to Gainesville, only for my sister's fiance to open up his ski clothes from me and discover that they were sized Youth Large instead of Men's Large. The look on his face was absolutely priceless as he held up what could have been capri pants if he could have fit his leg into it. Better yet, I bought him a child's size beanie as well which wouldn't even fit my little cousin. Total Embarrasment!!
{7} My baby cousin, Georgia, professing her love of Kate Gosselin to me in the Car. Here's how the conversation went....
Georgia: I Love Kate Gosselin!!
Me: You do? That's interesting.
Georgia: Yes, I simply do not know what I would do if I got to meet her. I would be completely star-stuck Tay Tay! Like I might pass out.
Me: (Trying hard not to laugh) Well Georgie, I guess you would just tell her why you like her so much.
Georgia: Where would I even start? She's a great mother, she's so beautiful, I love her show, in fact I can name all of her kids in their birth order! Kara, Maddie..... (and the list went on and on)
Me: hysterically laughing and left wondering why in the world a 10 year old would know who Kate Gosselin is, let alone be sooooo in love with her.
{8} My aunt yelling my sisters name in a crazy British/Old lady voice every time she saw her or her name was mentioned. I still have nightmares of her yelling "AAAAAANNNNNNIIIIIIIEEEEE"
{9} My twin sister, after a loooong evening, deciding that every description she gave for the rest of the night had to have 2 adjectives beginning with the same letter. Some of my favorites being, "bushy and boring" and "frisky and fabulous"!
{10} My 90 year old great-grandmother lifting my sister's shake weight over her head as my sister yell's , "C'mon Grahm, take it home with the tricep!!" You can't possibly imagine what the smallest, most frail and precious woman in the whole world looks like holding a provocatively shaped dumbbell over her head while shaking it and laughing hysterical. Pure comedy at its finest!!
Hope you all had a Merry Christmas! I'll be back with more projects and "that's what he said" this week! |
Historically our concepts of recombination have been derived from genetical studies of higher organisms. Unfortunately little biochemical information from eucaryotes about enzymes and proteins involved in recombination is known. The proposed research has as its goal the elucidation of the mechanism of genetic recombination through biochemical characterization of enzymes and proteins involved in the macromolecular DNA metabolism of a simple eucaryote. The organism selected for study is Ustilago maydis, a yeast-like fungus whose genetic system is well characterized. Enzymes likely to be involved in recombination such as deoxyribonucleases, ATPases, topoisomerases, and reannealing enzymes will be purified and characterized. Mutants known to be defective in various steps in recombination such as gene conversion and crossing over and in the overlapping areas of DNA repair and replication are available to help establish the biological role of enzymes of interest. Studies on several previously identified enzymes from Ustilago will be continued. The methods that will be used in this study include physical methods (ultracentrifugation, gel electrophoresis, electron microscopy) and biochemical methods (column chromatography of enzymes, radio labeling and purification of nucleic acids). |
536 So.2d 1105 (1988)
Nathan FLEISCHER, Appellant,
v.
HI-RISE HOMES, INC., Gerald Greenfield, George Charak and Sheldon H. Hoffman, Appellees.
No. 85-2372.
District Court of Appeal of Florida, Fourth District.
December 28, 1988.
Jerome L. Tepps of Tepps & Glerum, Fort Lauderdale, for appellant.
Larry Klein of Klein & Beranek, P.A., West Palm Beach, for appellees.
GLICKSTEIN, Judge.
This is an appeal from an award of attorney's fees of $19,000 to a broker against a purchaser. The court earlier issued an en banc opinion herein on December 14, 1988. We reverse and address some of the language in Gordon v. Bartlett, 452 So.2d 1077 (Fla. 4th DCA 1984), because the question of attorney's fees in cases purportedly arising from real property sales should be addressed as we suggest herein below.
I
We find that appellees' overview of the chronology of the case is correct. The broker's claim arose in a "counterclaim," which sought only attorney's fees. In our view, the trial court in essence properly considered it as part of the answer, and determined it after the decision on the merits. We disagree with appellant's initial contention that the claim had been stipulated out of the case, and find it was removed from the pleading, which had been a misnomer, only as a matter of judicial housekeeping.
However, we reverse the award because the provision in the deposit receipt upon which the award was based does not apply to the present litigation. That provision said:
Attorney Fees and Costs: In connection with any litigation arising out of this *1106 contract, the prevailing party whether Buyer, Seller or Broker, shall be entitled to recover all costs incurred including reasonable attorney's fees for services rendered in connection with such litigation including appellate proceedings and post judgment proceedings.
We are convinced, after requesting supplemental briefs upon the issue whether the present litigation arose out of the contract, that it did not arise out of the contract.
Appellant brought the present action, seeking damages from an attorney (not a party to this appeal) and appellees, Hi Rise Homes Inc., a real estate brokerage firm, and its agent, Gerald Greenfield. The complaint alleged that appellant enlisted the services of appellees to locate a building which could serve as an office and residence for appellant, a psychologist; that an agent located what he allegedly represented to be a property suitable for that purpose; that a real estate deposit contract and a purchase agreement contract were signed by appellant and the seller; that when appellant attempted to set up his practice he was notified by city zoning officials that he was in violation of zoning regulations; and that he ceased practice and brought this action against appellees, alleging fraud for representing that appellant could operate his practice on the property, and negligence in failing to determine the zoning of the area.
The present litigation, in our view, arose out of alleged misrepresentations and negligence, not out of the contract. See Dickson v. Dunn, 399 So.2d 447 (Fla. 5th DCA 1981). The pleadings are clear in this regard; and while appellant has not provided a transcript, we feel none is necessary, in the absence of a contention by appellees to the effect that some other issue occasioned the litigation. There are intellectual tugs in the direction of appellees here, such as the affirmative defense that the deposit receipt contract was subject to zoning, but a "defense to" is different from a "claim arising out of" at least in our view.
II
The language in Gordon v. Bartlett which we address appears on page 1078, wherein we extended the rule of Milu, Inc. v. Duke, 204 So.2d 31, 33 (Fla. 3d DCA 1967), beyond its intended application. While we were correct in the denial of attorney's fees in Gordon v. Bartlett because of the doctrine of merger discussed in Milu, we were not correct in our stated reason that the deed did not provide for an attorney's fee. Our decision was based on the decision in Espinoza v. Safeco Title Insurance Co., 598 P.2d 346 (Utah 1979); however, we failed to note that the Utah decision referred to a clause in the contract, apparently standard there, that abrogated the "Earnest Money Agreement" "[b]y execution and delivery of the final agreement, that is, the deed and policy of title insurance." Id. at 348.
Gordon involved a question of possession the sellers' wall encroached on that portion of their property which they sold to the purchasers. Accordingly, as here, the initial question in that case vis a vis attorney's fees should have been whether the dispute arose out of the parties contract. The second question, if the answer to the first query was affirmative, should have been whether the doctrine of merger would then apply not whether the deed provided for an attorney's fee.
We approve the following statements in Hutchens Brothers v. Brownsberger, 624 S.W.2d 538 (Mo. Ct. App. 1981):
The doctrine of merger, relied upon by defendant, usually is more appropriate as a matter of defense on the part of a vendor. See, Annot., 38 A.L.R.2d 1310 (1954). The essence of that doctrine is that when a vendor offers a deed and the vendee accepts, that generally constitutes a new agreement as to the form and contents of the deed which supersedes any contrary previous agreement. By reason of that underlying rationale, the doctrine is basically confined to the sufficiency of the deed itself and does not touch other aspects of the original sales agreement. Those latter aspects are generally referred to in the cases as *1107 "collateral matters" which are not affected by the doctrine of merger.
The line of demarcation between what is and is not covered by the doctrine of merger was discussed and a New York opinion quoted with approval in Frisbie v. Scott, 199 Mo. App. 131, 201 S.W. 561 (1918) as follows:
"In Bull v. Willard, supra, 9 Barb. (N.Y.) [641] at page 645, the court, in speaking of how to determine whether covenants contained in the agreement for the sale of land are collateral to those involved in the execution of the deed, or are so connected with it as to be at an end and become merged or satisfied in the execution of the deed, said:
`I have not been able to fix upon a better criterion, upon that question, than that the covenant, in order to be deemed collateral and independent, so as not to be destroyed by the execution of the deed, must not look to, or be connected with the title, possession, quantity, or emblements of the land which is the subject of the contract; and that if it does so, the execution of the deed, in pursuance of the contract, will operate as an extinguishment of it.' (Italics ours.)"
Id. at 540.
DOWNEY and ANSTEAD, JJ., concur.
|
//===-- SILowerControlFlow.cpp - Use predicates for control flow ----------===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===----------------------------------------------------------------------===//
//
/// \file
/// This pass lowers the pseudo control flow instructions to real
/// machine instructions.
///
/// All control flow is handled using predicated instructions and
/// a predicate stack. Each Scalar ALU controls the operations of 64 Vector
/// ALUs. The Scalar ALU can update the predicate for any of the Vector ALUs
/// by writting to the 64-bit EXEC register (each bit corresponds to a
/// single vector ALU). Typically, for predicates, a vector ALU will write
/// to its bit of the VCC register (like EXEC VCC is 64-bits, one for each
/// Vector ALU) and then the ScalarALU will AND the VCC register with the
/// EXEC to update the predicates.
///
/// For example:
/// %vcc = V_CMP_GT_F32 %vgpr1, %vgpr2
/// %sgpr0 = SI_IF %vcc
/// %vgpr0 = V_ADD_F32 %vgpr0, %vgpr0
/// %sgpr0 = SI_ELSE %sgpr0
/// %vgpr0 = V_SUB_F32 %vgpr0, %vgpr0
/// SI_END_CF %sgpr0
///
/// becomes:
///
/// %sgpr0 = S_AND_SAVEEXEC_B64 %vcc // Save and update the exec mask
/// %sgpr0 = S_XOR_B64 %sgpr0, %exec // Clear live bits from saved exec mask
/// S_CBRANCH_EXECZ label0 // This instruction is an optional
/// // optimization which allows us to
/// // branch if all the bits of
/// // EXEC are zero.
/// %vgpr0 = V_ADD_F32 %vgpr0, %vgpr0 // Do the IF block of the branch
///
/// label0:
/// %sgpr0 = S_OR_SAVEEXEC_B64 %exec // Restore the exec mask for the Then block
/// %exec = S_XOR_B64 %sgpr0, %exec // Clear live bits from saved exec mask
/// S_BRANCH_EXECZ label1 // Use our branch optimization
/// // instruction again.
/// %vgpr0 = V_SUB_F32 %vgpr0, %vgpr // Do the THEN block
/// label1:
/// %exec = S_OR_B64 %exec, %sgpr0 // Re-enable saved exec mask bits
//===----------------------------------------------------------------------===//
#include "AMDGPU.h"
#include "AMDGPUSubtarget.h"
#include "SIInstrInfo.h"
#include "MCTargetDesc/AMDGPUMCTargetDesc.h"
#include "llvm/ADT/SmallVector.h"
#include "llvm/ADT/StringRef.h"
#include "llvm/CodeGen/LiveIntervals.h"
#include "llvm/CodeGen/MachineBasicBlock.h"
#include "llvm/CodeGen/MachineFunction.h"
#include "llvm/CodeGen/MachineFunctionPass.h"
#include "llvm/CodeGen/MachineInstr.h"
#include "llvm/CodeGen/MachineInstrBuilder.h"
#include "llvm/CodeGen/MachineOperand.h"
#include "llvm/CodeGen/MachineRegisterInfo.h"
#include "llvm/CodeGen/Passes.h"
#include "llvm/CodeGen/SlotIndexes.h"
#include "llvm/CodeGen/TargetRegisterInfo.h"
#include "llvm/MC/MCRegisterInfo.h"
#include "llvm/Pass.h"
#include <cassert>
#include <iterator>
using namespace llvm;
#define DEBUG_TYPE "si-lower-control-flow"
namespace {
class SILowerControlFlow : public MachineFunctionPass {
private:
const SIRegisterInfo *TRI = nullptr;
const SIInstrInfo *TII = nullptr;
LiveIntervals *LIS = nullptr;
MachineRegisterInfo *MRI = nullptr;
const TargetRegisterClass *BoolRC = nullptr;
unsigned AndOpc;
unsigned OrOpc;
unsigned XorOpc;
unsigned MovTermOpc;
unsigned Andn2TermOpc;
unsigned XorTermrOpc;
unsigned OrSaveExecOpc;
unsigned Exec;
void emitIf(MachineInstr &MI);
void emitElse(MachineInstr &MI);
void emitIfBreak(MachineInstr &MI);
void emitLoop(MachineInstr &MI);
void emitEndCf(MachineInstr &MI);
Register getSaveExec(MachineInstr* MI);
void findMaskOperands(MachineInstr &MI, unsigned OpNo,
SmallVectorImpl<MachineOperand> &Src) const;
void combineMasks(MachineInstr &MI);
public:
static char ID;
SILowerControlFlow() : MachineFunctionPass(ID) {}
bool runOnMachineFunction(MachineFunction &MF) override;
StringRef getPassName() const override {
return "SI Lower control flow pseudo instructions";
}
void getAnalysisUsage(AnalysisUsage &AU) const override {
// Should preserve the same set that TwoAddressInstructions does.
AU.addPreserved<SlotIndexes>();
AU.addPreserved<LiveIntervals>();
AU.addPreservedID(LiveVariablesID);
AU.addPreservedID(MachineLoopInfoID);
AU.addPreservedID(MachineDominatorsID);
AU.setPreservesCFG();
MachineFunctionPass::getAnalysisUsage(AU);
}
};
} // end anonymous namespace
char SILowerControlFlow::ID = 0;
INITIALIZE_PASS(SILowerControlFlow, DEBUG_TYPE,
"SI lower control flow", false, false)
static void setImpSCCDefDead(MachineInstr &MI, bool IsDead) {
MachineOperand &ImpDefSCC = MI.getOperand(3);
assert(ImpDefSCC.getReg() == AMDGPU::SCC && ImpDefSCC.isDef());
ImpDefSCC.setIsDead(IsDead);
}
char &llvm::SILowerControlFlowID = SILowerControlFlow::ID;
static bool isSimpleIf(const MachineInstr &MI, const MachineRegisterInfo *MRI,
const SIInstrInfo *TII) {
Register SaveExecReg = MI.getOperand(0).getReg();
auto U = MRI->use_instr_nodbg_begin(SaveExecReg);
if (U == MRI->use_instr_nodbg_end() ||
std::next(U) != MRI->use_instr_nodbg_end() ||
U->getOpcode() != AMDGPU::SI_END_CF)
return false;
// Check for SI_KILL_*_TERMINATOR on path from if to endif.
// if there is any such terminator simplififcations are not safe.
auto SMBB = MI.getParent();
auto EMBB = U->getParent();
DenseSet<const MachineBasicBlock*> Visited;
SmallVector<MachineBasicBlock*, 4> Worklist(SMBB->succ_begin(),
SMBB->succ_end());
while (!Worklist.empty()) {
MachineBasicBlock *MBB = Worklist.pop_back_val();
if (MBB == EMBB || !Visited.insert(MBB).second)
continue;
for(auto &Term : MBB->terminators())
if (TII->isKillTerminator(Term.getOpcode()))
return false;
Worklist.append(MBB->succ_begin(), MBB->succ_end());
}
return true;
}
Register SILowerControlFlow::getSaveExec(MachineInstr *MI) {
MachineBasicBlock *MBB = MI->getParent();
MachineOperand &SaveExec = MI->getOperand(0);
assert(SaveExec.getSubReg() == AMDGPU::NoSubRegister);
Register SaveExecReg = SaveExec.getReg();
unsigned FalseTermOpc =
TII->isWave32() ? AMDGPU::S_MOV_B32_term : AMDGPU::S_MOV_B64_term;
MachineBasicBlock::iterator I = (MI);
MachineBasicBlock::iterator J = std::next(I);
if (J != MBB->end() && J->getOpcode() == FalseTermOpc &&
J->getOperand(1).isReg() && J->getOperand(1).getReg() == SaveExecReg) {
SaveExecReg = J->getOperand(0).getReg();
J->eraseFromParent();
}
return SaveExecReg;
}
void SILowerControlFlow::emitIf(MachineInstr &MI) {
MachineBasicBlock &MBB = *MI.getParent();
const DebugLoc &DL = MI.getDebugLoc();
MachineBasicBlock::iterator I(&MI);
Register SaveExecReg = getSaveExec(&MI);
MachineOperand& Cond = MI.getOperand(1);
assert(Cond.getSubReg() == AMDGPU::NoSubRegister);
MachineOperand &ImpDefSCC = MI.getOperand(4);
assert(ImpDefSCC.getReg() == AMDGPU::SCC && ImpDefSCC.isDef());
// If there is only one use of save exec register and that use is SI_END_CF,
// we can optimize SI_IF by returning the full saved exec mask instead of
// just cleared bits.
bool SimpleIf = isSimpleIf(MI, MRI, TII);
// Add an implicit def of exec to discourage scheduling VALU after this which
// will interfere with trying to form s_and_saveexec_b64 later.
Register CopyReg = SimpleIf ? SaveExecReg
: MRI->createVirtualRegister(BoolRC);
MachineInstr *CopyExec =
BuildMI(MBB, I, DL, TII->get(AMDGPU::COPY), CopyReg)
.addReg(Exec)
.addReg(Exec, RegState::ImplicitDefine);
Register Tmp = MRI->createVirtualRegister(BoolRC);
MachineInstr *And =
BuildMI(MBB, I, DL, TII->get(AndOpc), Tmp)
.addReg(CopyReg)
.add(Cond);
setImpSCCDefDead(*And, true);
MachineInstr *Xor = nullptr;
if (!SimpleIf) {
Xor =
BuildMI(MBB, I, DL, TII->get(XorOpc), SaveExecReg)
.addReg(Tmp)
.addReg(CopyReg);
setImpSCCDefDead(*Xor, ImpDefSCC.isDead());
}
// Use a copy that is a terminator to get correct spill code placement it with
// fast regalloc.
MachineInstr *SetExec =
BuildMI(MBB, I, DL, TII->get(MovTermOpc), Exec)
.addReg(Tmp, RegState::Kill);
// Insert a pseudo terminator to help keep the verifier happy. This will also
// be used later when inserting skips.
MachineInstr *NewBr = BuildMI(MBB, I, DL, TII->get(AMDGPU::SI_MASK_BRANCH))
.add(MI.getOperand(2));
if (!LIS) {
MI.eraseFromParent();
return;
}
LIS->InsertMachineInstrInMaps(*CopyExec);
// Replace with and so we don't need to fix the live interval for condition
// register.
LIS->ReplaceMachineInstrInMaps(MI, *And);
if (!SimpleIf)
LIS->InsertMachineInstrInMaps(*Xor);
LIS->InsertMachineInstrInMaps(*SetExec);
LIS->InsertMachineInstrInMaps(*NewBr);
LIS->removeAllRegUnitsForPhysReg(AMDGPU::EXEC);
MI.eraseFromParent();
// FIXME: Is there a better way of adjusting the liveness? It shouldn't be
// hard to add another def here but I'm not sure how to correctly update the
// valno.
LIS->removeInterval(SaveExecReg);
LIS->createAndComputeVirtRegInterval(SaveExecReg);
LIS->createAndComputeVirtRegInterval(Tmp);
if (!SimpleIf)
LIS->createAndComputeVirtRegInterval(CopyReg);
}
void SILowerControlFlow::emitElse(MachineInstr &MI) {
MachineBasicBlock &MBB = *MI.getParent();
const DebugLoc &DL = MI.getDebugLoc();
Register DstReg = getSaveExec(&MI);
bool ExecModified = MI.getOperand(3).getImm() != 0;
MachineBasicBlock::iterator Start = MBB.begin();
// We are running before TwoAddressInstructions, and si_else's operands are
// tied. In order to correctly tie the registers, split this into a copy of
// the src like it does.
Register CopyReg = MRI->createVirtualRegister(BoolRC);
MachineInstr *CopyExec =
BuildMI(MBB, Start, DL, TII->get(AMDGPU::COPY), CopyReg)
.add(MI.getOperand(1)); // Saved EXEC
// This must be inserted before phis and any spill code inserted before the
// else.
Register SaveReg = ExecModified ?
MRI->createVirtualRegister(BoolRC) : DstReg;
MachineInstr *OrSaveExec =
BuildMI(MBB, Start, DL, TII->get(OrSaveExecOpc), SaveReg)
.addReg(CopyReg);
MachineBasicBlock *DestBB = MI.getOperand(2).getMBB();
MachineBasicBlock::iterator ElsePt(MI);
if (ExecModified) {
MachineInstr *And =
BuildMI(MBB, ElsePt, DL, TII->get(AndOpc), DstReg)
.addReg(Exec)
.addReg(SaveReg);
if (LIS)
LIS->InsertMachineInstrInMaps(*And);
}
MachineInstr *Xor =
BuildMI(MBB, ElsePt, DL, TII->get(XorTermrOpc), Exec)
.addReg(Exec)
.addReg(DstReg);
MachineInstr *Branch =
BuildMI(MBB, ElsePt, DL, TII->get(AMDGPU::SI_MASK_BRANCH))
.addMBB(DestBB);
if (!LIS) {
MI.eraseFromParent();
return;
}
LIS->RemoveMachineInstrFromMaps(MI);
MI.eraseFromParent();
LIS->InsertMachineInstrInMaps(*CopyExec);
LIS->InsertMachineInstrInMaps(*OrSaveExec);
LIS->InsertMachineInstrInMaps(*Xor);
LIS->InsertMachineInstrInMaps(*Branch);
// src reg is tied to dst reg.
LIS->removeInterval(DstReg);
LIS->createAndComputeVirtRegInterval(DstReg);
LIS->createAndComputeVirtRegInterval(CopyReg);
if (ExecModified)
LIS->createAndComputeVirtRegInterval(SaveReg);
// Let this be recomputed.
LIS->removeAllRegUnitsForPhysReg(AMDGPU::EXEC);
}
void SILowerControlFlow::emitIfBreak(MachineInstr &MI) {
MachineBasicBlock &MBB = *MI.getParent();
const DebugLoc &DL = MI.getDebugLoc();
auto Dst = getSaveExec(&MI);
// Skip ANDing with exec if the break condition is already masked by exec
// because it is a V_CMP in the same basic block. (We know the break
// condition operand was an i1 in IR, so if it is a VALU instruction it must
// be one with a carry-out.)
bool SkipAnding = false;
if (MI.getOperand(1).isReg()) {
if (MachineInstr *Def = MRI->getUniqueVRegDef(MI.getOperand(1).getReg())) {
SkipAnding = Def->getParent() == MI.getParent()
&& SIInstrInfo::isVALU(*Def);
}
}
// AND the break condition operand with exec, then OR that into the "loop
// exit" mask.
MachineInstr *And = nullptr, *Or = nullptr;
if (!SkipAnding) {
And = BuildMI(MBB, &MI, DL, TII->get(AndOpc), Dst)
.addReg(Exec)
.add(MI.getOperand(1));
Or = BuildMI(MBB, &MI, DL, TII->get(OrOpc), Dst)
.addReg(Dst)
.add(MI.getOperand(2));
} else
Or = BuildMI(MBB, &MI, DL, TII->get(OrOpc), Dst)
.add(MI.getOperand(1))
.add(MI.getOperand(2));
if (LIS) {
if (And)
LIS->InsertMachineInstrInMaps(*And);
LIS->ReplaceMachineInstrInMaps(MI, *Or);
}
MI.eraseFromParent();
}
void SILowerControlFlow::emitLoop(MachineInstr &MI) {
MachineBasicBlock &MBB = *MI.getParent();
const DebugLoc &DL = MI.getDebugLoc();
MachineInstr *AndN2 =
BuildMI(MBB, &MI, DL, TII->get(Andn2TermOpc), Exec)
.addReg(Exec)
.add(MI.getOperand(0));
MachineInstr *Branch =
BuildMI(MBB, &MI, DL, TII->get(AMDGPU::S_CBRANCH_EXECNZ))
.add(MI.getOperand(1));
if (LIS) {
LIS->ReplaceMachineInstrInMaps(MI, *AndN2);
LIS->InsertMachineInstrInMaps(*Branch);
}
MI.eraseFromParent();
}
void SILowerControlFlow::emitEndCf(MachineInstr &MI) {
MachineBasicBlock &MBB = *MI.getParent();
MachineRegisterInfo &MRI = MBB.getParent()->getRegInfo();
unsigned CFMask = MI.getOperand(0).getReg();
MachineInstr *Def = MRI.getUniqueVRegDef(CFMask);
const DebugLoc &DL = MI.getDebugLoc();
MachineBasicBlock::iterator InsPt =
Def && Def->getParent() == &MBB ? std::next(MachineBasicBlock::iterator(Def))
: MBB.begin();
MachineInstr *NewMI = BuildMI(MBB, InsPt, DL, TII->get(OrOpc), Exec)
.addReg(Exec)
.add(MI.getOperand(0));
if (LIS)
LIS->ReplaceMachineInstrInMaps(MI, *NewMI);
MI.eraseFromParent();
if (LIS)
LIS->handleMove(*NewMI);
}
// Returns replace operands for a logical operation, either single result
// for exec or two operands if source was another equivalent operation.
void SILowerControlFlow::findMaskOperands(MachineInstr &MI, unsigned OpNo,
SmallVectorImpl<MachineOperand> &Src) const {
MachineOperand &Op = MI.getOperand(OpNo);
if (!Op.isReg() || !Register::isVirtualRegister(Op.getReg())) {
Src.push_back(Op);
return;
}
MachineInstr *Def = MRI->getUniqueVRegDef(Op.getReg());
if (!Def || Def->getParent() != MI.getParent() ||
!(Def->isFullCopy() || (Def->getOpcode() == MI.getOpcode())))
return;
// Make sure we do not modify exec between def and use.
// A copy with implcitly defined exec inserted earlier is an exclusion, it
// does not really modify exec.
for (auto I = Def->getIterator(); I != MI.getIterator(); ++I)
if (I->modifiesRegister(AMDGPU::EXEC, TRI) &&
!(I->isCopy() && I->getOperand(0).getReg() != Exec))
return;
for (const auto &SrcOp : Def->explicit_operands())
if (SrcOp.isReg() && SrcOp.isUse() &&
(Register::isVirtualRegister(SrcOp.getReg()) || SrcOp.getReg() == Exec))
Src.push_back(SrcOp);
}
// Search and combine pairs of equivalent instructions, like
// S_AND_B64 x, (S_AND_B64 x, y) => S_AND_B64 x, y
// S_OR_B64 x, (S_OR_B64 x, y) => S_OR_B64 x, y
// One of the operands is exec mask.
void SILowerControlFlow::combineMasks(MachineInstr &MI) {
assert(MI.getNumExplicitOperands() == 3);
SmallVector<MachineOperand, 4> Ops;
unsigned OpToReplace = 1;
findMaskOperands(MI, 1, Ops);
if (Ops.size() == 1) OpToReplace = 2; // First operand can be exec or its copy
findMaskOperands(MI, 2, Ops);
if (Ops.size() != 3) return;
unsigned UniqueOpndIdx;
if (Ops[0].isIdenticalTo(Ops[1])) UniqueOpndIdx = 2;
else if (Ops[0].isIdenticalTo(Ops[2])) UniqueOpndIdx = 1;
else if (Ops[1].isIdenticalTo(Ops[2])) UniqueOpndIdx = 1;
else return;
Register Reg = MI.getOperand(OpToReplace).getReg();
MI.RemoveOperand(OpToReplace);
MI.addOperand(Ops[UniqueOpndIdx]);
if (MRI->use_empty(Reg))
MRI->getUniqueVRegDef(Reg)->eraseFromParent();
}
bool SILowerControlFlow::runOnMachineFunction(MachineFunction &MF) {
const GCNSubtarget &ST = MF.getSubtarget<GCNSubtarget>();
TII = ST.getInstrInfo();
TRI = &TII->getRegisterInfo();
// This doesn't actually need LiveIntervals, but we can preserve them.
LIS = getAnalysisIfAvailable<LiveIntervals>();
MRI = &MF.getRegInfo();
BoolRC = TRI->getBoolRC();
if (ST.isWave32()) {
AndOpc = AMDGPU::S_AND_B32;
OrOpc = AMDGPU::S_OR_B32;
XorOpc = AMDGPU::S_XOR_B32;
MovTermOpc = AMDGPU::S_MOV_B32_term;
Andn2TermOpc = AMDGPU::S_ANDN2_B32_term;
XorTermrOpc = AMDGPU::S_XOR_B32_term;
OrSaveExecOpc = AMDGPU::S_OR_SAVEEXEC_B32;
Exec = AMDGPU::EXEC_LO;
} else {
AndOpc = AMDGPU::S_AND_B64;
OrOpc = AMDGPU::S_OR_B64;
XorOpc = AMDGPU::S_XOR_B64;
MovTermOpc = AMDGPU::S_MOV_B64_term;
Andn2TermOpc = AMDGPU::S_ANDN2_B64_term;
XorTermrOpc = AMDGPU::S_XOR_B64_term;
OrSaveExecOpc = AMDGPU::S_OR_SAVEEXEC_B64;
Exec = AMDGPU::EXEC;
}
MachineFunction::iterator NextBB;
for (MachineFunction::iterator BI = MF.begin(), BE = MF.end();
BI != BE; BI = NextBB) {
NextBB = std::next(BI);
MachineBasicBlock &MBB = *BI;
MachineBasicBlock::iterator I, Next, Last;
for (I = MBB.begin(), Last = MBB.end(); I != MBB.end(); I = Next) {
Next = std::next(I);
MachineInstr &MI = *I;
switch (MI.getOpcode()) {
case AMDGPU::SI_IF:
emitIf(MI);
break;
case AMDGPU::SI_ELSE:
emitElse(MI);
break;
case AMDGPU::SI_IF_BREAK:
emitIfBreak(MI);
break;
case AMDGPU::SI_LOOP:
emitLoop(MI);
break;
case AMDGPU::SI_END_CF:
emitEndCf(MI);
break;
case AMDGPU::S_AND_B64:
case AMDGPU::S_OR_B64:
case AMDGPU::S_AND_B32:
case AMDGPU::S_OR_B32:
// Cleanup bit manipulations on exec mask
combineMasks(MI);
Last = I;
continue;
default:
Last = I;
continue;
}
// Replay newly inserted code to combine masks
Next = (Last == MBB.end()) ? MBB.begin() : Last;
}
}
return true;
}
|
With the Denver Broncos officially relieving Vance Joseph of his duties on Monday, the search for the next head coach has officially begun.
“We like to get things going as fast as we can,” John Elway told reporters. “When there’s competition out there, there’s always urgency to get in, get there and be as quick as we can. But, we also want to be very thorough in the search too.”
A few of the rumored candidates at this point in time are Bears defensive coordinator Vic Fangio, Steelers offensive line coach Mike Munchak, Patriots defensive coordinator Brian Flores, Rams quarterback coach Zac Taylor, former Packers head coach Mike McCarthy and former Colts head coach Chuck Pagano.
“I hope that we can hire a guy that can be here for the next 10 years, 15 years,” Elway said.”But it’s a tough league, and this league is about parity. It’s about creating that and when you’re good at some point in time, it’s going to catch up to you and that’s the great challenge.”
When asked if the Broncos would consider making a trade for Ravens head coach John Harbaugh, Elway said on Monday that the Broncos are up for exploring all avenues. But, according to Broncos insider Mike Klis, Denver would not be willing to include the No. 10 pick in a move for the veteran head coach.
Considering the Ravens are reportedly looking to receive two first round picks in exchange for Harbaugh, it seems unlikely that the 56-year old coach will be in Denver next season, especially if the Broncos are unwilling to include its 2019 first round pick. Though, anything is possible.
“I always listen to everything,” Elway said.
Whether it ends up being Harbaugh or any of the other various candidates, whoever land the job will have serious pressure to right the ship. After two years of underperforming, Broncos Country will accept nothing short of a return to dominance in the ensuing seasons. |
Image copyright AFP
When Libyan rebels celebrated the death of Muammar Gaddafi, the colonel's gold-plated pistol was held up as a symbol of their victory - I watched as they passed it among themselves. Four years on, I've been back to Libya to find the man with the golden gun.
On my mobile phone I have a picture I took in Libya on 20 October 2011. It shows a young man in a blue shirt and a New York Yankees baseball cap. He's smiling, being carried on the shoulders of his comrades through the town of Sirte.
These men are rebel fighters from Misrata. Col Gaddafi has just been captured and killed. In the photo you can see them passing among themselves a golden pistol.
It was Gaddafi's personal handgun. In that moment it became a totem - a symbol of the rebels' victory, and of a transfer of power in a new Libya.
Image copyright AFP
Just over four years later, the country is in turmoil. Rival governments - backed by their own militias - are vying for control. Libya is fragmenting along ideological and geographical lines - east versus west, Islamist versus secularist.
The group that calls itself Islamic State is exploiting the power vacuum and has taken control of Gaddafi's hometown of Sirte.
Amid this turmoil, I've returned to Misrata. Two-hundred kilometres east of Tripoli, the city now functions as a semi-independent city state. I'm looking for the man with the golden gun. I want to know what has become of him and the other fighters who captured Gaddafi.
Image caption Gabriel Gatehouse met Anwar Suwan in 2011
My first visit is to an old contact - Anwar Suwan. He was a key figure in Misrata during the revolution. When Gaddafi was killed, fighters brought his body to Anwar, and Anwar put the corpse on public display in a large refrigerated meat locker.
Anwar's base is still much as it was during those heady days - a collection of semi-furnished shipping containers on a strip of land near the coast, overlooking the Mediterranean.
We arrive at night. It's raining and bitterly cold. There's been a power cut, so we huddle round the coals of a brazier in the dark, drinking hot, sweet tea.
"The situation is not good," says Anwar, as we look at old photographs and remember happier days.
"They cut off the head of the snake, Gaddafi. But now there are hundreds of snakes replacing him. We are still fighting for the same thing - to find a just ruler for Libya. But everyone wants to rule. There are guns everywhere. What a situation!"
Find out more
Gabriel Gatehouse's report The Hunt for the Golden Gun is broadcast on Newsnight on Wednesday 3 February at 22:30 GMT on BBC Two
A longer version can be seen on Our World on the BBC News Channel and BBC World News (click for transmission times). Readers in the UK can watch it after 04:30 GMT on Saturday on the BBC iPlayer.
I tell Anwar I'm looking for one specific gun: Gaddafi's golden pistol.
He mentions the name Omran Shabaan - one of the fighters who captured Gaddafi. In some of the shaky footage of that event, filmed on the mobile phones of the rebels, Shabaan can be heard trying to stop the mob from killing Gaddafi.
Media playback is unsupported on your device Media caption Previously unseen footage of the moments just after Gaddafi's capture in 2011
Another man who was there that day, Ayman Almani, shows me the footage he shot - never played in public before. It shows the dictator's final moments more clearly than ever - he can be seen bleeding and pleading.
"He deserved it," says Ayman, looking back on it now. "Islam teaches us not to mistreat a prisoner, not to bear a grudge. But the people got carried away in the stampede and no-one could stop them."
Omran Shabaan became a hero. He was photographed with the golden gun, and came to personify the hope that Libyans could heal their wounds after months of bitter fighting. It was not to be.
In 2012, Shabaan himself was captured by Gaddafi loyalists in the town of Bani Walid. They beat him and tortured him. By the time the Misratans negotiated his release it was too late. He died of his injuries in a French hospital.
Anwar Suwan tells me he thinks Shabaan may have had the gun with him when he was taken. Perhaps the gun was now back in the hands of Gaddafi loyalists?
Then I show him and his comrades my picture of the man in the baseball cap.
"Mohammed Elbibi," someone recognises him. That was indeed the name I had used in the report I filed to London on that day back in 2011.
Anwar says he doesn't know what has become of Mohammed. But he promises to find out.
Image caption Nabil Derwish showed Gabriel Gatehouse the gun in 2011
Another contact, who also handled the gun, thinks the pistol is still in the city, but he doesn't know who has it.
Finally, I get hold of a phone number for Mohammed Elbibi and he agrees to meet me in his home in the centre of the city.
We sit down and I show him the picture of himself with the golden gun.
"I remember," he smiles. "I was 17 years old!"
He tells me he had nothing to do with the lynching of Gaddafi. He simply found the colonel's gun lying on the ground near the place where he was caught. But, in the confusion of the moment, and seeing him with the gun, the other rebels thought it was Mohammed who had killed him. He became the accidental hero of the revolution.
"What about the gun?" I ask him. It turns out he still has it. He shows it to me - it's a 9mm Browning handgun, gold-plated and decorated with an elaborate floral pattern.
It appears to have been a gift - Mohammed believes from one of Gaddafi's sons - on the occasion of the 32nd anniversary of the revolution that brought him to power. Almost exactly 10 years later, pictures of Mohammed Elbibi brandishing that same pistol would signal the final end to the Gaddafi era.
Image caption Gabriel Gatehouse finally finds Gaddafi's golden gun again
But Mohammed is wary of his trophy. There are still Gaddafi loyalists out there, and he has received death threats.
"Please tell the world it was not me who killed Gaddafi," he says.
Did he imagine that, nearly five years later, Libya would still be at war with itself?
"I did not," he says. "I am really sad about that. When I see Libyans killing Libyans, it's too bad. Everybody wants to be like Gaddafi."
Media playback is unsupported on your device Media caption Watch Gabriel Gatehouse's full report for Newsnight
Subscribe to the BBC News Magazine's email newsletter to get articles sent to your inbox. |
OpenOffice.org to use GStreamer for Multimedia
Previously OpenOffice.org used Sun's Java Media Framework to play back audio and video in documents. It seemed to work well for a while, but as time went on Java became more outdated. So, developers have decided to implement the widely used GStreamer framework.
Java was problematic for customers because many distributions did not include it in default installs and almost as many didn't offer it in repositories. It could also be inconvenient or difficult for users to properly install themselves for use with OpenOffice.org. Then over time Java grew behind industry standards in decoder support as well. OpenOffice.org developers knew they needed to find a general purpose multi-platform framework available to the majority of Linux users. They found GSteamer to be a very good choice.
GSteamer and its libraries are installed by default on many distributions, like Ubuntu and its derivatives, and is contained in the repository of many others. It has become very stable in recent versions and supports most multimedia codecs. If already installed, users need not take any further action to enjoy the benefits of GStreamer in OpenOffice.org, one of which is much better performance. Distribution developers can disable this support by choice if desired and cause OpenOffice.org to revert to using Java.
OpenOffice.org developers state this action is in "answer to a lot of feedback we received from SOHO as well as enterprise customers in the past." They are confident that using GStreamer will bring multimedia support to more customers as well as offering them more complete, stable, and modern supprt.
Hussam, this isn't those patches. The OracleSun OO.o team has decided, very belatedly, to re-implement exactly the same thing with their own code, and is announcing it with no reference to the existing work which everyone else uses in order to get stories like this one printed... |
Hotel Amenities
Hotel Amenities
Dining options at the hotel include a restaurant, a coffee shop/café, and a snack bar/deli. Guests can unwind with a drink at one of the hotel's bars, which include a poolside bar and a bar/lounge. This 3-star property offers access to a business center and meeting rooms.
Public areas are equipped with complimentary high-speed wireless Internet access. This business-friendly hotel also offers a seasonal outdoor pool, multilingual staff, and laundry facilities. Parking is available onsite for a surcharge. |
If this is your first visit, be sure to
check out the FAQ by clicking the
link above. You may have to register
before you can post: click the register link above to proceed. To start viewing messages,
select the forum that you want to visit from the selection below.
Fat Bastard on a Supersport
Im 5ft 8", and 123kg... and itching at the thought of an 07/08 r6 as my next bike.
If im brutally honest, 99% of its use will be a 25min commute to/from work, the rest just staring at it. We will hopefully get a track here in the next year or 3, but thats still pipe dreams.
Experience wise, i grew up with dirtbikes, and spent a couple of years with my Triumph Bonneville, but tbh i wasn't home often enough to say it got lots of use. I did however get used to it enough to notice the lack of power.
I have a 250 at the moment but its not on the road yet, so in reality i haven't ridden regularly in about 3 years.
Is this the dumbest idea imaginable? I'm well aware that im buying a bike completely unsuitable for its intended use, but i fucking want one, and to me thats a damn good reason to justify something as selfish as a bike.
tldr; im short, fat, and out of practice. will an r6 be a miserable experience?
'67 Volkswagen Beetle 1300cc
'09 VE SS
Originally Posted by Scrad
You are like some sort of car rapist, Sticking things where they don't belong, and often don't fit nicely
tldr; im short, fat, and out of practice. will an r6 be a miserable experience?
Try one.
Modern sports bikes seem to be built for midget gymnasts.
"Where can we get hold of a Vincent Black Shadow?" "Whats that?" "A fantastic bike," I said. "The new model is something like two thousand cubic inches, developing two hundred brake-horsepower at four thousand revolutions per minute on a magnesium frame with two styrofoam seats and a total curb weight of exactly two hundred pounds."
Sportbike is actually perfect for a 25 min commute although on an R1 or similar it'll be more like 14 mins.
Most of the Jap litre bikes are pretty comfy. Ducatis and Aprilias aren't. Some are reasonably high, you may struggle to get your feet flat on some of the taller bikes. Your weight will help compress the suspension a little though.
In saying that, if you do get something... get a suspension guru change the springs out for something heavier so you still get optimal sag and normal suspension behaviour (no bottoming out etc).
Will you die? Well... bikes are only as fast as you want them to be. An R1 doesn't pull the throttle on for you... it does offer eleventy times the performance of anything you've ridden though. So look, yes you might die. But have you ever truly lived? You're about to.
Randy De Puniet has had more crashes than any other rider in the history of Grand Prix motorcycle racing.
"Where can we get hold of a Vincent Black Shadow?" "Whats that?" "A fantastic bike," I said. "The new model is something like two thousand cubic inches, developing two hundred brake-horsepower at four thousand revolutions per minute on a magnesium frame with two styrofoam seats and a total curb weight of exactly two hundred pounds."
900 is getting up there for power for a bloke who's most powerful bike was a bonneville 790 though isnt it?
they only go as fast as you twist the throttle.
"Where can we get hold of a Vincent Black Shadow?" "Whats that?" "A fantastic bike," I said. "The new model is something like two thousand cubic inches, developing two hundred brake-horsepower at four thousand revolutions per minute on a magnesium frame with two styrofoam seats and a total curb weight of exactly two hundred pounds."
I'd prefer to have one with ABS. If you're never going to use it for fun, and just traffic the 600cc would be tops - but if you're even remotely going to ride for the sake of riding - get a litre bike.
Ps. +1 on the Aprilia. I'm 5ft 11 (110kg) and almost on tippy toes... Ducati not much better, but the Ninja's are very very low. |
Neurobiologist and Dementia Researcher Is New Einstein Professor
Professor Stephan Sigrist Can Expand His Research Group at Freie Universität Berlin and the NeuroCure Cluster of Excellence
№ 290/2014 from Aug 13, 2014
Stephan Sigrist, a professor of genetics at Freie Universität Berlin, is being supported by the Berlin Einstein Foundation, so that he can increase the size of his lab, where a multidisciplinary team of neuroscientists and geneticists does research together. Sigrist is one of the leading experts in the field of cellular and molecular organization of the nervous system. Recently his research has contributed to a better understanding of degenerative diseases of the central nervous system, particularly age-related dementia. A biochemist, Sigrist has been courted by top universities around the world for some time. Thanks to the Einstein Professorship, this internationally sought-after researcher will continue to work in Berlin.
Sigrist has been a professor of genetics at Freie Universität Berlin since 2008. He is a member of the NeuroCure Cluster of Excellence, a neuroscience research consortium involving scientists from Freie Universität, Humboldt-Universität, Charité, and three non-university research institutions. He has been a member of the board of directors of NeuroCure since 2009. In addition to his fundamental research, Sigrist would also like to develop therapies against age-related diseases of the nervous system. He says, "We hope that our research will help contribute to the development of simple, but effective treatment options in the future."
Sigrist gained an international reputation through his analysis of synapses with high-resolution light microscopy. His research made it possible to observe the structure and function of the synapses of a living fly at the nanometer scale. Sigrist and his team hope to shed light on fundamental issues pertaining to the nervous system, for example, how the nervous system evolves and adapts to its changing environment – even during the aging process of the organism.
Sigrist says that his research benefits from the numerous opportunities for cooperation that present themselves in Berlin. As he says, a fascinating community in neuroscience has developed here in recent years, which is also strongly perceived internationally. The excellent opportunities for cooperating with colleagues working in neurological fields give Berlin a great locational advantage.
Sigrist first came to appreciate Berlin while he was a student at Technische Universität Berlin. He earned his doctorate in Tübingen and then led a junior research group of the Max Planck Society at the European Neuroscience Institute in Göttingen. Later, Sigrist worked as a professor in Würzburg, before accepting his appointment as a professor in Berlin.
Now he is one of 13 outstanding researchers being given additional funding by the Einstein Foundation Berlin as Einstein Professors. Currently there are four professorships at Freie Universität that are made possible by generous funding through the Einstein Foundation. They include the mathematician Prof. Dr. Hélène Esnault and the professor of North American studies, Prof. Dr. Frank Kelleter. Sigrist's Einstein Professorship is financed by the Damp Foundation (Damp-Stiftung). |
Networker
The Networker software can be accessed by issuing the following command as the root user.
export DISPLAY=clientpc:0.0
networker
Once the GUI has run you can use it to define devices, label and mount tapes etc. The scripts used later assume that the
necessary tape devices have been defined and the tape being mounted is already labelled.
RMAN Tape Backups
Once the LSSV software is installed RMAN backups to tape can be done by defining the default device type as follows.
Once this parameter is defined RMAN uses the libobk.so library as the media manager by default. In this way RMAN is able to work with any supported third party media manager by simply creating a symbolic link called libobk.so which points to the vendors media management library, in this case liblsm.so.
A tape backup can be done using a script like the following which is run from root. |
Q:
Order of carriage return and new line feed
Is it important to have the correct order of carriage return then new line feed? For text editors does it matter in what order they appear?
For example instead of
\r\n
this
\n\r
Seems like Jeff has allready writen up a very nice Blog Post on the subject.
A:
The traditional order, when both control characters are used, is Carriage Return, then Line Feed.
The reason for this goes back to the old ASR-33 Teletype.
When a Carriage Return is issued to an ASR-33, the print head, if it is near the right margin, takes over a tenth of a second to return to the left margin, plus there is a bit of "bounce" when the left margin is hit.
If the order were Line Feed, then Carriage Return, the first printed character might occur a tenth of a second after the Carriage Return, and thus might end up printing (as a smear) halfway across the page. But if Line Feed comes after Carriage Return then the time taken by the Line Feed provides extra time for the print head to complete it's trip.
Some systems (I'm thinking the old Xerox Sigma 7 OS, eg) do Line Feed then Carriage Return, but they inject, eg, NULL characters into the data stream to allow the print head to do it's thing.
And, of course, when you get to faster devices (some early 30 CPS teleprinters, eg), the problem gets worse and a more complex strategy is required.
(There is also the point that, for user input, the Carriage Return is provided by the user pressing the Return key, while the Line Feed must be provided by the computer. For this reason it was often the "style" to have normal print lines begin with Line Feed and end with Carriage Return. A prompt for user input, then, consisted only of a Line Feed, while the user input ended with the Carriage Return. This scheme worked well when used consistently, but of course that didn't always happen.)
A:
There are three common linefeed formats:
\r\n for the DOS\Windows world
\r for the pre-OSX Mac world
\n for the Unix and Unix-like world
\n\r is not a standard anywhere that I'm aware of and will likely result in your editor thinking that it has a Unix-format text file, and then it'll display the weird \r character as text.
Historically, \r translates to carriage return (CR, ASCII code 13) which refers to old school typewriter, where you would push the carriage back to the left to return the cursor back to the start of the line. \n translates to line feed (LF, ASCII code 10) which moves the character down the page one character. Although potentially interesting, it generally doesn't matter — just use the appropriate linefeed format for your current platform.
A:
As just a follow up on the Carriage Return, then Line Feed research pot.
With NotePad it detects when a end-of-line when it finds the character CR+LF. This is the general format used by CP/M, MS-DOS, and Win32, Source
Unix detects a end-of-line when it finds a LF.
Apple detects a end-of-line when it finds a CR.
From a Uni-Code perspective there is a control character called NEXT LINE (NEL) just to make the situation even more complex.
With C programming language, why does it write out carriage return + line feed when you give it a line feed character? for exampleprintf("hello World\n").
C programming language and Unix operating system redefined line feed character as newline character with the intention that the stdio library will convert the newline character to whatever it takes to actually go to the beginning of the next line for that platform e.g., carriage return + line feed for Win32.
So when you write the new line character(That is really LF character) in either C/C++ and on either Windows or Linux the studio library will determine the output format that will need to be outputted for that end of line for that platform.
This is evident with creating a binary file or a text file in a C program. If you specify that you're writing a Binary file the studio library will leave the output format unchanged for that platform. So when writing the data to file and it comes across the newline character it will not insert the platform dependent characters for a new line.
Though coming to the conclusion after all this.
Even if you do follow the Win32 rules for Carriage Return + Line Feed to for example writing the following into a file as pure binary file.
MyText \n MyText \n MyText
And you assume it will render like this in your text editor.
MyText
MyText
MyText
Most editors instead will render it like this.
MyText
MyText
MyText
The confusion is mostly because of the C standard that use \n new line character for two different meanings. First, as a new line indicator for the STIO library to convert to the operating system new line format (CR+LF on win32, LF on Linux, and CR for Apple). Secondly as the just hex value line feed.
Well after 10 revisions and trying out different approaches on Win3.1,95,98,XP I have come to the conclusion I couldn't find an application that used CR and LF independently and can use a combination of them in the same document. Most text editors will show a square when it hits a single CR or LF. Most smarter text editors will change the file format depending if they find a CR+LF/LF/CR for the appropriate platform.
Most if not all editors are only concerned about rendering a new line to the user and will switch between the different file formats. So if your writer a lexer and string tokenizer any time soon and worried about when to detect a new line. Its best for the lower levels to detect the file format (CR+LF Win32, LF Linux, CR Apple) to increment the line number. Or use the ReadLine functionality that will take this into account.
It is puzzling to say the least, that why Carriage Return + Line Feed was adopted by IBM and Win32 as the standard for instructing the text editor to render a new line. When in fact its redundancy. I could not find a single application that rendered or used Carriage Return + Line Feed independently for the actual name it suggests it does.
So if your a University student writing the new text editor to amaze the world. Automatically detect the file format, and don't worry about the actual technical meaning given to CR+LF.
|
# -*- coding: utf-8 -*-
# Author: Óscar Nájera
# License: 3-clause BSD
###############################################################################
# Documentation link resolver objects
from __future__ import print_function
import gzip
import os
import posixpath
import re
import shelve
import sys
# Try Python 2 first, otherwise load from Python 3
try:
from StringIO import StringIO
import cPickle as pickle
import urllib2 as urllib
from urllib2 import HTTPError, URLError
except ImportError:
from io import StringIO
import pickle
import urllib.request
import urllib.error
import urllib.parse
from urllib.error import HTTPError, URLError
def _get_data(url):
"""Helper function to get data over http or from a local file"""
if url.startswith('http://'):
# Try Python 2, use Python 3 on exception
try:
resp = urllib.urlopen(url)
encoding = resp.headers.dict.get('content-encoding', 'plain')
except AttributeError:
resp = urllib.request.urlopen(url)
encoding = resp.headers.get('content-encoding', 'plain')
data = resp.read()
if encoding == 'plain':
pass
elif encoding == 'gzip':
data = StringIO(data)
data = gzip.GzipFile(fileobj=data).read()
else:
raise RuntimeError('unknown encoding')
else:
with open(url, 'r') as fid:
data = fid.read()
return data
def get_data(url, gallery_dir):
"""Persistent dictionary usage to retrieve the search indexes"""
# shelve keys need to be str in python 2
if sys.version_info[0] == 2 and isinstance(url, unicode):
url = url.encode('utf-8')
cached_file = os.path.join(gallery_dir, 'searchindex')
search_index = shelve.open(cached_file)
if url in search_index:
data = search_index[url]
else:
data = _get_data(url)
search_index[url] = data
search_index.close()
return data
def _select_block(str_in, start_tag, end_tag):
"""Select first block delimited by start_tag and end_tag"""
start_pos = str_in.find(start_tag)
if start_pos < 0:
raise ValueError('start_tag not found')
depth = 0
for pos in range(start_pos, len(str_in)):
if str_in[pos] == start_tag:
depth += 1
elif str_in[pos] == end_tag:
depth -= 1
if depth == 0:
break
sel = str_in[start_pos + 1:pos]
return sel
def _parse_dict_recursive(dict_str):
"""Parse a dictionary from the search index"""
dict_out = dict()
pos_last = 0
pos = dict_str.find(':')
while pos >= 0:
key = dict_str[pos_last:pos]
if dict_str[pos + 1] == '[':
# value is a list
pos_tmp = dict_str.find(']', pos + 1)
if pos_tmp < 0:
raise RuntimeError('error when parsing dict')
value = dict_str[pos + 2: pos_tmp].split(',')
# try to convert elements to int
for i in range(len(value)):
try:
value[i] = int(value[i])
except ValueError:
pass
elif dict_str[pos + 1] == '{':
# value is another dictionary
subdict_str = _select_block(dict_str[pos:], '{', '}')
value = _parse_dict_recursive(subdict_str)
pos_tmp = pos + len(subdict_str)
else:
raise ValueError('error when parsing dict: unknown elem')
key = key.strip('"')
if len(key) > 0:
dict_out[key] = value
pos_last = dict_str.find(',', pos_tmp)
if pos_last < 0:
break
pos_last += 1
pos = dict_str.find(':', pos_last)
return dict_out
def parse_sphinx_searchindex(searchindex):
"""Parse a Sphinx search index
Parameters
----------
searchindex : str
The Sphinx search index (contents of searchindex.js)
Returns
-------
filenames : list of str
The file names parsed from the search index.
objects : dict
The objects parsed from the search index.
"""
# Make sure searchindex uses UTF-8 encoding
if hasattr(searchindex, 'decode'):
searchindex = searchindex.decode('UTF-8')
# parse objects
query = 'objects:'
pos = searchindex.find(query)
if pos < 0:
raise ValueError('"objects:" not found in search index')
sel = _select_block(searchindex[pos:], '{', '}')
objects = _parse_dict_recursive(sel)
# parse filenames
query = 'filenames:'
pos = searchindex.find(query)
if pos < 0:
raise ValueError('"filenames:" not found in search index')
filenames = searchindex[pos + len(query) + 1:]
filenames = filenames[:filenames.find(']')]
filenames = [f.strip('"') for f in filenames.split(',')]
return filenames, objects
class SphinxDocLinkResolver(object):
""" Resolve documentation links using searchindex.js generated by Sphinx
Parameters
----------
doc_url : str
The base URL of the project website.
searchindex : str
Filename of searchindex, relative to doc_url.
extra_modules_test : list of str
List of extra module names to test.
relative : bool
Return relative links (only useful for links to documentation of this
package).
"""
def __init__(self, doc_url, gallery_dir, searchindex='searchindex.js',
extra_modules_test=None, relative=False):
self.doc_url = doc_url
self.gallery_dir = gallery_dir
self.relative = relative
self._link_cache = {}
self.extra_modules_test = extra_modules_test
self._page_cache = {}
if doc_url.startswith('http://'):
if relative:
raise ValueError('Relative links are only supported for local '
'URLs (doc_url cannot start with "http://)"')
searchindex_url = doc_url + '/' + searchindex
else:
searchindex_url = os.path.join(doc_url, searchindex)
# detect if we are using relative links on a Windows system
if os.name.lower() == 'nt' and not doc_url.startswith('http://'):
if not relative:
raise ValueError('You have to use relative=True for the local'
' package on a Windows system.')
self._is_windows = True
else:
self._is_windows = False
# download and initialize the search index
sindex = get_data(searchindex_url, gallery_dir)
filenames, objects = parse_sphinx_searchindex(sindex)
self._searchindex = dict(filenames=filenames, objects=objects)
def _get_link(self, cobj):
"""Get a valid link, False if not found"""
fname_idx = None
full_name = cobj['module_short'] + '.' + cobj['name']
if full_name in self._searchindex['objects']:
value = self._searchindex['objects'][full_name]
if isinstance(value, dict):
value = value[next(iter(value.keys()))]
fname_idx = value[0]
elif cobj['module_short'] in self._searchindex['objects']:
value = self._searchindex['objects'][cobj['module_short']]
if cobj['name'] in value.keys():
fname_idx = value[cobj['name']][0]
if fname_idx is not None:
fname = self._searchindex['filenames'][fname_idx] + '.html'
if self._is_windows:
fname = fname.replace('/', '\\')
link = os.path.join(self.doc_url, fname)
else:
link = posixpath.join(self.doc_url, fname)
if hasattr(link, 'decode'):
link = link.decode('utf-8', 'replace')
if link in self._page_cache:
html = self._page_cache[link]
else:
html = get_data(link, self.gallery_dir)
self._page_cache[link] = html
# test if cobj appears in page
comb_names = [cobj['module_short'] + '.' + cobj['name']]
if self.extra_modules_test is not None:
for mod in self.extra_modules_test:
comb_names.append(mod + '.' + cobj['name'])
url = False
if hasattr(html, 'decode'):
# Decode bytes under Python 3
html = html.decode('utf-8', 'replace')
for comb_name in comb_names:
if hasattr(comb_name, 'decode'):
# Decode bytes under Python 3
comb_name = comb_name.decode('utf-8', 'replace')
if comb_name in html:
url = link + u'#' + comb_name
link = url
else:
link = False
return link
def resolve(self, cobj, this_url):
"""Resolve the link to the documentation, returns None if not found
Parameters
----------
cobj : dict
Dict with information about the "code object" for which we are
resolving a link.
cobi['name'] : function or class name (str)
cobj['module_short'] : shortened module name (str)
cobj['module'] : module name (str)
this_url: str
URL of the current page. Needed to construct relative URLs
(only used if relative=True in constructor).
Returns
-------
link : str | None
The link (URL) to the documentation.
"""
full_name = cobj['module_short'] + '.' + cobj['name']
link = self._link_cache.get(full_name, None)
if link is None:
# we don't have it cached
link = self._get_link(cobj)
# cache it for the future
self._link_cache[full_name] = link
if link is False or link is None:
# failed to resolve
return None
if self.relative:
link = os.path.relpath(link, start=this_url)
if self._is_windows:
# replace '\' with '/' so it on the web
link = link.replace('\\', '/')
# for some reason, the relative link goes one directory too high up
link = link[3:]
return link
def _embed_code_links(app, gallery_conf, gallery_dir):
# Add resolvers for the packages for which we want to show links
doc_resolvers = {}
for this_module, url in gallery_conf['reference_url'].items():
try:
if url is None:
doc_resolvers[this_module] = SphinxDocLinkResolver(
app.builder.outdir,
gallery_dir,
relative=True)
else:
doc_resolvers[this_module] = SphinxDocLinkResolver(url,
gallery_dir)
except HTTPError as e:
print("The following HTTP Error has occurred:\n")
print(e.code)
except URLError as e:
print("\n...\n"
"Warning: Embedding the documentation hyperlinks requires "
"Internet access.\nPlease check your network connection.\n"
"Unable to continue embedding `{0}` links due to a URL "
"Error:\n".format(this_module))
print(e.args)
html_gallery_dir = os.path.abspath(os.path.join(app.builder.outdir,
gallery_dir))
# patterns for replacement
link_pattern = '<a href="%s">%s</a>'
orig_pattern = '<span class="n">%s</span>'
period = '<span class="o">.</span>'
for dirpath, _, filenames in os.walk(html_gallery_dir):
for fname in filenames:
print('\tprocessing: %s' % fname)
full_fname = os.path.join(html_gallery_dir, dirpath, fname)
subpath = dirpath[len(html_gallery_dir) + 1:]
pickle_fname = os.path.join(gallery_dir, subpath,
fname[:-5] + '_codeobj.pickle')
if os.path.exists(pickle_fname):
# we have a pickle file with the objects to embed links for
with open(pickle_fname, 'rb') as fid:
example_code_obj = pickle.load(fid)
fid.close()
str_repl = {}
# generate replacement strings with the links
for name, cobj in example_code_obj.items():
this_module = cobj['module'].split('.')[0]
if this_module not in doc_resolvers:
continue
try:
link = doc_resolvers[this_module].resolve(cobj,
full_fname)
except (HTTPError, URLError) as e:
print("The following error has occurred:\n")
print(repr(e))
continue
if link is not None:
parts = name.split('.')
name_html = period.join(orig_pattern % part
for part in parts)
str_repl[name_html] = link_pattern % (link, name_html)
# do the replacement in the html file
# ensure greediness
names = sorted(str_repl, key=len, reverse=True)
expr = re.compile(r'(?<!\.)\b' + # don't follow . or word
'|'.join(re.escape(name)
for name in names))
def substitute_link(match):
return str_repl[match.group()]
if len(str_repl) > 0:
with open(full_fname, 'rb') as fid:
lines_in = fid.readlines()
with open(full_fname, 'wb') as fid:
for line in lines_in:
line = line.decode('utf-8')
line = expr.sub(substitute_link, line)
fid.write(line.encode('utf-8'))
print('[done]')
def embed_code_links(app, exception):
"""Embed hyperlinks to documentation into example code"""
if exception is not None:
return
# No need to waste time embedding hyperlinks when not running the examples
# XXX: also at the time of writing this fixes make html-noplot
# for some reason I don't fully understand
if not app.builder.config.plot_gallery:
return
# XXX: Whitelist of builders for which it makes sense to embed
# hyperlinks inside the example html. Note that the link embedding
# require searchindex.js to exist for the links to the local doc
# and there does not seem to be a good way of knowing which
# builders creates a searchindex.js.
if app.builder.name not in ['html', 'readthedocs']:
return
print('Embedding documentation hyperlinks in examples..')
gallery_conf = app.config.sphinx_gallery_conf
gallery_dirs = gallery_conf['gallery_dirs']
if not isinstance(gallery_dirs, list):
gallery_dirs = [gallery_dirs]
for gallery_dir in gallery_dirs:
_embed_code_links(app, gallery_conf, gallery_dir)
|
/*---------------------------------------------------------------------------------------------
* Copyright (c) Microsoft Corporation. All rights reserved.
* Licensed under the Source EULA. See License.txt in the project root for license information.
*--------------------------------------------------------------------------------------------*/
.ads-homepage .xs {
display: block
}
.SM.ads-homepage .xs {
display: none
}
.ads-homepage .sm {
display: none
}
.SM.ads-homepage .sm {
display: block
}
.ads-homepage .ads-grid {
display: grid;
grid-gap: 16px;
grid-row-gap: 16px
}
.ads-homepage .ads-grid.grip-gap-50 {
grid-gap: 50px
}
.ads-homepage {
font-family: Segoe UI, Frutiger, Frutiger Linotype, Dejavu Sans, Helvetica Neue, Arial, sans-serif
}
.ads-homepage h1, .ads-homepage h2, .ads-homepage h3, .ads-homepage h4, .ads-homepage h5, .ads-homepage p {
margin: 0
}
.ads-homepage h1 {
font-size: 3em;
line-height: 1em;
font-weight: 400
}
.ads-homepage h2 {
font-size: 1.5em;
font-weight: 600
}
.ads-homepage h3 {
font-size: 1.16em;
font-weight: 600
}
.ads-homepage h4 {
font-weight: 600
}
.ads-homepage p {
font-size: 1em
}
.ads-homepage a {
text-decoration: none
}
.ads-homepage .content:not(.extensions) {
margin: 8px 0
}
.ads-homepage .flex {
display: flex
}
.ads-homepage .flex.flex-d-column {
flex-direction: column
}
.ads-homepage .flex.flex-d-row {
flex-direction: row
}
.ads-homepage .flex.flex-wrap {
flex-wrap: wrap
}
.ads-homepage .flex.flex-j-center {
justify-content: center
}
.ads-homepage .flex.flex-j-evenly {
justify-content: space-evenly
}
.ads-homepage .flex.flex-j-end {
justify-content: flex-end
}
.ads-homepage .flex.flex-a-center {
align-items: center
}
.ads-homepage .flex.flex-a-start {
align-items: flex-start
}
.ads-homepage .flex.flex-j-between {
justify-content: space-between
}
.ads-homepage .a-self-end {
align-self: flex-end
}
.ads-homepage.XS .caption-container {
display: flex;
align-items: center;
justify-content: flex-start
}
.ads-homepage.XS:not(.SM) .caption {
font-size: 2.7em;
line-height: 1em;
margin-bottom: 0
}
.ads-homepage.XS .title {
width: auto
}
.ads-homepage.XS:not(.SM) .title {
width: 100%
}
.ads-homepage .btn-container {
display: flex;
flex-direction: column;
justify-content: space-between
}
.ads-homepage.SM .btn-container {
flex-direction: row;
justify-content: flex-start
}
.ads-homepage .btn span {
display: block
}
.ads-homepage.XS .btn {
line-height: 27px
}
.ads-homepage.XS .btn {
margin: 0 8px 0 0;
width: 77px;
line-height: 18px
}
.mac .ads-homepage.XS .dropdown.btn {
line-height: 1.6em
}
.btn-primary .monaco-button, .btn-secondary .monaco-button {
height: 28px;
}
.ads-homepage .btn-primary:hover {
cursor: pointer
}
.ads-homepage .btn-secondary:hover {
cursor: pointer
}
.ads-homepage .btn-secondary {
line-height: 1.6em
}
.ads-homepage #dropdown-btn:focus {
outline: 1px solid
}
.ads-homepage .dropdown-content {
z-index: 9;
position: absolute;
display: none;
box-sizing: border-box;
list-style: none;
padding: 8px 0 8px 0;
margin: 0;
width: 16em;
position: absolute
}
.ads-homepage .dropdown-content li a {
font-size: 1.1em
}
.ads-homepage .dropdown-content li a {
display: block;
width: 69%;
height: 100%;
padding: 5px 20px
}
.dropdown-content.show {
position: absolute;
display: block
}
.ads-homepage .btn.dropdown ul li ul:hover, .ads-homepage .btn.dropdown ul li:hover>ul {
z-index: 9
}
.ads-homepage .btn.dropdown ul li ul li a {
width: 78%;
padding: 1em 1em 1em 1.5em;
clear: both;
font-size: 1.16em;
text-align: left;
border: 1px solid
}
.ads-homepage .dropdown-nav {
position: relative
}
.ads-homepage .btn.dropdown ul li ul a {
text-decoration: none
}
.ads-homepage .dropdown-content li a {
width: 86%;
padding: 6px 0 6px 28px;
display: block
}
.ads-homepage .btn:disabled {
width: auto;
height: 24px;
padding: 4px 16px;
border: 0!important
}
.ads-homepage .btn:disabled:hover {
cursor: default
}
.ads-homepage .preview-link {
padding: 4px
}
.ads-homepage .preview-link i {
margin-right: 4px
}
.ads-homepage .preview-text {
display: flex;
justify-content: flex-end;
align-items: center;
position: relative;
top: 25px;
margin-right: 15px
}
.ads-homepage #tool-tip-container-wide {
display: none;
}
.ads-homepage #tool-tip-container-wide .ads-welcome-page-link{
display: flex;
align-items: center;
}
.ads-homepage #tool-tip-container-narrow .ads-welcome-page-link{
display: flex;
align-items: center;
}
.ads-homepage #tool-tip-container-narrow {
display: block;
bottom: 13px;
position: relative;
cursor: pointer
}
.ads-homepage.XL .preview-text {
margin-right: 0
}
.ads-homepage.XL #tool-tip-container-wide {
display: flex;
justify-content: flex-end;
padding-top: 10px;
}
.ads-homepage.XL #tool-tip-container-narrow {
display: none
}
.ads-homepage .tool-tip .tool-tip-text {
max-width: 400px;
visibility: hidden;
padding: 10px 15px;
z-index: 1;
top: 32px;
right: -72px;
text-align: center;
border-radius: 6px;
position: absolute;
box-shadow: 0 3px 8px rgba(0, 0, 0, .14);
border-radius: 2px
}
.ads-homepage .tool-tip {
position: relative
}
.ads-homepage .tool-tip .tool-tip-text:after {
content: "";
position: absolute;
bottom: 100%;
left: 83%;
z-index: 9;
margin-left: -10px;
border-width: 5px;
border-style: solid
}
.ads-homepage #tool-tip-container-wide .tool-tip-text.show {
visibility: visible
}
.ads-homepage .tool-tip .tool-tip-text h3 {
margin-bottom: 10px
}
.ads-homepage .modal {
display: none;
position: fixed;
z-index: 1;
padding-top: 100px;
left: 0;
top: 0;
width: 100%;
height: 100%;
overflow: auto
}
.ads-homepage .modal.show {
display: block
}
.ads-homepage .modal-content {
margin: auto;
padding: 20px;
width: 80%;
max-width: 372px;
height: 116px;
border-radius: 2px;
display: flex;
flex-direction: column;
justify-content: center;
position: relative;
border: 1px solid
}
.ads-homepage .modal-content h3 {
margin-bottom: 8px
}
.ads-homepage .close-icon {
position: absolute;
right: 13px;
top: 4px;
font-size: 1.33em
}
.ads-homepage .close-icon:focus, .ads-homepage .close-icon:hover {
text-decoration: none;
cursor: pointer
}
.ads-homepage .preview-text p {
position: relative;
display: inline-block;
font-size: 1.08em;
bottom: 2px
}
.ads-homepage .icon-info {
display: inline-block;
width: 12px;
height: 12px;
margin-left: 6px;
margin-top: 3px;
-webkit-mask: url(../../media/info.svg) no-repeat;
-webkit-mask-size: 12px 12px;
mask: url(../../media/info.svg) no-repeat;
mask-size: 12px 12px
}
.ads_homepage .codicon-chevron-right {
transform: rotate(90deg);
}
.ads_homepage .monaco-text-button {
min-width: 77px;
margin: 10px 0;
}
.ads-homepage .codicon-chevron-right {
transform: rotate(90deg);
pointer-events: none;
}
.ads-homepage .icon-arrow-right {
position: relative;
height: 16px;
width: 16px;
display: inline-block
}
.ads-homepage .icon-arrow-right:before {
position: absolute;
font: normal normal normal 14px/1 codicon;
text-decoration: none;
text-rendering: auto;
text-align: center;
-webkit-font-smoothing: antialiased;
display: inline-block;
width: 11px;
height: 6px;
content: "";
top: 1px;
bottom: 5px;
margin: auto;
left: 5px
}
.ads-homepage .icon-link {
display: inline-block;
width: 11px;
height: 11px;
margin-left: 4px;
-webkit-mask: url(../../media/link_icon.svg) no-repeat;
-webkit-mask-size: 11px 11px;
mask: url(../../media/link_icon.svg) no-repeat;
mask-size: 11px 11px;
height: 11px;
}
.ads-homepage .icon-arrow-down-dark {
position: relative;
height: 20px;
width: 22px;
display: inline-block
}
.ads-homepage .icon-arrow-down-dark:before {
position: absolute;
font: normal normal normal 14px/1 codicon;
text-decoration: none;
text-rendering: auto;
text-align: center;
-webkit-font-smoothing: antialiased;
display: inline-block;
width: 11px;
height: 6px;
transform: rotate(90deg);
top: 14px;
bottom: 5px;
margin: auto;
left: 8px
}
.ads-homepage .dropdown-navigation {
position: relative
}
.ads-homepage .dropdown-text {
display: flex;
justify-content: center;
align-items: center;
text-decoration: none;
padding-top: 1px
}
.ads-homepage .showOnStartup {
margin-top: 10px
}
.ads-homepage .showOnStartup label {
position: relative;
bottom: 3px
}
.ads-homepage .showOnStartup input {
width: 15px;
height: 15px
}
.ads-homepage .link {
text-decoration: none
}
.ads-homepage .link-learn-more {
line-height: 27px
}
.ads-homepage .link:hover {
text-decoration: underline;
cursor: pointer
}
.ads-homepage.LG .extension-pack-container {
grid-template-columns: repeat(2, 1fr)
}
.ads_homepage .dropdown_btn_container {
margin: 10px 10px 10px 0;
}
.ads_homepage.XS:not(.SM) .dropdown_btn_container {
width: 100%;
}
.ads-homepage.XS.SM.MD.LG.XL .extension-pack-container {
grid-template-columns: repeat(8, 1fr)
}
.ads-homepage .extension-pack {
grid-column: 1/span 2
}
.ads-homepage.LG .extension-pack {
grid-template-columns: repeat(2, 1fr)
}
.ads-homepage.XS.SM.MD.LG.XL .extension-pack {
grid-column: 1/span 4;
grid-row: 1/span 4
}
.ads-homepage .tile:not(.extension):not(.extension-pack) {
border: 1px solid;
border-radius: 4px;
}
.ads-homepage .tile.extension-pack {
border: 1px solid;
border-radius: 4px;
}
.ads-homepage .extension-list {
grid-column: 1/span 2
}
.ads-homepage.XS.SM.MD.LG.XL .extension-list {
grid-column: 5/span 4;
grid-row: 1/span 4;
}
.ads-homepage .extension-header, .ads-homepage .extension-pack-extension-list-header {
font-weight: 600;
font-size: 1.33em;
}
.ads-homepage .tile {
transition: all .5s ease;
border-radius: 4px;
}
.ads-homepage .tile:hover:not(.no-hover) {
cursor: pointer
}
.ads-homepage .link:active {
text-decoration: underline
}
.ads-homepage .content {
padding: 25px 2% 0
}
.ads-homepage.MD .content {
padding: 25px 4% 0
}
.ads-homepage.LG .content {
padding: 25px 6% 0
}
.ads-homepage.XL .content {
padding: 25px 8% 0
}
.ads-homepage .text-container {
padding: 15px 15px
}
.ads-homepage .gradient {
background-size: cover
}
.ads-homepage.MD .gradient {
padding: 25px 4% 0
}
.ads-homepage.LG .gradient {
padding: 25px 6% 0
}
.ads-homepage.XL .gradient {
padding: 0 8% 0
}
.ads-homepage-section h2 {
margin-bottom: 16px
}
.ads-homepage-section.hero {
background-size: 1128px 467px;
background-repeat: no-repeat;
background-image: url(../../media/homeBanner_icon.svg);
background-repeat: no-repeat;
background-position: 160px 0;
background-size: cover;
background-repeat: no-repeat
}
.hc-black .ads-homepage-section.hero, .vs-dark .ads-homepage-section.hero {
background-size: 1128px 467px;
background-repeat: no-repeat;
background-image: url(../../media/homeBanner_icon_dark.svg);
background-repeat: no-repeat;
background-position: 160px 0;
background-size: cover;
background-repeat: no-repeat
}
.ads-homepage.LG .ads-homepage-section.hero {
background-size: contain;
background-repeat: no-repeat;
background-image: url(../../media/homeBanner_icon.svg);
background-position: 94% -54px
}
.ads-homepage.XL .ads-homepage-section.hero {
background-size: 597px;
background-repeat: no-repeat;
background-image: url(../../media/homeBanner_icon.svg);
background-position: 94% -54px
}
.hc-black .ads-homepage.LG .ads-homepage-section.hero, .vs-dark .ads-homepage.LG .ads-homepage-section.hero {
background-size: 597px;
background-repeat: no-repeat;
background-image: url(../../media/homeBanner_icon_dark.svg);
background-position: 94% 0
}
.ads-homepage .resources-container {
grid-column: 1/span 1
}
.ads-homepage.XL .resources-container {
grid-column: 1/span 7
}
.ads-homepage .resources-container .tabs {
display: flex;
flex-wrap: wrap
}
.ads-homepage .resources-container .input {
position: absolute;
opacity: 0
}
.ads-homepage .resources-container .label {
width: 100%;
padding: 10px;
cursor: pointer;
font-weight: 700;
font-size: 1.16em;
transition: background .1s, color .1s
}
.ads-homepage .getting-started-container {
grid-column: 1/span 1
}
.ads-homepage.XL .getting-started-container {
grid-column: 9/span 6
}
.ads-homepage .header {
padding: 0 10px 20px
}
.ads-homepage .header-top-nav {
margin: 0 0 30px;
padding-top: 30px
}
.ads-homepage .header-top-nav .flex {
align-items: center;
justify-content: flex-start
}
.ads-homepage.XS.SM.MD.LG.XL .header-top-nav {
margin-bottom: 117px;
padding-top: 69px
}
.ads-homepage .header-top-nav h1 {
margin: 0 0 20px
}
.ads-homepage.XS:not(.SM) .header-top-nav h1 {
font-size: 2.6em;
line-height: 1em
}
.ads-homepage .header-top-nav .icon {
width: 92px;
height: 92px;
background-image: url(../../media/dataStudioIcon.svg);
background-size: contain;
margin-right: 20px;
background-repeat: no-repeat
}
.ads-homepage.XS:not(.SM) .header-top-nav .icon {
background-image: url(../../media/dataStudioIcon.svg);
background-size: contain;
background-repeat: no-repeat;
width: 73px;
min-width: 73px;
height: 69px;
background-image: url(../../media/dataStudioIcon.svg);
background-size: contain;
margin-right: 10px
}
.ads-homepage .header-bottom-nav {
margin-top: 35px
}
.ads-homepage .header-bottom-nav-tiles {
grid-template-columns: repeat(2, 1fr)
}
.ads-homepage.XS.SM.MD.LG.XL .header-bottom-nav-tiles {
grid-template-columns: repeat(4, 1fr)
}
.ads-homepage.XL .header-bottom-nav {
margin-top: 112px
}
.ads-homepage .header-bottom-nav-tile {
position: relative;
height: 160px;
padding: 10px 10px 10px 10px;
text-align: center;
display: flex;
flex-direction: column;
justify-content: flex-start;
align-items: center;
border: 1px solid;
border-radius: 4px;
transition: all .5s ease;
margin: 0
}
.hc-black .ads-homepage .header-bottom-nav-tile, .vs-dark .ads-homepage .header-bottom-nav-tile {
border: 1px solid;
border-radius: 4px
}
.ads-homepage.XS .header-bottom-nav-tile {
height: 200px
}
.ads-homepage.SM .header-bottom-nav-tile {
height: 145px
}
.ads-homepage.LG .header-bottom-nav-tile {
padding: 10px 20px 10px 10px
}
.ads-homepage.LG .header-bottom-nav-tile {
height: 100px;
padding-left: 25%;
text-align: left;
justify-content: center;
align-items: baseline
}
.ads-homepage .header-bottom-nav-tile h3 {
margin: 16px 0 4px
}
.ads-homepage.LG .header-bottom-nav-tile h3 {
margin: 0
}
.ads-homepage a.link-show-all {
font-size: 1.16em;
padding-top: 7px
}
.monaco-workbench .part.editor>.content .ads-homepage a.header-bottom-nav-tile-link {
text-decoration: none;
display: block;
}
.ads-homepage .header-bottom-nav-tile .icon {
width: 42px;
height: 42px;
position: absolute;
right: 0;
bottom: 20px;
left: 0;
margin: auto
}
.ads-homepage.LG .header-bottom-nav-tile .icon {
position: absolute;
right: 75%;
bottom: 0;
top: 0
}
.ads-homepage .header-bottom-nav-tile .icon.connection {
background-image: url(../../media/createConnectionIcon.svg);
background-size: contain;
background-repeat: no-repeat
}
.ads-homepage .header-bottom-nav-tile .icon.query {
background-image: url(../../media/databaseIcon.svg);
background-size: contain;
background-repeat: no-repeat
}
.ads-homepage .header-bottom-nav-tile .icon.notebook {
background-image: url(../../media/notebookIcon.svg);
background-size: contain;
background-repeat: no-repeat
}
.ads-homepage .header-bottom-nav-tile .icon.server {
background-image: url(../../media/serverIcon.svg);
background-size: contain;
background-repeat: no-repeat
}
.ads-homepage .middle-section {
grid-template-columns: 1fr
}
.ads-homepage.XL .middle-section {
grid-template-columns: repeat(12, 1fr)
}
.ads-homepage .resources-container .input:focus+.label {
z-index: 1
}
.ads-homepage .resources-container .input:checked+.label {
border-bottom: 3px solid
}
.hc-black .ads-homepage .resources-container .input:checked+.label, .vs-dark .ads-homepage .resources-container .input:checked+.label {
border-bottom: 3px solid
}
.ads-homepage .resources-container .label {
font-weight: 600
}
.ads-homepage.LG .resources-container .label {
width: auto
}
.ads-homepage.XS:not(.SM) .resources-container .panel {
padding-top: 0
}
.ads-homepage .resources-container .panel {
display: none;
padding: 20px 20px 20px 0
}
.ads-homepage.LG .resources-container .panel {
order: 99
}
.ads-homepage .resources-container .input:checked+.label+.panel {
display: block;
width: 100%
}
.ads-homepage .ads-homepage-section .history .list, .ads-homepage .ads-homepage-section .pinned .list {
list-style-type: none;
padding: 0;
margin-top: 0
}
.ads-homepage .ads-homepage-section .history .list-header, .ads-homepage .ads-homepage-section .pinned .list-header {
padding: 0 0 2px 11px
}
.ads-homepage.XS:not(.SM) .ads-homepage-section .pinned .list-header, .ads-homepage.XS:not(.SM) .ads-homepage-section .history .list-header {
padding: 0 0 2px 41px;
line-height: 1em
}
.ads-homepage .ads-homepage-section .history .list li:not(.moreRecent), .ads-homepage .ads-homepage-section .history .list-header-container, .ads-homepage .ads-homepage-section .pinned .list li:not(.moreRecent), .ads-homepage .ads-homepage-section .pinned .list-header-container {
height: 33px;
list-style: none;
border-bottom: 1px solid;
text-align: left;
font-size: 1em;
display: flex;
position: relative;
justify-content: flex-end;
align-items: center;
text-decoration: none
}
.ads-homepage.XS:not(.SM) .ads-homepage-section .history .list-header-container {
display: flex;
flex-direction: column;
padding: 15px;
align-items: flex-start
}
.ads-homepage .ads-homepage-section .history .list-header-container .list-header-last-opened {
margin-left: auto
}
.ads-homepage.XS:not(.SM) .ads-homepage-section .history .list-header-container .list-header-last-opened {
margin-left: 0;
padding: 0 0 2px 41px
}
.ads-homepage .ads-homepage-section .history .detail {
margin-left: auto
}
.ads-homepage.XS:not(.SM) .ads-homepage-section .history .detail {
margin-left: 0;
padding: 0 0 2px 41px
}
.ads-homepage .ads-homepage-section .history .list li:not(.moreRecent) a, .ads-homepage .ads-homepage-section .pinned .list li:not(.moreRecent) a {
padding: 0 0 2px 11px
}
.ads-homepage .ads-homepage-section .pinned .list li:not(.moreRecent) a, .ads-homepage.XS:not(.SM) .ads-homepage-section .history .list li:not(.moreRecent) a {
padding: 0 0 2px 41px
}
.ads-homepage .ads-homepage-section .history .list li:not(.moreRecent) i, .ads-homepage .ads-homepage-section .pinned .list li i, .ads-homepage .icon-document {
-webkit-mask: url(../../media/icon_file_document.svg) no-repeat;
-webkit-mask-size: 13px 16px;
mask: url(../../media/icon_file_document.svg) no-repeat;
mask-size: 13px 16px;
height: 16px;
width: 16px
}
.ads-homepage .ads-homepage-section .history .list li:not(.moreRecent) i[title$=".ipynb"], .ads-homepage .ads-homepage-section .pinned .list li:not(.moreRecent) i[title$=".ipynb"] {
-webkit-mask: url(../../media/icon_file_ipynb.svg) no-repeat;
-webkit-mask-size: 13px 16px;
mask: url(../../media/icon_file_ipynb.svg) no-repeat;
mask-size: 13px 16px;
height: 16px;
width: 16px
}
.ads-homepage .ads-homepage-section .history .list li:not(.moreRecent) i[title$=".sql"], .ads-homepage .ads-homepage-section .pinned .list li:not(.moreRecent) i[title$=".sql"] {
-webkit-mask: url(../../media/icon_file_sql.svg) no-repeat;
-webkit-mask-size: 13px 16px;
mask: url(../../media/icon_file_sql.svg) no-repeat;
mask-size: 13px 16px;
height: 16px;
width: 16px
}
.ads-homepage .ads-homepage-section .history .list li:not(.moreRecent) i[title$=".csv"], .ads-homepage .ads-homepage-section .pinned .list li:not(.moreRecent) a[title$=".csv"] {
-webkit-mask: url(../../media/icon_file_csv.svg) no-repeat;
-webkit-mask-size: 13px 16px;
mask: url(../../media/icon_file_csv.svg) no-repeat;
mask-size: 13px 16px;
height: 16px;
width: 16px
}
.ads-homepage.XS:not(.SM) .ads-homepage-section .history .list li:not(.moreRecent) i, .ads-homepage.XS:not(.SM) .ads-homepage-section .pinned .list li i, .ads-homepage.XS:not(.SM) .icon-document {
-webkit-mask: url(../../media/icon_file_document.svg) no-repeat;
-webkit-mask-size: 20px 23px;
mask: url(../../media/icon_file_document.svg) no-repeat;
mask-size: 20px 23px;
min-height: 29px;
min-width: 21px;
display: inline-block;
position: absolute;
top: 16px;
bottom: 0;
margin: auto
}
.ads-homepage.XS:not(.SM) .ads-homepage-section .history .list li:not(.moreRecent) i[title$=".ipynb"], .ads-homepage.XS:not(.SM) .ads-homepage-section .pinned .list li:not(.moreRecent) i[title$=".ipynb"] {
-webkit-mask: url(../../media/icon_file_ipynb.svg) no-repeat;
-webkit-mask-size: 20px 23px;
mask: url(../../media/icon_file_ipynb.svg) no-repeat;
mask-size: 20px 23px;
min-height: 29px;
min-width: 21px;
display: inline-block;
position: absolute;
top: 16px;
bottom: 0;
margin: auto
}
.ads-homepage.XS:not(.SM) .ads-homepage-section .history .list li:not(.moreRecent) i[title$=".sql"], .ads-homepage.XS:not(.SM) .ads-homepage-section .pinned .list li:not(.moreRecent) i[title$=".sql"] {
-webkit-mask: url(../../media/icon_file_sql.svg) no-repeat;
-webkit-mask-size: 20px 23px;
mask: url(../../media/icon_file_sql.svg) no-repeat;
mask-size: 20px 23px;
min-height: 29px;
min-width: 21px;
display: inline-block;
position: absolute;
top: 16px;
bottom: 0;
margin: auto
}
.ads-homepage.XS:not(.SM) .ads-homepage-section .history .list li:not(.moreRecent) i[title$=".csv"], .ads-homepage.XS:not(.SM) .ads-homepage-section .pinned .list li:not(.moreRecent) a[title$=".csv"] {
-webkit-mask: url(../../media/icon_file_csv.svg) no-repeat;
-webkit-mask-size: 20px 23px;
mask: url(../../media/icon_file_csv.svg) no-repeat;
mask-size: 20px 23px;
min-height: 29px;
min-width: 21px;
display: inline-block;
position: absolute;
top: 16px;
bottom: 0;
margin: auto
}
.ads-homepage.XS:not(.SM) .ads-homepage-section .history .list li {
display: flex;
flex-direction: column;
justify-content: flex-start;
align-items: flex-start;
padding: 15px;
padding-top: 10px
}
.ads-homepage .ads-homepage-section .history .moreRecent-list {
list-style-type: none;
padding: 0;
margin: 0
}
.ads-homepage .ads-homepage-section .history .moreRecent-list li.moreRecent {
display: flex;
align-items: center;
margin-top: 10px
}
.ads-homepage .ads-homepage-section .history .moreRecent-list li.moreRecent a {
text-decoration: none
}
.ads-homepage .ads-homepage-section .links .link-header {
font-size: 1.16em;
margin-bottom: 4px
}
.ads-homepage .ads-homepage-section .links p {
margin-bottom: 16px
}
.ads-homepage.XS .ads-homepage-section .links .flex-container-video {
display: flex;
flex-direction: column
}
.ads-homepage.SM .ads-homepage-section .links .flex-container-video {
display: flex;
flex-direction: row
}
.ads-homepage .ads-homepage-section .links .videos-container {
margin-bottom: 20px;
display: flex;
flex-direction: column
}
.ads-homepage .ads-homepage-section .links .videos-container-video {
margin-right: 16px
}
.ads-homepage .ads-homepage-section .links .videos-container .video {
display: block;
width: 100%;
height: 100%
}
.ads-homepage .ads-homepage-section .links .videos-container .video img {
max-width: 100%
}
.ads-homepage .extensions .row {
padding-bottom: 35px
}
.ads-homepage .extension {
display: flex;
height: 100%;
justify-content: flex-start;
margin-bottom: 5px;
background: 0 0
}
.ads-homepage .extension .extension-inner {
padding: 15px
}
.ads-homepage .extension-pack-header {
font-weight: 600;
font-size: 2.33em;
z-index: 9;
margin-bottom: 10px
}
.ads-homepage .extension-pack-body {
line-height: 1.5em;
font-size: 1.33em;
z-index: 9
}
.ads-homepage.LG .extension-pack-body {
font-size: 1.5em;
line-height: 1.2em
}
.ads-homepage .extension-pack {
grid-gap: 0
}
.ads-homepage .extension-pack-btn-container {
padding: 17px 0 23px;
width: 100%
}
.ads-homepage .extension-pack-description {
background: url(../../media/extension_pack_img.svg);
background-size: cover;
background-position: center;
position: relative;
background-size: cover;
display: flex;
flex-direction: column;
justify-content: space-between;
align-items: flex-start;
padding: 39px 20px 20px;
border-top-left-radius: 5px;
border-bottom-left-radius: 5px
}
.ads-homepage .extension-pack {
border-radius: 5px
}
.ads-homepage .extension-pack-description:before {
content: "";
position: absolute;
top: 0;
right: 0;
bottom: 0;
left: 0;
border-top-left-radius: 5px;
border-bottom-left-radius: 5px
}
.ads-homepage .extension-pack-description-grid-container {
height: 100%
}
.ads-homepage .extension-pack-description .text-container {
text-align: center;
padding: 20px
}
.ads-homepage .extension-pack .text-container .icon {
margin-bottom: 10px
}
.ads-homepage .extension-pack .text-container h2 {
margin-bottom: 10px
}
.ads-homepage .extension .img-container {
margin-right: 22px
}
.ads-homepage .extension .icon, .ads-homepage .extensions .img-container .icon {
width: 50px;
margin: auto
}
.ads-homepage .extension-pack .extension-pack-extensions {
padding: 0 25px 0 35px;
background: 0 0
}
.ads-homepage .extension-pack .extension-pack-extensions .btn-secondary {
display: flex;
justify-content: center;
align-items: center;
line-height: 1.25em
}
.ads-homepage .extension-pack .extension-pack-extension-container {
padding: 8px 0
}
.ads-homepage .extension-pack .extension-pack-extension-container:first-of-type {
padding: 24px 0 8px
}
.ads-homepage .extension-pack .extension-pack-extension-container .description h4 {
font-size: 1.33em
}
.ads-homepage .extension-pack .extension-pack-extension-container .icon {
width: 36px;
height: 36px;
margin-right: 14px
}
.welcomePage {
position: relative;
}
.ads-homepage .guided-tour-banner .diamond-icon {
display: inline-block;
min-width: 24px;
height: 24px;
margin-left: 6px;
margin-right: 20px;
-webkit-mask: url('../../gettingStarted/media/diamondIcon.svg') no-repeat;
-webkit-mask-size: 24px 24px;
mask: url('../../gettingStarted/media/diamondIcon.svg') no-repeat;
mask-size: 24px 24px;
margin: 0 17px 0 20px;
}
.ads-homepage .btn-remove-tour {
display: inline-block;
margin: 0 17px 0 20px;
width: 20px;
height: 20px;
}
.ads-homepage .btn-remove-tour:hover {
cursor: pointer;
}
.ads-homepage .guided-tour-banner {
opacity: 0;
position: relative;
top: 0;
transform: translateY(-100%);
transition: transform 0.3s cubic-bezier(0.4, 0, 0.6, 1), opacity 0s 0.3s;
width: 100%;
-ms-flex-align: center;
align-items: center;
box-shadow: 2px 4px 10px rgba(0, 0, 0, 0.2);
display: -ms-flexbox;
display: flex;
overflow: hidden;
display: flex;
justify-content: space-between;
align-items: center;
height: 0;
overflow: hidden;
padding: 0 14px 0 20px;
width: 99%;
}
.ads-homepage #guidedTourBanner.show {
opacity: 1;
min-height: 60px;
height: auto;
transform: translateY(0);
transition: transform 0.3s cubic-bezier(0.4, 0, 0.2, 1) 0.3s, opacity 0s 0.3s, height 0s 0.3s;
}
.ads-homepage .guided-tour-banner p {
font-size: 1.16em;
font-family: Segoe UI, Frutiger, Frutiger Linotype, Dejavu Sans, Helvetica Neue, Arial, sans-serif;
font-weight: normal;
padding: 10px 15px 10px 0;
}
.ads-homepage .guided-tour-banner b {
font-weight: 600;
}
.ads-homepage .guided-tour-banner .monaco-button {
line-height: 1.9em !important;
font-weight: 600 !important;
height: 26px !important;
font-weight: 600 !important;
font-size: 14px !important;
width: 125px !important;
height: 32px !important;
}
.ads-homepage .guided-tour-banner .ads-tour-btn-container {
display: flex;
justify-content: flex-end;
align-items: center;
}
.ads-homepage .guided-tour-banner .tour-btn-container p {
font-size: 1.3em;
margin: 0;
margin-right: 15px;
}
.monaco-workbench .part.editor>.content .ads-homepage .extensions .extensions-tile-link {
text-decoration: none
}
.monaco-workbench .part.editor>.content .welcomePage .ads-homepage a {
text-decoration: none;
font-weight: 400
}
.monaco-workbench .part.editor>.content .welcomePage.emptyRecent .splash .recent .list {
display: none
}
.monaco-workbench .part.editor>.content .welcomePage .splash .recent .none {
display: none
}
.monaco-workbench .part.editor>.content .welcomePage.emptyRecent .splash .recent .none {
margin-top: 15px;
display: block
}
.monaco-workbench .part.editor>.content .welcomePage .enabledExtension {
display: none
}
.monaco-workbench .part.editor>.content .welcomePage .extensionPack {
display: flex;
justify-content: flex-end
}
.monaco-workbench .part.editor>.content .welcomePage .installExtension.installed {
display: initial
}
.monaco-workbench .part.editor>.content .welcomePage .commands .item button .enabledExtension {
display: none
}
.file-icons-enabled .show-file-icons .az-data-welcome-page-name-file-icon.file-icon::before {
content: " ";
background-image: url('../../../../../../vs/workbench/browser/media/code-icon.svg');
}
.monaco-workbench .part.editor>.content .welcomePage .linux-only, .monaco-workbench .part.editor>.content .welcomePage .mac-only, .monaco-workbench .part.editor>.content .welcomePage .windows-only {
display: none
}
.monaco-workbench.mac .part.editor>.content .welcomePage .mac-only {
display: block
}
.monaco-workbench.windows .part.editor>.content .welcomePage .windows-only {
display: block
}
.monaco-workbench.linux .part.editor>.content .welcomePage .linux-only {
display: block
}
.monaco-workbench.mac .part.editor>.content .welcomePage li.mac-only {
display: list-item
}
.monaco-workbench.windows .part.editor>.content .welcomePage li.windows-only {
display: list-item
}
.monaco-workbench.linux .part.editor>.content .welcomePage li.linux-only {
display: list-item
}
.monaco-workbench .part.editor>.content .welcomePage .installExtension.installed {
display: none
}
.monaco-workbench .part.editor>.content .welcomePage .enabledExtension.installed {
display: inline
}
|
The legacy of the Olympic Stadium is uncertain, with the Olympic Park Legacy Company keen to secure a role for athletics at the venue. Photograph: Sean Dempsey/PA
The sports minister, Hugh Robertson, has said the government is unlikely to underwrite a bid for the world athletics championships in 2015, once seen as a likely showcase for the legacy use of the Olympic Stadium after the 2012 Games.
UK Athletics and the London Olympic Games Organising Committee chairman, Lord Coe, are keen for the 2015 world championships to come to London but the bid is likely to be withdrawn if they cannot secure government support.
Robertson said an independent study had shown that UK Athletics would not be able to cover the cost of the event from sponsorship and ticket sales, so the government would not be able to commit to underwriting any funding gap.
"The question is not the guarantees around visas and so on. I have said we will do that. The question is how you fill a £25m black hole that lies at the centre of this bid," Robertson said, speaking at an event to showcase the legacy vision for the Queen Elizabeth Olympic Park, as it will be called after the Games.
"Some of this you can fill through sponsorship and other things but it's still going to leave a pretty sizeable commitment. Once you have done it for one sport, then every single other sport trying to mount a bid is going to be after me for the same sort of money."
It is unlikely the government would have to bear the full burden of the losses, which could run to £25m, but Robertson said he was not prepared to take the risk. He said other sports bidding for major events, such as the Rugby Football Union's to host the 2015 World Cup, had needed to prove they were likely to break even before the government would commit to underwrite the cost of hosting them.
Beijing is the only other likely bidder for the 2015 event and the IAAF is expected to look favourably on a European bid. It would be one of the few events capable of filling the Olympic Stadium for athletics if it retains the running track and a capacity of 55,000, as envisaged under the joint bid from West Ham United and Newham council.
Margaret Ford, the Olympic Park Legacy Company chair, stopped short of ruling out the rival bid from Tottenham Hotspur and AEG on the grounds that it proposes to remove the track. But while refusing to comment on individual bids, she signalled it would not be looked on favourably if there was no legacy for athletics. "One of our criteria was they had to tell how us how they would meet the Olympic promise for athletics in legacy. That has not changed," she said.
Robertson added: "It [athletics] was an absolutely core part of our bid ... and that commitment will be honoured." Robertson said there will be no final decision on the world championships until after the comprehensive spending review on 20 October, and UK Athletics will continue to press its case.
"If UK Athletics wants an answer from me on this before then it will be 'no'. I will not make any decision before I know how much money we have to spend. But if I have to make a choice between underwriting losses and funding elite athletes I will choose athletes every time," he said. |
Canada: How To Wait Out Donald Trump's Presidential Term In Canada
Back in March 2016, I discussed whether Americans could move to Canada if
Donald Trump actually became President. This was several
months before he actually secured the Republican
nomination.
Now that Donald Trump has won the election, many Americans are
once again considering the possibility of moving to Canada.
In fact, it was widely reported that on Election Day, as it
became increasingly likely that Donald Trump would become
President, the website of Immigration, Refugees and Citizenship
Canada (formerly known as Citizenship and Immigration Canada)
crashed due to the increased traffic.
In March 2016, I reported that it was more difficult to
permanently move to Canada than most Americans realized.
However, I also suggested that something less than permanent
residence might be sufficient to address the needs of Trump-dodging
Americans. In light of Donald Trump's recent election
victory, it is worthwhile to discuss these temporary options
again.
Among disillusioned Americans, it is widely believed that Donald
Trump will not win a second term as President. In fact, some outspoken Americans have opined that he
will not even finish his initial four-year term. In any
event, if we assume that Donald Trump would not serve a second
term, permanent resident status in Canada is clearly not
required.
There are several options available that would permit a U.S.
citizen to temporarily reside in Canada for the next four
years. A description of the most viable temporary options for
U.S. citizens appears below.
Study in Canada
This option may be more relevant to younger Americans.
However, it is a viable option for any anyone who wishes to pursue
a post-secondary education in Canada.
A foreign national who is accepted into a full-time program at a
designated post-secondary institution in Canada may obtain a study
permit, which will allow them to remain in Canada until the
completion of their studies. For example, a bachelor degree
program typically lasts four years in Canada, more than sufficient
to avoid President Trump's four-year term.
During their academic studies, international students may work
either on-campus or off-campus, for up to 20 hours per week during
the school year and 40 hours per week during holidays. There
is no need to obtain a separate work permit in order to do
this.
Upon completion of their studies, an international student may
also seek a post-graduation work permit, which will allow them to
continue working in Canada. The duration of this
post-graduation work permit will vary depending on the duration of
the academic program.
Work in Canada as a NAFTA Professional
As a result of the North American Free Trade Agreement
("NAFTA"), U.S. citizens (and Mexican citizens also) have
the ability to seek a NAFTA Professional work permit, if they fall
under one of the professions listed in Appendix 1603.D.1
to Annex 1603 of the NAFTA. These work permits may be issued
for up to three years at a time, with no cap on the number of
renewals.
The list of eligible professions is intended to be
comprehensive; if an occupation does not appear in Appendix
1603.D.1, it is not eligible for a NAFTA Professional work
permit. Traditional professions such as lawyer, accountant,
engineer, and even computer systems analyst are listed.
However, managerial positions do not appear in Appendix
1603.D.1. The only management-related profession listed is
"management consultant" but it is not available to
applicants who are assuming an existing or newly created permanent
position with the U.S. entity.
In most, but not all of the listed professions, a baccalaureate
(or higher) degree is required. Although not specifically stated in
Appendix 1603.D.1, the applicant's degree must in the same
field as the listed profession (or in a closely related
field). That said, some professions permit alternate
credentials, such as a two year post-secondary diploma plus three
years of relevant work experience (i.e. computer systems analyst)
or five years of relevant work experience (i.e. management
consultant).
It should be mentioned that NAFTA Professional work permits are
intended for applicants who are seeking entry to provide
pre-arranged professional services to a Canadian employer or
client. They cannot be used by applicants who will engage in
self-employment, which includes the provision of professional
services to a Canadian employer or entity over which they have
significant ownership or control. In other words, NAFTA
Professionals require an arms-length Canadian employer or client
who will retain them to provide professional services.
Admittedly, Donald Trump has threatened to renegotiate the NAFTA, and to
withdraw from the agreement if he cannot obtain the terms that he
wants. However, according to CIBC, if the United States does
withdraw from the NAFTA, Canada and the United States could revert
back to the Canada-United States Free Trade Agreement
("CUSFTA"), which was in place before the NAFTA.
The CUSFTA contained immigration provisions that were similar to
the NAFTA. Assuming that this occurs, the professional work
permit category should continue to be available.
Work in Canada as an Intra-Company Transferee
("ICT")
This is the most common work permit category used by employees
of multinational organizations. The ICT work permit is
available to executive, managerial, or specialized knowledge
employees who have been employed with a foreign employer for at
least one year during the preceding three years, and who are
transferring to a related entity in Canada in a similar
position.
Americans fortunate enough to be working for a multinational
organization may be eligible for an ICT work permit, if they can
convince their employer to transfer them to their Canadian
office. However, given the significant number of anti-Trump protests that
have occurred since the U.S. election, it is likely that other
employees have already asked HR about a transfer to
Canada.
Employees of small and medium sized enterprises may also qualify
for ICT work permits, as long as they meet the requirements of the
category. So the owner of a small or medium sized company,
which has sufficient staffing to establish his or her
executive/managerial position, could be transferred to the
company's related entity in Canada. It is also possible
to establish a new Canadian entity in order to facilitate such a
transfer but, in new office situations, the initial ICT work permit
will be issued for one year instead of three years (although
subsequent extensions are permitted).
Except in the case of a new office, ICT work permits are issued
for up to three years initially. Extensions may also be
granted up to a maximum of seven years for executives and managers,
or five years for specialized knowledge workers. This would
be more than sufficient to avoid Donald Trump's entire
four-year term.
Although the NAFTA ICT work permit could be eliminated if Donald
Trump withdraws from the NAFTA, a similar work permit also existed
under the CUSFTA. More importantly, there is a parallel ICT
category available to all nationalities, which would continue to be
available even if President Trump withdraws from the
NAFTA.
Work as a NAFTA Treaty Investor or Treaty Trader
NAFTA Treaty Trader and Treaty Investor work permits are
entrepreneurial work permits given to self-employed business owners
(holding either U.S. or Mexican citizenship) who either:
Carry on substantial trade in goods or services principally
between the United States and Canada (Treaty Trader); or
Establish or purchase a business in Canada in which they have
invested a substantial amount of capital (Treaty Investor).
This work permit category also includes supervisory, executive,
or essential skills employees of the Treaty Trader or Treaty
Investor.
The Treaty Trader and Treaty Investor categories are based on
the NAFTA. However, similar work permit categories also
existed under the CUSFTA. Assuming that the United States and
Canada reverted back to the CUSFTA, Treaty Trader and Treaty
Investor work permits should continue to be available even if
President Trump withdraws from the NAFTA.
Treaty Investor and Treaty Trader work permits are issued for
only one year initially. However, they may be extended for
two years at a time, with no limit on the number of extensions that
may be granted. This is more than sufficient to avoid Donald
Trump's entire four-year term.
Conclusion
Despite the numerous media reports, which claim (truthfully)
that moving to Canada is difficult, there are still many temporary
options available to Americans. Any one of these temporary
options could allow a disillusioned U.S. citizen to wait out Donald
Trump's presidential term from the comfort of
Canada.
The content of this article is intended to provide a general
guide to the subject matter. Specialist advice should be sought
about your specific circumstances.
To print this article, all you need is to be registered on Mondaq.com.
Click to Login as an existing user or Register so you can print this article.
On June 19, 2017, Bill C-6, which proposed numerous amendments to the Canadian Citizenship Act, (R.S.C., 1985, c. C-29), received Royal Assent. Bill C-6 attempts to reverse many of the changes contained...
August 3, 2017 - Canadian permanent residents must now present their permanent resident card or permanent resident travel document to board a flight to Canada, or enter the country by any other commercial means. Not carrying the card or document may result in a permanent resident not being allowed to board a flight, train, bus or boat.
August 3, 2017 - Learn on the GO: Stream our podcast covering all the changes made to the Canada Citizenship Act, Bill C-6. These changes will be phased in with some taking place immediately, others in the fall 2017 and the final modifications in early 2018.
August 3, 2017 - The risk of hiring an overseas immigration consultant to handle your Canada immigration case is highlighted in an ongoing case involving 57 candidates rejected en masse. The 57 cases were candidates who all used the same unlicensed immigration consultant outside Canada.
This is a must read by any applicant to Canada.
July 3, 2017 – Changes to the Canada Citizenship Act Bill C-6 will come into force in stages with some taking place immediately, others in fall 2017 and the final modifications in early 2018. Our summary outlines when new changes will be made with comparisons to the old law.
This service is completely free. Access 250,000 archived articles from 100+ countries and get a personalised email twice a week covering developments (and yes, our lawyers like to think you’ve read our Disclaimer).
Email Address
Company Name
Password
Confirm Password
Position
Mondaq Topics -- Select your Interests
Accounting
Anti-trust
Commercial
Compliance
Consumer
Criminal
Employment
Energy
Environment
Family
Finance
Government
Healthcare
Immigration
Insolvency
Insurance
International
IP
Law Performance
Law Practice
Litigation
Media & IT
Privacy
Real Estate
Strategy
Tax
Technology
Transport
Wealth Mgt
Regions
Africa
Asia
Asia Pacific
Australasia
Canada
Caribbean
Europe
European Union
Latin America
Middle East
U.K.
United States
Worldwide Updates
Check to state you have read and agree to our Terms and Conditions
Terms & Conditions and Privacy Statement
Mondaq.com (the Website) is owned and managed by Mondaq Ltd and as a user you
are granted a non-exclusive, revocable license to access the Website under its
terms and conditions of use. Your use of the Website constitutes your agreement
to the following terms and conditions of use. Mondaq Ltd may terminate your use
of the Website if you are in breach of these terms and conditions or if Mondaq
Ltd decides to terminate your license of use for whatever reason.
Use of www.mondaq.com
You may use the Website but are required to register as a user if you wish to
read the full text of the content and articles available (the Content). You may
not modify, publish, transmit, transfer or sell, reproduce, create derivative
works from, distribute, perform, link, display, or in any way exploit any of the
Content, in whole or in part, except as expressly permitted in these terms &
conditions or with the prior written consent of Mondaq Ltd. You may not use
electronic or other means to extract details or information about Mondaq.com’s
content, users or contributors in order to offer them any services or products
which compete directly or indirectly with Mondaq Ltd’s services and products.
Disclaimer
Mondaq Ltd and/or its respective suppliers make no representations about the
suitability of the information contained in the documents and related graphics
published on this server for any purpose. All such documents and related
graphics are provided "as is" without warranty of any kind. Mondaq Ltd and/or
its respective suppliers hereby disclaim all warranties and conditions with
regard to this information, including all implied warranties and conditions of
merchantability, fitness for a particular purpose, title and non-infringement.
In no event shall Mondaq Ltd and/or its respective suppliers be liable for any
special, indirect or consequential damages or any damages whatsoever resulting
from loss of use, data or profits, whether in an action of contract, negligence
or other tortious action, arising out of or in connection with the use or
performance of information available from this server.
The documents and related graphics published on this server could include
technical inaccuracies or typographical errors. Changes are periodically added
to the information herein. Mondaq Ltd and/or its respective suppliers may make
improvements and/or changes in the product(s) and/or the program(s) described
herein at any time.
Registration
Mondaq Ltd requires you to register and provide information that personally
identifies you, including what sort of information you are interested in, for
three primary purposes:
To allow you to personalize the Mondaq websites you are visiting.
To enable features such as password reminder, newsletter alerts, email a
colleague, and linking from Mondaq (and its affiliate sites) to your website.
Mondaq (and its affiliate sites) do not sell or provide your details to third
parties other than information providers. The reason we provide our information
providers with this information is so that they can measure the response their
articles are receiving and provide you with information about their products and
services.
If you do not want us to provide your name and email address you may opt out
by clicking here .
If you do not wish to receive any future announcements of products and
services offered by Mondaq by clicking here .
Information Collection and Use
We require site users to register with Mondaq (and its affiliate sites) to
view the free information on the site. We also collect information from our
users at several different points on the websites: this is so that we can
customise the sites according to individual usage, provide 'session-aware'
functionality, and ensure that content is acquired and developed appropriately.
This gives us an overall picture of our user profiles, which in turn shows to
our Editorial Contributors the type of person they are reaching by posting
articles on Mondaq (and its affiliate sites) – meaning more free content for
registered users.
We are only able to provide the material on the Mondaq (and its affiliate
sites) site free to site visitors because we can pass on information about the
pages that users are viewing and the personal information users provide to us
(e.g. email addresses) to reputable contributing firms such as law firms who
author those pages. We do not sell or rent information to anyone else other than
the authors of those pages, who may change from time to time. Should you wish us
not to disclose your details to any of these parties, please tick the box above
or tick the box marked "Opt out of Registration Information Disclosure" on the
Your Profile page. We and our author organisations may only contact you via
email or other means if you allow us to do so. Users can opt out of contact when
they register on the site, or send an email to [email protected] with “no
disclosure” in the subject heading
Mondaq News Alerts
In order to receive Mondaq News Alerts, users have to complete a separate
registration form. This is a personalised service where users choose regions and
topics of interest and we send it only to those users who have requested it.
Users can stop receiving these Alerts by going to the Mondaq News Alerts page
and deselecting all interest areas. In the same way users can amend their
personal preferences to add or remove subject areas.
Cookies
A cookie is a small text file written to a user’s hard drive that contains an
identifying user number. The cookies do not contain any personal information
about users. We use the cookie so users do not have to log in every time they
use the service and the cookie will automatically expire if you do not visit the
Mondaq website (or its affiliate sites) for 12 months. We also use the cookie to
personalise a user's experience of the site (for example to show information
specific to a user's region). As the Mondaq sites are fully personalised and
cookies are essential to its core technology the site will function
unpredictably with browsers that do not support cookies - or where cookies are
disabled (in these circumstances we advise you to attempt to locate the
information you require elsewhere on the web). However if you are concerned
about the presence of a Mondaq cookie on your machine you can also choose to
expire the cookie immediately (remove it) by selecting the 'Log Off' menu option
as the last thing you do when you use the site.
Some of our business partners may use cookies on our site (for example,
advertisers). However, we have no access to or control over these cookies and we
are not aware of any at present that do so.
Log Files
We use IP addresses to analyse trends, administer the site, track movement,
and gather broad demographic information for aggregate use. IP addresses are not
linked to personally identifiable information.
Links
This web site contains links to other sites. Please be aware that Mondaq (or
its affiliate sites) are not responsible for the privacy practices of such other
sites. We encourage our users to be aware when they leave our site and to read
the privacy statements of these third party sites. This privacy statement
applies solely to information collected by this Web site.
Surveys & Contests
From time-to-time our site requests information from users via surveys or
contests. Participation in these surveys or contests is completely voluntary and
the user therefore has a choice whether or not to disclose any information
requested. Information requested may include contact information (such as name
and delivery address), and demographic information (such as postcode, age
level). Contact information will be used to notify the winners and award prizes.
Survey information will be used for purposes of monitoring or improving the
functionality of the site.
Mail-A-Friend
If a user elects to use our referral service for informing a friend about our
site, we ask them for the friend’s name and email address. Mondaq stores this
information and may contact the friend to invite them to register with Mondaq,
but they will not be contacted more than once. The friend may contact Mondaq to
request the removal of this information from our database.
Security
This website takes every reasonable precaution to protect our users’
information. When users submit sensitive information via the website, your
information is protected using firewalls and other security technology. If you
have any questions about the security at our website, you can send an email to
[email protected].
Correcting/Updating Personal Information
If a user’s personally identifiable information changes (such as postcode),
or if a user no longer desires our service, we will endeavour to provide a way
to correct, update or remove that user’s personal data provided to us. This can
usually be done at the “Your Profile” page or by sending an email to [email protected].
Notification of Changes
If we decide to change our Terms & Conditions or Privacy Policy, we will
post those changes on our site so our users are always aware of what information
we collect, how we use it, and under what circumstances, if any, we disclose it.
If at any point we decide to use personally identifiable information in a manner
different from that stated at the time it was collected, we will notify users by
way of an email. Users will have a choice as to whether or not we use their
information in this different manner. We will use information in accordance with
the privacy policy under which the information was collected.
How to contact Mondaq
If for some reason you believe Mondaq Ltd. has not adhered to these
principles, please notify us by e-mail at [email protected] and we will use
commercially reasonable efforts to determine and correct the problem promptly. |
A preliminary study of epilepsy in children using diffusional kurtosis imaging.
To study brain abnormalities, in terms of non-Gaussian water diffusion properties using diffusional kurtosis imaging (DKI) in children with electroencephalography (EEG) confirmed epilepsy lateralized to both hemispheres. A total of 15 children with epileptiform waves on EEG in both hemispheres and 18 children as normal controls (NC) matched for age and sex were recruited. Data from DKI for all children were used to characterize non-Gaussian properties. Fractional anisotropy (FA), mean diffusivity (MD), and mean kurtosis (MK) maps were estimated from the DKI datasets. Voxel-based analyses (VBA) based on these measures were performed and compared between the epilepsy and NC groups. The VBA showed abnormal regions in both white matter (WM) and gray matter (GM) in those with epilepsy. Analysis of FA values revealed that the abnormal regions were significant mainly in the left frontal and temporal lobes of the WM. Analysis of MD values revealed that differences were significant mainly in the right hemisphere of the limbic lobe, uncus, parahippocampal region, both in GM and WM of frontal and temporal lobes, and GM of the rectus of the left cerebrum. Finally, analysis of MK values revealed significant differences mainly in WM of the frontal lobes of both cerebrum, and GM and WM of the parietal lobe of the right cerebrum. These preliminary results suggest that DKI is sensitive for the characterization of diffusion abnormalities in both WM and GM of children with epilepsy. |
Politics 2010: No love lost for some New York primary candidates
ALBANY, N.Y., Sept. 12 (UPI) -- A match brewing for three decades comes to fruition Tuesday when Adam Clayton Powell IV takes on troubled U.S. Rep. Charles Rangel in a Democratic primary race in New York.
Powell recalls how Rangel invited him into his Capitol Hill office after Rangel waged a bruising primary fight to beat Powell's father, acknowledging he essentially ended the career of the celebrated Harlem politician, The New York Times said.
Now it's the younger Powell with Rangel in his sights, unremittingly attacking the 80-year-old lawmaker, saying his conduct -- Rangel faces 13 charges of ethics violations and a public trial in the House -- is "corrupt" and calling his wanting a 21st term "pointless."
"My dad fought the system his whole career," Powell told the Times. "Charles Rangel became part of the system. He embraces the political trade and the political games, and he rejoices in the backslapping and connections."
Powell first challenged Rangel -- despite being urged not to -- in 1994 and was trounced, losing by a 2-to-1 margin.
In the contest, the Times endorsed former Seagram's executive and educator Joyce Johnson, despite her struggles in the primary, saying she "has been a strong advocate for women's rights and civil rights for many years."
The other candidates running against Rangel are banker Vince Morgan and labor activist Jonathan Tasini. A fifth Democrat, Craig Schley, is running on the Independence Party ticket.
The Empire's State's senate delegation -- Charles Schumer and Kirsten Gillibrand -- are running for re-election, face token primary opposition and are considered safe bets to return to Washington, several media outlets said.
Gillibrand, appointed when Hillary Clinton became secretary of State, has a primary challenge from the liberal wing of the party -- New York corporation counsel staffer Gail Goode.
The Republican race features ex-Rep. Joe DioGuardi, former Port Authority Commissioner and Nassau County legislator Bruce Blakeman, and economist David Malpass.
While battling each other for the chance to square off against Gillibrand in the fall, all three Republicans, for one night, agreed on one thing: the state GOP leader has dropped the ball -- not a good thing in a year when polls indicate Republicans nationally are expected to make huge gains in November, The Wall Street Journal reported.
"He didn't do right by me at the convention," said DioGuardi, who is backed by the Conservative Party.
Even Blakeman, the state party's official choice, said Ed Cox "should have put more effort into unifying around me as the designee of the party. We are spending valuable time and resources fighting each other rather than gearing up for the contest with Senator Gillibrand."
Schumer's popularity may have dipped some, but pundits say no Republican is positioned to take advantage of the slip -- and Schumer's feistiness and $21.8 million war chest aren't for the faint of heart, CQ Politics said.
The Republicans vying to run against Schumer -- political consultant Jay Townsend and former CIA agent Gary Berntsen -- both saying they're electable.
Townsend argues he's the better candidate because he's endorsed by the Conservative party, a necessary backing for any Republican running in a statewide election in New York, WNYC public radio reported.
"I'm the only one on stage tonight who will have the Conservative line," Townsend said in a recent debate. "No Republican has won a statewide election in New York without the Conservative line since Gerry Ford."
Berntsen, however, touts his Taxpayer backing.
"I have the Taxpayer line, a new line that was created. I am the Republican designee, having won by 25 percent at the convention," he said. "I will turn out a large number of Republicans, I will turn out the Tea Party, in force. The Tea Party is the new conservative movement in New York. The Conservative Party will be small in comparison."
Turning to the gubernatorial race, Gov. David Paterson, assuming office when Eliot Spitzer resigned in disgrace and beset by controversy of his own, chose not to seek re-election, opening up the office for both Democrats and Republicans.
With Paterson out of the picture, state Attorney General Andrew Cuomo, son of three-term governor Mario Cuomo, emerged as the front-runner to keep the seat in the Democratic fold. CQ Politics changed its rating on the general election to "Likely Democratic" from the more competitive category of "Leans Democratic."
Cuomo's opponent is private investigator Jimmy McMillan.
The Republican primary race is messier. The seemingly smooth road to November for former U.S. Rep. Rick Lazio got bumpy when Carl P. Paladino, a Buffalo developer, entered the race and indicated he was willing to pump as much as $10 million of his own money into his campaign.
Lazio's campaign has been an uphill battle, the New York Daily News said. He fought off a potential challenge from party-switching Suffolk County Executive Steve Levy and he's had trouble raising cash.
United Press International is a leading provider of news, photos and information to millions of readers around the globe via UPI.com and its licensing services.
With a history of reliable reporting dating back to 1907, today’s UPI is a credible source for the most important stories of the day, continually updated - a one-stop site for U.S. and world news, as well as entertainment, trends, science, health and stunning photography. UPI also provides insightful reports on key topics of geopolitical importance, including energy and security.
A Spanish version of the site reaches millions of readers in Latin America and beyond.
UPI was founded in 1907 by E.W. Scripps as the United Press (UP). It became known as UPI when after a merger with the International News Service in 1958, which was founded in 1909 by William Randolph Hearst. Today, UPI is owned by News World Communications. |
Q:
PHP - Proper grouping of data and getting the in between data
I have a table for booking:
id room_id start end
1 1 2019-10-04 2019-10-14
2 1 2019-10-13 2019-10-22
3 1 2019-12-16 2019-12-25
4 1 2019-11-30 2019-12-18
Table for room:
id name type
1 002 1-A
2 005 3-B
So I just wanted a sample for only one roomtype 1-A I wanted to group the booking using foreach to this output:
start_date => 2019-10-04 AND end_date => 2019-10-22
start_date => 2019-11-30 AND end_date => 2019-12-25
There should be 2 groups.
I tried using this
$new = array();
foreach($bookingArr as $booking) {
$new[$booking->room_id][$booking->start][] = $booking;
}
But I dont get the output I wanted.
A:
first you need to order results by start date.
after you need to implement intersection of date start-end periods.
assuming it's done the code may be smth similar to this one:
<?php
$bookingData = [
[
'room_type' => '1-A',
'start' => '2019-10-04',
'end' => '2019-10-14',
],
[
'room_type' => '1-A',
'start' => '2019-10-13',
'end' => '2019-10-22',
],
[
'room_type' => '1-A',
'start' => '2019-11-30',
'end' => '2019-12-18',
],
[
'room_type' => '1-A',
'start' => '2019-12-16',
'end' => '2019-12-25',
],
];
$output = [];
$k = -1;
foreach ($bookingData as $data) {
$curr = $output[$k] ?? null;
if ($curr !== null &&
$data['start'] >= $curr['start'] &&
$data['start'] <= $curr['end'] &&
$data['end'] > $curr['end']) {
$output[$k]['end'] = $data['end'];
} else {
$output[] = $data;
$k++;
}
}
foreach ($output as $item) {
echo sprintf("start_date => %s AND end_date => %s\r\n", $item['start'], $item['end']);
}
demo
|
Study shows most employers are not satisfied with employee participation in benefits
Sep 15, 2014
Many businesses go above and beyond the basics of HR solutions to offer employees a wide range of benefits. However, not all workers know they have these services at their fingertips and as a result, they are not taking advantage of the voluntary programs afforded to them.
Employers want more engagement with voluntary benefits
A recent study from MetLife found that, despite employee benefit satisfaction reaching a record high in 2013, most employers are unhappy with the rate of participation in voluntary programs. While 62 percent of businesses cite enrollment rates as the most important criteria for determining if a program is a success, and 59 percent want to offer more diverse services, few take the time to implement them properly.
That is ultimately a detriment to individual companies, as they may be doing a disservice to employees while also missing out on the chance to improve engagement and staff satisfaction.
"Our research shows that engaged employees not only lead to higher participation, but can also pay dividends when it comes to employee loyalty," said Michael Fradkin, the senior vice president of markets and growth strategies at MetLife. "The study finds employees who strongly agree that their company's communications help them select benefits that best meet their needs are more than twice as likely to say they are 'very loyal' to their employers."
Identifying obstacles to participation
Companies that are dissatisfied with employee participation with regard to voluntary benefits may be suffering from a lapse in communication. Staff members may be simply unaware of the many options they have, or they could be unsure of how to go about enrolling in these programs. According to the study, about 38 percent of employees said they were not confident they made the right decision regarding their benefits at the start of the last enrollment period, and more than half said they would like more help with regard to understanding how their HR services work.
"If employers add to their benefits offering, but aren't seeing the employee participation levels they anticipated, this may indicate a need for better benefits education and communications, rather than a lack of interest on the part of employees," Fradkin added.
Companies can find easier ways to improve engagement
Businesses that take the time to communicate with employees may see enrollment numbers increase, and with it employee satisfaction. Human resource outsourcing can be particularly beneficial in these situations, as an accredited service will be familiar with the best ways to inform the staff. By educating workers and supplying them with the benefits they want, employers can make the most of their programs – and enjoy the many advantages that follow. |
package com.wknight.safe.shield.util;
import org.jf.smali.Smali;
import org.jf.smali.SmaliOptions;
import java.io.IOException;
import java.util.ArrayList;
import java.util.List;
public class DexBuilder{
private String out;
private List<String> input;
private SmaliOptions options;
public DexBuilder(String in, String out) {
this.input = new ArrayList<String>();
this.input.add(in);
this.out = out;
options = getOptions();
}
public void buildDex() {
try {
Smali.assemble(options, input);
} catch (IOException ex) {
throw new RuntimeException(ex);
}
}
protected SmaliOptions getOptions() {
SmaliOptions options = new SmaliOptions();
options.jobs = Runtime.getRuntime().availableProcessors();
options.apiLevel = 15;
options.outputDexFile = out;
options.allowOdexOpcodes = false;
options.verboseErrors = false;
return options;
}
}
|
Introduction
============
A few complex theories explaining the neurobiological processes of schizophrenia have been developed based on growing evidence, mostly from neuroimaging studies. The neurodegenerative theory of schizophrenia is based on Kraepelin's observation on the progressive illness process. Liebermann[@b1-ndt-15-839] proposed the hypothesis that schizophrenia involves a limited neurodegenerative process reflected by psychotic symptoms, and moreover such a process is most active in the early stages of illness. According to the neurodevelopmental theory of schizophrenia, etiologic and pathogenic factors occur early in brain development, and symptom occurrence is connected with the normal maturation of brain areas affected by early developmental pathology, particularly the dorsolateral prefrontal cortex.[@b2-ndt-15-839] Woods[@b3-ndt-15-839] proposed a progressive developmental mechanism of schizophrenia that can reconcile neuropathological and imaging data, while being compatible with early onset and late deterioration. With regard to these three theories, time and duration of disease are very important variables for morphological and neurochemical brain changes in schizophrenia.
Magnetic resonance spectroscopy (MRS) may allow for testing the neurobiological models of pathogenesis of psychiatric diseases.[@b4-ndt-15-839]--[@b9-ndt-15-839] This method enables in vivo evaluation of chemical tissue composition and identification of chemical compounds. An *N*-acetylaspartate (NAA) signal is the most visible in proton spectra (^1^H MRS). The level of NAA increases during brain growth, and reflects the development of dendrites, synapses, and neuronal somata.[@b5-ndt-15-839] A decrease in NAA concentration in stroke may indicate neuronal loss or dysfunction. The relationship between NAA levels and duration of schizophrenia has been analyzed in cross-sectional studies. A significant inverse relationship between NAA and creatine--phosphocreatine (Cr) in the left dorsolateral prefrontal cortex and disease duration has been observed.[@b9-ndt-15-839] The mean duration of illness in that study was 6 years, so it suggests that reduced NAA concentration may occur primarily in the early years of the illness.[@b9-ndt-15-839] Other frequently checked spectroscopic brain metabolites include: glutamate--glutamine (Glx; combined signal, with minor contribution from GABA), choline-containing compounds (Cho; a measure of cellular density), Cr, a marker of cellular energy level, and myoinositol (mI; a marker of brain osmotic balance and glial cells).[@b5-ndt-15-839]--[@b9-ndt-15-839]
Most studies in this area have been cross-sectional, while longitudinal studies allow for distinguishing the progressive aspects of illness from static ones, but few studies have been reported. Longitudinal studies (lasting up to 24 months)[@b11-ndt-15-839],[@b12-ndt-15-839] point to a global or frontal brain NAA decrease or increase in the cingulate cortex and to a glutamate increase in the thalamus and cingulate, whereas a longitudinal study lasting 80 months[@b10-ndt-15-839] on schizophrenia duration/treatment, found no changes in NAA and decreased glutamate levels in the thalamus. Glutamatergic alterations and gray-matter loss in schizophrenia in longitudinal studies are consistent with neurodegeneration;[@b10-ndt-15-839] nevertheless, results regarding NAA levels were variable in these studies: a 2-year reduction or no NAA differences in a longer study.[@b10-ndt-15-839]--[@b12-ndt-15-839] As earlier longitudinal studies found changes only in glutamate levels, we decided to check and reexamine patients after 5 years of illness to determine whether other progressive metabolite changes would be observed in the frontal and temporal lobes, as well as in the thalamus. Our hypothesis was that NAA levels would be decreased.
Methods
=======
Subjects
--------
The first examination was performed during patients' first hospitalization at the Department of Psychiatry of the Medical University of Białystok and at the Psychiatric Hospital in Choroszcz. Subjects were included in the study from consecutively admitted patients. The original group consisted of 30 patients with first-episode schizophrenia.[@b13-ndt-15-839] For a current sample of eleven patients, there were five women and six men, with mean age 23.5±2.61 years and mean duration of illness 6 months. At baseline, patients were given the diagnosis of schizophrenia according to ICD10 criteria: paranoid type (n=9) and undifferentiated type (n=2). One patient was scanned as neuroleptic-naïve and ten received stable doses of antipsychotics (five risperidone, four olanzapine, one haloperidol). Mean antipsychotic doses (chlorpromazine equivalents) were 358 mg/day,[@b14-ndt-15-839] and the mean number of days on antipsychotic drugs was 50 days until the neuroimaging examination. The subgroup of eleven patients did not differ from the initial group of 30 patients in terms of sex, age, education, length of illness, severity of clinical symptoms, doses of antipsychotics, or length of treatment. All the examined patients were right-handed, determined with the Edinburgh Handedness Inventory.
The follow-up examination was performed 5 years after baseline examination (mean 67.1±12.42 months, 48--87 months). Patients were scanned and underwent clinical and cognitive examination. From the initial group of 30 patients, eleven were contacted and responded (the remaining 19 were lost to medical observation). These were inpatients (n=3) and outpatients (n=8). The mean age of patients was 28.7±2.68 years and mean length of illness 5.5±1.2 years. Ten patients met the criteria for schizophrenia -- eight paranoid type and two undifferentiated type -- and one for schizoaffective disorder. All patients were treated with antipsychotic medication (atypical and typical antipsychotics in combination: clozapine, olanzapine, risperidone, quetiapine, zuclopenthixol, haloperidol, perphenazine). The mean duration of treatment with the last medication before the second examination was 10 months, and the mean dose (chlorpromazine equivalents) was 376 mg/day.[@b14-ndt-15-839] Some patients were also treated with mood stabilizers (n=3) and antidepressants (n=4). Clinical symptoms at baseline and follow-up were assessed by a battery of psychiatric measures: Positive and Negative Syndrome Scale (PANSS),[@b15-ndt-15-839] Calgary Depression Scale for Schizophrenia (CDSS),[@b16-ndt-15-839] Clinical Global Impression (CGI),[@b17-ndt-15-839] and Global Assessment of Functioning (GAF). Study-exclusion criteria were central nervous system organic damage confirmed on routine neurological and MR examinations, present and active alcohol and other psychoactive substance dependence, and contraindications to conduct MR examinations.
This study was carried out in accordance with the recommendations of the Declaration of Helsinki and the Bioethical Committee of the Medical University of Białystok. The protocol was approved by the Bioethical Committee of the Medical University of Białystok. All subjects provided written informed consent in accordance with the Declaration of Helsinki to participate in the baseline assessment and after 5 years at follow-up.
MR imaging and ^1^H MRS
-----------------------
MR imaging and MRS examinations were performed at the Department of Radiology, Medical University of Białystok, on a 1.5 T scanner (Eclipse; Picker International, Highlands Heights, OH, USA) with a standard circularly polarized head coil. A description of this method has been provided by Galińska et al.[@b18-ndt-15-839] *T*~1~-weighted fast scans and conventional fast spin--echo *T*~2~-weighted series were obtained. ^1^H MRS examinations were carried out by means of single-voxel point-resolved spectroscopy (PRESS) sequences with the parameters T~R~=1,500 ms, T~E~=35 ms (T~E1~=\~17 ms), number of excitations 192, and 3,906 kHz bandwidth. Voxels of 2×2×2 cm^3^ were positioned in the left frontal lobe, left temporal lobe, and the left thalamus. In order to shorten the time of scanning, left-sided voxels were analyzed. A trained investigator located voxels by eye by means of *T*~1~-weighted sections in sagittal, coronal, and axial planes, and the inclusion of cerebrospinal fluid was minimized. The left frontal lobe voxel was localized in a region that included superior and middle frontal gyrus, above the anterior horns of the lateral ventricles, and comprised mostly of white matter and cortex. The left temporal lobe voxel was localized in the region that included the middle and inferior temporal gyrus. The left thalamus voxel included mostly thalamus tissue and small portions of different structures, eg, the posterior limb of the internal capsule ([Figure 1](#f1-ndt-15-839){ref-type="fig"}). For the follow-up scan, we took into consideration the voxel position at the initial scan. This was done individually for each patient. Next, the signal over the voxel was shimmed to within a line width of 3--7 Hz and transmitter-pulse power optimized by automated procedures. The multiply optimized insensitive suppression-- train method was applied to suppress the signal from water.[@b19-ndt-15-839]
Via 2.0C software provided by Picker was used to analyze spectroscopic data. ^1^H MRS data were zero-filled to 8,192 points and residual water resonances removed using time-domain high-pass filtering. Exponential Gaussian transformation was applied as a time-domain apodizing Gaussian filter. Next, data were Fourier-transformed and phase-corrected. After the application of a Legendre polynomial function to approximate the baseline, automated curve fitting was performed using an iterative, nonlinear least--squares fitting procedure by means of the Levenberg--Marquardt algorithm. Line shapes of the simulated peaks used in the fitting process were fixed with 85% Gaussian and 15% Lorentzian fractions. Simulated peaks were created using a table of brain metabolites within Via 2.0. Only spectra with the best fit (exactly overlapping and adjusted raw spectrum lines) were included. Metabolites assessed were NAA at 2.01 ppm, Glx in the area from 2.11 ppm to 2.45 ppm, Cho at 3.22 ppm, Cr at 3.03 ppm, and mI at 3.56 ppm ([Figure 1](#f1-ndt-15-839){ref-type="fig"}). Then, metabolite to creatine ratios were analyzed. The ratio of metabolites to unsuppressed water signals was also calculated: $$\frac{\text{Metabolite~area} \times 1,000}{\text{Unsuppressed~water~area}}$$
Cognitive functions
-------------------
Cognitive functions were tested by the Wisconsin Card Sorting Test (WCST), which is considered a measure of "executive function" and assesses abstract reasoning ability and flexibility in problem-solving.[@b20-ndt-15-839] We used the WCST Computer Version 2 Research Edition,[@b21-ndt-15-839] and analyzed the following measures: total errors, perseverative errors, nonperseverative errors, categories completed, and trials to complete first category.
Statistical analysis
--------------------
Statistical analysis was performed with the Polish version of Statistica 9.0. Metabolite ratios to creatine and water and clinical and neuropsychological results of patients at baseline and follow-up were compared using Wilcoxon's signed-rank test, due to the small sample. Relationships among all metabolites and clinical characteristics, doses, time of treatment, and neuropsychological results at start and follow-up were analyzed with Spearman's correlations. For these results, we also performed post hoc analyses with Bonferroni corrections. In addition, dose of antipsychotics and duration of treatment were also correlated with differences in metabolite levels (last minus first day of study) without post hoc analyses. *P*\<0.05 was taken as significant.
Results
=======
Mean metabolite ratios at baseline and follow-up are shown in [Table 1](#t1-ndt-15-839){ref-type="table"}. There were no significant differences in any region studied in NAA/Cr or NAA/H~2~O, the main metabolite of interest. No metabolite ratios from any of the three regions studied correlated with antipsychotic dose at baseline or follow-up. There was a trend toward a lower Cho/Cr ratio in the temporal lobe (*P*=0.068) and a trend (*P*=0.079) toward a higher Glx/H~2~O ratio in the left thalamus over 5 years.
Clinical characteristics of patients and WCST results are shown in [Table 2](#t2-ndt-15-839){ref-type="table"}. There was a significant improvement in patients' social, occupational, and school functioning according to the GAF scale (*P*\<0.05). Depressive symptoms significantly decreased (*P*\<0.05), and the general psychopathology score on the PANSS significantly improved (*P*\<0.05). No significant differences were observed between WCST results at baseline and second evaluation. NAA/Cr ratios from the left frontal region at follow-up significantly correlated with WCST results (trials to complete first category, *R*=−0.942; *P*=0.005). Using a Bonferroni-corrected significance level of *P*≤0.003 (or 0.05/15), this correlation did not survive this correction. At baseline examination, we did not observe a significant correlation of the frontal NAA/Cr ratio with the WCST results. We found a significant correlation between the 5-year difference in frontal NAA levels and the duration of the last antipsychotic treatment in this period (*R*=0.908; *P*=0.012; [Figure 2](#f2-ndt-15-839){ref-type="fig"}).
Discussion
==========
According to our knowledge, the present study is one of few published longitudinal ^1^H MRS reports on schizophrenia. Aoyama et al[@b10-ndt-15-839] followed 17 patients with schizophrenia for 80 months after diagnosis, Théberge et al[@b11-ndt-15-839] examined 16 patients with a first episode before and after 10 and 30 months of antipsychotic treatment, and Bustillo et al[@b12-ndt-15-839] scanned early-schizophrenia patients and repeated ^1^H MRS every 6 months up to 2 years (only six patients scanned at 2 years). We examined patients for a mean 67 months (\~5 years) after the onset of the illness, which is one of the longest observations.
In our study, no significant differences in NAA/Cr or NAA/H~2~O ratios in the left frontal lobe, left temporal lobe, or left thalamus were identified between baseline and follow-up. Previous longitudinal ^1^H MRS studies in schizophrenia have shown conflicting short-term results: frontal NAA was reduced within the first year of treatment,[@b22-ndt-15-839] but there were no changes in NAA in a 2-year evaluation;[@b12-ndt-15-839] NAA reduction in the left anterior cingulate and left thalamus was found only between 10-month and 80-month assessments, but not between start point and 80 months;[@b10-ndt-15-839] and in other 30-month study, NAA decrease was not found.[@b11-ndt-15-839] The results of our study and others may show metabolite alterations at different stages of illness. Probably, NAA lowering develops gradually over the duration of illness and would be more noticeable in continuing observation. On the other hand, NAA reduction may be observed only within the first year of treatment,[@b22-ndt-15-839] and potentially has a tendency to increase thereafter. It may also be that a larger group needs to be checked to show a real trend in NAA levels.
Since patients with schizophrenia have been treated with antipsychotic medications during long-term studies, NAA levels can be influenced by exposure to these medications. However, studies of patients with first-episode schizophrenia revealed no significant increase in previously lowered hippocampal and medial temporal NAA levels after 3 months of treatment.[@b23-ndt-15-839],[@b24-ndt-15-839] After 12 months of treatment with atypical antipsychotics, the NAA/Cr ratio in the dorsolateral prefrontal cortex did not significantly change in antipsychotic-naïve first-episode schizophrenia patients either.[@b25-ndt-15-839] Studies of chronic patients with schizophrenia have demonstrated NAA changes associated with antipsychotic treatment.[@b26-ndt-15-839]--[@b28-ndt-15-839] Therefore, type of antipsychotic treatment may have an impact on NAA levels. Increased NAA can be related to risperidone[@b29-ndt-15-839] or clozapine treatment.[@b30-ndt-15-839] On the contrary, patients receiving typical neuroleptics show lower NAA in the thalamus compared to controls.[@b31-ndt-15-839] Moreover, there were no changes in NAA following treatment with haloperidol or quetiapine in one study.[@b12-ndt-15-839] In two studies performed by Bustillo et al,[@b12-ndt-15-839],[@b32-ndt-15-839] the antipsychotic treatment was randomized-controlled.
In our study, we did not control the regimen of treatment: we used a naturalistic design, and patients were receiving various antipsychotics (atypical and typical) due to their clinical condition. Patients in our study benefited clinically from pharmacological treatment, and at followup they exhibited improvement in social functioning and clinical symptoms (better GAF and PANSS scores). Therefore, a correlation between the 5-year difference in frontal NAA/Cr levels and duration of the last antipsychotic treatment in this period shows that the lack of significant decrease in NAA levels might have been due to effective treatment of schizophrenia. A better clinical state of schizophrenia patients at follow-up might potentially also have been due to adaptation to the disease/treatment and be the reason for the result of no longitudinal decline in cognitive processes.
Inconsistent results have been found regarding choline levels in schizophrenia.[@b33-ndt-15-839] Signals derived from choline-containing compounds are related to the concentration of phosphocholine and glycerophosphocholine, and choline level in ^1^H MRS is interpreted as a measure of overall cell density and alterations in neuron membrane or myelin turnover.[@b27-ndt-15-839],[@b33-ndt-15-839] Also, choline-containing compounds and mI connected with antigliadin antibodies may reflect brain inflammation in schizophrenia.[@b34-ndt-15-839] In a longitudinal study by Aoyama et al,[@b10-ndt-15-839] there was a trend of increasing thalamic choline levels at 80 months compared to the never-treated measure. In our study, we observed a trend toward a lower Cho/Cr ratio in the temporal lobe over 5 years, suggesting a longitudinal trend in cell density or impaired neuron-membrane or myelin function in this localization. In a study by Chang et al,[@b35-ndt-15-839] choline in the right frontal white matter was shown to decrease with age in elderly schizophrenic subjects.
Earlier studies also found increased glutamate levels in the thalamus and cingulate cortex in schizophrenia, whereas after 24--80 months of treatment, glutamate levels in the thalamus had decreased.[@b10-ndt-15-839],[@b11-ndt-15-839] We found a trend toward a higher Glx/H~2~O ratio in the left thalamus over the 5 years of our study. The different result of a glutamate increase in our study might have been due to the neurodegenerative tendency of the thalamus.[@b10-ndt-15-839] As in our study and the aforementioned,[@b10-ndt-15-839],[@b11-ndt-15-839] patients were treated with first- and second-generation antipsychotics, some differences in medications might not be excluded as a reason for these discrepancies in glutamate results.
In our study, cognitive function results did not significantly differ between the baseline examination performed in the first episode and after 5 years of schizophrenia. This is consistent with the results of other studies. Cognitive functions in patients with first-episode schizophrenia and recent-onset schizophrenia did not deteriorate over 5 years.[@b36-ndt-15-839] In addition, an improvement in verbal IQ and full-scale IQ was correlated with a reduction in negative symptoms, which supports the view that negative syndrome is more strongly related to the level of cognitive functions than psychotic or disorganized syndrome. In our study, the level of negative symptoms had a tendency to improve, but not strongly enough to improve cognitive functions. In another study, there was no decline in cognitive functions over the first 2 years after a first episode of psychosis.[@b37-ndt-15-839] In others, the cognitive decline observed in the first episode of schizophrenia remained relatively stable through at least 10 years of the illness,[@b38-ndt-15-839] executive deficits were present in first-episode psychosis, but there was no progress over 10--12 years,[@b39-ndt-15-839] and impairment in executive function was observed in schizophrenia through the various disease stages, and also the negative symptoms were able to be explained by that dysfunction.[@b40-ndt-15-839] Studies of gene interactions with symptoms severity and cognitive functioning may also explain schizophrenia pathophysiology.[@b41-ndt-15-839] We may also suggest that effective treatment might stop progression in cognitive deficit in our patients.
An important problem in longitudinal studies is to maintain the results from the same persons in subsequent examinations. The number of patients is decreasing in long-term 1H MRS examinations.[@b12-ndt-15-839],[@b24-ndt-15-839],[@b25-ndt-15-839],[@b32-ndt-15-839] In our study, subjects from the initial group (30 patients) were followed up, and only eleven (36%) were available for a second examination 5 years after the first examination (the remaining 19 patients were lost to medical observation). This problem occurs not only in neuroimaging studies but also in longitudinal studies of cognitive functions in patients with schizophrenia.[@b38-ndt-15-839] Some factors have to be taken into consideration, eg, uncooperative patients or cooperative patients who fail to report for a follow-up or quit due to changes in their living situation. Therefore, our study has certain limitations. Firstly, the limited size of the patient group might have been insufficient to detect significant changes in NAA between two study points, because of variability measurements made by the same method in the same person.[@b42-ndt-15-839] The absence of findings may also have been due to selection bias. However, our subsample of eleven patients did not differ clinically from the original sample of 30 patients. Secondly, we do not have results from a control group. Thirdly, we did not perform segmentation within the volume of interest. This procedure was not available in our study, and thus we cannot exclude the possibility of regional variations in metabolite concentration.[@b43-ndt-15-839] Other limitations may also include low field strength (1.5 T) and no partial volume correction. The use of the unsuppressed water signal as an internal standard enhances the meaning of our results, because the observed creatine level was relatively stable. The strength of this study is its longitudinal design, which is one of the longest ^1^H MRS observations of schizophrenia patients in the literature.
Conclusion
==========
Early-schizophrenia patients on neuroleptic treatment did not show significant regional NAA decline in the first 5 years of illness, which may have been due to the effect of schizophrenia treatment. A tendency shown toward lower Cho/Cr ratio in the temporal lobe over 5 years might point to a longitudinal trend in lower cell density or impaired neuron-membrane or myelin functions in the temporal lobe. A tendency toward higher glutamate levels might have been due to the involvement of thalamic dysfunction in the chronic schizophrenia process. Despite the choline and glutamate longitudinal changes/tendencies, these patients had no worsening of cognitive functions and a better clinical state. Further studies on large patient groups are required to check other long-term metabolic changes in different brain regions of schizophrenia patients.
This work was supported by a grant from the State Committee for Scientific Research (KBN, Poland): 3 PO5B 098 24.
**Disclosure**
The authors report no conflicts of interest in this work.
{#f1-ndt-15-839}
{#f2-ndt-15-839}
######
Neurochemical findings in patients with schizophrenia during index hospitalization and at 5-year follow-up
Metabolite ratios Baseline Follow-up *P*-value
-------------------- ----------- ----------- -----------
Left frontal lobe
NAA/Cr 2.00±0.34 1.68±0.26 0.236
Cho/Cr 1.04±0.15 1.02±0.15 0.612
mI/Cr 0.73±0.13 0.83±0.13 0.398
Glx/Cr 2.12±0.48 1.88±0.12 0.236
NAA/H~2~O 0.47±0.06 0.46±0.03 0.398
Cho/H~2~O 0.27±0.04 0.28±0.03 0.236
mI/H~2~O 0.19±0.04 0.23±0.06 0.176
Glx/H~2~O 0.54±0.09 0.51±0.06 0.612
Cr/H~2~O 0.25±0.04 0.27±0.03 0.345
Left temporal lobe
NAA/Cr 1.88±0.50 1.86±0.13 1.000
Cho/Cr 0.96±0.19 0.94±0.25 0.068
mI/Cr 0.69±0.13 0.62±0.30 1.000
Glx/Cr 2.41±0.44 2.33±0.62 0.285
NAA/H~2~O 0.40±0.05 0.48±0.10 0.179
Cho/H~2~O 0.24±0.03 0.22±0.07 0.592
mI/H~2~O 0.18±0.07 0.16±0.11 1.000
Glx/H~2~O 0.57±0.16 0.56±0.07 0.285
Cr/H~2~O 0.24±0.05 0.23±0.09 0.592
Left thalamus
NAA/Cr 1.99±0.29 1.86±0.28 0.345
Cho/Cr 0.88±0.08 0.90±0.20 0.463
mI/Cr 0.61±0.20 0.59±0.09 0.463
Glx/Cr 1.90±0.43 1.87±0.27 0.500
NAA/H~2~O 0.53±0.06 0.53±0.02 0.916
Cho/H~2~O 0.25±0.03 0.25±0.03 0.465
mI/H~2~O 0.15±0.04 0.21±0.12 0.345
Glx/H~2~O 0.48±0.12 0.53±0.04 0.079
Cr/H~2~O 0.28±0.03 0.28±0.04 1.000
**Notes:** Ratios given as mean ± SD. Wilcoxon's test was used for testing group differences.
**Abbreviations:** NAA, *N*-acetylaspartate; Glx, GABA, glutamine, glutamate; Cho, choline-containing compounds; Cr, creatine plus phosphocreatine; mI, myoinositol.
######
Clinical and cognitive findings in patients with schizophrenia during index hospitalization and at 5-year follow-up
Baseline Follow-up *P*-value
------------------------------------------------ ------------ ------------ --------------------------------------------------
CGI 4.64±0.92 3.91±1.22 0.066
GAF 49.1±9.70 59.5±16.80 0.011[\*](#tfn5-ndt-15-839){ref-type="table-fn"}
CDSS 8.7±7.18 3.7±3.41 0.011[\*](#tfn5-ndt-15-839){ref-type="table-fn"}
PANSS total 75.0±9.28 63.3±18.11 0.061
PANSS positive 17.8±3.25 14.8±5.12 0.059
PANSS negative 19.7±4.29 18.5±5.28 0.078
PANSS general 37.5±4.66 29.9±9.07 0.024[\*](#tfn5-ndt-15-839){ref-type="table-fn"}
TEs 36.3±27.77 31.3±22.93 0.398
PEs 19.4±14.94 14.9±10.75 0.151
NPEs[a](#tfn4-ndt-15-839){ref-type="table-fn"} 11.5 11.0 0.833
CCs[a](#tfn4-ndt-15-839){ref-type="table-fn"} 6.0 6.0 0.422
TCCs[a](#tfn4-ndt-15-839){ref-type="table-fn"} 11.5 12.0 0.865
**Notes:** Data given as mean ± SD or
median (variables with abnormal distribution, Shapiro--Wilk test). Wilcoxon's test was used for testing group differences.
*P*\<0.05.
**Abbreviations:** CGI, Clinical Global Impression; GAF, Global Assessment of Functioning; PANSS, Positive and Negative Syndrome Scale; CDSS, Calgary Depression Scale for Schizophrenia; TEs, total errors; PEs, perseverative errors; NPEs, nonperseverative errors; CCs, categories completed; TCCs, trials to complete first category.
|
Stock Levels May Vary
If you’re collecting from a Umart Store, don’t forget to choose a Pick Up location to see our live stock levels!
Specifications
Products name:
Razer Lancehead Tournament Edition Ambidextrous Gaming Mouse
Model #:
RZ01-02130100-R3A1
Brand:
Warranty:
12 Months
Description
THE WORLD™S MOST ADVANCED OPTICAL GAMING SENSOR FOR UNMATCHED ACCURACY
Equipped with an esports-grade optical sensor that has true 16,000 DPI and true tracking at 450 Inches Per Second (IPS), the Razer Lancehead Tournament Edition gives you the absolute advantage of having the fastest sensor in the world. This incredible mouse sensor crushes the competition with a Resolution Accuracy of 99.4%, so you can land more killing blows with pinpoint precision. |
Destruction of cultural heritage is also an attack on human rights defenders
October 31, 2016
When cultural heritage is under attack, it is also the people and their fundamental human rights that are under attack, a United Nations expert warned the UN General Assembly, issuing an urgent call to step up international action against the destruction of heritage such as monuments, historic sites and sacred places, reports Just Earth News on 28 October 2016.
Destruction of cultural heritage is an attack on people and their fundamental rights – UNESCO
“Afghanistan, Iraq, Libya, Mali and Syria are all in our minds on Thursday, but many more countries are to be added to this list, where acts of intentional destruction harm all, target free thinkers and disproportionately affect people belonging to minorities,” the UN Special Rapporteur on cultural rights, Karima Bennoune, stressed in her briefing to the General Assembly’s Third Committee.
According to Special Rapporteur, in order to protect cultural heritage, including precious monuments, sites and sacred places, the first step that has to be taken is protecting human rights and people. “Destruction is often accompanied by other grave assaults on human dignity and human rights. We must care not only about the destruction of heritage, but also about the destruction of the lives of human beings. They are interrelated,” Bennoune stated…
…At the end of her report, the Special Rapporteur paid tribute to all those who had sacrificed their lives to preserve world’s cultural heritage. “In many cases we must consider cultural heritage professionals on the frontlines of the struggle against destruction as human rights defenders,” Bennoune stated, adding that it is vital that we ensure their safety and security, grant them asylum, and create necessary work conditions for them. |
Pages
Tuesday, July 27, 2010
I'm a bit lazy when it comes to doing my hair so I usually opt for the easiest style I can go for. I either blow dry it straight or let it air dry wavy. Sometimes I wish I had something to add a little extra fun to my hair and I think I have found the perfect solution. Flower hair clips! I think these would be perfect especially for hot summer days when the high humidity means blow drying hair is a waste of time. Clip one of these onto your ponytail or pull your hair away from your face securing it with a Flowers From Fatima hair clip and you are good to go.
Monday, July 26, 2010
To put it simply, Ill say: think ahead. So often I find myself deciding what is aesthetically and characteristically pleasing to me, then seeing it a year later on a New York runway, and suddenly a piece will change from "Hey, that really suits you," to "Oh my god those are so [such and such a designer]" - it's that kind of personal creativity that keeps things snap snap snapping.
Who is your fashion inspiration?
I like to take inspiration in bits from so many different people - so for example, Alexa Chung's legs always look amazing: so I look at her leg wear and shoes. Catherine Baba is another amazing source of inspiration and creativity triggers.
What is your favourite place to shop?
Anywhere, in all seriousness. Before I go looking for something, I always have an idea in my head of exactly what I'm looking for and how it will fit with the rest of my wardrobe...and sadly, I'm the kind of person who won't rest until I get exactly that. There's only been a few times where I've had to go and buy the fabric to make the piece - if you look hard enough, everything is there.
Pointing no fingers, but I do hope nobody starts running around in velvet.
Why did you start your blog?
This time last year, after the Jean Paul Gaultier FW10 show, I was raving about the two tone tights (which I still haven't managed to find - so if anyone knows where I can get some, please let me know) for days on end with nobody to appreciate what I was talking about. I guess that's where the blog stemmed from - sharing what I felt was worth sharing, and having people give me their opinions.
Wearing a vintage cropped top, flee market ring, Bardot tutu skirt
How would you describe your style?
I like to think I'm pretty eclectic with my style - maybe not condensed into each individual outfit, but from day to day I'll vary how I approach pieces without thinking about it too much.
What is one thing you are dying to buy this spring?
Well, here in Australia, we're slowly working into the Autumn/Winter time of year. So all my little inspirations for Winter will be on top of my list.
What is your favourite vacation destination?
A few years ago, I did the equivalent of backpacking around Central America (Costa Rica, Nicaragua), obviously at a much younger age - most amazing experience of my life. If you ever get the chance, GO!
Thursday, July 22, 2010
I'm always on the lookout for fun and interesting flats. These Juicy Couture flats are perfect for adding some edge to a look. It looks like the stud trend will never end. In the summer I don't usually wear close toed shoes. I am all about the sandals but, I think this would be a great shoe to transition to in late August and September. I would wear these with skinny jeans for a casual look.
Wednesday, July 21, 2010
This Noir necklace is AMAZING. If I had money to spend I would buy it in a second. A necklace like this is best worn with simple clothes. There is no need to draw attention away from it with over complicated clothes. I would wear this with jeans and a tee for a casual look and a simple dress for night.
Tuesday, July 20, 2010
I'm a huge fan of bangles and I love to wear them high up on my arm. This House of Harlow bangle is super fun. I love the quirky horseshoe shape because it is simple but still a big different than most of the bangles I own. I think this would look great with denim and plain tee for a casual look.
Monday, July 19, 2010
I draw inspiration from everywhere. Life in general. Other bloggers, celebrities, friends, etc. I think the blogger community, though, is a great place to draw from because there is always someone, spoting something, you would have never thought to put together.
What is your favourite place to shop?
I love shopping online and buy almost all of my shoes there - I love coming home to a package from the UPS man. However, I could never give up shopping in stores in favour of online. My favourite places to shop at H&M and Forever 21. The stores offfer such great variety and styles, at even better price points. Sadly, we don't have either of those stores here (yet - I hope?) so when I don't travel to shop there, I really love Costa Blanca, Urban Behaviour, Dynamite, Sirens, Le Chateau, Suzy Shier, Winners, Adène (to name a few) - I'll shop anywhere, I don't discriminate and I enjoy taking time to browse through all the racks to find a great deal.
What is your current favourite fashion trend?
Lace. I love the femininity of it and it pairs well with more edgy pieces like leather jackets, studs, denim, etc. If it's done right, it will never look elderly.
What is the current trend you dislike the most?
I'm pretty open to all trends, but if I had to choose one, it'd be clogs. I know a lot of women are feeling them, including several of my blogger friends, but it is not for me. First, I hate the word, 'Clog', it makes me shudder (ha!) and the idea of rocking them just doesn't appeal to me. That said, when I see them on others, I'm indifferent. I can appreciate others' taste and taking risks in fashion.
Why did you start your blog?
One of my best friends, Kayla, had started a food blog and I was so inspired by it, I thought about starting my own blog. The only problem? I was unsure of what to blog about. I turned to my new blogging friend for advice, and she said it was a no-brainer: fashion, of course! She really encouraged me to start it, and within a week, I was up and running. Thanks to her, I've found a new, super-enjoyable hobby and have met tons of great girls in the blogosphere.
How would you describe your style?
My style is girly-chic with a bit of an edge. I tend to prefer skirts to pants (especially for work) and I love dressing up. However, I never want to look too perfect, and like to throw something in the mix to spice things up: a studded jacket, fierce peep-toe ankle booties, a man's watch, chunky jewellery, etc. Never too matchy-matchy.
What is one thing you are dying to buy this summer?
I don't think there is one thing in particular that I want to buy this summer, but in general, I'm dying for a pair of Louboutins. I've been coveting them for years, any pair will do, really (hehe). I am especially partial to the Very Privé in nude patent leather.
What is the most expensive thing you have bought?
This is a tough question as I tend to purchase more inexpensive items, however, the one label I refuse to 'go cheap on', so to speak, are Uggs. I cannot get enough, and winter in Ontario is rough (-30 degress Celcius or worse). Last year I bought the Bailey Button in grey and they got tons of play. Uggs may not seem uber expensive to some, but to get them in Canada, you are looking at at least $300. Add that with the fact that you are wearing them in snow and sleet (basically running the risk of ruining them with the first wear) doesn't help. However, the cusion, the warmth, and the durability of Uggs, makes it all worth it. I'm already debating which pair I'll purchase this fall.
What is the least expensive thing you have bought?
I recently bought a pair of barely-worn Aldo cork wedges from the thrift store for $5. The kicker? They are still selling these shoes in the store for $80. Major score.
What is one thing that you regret buying?
I don't regret buying anything. If I buy it and regret it, I return it, no questions. If I am unsure about something in the store, I'll leave it for a day. If I have to have it the next day, I go back and get it. If it's still there, it's meant to be.
If you could meet one person from the fashion industry / a fashion icon who would it be?
I've thought about this question for a while, and I guess I would have to say Monica Rose (http://monicarosestylist.blogspot.com/). Monica is a stylist to the stars, namely the Kardashians. I love the looks she puts together for those girls and can really relate to that style. She's got a fantastic blog, where she posts various shots of her clients and outlines what they are wearing, various inspiration, sales, looks she's lusting after, etc. There are a few pictures of her, but they are few and far in between, but in general, she just seems like such a cool girl with a fantastic eye for style.
What is your favourite vacation destination?
I haven't been to that many places, but am looking forward to my upcoming honeymoon (I'm getting married August 20th!). We haven't planned exactly where we will go, but it will be an all-inclusive down south somewhere. One place I really love though, is Coco Beach, Florida. About an hour outside of Orlando, the small beach town boasts beautiful beaches, a happenin' Pier, some great beach shops, a small mall, great mini golf and a plethora of restaurants. Travelling south in the winter is so fantastic because when you live in a place you get snow six months of the year, sitting on a beach in February is truly surreal.
Wednesday, July 14, 2010
I'm sure you guys have been wondering where I have disappeared to. Posts were still appearing everyday but I stopped commenting on blogs. Sorry, but I was on vacation! Most of you know that I am currently living in South America so I took a vacation to the coast, staying at my aunt's condo for a few days. The trip was fantastic. One of the highlights was a hike through the forest to the most gorgeous river you can imagine. We then rode the river currents down towards the ocean on tubes. There really are no words to describe how beautiful it was and the pictures don't do it justice. Along the river bank monkeys played in the trees and birds flew over us.
Palomino River
Of course there was also plenty of laying on the beach, $5 foot massages, mojito drinking and lobster eating.
View from the Condo
Sunset on the beach
And shopping...there were some indigenous women down the beach selling mochilas (bags). If you have been to Colombia bags made by indigenous people are a common sight and somewhat of a trend. I spotted a few that I loved and everything ended right there. I ended up walking away with a truck load of bags. Two for myself and the rest with the intention to sell. After I bought them I borrowed my aunts computer to do a bit of research and turns out the Wayuu mochilas are becoming somewhat of a trendy "it" item in North America. Even J. Crew was selling them but has already sold out. It's almost like I'm psychic. LOL.
The mochila that started it all (this ones not for sale)
Each bag is hand-made by a Wayuu woman. The particular bags I purchased were made by a group of 60 women working as a co-op. They all live together as a clan in what they call a rancheria. Each women has her own signature style and the bags all signify something special. For example certain design mean "the path of love", "wind", "rays of the sun", "coming of age" etc.
Extra Small Mochila
Extra Large Mochila
Extra Large Mochila
Large Mochila
Large Mochila
Extra Large Mochila
If you want more info, prices, photos etc. leave a comment here with your email address and I'll send you a PDF file with all the bags I have for sale.
I'm working on setting up a website to sell these mochilas and others not pictured. I thought I'd give my blog friends first dibs before the website is set up.
One trend that is really growing on me is bucket bags. It has taken a while but I am falling for this trend. This Rebecca Minkoff studded version is calling out my name. I like that it is much smaller than most of the bags out there and the tiny studs are cute and edgy. This would be the perfect edgy bag for a night out when you don't really want to carry a clutch.
Tuesday, July 13, 2010
I am a big fan of interesting rings. This one is perfect in my opinion because it is big and interesting but still subtle at the same time. It can't be seen from across the room but sometimes that is a good thing. I love that the bar spans 3 fingers creating an edgy and fun look.
Monday, July 12, 2010
Everything inspires me, from a song to a sunset. I love to look to other blogs for inspiration as well. Although if I had to pick one person, it would be my always stylish mom. She's the foundation to my love of fashion.
What is your favourite place to shop?
Small boutiques in Hong Kong. I love how it's mash up of East and West and result is both trendy and unique. I also love small boutiques in LA. While I love H&M and Zara, I always have a hard time finding things that fit me, so I can't depend on them too much unfortunately.
What is your current favourite fashion trend?
I'm having a hard time pinning down specifics...I think I just like the concept current trends are presenting.
What is the current trend you dislike the most?
There isn't exactly one I dislike, but my least favorite is florals. I think it's because there just tends to be a lot of unattractive floral prints out there.
Why did you start your blog?
I really needed someplace to let out my love for fashion and photography. Normally, life for me is pretty strict and centered around academics...which is actually the reason why I didn't start a blog earlier, there wasn't enough time. But the second my workload lightened, I was on Blogger.
How would you describe your style?
It varies depending on what is inspiring me at the moment or my mood, but it's usually pretty minimalist.
What is one thing you are dying to buy this summer?
A lace minidress, preferably in white. But it keeps eluding me, unfortunately...I'm probably being too picky.
What is the most expensive thing you have bought?
I haven't bought anything notably expensive seeing as I just graduated high school and I don't have a job (and I'm also saving)...so I'll just say my Nikon DSLR, which was technically it was a birthday gift. I count it as my favorite and most useful accessory.
What is the least expensive thing you have bought?
Two lace-edged skirts from a market in Hong Kong. They're perfect for layering under things and cost about $5 each.
What is one thing that you regret buying?
There isn't a whole lot, but one that pops into my mind is a sweatshirt dress in a weird shade of blue that didn't match much.
If you could meet one person from the fashion industry/ a fashion icon who would it be?
If it were possible, Alexander McQueen.
What is your favourite vacation destination?
I love to travel! Hong Kong and Bora Bora definitely, and I'm always up for any place in Italy and France (especially Florence and Paris).
Friday, July 9, 2010
This ring is a definite show stopper. I am sure I would get a million questions about where I got it if I was wearing this. There is something so fun about snake rings and bracelets. I am a big fan of this trend. I would wear this with something simple because with a statement piece like this you want the ring to be the focus.
Thursday, July 8, 2010
I keep seeing this bag in magazines and on random websites and everytime I see it I want it. I want it bad. I especially love this colour because it is dark enough to be mistaken for black but it is in fact a dark green. I love the shape of this bag and it would be large enough to carry all the things I lug around on a daily basis. For now I'm going to have to keep dreaming about this bag...
Wednesday, July 7, 2010
This tee would be a great addition to any closet. It is simple yet not boring thanks to the lace sleeves. Lace has become one of my favourite trends but it isn't always wearable. This is the perfect combination of lace and fabric for a wearable look. I would wear this with jeans or shorts for a comfortable yet put together look. I am not a fan of the same toned shorts that the model is wearing in this photo.
Monday, July 5, 2010
Style on the streets covered so beautifully by Tommy Ton, Scott Schuman and many others. Chloe Sevigny, Mary-Kate and Ashley Olsen, Miroslava Duma, Brigitte Bardot and Olivia Palermo. I must add Anna Dello Russo always looks out of this world!
What is your favourite place to shop?
I always love Zara, TopShop and H&M for picking out understated pieces at affordable prices. I also enjoy All Saints for the effortless feel, Reiss for chic pieces, and Selfridges for treats- Alexander Wang, see By Chloe and Chanel are some of my favourites there.
What is your current favourite fashion trend?
With so many trends about it is hard to narrow it down to a particular trend. I find myself drawn to the neutral and pastel palettes in delicate fabrics.
What is the current trend you dislike the most?
I may have said denim on denim- however I have tried this out a few times, and seen it worn so well on others. (Hi-5 to double denim wearers!)
Why did you start your blog?
I have been obsessed with Fashion from the earliest years of my life, and decided to try to make time to share my love with others. I fell critically ill in October after a week in Paris- while still on the road to recovery it has provided a little sanctuary for me and some focus. I hope when I am 100% better my blog will be packed full with more everything!! I would also like to think of it as an opportunity to meet like minded people.
How would you describe your style?
Ever evolving. I always consider proportion, silhouette and elegance...as Coco Chanel once said: "Fashion is architecture. It is a matter of proportions." Summer months see me take a more laid back vibe.
What is one thing you are dying to buy this summer?
A certain pair of black satin Miu Miu's with a chunky heel and closed toe. It was love at first sight.
What is the most expensive thing you have bought?
Probably the Alexander Wang Diego bag. Heaven in the form of a bag. (It's certainly one of the heaviest items I've purchased!!)
What is the least expensive thing you have bought?
When I was 16 I picked up a pair of Gina shoes, and a pair of Russell and Bromley shoes for just £2.50 a pair in a charity shop almost good as new. (It was a wooooohoooooo moment!)
What is one thing that you regret buying?
I have a green suede boxy jacket that I purchased early this year in an H&M in Barcelona. I have a complete love/hate relationship with it due to the boxy cut. (I can't decide it it makes me look chunky?! Eeek!!)
If you could meet one person from the fashion industry/ a fashion icon who would it be?
With so many incredible people involved in fashion it is hard to choose. (Okay- I'll be greedy) Karl Lagerfield, Grace Coddington and Viktor and Rolf.
What is your favourite vacation destination?
This totally depends on what I'm looking for. For city breaks and shopping, I adore Barcelona, Paris, and Palma. For pure relaxation, certain parts of Mallorca (the parts not populated by many tourists!) and Italian Lakes.
Friday, July 2, 2010
Wedges are a great way to dress up your look without being too dressy and still being comfortable. I love wedges because they are so easy to walk in and sometimes comfort is key. These Aldo wedges are a great purchase. The price is right (in my opinion) and they would look great with shorts, skirts and dresses.
Thursday, July 1, 2010
It looks like the stud trend will never end and right now that is ok with me. This studded bag is super cool. I love the way the light hits the studs making it look extra shiny. The shape of the bag is rather simple which is fine by me because with all the studding simplicity is best. I would wear this with jeans and a tee for a casual look. |
You May Also Like
Description
Solosphere on CD
Wanna rock with one of Indie Music's most versatile acts? Wanna take an electronic trip to another world? Wanna chill out with a soft love ballad? So what artist is capable of all of the above? Jon Solo- a multi-level/faceted producer and performing musician for over 20 years. He has spent the last 15 years as a producer for a number of Rock, R&B and Hip-Hop acts in the South-Eastern USA. Both a versatile musician and producer, he performs on a number of instruments and sings. His influences are in Progressive Rock and early Electronica. Solo also borrows from modern grunge and power pop. Musical mentors include Brian Wilson, Jean-Michel Jarre, Todd Rungren, Keith Emerson and David Foster. Solo. There is only one. Just him. No band. However, it doesn't sound like the typical one man operation. Jon Solo just completed his new 'Electronica' album. Please give a listen to this new material: SoloSphere! While you are at it be sure to visit his personal band SoloRayz! The blend of dark electronica, pop, rock, with smooth sexy vocals will knock your socks off!
Wanna rock with one of Indie Music's most versatile acts? Wanna take an electronic trip to another world? Wanna chill out with a soft love ballad? So what artist is capable of all of the above? Jon Solo- a multi-level/faceted producer and performing musician for over 20 years. He has spent the last 15 years as a producer for a number of Rock, R&B and Hip-Hop acts in the South-Eastern USA. Both a versatile musician and producer, he performs on a number of instruments and sings. His influences are in Progressive Rock and early Electronica. Solo also borrows from modern grunge and power pop. Musical mentors include Brian Wilson, Jean-Michel Jarre, Todd Rungren, Keith Emerson and David Foster. Solo. There is only one. Just him. No band. However, it doesn't sound like the typical one man operation. Jon Solo just completed his new 'Electronica' album. Please give a listen to this new material: SoloSphere! While you are at it be sure to visit his personal band SoloRayz! The blend of dark electronica, pop, rock, with smooth sexy vocals will knock your socks off! |
Select one... Japanese Obi Strip Edition (Tri-Color Vinyl) - $25.00 (Out of Stock) Tri-Color LP /133 - $22.00 (Out of Stock) Twisted Stripe LP /134 (DK Exclusive) - $22.00 (Out of Stock) Clear w/ Blue and Brown Splatter /379 - $22.00 (Out of Stock) Test Press LP w/ Screen Printed Jacket - $65.00 (Out of Stock) Brown w/ White Ink /37 (Japanese Obi Cassette) - $11.00 (Out of Stock) White w/ Brown Ink /52 (Cassette) - $8.00 (Out of Stock) Splatter LP + Blue Obi Strip /21 - $25.00 (Out of Stock)
Info
This vinyl is a pre-order and expected to ship around May 8th.
Cassettes and Screen Printed Jackets are expected to ship early June.
Marietta's 2013 debut LP is successful because it combines the brashness of the 2010's Philly emo scene with the expansive song structures so championed by the world created by the genre's Nineties yesterdays. Originally released on vinyl via Soft Speak Records and Dog Knights, and on cassette via Near Mint, we're humbled to be the new home of both formats with the re-mastered audio from the 5-year Anniversary re-issue.
Near Mint vinyl upgrades:
- Re-Mastered Audio from 2018 Anniversary Press
- Gatefold jackets w/ the OG artwork
- Matte finish jackets
- New Side A/B Labels
- Japanese Obi Strips
Cassette upgrades:
- Double Sided J-Cards
- Japanese Obi Strips
All orders come with a digital download. Purchase digital individually from Marietta here. |
ARCHIVE NEWS
Latest news
BRITISH CLUBS AWARDED SWIM 21 STATUS
The number of clubs now accredited under the Amateur Swimming Association's (ASA) Swim21 scheme has risen to 334.
The national governing body for swimming is well on its way to achieving its target of accrediting 800 clubs to its Swim 21 scheme by 2009 after fourteen more clubs made the grade at the May panel meeting.
Swim 21 is the ASA's club development model and has been in operation since 2002. Reviewed and amended at the beginning of 2006, the application process is now more straightforward and the scheme has opened up to all disciplines.
Based on the principles of Long Term Athlete Development (LTAD), Swim 21 encourages clubs to specialise in one of four areas; Teaching, Skill Development, Competitive Development and Performance. It recognises nationally and regionally the clubs that are committed to providing safe, effective and quality services for the benefit of their members.
Swim 21 National Chair Dave Flack is encouraged by the number of clubs applying for Swim 21 accreditation.
"Swim 21 is important for clubs," he said. "It provides a springboard to launch your club to higher goals and even greater achievements at all levels."
"It has now been running for four years and the number of clubs receiving accreditation is promising, we are on our way to achieving 800 clubs accredited by 2009 and this figure is achievable. Since amending the scheme in 2006 we have seen an increase in the number of clubs working towards accreditation."
Flack sees Swim 21 as a way for clubs to develop the service that they provide and the skills of everyone working at the club.
"There are many benefits of being accredited through the Swim 21 scheme but the main one is it gives clubs a clear focus on how to move forward and help develop their athlete's skills further. Also the whole process holistically develops the whole club including volunteers and chairman. It is the ASA club development model and so gives everyone at the club the chance to progress."
Clubs interested in working towards the Swim 21 accreditation should contact their Regional Development Officer.
The next panel meeting will be held on 15th August, and submissions should be made by 1st August. |
1. Field of the Invention
The invention is related to an improved process for the preparation of largely isocyanurate-free uretediones from (cyclo)aliphatic diisocyanates. Such uretediones can be processed into light-fast, single and two component polyurethane paints. The presence of isocyanurates is undesired in a number of applications since, as well-known, they are trifunctional and have a tendency to form crosslinkages. In practice an admixture of more than 0.5% is regarded as undesirable.
2. Discussion of the Background
In principle it is well-known that uretediones can be prepared in the presence of specific catalysts through dimerization of isocyanates. Previously for this purpose antimony pentafluoride, trialkylphosphines, amino-substituted phosphines, imidazoles, guanidines, and pyridines have been proposed.
The drawback in the use of antimony pentafluoride (cf. DE-OS No. 34 20 114) is that this corrosive and expensive compound must be destroyed prior to distillation with a five-fold quantity of zinc powder and the antimony and zinc fluoride precipitate must be removed by means of filtration.
A process is known from FR-PS No. 15 32 054 in which tertiary phosphines or boron trifluoride are added as dimerization catalysts. However, they catalyze not only the dimerization but also to a significant degree also the trimerization of isocyanates. In addition to this, due to its high corrosiveness, boron trifluoride can be added only when specific protective measures are taken.
1,2-Dimethylimidazole is an excellent dimerization catalyst for aromatic isocyanates (cf. Synthesis 1975, p. 463 ff.). However, in the case of isocyanates that do not have any aromatic NCO groups, this catalyst is clearly less selective. For example, when benzyl isocyanate is added, a mixture of 24% isocyanurate and only 76% uretedione is obtained.
In practice amino-substituted phosphines have prevailed as dimerization catalysts.
According to the process of DE-OS No. 30 30 513, the uretedione of the isophorone diisocyanate is prepared in the presence of an organic phosphorus-nitrogen-catalyst by means of dimerization of monomers and then distilled in a thin-layer evaporator. The uretediones remain in the distillation residue while the unconverted monomers with the majority of the added catalyst are collected as distillate, which is recycled into the process. Tris-(N,N-dimethylamino)-phosphine (PTD) is designated as the preferred catalyst. Uretediones, which were produced in the presence of PTD, contain typically 1% isocyanurate, 1% monomers, and 0.01-0.1% catalyst.
In the DE-OS No. 34 47 635 it is proposed that for the dimerization of organic isocyanates the same type of catalysts be used with concurrent use of active hydrogen containing organic compounds such as alcohols, phenols, (cyclo)aliphatic amines, amides, urethanes, and ureas. PTD and tris-(N,N-diethylamino)-phosphine are particularly preferred catalysts. If di- or higher functional isocyanates are added, the reaction usually stops after attaining a degree of dimerization ranging from 10 to 50% due to the addition of a catalyst poison such as chloroacetic acid (cf. page 16, first paragraph). Isolating the uretedione presents a problem. Under the conditions of thin-layer evaporation there is the risk of a catalyzed dissociation of the uretedione that is present back to the original isocyanates (cf, page 16, middle). If the catalyst with the excess isocyanate can be removed by means of distillation, deactivation of the catalyst is superfluous. However, then uncontrollable secondary reactions can occur during and after work-up (cf, page 20).
It is known that PTD has a tendency to react in the presence of atmospheric oxygen to form hexamethyl triamidophosphoric acid, which as is well-known, is suspected to be a carcinogen (cf. Br.J.Cancer 38, 418-427 (1978)). Therefore, the use of PTD should be avoided. In addition to this, the aforementioned processes have the drawback that the catalysts enter into secondary reactions and thus are partially consumed. Therefore, in these processes, the lost catalyst must be regularly replaced. In the latter processes, a significant proportion of the catalyst thus employed remains in the uretedione after the deactivation. Therefore, a drawback of both processes is the high cost of the catalyst.
Other dimerization catalysts are also known from the literature. For example, in the JP-AS No. 71/37 503 the dimerization of 2,4-toluylene diisocyanate with cyclic amidines such as 1,8-diazabicyclo[5.4.0]undec-7-en is described. Experiments conducted by the Applicant show that (cyclo)aliphatic diisocyanates cannot be dimerized with this catalyst (see reference example A). Apparently the well-known, low reactivity of these diisocyanates is inadequate to facilitate a reaction.
The object of DE-PS No. 10 81 895 (corresponding to U.S. Pat. No. 3,144,452) is a process for the preparation of N,N-diaryluretediones and triarylisocyanurate acid esters through di- or trimerization of aromatic isocyanates. Pyridines containing a substituent in the 3- or 4-position and of a specified basicity are used as catalysts. Among other things, 4-aminopyridines that are substituted by means of alkyl groups are mentioned. According to this process, it is apparently possible to obtain uretediones, isocyanurates or their mixtures, depending on the quantity of the catalyst, the reaction temperature, and type of solvent that is used. Thus, for example, it is recommended that for the production of uretediones the catalyst be added in a quantity ranging from 0.005 to 15%, with respect to the weight of the isocyanate added, the mixture be reacted at the lowest temperature possible, and an inert organic solvent be used in which the uretedione dissolves poorly.
The fact that the quantity of catalyst recommended for the preparation of isocyanurates overlaps in broad ranges the aforementioned data and the other two reaction parameters are also not clearly delineable, leads one skilled in the art to doubt the possibility of controlling a selective reaction. Reference experiments conducted by the Applicant show in fact that the two oligomers are always formed. For example, in the follow-up of Example 2, 2% by weight of isocyanurate was obtained. If the reaction mixture is heated briefly to 145.degree. C., even 10% by weight of isocyanurate is obtained, whereas at the same time the uretedione is partially split into the monomer.
It is evident from a later application of the patent holder that 4,4'-diphenylmethane-diisocyanate is trimerized in the presence of 4-dimethylaminopyridine at room temperature and is converted to higher oligomeric products (cf. DE-AS No. 16 94 485). From this, too, it can be inferred that apparently the pyridine derivatives always catalyst both reactions--the dimerization and the trimerization. Therefore, pyridine derivatives do not seem to be suitable for the preparation of uretediones, which should be almost free of isocyanurates. In particular, this applies to aliphatic isocyanates, since in contrast to the aromatic isocyanates, they form either no uretediones or only when special reaction conditions are maintained are they in a position to form the dimeric addition products (cf. J.Org.Chem. 36, 3056 (1971)).
Therefore, whereas numerous processes for the dimerization of aromatic diisocyantes are known, there is practically only one possibility for dimerizing (cyclo)aliphatic diosocyanates; and it is based on the use of undesired aminophosphines (see DE-OS No. 34 37 635)).
The process described in JP-OS No. 84/98180 for the oligomerization of (cyclo)aliphatic diisocyanates is not suitable for the targeted preparation of uretediones, since it is known that the mixtures obtained comprising uretediones and isocyanurates are separable only with great difficulty. Uretediones have the tendency, on heating to reseparate back into their original components. In particular, this can be expected when catalyst residues are still present. |
Relation and independence of angina pectoris and sudden death in persons with coronary atherosclerotic heart disease.
Angina is an important though relatively insensitive and nonspecific predictor of the presence of significant coronary occlusive disease. If angina is present, there is a high probability of significant coronary atherosclerosis. However, the lack of angina, even with vigorous exertion, does not imply absence of severe and potentially lethal amounts of coronary stenosis because a high percent of patients who have had sudden cardiac arrest or myocardial infarction have not had prior angina pectoris. In many studies that carefully and specifically examined the prognostic importance of angina in relation to other variables, neither the presence of angina nor its severity was of prognostic significance, although a few studies suggested that the unstable form of angina may have unfavorable prognostic significance independent of the state of left ventricular function or the severity of coronary atherosclerosis. Thus, it would not appear to be wise to base individual or national decisions aimed at reducing the likelihood of death from coronary disease primarily on the presence or absence of angina pectoris. |
Tag "trump immigration"
Trump Will Separate Children From Parents At Border Araceli Cruz of Mitu.com reports that during an event in Scottsdale, Jeff Sessions, Trump’s Attorney General, announced that undocumented border crossers will be separated from their children for processing. – “The Trump Administration said this
By Kaitlyn Ahrbeck | Cronkite News Mexican immigrants, who send money to relatives back home, reacted with disappointment over a proposal to cut off their ability to send remittances to Mexico. “We are not criminals,” said Juan Garcia, an immigrant |
Another flaw is that the LCD for the player is relatively small and as such making out the details of the player during its operation will
prove to be a headache for those who are visually challenged. Also, another setback is the lack of a backlit display. This means that
it will not be of much use in low light conditions. |
World Cafe: The National's Matt Berninger Reflects On Creating 'Sleep Well Beast'
Enlarge this image Graham MacIndoe/Courtesy of the artist Graham MacIndoe/Courtesy of the artist
The National is about to release its seventh studio album, Sleep Well Beast, on September 8. But days before it comes out, on September 5, the band is going to play that record in its entirety live for NPR.
The new songs revolve around the fears and struggles within relationships, particularly that of singer and lyricist Matt Berninger and his wife, the writer Carin Besser, who co-wrote some of the lyrics on this album. Sleep Well Beast is characteristically dark and sonically rich — and some of the best music this band has made.
Today we're sharing a conversation between Matt, myself (All Songs Considered host Bob Boilen) and Talia Schlanger, host of World Cafe.
We discussed how the band works these days, spread as it is across five different cities; collaborating via email, file sharing, word documents and occasional exploratory, face-to-face recording sessions.
Those free-form sessions, held in studios across California, New York and Germany, yielded much of the guitar-based material — including a rare guitar solo — heard on Sleep Well Beast, which also sweeps in electronics, orchestrations and more.
We spoke with Matt about the nature of families — The National itself is a family of sorts, after all, made up of two pairs of brothers: Aaron and Bryce Dessner, and Scott and Bryan Devendorf. In addition to those familial and artistic relationships, Matt Berninger spoke to us about how he and his bandmates challenge themselves to steer clear of cliches, and how overcoming his anxiety on stage with the crutch of a teleprompter has made them a stronger, nimbler live band. — Bob Boilen
You can hear The National, performing Sleep Well Beast from Union Transfer in Philadelphia here. |
---
abstract: 'We explicitly determine quasi-polynomials describing the weight multiplicities of the Lie algebra $\mathfrak{so}_5(\mathbf{C})$. This information entails immediate complete knowledge of the character of any simple representation as well as the asymptotic behavior of characters.'
address: ', Germany'
author:
- Thomas Bliem
date: July 2008
title: 'Weight multiplicities for $\mathfrak{so}_5(\mathbf{C})$'
---
Introduction
============
There have been investigations into the characters of simple Lie algebras initiated in the beginning of the discipline and going on to present days. From the early days it was possible to write down formulas explicitly describing the characters, as notably done by H. Weyl [@weyl1925f] and B. Kostant [@kostant1959]. P. Littelmann’s path model [@littelmann1994; @littelmann1995] does not formally furnish a formula but rather an algorithm allowing to calculate the character performing finitely many combinatorial operations, so fits into the very same context.
Still, all these approaches, while allowing to calculate characters or individual weight multiplicities, at least in principle and for small instances, do not fully exhibit the rich structure underlying the characters. For example, from G. Heckman’s thesis [@heckman1980] it is known that considering a sequence of simple representations for a given simple Lie algebra such that the highest weights of the elements are the integral multiples of a given weight, the corresponding characters show a particular behavior of convergence.
As pointed out by S. Billey, V. Guillemin and E. Rassart [@billey2004], for the case of $\mathfrak{sl}_k(\mathbf{C})$ Gelfand-Tsetin patterns [@gelfand1950] can be used as a key ingredient to develop descriptions of characters better reflecting their structure. In the following I will demonstrate that it is possible, substituting Gelfand-Tsetlin patterns by P. Littelmann’s patterns [@littelmann1998], using B. Sturmfels’ structure theorem [@sturmfels1995] on vector partition functions and Laplace transformation methods developed by L. Jeffrey, F. Kirwan [@jeffrey1995], A. Szenes and M. Vergne [@szenes2003] as well as work by C. De Concini and C. Procesi on the combinatorics of residues [@deconcini2005], to obtain indeed complete knowledge, structural and computational, of the characters of $\mathfrak{so}_5(\mathbf{C})$. In fact, I do not use any special properties of the Lie algebra $\mathfrak{so}_5(\mathbf{C})$. This is just a random example picked to demonstrate the power of the combination of the above-mentioned ideas, which, in principle, are applicable to any semisimple complex Lie algebra.
Preliminaries
=============
Consider the Lie algebra $\mathfrak{so}_5(\mathbf{C})$ of complex $(5 \times 5)$-matrices $A$ such that $A^t M = - M A$ for a fixed nondegenerate complex $(5 \times 5)$-matrix $M$. Choose a Cartan subalgebra $\mathfrak{h}$ and simple roots $\alpha_1, \alpha_2 \in \mathfrak{h}^*$ such that $\alpha_2$ is the long root. The Dynkin diagram associated to this enumeration of the simple roots is $$1 \Longleftarrow 2.$$ Let $\omega_1, \omega_2 \in \mathfrak{h}^*$ be the corresponding fundamental weights, $\Lambda \subseteq Q \subseteq \mathfrak{h}^*$ the weight lattice respectively the root lattice. The irreducible $\mathfrak{so}_5(\mathbf{C})$-module of highest weight $\lambda$ is denoted by $V(\lambda)$. For a weight $\mu$ denote by $V(\lambda)_\mu$ the space of vectors of weight $\mu$ in $V(\lambda)$. If $\lambda - \mu$ is not an element of the root lattice, then $V(\lambda)_\mu = 0$. For $\lambda$ a dominant weight and $\beta$ an element of the root lattice, define $$K^\lambda_\beta := \dim V(\lambda)_{\lambda - \beta}.$$ If the weight $\lambda$ is not dominant we define all $K^\lambda_\beta$ to be $0$. The character of $V(\lambda)$ is by definition the element $$\sum_{\beta \in Q} K^\lambda_\beta \cdot [\lambda - \beta]$$ of the group ring $\mathbf{Z}[\Lambda]$. Hence knowledge of all the characters of $\mathfrak{so}_5(\mathbf{C})$ is equivalent to knowledge of the function $K : \Lambda \times Q \to \mathbf{Z_{\geq 0}}$.
For any dominant weight $\lambda$, let $B(\lambda)$ be the crystal associated to $V(\lambda)$ by M. Kashiwara [@kashiwara1995] and $B(\infty) := \varinjlim_\lambda B(\lambda) \otimes T_{-\lambda}$ the direct limit of the crystals $B(\lambda)$, shifted to have highest weight $0$. Consider the reduced decomposition $w_0 = s_1 s_2 s_1 s_2$ of the longest element of the Weyl group. To this decomposition, P. Littelmann [@littelmann1998] associates a convex polyhedral cone $\mathcal{C} \subseteq \mathbf{R}^4$, a family of polytopes $\mathcal{C^\lambda} \subseteq \mathcal{C}$ for dominant weights $\lambda$ and a $\mathbf{Z}$-linear map $\psi: \mathbf{Z}^4 \to Q$ such that: (i) There is a canonical bijection $\sigma : B(\infty) \to \mathcal{S} := \mathcal{C} \cap \mathbf{Z}^4$. (ii) For each dominant weight $\lambda$, the bijection $\sigma$ restricts to a bijection between $B(\lambda)$ and $\mathcal{S}^\lambda := \mathcal{C}^\lambda \cap \mathbf{Z}^4$. (iii) The weight of any element $b \in B(\lambda)$ is $\mathrm{wt}(b) = \lambda - \psi(\sigma(b))$.
Specifically, denote the standard coordinates by $a_{22}$, $a_{11}$, $a_{12}$, $a_{13}$. Then the cone $\mathcal{C}$ is given by the inequalities $$\label{eq:C} 2a_{11} \geq a_{12} \geq 2a_{13} \geq 0, \quad a_{22} \geq 0 .$$ For a dominant weight $\lambda = \lambda_1 \omega_1 + \lambda_2 \omega_2$, the polytope $\mathcal{C}^\lambda$ is given inside $\mathcal{C}$ by the additional inequalities $$\label{eq:C^lambda}\begin{split}
a_{13} &\leq \lambda_2, \\
a_{12} &\leq \lambda_1 + 2 a_{13}, \\
a_{11} &\leq \lambda_2 + a_{12} - 2 a_{13}, \\
a_{22} &\leq \lambda_1 + 2 a_{11} - 2 a_{12} + 2 a_{13}.
\end{split}$$ The $\mathbf{Z}$-linear map is $\psi = (a_{22}+ a_{12}) \alpha_1 + (a_{11} + a_{13}) \alpha_2$. For a given dominant weight $\lambda$ and any element $\beta = \beta_1 \alpha_1 + \beta_2 \alpha_2$ of the root lattice, define $$\label{eq:C^lambda_beta} \mathcal{C}^\lambda_\beta := \{ a \in \mathcal{C}^\lambda : a_{22}+ a_{12} = \beta_1,\ a_{11} + a_{13} = \beta_2 \}$$ and $\mathcal{S}^\lambda_\beta := \mathcal{C}^\lambda_\beta \cap \mathbf{Z}^4$. Then by [@littelmann1998] we have $K^\lambda_\beta = \lvert \mathcal{S}^\lambda_\beta \rvert$, that is: Determination of the weight multiplicities is reduced to counting the number of points in polytopes.
Reformulation using vector partition functions
==============================================
For any positive integers $n$ and $N$ and any $(n \times N)$-matrix $A$ with integral coefficients such that $\ker A \cap \mathbf{R}_{\geq 0}^n = 0$ define the vector partition function $\Phi_A : \mathbf{Z}^n \to \mathbf{Z}_{\geq 0}$ by $\Phi_A(v) := \lvert \{ a \in \mathbf{Z}_{\geq 0}^N : A a = v \} \rvert$. We will now reformulate Littelmann’s result and explicitly determine matrices $A$ and $B$ such that $K^\lambda_\beta = \Phi_A(B \cdot (\lambda_1, \lambda_2, \beta_1, \beta_2)^t)$. Indeed, the inequalities and can be turned into equations using slack variables $s_1, s_2$ respectively $t_1, t_2, t_3, t_4$. Hence, the number of integral solutions $\lvert \mathcal{S}^\lambda_\beta \rvert$ of the system (\[eq:C\], \[eq:C\^lambda\], \[eq:C\^lambda\_beta\]) is equal to the number of nonnegative integral solutions to the system $$\begin{array}{*6{r@{}}l}
& 2a_{11} & {}-a_{12} & & {}-s_1 & & =0, \\
& & a_{12} & {}-2a_{13} & {}-s_2 & & =0, \\
& & & a_{13} & & {}+t_1 & =\lambda_2, \\
& & a_{12} & {}-2a_{13} & & {}+t_2 & =\lambda_1, \\
& a_{11} & {}-a_{12} & {}+2a_{13} & & {}+t_3 & =\lambda_2, \\
a_{22} & {}-2a_{11} & {}+2a_{12} & {}-2a_{13} & & {}+t_4 & =\lambda_1, \\
a_{22} & & {}+a_{12} & & & & =\beta_1, \\
& a_{11} & & {}+a_{13} & & & =\beta_2.
\end{array}$$ In other words, $\lvert \mathcal{S}^\lambda_\beta \rvert = \Phi_A(B \cdot (\lambda_1, \lambda_2, \beta_1, \beta_2)^t)$ for matrices $$\label{eq:E} A = \left( \begin{array}{cccc|cc|cccc}
0 & 2 & -1 & 0 & -1 & 0 & 0 & 0 & 0 & 0 \\
0 & 0 & 1 & -2 & 0 & -1 & 0 & 0 & 0 & 0 \\ \hline
0 & 0 & 0 & 1 & 0 & 0 & 1 & 0 & 0 & 0 \\
0 & 0 & 1 & -2 & 0 & 0 & 0 & 1 & 0 & 0 \\
0 & 1 & -1 & 2 & 0 & 0 & 0 & 0 & 1 & 0 \\
1 & -2 & 2 & -2 & 0 & 0 & 0 & 0 & 0 & 1 \\ \hline
1 & 0 & 1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\
0 & 1 & 0 & 1 & 0 & 0 & 0 & 0 & 0 & 0
\end{array} \right)$$ and $$\label{eq:B} B = \left( \begin{array}{cc|cc}
0 & 0 & 0 & 0 \\
0 & 0 & 0 & 0 \\ \hline
0 & 1 & 0 & 0 \\
1 & 0 & 0 & 0 \\
0 & 1 & 0 & 0 \\
1 & 0 & 0 & 0 \\ \hline
0 & 0 & 1 & 0 \\
0 & 0 & 0 & 1
\end{array} \right) .$$
Structure and calculation of vector partition functions {#sect:vpf}
=======================================================
The presentation of $K^\lambda_\beta$ in terms of a vector partition function gains its strength from the following structure theorem of B. Sturmfels [@sturmfels1995]:
\[th:sturmfels\] Let $A \in \mathbf{Z}^{(n, N)}$ such that the vector partition function $\Phi_A : \mathbf{Z}^n \to \mathbf{Z}_{\geq 0}$ is defined. Then there is a homogeneous fan $F = \mathrm{fan}(A)$ in $\mathbf{R}^n$ and a family of quasi-polynomials $(f_C)$ on $\mathbf{Z}^n$, indexed by the maximal cones in $F$, such that $\Phi_A$ coincides with $f_C$ on $C \cap \mathbf{Z}^n$ and vanishes outside the support of $F$.
Here, a *fan* is a finite set of convex polyhedral cones, closed under taking faces, and such that the intersection of any two cones is a face of both. The fan being *homogeneous* means that all maximal cones have the same dimension, which is in this case the rank of $A$. A function $f : \mathbf{Z}^n \to \mathbf{C}$ is called a *quasi-polynomial* if there is a lattice $L \subseteq \mathbf{Z}^n$ and a family $(f_{\bar{h}})_{\bar{h} \in \mathbf{Z}^n / L}$ of polynomials on $\mathbf{Z}^n$ such that $f(h) = f_{\bar h}(h)$ for all $h \in \mathbf{Z}^n$.
While the naive algorithm for computing individual values $\Phi_A(v)$ of a given vector partition functions has exponential execution time with respect to the *components* of $v$, this theorem allows the following strategy: Determine the maximal cones of $F$ and for each maximal cone $C$ determine the quasi-polynomial $f_C$. This task being accomplished, individual values $\Phi_A(v)$ of the vector partition function can be calculated by evaluating the corresponding quasi-polynomial at $v$, the execution time of which is of order of the *logarithm* of the components of $v$. In this sense, determination of the maximal cones and quasi-polynomials yields instant complete knowledge of the values of the given vector partition function. We will indeed perform these steps for the vector partition function given by . In this way we will determine all the characters of $\mathfrak{so}_5(\mathbf{C})$ at once.
Generally, the maximal cones and quasi-polynomials of a vector partition function can be determined as outlined in the sequel. For a more extensive treatment, refer to the study of the Kostant partition function for classical root systems [@baldoni2006] by W. Baldoni, M. Beck, Ch. Cochet and M. Vergne, which also served as a model for the following calculations.
Suppose that $A$ has rank $n$. For a lattice $L \subseteq \mathbf{R}^n$ denote by $L^\perp \subseteq (\mathbf{R}^n)^*$ the corresponding dual lattice. If $L \subseteq \mathbf{Z}^n$ then $L^\perp \supseteq (\mathbf{Z}^n)^\perp$. Let $T := (\mathbf{R}^n)^* / (\mathbf{Z}^n)^\perp$, an $n$-dimensional torus. Denote the column vectors of $A$ by $a_1, \ldots, a_N$. A subset $\sigma \subseteq \{ 1, \ldots, N \}$ is called a *basic subset* for $A$ if $(a_i)_{i \in \sigma}$ is a basis of $\mathbf{R}^n$. For any basic subset $\sigma = \{ i_1, \ldots, i_n \} $ let $T(\sigma) := (\mathbf{Z}a_{i_1} + \cdots + \mathbf{Z}a_{i_n})^\perp \bmod (\mathbf{Z}^n)^\perp \subseteq T$. The set $T(\sigma)$ contains $\mathrm{vol}(\sigma) := \left| \det(a_i : i \in \sigma) \right|$ elements. Let $\Gamma \subseteq T$ be the union of all $T(\sigma)$ for basic subsets $\sigma$ for $A$.
The fan $F = \mathrm{fan}(A)$ associated to $A$ can be described as follows: For any basic subset $\sigma$ denote by $\mathrm{cone}(\sigma)$ the convex polyhedral cone generated by $\{a_i : i \in \sigma\}$. Cones of the form $\mathrm{cone}(\sigma)$ are called *basic cones*. Then the maximal cones of $F$ are the minimal $n$-dimensional cones which can be written as an intersection of basic cones.
For $h \in \mathbf{Z}^n$ and $g \in T$ define the *Kostant function* as the meromorphic function on $(\mathbf{R}^n)^* \otimes_\mathbf{R} \mathbf{C} = (\mathbf{C}^n)^*$ given by $$F_{g,h}(u) := \frac{e^{\langle u + 2 \pi i g, h \rangle}}{\prod_{k=0}^N \left( 1 - e^{-\langle u + 2 \pi i g, a_k \rangle } \right) } .$$ Note that $\langle g, h \rangle$ and $\langle g, a_k \rangle$ are determined modulo $\mathbf{Z}$, so the values of the exponential functions are unambiguous.
A basic subset $\{ i_1, \ldots, i_n \}$ with $ i_1 < \cdots < i_n $ is called *without broken circuits* if there are no $j \in \{1, \ldots, n \}$ and $k \in \{ i_j+1, \ldots, N \}$ such that the family $(a_{i_1}, \ldots, a_{i_j}, a_k)$ is linearily dependent.[^1] For a maximal cone $C$ of the fan $F$, let $B_\mathrm{nb}(C)$ denote the set of basic subsets $\sigma$ without broken circuits such that $\mathrm{cone}(\sigma) \supseteq C$.
For a meromorphic function $f(u)$ on $(\mathbf{R}^n)^* \otimes_\mathbf{R} \mathbf{C} = (\mathbf{C}^n)^*$ with poles along $a_i^\perp\ (i = 1, \ldots, N)$ and a basic subset $\sigma$, define the *iterated residue* of $f$ with respect to $\sigma$ to be $$\operatorname{ires}_\sigma f(u) := \operatorname{res}_{a_{i_n}=0} \cdots \operatorname{res}_{a_{i_1}=0} f(u) ,$$ where $a_{i_j}$ are interpreted as coordinates on $(\mathbf{C}^n)^*$.
The following theorem is a combination of A. Szenes and M. Vergne’s expression [@szenes2003 th. 3.1] of a vector partition function as a Jeffrey-Kirwan residue and C. De Concini and C. Procesi’s work [@deconcini2005] on the Jeffrey-Kirwan residue:
On any maximal cone $C$ of $\mathrm{fan}(A)$, the vector partition function associated to $A$ is given by $$\Phi_A(h) = \sum_{\sigma \in B_\mathrm{nb}(C)} \frac{1}{\mathrm{vol}(\sigma)} \sum_{g \in \Gamma} \operatorname{ires}_\sigma F_{g, h}(u) .$$
Computing the weight multiplicity function for $\mathfrak{so}_5(\mathbf{C})$
============================================================================
Recall that $K^\lambda_\beta = \Phi_A(B \cdot (\lambda_1, \lambda_2, \beta_1, \beta_2)^t)$ for $\lambda = \lambda_1 \omega_1 + \lambda_2 \omega_2$, $\beta = \beta_1 \alpha_1+ \beta_2 \alpha_2$ and $A$, $B$ matrices as given in equations respectively . We are now ready to perform explicit computations. All computations were performed using Maple 11 by Maplesoft[^2] and the package Convex 1.1.2 by M. Franz[^3].
First we have to determine $F = \mathrm{fan}(A)$. This is done as follows: Any maximal cone in $F$ is the intersection of all the basic cones containing it. We can hence find the neighbors of a given maximal cone $C$ as follows: For each facet $f$ of $C$, the neighboring maximal cone of $C$ in direction $f$ is the intersection of all basic cones $\mathrm{cone}(\sigma)$ such that $f \subseteq \mathrm{cone}(\sigma)$ and $(C \subseteq\mathrm{cone}(\sigma) \implies f \not\subseteq \partial(\mathrm{cone}(\sigma)))$. So we start with an arbitrary maximal cone and find the others by a standard algorithm for graph traversal using this description of the neighbor relation. There are 320 maximal cones alltogether.
In order to determine $\Gamma$ we proceed as follows: For any basic subset $\sigma$, let $A_\sigma$ be the submatrix of $A$ consisting of the columns with indices in $\sigma$. The subgroup $T(\sigma)$ of $T$ is generated by the classes of the row vectors of $A_\sigma^{-1}$. So we start with the set of these classes and determine its closure under the operation of adding the class of any row vector of $A_\sigma^{-1}$ by a standard algorithm of graph traversal.
The set of basic subsets without broken circuits is determined straightforwardly using the definition. In order to speed up the calculation, basic subsets are built up recursively, checking the additional prerequisites at every step of the recursion.
In fact we are only interested in maximal cones whose intersection with the image of $B$ has dimension $4$. There are 43 such intersections. For the calculation of the quasi-polynomials we now pick for each such intersection $\mathfrak{c}$ a maximal cone $C$ of $\mathrm{fan}(A)$ such that $\mathfrak{c} = C \cap \mathrm{im}(B)$. Then we compute the quasi-polynomials for each of these maximal cones as described in section \[sect:vpf\]. The quasi-polynomials coincide for some of the neighboring $\mathfrak{c}$, so we glue together the corresponding cones. The preimage under $B$ of the resulting fan is given by the following maximal cones in $\mathbf{R^4} = (\Lambda \otimes_\mathbf{Z} \mathbf{R}) \times (Q \otimes_\mathbf{Z} \mathbf{R})$:
[ $$\begin{aligned}
\mathfrak{c}_{1} &= \parbox[t]{0.8\columnwidth}{$\{\lambda_{{2}}-\beta_{{2}}
\geq 0,\ \lambda_{{1}}-\beta_{{1}}
\geq 0,\ \beta_{{1}}-\beta_{{2}}
\geq 0,\ -\beta_{{1}}+2\beta_{{2}}
\geq 0\},$}
\\
\mathfrak{c}_{2} &= \parbox[t]{0.8\columnwidth}{$\{\beta_{{1}}-2\beta_{{2}}
\geq 0,\ \lambda_{{2}}-\beta_{{2}}
\geq 0,\ -\lambda_{{1}}+\beta_{{1}}
\geq 0,\ \lambda_{{1}}-\beta_{{1}}+\beta_{{2}}
\geq 0\},$}
\\
\mathfrak{c}_{3} &= \parbox[t]{0.8\columnwidth}{$\{ \lambda_2 - \beta_2 \geq 0,\ -\lambda_1 + \beta_1 \geq 0,\ -\beta_1 + 2\beta_2 \geq 0, \ \beta_1 - \beta_2 \geq 0, \lambda_1 - \beta_1 + \beta_2 \geq 0 \},$}
\\
\mathfrak{c}_{4} &= \parbox[t]{0.8\columnwidth}{$\{\beta_{{1}}
\geq 0,\ \lambda_{{2}}-\beta_{{2}}
\geq 0,\ -\beta_{{1}}+\beta_{{2}}
\geq 0,\ \lambda_{{1}}-\beta_{{1}}
\geq 0\},$}
\\
\mathfrak{c}_{5} &= \parbox[t]{0.8\columnwidth}{$\{\beta_{{2}}
\geq 0,\ \beta_{{1}}-2\beta_{{2}}
\geq 0,\ \lambda_{{1}}-\beta_{{1}}
\geq 0,\ \lambda_{{2}}-\beta_{{2}}
\geq 0\},$}
\\
\mathfrak{c}_{6} &= \parbox[t]{0.8\columnwidth}{$\{ \beta_1 - \beta_2 \geq 0,\ 2\lambda_2 + \beta_1 - 2\beta_2 \geq 0,\ -\beta_1 + 2\beta_2 \geq 0,\ -\lambda_2 + \beta_2 \geq 0,\ \lambda_1 - \beta_1 \geq 0 \},$}
\\
\mathfrak{c}_{7} &= \parbox[t]{0.8\columnwidth}{$\{\lambda_{{1}}-\beta_{{1}}+2\beta_{{2}}
\geq 0,\ -\lambda_{{1}}+\beta_{{1}}-\beta_{{2}}
\geq 0,\ \beta_{{1}}-2\beta_{{2}}
\geq 0,\ \lambda_{{2}}-\beta_{{2}}
\geq 0\},$}
\\
\mathfrak{c}_{8} &= \parbox[t]{0.8\columnwidth}{$\{-\lambda_{{1}}+\beta_{{1}}
\geq 0,\ \lambda_{{1}}
\geq 0,\ \lambda_{{2}}-\beta_{{2}}
\geq 0,\ -\beta_{{1}}+\beta_{{2}}
\geq 0\},$}
\\
\mathfrak{c}_{9} &= \parbox[t]{0.8\columnwidth}{$\{
-\lambda_1 + \beta_1 \geq 0,\
\lambda_1 - \beta_1 + \beta_2 \geq 0,\
\lambda_1 + 2\lambda_2 - \beta_1 \geq 0,\
-\lambda_2 + \beta_2 \geq 0,\
\beta_1 - 2\beta_2 \geq 0
\},$}
\\
\mathfrak{c}_{10} &= \parbox[t]{0.8\columnwidth}{$\{
\lambda_1 + \lambda_2 - \beta_2 \geq 0,\
\lambda_1 + 2\lambda_2 - \beta_1 \geq 0,\
2\lambda_2 + \beta_1 - 2\beta_2 \geq 0,\
\lambda_1 - \beta_1 + \beta_2 \geq 0,\
{-\lambda_1} + \beta_1 \geq 0
\},$}
\\
\mathfrak{c}_{11} &= \parbox[t]{0.8\columnwidth}{$\{2\lambda_{{2}}+\beta_{{1}}-2\beta_{{2}}
\geq 0,\ -\lambda_{{2}}+\beta_{{2}}
\geq 0,\ -\beta_{{1}}+\beta_{{2}}
\geq 0,\ \lambda_{{1}}-\beta_{{1}}
\geq 0\},$}
\\
\mathfrak{c}_{12} &= \parbox[t]{0.8\columnwidth}{$\{
-\lambda_2 + \beta_2 \geq 0,\
\lambda_2 \geq 0,\
\beta_1 - 2\beta_2 \geq 0,\
\lambda_1 - \beta_1 \geq 0
\},$}
\\
\mathfrak{c}_{13} &= \parbox[t]{0.8\columnwidth}{$\{-\beta_{{1}}+2\beta_{{2}}
\geq 0,\ -\lambda_{{1}}+\beta_{{1}}-\beta_{{2}}
\geq 0,\ \lambda_{{1}}
\geq 0,\ \lambda_{{2}}-\beta_{{2}}
\geq 0\},$}
\\
\mathfrak{c}_{14} &= \parbox[t]{0.8\columnwidth}{$\{-\lambda_{{1}}+\beta_{{1}}-\beta_{{2}}
\geq 0,\ \lambda_{{1}}+2\lambda_{{2}}-\beta_{{1}}
\geq 0,\ -\lambda_{{2}}+\beta_{{2}}
\geq 0,\ \beta_{{1}}-2\beta_{{2}}
\geq 0\},$}
\\
\mathfrak{c}_{15} &= \parbox[t]{0.8\columnwidth}{$\{-\beta_{{1}}+\beta_{{2}}
\geq 0,\ -\lambda_{{2}}+\beta_{{2}}
\geq 0,\ 2\lambda_{{2}}+\beta_{{1}}-2\beta_{{2}}
\geq 0,\ \lambda_{{1}}+\lambda_{{2}}-\beta_{{2}}
\geq 0,\ -\lambda_{{1}}+\beta_{{1}}
\geq 0\},$}
\\
\mathfrak{c}_{16} &= \parbox[t]{0.8\columnwidth}{$\{
-\lambda_1 - \lambda_2 + \beta_2 \geq 0,\
\lambda_1 + 2\lambda_2 - \beta_1 \geq 0,\
2\lambda_2 + \beta_1 - 2\beta_2 \geq 0,\
\lambda_1 - \beta_1 + \beta_1 \geq 0,\
\beta_1 - \beta_2 \geq 0
\},$}
\\
\mathfrak{c}_{17} &= \parbox[t]{0.8\columnwidth}{$\{\lambda_{{2}}+\beta_{{1}}-\beta_{{2}}
\geq 0,\ -2\lambda_{{2}}-\beta_{{1}}+2\beta_{{2}}
\geq 0,\ -\beta_{{1}}+\beta_{{2}}
\geq 0,\ \lambda_{{1}}-\beta_{{1}}
\geq 0\},$}
\\
\mathfrak{c}_{18} &= \parbox[t]{0.8\columnwidth}{$\{\beta_{{1}}-\beta_{{2}}
\geq 0,\ \lambda_{{2}}
\geq 0,\ -2\lambda_{{2}}-\beta_{{1}}+2\beta_{{2}}
\geq 0,\ \lambda_{{1}}-\beta_{{1}}
\geq 0\},$}
\\
\mathfrak{c}_{19} &= \parbox[t]{0.8\columnwidth}{$\{-\lambda_{{1}}+\beta_{{1}}-\beta_{{2}}
\geq 0,\ -\lambda_{{2}}+\beta_{{2}}
\geq 0,\ -\beta_{{1}}+2\beta_{{2}}
\geq 0,\ \lambda_{{1}}+2\lambda_{{2}}-\beta_{{1}}
\geq 0,\ \lambda_{{1}}+\lambda_{{2}}-\beta_{{2}}
\geq 0\},$}
\\
\mathfrak{c}_{20} &= \parbox[t]{0.8\columnwidth}{$\{\lambda_{{1}}+\lambda_{{2}}-\beta_{{1}}+\beta_{{2}}
\geq 0,\ -\lambda_{{1}}-2\lambda_{{2}}+\beta_{{1}}
\geq 0,\ -\lambda_{{1}}+\beta_{{1}}-\beta_{{2}}
\geq 0,\ \beta_{{1}}-2\beta_{{2}}
\geq 0\},$}
\\
\mathfrak{c}_{21} &= \parbox[t]{0.8\columnwidth}{$\{\lambda_{{1}}+\lambda_{{2}}-\beta_{{2}}
\geq 0,\ -\lambda_{{1}}+\beta_{{1}}
\geq 0,\ -2\lambda_{{2}}-\beta_{{1}}+2\beta_{{2}}
\geq 0,\ -\beta_{{1}}+\beta_{{2}}
\geq 0\},$}
\\
\mathfrak{c}_{22} &= \parbox[t]{0.8\columnwidth}{$\{-\lambda_{{1}}-\lambda_{{2}}+\beta_{{2}}
\geq 0,\ \lambda_{{1}}
\geq 0,\ 2\lambda_{{2}}+\beta_{{1}}-2\beta_{{2}}
\geq 0,\ -\beta_{{1}}+\beta_{{2}}
\geq 0\},$}
\\
\mathfrak{c}_{23} &= \parbox[t]{0.8\columnwidth}{$\{\lambda_{{2}}
\geq 0,\ -\lambda_{{1}}-2\lambda_{{2}}+\beta_{{1}}
\geq 0,\ \lambda_{{1}}-\beta_{{1}}+\beta_{{2}}
\geq 0,\ \beta_{{1}}-2\beta_{{2}}
\geq 0\},$}
\\
\mathfrak{c}_{24} &= \parbox[t]{0.8\columnwidth}{$\{-2\lambda_{{2}}-\beta_{{1}}+2\beta_{{2}}
\geq 0,\ \beta_{{1}}-\beta_{{2}}
\geq 0,\ \lambda_{{1}}+\lambda_{{2}}-\beta_{{2}}
\geq 0,\ -\lambda_{{1}}+\beta_{{1}}
\geq 0,\ \lambda_{{1}}+2\lambda_{{2}}-\beta_{{1}}
\geq 0\},$}
\\
\mathfrak{c}_{25} &= \parbox[t]{0.8\columnwidth}{$\{-\lambda_{{1}}-2\lambda_{{2}}+\beta_{{1}}
\geq 0,\ -\lambda_{{1}}+\beta_{{1}}-\beta_{{2}}
\geq 0,\ -\beta_{{1}}+2\beta_{{2}}
\geq 0,\ \lambda_{{1}}+\lambda_{{2}}-\beta_{{2}}
\geq 0\},$}
\\
\mathfrak{c}_{26} &= \parbox[t]{0.8\columnwidth}{$\{\lambda_{{1}}
\geq 0,\ -\lambda_{{1}}-\lambda_{{2}}+\beta_{{2}}
\geq 0,\ -\lambda_{{1}}+\beta_{{1}}-\beta_{{2}}
\geq 0,\ \lambda_{{1}}+2\lambda_{{2}}-\beta_{{1}}
\geq 0\},$}
\\
\mathfrak{c}_{27} &= \parbox[t]{0.8\columnwidth}{$\{\lambda_{{1}}+2\lambda_{{2}}+\beta_{{1}}-2\beta_{{2}}
\geq 0,\ -\lambda_{{1}}-\lambda_{{2}}+\beta_{{2}}
\geq 0,\ -2\lambda_{{2}}-\beta_{{1}}+2\beta_{{2}}
\geq 0,\ -\beta_{{1}}+\beta_{{2}}
\geq 0\},$}
\\
\mathfrak{c}_{28} &= \parbox[t]{0.8\columnwidth}{$\{-\lambda_{{1}}-2\lambda_{{2}}+\beta_{{1}}
\geq 0,\ -\beta_{{1}}+2\beta_{{2}}
\geq 0,\ 2\lambda_{{2}}+\beta_{{1}}-2\beta_{{2}}
\geq 0,\ \lambda_{{1}}-\beta_{{1}}+\beta_{{2}}
\geq 0,\ \lambda_{{1}}+\lambda_{{2}}-\beta_{{2}}
\geq 0\},$}
\\
\mathfrak{c}_{29} &= \parbox[t]{0.8\columnwidth}{$\{\lambda_{{2}}
\geq 0,\ -\lambda_{{1}}-2\lambda_{{2}}+\beta_{{1}}
\geq 0,\ -2\lambda_{{2}}-\beta_{{1}}+2\beta_{{2}}
\geq 0,\ \lambda_{{1}}+\lambda_{{2}}-\beta_{{2}}
\geq 0\},$}
\\
\mathfrak{c}_{30} &= \parbox[t]{0.8\columnwidth}{$\{-\lambda_{{1}}-\lambda_{{2}}+\beta_{{2}}
\geq 0,\ \beta_{{1}}-\beta_{{2}}
\geq 0,\ \lambda_{{1}}+2\lambda_{{2}}-\beta_{{1}}
\geq 0,\ -2\lambda_{{2}}-\beta_{{1}}+2\beta_{{2}}
\geq 0\},$}
\\
\mathfrak{c}_{31} &= \parbox[t]{0.8\columnwidth}{$\{-\lambda_{{1}}-2\lambda_{{2}}+\beta_{{1}}
\geq 0,\ -\lambda_{{1}}+\beta_{{1}}-\beta_{{2}}
\geq 0,\ 2\lambda_{{1}}+2\lambda_{{2}}-\beta_{{1}}
\geq 0,\ -\lambda_{{1}}-\lambda_{{2}}+\beta_{{2}}
\geq 0\},$}
\\
\mathfrak{c}_{32} &= \parbox[t]{0.8\columnwidth}{$\{2\lambda_{{2}}+\beta_{{1}}-2\beta_{{2}}
\geq 0,\ -\lambda_{{1}}-\lambda_{{2}}+\beta_{{2}}
\geq 0,\ -\lambda_{{1}}-2\lambda_{{2}}+\beta_{{1}}
\geq 0,\ \lambda_{{1}}-\beta_{{1}}+\beta_{{2}}
\geq 0\},$}
\\
\mathfrak{c}_{33} &= \parbox[t]{0.8\columnwidth}{$\{-\lambda_{{1}}-\lambda_{{2}}+\beta_{{2}}
\geq 0,\ \lambda_{{1}}+2\lambda_{{2}}-\beta_{{2}}
\geq 0,\ -\lambda_{{1}}-2\lambda_{{2}}+\beta_{{1}}
\geq 0,\ -2\lambda_{{2}}-\beta_{{1}}+2\beta_{{2}}
\geq 0\}.$}\end{aligned}$$ ]{}
In order to get a feeling for this decomposition of $(\Lambda \otimes_\mathbf{Z} \mathbf{R}) \times (Q \otimes_\mathbf{Z} \mathbf{R})$, consider the intersection of the fan with the affine plane given by $\lambda = (1, 2)$ as indicated in figure \[fig:cone-intersection\]. In figure \[fig:b2-zerlegung-cartesian\], you find a visualization of the induced decomposition of $Q \otimes_\mathbf{Z} \mathbf{R}$ in Cartesian coordinates with respect to the Killing form. The highest weight $\omega_1 + 2\omega_2$ corresponds to the upper right corner. Note that this figure describes the structure of the weight multiplicity function of any module of highest weight $k \lambda$ for $k \in \mathbf{Z}_{>0}$.
(4,4)(-0.5,-0.5) (-0.5,0)[(1,0)[4]{}]{} (0,-0.5)[(0,1)[4]{}]{} (3.5,-0.1)[(0,0)\[t\][$\Lambda \otimes \mathbf{R}$]{}]{} (-0.1,3.5)[(0,0)\[tr\][$Q \otimes \mathbf{R}$]{}]{} (0,0)[(1,1)[3]{}]{} (0,0)[(2,1)[3]{}]{} (2.5,1.75)[(0,0)[$F$]{}]{} (2,-0.1)[(0,1)[3.1]{}]{} (2,-0.1)[(0,0)\[t\][$\lambda$]{}]{} (2,1)[(0,1)[1]{}]{}
The quasi-polynomials describing the weight multiplicity function on the above cones are
[ $$\begin{aligned}
f_{1}&=\parbox[t]{0.8\columnwidth}{$\frac{1}{2}\beta_1+\frac{1}{2}\beta_2+\beta_2\beta_1-\frac{1}{2}\beta_2^2+\frac{7}{8}-\frac{1}{4}\beta_1^2+\frac{1}{8}(-1)^{\beta_1}$,}\\
f_{2}&=\parbox[t]{0.8\columnwidth}{$\frac{1}{2}\lambda_1-\frac{1}{2}\beta_1+\frac{3}{2}\beta_2-\frac{1}{4}\lambda_1^2+\frac{1}{2}\beta_2^2+{\frac{7}{8}}-\frac{1}{4}\beta_1^2+\frac{1}{8}(-1)^{\beta_1+\lambda_1}+\frac{1}{2}\lambda_1\beta_1$,}\\
f_{3}&=\parbox[t]{0.8\columnwidth}{$\frac{1}{8}(-1)^{\beta_1}+\frac{1}{2}\lambda_1+\frac{1}{2}\beta_2-\frac{1}{4}\lambda_1^2+\frac{3}{4}-\frac{1}{2}\beta_2^2-\frac{1}{2}\beta_1^2+\frac{1}{2}\lambda_1\beta_1+\frac{1}{8}(-1)^{\beta_1+\lambda_1}+\beta_2\beta_1$,}\\
f_{4}&=\parbox[t]{0.8\columnwidth}{$\frac{1}{8}(-1)^{\beta_1}+\beta_1+\frac{1}{4}\beta_1^2+{\frac{7}{8}}$,}\\
f_{5}&=\parbox[t]{0.8\columnwidth}{$1+\frac{3}{2}\beta_2+\frac{1}{2}\beta_2^2$,}\\
f_{6}&=\parbox[t]{0.8\columnwidth}{$\frac{1}{2}\lambda_2+\frac{1}{2}\beta_1+\beta_2\beta_1-\beta_2^2-\frac{1}{4}\beta_1^2+\lambda_2\beta_2-\frac{1}{2}{\lambda_{
{2}}}^2+\frac{1}{8}(-1)^{\beta_1}+{\frac{7}{8}}$,}\\
f_{7}&=\parbox[t]{0.8\columnwidth}{$\lambda_1-\beta_1+2\beta_2+\frac{1}{4}\lambda_1^2+\frac{1}{8}(-1)^{\beta_1+\lambda_1}+\beta_2^2+{\frac{7}{8}}-\frac{1}{2}\lambda_1\beta_1+\frac{1}{4}\beta_1^2+\lambda_1\beta_2-\beta_2\beta_1$,}\\
f_{8}&=\parbox[t]{0.8\columnwidth}{$\frac{1}{2}\lambda_1+\frac{1}{2}\beta_1-\frac{1}{4}\lambda_1^2+\frac{3}{4}+\frac{1}{2}\lambda_1\beta_1+\frac{1}{8}(-1)^{\beta_1+\lambda_1}+\frac{1}{8}(-1)^{\beta_1}$,}\\
f_{9}&=\parbox[t]{0.8\columnwidth}{$\frac{1}{2}\lambda_2+\frac{1}{2}\lambda_1-\frac{1}{2}\beta_1+\beta_2-\frac{1}{4}\lambda_1^2-\frac{1}{4}\beta_1^2+\lambda_2\beta_2+\frac{1}{2}\lambda_1\beta_1-\frac{1}{2}\lambda_2^2+\frac{1}{8}(-1)^{\beta_1+\lambda_1}+{\frac{7}{8}}$,}\\
f_{10}&=\parbox[t]{0.8\columnwidth}{$\frac{1}{2}\lambda_2+\frac{1}{2}\lambda_1-\frac{1}{4}\lambda_1^2+\frac{3}{4}-\beta_2^2-\frac{1}{2}\beta_1^2+\lambda_2\beta_2+\frac{1}{8}(-1)^{\beta_1}+\frac{1}{2}\lambda_1\beta_1-\frac{1}{2}\lambda_2^2+\frac{1}{8}(-1)^{\beta_1+\lambda_1}+\beta_2\beta_1$,}\\
f_{11}&=\parbox[t]{0.8\columnwidth}{$\frac{1}{2}\lambda_2+\beta_1-\frac{1}{2}\beta_2-\frac{1}{2}\beta_2^2+\frac{1}{4}\beta_1^2+{\frac{7}{8}}+\lambda_2\beta_2+\frac{1}{8}(-1)^{\beta_1}-\frac{1}{2}\lambda_2^2$,}\\
f_{12}&=\parbox[t]{0.8\columnwidth}{$1+\frac{1}{2}\lambda_2+\beta_2+\lambda_2\beta_2-\frac{1}{2}\lambda_2^2$,}\\
f_{13}&=\parbox[t]{0.8\columnwidth}{$\lambda_1-\frac{1}{2}\beta_1+\beta_2+\frac{1}{4}\lambda_1^2+\frac{3}{4}+\lambda_1\beta_2+\frac{1}{8}(-1)^{\beta_1}+\frac{1}{8}(-1)^{\beta_1+\lambda_1}-\frac{1}{2}\lambda_1\beta_1$,}\\
f_{14}&=\parbox[t]{0.8\columnwidth}{$\frac{1}{2}\lambda_2+\lambda_1-\beta_1+\frac{3}{2}\beta_2+\frac{1}{4}\lambda_1^2+\frac{1}{2}\beta_2^2+\lambda_1\beta_2+\frac{1}{4}\beta_1^2+\lambda_2\beta_2-\frac{1}{2}\lambda_2^2-\beta_2\beta_1-\frac{1}{2}\lambda_1\beta_1+{\frac{7}{8}}+\frac{1}{8}(-1)^{\beta_1+\lambda_1}$,}\\
f_{15}&=\parbox[t]{0.8\columnwidth}{$\frac{1}{2}\lambda_2+\frac{1}{2}\lambda_1+\frac{1}{2}\beta_1-\frac{1}{2}\beta_2+\frac{1}{8}(-1)^{\beta_1}-\frac{1}{4}\lambda_1^2+\frac{3}{4}-\frac{1}{2}\beta_2^2+\lambda_2\beta_2-\frac{1}{2}\lambda_2^2+\frac{1}{8}(-1)^{\beta_1+\lambda_1}+\frac{1}{2}\lambda_1\beta_1$,}\\
f_{16}&=\parbox[t]{0.8\columnwidth}{$\lambda_2+\lambda_1-\frac{1}{2}\beta_2+\frac{1}{8}(-1)^{\beta_1}+\frac{1}{4}\lambda_1^2+\frac{3}{4}-\frac{1}{2}\beta_2^2-\lambda_1\beta_2-\frac{1}{2}\beta_1^2+\lambda_2\lambda_1+\frac{1}{2}\lambda_1\beta_1+\frac{1}{8}(-1)^{\beta_1+\lambda_1}+\beta_2\beta_1$,}\\
f_{17}&=\parbox[t]{0.8\columnwidth}{$1+\frac{3}{2}\lambda_2+\frac{3}{2}\beta_1-\frac{3}{2}\beta_2+\frac{1}{2}\beta_2^2+\frac{1}{2}\beta_1^2-\lambda_2\beta_2+\frac{1}{2}\lambda_2^2+\lambda_2\beta_1-\beta_2\beta_1$,}\\
f_{18}&=\parbox[t]{0.8\columnwidth}{$1+\frac{3}{2}\lambda_2+\beta_1-\beta_2-\lambda_2\beta_2+\frac{1}{2}\lambda_2^2+\lambda_2\beta_1$,}\\
f_{19}&=\parbox[t]{0.8\columnwidth}{$\frac{1}{2}\lambda_2+\lambda_1-\frac{1}{2}\beta_1+\frac{1}{2}\beta_2+\frac{1}{4}\lambda_1^2+\frac{3}{4}-\frac{1}{2}\beta_2^2+\lambda_1\beta_2+\lambda_2\beta_2-\frac{1}{2}\lambda_2^2-\frac{1}{2}\lambda_1\beta_1+\frac{1}{8}(-1)^{\beta_1}+\frac{1}{8}(-1)^{\beta_1+\lambda_1}$,}\\
f_{20}&=\parbox[t]{0.8\columnwidth}{$1+\frac{1}{2}\beta_2^2+\frac{1}{2}\lambda_1^2+\frac{1}{2}\lambda_2^2+\lambda_2\lambda_1+\lambda_2\beta_2+\lambda_1\beta_2+\frac{3}{2}\beta_2+\frac{3}{2}\lambda_2+\frac{3}{2}\lambda_1-\frac{3}{2}\beta_1+\frac{1}{2}\beta_1^2-\lambda_2\beta_1-\beta_2\beta_1-\lambda_1\beta_1$,}\\
f_{21}&=\parbox[t]{0.8\columnwidth}{$\frac{3}{2}\lambda_2+\frac{1}{2}\lambda_1+\beta_1-\frac{3}{2}\beta_2-\frac{1}{4}\lambda_1^2+\frac{1}{2}\beta_2^2+\frac{1}{4}\beta_1^2-\lambda_2\beta_2+{\frac{7}{8}}+\frac{1}{2}\lambda_2^2+\frac{1}{8}(-1)^{\beta_1+\lambda_1}+\lambda_2\beta_1+\frac{1}{2}\lambda_1\beta_1-\beta_2\beta_1$,}\\
f_{22}&=\parbox[t]{0.8\columnwidth}{$\lambda_2+\lambda_1+\frac{1}{2}\beta_1-\beta_2+\frac{1}{4}\lambda_1^2+\frac{3}{4}-\lambda_1\beta_2+\lambda_2\lambda_1+\frac{1}{8}(-1)^{\beta_1}+\frac{1}{2}\lambda_1\beta_1+\frac{1}{8}(-1)^{\beta_1+\lambda_1}$,}\\
f_{23}&=\parbox[t]{0.8\columnwidth}{$1+\beta_2+\lambda_1-\beta_1+\frac{1}{2}\lambda_2^2+\lambda_2\lambda_1+\lambda_2\beta_2+\frac{3}{2}\lambda_2-\lambda_2\beta_1$,}\\
f_{24}&=\parbox[t]{0.8\columnwidth}{$\frac{3}{2}\lambda_2+\frac{1}{2}\lambda_1+\frac{1}{2}\beta_1-\beta_2-\frac{1}{4}\lambda_1^2-\frac{1}{4}\beta_1^2-\lambda_2\beta_2+\frac{1}{2}\lambda_2^2+\frac{1}{2}\lambda_1\beta_1+\lambda_2\beta_1+{\frac{7}{8}}+\frac{1}{8}(-1)^{\beta_1+\lambda_1}$,}\\
f_{25}&=\parbox[t]{0.8\columnwidth}{$\frac{3}{2}\lambda_2+\frac{3}{2}\lambda_1-\beta_1+\frac{1}{2}\beta_2+\frac{1}{2}\lambda_1^2-\frac{1}{2}\beta_2^2+\lambda_1\beta_2+\frac{1}{4}\beta_1^2+\lambda_2\lambda_1+\lambda_2\beta_2+\frac{1}{2}\lambda_2^2-\lambda_1\beta_1+{\frac{7}{8}}+\frac{1}{8}(-1)^{\beta_1}-\lambda_2\beta_1$,}\\
f_{26}&=\parbox[t]{0.8\columnwidth}{$\frac{3}{4}+\frac{3}{4}\lambda_1^2+\lambda_2\lambda_1+\lambda_2+\frac{3}{2}\lambda_1-\frac{1}{2}\lambda_1\beta_1+\frac{1}{8}(-1)^{\beta_1}-\frac{1}{2}\beta_1+\frac{1}{8}(-1)^{\beta_1+\lambda_1}$,}\\
f_{27}&=\parbox[t]{0.8\columnwidth}{$2\lambda_2+\lambda_1+\beta_1-2\beta_2+\frac{1}{4}\lambda_1^2+\beta_2^2-\lambda_1\beta_2+\frac{1}{4}\beta_1^2+\lambda_2\lambda_1-2\lambda_2\beta_2+\lambda_2^2+\frac{1}{2}\lambda_1\beta_1+\frac{1}{8}(-1)^{\beta_1+\lambda_1}-\beta_2\beta_1+\lambda_2\beta_1+{\frac{7}{8}}$,}\\
f_{28}&=\parbox[t]{0.8\columnwidth}{$\frac{3}{2}\lambda_2+\lambda_1-\frac{1}{2}\beta_1-\beta_2^2-\frac{1}{4}\beta_1^2+\lambda_2\lambda_1+\lambda_2\beta_2+\frac{1}{2}\lambda_2^2+\beta_2\beta_1-\lambda_2\beta_1+{\frac{7}{8}}+\frac{1}{8}(-1)^{\beta_1}$,}\\
f_{29}&=\parbox[t]{0.8\columnwidth}{$1+\frac{5}{2}\lambda_2+\lambda_1-\beta_2+\lambda_2\lambda_1-\lambda_2\beta_2+\frac{3}{2}\lambda_2^2$,}\\
f_{30}&=\parbox[t]{0.8\columnwidth}{$2\lambda_2+\lambda_1+\frac{1}{2}\beta_1-\frac{3}{2}\beta_2+\frac{1}{4}\lambda_1^2+\frac{1}{2}\beta_2^2-\lambda_1\beta_2-\frac{1}{4}\beta_1^2+\lambda_2\lambda_1-2\lambda_2\beta_2+\lambda_2^2+\frac{1}{2}\lambda_1\beta_1+{\frac{7}{8}}+\frac{1}{8}(-1)^{\beta_1+\lambda_1}+\lambda_2\beta_1$,}\\
f_{31}&=\parbox[t]{0.8\columnwidth}{${\frac{7}{8}}+\lambda_2^2+\lambda_1^2+2\lambda_2\lambda_1+2\lambda_2+2\lambda_1-\beta_1+\frac{1}{4}\beta_1^2-\lambda_2\beta_1-\lambda_1\beta_1+\frac{1}{8}(-1)^{\beta_1}$,}\\
f_{32}&=\parbox[t]{0.8\columnwidth}{$2\lambda_2+\frac{3}{2}\lambda_1-\frac{1}{2}\beta_1-\frac{1}{2}\beta_2+\frac{1}{2}\lambda_1^2-\frac{1}{2}\beta_2^2-\lambda_1\beta_2-\frac{1}{4}\beta_1^2+2\lambda_2\lambda_1+\lambda_2^2+\frac{1}{8}(-1)^{\beta_1}+\beta_2\beta_1+{\frac{7}{8}}-\lambda_2\beta_1$,}\\
f_{33}&=\parbox[t]{0.8\columnwidth}{$1+3\lambda_2+\frac{3}{2}\lambda_1-\frac{3}{2}\beta_2+\frac{1}{2}\lambda_1^2+\frac{1}{2}\beta_2^2-\lambda_1\beta_2+2\lambda_2\lambda_1-2\lambda_2\beta_2+2\lambda_2^2$.}\end{aligned}$$ ]{}
An example on how to use these tables: In order to determine the character of $V(\lambda)$ for $\lambda = 4 \omega_1 + 8 \omega_2)$ we can observe that the tuples $(\lambda, \beta)$ belong to $\mathfrak{c}_1$ for $\beta \in \{ 0,\ \alpha_1 + \alpha_2,\ 2\alpha_1 + \alpha_2,\ 2\alpha_1 + 2\alpha_2,\ 3\alpha_1 + 2\alpha_2,\ 4\alpha_1 + 2\alpha_2,\ 3\alpha_1 + 3\alpha_2,\ 4\alpha_1 + 3\alpha_2,\ 4\alpha_1 + 4\alpha_2 \}$. So by evaluating the quasi-polynomial $f_1$, we immediately get the following weight multiplicities:
$$\begin{aligned}
K^{(4,8)}_{(0,0)} &= 1, &
K^{(4,8)}_{(1,1)} &= 2, &
K^{(4,8)}_{(2,1)} &= 3, \\
K^{(4,8)}_{(2,2)} &= 4, &
K^{(4,8)}_{(3,2)} &= 5, &
K^{(4,8)}_{(4,2)} &= 6, \\
K^{(4,8)}_{(3,3)} &= 6, &
K^{(4,8)}_{(4,3)} &= 8, &
K^{(4,8)}_{(4,4)} &= 9.\end{aligned}$$
Note that if you want to compare the values e.g. using the LiE online calculator by A. Cohen et al.[^4] you have to take into account that LiE uses the inverse parametrization of the simple roots, and that LiE denotes weights absolutely, not with respect to the highest weight of the module under consideration. The necessary reparametrization is $$\begin{aligned}
\tilde\lambda_1 &= \lambda_2, &
\tilde\mu_1 &= \lambda_2 + \beta_1 - 2\beta_2, \\
\tilde\lambda_2 &= \lambda_1, &
\tilde\mu_2 &= \lambda_1 - 2\beta_1 + 2\beta_2.\end{aligned}$$
Some conclusions
================
The weight $0$ does not occur in $V(\lambda)$ unless $\lambda = i \alpha_1 + j \alpha_2$ for nonnegative integers $i, j$ such that $\frac{i}{2} \leq j \leq i$. In this case $$\dim V(\lambda)_0 = \frac{i}{2} - i^2 + 3ij - 2j^2 + \frac{3 + (-1)^i}{4}.$$
The weight $0$ does not occur in $V(\lambda)$ unless $\lambda \in Q$, so suppose $\lambda = i \alpha_1 + j \alpha_2 = (2i-2j)\omega_1 + (-i+2j)\omega_2$. The inequalities imposed on $i, j$ are equivalent to $\lambda$ being dominant. We calculate $K^{(2i-2j, -i+2j)}_{(i,j)}$ using the above results: The vector $(2i-2j, -i+2j, i, j)$ is contained in $\mathfrak{c}_{10}$, so we get $\dim V(\lambda)_0$ by evaluating $f_{10}$ at this vector. This yields the asserted formula.
It is well known that $\dim V(\lambda)_\lambda = 1$ for all dominant weights $\lambda$. But what is $\dim V(\lambda)_{\lambda-\epsilon}$ for some fixed $\epsilon \in Q$? See figure \[fig:around-lambda\] for the picture of the Weyl polytope around the highest weight.
(3,2)(-1.5,-1.5) (0,0)[(-1,0)[1.5]{}]{} (0,0)[(-1,-1)[1.5]{}]{} (0,0)[(0,-1)[1.5]{}]{} (0,0)[(1,-1)[1.5]{}]{} (0,0) (-1,0) (-1,-1) (0,-1) (1,-1) (0,0.0)[(0,0.4)\[t\][$\lambda$]{}]{} (-1,0.0)[(0,0.4)\[t\][$\lambda-\alpha_1$]{}]{} (1.2,-1)[(0,0)\[l\][$\lambda-\alpha_2$]{}]{} (-1.2,-1)[(0,0)\[r\][$\lambda-2\alpha_1-\alpha_2$]{}]{} (-1.2,-0.5)[(0,0)[$\mathfrak{c}_5$]{}]{} (-0.5,-1.2)[(0,0)[$\mathfrak{c}_1$]{}]{} (0.5,-1.2)[(0,0)[$\mathfrak{c}_4$]{}]{}
Let $\lambda = \lambda_1 \omega_1 + \lambda_2 \omega_2$ be a dominant weight. Then the weight multiplicities in $V(\lambda)$ of weights close to $\lambda$ are given by $$\begin{aligned}
\dim V(\lambda)_{\lambda-\alpha_1} &= 1 \text{ if } \lambda_1 \geq 1, \\
\dim V(\lambda)_{\lambda-2\alpha_1-\alpha_2} &= 3 \text{ if } \lambda_1 \geq 2,\ \lambda_2 \geq 1, \\
\dim V(\lambda)_{\lambda-\alpha_1-\alpha_2} &= 2 \text{ if } \lambda_1, \lambda_2 \geq 1, \\
\dim V(\lambda)_{\lambda-\alpha_2} &= 1 \text{ if } \lambda_2 \geq 1.\end{aligned}$$
The first equation can be seen as follows: $\dim V(\lambda)_{\lambda-\alpha_1} = K^{(\lambda_1,\lambda_2)}_{(1,0)}$. For $\lambda_1 \geq 1$, the vector $(\lambda_1, \lambda_2, 1, 0)$ is in $\mathfrak{c}_5$. The value of $f_5$ at this vector is $1$.
The remaining equations can be shown similarly. Note that in order to show the second and third equation, one can use either $f_5$ or $f_1$ respectively either $f_1$ or $f_4$.
Acknowledgements {#acknowledgements .unnumbered}
================
This article was prepared during a stay at the Dipartimento di Matematica of the Università di Roma “Tor Vergata.” I thank W. Baldoni and the dipartimento for their hospitality.
[14]{}
W. Baldoni, M. Beck, Ch. Cochet, M. Vergne, Volume computations for polytopes and partition functions for classical root systems, *Discrete and computational geometry* **35** (2006), 551–595. [[MR2225674](http://www.ams.org/mathscinet-getitem?mr=MR2225674)]{}, [[](http://dx.doi.org/10.1007/s00454-006-1234-2)]{}, [[](http://arxiv.org/abs/math/0504231v2)]{}.
S. Billey, V. Guillemin, E. Rassart, A vector partition function for the multiplicities of $\mathfrak{sl}_k(\mathbf{C})$, *Journal of algebra* **278** (2004), 251–293. [[MR2068078](http://www.ams.org/mathscinet-getitem?mr=MR2068078)]{}, [[](http://dx.doi.org/10.1016/j.jalgebra.2003.12.005)]{}, [[](http://arxiv.org/abs/math/0307227v1)]{}.
C. De Concini, C. Procesi, Nested sets and Jeffrey Kirwan residues, pp. 139–149 in: F. Bogomolov, Y. Tschinkel (ed.), *Geometric methods in algebra and number theory*, , 2005. [[MR2159380](http://www.ams.org/mathscinet-getitem?mr=MR2159380)]{}, [[](http://arxiv.org/abs/math/0406290v1)]{}.
I. Gelfand, M. Tsetlin, Finite-dimensional representations of the group of unimodular matrices, pp. 653–656 in: I. Gelfand, *Collected papers*, volume II, Springer, 1988. Originally appeared in *Doklady akademii nauk SSSR, nowaja serija* **71** (1950), 825–828. [[Zbl ](http://www.zentralblatt-math.org/zmath/en/advanced/?q=an:0037.15301&format=complete)]{}.
G. Heckman, *Projections of orbits and asymptotic behavior of multiplicities for compact Lie groups*, thesis, Universiteit Leiden, 1980.
L. Jeffrey, F. Kirwan, Localization for nonabelian group actions, *Topology* **34** (1995), 291–327. [[MR1318878](http://www.ams.org/mathscinet-getitem?mr=MR1318878)]{}, [[](http://dx.doi.org/10.1016/0040-9383(94)00028-J)]{}.
M. Kashiwara, On crystal bases, pp. 155–197 in: B. N. Allison et al. (ed.), *Representations of groups*, CMS conference proceedings, no. 16, American Mathematical Society, 1995. [[MR1357199](http://www.ams.org/mathscinet-getitem?mr=MR1357199)]{}.
B. Kostant, A formula for the multiplicity of a weight, *Transactions of the American Mathematical Society* **93** (1959), 53–73. [[MR0109192](http://www.ams.org/mathscinet-getitem?mr=MR0109192)]{}, [[](http://dx.doi.org/10.2307/1993422)]{}.
P. Littelmann, A Littlewood-Richardson rule for symmetrizable Kac-Moody algebras, *Inventiones mathematicae* **116** (1994), 329–346. [[MR1253196](http://www.ams.org/mathscinet-getitem?mr=MR1253196)]{}, [[](http://dx.doi.org/10.1007/BF01231564)]{}.
P. Littelmann, Paths and root operators in representation theory, *Annals of mathematics* **142** (1995), 499–525. [[MR1356780](http://www.ams.org/mathscinet-getitem?mr=MR1356780)]{}, [[](http://dx.doi.org/10.2307/2118553)]{}.
P. Littelmann, Cones, crystals, and patterns, *Transformation groups* **3** (1998), 145–179. [[MR1628449](http://www.ams.org/mathscinet-getitem?mr=MR1628449)]{}, [[](http://dx.doi.org/10.1007/BF01236431)]{}.
B. Sturmfels, Note on vector partition functions, *Journal of combinatorial theory, series A* **72** (1995), 302–309. [[MR1357776](http://www.ams.org/mathscinet-getitem?mr=MR1357776)]{}, [[](http://dx.doi.org/10.1016/0097-3165(95)90067-5)]{}.
A. Szenes, M. Vergne, Residue formulae for vector partitions and Euler-MacLaurin sums, *Advances in applied mathematics* **30** (2003), 295–342. [[MR1979797](http://www.ams.org/mathscinet-getitem?mr=MR1979797)]{}, [[](http://dx.doi.org/10.1016/S0196-8858(02)00538-9)]{}, [[](http://arxiv.org/abs/math/0202253v1)]{}.
[ngerman]{} H. Weyl, Theorie der Darstellung kontinuierlicher halbeinfacher Gruppen durch lineare Transformationen, I, II, III, Nachtrag, *Mathematische Zeitschrift* **23** (1925), 271–309, **24** (1926), 328–376, 377–395, 789–791. [[Zbl ](http://www.zentralblatt-math.org/zmath/en/advanced/?q=an:51.0319.01&format=complete)]{}.
[^1]: Note that De Concini and Procesi [@deconcini2005] use the inverse ordering.
[^2]: <http://www.maplesoft.com/>
[^3]: <http://www-fourier.ujf-grenoble.fr/~franz/>
[^4]: <http://www-math.univ-poitiers.fr/~maavl/LiE/form.html>
|
(A)
Introduction: All goods or services paid,
in whole or in part, with Older Americans Act funds are subject to voluntary
contributions. All services paid, in whole or in part, with Older Americans Act
funds are subject to cost sharing, except for goods or services excluded by
paragraph (C)(1) of this rule.
(1)
Each provider
shall allow consumers to contribute towards the provision of goods or services
paid, in whole or in part, with Older Americans Act funds, pursuant to section
315(b)(1) of the Older Americans Act and
45 C.F.R. 1321.67(a)(1) . The provider may
solicit consumers to contribute toward the cost of the goods and services they
receive and shall encourage any consumer to contribute if the consumer's
self-declared income is at, or above, one hundred eighty-five per cent of the
federal poverty guidelines, which the United States department of
health and human services establishes annually according to section 673(2) of
the Omnibus Reconciliation Act of 1981, 95 Stat. 511,
42 U.S.C. 9902 and publishes on
https://aspe.hhs.gov/poverty-guidelines.
(2)
The provider shall clearly inform each
consumer that contributions are purely voluntary.
(3)
The provider shall protect the privacy of
each consumer with respect to his or her contribution.
(4)
The provider shall safeguard and account
for all voluntary contributions.
(5)
The provider may develop a suggested
contributions schedule for voluntary contributions according to
45 C.F.R. 1321.67(c) .
(6)
The provider shall use collected
voluntary contributions to expand the goods or services for which consumers
contributed and supplement (not supplant) Older Americans Act funds for those
goods or services.
(e)
Transportation, although the AAA may apply to ODA for a waiver of this
exemption if the transportation is coordinated with other services and is paid,
in whole or in part, with Older Americans Act funds.
(2)
Each AAA shall implement and administer a
cost-sharing policy that includes all of the following:
(a)
The policy shall include the sliding-fee
schedule below, which determines the percentage of the actual (or partial)
contracted cost of a unit of a good or a service provided that the AAA shall
suggest that a consumer pay based upon the consumer's individual income as a
percentage of the federal poverty guideline. Under no circumstances shall an AAA
permit or require a consumer to participate in cost sharing when the consumer's
income is below one hundred fifty per
cent of the federal poverty guideline.
Sliding-fee Schedule
INCOME
SUGGESTED COST SHARE
149% and below
0%
150-174%
10%
175-199%
20%
200-224%
30%
225-249%
40%
250-274%
50%
275-299%
60%
300-324%
70%
325-349%
80%
350-374%
90%
375% and above
100%
(b)
The
policy shall include a requirement to determine the consumer's income solely by
the consumer's self-declaration of income with no requirement for verification,
and no consideration of the consumer's assets, savings, or other
property.
(c)
The policy shall
include a procedure for collecting cost-sharing payments from consumers,
including from consumers receiving consumer-directed services.
(d)
The policy shall include a requirement to
widely distribute written materials to consumers that describe the requirements
for cost sharing, the services subject to cost sharing, the procedure for cost
sharing, and the sliding-fee schedule published in this rule. The written
materials shall also state that a provider shall not deny any goods or services
paid, in whole or in part, by Older Americans Act funds if the consumer fails
to make a cost sharing payment towards those goods or services.
(e)
The policy shall include a requirement to
provide a receipt to a consumer or caregiver who makes a payment.
(f)
The policy shall include a procedure for
safeguarding and accounting for all cost-sharing funds collected.
(g)
The policy shall include a requirement to
retain records of all cost-sharing funds collected.
(h)
The policy shall include a requirement to
keep the consumer's declaration of income (or non-declaration of income) and
cost-sharing payment history confidential.
(i)
The policy shall include a requirement to
use the funds collected from cost sharing to expand the capacity to provide the
service for which the funds were given, unless the funds are used to expand the
pool of funds from which the care-coordinated services are paid.
(3)
The AAA may delegate the
administration of its cost-sharing policy to providers with whom it enters into
an AAA-provider agreement under rule
173-3-06
of the Administrative Code.
(4)
The
AAA may request a waiver from paragraph (C)(3) of this rule to implement and
administer a cost-sharing policy. ODA shall approve the request if the AAA
demonstrates to ODA, by a preponderance of the evidence, one or more of the
following:
(a)
At least eighty per cent of
the consumers in the PSA have incomes below one hundred fifty per cent of the
federal poverty level.
(b)
Cost
sharing generates fewer funds in the PSA than the funds required to cover its
annual, ongoing administrative expenses.
(c)
A waiver is necessary in order for the
services normally subject to this rule to be coordinated with other service
systems. |
Mortality after hip fracture in Austria 2008-2011.
Osteoporosis-related hip fractures represent a substantial cause of mortality and morbidity in industrialized countries like Austria. Identification of groups at high risk for mortality after hip fracture is crucial for health policy decisions. To determine in-hospital, long-term, and excess mortality after osteoporosis-related hip fracture in Austrian patients, we conducted a retrospective cohort analysis of pseudonymized invoice data from Austrian social insurance authorities covering roughly 98 % of the entire population. The data set included 31,668 subjects aged 50 years and above sustaining a hip fracture between July 2008 and December 2010 with follow-up until June 2011, and an age-, gender-, and regionally matched control population without hip fractures (56,320 subjects). Kaplan-Meier and Cox hazard regression analyses served to determine unadjusted and adjusted mortality rates: Unadjusted all-cause 1-year mortality amounted to 20.2 % (95 % CI: 19.7-20.7 %). Males had significantly higher long-term, in-hospital, and excess mortality rates than females, but younger males exhibited lower excess mortality than their female counterparts. Advanced age correlated with increased long-term and in-hospital mortality, but lower excess mortality. Excess mortality, particularly in males, was highest in the first 6 months after hip fracture, but remained statistically significantly elevated throughout the observation period of 3 years. Longer hospital stay per fracture was correlated with mortality reduction in older patients and in patients with more subsequent fractures. In conclusion, more efforts are needed to identify causes and effectively prevent excess mortality especially in male osteoporosis patients. |
November 26 [7:55 EDT] -- Prince is relaunching his waylaid "The Jam of the Year" tour by announcing fifteen more dates. The tour was put on hold November 9 when The Artist required a respite from the road.
When the Jam tour first kicked off last July, Mr. Nelson was not releasing a full tour date listing in advance, in order to abate the illicit pursuits of ticket scalpers. Instead, dates were announced a few days early via the local media in each city. Fans reportedly did not love this system, because it did not afford them enough time to organize getting to the performances.
So with the first date in a little over two weeks, Prince fans in Fargo, North Dakota should have enough time to get to "The Jam of The Year." |
Links
The daughter of a foreign correspondent, Kate Braestrup spent her childhood in Algiers, New York City, Paris, Bangkok, Washington, DC and Sabillasville, Maryland. She married James Andrew "Drew" Griffith in 1985. Shortly after the birth of their first child in 1986, Griffith joined the Maine State Police, and the family moved to midcoast Maine.
Educated at the Parsons School of Design/The New School and Georgetown University, Braestrup originally thought of herself primarily as a writer. She had published a novel, Onion, in 1990, after all, and occasional essays in national publications. More children arrived, but she expected to be able to continue combining motherhood and the writing of fiction and non-fiction for the foreseeable future.
Trooper Griffith was killed in a car accident while on duty in 1996. Kate Braestrup was left a widowed mother of four children between the ages of 3 and 9. Life would not and could not ever be the same as it had been.
As it happened, Drew Griffith had spent the last year of his life thinking about, researching and finally committing himself to becoming a Unitarian Universalist minister, a plan that was naturally discussed extensively with his wife. In this way, unwittingly, he had prepared the way for Kate Braestrup to recognize and develop her own vocation. She entered the Bangor Theological Seminary in 1997, and was ordained in 2004. Since 2001, she has served as chaplain to the Maine Warden Service, joining the wardens as they search the wild lands and fresh waters of Maine for those who have lost their way, and offering comfort to those who wait for the ones they love to be rescued, or for their bodies to be recovered.
In 2006, Braestrup married the artist, Simon van der Ven. Between them, van der Ven and Braestrup have a total of six children, all whom are now sauntering, tiptoeing or being pushed up to and across the threshold of adulthood.
These days, Kate divides her time between her service as chaplain to the Maine Warden Service and writing. In addition, she is a popular public speaker around the country and abroad, entertaining and educating interested audiences with her characteristic honesty, good humor and poignancy. For more information on booking Kate for your next event, click here. |
The test option will send out a test contact so the “contactid” 123 sounds right to me. Do you have the trigger action set up properly? Did you turn the subscription to active?, it is inactive by default. Have you connected/installed it to your portal you want to listen to on? If you are having trouble getting the webhook set up correctly, you can contact support and they can walk you through it step by step. Here is a link to all the ways to contact our support team.
I have no idea how to connect it to a portal. I have a developer account, therefore I can only have test portals. Maybe I should add it to a workflow, but these workflows can’t be activated on trial accounts. Also I can’t ask anything from support, it shows me a login button… although I’m logged in |
[DO NOT PUBLISH]
IN THE UNITED STATES COURT OF APPEALS
FOR THE ELEVENTH CIRCUIT FILED
________________________ U.S. COURT OF APPEALS
ELEVENTH CIRCUIT
January 24, 2006
No. 05-12632 THOMAS K. KAHN
Non-Argument Calendar CLERK
________________________
D. C. Docket No. 04-00467-CR-T-26-EAJ
UNITED STATES OF AMERICA,
Plaintiff-Appellee,
versus
TIRSO VALENTIERRA-SANCHEZ,
Defendant-Appellant.
________________________
Appeal from the United States District Court
for the Middle District of Florida
_________________________
(January 24, 2006)
Before ANDERSON, BIRCH and HULL, Circuit Judges.
PER CURIAM:
Tirso Valentierra-Sanchez appeals his concurrent 135-month sentences for:
(1) possession with intent to distribute five kilograms or more of cocaine while
aboard a vessel subject to United States’ jurisdiction, in violation of 46 App.
U.S.C. § 1903(a), (g), and 21 U.S.C. § 960(b)(1)(B)(ii) (Count One); and (2)
conspiracy to possess with intent to distribute five kilograms or more of cocaine
while aboard a vessel subject to United States’ jurisdiction, in violation of §
1903(g), (j), and § 960(b)(1)(B)(ii) (Count Two). On appeal, Valentierra-Sanchez
argues that the district court erred by failing to consider the sentencing factors
outlined in 18 U.S.C. § 3553(a) when it imposed his sentence. After review, we
affirm.
I. BACKGROUND
The United States Coast Guard (“USCG”) observed a fishing vessel, the San
Jose, in the eastern Pacific Ocean, that was riding low in the water and was not
engaged in fishing activities. USCG personnel boarded the San Jose and detained
its Colombian captain and seven Colombian crew members, including Valentierra-
Sanchez. During a search of the vessel, USCG personnel located several
discolored tiles under the lower bunks in the berthing compartments. After
removing the tiles, they discovered 525 bales of cocaine, weighing a total of
10,500 kilograms. Before the San Jose left Colombia, Valentierra-Sanchez and
2
other crew members met with the captain, who told them that they would be
transporting cocaine to a transfer point in the eastern Pacific Ocean.
Valentierra-Sanchez pled guilty to both counts. The presentence
investigation report (“PSI”) assessed a base offense level of 38 under U.S.S.G. §
2D1.1(c)(1) based on the amount of cocaine (150 kilograms or more) that
Valentierra-Sanchez had possessed and conspired to distribute. Based on a total
offense level of 33 and a criminal history category I, the PSI recommended a
guideline range of 135 to 168 months’ imprisonment.1 In his written objection,
Valentierra-Sanchez argued only that he should receive a mitigating-role reduction
under U.S.S.G. § 3B1.2. Valentierra-Sanchez did not otherwise object to the PSI’s
application of the sentencing guidelines or to the calculation of his guidelines
range.
At the sentencing hearing, Valentierra-Sanchez withdrew his request for a
mitigating-role reduction. The district court nonetheless addressed the request,
noting that it was declining to give Valentierra-Sanchez a downward adjustment
based on the following: (1) Valentierra-Sanchez’s crew members indicated that he
1
To the base offense level of 38, the PSI recommended a two-level reduction in the offense
level under U.S.S.G. § 2D1.1(b)(7) because Valentierra-Sanchez met the criteria for application of
the guidelines’ safety-valve provision, a two-level reduction for acceptance of responsibility under
U.S.S.G. § 3E1.1(a) and a one-level reduction for timely notification of the intent to plead guilty
pursuant to U.S.S.G. § 3E1.1(a) and (b).
3
had been on three previous drug trips on the same vessel; and (2) a substantial
quantity of cocaine was involved in the instant offense. The court then calculated
Valentierra’s advisory guidelines range of 135 to 168 months and stated its belief
that a sentence of 135 months’ imprisonment, at the low end of the range, was
appropriate under the facts of the case and the factors it was supposed to consider,
as follows:
Unless the Government possesses any adverse information, I’m
inclined to treat him the same as I’ve treated everybody else in this
case, except I haven’t sentenced the captain yet. I’m going to give
him the low end which is 135 months. I believe under the facts of this
case and under all the factors I’m supposed to consider, that’s an
appropriate sentence . . . .
After permitting Valentierra-Sanchez to allocute, the district court imposed a
sentence of 135 months’ imprisonment. This appeal followed.
II. DISCUSSION
A. Jurisdiction
The government, as a threshold matter, points out that Valentierra-Sanchez
does not challenge any application of the guidelines or the ultimate calculation of
his guideline range of 135 to 168 months. Because Valentierra-Sanchez’s sentence
was within a correctly-calculated guidelines range, the government contends that
we lack jurisdiction under 18 U.S.C. § 3742 to review the reasonableness of
Valentierra-Sanchez’s sentence. We disagree.
4
First, post-Booker, this Court repeatedly has reviewed sentences within the
guidelines range for unreasonableness. See, e.g., United States v. Talley, ___ F.3d
___, No. 05-11353, 2005 WL 3235409 (11 th Cir. Dec. 2, 2005); United States v.
Scott, 426 F.3d 1324 (11 th Cir. 2005); United States v. Winingear, 422 F.3d 1241
(11 th Cir. 2005). Second, although Booker excised the standards of review in 18
U.S.C. § 3742(e), the Supreme Court explained that “the [Federal Sentencing] Act
continues to provide for appeals from sentencing decisions (irrespective of whether
the trial judge sentences within or outside the Guidelines range in the exercise of
his discretionary power under § 3553(a)),” and cited 18 U.S.C. § 3742(a).2 United
States v. Booker, 543 U.S. 220, ___, 125 S. Ct. 738, 765 (2005) (instructing
appellate courts to review a sentence for “unreasonableness” in light of the factors
set forth in § 3553(a)).
Although the Supreme Court in Booker did not identify which provision of §
2
Specifically, § 3742(a) provides a defendant may appeal his sentence if that sentence:
(1) was imposed in violation of law;
(2) was imposed as a result of an incorrect application of the
sentencing guidelines; or
(3) is greater than the sentence specified in the applicable guideline
range to the extent that the sentence includes a greater fine or term of
imprisonment, probation, or supervised release than the maximum
established in the guideline range, or includes a more limiting
condition of probation or supervised release under section 3563(b)(6)
or (b)(11) than the maximum established in the guideline range; or
(4) was imposed for an offense for which there is no sentencing
guideline and is plainly unreasonable.
18 U.S.C. § 3742(a).
5
3742(a) provided for appeals for “unreasonableness,” we conclude that a post-
Booker appeal based on the “unreasonableness” of a sentence, whether within or
outside the advisory guidelines range, is an appeal asserting that the sentence was
imposed in violation of law pursuant to § 3742(a)(1). See United States v. Frokjer,
415 F.3d 865, 875 & n.3 (8 th Cir. 2005) (holding that Booker did not alter the rule
that a district court’s discretionary decision not to depart downward is
unreviewable, but noting that, after Booker, the court will “review a defendant’s
argument that even a sentence within the advisory guideline range is
‘unreasonable’ with regard to the factors set forth in 18 U.S.C. § 3553(a), and an
unreasonable sentence would be imposed ‘in violation of law’ within the meaning
of § 3742(a)”) (citation omitted). Thus, this Court has jurisdiction under §
3742(a)(1) to review sentences for unreasonableness.
B. Consideration of the § 3553(a) Factors
Valentierra-Sanchez argues that the district court erred by failing to consider
the sentencing factors outlined in § 3553(a) in imposing his sentence. Valentierra-
Sanchez does not argue on appeal that his sentence is unreasonable under Booker.
Instead, he argues only that the district court failed to consider the factors in §
3553(a) on the record and instead blindly sentenced him within the guidelines
range.
6
After the Supreme Court’s decision in Booker, a district court, in
determining a reasonable sentence, is required to take into account the advisory
guidelines range and the sentencing factors set forth in 18 U.S.C. § 3553(a). See
United States v. Booker, 543 U.S. 220, ___, 125 S. Ct. 738, 764-66 (2005). “The
factors in § 3553(a) include: (1) the nature and circumstances of the offense; (2)
the history and characteristics of the defendant; (3) the need for the sentence
imposed to reflect the seriousness of the offense, to promote respect for the law,
and to provide just punishment; (4) the need to protect the public; and (5) the
Guidelines range.” United States v. Scott, 426 F.3d 1324, 1328-29 (11 th Cir. 2005)
(citing 18 U.S.C. § 3553(a)). Although the district court must consider § 3553(a)’s
factors, “nothing in Booker or elsewhere requires the district court to state on the
record that it has explicitly considered each of the § 3553(a) factors or to discuss
each of the § 3553(a) factors.” Id. at 1329. Instead, “acknowledgment by the
district court that it has considered the defendant’s arguments and the factors in
section 3553(a) is sufficient under Booker.” United States v. Talley, ___ F.3d ___,
No. 05-11353, 2005 WL 3235409, at *2 (11 th Cir. Dec. 2, 2005).
Here, Valentierra-Sanchez’s argument that the district court failed to
consider the § 3553(a) factors is without merit. At sentencing, the district court
explicitly found that Valentierra-Sanchez’s final sentence of 135 months’
7
imprisonment was appropriate “under the facts of this case and under all the factors
[it was] supposed to consider.” Additionally, the district court expressly
mentioned the nature and circumstances of the offense and history and
characteristics of Valentierra-Sanchez, including the amount of cocaine involved in
the offense and other crew members’ statements that Valentierra-Sanchez had been
involved in at least three prior drug runs on the same vessel. Considering the
sentencing transcript as a whole, we conclude that Valentierra-Sanchez has shown
no reversible error.
Therefore, we affirm Valentierra-Sanchez’s sentences.
AFFIRMED.
8
|
The present invention relates to liquid drainage systems.
Before the present invention, an assortment of urine meters have been proposed to collect urine which drains through a catheter and drainage tube from a patient. The urine meters normally comprise a receptacle having a chamber to receive liquid from the drainage tube, and a container having a cavity. Provision is made for emptying the liquid from the receptacle chamber into the container cavity for retention therein. During the emptying procedure, a negative pressure is created in the receptacle chamber which impedes passage of liquid from the receptacle to the container. Thus, vents have been placed on the receptacle to permit passage of air from the atmosphere to the chamber in order to alleviate the negative pressure in the receptacle. Such vents have been provided with a filter in order to remove bacteria from the air which passes into the chamber, and thus prevent contamination of the system. However, during use of the device urine from the chamber may contact the receptacle filter, and it has been found that repeated contact by urine against the filter may cause closure of the filter. Thus, the vent on the receptacle may be rendered inoperative in that it no longer permits passage of air through the filter. As a result, a negative pressure is created in the receptacle when attempting to empty the receptacle into the container, thus preventing passage of liquid from the receptacle and also rendering the urine meter inoperative. |
You currently have javascript disabled. Several functions may not work. Please re-enable javascript to access full functionality.
Register a free account to unlock additional features at BleepingComputer.com
Welcome to BleepingComputer, a free community where people like yourself come together to discuss and learn how to use their computers. Using the site is easy and fun. As a guest, you can browse and view the various discussions in the forums, but can not create a new topic or reply to an existing one unless you are logged in. Other benefits of registering an account are subscribing to topics and forums, creating a blog, and having no ads shown anywhere on the site.
Hi Vonnie.. Welcome to BC.. I almost feel guilty for welcoming anybody as I'm new to this foum as well..
Down in the bayou, Bubba called an attorney and asked, "Is it true they're suin' the cigarette companies for causing people to get cancer?"Sure is Bubba. But why you asking?""Cause what I want to know is, I was thinking, can I sue Budweiser for all them ugly women I've slept with?"
Thanks for the welcome, and may I take this opportunity to welcome you tooooooo
Thanx Vonnie... Looks like we found a new home...
Down in the bayou, Bubba called an attorney and asked, "Is it true they're suin' the cigarette companies for causing people to get cancer?"Sure is Bubba. But why you asking?""Cause what I want to know is, I was thinking, can I sue Budweiser for all them ugly women I've slept with?" |
What do you do when you haven’t got stuck into a great movie for a while, and you’re also mentally preparing yourself to get back into blogging and actually expressing opinions and thoughts on said movies? Switch your brain off and get stuck into 2 sub-par comedies of course!
Has 2017 had a great comedy yet? I’m behind so maybe I’ve missed it, or maybe I’m just losing my sense of humour. We’re definitely owed a few laughs though!
Rough Night (2017)
There’s been a huge rise lately of female-centred comedies, which I am all for of course, but not all are hitting the mark. Rough Night features an all female cast (if we forget about the dead stripper) and even a past female relationship which wasn’t thrown in our faces which I definitely appreciate. However, what could have been a modern day Weekend at Bernies fell rather flat.
The main issue I found with Rough Night was the overall tone. It didn’t know what kind of movie it wanted to be. We’ve all seen the trailer, we know the group accidentally kill a stripper that comes to their home, but that scene itself was actually really dark…
Common sense got thrown out of the window and just when I started to get into the silliness of it all again, things got deep real fast and left me confused again. One thing I’ll say though is it wasn’t the disaster I thought it would be, and I actually quite enjoyed all of the main actresses, even if my beloved Kate McKinnon was a bit over the top. Stay with the credits for this one though, if nothing else made you laugh McKinnon’s song will!
The House (2017)
I was dying to see The House ever since I saw a trailer. I had no visions of it being an outstanding comedy, but I loved the cast so much I was just happy knowing that I’d be able to see them all in something new. In The House, Amy Poehler and Will Ferrell are parents struggling to afford their daughter’s tuition after her scholarship is taken away. They team up with their best friend, Jason Mantzoukas and set up their own casino.
So yeah, the funniest moments are all in the trailer. The plot is wafer thin and it’s predictable throughout. But it’s a fairly short movie by today’s standards at just under an hour and a half, and I’ve certainly spent the same amount of time doing worse things! My Parks and Rec senses were in overdrive in the town hall meeting scene with so many familiar faces, especially with Amy Poehler herself there!
I think my favourite running joke was Will Ferrell’s complete inability to count, or deal with math of any kind to be honest. I don’t know if it was as funny as it seemed to me or if it was one of the few jokes that just so happened to land, but it honestly made me laugh out loud each time. I’m easily amused I think!
How is 2017 doing comedy wise though overall? Are there some hidden gems I should hunt down or look forward to? The Big Sick (2017) was fantastic – but I need a laugh out loud comedy right now! |
# SOF-ELK® Configuration File
# (C)2016 Lewes Technology Consulting, LLC
#
# This file contains filters, transforms, and enrichments for xinetd messages
# Note that this file is UNSUPPORTED. By default, it is not enabled in SOF-ELK.
filter {
if [type] == "syslog" {
if [syslog_program] == "xinetd" {
# START: smtp pid=14902 from=::ffff:182.73.192.201
# EXIT: smtp status=0 pid=14902 duration=5(sec)
grok {
match => [ "message", "%{WORD:event}: %{WORD:service} %{GREEDYDATA:message_remainder}" ]
tag_on_failure => [ "gpfail_xi1" ]
}
if [message_remainder] {
kv {
field_split => " "
add_tag => [ "parse_done" ]
}
mutate {
remove_field => [ "message_remainder" ]
}
}
if [from] {
grok {
match => [ "from", "(?:::ffff:)?%{IP:source_ip}" ]
tag_on_failure => [ "gpfail_xi2" ]
}
}
if [duration] {
grok {
match => [ "duration", "^%{INT:durint}" ]
}
if [durint] {
mutate {
replace => { "duration" => "%{durint}" }
}
mutate {
remove_field => [ "durint" ]
}
}
}
}
}
}
|
local sms = {
objectType = {
name = "rpc.mobiled.sms.",
access = "readOnly",
minEntries = 1,
maxEntries = 1,
parameters = {
delete = {
access = "readWrite",
type = "unsignedInt",
},
markread = {
access = "readWrite",
type = "unsignedInt",
},
markunread = {
access = "readWrite",
type = "unsignedInt",
}
}
}
}
local conn = mapper("ubus").connect()
if not conn then
return
end
function sms.get()
return ""
end
function sms.set(mapping, paramName, paramValue)
if #paramValue > 0 then
if paramName == "markread" then
conn:call("mobiled.sms", "set_status", { id = tonumber(paramValue), status = "read" })
return true
elseif paramName == "markunread" then
conn:call("mobiled.sms", "set_status", { id = tonumber(paramValue), status = "unread" })
return true
elseif paramName == "delete" then
conn:call("mobiled.sms", "delete", { id = tonumber(paramValue) })
return true
end
end
return false
end
register(sms)
|
Think Twice Or You’ll Bet Regret It
Date: 2nd April 2020
We know that many of you will be at home, potentially struggling to fill the time, feeling a little isolated or anxious. In these times we’ll often turn to various forms of distraction to help the day pass, but placing risky impulsive bets shouldn’t be one of them.
In these difficult times the safer gambling message is perhaps more important than ever. Please remember to Think Twice or You’ll Bet Regret It.
If you’re feeling overwhelmed or worried about your gambling at the moment the National Gambling Helpline is available 24/7 on 0808 8020 133 for free, confidential advice and support. |
Hash becomes Array for no apparent reason.
=begin
# Using Ruby 1.8.6 (2008-03-03 patchlevel 114) [universal-darwin9.0]
# on Mac OS X 10.5.5
def is_this_a_ruby_bug?
orig_hash = { :a=>[:x], :b=>[:x] }
orig_hash.inject({}) do | flipped_hash, (symbol_a_or_b, array_x) |
array_x.each do |symbol_x|
(flipped_hash[symbol_x] ||= []) << symbol_a_or_b # (~1)
flipped_hash # (~2)
end # (~3)
# flipped_hash # (~4)
end
end
is_this_a_ruby_bug?
# The above method is supposed to return { :x => [:a, :b] } . Instead, it exhibits
# bizarre behavior. On the first iteration of the inner loop, line (~2) somehow causes
# flipped_hash to be recast from Hash {:x=>[:a]} to Array [:x] . This causes (~1) to
# raise a "Symbol as array index (TypeError)" exception on the second iteration of
# array_x.each , because flipped_hash has accedentally become an Array. A workaround
# is to uncomment (~4), which curiously is OUTSIDE the inner loop where the exception
# would've occured. The effect is that the 'end' at (~3) no longer terminates the inner
# loop and (~4) is now executed with each iteration of array_x.each as if it were above
# (~3). Somehow this fixes the problem, and the method returns the expected result.
=end
=begin
Since Enumerable#each ignores the return value of the block, (~2) is a no-op. #each returns the original object (in this case, array_x), and as such you're passing the second iteration of #inject array_x, not flipped_hash. (~4) is the correct position to return a value here.
=end |
RESEARCH NEWS:
Simulations Shed Light on Fate of Sequestered CO2
Researchers suspect that underground, or geologic, carbon sequestration will be key tool in reducing atmospheric CO2. To investigate this idea further, Berkeley Lab’s George Pau took advantage of the massively parallel computing capacity of NERSC to create the first-ever three-dimensional simulations exploring how sequestered CO2 and saline aquifers interact. Unprecedented in detail, these simulations—run in both 2-D and 3-D—will help scientists better predict the success of this kind of sequestration project.
The Institute for Advanced Architectures and Algorithms (IAA) was founded in 2008 to encourage co-design between architectures and applications in order to create synergy in their respective evolutions. In order to explore the larger architectural design space of Exascale systems, the IAA began developing simulator software called Structural Simulation Toolkit (SST). SST lets computer scientists evaluate the impact of architectural choices on application performance and will let computational scientists develop computer codes and algorithms for future supercomputers that are significantly different from today’s systems.
Role of Simulation in Co-design within IAA
The majority of the new DOE Co-Design Centers are incorporating the SST software into their overall plan for exploring the effects of different exascale node designs, memory structures, power requirements, and performance on their particular science algorithms. The modular structure of the SST, shown in the figure, allows Co-Design Centers to adapt the simulator software to their particular node requirements. The ongoing IAA project continues to develop and enhance exascale system simulator software that has the potential to benefit all the Co-Design Center communities.
A study conducted at the Argonne Leadership Computing Facility (ALCF) by INCITE researchers at Cornell University is the first to successfully simulate functionally important motions of special proteins that play a fundamental role in biological processes. The simulations were run using more than 6.2 million core-hours on the IBM Blue Gene/P at the ALCF. The insight gained from these simulations led to the formulation of a mechanism that provides a unifying explanation of known experimental facts.
The dynamics of proteins and mechanisms of protein folding and unfolding play key roles in a number of cell functions and in diseases such as cancer and the formation of amyloids, which contribute to Alzheimer’s, Parksinson’s and other diseases. Although the essential structure of a protein is entirely encoded in its amino-acid sequence, the actual folding process is assisted by special proteins called molecular chaperones. Heat shock proteins (Hsps) are essential molecular chaperones present certain types of cells in all organisms. The study, which used an Hsp70 molecular chaperone from E. coli as a model, focused on opening and closing conformations in the Hsp 70 chaperones, which could lead to a better understanding of protein folding, refolding or repair. Based on the results of the simulations, a plausible mechanism of interdomain communication has been proposed, which agrees with the information from chaperone opening/closing experiments.
An article by researchers at Pacific Northwest National Laboratory was featured as a cover story in the Journal of Computational Chemistry in January. The article, titled “Parallel implementation of γ-point pseudopotential plane-wave DFT with exact exchange,” was written by Eric J. Bylaska, Kiril Tsemekhman, Scott B. Baden, John H. Weare and Hannes Jonsson. The article reports highly parallel algorithms for implementing exact exchange into pseudopotential plane-wave DFT (density functional theory) programs. Experience has shown that many of the failures of standard DFT, such as low activation barriers, small band gaps, and failures to produce localized states, can be corrected by augmenting a fraction of exact exchange into standard DFT exchange correlation functions. This work was supported by the ASCR Multiscale Mathematics program, ASCR Petascale Tools Program and BES Geosciences program of the Office of Science in the Department of Energy.
Donghai Mei and Guang Lin at Pacific Northwest National Laboratory (PNNL) have developed a multiscale model to simulate the heterogeneous reactions in catalytic reactors by combining first-principles kinetic Monte Carlo (KMC) simulation with continuum computational fluid dynamic model. The developed multiscale model is employed to study the effects of heat and mass transfer on the heterogeneous reaction kinetics. The integrated computational framework consists of a surface phase where catalytic surface reactions occur and a gas-phase boundary layer imposed on the catalyst surface where the fluctuating temperature and pressure gradients exist. The surface phase domain is modeled by the site-explicit first-principles KMC simulation. The gas-phase boundary layer domain is described using a computational fluid dynamic model.
Different from other hybrid models, the heat and mass fluxes between two domains are directly coupled by the varying boundary conditions at each simulation time-step from the unsteady state reaction regime to the steady state reaction regime in the present model. The simulation results indicate that the limitation of heat and mass transfer in the surrounding environment over the catalyst could dramatically affect the observed macroscopic reaction kinetics under presumed operating reaction conditions. This work has been published at Catalysis Today.
Many scientific applications are modeled by partial differential equations. One of the most widely used approaches for solving such equations numerically is to decompose the problem domain into a discretized representation referred to as a “mesh.” The Mesh-Oriented datABase (MOAB) is a software component developed at Argonne National Laboratory for representing and evaluating mesh data. The newest release, MOAB 4.0, includes support for parallel mesh reading, writing, and communication. Also included are other important mesh-based capabilities: mesh-to-mesh solution transfer, fast ray tracing, and interfaces to key services such as parallel partitioning, mesh visualization and geometric modeling. The functional interface to MOAB is simple yet powerful, allowing the representation of many types of metadata commonly found on the mesh. MOAB also is optimized for efficiency in space and time.
MOAB has been used, for example, as a bridge to couple results in multiphysics analysis and to link these applications with other mesh services for nuclear reactor simulation (Fig. 1).Fig. 1: Very High Temperature Reactor (VHTR) assembly mesh represented in MOAB.
Moreover, initial results indicate that the data abstraction in MOAB is powerful enough to handle many different kinds of mesh data found in applications involving geometric topology groupings and interprocessor interface representation.
Development of MOAB is supported by the DOE SciDAC Center for Interoperable Technologies for Advanced Petascale Simulations (ITAPS). MOAB is released under an open-source Lesser General Public License. The MOAB software can be used on a wide range of computing platforms, from workstations to clusters and high-end parallel systems such as the IBM Blue Gene/P and Cray computers, and has been demonstrated to scale to at least 16,000 processors.
Researchers from Argonne National Laboratory played a major role in this year’s SIAM Computational Science and Engineering (CS&E) conference, held in Reno, Nevada, Feb. 28–March 4. Modeling and simulation have become indispensable in attacking complex problems in CS&E; and Argonne staff participated both as organizers and as presenters at this key CS&E meeting.
Argonne session (co)organizers and chairs from the Mathematics and Computer Science (MCS) Division included the following:
Mihai Anitescu and Victor Zavala: “Optimization in Electric Power Systems”
In addition, over two dozen computer scientists, applied mathematicians, predocs, and postdocs from Argonne’s MCS Division gave presentations on topics ranging from parallel mesh generation, performance modeling, and optimization to numerical strategies and their applications in chemical plants and electromagnetic modeling.
Although big-rig trucks are essential to the country’s economy, they also extract a certain toll. These long-haul trucks average 6 miles per gallon or less and annually dump some 423 million pounds of CO2 into the environment. To improve the efficiency of these vehicles, BMI Corp. launched its SmartTruck program on a modest high-performance computing (HPC) cluster to tackle the design of new, add-on parts for long-haul 18 wheelers. We initially ran our simulations on an HPC cluster with 96 processors,” recalls BMI founder and CEO Mike Henderson. “We were unable to handle really complex models on the smaller cluster. The solutions lacked accuracy. We could explore possibilities but not run the detailed simulations needed to verify that the designs were meeting our fuel efficiency goals.”
To beef up its computing power, BMI applied for and received a grant through the ORNL Industrial HPC Partnerships Program for time on Jaguar. Its engineers are now creating the most complex truck and trailer model ever simulated using NASA’s Fully Unstructured Navier Stokes (FUN3D) application for computational fluid dynamics analysis. The team models half the tractor and trailer for simulation and analysis purposes, using 107 million grid cells in the process. To study yaw—what happens when the vehicle swerves—they mirror the grid and double it, using 215 million grid cells to accurately model the entire vehicle. BMI’s ultimate goal is to design a sleek, aerodynamic truck with a lower drag coefficient than that of a low-drag car and anticipated fuel efficiencies running as high as 50 percent. For each truck that can be adapted to get an additional 3 mpg, BMI estimates annual fuel savings of 4,500 gallons and $13,500 in costs.
On February 1, the Electronic Simulation Monitoring (eSiMon) Dashboard version 1.0 was released, allowing scientists to monitor and analyze their simulations in real-time. Developed by the Scientific Computing and Imaging Institute at the University of Utah, North Carolina State University, and ORNL, this window into running simulations shows results almost as they occur, displaying data just a minute or two behind the simulations themselves. The dashboard allows the scientists to worry about the science being simulated, rather than learn the intricacies of high-performance computing such as file systems and directories, an increasingly complex area as leadership systems continue to break the petaflop/s barrier.
According to team member Roselyne Tchoua of the OLCF, the package offers three major benefits for computational scientists: first, it allows monitoring of the simulation via the web. It is the only single tool available that provides access and insight into the status of a simulation from any computer on any browser; second, it hides the low-level technical details from the users, allowing the users to ponder variables and analysis instead of computational elements; and finally, it allows collaboration between simulation scientists from different areas and degrees of expertise. In other words, researchers separated geographically can see the same data simultaneously and collaborate on the spot. The “live” version of the dashboard is physically located at ORNL and can be accessed with an OLCF account at https://esimmon.ccs.ornl.gov. This version of the dashboard gives an overview of ORNL and National Energy Research Scientific Computing Center computers. Users can quickly determine which systems are up or down, which are busy and where they would like to launch a job. Users can also view the status of their running and past jobs as well as those of their collaborators.
However, a portable version of eSiMon is also available for any interested party, and the platform cuts across scientific boundaries so that the dashboard can be used for any type of scientific simulation. For information on acquiring and/or using the eSiMon dashboard, visit http://www.olcf.ornl.gov/center-projects/esimmon/.
Researchers at ORNL have demonstrated a simple fabrication approach for making a graphene supercapacitor geometry and device based on a 2D in-plane design and a solid polymer-gel electrolyte that achieves very high capacitive energy storage characteristics. This new, ultrathin design allows for the formation of an efficient electrical double layer (EDL) by allowing for more efficient utilization of the electrochemical surface area (carbons in both the basal and along the edges).
Furthermore, the use of a solid polymer-gel electrolyte (polyvinyl alcohol in phosphoric acid, PVA-H3PO4) serves as both an ionic electrolyte and an electrode separator, thereby making the new design rather unique: These devices are compact, ultrathin, flexible, and optically transparent (see Figure). From a practical standpoint, this new device geometry can be easily extended to other thin-film based supercapacitors, and adapted to various structural and hybrid designs for energy storage devices/applications.
With the recent availability of large amounts of atomically thin and flat layers of conducting materials such as graphene, new designs for thin film energy storage devices with improved perfor-mance have become possible. The work, which takes information obtained at the electron level for graphene and combines it with device engineering, a “electrons to device” approach, demonstrates how an “in-plane” geometry for ultrathin supercapacitors based on electrodes comprised of pristine graphene and multilayer reduced graphene oxide can effectively achieve high levels of energy storage capacity. The demonstrated all solid-state supercapacitors provide a prototype for a broad range of thin-film based energy storage devices. Results from the project were published in Nano Letters.
A theoretical technique developed at Oak Ridge National Laboratory is bringing supercomputer simulations and experimental results closer together by identifying common “fingerprints.” ORNL’s Jeremy Smith collaborated on devising a method – dynamical fingerprints --that reconciles the different signals between experiments and computer simulations to strengthen analyses of molecules in motion. The research will be published in the Proceedings of the National Academy of Sciences.
Experiments tend to produce relatively simple and smooth-looking signals, as they only 'see' a molecule’s motions at low resolution, according to Smith, who directs ORNL's Center for Molecular Biophysics and holds a Governor's Chair at the University of Tennessee. In contrast, data from a supercomputer simulation are complex and difficult to analyze, as the atoms move around in the simulation in a multitude of jumps, wiggles and jiggles. Reconciling these different views of the same phenomenon has been a long-standing problem. The new method solves the problem by calculating peaks within the simulated and experimental data, creating distinct “dynamical fingerprints.” The technique, conceived by Smith's former graduate student Frank Noe, now at the Free University of Berlin, can then link the two datasets.
PEOPLE:
Two Berkeley Lab Researchers Named 2011 Sloan Fellows
Per-Olof Persson and Koushik Sen from Berkeley Lab’s Computational Research Division have been awarded the prestigious Sloan Research Fellowship, given annually by the Alfred P. Sloan Foundation to scientists, mathematicians, and economists who are at an early stage of their research careers. The awardees will each receive a $50,000 grant over the next two years to pursue any line of research they choose.
John Shadid, a Distinguished Member of the Technical Staff at Sandia National Laboratories and a DOE AMR PI, will deliver an invited Semi-Plenary lecture at the March 22-25 16th Finite Elements in Flow Problems (FEF) Conference in Munich, Germany. Shadid’s talk is titled “Towards a Scalable Fully-implicit Fully-coupled Resistive MHD Formulation with Stabilized FE Methods.” Shadid will also deliver an invited lecture at the Mathematics Department of the University Erlangen-Nuremberg on March 17. Shadid will also work with collaborators in the department who are engaged in research on applied mathematics, implicit high-resolution methods on unstructured meshes, and plasma physics simulations.
On February 11, OLCF computational astrophysicist Bronson Messer described the impending death of a giant—a red giant star, that is. Messer spoke on “The Fate of the Martial Star: How Will Betelgeuse Die?” at the University of Tennessee–Knoxville’s science forum. He addressed recent articles speculating that Betelgeuse is set to explode at some point in 2012. “That is possible—just as possible as the star living for another 10 million years,” Messer said.
Messer, currently the OLCF’s acting director of science, gave a crash course in astrophysics to an audience of about 30 students, faculty, and scientifically inclined members of the public and then delved right into the difficulties of simulating an exploding star 20 times as massive as our sun. Messer showed the audience simulations he is running on the OLCF’s Cray XT5 Jaguar. For perspective on the difficulty of these three-dimensional simulations, Messer explained that they depend on complex equations involving general relativity, weak forces, nuclear kinetics, and much more. In a star’s evolution from stable to supernova, the celestial body exhausts its hydrogen, helium, neon, oxygen, and silicon resources and finally begins burning iron. The inner core of the star becomes increasingly dense till the point at which 1 cubic centimeter—about the size of a sugar cube—weighs about the same as humanity collectively.
FACILITIES/INFRASTRUCTURE:
ESnet Upgrades Network Performance Knowledge Base
ESnet’s network performance knowledge base, fasterdata.es.net, has been updated and reorganized. The goal of this site is to help users maximize wide-area network bulk data transfer performance by tuning the TCP settings for end hosts and by using file transfer tools that are designed to maximize network throughput. This site contains over 85 pages of information and advice, and gets over 3000 hits per week from all over the world. It is used by folks in all industries and R&E to improve their network performance and troubleshoot problems.
Oak Ridge National Laboratory’s Colony team reached a milestone this month by booting a new operating system kernel. Through successfully bringing up the advanced kernel on a Cray XT with a Seastar interconnect, the team paves the way for the next phase of performance and scalability testing. Unlike the typical Linux kernel which suffers performance drawbacks, the new kernel is designed to provide a full featured environment with excellent scalability on the world¹s most capable machines. As coordinated stop-lights are able to improve traffic flow, the Colony system software stack is able to co-schedule parallel jobs and thus remove the harmful effects of operating system noise or interference through the use of an innovative kernel scheduler. The kernel utilizes a high precision clock synchronization algorithm developed by the Colony team to provide federated nodes with a sufficient global time source for the required coordination. The Colony Project is led by ORNL computer scientist Terry Jones.
OUTREACH & EDUCATION:
ALCF Staff Mentor Middle-School Girls at 10th Annual IGED
Argonne hosted 76 6th-, 7th- and 8th-grade girls from Illinois, Indiana, and Wisconsin during its 10th Annual Introduce a Girl to Engineering Day (IGED) on February 24. Held in celebration of National Engineering Week, the event focused on introducing girls to engineering careers through hands-on activities and direct interaction with engineers and scientists.
The girls spent the day with Argonne mentors to explore their interests in math, science and engineering. A number of middle-school girls who previously attended IGED also shared their experiences with this year’s participants. The day opened with a career presentation—“Engineering is Fun!” An Engineering Expo featured chemistry and transportation technologies, magnets, geographical information systems, and the conversion of plants into biodiesel fuel, among other exhibits. The girls benefited from hands-on activities and experiments, such as designing a model car and creating materials. Sreeranjani Ramprakash, Technical Support Specialist, and Marta Garcia, Assistant Computational Scientist, at the Argonne Leadership Computing Facility (ALCF) served as mentors during the event.
On February 24, 76 6th-, 7th- and 8th-grade girls spent the day with Argonne mentors to explore their interests in math, science, and engineering during the 10th Annual Introduce a Girl to Engineering Day.
The Richard Tapia Celebration of Diversity in Computing Conference, to be held April 3–5 at the Fairmont Hotel in San Francisco, includes staff from Lawrence Berkeley and Lawrence Livermore national laboratories. Now in its 10th year, the Tapia conference has a tradition of providing a supportive networking environment for under-represented groups across the broad range of computing and information technology, from science to business to the arts to infrastructure.
The 2011 Tapia conference is chaired by David Patterson, a computer science professor at the University of California, Berkeley with a joint appointment in Berkeley Lab’s Computational Research Division. LBNL Computing Sciences Communications Manager Jon Bashor is the Tapia communications chair and Berkeley Lab staff scientist Tony Drummond is the student research poster chair. From LLNL, Tony Baylis is the registration chair. Both labs are also contributing financial support for the conference.
Gloria D’Azevedo, a senior at Oak Ridge High School, won first place in the Tennessee Junior Science & Humanities Symposium for her research on improving elimination orderings for tree decompositions. She was awarded a $2000 college scholarship and an all-expense paid trip to the national JSHS, where she will compete for additional scholarships. Her research was conducted at Oak Ridge National Laboratory with Blair D. Sullivan and Chris Groer as part of the DOE ASCR Applied Mathematics project “Scalable Graph Decompositions & Algorithms to Support the Analysis of Petascale Data,”
D’Azevedo showed computationally that incorporating graph parameters such as the number of second neighbors of a vertex into traditional degree- and fill-based algorithms for choosing an elimination ordering can lead to significantly lower tree-widths. The impact of tree-width on the complexity of tree-decomposition based graph analysis algorithms is exponential, so this new idea for improving orderings could lead to significant speed-up.
The Tennessee JSHS is an annual scientific research competition that gives selected high school students the opportunity to present original research in a public forum. This year’s competition was held Feb. 24-25 at the University of Tennessee-Knoxville. The JSHS is administered through the Academy of Applied Sciences in cooperation with leading research universities throughout the nation to promote and foster research and experimentation in the science, technology, engineering and mathematics (STEM) disciplines at the high school level. The JSHS is jointly sponsored by the research offices of the U.S. Departments of the Army, Navy, and Air Force with the aim of advancing the nation¹s scientific and technological progress by challenging and engaging students in the STEM disciplines.
Eighteen students from Kennedy High School’s TechFutures Academy in Richmond, Calif. paid a visit to NERSC on February 9. In addition to a brief introduction to supercomputers from NERSC’s User Services Group Lead, Katie Antypas, the students also got a lesson about how “Careers in Computer Science Save the World” from Associate Lab Director of Computing Sciences Kathy Yelick. One of the highlights of the visit was a tour of the facility’s computer room. The half-day field trip is part of a burgeoning outreach connection between Berkeley Lab Computing Sciences and the high school.
The OLCF and Argonne Leadership Computing Facility (ALCF) cohosted the first of three webinars on January 24, guiding researchers through the proposal process for earning time on the two facilities’ leadership-class supercomputers. The Innovative and Novel Computational Impact on Theory and Experiment (INCITE) program is offering more than 1.6 billion computational hours in 2012 on the OLCF’s Jaguar and ALCF’s Intrepid systems. The webinars provide researchers with necessary information for writing a competitive proposal and using leadership-class systems, as well as an opportunity to ask questions of the computing facilities’ staffs.
The second webinar was March 21, and the third will be in May on a date to be determined. The INCITE program itself will accept applications from April 13 to June 30. Awards, on average, exceed 20 million hours. For a list of 2011 INCITE awards, see 2011 INCITE Awardees (746KB). Additional information on the INCITE program can be found at www.doeleadershipcomputing.org or by contacting [email protected]. |
Sorry for the wait (I say that a lot don't I?) But it was a busy week, also I figured it was high time I adopted a better approach to uploading downloadable versions than opening numerous soundcloud accounts. (It was a convoluted system but kept me having to pay anything.)
Anyway, here's the...
We're not dead! *Dies*
Apologies, I would explain the lengthy, year-long absence, but I'm afraid I've worn my brain down getting this episode finished at last, so I crave your indulgence if I just fling the episode at you and slink away somewhere to pass out. (Suffice it to say, we had far more...
Hello all, long time no see... again.
Bit short on time so I shall have to fling episode 5 (the real one this time) out there with minimal preamble. Just so you know, this episode is set roughly 10 years before the main story line of the last four episodes...
Hello all, after another lengthy wait (sorry... sorry.) allow me to present Wing Commander Defiant Few: Episode 5. Once again I'm having to sneak this in during a break at work so I can't elaborate as much as I'd like... which considering my rambling nature may in fact be a blessing.
Hope you...
Been a while since I did one of these. First off, I’d just like to thank everyone who voted for Defiant Few for fan project of 2013, your support is greatly appreciated and I’m hoping to make 2014 a far more productive year for the series and to that end, I have in the works a special, stand...
Ok, now I can do this properly.
Downloadable MP3 version: https://soundcloud.com/4th-starveling-audio/wc-defiant-few-episode-4
YouTube version:
Easy access to previous episodes can be found here:
http://4thstarvelingaudio.weebly.com/wing-commander---defiant-few.html
Apologies, again, that...
I'm afraid I only have about two minutes to spare so I can't offer much explanations or apologies for the lateness of this episode (they are however heavily implied.) On the plus side however, may I present Defiant Few, episode 4...
At last, episode 3 is done.
Sorry for the long wait. There've been no end of delays and mishaps with this episode from start to finish. Once again I must extend my compliments to my team who've stuck with the project throughout said delays and mishaps, and continue to offer their hard work and...
Hello all.
I'm pleased to announce that episode 2 is now completed and uploaded.
Downloadable MP3 version (The link should work this time):
https://soundcloud.com/rychyrdpyyl/wing-commander-defiant-few
Hope you all like it. Thanks to everyone who listened to and enjoyed episode 1 and...
That's on the to do list, however there'll be new characters, ships and other things introduced with the next few episodes and I want to get the show a bit more established before setting up an accompanying page for it.
Thanks for listening.
Gah, I thought I'd worked around that. Truth be told, I'm not sure. It works for me when I try (signed out), but there seems to be no rhyme or reason for who it works for and who it doesn't.
Cumbersome though it is, if you type in 'RychyrdPyyl' into google, the first option should take you to...
Finished!
Presenting episode 1 of Defiant Few:
Downloadable MP3 version: https://soundcloud.com/#rychyrdpyyl/wing-commander-defiant-few-the
My thanks, once again, to my team for their commitment and hard work. My thanks as well to cast and audience alike for their patience. There've...
Must remember to check on this thread more often.
Anyway, as Quarto said it's not good to have grammatically correct speech in a script as few people actually talk that way and characters who are written as such tend to sound unrealistic. To that end I give my actors the leeway to modify the...
Just a head's up. Episode 1 is almost finished. There's some last minute tweaks and edits to see to and I'm waiting to get second opinions from the voice actors, but we're still on schedule for the vague, unspecified, 'sometime in April' release date. |
Q:
serilog separate events formatted in json by a comma
i am using serilog in asp net core application and using a json formatter to create a daily log file (rolling interval is set to "Day").
When i look at my file each event is itself valid json but the file in a whole is not which makes looking at it in something like code beautify impractical.
Is there a way to tell the serilog to add a comma between the events so that the file will be valid.
A:
I think you are incorrect when you say that your log file would conform to json if commas separated each line. A valid json document would either start with { and describe an object, or start with [ and describe an array. Either way, you would have to close the document, and only then it would be valid json. Now to the million dollar question: how would you know when to close the document even if you wrote your own text formatter?
I think you should treat each log event as a valid json object, and use a tool and product that supports it.
|
VYSO & TSYO Rising Musical Stars
Everyone is invited to share in this first time ever partnership between the distinguished Vancouver Youth Symphony Orchestra and Toronto Symphony Youth Orchestras!
These most impressive and talented young musicians will join musical forces and proudly present selections from the greats, Shostakovich, Tchaikovsky, Hindemith and Smetana. Don’t miss this grand event and the rare opportunity to hear such an enormous wealth of young Canadian talent on one stage. |
Taking Science to the Street With Dr. Loretta Sweet Jemmott Dr. Loretta Sweet Jemmott, professor of nursing at the University of Pennsylvania, has spent the last 20 years developing interventions to prevent teen pregnancies and the spread of HIV/AIDS among African-American youth.
Her latest project is called "Shape Up -- Barbers Building Better Brothers" and is designed to empower young men, ages 18 to 25, to reduce their risks for contracting STDs and other health problems. The program will begin in 50 barbershops in Philadelphia this spring. Meantime,Author(s): No creator set
Global warming generally increases the risk of some infectious diseases, in particular vector borne diseases. The reason behind this is that temperature and rainfall affect the abundanAuthor(s): No creator set
License information
Related content
No related items provided in this feed
Ryan Blanchette, LGO '98, tells China LGO students and alumni about the power of the LGO network The China Leaders for Global Operations (CLGO) program began in 2007 at Shanghai Jiao Tong University. It is a dual-degree MBA and SM in Engineering program affiliated with the MIT LGO program. The first gathering of CLGO alumni, along with current students, faculty and industry partners, took place in Shanghai on January 20, 2011.
A featured speaker was Ryan Blanchette, LGO '98, who worked from 2009-2011 as the General Manager of the TRW CTCS Braking joint venture in Chongqing, China. Ryan spAuthor(s): No creator set
License information
Related content
No related items provided in this feed
Duke Heart Center: The Importance of Experience Duke Heart Center has the experience in treating heart problems that matters, especially with complex cases.
For more information, visit http://www.dukehealth.org/heartAuthor(s): No creator set
License information
Related content
No related items provided in this feed
Spirit Bear Hibernating in his Winter Den This video shows the Kermode Spirit Bear hibernating in his winter den. This is a very sweet video that students will enjoy watching. It provides an opportunity for students to build background knowledge on bears and hibernation. This is a good teaching resource for a teaching unit on bears, mammals, and/or winter. (1:05)Author(s): No creator set
The Future of Sudanese Civil Society, North and South Part 6 of the 2011 Sudan in Transition? Southern Independence, Conflict and Reconciliation Symposium. This podcast is part 6 of Addressing the Past, Preparing for the Future: War Crimes, Reconciliation and Human Rights section of the symposiumAuthor(s): Joanna Oyediran
License information
Related content
Rights not set
No related items provided in this feed
Uproar in Yemen At least two people are killed and dozens wounded, as Yemeni security forces clash with crowds calling for the President to quit. Deborah Lutterbeck reports.Author(s): No creator set
Torpedo Strikes the Lusitania This professionally-made video contains actors portraying crew and passengers aboard the Lusitania and crew aboard German u-boat which sank Lusitania. ( 4:51)Author(s): No creator set
License information
Related content
No related items provided in this feed
Stateless protest in Kuwait Stateless Arabs in Kuwait come under fire as security forces use flares to disburse crowds, as they demonstrate for citizenship. Deborah Lutterbeck reports.Author(s): No creator set
License information
Related content
No related items provided in this feed
Albert Bierstadt Painter This five minute video provides viewers with images prainted by Albert Bierstadt, a painter best known for his large landscapes of the American West. He was the first artist to record these sites, Bierstadt was the foremost painter of these scenes for the remainder of the 19th century. There isn't any narration in this video, just images of the paintings so the teacher needs to provide insights as to the subject and painter's history.Author(s): No creator set
License information
Related content
No related items provided in this feed
Job Loss and Grieving - Episode 4 of "Confronting Job Loss" Unemployment can shatter the psyche - the sense of fear, futility and worthlessness can be overwhelming. During this traumatic time how can we experience the real presence of God in our lives, his hand directing us, and leading us to true success? It is possible that this oppressive time can actually become a huge opportunity to re-shape our beliefs and to live from a place of authenticity. The work is hard, but the reward is beyond any title or toy we could accumulate.
Monsignor Michael HeintzAuthor(s): No creator set |
dactyl (n.)
metrical foot, late 14c., from Latin dactylus, from Greek daktylos, a unit of measure (a finger-breadth), also "a fruit of the date tree, a date," literally "finger" (also "toe"), a word of unknown origin. The metrical use (a long syllable followed by two short ones) is by analogy with the three joints of a finger. In English versification it refers to an accented syllable followed by two unaccented. The "date" sense also sometimes was used in early Modern English. |
Traffic Accident Reports
Sheriff Jayson Richardson
As your Sheriff, it is my privilege to serve the citizens of DeSoto Parish. I would like to thank you for your trust and confidence. As
promised from the beginning of my very first term, I will continue to have an open door, be a working Sheriff and respect all people
that seek assistance from this office. Our mission, together with the communities of DeSoto Parish, is to make our parish a place where
all people can live, work and visit safely without fear. If you have any questions about your sheriff’s office, please feel free
to contact me or any member of my staff.
Facebook
Our Mission
Our mission, together with the communities of DeSoto Parish, is to make our parish a place where all people can live, work and visit safely without fear. |
Dead Frenchwoman Hit With Tax Demand - In Her Grave
Mayor of Sarzeau said he had received a letter from the public finance offices to a dead resident.
Rennes, France: Combining the old adage about death and taxes, French authorities have sent a demand for property duties to a dead woman -- addressed to her grave in a small town in Brittany.
The mayor of the seaside town of Sarzeau said he had received a letter from the public finance offices to a dead resident, addressed to "grave 24, row E, cemetery road", his secretary told AFP on Saturday.
The town's treasurer Christophe Libre told the Ouest France regional newspaper it was a demand for property taxes.
"Unfortunately it's not the first time we've had this sort of letter from the public finance centre in Vannes," Libre told the paper. Vannes is the nearest large town to Sarzeau.
He said it could have been a "joke from someone doing the change of address," or "one of the heirs who didn't want to pay the property tax". |
2008-12-09: Dejal introduces SmileDial for iPhone
Tue, 2008-12-09 11:56 — David Sinclair
Summary:
Introducing SmileDial Lite and SmileDial Pro for the iPhone. Call someone by touching their smile, or send them a text message by touching their eyes! SmileDial Lite is for one person, SmileDial Pro enables you to swipe through multiple people and shake for more info.
Portland, Oregon - Dejal Systems, LLC today introduced SmileDial Lite and SmileDial Pro version 1.0 for the iPhone. Call someone by touching their smile, or send them a text message by touching their eyes! Not as creepy as that sounds, really! SmileDial displays a photo of someone's face: tap the top half of the photo to send them a text message, or the bottom half to call them.
SmileDial Lite helps you call and text your favorite person. SmileDial Pro extends this to multiple people: swipe through multiple faces to choose the one you want. SmileDial Pro also enables you to call them via other phone numbers, send an email, visit their website, map their address, and more, in a fun way: shake the iPhone to show more contact information.
A tap of the info button flips the photo over to reveal fields to edit the name and numbers for text messaging and phone calls, plus buttons to show the contact info and change the photo.
You can simply enter a name and numbers and choose a photo. Or you can pick an existing contact.
A contact's photo is used for SmileDial, if available. It is previewed in the background of the edit mode. You can also choose another photo: an existing one from the Camera Roll or Photo Library, or take a new photo with the iPhone camera. The photo can be moved and scaled as desired, e.g. to show just the person's face. The new photo is stored in the Camera Roll, so you can import it into iPhoto or use it elsewhere if desired.
SmileDial Pro includes a People button while editing. Tap it to display a list of people in the order they appear on SmileDial's main side. You can change the order, delete them, or add any number of new ones.
Dejal is a long-established independent Mac software company, now expanding into iPhone software.
Minimum Requirements:
* iPhone version 2.2 or later
Pricing and Availability:
* SmileDial Lite is available completely free of charge.
* SmileDial Pro is available for $3.99.
Both are immediately available on the iPhone App Store.
For-review coupons for SmileDial Pro are available to the media; contact Dejal to receive one.
Founded by David Sinclair in 1991, Dejal Systems, LLC was originally established in New Zealand, and later moved to Portland, Oregon in 2001. With a focus on the Mac and iPhone platforms, Dejal specializes in user-friendly and flexible Cocoa-based utility software. Copyright 2008 Dejal Systems, LLC. All Rights Reserved. Dejal, the Dejal logo, and SmileDial are trademarks of Dejal Systems, LLC. Apple, the Apple logo, are registered trademarks of Apple Computer in the U.S. and/or other countries. |
Posts tagged “the Yves Saint Lauren Gallery”
As Donald Rumsfeld might have said, in even the best and most conscientiously administered museums and galleries, “incidents happen”. When the incident is an assault on a work of art, museums have traditionally sought to play down the event for (legitimate) fear of triggering copycat attacks. In an age where every other museum visitor owns a mobile phone with a camera, that is no longer an option. The Observer’s apparently exclusive report on the spray-paint attack on two Poussin paintings at the National Gallery on Saturday generated instant and world-wide coverage (see Fig. 1). Some British art commentators unhelpfully responded by spelling out how vulnerable paintings are at such locations in the National Gallery. One over-heated newspaper art critic blogger effectively commended the location in the gallery to would-be vandals wishing for a quick unobtrusive exit. A blogger from a west end gallery then echoed and highlighted this vulnerability with a diagram showing the gallery layout and the warding point. The art historian and Poussin specialist, David Packwood, responded more judiciously on his blog Art History Today and pointed out that:
“Sadly, this isn’t the first time this painting [“The Adoration of the Golden Calf”] has been the target of vandals. In 1978, a lunatic slashed the canvas with a knife, and this serious damage resulted in restoration. I’m just wondering if this nutter knew of the earlier attack and wanted to replicate it, albeit with a different weapon.”
In a May 1998 visit to the National Gallery we discovered that many paintings had been removed from a wall that bore large water stains in the then new French rooms (see Fig. 4). A phone call to a newspaper established that no word had arrived of the incident (an overnight downpour that had overwhelmed the gutters). Although one blogger reproduced a statement issued by the gallery on last week’s Poussin attack, last September an (accidental) injury to another important religious painting went, so far as we know, un-reported.
The National Gallery is presently reducing warding coverage because of funding cuts and is doing so in an age of growing visitor numbers and declining standards of public behaviour. We understand that the room in which the Poussin attack occurred was unusually busy because of heavy rain last Saturday and that the warder responsible for it was also responsible for the adjacent gallery. It should be said that although there is opposition within the National Gallery to the policy of doubling up the number of rooms warders must supervise, this problem seems to extend beyond the gallery. We learn that the day before the Poussin attack, an artist visitor to the Tate who complained to a warder about people standing in front of paintings while having their photographs taken, was told that this is now allowed because staff cut-backs make it impossible to enforce the gallery’s own rules.
What makes the recent attack a matter of especially acute sensitivity for the National Gallery is the fact that in November an unprecedentedly large group of borrowed Leonardo paintings are due to arrive for a temporary exhibition. As described before, the loan of one of these paintings, the already air-miles rich “The Lady with an Ermine” (see Fig. 2), has been and is being vehemently opposed by leading scholars and conservators in Poland and we have responded to their appeal to help draw international attention to their opposition (see Fig. 3).
We have also recently reported that in the European Union, a great increase in such loans is being sought by restricting insurance cover to the time that paintings are in transit, on the contention that once pictures arrive at their loan destinations, they are as safe as they would be if left undisturbed at home. But, that ignores the risks run during hectic exhibition installations and the even more hectic “de-installations”. Again, as we have reported, it is only three years since the National Gallery’s own Beccafumi panel “Marcia” was dropped and smashed when being removed from a temporary exhibition at the gallery (see Fig. 6). Insurance cover was not involved but the consequence of the accident was that after repair and retouching, the picture and its undamaged sister panel (“Tanaquil”) were not returned to the main galleries but were instead consigned to the gloom of the gallery’s reserve collection which can be accessed by the public for only a few hours each week.
That accident was disclosed on the gallery’s website and, after we covered it in our journal, a copy of a report on the incident and photographs of the smashed painting were made available to us. There was no cover-up, but the damage done is forever. Any movement of a fragile Renaissance panel constitutes a risk. Unnecessary movements constitute unnecessary risks. Unnecessary movements that are made in defiance of the best and most responsible expert curatorial and conservation advice (as with Leonardo’s “Lady with an Ermine”) constitute reckless and irresponsible risk-taking. To send that painting to London and then to Berlin and then to Madrid would be to triplicate irresponsibility with a jewel of a proud nation’s patrimony.
Notwithstanding the European Union’s madcap money-crazed ambitions to shuttle an ever-increasing stream of artworks around the continent, the continuing risks are fully recognised by the people who insure the works. The already high insurance cost of loans threatens to become higher – and for a chilling actuarial reason. In the context of two Turner paintings that were stolen in 1994 for a princely multi-million pounds ransom by a gang of what the former Paymaster General, Geoffrey Robinson, described as “particularly nasty Serbs” when loaned by the Tate Gallery to a museum in Germany, the art insurance underwriter, Robert Hiscox, recently admitted to the director of the National Portrait Gallery, Sandy Nairne, that:
“In insurance underwriting you have to balance your books and there is no way we are getting in enough overall premium income to cover what will one day be an enormous loss when an aeroplane full of valuable art crashes, let alone if it lands on MOMA.” (See Fig. 7.)
ArtWatch has appealed in the past to the authorities not take unnecessary risks with irreplaceable and fragile historic works of art – whatever the profits and temporary benefits. We have yet to be heeded but not many years ago museum conservators’ advice against loaning fragile pictures was acted upon:
“Our primary responsibility is to act as the guardians of the paintings we buy or are entrusted with by gift or loan. Masterpieces should not be put at unnecessary risk in the temporary interest of policy (as when the French Government sent the “Mona Lisa” to America and Tokyo, or the Vatican dispatched the Michelangelo “Pietá” to New York), profit, patriotism, scholarship or pleasure… stimulated by increased knowledge of the dangers involved in movement and changes of light and humidity, our attention has been focussed more sharply than ever in the last decades on the vulnerability of works of art.”
That eloquent testimony was published in 1975 in the annual report of…the National Gallery. The example of Leonardo’s “Mona Lisa” (- see Fig. 8 ) proved prescient: it was disclosed only recently and half a century after the event that the painting had been drenched overnight in an undetected incident when a faulty sprinkler system went off within the otherwise absolutely secure vault of the Metropolitan Museum of Art in New York. Incidents really do still happen.
Above, Fig. 1: a photograph by Steven Dear, published in the Observer of July 17, announcing attacks on two Poussin paintings at the National Gallery, including (above) his “Adoration of the Golden calf”.
Above, Fig. 2: Leonardo da Vinci’s “Lady with an Ermine”, which has recently been dispatched abroad from Poland many times in exchange for fees.
Above, Fig. 3: the Appeal to ArtWatch UK from the President of the Krakow Division of the Association of Art Historians.
Above, Fig. 4: The Yves Saint Laurent Room at the National Gallery, London. The room, built with a £1m gift from the YSL fashion house, is available for hire and is described as “an elegant gallery housing a selection of French 17th-century paintings. The opulent colouring of fabric on the walls contributes to the atmospheric setting for a stylish dinner party or canapé reception.” The white marks on the left wall are an approximate indication of the extent of water penetration that occurred during an overnight downpour, shortly after the new gallery that doubles as reception/banqueting room had been completed.
Above, Fig. 5: the only press coverage that accompanied the flooding of the Yves Saint Lauren room at the National Gallery in 1998.
Above, Fig. 6: the National Gallery’s panel painting “Marcia”, by Beccafumi, which was dropped and smashed when being dismantled from a temporary exhibition at the gallery on 21 January 2008.
Above, Fig. 7: a Chinese Airlines Boeing 737-800 which was destroyed by fire shortly after landing in Okinawa on 20 August 2007.
Above, Fig. 8: crowds queuing to see the “Mona Lisa” at the Washington National Gallery in 1963 – from the 1969 memoir “Self-Portrait with Donors” by the Gallery’s former director, John Walker. |
PROCESSING
None...
TENDERED
27821 Cinergy 2/1-2/28/02 5,000/d Cen Pool to Topock Negotiating 2/1
OBA Lone Star New OBA Agreement Ward RP, Ward DP & LS Pecos Tendered 3/7
GS Energas New Gas Sales Agreement Tendered 3/11
100001 Tenaska 4/1/02-5/31/02 5,000/d W Tex to WS Ward EXECUTED
27600 Bass Enter Extend to 5/31/03 2,500/d Crawford to Valero Tendered 3/14
27579 Duke Energy Eff 3/15 20,000/d Swap RP Vols EXECUTED
27848 Sempra Energy Eff 3/17-3/18 15,000/d Swap DP Vols Tendered 3/15
26816 Sempra Energy Eff 3/17-3/18 21,500/d Swap DP Vols Tendered 3/15 |
Blog Traffic
September 6, 2009
Seeking deep throughts in reaction to "The Recession Behind Bars"
Today's New York Times includes this fascinating op-ed, headlined "The Recession Behind Bars," which is authored Kenneth Hartman, who is nearing the end of his third decade in prison following a 1980 conviction for murder that led to an LWOP sentence in California. Here are excerpts from this must-read piece:
The past 25 years were generally prosperous for California; the economy boomed and fortunes were made in the sunny San Fernando Valley. But during this time, the lives of prisoners became much drearier. We were forced into demeaning uniforms, with neon orange letters spelling out “prisoner,” and lost most of the positive programs like conjugal visits and college education that we had had since the ’70s. Money was flowing outside the prison walls, but new “get tough” policies against criminals were causing our population, and our costs, to soar.
It is a quirk of California politics that it is among the bluest of states but has some of the reddest of laws. No politician here ever lost an election for being too tough on crime or prisoners. Consequently, all through the ’80s and ’90s billions of dollars were poured into a historic prison-building boom. Private airplane pilots tell me it’s easy to navigate at night from San Diego to Los Angeles and on up the Central Valley to Sacramento by simply following the prisons’ glowing lights. Good times in the free world meant, in here, ever-longer sentences, meaner regulations and ever-decreasing interest in rehabilitation. “Costs be damned; lock ’em up and be done with it” became the unofficial motto of the Department of Corrections.
The last time I received a visit from my family, in early July, the air-conditioning in the visiting room had been broken for more than a month. This matters because my prison is in the high desert north of Los Angeles.... The next day I asked one of the administrators what could be done to get the air-conditioning fixed, and he told me an amazing story. The free-world contractor who services the prison’s air-conditioning systems had refused to come out to replace the part that was broken, because the state owed the company tens of thousands of dollars in back fees and could pay only in i.o.u.’s. There would be no cool air until the state’s budget negotiations were concluded.
Now that the economy is suffering, there is talk of reforming the prisons, of reviving the discredited concept of rehabilitation, of letting some prisoners out early. Some people have even mentioned doing away with the death penalty because of the exorbitant cost to the state of guaranteed appeals. For those of us who have endured a generation of policies intended explicitly to inflict pain, this has a surreal quality to it. After all, it was only a year ago that the state authorities were planning the next phase of prison expansion. Obviously, all the passionate arguments that have been made about the moral wrongs of mass incarceration, of disproportionately affected communities, of abysmal treatment and civil rights violations were just so much hot air. Only when society ran out of ready cash did prison reform become worthy of serious consideration. What this says about the free world is unclear to me, but it doesn’t feel like a good thing.
The talk in here contains an element of schadenfreude. When the TV shows legislators complaining about how deep in the hole the state budget is, laughter fills the day room. Our captor turns out to be simply inept....
From my cell I can also observe the inner roadway on which prison vehicles pass. A fleet of new, shining-white super-security transportation vans still drives by daily. Leviathan hasn’t quite adjusted to the Golden State’s diminished firmament.
This snippet and the rest of the op-ed is perhaps more about modern sociology than modern economics or criminology. But, whatever label readers might attach to the piece, I hope deep thoughts will follow in the comments as we reflect on work, the economy and American society this Labor Day weekend.
Comments
Mr. Hartman has done well. He has an excellent academic resume with multiple publication in left wing propaganda organs. He won a $10,000 essay prize. He is married, and is the proud father of a daughter, despite having committed his murder at age 19.
Meanwhile, his victim is still dead, and the victim's career is still faltering. Any prisoner picking up on academic skills becomes the darling of the America Hater left wing. This is a prisoner running his con and the left is enabling him. One could argue, given his prior habits, he may relapse in his addiction, and suffer far worse than he does now. He under appreciates the value of prison to him, and not just to the hundreds of victims spared his criminality.
Although Hartman killed at 19, he is a killer. Unlike some nations that value life cheaper than we do and release murderers after only fifteen years or so; we Americans still place a life for a life. Hartman was sentenced to life without parole so any programs to educate him beyond the needs of prison, or any program such as conjugal visits (also known as family reunion programs) to keep inmates tied to outside family members is a total waste of money and value to society. If we care for those incarcerated, let us plan for those that are jail populations or prisoners who will ultimately be released. Hartman, if you get a chance to read this, stop your crying and ranting. Only a fool or fellow psychopath would feel concern for your thoughts. You will be housed and fed, given television to watch, air to breathe; which is a hell of a lot better than the poor victim who is six feet under ground. Hartman, accept the verdict and understand that where there is life there is hope, but hope for you is not freedom, nor creature comforts. Just hope that you do your time and don't harm any of your fellow inmates.
Posted by: MARcel | Sep 6, 2009 4:39:45 PM
The deep thought. Mr. Hartman's achievements rebut his argument. Prison has been great for him. It saved his life, and made him a great writer. There is a 50% chance he would have died before age 30, in his criminal lifestyle on the outside. He is in total denial about its value to him. It gave him everything he has, including his life, not to mention a license to kill with absolute immunity, not even James Bond has.
As to A/C. Almost no one around the world has it, not even rich Europeans or Japanese. Worse. No A/C and no deodorant. Man o man, phew, try a crowded train in the summer in Europe.
Went to take a leak in an expensive Paris restaurant. The head was a hole in the ground. Glad I did not have to do more, with my weak legs. Imagine falling in, and having to have to be extricated. Oh come on, at $200 a meal, they could buy a $50 toilet. No.
Also, no A/C. Nowhere in France except the movies. No one heard of a $10 screen door or window. You leave open the window to get a little breeze, you get eaten alive.
In many prison systems outside the US, food is not included. If the family does not bring any, the prisoner does not eat.
The California Senate has completed final legislative approval of SB 1521 by Senator Glorai Romero, who is the Senate Majority Leader, on a bipartisan vote of 27 to 8. This is an important prison reform bill that allows reporters access to prisoners held by the California Department of Corrections and Rehabilitation (CDCR) , the largest prison system in the country. It previously passed the Assembly by a vote of 71 to 1.
(It was vetoed.)
So what of all the MSNBC documentaries of Lockup at California and other prisons? Corrections has complete editorial control. It's a government infomercial.
Posted by: George | Sep 6, 2009 5:57:24 PM
I wonder why Mr. Harrison was talking to a prison administrator?
Maybe George is on to something but if so that would mean the editors of the NYT are suckers. That is not impossible they have been suckered before.
Posted by: John Neff | Sep 6, 2009 9:30:02 PM
John Neff, suckered how? The administrator obviously didn't know, and had no reason to suspect, Hartman's lawyer would smuggle a letter out and even less reason to suspect the NY Times would publish it. *
California issued IOUs for some time and contractors were not all that happy.
* I have to real reason to believe any lawyer really smuggled anything or any reason to believe it would be against the law if a rent seeking lawyer did so. That line is only in there for propaganda drama. Fire with fire and all that.
Posted by: George | Sep 6, 2009 11:22:36 PM
John Neff, why suckered? Could the administrator have reason to suspect Hartman's lawyer would smuggle out a letter that would get published in the NY Times? *
California issued IOUs for some time and contractors were not happy.
* A lawyer probably did not smuggle out the letter and it probably would not be against the law anyway. That is in there for propaganda drama. Fire with fire.
Posted by: George | Sep 6, 2009 11:28:50 PM
Hartman's was a very good opinion piece, and I liked that rounding out with the unnecessary, fancy new prison cars coasting along the prison road.
An even more accurate portrayal of animal life in prison is that set out in the Todd Willingham piece in the New Yorker: http://www.newyorker.com/reporting/2009/09/07/090907fa_fact_grann.
Sheesh, what this country has become. It's positively frightening.
Posted by: FluffyRoss | Sep 7, 2009 7:59:17 AM
I don't think any of today's posters have a loved one imprisoned. So, these remarks reveal that fact. The A/C he was referring to, he said "the a/c in the visitor's room was broken." The inmates dont expect a/c, but, when they are lucky enough to get a visit once or twice a year from their beloved family, it means a lot to them to minimize the awful ordeal of a prison visit with the thousands of "impossible rules" and the intimidation of their loved ones. So, this is one thing they still care about. They have been taught to not care about them selves. They have been conditioned to believe they are worse than worthless. And, don't forget, a significant percentage of these are innocent men. It could be you. And, SC, I hate the ridiculous examples you use. On the other side is my son who was falsely accused by his 15 year old step daughter of indecent liberties. He got 24 years. The step daughter's mother was getting a divorce, and she told the daughter to accuse. The mother called me three times, during pre trial, demanding several thousand dollars to prevent her from having her daughter increase the charges. I didn't have any way to get her the money, so the charges were increased each time. Now, my son is dying in prison. He is not allowed to see his son, so the son is suffering to death also. I am suffering. And the so called "victim"??? Well, her mom got the house, the cars, all the expensive items my son had given her over their ten year marriage. She moved in her new boy friend as soon as my son was convicted. She married the b/f. They have a new baby. They sleep right there in my son's bed. (a family heirloom, my mother gave to my son.) They have parties. The step daughter goes to proms, graduated from H S, is going to college, and is having a happy life.
Both sides are the extreme, but your example is so dumb, yes dumb, SC. You can do better than that.
Posted by: DLJ | Sep 7, 2009 12:18:05 PM
Each person in prison is an individual, as different as you or I. They have their own reasons for everything they have done. In many cases, drug addiction has altered their emotions and thinking to the point where they have committed violent and horrible crimes. In other cases, unlivable conditions in their families pushed them to the brink. In other cases, kids, 19 or earlier, who do not have fully formed prefrontal lobes and who cannot make long-term decisions or control their impulses like adults can (the prefrontal lobes don't develop fully until about one's mid -twenties) and they can be led into situations where they make decisions that will alter the course of their entire lives. The concept of "an eye for an eye" is an antiquated prescription for dealing with wrongdoing. It does not take into consideration everything we know about how the brain works, the effects of poverty, abuse and depravation on the individual, and it does not address mental illness and vast degree of social ills related to criminal behavior. Certainly, there are full-blown psychopaths that should be kept in prison for life. They are rare and a special category in terms of whether or not they can be rehabilitated. But the legal system does not take science into account, nor do they see things in any other way other than black or white. Yes, the victim is still dead, and that is a tragedy, but the final step in any healing process is understanding how you erred, or how you were wronged, and using that knowledge to make necessary changes and to give back to and help others based on the special knowledge you have gained. Any correctional system that does not allow for this step is condemned to keep offenders from fully developing and truly knowing why they cannot continue behaving in the way they have. The unintended effect of this is that society becomes hard and competing religious ideals of compassion and redemption move toward extinction. It has also ruined certain communities and put into place generational trends that will be hard to break. Beliefs such as this lead to fascism and the formation of police states. It has also lead to bankruptcy in several states due to over-bloated prison systems. Rehabilitation and reform do work. Other states have instituted rehabilitation programs and undertaken sentencing reform and are finding success. Real public safety will come from putting people back on the street who are prepared educationally and vocationally, and who have done the really hard work of changing themselves and their lives. But if we do not give them the tools and the opportunity, then the shame is on us, not on them. We cannot continue to run our prison systems based on fear and ancient religious prescriptions. We need to look at the research evidence and base our policies on what has been shown to be effective.
Elaina Jannell, Ph.D.
AFSCME Local 2620
Posted by: Elaina | Sep 7, 2009 12:59:37 PM
DLJ: Here is better, since you may not be familiar with my loving criticism of the lawyer profession. They know I am here to help, and most love me and are grateful for my help. Only a few disgruntled left wing malcontents make personal remarks out of frustration in the traverse.
Thank a vile feminist victimization whore lawyer and their vile male collaborators. The hunt is on for the productive male. There are millions of men who have been victimized by the lawyer profession. They should get together and do something to help our nation end this onslaught against family, innocent people, and the very nation itself. I am sorry to hear about your son. In a divorce situation, all allegations should be presumed to be false, a form of hate speech falsely elicited by the lying, hate filled, anti-family feminist lawyer.
I support hiring a lawyer to terrorize the weak defense lawyer into counter attacking. Most sex crime convictions require a confession in the absence of objective evidence. I support destroying the legal career of the family killing feminist lawyer, male or female prosecutor. I support sending the daughter to jail for lying to the police. These lying girls are, of course, coached by their mothers, by biased, unprofessional feminist male hating female police, and by a female psychologist, who put words in her mouth. All family destroying feminist perjury suborning lawyers go to jail. I would like to see the judge arrested, given a fair trial for an hour, and executed by a hooded police officer in the basement of the courthouse, right after the guilty verdict for insurrection against the constitution. All his bogus supernatural utterances come from a Church, and betray the oath he took. If any professional, such as a psychologist, was involved in the false testimony, consider suing them for malpractice. Confessions are a hurdle, but not insurmountable. To deter. The defense attorney should have done total discovery, including e-discovery, on all adverse parties, including the judge. See if the defense was adequate. Any lawsuit against a lawyer helps our nation.
If the innocence rate in the death penalty, after $million has been spent to avoid a mistake, is around 20% (really unknown, since the 3000 prisoners on death row have not been tested), the rate in lesser charges may be 50%. The lawyer is in utter failure in the criminal law, save for generating massive lawyer employment, the rent. In a divorce situation, innocence may be as high as 90%.
The lawyer is a criminal lover because the criminal is a pretext to make money off useless procedures from the Medieval Church. The insurrection of the vile criminal lover lawyer knows no limit.
If anyone is interested in forming direct action groups of victims of lawyer treason, there are good intellectual, moral and even patriotic justifications for such. Bring the suffering home they falsely inflict on our lawyer besieged nation to this criminal syndicate that controls the three branches of government.
Dr. Janell: Is your union a public employee union? Naturally, the majority of prisoners will require massive amounts of treatment by members of your union. If it is public worker union, yours is the face of rent seeking evil. I will not bother rebutting you. You are lying or being silly. For example, morality is pretty much set in at age three, after hearing the word, no, at age two. As to frontal lobes, crime peaks in the twenties, not in the teens. Those who were criminals at age three are still criminals at age 23. And large amounts of wealth have no effect on their criminality. See Mike Tyson. It is highly offensive to poor people to falsely call poverty a factor in crime. The rate of criminality among the poor is the same as among the rich. This is a Commie lie to redistribute wealth from hard working taxpayers to government workers.
Nothing you say has the slightest validity because of your job. It is self-serving, rent seeking PC garbage. You are not as low as the rent seeking lawyer, but you live on the same floor of moral reprehensibility.
"the face of rent seeking evil"...is "seeking" a verb, so that the "face of rent" seeks evil? or is that a whole hyphenated, pilled-up lunatic rant on rent, as in "face-of-rent-seeking-evil? I couldn't translate. Where can I find an illustration of this face of rent?
"Commie lie"--is this contained in a 1950s manifesto? or is this likewise in the library of some nutcase with an overflowing medicine cabinet?
Posted by: FluffyRoss | Sep 7, 2009 5:22:23 PM
Fluffy - if that IS your real name - this brings up the question of why the rent-seeking, cult criminal enterprising AmeriKKKan lawyer hates America.
Productive males, the target for years of this cream skimming virus, know the real truth. Behind your "rules" of grammar and 1214 Medieval "reason", the truth lurks.
123D. We have more than enough criminals to throw a few away, letting the ACLU liberal traitors focus on truly high-level representation for the chosen few felons.
Posted by: Redundancy Claus | Sep 7, 2009 7:29:40 PM
Let me make this clear, becaue you dumbasses (a lawyer term of art) can clearly benefit from the learning of the Redundancy. Anything any of you say doesn't matter because you have been indoctrinated, forgetting even your 10th Grade world history. Only I - I, with my cutting edge legal education with which I do not make a living - can show you the truth. When I'm not working at Arby's.
Posted by: Redundancy Claus | Sep 7, 2009 7:32:32 PM
If anyone else posted three straight comments, it would be self indulgent. When I do it, it is because only I, through sheer persistence, can show you what I need to know. 123D. What does it take to get through to you? Aside from trying to learn what you're actually talking about, that is, which I do not have to do because of rent seeking.
SEE: Wikipedia, et al.
Posted by: Redundancy Claus | Sep 7, 2009 7:34:23 PM
Fluffy: If Dr. Janell would post her picture, you could gaze on the synecdoche of rent seeking. Rent seeking is a form of armed robbery. If you refuse to pay your taxes for transfer to worthless people like her, armed people will help you pay. It should be considered a malum in se.
Insurrection against the constitution is the charge leading to the arrest of the lawyer hierarchy, their one hour fair trials, where the sole evidence will their decisions, and no lawyer gotcha in any collateral corruption. Then the sentence for this crime should be carried out in the basement of the court, by a hooded police officer.
Rent seeking is the charge leading that may lead to the arrest of every lawyer, including transactional lawyers, who have ever written a legal utterance above the sixth grade reading level. To be fair to them, lawyer gibberish should be criminalized formally. |
/**
* @file
* @brief Low quality battlescape fragment shader.
*/
#if r_postprocess
/*
* Indicates that gl_FragData is written to, not gl_FragColor.
* #extension needs to be placed before all non preprocessor code.
*/
#extension GL_ARB_draw_buffers : enable
#endif
uniform int BUMPMAP;
uniform float BUMP;
/** Diffuse texture.*/
uniform sampler2D SAMPLER_DIFFUSE;
/** Lightmap.*/
uniform sampler2D SAMPLER_LIGHTMAP;
/** Deluxemap.*/
uniform sampler2D SAMPLER_DELUXEMAP;
/** Normalmap.*/
uniform sampler2D SAMPLER_NORMALMAP;
#define R_DYNAMIC_LIGHTS #replace r_dynamic_lights
#if r_dynamic_lights
in_qualifier vec3 lightDirs[R_DYNAMIC_LIGHTS];
uniform vec4 LIGHTPARAMS[R_DYNAMIC_LIGHTS];
#endif
#include "light_fs.glsl"
#include "fog_fs.glsl"
#include "world_devtools_fs.glsl"
#include "write_fragment_fs.glsl"
in_qualifier vec4 blendColor;
/**
* @brief main
*/
void main(void) {
vec4 finalColor = vec4(0.0);
vec3 light = vec3(0.0);
vec3 deluxemap;
/* normalmap should be declared in this scope for developer tools to work */
vec4 normalmap = vec4(0.0, 0.0, 1.0, 0.5);
/* lightmap contains pre-computed incoming light color */
light = texture2D(SAMPLER_LIGHTMAP, gl_TexCoord[1].st).rgb;
/* deluxemap contains pre-computed incoming light vectors in object tangent space */
deluxemap = texture2D(SAMPLER_DELUXEMAP, gl_TexCoord[1].st).rgb;
deluxemap = normalize(deluxemap * 2.0 - 1.0);
#if r_bumpmap
if (BUMPMAP > 0) {
/* Sample normalmap.*/
normalmap = texture2D(SAMPLER_NORMALMAP, gl_TexCoord[0].st);
normalmap.rgb = normalize(normalmap.rgb * 2.0 - 1.0);
}
#endif
/* Modulate incoming light by cos(angle_of_incidence); should be done even bump mapping is disabled, to avoid having flat shading as a result.*/
light *= clamp(dot(deluxemap, vec3(normalmap.x * BUMP, normalmap.y * BUMP, normalmap.z)), 0.0, 1.0);
/* Sample the diffuse texture, honoring the parallax offset.*/
vec4 diffuse = texture2D(SAMPLER_DIFFUSE, gl_TexCoord[0].st);
/* Add dynamic lights, if any */
light = clamp(light + LightFragment(normalmap.rgb), 0.0, 2.0);
finalColor.rgb = diffuse.rgb * light;
finalColor.a = diffuse.a;
finalColor *= blendColor;
#if r_fog
/* Add fog.*/
finalColor = FogFragment(finalColor);
#endif
/* Developer tools, if enabled */
finalColor = ApplyDeveloperTools(finalColor, normalmap.rgb, light, deluxemap);
writeFragment(finalColor);
}
|
Download Full Episodes of Luke Cage TV Show in HD. Seasons 1, 2.
Download and watch all seasons and episodes of Luke Cage TV series. Choose the optimal quality. All the latest episodes of Luke Cage TV show are available on our site for free and without signing up. Forget about torrents and annoying ads! Just download your favorite episodes and enjoy watching them with tvseries.cc |
A marijuana expo is coming to Akron.
The Ohio Marijuana Expo: Akron, organized by the Ohio Marijuana Card, will take place from 11 a.m. to 5 p.m. March 23 at the John S. Knight Center, 77 E. Mill St. The event will feature doctors, cultivators and dispensaries, along with vendors representing alternative medicines and other healing products.
"Ohio Marijuana Expo is a celebration of medical marijuana finally coming to Ohio," Ohio Marijuana Card President Connor Shore said in a prepared statement. "Our goal is to bring a face to the cannabis industry as well as the cannabis movement, from advocates to health professionals. That is why we have amassed a great collection of speakers, vendors and amazing sponsors, so there's a little something for everyone."
A similar event was held in Cleveland in January and attracted about 1,500 people.
The Akron expo will include an appearance from artist Shawn Coss, author of "It's All in Your Head," who will answer questions about his work and mental health.
“Our last event had a sold out crowd,” events director Amanda Ferdig said in a prepared statement. “So we wanted this one to be bigger and better.”
Tickets are $15. For more details or to buy tickets, go to: https://www.ohiomarijuanacard.com/blog/ohio-marijuana-expo-akron. |
The parish of St.Barnabas was created out of that of St.Paul by Order in Council 25 Nov. 1843. The parish was united with St.Paul with St.Clement by Order in Council 6 May 1955, with St.Paul to be the parish church. Redundant 1955. crypt only still surviving. |
Longitudinal study of serum and cerebrospinal fluid (CSF) class-specific antibodies against Campylobacter jejuni and GM1 ganglioside in Guillain-Barré syndrome.
We report two Guillain-Barré Syndrome (GBS) patients with culture-proven Campylobacter jejuni (Penner19/Lior 7). Elevated anti-C.jejuni IgA antibody declined to the normal range within one month, elevation of anti-C.jejuni IgM antibody lasted for 3 months and the titers of anti-C.jejuni IgG antibody were still elevated at one year after the neurologic onset. Serological criteria for antecedent C.jejuni infection in GBS patients should require 1) high titer of serum IgA and/or IgM antibody against C.jejuni followed by seroconversion of the IgA and/or IgM and 2) a 4-fold decline of IgG serum dilution against C.jejuni. Anti-C.jejuni antibodies in cerebrospinal fluid (CSF) reached the maximum value at one month after their neurologic onset which may not be responsible for the main pathological mechanism in the development of GBS. Anti-GM1 antibodies in serum and CSF were parallel with those of anti-C.jejuni antibodies during the course of the disease. |
Videos from Russia about Russian Life, Old Soviet Cartoons, Movies and Films!
Russian Clowns – Licidei! (Blue Canary)
That is just clowns… but why I have such sweet and sad feeling in my chest when I watch this video? May be a name of this feeling is nostalgia… Nostalgia? Nostalgia about things what never happened and never will happen in your life? Have a good viewing! 🙂 |
/*
* Automatic Parallelization using OpenMP
*
* Input: sequential C/C++ code
* Output: parallelized C/C++ code using OpenMP
*
* Algorithm:
* Read in semantics specification (formerly array abstraction) files
* Collect all loops with canonical forms
* x. Conduct loop normalization
* x. Call dependence analysis from Qing's loop transformations
* x. Conduct liveness analysis and variable classification
* x. Judge if the loop is parallelizable
* x. Attach OmpAttribute if it is
* x. Insert OpenMP pragma accordingly
*
* By Chunhua Liao
* Nov 3, 2008
*/
#include "rose.h"
#include "rose_config.h" // obtain macros defining backend compiler names, etc.
#include "keep_going.h" // enable logging files which cannot be processed by AutoPar due to various reasons
// all kinds of analyses needed
#include "autoParSupport.h"
#include <string>
#include <CommandLine.h> // Commandline support in librose
#include <Sawyer/CommandLine.h>
static const char* purpose = "This tool automatically inserts OpenMP directives into sequential codes.";
static const char* description =
"This tool is an implementation of automatic parallelization using OpenMP. "
"It can automatically insert OpenMP directives into input serial C/C++ codes. "
"For input programs with existing OpenMP directives, the tool will double check "
"the correctness when requested with an option --enable_diff ";
using namespace std;
using namespace AutoParallelization;
using namespace SageInterface;
void findCandidateFunctionDefinitions (SgProject* project, std::vector<SgFunctionDefinition* >& candidateFuncDefs)
{
ROSE_ASSERT (project != NULL);
// For each source file in the project
SgFilePtrList & ptr_list = project->get_fileList();
for (SgFilePtrList::iterator iter = ptr_list.begin(); iter!=ptr_list.end();
iter++)
{
SgFile* sageFile = (*iter);
SgSourceFile * sfile = isSgSourceFile(sageFile);
ROSE_ASSERT(sfile);
// SgGlobal *root = sfile->get_globalScope();
if (enable_debug)
cout<<"Processing each function within the files "<< sfile->get_file_info()->get_filename() <<endl;
// cout<<"\t loop at:"<< cur_loop->get_file_info()->get_line() <<endl;
// This is wrong, many functions in question are not top level declarations!!
//SgDeclarationStatementPtrList& declList = root->get_declarations ();
//VariantVector vv;
Rose_STL_Container<SgNode*> defList = NodeQuery::querySubTree(sfile, V_SgFunctionDefinition);
// bool hasOpenMP= false; // flag to indicate if omp.h is needed in this file
//For each function body in the scope
//for (SgDeclarationStatementPtrList::iterator p = declList.begin(); p != declList.end(); ++p)
for (Rose_STL_Container<SgNode*>::iterator p = defList.begin(); p != defList.end(); ++p)
{
SgFunctionDefinition *defn = isSgFunctionDefinition(*p);
ROSE_ASSERT (defn != NULL);
SgFunctionDeclaration *func = defn->get_declaration();
ROSE_ASSERT (func != NULL);
if (enable_debug)
cout<<"\t considering function "<< func->get_name() << " at "<< func->get_file_info()->get_line()<<endl;
//ignore functions in system headers, Can keep them to test robustness
if (defn->get_file_info()->get_filename()!=sageFile->get_file_info()->get_filename())
{
if (enable_debug)
cout<<"\t Skipped since the function's associated file name does not match current file being considered. Mostly from a header. "<<endl;
continue;
}
candidateFuncDefs.push_back(defn);
} // end for def list
} // end for file list
}
// normalize all loops within candidate function definitions
void normalizeLoops (std::vector<SgFunctionDefinition* > candidateFuncDefs)
{
for (std::vector<SgFunctionDefinition* >::iterator iter = candidateFuncDefs.begin(); iter != candidateFuncDefs.end(); iter++)
{
SgFunctionDefinition* funcDef = *iter;
ROSE_ASSERT (funcDef);
// This has to happen before analyses are called.
// For each loop
VariantVector vv (V_SgForStatement);
Rose_STL_Container<SgNode*> loops = NodeQuery::querySubTree(funcDef, vv);
if (enable_debug)
cout<<"Normalize loops queried from memory pool ...."<<endl;
// normalize C99 style for (int i= x, ...) to C89 style: int i; (i=x, ...)
// Liao, 10/22/2009. Thank Jeff Keasler for spotting this bug
for (Rose_STL_Container<SgNode*>::iterator iter = loops.begin();
iter!= loops.end(); iter++ )
{
SgForStatement* cur_loop = isSgForStatement(*iter);
ROSE_ASSERT(cur_loop);
if (enable_debug)
cout<<"\t loop at:"<< cur_loop->get_file_info()->get_line() <<endl;
// skip for (;;) , SgForStatement::get_test_expr() has a buggy assertion.
SgStatement* test_stmt = cur_loop->get_test();
if (test_stmt!=NULL &&
isSgNullStatement(test_stmt))
{
if (enable_debug)
cout<<"\t skipped due to empty loop header like for (;;)"<<endl;
continue;
}
// skip system header
if (insideSystemHeader (cur_loop) )
{
if (enable_debug)
cout<<"\t skipped since the loop is inside a system header "<<endl;
continue;
}
#if 0 // we now always normalize loops, then later undo some normalization 6/22/2016
// SageInterface::normalizeForLoopInitDeclaration(cur_loop);
if (keep_c99_loop_init)
{
// 2/29/2016, disable for loop init declaration normalization
// This is not used . No longer used.
normalizeForLoopTest(cur_loop);
normalizeForLoopIncrement(cur_loop);
ensureBasicBlockAsBodyOfFor(cur_loop);
constantFolding(cur_loop->get_test());
constantFolding(cur_loop->get_increment());
}
else
#endif
SageInterface::forLoopNormalization(cur_loop);
} // end for all loops
} // end for all function defs
}
//! Initialize the switch group and its switches.
Sawyer::CommandLine::SwitchGroup commandLineSwitches() {
using namespace Sawyer::CommandLine;
// Default log files for keep_going option
// There is no home directory if called by a web server account.
const char* logdir = "/tmp";
char* hdir = getenv("HOME");
if (hdir != NULL){
logdir = hdir;
}
ROSE_ASSERT (logdir !=NULL);
string log_path = boost::filesystem::path(logdir).native();
Rose::KeepGoing::report_filename__fail = log_path +"/autoPar-failed-files.txt";
Rose::KeepGoing::report_filename__pass = log_path +"/autoPar-passed-files.txt";
SwitchGroup switches("autoPar's switches");
switches.doc("These switches control the autoPar tool. ");
switches.name("rose:autopar");
switches.insert(Switch("enable_verbose")
.intrinsicValue(true, AutoParallelization::enable_verbose)
.doc("Enable the verbose mode to print out parallelization results for loops."));
switches.insert(Switch("enable_debug")
.intrinsicValue(true, AutoParallelization::enable_debug)
.doc("Enable the debugging mode to print out lots of information of internal processing."));
// Keep going option of autoPar
switches.insert(Switch("keep_going")
.intrinsicValue(true, AutoParallelization::keep_going)
.doc("Allow auto parallelization to keep going if errors happen. \n Errors are stored in a failure report file. See the option failsure_report for details. "));
switches.insert(Switch("failure_report")
.argument("string", anyParser(Rose::KeepGoing::report_filename__fail))
.doc("Specify the report file for logging files autoPar cannot fully process when keep_going option is turned on. \n Default file is $HOME/autoPar-failed-files.txt"));
switches.insert(Switch("success_report")
.argument("string", anyParser(Rose::KeepGoing::report_filename__pass))
.doc("Specify the report file for logging files autoPar can fully process when keep_going option is turned on. \n Default file is $HOME/autoPar-passed-files.txt"));
switches.insert(Switch("enable_patch")
.intrinsicValue(true, AutoParallelization::enable_patch)
.doc("Enable generating patch files to represent auto parallelization, instead of directly changing input files"));
switches.insert(Switch("no_aliasing")
.intrinsicValue(true, AutoParallelization::no_aliasing)
.doc("Assuming no pointer aliasing exists."));
switches.insert(Switch("unique_indirect_index")
.intrinsicValue(true, AutoParallelization::b_unique_indirect_index)
.doc("Assuming all arrays used as indirect indices have unique elements (no overlapping)"));
switches.insert(Switch("enable_diff")
.intrinsicValue(true, AutoParallelization::enable_diff)
.doc("Compare user defined OpenMP pragmas to auto parallelization generated ones."));
switches.insert(Switch("enable_modeling")
.intrinsicValue(true, AutoParallelization::enable_modeling)
.doc("Enabling cost modeling of loops to guide parallelization."));
switches.insert(Switch("enable_distance")
.intrinsicValue(true, AutoParallelization::enable_distance)
.doc("Report the absolute dependence distance of each dependence relation preventing parallelization."));
switches.insert(Switch("annot")
.argument("string", anyParser(AutoParallelization::annot_filenames))
// .shortPrefix("-") // this option allows short prefix
.whichValue(SAVE_ALL) // if switch appears more than once, save all values not just last
.doc("Specify semantics annotation file for standard or user-defined abstractions"));
switches.insert(Switch("dumpannot")
.intrinsicValue(true, AutoParallelization::dump_annot_file)
.doc("Dump annotation file content for debugging purposes."));
return switches;
}
// New version of command line processing using Sawyer library
static std::vector<std::string> commandline_processing(std::vector< std::string > & argvList)
{
using namespace Sawyer::CommandLine;
Parser p = Rose::CommandLine::createEmptyParserStage(purpose, description);
p.doc("Synopsis", "@prop{programName} @v{switches} @v{files}...");
p.longPrefix("-");
// initialize generic Sawyer switches: assertion, logging, threads, etc.
p.with(Rose::CommandLine::genericSwitches());
// initialize this tool's switches
p.with(commandLineSwitches());
// --rose:help for more ROSE switches
SwitchGroup tool("ROSE builtin switches");
bool showRoseHelp = false;
tool.insert(Switch("rose:help")
.longPrefix("-")
.intrinsicValue(true, showRoseHelp)
.doc("Show the old-style ROSE help."));
p.with(tool);
std::vector<std::string> remainingArgs = p.parse(argvList).apply().unparsedArgs(true);
// add back -annot file TODO: how about multiple appearances?
for (size_t i=0; i<AutoParallelization::annot_filenames.size(); i++)
{
remainingArgs.push_back("-annot");
remainingArgs.push_back(AutoParallelization::annot_filenames[i]);
}
if (AutoParallelization::keep_going)
remainingArgs.push_back("-rose:keep_going");
// AFTER parse the command-line, you can do this:
if (showRoseHelp)
SgFile::usage(0);
// work with the parser of the ArrayAbstraction module
//Read in annotation files after -annot
CmdOptions::GetInstance()->SetOptions(remainingArgs);
ArrayAnnotation* annot = ArrayAnnotation::get_inst();
annot->register_annot();
ReadAnnotation::get_inst()->read();
if (AutoParallelization::dump_annot_file)
annot->Dump();
//Strip off custom options and their values to enable backend compiler
CommandlineProcessing::removeArgsWithParameters(remainingArgs,"-annot");
#if 0 // DEBUGGING [Robb P Matzke 2016-09-27]
std::cerr <<"These are the arguments after parsing with Sawyer:\n";
BOOST_FOREACH (const std::string &s, remainingArgs)
std::cerr <<" \"" <<s <<"\"\n";
#endif
return remainingArgs;
}
// different OpenMP flags for backend compilers
#if !defined(_MSC_VER) && \
defined(BACKEND_CXX_IS_GNU_COMPILER)
#endif
// Detect which backend compiler is being used and return the corresponding OpenMP flag
// Expecting GCC, Intel, and Clang compilers as backend
string getOpenMPFlag()
{
string retval ;
if (strcmp(BACKEND_C_COMPILER_NAME_WITHOUT_PATH,"gcc")==0 || strcmp(BACKEND_C_COMPILER_NAME_WITHOUT_PATH,"clang")==0)
retval = "-fopenmp";
else if (strcmp(BACKEND_C_COMPILER_NAME_WITHOUT_PATH,"icc"))
retval = "-openmp";
else
{
cerr<<"Warning: getOpenMPFlag() encounters a unrecognized backend compiler name:"<< BACKEND_C_COMPILER_NAME_WITHOUT_PATH<<endl;
}
return retval;
}
int
main (int argc, char *argv[])
{
vector<string> argvList(argv, argv+argc);
//Processing debugging and annotation options
// autopar_command_processing(argvList);
argvList = commandline_processing (argvList);
// enable parsing user-defined pragma if enable_diff is true
// -rose:openmp:parse_only
if (enable_diff)
{
argvList.push_back("-rose:openmp:parse_only");
argvList.push_back(getOpenMPFlag());
}
SgProject *project = frontend (argvList);
ROSE_ASSERT (project != NULL);
// register midend signal handling function
if (KEEP_GOING_CAUGHT_MIDEND_SIGNAL)
{
std::cout
<< "[WARN] "
<< "Configured to keep going after catching a "
<< "signal in AutoPar"
<< std::endl;
Rose::KeepGoing::setMidendErrorCode (project, 100);
goto label_end;
}
// create a block to avoid jump crosses initialization of candidateFuncDefs etc.
{
std::vector<SgFunctionDefinition* > candidateFuncDefs;
findCandidateFunctionDefinitions (project, candidateFuncDefs);
normalizeLoops (candidateFuncDefs);
//Prepare liveness analysis etc.
//Too much output for analysis debugging info.
//initialize_analysis (project,enable_debug);
initialize_analysis (project, false);
// This is a bit redundant with findCandidateFunctionDefinitions ()
// But we do need the per file control to decide if omp.h is needed for each file
//
// For each source file in the project
SgFilePtrList & ptr_list = project->get_fileList();
for (SgFilePtrList::iterator iter = ptr_list.begin(); iter!=ptr_list.end();
iter++)
{
SgFile* sageFile = (*iter);
SgSourceFile * sfile = isSgSourceFile(sageFile);
ROSE_ASSERT(sfile);
SgGlobal *root = sfile->get_globalScope();
Rose_STL_Container<SgNode*> defList = NodeQuery::querySubTree(sfile, V_SgFunctionDefinition);
bool hasOpenMP= false; // flag to indicate if there is at least one loop is parallelized. also if omp.h is needed in this file
//For each function body in the scope
//for (SgDeclarationStatementPtrList::iterator p = declList.begin(); p != declList.end(); ++p)
for (Rose_STL_Container<SgNode*>::iterator p = defList.begin(); p != defList.end(); ++p)
{
// cout<<"\t loop at:"<< cur_loop->get_file_info()->get_line() <<endl;
SgFunctionDefinition *defn = isSgFunctionDefinition(*p);
ROSE_ASSERT (defn != NULL);
SgFunctionDeclaration *func = defn->get_declaration();
ROSE_ASSERT (func != NULL);
//ignore functions in system headers, Can keep them to test robustness
if (defn->get_file_info()->get_filename()!=sageFile->get_file_info()->get_filename())
{
continue;
}
SgBasicBlock *body = defn->get_body();
// For each loop
Rose_STL_Container<SgNode*> loops = NodeQuery::querySubTree(defn,V_SgForStatement);
if (loops.size()==0)
{
if (enable_debug)
cout<<"\t skipped since no for loops are found in this function"<<endl;
continue;
}
#if 0 // Moved to be executed before running liveness analysis.
// normalize C99 style for (int i= x, ...) to C89 style: int i; (i=x, ...)
// Liao, 10/22/2009. Thank Jeff Keasler for spotting this bug
for (Rose_STL_Container<SgNode*>::iterator iter = loops.begin();
iter!= loops.end(); iter++ )
{
SgForStatement* cur_loop = isSgForStatement(*iter);
ROSE_ASSERT(cur_loop);
SageInterface::normalizeForLoopInitDeclaration(cur_loop);
}
#endif
// X. Replace operators with their equivalent counterparts defined
// in "inline" annotations
AstInterfaceImpl faImpl_1(body);
CPPAstInterface fa_body(&faImpl_1);
OperatorInlineRewrite()( fa_body, AstNodePtrImpl(body));
// Pass annotations to arrayInterface and use them to collect
// alias info. function info etc.
ArrayAnnotation* annot = ArrayAnnotation::get_inst();
ArrayInterface array_interface(*annot);
// alias Collect
// value collect
array_interface.initialize(fa_body, AstNodePtrImpl(defn));
// valueCollect
array_interface.observe(fa_body);
//FR(06/07/2011): aliasinfo was not set which caused segfault
LoopTransformInterface::set_aliasInfo(&array_interface);
for (Rose_STL_Container<SgNode*>::iterator iter = loops.begin();
iter!= loops.end(); iter++ )
{
SgNode* current_loop = *iter;
if (enable_debug)
{
SgForStatement * fl = isSgForStatement(current_loop);
cout<<"\t\t Considering loop at "<< fl->get_file_info()->get_line()<<endl;
}
//X. Parallelize loop one by one
// getLoopInvariant() will actually check if the loop has canonical forms
// which can be handled by dependence analysis
// skip loops with unsupported language features
VariantT blackConstruct;
if (useUnsupportedLanguageFeatures(current_loop, &blackConstruct))
{
if (enable_debug)
cout<<"Skipping a loop at line:"<<current_loop->get_file_info()->get_line()<<" due to unsupported language construct"<< blackConstruct << "..."<<endl;
continue;
}
SgInitializedName* invarname = getLoopInvariant(current_loop);
if (invarname != NULL)
{
bool ret = ParallelizeOutermostLoop(current_loop, &array_interface, annot);
if (ret) // if at least one loop is parallelized, we set hasOpenMP to be true for the entire file.
hasOpenMP = true;
}
else // cannot grab loop index from a non-conforming loop, skip parallelization
{
if (enable_debug)
cout<<"Skipping a non-canonical loop at line:"<<current_loop->get_file_info()->get_line()<<"..."<<endl;
// We should not reset it to false. The last loop may not be parallelizable. But a previous one may be.
//hasOpenMP = false;
}
}// end for loops
} // end for-loop for declarations
// insert omp.h if needed
if (hasOpenMP && !enable_diff)
{
SageInterface::insertHeader("omp.h",PreprocessingInfo::after,true,root);
if (enable_patch)
generatePatchFile(sfile);
}
// compare user-defined and compiler-generated OmpAttributes
if (enable_diff)
diffUserDefinedAndCompilerGeneratedOpenMP(sfile);
} //end for-loop of files
#if 1
// undo loop normalization
std::map <SgForStatement* , bool >::iterator iter = trans_records.forLoopInitNormalizationTable.begin();
for (; iter!= trans_records.forLoopInitNormalizationTable.end(); iter ++)
{
SgForStatement* for_loop = (*iter).first;
unnormalizeForLoopInitDeclaration (for_loop);
}
#endif
// Qing's loop normalization is not robust enough to pass all tests
//AstTests::runAllTests(project);
// clean up resources for analyses
release_analysis();
}
label_end:
// Report errors
int status = backend (project);
// we always write to log files by default now
if (keep_going)
{
std::vector<std::string> orig_rose_cmdline(argv, argv+argc);
Rose::KeepGoing::generate_reports (project, orig_rose_cmdline);
}
return status;
}
|
Treasury Secretary Steve Mnuchin speaks about sanctions against Turkey at a news briefing at the White House in Washington, October 11, 2019.
Treasury Secretary Steven Mnuchin is pushing to delay a proposed disclosure of Secret Service spending on presidential travel until after the 2020 election, a spokesperson for Sen. Dianne Feinstein, D-Calif., said Thursday.
The Trump administration's maneuvering to put off providing cost figures related to the agency's protection of President Donald Trump comes as Mnuchin is in talks with Congress on a bill to move the Secret Service back to the Treasury Department, according to an article Wednesday in The Washington Post, which first reported on Mnuchin's efforts.
The cost of protecting Trump while he is away from the nation's capital has come under scrutiny.
According to the Post, Democrats have demanded that the legislation require the Secret Service, which was transferred from Treasury to the Department of Homeland Security in 2003, report costs related to Trump's travel within 120 days after it is passed. The disclosure would also include costs of protecting Trump's adult children, according to the newspaper.
A Treasury Department spokesperson said in a statement that Mnuchin and Secret Service Director James Murray have been working over "the past several months" to return the Secret Service to the Treasury Department.
"Conversations about the return of the Secret Service to the Treasury Department are ongoing, and we decline to comment on individual aspects of those conversations," the spokesperson said.
The Government Accountability Office published a report in January 2019 finding that federal agencies incurred costs of $13.6 million in a period of just over a month in 2017 when Trump took four trips to his Florida club Mar-a-Lago. |
Small Business Marketing And Consulting
YCHANGE provides small business marketing and consulting services to help your company adopt a customer-driven marketing focus. Every successful startup or existing small business must know their favorite customers and the reason they buy from them. We also help you identify your target markets and develop the marketing messages that resonate with these customer sets. Lastly, we help you communicate these messages to those target customers using the most appropriate media.
Useful Links
Recommended Blogs
Follow Ychange
Jim Smith
Business Consultant and past Chair of SCORE Portland. Member of the Portland Small Business Advisory Council, Chairman of the Board of Commissioners of Home Forward (the former Housing Authority of Portland), Turnaround Specialist, Executive Coach and Professional Speaker. |
Jennifer Garner jokes she’s dating Brad Pitt
Jennifer Garner caused a stir on Monday (03Oct16) when she joked that she’s dating newly single actor Brad Pitt.
The 44-year-old actress has hit headlines over recent months due to questions about the state of her marriage to estranged husband Ben Affleck, following images of the pair going out for dinner together without their three children.
However, Jennifer attempted to distract reporters from asking the constant questions about her personal life as she grabbed a coffee after a workout session in Los Angeles.
As she was set upon by a group of paparazzi, Jennifer smiled and told the crowd: “Brad Pitt and I are dating!”
When a videographer questioned her, “You’re dating Brad Pitt?”, Jennifer replied, “Yeah!”
Her joke caused the photographers to burst into laughter, with the actress continuing to giggle as she made her way back to her car.
Former Alias star Jennifer previously compared her marriage to Ben to Brad’s former marriage to Jennifer Aniston, telling Vanity Fair magazine in March (16) that the couples both faced requests from fans to reunite.
“When Jen Aniston and Brad Pitt broke up, I was dying to see something that said they were getting back together,” Jennifer told the publication.
During the interview, Jennifer insisted that she doesn’t regret marrying Ben, who she split from after ten years of marriage in June 2015.
“I didn’t marry the big fat movie star; I married him,” the actress said. “And I would go back and remake that decision. I ran down the beach to him, and I would again. You can’t have these three babies and so much of what we had. He’s the love of my life. What am I going to do about that? He’s the most brilliant person in any room, the most charismatic, the most generous. He’s just a complicated guy.”
Brad is newly single after wife Angelina Jolie filed for divorce last month (Sep16) after two years of marriage. |
1. Field of the Invention
An aspect of the invention relates to a switching mode power supply (SMPS) device, an image forming apparatus including the SMPS device, and a method of driving the SMPS device. More particularly, an aspect of the invention relates to a switching mode power supply device capable of preventing electromagnetic interference from occurring due to impedance variance, and reducing power consumption, and an image forming apparatus including the SMPS device, and a method of driving the SMPS device.
2. Description of the Related Art
An image forming apparatus, such as a printer, a photocopier, a facsimile machine, and a multifunctional device capable of combining the functionality of several different pieces of office equipment into a single machine, is a device for printing an image on a print medium by executing a print operation corresponding to an input data.
The image forming apparatus requires a power supply device to convert an AC input voltage into a DC output voltage and supply the DC output voltage to the respective parts such as a print controlling part which has a microcontroller to control printing operation, or a print engine part which accommodates a stack of print media such as printing paper, prints an image onto a print medium, and discharges the print medium with the image formed thereon.
A switching mode power supply (SMPS) device rectifies and smoothes commercial AC into DC, and converts the DC to a high frequency such as 100 kHz, so that an appropriate voltage can be obtained by the transformer.
Methods of controlling an output voltage of an SMPS device generally include a pulse-width modulation (PWM) method of controlling a duty ratio of a switching pulse according to an output voltage variation; a method of controlling a frequency of the switching pulse; and a method of controlling a phase of the switching pulse.
Recently, the functions of the image forming apparatus have been diversified and complicated, and reducing electric power consumption thereof is highly desirable. Accordingly, various methods have been tried to reduce electric power consumption of an SMPS device.
A quasi-resonant control has been applied to an SMPS device as one way of reducing electric power consumption.
The method of quasi-resonant control will be briefly described below.
FIG. 6 is a circuit diagram illustrating a part of an SMPS device performing the quasi-resonant control according to the related art. FIG. 7 is a graph illustrating waveforms in the SMPS device of FIG. 6, and FIG. 8 is a graph explaining the operation of the SMPS device in response to the waveforms illustrated in FIG. 7.
In the quasi-resonant control, the MOS transistor (M_TR) triggers a new cycle by starting a turn-on state when a voltage difference across the M_TR reaches the minimum voltage during switching from the turn-on state to a turn-off state. Accordingly, as the electric power consumption in the M_TR is reduced, the electric power consumption of the SMPS device is also reduced.
Referring to FIGS. 6 through 8, the controller (IC) outputs a switching signal of a predetermined frequency to control switching of the M_TR in response to a voltage supply VCC. Accordingly, a DC input voltage DC_IN that was obtained from an external power supply is rectified and smoothed, and is supplied to the primary winding L11 of the transformer in a predetermined pulse form in accordance with a switching signal as shown in the top half of FIG. 7, which is detected at the point P3 in FIG. 6.
Accordingly, a primitive switching signal having substantially the same frequency as the switching signal is generated at the secondary winding L12 of the transformer, resonated at the resonant frequency which is formed according to the inductance of the secondary winding L12 and the capacitance of the capacitor C11, and input into the controller IC in pulse form as shown in the bottom half of FIG. 7, which is detected at the point P4 in FIG. 6. The primitive switching signal is generated and receives a feedback according to the switching signal of the predetermined frequency which controls switching of the M_TR. The term “primitive switching signal” herein means a signal previously generated in order to output the switching signal by a quasi-resonant control method.
The circuit in FIG. 6 also includes resistors R11, R12, R13, R14, and R15 connected as shown in FIG. 6.
The controller IC drives the SMPS device using quasi-resonant controlling by detecting the voltage of the switching signal having a reference voltage such as 0 voltage, for example, and outputting a switching signal to the M_TR when the time period during which the switching signal below 0 voltage is supplied exceeds a reference time, such as 8 μs, for example.
However, the SMPS device with the above construction has a problem in that the resonance continues until the core is reset according to the inductance and capacitance. Additionally, because the controller IC outputs a switching signal whenever it detects 0 voltage and then voltage under 0 for more than a reference time, current is induced low and switching frequency increases when a light load is driven by the output of the SMPS device.
Electromagnetic interference (EMI) is detected from the harmonics in the low-frequency signal. However, the EMI is detected from the initial frequency component in the high-frequency signal, which causes the increased switching frequency and deterioration of EMI characteristics.
Additionally, as the switching signal is outputted at a shorter interval, turn-on and turn-off operations of M_TR increase with the supply of the light load, compared to when a heavy load is supplied, which subsequently increases power consumption of the M_TR and the SMPS device. |
App\Entity\RiaCompanyInformation:
type: entity
table: ria_company_information
repositoryClass: App\Repository\RiaCompanyInformationRepository
fields:
id:
type: integer
id: true
generator:
strategy: AUTO
ria_user_id:
type: integer
name:
type: string
length: 255
nullable: true
primary_first_name:
type: string
length: 255
nullable: true
primary_last_name:
type: string
length: 255
nullable: true
website:
type: string
length: 255
nullable: true
address:
type: string
length: 255
nullable: true
office:
type: string
length: 255
nullable: true
city:
type: string
length: 255
nullable: true
state_id:
type: integer
nullable: true
zipcode:
type: string
length: 25
nullable: true
phone_number:
type: string
length: 25
nullable: true
fax_number:
type: string
length: 25
nullable: true
contact_email:
type: string
length: 255
nullable: true
logo:
type: string
length: 255
nullable: true
account_managed:
type: integer
nullable: true
is_allow_retirement_plan:
type: boolean
nullable: true
minimum_billing_fee:
type: float
nullable: true
is_show_client_expected_asset_class:
type: boolean
nullable: true
clients_tax_bracket:
type: float
nullable: true
use_municipal_bond:
type: boolean
nullable: false
rebalanced_method:
type: integer
nullable: true
rebalanced_frequency:
type: integer
nullable: true
risk_adjustment:
type: integer
nullable: true
is_searchable_db:
type: boolean
nullable: true
min_asset_size:
type: float
nullable: true
adv_copy:
type: string
lenght: 255
nullable: true
portfolio_model_id:
type: integer
nullable: true
activated:
type: boolean
nullable: false
transaction_amount:
type: float
nullable: true
transaction_amount_percent:
type: float
nullable: true
is_transaction_fees:
type: boolean
nullable: true
is_transaction_minimums:
type: boolean
nullable: true
is_transaction_redemption_fees:
type: boolean
nullable: true
is_tax_loss_harvesting:
type: boolean
nullable: true
is_show_expected_costs:
type: boolean
nullable: true
tax_loss_harvesting:
type: float
nullable: true
tax_loss_harvesting_percent:
type: float
nullable: true
tax_loss_harvesting_minimum:
type: float
nullable: true
tax_loss_harvesting_minimum_percent:
type: float
nullable: true
tlh_buy_back_original:
type: boolean
nullable: false
is_use_qualified_models:
type: boolean
nullable: false
default: false
portfolio_processing:
type: integer
nullable: true
custodian_id:
type: integer
nullable: true
allow_non_electronically_signing:
type: boolean
nullable: true
stop_tlh_value:
type: float
nullable: true
relationship_type:
type: integer
nullable: false
slug:
type: string
length: 45
nullable: true
custodianKey:
type: string
length: 255
nullable: true
custodianSecret:
type: string
length: 255
nullable: true
uniqueConstraints:
contact_email_unique:
name: contact_email_UNIQUE
columns: [ contact_email ]
slug_unique:
name: slug_UNIQUE
columns: [ slug ]
oneToOne:
ria:
targetEntity: App\Entity\User
inversedBy: riaCompanyInformation
joinColumn:
name: ria_user_id
referencedColumnName: id
onDelete: cascade
cascade: ['persist']
oneToMany:
advisorCodes:
targetEntity: App\Entity\AdvisorCode
mappedBy: riaCompany
cascade: ['persist']
manyToOne:
state:
targetEntity: App\Entity\State
joinColumn:
name: state_id
referencedColumnName: id
cascade: ['persist']
portfolioModel:
targetEntity: App\Entity\CeModel
joinColumn:
name: portfolio_model_id
referencedColumnName: id
onDelete: set null
cascade: ['persist']
custodian:
targetEntity: App\Entity\Custodian
joinColumn:
name: custodian_id
referencedColumnName: id
onDelete: set null
cascade: ['persist']
lifecycleCallbacks:
prePersist: [ preUpload, preUploadAdvCopy ]
preUpdate: [ preUpload, preUploadAdvCopy ]
postPersist: [ upload, uploadAdvCopy ]
postUpdate: [ upload, uploadAdvCopy ]
postRemove: [ removeUpload, removeUploadAdvCopy ]
|
---
abstract: 'Big data has become a critically enabling component of emerging mathematical methods aimed at the automated discovery of dynamical systems, where first principles modeling may be intractable. However, in many engineering systems, abrupt changes must be rapidly characterized based on limited, incomplete, and noisy data. Many leading automated learning techniques rely on unrealistically large data sets and it is unclear how to leverage prior knowledge effectively to re-identify a model after an abrupt change. In this work, we propose a conceptual framework to recover parsimonious models of a system in response to abrupt changes in the low-data limit. First, the abrupt change is detected by comparing the estimated Lyapunov time of the data with the model prediction. Next, we apply the sparse identification of nonlinear dynamics (SINDy) regression to update a previously identified model with the fewest changes, either by addition, deletion, or modification of existing model terms. We demonstrate this sparse model recovery on several examples for abrupt system change detection in periodic and chaotic dynamical systems. Our examples show that sparse updates to a previously identified model perform better with less data, have lower runtime complexity, and are less sensitive to noise than identifying an entirely new model. The proposed abrupt-SINDy architecture provides a new paradigm for the rapid and efficient recovery of a system model after abrupt changes.'
author:
- Markus Quade
- Markus Abel
- 'J. Nathan Kutz'
- 'Steven L. Brunton'
bibliography:
- 'main.bib'
title: Sparse Identification of Nonlinear Dynamics for Rapid Model Recovery
---
**Dynamical systems modeling is a cornerstone of modern mathematical physics and engineering. The dynamics of many complex systems (e.g., neuroscience, climate, epidemiology, etc.) may not have first-principles derivations, and researchers are increasingly using data-driven methods for system identification and the discovery of dynamics. Related to discovery of dynamical systems models from data is the *recovery* of these models following abrupt changes to the system dynamics. In many domains, such as aviation, model recovery is mission critical, and must be achieved rapidly and with limited noisy data. This paper leverages recent advances in sparse optimization to identify the fewest terms required to recover a model, introducing the concept of *parsimony of change*. In other words, many abrupt system changes, even catastrophic bifurcations, may be characterized with relatively few changes to the terms in the underlying model. In this work, we show that sparse optimization enables rapid model recovery that is faster, requires less data, is more accurate, and has higher noise robustness than the alternative approach of re-characterizing a model from scratch.**
Introduction
============
The data-driven discovery of physical laws and dynamical systems is poised to revolutionize how we model, predict, and control physical systems. Advances are driven by the confluence of big data, machine learning, and modern perspectives on dynamics and control. However, many modern techniques in machine learning (e.g., neural networks) often rely on access to massive data sets, have limited ability to generalize beyond the attractor where data is collected, and do not readily incorporate known physical constraints. These various limitations are framing many state-of-the-art research efforts around learning algorithms [@goodfellow2016deep], especially as it pertains to generalizability, limited data and [*one-shot learning*]{} [@fei2006one; @vinyals2016matching; @delahunt2018putting]. Such limitations also frame the primary challenges and limitations associated with data-driven discovery for real-time control of strongly nonlinear, high-dimensional, multi-scale systems with abrupt changes in the dynamics. Whereas traditional methods often require unrealistic amounts of training data to produce a viable model, this work focuses on methods that take advantage of prior experience and knowledge of the physics to dramatically reduce the data and time required to characterize dynamics. Our methodology is similar in philosophy to the machine learning technique of [*transfer learning*]{} [@pan2010survey], which allows networks trained on one task to be efficiently adapted to another task. Our architecture is designed around the goal of rapidly extracting parsimonious, nonlinear dynamical models that identify only the fewest important interaction terms so as to avoid overfitting.
There are many important open challenges associated with data-driven discovery of dynamical systems for real-time tracking and control. When abrupt changes occur in the system dynamics, an effective controller must rapidly characterize and compensate for the new dynamics, leaving little time for recovery based on limited data [@Brunton2015amr]. The primary challenge in real-time model discovery is the reliance on large quantities of training data. A secondary challenge is the ability of models to generalize beyond the training data, which is related to the ability to incorporate new information and quickly modify the model. Machine learning algorithms often suffer from overfitting and a lack of interpretability, although the application of these algorithms to physical systems offers a unique opportunity to enforce known symmetries and physical constraints (e.g. conservation of mass). Inspired by biological systems, which are capable of extremely fast adaptation and learning based on very few trials of new information [@rankin2004invertebrate; @whitlock2006learning; @johansen2011molecular], we propose model discovery techniques that leverage an *experiential framework*, where known physics, symmetries, and conservation laws are used to rapidly infer model changes with limited data.
Previous work in system identification
--------------------------------------
There are a wealth of regression techniques for the characterization of system dynamics from data, with varying degrees of generality, accuracy, data requirements, and computational complexity. Classical linear model identification algorithms include Kalman filters [@Kalman1960jfe; @Kalman1965AAC; @gershenfeld1999nature], the eigensystem realization algorithm (ERA) [@Juang1985jgcd], dynamic mode decomposition (DMD) [@Schmid2010jfm; @Rowley2009jfm; @Tu2014jcd; @Kutz2016book], and autoregressive moving average (ARMA) models [@Akaike1969annals; @Brockwell2017], to name only a few. The resulting linear models are ideal for control design, but are unable to capture the underlying nonlinear dynamics or structural changes. Increasingly, machine learning is being used for nonlinear model discovery. Neural networks have been used for decades to identify nonlinear systems [@gonzalez1998identification], and are experiencing renewed interest because of the ability to train deeper networks with more data [@goodfellow2016deep; @Yeung2017arxiv; @Takeishi2017nips; @Wehmeyer2017arxiv; @Mardt2017arxiv; @Lusch2017arxiv] and the promise of transformations that linearize dynamics via the Koopman operator [@Koopman1931pnas; @Mezic2005nd]. Neural networks show good capacity to recover the dynamics in a so-called “model-free” way [@Lukosevicius2009; @Lu2017]. These methods are also known as “reservoir computers”, “liquid state machines”, or “echo state networks”, depending on the context. However, a real-time application is unrealistic, and the output is generally not analytically interpretable. In another significant vein of research, genetic programming [@dantzig1985mathematical; @koza1992genetic] is a powerful bio-inspired method that has successfully been applied to system identification [@Bongard2007pnas; @Schmidt2009science; @schmidt2011automated; @LaCava2016b], time-series prediction [@LaCava2016a; @Quade2016] and control [@Gout2018; @Duriez2017]. However, evolutionary methods in their pure form, including genetic programming, are computationally complex and thus are not suitable for real-time tracking.
Recently, *interpretability* and *parsimony* have become important themes in nonlinear system identification [@Bongard2007pnas; @Schmidt2009science]. A common goal now is to identify the fewest terms required to represent the nonlinear structure of a dynamical system model while avoiding overfitting [@Brunton2016pnas]. Symbolic regression methods [@voss1998; @Schmidt2009science; @McConaghy2011; @Brunton2016pnas] are generally appealing for system identification of structural changes, although they may need to be adapted to the low-data limit and for faster processing time. Nonparametric additive regression models [@abel2005additive; @voss1999; @abel2004] require a backfitting loop which allows general transformations, but may be prohibitively slow for real-time applications. Generalized linear regression methods are slightly less general but can be brought to a fast evaluation and sparse representation [@McConaghy2011; @Brunton2016pnas]. These leading approaches to identify dynamical equations from data usually rely on past data and aim at reliable reproduction of a stationary system, i.e. when the underlying equations do not change in the course of time [@Schmidt2009science; @abel2004; @Brunton2016pnas].
Contributions of this work
--------------------------
In this work, we develop an adaptive modification of the sparse identification of nonlinear dynamics (SINDy) algorithm [@Brunton2016pnas] for real-time recovery of a model following abrupt changes to the system dynamics. We refer to this modeling framework as *abrupt-SINDy*. Although this is not the only approach for real-time change detection and recovery, parsimony and sparsity are natural concepts to track abrupt changes, focusing on the fewest modifications to an existing model. SINDy already requires relatively small amounts of data [@Kaiser2017arxivB], is based on fast regression techniques, and has been extended to identify PDEs [@Rudy2017sciadv; @Schaeffer2017prsa], to include known constraints and symmetries [@Loiseau2016arxiv], to work with limited measurements [@Brunton2017natcomm] and highly corrupted and noisy data [@Tran2016arxiv; @Schaeffer2017pre], to include control inputs [@Brunton2016nolcos; @Kaiser2017arxivB], and to incorporate information criteria to assess the model quality [@Mangan2017prsa], which will be useful in abrupt model recovery.
Here, we demonstrate that the abrupt-SINDy architecture is capable of rapidly identifying sparse changes to an existing model to recover the new dynamics following an abrupt change to the system. The first step in the adaptive identification process is to detect a system change using divergence of the prediction from measurements. Next, an existing model is updated with sparse corrections, including parameter variations, deletions, and additions of terms. We show that identifying sparse model changes from an existing model requires less data, less computation, and is more robust to noise than identifying a new model from scratch. Further, we attempt to maintain a critical attitude and caveat limitations of the proposed approach, highlighting when it can break down and suggesting further investigation. The overarching framework is illustrated in Fig. \[Fig:Overview\].
{width="\textwidth"}
State of the art
================
Recently, sparse regression in a library of candidate nonlinear functions has been used for sparse identification of nonlinear dynamics (SINDy) to efficiently identify a sparse model structure from data [@Brunton2016pnas]. The SINDy architecture bypasses an intractable brute-force search through all possible models, leveraging the fact that many dynamical systems of the form $$\frac{d}{dt}{\bf {x}} = {\bf f}({\bf x})$$ have dynamics ${\bf f}$ that are sparse in the state variable ${\bf x}\in\mathbb{R}^n$. Such models may be identified using a sparsity-promoting regression [@Tibshirani1996lasso; @Hastie2009book; @James2013book] that penalizes the number of nonzero terms $\xi_{ij}$ in a generalized linear model: $$\hat{f_i}({\bf x}) = \sum_{j=1}^p\xi_{ij} \theta_{j}({\bf x}),
\label{eq:glm}$$ where $\theta_j({\bf x})$ form a set of nonlinear candidate functions. The candidate functions may be chosen to be polynomials, trigonometric functions, or a more general set of functions [@Brunton2016pnas; @McConaghy2011]. With poor choice of the candidate functions $\theta_j$, i.e. if library functions are non-orthogonal and/or overdetermined, the SINDy approach may fail to identify the correct model.
Sparse models may be identified from time-series data, which are collected and formed into the data matrix $${\bf X} = \begin{bmatrix} {\bf x}_1 & {\bf x}_2 & \cdots {\bf x}_m\end{bmatrix}^T.$$ We estimate the time derivatives using a simple forward Euler finite-difference scheme, i.e. the difference of two consecutive data, divided by the time difference: $${{\bf \dot{X}}} = \begin{bmatrix} {{\bf \dot{x}}}_1 & {{\bf \dot{x}}}_2 & \cdots {{\bf \dot{x}}}_m\end{bmatrix}^T.$$ This estimation procedure is numerically ill-conditioned if data are noisy, although there are many methods to handle noise which work very well if used correctly [@Ahnert-Abel-2007; @Chartrand2011isrnam]. Noise-robust derivatives were investigated in the original SINDy algorithm [@Brunton2016pnas]. Next, we consider a library of candidate nonlinear functions $\boldsymbol{\Theta}({\bf X})$, of the form $$\boldsymbol{\Theta}({\bf X}) = \begin{bmatrix} \mathbf{1} & {\bf X} & {\bf X}^2 & \cdots & {\bf X}^d & \cdots & \sin({\bf X}) & \cdots \end{bmatrix}.$$ Here, the matrix ${\bf X}^d$ denotes a matrix with column vectors given by all possible time-series of $d$-th degree polynomials in the state ${\bf x}$. The terms in $\boldsymbol{\Theta}$ can be functional forms motivated by knowledge of the physics. Within the proposed work, they may parameterize a piecewise-affine dynamical model. Following best practices of statistical learning [@Hastie2009book], to preprocess, we mean-subtract and normalize each column of $\boldsymbol{\Theta}$ to have unit variance. The dynamical system can now be represented in terms of the data matrices as $${{\bf \dot{X}}} \approx \boldsymbol{\Theta}({\bf X})\boldsymbol{\Xi}.$$ The coefficients in the column $\boldsymbol{\Xi}_k$ of $\boldsymbol{\Xi}$ determine the active terms in the $k$-th row of Eq. . A parsimonious model has the fewest terms in $\boldsymbol{\Xi}$ required to explain the data. One option to obtain a sparse model is via convex $\ell_1$-regularized regression: $$\boldsymbol{\Xi} = \text{argmin}_{\boldsymbol{\Xi}'}\|{\mathbf{\dot{X}}} - \boldsymbol{\Theta}(\mathbf{X})\boldsymbol{\Xi}'\|_2+\gamma \|\boldsymbol{\Xi}'\|_1.$$ The hyper parameter $\gamma$ balances complexity and sparsity of the solution. Sparse regression, such as LASSO [@Tibshirani1996lasso] and sequential thresholded least-squares [@Brunton2016pnas], improves the robustness of identification for noisy overdetermined data, in contrast to earlier methods [@Wang2011prl] using compressed sensing [@Donoho2006ieeetit; @Candes2006picm]. Other regularization schemes may be used to improve performance, such as the elastic net regression [@Li2016].
In this paper we use the sequentially thresholded ridge regression [@Rudy2017sciadv], which iteratively solves the ridge regression $$\boldsymbol{\Xi} = \text{argmin}_{\boldsymbol{\Xi}'}\|{\mathbf{\dot{X}}} - \boldsymbol{\Theta}(\mathbf{X})\boldsymbol{\Xi}'\|_2+\alpha \|\boldsymbol{\Xi}'\|_2.$$ and then thresholds any coefficient that is smaller than $\gamma$. The procedure is repeated on the non-zero entries of $\boldsymbol{\Xi}$ until the model converges. The convergence of the SINDy architecture has been discussed in [@Zhang2018]. After a sparse model structure has been identified in normalized coordinates, it is necessary to regress onto this sparse structure in the original unnormalized coordinates. Otherwise, non-physical constant terms appear when transforming back from normalized coordinates due to the mean-subtraction.
In La Cava et al. [@LaCava2016b] the authors pursue a complementary although more computationally intensive idea of adaptive modeling in the context of generalized linear models. Starting from an initial guess for the model, a brute force search is conducted to scan a larger set of candidate functions $\theta \rightarrow \theta \theta'^{\gamma}$, where $\theta'$ are multiplicative extensions to the initial set of candidate functions and $\gamma$ are real valued exponents. The intended use of this method is the refinement of first-principle based models by discovery of coupling terms. It is possible to combine this refinement with our proposed scheme for dealing with abrupt changes. In addition, sparse sensors [@Manohar2017csm] and randomized algorithms [@Erichson2016arxivA] may improve speed.
Methods
=======
The viewpoint of sparsity extends beyond model discovery, and we propose to extend SINDy to identify systems undergoing abrupt changes. It may be the case that abrupt model changes will only involve the addition, deletion, or modification of a few terms in the model. This is a statement of the *parsimony of change*, and indicates that we can use sparse regression to efficiently identify the new or missing terms with considerably less data than required to identify a new model from scratch. In general, each additional term that must be identified requires additional training data to distinguish between joint effects. Thus, having only a few changes reduces the amount of data required, making the model recovery more rapid. This section will describe a procedure that extends SINDy to handle three basic types of model changes: If the structure of the model is unchanged and only the parameters vary, we will perform least-squares regression on the known structure to identify the new parameters. This is computationally fast, and it is easy to check if the model explains the new dynamics, or if it is necessary to explore possible additions or deletions of terms. If the model changes by the removal of a few terms, then SINDy regression can be applied on the sparse coefficients in order to identify which terms have dropped out. If a term is added, then SINDy regression will find the sparsest combination of inactive terms that explain the model error. Since least squares regression scales asymptotically $\mathcal{O}(p^3)$, with $p$ the number of columns in the library, this is computationally less expensive than regression in the entire library.
Combinations of these changes, such as a simultaneous addition and deletion, are more challenging and will also be explored. This approach is known as *abrupt-SINDy*, and it is depicted schematically in Fig. \[fig:flow-chart\].
![Adaptive SINDy flow chart. For an initial model and hyper parameter selection, a gridsearch is conducted. Next, we apply a predictor corrector scheme checking every $t_{\text{error}}$ for model divergence using estimated Lyapunov time, and eventually update the model in a two step fashion.[]{data-label="fig:flow-chart"}](figures_flowchart){width="\columnwidth"}
Baseline model
--------------
First, we must identify a baseline SINDy model, and we use a gridsearch to determine the optimal hyper parameter selection. In gridsearch, all combinations of hyper parameters are tested and the best performing set is selected. This search is only performed once, locking in hyper parameters for future updates. The baseline model is characterized by the sparse coefficients in $\boldsymbol{\Xi}_0$.
Detecting model divergence {#sec:divergence}
--------------------------
It is essential to rapidly detect any change in the model, and we employ a classical predictor-corrector scheme [@gershenfeld1999nature]. The predictor step is performed over a time $\tau_{\text{pred}}$ in the interval $t,t+\tau_{\text{pred}}$ using the model valid at time $t$. The divergence of the predicted and measured state is computed at $t+\tau$ as $\|\Delta {\bf x}\| = \| \hat{{\bf x}}(t+\tau) - {\bf x}(t+\tau) \|$, where $\hat{{\bf x}}$ is the prediction and ${\bf x}$ is the measurement. The idea is to identify when the model and the measurement diverge faster than predicted by the dynamics of the system. For a chaotic system, the divergence of a trajectory is measured by the largest Lyapunov exponent of the system [@ott2002chaos], although a wealth of similar measures have been suggested [@scholl2008handbook]. The Lyapunov exponent is defined as $$\lambda = \lim_{\tau \to \infty} \lim_{\Delta {\bf x}(t_0) \to 0} \frac{\left\langle \log \left( \frac{ \Delta {\bf x}(t_0+\tau) }{ \Delta {\bf x}({t_0}) }\right) \right\rangle}{\tau},$$ and its inverse sets the fastest time scale. Here, the analogy of ensemble and time average is used, more precisely the local, finite-time equivalent [@lai2011transient; @ding2007nonlinear]. An improvement can be achieved by exploiting an ensemble, e.g. by adding noise to the state ${\bf x}$ that corresponds to the given measurement accuracy. Since we know the dynamical system for the prediction step, the Lyapunov exponent is determined by evolving the tangent space with the system [@kantz1994robust; @pikovsky1998dynamic].
In our detection algorithm, we fix a fluctuation tolerance $\Delta {\bf x}$ and measure if the divergence time we find deviates from the expectation. If data are noisy, this tolerance must be significantly larger than the the typical fluctuation scale of the noise. Formally, the model and measurements diverge if the time-scale given by the local Lyapunov exponent and prediction horizon disagree. The local Lyapunov exponent is computed directly from the eigenvalues of the dynamical system [@kantz1994robust; @pikovsky1998dynamic]. The prediction horizon $T(t)$ is the first passage time where prediction $\hat{{\bf x}}(t + \Delta t)$ with initial condition ${\bf x}(t)$ and and measurement ${\bf x}(t + \Delta t)$ differ by more than $\Delta {\bf x}$: $$T(t) = \operatorname*{arg\rm{}max}_{\Delta t} {\left\lVert\hat{{\bf x}}(t + \Delta t) - {\bf x}(t + \Delta t)\right\rVert} < {\left\lVert\Delta {\bf x}\right\rVert}.
\label{eq:horizon}$$
Analogous to the local Lyapunov exponent, we compute the ratio $\log \left\| \Delta {\bf x}(t_0+\tau)/\Delta {\bf x}(t_0) \right \|$ as a measure for the divergence based on the measurement. For the model, we compute the local Lyapunov exponent as the average maximum eigenvalue $\bar{\lambda}(t) = \langle \lambda (t') \rangle_{t' \in [t, t+T]}$ with $\lambda (t) = \max(\lambda_i(t))$ and $\lambda_i v_i(t) = \left. {\partial f_j}/{\partial {\bf x}_k} \right| _{{\bf x}(t)} v_i(t)$. Thus we compare the expected and observed trajectory divergence. Model and measurement have diverged at time $t$ if the model time scale and the measured one differ: $$\bar{\lambda}(t) > \alpha \dfrac{\log(\Delta {\bf x}) - \log(\bar{\Delta}(t))}{T(t)}.
\label{eq:estlyap}$$ If the model is not chaotic, but the measurement is chaotic, one must invert the inequality, as in Fig. \[fig:divergence\]. The empirical factor $\alpha$ accounts for finite-time statistics.
![Sketch of the prediction horizon estimation. We use the observation ${\bf x}(t)$ as initial condition for the current model. Integration gives $\hat{{\bf x}}(t)$. The prediction horizon $T(t)$ is calculated according to Eq. . The prediction horizon is a function of time and the current model. It indicates divergence of model and observation. For details see text.[]{data-label="fig:divergence"}](figures_divergence){width="\columnwidth"}
This method depends heavily on the particular system under investigation, including the dynamics, time scales, and sampling rate. In a practical implementation, these considerations must be handled carefully and automatically. It is important to note that we are able to formulate the divergence in terms of dynamical systems theory, because our model *is* a dynamical system, in other cases, such as artificial neural networks, this is not possible due to the limited mathematical framework.
Adaptive model fitting
----------------------
After a change is detected, the following procedure is implemented to rapidly recover the model:
1. First, the new data is regressed onto the existing sparse structure $\boldsymbol{\Xi}_0$ to identify varying parameters.
2. Next, we identify deletions of terms by performing the sparse regression on the sparse columns of $\boldsymbol{\Theta}$ that correspond to nonzero rows in $\boldsymbol{\Xi}_0$. This is more efficient than identifying a new model, as we only seek to delete existing terms from the model.
3. Finally, if there is still a residual error, then a sparse model is fit for this error in the inactive columns of $\boldsymbol{\Theta}$ that correspond to zero rows in $\boldsymbol{\Xi}_0$. In this way, new terms may be added to the model.
If the residual is sufficiently small after any step, the procedure ends. Alternatively, the procedure may be iterated until convergence. We are solving smaller regression problems by restricting our attention to subsets of the columns of $\boldsymbol{\Theta}$. These smaller regressions require less data and are less computationally expensive [@Li2016], compared to fitting a new model. The deletion-addition procedure is performed after a model divergence is detected, using new transient data collected in an interval of size $t_{\text{update}}$.
Results {#sec:gridsearch}
=======
In this section, we describe the results of the abrupt-SINDy framework on dynamical systems with abrupt changes, including parameter variation, deletion of terms, and addition of terms. The proposed algorithm is compared against the original SINDy algorithm, which is used to identify a new model from scratch, in terms of data required, computational time, and model accuracy.
In each case, we begin by running a gridsearch algorithm[@pedregosa2011scikit][^1] to identify the main parameters: $\alpha$, the ridge regression regularization parameter; $\gamma$, the thresholding parameter; $n_{\text{degree}}$, the maximum degree of the polynomial feature transformation; and $n_{\text{fold}}$, the number of cross-validation runs. For scoring we use the explained variance score and conduct a five-fold cross validation for each point in the $(\alpha, \gamma, n_{\text{degree}})$ parameter grid.
\[tab:parameters\_gridsearch\]
Parameter Value
--------------------- --------------------------
$\alpha$ $0,0.2,0.4,0.6,0.8,0.95$
$\gamma $ $0.1,0.2,0.4$
$n_{\text{degree}}$ $2,3$
$n_{\text{fold}}$ $5$
Seed $42$
CV k-fold
Score explained variance score
: Parameters for the grid search.
Lorenz system {#Sec:Lorenz}
-------------
The Lorenz system is a well-studied, and highly simplified, conceptual model for atmospheric circulation [@Lorenz1963jas]: $$\begin{aligned}
\dot{x} &= \sigma(y -x) \\
\dot{y} &= \rho x - xz - y \\
\dot{z} &= xy -\beta z
\end{aligned}$$ where the parameter $\rho$ represents the heating of the atmosphere, corresponding to the Rayleigh number, $\sigma$ corresponds to Prandtl number, and $\beta$ to the aspect ratio [@strogatz2014nonlinear]. The parameters are set to $\rho=28$, $\beta=8/3$, $\sigma=10$.
In the following we integrate the system numerically to produce a reference data set. We deliberately change the parameter $\rho$ at $t=40$ to $\rho=15$ and at $t=80$ back to $\rho=28$, as shown in Figs. \[fig:lorenz\_y\] and \[fig:lorenz\_3d\]. These parametric changes lead to a bifurcation in the dynamics, and they are detected quickly. The subsequent adapted parameters are accurately detected up to two digits, as shown in Table \[tab:lorenz\]. Because we are identifying the sparse model structure on a normalized library $\boldsymbol{\Theta}$, with zero mean and unit variance, we must de-bias the parameter estimates by computing a least-squares regression onto the sparse model structure in the original unnormalized variables. Otherwise, computing the least-squares regression in the normalized library, as is typically recommended in machine learning, would result in non-physical constant terms in the original unnormalized coordinates.
![Time-series of the $y$ coordinate of the Lorenz system. The blue and green segments correspond to the system parameters $\sigma=10, \rho=28, \beta=\frac{8}{3}$. The orange segment from $t=40$ and $t=80$ corresponds to the modified parameter $\rho=15$. The initial condition is ${\mathbf{x}}_0 = (1, 1, 1)$.[]{data-label="fig:lorenz_y"}](figures_lorenz_trajectory_y){width="\columnwidth"}
![Lorenz system: Colors and parameters as in Fig. \[fig:lorenz\_y\]. In **A**, **B**, and **C** we show the first, second, and third segments of the trajectory in color with the concatenated trajectory in grey. The system changes from a butterfly attractor to a stable fixed point and back to a butterfly attractor.[]{data-label="fig:lorenz_3d"}](figures_lorenz_trajectory_3d){width="\columnwidth"}
Abrupt changes to the system parameters are detected using the prediction horizon from Eq. . When the system changes, the prediction horizon of the system should decrease, with smaller horizon corresponding to a more serious change. Conversely, the inverse time, corresponding to the Lyapunov exponent, should diverge. Figure \[fig:lorenz\_horizon\] exhibits this expected behavior. After a change is detected the model is rapidly recovered as shown in Table \[tab:lorenz\]. It is important to confirm that the updated model accurately represents the structure of the true dynamics. Figure \[fig:lorenz\_horizon\] shows the norm of the model coefficients, $\|{\boldsymbol{\xi}} - \hat{{\boldsymbol{\xi}}}\|$, which is a measure of the distance between the estimated and true systems. Except for a short time ($t_{\text{update}}=1$) after the abrupt change, the identified model closely agrees with the true model.
![Lorenz system: **A** We show the model accuracy over time. For coefficients, see Table \[tab:lorenz\]. For $t\leq 10$ no model is available and $\|{\boldsymbol{\xi}} - \hat{{\boldsymbol{\xi}}}\| = -1$. At both switch points, $t=40$ and $t=80$, $t_{\text{update}} = 1$ is needed to update the model. During this interval, a fallback solution, e.g. DMD could be implemented. Note that the accuracy metric requires knowledge about the ground truth and thus is only available in a hindcast scenario. **B** Evaluation of Eq. . At both switch points, $t=40$ and $t=80$, we quickly detect the divergence of model and measurement. The parameters are $t_{\text{model}}= 10, t_{\text{update}}= 1, t_{\text{error}}=0.5,$ and $\Delta {\bf x}= 1.0$.[]{data-label="fig:lorenz_horizon"}](figures_lorenz_error_horizon){width="\columnwidth"}
$t_{\text{detected}}$ $t_{\text{update}}$ Equations
----------------------- --------------------- ------------------------------------------------------------------------------------------------------------------
0.00 10.0 $\begin{aligned}\dot{x} & = -10.0x+10.0y\\\dot{y} & = 27.96x-0.99y-1.0xz\\\dot{z} & = -2.67z+1.0xy\end{aligned}$
40.01 41.0 $\begin{aligned}\dot{x} & = -10.0x+10.0y\\\dot{y} & = 15.0x-1.0y-1.0xz\\\dot{z} & = -2.67z+1.0xy\end{aligned}$
80.02 81.0 $\begin{aligned}\dot{x} & = -10.0x+10.0y\\\dot{y} & = 27.98x-1.0y-1.0xz\\\dot{z} & = -2.67z+1.0xy\end{aligned}$
: Lorenz system: detection and update times, along with identified equations. The detection time coincides up to the second digit with the true switching time. The rapidly identified model agrees well with the true model structure and parameters. Coefficients are rounded to the second digit.
\[tab:lorenz\]
### Effects of noise and data volume
An important set of practical considerations include how noise and the amount of data influence the speed of change detection and the accuracy of subsequent model recovery. Both the noise robustness and the amount of data required will change for a new problem, and here we report trends for this specific case. In addition, the amount of data required is also related to the sampling rate, which is the subject of ongoing investigation; in some cases, higher sampling time may even degrade model performance due to numerical effects [@Ahnert-Abel-2007].
Figure \[fig:lorenz\_update\_scaling\] shows the model fit following the abrupt change, comparing both the abrupt-SINDy method, which uses information about the existing model structure, and the standard SINDy method, which re-identifies the model from scratch following a detected change. In this figure, the model quality is shown as a function of the amount of data collected after the change.
The abrupt-SINDy model is able to identify more accurate models in a very short amount of time, given by $t_{\text{update}}\approx 0.1$. At this point, the standard SINDy method shows comparable error, however for even smaller times, the data are no longer sufficient for the conventional method. Since the adaptive method starts near the optimal solution, larger data sets do not degrade the model, which was an unexpected additional advantage.
Figure \[fig:lorenz\_noise\] explores the effect of additive noise on the derivative on the abrupt-SINDy and standard SINDy algorithms. Note that in practice noise will typically be added to the measurement of ${\mathbf{x}}$, as in the original SINDy algorithm [@Brunton2016pnas], requiring a denoising derivative [@Ahnert-Abel-2007; @Chartrand2011isrnam]; however, simple additive noise on the derivative is useful to investigate the robustness of the regression procedure. Abrupt-SINDy has considerably higher noise tolerance than the standard algorithm, as it must identify fewer unknown coefficients. In fact, it is able to handle approximately an order of magnitude more noise before failing to identify a model. Generally, increasing the volume of data collection improves the model. The critical point in the abrupt-SINDy curves corresponds to when small but dynamically important terms are mis-identified as a result of insufficient signal-to-noise. Although the noise and chaotic signal cannot be easily distinguished for small signal-to-noise, it may be possible to distinguish between them using a spectral analysis, since chaos yields red noise in contrast to the white additive noise.
![Lorenz system: We show the model accuracy versus the amount of data used to update (blue $\times$) or re-fit (orange dot) respectively. Data is collected from in the interval $[40, 40 + t_{\text{update}}]$ just after the first change of the system dynamics. The number of data points for $t_{\text{update}} =0.1$ are $N=25$, for $t_{\text{update}} =10$ we have 2500 points. At $t_{\text{update}} \simeq 1$, updating and re-fitting methods become comparable. However, for smaller update times, or less data, respectively, the fraction of transient data becomes too small for identifying the exact model from scratch. Updating the model needs less data for the same accuracy or achieves higher accuracy with the same amount of data.[]{data-label="fig:lorenz_update_scaling"}](figures_noise_no_noise_comparison){width="\columnwidth"}
![Lorenz system: We show the noise robustness of model accuracy. In A) we use the previous knowledge and update the model; in B) we make a new fit only re-using the previously discovered hyper-parameters. The curves are parametrized by $t_{\text{update}}$, c.f. Fig. \[fig:lorenz\_update\_scaling\]. The accuracy measure is very noise sensitive, as distinction between library functions gets lost. At a signal to noise ration of approximately $1$, no accurate model can be obtained with either model. At lower noise ratios, updating the model achieves higher accuracy (the library is smaller). In both cases, accuracy scales approximately logarithmically with $t_{\text{update}}$.[]{data-label="fig:lorenz_noise"}](figures_noise_sigma_vs_error){width="\columnwidth"}
Van der Pol
-----------
As a second example, we consider the famous nonlinear Van der Pol oscillator [@van1920theory]. We include additional quadratic nonlinearities $\alpha x^2$ and $\alpha y^2$ to study the ability of our method to capture structural changes when these terms are added and removed abruptly. This example focuses on the important class of periodic phenomena, in contrast to the chaotic Lorenz dynamics. The modified Van der Pol oscillator is described by the following equations: $$\begin{aligned}
\dot{x} &= y - \alpha y^2 \\
\dot{y} &= \mu (1 - x^2)y - x + \alpha x^2\;,\\
\end{aligned}$$ where $\mu > 0$ is a parameter controlling the nonlinear damping, and $\alpha$ parameterizes the additional quadratic nonlinearity. The reference data set is shown in Fig. \[fig:vdp\], with $\mu=7.5$ and $\alpha=0$ for $t \in [0, 100]$, which results in a canonical periodic orbit. At $t=100$ we introduce a structural change, switching on the quadratic nonlinearity ($\alpha = -0.25$), and driving the system to a stable fixed point. We also modify the parameter $\mu$, setting it to $\mu=6.0$. Finally, at $t=200$, we switch off the additional nonlinearity ($\alpha = 0$) and keep $\mu = 6$.
![Van der Pol system with parameters $\mu=5, \alpha=0$ (blue), $\mu=7.5, \alpha=-0.25$ (orange), $\mu=6.0, \alpha=0$ (green). **A**: time evolution of the $y$-coordinate. **B** phase-space-trajectory $x, y$.[]{data-label="fig:vdp"}](figures_vanderpol_traj_phase){width="\columnwidth"}
Table \[tab:vdp\] shows the corresponding models recovered using the abrupt-SINDy method. The change is detected using the Lyapunov time defined in Eq. , as shown in Fig. \[fig:vdp\_error\_horizon\]. Again, the estimated Lyapunov time (Fig. \[fig:vdp\_error\_horizon\] **B**) captures the the changes in the model, which correspond to peaks in structural model error (Fig. \[fig:vdp\_error\_horizon\] **A**). While the first and third stage are indeed identified correctly, the term $-1.25 x$ is preferred over $-x - 0.25x^2$ in the sparse estimate for $\dot{y}$ in the orange trajectory. However, since both terms look similar near the fixed point at $x \sim 1$, this describes the dynamics well. This type of mis-identification often occurs in data mining when features are highly correlated [@Li2016] and is more related to sparse regression in general than the proposed abrupt-SINDy. For dynamic system identification, the correct nonlinearity could be resolved by obtaining more transient data, i.e. by perturbing the system through actuation. However, this model may be sufficient for control while a more accurate model is identified.
![Van der Pol system: Evaluation of Eq. . Parameters: $t_{\text{model}}= 20, t_{\text{update}}=10, t_{\text{error}}=1, \Delta x= 1.5$.[]{data-label="fig:vdp_error_horizon"}](figures_vanderpol_error_horizon){width="\columnwidth"}
$t_{\text{detected}}$ $t_{\text{update}}$ Equations
----------------------- --------------------- --------------------------------------------------------------------------------------------
0.00 20.01 $\begin{aligned}\dot{x} & = 1.0y\\\dot{y} & = -1.0x+4.99y-4.99x^2y\end{aligned}$
106.39 116.00 $\begin{aligned}\dot{x} & = 0.99y+0.25y^2\\\dot{y} & = -1.26x+7.46y-7.46x^2y\end{aligned}$
200.12 210.00 $\begin{aligned}\dot{x} & = 1.0y\\\dot{y} & = -1.0x+5.98y-5.98x^2y\end{aligned}$
: Van der Pol system: Summary of the discovered equations. Coefficients are rounded to the second digit.[]{data-label="tab:vdp"}
Conclusions
===========
In this work, we develop an adaptive nonlinear system identification strategy designed to rapidly recover nonlinear models from limited data following an abrupt change to the system dynamics. The sparse identification of nonlinear dynamics (SINDy) framework is ideal for change detection and model recovery, as it relies on parsimony to select the fewest active terms required to model the dynamics. In our adaptive abrupt-SINDy method, we rely on previously identified models to identify the fewest *changes* required to recover the model. This modified algorithm is shown to be highly effective at model recovery following an abrupt change, requiring less data, less computation time, and having improved noise robustness over identifying a new model from scratch. The abrupt-SINDy method is demonstrated on several numerical examples exhibiting chaotic dynamics and periodic dynamics, as well as parametric and structural changes, enabling real-time model recovery.
There are limitations of the method which can be addressed by several promising directions that may be pursued to improve the abrupt-SINDy method:
1. **Fallback models:** In the current implementation, after a change has been detected, the old model will be used until enough data is collected to identify a new model. The dynamic mode decomposition [@Kutz2016book] provides an alternative fallback model, that may be identified rapidly with even less data. Additionally, instead of relying on a sparse update to the current model, it is sensible to also maintain a library of past models for rapid characterization [@Brunton2014siads].
2. **Hyperparameterization:** In the initial prototype, the hyper-parameters $\Delta_x$ and $t_{\text{update}}$ are fixed. Over time, an improved algorithm may learn and adapt optimal hyper-parameters.
3. **Comprehensive Lyapunov time estimation:** According to Eq., the Lyapunov time $T(t | \Delta {\bf x})$ is estimated for a fixed $\Delta {\bf x}$. Estimating the time for a range of values, i.e. $\Delta {\bf x} \in (0, \Delta {\bf x}_{\max}]$, will be more robust and may provide a richer analysis without requiring additional data. Further investigation must be made into the case of chaotic systems, where the numerical calculation of the Lyapunov exponent may fail to reveal divergence due to the fact of simple averaging over time. Because of the importance of the detection of model divergence, this is a particularly important area of future research.
4. **Advanced optimization and objectives:** Looking forward, advanced optimization techniques may be used to further improve the adaptation to system changes. Depending on the system, other objectives may be optimized, either by including regularization or in a multi-objective optimization.
The proposed abrupt-SINDy framework is promising for the real-time recovery of nonlinear models following abrupt changes. It will be interesting to compare with other recent algorithms that learn local dynamics for control in response to abrupt changes [@Ornik2017arxiv]. Future work will be required to demonstrate this method on more sophisticated engineering problems and to incorporate it in controllers. To understand the limitations for practical use, many further studies are needed, it will be particularly useful to test this method on a real experiment. The abrupt-SINDy modeling framework may also help inform current rapid learning strategies in neural network architectures [@fei2006one; @vinyals2016matching; @delahunt2018putting], potentially allowing dynamical systems methods to inform rapid training paradigms in deep learning.
Acknowledgements {#acknowledgements .unnumbered}
================
MQ was supported by a fellowship within the FITweltweit program of the German Academic Exchange Service (DAAD). MQ and MA acknowledge support by the European Erasmus SME/HPC project (588372-EPP-1-2017-1-IE-EPPKA2-KA). SLB acknowledges support from the ARO and AFOSR Young Investigator Programs (ARO W911NF-17-1-0422 and AFOSR FA9550-18-1-0200). SLB and JNK acknowledge support from DARPA (HR0011-16-C-0016). We would like to thank the anonymous reviewers for their comments which helped to improve this manuscript. We also acknowledge valuable discussions related to abrupt model recovery and programming wisdom with Dennis Bernstein, Karthik Duraisamy, Thomas Isele, Eurika Kaiser, and Hod Lipson.
References {#references .unnumbered}
==========
[^1]: The user manual is located at <http://scikit-learn.org/stable/modules/generated/sklearn.model_selection.GridSearchCV.html>.
|
Hong Kong: Indian property prices are likely to fall by a one-fourth in the coming year as the global economic crisis saps home buyer confidence, adding to the problems of capital-strapped developers.
A property market boom has been waning for a year, with land prices already falling about 15% from a mid-2007 peak, although forced sales have been rare.
But consultants and investors at the MIPIM Asia conference in Hong Kong this week have predicted tougher times ahead.
“We’re expecting a horrible 2009," said Anshul Jain, chief executive for property services firm DTZ in India. “Prices have already shown signs of coming off, and chinks in the armour are surfacing."
Indian property prices doubled in the two years after the country eased rules in early 2005 on inward investment in the construction industry, sparking interest in home-building among foreign funds. Developers, sometimes in league with funds run by the likes of Morgan Stanley, Citigroup Inc., and Merrill Lynch and Co., snapped up land.
The bigger firms, such as DLF Ltd and Parsvnath Developers Ltd, launched huge initial public offerings to fund new townships in a country where little housing had been built for 50 years.
But the sharp rise in prices, coupled with interest rate hikes designed to calm inflation in the booming economy, slowed home sales. And the crisis has added to the gloom, with residential transactions down by half from a year ago.
“We could see a 20-25% price correction," said Anurag Mathur, joint India managing director at consultants Cushman and Wakefield.
The global credit crunch and a stock market slump cut off the supply of funds from the capital markets. And now a drop in home sales is shrinking cash flow.
Also, foreign investors, with their own economic worries at home and bargains popping up elsewhere, are unlikely now to jump into a market muddied by red tape, land disputes and unclear titles. |
Reviews
3
repeat clients
5 Reviews
Shannon L.
August 16, 2017
Verified Stay
I could not be more pleased with Faith's service and care to my boys! I have 2 German Shepherds and her and her family welcomed them with open arms and gave them so much love during their stay. Both of my dogs were so at ease and one has anxiety being nervous around new people and situations, so this made me feel good from the beginning!! I always felt comfortable and she kept me updated ...
I could not be more pleased with Faith's service and care to my boys! I have 2 German Shepherds and her and her family welcomed them with open arms and gave them so much love during their stay. Both of my dogs were so at ease and one has anxiety being nervous around new people and situations, so this made me feel good from the beginning!! I always felt comfortable and she kept me updated with their days and pictures!! After bringing them back home I know they missed the love they got from their new friends!!
Faith B.
Michael B.
July 18, 2017
Verified Stay
Faith always arrived promptly each day and our two dogs really liked her visits and walks. They looked forward to her coming and they miss her already. My husband and I and our two dogs would recommend Faith to anyone. She is great and very dependable.
Faith B.
Kelli A.
July 13, 2017
Verified Stay
Faith did an amazing job. Cujo had never stayed at a non family members house before and she made him feel comfortable and he seemed at home when we picked him up. Thank you so much.
Faith B.
Faith's Canine Clients
50%
of clients received photo updates
About Faith
15
years of experience
Dogs are the center of my world
I'm 18 years old and home for the summer from college. I do not currently have any dogs (Our last dog died in November of 2016) but plan to the second that the opportunity presents itself! This is the first time that I have ever lived without dogs and it is a foreign feeling. My family has owned up to 5 large dogs at one time. I have always been the one to take care ...
I'm 18 years old and home for the summer from college. I do not currently have any dogs (Our last dog died in November of 2016) but plan to the second that the opportunity presents itself! This is the first time that I have ever lived without dogs and it is a foreign feeling. My family has owned up to 5 large dogs at one time. I have always been the one to take care of the pets. Having dogs who had many medical problems I've learned to be extremely patient when it come to taking care of the doggos. I do not have any job, so I am free 24/7 most of the time. When no one needs help with dogs, I will be home improving my skills as an animation student for next year!
About Faith's Home
Lives in a House
Non-Smoking Household
No Children Present
Has a Fenced Yard
Has No Dogs
When Faith watches your dog
In Faith's Home
Dogs Allowed On Bed
Potty Breaks Every 0-2 Hours
Dogs Allowed On Furniture
In Your Home
Potty Breaks Every 0-2 Hours
Faith's
Neighborhood
At Rover, we're dedicated to giving your pet the best possible care. To help keep your pet happy and healthy, all stays and services booked on Rover receive premium insurance. You can enjoy peace of mind knowing that if your dog becomes ill and needs to see a veterinarian, that care will be covered.
24/7 Customer Support
You can travel worry-free knowing that in the event of an emergency, Rover's customer support team will be available to assist you and your sitter, 24 hours a day, 7 days a week.
Reservation Guarantee
In the unlikely event your sitter can't care for your pet, Rover will make it right. We'll do everything we can to find a replacement, so you can focus on your trip! |