text
stringlengths 8
5.77M
|
|---|
Mitochondrial Ca²⁺ uptake induces cyclic AMP generation in the matrix and modulates organelle ATP levels.
While the role of mitochondrial Ca²⁺ homeostasis in cell pathophysiology is widely accepted, the possibility that cAMP regulates mitochondrial functions has only recently received experimental support. The site of cAMP production, its targets, and its functions in the organelles remain uncertain. Using a variety of genetic/pharmacological tools, we here demonstrate that the mitochondrial inner membrane is impermeable to cytosolic cAMP, while an autonomous cAMP signaling toolkit is expressed in the matrix. We demonstrate that rises in matrix Ca²⁺ powerfully stimulate cAMP increases within mitochondria and that matrix cAMP levels regulate their ATP synthesizing efficiency. In cardiomyocyte cultures, mitochondrial cAMP can be increased by treatments that augment the frequency and amplitude of Ca²⁺ oscillations within the cytosol and organelles, revealing that mitochondria can integrate an oscillatory Ca²⁺ signal to increase cAMP in their matrix. The present data reveal the existence, within mitochondria, of a hitherto unknown crosstalk between Ca²⁺ and cAMP.
|
To make your wedding look as beautiful as possible,Luxurious Wedding brings youLuxurious Wedding Accessories designed for the bride who values something beyond the traditional while becoming a family heirloom in the future.
This year Luxurious Wedding will take you on a journey to discover unique wedding and home accessories plus private and exclusive villas around the world for a wedding or an escape.
Come back and visit us daily as new items and locations are revealed.
All the resources on Luxurious Wedding are extremely accomplished and have the unique style we know you will appreciate.
Wishing you love and happiness now and forever,
Adrienne Meredith
Publisher
The gowns featured on our banner are designed by and pay tribute to Lazaro 2014 Fall Bridal Collection.
Luxurious Wedding offers international luxury weddings and resources in an international luxury online wedding magazine dedicated to providing couture luxury and luxurious wedding planning ideas, trends and resources. Our content includes information in the following categories:
|
INTRODUCTION
============
The Breslow depth is one of the most important prognostic factors with regard to the 5-year survival rate in melanoma. Staging of melanoma requires sentinel lymph node biopsy (SLNB), which is indicated for intermediate thickness melanomas defined as a Breslow depth greater than 1.0 mm.^[@R1]^ However, this recommendation is in an evolution as studies have demonstrated in high-risk lesions that SLNB should be performed for Breslow depth greater than 0.75 mm, especially those with adverse features such as positive deep margins, ulceration, mitosis, lymphovascular invasion or young age.^[@R2],[@R3]^ SLNB with completion lymph node dissection for intermediate thickness melanomas has not been demonstrated to improve 10-year disease-specific survival rates compared with observation; however, it has shown to be statistically significant in increasing disease-free survival.^[@R4],[@R5]^
The evolution of the SLNB has grown from the use of vital blue dyes such as methylene blue (MB), isosulfan blue (Lymphazurin) and Patent Blue V dye, to lymphoscintigraphy using technetium-99m (Tc-99m) as a marker of the sentinel lymph node. Often, a combined technique using radioisotopes and blue dye are used. Anaphylactic reactions and serotonin syndrome associated with the use of vital blue dyes have been reported in the literature.^[@R6]--[@R9]^ Lymphoscintigraphy remains the gold standard in the identification of sentinel lymph nodes in melanoma. Although this method leads to accurate sentinel lymph node identification, the cost and burden to patients undergoing preoperative lymphoscintigraphy can be a challenge, and SLNB positivity can depend on hospital quality.^[@R10]^ For patients undergoing lymphoscintigraphy, the patient must undergo a preoperative injection of Tc-99m before the localization procedure. In addition to this prior injection, patients may face long wait times, delays, and additional emotional stress.
The use of indocyanine green (ICG) has emerged as a powerful tool in the assessment of sentinel lymph nodes.^[@R11],[@R12]^ ICG is a small substance near-infrared fluorophore (774.96 Da), which can be visualized transcutaneously to 1.0 cm. However, it contains sodium iodide, which limits its use in patients with iodine or shellfish allergies. ICG can be used in conjunction with intraoperative imaging modalities such as the SPY Elite system (Novadaq, Mississigua, Canada) and Hamamatsu PDE-Neo probe (Mitaka USA, Park City, Utah). The use of these systems has expanded from their use in flap viability assessment to identification of sentinel lymph nodes.^[@R13]--[@R16]^ We aim to show that the use of these systems is a valuable tool as a clinically safe and effective means of sentinel lymph node identification and compare the clinical efficacy and costs of the 2 systems.
METHODS
=======
This study was exempt from Institutional Review Board review. This case series included 14 patients who underwent SLNB at our institution without the use of preoperative injection of Tc-99m. An intraoperative injection of ICG was performed around the tumor bed. Intraoperative injection of Tc-99m was used to control for the identification of the sentinel lymph nodes by using a standard gamma probe detection device. ICG-assisted SLNB was performed using either the SPY elite system (Novadaq) or the Hamamatsu PDE-Neo probe (Mitaka USA). Then, we performed a financial analysis to compare the costs of each operating system, which were obtained from the manufacturer.
RESULTS
=======
Our case series involved 14 patients who underwent SLNB in conjunction with ICG. The SPY elite system was used for 5 cases, and the Hamamatsu PDE-Neo probe for the remaining 9 patients (Figs. [1](#F1){ref-type="fig"}--[3](#F3){ref-type="fig"}). All cases correctly identified the sentinel lymph node with no complications of the procedure. This was confirmed by concomitant Tc-99m injection. In certain cases, it was possible to visualize the course of the dye beneath the skin, one involving a digital adenocarcinoma of the thumb and 2 involving cutaneous melanomas of the thigh.
{#F1}
{#F2}
{#F3}
Costs of each operating system used at our institution are shown in Table [1](#T1){ref-type="table"}. The cost of the SPY elite system totaled \$275,275 with a recurring cost of \$275 for the ICG and sterile drape. The cost of the Mitaka Hamamatsu PDE-Neo probe totaled \$76,805 with a recurring cost of \$105 for the ICG and sterile drape. Owing to the differences in size of the systems involved, the Mitaka Hamamatsu PDE-Neo probe (in the senior author's experience) offered greater ease of use in the operating room.
######
Comparison of Costs Obtained from Manufacturers for the 2 Systems Used in Conjunction with ICG for SLNB
DISCUSSION
==========
The early use of ICG was centered around calculating liver remnant volume after hepatectomy.^[@R17]^ As the use of ICG has expanded, it has most notably been used in plastic surgery as a tool to assess intraoperative flap perfusion and viability.^[@R18],[@R19]^ Multiple studies have outlined the positive outcomes associated with using ICG-assisted imaging for SLNB in breast cancer and the better outcomes of decreased surgical-site occurrences.^[@R12],[@R20]--[@R22]^
The use of ICG for SLNB remains an underexplored but promising area in melanomas.^[@R23]^ The application of this technique to patients with melanoma was first described in an article by Korn et al.^[@R24]^ This retrospective review compared a total of 90 cutaneous melanoma patients in 2 cohorts who either received SLNB with the traditional blue dye and radioisotope or received SLNB with a radioisotope and the ICG Spy Elite system. Results demonstrated a statistically significant difference in SLN localization using either the ICG fluorescence or the radioisotope/handheld gamma probe method (98.0% and 97.8%, respectively) compared with the localization rate of 79.4% with the blue dye method. Furthermore, there was a trend toward a reduction in surgery length in the ICG cohort.^[@R24]^ Other studies have confirmed the utility of ICG for SLNB in cutaneous melanoma and the identification of lymph nodes undetected by traditional radioisotope or blue dye techniques.^[@R14]--[@R16]^
Our study demonstrated the comparable effectiveness of using the SPY Elite or the Mitaka Hamamatsu PDE-Neo probe system with ICG in correctly identifying all sentinel lymph nodes in our cohort of patients. The lower cost and mobility offered by the Hamamatsu probe makes it the more advantageous system in SLNB. Despite the success of the ICG for SLNB, the limited data make it difficult to recommend its use in lieu of traditional, radioisotope-based lymphoscintigraphy; however, it does offer clinical benefits as an adjuvant technique to identify otherwise missed lymph nodes.
The SPY Elite system and the Hamamatsu PDE Neo probe are systems that can utilize ICG in the identification of sentinel lymph nodes. The SPY Elite system allows surgeons to control the camera and screen intraoperatively. Images can be saved and reviewed during the case; however, limitations to this technology include its large size as well as the need to purchase the ICG/Drape exclusively from Novadaq. Conversely, the Hamamatsu PDE is a small hand-held device with an additional CPU unit, which makes it freely moveable with handheld adjustments for color versus black/white options. Additions to the device can be bought independently. Therefore, given the comparable success rates between the 2 systems in identifying sentinel lymph nodes, the mobility and cost-effectiveness offered by the Hamamatsu PDE probe make it the more advantageous system.
There are inherent limitations with our study, given the small study size and the single surgeon experience. Further studies are necessary to more clearly delineate the role of ICG in SLNB for melanoma. We cannot recommend the use of ICG alone in SLNB, but believe that it can serve as a useful adjunct to existing methods such as vital blue dyes and radiotracers. The clinical utility of ICG stems from its usefulness as an intraoperative tool in the open identification of sentinel lymph nodes. Given the visibility of the fluorescent dye in 3 cases without the use of infrared light, the degree of skin thickness in individual cases can allow for additional uses of ICG. Furthermore, Tc-99m uptake in sentinel lymph nodes was observed to occur more rapidly than uptake of ICG, suggesting that the 2 modalities used in conjunction may increase the sensitivity of localizing sentinel lymph nodes in cutaneous melanoma.
CONCLUSIONS
===========
ICG-assisted SLNB using the SPY Elite or the Hamamatsu PDE-Neo probe systems are safe and effective methods for the identification of sentinel lymph nodes. In our experience, the Hamamatsu PDE-Neo probe system is a more user friendly and cost-effective method compared with the SPY Elite system.
**Disclosure:** The authors have no financial interest to declare in relation to the content of this article. The Article Processing Charge was paid for by the authors.
|
INDIANAPOLIS (AP) — The Indiana Natural Resources Commission has turned away contentious proposals to create a bobcat hunting season and requiring the killing of captured raccoons, coyotes and opossums.
Indiana Department of Natural Resources Director Cameron Clark moved to withdraw the proposals when the commission met Tuesday, and the panel adopted the motions unanimously, eliciting applause from nearly 100 people attending the meeting.
Clark said, "We have heard from you. We appreciate the interest. We do feel as though we probably need to work more with our constituencies on sensitive rules like this."
A nuisance animal proposal would have required animal control workers to kill captured raccoons, opossums or coyotes.
More than 200 people attended public meetings about the proposals and more than 2,000 comments were submitted online, mostly opposing them.
|
Recent evolution of antibiotic resistance in the anaerobes as compared to previous decades.
Evolution of antibiotic resistance in the anaerobes was reviewed using recent data covering 2000-2013 as compared to previous years. All studies reported growing moxifloxacin resistance in Bacteroides/Parabacteroides spp. in Europe and USA and in Clostridium difficile in Europe. In half or more studies, the resistance rates in Bacteroides/Parabacteroides spp. to amoxicillin-clavulanate or ampicillin-sulbactam and clindamycin rose. In some studies, an increase in resistance was found in Bacteroides/Parabacteroides spp. to cefoxitin/cefotetan and carbapenems, in Prevotella spp. to penicillins, in anaerobic cocci to clindamycin and in Bacteroides/Parabacteroides spp. and C. difficile to metronidazole. Decreasing resistance was also observed, e.g. in Bacteroides/Parabacteroides spp. to cephalosporins, in Prevotella spp. and C. difficile to tetracyclines and in C. difficile to rifampin. No resistance changes were found to tigecycline, in Bacteroides/Parabacteroides spp. to chloramphenicol and in C. difficile to vancomycin. Factors influencing the resistance were the species, ribotype, country, hospital centre, antibiotic consumption and specimen type. In conclusion, the antibiotic resistance changes in the anaerobes are diverse and dynamic. Regular national surveys of resistance and both anaerobic microbiology and susceptibility testing of the isolates become more and more valuable.
|
‘Make friends with dishonest wealth’
By Fr. ROY CIMAGALA, [email protected] 2, 2018
VERY intriguing words of Christ, indeed! (cfr Lk 16,9) We need to go slow, keeping a good grip on our reflex reaction, to know what Christ really meant by them. Otherwise, we can easily misinterpret these divine words.
To be sure, Christ did not say that we should generate our wealth in a dishonest way. “No servant can serve two masters,” he said. “You cannot serve God and mammon.” We should avoid dishonesty.
What Christ really wanted to say was that since we cannot avoid dishonest wealth given our wounded and sinful condition that often leads us to be dishonest, we just have to make sure that we use that dishonest wealth properly while trying to eliminate dishonesty wherever it is found.
In another part of the gospel, he already warned his apostles, and us, about the naked reality of our life in this world. “I am sending you out like sheep among wolves. Therefore be as shrewd as snakes and as innocent as doves.” (Mt 10,16) In short, we have to learn to deal with this condition. We are not yet in Paradise.
Christ wants us to know how to cope with this ugly condition of our life here on earth, and even convert it into something that is good, purifying and redeeming. What usually happens is that the so-called “good people,” or those who want to follow Christ or who want to be holy, get so idealistic that they would be at a loss as to how to deal with the ugly reality of our earthly sojourn.
Thus, he made this reproach: “The sons of this age are more shrewd in dealing with their own kind than are the sons of light.” (Lk 16,8) These words were spoken after Christ in a parable commended the shrewd manager who made some arrangements after he was given notice of being fired.
Of course, using dishonest wealth properly can be done in many ways. One could be that it has to be returned to where that wealth rightfully comes from. If that is not possible anymore for one reason or another, then it can be used to atone or to make up for whatever damage the dishonest way of acquiring may have caused.
Thus, in that episode of Christ meeting the rich chief tax collector Zaccheus, Christ again commended the rich man for what the tax collector did with those whom he may have cheated. (cfr Lk 19,1-10)
“Lord, I give half of my possessions to the poor, and if I have cheated anybody out of anything, I will pay back four times the amount,” said Zaccheus. And Christ answered: “Today salvation has come to this house, because this man, too, is a son of Abraham. For the Son of Man came to seek and to save the lost.” (Lk 19,8-10)
Or that dishonest wealth can be used to do some good or to promote the common good of society. In all of this, we should try our best to undo any practice, system, structure, culture or lifestyle that generates this dishonest wealth.
We have to be realistic in dealing with the actual realities of our life. This does not mean that we have to make compromises in our morality. In fact, given the unavoidable unpleasant things in life, we have to be most clear and sharp in distinguishing between what is good and evil, what is moral and immoral.
Only in this way would we know how to deal with dishonest and sinful practices in this life. It would be good to review the principles to guide us regarding the distinction between formal, that is, intentional cooperation in evil, on one hand, and material cooperation, on the other hand. We need to be experts in the latter, given the facts of life.
|
/*
* Copyright(c) 2005 - 2006 Attansic Corporation. All rights reserved.
* Copyright(c) 2006 Chris Snook <[email protected]>
* Copyright(c) 2006 Jay Cliburn <[email protected]>
*
* Derived from Intel e1000 driver
* Copyright(c) 1999 - 2005 Intel Corporation. All rights reserved.
*
* This program is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License as published by the Free
* Software Foundation; either version 2 of the License, or (at your option)
* any later version.
*
* This program is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for
* more details.
*
* You should have received a copy of the GNU General Public License along with
* this program; if not, write to the Free Software Foundation, Inc., 59
* Temple Place - Suite 330, Boston, MA 02111-1307, USA.
*/
#include <linux/types.h>
#include <linux/pci.h>
#include <linux/delay.h>
#include <linux/if_vlan.h>
#include <linux/etherdevice.h>
#include <linux/crc32.h>
#include <asm/byteorder.h>
#include "atl1.h"
/*
* Reset the transmit and receive units; mask and clear all interrupts.
* hw - Struct containing variables accessed by shared code
* return : ATL1_SUCCESS or idle status (if error)
*/
s32 atl1_reset_hw(struct atl1_hw *hw)
{
struct pci_dev *pdev = hw->back->pdev;
u32 icr;
int i;
/*
* Clear Interrupt mask to stop board from generating
* interrupts & Clear any pending interrupt events
*/
/*
* iowrite32(0, hw->hw_addr + REG_IMR);
* iowrite32(0xffffffff, hw->hw_addr + REG_ISR);
*/
/*
* Issue Soft Reset to the MAC. This will reset the chip's
* transmit, receive, DMA. It will not effect
* the current PCI configuration. The global reset bit is self-
* clearing, and should clear within a microsecond.
*/
iowrite32(MASTER_CTRL_SOFT_RST, hw->hw_addr + REG_MASTER_CTRL);
ioread32(hw->hw_addr + REG_MASTER_CTRL);
iowrite16(1, hw->hw_addr + REG_GPHY_ENABLE);
ioread16(hw->hw_addr + REG_GPHY_ENABLE);
msleep(1); /* delay about 1ms */
/* Wait at least 10ms for All module to be Idle */
for (i = 0; i < 10; i++) {
icr = ioread32(hw->hw_addr + REG_IDLE_STATUS);
if (!icr)
break;
msleep(1); /* delay 1 ms */
cpu_relax(); /* FIXME: is this still the right way to do this? */
}
if (icr) {
dev_dbg(&pdev->dev, "ICR = 0x%x\n", icr);
return icr;
}
return ATL1_SUCCESS;
}
/* function about EEPROM
*
* check_eeprom_exist
* return 0 if eeprom exist
*/
static int atl1_check_eeprom_exist(struct atl1_hw *hw)
{
u32 value;
value = ioread32(hw->hw_addr + REG_SPI_FLASH_CTRL);
if (value & SPI_FLASH_CTRL_EN_VPD) {
value &= ~SPI_FLASH_CTRL_EN_VPD;
iowrite32(value, hw->hw_addr + REG_SPI_FLASH_CTRL);
}
value = ioread16(hw->hw_addr + REG_PCIE_CAP_LIST);
return ((value & 0xFF00) == 0x6C00) ? 0 : 1;
}
static bool atl1_read_eeprom(struct atl1_hw *hw, u32 offset, u32 *p_value)
{
int i;
u32 control;
if (offset & 3)
return false; /* address do not align */
iowrite32(0, hw->hw_addr + REG_VPD_DATA);
control = (offset & VPD_CAP_VPD_ADDR_MASK) << VPD_CAP_VPD_ADDR_SHIFT;
iowrite32(control, hw->hw_addr + REG_VPD_CAP);
ioread32(hw->hw_addr + REG_VPD_CAP);
for (i = 0; i < 10; i++) {
msleep(2);
control = ioread32(hw->hw_addr + REG_VPD_CAP);
if (control & VPD_CAP_VPD_FLAG)
break;
}
if (control & VPD_CAP_VPD_FLAG) {
*p_value = ioread32(hw->hw_addr + REG_VPD_DATA);
return true;
}
return false; /* timeout */
}
/*
* Reads the value from a PHY register
* hw - Struct containing variables accessed by shared code
* reg_addr - address of the PHY register to read
*/
s32 atl1_read_phy_reg(struct atl1_hw *hw, u16 reg_addr, u16 *phy_data)
{
u32 val;
int i;
val = ((u32) (reg_addr & MDIO_REG_ADDR_MASK)) << MDIO_REG_ADDR_SHIFT |
MDIO_START | MDIO_SUP_PREAMBLE | MDIO_RW | MDIO_CLK_25_4 <<
MDIO_CLK_SEL_SHIFT;
iowrite32(val, hw->hw_addr + REG_MDIO_CTRL);
ioread32(hw->hw_addr + REG_MDIO_CTRL);
for (i = 0; i < MDIO_WAIT_TIMES; i++) {
udelay(2);
val = ioread32(hw->hw_addr + REG_MDIO_CTRL);
if (!(val & (MDIO_START | MDIO_BUSY)))
break;
}
if (!(val & (MDIO_START | MDIO_BUSY))) {
*phy_data = (u16) val;
return ATL1_SUCCESS;
}
return ATL1_ERR_PHY;
}
#define CUSTOM_SPI_CS_SETUP 2
#define CUSTOM_SPI_CLK_HI 2
#define CUSTOM_SPI_CLK_LO 2
#define CUSTOM_SPI_CS_HOLD 2
#define CUSTOM_SPI_CS_HI 3
static bool atl1_spi_read(struct atl1_hw *hw, u32 addr, u32 *buf)
{
int i;
u32 value;
iowrite32(0, hw->hw_addr + REG_SPI_DATA);
iowrite32(addr, hw->hw_addr + REG_SPI_ADDR);
value = SPI_FLASH_CTRL_WAIT_READY |
(CUSTOM_SPI_CS_SETUP & SPI_FLASH_CTRL_CS_SETUP_MASK) <<
SPI_FLASH_CTRL_CS_SETUP_SHIFT | (CUSTOM_SPI_CLK_HI &
SPI_FLASH_CTRL_CLK_HI_MASK) <<
SPI_FLASH_CTRL_CLK_HI_SHIFT | (CUSTOM_SPI_CLK_LO &
SPI_FLASH_CTRL_CLK_LO_MASK) <<
SPI_FLASH_CTRL_CLK_LO_SHIFT | (CUSTOM_SPI_CS_HOLD &
SPI_FLASH_CTRL_CS_HOLD_MASK) <<
SPI_FLASH_CTRL_CS_HOLD_SHIFT | (CUSTOM_SPI_CS_HI &
SPI_FLASH_CTRL_CS_HI_MASK) <<
SPI_FLASH_CTRL_CS_HI_SHIFT | (1 & SPI_FLASH_CTRL_INS_MASK) <<
SPI_FLASH_CTRL_INS_SHIFT;
iowrite32(value, hw->hw_addr + REG_SPI_FLASH_CTRL);
value |= SPI_FLASH_CTRL_START;
iowrite32(value, hw->hw_addr + REG_SPI_FLASH_CTRL);
ioread32(hw->hw_addr + REG_SPI_FLASH_CTRL);
for (i = 0; i < 10; i++) {
msleep(1); /* 1ms */
value = ioread32(hw->hw_addr + REG_SPI_FLASH_CTRL);
if (!(value & SPI_FLASH_CTRL_START))
break;
}
if (value & SPI_FLASH_CTRL_START)
return false;
*buf = ioread32(hw->hw_addr + REG_SPI_DATA);
return true;
}
/*
* get_permanent_address
* return 0 if get valid mac address,
*/
static int atl1_get_permanent_address(struct atl1_hw *hw)
{
u32 addr[2];
u32 i, control;
u16 reg;
u8 eth_addr[ETH_ALEN];
bool key_valid;
if (is_valid_ether_addr(hw->perm_mac_addr))
return 0;
/* init */
addr[0] = addr[1] = 0;
if (!atl1_check_eeprom_exist(hw)) { /* eeprom exist */
reg = 0;
key_valid = false;
/* Read out all EEPROM content */
i = 0;
while (1) {
if (atl1_read_eeprom(hw, i + 0x100, &control)) {
if (key_valid) {
if (reg == REG_MAC_STA_ADDR)
addr[0] = control;
else if (reg == (REG_MAC_STA_ADDR + 4))
addr[1] = control;
key_valid = false;
} else if ((control & 0xff) == 0x5A) {
key_valid = true;
reg = (u16) (control >> 16);
} else
break; /* assume data end while encount an invalid KEYWORD */
} else
break; /* read error */
i += 4;
}
*(u32 *) ð_addr[2] = swab32(addr[0]);
*(u16 *) ð_addr[0] = swab16(*(u16 *) &addr[1]);
if (is_valid_ether_addr(eth_addr)) {
memcpy(hw->perm_mac_addr, eth_addr, ETH_ALEN);
return 0;
}
return 1;
}
/* see if SPI FLAGS exist ? */
addr[0] = addr[1] = 0;
reg = 0;
key_valid = false;
i = 0;
while (1) {
if (atl1_spi_read(hw, i + 0x1f000, &control)) {
if (key_valid) {
if (reg == REG_MAC_STA_ADDR)
addr[0] = control;
else if (reg == (REG_MAC_STA_ADDR + 4))
addr[1] = control;
key_valid = false;
} else if ((control & 0xff) == 0x5A) {
key_valid = true;
reg = (u16) (control >> 16);
} else
break; /* data end */
} else
break; /* read error */
i += 4;
}
*(u32 *) ð_addr[2] = swab32(addr[0]);
*(u16 *) ð_addr[0] = swab16(*(u16 *) &addr[1]);
if (is_valid_ether_addr(eth_addr)) {
memcpy(hw->perm_mac_addr, eth_addr, ETH_ALEN);
return 0;
}
/*
* On some motherboards, the MAC address is written by the
* BIOS directly to the MAC register during POST, and is
* not stored in eeprom. If all else thus far has failed
* to fetch the permanent MAC address, try reading it directly.
*/
addr[0] = ioread32(hw->hw_addr + REG_MAC_STA_ADDR);
addr[1] = ioread16(hw->hw_addr + (REG_MAC_STA_ADDR + 4));
*(u32 *) ð_addr[2] = swab32(addr[0]);
*(u16 *) ð_addr[0] = swab16(*(u16 *) &addr[1]);
if (is_valid_ether_addr(eth_addr)) {
memcpy(hw->perm_mac_addr, eth_addr, ETH_ALEN);
return 0;
}
return 1;
}
/*
* Reads the adapter's MAC address from the EEPROM
* hw - Struct containing variables accessed by shared code
*/
s32 atl1_read_mac_addr(struct atl1_hw *hw)
{
u16 i;
if (atl1_get_permanent_address(hw))
random_ether_addr(hw->perm_mac_addr);
for (i = 0; i < ETH_ALEN; i++)
hw->mac_addr[i] = hw->perm_mac_addr[i];
return ATL1_SUCCESS;
}
/*
* Hashes an address to determine its location in the multicast table
* hw - Struct containing variables accessed by shared code
* mc_addr - the multicast address to hash
*
* atl1_hash_mc_addr
* purpose
* set hash value for a multicast address
* hash calcu processing :
* 1. calcu 32bit CRC for multicast address
* 2. reverse crc with MSB to LSB
*/
u32 atl1_hash_mc_addr(struct atl1_hw *hw, u8 *mc_addr)
{
u32 crc32, value = 0;
int i;
crc32 = ether_crc_le(6, mc_addr);
for (i = 0; i < 32; i++)
value |= (((crc32 >> i) & 1) << (31 - i));
return value;
}
/*
* Sets the bit in the multicast table corresponding to the hash value.
* hw - Struct containing variables accessed by shared code
* hash_value - Multicast address hash value
*/
void atl1_hash_set(struct atl1_hw *hw, u32 hash_value)
{
u32 hash_bit, hash_reg;
u32 mta;
/*
* The HASH Table is a register array of 2 32-bit registers.
* It is treated like an array of 64 bits. We want to set
* bit BitArray[hash_value]. So we figure out what register
* the bit is in, read it, OR in the new bit, then write
* back the new value. The register is determined by the
* upper 7 bits of the hash value and the bit within that
* register are determined by the lower 5 bits of the value.
*/
hash_reg = (hash_value >> 31) & 0x1;
hash_bit = (hash_value >> 26) & 0x1F;
mta = ioread32((hw->hw_addr + REG_RX_HASH_TABLE) + (hash_reg << 2));
mta |= (1 << hash_bit);
iowrite32(mta, (hw->hw_addr + REG_RX_HASH_TABLE) + (hash_reg << 2));
}
/*
* Writes a value to a PHY register
* hw - Struct containing variables accessed by shared code
* reg_addr - address of the PHY register to write
* data - data to write to the PHY
*/
s32 atl1_write_phy_reg(struct atl1_hw *hw, u32 reg_addr, u16 phy_data)
{
int i;
u32 val;
val = ((u32) (phy_data & MDIO_DATA_MASK)) << MDIO_DATA_SHIFT |
(reg_addr & MDIO_REG_ADDR_MASK) << MDIO_REG_ADDR_SHIFT |
MDIO_SUP_PREAMBLE |
MDIO_START | MDIO_CLK_25_4 << MDIO_CLK_SEL_SHIFT;
iowrite32(val, hw->hw_addr + REG_MDIO_CTRL);
ioread32(hw->hw_addr + REG_MDIO_CTRL);
for (i = 0; i < MDIO_WAIT_TIMES; i++) {
udelay(2);
val = ioread32(hw->hw_addr + REG_MDIO_CTRL);
if (!(val & (MDIO_START | MDIO_BUSY)))
break;
}
if (!(val & (MDIO_START | MDIO_BUSY)))
return ATL1_SUCCESS;
return ATL1_ERR_PHY;
}
/*
* Make L001's PHY out of Power Saving State (bug)
* hw - Struct containing variables accessed by shared code
* when power on, L001's PHY always on Power saving State
* (Gigabit Link forbidden)
*/
static s32 atl1_phy_leave_power_saving(struct atl1_hw *hw)
{
s32 ret;
ret = atl1_write_phy_reg(hw, 29, 0x0029);
if (ret)
return ret;
return atl1_write_phy_reg(hw, 30, 0);
}
/*
*TODO: do something or get rid of this
*/
s32 atl1_phy_enter_power_saving(struct atl1_hw *hw)
{
/* s32 ret_val;
* u16 phy_data;
*/
/*
ret_val = atl1_write_phy_reg(hw, ...);
ret_val = atl1_write_phy_reg(hw, ...);
....
*/
return ATL1_SUCCESS;
}
/*
* Resets the PHY and make all config validate
* hw - Struct containing variables accessed by shared code
*
* Sets bit 15 and 12 of the MII Control regiser (for F001 bug)
*/
static s32 atl1_phy_reset(struct atl1_hw *hw)
{
struct pci_dev *pdev = hw->back->pdev;
s32 ret_val;
u16 phy_data;
if (hw->media_type == MEDIA_TYPE_AUTO_SENSOR ||
hw->media_type == MEDIA_TYPE_1000M_FULL)
phy_data = MII_CR_RESET | MII_CR_AUTO_NEG_EN;
else {
switch (hw->media_type) {
case MEDIA_TYPE_100M_FULL:
phy_data =
MII_CR_FULL_DUPLEX | MII_CR_SPEED_100 |
MII_CR_RESET;
break;
case MEDIA_TYPE_100M_HALF:
phy_data = MII_CR_SPEED_100 | MII_CR_RESET;
break;
case MEDIA_TYPE_10M_FULL:
phy_data =
MII_CR_FULL_DUPLEX | MII_CR_SPEED_10 | MII_CR_RESET;
break;
default: /* MEDIA_TYPE_10M_HALF: */
phy_data = MII_CR_SPEED_10 | MII_CR_RESET;
break;
}
}
ret_val = atl1_write_phy_reg(hw, MII_BMCR, phy_data);
if (ret_val) {
u32 val;
int i;
/* pcie serdes link may be down! */
dev_dbg(&pdev->dev, "pcie phy link down\n");
for (i = 0; i < 25; i++) {
msleep(1);
val = ioread32(hw->hw_addr + REG_MDIO_CTRL);
if (!(val & (MDIO_START | MDIO_BUSY)))
break;
}
if ((val & (MDIO_START | MDIO_BUSY)) != 0) {
dev_warn(&pdev->dev, "pcie link down at least 25ms\n");
return ret_val;
}
}
return ATL1_SUCCESS;
}
/*
* Configures PHY autoneg and flow control advertisement settings
* hw - Struct containing variables accessed by shared code
*/
s32 atl1_phy_setup_autoneg_adv(struct atl1_hw *hw)
{
s32 ret_val;
s16 mii_autoneg_adv_reg;
s16 mii_1000t_ctrl_reg;
/* Read the MII Auto-Neg Advertisement Register (Address 4). */
mii_autoneg_adv_reg = MII_AR_DEFAULT_CAP_MASK;
/* Read the MII 1000Base-T Control Register (Address 9). */
mii_1000t_ctrl_reg = MII_AT001_CR_1000T_DEFAULT_CAP_MASK;
/*
* First we clear all the 10/100 mb speed bits in the Auto-Neg
* Advertisement Register (Address 4) and the 1000 mb speed bits in
* the 1000Base-T Control Register (Address 9).
*/
mii_autoneg_adv_reg &= ~MII_AR_SPEED_MASK;
mii_1000t_ctrl_reg &= ~MII_AT001_CR_1000T_SPEED_MASK;
/*
* Need to parse media_type and set up
* the appropriate PHY registers.
*/
switch (hw->media_type) {
case MEDIA_TYPE_AUTO_SENSOR:
mii_autoneg_adv_reg |= (MII_AR_10T_HD_CAPS |
MII_AR_10T_FD_CAPS |
MII_AR_100TX_HD_CAPS |
MII_AR_100TX_FD_CAPS);
mii_1000t_ctrl_reg |= MII_AT001_CR_1000T_FD_CAPS;
break;
case MEDIA_TYPE_1000M_FULL:
mii_1000t_ctrl_reg |= MII_AT001_CR_1000T_FD_CAPS;
break;
case MEDIA_TYPE_100M_FULL:
mii_autoneg_adv_reg |= MII_AR_100TX_FD_CAPS;
break;
case MEDIA_TYPE_100M_HALF:
mii_autoneg_adv_reg |= MII_AR_100TX_HD_CAPS;
break;
case MEDIA_TYPE_10M_FULL:
mii_autoneg_adv_reg |= MII_AR_10T_FD_CAPS;
break;
default:
mii_autoneg_adv_reg |= MII_AR_10T_HD_CAPS;
break;
}
/* flow control fixed to enable all */
mii_autoneg_adv_reg |= (MII_AR_ASM_DIR | MII_AR_PAUSE);
hw->mii_autoneg_adv_reg = mii_autoneg_adv_reg;
hw->mii_1000t_ctrl_reg = mii_1000t_ctrl_reg;
ret_val = atl1_write_phy_reg(hw, MII_ADVERTISE, mii_autoneg_adv_reg);
if (ret_val)
return ret_val;
ret_val = atl1_write_phy_reg(hw, MII_AT001_CR, mii_1000t_ctrl_reg);
if (ret_val)
return ret_val;
return ATL1_SUCCESS;
}
/*
* Configures link settings.
* hw - Struct containing variables accessed by shared code
* Assumes the hardware has previously been reset and the
* transmitter and receiver are not enabled.
*/
static s32 atl1_setup_link(struct atl1_hw *hw)
{
struct pci_dev *pdev = hw->back->pdev;
s32 ret_val;
/*
* Options:
* PHY will advertise value(s) parsed from
* autoneg_advertised and fc
* no matter what autoneg is , We will not wait link result.
*/
ret_val = atl1_phy_setup_autoneg_adv(hw);
if (ret_val) {
dev_dbg(&pdev->dev, "error setting up autonegotiation\n");
return ret_val;
}
/* SW.Reset , En-Auto-Neg if needed */
ret_val = atl1_phy_reset(hw);
if (ret_val) {
dev_dbg(&pdev->dev, "error resetting phy\n");
return ret_val;
}
hw->phy_configured = true;
return ret_val;
}
static struct atl1_spi_flash_dev flash_table[] = {
/* MFR_NAME WRSR READ PRGM WREN WRDI RDSR RDID SECTOR_ERASE CHIP_ERASE */
{"Atmel", 0x00, 0x03, 0x02, 0x06, 0x04, 0x05, 0x15, 0x52, 0x62},
{"SST", 0x01, 0x03, 0x02, 0x06, 0x04, 0x05, 0x90, 0x20, 0x60},
{"ST", 0x01, 0x03, 0x02, 0x06, 0x04, 0x05, 0xAB, 0xD8, 0xC7},
};
static void atl1_init_flash_opcode(struct atl1_hw *hw)
{
if (hw->flash_vendor >= sizeof(flash_table) / sizeof(flash_table[0]))
hw->flash_vendor = 0; /* ATMEL */
/* Init OP table */
iowrite8(flash_table[hw->flash_vendor].cmd_program,
hw->hw_addr + REG_SPI_FLASH_OP_PROGRAM);
iowrite8(flash_table[hw->flash_vendor].cmd_sector_erase,
hw->hw_addr + REG_SPI_FLASH_OP_SC_ERASE);
iowrite8(flash_table[hw->flash_vendor].cmd_chip_erase,
hw->hw_addr + REG_SPI_FLASH_OP_CHIP_ERASE);
iowrite8(flash_table[hw->flash_vendor].cmd_rdid,
hw->hw_addr + REG_SPI_FLASH_OP_RDID);
iowrite8(flash_table[hw->flash_vendor].cmd_wren,
hw->hw_addr + REG_SPI_FLASH_OP_WREN);
iowrite8(flash_table[hw->flash_vendor].cmd_rdsr,
hw->hw_addr + REG_SPI_FLASH_OP_RDSR);
iowrite8(flash_table[hw->flash_vendor].cmd_wrsr,
hw->hw_addr + REG_SPI_FLASH_OP_WRSR);
iowrite8(flash_table[hw->flash_vendor].cmd_read,
hw->hw_addr + REG_SPI_FLASH_OP_READ);
}
/*
* Performs basic configuration of the adapter.
* hw - Struct containing variables accessed by shared code
* Assumes that the controller has previously been reset and is in a
* post-reset uninitialized state. Initializes multicast table,
* and Calls routines to setup link
* Leaves the transmit and receive units disabled and uninitialized.
*/
s32 atl1_init_hw(struct atl1_hw *hw)
{
u32 ret_val = 0;
/* Zero out the Multicast HASH table */
iowrite32(0, hw->hw_addr + REG_RX_HASH_TABLE);
/* clear the old settings from the multicast hash table */
iowrite32(0, (hw->hw_addr + REG_RX_HASH_TABLE) + (1 << 2));
atl1_init_flash_opcode(hw);
if (!hw->phy_configured) {
/* enable GPHY LinkChange Interrrupt */
ret_val = atl1_write_phy_reg(hw, 18, 0xC00);
if (ret_val)
return ret_val;
/* make PHY out of power-saving state */
ret_val = atl1_phy_leave_power_saving(hw);
if (ret_val)
return ret_val;
/* Call a subroutine to configure the link */
ret_val = atl1_setup_link(hw);
}
return ret_val;
}
/*
* Detects the current speed and duplex settings of the hardware.
* hw - Struct containing variables accessed by shared code
* speed - Speed of the connection
* duplex - Duplex setting of the connection
*/
s32 atl1_get_speed_and_duplex(struct atl1_hw *hw, u16 *speed, u16 *duplex)
{
struct pci_dev *pdev = hw->back->pdev;
s32 ret_val;
u16 phy_data;
/* ; --- Read PHY Specific Status Register (17) */
ret_val = atl1_read_phy_reg(hw, MII_AT001_PSSR, &phy_data);
if (ret_val)
return ret_val;
if (!(phy_data & MII_AT001_PSSR_SPD_DPLX_RESOLVED))
return ATL1_ERR_PHY_RES;
switch (phy_data & MII_AT001_PSSR_SPEED) {
case MII_AT001_PSSR_1000MBS:
*speed = SPEED_1000;
break;
case MII_AT001_PSSR_100MBS:
*speed = SPEED_100;
break;
case MII_AT001_PSSR_10MBS:
*speed = SPEED_10;
break;
default:
dev_dbg(&pdev->dev, "error getting speed\n");
return ATL1_ERR_PHY_SPEED;
break;
}
if (phy_data & MII_AT001_PSSR_DPLX)
*duplex = FULL_DUPLEX;
else
*duplex = HALF_DUPLEX;
return ATL1_SUCCESS;
}
void atl1_set_mac_addr(struct atl1_hw *hw)
{
u32 value;
/*
* 00-0B-6A-F6-00-DC
* 0: 6AF600DC 1: 000B
* low dword
*/
value = (((u32) hw->mac_addr[2]) << 24) |
(((u32) hw->mac_addr[3]) << 16) |
(((u32) hw->mac_addr[4]) << 8) | (((u32) hw->mac_addr[5]));
iowrite32(value, hw->hw_addr + REG_MAC_STA_ADDR);
/* high dword */
value = (((u32) hw->mac_addr[0]) << 8) | (((u32) hw->mac_addr[1]));
iowrite32(value, (hw->hw_addr + REG_MAC_STA_ADDR) + (1 << 2));
}
|
Norelco SensoTouch wet and dry electric razor
User review
(
0
)
Rated 4 out of 5 by bluemog Easy to use and good battery life
First electric shaver in 40+ years and whilst I didn't expect it to give as close a shave as a wet razor it has suprised me. The only area it appears to struggle with is the neck area under the chin where the stubble seems to be resistant to all efforts.
In other areas the shave is smooth and close and is a pleasure to use.
29 October 2013
Rated 4 out of 5 by MickS83 Light but robust
Nice light shaver good shave each time and robust when used any where
But wish had direct mains connection for use outside bathroom
25 July 2012
Awards
Love it or hate it, we want you to rate it!
Recently viewed products
You might be interested in
Discover
MyPhilips
Register for exclusive benefits
Subscribe to our newsletter
Exclusive promotions and coupons
Product launches
Tips and tricks
I would like to receive promotional communications – based on my preferences and behaviour – about Philips products, services, events and promotions. I can easily unsubscribe at any time!
What does this mean?
|
[Correlation of expression of RhoC with invasiveness of breast cancer cells in vitro].
To investigate the expression of RhoC in breast cancer cells with different metastatic potential and its correlation with invasiveness. Expression of RhoC mRNA and protein in human breast cancer cells MCF-7 with low metastatic potential and MDA-MB-231 with high metastatic potential was detected by RT-PCR, Western blot, immunohistochemistry and immunofluorescence staining. Eukaryotic expression plasmids of RhoC were constructed and transfected into MCF-7 cells. The biological effects were observed, including in vitro invasion by Boyden charmber assay, motility by would healing assay, alteration of microfilament network by TRTIC-phalloidin staining and expression of p-Akt by Western blot assay. The expression levels of RhoC mRNA and protein varied in the two different metastatic breast cancer cell lines. RhoC was significantly up-regulated in the highly metastatic cells in comparison to the weakly metastatic counterpart (P < 0.01). As shown by Boyden charmber assay, the invasive capacity of transfected cells overexpressing RhoC was significantly promoted as reflected by more penetrating cells (56.88 +/- 4.18) than that of the antisense transcripts (23.12 +/- 3.22), the negative (23.77 +/- 3.64) and blank controls (28.44 +/- 2.48). Further study by would healing assay indicated that cells overexpressing RhoC were more motile in actin-based active movement. The wound healing ratio after 24 h of the sense transcripts, antisense transcripts, negative controls and blank controls was 58.28% +/- 2.14%, 22.36% +/- 2.73%, 28.23% +/- 2.62%, 30.18% +/- 2.86%, respectively. The TRITC-phalloidin staining revealed less actin filament bundles and a reorganized cytoskeleton within the sense transcripts. In addition, p-Akt expression level was upregulated in the sense transcripts. RhoC overexpression may promote the invasive capacity of human breast cancer cells in vitro and its expression level is positively correlated with the metastatic capacity of those cells. So RhoC may be a potential target in the development of a novel strategy for treating metastasis of breast cancer.
|
386_OBJECTS= \
$(_OBJ_DIR)\i386\techtv1.obj
PASS0_386_OBJECTS=
IA64_OBJECTS= \
$(_OBJ_DIR)\ia64\techtv1.obj
PASS0_IA64_OBJECTS=
AMD64_OBJECTS= \
$(_OBJ_DIR)\amd64\techtv1.obj
PASS0_AMD64_OBJECTS=
|
Ie
Io
Dj
Gj
Ie
Dz
I
Yi
J
Lj
Nj
Tsh
Kj
I
U
Dzh
A
B
V
G
D
E
Zh
Z
I
I
K
L
M
N
O
P
R
S
T
U
F
Kh
Ts
Ch
Sh
Shch
'
Y
'
E
Iu
Ia
a
b
v
g
d
e
zh
z
i
i
k
l
m
n
o
p
r
s
t
u
f
kh
ts
ch
sh
shch
'
y
'
e
iu
ia
ie
io
dj
gj
ie
dz
i
yi
j
lj
nj
tsh
kj
i
u
dzh
O
o
E
e
Ie
ie
E
e
Ie
ie
O
o
Io
io
Ks
ks
Ps
ps
F
f
Y
y
Y
y
u
u
O
o
O
o
Ot
ot
Q
q
*1000*
[?]
*100.000*
*1.000.000*
[?]
[?]
\"
\"
R'
r'
G'
g'
G'
g'
G'
g'
Zh'
zh'
Z'
z'
K'
k'
K'
k'
K'
k'
K'
k'
N'
n'
Ng
ng
P'
p'
Kh
kh
S'
s'
T'
t'
U
u
U'
u'
Kh'
kh'
Tts
tts
Ch'
ch'
Ch'
ch'
H
h
Ch
ch
Ch'
ch'
`
Zh
zh
K'
k'
[?]
[?]
N'
n'
[?]
[?]
Ch
ch
[?]
[?]
[?]
a
a
A
a
Ae
ae
Ie
ie
@
@
@
@
Zh
zh
Z
z
Dz
dz
I
i
I
i
O
o
O
o
O
o
E
e
U
u
U
u
U
u
Ch
ch
[?]
[?]
Y
y
[?]
[?]
[?]
[?]
[?]
|
(2008)
Armando PLASCENCIA and Melania Plascencia, individually and on behalf of all others similarly situated, Plaintiffs,
v.
LENDING 1ST MORTGAGE; Lending 1st Mortgage, LLC; and EMC Mortgage Corporation, Defendants.
No. C 07-4485 CW.
United States District Court, N.D. California.
September 30, 2008.
ORDER GRANTING IN PART EMC MORTGAGE CORP.'S MOTION TO DISMISS
CLAUDIA WILKEN, District Judge.
Plaintiffs Armando and Melania Plascencia charge Defendants Lending 1st Mortgage, Lending 1st Mortgage, LLC and EMC Mortgage Corp. with violating the Truth in Lending Act and California statutory and common law in connection with the sale of certain residential mortgage products. EMC moves to dismiss the claims against it. Plaintiffs oppose the motion. The matter was heard on September 25, 2008. Having considered oral argument and all of the papers submitted by the parties, the Court grants EMC's motion in part and denies it in part.
BACKGROUND
According to the complaint, Lending 1st sells a variety of home loans, including option adjustable rate mortgages (OARMs). EMC is in the business of purchasing, packaging, and securitizing some or all of Lending lst's OARMs. In May, 2006, Plaintiffs purchased an OARM in the amount of $395,000 from Lending 1st to refinance their primary residence in San Leandro, California. The terms of their mortgage are complex and are set out in extensive detail in an Adjustable Rate Note (the Note), which is attached to the complaint.[1]
As with all adjustable rate loans, the interest rate on Plaintiffs' loan was pegged to a variable index and thus changed over time. One unusual feature of Plaintiffs' loan, however, was a low initial interest rate of one percent. This "teaser" rate resulted in an initial minimum monthly payment of $1,270, which is equal to the monthly payment on a fully amortized thirty-year loan with a one-percent interest rate. On July 1, 2006the date of Plaintiffs' first loan paymentthe interest rate on their mortgage increased substantially from the teaser rate of one percent. As of that date, the loan began accruing interest at a variable rate that changed each month and was calculated by adding 3.375% to an Index equal to the twelve month average of the annual yields on actively traded U.S. Treasury Securities adjusted to a constant maturity of one year.[2]
Although Plaintiffs' interest rate rose almost immediately, their minimum monthly payment did not. This is because the Note limited to once a year the frequency of initial increases to the minimum monthly payment. Because of this limit, Plaintiffs' minimum monthly payment did not increase until July, 2007. In addition, the Note imposed a "payment cap" on the amount of each initial increase to the minimum monthly payment. Under this cap, the minimum monthly payment could only increase by 7.5% for each of the first four years. However, subsequent increases were not limited by the payment cap. Instead, with the fifth increase, the payment would reset so that the remaining principal would be paid off with equal monthly payments over the remaining term of the loan.
Because Plaintiffs' initial minimum monthly payment was based on a onepercent interest rate and did not go up along with the almost immediate increase in their interest rate, their mortgage began accruing more interest each month than the entire amount of their payment. The interest that was left unpaid at the end of each month was added to the outstanding principal and began accumulating interest itself. As a result, Plaintiffs' principal debt grew even while they made the minimum payment each month. This process is known as negative amortization. Assuming the value of the property subject to a mortgage remains constant, the effect of negative amortization is to reduce the borrower's equity in the property.
The Note limited the amount of negative amortization that could occur on Plaintiffs' loan such that the principal could never rise to more than 115% of its original amount. Once the principal rose to this level, Plaintiffs' minimum monthly payment would be reset so that the principal would be paid off with equal monthly payments over the remaining term of the loan. This provision overrode the ordinary rule that the minimum monthly payment could rise only once a year and could increase by only 7.5% for each of the first four years.
In addition to the Note, Plaintiffs also attached to the complaint a Federal Truth-in-Lending Disclosure Statement (the Statement) that they were given before finalizing their mortgage. The Statement specified that the annual percentage rate (APR) on the mortgage was 7.68%. The Statement also included a schedule of estimated payments based on the initial one-percent interest rate and the subsequent interest rate increase described above.[3] The schedule listed an initial minimum payment of $1,270 that increased by 7.5% on July 1 of each year until September 1, 2010. On that date, which is just over four years into the repayment term, the minimum monthly payment was shown to increase from $1,697 to $3,314. It was set to remain at this level until the loan was paid off in 2036. The dramatic increase is apparently attributable to the projection that the principal would reach 115% of its original amount in or about August, 2010, due to negative amortization. The schedule assumed that Plaintiffs would make no more than the minimum monthly payment at any time.
Plaintiffs claim they were unaware that their loan was subject to negative amortization. They claim they were told that, "if they made payments based on the promised low interest rate, which were the payments reflected in the written payment schedule provided to them by Defendants, [] the loan would be a no negative amortization home loan and that Plaintiffs' payments would be applied to both principal and interest." TAC ¶ 26. Plaintiffs assert that the disclosures they were provided were inadequate to inform them that, although the minimum monthly payment would remain low for several years, the interest rate would increase almost immediately, causing negative amortization and a consequent loss of equity.
Plaintiffs allege that Lending 1st sold their mortgage to EMC at an unspecified time, but apparently shortly after the mortgage was issued. According to documents submitted by EMC, in May, 2007, Plaintiffs refinanced their home again with a new mortgage.[4] In doing so, they repaid in full the OARM that Lending 1st had issued them. Plaintiffs do not dispute this fact.
Plaintiffs brought this action on behalf of themselves and similarly situated individuals who purchased OARMs from Defendants. Plaintiffs have identified two classes of these individuals: a "California Class" consisting of all individuals who have purchased an OARM from Defendants in connection with a primary residence in California; and a "National Class" consisting of all individuals who have purchased an OARM from Defendants in connection with a primary residence elsewhere in the United States.
Plaintiffs claim that Defendants violated the Truth in Lending Act (TILA), 15 U.S.C. § 1601 et seq., because they did not clearly and conspicuously disclose: 1) the actual interest rate on Plaintiffs' mortgage; 2) the fact that the one-percent interest rate was a discounted rate; and 3) the fact that negative amortization was certain to occur. The Court previously denied Lending lst's motion to dismiss these claims. Plaintiffs also assert a new TILA claim in the third amended complaint for Defendants' failure to disclose that the payment schedule in the Statement is "not based on the APR" identified in the same document. This claim appears to be a restatement of their former claims for Defendants' failure to disclose in the Statement Plaintiffs' "true legal obligation" and the "composite" interest rate. The Court previously dismissed these claims with prejudice, and to the extent the new claim is based on the same allegations as the old ones, it is not properly asserted. Plaintiffs also charge Defendants with violating the California Unfair Competition Law (UCL), Cal. Bus. & Prof.Code § 17200 et seq., by committing unlawful, unfair and fraudulent business practices. Finally, Plaintiffs charge Defendants with common law fraud, breach of contract and breach of the covenant of good faith and fair dealing.
EMC moves to dismiss Plaintiffs' TILA claim for rescission on the ground that it was mooted by Plaintiffs' 2007 refinance, and to dismiss Plaintiffs' TILA claim for damages on the ground that it is barred by the statute of limitations. EMC also moves to dismiss Plaintiffs' UCL claims on the grounds that the claims are preempted and that EMC cannot be held vicariously liable for Lending lst's conduct. EMC further moves to dismiss the claims for fraud, breach of contract and breach of the covenant of good faith and fair dealing on the basis that the complaint fails to state substantive claims for relief.
LEGAL STANDARD
A complaint must contain a "short and plain statement of the claim showing that the pleader is entitled to relief." Fed. R.Civ.P. 8(a). On a motion under Rule 12(b)(6) for failure to state a claim, dismissal is appropriate only when the complaint does not give the defendant fair notice of a legally cognizable claim and the grounds on which it rests. See Bell Atl. Corp. v. Twombly, 550 U.S. 544, 127 S.Ct. 1955, 1964, 167 L.Ed.2d 929 (2007).
In considering whether the complaint is sufficient to state a claim, the court will take all material allegations as true and construe them in the light most favorable to the plaintiff. NL Indus., Inc. v. Kaplan, 792 F.2d 896, 898 (9th Cir.1986). Although the court is generally confined to consideration of the allegations in the pleadings, when the complaint is accompanied by attached documents, such documents are deemed part of the complaint and may be considered in evaluating the merits of a Rule 12(b)(6) motion. Durning v. First Boston Corp., 815 F.2d 1265, 1267 (9th Cir.1987).
When granting a motion to dismiss, the court is generally required to grant the plaintiff leave to amend, even if no request to amend the pleading was made, unless amendment would be futile. Cook, Perkiss & Liehe, Inc. v. N. Cal. Collection Serv. Inc., 911 F.2d 242, 246-47 (9th Cir.1990). In determining whether amendment would be futile, the court examines whether the complaint could be amended to cure the defect requiring dismissal "without contradicting any of the allegations of [the] original complaint." Reddy v. Litton Indus., Inc., 912 F.2d 291, 296 (9th Cir.1990).
DISCUSSION
I. TILA Claims
A. Effect of Plaintiffs' Refinance on the Availability of Rescission
If a lender fails to make the material disclosures required by TILA, the borrower has the right to rescind the mortgage agreement within three years after the date on which the transaction is consummated. See 15 U.S.C. § 1635. EMC argues that rescission is unavailable because Plaintiffs have refinanced their loan. In support of this position, EMC cites King v. California, 784 F.2d 910 (9th Cir.1986). In King, as here, the plaintiff sought rescission of a mortgage on the basis that the lender had not provided the required TILA disclosures. Although the Ninth Circuit did not address the issue of rescission in depth, it stated, "The loan of March 1981 cannot be rescinded, because there is nothing to rescind. King refinanced that loan in November 1981, and the deed of trust underlying the March 1981 loan has been superseded." Id. at 913. This statement was not dictum, in that it disposed of the plaintiff's TILA claim for rescission. And although other circuits have offered a more thorough analysis of the issue and have reached a different result than King, see Handy v. Anchor Mortgage Corp., 464 F.3d 760 (7th Cir. 2006); Barrett v. JP Morgan Chase Bank, N.A., 445 F.3d 874 (6th Cir.2006), the Court is not free to disregard Ninth Circuit precedent.
Plaintiffs argue that King was superseded by the 1995 amendments to TILA. But those amendments did not alter § 1635(f), the subsection that relates to the threeyear right of rescission for failure to provide material disclosures, let alone alter the statute to specify a right to rescind following a refinance. See Truth in Lending Act Amendments of 1995, Pub.L. 104-29, 109 Stat. 271 (1995). Plaintiffs state that the legislative history of the 1995 amendments "shows that Congress carefully considered the rescission provisions of § 1653(f) [and] made a well-informed decision not to include a provision which would cut off the statute's rescission remedy if the homeowner refinanced." Pls.' Opp. at 4. But the only legislative history actually cited by Plaintiffs is a floor statement by Senator Sarbanes stating that, under a previous version of the bill that was not passed, "consumers would have lost the right of rescission for a whole class of loans even if the most egregious violations of the Truth in Lending Act were committed." 141 Cong. Rec. S14566-03, S14567 (1995). The statement does not, however, identify the class of loans to which the Senator was referring. In any event, Congress' failure pass a particular legislative provision would not be conclusive under the circumstances. See Pension Benefit Guar. Corp. v. LTV Corp., 496 U.S. 633, 650, 110 S.Ct. 2668, 110 L.Ed.2d 579 (1990) ("Congressional inaction lacks persuasive significance because several equally tenable inferences may be drawn from such inaction, including the inference that the existing legislation already incorporated the offered change."). If Congress had wished to supersede King, it could easily have done so by amending TILA to specify explicitly that a right to rescission exists even following a refinance.
Plaintiffs also claim that their claim for rescission is not based simply on § 1635, but also on Regulation Z, which provides in relevant part, "If the required notice or material disclosures are not delivered, the right to rescind shall expire 3 years after consummation, upon transfer of all of the consumer's interest in the property, or upon sale of the property, whichever occurs first." 12 C.F.R. § 226.23(a)(3). Nonetheless, the Federal Reserve's authority to promulgate this portion of Regulation Z apparently derives from 15 U.S.C. § 1635(f)Plaintiffs do not suggest otherwiseand thus the Ninth Circuit's interpretation of the statute must also guide the Court's interpretation of the regulation. The regulation therefore does not support Plaintiffs' claim for rescission.
B. Timeliness of Plaintiffs' Claim for Damages
Unlike TILA claims for rescission, which may be brought within three years, a TILA claim for damages must be brought within "one year from the date of the occurrence of the violation." 15 U.S.C. § 1640(e). "[T]he limitations period in Section 1640(e) runs from the date of consummation of the transaction but [] the doctrine of equitable tolling may, in the appropriate circumstances, suspend the limitations period until the borrower discovers or had reasonable opportunity to discover the fraud or nondisclosures that form the basis of the TILA action." King, 784 F.2d at 915.
EMC argues that Plaintiffs' TILA claim for damages is barred by the statute of limitations. A statute of limitations defense may be raised in a motion to dismiss, but only where "the running of the statute is apparent from the face of the complaint," and the motion should be granted "only if the assertions of the complaint, read with the required liberality, would not permit the plaintiff to prove that the statute was tolled." Durning v. First Boston Corp., 815 F.2d 1265, 1268 (9th Cir.1987). The issue of equitable tolling must be considered when "the complaint, liberally construed in light of our `notice pleading' system, adequately alleges facts showing the potential applicability of the equitable tolling doctrine." Cervantes v. City of San Diego, 5 F.3d 1273, 1277 (9th Cir.1993) (emphasis added).
Plaintiffs' loan transaction was consummated in May, 2006, but they did not file this action until August 29, 2007. Accordingly, the TILA claim for damages would be timely if they did not discover, or have a reasonable opportunity to discover, Defendants' alleged TILA violations until August 29, 2006. Plaintiffs assert in their opposition to EMC's motion that they did not, and could not, discover the violations until they began receiving their statements and realized that the amount of their principal was increasing over time. This accords with the complaint's allegation that Defendants did not adequately disclose the terms of Plaintiffs' loan. EMC's assertion that the Note and the Statement demonstrate that Plaintiffs had sufficient information to know of their claim at the outset is contrary to the Court's decision on the first motion to dismiss. In denying that motion in part, the Court found that, while the Note and the Statement are literally accurate, Plaintiffs may be able to show that Defendants obscured crucial terms of the mortgagein particular, the fact that the initial minimum monthly payments were not sufficient to pay the monthly interest that was accruing.
Although the facts surrounding Plaintiffs' discovery of the objectionable loan terms must be developed through discovery, the complaint does not foreclose the possibility that equitable tolling may apply to their TILA claim for damages. Accordingly, dismissal at this stage would be inappropriate. See Huynh v. Chase Manhattan Bank, 465 F.3d 992, 1003-04 (9th Cir.2006) ("Generally, the applicability of equitable tolling depends on matters outside the pleadings, so it is rarely appropriate to grant a Rule 12(b)(6) motion to dismiss (where review is limited to the complaint) if equitable tolling is at issue.").
II. UCL Claims
California's Unfair Competition Law prohibits any "unlawful, unfair or fraudulent business act or practice." Cal. Bus. & Prof.Code § 17200. The UCL incorporates other laws and treats violations of those laws as unlawful business practices independently actionable under state law. Chabner v. United Omaha Life Ins. Co., 225 F.3d 1042, 1048 (9th Cir.2000). Violation of almost any federal, state, or local law may serve as the basis for a UCL claim. Saunders v. Superior Ct., 27 Cal. App.4th 832, 838-39, 33 Cal.Rptr.2d 438 (1994). In addition, a business practice may be "unfair or fraudulent in violation of the UCL even if the practice does not violate any law." Olszewski v. Scripps Health, 30 Cal.4th 798, 827, 135 Cal. Rptr.2d 1, 69 P.3d 927 (2003).
A. EMC's Potential Liability Under the UCL
EMC argues that it cannot be held liable under the UCL because the statute does not impose vicarious liability. See People v. Toomey, 157 Cal.App.3d 1, 14, 203 Cal.Rptr. 642 (1984). It is true that the UCL imposes liability only for a party's "personal participation in the unlawful practices." Id. However, it is sufficient that the defendant aided and abetted the principal violator. Id. at 15, 203 Cal.Rptr. 642. Under the common law definition, a person "aids and abets the commission of an intentional tort if the person ... knows the other's conduct constitutes a breach of duty and gives substantial assistance or encouragement to the other to so act." Fiol v. Doellstedt, 50 Cal.App.4th 1318, 1325, 58 Cal.Rptr.2d 308 (1996) (quoting Saunders v. Superior Court, 27 Cal. App.4th 832, 846, 33 Cal.Rptr.2d 438 (1994)).
The complaint alleges that EMC routinely purchased and securitized OARMs that Lending 1st issued in violation of TILA. It also alleges that all Defendants are "engaged in the business of promoting, marketing, distributing, selling, servicing, owning, or are and were the assignees of the Option ARM loans that are the subject of this Complaint." TAC ¶ 8. By showing that EMC purchased Lending 1st's OARMs with knowledge of Lending lst's TILA violations, Plaintiffs may be able to establish that EMC gave Lending 1st a financial incentive to continue to commit those violations, and therefore may be subjected to liability for aiding and abetting violations of the UCL. Moreover, EMC's profiting from loans featuring oppressive terms that were not fully disclosed in compliance with TILA could itself be an unfair business practice under the UCL. EMC may therefore be liable for UCL violations in its own right. Accordingly, the UCL claim will not be dismissed.
B. Preemption of UCL Claims by TILA
TILA contains a preemption provision that states:
Except as provided in subsection (e) of this section, this part and parts B and C of this subchapter do not annul, alter, or affect the laws of any State relating to the disclosure of information in connection with credit transactions, except to the extent that those laws are inconsistent with the provisions of this subchapter and then only to the extent of the inconsistency. Upon its own motion or upon the request of any creditor, State or other interested party which is submitted in accordance with procedures prescribed in regulations of the Board, the Board shall determine whether any such inconsistency exists. If the Board determines that a State-required disclosure is inconsistent, creditors located in that State may not make disclosures using the inconsistent term or form, and shall incur no liability under the law of that State for failure to use such term or form, notwithstanding that such determination is subsequently amended, rescinded, or determined by judicial or other authority to be invalid for any reason.
15 U.S.C. § 1610(a)(1) (emphasis added).
California law provides a four-year limitations period for UCL claims. Cortez v. Purolator Air Filtration Prods. Co., 23 Cal.4th 163, 178-79, 96 Cal.Rptr.2d 518, 999 P.2d 706 (2000). This contrasts with the one- and three-year limitations periods applicable to TILA claims for damages and rescission, respectively. In addition, restitution and injunctive relief are available as remedies for UCL violations. Cal. Bus. & Prof.Code § 17203. EMC argues that these aspects of the UCL render it "inconsistent" with TILA, and thus Plaintiffs' UCL claims are preempted.
EMC's argument finds no support in the text of TILA's preemption provision. That provision applies only to laws "relating to the disclosure of information in connection with credit transactions," and preempts those laws only to the extent that the "terms and forms" mandated by the state are "inconsistent" with those required by TILA. The preemption provision thus applies only to inconsistencies in the substance of state disclosure requirements.
The UCL does not, on its face, relate to the disclosure of information in connection with credit transactions, let alone impose disclosure requirements that are different than TILA's in any way. To the extent EMC's argument is premised on the contention that the UCL would impose liability for aiding and abetting TILA violations where TILA itself would not, EMC has not established that its alleged conduct would not subject it to liability under TILA. And in any event, § 1610(a)(1) explicitly provides that states may impose requirements beyond what is required under TILA, so long as the states do not mandate the use of "terms or forms" that are inconsistent with those required by TILA.
Similarly, the fact that the UCL allows a claim to be brought within four years or may provide remedies not available under TILA (and it is not clear that it does) simply provides an additional level of protection for consumers. The UCL does not mandate additional disclosures that are substantively inconsistent with TILA's, and therefore does not bring the UCL within the scope of TILA's preemption provision. See In re First Alliance Mortgage Co., 280 B.R. 246, 250-51 (C.D.Cal. 2002) ("Additional penalties are not inconsistent with TILA, but merely provide greater protection to consumers. Section 17200 does not provide inconsistent disclosure requirements."); Black v. Financial Freedom Senior Funding Corp., 92 Cal. App.4th 917, 936, 112 Cal.Rptr.2d 445 (2001) ("[A]n inconsistency or contradiction with federal law does not exist merely because the state requires disclosures in addition to those required by and under TILA.")
III. Fraud Claim
Under California law, "[t]he elements of fraud, which gives rise to the tort action for deceit, are (a) misrepresentation (false representation, concealment, or nondisclosure); (b) knowledge of falsity (or `scienter'); (c) intent to defraud, i.e., to induce reliance; (d) justifiable reliance; and (e) resulting damage." Small v. Fritz Cos., Inc., 30 Cal.4th 167, 173, 132 Cal. Rptr.2d 490, 65 P.3d 1255 (2003) (quoting Lazar v. Superior Court, 12 Cal.4th 631, 638, 49 Cal.Rptr.2d 377, 909 P.2d 981 (1996)).
Plaintiffs have alleged that EMC bought OARMs, including theirs, from Lending 1st and securitized them. Although the complaint does not allege that EMC made a misrepresentation or an omission of material fact directly to Plaintiffs, it alleges that EMC was engaged in a fraudulent scheme with Lending 1st pursuant to which loans with unfavorable terms were sold to consumers without those terms being properly disclosed. EMC then bought, serviced and securitized those loans. In In re First Alliance Mortgage Co., 471 F.3d 977, 994-95 (9th Cir.2006), the Ninth Circuit upheld a jury verdict finding a secondary lender liable for fraud based on the "substantial assistance" it provided to a fraudulent scheme by virtue of its role in the securitization of loans that were originated fraudulently. Although EMC's liability for fraud will ultimately turn on the exact nature of its involvement in the allegedly unlawful lending practices, the allegations in the complaint are sufficient to withstand dismissal at this early stage of the proceedings.
In addition, the complaint contains sufficient allegations to meet the heightened pleading requirements of Rule 9(b) of the Federal Rules of Civil Procedure. Pursuant to this rule, "a party must state with particularity the circumstances constituting fraud." However, the rule requires only that the allegations be "specific enough to give defendants notice of the particular misconduct which is alleged to constitute the fraud charged so that they can defend against the charge and not just deny that they have done anything wrong." Semegen v. Weidner, 780 F.2d 727, 731 (9th Cir.1985). Plaintiffs have alleged specific non-disclosures concerning the interest rate on their loan, the insufficiency of their monthly payments to cover the accrued interest and the consequent negative amortization that was certain to occur if they made only the minimum monthly payments. They have also alleged that EMC purchased and serviced their loan, and that it was in the business of securitizing OARMs it similarly purchased from Lending 1st. The allegations in the complaint are sufficiently specific to enable EMC to articulate a defense, and thus the requirements of Rule 9(b) are satisfied.
EMC argues that it cannot be held liable for fraud because, "to establish fraud through nondisclosure or concealment of facts, it is necessary to show the defendant was under a legal duty to disclose them." OCM Principal Opportunities Fund v. CIBC World Mkts. Corp., 157 Cal.App.4th 835, 845, 68 Cal.Rptr.3d 828 (2007) (internal quotation marks omitted). But Defendants owe Plaintiffs a legal duty pursuant to TILA. Although EMC argues that this duty cannot serve as the basis of a common law fraud claim because such a claim would be preempted, the Court has already rejected this theory of preemption. In addition, independent of any duty imposed by TILA, the mortgage transaction gave rise to a legal relationship between the parties capable of serving as the basis for a fraud claim. See LiMandri v. Judkins, 52 Cal.App.4th 326, 337, 60 Cal. Rptr.2d 539 (1997) ("[A] duty to disclose may arise from the relationship between. . . parties entering into any kind of contractual agreement."). It does not matter that the original transaction was not between Plaintiffs and EMC, because by purchasing the loan, EMC subjected itself to potential liability for its role in the alleged fraudulent scheme.
IV. Contract Claims
A. Breach of Contract
EMC argues that Plaintiffs have not stated a claim for breach of contract. Plaintiffs counter that EMC, as the assignee of Lending 1st's rights and obligations under the Agreement, violated its alleged promise to apply each of Plaintiffs' monthly payments to both "principal and interest." They interpret the Agreement's references to monthly payments of "principal and interest" as implying such a promise. See TAC Ex. 1 at § 3(A) ("I will pay principal and interest by making a payment every month.")
Although the Court has held that Plaintiffs may be able to show that, considered as a whole, the disclosures provide confusing and seemingly contradictory information concerning the terms of the loan, the disclosures nonetheless accurately describe the relationship between the minimum monthly payment and the accrued interest. The Agreement states that each monthly payment "will be applied to interest before Principal." Id. It states elsewhere that the "monthly payment could be less than or greater than the amount of interest each month." Id. § 5(C).
The Agreement thus contains no promise, express or implied, that Plaintiffs' payment would always be applied to both principal and interest. Whether the payment would be applied to principal depended on whether it was large enough to cover the entire amount of interest that had accrued during the preceding month. Because Plaintiffs could choose to pay more than the minimum payment, they had the option of making payments large enough to reduce their principal each month. Plaintiffs do not allege that they actually made payments that were greater than the amount of accrued interest, and that EMC nonetheless failed to apply the payments to principal. If this were the case, they would have stated a breach of contract claim. As the complaint stands now, they have not. Accordingly, the breach of contract claim is dismissed.
B. Breach of the Covenant of Good Faith and Fair Dealing
Under California law, "every contract. . . `imposes upon each party a duty of good faith and fair dealing in its performance and its enforcement.'" McClain v. Octagon Plaza, LLC, 159 Cal.App.4th 784, 798, 71 Cal.Rptr.3d 885 (2008) (quoting Carma Developers (Cal.), Inc. v. Marathon Dev. Cal., Inc., 2 Cal.4th 342, 371-72, 6 Cal.Rptr.2d 467, 826 P.2d 710 (1992)). The implied covenant "prevent[s] a contracting party from engaging in conduct which (while not technically transgressing the express covenants) frustrates the other party's rights to the benefits of the contract." Id. at 806, 71 Cal.Rptr.3d 885 (quoting Racine & Laramie, Ltd. v. Dep't of Parks & Recreation, 11 Cal.App.4th 1026, 1031-32, 14 Cal.Rptr.2d 335 (1992)). "[I]t imposes `not only . . . upon each contracting party the duty to refrain from doing anything which would render performance of the contract impossible by any act of his own, but also the duty to do everything that the contract presupposes that he will do to accomplish its purpose.'" Id. (quoting Pasadena Live v. City of Pasadena, 114 Cal.App.4th 1089, 1093, 8 Cal. Rptr.3d 233 (2004)) (omission in McClain).
Plaintiffs have not alleged any conduct on EMC's part that deprived them of the benefit of the Agreementnamely, to receive the sum of $395,000, subject to repayment according to the terms of the Agreement. Nor is EMC alleged to have done anything to render Plaintiffs' performance of the contract impossible. Plaintiffs' claim appears to be based largely on EMC's failure to apply Plaintiffs' monthly payments to both principal and interest. In this sense, it is identical to their non-viable breach of contract claim and must be dismissed. To the extent the claim is based on EMC's participation in the allegedly misleading marketing of OARMs, the claim similarly must be dismissed, because "the implied covenant is a supplement to an existing contract, and thus it does not require parties to negotiate in good faith prior to any agreement." McClain, 159 Cal.App.4th at 799, 71 Cal. Rptr.3d 885.
CONCLUSION
For the foregoing reasons, EMC's motion to dismiss (Docket No. 73) is GRANTED IN PART and DENIED IN PART. Plaintiffs' TILA claim is dismissed to the extent it seeks rescission.[5] This dismissal is with prejudice because the refinancing of Plaintiffs' loan makes such relief unavailable as a matter of law. Plaintiffs' claims for breach of contract and breach of the covenant of good faith and fair dealing are also dismissed. Because these claims are premised on a promise that is not contained in the contract, they are dismissed with prejudice as well.[6]
EMC must file an answer to the third amended complaint within twenty days of the date of this order.
IT IS SO ORDERED.
NOTES
[1] On this motion, the Court may properly consider the contents of the exhibits to the complaint. See United States v. Ritchie, 342 F.3d 903, 908 (9th Cir.2003) (a court may consider, among other things, documents attached to the complaint without converting a motion to dismiss into a motion for summary judgment).
[2] As a point of reference, the annual yield on such securities was 5.22% in July, 2006. See http://www.federalreserve.go v/releases/h15/data/Monthly/H15_TCMNOM_Y1.txt (last accessed on September 16, 2008).
[3] The APR presumably was calculated using the value of the Index at the time the Statement was issued.
[4] The Court grants EMC's request for judicial notice of these documents (Exhibits B and C to the request).
[5] The complaint does not contain separate TILA claims for rescission and damages; both rescission and damages are remedies sought in connection with the first cause of action.
[6] At oral argument, Plaintiffs' counsel stated that, if Plaintiffs were granted leave to amend the breach of contract claim, he would attempt to demonstrate with greater specificity that the Agreement contains a promise to apply Plaintiffs' payments to both principal and interest. Because the Court has reviewed the entire Agreement and finds no such promise, Plaintiffs' proposed amendment would be futile.
|
Dissociative identity disorder and schizophrenia: differential diagnosis and theoretical issues.
Schizophrenia and dissociative identity disorder (DID) are typically thought of as unrelated syndromes--a genetically based psychotic disorder versus a trauma-based dissociative disorder--and are categorized as such by the DSM-IV. However, substantial data exist to document the elevated occurrence of psychotic symptoms in DID; awareness of these features is necessary to prevent diagnostic confusion. Recent research has also pointed out that schizophrenia and DID overlap not only in psychotic symptoms but also in terms of traumatic antecedents, leading to a number of suggestions for revision of our clinical, theoretical, and nosologic understanding of the relationship between these two disorders.
|
The Approach to Occult Gastrointestinal Bleed.
Occult gastrointestinal bleeding is not visible and may present with a positive fecal occult blood test or iron deficiency anemia. Obscure bleeding can be overt or occult, with no source identified despite an appropriate diagnostic workup. A stepwise approach to this evaluation after negative upper and lower endoscopy has been shown to be cost effective. This includes repeat endoscopies if warranted, followed by video capsule endoscopy (VCE) if no obstruction is present. If the VCE is positive then specific endoscopic intervention may be possible. If negative, patients may undergo either repeat testing or watchful waiting with iron supplements.
|
package listeners
import (
"net"
"net/http"
)
// Wrapped defaultConnListener that generates the wrapped defaultConn
type defaultConnListener struct {
net.Listener
}
func NewDefaultListener(l net.Listener) net.Listener {
return &defaultConnListener{l}
}
func (l *defaultConnListener) Accept() (c net.Conn, err error) {
conn, err := l.Listener.Accept()
if err != nil {
return nil, err
}
return &defaultConn{
WrapConnEmbeddable: nil,
Conn: conn,
}, err
}
// Wrapped IdleTimingConn that supports OnState
type defaultConn struct {
WrapConnEmbeddable
net.Conn
}
func (c *defaultConn) OnState(s http.ConnState) {}
func (c *defaultConn) ControlMessage(msgType string, data interface{}) {}
|
2012 Critérium International
The 2012 Critérium International, was the 81st running of the Critérium International cycling stage race.
Schedule
Teams
Stages
Stage 1
24 March 2012 – Porto-Vecchio to Porto-Vecchio, 89.5 km
Stage 2
24 March 2012 – Porto-Vecchio to Porto-Vecchio, 6.5 km
Stage 3
27 March 2012 – Porto-Vecchio to Col de l’Ospedale, 198 km
Classification leadership
Final standings
General classification
Points classification
Mountains classification
Young rider classification
Team classification
References
Category:Critérium International
Criterium International
Criterium International
|
Q:
How do I calculate the height of an arc?
I'm a hobbyist engineer, having one of those moments where my mind goes blank.
I know this is a simple problem, but I can't remember how to approach it.
I have an arc defined by width and angle. ($w$ and $a$)
The radius ($r$) of the arc is defined by: $$r=\frac{w}{sin(a)}$$
The question is, how do I calculate the height ($h$) of the arc, for any given width ($w$) and angle ($a$)?
The arc is displayed in white, in the diagram below.
In the diagram, the value of $h$ is provided by the computer software, and I need to know how to calculate this value manually.
Additionally, $a$ is specified as $45$ degrees, but this angle may change in the future.
A:
From the figure, $w=r\sin a$,
$$\begin{align}h&=r-r\cos a=r(1-\cos a)\\
&=\frac w{\sin a}(1-\cos a)=\frac{w(1-\cos a)(1+\cos a)}{\sin a(1+\cos a)}\\
&=\frac{w\sin^2a}{\sin a(1+\cos a)}=\frac{w\sin a}{1+\cos a}\\
&=w\tan\left(\frac a2\right)\end{align}$$
|
Last year, over 30,400 events were organised as part of the festival and over 750,000 people are estimated to have taken part in events around the world.
Social media influencer and backstage reporter on RTÉ’s Dancing With The Stars James Patrice said he was “honoured” to be asked to be an ambassador.
“I just remember (Seachtain na Gaeilge) was always a huge deal in school and from what I have heard, it is getting bigger and better,” he said.
He said he would encourage people to use social media to converse in Irish during the two-week festival.
“Snapchat has county filters ‘as Gaeilge’. You can do your WhatsApp through Irish, you can do Facebook through Irish, you can do all of these everyday things. It’s those little steps - if people start to take them - and do it on your phone . . . people would subconsciously become very much more immersed in it.”
“I want people to use their Gaeilge with me on Snapchat @jamespatrice or on Insta and chat to their friends as Gaeilge online. It would be amazing to see everyone online really having a go for Seachtain na Gaeilge. Don’t worry about making mistakes, every effort counts!”
Making an effort
Caitlín Nic Aoidh said participating in Seachtain na Gaeilge is about making an effort – regardless of the standard of Irish.
“It’s all about using the cúpla focal you have. A lot of people say ‘Oh, I don’t have any Irish’ but it’s not true – everyone in the country has a certain amount of Irish. It’ s worth it – if you are ordering a coffee or a tea – and using the phrases you have, just use it and don’t ever be afraid of making mistakes or anything like that because I think that’s probably one of the things that turns people off.
“They are nearly afraid to speak in case they make a mistake but people are actually delighted to hear people talking ‘as Gaeilge’. So, coinnigh oraibh ag cleachta! (please continue practicing!)
As with many other Irish language events, Seachtain na Gaeilge draws heavily on a combination of grass-roots organisation and local enthusiasm. Events are organised by community groups, schools, libraries, local and city authorities, cultural and sporting groups.
All-star and Loughmore-Castleiney hurler Noel McGrath said he was delighted to be involved with the festival.
“The GAA is as Irish as it comes. Irish is a massive part of that. It’s spoken in lots of clubs around the country and there are a few in my own club who are well able to speak it. It was great to get involved and I’m delighted and looking forward to the next few weeks.”
According to the organisers, the ambassadors were specifically chosen due to their various standards of Irish to encourage people of various levels to get involved.
Noel McGrath said the public should “just get involved and enjoy it!”
“I’m sure from my point-of-view, there’ll definitely be mistakes in any Irish I try to speak but just get over them and try the best you can and have fun!”
“Through Seachtain na Gaeilge there’s the rith, there’s different functions going on at different places and for people to go and enjoy them and talk to other people who are interested in the language as well and you never know, you might get to meet new people who are probably in the same place as you are and everybody might enjoy it then.
Speaking Irish
The Tipperary centre-forward said he hears more and more people speaking Irish.
“I spent a lot of time in Dublin over the last few years and when I went into teaching in Stillorgan I was in a school just down the road from Coláiste Eoin so you would have seen and heard students talking Irish fluently at games and at matches and maybe even around outside of school as well. I think it has become more and more...I suppose 'cool' might be the word to use.”
He said there were “definitely three, if not four or five who are able to speak fluent Irish” on the Tipperary inter county team.
“I’m not one of them unfortunately, not yet. I have a few words – It was something that maybe seven or eight years ago I would have been able to have a conversation but if I could even get back to that level again where I could speak to someone in a two or three minute conversation I’d be happy,” he said.
“It’s where we are from, it’s who we are. It’s nice to have some words and to get better at it would be even better again,” he added.
Hailing from Cloich Cheann Fhaola in the Donegal Gaeltacht Caitlín was raised with Irish.
She encouraged people to visit the Seachtain na Gaeilge website (snag.ie) for information about events.
|
Q:
Unit Testing - How to Compare Two Paged Collections To Assert All Items Different?
Had a quick look here, couldn't find a duplicate (correct me if im wrong).
I've got the following Unit Test for some Paging with LINQ:
// Arrange.
const int locationId = 1;
const LocationType locationType = LocationType.City;
int pageSize = 10;
// Act.
var postsPageOne = PostService.FindAllPostsForLocationPaged<Review>(locationId, locationType, 1, pageSize);
var postsPageTwo = PostService.FindAllPostsForLocationPaged<Review>(locationId, locationType, 2, pageSize);
// Assert.
Assert.IsTrue(postsPageOne.Count > 0);
Assert.IsTrue(postsPageTwo.Count > 0);
Assert.AreEqual(postsPageOne.Count, pageSize);
Assert.AreEqual(postsPageTwo.Count, pageSize);
CollectionAssert.AllItemsAreNotNull(postsPageOne.ToArray());
CollectionAssert.AllItemsAreNotNull(postsPageTwo.ToArray());
I want to assert that all items in the collection postsPageOne are different to all the items in the collection postsPageTwo. (seems like the way to test paging)
Any ideas of how I can do that?
A:
That doesn't sound like the way to test paging to me. I would test paging by having a known dataset, and checking that each page does contain the data I'd expect it to. Otherwise your code could just make up random data, and so long as it was different, your test would pass.
Use a small page size (e.g. 2 or 3) to keep the amount of data to test nice and small.
A:
Assert.IsFalse(postsPageOne.Intersect(postsPageTwo).Any());
|
[{
"description": "Give an equivalent CFG grammar in Chomsky Normal Form with no unit productions, lambda productions, or useless productions.",
"type": "description",
"testCases": [{
"No_Lambda": true
},
{
"No_Unit": true
},
{
"No_Useless": true
},
{
"CNF": true
}
],
"grammar": [{
"left": "S",
"right": "A|C"
},
{
"left": "A",
"right": "aA|a|B"
},
{
"left": "B",
"right": "bB|b"
},
{
"left": "C",
"right": "cC|c|B"
}
]
}]
|
March 52:35 p.m.
Yesterday I boarded that same bus from that same
Guadalajara street corner. Yesterday that bus, that number
707, from that Guadalajara street corner where San Felipe
meets Independencia, transported me to Tonalá. On the way to
Tonalá that bus, that number 707, stopped at Guadalajara's
immense new bus terminal. When the bus stopped at that
immense new bus terminal my eyebrows rose. I thought to
myself, "Ah ha! The 707! This is the bus that will carry me
to the bus terminal tomorrow!" For tomorrow, or rather today,
I was to make a daytrip from that bus terminal to Chapala. I
reflected then on the important descriptions I needed to
gather in Chapala. I decided then to start early this
morning. I would arrive in Chapala early today so that my
note-taking energies would be fresh for these important
descriptions. I consulted my guide book. Yes, four daily
departures from that bus terminal to Chapala, four of them
and one very early. I noted the departure times. I noted the
price of passage. I felt myself fortunate. I smiled. That
was the easiest daytrip plan I had yet executed.
This morning I boarded that same bus from that same
Guadalajara street corner. But this morning, that number
707, from that Guadalajara street corner where San Felipe
meets Independencia did not transport me to Guadalajara's
immense new bus terminal. My mistake. I should have asked
the driver. But it seemed to me a redundant question,
moronic even. Just yesterday that bus, that number 707,
carried me to that bus terminal. And right there in the
windshield of that bus leaned a placard announcing "Terminal
de Autobuses." I just claimed a comfortable seat, therefore,
near amidships. I just relaxedly, therefore, opened As You
Like It. And, a half-hour later, the bus arrived at the far
end of a residential neighborhood in the outlying community
of Zapopán. We had traversed the whole of the city of
Guadalajara. I was the only passenger left on the bus.
"Señor, you do not pass by the central de autobuses?" I
queried the driver, bewildered.
The driver grinned. "Al revés," he said. "We pass it on
the way back."
I asked when that trip back would begin.
The driver said it would not.
"This bus does not go back that way," the driver
explained. "Another will come shortly that makes that trip."
I nodded tightly. I debarked. The driver disappeared.
There were no businesses or restaurants about. I stood on a
quiet residential lane of bungalow-style homes. I found a
curbstone nearby. I squatted. I fumed at myself. I
attempted to read a little Shakespeare. But I was too
incensed at myself to read a little Shakespeare. I jammed As
You Like It into my backpack. My early departure had been
spoiled. My energies were being dissipated. I was a fool.
I noticed a man and woman decorating a grassy median in
the lane beyond the parked bus. They were arranging pennants
and favors for what looked to be a little girl's birthday
party. Tissue paper stencils were being strung. A samba was
being played on a portable stereo. I observed these
preparations as my wait lengthened. I listened to that samba
as my wait lingered. Then to a piece of pop music, I
listened, and then to that nameless so-popular ranchero
tune...
A second bus pulled up behind the one I had deboarded.
Then a third bus. Anxiously, I examined these. They were
vacant. The announcements in their windshields provided no
clue to which I might board. The drivers debarked. The
drivers disappeared. Then the first driver reappeared. He
reboarded his bus. He fired up his engine. I rose. I
approached his bus. Still it baffled me that his placard
announced his destination as the bus terminal. He wiggled
his finger at me "no." He made the "momentito" sign with his
index finger and thumb. He gestured back at the third bus.
I inclined my head. I squatted again on the curbstone. I
observed again the man and woman festooning for the little
girl's birthday party. My anger finally began to ease. My
hyper-attention finally began to wane. I was beginning to
submit to the failures of the day. The third bus started
suddenly and began to roll away. I had to run to catch it.
It was a thirty-minute ride back to that original
Guadalajara street corner, a thirty-minute ride back to that
corner where San Felipe meets Independencia. That bus, that
number 706, stopped at that corner. Some passengers there
boarded. Some passengers there deboarded. I moved not at
all. An hour and forty-five minutes had transpired since I
had left that corner. It would be another thirty minutes
before that 706 would arrive at that immense new bus
terminal. But that thirty minutes would pass. That 706 would
arrive. I did finally arrive.
Guadalajara's immense new bus terminal is constructed in
the shape of a horseshoe. Easily it is as large as many small
American airports. Six different salas comprise the
horseshoe's interior, each serving a different point of the
compass.
I decided to give up on Chapala for today. My early
launch was blown. My energies were half spent. And the
descriptions of Chapala are very important ones. I would go
on to Ajijíc, I decided, and save Chapala for tomorrow.
Ajijíc is a little town just west of Chapala, also situated
on the round lake from which Chapala derives its name. To
arrive there would require my bussing to Chapala, and then my
bussing from Chapala to Ajijíc. This would mean more travel
time, of course. But the loss of time would not impact my
work. The Ajijíc notes are not that extensive or important.
This became my plan.
Each of the salas of that immense bus terminal houses
five or six different bus lines. I paddled into the first of
these salas ogling for a bus line that would take me to
Chapala. There were none. I paddled into the second sala
scanning for a bus line that would take me to Chapala. There
were none. I paddled into the third sala squinting for a bus
line that would take me to Chapala. There were none. I
strode then to the information booth of that third sala. The
booth sat empty save for a leather portfolio that lie atop
its desk. Four men grouped themselves nearby, chatting. I
could not divine which of the four would be the information
clerk. I waited for a few minutes. One of the chatting men
eyed me. But none of the chatting men ceased their chatting.
I surrendered. I returned to the second sala. I sought and
found there the second sala's information booth. A young man
hunched within that second sala's booth. He hunched tightly,
reading one of those comic books endemic to Mexican bus
stations. Crime stories, they are, with raffish covers
sporting busty blonde damsels in ripped red nightgowns.
"Excuse me, amigo," I said.
Reluctantly, the clerk looked up from his intent
concentration.
"Excuse me, I want to go to Chapala but I can't seem to
find a company with a destination to Chapala."
The clerk's expression was dour. "No hay," he said
flatly, unsmiling. "There are none."
"No hay?" I answered in surprise.
"No hay. You have to go to the old bus station to get to
Chapala. The old bus station, downtown."
I smiled at the clerk amiably. I thanked the clerk as he
resumed his comic book reading. But I did not believe the
clerk. My guidebook assured me that you could depart for
Chapala from either bus station. And a mistake that gross
seemed to me unlikely from a source that had proved itself
dependable.
I returned then to the first sala. I sought and found
its information booth.
"No hay," an affable young man concurred.
"No hay?" I answered this time with even more surprise,
for now I began to believe.
"You have to go to the old terminal, my friend," the
affable young man said. "Look right out there. See that
white bus? That mini-bus? That white mini-bus goes from
terminal to terminal. Take that mini-bus. It will take you
to the old bus station."
I thanked this clerk warmly. I believed this clerk
unreservedly. I was a-sprint. I boarded the white mini-bus.
Almost three hours had passed now since I first boarded
that 707 at that Guadalajara street corner. Three hours since
I had left that street corner where San Felipe meets
Independencia. Three hours and now again I was heading back
into the center of Guadalajara.
As the white mini-bus threaded its way toward the
center of Guadalajara I relinquished any hope of making a
daytrip today. I calculated that by the time I arrived at
the old station and located and boarded a bus that would
carry me to Chapala from which I would then have to bus to
Ajijíc, I would have little time to accomplish any real work
before I had to begin the process all over again, in reverse,
in order to return to my lodgings in time to get enough sleep
that I might work with great energy tomorrow on those
important descriptions of Chapala. Besides, my mood had
soured.
So my plan, as I bounced along on that white mini-bus,
became to simply arrive at the old bus station, find the bus
line servicing Chapala and fix in my mind the steps I would
have to go through tomorrow morning in order to make a
successful early sally. This is what I did.
Afterward, I found the perennial row of city busses that
idles in front of all bus terminals. I boarded the bus at the
fore of the row, the one with the word "centro" shoe polished
on its windshield. Soon the bus was underway and, at last, I
felt I could relax. I sighed as this last leg of my
convoluted journey began. I sighed as this confused day's end
approached. Gazing out the window, I blearily watched for
the emergence of the dual church spires that mark the
Guadalajara centro. I daydreamed about the pan dulce above
which I now sit as I watched. I daydreamed about the coffee
over which I now hover in this Sanborns. But time passed.
And those signal dual spires did not resolve in the skyline.
And I began to wonder. My confident boarding of this city
bus had been based on two basic assumptions. One, that this
was the city bus which at every bus terminal of every city
and town travels directly from the bus station to the centro.
And, two, that when I boarded this city bus I was not already
in the centro. The first of these assumptions is based on a
pattern I've observed now for ten years. A pattern, in fact,
that has made it possible for me to navigate several
unfamiliar towns and cities this trip. The second of these
assumptions, however, was based solely on my own perception
of the setting around me. And this I might have muffed.
For, look, the city was growing less and less congested as
the bus continued on, not more so. And what is that? Is that
not a dilapidated sign I recognize from another trip? And
this corner, this right-angle turn we make here, I remember
it from my trip yesterday to Tonalá, and from that trip today
to... And I experienced here what is usually called a sinking
feeling. For the dual spires were not going to appear, I
suddenly realized. And the landmarks around me were all too
telling. It was very clear. I had made another mistake. I
had been in the centro when I had boarded that bus. So that
bus at that moment was not carrying me into the centro. That bus at that moment was carrying me out of the centro. As a
matter of fact, that bus at that moment was carrying me to
the new bus terminal!
I shook my head in a great crackling self-critical
consternation.
At the very next stop I debarked abruptly.
I crossed the street, flushed. I pinpointed a bus stop,
hot. I stewed.
Within fifteen minutes came the number 707 rumbling the
opposite direction. I boarded that bus, that number 707.
Very explicitly then, between my measured breaths, I asked
the driver if his destination was the centro. He grinned at
me broadly, and, with a friendly dismissive motion, pointed at
the placard in the window. It announced "Centro." I nodded at
him with tightly updrawn lips. Some fifteen minutes later
that bus, that number 707, delivered me to that same
Guadalajara street corner from which, five hours earlier,
another number 707 had first picked me up. It delivered me to
that same Guadalajara street corner where San Felipe meets
Independencia.
|
IN THE COURT OF CRIMINAL APPEALS
OF TEXAS
NO. AP-75,838
EX PARTE CRAIG RONALD CAMPBELL, Applicant
ON APPLICATION FOR WRIT OF HABEAS CORPUS
IN CAUSE NO. 23,639-A IN THE 300 TH JUDICIAL DISTRICT COURT
OF BRAZORIA COUNTY
P RICE, J., filed a dissenting opinion in which M EYERS, J OHNSON and H OLCOMB,
JJ., joined.
DISSENTING OPINION
The applicant was convicted of the offense of burglary of a building for purposes of
committing theft. He was eventually released on parole, but was revoked because the parole
panel found that he violated a condition of his release by entering a child safety zone. The
applicant argues, inter alia, that the parole panel lacked the discretion to impose such a
condition in his case, under Section 508.225(a) of the Texas Government Code.1 The Court
1
TEX . GOV ’T CODE § 508.225(a). This provision reads:
(a) If the nature of the offense for which an inmate is serving a sentence
Campbell — 2
rejects this argument in a single, perfunctory sentence.2 I believe that the applicant’s
argument is correct, however, and therefore I respectfully dissent.
In concluding that a child-safety-zone condition may be imposed as a condition of the
applicant’s parole, the Court points to broad language in Section 508.221 of the Government
Code granting a parole panel the authority to “impose as a condition of parole or mandatory
supervision any condition that a court may impose on a defendant placed on community
supervision under Article 42.12, Code of Criminal Procedure . . . .” 3 Subsection 11(a) of
Article 42.12, in turn, grants wide (albeit not wholly unfettered) discretion upon a trial court
to “impose any reasonable condition that is designed to protect or restore the community,
warrants the establishment of a child safety zone, a parole panel may establish a child
safety zone applicable to an inmate serving a sentence for an offense listed in Section
3g(a)(1), Article 42.12, Code of Criminal Procedure, or for which a judgment
contains an affirmative finding under Section 3g(a)(2), Article 42.12, Code of
Criminal Procedure, by requiring as a condition of parole or release to mandatory
supervision that the inmate not:
(1) supervise or participate in any program that includes as
participants or recipients persons who are 17 years of age or younger
and that regularly provides athletic, civic, or cultural activities; or
(2) go in or on, or within a distance specified by the panel of,
a premises where children commonly gather, including a school, day-
care facility, playground, public or private youth center, public
swimming pool, or video arcade facility.
2
See Majority Opinion at 9 (“Section 508.225 does not, however, specifically precluded the
use of a child safety zone in other [than the specifically enumerated] circumstances.”
3
Id, citing TEX . GOV ’T CODE § 508.221.
Campbell — 3
protect or restore the victim, or punish, rehabilitate, or reform the defendant.” 4 The Court
deems the establishment of a child safety zone to be a reasonable condition of community
supervision for one, such as this applicant, who has been previously convicted of indecent
exposure, and it therefore holds that a parole panel may also authorize it as a condition of
parole, consistent with Section 508.221 of the Government Code.5
The Court fails to see the whole picture. It is important to construe all of the
conditions-of-parole/mandatory supervision provisions contained in Chapter 508 of the
Government Code in pari materia. Moreover, in view of Section 508.221’s reference to
Article 42.12’s provisions governing conditions of community supervision, it is also
important to construe the Government Code provisions in pari materia with provisions in the
Code of Criminal Procedure governing conditions of community supervision. Let us begin
with the Government Code.
CHAPTER 508
Chapter 508 of the Government Code pertains generally to parole and mandatory
supervision in Texas. Subchapter F designates mandatory conditions—those that a parole
panel must impose on certain offenders as a condition of their release on parole or mandatory
4
TEX . CODE CRIM . PROC . art. 42.12, § 11(a); George E. Dix & Robert O. Dawson, 43A
TEXAS PRACTICE : CRIMINAL PRACTICE AND PROCEDURE § 39.94 (2d ed. 2001).
5
Majority opinion at 9-10.
Campbell — 4
supervision. Among those mandatory conditions is that found in Section 508.187.6 This
provision requires a parole panel to impose as a condition of release the establishment of a
child safety zone for inmates “serving a sentence” for certain enumerated offenses. Those
enumerated offenses involve offenses of a sexually assaultive or exploitative nature, and do
not include burglary of a building for purposes of committing theft—the offense this
applicant was convicted of, was “serving a sentence” for, and for which he was later
conditionally released. Thus, the parole panel was apparently not required to impose a child
safety zone as a condition of his parole. But, of course, the question in this case is whether
the parole panel was authorized to impose a child safety zone as a condition of the
applicant’s parole.
In 1999, the Legislature enacted Section 508.225.7 This legislation added a provision
to Subchapter G of Chapter 508, which sets out discretionary conditions of parole and
mandatory supervision that a parole panel may impose. It authorizes the imposition of a
child-safety-zone condition upon non-sex-offender releasees who are serving sentences of
a violent nature, namely, offenses designated by Section 3g(a)(1) of Article 42.12 of the
Code of Criminal Procedure, or offenses for which an affirmative finding has been made of
the use or exhibition of a deadly weapon under Article 42.12, Section 3g(a)(2). This
6
TEX . GOV ’T CODE § 508.187.
7
Acts 1999, 76th Leg., ch. 56, §2, eff. Sept. 1, 1999.
Campbell — 5
applicant, serving a sentence for burglary of a building for purposes of committing theft,
satisfies none of these express statutory criteria.
Does a parole panel nevertheless have discretion to impose a child-safety-zone
condition upon this applicant because he has a prior conviction for indecent exposure? It
seems clear enough that a parole panel is not required to impose that condition, since
indecent exposure is not among the expressly enumerated offenses in Section 508.187(a).
In any event, as noted earlier, under Section 508.187(a), it is the offense for which the
releasee is “serving a sentence” that must be among those enumerated, not some prior
offense. Expressio unius est exlusio alterius.8 We must presume, absent some plain
indicium of contrary legislative intent, that when the Legislature says one thing, it does not
mean something else.9
This maxim should apply with equal force to Section 508.225(a). By expressly
enumerating the circumstances in which a parole panel “may” make parole or mandatory
supervision contingent upon the imposition of a child safety zone, the Legislature has
8
“A canon of construction holding that to express or include one thing implies the exclusion
of the other, or of the alternative.” Black’s Law Dictionary 602 (7th ed. 1999). “It is a well-known
rule of statutory construction in this State and elsewhere that the express mention or enumeration
of one person, thing, consequence or class is tantamount to an express exclusion of all others.” Ex
parte McIver, 586 S.W.2d 851, 856 (Tex. Crim. App. 1979) (Opinion on State’s motion for
rehearing); State v. Roberts, 940 S.W.2d 655, 659 (Tex. Crim. App. 1996).
9
Williams v. State, 965 S.W.2d 506, 507 (Tex. Crim. App. 1998); Norman J. Singer & J. D.
Sambie Singer, 2A SUTHERLAND ON STATUTES AND STATUTORY CONSTRUCTION § 47:24 (7th ed.
2007); 67 Tex. Jur. 3d Statutes § 116 (2003), at 631-33.
Campbell — 6
presumably indicated that such a condition may not otherwise be imposed (except, of course,
where mandated by Section 508.187).10 I find nothing in the legislative history of Section
508.225 (such as it is) to the contrary.11 Therefore, notwithstanding the general authority
granted to a parole panel by Section 508.221 to impose any condition that could be imposed
upon a probationer under Article 42.12, I would hold that a parole panel may not impose a
child-safety-zone condition upon an inmate serving a sentence that does not fall under Article
42.12, Section 3g(a)(1), or for which an affirmative finding was not made under Article
42.12, Section 3g(a)(2).
ARTICLE 42.12
Even if I were to entertain the Court’s assumption that Section 508.221’s general grant
of authority could trump what I take to be Section 508.225’s specific limitation on that
authority, I would still hold that the parole panel lacked authority to impose a child-safety-
zone condition upon this applicant. Section 508.221 generally authorizes a parole panel to
impose any condition that a trial court could impose upon a defendant as a condition of
10
See TEX . GOV ’T CODE § 508.255(c) (“This section does not apply to an inmate described
by Section 508.187.”).
11
Senate Bill 660 passed through both the Senate and House and their respective committees
with no amendment and very little fanfare. According to the various bill analyses, its purpose was
to “create[ ] certain conditions for community supervision, parole, and mandatory supervision for
certain violent offenders.” Apparently, the Legislature did not believe that the discretionary
imposition of a child-safety-zone condition was already authorized by statute. “When what is
expressed in a statute is creative, and not in a proceeding according to the course of the common law,
it is exclusive, and the power exists only to the extent plainly granted.” Singer & Singer, supra, §
47:23, at 412.
Campbell — 7
community supervision under Article 42.12. The Court points to general language in Article
42.12, Section 11(a) for the proposition that a trial court is authorized to impose any
“reasonable condition” of community supervision,12 and concludes that it would be
reasonable for a trial court to impose a child-safety-zone condition upon a probationer who
has a prior conviction for indecent exposure when offense reports indicate that the indecent
exposure involved children.13 Moreover, the Court notes, Article 42.12, Section 11(i)
authorizes a trial court to require a “sex offender” “to submit to treatment, specialized
supervision, or rehabilitation according to offense-specific standards of practice adopted by
the Council on Sex Offender Treatment.” 14 The Court reasons that these provisions in
Article 42.12 would have authorized a trial court placing this applicant on community
supervision to impose a child-safety-zone condition.15 I disagree.
12
TEX . CODE CRIM . PROC. art. 42.12, § 11(a).
13
Majority opinion at 9.
14
Id. at 10. See TEX . CODE CRIM . PROC. art. 42.12, § 11(i) (“A judge who grants community
supervision to a sex offender evaluated under Section 9A may require the sex offender as a condition
of community supervision to submit to treatment, specialized supervision, or rehabilitation according
to offense-specific standards of practice adopted by the Council on Sex Offender Treatment.”). It
is not at all clear to me that the applicant would necessarily qualify as a “sex offender” under TEX .
CODE CRIM . PROC. Article 42.12, § 9A(a)(2). But even if he did, there is no indication that he was
ever “evaluated” under that section at the trial court level, and so I cannot conclude that Section 11(i)
would authorize imposing offense-specific “treatment, specialized supervision, or rehabilitation”
upon him as a condition of community supervision. Nor is it self-evident to me that imposition of
a child safety zone constitutes “treatment, specialized supervision, or rehabilitation.”
15
Id. at 9-10.
Campbell — 8
Like Chapter 508 of the Government Code, Article 42.12 contains specific provisions
that address the imposition of child-safety-zone conditions. In Article 42.12, Section 13B,16
the Legislature has provided for the mandatory imposition of a child-safety-zone condition
of community supervision. Section 13B(b) essentially mirrors Section 508.187(a) of the
Government Code, requiring the imposition of a child-safety-zone condition for the nearly
identical offenses for which Section 508.187(a) would require a parole panel to impose such
a condition. But Section 13B(b), by its express terms, applies only “to a defendant placed
on community supervision for” one of these enumerated offenses—not including burglary
of a building for purposes of committing theft. Had this applicant been placed on community
supervision for his offense of burglary of a building, a trial court could not have been
required under Section 13B to impose a child-safety-zone condition. Again, expressio unius
est exclusio alterius.
Also like Chapter 508 of the Government Code, Article 42.12 contains a specific
provision governing when a trial court is authorized to impose a child safety zone as a
condition of community supervision. Section 13D of Article 42.12 provides that a trial court
“may” impose such a condition if it “grants community supervision to a defendant convicted
of an offense listed in Section 3g(a)(1) or for which the judgment contains an affirmative
16
TEX . CODE CRIM . PROC. art. 42.12, § 13B.
Campbell — 9
finding under Section 3g(a)(2)[.]” 17 These are exactly the same circumstances under which
a parole panel is authorized to impose a child safety zone as a condition of parole or
mandatory supervision under Section 508.225—indeed, Section 13D and Section 508.225
were enacted at the same time, in the same legislative bill.18 Once again, by enumerating the
circumstances under which this condition of community supervision may be imposed, the
Legislature has indicated that it may not be imposed otherwise (except, of course, where
mandated under Section 13B).19 Because the applicant could not have been subjected to a
child-safety-zone condition of community supervision under Article 42.12, such a condition
17
TEX . CODE CRIM . PROC. art. 42.12, § 13D(a) reads:
(a) If a judge grants community supervision to a defendant convicted of an
offense listed in Section 3g(a)(1) or for which the judgment contains an affirmative
finding under Section 3g(a)(2), the judge, if the nature of the offense for which the
defendant is convicted warrants the establishment of a child safety zone, may
establish a child safety zone applicable to the defendant by requiring as a condition
of community supervision that the defendant not:
(1) supervise or participate in any program that includes as
participants or recipients persons who are 17 years of age or younger
and that regularly provides athletic, civic, or cultural activities; or
(2) go in or on, or within a distance specified by the judge of,
a premises where children commonly gather, including a school, day-
care facility, playground, public or private youth center, public
swimming pool, or video arcade facility.
18
Acts 1999, 76th Leg., ch. 56, § 1, eff. Sept. 1, 1999.
19
See TEX . CODE CRIM . PROC. art. 42.12, § 13B(c) (“This section does not apply to a defendant
described by Section 13B.”).
Campbell — 10
could not lawfully be imposed upon him as a condition of parole by virtue of Section 508.221
of the Government Code.
The applicant’s parole should not have been revoked on the basis of a condition of
release that was unlawfully imposed upon him. I respectfully dissent.
Filed: October 15, 2008
Publish
|
Keywords
Keyword Search – Use our keyword search to find homes with specific features that are not already available below in additional search criteria.
The keyword search treats words inside double quotes as an exact search phrase. You can also use modifiers like AND, OR, and NOT.
Property Type
Single Family
Land
Condo
Townhouse
Multi-Family
# of units:
Listing features
Price reductions
Featured listings
Open houses
Listings with photos
Listing type
Foreclosures
Foreclosures Foreclosure properties listed on the MLS are properties where the lender/bank has taken ownership of the property through a foreclosure action. These types of properties are also referred to as Real Estate Owned (REO), or bank-owned properties.
Short Sales
Short Sales Based on property listings with the words SHORT SALE in the property description. Please be aware that this search criterion may not display a complete list of SHORT SALE properties in the area. Short Sale is one type of foreclosure related transaction and this search criterion may also capture foreclosures and home equity sales. Use of the term "short sale" in the property description on the property listing does not guarantee that the seller\'s mortgage lender has agreed to accept a payoff of less than the balance due on the loan and/or that the property is not already in default or in foreclosure.
New Construction
Fixer Uppers
Fixer Uppers Based on listings with the words TLC, FIXER, CONTRACTOR, or AS-IS in the property description. Please be aware that this search criterion may not display a complete list of Fixer Upper properties in the area.
Private 7 acre lot offers a stunning 2 story home with a finished basement, a fishing pond and a refreshing pool. Huge deck w/pool entry and a beautiful circle front entry. Long...
more
Private 7 acre lot offers a stunning 2 story home with a finished basement, a fishing pond and a refreshing pool. Huge deck w/pool entry and a beautiful circle front entry. Long winding driveway circles in front for easy parking and entering/exiting convenience. Master suite on main level w/jetted tub, and his/hers closets. Two half baths on main level. Double sided fireplace serves the great room and the sun room. Kitchen joins the formal dining room and study/office. Head upstairs to find 2 spacious bedrooms and a huge bonus/media room. The finished terrace level offers rec room, additional lg br with full bath, full kitchen and great storage space.
less
New: deck, dishwasher, stove, light fixtures, hardwood floors. Washer/dryer stays. Backyard is private, wooded and fenced on three sides. Great location, close to shopping and...
more
New: deck, dishwasher, stove, light fixtures, hardwood floors. Washer/dryer stays. Backyard is private, wooded and fenced on three sides. Great location, close to shopping and restaurants on Market Place Blvd.
less
Spacious 2 story with master on main. Eat-in, island kitchen with keeping room with fireplace, granite counters, double drawer stainless dishwasher, gas surface unit, convection oven, warming drawer, microwave. Two story great room. Large secondary bedrooms and 2 baths upstairs. Two car side entry garage, walkout basement. Situated in cul-de-sac, the gardens are beginning to bloom in this mountain and lake community with Pavillion and dock.
less
Lanier Country Club Estates offers the tranquil setting you seek in this Cumming neighborhood. This four bedroom two full bath and two half bath home sitting on Lake Lanier with...
more
Lanier Country Club Estates offers the tranquil setting you seek in this Cumming neighborhood. This four bedroom two full bath and two half bath home sitting on Lake Lanier with single slip covered dock with swim platform. Also featuring a full unfinished terrace level with half bath just more living space that could be used. Starting on the main in the entry way to the right find the living and dining rooms. Next the spacious eat-in kitchen. Continue into the vaulted ceiling family room with gas fireplace and adjoining sunroom. Huge deck off sunroom and patio below.
less
Ranch lover's delight, 3/2 plus bonus room. Open floor plan, vaulted ceilings, gourmet kitchen with granite counters, stainless steel appliances, huge island overlooking the breakfast area. Inviting foyer into a vaulted great room with fireplace opening into the dining room. Hardwood floors. A true split bedroom plan with the master retreat located off the sunroom with a, spa bath with double vanities, garden tub and separate shower. The master closet is very spacious. Two additional bedrooms are located at the front of the home. 3 car garage. Ready end of july. (file photos)
less
This beautifully appointed home will please a buyer with discriminating taste. Main floor has an open floor plan with formal living room and dining room, library, keeping room,...
more
This beautifully appointed home will please a buyer with discriminating taste. Main floor has an open floor plan with formal living room and dining room, library, keeping room, guest suite, mud room, kitchen. Upper level features huge master with dream closet, 3 other bedrooms with private baths, play room & laundry. Fully finished basement is made for entertaining & features a huge game room, sophisticated bar, home theater, walk-in wine cellar, sauna, bath, sitting room, 2 bedrooms. Outdoor living offers sun porch, screened porch, large patio.
less
You can use ZipRealty to search for current
MLS listings
of homes for sale in the Forsyth County School District area.
We show you up-to-date, accurate results of new homes for sale, condos for sale, townhomes for sale, foreclosed homes
for sale and land for sale.
Get more details about local schools that are part of
Forsyth County School District
by reading reviews, checking out test scores and viewing rankings on the interactive map.
See similar homes for sale near Forsyth County School District, and check out home photos, property
values, neighborhood information and more.
Selling your home? Use the Seller Center to see
how much your house is worth
and to look up nearby home values.
See all available Forsyth County School District real estate listings, and find the home meant for you.
The information being provided by Georgia Multiple Listing Service is for the consumer's personal, non-commercial use and may not be used for any purpose other than to identify prospective properties consumer may be interested in purchasing. Any information relating to real estate for sale referenced on this web site comes from the Internet Data Exchange (IDX) program of the Georgia Multiple Listing Service. Better Homes and Gardens Real Estate Metro Brokers is not a Multiple Listing Service (MLS), nor does it offer MLS access. This website is a service of Better Homes and Gardens Real Estate Metro Brokers, a broker participant of Georgia Multiple Listing Service. This web site may reference real estate listing(s) held by a brokerage firm other than the broker and/or agent who owns this web site. Listings marked with an icon are provided courtesy of the Georgia Multiple Listing Service, Internet Data Exchange Database.
The accuracy of all information, regardless of source, including but not limited to open house information, square footages and lot sizes, is deemed reliable but not guaranteed and should be personally verified through personal inspection by and/or with the appropriate professionals. The data contained herein is copyrighted by Georgia Multiple Listing Service and is protected by all applicable copyright laws. Any unauthorized dissemination of this information is in violation of copyright laws and is strictly prohibited.
|
It is alarming how quickly the myth has taken hold that Ed Miliband lost the general election because he was too “leftwing”. On the one hand, it might seem a reasonable guess at all the reasons for our failure. Miliband is, after all, the son of one of the 20th century’s most distinguished Marxist academics. But in reality, anyone who says that Labour’s policy positions under him represented a lurch to the left simply was not paying attention.
Certainly we had some signature policies that might be characterised as leftwing: notably the promise to ban some zero-hours contracts (but not all, as over-enthusiastic campaigners sometimes implied); the pledge to scrap the bedroom tax; and the proposal to introduce a mansion tax. Calling these policies leftwing is partly an attempt to trash them. But the truth is that these were policies that polled well; and, as someone who knocked on thousands of doors in the course of the campaign, I can testify that they were popular on the doorstep.
‘It is difficult to call a campaign leftwing when it proudly produced a souvenir mug about immigration controls.’
But it is difficult to call a campaign leftwing when its keynote labour market policies were framed as anti-immigrant, and it proudly produced a souvenir mug about immigration controls. And, predictably, trying to out-Ukip Ukip proved to be a doomed endeavour. It did not stop Ukip piling up votes in Labour areas, or taking enough votes off Ed Balls to gift his seat to the Tories.
Scrapping the bedroom tax was eyecatching, but the Labour party was always too frightened to contest the main Tory narrative about welfare. We should have spent five years reminding people endlessly that 50% of the welfare budget goes on the elderly, another 20% goes on in-work benefits, and a relatively small proportion goes on the archetypal “work-shy scrounger”. But we were too terrified of polls, which revealed that the Benefits Street narrative was wildly popular, to undertake the painstaking work of challenging the Tory narrative. So it all culminated a few months ago with Rachel Reeves, our shadow work and pensions secretary, saying bluntly that Labour was “not the party of people on benefits”. That may have been a pragmatic position. It was certainly not a leftwing one, or even particularly compassionate.
But the fundamental reason why it makes no sense to characterise Miliband’s policies as leftwing is the failure to challenge austerity. From the beginning, our shadow chancellor, Ed Balls, believed that the most important thing was to match the Tory approach to austerity. If you strip out the mansion tax and other gimmicks, we made it clear that we were going to match the Tories cut for cut outside protected areas such as education and health. It may have been the responsible approach, as Balls insisted. But it was scarcely leftwing. Yet commentators and former Labour ministers who are trashing Miliband for his supposed leftism go unchallenged. When the facts don’t fit their theory they ignore them.
We made it clear that we were going to match the Tories cut for cut outside protected areas such as education and health
They dismiss the fact that the majority of the Scottish electorate voted emphatically for a party with clear leftwing policies on, among other things, austerity and scrapping Trident. We are asked to believe that Labour voters in the west of Scotland voted SNP because of a mysterious mystic nationalism.
Miliband is a good man with progressive instincts. But the vitriol being poured on him by former Labour ministers perhaps has more to do with a sense of grievance that he did not consult with them enough than any extreme leftism in his policy positions.
|
Q:
Use of <> in Python. Is <> an operator?
>>> 1<>1
False
>>> 1<>2
True
>>> 1<>3
True
>>> 1<>0
True
>>> 1<>1
False
What is the use of <> in Python?
Can someone help in explaining the above or the '<>' in general.
A:
It's the inequality operator, synonymous to !=. From the documentation:
The forms <> and != are equivalent; for consistency with C, != is preferred; where != is mentioned below <> is also accepted. The <> spelling is considered obsolescent.
The <> spelling has been removed in Python 3.
|
Frequent demonstration of human herpesvirus 8 (HHV-8) in bone marrow biopsy samples from Turkish patients with multiple myeloma (MM).
In order to investigate the frequency of HHV-8 in MM patients from another geographic location, we obtained fresh bone marrow (BM) biopsies from Turkish patients with MM (n = 21), monoclonal gammopathy of undetermined significance (MGUS) (n = 2), plasmacytoma (n = 1) with BM plasma cell infiltration, various hematological disorders (n = 6), and five healthy Turkish controls. The frequency of HHV-8 was analyzed by polymerase chain reaction (PCR) in two independent laboratories in the USA and in Turkey. Using fresh BM biopsies, 17/21 MM patients were positive for HHV-8 whereas all five healthy controls, and six patients with other hematological disorders were negative. Two patients with MGUS, and one patient with a solitary plasmacytoma were also negative. The data from the two laboratories were completely concordant. Also using primer pairs for v IRF and v IL-8R confirmed the results observed with the KS330233 primers. Furthermore, sequence analysis demonstrated a C3 strain pattern in the ORF26 region which was also found in MM patients from the US. Thus, HHV-8 is present in the majority of Turkish MM patients, and the absence of the virus in healthy controls further supports its role in the pathogenesis of MM.
|
The main contribution of this paper with respect to previous work is the use of data on subjective perceptions to identify the Latin American middle classes. This paper provides a set of comparisons between objective and subjective definitions of middle-class using data from the 2007 World Gallup Poll. Seven objective income-based definitions of social class are contrasted with a self-perceived social status measure. Mismatches between the objective and the subjective classification of social class are the largest when the objective definition is based on median incomes. Mismatches result from the fact that self-perceived social status is associated not just with income, but also with personal capabilities, interpersonal relations, financial and material assets, and perceptions of economic insecurity. Objective definitions of the middle class based on absolute incomes provide the lowest mismatches and the most accurate differentiation of the middle class from other classes.
|
This article engages with the notion of ndembu traditional eco-masculinities which was conceptualised in a framework of sacrifice as ground for manliness i utilised this view as 1991, sacrifice and redemption durham essays in theology, cambridge university press, cambridge turner, vw, 1957.
|
Sry associates with the heterochromatin protein 1 complex by interacting with a KRAB domain protein.
In mammals, the SRY/Sry gene on the Y chromosome is necessary and sufficient for a bipotential gonad to develop into a testis, regardless of its chromosomal sex. The SRY/Sry gene encodes a protein that belongs to a high-mobility-group (HMG) box protein family and that has been postulated to modulate the expression of genes necessary for male gonadal differentiation. Using a yeast two-hybrid screen, we identified a novel protein containing only a Krüppel-associated box (KRAB) domain, which is hereafter named KRAB-O (KRAB Only), as an SRY-interacting protein. The KRAB-O protein is encoded by an alternatively spliced transcript from the Zfp208 locus that also produces another transcript coding for a KRAB-zinc finger protein, ZFP208. The interaction of the mouse SRY with KRAB-O was further confirmed by glutathione S-transferase pull-down assay and coimmunoprecipitation in transfected COS7 cells. The KRAB-O interaction domain in both the human and mouse SRY was mapped to the bridge region outside the HMG box. Indirect immunofluorescence and confocal microscopy show that the mouse SRY colocalizes with KRAB-O in nuclear dots in transiently transfected COS7 cells and primary fetal mouse gonadal cells. Using similar approaches, we demonstrate that KRAB-O interacts directly with KAP1 (KRAB-associated protein 1), the obligatory corepressor for KRAB domain proteins. Furthermore, we show that the mouse SRY is associated indirectly with KAP1 and heterochromatin protein 1 (HP1) through its interaction with KRAB-O, suggesting that the mouse SRY could use the KRAB-KAP1-HP1 organized transcriptional regulatory complex to regulate its yet-to-be-identified downstream target genes.
|
Monday, July 09, 2007
Eric Lill remembered by father
CHICAGO -- Army Specialist Eric Lill, who was killed in Iraq by animprovised explosive device, was so determined to join the military he wouldn’t take no for an answer, his father said Sunday.
Lill, 28 was rejected when he initially tried to enlist because he failed to meet physical fitness requirements, said Anthony Lill. But instead of feeling sorry for himself, Lill began exercising more and eating better, and was allowed to enlist in February of 2002.
“He worked so hard. He definitely wanted to get in,” Anthony Lill said. “He was not going to let the first rejection keep him out of it.”
Lill, who was attached to the 2nd Infantry Division based at Ft. Carson, Colo., died Friday in Baghdad following an attack on his vehicle during a patrol, said Anthony Lill, speaking by phone from his home in Lawrenceburg, Tenn.
“He was definitely doing what he wanted to do,” Anthony Lill said.
Lill grew up in Chicago’s Bridgeport neighborhood and planned to return to area when he was discharged from the Army in June 2008, according to his father. He attended St. Laurence High School in suburban Burbank and played hockey at Marshall University in Huntington, W.Va., where he studied briefly before enlisting.
The recently divorced father of two had helped trained Iraq police officers, Anthony Lill said. This was his second tour of duty in Iraq.
“He always told us that it was boring, but I don’t know if he was just telling us that so we wouldn’t worry,” Anthony Lill said.
|
Q:
Linked lists and references
list-->[-1-]<-->[-2-]<-->[-3-]<-->[-4-]<-->[-5-]
The above diagram is a circular doubly linked list of 5 nodes, and "list" is a reference/pointer to the first node.The last node, 5, and the fist node, 1, reference one another, as this list is circular, but I couldn't depict that diagrammatically.
Does the assignment
list.next.next.next =list.prev
on the above list modify it into the list
list-->[-1-]<-->[-2-]<-->[-3-]<-->[-5-]?
EDIT:
This isn't homework. I'm going over exercises in a textbook for self study. The book doesn't provide answers, so I decided to ask here.
A:
as it is double linked, to create an other, valid, doubly-linked list, you have to update at least one next and one prev link (in the general case). as you update only one next link, it can not create what you show, as this is a valid example.
3.next would be 5, but 5.prev would still be 4.
|
alculate (1/((-29)/(-5)))/((-520)/624).
-6/29
Calculate (18/(-21))/((-17)/(1666/(-14))).
-6
4/(-1)*(-220)/(-352)*(-6)/10
3/2
What is 152/10*365/146?
38
0/26*2*8/32
0
Calculate ((-102)/595*7)/((-465)/50).
4/31
Evaluate 19*(-13)/(-741)*-9*-4.
12
Evaluate (-4)/(-5)*12*(-7)/(-168).
2/5
What is the value of (-114)/19*(-2)/8*6?
9
(((-109)/3597)/(2/(-18)))/(-1)
-3/11
Calculate (49/(-14))/7*6.
-3
Calculate ((-36)/(-544))/9*2232/(-279).
-1/17
What is the value of ((-7)/(21/6))/2*12/126?
-2/21
Calculate (1108/554)/((2/24)/(4/(-6))).
-16
-1*((-792)/(-80))/(-11)*5
9/2
Calculate (4/(-8))/((-17)/(3876/(-95))).
-6/5
(6/(-40))/(12/(-56))*4
14/5
Calculate (-70)/(-21)*10/18*522/(-116).
-25/3
(-7)/((-476)/51)*96/90
4/5
Evaluate ((-32)/10)/(321/(-1605)).
16
(264/(-6688))/((-3)/24*3)
2/19
(-30)/(45/30*2)
-10
What is (-45)/12*-60*(-6)/900*-12?
18
What is (-21)/(-12)*(-59)/((-1062)/72)?
7
What is the value of 5/70*(3/2)/(54/(-720))?
-10/7
What is (-36)/24*((-168)/18)/7?
2
What is (6/1)/(8*(-10)/400)?
-30
((-1)/(5/9))/((-3222)/53700)
30
What is ((-40)/(-16))/((-35)/(-28))?
2
Calculate ((-140)/(-7))/2*(-4)/10.
-4
Evaluate ((2750/(-44))/5)/5.
-5/2
Evaluate ((-13)/312*8)/(6/54).
-3
What is the value of 115/(-2599)*((-28)/210)/(4/12)?
2/113
Calculate 7/(-441*31/(-434)).
2/9
What is 2/(((60/(-27))/(-10))/(-1))?
-9
What is 19/171*(-3)/2*36/18?
-1/3
What is ((-4)/((-192)/6)*60/6)/5?
1/4
Evaluate 1/(26/65)*(-32)/(-200).
2/5
Calculate (16/((-512)/24))/(4/(-8)).
3/2
Calculate 3*(-20)/150*-5*(-9)/(-6).
3
(-9)/(-6)*4012/(-354)
-17
(6/1)/((2/(-16))/(395/2844))
-20/3
What is the value of 45/105*4/6*5/2?
5/7
What is (9*(-16)/288)/(((-21)/35)/3)?
5/2
((-308)/70)/11*10/14
-2/7
Calculate (36/(-34))/((-215)/731).
18/5
Calculate (-9)/1*(-25)/(75/(-4)).
-12
Evaluate -2*(-1)/(-7)*3/((-12)/(-28)).
-2
Calculate ((-6)/(-12)*-6)/1.
-3
What is the value of (-2)/((-12)/12*6*4/(-8))?
-2/3
Evaluate 66/(-396)*2/(-4).
1/12
((-13)/(-65))/(1/30)
6
(11154/(-2145))/(4/10)
-13
Evaluate 0/1*(-44)/((-7920)/36).
0
1/(-9)*6*(-4)/(-496)*12
-2/31
((-24)/(-14))/(1/(322/(-69)))
-8
What is ((-5)/(15/(-18)))/(14*7/196)?
12
Calculate (4/10*(-45)/264)/(879/(-586)).
1/22
((-3)/9)/((-64)/768)
4
Calculate 17/((-10)/4*(-14)/35).
17
4/((19/(-19))/((-2)/4))
2
What is the value of (1/5)/(13/(-65))*-4?
4
What is (702/(-42))/(-13)*7?
9
Evaluate (36/((-1692)/(-235)))/((-2)/10).
-25
What is 7*60/14490*-3?
-2/23
Evaluate -1*(-36)/(-24)*(-13)/((-1755)/12).
-2/15
What is the value of 54/(-4)*17*60/(-1530)?
9
What is (296/370)/((-7)/((-210)/(-36)))?
-2/3
Calculate ((88/10)/2)/(200/500).
11
Evaluate 132/8*(-162)/243.
-11
Evaluate ((-356)/80456)/(1*2/(-8)).
2/113
Calculate ((90/(-25))/(-3))/(124/155).
3/2
What is the value of ((-45)/(-60))/(13/(5096/(-21)))?
-14
(((-6)/(-8))/1)/((-6)/(288/(-12)))
3
Calculate (-16)/10*(1360/136)/(8/10).
-20
What is the value of (427/(-5124))/(45/24)?
-2/45
What is 22/(-4)*2700/27225?
-6/11
72/81*-2*1/(-4)
4/9
What is -5*16/(-96)*-6*(-1)/8?
5/8
What is the value of ((-44)/(-440))/(6/8)?
2/15
Calculate ((-48)/72)/(10/60).
-4
Evaluate (-1)/((-9)/63)*(-10)/(-14).
5
((-1880)/30456)/((-5)/6)
2/27
What is (-10)/((1148/(-42))/41)?
15
What is 24/(-270)*15/90*15?
-2/9
Evaluate 17*2*(-380)/760.
-17
Evaluate (16/64)/(9/70*28/24).
5/3
(-3351)/14521*(-2)/(-3)
-2/13
(((-25)/30)/(-5))/(3/(-18))*1
-1
13/(520/(-32))*8/(288/60)
-4/3
Calculate 4/2*((-4)/12)/((-2)/(-30)).
-10
((-560)/32)/(((-20)/5)/(-8))
-35
Calculate 2/16*2288/22.
13
Calculate (112/84)/((-1)/(-24)).
32
((20/8)/5)/(24/(-80)*5)
-1/3
What is the value of 50/(-4)*(-280)/(-300)*(-24)/28?
10
Evaluate ((22272/16)/48)/((-2)/(-2)).
29
What is 10/(-9)*((-15120)/(-175))/(-24)?
4
What is (40/240*3/2)/(-1)?
-1/4
Calculate (10/6)/(((-132)/(-216))/(6/(-36))).
-5/11
Evaluate (-37)/(6327/(-152))*2/8.
2/9
What is the value of (2080/(-48))/(-13)*6?
20
Evaluate 6*5*(-221)/510.
-13
What is ((-41)/(6232/(-171)))/(3/(-2))?
-3/4
Evaluate 2180/(-327)*(-14)/60.
14/9
((-17)/425)/((-5)/(-5))*1/1
-1/25
165/(-110)*4*2/(-3)
4
1335/(-890)*68/(-6)
17
Calculate 7/((-1092)/(-117))*4/(-6).
-1/2
Evaluate (-55)/(-3)*396/1452.
5
What is the value of 15/42*(-14)/(-35)*(-44)/(-33)?
4/21
(30/(-6))/((-1)/(-8)*4)
-10
What is 0/(15*7/105)?
0
What is the value of ((26/(-5))/(-1))/((72/45)/4)?
13
What is 8*15/(-4560)*2/(-1)?
1/19
What is (120/9)/(540/(-810))?
-20
What is the value of ((-48)/(-80))/((-2)/8)*(-870)/(-116)?
-18
What is (638/(-1617))/29*6/2?
-2/49
Calculate 3/(((-4)/4*3)/(-2)).
2
What is the value of (-595)/(-714)*(42*(-4)/(-30))/(-2)?
-7/3
What is (-35)/7*21/1575*-6?
2/5
Evaluate (-11*(-2)/(-8))/(((-1300)/80)/65).
11
Calculate 36/(-48)*(-12)/(-315)*-10.
2/7
Calculate 65/(-91)*7*16/(-20).
4
Calculate ((-144)/(-45))/(((-1)/5)/(1/1)).
-16
Calculate (-20)/50*5/13.
-2/13
120/(-400)*(-10)/(-12)*4*11
-11
What is -1*9/36*(-8)/8?
1/4
Evaluate (((-156)/13)/(-12))/((-14)/(-308)).
22
What is (56/182)/(108/78)?
2/9
Evaluate (6/15)/(((-23)/(184/32))/(-230)).
23
What is (8/500*10)/(35/((-2450)/(-56)))?
1/5
Calculate (1/((-6)/9))/((-882)/(-252)).
-3/7
Evaluate ((-117)/26)/(1*2*3/(-12)).
9
What is the value of (((-76)/(-6))/19)/((-16)/9*-1)?
3/8
What is the value of (2/42)/(14/(-12)*(-155)/(-1085))?
-2/7
Calculate ((-54)/9)/((300/16)/5).
-8/5
What is the value of 5/((-245)/(-7))*3?
3/7
What is 5/6*25*148/(-50875)?
-2/33
Evaluate (-14)/(-76)*(-44)/(-77).
2/19
What is 14*(-19)/380*5?
-7/2
What is the value of (-60)/(-16)*15*1/(-25)?
-9/4
What is the value of (-50)/35*728/(-1430)?
8/11
What is (240/(-1950)*13)/((-2)/10*1)?
8
((89/178)/(3/2))/(1/93)
31
Calculate 1/3*0/(-115).
0
Evaluate (110/(-825))/((-12)/9).
1/10
((-2)/48*-4)/((135/6)/(-9))
-1/15
Calculate 3/(-9)*756/3150.
-2/25
What is the value of 18/(-3)*2/(-3)*4/(-8)?
-2
What is the value of 3*(-1)/5*(-1200)/(-432)?
-5/3
Evaluate (-3)/5*560/(-24).
14
What is the value of (8/36)/((6/(-8))/((-6)/8))?
2/9
What is the value of (10*5/(-30))/((-136)/408)?
5
Evaluate 6*13/(195/(-5)).
-2
Calculate ((-40)/4)/20*598/23.
-13
Evaluate ((-32)/(-56))/(504/(-588)).
-2/3
What is the value of (6/5)/((-28)/(-3)*(-237)/(-790))?
3/7
Evaluate 9/36*(-80)/(-60).
1/3
What is the value of 0/(8/((-32)/4))?
0
What is ((-12)/(-600)*5)/(-1)?
-1/10
What is the value of (-11)/((-44)/16)*(-6)/(60/1)?
-2/5
((-1)/52*268/(-134))/((-1)/4)
-2/13
What is (5/35)/(88/(-3388))*-1*2?
11
Calculate (1/((15/3)/(-35)))/(-5).
7/5
What is ((-28)/(-7))/(4/((-160)/10))?
-16
Evaluate ((-1)/(-3)*0)/(((-84)/4)/7).
0
((-3)/(-30))/(9/1530)
17
Evaluate -6*((-15)/(-135))/((-5)/(-12)).
-8/5
Evaluate (((-770)/(-21))/10)/((-5)/(-15)).
11
What is the value of (-11*(-78)/(-286))/((-2)/2)?
3
Calculate (201/(-335))/(3/45).
-9
What is the value of 138/(-8)*-8*(-11)/66?
-23
Evaluate ((-12)/(-10))/(2/60*(-14256)/(-352)).
8/9
What is the value of 35/(13125/30)*5?
2/5
Evaluate 87/(-435)*(-75)/(-24).
-5/8
Calculate (((-18)/135)/(44/55))/(12/(-16)).
2/9
Evaluate ((-8)/60)/(117/65)*12.
-8/9
Evaluate -2*5*6/15.
-4
Calculate (16/(-24))/(10/(-6))*14/84.
1/15
What is 15*(-6)/(-15)*(-5)/645?
-2/43
Evaluate (-3)/(-8)*-60*48/(-600).
9/5
What is the value of 41*31/6355*-20?
-4
Calculate -3*((-153)/(-17))/(-324).
1/12
What is the value of (18/120)/(17/272)*5?
12
(2/4*(-64)/8)/(46/(-1))
2/23
16/(-10)*(-10)/104
2/13
Evaluate ((-1)/((-48)/8)*6)/((-3)/(-48)).
16
Evaluate ((-376)/(-1034))/(2*2/(-2)).
-2/11
Calculate 10/(-405)*14/((-686)/63).
2/63
Calculate (-44)/(-6)*9765/(-11935).
-6
What is the value of ((-246)/41*(-34)/(-8))/((-12)/8)?
17
Calculate 4/(-2)*-1*(-513)/54.
-19
Evaluate (152/228)/(8/(-60)*-3).
5/3
Evaluate ((-22)/66)/((266/(-588))/(-19)).
-14
Evaluate 3/((3/(-6))/(28/42)).
-4
What is (40/(-168))/(24/168)?
-5/3
(-6565)/10504*-4*4
10
(2*(-5)/20)/(4*2/416)
-26
Calculate 5*2*(-17)/(-425).
2/5
What is (3/190)/((-2493)/(-3324))?
2/95
((-3)/66*32/4)/(6/3)
-2/11
What is (-54)/(-6)*19/(2907/(-119))?
-7
Calculate (306/(-136))/(8/(256/12)).
-6
Evaluate (60/30)/(1/(((-3)/1)/18)).
-1/3
Evaluate (160/44)/(-5)*((-60)/(-16))/3.
-10/11
Calculate 120/(-16)*(-16)/12.
10
What is the value of ((-270)/27)/(-80)*1/(-1)?
-1/8
Evaluate 94/1410*18/2*4/(-8).
-3/10
-4*(-371)/318*(-6)/(-14)
2
What is the value of (52/(-247))/(14/133)?
-2
Calculate ((-45)/12)/((-75)/(-200)).
-10
6*((-8)/(-48))/(((-28)/32)/(-7))
8
41/((-4059)/(-132))*(-3)/106
-
|
Hillary Clinton has already used Bernie Sanders' comments about gun control to cynically accuse him of sexism. Now, she's using his comments on gun control to imply that he's a racist.
“There are some who say that this [gun violence] is an urban problem," Clinton said on Friday, speaking to the Charleston, South Carolina NAACP, in a clear reference to Sanders. "Sometimes what they mean by that is: It’s a black problem. But it’s not. It’s not black, it’s not urban. It’s a deep, profound challenge to who we are.”
Advertisement:
Clinton running an ad highlighting her support for gun control is politically smart given Sanders' idiosyncratic record on the issue. But her willingness to smear a left-wing opponent is cynical and particularly remarkable coming from a candidate who has supported some of the most anti-black political initiatives of the past three decades.
Hillary Clinton embraced welfare reform, a major assault on poor people in general and poor black women in particular, and she brazenly stoked racist prejudice during her losing race in 2008 against Obama. She is also a very recent convert to the idea that the system of mass incarceration erected by her husband's administration is a racist disaster (and something, as I will explore in my next story, that gun control measures often abet).
In 1998, she praised the 1994 crime bill for combining "tough prosecution measures with smart prevention efforts" and called for "zero tolerance for guns and drugs in school."
Advertisement:
“There is something wrong when a crime bill takes six years to work its way through Congress and the average criminal serves only four," Hillary Clinton said in 1994, the year the bill was passed, employing stop-criminal-coddling language typical of the law-and-order set.
She went on:
Advertisement:
"We need more police. We need more and tougher prison sentences for repeat offenders. We need more prisons to keep violent offenders for as long as it takes to keep them off the streets...We will be able to say, loudly and clearly, that for repeat, violent, criminal offenders — three strikes and you’re out. We are tired of putting you back in through the revolving door.”
Bill Clinton's tough-on-crime agenda, as Andrew Cohen wrote, included "a federal 'three strikes' policy, and a broadening of the categories of crimes eligible for the federal death penalty. There also were new hurdles imposed upon capital appeals, making it more likely that innocent men would languish for decades on death row."
Under Bill Clinton, the number of people incarcerated nationwide continued its explosion, and the population of federal prisons rose from 83,669 in 1995, to 131,739 in 2000, to 192,663 in 2014, according to the Sentencing Project.
Advertisement:
As late 2008, Clinton staffers pointed to Obama's criticism of mandatory minimum sentences to suggest that he was too liberal. And Clinton still supports the death penalty, something she quietly clarified in October after what Politifact describes as 15 years of obfuscatory silence. Someone may have advised her that it would be one too many issues to "evolve" on all of a sudden. There is, after all, so much to evolve about.
According to the Marshall Project, Bill Clinton's law-and-order record, which Hillary Clinton embraced and owned, included:
"harsher sentencing guidelines; $9.7 billion in new funding for the construction of prisons; $10.8 billion for 100,000 new police officers; more federal crimes punishable by the death penalty; the end of higher-education grants for prisoners; the exclusion of drug offenders from food stamps and welfare; encouragement to states to try more children as adults; the distribution of surplus military equipment to local police departments; and time limits on death-penalty appeals."
Sanders also voted for the 1994 bill, he has said, because it included the Violence Against Women Act. And his support opens him to legitimate criticism. But at the same time, he did not embrace the same law-and-order rhetoric. To the contrary, he specifically condemned tough-on-crime legislation as disproportionately punishing poor and black people and ignoring root causes of crime like poverty.
Advertisement:
"This is not a crime prevention bill," he stated in a 1991 House speech condemning a similar bill. He continued:
"This is a punishment bill. A retribution bill. A vengeance bill...We have the highest percentage of people in America in jail per capita of any industrialized nation on earth...What do we have to do, put half the country behind bars?...Instead of talking about punishment and vengeance let us have the courage to talk about the real issue. How do we get to the root causes of crime? How do we stop crime?...Let's demand that every man, woman, and child in this country have a decent opportunity and a decent standard of living. Let's not keep putting poor people into jail and disproportionately punishing blacks."
There is an odd notion that Hillary cannot be held to account for any of the Clinton Administration's policies, even those, like welfare reform, that she has consistently supported in her own words. A woman is not her husband's property and she should not be judged in reference to him. But it's hard to take this argument seriously when you were a policymaking First Lady who publicly backed the positions in question.
At the end of the day, some Clinton partisans don't want her to have to answer for Clintonism, whether the subject be welfare reform, mass incarceration, free trade or Wall Street bonhomie. Rather, she wants to embrace Bill and the halcyon aura of his administration when it suits her and duck questions about his administration’s conservative bent when convenient.
Advertisement:
It's healthy that Democrats are finally having an argument about the future of their party and the country. Both sides should get a fair hearing, and their records should be scrutinized. Clinton now seems interested in making baseless smears a central feature of her campaign. Allowing her to do so will only further obscure the debate.
|
LogicBlox 4.7
LogicBlox 4.7.4
Release Date: January 18, 2019
Corrected Issues
The issues listed below have been corrected
since the 4.7.3 release:
Tools, Database, and Services
Fixed an error in the maintenance of predicates defined by linear recursion rules.
If there are any changes to the grouping predicates that appear in the body of a previously-defined linear recursion
P2P rule, the rule is now re-evaluated.
The previous (incorrect) behaviour was to silently ignore such changes.
|
/*****************************************************************************
*
* PROJECT: Multi Theft Auto v1.0
* LICENSE: See LICENSE in the top level directory
* FILE: gui/CGUICheckBox_Impl.cpp
* PURPOSE: Checkbox widget class
*
* Multi Theft Auto is available from http://www.multitheftauto.com/
*
*****************************************************************************/
#include "StdInc.h"
#define CGUICHECKBOX_NAME "CGUI/Checkbox"
CGUICheckBox_Impl::CGUICheckBox_Impl(CGUI_Impl* pGUI, CGUIElement* pParent, const char* szCaption, bool bChecked)
{
m_pManager = pGUI;
// Get an unique identifier for CEGUI (gah, there's gotta be an another way)
char szUnique[CGUI_CHAR_SIZE];
pGUI->GetUniqueName(szUnique);
// Create the window and set default settings
m_pWindow = pGUI->GetWindowManager()->createWindow(CGUICHECKBOX_NAME, szUnique);
m_pWindow->setDestroyedByParent(false);
m_pWindow->setText(CGUI_Impl::GetUTFString(szCaption));
m_pWindow->setSize(CEGUI::Absolute, CEGUI::Size(128.0f, 16.0f));
m_pWindow->setVisible(true);
// Store the pointer to this CGUI element in the CEGUI element
m_pWindow->setUserData(reinterpret_cast<void*>(this));
// Register our events
AddEvents();
// Set selected state
SetSelected(bChecked);
// If a parent is specified, add it to it's children list, if not, add it as a child to the pManager
if (pParent)
{
SetParent(pParent);
}
else
{
pGUI->AddChild(this);
SetParent(NULL);
}
}
CGUICheckBox_Impl::~CGUICheckBox_Impl()
{
DestroyElement();
}
void CGUICheckBox_Impl::SetSelected(bool bChecked)
{
reinterpret_cast<CEGUI::Checkbox*>(m_pWindow)->setSelected(!bChecked);
}
bool CGUICheckBox_Impl::GetSelected()
{
return !(reinterpret_cast<CEGUI::Checkbox*>(m_pWindow)->isSelected());
}
|
---
title: Chaining variations
---
Our division function returned a `Maybe` because there is a case when it can't
give a meaningful answer. But what if we were using a different operator that
doesn't fail?
salaries :: [(String, Integer)]
salaries = [ ("alice", 105000)
, ("bob", 90000)
, ("carol", 85000)
]
Write a function `addSalaries` that adds two salaries by person name.
addSalaries :: [(String, Integer)] -> String -> String -> Maybe Integer
You give this function a data structure with salary info and the names of two
people and it returns the sum of their salaries. But if you give it a name
that is not in the list, then there is no way to add the salaries so it should
return `Nothing`.
Now generalize this pattern in the same way we generalized `chain`/`link` in
the previous exercise.
Call this function `yLink`...because it is kind of like a y-shaped `chain`/`link`.
Coming up with the right type signature is often the tricky part. Take a look
at how we came up with the `chain` type signature in the last exercise and see
if you can came up with `yLink`'s type signature. Make a serious effort here.
If you were not able to come up with a good generalized type signature, here is
the [hex](http://www.convertstring.com/EncodeDecode/HexDecode) encoded version
of what we are looking for.
794C696E6B203A3A202861202D3E2062202D3E206329202D3E204D617962652061202D3E204D617962652062202D3E204D617962652063
Once you have the type signature, implement `yLink` using `link`. *Do not use cases or pattern matching*. Once
you have that working, implement `addSalaries` again as `addSalaries2` using `yLink`
this time.
Notice that in both `addSalaries` and `yLink` you have to construct a `Maybe` out of
thin air kind of like we did in Set 1 with `mkGen`. Write a similar function for
`Maybe`s with this type signature.
mkMaybe :: a -> Maybe a
Now use this function in your `addSalaries` and `yLink` functions. You'll probably
find this easier for `Maybe` than it was for `Gen`. It may not seem worthwhile, but
this is all about finding common patterns. This pattern has come up twice in two
different contexts now, so it's probably worth paying attention to.
[Previous Page](ex2-4.html) - [Next Page](ex2-6.html)
|
What do "interpersonally sensitive" supervisors do and how do supervisees experience a relational approach to supervision?
In two investigations, we identified explicitly relational supervision strategies and examined whether use of these strategies was associated with perceptions of the supervisory alliance and evaluations of the supervisor. First, ratings by nine supervision researchers identified five clearly relational in-session strategies (focus on countertransference, exploration of feelings, attend to parallel process, focus on the therapeutic process, focus on the supervisory alliance) in the Critical Events model of supervision. Based on these expert ratings, we created and assessed the Relational Behavior Scale (RBS). Analyses with two samples of supervisees at all levels of training supported the measure's reliability and factorial validity. The RBS's validity was further indicated by its unique association with the "interpersonally sensitive" style of supervision. In both studies, supervisees perceived more frequent use of relational behavior on the part of psychoanalytic/psychodynamic/humanistic supervisors than cognitive-behavioral supervisors. Moreover, as hypothesized, supervisors' use of relational behavior in a specific session mediated the association between trainees' alliance perceptions and evaluations of their supervisors in that session. The identification of specific in-session supervision behaviors that explain one way in which a strong alliance contributes to trainees' positive experiences of their supervisors has implications for supervision theory, research, and practice.
|
More
Digital Playground to Enter Ring With 'Fighters' This Fall
VAN NUYS, Calif. — Digital Playground has announced plans to release a big-budget feature called "Fighters" on Sept. 27.
Conceived by Digital Playground's founder Joone and written and directed by Robby D., "Fighters" will five of the company's current contract girls.
The story follows Jesse Jane and Kayden Kross, two beautiful, passionate girls from opposite walks of life that come together in a battle of lust and unyielding wills to fight it out in the ring.
Riley Steele plays Jane's streetwise naughty sister and Stoya is Kross's equally privileged best friend. And BiBi Jones plays the role of the new girl in town who sleeps with Jane's dad, creating even more fighting. The sparring both in and out of the ring leads to some fierce sexual encounters, the company said.
Jane and Kross both underwent months of boxing training and fight choreography for their roles. Jane said "Fighters" was the hardest movie she's ever done.
"I had to train in boxing for three months before we started shooting and gained some serious muscle weight," she said. "It took a lot of hard work and commitment, but it was worth it. I think this is the best I've ever done in a movie, and I can't wait to see it."
"I've never actually immersed myself in a role so deeply," Kross added. "Jesse and I had to undergo a physical and mental transformation for our characters to be authentic and I hope the fans like what they see."
Joone remarked, "When creating a film on the scale of 'Fighters,' I knew it would be important for the girls to be convincing as boxers. 'Fighters' really portrays a side of Jesse Jane and Kayden Kross that audiences have never seen before and is without a doubt the best performance of Jesse's career."
Director Robby D., who recently helmed "Babysitters 2" and prior to that "Top Guns," said, "I really felt strongly that this story needed to be told. So often in the adult industry, we get cast in a negative light with regards to the treatment of women. This story is about the empowerment of women and the ability for people in general to overcome obstacles in their lives and regain control. There is also a lot of hot, dirty sex and some great cat fights."
Company president Samantha Lewis remarked, "Robby D. has once again created and directed an amazing ensemble cast of strong, sexy and confident female characters. Robby's ability to raise the bar with every feature is not surprising because of his dedication to his work. We are extremely fortunate to have one of the very best directors, if not the best in the adult entertainment industry, leading the DP team."
Limited edition "Fighters" posters are now available free to retailers and distributors. The poster artwork can be downloaded here.
|
Multiple unfolding states of glutathione transferase from Physa acuta (Gastropoda [correction of Gastropada]: Physidae).
The equilibrium unfolding of the major Physa acuta glutathione transferase isoenzyme (P. acuta GST(3)) has been performed using guanidinium chloride (GdmCl), urea, and acid denaturation to investigate the unfolding intermediates. Protein transitions were monitored by intrinsic fluorescence. The results indicate that unfolding of P. acuta GST(3) using GdmCl (0-3.0M) is a multistep process, i.e., three intermediates coexist in equilibrium. The first intermediate, a partially dissociated dimer, exists at low GdmCl concentration (approximately at 0.7M). At 1.2M GdmCl, a dimeric intermediate with a compact structure was observed. This intermediate undergoes dissociation into structural monomers at 1.75M of GdmCl. The monomeric intermediate started to be completely unfolding at higher GdmCl concentrations (>1.8M). Unfolding using urea (0-7.0M) and acid-induced structures as well as the fluorescence of 8-anilino-1-naphthalenesulfonate in the presence of different GdmCl concentrations confirmed that the unfolding is a multistep process. At concentrations of GdmCl or urea less than the midpoints or at the midpoint pH (pH 4.2-4.6), the unfolding transition is protein concentration independent and involved a change in the subunit tertiary structure yielding a partially active dimeric intermediate. The binding of glutathione to the enzyme active site stabilizes the native dimeric state.
|
---
# Example bridging configuration from https://wiki.debian.org/NetworkConfiguration
ifupdown_default_interfaces:
- iface: 'br0'
type: 'bridge'
inet: 'static'
options: |
address 10.10.0.15
netmask 255.255.255.0
gateway 10.10.0.1
bridge_ports eth0 eth1
up /usr/sbin/brctl stp br0 on
- iface: 'br1'
type: 'bridge'
auto: True
inet: 'manual'
options: |
bridge_ports eth4
up /usr/sbin/brctl setageing brl 0
up /usr/sbin/brctl stp br0 off
|
Generally, in order to fabricate a cast piece (which is the general term for slab, billet, bloom, beam blank and the like) in a continuous casting machine, molten steel in a liquid state supplied from a ladle passes through a mold via a tundish that stores the molten steel, and then a solidified shell in a solid state is formed by means of a cooling operation in the mold. While the solidified shell obtained by cooling the molten steel is guided by a guide rolls installed below it, the solidified shell is solidified by a secondary cooling water sprayed by spray nozzles, thereby becoming a cast piece in a complete solid state.
During the continuous casting work of steel, mold flux as a subsidiary material as well as molten steel is input into the mold together when the molten steel is supplied into the mold. The mold flux is generally input in a solid state, such as powder or granule, and is melted by heat generated in the molten steel supplied into the mold, thereby controlling heat transfer between the molten steel and the mold and improving the lubricating ability.
As shown in FIG. 1, the mold flux input into the mold in the shape of powder or granule is melted on an upper surface of the molten steel 12 to form a liquid layer 21, a sintering layer (or semisolid layer) 23 and a powder layer 25 in order from the molten steel surface. The liquid layer 21 is substantially transparent, so that a radiant wave with a wavelength of 500 to 4,000 nm emitted from the molten steel can be easily transmitted through the liquid layer 21. On the other hand, the sintering and powder layers 23 and 25 are optically opaque, thereby blocking a radiant wave and thus preventing a rapid decrease of temperature of the molten steel surface.
However, after the conventional mold flux in the shape of powder or granule is melted by the heat of the molten steel, the liquid layer 21 flows between the mold 10 and the solidification layer 11, thereby being solidified on an inner wall surface of the mold 10 to form a solid slag film 27 and also forming a liquid slag film on the molten steel side to control heat transfer between the molten steel and the mold and improve the lubricating ability.
At this time, at the point where the molten slag begins to flow between the solid slag film 27 and the solidified shell 11, the mold flux adhering to the mold is formed to protrude to the inside of the mold. This portion is referred to as a slag bear 29. The slag bear 29 prevents the molten slag from being introduced between the mold flux film 27 and the solidified shell 11.
This slag bear 29 restricts consumption of mold flux per unit area of a cast piece. Generally, the consumption of mold flux decreases as a casting speed increases, so that the lubricating ability between the cast piece and the mold is deteriorated to thereby increase frequency of occurrence of break-out. In addition, since the thickness of the liquid layer of mold flux becomes irregular due to the slag bear 29, the shape of the solidified shell 11 in the mold 10 becomes irregular, thereby causing surface cracks, which is also more serious as a casting speed is increased.
In this regards, Korean laid-open Patent Publication No. 1998-038065 and U.S. Pat. No. 5,577,545 disclose a method for restraining growth of the slag bear by lowering the melting speed of mold flux by coating mold flux with graphite or fine carbon black. However, this method cannot prevent a slag bear fundamentally. In addition, when the melting speed of mold flux is low, the mold flux in an un-molten state is introduced between the solidified shell and the mold, which causes irregularity of the solidification and also increases break-out defects.
In order to solve the above problem, Japanese Laid-open Patent Publication No. 1989-202349, 1993-023802, 1993-146855, 1994-007907, 1994-007908, 1994-047511, 1994-079419, 1994-154977 and 1994-226111 disclose a method for melting mold flux at the outside of a mold and then injecting it through a molten steel surface. However, the aforementioned documents suggest that the mold flux in a molten state is limitedly used only in an initial casting process, and then, once the casting work reaches a normal state, mold flux in the shape of powder is used to return to the conventional operation. As mentioned above, since the mold flux in a molten state is substantially transparent in a wavelength of 500 to 4,000 nm, a radiant wave emitted from the molten steel may easily pass through the mold flux, so that the surface of the molten steel cannot be kept at a set temperature due to the increased radiant heat transfer. Accordingly, if the casting is progressed for a certain time, the surface of the molten steel may be solidified, which would be an obstacle in performing the continuous casting process.
In addition, paper has been used to supply the mold flux in a molten state into the mold. However, the paper has a limit in supplying the mold flux in a molten state throughout the entire period of the continuous casting process.
|
Pronunciator
Pronunciator is a set of webpages, audio and video files, and mobile apps for learning any of 87 languages. Explanations are available in 50 languages. 1,500 libraries in the US and Canada subscribe and make it available free to their members, including state-wide in Texas, North Carolina, Louisiana, and Arkansas.
Methods of teaching
In each lesson (drop-down menus) students have to learn words in order, and can click to repeat when needed. The software can listen and score pronunciation, and students can record their voice, and compare it to the lesson. Some languages have grammar lessons as well as vocabulary. The "Main course" has "Core Vocabulary" with 100 categories from beginner to intermediate, Powerful Phrases with 50 travel categories, and 100 verbs conjugated. Some languages have audio downloads of songs, with lyrics, called ProRadio. Some languages have videos with subtitles which let learners loop any phrase in the video. There are lessons to prepare for the US citizenship exam and health vocabulary.
The recorded voices are native speakers of each language.
Languages taught
Afrikaans, Albanian, Amharic, Arabic, Armenian, Azerbaijani, Basque, Belarusian, Bengali, Bulgarian, Catalan, Cebuano, Chinese (Cantonese), Chinese (Mandarin), Chinese (Pinyin), Chinese (Xiang), Croatian, Czech, Danish, Dutch, English (American), English (British), Estonian, Finnish, French, Galician, German, Greek, Gujarati, Haitian Creole, Hebrew, Hiligaynon, Hindi, Hungarian, Icelandic, Indonesian, Irish, Italian, Japanese, Japanese (Romaji), Javanese, Korean, Kurdish, Lao, Latvian, Lithuanian, Macedonian, Malagasy, Malay, Malayalam, Maltese, Marathi, Mongolian, Nepali, Norwegian, Pashto, Persian, Polish, Portuguese (Brazil), Portuguese (Portugal), Romanian, Russian, Serbian, Sindhi, Sinhala, Slovak, Slovene, Somali, Spanish (Latin America), Spanish (Spain), Swahili, Swedish, Tagalog, Tamil, Telugu, Thai, Tibetan, Turkish, Ukrainian, Urdu, Uzbek, Vietnamese, Welsh, Xhosa
Public reception
Pronunciator has been reviewed by Library Journal
and was "Highly recommended" with three stars in Choice: Current Reviews for Academic Libraries.
It is used to teach undergraduates at major universities,
and used for the public at major city libraries.
It is cited in reporting on libraries.
See also
Language education
Language pedagogy
List of Language Self-Study Programs
External links
Review of Pronunciator
References
Category:Second-language acquisition
Category:Language education materials
Category:Multilingual websites
Category:Language learning software
|
Mittelstadt’s OT Winner Lifts Gophers over Irish
Minneapolis, MN – After playing good hockey in South Bend in November with nothing to show for it, the Minnesota Gophers were hungry to flip the script against the Notre Dame Fighting Irish.
It took more than the standard 60 minutes, but in the end the hometown fans went home happy.
Minnesota and Notre Dame played yet another exciting hockey game Friday night, with the Gophers dominating the game for the final 40 minutes of action but settling for a 0-0 tie heading into overtime. Casey Mittelstadt scored 3:35 into the five-minute extra session to break the stalemate and give the Gophers a well-deserved victory.
One cold Friday night in November, Minnesota (16-12-1 Overall, 7-9-1 B1G) put 44 shots on Notre Dame (19-5-1, 13-2-0) but had to settle for a 1-0 defeat behind the stalwart goaltending effort of Irish goalkeeper Cale Morris. Morris, who leads the nation in Sv% (.952) and is 3rd in GAA (1.62), looked like he was going to stymie the Gophers yet again, turning aside all 31 Gopher shots he faced in regulation.
Gopher goalie Mat Robson matched Morris’ 60-minute shutout with one of his own, stopping 21-of-21 Notre Dame shots that came his way throughout regulation play. No saves were bigger for Robson and the Gophers than those he made on the penalty kill in the final minutes of the game. Gopher forward Brannon McManus took a tripping penalty with just 2:49 remaining in the 3rd period of a 0-0 tie game, but Robson and the Gopher penalty kill were able to keep the Notre Dame attackers off the board.
In the overtime session, both teams had good opportunities, and both goalies were solid. The winning play was created by Casey Mittelstadt, who poked a puck through a defender’s legs in the neutral zone to create an odd-man rush. Mittelstadt entered the zone, passed the puck to Rem Pitlick in the high slot and continued to the net. Pitlick’s shot caught Morris up high, and the rebound fell right to Mittelstadt at the side of the net, who tucked the puck home for the game-winner at 3:35 of overtime.
Notre Dame, who had previously cruised through Big Ten competition, rattling off 13-straight conference wins and taking a death-grip over the Big Ten regular season crown, has entered what appears to be a mini-slump of late. The Irish have now dropped two games in a row after losing their first Big Ten contest 5-0 last Sunday to Wisconsin in the United Center in Chicago before Friday’s loss to Minnesota. The Irish’s last goal was an empty netter at 19:22 of the previous Friday’s win over Wisconsin, which means that they have gone 124:13 without scoring a goal.
Minnesota, on the other hand, may be rounding into form. After dropping a pair of games at home to Michigan, the Gophers have righted the ship, sweeping Michigan State on the road before notching the win over Notre Dame. Minnesota’s 23 league points are good for T-4th in conference, just one behind Michigan in third and 5 behind Ohio State in second. The Gophers need to finish 4th or better in conference to earn home-ice advantage in the first round of the Big Ten Tournament, which will be played on campus sites for the first time this season.
Minnesota and Notre Dame square off again Saturday evening at 7PM. The game can be seen on FSN+, streamed on BTN2Go, and heard on AM1130.
|
Watch Something Borrowed: Rachel is a lawyer. When she was in law school she fell for another student, Dex, who comes from an affluent family, but she was too shy to say anything. When Dex meets her best friend Darcy, who sometimes treats her like dirt, Darcy makes a move on Dex and gets him. Eventually, they get engaged and Darcy asks Rachel to be her Maid of Honor. However, Rachel still has feelings for Dex and still can't say anything. Darcy throws her a birthday party and Dex is there. When she and Dex are alone she blurts out that she had a thing for him in college which surprised him, and after drinking a little they spend the night together. They try to forget the whole thing and agree that it means...
|
//
// SlideToCancelViewController.h
// SlideToCancel
//
#import <UIKit/UIKit.h>
@protocol SlideToCancelDelegate;
@interface SlideToCancelViewController : UIViewController {
UIImageView *sliderBackground;
UISlider *slider;
UILabel *label;
NSTimer *animationTimer;
id <SlideToCancelDelegate> delegate;
BOOL touchIsDown;
CGFloat gradientLocations[3];
int animationTimerCount;
}
@property (nonatomic, assign) id <SlideToCancelDelegate> delegate;
// This property is set to NO (disabled) on creation.
// The caller must set it to YES to animate the slider.
// It should be set to NO (disabled) when the view is not visible, in order
// to turn off the timer and conserve CPU resources.
@property (nonatomic) BOOL enabled;
// Access the UILabel, e.g. to change text or color
@property (nonatomic, readonly) UILabel *label;
@end
@protocol SlideToCancelDelegate
@required
- (void) cancelled;
@end
|
The Company estimates its solar module shipments in the third quarter of 2011 to be in the range of 372 MW to 375 MW, compared to the Company's previous guidance of 480 MW to 520 MW for the reasons discussed below. Additionally, for the third quarter of 2011, the Company estimates:
* Gross margin relating to its in-house wafer production and module production to be in the range of 18% to 19%, in line with the Company's previous guidance of high teens in percentage terms; and
* Overall gross margin to be in the range of 10% to 11%, which includes a non-cash inventory write down of approximately $19 million, compared to the Company's previous guidance of mid to high teens in percentage terms.
This had me reaching for my calculator. Shipments of 372-375 MW - lets call it 374 MW as a reasonable average. Gross margin of 18% to 19% from wafer production - so lets call it 18.5 percent and in-line with their guidance. Gross margin of 10% to 11% - lets call it 10.5% - after an inventory write down of approximately $19 million (which compares to the old high-teens margin).
So by simple subtraction we estimate that 8 percentage points of margin represents $19 million. This suggests that the total revenue is = $19 million /.08 = $237.5 million.
But that is the revenue from 374 MW - so revenue per watt = $237.5 million/ 374 million watts = $0.635 per watt.
The lowest solar panel price mentioned in any analyst report I have seen is $1.08 per watt.
Under 64 cents per watt is either a catastrophe inconsistent with any observable solar panel price or there is a significant charge the company is not disclosing.
Which is it?
John
Post script. Some people have observed the typical 3 percent difference between IN HOUSE wafer production and END GROSS MARGIN - the difference being third party panels they buy in and then distribute.
They then calculate 5.5 percent margin difference - implying ASP in the 90s. Plausible - but still a disaster.
I had discounted this. Reason: I did not think there would be many third-party product sales when they are storing their own stuff in warehouse and can't sell it and are cutting production. That was a guess only. Their own production cut is so severe that third-party sales through their channel just look unlikely.
But maybe there really are large third party sales remaining. There might be a few reasons - but I am open to suggestion. Here goes for some thoughts:
(a). They are contractually obliged to sell for third parties and they have contractual expenses larger than they are telling us, or
(b). They still sell for third parties because the third parties can deliver cheaper than their marginal manufacturing cost, or
(c). The third party stuff is higher quality, or
(d). The collapse in volume was so total that there were third party sales in the beginning of the quarter but not in the end - so third party sales were a realistic part of the story but will not be next quarter, or
(e). Something I can't think of.
I was thinking - falsely perhaps - with the disastrous delivery numbers - that the third party distribution would be cut to zero. I should have put that assumption in my note.
15 comments:
taxloss
said...
I don't think you can take the inventory write down from the Gross Margin *from wafer production* to arrive at the *overall* gross margin. The fact that they had previous guidance of 'high teens' for wafer production and 'mid to high teens' for overall margin implies there are cost additions/revenue deductions at between the production and company level.
John at 4:02 - I don't think Krugman should extrapolate countrywide solar vs coal costs from a small unhealthy business like solar panel manufacturing. Isn't that like saying we should all be driving Pontiacs because they were being sold at 30% discounts when GM was going BK?
There are probably huge distortions in the price of solar power. I'd love to see proposals and quotes for truly large solar installations totaling 5-10% US annual usage (and who would guarantee it).Rich
Did you even look at earlier earnings releases? In 2Q, there was a 340 bps difference between gross margin from wafer and module production and overall gross margin. I don't follow this company ,and it took about two minutes to deduce that they try to disclose gross margin from internal manufacturing vs. when they purchase the wafers from the outside?
Anyway, they $19M appears to represent about 5.5%, implying that total revenue was around $345. Still only $0.92/watt.
Because their overall gross margin on modules comes from 1) internally produced wafers, 2) externally purchased wafers, and 3) the inventory writedown. Gross margins on internally sourced wafers are higher than on the wafers they buy from other companies. Module prices are still close to $1.00, no one is selling $0.63 modules (at least not yet).
http://pvinsights.com/ There are sub $1/W prints, just typically not Tier 1 guys.
As for sustainability, in rural areas in India (i.e. without a grid), it costs say $0.53/kWh to truck in diesel to power generators. A 30MW solar plant would cost say $0.23/kWh. Solar works well in some places, not in others. It's by no means perfect, but when you start looking at negative externalities of traditional power sources (CO2 emissions, wars, etc.) gets a bit more interesting... I wouldn't be dancing solar's death quite yet.
I don't think the issue is whether solar industry is dead or not. It is more an issue of whether solar industry will be profitable or not. In my mind, it is a race between supply and demand expansion. It is very obviously that manufacturer are expaning like crazy in the last few years trying to catch the demand. And now demand are clipped becuase of reducing subsidy and reducing demand caused by near recession in Europe. I think solar industry will go the way of TV manufacturer and disk drive manufacutrer. Both industries went through a growth pahse when demand outstripped supply.. But once supply catch up with demand, it become a game of dog eat dog with minimum margin until the industry consolidate... And we are already at a point that the industry supply and demand crossed and we are heading into a consolidation phase. Unless and until the demand pick up substaintially or the supply curve change becuase of new technology, we are heading into a show down between different solar panel manufacturere... Good to be a short in solar space for now...
Johnthis is completely unrelated to Trina, so apologies for posting this up here but couldn't find your mail address.I was thinking about the Olympus scandal in japan. You being a keen accounting buff I was wondering if there was anyway to have seen this from combing through the financials.There were always rumors this was out there but was there anyway to pick this up from the financials? Reason I ask is I was reflecting on one of your comments that Sinoforest was much easier to clock as a fraud back in the late 90s than now given the accounts.Sino admittedly is a slightly different case as in it seems the entire company is smoke and mirrors whereas Olympus is a real company with blackholes in the accounts....
General disclaimer
The content contained in this blog represents the opinions of Mr. Hempton. Mr. Hempton may hold either long or short positions in securities of various companies discussed in the blog based upon Mr. Hempton's recommendations. The commentary in this blog in no way constitutes a solicitation of business or investment advice. In fact, it should not be relied upon in making investment decisions, ever. It is intended solely for the entertainment of the reader, and the author. In particular this blog is not directed for investment purposes at US Persons.
|
/*
* Copyright 2016 Google Inc.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package com.google.maps.android.utils.demo;
import android.util.DisplayMetrics;
import android.widget.Toast;
import com.google.android.gms.maps.CameraUpdateFactory;
import com.google.android.gms.maps.model.LatLng;
import com.google.maps.android.clustering.ClusterManager;
import com.google.maps.android.clustering.algo.NonHierarchicalViewBasedAlgorithm;
import com.google.maps.android.utils.demo.model.MyItem;
import org.json.JSONException;
import java.io.InputStream;
import java.util.List;
public class VisibleClusteringDemoActivity extends BaseDemoActivity {
private ClusterManager<MyItem> mClusterManager;
@Override
protected void startDemo(boolean isRestore) {
DisplayMetrics metrics = new DisplayMetrics();
getWindowManager().getDefaultDisplay().getMetrics(metrics);
if (!isRestore) {
getMap().moveCamera(CameraUpdateFactory.newLatLngZoom(new LatLng(51.503186, -0.126446), 10));
}
mClusterManager = new ClusterManager<>(this, getMap());
mClusterManager.setAlgorithm(new NonHierarchicalViewBasedAlgorithm<MyItem>(
metrics.widthPixels, metrics.heightPixels));
getMap().setOnCameraIdleListener(mClusterManager);
try {
readItems();
} catch (JSONException e) {
Toast.makeText(this, "Problem reading list of markers.", Toast.LENGTH_LONG).show();
}
}
private void readItems() throws JSONException {
InputStream inputStream = getResources().openRawResource(R.raw.radar_search);
List<MyItem> items = new MyItemReader().read(inputStream);
for (int i = 0; i < 100; i++) {
double offset = i / 60d;
for (MyItem item : items) {
LatLng position = item.getPosition();
double lat = position.latitude + offset;
double lng = position.longitude + offset;
MyItem offsetItem = new MyItem(lat, lng);
mClusterManager.addItem(offsetItem);
}
}
}
}
|
Q:
Facing error while getting values from URL (javax.el.PropertyNotWritableException:)
i have a page on which i am using h:link like
<h:link outcome="countryPages_View.xhtml">
<img src="images/afghanistan.png" style="border: none;"/>
<f:param name="SaarcCountryId" value="11" />
<f:param name="once" value="true" />
<f:param name="fromPage" value="homePage" />
</h:link>
<h:link outcome="countryPages_View.xhtml">
<h:graphicImage url="images/bangladesh.png" style="margin-left:10px;border: none" />
<f:param name="SaarcCountryId" value="5" />
<f:param name="once" value="true" />
<f:param name="fromPage" value="homePage" />
</h:link>
When i click on the image, then url becomes ok. URL becomes like this
http://localhost:8080/WIT/faces/countryPages_View.xhtml?SaarcCountryId=1&once=true&fromPage=homePage
Then on my page i am getting values like this
<ui:composition template="./WEB-INF/templates/layout.xhtml">
<ui:define name="title">SAARC Country View</ui:define>
<ui:define name="content">
<f:metadata>
<f:viewParam name="SaarcCountryId" value="#{countryPages_Setup.cntryid}" />
<f:viewParam name="once" value="#{countryPages_Setup.onse}" />
<f:viewParam name="fromPage" value="#{countryPages_Setup.page}}" />
<f:event type="preRenderView" listener="#{countryPages_Setup.beforeRenderPage}" />
</f:metadata>
<h:form id="countryPages" prependId="false">
....
</h:form>
</ui:define>
</ui:composition>
My bean is like this
@ManagedBean
@ViewScoped
public class CountryPages_Setup implements Serializable {
private String cntryid;
private String page;
private String onse;
public void beforeRenderPage(ComponentSystemEvent event) {
System.out.println(page);
System.out.println(onse);
System.out.println(cntryid);
} //end of beforeRenderPage()
//Constructor
public CountryPages_Setup() {
} //end of constructor
// getter and setter
public String getCntryid() {
return cntryid;
}
public void setCntryid(String cntryid) {
this.cntryid = cntryid;
}
public String getOnse() {
return onse;
}
public void setOnse(String onse) {
this.onse = onse;
}
...
} //end of class CountryPages_Setup
When my page loads i am getting errors.
exception
javax.servlet.ServletException: javax.el.PropertyNotWritableException: /countryPages_View.xhtml @20,88 value="#{countryPages_Setup.page}}": Illegal Syntax for Set Operation
root cause
javax.faces.component.UpdateModelException: javax.el.PropertyNotWritableException: /countryPages_View.xhtml @20,88 value="#{countryPages_Setup.page}}": Illegal Syntax for Set Operation
root cause
javax.el.PropertyNotWritableException: /countryPages_View.xhtml @20,88 value="#{countryPages_Setup.page}}": Illegal Syntax for Set Operation
Why i am getting this error? I made setter and getter for my view params? Also when page loads then first my constructor call. I want to use these f:param values in my constructor. I think after constructor my beforeRenderPage() method will call. How can i get these values in the constructor so i can use it in my constructor?
Thanks
A:
There is a second bracket at the end of the expression: page }}
<f:viewParam name="fromPage" value="#{countryPages_Setup.page}}" />
|
-116
a
Which is the closest to -1? (a) -3/41 (b) 435 (c) -23
a
Which is the closest to -3/5? (a) 0.055 (b) -1815/8 (c) 1.2 (d) -1/3
d
What is the closest to 198/5 in -1/4, 1/4, 16/7, 50?
50
Which is the nearest to -47.7? (a) 22/3 (b) -2/39 (c) 5 (d) 122
b
What is the nearest to -0.08 in 3, -1.287, 3.695?
-1.287
Which is the nearest to 1/214? (a) 0.6 (b) -2 (c) 83
a
What is the closest to -23 in -5, 5, -0.17232, 1/2?
-5
What is the closest to -10/3 in 59.5, 0, -11?
0
Which is the closest to -86? (a) -24 (b) -28/9 (c) 5/4 (d) 2/3
a
What is the closest to 0 in -3/4, -0.10574527, -1/8, -1/3?
-0.10574527
What is the nearest to -15 in -2425, -1, -3, 0, 0.02, -4?
-4
Which is the nearest to -1? (a) -430 (b) -33/10 (c) 15 (d) 24
b
What is the closest to -1/5 in -2053, -2, 0.019?
0.019
Which is the nearest to 0.2859? (a) -1.18 (b) -4 (c) -0.03
c
What is the nearest to 4292 in 4/3, -1/2, 0, 0.5, -0.1, -2/15?
4/3
What is the nearest to 292/15 in -0.3, 3, 0.1?
3
What is the closest to -0.18 in 1/3, 1, 139.56, -1?
1/3
Which is the closest to -1? (a) -0.6 (b) 0.1 (c) 0.714 (d) -4/11
a
What is the nearest to -6 in 5, -26, 0.4, 0, -14.5?
0
Which is the closest to 9? (a) 293 (b) -0.4 (c) 5/3 (d) 1
c
What is the closest to -506 in 1/115, -0.05, 8/9?
-0.05
What is the closest to 55 in -5, 2, -2, 2/13, 0.3, -1712?
2
Which is the closest to 1/5? (a) 3.8 (b) -94 (c) -1 (d) -71
c
Which is the closest to -1/3? (a) 3 (b) 4 (c) 4/5 (d) -5 (e) 3/433
e
What is the nearest to -1 in 0.76, -0.04, 0.5, -1384, -18?
-0.04
Which is the nearest to 1/88? (a) -4 (b) -2 (c) -3/4 (d) 6.1 (e) 18
c
What is the nearest to -3/23 in -0.13, 0, -0.153, 0.1, 2/5?
-0.13
What is the closest to -2/37 in -12, 13, 26?
-12
Which is the closest to 60? (a) -4/5 (b) 3 (c) -16/3 (d) -1/4
b
Which is the closest to 2/3? (a) -5 (b) 2 (c) -44.8 (d) -8 (e) 0.1
e
Which is the nearest to -1? (a) -6631/4 (b) 60 (c) 0.3
c
What is the nearest to -2/1635 in 2/13, 1.085, 0.5?
2/13
Which is the closest to -1? (a) 2662 (b) 74 (c) 0.7 (d) 1/8 (e) -1
e
Which is the nearest to 4/5? (a) -4 (b) -0.4 (c) -2643265
b
Which is the nearest to 0? (a) -0.5 (b) -1/7 (c) -15 (d) -0.2 (e) -39
b
What is the nearest to -1/4 in 2, -525, -156/23?
2
What is the nearest to 355898 in -2, 2/7, 13?
13
Which is the closest to 0.34? (a) 1 (b) 19417 (c) 4
a
What is the nearest to 0.1 in 2, -163.2, 2.73?
2
What is the nearest to -11/3 in 0.127, -2/5, -3/5?
-3/5
Which is the nearest to 1? (a) -2987 (b) -86 (c) 0.9 (d) 2
c
What is the closest to -61/27 in 1/14, -2.87, 0, -2?
-2
What is the closest to -2/9 in -0.04, -0.2, 9, 40, -2?
-0.2
Which is the nearest to 0.1? (a) 0.3 (b) -8 (c) -3 (d) -0.5 (e) -314/129
a
Which is the closest to 0.6? (a) 0.4 (b) -0.3 (c) -2/263 (d) 4/13 (e) 0.3
a
What is the closest to 1 in -80/33, 6/5, -1.1?
6/5
What is the nearest to 0.1 in -3457.7, -227/3, 1?
1
Which is the closest to -1353? (a) 1/5 (b) -303 (c) 2.5
b
What is the closest to 0 in 2/7, -7147, -15, -0.16?
-0.16
Which is the nearest to -0.1? (a) 5 (b) -199 (c) 163 (d) 1/3 (e) 0.09
e
What is the nearest to -3 in 8, 4811, -2/3, 0?
-2/3
What is the nearest to 210 in 0.5, 0.2, 3, 16.08?
16.08
What is the nearest to -49.6 in -0.08, 2/7, 1, -17, -2?
-17
What is the nearest to 0 in 84, 2, 3/5, 30, 157, 3?
3/5
What is the nearest to 761 in 3/4, 6.2, -2/51?
6.2
Which is the nearest to 1041? (a) 0.3 (b) 167 (c) 5 (d) -3 (e) -2
b
What is the closest to -2 in -2, 57, -1.4, -4/5, 2/19, 125?
-2
What is the nearest to -0.2 in -2/9, -4/9, 57, -2/11, -2/59?
-2/11
What is the closest to 3/23 in 353/5, -3/2, 0, 6?
0
What is the closest to 2/2791 in -5, -2/11, 4, -8?
-2/11
Which is the closest to -1/3? (a) -2 (b) -72 (c) -1467
a
Which is the nearest to 1? (a) -0.35 (b) 0 (c) -0.4 (d) -0.2 (e) -44 (f) -3
b
What is the closest to -0.1 in -2/13, -3, 5/3, -4, -67?
-2/13
Which is the nearest to 1? (a) 25 (b) 5 (c) -1/710
c
What is the nearest to 5 in 0, -2/13, -0.9, 6.28?
6.28
What is the nearest to 5 in 1/3, 40.66, -4?
1/3
What is the nearest to -75 in 352, 5, 1.1?
1.1
What is the closest to 1/10 in -0.95, 0.4, -0.01, -2/7, 1?
-0.01
Which is the nearest to -1? (a) 5 (b) -2/21 (c) -36 (d) 13.1
b
Which is the nearest to -7? (a) 4601 (b) 3 (c) -0.5 (d) -2/13
c
Which is the closest to 1/2? (a) -382406 (b) -0.1 (c) -1/5 (d) -0.3
b
Which is the nearest to 5/4? (a) -5 (b) -11698 (c) -1 (d) -9
c
Which is the closest to -1? (a) -61375 (b) 1 (c) 2/21
c
Which is the closest to 309? (a) 0 (b) 33 (c) -1/2 (d) -1 (e) -1/4 (f) 0.39
b
What is the closest to -0.5 in 0.1, 4/5, -6102, -3, -4, 5?
0.1
Which is the closest to -1/2? (a) -2 (b) -13124 (c) 32 (d) 6
a
Which is the nearest to 0? (a) 5 (b) -2 (c) -18 (d) 2521
b
Which is the nearest to 1/588? (a) 77 (b) 1 (c) 0
c
What is the nearest to 3 in -0.13, -10275, 21, 0.1, 2?
2
What is the nearest to 22 in 2, 0.083, 0.8604?
2
Which is the closest to -2? (a) -54/497 (b) 4 (c) 1.4 (d) -1/8 (e) 4/7
d
Which is the closest to 2/57? (a) 5/3 (b) 0 (c) 0.1 (d) 9 (e) -247 (f) -1
b
Which is the nearest to 27? (a) -0.008 (b) -2608 (c) -0.1
a
What is the nearest to 0 in 90, 0, 3174, -3, 0.2?
0
What is the nearest to -106 in -35, -1.7, 2, -0.1, -10?
-35
What is the nearest to -4 in -6.17, -3/25, -20/83?
-6.17
Which is the nearest to 20? (a) 679 (b) 3/5 (c) -1/6 (d) -2 (e) -0.5 (f) 2
f
Which is the closest to 7/8? (a) 0.06 (b) -45 (c) -0.3 (d) 1/3 (e) 0.4
e
Which is the closest to -0.3? (a) 2/7 (b) -4 (c) 1/1510 (d) -0.2 (e) 1/15
d
What is the closest to 3/13 in 1, 0.02, -46, -11, 0.1?
0.1
Which is the closest to 2/1629? (a) -0.4 (b) 2 (c) 3/2 (d) -14
a
Which is the nearest to 2/11? (a) -976 (b) 0.3 (c) 6 (d) 7
b
What is the nearest to -3 in -5, -0.2, -12.62, 25?
-5
Which is the closest to 14/1923? (a) 6 (b) 283 (c) 5 (d) -2
d
Which is the closest to -6? (a) 3 (b) -1264166 (c) 4
a
What is the closest to -5638267 in -2, -0.2, -0.5?
-2
Which is the nearest to -0.496? (a) 3/7 (b) -0.5 (c) 3968 (d) -5
b
Which is the nearest to 667? (a) -4/9 (b) -1/2 (c) 348
c
Which is the closest to -100? (a) -2/15 (b) 4029 (c) -1
c
What is the closest to -2.2 in 0, 5, -1/2, -1, -3270/13?
-1
Which is the closest to 5.8? (a) 115 (b) 0.5 (c) 4/3 (d) 18
c
Which is the nearest to -254767? (a) 0.2 (b) -4 (c) -45
c
What is the nearest to -2/3 in -3/2, 1, -34, 24, 1.512, -4?
-3/2
What is the closest to -327/5 in 41, -1, 0?
-1
Which is the closest to -1/3? (a) 2/33 (b) 40 (c) 32
a
What is the nearest to 119008 in 2, 0, 1/5, 5, 1/3?
5
What is the nearest to 91762 in -0.5, -2, 3, 0.1?
3
What is the nearest to 92 in 0.3, -0.011, 5/11, 1?
1
Which is the nearest to 0.3? (a) 15523.2 (b) -0.05 (c) -1/3
b
Which is the closest to 0.045? (a) -0.1 (b) 4 (c) -2 (d) -6516
a
Which is the nearest to 9? (a) 4 (b) -2 (c) 2.752 (d) 5/3
a
Which is the nearest to 6? (a) -2/17 (b) -2/9 (c) 0.1 (d) -0.2 (e) -5/56
c
Which is the closest to -3/1333? (a) -69 (b) 2/27 (c) -1/5
b
Which is the closest to 3414? (a) -1 (b) 1 (c) 21 (d) -26.5 (e) 0 (f) 0.2
c
Which is the closest to -1? (a) -3 (b) 1472 (c) -0.7 (d) -4
c
What is the nearest to 1 in -0.77, -0.1, 222045?
-0.1
Which is the nearest to 146? (a) -1/3 (b) -5 (c) -15914
a
What is the closest to -14 in 3.3286, -4/11, -0.03, -2?
-2
Which is the closest to -0.5? (a) 3 (b) 4711 (c) -279
a
Which is the nearest to -1093662? (a) 1 (b) -2 (c) -3/11 (d) -1/4
b
Which is the nearest to -641? (a) 161 (b) -2 (c) 5
b
Which is the nearest to 0.2? (a) 1 (b) -5 (c) -0.07 (d) 27.1 (e) -2/3
c
What is the closest to 0.03 in 4, -0.2, -12, 666?
-0.2
Which is the nearest to -1/3? (a) -37.9294 (b) 1.55 (c) 0.5
c
What is the closest to -3367 in -6, -1253, -0.5, 5?
-1253
What is the closest to 1/4 in -280, 1/12, 82753, -0.4?
1/12
What is the nearest to 2/7 in -2/11, -15/4, 0.5, -2/39, -56.4?
0.5
Which is the nearest to 0.2? (a) -117/7 (b) 4 (c) -4370
b
Which is the closest to -2/129? (a) -0.4 (b) -0.3 (c) 34 (d) -37/5
b
Which is the nearest to -5? (a) -9067 (b) -0.8 (c) -1/5
b
What is the closest to 37 in -1/3017, -19
|
770 N.E.2d 228 (2002)
329 Ill. App.3d 1216
264 Ill.Dec. 334
The PEOPLE of the State of Illinois, Plaintiff-Appellee,
v.
Ken A. THOMAN, Defendant-Appellant.
No. 5-01-0127.
Appellate Court of Illinois, Fifth District.
Order Filed April 23, 2002.
Motion to Publish Granted May 24, 2002.
Opinion Filed May 24, 2002.
*229 Lou J. Viverito, Taylor Law Offices, P.C., Effingham, for Appellant.
Steve Friedle, State's Attorney, Payette County, Vandalia; Stephen E. Norris, Deputy Director, Sharon Shanahan, Contract Attorney, Office of the State's Attorneys Appellate Prosecutor, Mt. Vernon, for Appellee.
Justice WELCH delivered the opinion of the court:
Ken A. Thoman (defendant) appeals from his conviction, following a jury trial in the circuit court of Fayette County, for driving with a blood alcohol concentration of 0.08 or more in violation of section 11-501(a)(1) of the Illinois Vehicle Code (Code) (625 ILCS 5/11-501(a)(1) (West 2000)). He raises two issues on appeal: whether the evidence presented at the trial was sufficient to prove him guilty beyond a reasonable doubt where no evidence of the alcohol concentration in his "whole blood" was presented but only evidence of the alcohol concentration in his "blood serum" and whether the trial court erred in allowing into evidence the result of the blood serum alcohol analysis where the State failed to establish the necessary and proper foundation for its admission. We will set forth only those facts necessary to our disposition on appeal.
*230 Defendant was charged by information filed in the circuit court of Fayette County on January 5, 2001, with driving with a blood alcohol concentration of 0.08 or more in violation of section 11-501(a)(1) of the Code and with driving while under the influence of alcohol in violation of section 11-501(a)(2) of the Code (625 ILCS 5/11-501(a)(1), (a)(2) (West 2000)). On the State's own motion, the charge of driving while under the influence of alcohol was dismissed during the trial. A jury convicted defendant of driving with a blood alcohol concentration of 0.08 or more, and on February 12, 2001, defendant was sentenced to 18 months' probation.
At defendant's jury trial, the State presented evidence that, after defendant was involved in a one-vehicle accident, he was transported to the local hospital, where his blood was drawn and subjected to an alcohol analysis. This was not done at the request of the police, but as a part of standard hospital procedures. As a part of this analysis, his blood serum was separated from the whole blood, and the serum was subjected to the analysis. The analysis of his blood serum showed an alcohol concentration of 0.306. This result was admitted into evidence at defendant's trial. However, no evidence was presented as to the blood alcohol concentration in defendant's whole blood or how blood serum alcohol concentration related to whole blood alcohol concentration. Defendant argues on appeal that because the State failed to prove that his whole blood alcohol concentration was 0.08 or more, it failed to prove him guilty beyond a reasonable doubt.
It is now recognized that, although the term "blood" as used in the Code is not denned therein, the term refers to whole blood, and whole blood only, and that whole blood is the standard unit required by the Code. See People v. Green, 294 Ill.App.3d 139, 144-45, 228 Ill.Dec. 513, 689 N.E.2d 385 (1997). Blood serum is different from whole blood because the lack of red and white blood cells and other particulate matter serves to increase the relative percentage of water within the serum, which, because alcohol has an affinity for water, results in higher alcohol concentration levels in blood serum than in whole blood. Green, 294 Ill.App.3d at 145, 228 Ill.Dec. 513, 689 N.E.2d 385. Thus, while the results of a blood serum analysis are admissible at trial (People v. Menssen, 263 Ill.App.3d 946, 953, 201 Ill.Dec. 669, 636 N.E.2d 1101 (1994); Green, 294 Ill.App.3d at 147), 228 Ill.Dec. 513, 689 N.E.2d 385), the State must still prove beyond a reasonable doubt that the defendant's whole blood alcohol concentration was 0.08 or more.
Evidence of a defendant's whole blood alcohol concentration level may stem from actual whole blood alcohol concentration test results or from blood serum alcohol concentration test results converted into whole blood equivalents. Green, 294 Ill.App.3d at 147, 228 Ill.Dec. 513, 689 N.E.2d 385. Because a blood serum alcohol concentration test result can predictably be anywhere from 12% to 20% higher than a whole blood alcohol concentration test result (Menssen, 263 Ill.App.3d at 953), 201 Ill.Dec. 669, 636 N.E.2d 1101), blood serum concentration test results are converted by dividing by a corresponding factor between 1.12, to 1.20. See Green, 294 Ill.App.3d at 146 n. 2, 228 Ill.Dec. 513, 689 N.E.2d 385 (1.16 is the average of a range).
The State argues that Green is distinguishable from the case at bar because it involved the application of the presumptions set forth in section 11-501.2(b) of the Code (625 ILCS 5/11-501.2(b) (West 2000)), whereas the case at bar involves a violation of section 11-501(a)(1), and that *231 the holding of Green that the term "blood" as used in the Code means whole blood applies only to prosecutions involving the presumptions provided in section 11-501.2(b) and not to prosecutions involving section 11-501(a)(1). In Green, the court held that a jury could not employ any of the presumptions provided in section 11-501.2(b) of the Code (for example, that a person with a blood alcohol concentration of 0.08 or more is under the influence of alcohol) based on a person's blood serum alcohol concentration. Green, 294 Ill. App.3d at 147, 228 Ill.Dec. 513, 689 N.E.2d 385. Such a presumption could only be employed on the basis of a person's whole blood alcohol concentration. Allowing a jury to employ such a presumption on the basis of a defendant's unconverted blood serum alcohol concentration level is error. Green, 294 Ill.App.3d at 147, 228 Ill.Dec. 513, 689 N.E.2d 385.
We do not believe that the term "blood" means one thing for the purpose of section 11-501.2(b) of the Code and something different for the purpose of section 11-501(a)(1) of the Code. The State posits, and we can think of, no sensible reason why this should be so. We believe that the term means whole blood alcohol concentration for the purposes of both sections of the Code. Where the same word is used in different sections of the same statute, it should be given the same meaning unless something in the context indicates that the legislature intended otherwise. McMahan v. Industrial Comm'n, 183 Ill.2d 499, 513, 234 Ill.Dec. 205, 702 N.E.2d 545 (1998). Nothing in the Code indicates that the legislature intended the word "blood" to have a different meaning inthese two section. Thus, section 11-501(a)(1) of the Code requires the State to prove that the defendant's whole blood alcohol concentration was 0.08 or more. It can do this only by presenting evidence of an actual whole blood alcohol concentration test result or from bloodtest result or from blood serum alcohol concentration test results converted into whole blood equivalents. Green, 294 Ill. App.3d at 147, 228 Ill.Dec. 513, 689 N.E.2d 385. In the instant case, the State failed to present either type of evidence. Instead, the State presented only evidence of defendant's blood serum alcohol concentration test result.
We agree with defendant that the State failed to prove beyond a reasonable doubt that defendant's whole blood alcohol concentration was 0.08 or more. The jury was presented with evidence of defendant's blood serum alcohol concentration, but it was presented with no evidence of the conversion factor. It is not the defendant's burden to present this evidence, for the State bears the burden of proving every essential element of the offense beyond a reasonable doubt. See People v. Rose, 77 Ill.App.3d 330, 335, 32 Ill.Dec. 700, 395 N.E.2d 1081 (1979). The State could have proved the whole blood alcohol concentration through expert testimony regarding the conversion factor or through asking the trial court to take judicial notice of, and instruct the jury on, the appropriate conversion factor. See, e.g., 20 Ill. Adm. Code § 1286.40 (2001). It did neither.
In its brief on appeal, the State makes a "harmless error" argument, arguing that, even if the highest conversion factor of 1.20 were applied to defendant's blood serum alcohol concentration test result, his whole blood alcohol concentration would still be over 0.08. The State is essentially arguing that, if it had presented sufficient evidence, defendant would have been proved guilty beyond a reasonable doubt, so any failure to present the evidence is harmless. The error in this argument is obvious. The State has the burden of proving defendant guilty beyond a *232 reasonable doubt. Rose, 77 Ill.App.3d at 335, 32 Ill.Dec. 700, 395 N.E.2d 1081. We reject the use of a harmless error argument regarding the insufficiency of the evidence.
The absence of evidence of defendant's whole blood alcohol concentration at the time of his driving results in a failure of proof on an essential element of the charge of driving with an alcohol concentration of 0.08 or more. Accordingly, we reverse defendant's conviction and sentence based on the insufficiency of the evidence. In light of this disposition, we need not address the second argument raised by defendant on appeal.
Reversed.
GOLDENHERSH and HOPKINS, JJ., concur.
|
More Dosso Quotes
Chapter XI. Translation: Let no man on his back, if he be wise,A burden bind that is beyond his strength,Whence, weeping, he ’I cannot bear it’ cries. Translation reported in Harbottle’s Dictionary of quotations French and Italian (1904), p. 338.
|
Sun Shade ▼
Grow In ▼
Product Type ▼
Seed (25)Plug Plants (1)
Habit ▼
upright (21)spreading (3)
All Other Vegetable Seeds
You'll find a wide range of seeds here, including sweetcorn, turnips, swede, aubergines, salsify and scorzonera, each with comprehensive sowing and growing information to help you get the best from your vegetable crops.
|
9 Comments
27 Nov 08:48
dmitry
Gate to the open-air museum of various old russian churches, wind-mills, chapels and houses of 17-18th century. Collected from remote Northern villages and re-assembled inside the vast museum territory, located 30 km from Arkhangelsk city, NW of Russia.
Disclaimer: hdrcreme.com is a free image hosting service. All the materials are uploaded by users, the rights belong to the rightholders. If you find a photo that you think shouldn't be here, send a removal note to remove(at)hdrcreme(dot)com
|
Oxidatively-Stable Linear Poly(propylenimine)-Containing Adsorbents for CO2 Capture from Ultradilute Streams.
Aminopolymer-based solid sorbents have been widely investigated for the capture of CO2 from dilute streams such as flue gas or ambient air. However, the oxidative stability of the widely studied aminopolymer, poly(ethylenimine) (PEI), is limited, causing it to lose its CO2 capture capacity after exposure to oxygen at elevated temperatures. Here, we demonstrate the use of linear poly(propylenimine) (PPI), synthesized through a simple cationic ring-opening polymerization, as a more oxidatively stable alternative to PEI with high CO2 capacity and amine efficiency. The performance of linear PPI/SBA-15 composites was investigated over a range of CO2 capture conditions (CO2 partial pressure, adsorption temperature) to examine the tradeoff between adsorption capacity and sorption-site accessibility, which was expected to be more limited in linear polymers relative to the prototypical hyperbranched PEI. Linear PPI/SBA-15 composites were more efficient at CO2 capture and retained 65-83 % of their CO2 capacity after exposure to a harsh oxidative treatment, compared to 20-40 % retention for linear PEI. Additionally, we demonstrated long-term stability of linear PPI sorbents over 50 adsorption/desorption cycles with no loss in performance. Combined with other strategies for improving the oxidative stability and adsorption kinetics, linear PPI may play a role as a component of stable solid adsorbents in commercial applications for CO2 capture.
|
Q:
Firing Events in MVC (specifically in PHP, if it's needed)
I have searched on SO about this question, but I basically haven't found one concerning this particular scenario; hence, my reason for asking.
I have a basic, abstract understanding of the MVC pattern: Controller calls the right Model based on the action needed; the Model contains the actual business/data logic, and the View displays the result. What I am having trouble understanding is the actual implementation.
Originally, my assumption was this: Controller calls Model; Model processes information, and returns the data back to Controller; Controller call the View, passing this
data to the View, which simply displays it. After reading more articles on MVC, I discovered that the Model doesn't really pass the data back to the Controller; rather, it fires an event, which allows the Controller to call the proper View.
My question centers on this event firing part:
Q.1: Must an event really be fired? Once the Model completes its processing, and returns control to the Controller, can't the Controller simply call the View?
Q.2: In an actual implementation, a Model object is injected into a Controller class. So, Model object basically has no idea what Controller called it. How does it know what Controller to fire an event to? And how do we know what Controller is expecting that notification?
Q.3: The Controller calls the View, injecting it with the current Model object, so the View can use it to obtain the needed data. Is this correct or wrong? If wrong, why is it wrong, and what is the proper way to do it?
I have read my questions on MVC on here and other sites, viewed MVC diagrams, but I haven't been able to really connect the dots the way it's supposed to be connected.
Thanks.
A:
There are many way's on how the different components on MVC are linked together. I think there is no 'Golden Rule'.
I use it the way shown in this picture:
The creation of objects is then like this:
the app object creates a controller, depending on the route. The router is injected into the controller.
The controller creates a model, depending on the route. The model is created by a IoC container.
The controller creates a view, and injects the model into the view.
In my situation I can answer your questions like this:
Q1: No, I do not use events. There is no need. The controller calls the model, and when done the model has state, and can be used by the view.
Q2: I do it just the other way, the controller creates the model. The model has no knowledge about the controller, or view.
Q3: this is the way I implement it.
|
1 F.3d 1246NOTICE: Ninth Circuit Rule 36-3 provides that dispositions other than opinions or orders designated for publication are not precedential and should not be cited except when relevant under the doctrines of law of the case, res judicata, or collateral estoppel.
In re Arkady Semen DASHEVSKY, Debtor.Arkady Semen DASHEVSKY, Plaintiff-Appellant,v.ATI CREDIT & LOAN ASSOCIATION, Defendant-Appellee.
No. 92-56080.
United States Court of Appeals, Ninth Circuit.
Submitted July 21, 1993.*Decided Aug. 3, 1993.
Before BROWNING, TANG and NORRIS, Circuit Judges.
1
MEMORANDUM**
2
Debtor Arkady Semen Dashevsky appeals pro se from the Bankruptcy Appellate Panel's ("BAP") order dismissing his appeal from a bankruptcy order as moot. We affirm for the reasons stated in the BAP's order of July 20, 1992.
3
AFFIRMED.
*
The panel unanimously finds this case suitable for decision without oral argument. Fed.R.App.P. 34(a); Circuit Rule 34-4
**
This disposition is not appropriate for publication and may not be cited to or by the courts of this circuit except as provided by Circuit Rule 36-3
|
The influence of increasing albumin concentrations on the determination of the binding of sulfamethoxy-pyridazine to human and bovine serum albumin.
The binding of sulfamethoxypyridazine to human and bovine serum albumin was determined at eight constant molar drug/albumin ratios for seven different albumin concentrations ranging from 0.1% to 1.5%. The serum albumin concentration affects the determination of the albumin binding of the drug in two different ways. 1. The relative affinity of the albumins for the drug increases with increasing albumin concentrations, while the numbers of binding sites remain constant. 2. The association constants taken from Scatchard plots decrease with increasing albumin concentrations. It is concluded that a direct comparison of binding constants obtained with different albumin concentrations, as widely done, can lead to misinterpretations and should be avoided.
|
Q:
Syntactic characterisation of the intersection of CTL and LTL
The Baier and Katoen textbook references this paper
E. M. Clarke and I. A. Draghicescu. Expressibility results for
linear-time and branching-time logics, pages 428–437. Springer Berlin
Heidelberg, Berlin, Heidelberg, 1989.
to say that, given a CTL formula P, if there exists an equivalent LTL one, it can be obtained by dropping all branch quantifiers (i.e. A and E) from P.
Is there a syntactic criterion that provides a guarantee that if a CTL formula passes the test, then an equivalent LTL formula does exist?
A:
I have posted the same question on ResearchGate and got pointers to two very interesting papers—thanks to Igor Konnov and Paul Attie. I will summarise here the information from the papers, relevant to the question, but first, here are the two papers:
Monika Maidl. "The common fragment of CTL and LTL," Proceedings of the 41st Annual Symposium on Foundations of Computer Science. pp. 643-652, 2000. http://dx.doi.org/10.1109/SFCS.2000.892332
Mikołaj Bojańczyk. "The common fragment of ACTL and LTL." International Conference on Foundations of Software Science and Computational Structures. pp. 172-185, 2008. http://dx.doi.org/10.1007/978-3-540-78499-9_13
The paper by Monika Maidl does, indeed, provide an answer very much along the lines I was looking for.
Maidl considers ACTL—"the fragment of those CTL formulas that contain, when in negation normal form, only A as a quantifier." She characterises the fragment of ACTL that is expressible in LTL, denoted by ACTLdet, where "det" stands for "deterministic". ACTLdet is defined inductively:
state predicates are in ACTLdet;
for ACTLdet formulas φ1 and φ2 and a predicate p, the formulae
φ1 ∧ φ2 ,
AX φ1,
(p ∧ φ1) ∨ (¬p ∧ φ2 ),
A (p ∧ φ1 ) U (¬p ∧ φ2),
A (p ∧ φ1) W (¬p ∧ φ2)
all belong to ACTLdet.
Furthermore, Maidl makes the following remark: "For an ACTLdet formula φ, [the formula] A φ W p can be expressed in ACTLdet , since A φ W p ⇔ A (φ ∧ ¬p) W p. A special case is AG φ. Similarly, A φ U p can be expressed in ACTLdet."
In this paper, the class LTLdet of formulae equivalent to the ACTLdet ones. is characterised as "[t]hose LTL formulas the negation of which can be represented by a 1-weak Büchi automaton." In the second paper, Mikołaj Bojańczyk argues that this characterisation "was not known to [be] effective, i.e. there was no algorithm that decided if ¬φ could be recognized by [a] restricted Büchi automaton." He then provides such an algorithm.
Furthermore, Bojańczyk provides an example, showing that the common fragment of LTL and CTL is not limited to ACTL: "a very simple LTL property, “all paths belong to (ab)∗a(ab)∗cω”, can be defined in CTL but not ACTL."
|
Cubs close book on HohoKam Stadium
Published: Thursday, March 28, 2013 8:32 p.m. CDT
(MCT) MESA, Ariz. _ When the Chicago Cubs opened up Hohokam Stadium in 1997, then-general manager Andy MacPhail called the $18 million ballpark an integral part of their long-range plan to develop a young core of players who could compete down the road.
"The principal failure of this organization in the last eight years has been its inability to develop talent," MacPhail told the Tribune. "You become too reliant on trades, and trades are hard to make because you don't have the young kids pushing your veterans so you can deal your veterans, or you don't have the attractive young kids to offer to other teams. Then you become exclusively reliant on free agency and that is a very poor cornerstone (on which) to build an organization.
"So we're following the same plan we used (with the Twins) _ improve your facility and focus on the development of players. A good spring training site, when you have baseball in the summer and fall like we do here, is a critical and key component for us."
Times change and management comes and goes. But the Cubs remain the Cubs.
After 17 seasons, the Cubs ended their run at Hohokam on Thursday, losing 6-4 to the Mariners to end the Cactus League part of the exhibition schedule with a 16-18-1 record. They will move to a new facility on the other side of Mesa next spring, with the city of Mesa paying $84 million to build it and another $15 million in infrastructure improvements, including a lagoon that will be stocked with bass.
The Cubs aren't sad to leave Hohokam, which never lived up to MacPhail's hype of being a catalyst for a more consistent organization.
The new park, which is yet unnamed, is expected to give the team some modern day comforts.
"Your whole attitude is a lot better _ the fields, the cages, the whirlpools, the theater, the weight room," manager Dale Sveum said. "There are so many amenities there that are going to be so nice. You're talking about a whole 'nother reason for winning."
The A's will move into Hohokam in 2015 after a major renovation.
Soriano watch: Alfonso Soriano hit his team-leading fifth home run Thursday. Now the key is to take it into the season, where the cold weather tends to affect his starts.
Soriano had no home runs his first 30 games last season, but wound up with 32 on the year. Since joining the Cubs in 2007, he has hit 0, 2, 7, 3, 10 and 0 homers, respectively, in the first month of each season.
Can Soriano change the trend?
"That's not me, what happened last year in the first six weeks of the season," he said. "After that, I turned around my season. I hope this year can be a little different because if we want to be a contender we have to have a good April."
Extra innings: The Cubs finished with an attendance of 145,381 in their final season at Hohokam Stadium. That's a 57,742 decrease from the spring of 2009, when they drew 203,105. ... The Cubs came into Thursday with 45 home runs, second most in the Cactus League and tied for third in the majors with the Orioles. ... Scott Feldman will stay in Arizona to continue throwing before joining the team in Pittsburgh. Feldman is scheduled to make his Cubs debut April 5 against the Braves.
|
Marijuana will soon be sold at Walmart.
Walmart Marijuana
When 2018 comes to a close, it may very well be the biggest year in history for the cannabis industry.
Sure, California passing the first medical cannabis law in 1996 was pretty big, as was Uruguay becoming the first country in the world to fully legalize pot back in late 2013. But in 2018 we’ll have witnessed Canada become the first industrialized country in the world to have legalized recreational weed.
The legalization of adult-use cannabis in Canada is an especially big deal. Marijuana growers had been expanding their capacity at a breakneck pace in anticipation of the Cannabis Act passing, which it finally did on June 19. By Oct. 17, weed will officially be legal for adult purchase, opening the door to what could be a $5 billion windfall once the industry is fully ramped up.
On an even broader basis, an analysis released by European investment bank Bryan, Garnier & Co., courtesy of Marijuana Business Daily, estimates that the global cannabis market could be worth $140 billion by 2027. That represents growth of more than 1,000% over the next decade.
With such big dollar signs being tossed around, the question most folks have been asking, including Wall Street professionals, is what industry might want to dip its toes into the water?
will retail giant Walmart get wind of the marijuana industry’s potential and look to nab its slice of the pie?
According to a recent 18 Karat Reggae interview, Gramps Morgan the lead singer of Morgan Heritage and founder of the Jardin Canabis company believes that Walmart will eventually get its foot in the door of this budding industry.
“I think there’s no doubt that eventually Walmart will get into this business. The question is, is that five years, 10 years, or 20 years? They definitely will get in once there’s more clarity at the federal level in the U.S.,” Morgan said.
Given Walmart’s ability to lure customers with their low prices, as well as its superior logistics, it’s not a preposterous idea that marijuana could soon be on the Walmart shelves just like cereal or soda.
Walmart’s push into cannabis would be even more logical considering that it recently came up with plans to take a bigger bite of the pharmaceuticals business.
Walmart certainly has the cash flow and consumer loyalty to consider a push into the cannabis industry, but a long list of uncertainties is likely to keep the retail kingpin from getting its hands on the green rush anytime soon.
|
« Back
Lyon President Aulas on Nabil Fékir: “There has been no contact with Liverpool.”
Speaking on SFR Sport, Lyon President Jean-Michel Aulas was asked about Nabil Fékir’s future.
“There has been no contact with Liverpool or any other club so we haven’t discussed the future. I know that Nabil, now that we have qualified for the Champions’ League, would really like to stay, so we will discuss things calmly. He has magnificently won the right to go to Russia with France, which gives him an even higher standing. For the moment, nothing is done. You will have to be very, very rich to sign Nabil Fékir this year.”
|
Quantification of folate in food using deconjugase of plant origin combined with LC-MS/MS: A method comparison of a large and diverse sample set.
A round robin comparison was performed in order to test the performance of a recently developed LC-MS/MS method for quantification of 6 folate forms. Eighty-nine samples representing the food groups of fruits, vegetables, legumes, cereals, dairy products, meat, and offal were analyzed by two LC-MS/MS methods and a microbiological assay (MA). A plant-origin deconjugase enzyme (Arabidopsis thaliana) for deconjugation of folates (PE-LC-MS/MS), or animal-origin deconjugase (rat serum and chicken pancreas) (AE-LC-MS/MS) was used in the LC-MS/MS methods, each in a single enzymatic step. In contrast, the MA involved tri-enzyme extraction including human plasma as a deconjugase. A significant bias of 17% lower and 25% higher results was found when PE-LC-MS/MS was compared to MA and AE-LC-MS/MS, respectively. The PE-LC-MS/MS provides fast quantification of various folate vitamers and total folate content, which could be a proper substitute to the currently standardized but imprecise and time-consuming microbiological assay in the future.
|
You'll have plenty to celebrate when you subscribe to the Liverpool FC newsletter Sign me up Thank you for subscribing We have more newsletters Show me See our privacy notice Invalid Email
Neymar spoke of Philippe Coutinho's "great sadness" at missing out on a move to Barcelona after the Liverpool attacker enjoyed a triumphant return to action for Brazil.
Coutinho proved that he's recovered from the mysterious back injury which kept him sidelined during his unsuccessful attempts to force through a transfer to the Catalan giants.
The 25-year-old, who hasn't played since the Reds' pre-season friendly against Bayern Munich on August 1, came off the bench for the final half hour of Brazil's 2-0 win over Ecuador in their World Cup qualifier in Porto Alegre.
After Paulinho had opened the scoring with 20 minutes to go, Coutinho showed why Liverpool have fought so hard to keep him this summer by wrapping up the points in style.
Coutinho burst forward before clipping a delightful pass towards Gabriel Jesus. The Manchester City forward nodded the ball back into the path of Coutinho, who produced a clinical side-footed finish from seven yards out.
His team-mate Neymar, who left Barcelona for Paris Saint-Germain this summer, said: "I'm very happy that he scored a goal because at this moment he lives a very great sadness.
"He helped us to the victory. He's a great player and did very well when he came on.
(Image: Lucas Uebel/Getty Images)
"We were calm and patient. It was a different game to the ones we had before as they sat deep. This team is looking increasingly better at everything and we will grow more."
Victory guaranteed top spot for Brazil in the South American qualifying section.
They face Colombia on Tuesday night before Coutinho returns to Liverpool to be reintegrated into Jurgen Klopp's squad.
|
Q:
Select timestamptz as UTC zulu string
In PostgreSQL 9.5 I have a column of type timestamptz and if I just do a straight select I get a string like so:
2014-08-08 20:48:27.097971+00
What's the proper way to do the select so that the column output is a Zulu time string, like 20140808T204827Z?
A:
If you want exact output as you posted then:
SELECT to_char(
'2014-08-08 20:48:27.097971+00'::timestamptz,
'YYYYMMDD"T"HH24MISS"Z"' );
to_char
------------------
20140808T204827Z
(1 row)
More about date/time formatting: https://www.postgresql.org/docs/current/static/functions-formatting.html
|
Influence of the Walker 256 carcinosarcoma on muscle, tumor, and whole-body protein synthesis and growth rate in the cancer-bearing rat.
The in vivo rates of protein synthesis were assessed in tumor tissue, skeletal muscle, and whole body of rats bearing the Walker 256 carcinosarcoma. Estimates of protein synthesis in the nontumorous tissues were compared to tumor-free controls. Changes in size of the whole animal and tumor (i.e., growth) were measured, and fractional rates of growth, synthesis, and breakdown were estimated. Muscle protein synthesis and whole-body growth were significantly reduced in rats bearing larger tumors, and both were negatively correlated with tumor size (r = -0.723 and -0.825, respectively; P less than 0.01). Furthermore, whole-body and muscle protein synthesis were positively correlated with body growth (r = 0.380 and 0.563, respectively; P less than 0.05). Tumor growth followed first-order kinetics between days 7 and 13 following implantation, with a mean rate constant of 34.3%/day for the larger tumors and 27.7%/day for the small tumors. The difference in tumor growth became statistically significant over the final 3 days of tumor volume measurements. Fractional protein synthesis was significantly lower in the larger compared to the smaller tumors (48.6 versus 84.8%/day; P less than 0.05) as measured on day 14. This finding indicates a lower protein breakdown rate for the larger tumors (14.3 versus 59.0%/day; P less than 0.01) and suggests that the process of protein breakdown could play a significant role in determining tumor size, leading support to the theory of tumors acting as nitrogen traps.
|
Q:
Can JSON Schema support constraints on array items at specific indexes
A good schema language will allow a high degree of control on value constraints.
My quick impression of JSON Schema, however, is that one cannot go beyond specifying that an item must be an array with a single allowable type; one cannot apparently specify, for example, that the first item must be of one type, and the item at the second index of another type. Is this view mistaken?
A:
Yes it can be done, here is an example of an array with the three first item type specified:
{
"type": "array",
"items": [
{
"type": "number"
},
{
"type": "string"
},
{
"type": "integer"
}
]
}
When you validate the schema the 1st, 2nd and 3rd item need to match their type.
If you have more than four items in your array, the extra ones dont have a specified type so they wont fail validation also an array with less than 3 items will validate as long as the type for each item is correct.
Source and a good read I found last week when I started json schema: Understanding JSON Schema (array section in page 24 of PDF)
ps: english it's not my first languaje, let me know of any mistake in spelling, punctuation or grammar
|
Q:
Find all rows from table1 that have zero rows in table2 linked to it by foreign key
The foreign key trade.ticker_id point to ticker.id.
I want to find all rows in 'ticker' that have zero rows in 'trades' linked to it.
mysql> describe trade;
+-----------+-------------+------+-----+---------+----------------+
| Field | Type | Null | Key | Default | Extra |
+-----------+-------------+------+-----+---------+----------------+
| id | int(11) | NO | PRI | NULL | auto_increment |
| time | datetime | NO | | NULL | |
| price | float | NO | | NULL | |
| quantity | int(11) | NO | | NULL | |
| source | varchar(64) | YES | | NULL | |
| buyer | varchar(64) | YES | | NULL | |
| seller | varchar(64) | YES | | NULL | |
| initiator | varchar(64) | YES | | NULL | |
| ticker_id | int(11) | YES | MUL | NULL | |
+-----------+-------------+------+-----+---------+----------------+
9 rows in set (0,00 sec)
mysql> describe ticker;
+-------------+--------------+------+-----+---------+----------------+
| Field | Type | Null | Key | Default | Extra |
+-------------+--------------+------+-----+---------+----------------+
| id | int(11) | NO | PRI | NULL | auto_increment |
| name | varchar(64) | NO | | NULL | |
| long_name | varchar(250) | YES | | NULL | |
| exchange_id | int(11) | YES | MUL | NULL | |
+-------------+--------------+------+-----+---------+----------------+
4 rows in set (0,00 sec)
A:
Try this:
SELECT * FROM ticker WHERE id NOT IN (SELECT ticker_id FROM trade)
|
Q:
Import table from HDFS in HBase
I created a table in pig and stored it in hdfs:
STORE mapping INTO 'hdfs://localhost:9000/hbase/data/default/mapping' USING PigStorage ('\t');
Running the ls command on hdfs, I'm getting the table:
bin/hdfs dfs -ls /hbase/data/default
Found 1 item
drwxr-xr-x - hfu supergroup 0 2015-11-09 13:33 /hbase/data/default/mapping
But while running the list command in HBase shell, the table doesn't appear.
I'm using:
hbase-0.98.0-hadoop2
hadoop-2.6.1
pig-0.15.0
all running on one virtual machine
How can I import the table in HBase?
A:
First of all create the table in HBase using HBaseHCatStorageHandler or directly from HBase shell.
CREATE TABLE meters (col1 STRING, col2 STRING) STORED BY 'org.apache.hcatalog.hbase.HBaseHCatStorageHandler' TBLPROPERTIES ( 'hbase.table.name' = 'meters', 'hbase.columns.mapping' = 'd:col2', 'hcat.hbase.output.bulkMode' = 'true' ) ;
col1- Will be the Rowkey of HBase table
col2- Will be the column qualifier under column family "d"
Now use STORE command to load data into this table.
|
WARREN ELLIS is a graphic novelist, writer, public speaker and author of the NYT best-selling novel GUN MACHINE.
Tuesday: Post-Canada
Published January 24, 2006 by Warren Ellis
Doesn’t Stephen Harper look like the kind of actor a US or US-but-produced-in-Canada TV show uses as the bad guy when they can’t afford a British actor?
(Which, when David Warner is still working, is kind of unimaginable. But still.)
You know the kind of guy. Grey hair, so white you can practically see through his skin into his
circulatory system, with the kind of unblinking half-glower that lets you know that no matter what he’s talking about, he’s actually thinking about shoving pregnant lesbians tits-first into a woodchipper. He’s the white guy in the suit whose last job was sitting behind a big desk condemning Tia Carrere to death in an episode of RELIC HUNTER.
Paul Martin should never have let on that he was desperate. And now he’s in the bin and my Canadian friends are ruled by the guy who plays Creepy Vice-President in Sci-Fi Channel shows.
And, yes, I’m kicking my heels while waiting for the funeral arrangements. My girls are off to America on holiday this week, so they’re going to miss the funeral. Which kind of suits me, to be honest. The funeral itself, I can handle. It’s the thing after it I hate, where you go back to the house and the family’s supposed to lay on food and booze and a bunch of relatives crawl out of the woodwork to get shitfaced and have a good laugh. I hate that. I disappear after the service.
So I’m on my own for a couple of weeks, from tomorrow. Weird timing. Obviously, I’m not going to be around much for the next few days, but after that I imagine you can expect a flurry of drunken, paranoid, isolated ravings.
Thanks to all for the notes.
— W
(EDIT: BREAKING NEWS FROM MEDIAWEEK ONLINE: Weblets UPN and The WB will cease operations in September, giving way to a new broadcast network that will build on the assets of CBS Corp. and Time Warner, reports Anthony Crupi. The new venture, to be named The CW Network, launches this fall with 30 hours of weekly programming aimed at the 18-34 demo.)
16 Comments
When Bush was elected a group of my friends emmigrated to Canada. I wonder where they’ll go next…
Good luck avoiding the relatives, they have thermal based vision you know, so be careful.
January 24, 2006
Arni
After the funeral there is cake for the living,
peace and quiet for the dead.
I never do cake either.
strength to you and your family.
January 24, 2006
Lone Canuck
I expect the government will be, in a word, short. The opposition is far too strong for the Conservatives to make any REAL dents with regards to their “promises”. Considering the state that Canada was in before this election (ie: very good – balanced budget, civil liberty reforms, maintaining good international image, standing up to the US and their vulgar trade and foreign policies), I feel that the Conservatives will not likely do much better, let alone maintain. I see a 6 month stint before another election is held, or at the very least, a referendum.
It think the Conservatives are gonna last more than that. At least two years, ’cause they will have to work with other parties in order to get a positive vote on their propositions. We should expect a thinner federal government, tax reduction, less ministries and more money to the provinces.
As for the Irak war, The anti-missile shields, the gay marriages, they are not gonna be able to make hasty decisions since the other parties won’t let them. If they do try to change what has been done, the Parliament will have to vote, and on those issues, they are not gonna win. The Conservatives have to please or it’s election time again. They know that.
What the Conservatives will really want is succeed in implementing their easy-to-implement campaign promises and after an easy-we-are-all-friend-in-Canada first mandate, they’ll try to get the majority. That’s where the troubles will begin, if it occurs.
Even if it’s difficult for a lot you to understand, even if the Conservatives are “friends” with the Bush administration, they are not gonna be able to do a damn thing about it in their first mandate.
1. People who go on long political tirades should know how to spell Iraq.
2. Yeah, we’re boned.
3. As our public wealth gets liquidated over the next few years and Canadian agriculture completely dries up, I think I’ll work my way over to Australia and couch-surf with some friends. Fuck this two-party system bullshit. Lemme slip ah shihmp on da bahbee fo’ ya.
As far as Canada goes, I didn’t rush over the border after Bush’s second victory just because I wasn’t sure how Martin would pan out. I must admit I didn’t think the Conservatives would be strong enough to win an election this soon, but I still didn’t trust things. My only comfort is that the NDP made gains, which shows a desire to hold back the Conservatives while punishing the Liberals. I’m still going to immigrate one day because it’s still better than the States, but I’m not in that much of a hurry.
As I said over on the Engine, now that Harper’s in charge we’ll soon be goostepping to the tune of “Heil Jesus”.
…but I digress.
I’m hoping that the Liberals, the NDP, and some of the saner Conservatives will help keep the party in check. If the Conservatives DO end up with a Vote of No-Confidence, which occurs the moment one of their bills is defeated (our political system is odd that way, its like the academic world…pass laws or get kicked out), I think the country may end up swinging NDP, or at least a good portion towards the NDP, if only because they’re the only party who hasn’t made a mess of things yet (Liberal scandal, and then the inability of the Conservatives to hold power in this example).
This is the…what? Third, fourth election we’ve had in 6 years? You get to number four or number 5, people are gonna pick the only party in the country that HASN’T pissed them off yet, and vote them in on the logic that they might last a bit longer since obviously the other guys weren’t doing anything right.
Of course, the NDP would leave us without an economy, but…eh. I’d prefer the Liberals back in power. I mean, two weeks ago I went down to the US and I got 86 cents CDN to $1 US. That’s the best its been in damn near 20 years! When I was a kid we didn’t even get exchange rates that good!
January 25, 2006
Paul
It occurs to me that the thing that makes democracy the least bad system of government is that you can replace the yahoos running the country every so often.
Any party plopped on the sofa of power for any length of time gets flabby, complacent and eventually corrupt. The people turf them out and get in a new crowd to reset the process. Meanwhile, the former party in power hopefully sorts its crap out in opposition – goes to the gym, eats healthy, runs up and down steps to the soundtrack to Rockey – and generally puts itself in a state where it can stand as a viable alternative to the lardy bastards in power come the next election.
At least that’s how it’s supposed to work.
Watching the Canadian situation from the happy vantage point of the other side of the Atlantic, it seems that the Liberals need to have a Night of the Long Knives to clean out the corruption and get themselves in shape to take on the Conservatives come the next election. The Canadian electorate seems pretty well disposed towards the Liberal ideal (at least everywhere other than Alberta – which seems to be Cannuck Texas) – they just need a party that’ll reflect that.
And you can comfort yourselves that it could be worse – the Cons have a minority government, which means they can’t afford to piss people off too much.
What’s more – I can see something similar happening in Britain come the next election. Blair’s too compromised to lead another successful campaign, Brown has all the charisma of Speak your Weight machine and everyone will be royally pissed off with Labour by then anyway. The Tories will look sleek and sexy by comparison so there’ll be a swing to them, with a significant protest vote going to the LibDems (if they can stop stabbing each other in the back long enough to put a manifesto together) from people who are sick of the New Labour project, but can’t stomach voting for the Conservatives (and who can blame them).
|
NICE plans 'no' for ulcerative colitis drugs
Patients with ulcerative colitis will be disappointed by news that cost regulators are planning to bar access to three treatments on the National Health Service in England.
Merck, Sharpe & Dohme’s Remicade (infliximab) and Simponi and AbbVie’s Humira (adalimumab) should not be routinely used by the NHS to treat moderate to severe forms of the condition, says the National Institute for Health and Care Excellence (NICE), because there is not enough evidence to show they are clinically and cost effective compared with other therapies currently available.
However, a consultation on the proposed guideline is now open (until October 15), and the Institute says it welcomes comment from manufacturers and other stakeholders as well as more information that might lead to a more positive recommendation.
The drugs are all licensed to treat moderate to severely active ulcerative colitis in adults who have failed to respond to or are unable to take conventional therapy, while Remicade has also been cleared to treat children and adolescents aged six-17 years.
The cost of Humira induction therapy is £2,113 followed by monthly maintenance therapy of £704, while costs for Simponi and Remicade are £2,289 and £763 (including a Patient Access Scheme) and £5,035 and £210, respectively, though these may vary in different settings because of negotiated procurement discounts.
An estimated 146,000 people in the UK live with ulcerative colitis, a chronic condition in which the large intestine becomes inflamed.
|
// Copyright 2015 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "ios/chrome/browser/ui/webui/net_export/net_export_ui.h"
#include <memory>
#include <string>
#include "base/bind.h"
#include "base/location.h"
#include "base/macros.h"
#include "base/strings/string_util.h"
#include "base/strings/utf_string_conversions.h"
#include "base/values.h"
#include "components/grit/components_resources.h"
#include "components/net_log/chrome_net_log.h"
#include "components/net_log/net_export_ui_constants.h"
#include "components/net_log/net_log_file_writer.h"
#include "ios/chrome/browser/application_context.h"
#include "ios/chrome/browser/browser_state/chrome_browser_state.h"
#include "ios/chrome/browser/chrome_url_constants.h"
#include "ios/chrome/browser/ui/show_mail_composer_util.h"
#include "ios/chrome/grit/ios_strings.h"
#include "ios/web/public/web_thread.h"
#include "ios/web/public/web_ui_ios_data_source.h"
#include "ios/web/public/webui/web_ui_ios.h"
#include "ios/web/public/webui/web_ui_ios_message_handler.h"
namespace {
web::WebUIIOSDataSource* CreateNetExportHTMLSource() {
web::WebUIIOSDataSource* source =
web::WebUIIOSDataSource::Create(kChromeUINetExportHost);
source->SetJsonPath("strings.js");
source->AddResourcePath(net_log::kNetExportUIJS, IDR_NET_LOG_NET_EXPORT_JS);
source->SetDefaultResource(IDR_NET_LOG_NET_EXPORT_HTML);
return source;
}
// This class receives javascript messages from the renderer.
// Note that the WebUI infrastructure runs on the UI thread, therefore all of
// this class's public methods are expected to run on the UI thread. All static
// functions except SendEmail run on FILE_USER_BLOCKING thread.
class NetExportMessageHandler
: public web::WebUIIOSMessageHandler,
public base::SupportsWeakPtr<NetExportMessageHandler> {
public:
NetExportMessageHandler();
~NetExportMessageHandler() override;
// WebUIMessageHandler implementation.
void RegisterMessages() override;
// Messages.
void OnGetExportNetLogInfo(const base::ListValue* list);
void OnStartNetLog(const base::ListValue* list);
void OnStopNetLog(const base::ListValue* list);
void OnSendNetLog(const base::ListValue* list);
private:
// Calls NetLogFileWriter's ProcessCommand with DO_START and DO_STOP commands.
static void ProcessNetLogCommand(
base::WeakPtr<NetExportMessageHandler> net_export_message_handler,
net_log::NetLogFileWriter* net_log_file_writer,
net_log::NetLogFileWriter::Command command);
// Returns the path to the file which has NetLog data.
static base::FilePath GetNetLogFileName(
net_log::NetLogFileWriter* net_log_file_writer);
// Send state/file information from NetLogFileWriter.
static void SendExportNetLogInfo(
base::WeakPtr<NetExportMessageHandler> net_export_message_handler,
net_log::NetLogFileWriter* net_log_file_writer);
// Send NetLog data via email. This runs on UI thread.
static void SendEmail(const base::FilePath& file_to_send);
// Call NetExportView.onExportNetLogInfoChanged JavsScript function in the
// renderer, passing in |arg|. Takes ownership of |arg|.
void OnExportNetLogInfoChanged(base::Value* arg);
// Cache of GetApplicationContex()->GetNetLog()->net_log_file_writer(). This
// is owned by ChromeNetLog which is owned by BrowserProcessImpl. There are
// four instances in this class where a pointer to net_log_file_writer_ is
// posted to the FILE_USER_BLOCKING thread. Base::Unretained is used here
// because BrowserProcessImpl is destroyed on the UI thread after joining the
// FILE_USER_BLOCKING thread making it impossible for there to be an invalid
// pointer this object when going back to the UI thread. Furthermore this
// pointer is never dereferenced prematurely on the UI thread. Thus the
// lifetime of this object is assured and can be safely used with
// base::Unretained.
net_log::NetLogFileWriter* net_log_file_writer_;
base::WeakPtrFactory<NetExportMessageHandler> weak_ptr_factory_;
DISALLOW_COPY_AND_ASSIGN(NetExportMessageHandler);
};
NetExportMessageHandler::NetExportMessageHandler()
: net_log_file_writer_(
GetApplicationContext()->GetNetLog()->net_log_file_writer()),
weak_ptr_factory_(this) {}
NetExportMessageHandler::~NetExportMessageHandler() {
// Cancel any in-progress requests to collect net_log into temporary file.
web::WebThread::PostTask(
web::WebThread::FILE_USER_BLOCKING, FROM_HERE,
base::Bind(&net_log::NetLogFileWriter::ProcessCommand,
base::Unretained(net_log_file_writer_),
net_log::NetLogFileWriter::DO_STOP));
}
void NetExportMessageHandler::RegisterMessages() {
DCHECK_CURRENTLY_ON(web::WebThread::UI);
web_ui()->RegisterMessageCallback(
net_log::kGetExportNetLogInfoHandler,
base::Bind(&NetExportMessageHandler::OnGetExportNetLogInfo,
base::Unretained(this)));
web_ui()->RegisterMessageCallback(
net_log::kStartNetLogHandler,
base::Bind(&NetExportMessageHandler::OnStartNetLog,
base::Unretained(this)));
web_ui()->RegisterMessageCallback(
net_log::kStopNetLogHandler,
base::Bind(&NetExportMessageHandler::OnStopNetLog,
base::Unretained(this)));
web_ui()->RegisterMessageCallback(
net_log::kSendNetLogHandler,
base::Bind(&NetExportMessageHandler::OnSendNetLog,
base::Unretained(this)));
}
void NetExportMessageHandler::OnGetExportNetLogInfo(
const base::ListValue* list) {
web::WebThread::PostTask(
web::WebThread::FILE_USER_BLOCKING, FROM_HERE,
base::Bind(&NetExportMessageHandler::SendExportNetLogInfo,
weak_ptr_factory_.GetWeakPtr(), net_log_file_writer_));
}
void NetExportMessageHandler::OnStartNetLog(const base::ListValue* list) {
std::string log_mode;
bool result = list->GetString(0, &log_mode);
DCHECK(result);
net_log::NetLogFileWriter::Command command;
if (log_mode == "LOG_BYTES") {
command = net_log::NetLogFileWriter::DO_START_LOG_BYTES;
} else if (log_mode == "NORMAL") {
command = net_log::NetLogFileWriter::DO_START;
} else {
DCHECK_EQ("STRIP_PRIVATE_DATA", log_mode);
command = net_log::NetLogFileWriter::DO_START_STRIP_PRIVATE_DATA;
}
ProcessNetLogCommand(weak_ptr_factory_.GetWeakPtr(), net_log_file_writer_,
command);
}
void NetExportMessageHandler::OnStopNetLog(const base::ListValue* list) {
ProcessNetLogCommand(weak_ptr_factory_.GetWeakPtr(), net_log_file_writer_,
net_log::NetLogFileWriter::DO_STOP);
}
void NetExportMessageHandler::OnSendNetLog(const base::ListValue* list) {
web::WebThread::PostTaskAndReplyWithResult(
web::WebThread::FILE_USER_BLOCKING, FROM_HERE,
base::Bind(&NetExportMessageHandler::GetNetLogFileName,
base::Unretained(net_log_file_writer_)),
base::Bind(&NetExportMessageHandler::SendEmail));
}
// static
void NetExportMessageHandler::ProcessNetLogCommand(
base::WeakPtr<NetExportMessageHandler> net_export_message_handler,
net_log::NetLogFileWriter* net_log_file_writer,
net_log::NetLogFileWriter::Command command) {
if (!web::WebThread::CurrentlyOn(web::WebThread::FILE_USER_BLOCKING)) {
web::WebThread::PostTask(
web::WebThread::FILE_USER_BLOCKING, FROM_HERE,
base::Bind(&NetExportMessageHandler::ProcessNetLogCommand,
net_export_message_handler, net_log_file_writer, command));
return;
}
DCHECK_CURRENTLY_ON(web::WebThread::FILE_USER_BLOCKING);
net_log_file_writer->ProcessCommand(command);
SendExportNetLogInfo(net_export_message_handler, net_log_file_writer);
}
// static
base::FilePath NetExportMessageHandler::GetNetLogFileName(
net_log::NetLogFileWriter* net_log_file_writer) {
DCHECK_CURRENTLY_ON(web::WebThread::FILE_USER_BLOCKING);
base::FilePath net_export_file_path;
net_log_file_writer->GetFilePath(&net_export_file_path);
return net_export_file_path;
}
// static
void NetExportMessageHandler::SendExportNetLogInfo(
base::WeakPtr<NetExportMessageHandler> net_export_message_handler,
net_log::NetLogFileWriter* net_log_file_writer) {
DCHECK_CURRENTLY_ON(web::WebThread::FILE_USER_BLOCKING);
base::Value* value = net_log_file_writer->GetState();
if (!web::WebThread::PostTask(
web::WebThread::UI, FROM_HERE,
base::Bind(&NetExportMessageHandler::OnExportNetLogInfoChanged,
net_export_message_handler, value))) {
// Failed posting the task, avoid leaking.
delete value;
}
}
// static
void NetExportMessageHandler::SendEmail(const base::FilePath& file_to_send) {
if (file_to_send.empty())
return;
DCHECK_CURRENTLY_ON(web::WebThread::UI);
std::string email;
std::string subject = "net_internals_log";
std::string title = "Issue number: ";
std::string body =
"Please add some informative text about the network issues.";
ShowMailComposer(base::UTF8ToUTF16(email), base::UTF8ToUTF16(subject),
base::UTF8ToUTF16(body), base::UTF8ToUTF16(title),
file_to_send,
IDS_IOS_NET_EXPORT_NO_EMAIL_ACCOUNTS_ALERT_TITLE,
IDS_IOS_NET_EXPORT_NO_EMAIL_ACCOUNTS_ALERT_MESSAGE);
}
void NetExportMessageHandler::OnExportNetLogInfoChanged(base::Value* arg) {
std::unique_ptr<base::Value> value(arg);
DCHECK_CURRENTLY_ON(web::WebThread::UI);
web_ui()->CallJavascriptFunction(net_log::kOnExportNetLogInfoChanged, *arg);
}
} // namespace
NetExportUI::NetExportUI(web::WebUIIOS* web_ui)
: web::WebUIIOSController(web_ui) {
web_ui->AddMessageHandler(new NetExportMessageHandler());
web::WebUIIOSDataSource::Add(ios::ChromeBrowserState::FromWebUIIOS(web_ui),
CreateNetExportHTMLSource());
}
|
Hand held beverage holders known in the art allow a user to hold a beverage in a holder which can be held in one hand. However, such beverage holders restrict the user's use of that hand holding the beverage holder. The beverage holders are one dimensional. They hold only the beverage. As a result, they prevent a user from easily making a phone call on the user's mobile phone or access the applications on the user's mobile phone in the spare hand while holding the beverage holder in the other hand. The user of a conventional hand held beverage holder must put down his or her beverage to free their other hand for making a phone call or accessing the applications on the mobile phone. It is an object of the present invention to address these shortcomings in the art.
|
Q:
Tests not executed with casperJS
I have two tests files in the same folder : test_a.js and test_b.js.
When I run casperjs test folder, only test_a.js is executed.
Both tests are built this way :
var casper = require('casper').create();
casper.test.begin('Test description', n, function(test) {
casper.start(SERVER).then(function() {
// Some basic tests
});
casper.run(function(){
test.done();
this.exit();
});
});
Would you guys know why ? (tests are very basic, so I don't include them for readability. If you wish to see them, please let me know :) )
A:
Well, I found the solution on this post. I just had to take away the
var casper = require('casper').create();
and put the this.exit() in only one file.
|
Embarrassing Moments at Work: How to Recover
What about office romance?
Discretion also works if you date a coworker, but sometimes it’s impossible to keep such interactions private.
For example, Gigi’s coworkers at a Seattle ad agency knew all about her relationship with a fellow employee because it was a very social office. After their breakup, they continued to hang out with the group.
“As long as you’re not working for that person, and it’s not interfering with work, it’s nobody’s business,” Pachter says.
Prepare for wardrobe malfunctions
Perhaps nothing can be as mortifying as getting a stain on your shirt just before a big meeting, or realizing your zipper was down when you bumped into the big boss in the hallway.
Krystn, a fundraiser for a nonprofit organization in Philadelphia, still remembers the start of her first job for the wrong reason. The fabric on her “professional” blouse didn’t breathe and she was nervous — a bad combination when being introduced to colleagues.
“I had huge sweat stains, and was trying to shake people’s hands without moving my arms—and they could see,” she recalls.
To avoid these types of scenarios, keep a spare jacket, stain remover, and sewing kit on hand if you can.
Otherwise, you have the choice of acting like the problem’s not there—or acknowledging the elephant on your shirt by making a joke.
“If you can have a good line, it will usually break the ice and then people can ignore it,” Pachter says.
One the flip side, if you notice a colleague has one too many buttons undone or an unzipped fly, say something.
“You have to be upfront and discreetly say the fly is undone,” Pachter says. “If you can save someone embarrassment, please do.”
|
In his talk, he nodded to that fact by saying that, despite tech and entrepreneurship sites inspiring him to start his company: “I think at any given moment, just by personality, we'd rather be working on the product than doing interviews. There was this vacuum of news, and a few months ago it all really broke at the same time.”
And that, Silbermann said, felt like a "really weird phenomenon" to him.
“It's exciting to see people using the product in ways that we never really expected. It's exciting that people care a lot. And then you also feel this weight of responsibility, you sort of brought this little thing to the world, this little product, and you want to see it get better,” he said, nodding to the fact his company is building out new features at a rapid clip. “I think anyone who makes products has this simultaneous joy and, almost, shame looking at it. You look at it all day and all you can see is all these things you want to make better.”
Pinterest is a social website on which users post images of various items—from a hairstyle to a motorcycle—to boards that function like image folders. Users can “re-pin” items they like from others' boards to their own, comment, or simply “like” pins. The well designed site is the eye candy of social media, and is gaining reputation as a traffic referrer more powerful than LinkedIn or Google+—and one with a more natural connection to retail stores and items.
In late 2011, Pinterest cracked the list of the top-10 social networks globally. Silbermann and his two co-founders have nailed down $37.5 million in funding, for a valuation of $200 million.
How'd that happen? Rewind to 2003, when Silbermann was reading the tech blogs. It was around that time he quit his consulting gig, moved to California, met co-founder Paul Sciarra (with whom he made iPhone apps), and started knocking on Google's door to learn the Silicon Valley ropes.
“I didn't have an engineering background, so I really had to cajole my way into Google,” Silbermann said.
He admired Google for its innovative attitude about product-creating. “They really had this audacity to think on a huge scale....Google was like the only company that was like, we're making so much money, let's take a picture of every street in the world. Nobody does that.”
“For me, Google was the coolest place. It was the coolest place,” he said. In the time he worked at Google, fellow Google employees included Kevin Systrom, who went on to found Instagram, and the creator of Foursquare, Dennis Crowley. “People there were so smart. And they were all doing these really interesting things. I just felt lucky to be part of it even in a small way.”
Pinterest started in 2009 as a night-and-weekend project. As a kid, Silbermann said, he collected lots of things, such as insects and stamps. As an adult, he began to think that the things we collect can say a lot about who we are and what we are interested in.
“I can't say it came from really hard-nosed business analysis,” he said. “It was just something I really wanted to see built. I just thought it could just be so good for the world if you could just share these things about themselves.”
It started with a small idea: How do we best share things with three or 10 people or 20 people? Silbermann says his small team never thought about what kind of sharing system would work for a million people—only what would work for a small network. Design was their big focus. The team debated over every detail a user sees on Pinterest today: should there be boards? Repinning? A concept of a feeds? Should it be links or items?
“There were literally dozens of version that [Pinterest grid] were fully coded, fully styled with live production of data that we went through” he said. “We'd vary the width, we'd vary where the meta-data was, we'd vary was the person on the left side or the right side...We just felt like if your collections didn't look awesome, if they weren't really beautiful, why would you spend time to build them?”
After seven months of working on Pinterest, Silbermann said he sent an email to 200 friends inviting them to use it. “I think of them 100 opened the email, which I think said something,” he said.
“I was like catastrophically small numbers,” he said. And the user-base grew super slowly. After nine months, Pinterest was still under 10,000 users, and a lot of them weren't using it every day. Why didn't he quit?
“The idea of telling everyone that we blew it was just so embarrassing,” Silbermann said. “I was like, Google barely hired me the first time, I'm never going to get back in.”
Seriously, though: “We just felt like if everyday we were getting a little bit closer to something that we would be really proud of, we would never regret the time we'd invested,” he said.
|
Heating and cooling devices in cooking systems, such as boilers in coffee machines, coils in hot plates, compressors in icemakers, etc., use significant amounts of energy to heat or cool a product, such as food or drink. However, the amount of power available to the heating/cooling devices often exceeds the amount of power used by the device, or even the amount of power that the device can safely use. In addition, the heating/cooling devices often use power in bursts such that the power used by the cooking changes substantially over time. For example, a boiler uses a significant amount of energy to heat a liquid from room temperature to a brewing temperature. However, prior to heating the liquid, the boiler uses little to no energy, and once the brewing temperature is reached, the boiler uses significantly less energy to maintain the temperature. As such, power that is allocated to the cooking systems is left unused.
|
---
abstract: 'Nested parallelism exists in scientific codes that are searching multi-dimensional spaces. However, implementations of nested parallelism often have overhead and load balance issues. The Orbital Analysis code we present exhibits a sparse search space, significant load imbalances, and stopping when the first solution is reached. All these aspects of the algorithm exacerbate the problem of using nested parallelism effectively. In this paper, we present an inspector/executor strategy for chunking such computations into parallel wavefronts. The presented shared memory parallelization is no longer nested and exhibits significantly less load imbalance. We evaluate this approach on an Orbital analysis code, and we improve the execution time from the original implementation by an order of magnitude. As part of a Graduate Computer Science course in Parallel Programming models, we show how the approach can be implemented in parallel Perl, Python, Chapel, Pthreads, and OpenMP. Future work includes investigating how to automate and generalize the parallelization approach.'
author:
-
-
bibliography:
- 'libration.bib'
title: Handling Nested Parallelism and Extreme Load Imbalance in an Orbital Analysis Code
---
Introduction
============
Nested loop parallelism is natural to express in programming models such as OpenMP, but difficult to efficiently realize when sparse computation spaces with significant load imbalances and early termination criteria are involved. In this paper we present an approach to parallelizing such computations on shared memory machines.
``` {frame="single"}
Main()
for each part in particle
if( isConsistent(part) )
result = CheckResonance(part)
EndMain
checkResonance(part)
for(p=1;p<pmax;p++)
for(q=p;p-q<pmax && q>0;q--)
if( ratio(p,q) not in ratios )
for(m=q;p-q>=0;m--)
for(n=m;p-q-m>=0;n--)
for(r=n;p-q-m-n>=0;r--) {
s=p-q-m-n-r
if(checkLibration(part,p,q,m,n,r,s))
return (p,q,m,n,r,s)
else
continue
}
```
The orbital analysis code we worked with in this case study consists of a six-deep nested loop structure including the outermost loop over particles (see Fig. \[orbitOverview\]). Each of the six nested loops can be executed in parallel, thus the computation experiences significant nested parallelism. One problem is that the iteration space is sparse: particles are checked for consistency and the [(p,q)]{} ratio is checked to avoid equivalent repeats. Specifically, there is a condition checked at line 10 before the computation for a particular [(p,q)]{} iteration executes. Most of the points in the parameter space fail this check. Another problem is early termination: this code will return upon finding parameters that satisfy the check in the innermost loop at line 16.
One parallelization alternative is to compute each particle independently of the others. In other words, parallelize the outermost loop and leave all else unchanged. However, this performs poorly due to load balancing issues. In the most extreme cases, a single particle can run 2-3 orders of magnitude longer than the a short running particle. The execution time for a given particle cannot be predicted without running it fully. In the worse case, in which a single processor is given all of the long running particles, no gains are achieved from parallelization.
A second alternative would be to use nested parallelism. However, the early termination check in the innermost loop makes nested parallelism impractical. If all size loops where specified as parallel, all iterations would execute even when early termination is possible, which is frequent. Additionally, there would need to be a reduction computation that determines the earliest values of [(p,q,m,n,r)]{} where the condition was satisfied, because that is the correct result for the program.
A third alternative is to use task-based parallelism. This would work by spawning off tasks for each call to checkLibration(). While implementing the task-based model two problems arise. First, the non-determinism introduced by the task parallelism loses the ordering information guaranteed by the serial code (i.e., early termination strikes again). This prevents us from knowing if the first value returned is the optimal solution. Second, there is too much task overhead. Each call to checkLibration is lightweight, but the amount of calls made is high. In an extreme case one particle spawned over 140,000 tasks. To handle the load imbalance, sparse iteration space, and early termination issues, we developed a finer-grained parallelism internal to each particle. The approach consists of building parallel wavefronts of tuples in the search space at a particular nesting depth. Figure \[alg:InternalPseudo\] shows the pseudocode for the algorithm implemented. In the new algorithm, for each [(p,q)]{} ratio that passes the check on Line 10, a subset of the search space is collected. The [CheckLibration()]{} function can then be called on that subset in parallel. The final loop at Line 23 will check if any of the tuples in the just executed wavefront passed the libration check and thus the computation should terminate early.
The original orbital analysis code was implemented in Perl and would have taken more than a month to analyze the monthly observations from a new telescope. Parallelizing the computation and porting the Perl analysis script to more efficient programming models makes the execution time practical (less than a week). As part of a Graduate Parallel Programming Models class, we evaluated the process of implementing the parallel analysis script in Perl, Python, Chapel, Pthreads, and OpenMP. We compare code snippets from the various programming models to exhibit different approaches for implementing the presented parallelization strategy
Significant speed-up was achieved over the original Perl version. Using a 12-Core machine over 3x speed-up was achieved in every implementation versus their own serial version. The PThreads version was the overall fastest, bringing the worst case per particle down from 541 second to 5.2 seconds, a 4x speed-up versus its own serial version, and 103x speed-up versus the original Perl baseline. This improvement allows for the total analyses of a month’s worth of data (approximately 40,000 particles) to be performed in several hours.
The Astronomy community has been developing more software in Python. The serial Python version performs comparably to the baseline Perl. With the described algorithm the total execution time for the most costly particle was still brought down to 78.8 seconds, or about a 6.5x speedup over the original Perl code. This brings the computation down into the realm of acceptability.
``` {frame="single"}
Main()
for each part in particle
if( isConsistent(part) )
result = CheckResonance(part)
EndMain
checkResonance(part){
for(p=1;p<=pmax;p++)
for(q=p; p-q<pmax && q>0; q--)
if( ratio(p,q) not in ratios ) {
subset = []
for(m=p-q; p-q>=0;m--)
for(n=p-q-m; n >= 0; n--)
for(r=p-q-m-n; r >= 0; r--) {
s = p-q-m-n-r
subset.append((p,q,m,n,r,s))
}
// parallel wavefront
posSols = []
parfor(i=0;i<len(subset);i++)
possSols[i]=CheckLibration(subset[i])
for(i=0;i<len(possSols);i++)
if( possSols[i] )
return subset[i]
}
EndCheckResonance
```
In this paper, we make the following contributions:
- Provide a description of the application: details about the problems faced by the scientist that necessitate code performance improvement.
- Parallelizing the code: Why simple solutions do not work, discussion of the inherent workload issues, and the final solution.
- Description of how the parallelization approach can be mapped to the programming constructs in various programming languages.
- Comparison of implementations across different parallel programming models in terms of performs.
{width="6.2in"}
Orbital Analysis Application Details
====================================
The Kuiper belt is a population of small bodies in the outer solar system. When new objects are discovered in the Kuiper belt, a common first step is to simulate the orbits of the observed objects forward in time and then analyze the results to distinguish between various types of orbital evolution. The problem is that aspects of this analysis experience significant load imbalance. There is additional interpretation overhead due to the code originally being written in Perl. Both issues can lead to analysis of a single particle taking in excess of 10 minutes. NASA’s Large Synoptic Survey Telescope (LSST) will begin operations in the early to mid 2020s and is expected to discover and track about 40K Kuiper belt objects over a ten year survey (compared to the approximately 1000 currently tracked objects). Thus the need to do this analysis more efficiently is critical. In this section, we describe the analysis and its current performance bottleneck
Classifying Objects by Their Neptune Resonance
----------------------------------------------
The objects in the Kuiper belt represent a record of the dynamical history of the solar system’s giant planets. The distribution of Kuiper belt objects (KBOs) in orbital resonance with Neptune is of particular interest because it can serve as an observational test for theoretical models of the outer solar system’s dynamical history [@Malhotra1993; @Morby2008; @Volk2016]. An object is in orbital resonance with Neptune when there is an integer ratio of the number of times it orbits the sun and the the number of times Neptune orbits the sun. When KBOs are observed, their orbits must be analyzed to determine whether they are resonant. Such dynamical classification is important in prioritizing objects for continued scientific study. For example, some specific hypotheses for the history of the solar system can be tested by observationally determining the chemical compositions of resonant KBOs; such observations are costly because they can only be done on very large telescopes, and dynamical classification is necessary for efficiently planning them.
The classification process, which is detailed in [@Gladman2008], entails the following basic steps:
1. The position of the object in the sky at a variety of epochs is determined from observations,
2. these positions are used to fit an orbit (a combination of position and velocity) for the observed object,
3. the orbit is numerically simulated forward in time under the gravitational influences of the solar system’s planets,
4. and the simulated orbital history is analyzed to determine if the object is in resonance with Neptune.
If the object is in resonance with Neptune, then the analysis program determines the specific resonance the object is in and the amplitude of libration for the associated resonance angle. The resonance is labeled $p$:$q$ according to the period ratio between the object and Neptune; a 3:2 ($p=3$, $q=2$) resonance is one where the Kuiper belt object’s orbital period is $1.5$ times Neptune’s orbital period (see Figure \[f:res-example\]). When an object’s evolution is controlled by the resonance, an angle will librate around a central value, whereas objects not in resonance will have a resonance angle that freely circulates between 0 and $360^{\circ}$ as shown in the right side of Figure \[f:res-example\]. For a given $p$ and $q$, there are many possible angles determined by the integers $m$, $n$, $r$, and $s$ that could librate; this is the origin of the nested loops shown in Figure \[orbitOverview\].
Performance Bottleneck
----------------------
The current performance bottleneck for this process is the last step where the simulated orbit is analyzed for libration of any relevant resonance angles. A large number of $p:q$ resonances must be checked for each object: all pairings of the integers between $1$ and $pmax$ (on the order of $30$ to $70$), where $pmax$ is a runtime parameter, which specifies the granularity of the angles checked. Objects that are near the correct period ratio for a large set of $p$, $q$ values take a long time to analyze.
To our knowledge, there is no standard, open source code available to performs this analysis. Researchers generally report the results of such analyses in papers, but do not make their codes available or report specific details about the analysis methodology. We investigate the workload of a Perl script that planetary scientist Dr. Kat Volk wrote to perform the analysis.
A Serial Perl implementation of this algorithm takes approximately 10 minutes on a Xeon Westmere-EP Dual 8-core Processor node to fully analyze an object that is close to many potential resonance ratios (some of these are eventually categorized as non-resonant). It is not possible to determine up front whether a particle will pass the initial resonance checks in seconds or require most of the 10 minutes, thus causing one level of load imbalance in the workload. Typically, we expect $\sim$25% of all observed KBOs to be actually non-resonant and thus require the full analysis time[@Petit2011canada].
Future Performance Demands
--------------------------
In the last 20 years, approximately $1000$ objects have been observed and classified; because they were typically discovered in groups of $10$ to $50$ [@Bannister2016], an analysis time of up to 10 minutes per particle has not been an issue. However, when the Large Synoptic Survey Telescope (LSST) comes online in the mid to late 2020s, the expectation is that forty thousand KBOs will be discovered within the first few years of the survey, and they will be continuously tracked over the survey’s ten year lifespan [@LSST2009]. Each month the LSST will scan the full southern sky multiple times and will provide new measurements of the position of these objects. Each set of new observations produces a more accurate orbit for the object, which requires re-analyzing the orbit for resonant behavior (until a sufficiently accurate orbit is determined). With 25% of the 40,000 objects requiring 10 minutes of wall-clock time each month, the analysis time for one month’s worth of data is approximately 2 months. This represents a significant performance bottleneck for researchers. We also note that code that enables more efficient identification of resonant behavior would be useful for analyzing test particles in numerical simulations of the outer solar system; such simulations are used to produce the theoretical predictions the observations are meant to test [@Levison2008].
![Bucketing of runtime for 500 particles. There is a large divide seen between particles that can be almost immediately rejected, and those that require a significant search time to confirm or reject[]{data-label="fig:perParticleContribution"}](runtime-distribution-1panel)
Parallelization Problems Due to Irregular Workload
==================================================
The goal of the orbital analysis code is to classify particles as either resonant or not resonant with Neptune. Since there is no communication between the computations for individual particles, parallelization over the particles would be the simplest. Figure \[fig:perParticleContribution\] shows the per particle contribution to execution time on our test set of particles. The unpredictable analysis times of the particles can easily lead to a small set of cores receiving all of the most computationally expensive particles, resulting in little to no improvement in the execution time. Therefore in the next section, we present a more effective strategy for parallelizing the computation. This section details our experimental methodology and the load imbalance.
Methodology
-----------
We ran experiments on the HPC system of the University of Arizona. The machine is an SGI Altix UV 1000 consisting of 170 Nodes, a given node consists of Xeon Westmere-EP Dual 8-core Processors running at 2.66 GHz. The machine was running Red Hat 6.0 Linux.
The original Perl code and the multithreaded version were run using Perl 5.10.1 and using Parallel::Loops from CPAN[@petervaldemarmørch2008]. The OpenMP and Pthreads versions of the code were both compiled with g++ (GCC) 4.4.4 20100726 (Red Hat 4.4.4-13). Chapel was compiled using the Cray Chapel Compiler version 1.12.0. Python was run using Python 2.7.9, and the Multiprocessing module from the Python standard library.
Both of the datasets we used consist of sets of particle simulations. Each particle has its run discretized into a number of time steps, which records the relevant angular information at the given point in the simulation. The more time steps, the finer grained the analysis and the longer processing takes. The first, used for the bucketing stage, consists of 500 particles whose orbits were divided into 9629 time steps. This was used only for one step due to the original prohibitively long testing time of the 500 particles. The second, consists of a set of 82 particles, each of 9629 time steps, this was used for all cross-language execution time comparisons. The third consists of 100 particles consisting of 50,000 times steps, analysis of which is currently too time consuming to perform.
The Algorithm
-------------
The resonance check for a given particle consists of the following steps as seen in Figure \[orbitOverview\]:
- If the [isConsistent()]{} call on Line 3 returns false the particle can be immediately rejected as non-librating.
- Checks all unique ratios of $p:q$ on Lines 8-10.
- Calculates each possible angular variation of the particle based on the $(p,q,m,n,r,s)$ values created in Lines 8-14 and calls [checkLibration()]{} to see if the particle librates with those angles.
As mentioned, the analysis of each particle is fully independent from that of any other particle, and so the particle level was an obvious place for parallelization. In practice, this consists of parallelizing the [for]{} loop around the call to [CheckRes()]{} as seen in the pseudocode in Figure \[orbitOverview\]. Each particle is checked using the [CheckRes()]{} function, which does all the necessary work to determine if a particle is resonant or not. Unfortunately, this did not improve performance much in the best case, and increased execution times in the worst case. Figure \[fig:particleLevel\] shows the behavior of the this method in each implementation as the number of threads increases. The behavior is irregular, with several implementations showing fluctuations in execution times as the number of cores changed.
![Execution times for parallelizing over the particles. Here we see erratic results due to the irregular workload that results in an unbalanced distribution of the long-running particles.[]{data-label="fig:particleLevel"}](ParticleLevelPar_cropped)
Workload Characterization
-------------------------
The particles can be placed into three categories:
1. the range of the particle’s semi-major axis is too great and therefore can be rejected outright,
2. the particle is in resonance, or
3. the particle cannot be outright rejected, but is not in resonance.
Each of these categories in turn tends to affect execution time in different ways. The first case is the fastest, contributing a negligible amount of time to overall execution time. The second case is highly variable, the search space is checked until a resonant angle is found. Though usually near the beginning of the search, it can theoretically require analyzing all possible ratios to find a single resonant angle. The third is the worst case, a particle that does not resonate but cannot be rejected outright. The particle at this point requires analyzing the entire search space before it can be rejected conclusively. As the search space is quite large, these types tend to dominate run time. All three of these particle types are spread throughout the data and one cannot know which category it belongs to without actually running the code.
The analysis times for individual particles were examined further. The original Perl code was used to classify a set of 500 particles, and analysis time for each particle was recorded. Figure \[fig:perParticleContribution\] shows the execution time distribution for analyzing the resonance of these particles. The results are stark, showing a bimodal distribution of particles either finishing nearly instantly, or running for several minutes at a time. This high variability in the work required to classify a particle explains the poor performance of the naive parallelization. The distribution of the analysis times cannot be known ahead of time, and so any gain from this type of parallelization will happen randomly, depending on how the compiler chooses to distribute the particles.
Particle-Internal Parallelization
=================================
Parallelizing the computation that occurs within each particle will help avoid the significant load imbalance issues that occur between particles. In this section, we present an approach to find wavefronts of parallel computation within the analysis for each particle.
Issues with Straight-Forward Parallelization
--------------------------------------------
The most obvious means to parallelizing the analysis within each particle would be to parallelize work at the outermost $p$ and $q$ loops. This has two issues due to requirements of the algorithm.
One issue is early termination. In the serial code, as soon as a result is found the code returns. By doing this the code can often avoid much computation. As the code searches for a solution, it can often find a valid result on the first several checks. In the worst case, there can be over 270,000 such checks when $pmax=30$. If we cannot return early, we are forcing all particles to be searched exhaustively. This increase in work leads to worse performance, even with parallelism added.
The other issue is one of ordering. As the algorithm progresses it checks possible values in a specific order. The earliest lexicographic iteration in this space is the least likely to be a false positive for resonance. This means that models that allow communication to end early, but cannot guarantee ordering of results are also invalid for our purposes.
Wavefront Parallelization
-------------------------
The load imbalance and deeply nested structure prevent consistent performance gains from being achieved across the different categories of particles. To overcome this, the inner most calls were factored out, and the nested structure was flattened into a single list that could be iterated over easily. The pseudocode for this is given in Figure \[alg:InternalPseudo\]. The internal parallelism algorithm can be broadly broken into the following steps:
- [An array of tuples is created, $(p,q,m,n,r,s)$, instead of calling [CheckLibration()]{} directly,]{}
- [CheckLibration() is mapped in parallel over the array of tuples,]{}
- [a new array is returned of the results of each CheckLibration() call, and]{}
- [these results are scanned serially to find the first occurrence of resonance, or lack thereof.]{}
- [If a result is found, the tuple associated with that result is returned.]{}
- [Otherwise, we continue searching until all possibilities are exhausted.]{}
This requires extra overhead in storing the tuples, but it fulfills all of the restrictions discussed. Returning the results as an array means that it does not matter how the individual processors run, the order of the results are the same as if it had run serially. We can then perform a serial scan of the results, finding the one that occurred first lexicographically. This allows us to reconstruct which result is the optimum in the case of false positives being returned.
As previously discussed, as soon as a result is found the code can stop. Often libration is found before searching the entire space. Building up the entire search space heavily penalizes those that could have terminated early. To solve this a final addition to the algorithm was added. Instead of building up the whole search space at once, we build up a subset (or wavefront), where some common prefix of the $(p,q,m,n,r,s)$ tuple is kept constant. We than check all tuples in this subset in parallel. If a result is found we can terminate early, if no result is found a new subset can be generated in check. This partial generation technique allows for us to parallelize over the search space, but without forcing searching the entire space.
![Execution times of Python code parallelization when the we parallelize over a subspace. The subspace is built by building a list of tuples. Each bar represents building a subspace where the tuple listed is a common prefix in that subspace. []{data-label="fig:LoopTests"}](spaceComparison_cropped)
Placing the Parallelism
-----------------------
Determining the correct prefix to keep for each check is difficult to determine a priori. If you check on each iteration of $p$ than each check is still checking a very large portion of the search space, and so the benefits of being able to return early are lessened. If you stop and check on each iteration of $n$ loops you face the opposite problem, you end up making so many parallel calls the overhead costs hurts the results.
An empirical approach was used to best identify where to implement the parallel subset search. Figure \[fig:LoopTests\] shows the execution times over the 82 particle set. This test was done in Python. On the ends we see the expected bimodal behavior, the shortest possible common prefix does poorly, as does the longest. As we slide towards the middle we see significant improvement in overall performance. The $(p,q)$ prefix outperforms the others, and was chosen as the placement for parallelism for all further experimentation.
Implementing the Parallelization in Various Programming Models
==============================================================
The original code written by the planetary scientist was written in Perl. In the context of a graduate parallel programming models course held in the Spring of 2016, we implement the designed parallelization of the libration analysis code in the following parallel programming models:
- Perl Thread Library,
- C++ and OpenMP,
- C++ and Pthreads,
- Python Multiprocessing Library, and
- Chapel.
We experimented with a number of parallel programming models with the primary evaluation metric being the performance. However, the maintainability and probable evolution of the algorithm by the planetary scientist is also a consideration, so we recorded the source lines of code and present code snippets to compare the different implementations.
Parallel Perl
-------------
Due to the algorithm being originally implemented in Perl work was done to parallelize in Perl. This was problematic though, and Perl was ill-suited to this task. The multithreading library of Perl is officially recommended against by the language designers. Each new thread spawns an entire new instance of the Perl interpreter, a heavyweight action. The results of this was that even with the full 12 cores of the system the execution time was over 10 times slower than serial implementation. The performance and source lines of code count were not recorded for Parallel Perl.
C++
---
C and C++ are popular languages for writing high performance code. For this comparison two of the most common parallel models were chosen:
- OpenMP: A library consisting of a set of compiler directives that the user uses to indicate where parallelism will be inserted.
- Pthreads: A library for manual thread managements, which enables the user to specify all details about how to divide up information and send it out to different threads for processing.
First, the Perl code was translated to equivalent C++ code. From this new base code, the internal parallelization algorithm was implemented using each of the two models.
``` {frame="single"}
for(int p=0;p<pmax;p++)
for(int q=9;q-p<pmax && q>=0;q--)
if(checkRatio(p,q,ratios){
int c = 0;
for(int m = p-q ; m >= 0 ; m--){
for(int n = p-q-m ; n >= 0 ; n--){
for(int r = p-q-m-n ; r >= 0 ; r--){
int s = p-q-m-n-r;
angles[c]=new Subspace(p,q,m,n,r,s);
c++;
bool results[c];
#pragma omp parallel for shared(result)
for (int i=0;i<size(angles);i++){
checkLibration(&angles[i],&results[i]);}
for(int i=0; i < size(result) ; i++){
if(result[i])
return angles[i];}
```
OpenMP
------
OpenMP is a parallelization library and compiler for C, C++, and Fortran [@dagum1998openmp]. It represents parallelism as a set of compiler directives known as *pragma*. The user must identify places where parallelism is to be inserted, and then inserts a pragma that the compiler uses to parallelize the program.
The compiler then does the necessary conversions to divide the iterations of the loop and assign it to individual threads, which will then be run in parallel. In many real world cases, more information is required for the compiler to perform its work correctly, and so there are a variety of possible arguments and different pragma that can be indicated by the user. In all cases though, OpenMP is dependent on the user identifying and specifying the type of parallelism to be used.
Figure \[OpenMPInternal\] shows the OpenMP implementation of our algorithm. For our code we first perform the build up of a list of tuples, as shown in Figure \[alg:InternalPseudo\]. Because data is being written to a shared memory variable, *result* we must be cautious of the shared variables since it may lead to correctness issues if not handled. This takes the form of specifying which variables are private to each thread, and thus can be copied, and which are shared, in which case the compiler must handle writing to a shared memory space. Finally, since OpenMP does not allow branching in or out of a structured block, we place the results in a global list of results. This list is scanned to see if resonance was found, and then to identify which values led to resonance.
``` {frame="single"}
// ti is the array of thread ids
pthread_t* ti = new pthread_t[threads];
for(p=1;p<pmax;p++)
for(int q=p;p-1<pmax && q>0;q--)
// inspecting for tuples of work
if(checkRatio(p,q,ratios))
for(int m=p-q;m>=0;m--)
for(int n=p-q-m;n>= 0;n--)
for(int r=p-q-m-n;r>=0;r--)
{
int s=p-q-m-n-r;
tuple.p=p;tuple.q=q;tuple.m=m;
tuple.n=n;tuple.r=r;tuple.s=s;
subset.push_back(tuple);
}
// spawn threads for parallelization
threads=min(subset.size(),max_threads);
for(int i=0;i<threads;i++)
{
err=pthread_create(ti+i, NULL,
partialCheck,(void*)(&i));
}
for(int i = 0 ; i < nTh ; i++)
pthread_join(ti[i],NULL);
// gather the results
for(int i=0;i<subset.size();i++)
if(results[i])
return subset[i];
```
Pthreads
--------
Pthreads is a low level C/C++ library for creating shared memory multi-threaded programs. Programmers define and create the number of execution threads, partition the computation and the data, and explicitly define which thread is going to do what part of the computation.
Figure \[pthreadsspjo\] shows the internal parallelization using Pthreads. Just like other models, we create a subset of computation space that we want to check. Next we need to create a number of threads that are going to process part of this subset. In Pthreads model each thread’s execution starts from a function that we pass in to `pthread_create()` constructor.
for p in range(0,pmax+1):
for q in range(p,0,-1):
subset = []
if( (p,q) not in ratios):
for m in range(p-q, -1, -1):
for n in range(p-q-m,-1,-1):
for r in range(p-q-m-n, -1, -1):
s = p-q-m-n-r
subset.append((p,q,m,n,r,s))
pool = MultiProcessing.Pool()
pf = Partial(CheckLibration, part)
results = pool.map(pf, subset)
for i in range(len(results)):
if results[i]:
return subset[i]
Python
------
Python has become one of the most popular languages for planetary scientists [@momcheva2015software]. Due to the usage of a Global Interpreter Lock (GIL) in the reference interpreter for the language parallel options are limited. The GIL prevents multiple threads from executing Python bytecode at the same time. The Multiprocessing library in Python sidesteps the GIL by using subprocesses rather than threads. This is more heavyweight than threading in other languages, but is a necessity forced upon the users by the GIL.
Figure \[PythonInternal\] shows the snippet for the particle-internal parallelization in Python. In the Python Multiprocessing library, the standard form of data parallelism is represented as a map function called over a collection. In this case, the [CheckLibration()]{} function will be mapped over the subset of tuples the inspector has collected. The results are guaranteed to be ordered the same as the input tuples’ orders, allowing us to guarantee our search for the optimum.
There is a mismatch between the angles that change from each call, and the particle that remains fixed. This led to us having to create a partial function to combine the checkLibration() function and the particle data. This creates a new function which has the same execution as checkLibration, but with the value for particle held fixed across all calls.
``` {frame="single"}
var subset:[0..size];
for p in [0...pmax]{
for q in [p...0]{
var counter : int = 0;
if( checkRatios(p,q,ratios) ){
for(m in [(p-q)..0] by -1){
for(n in [(p-q-m)..0] by -1){
for(r in [(p-q-m-n)..0] by -1){
var s : int = p-q-m-n-r;
subset[counter] = (p,q,m,n,r,s);
counter += 1;
size += 1}}}}}}
forall( i in 0..#counter )
found[i] = CheckLibration(subset[i]);
for( i in 0..counter){
if( found[i] )
return subset[i];}
```
Chapel
------
Chapel is the newest programming language of the three, a model designed from the ground-up to support parallelism [@ChapelOverviewJan13]. Created by the super-computer manufacturer Cray, Chapel represents an attempt to integrate parallelism from the ground up into a language. Parallel features in this language are syntactic elements of the language, with keywords indicating when parallelism is to be used. The language allows us to match closely to the pseudocode algorithm originally show. We build a set, we have a parfor over that set, and then we check the results for a positive result. The difference between the serial version, and the parallel version is as simple as replacing `for` with `forall`.
Source Lines of Code
--------------------
We also compare the total Source Lines of Code (SLOC) for the serial and parallel versions of each language.
Python requires the least amount of code, but required certain constructs, such as partial functions, which may be unfamiliar to users from a imperative or object oriented background. This is a case where the difference in SLOC can hide the actual complexity of the implementation from readers.
Though Chapel is more verbose than Python, it still has fewer lines of code than the serial Perl. The transition to the parallel algorithm was also simple, with the final parallelization change requiring only a keyword change from [for]{} to [forall]{}. Both the Python and Chapel code also had smaller differences between the serial and parallel versions than with the C++ versions.
For the OpenMP version the majority of the difference came from the refactoring necessary to fit the final parallel algorithm chosen for this task. The actual insertion the code related to OpenMP was much less: 3 lines overall including the pragma, the import, and a required initialization statement to control number of cores used.
PThreads had the largest difference by a wide margin. Beyond the changes required for the parallel algorithm, significant changes were required to fit that within the framework of PThreads. Explicitly managing all of the threading logic leads to significant tangling with the underlying logic of the chosen algorithm.
All 4 versions required some amount of refactoring, both to implement the new algorithm and to add the parallel logic. The Chapel and OpenMP versions were the least invasive in the insertion of parallel logic. And only these two allow for switching between parallel and serial code without requiring any changes to the final code. In this regard, they have the much less tangling than the other two implementations.
coordinates [(Baseline, 262) (Python,183) (Chapel,237) (OpenMP, 330) (Pthreads, 330)]{}; coordinates [ (Python,208) (Chapel,260) (OpenMP, 372) (Pthreads, 471)]{};
Performance Comparison
======================
We tested the implementations on two different datasets. The first was the same test set used for the Perl baseline data. This consists of 82 particles, represented as location and orientation at 9629 different time steps in the simulation. The long run-time at this granularity prevented analysis of the particles at a finer level of time. Each version showed at least 6x speed-up over the baseline code, with the OpenMP version achieving 103x speed-up, and a final runtime of 5.2 seconds versus the baseline run of 541 seconds.
Due to the success in improving performance on the dataset we did further testing on a second dataset of particles. These modeled each particle at 50,000 time steps and represented the granularity that the scientists would prefer to analyze. With the baseline Perl version a single particle could take more than 45 minutes to analyze. Performing analysis at this level was even less feasible for the incoming amount of data. For these long running particles we were able to get significant improvement as well. In the worst case, the Python version had 8.4x speed-up. In the best case, the OpenMP version once again performed best and gave us a 105x speed-up, bringing the worst particle down from 45 minutes to 25 seconds.
Finally, we give a Source Lines of Code (SLOC) comparison across language. This is done to give an approximation of the effort required to implement each version of the code. With this metric, both the Python and Chapel version outperformed the baseline Perl code.
Check-Internal Parallelization
------------------------------
The final version chosen for experimentation uses the Internal Parallelization model over the Naive model, because that version was able to handle the irregular workload. In this the checks over the search space for a given particle was parallelized, this has us handling each particle one by one, but handling each of them much quicker. These implementations were tested on the set of 82 short-length particles.
![Execution times for parallelization of the internal particle check. In this model each particle is run one-by-one, but search for each particle is parallelized. The Pthreads and OpenMP versions overlap almost exactly.[]{data-label="fig:deepparallel"}](RuntimePerCores_cropped)
Figure \[fig:deepparallel\] shows the raw execution time changes for each implementation. Figure \[fig:SpeedUpCropped\] shows the Speed-Up curves for each of the implementations. With this we are able to handle the unpredictable workload much better. The new implementation is entirely lacking in the sharp changes in performance found in the particle level parallelism. Each programming model shows a similar curved improvement as the number of cores increased. This shows that the algorithm chosen improves execution time of the longest running particles without too heavily penalizing those that can quickly return an answer. Thus, the flattened tuple structure chosen overcomes the workload imbalance issues inherent to the dataset.
![Graph showing the speed-up for each implementation. Each implementation is compared to its own serial implementation.[]{data-label="fig:SpeedUpCropped"}](IdealSpeedup)
The Python version performs well for an interpreted language. As the number of cores increases we see that the execution time approaches the speed of the compiled Chapel language. This alone represents significant speed-up, enough to bring the total execution time into the realm of feasibility.
The Chapel version performs well with a low number of cores, but does not scale as well as other versions. Only barely outperforming the Python version, surprising considering that Chapel is a compiled language. Though it did not perform as well as one would hope, the language is still young and the team has specifically targeted performance as their major focus for improvement in the coming years.
Both of the C++ versions match each others performance. OpenMP and Pthreads each show the same curve, and in general seem to be functionally identical to one another. Overall these two versions perform the best, with the Pthreads version barely out-performing the OpenMP code. The final implementation brings then execution time down to 5.2 seconds from the 541 second baseline serial Perl execution, giving a final speed up of 103x.
Large Time Scale Particles
--------------------------
Testing was extended to the second set of longer time scale particles. These particles represent a level of detail that the researchers would prefer for their analysis, but were unable because of the prohibitive execution times. With the original Perl implementation each particle was taking more than 10 minutes to analyze on the low end. On the high end a single particle could took up to 45 minutes. This quickly led to an unworkable situation.
Figure \[fig:worstcase\] shows a comparison of the execution times of the 5 worst particles from the long-time scale data set. The three versions shown perform well, bringing the execution times down much closer to the realm of feasibility. The OpenMP version is the fastest. but even in the worst case there is 8.2x speed-up over the 45 minute long per particle time for the baseline serial Perl implementation. Even with the slowest version we can show that the run-time can be brought down into a more feasible realm.
This problem of handling a larger dataset is interesting in that it is a common problem seen in the Scientific Computing community. So often are they limited by the speed at which they can do computation that they often work with simplified workloads to bring execution time down into the realm of feasibility. And so speed-up for them often represents a means to continue on to more complex computation, or finer grained analyses of their data. In this case, execution time was able to be improved so significantly that it brings nor only the current time scale level into a more feasible time frame, but to allow for better analysis to be done in the future.
![Comparison of the execution times of the top 10 longest running particles. Each of these particles are from the set of 100 long-time scale particles. In the original baseline each of these particles takes over 45 minutes on average to analyze. Each of our parallel versions bringing the execution time down significantly.[]{data-label="fig:worstcase"}](LongRunParticles_cropped)
Related Work
============
There has been much work on improving the performance of nested parallelism. Blikberg and S[ø]{}revik [@Blikberg2005] argued for flattening nested parallelism into a single level of parallelism. They then have an approach for load balancing when there is some model of how much work each task is doing. In the orbital analysis application the amount of work that will be needed per particle cannot be modeled ahead of time. Thibault et al. [@Thibault2008] are dealing with the problem of expressing data affinity to the underlying runtime system. The orbital analysis program has severe load imbalance issues, not data locality issues. Dimakopoulos et al. [@Dimakopoulos2008] created a nested parallelism benchmark and then showed that many nested parallelism implementations of OpenMP have a lot of overhead.
A significant amount of research investigates the advantages and disadvantages of various programming languages in the context of scientific computing. Caie et al. [@Cai2005] describe various libraries and capabilities in Python such as NumPY and the ease of calling Fortran and C and how those impact the performance of stencil computations that occur when solving partial differential equation solvers. Many others have compared various parallel programming languages in terms of their performance and programmability with various benchmarks and applications [@Mattson03; @Sterling04; @Cantonnet04; @Chamberlain07; @Shet08; @Karlin13]. This study focuses on characterizing the workload and performance alternatives for implementing a specific analysis needed for the Large Synoptic Survey Telescope (LSST) project.
Shen et al. [@Shen12] describe a parallel algorithm implemented in MPI for the analysis of objects that are close to the earth. The algorithms in question are different than those we study in this paper.
Conclusion
==========
In this paper, we discuss problems that arise for the analysis of orbital particle data. We provide analysis of the deeply nested structure, and the sparseness of the search space, which lead to significant load imbalance in naive attempts at parallelization. We describe a solution to these issues, presenting an algorithm for flattening the nested structure to allow better parallelization.
We then discuss the issues that arise during parallelization in Perl, Python, OpenMP, PThreads, and Chapel. We include code snippets which show the implementation details for our algorithm, and the language specific differences that arise because of this.
In the end, we show significant speed-up in all languages, excepting Perl. Special attention was given to improvements in Python, a language which has seen widespread adoption in scientific computing. We achieved 9.1x speed-up in Python, a language whose serial version performed comparably to the baseline. In the best case we show the Pthreads version achieved a 103x speed-up over the original performance. These improvements allow for analysis of finer-grained data that had previously been considered infeasible due to the execution time bottleneck.
|
Russian River’s Vinnie announced that Batch 4 Beatification will be released on Monday, December 19th at the brewpub. Batch 4 was a tiny batch and all of it was bottled so there will be no draft offering this time around. There will be a 2 bottle limit per person at $15 each for the 375 ml bottles. Batch 5 will be a much larger batch and will be bottled next month for release in the spring.
Also, Russian River is installing a new Coolship once the Batch 5 Beatification barrels are emptied.
Beatification is a 100% spontaneously fermented beer using the oldest barrels that no longer have any wine flavor or oak flavor left in them. However, a cocktail of “bugs and critters” (Saccharomyces, Brettanomyces, Lactobacillus, Pediococcus & other wild yeast & bacteria.) remains in the barrel. This isn’t the only place where the beer picks up its ability to ferment, before the unfermented beer heads into the oak barrels, the beer has already sat “horny” and picked up many other wild yeasts to start its life towards a true, spontaneously fermented beer.
[Russian River]
|
A new cell-based reporter system for sensitive screening of nuclear export inhibitors.
Nucleocytoplasmic transport of proteins across the nuclear pore complex (NPC), mediated by the nuclear localization signal (NLS) and the nuclear export signal (NES), is a vital homeostatic process in eukaryotic cells and also in mitogen-activated protein kinase (MEK) signaling molecule in tumor cell proliferation. Some viruses, including the influenza virus and HIV-1, also employ this nuclear export mechanism during their life cycle. Hence, drugs that control nucleocytoplasmic transport of proteins are putative candidate antivirals or anti-cancer agents. Thus, we previously developed a GFP/NES-MDCK reporter cell system for screening novel nuclear export inhibitors. NES signal-conjugated GFP accumulates in the nucleus in the presence of the nuclear export inhibitor leptomycin B (LMB). In this study, a stable GFP/NLS/NES fusion protein-expressing cell line was established, and its potential as a reporter was evaluated. The GFP/NLS/NES-MDCK cell line demonstrates improved nuclear accumulation of GFP in a time-course treatment with LMB. In addition, the dose-response data demonstrated superior sensitivity of GFP/NLS/NES-MDCK over GFP/NES-MDCK cells. As low as 0.01 ng/mL LMB is sufficient to cause accumulation of the GFP fusion protein in the nucleus in GFP/NLS/NES-MDCK cells, while at least 1 ng/mL of LMB is needed for the accumulation of GFP fusion protein in the nucleus of GFP/NES-MDCK cells. These results indicate that the newly established GFP/NLS/NES-MDCK cell line is a potentially powerful tool to screen for novel nuclear export inhibitors.
|
Q:
Is there any theory show that this claim :" for large $n$,$ 3/4$ of the positive integers less than $n$ are not divisible by $4$" is true?
I read here in wikipedia for understanding distributions of square free , i find the following mathematical expression for large $n$ :" $ 3/4$ of the positive integers less than n are not divisible by $4$, $8/9$ of these numbers are not divisible by $9$ ?
My question here is :
Really i'm confused how the titled approximation is true and what are the mathematical theories in number theory or in probability affirmed it's truthness ?
Thank you for any help
A:
A statement of the form "for large $n$, fraction $p$ of the positive integers less than $n$ are in set $S$"
is to be interpreted as meaning
$$ \lim_{n \to \infty} \dfrac{| \{1,2,\ldots,n-1\} \cap S |}{n-1} = p $$
In this case with $S$ the set of integers not divisible by $4$,
it's easy to prove (e.g. by induction) that $$|\{1,2,\ldots,n-1\} \cap S| = n - 1 - \lfloor (n-1)/4 \rfloor$$ so that
$$ \frac{3}{4} = \frac{n-1 - (n-1)/4}{n-1} \le \frac{n-1 - \lfloor (n-1)/4 \rfloor}{n-1} \le \frac{n-1 - (n-1)/4 + 1}{n-1} = \frac{3}{4} + \frac{1}{n-1} $$
Then the Squeeze Theorem shows the limit is $3/4$.
|
Q:
Command repstopdf executes successfully, but does not generate a pdf file
As the title states, I'm having trouble with the conversion of my eps files to pdf.
Minimal example:
\documentclass[letterpaper, 10pt, twoside]{article}
\usepackage{graphicx}
\usepackage{epstopdf}
\begin{document}
\includegraphics{images/USArmy.eps}
\end{document}
results in:
! Package pdftex.def Error: File `images/USArmy-eps-converted-to.pdf' not foun
.
See the pdftex.def package documentation for explanation.
Type H <return> for immediate help.
...
l.7 \includegraphics{images/USArmy.eps}
Here's the odd part: the log says that it generated everything successfully:
Package epstopdf Info: Source file: <images/USArmy.eps>
(epstopdf) date: 2016-06-01 16:08:39
(epstopdf) size: 6728 bytes
(epstopdf) Output file: <images/USArmy-eps-converted-to.pdf>
(epstopdf) Command: <repstopdf --outfile=images/USArmy-eps-converte
d-to.pdf images/USArmy.eps>
(epstopdf) \includegraphics on input line 7.
runsystem(repstopdf --outfile=images/USArmy-eps-converted-to.pdf images/USArmy.
eps)...executed safely (allowed).
Package epstopdf Info: Result file: <images/USArmy-eps-converted-to.pdf>.
! Package pdftex.def Error: File `images/USArmy-eps-converted-to.pdf' not found
.
Sure enough, I do not have the .pdf file in the images directory. Even more confusing, if I run repstopdf manually, the pdf file works fine:
repstopdf --outfile=images/USArmy-eps-converted-to.pdf images/USArmy.eps
Any suggestions? I have tried adding [outdir=./] and [outdir=./images/] to the epstopdf package as package options as well with the same results. I'm using the latest texlive portable, installed yesterday.
Edit:
Reproduction steps:
Install minimal texlive portable to c:\tex with epstopdf and graphics support
Copy example with any eps file to c:\work and open a command prompt
cd /d "c:\work"
set PATH="C:\tex\bin\win32"
pdflatex sample.tex
Note that the full texlive and miktex installs both work fine without having to set the path. Which makes it even more odd.
A:
The big problem here is your point four! And that is a Windows problem not a LaTeX problem!
After a correct installation of MiKTeX you should find something like C:\Program Files\MiKTeX 2.9\miktex\bin\x64\; after typing path into your command line. MS-DOS command path shows you the value of Windows environment variable path. Same for TeX Live but I do not know the path it needs (I'm using MiKTeX). For your problem is is not important which tex distribution you use ...
If you want to change the setting of the variable, you have to use set path= and add your needed path so that Windows is able to start the needed programs because it can find the path to the binaries ...
But your command set PATH=C:\tex\bin\win32 resets the complete old settings to the new one. In other words: all old path settings are deleted!
To avoid this you have to use a special environment variable %PATH%, which contains the old setting. Note that several paths are divided by ;. So the command set PATH="C:\tex\bin\win32;%PATH% adds the new path to be found first! Think about the order you need: Should it be found first (okay this way) or last (then use set PATH="%PATH%;C:\tex\bin\win32;).
This way your MiKTeX system is able to find all needed files (because it can follow the given paths) and Windows is able to start needed programms (because it too can follow the given paths).
|
' TEST_MODE : COMPILE_ONLY_FAIL
type UDT
i as integer
declare operator []( index as integer )
end type
operator UDT.[]( index as integer )
end operator
|
1. Technical Field
The present invention relates in general to the field of computers, and in particular to high speed interconnections in a computer. Still more particularly, the present invention relates to a method and system for cable/connector carrier that directly connects a high speed external cables to an internal connector on a midplane in a computer chassis.
2. Description of the Related Art
Modern computer systems are able to manipulate data at very high speeds. However, if data is unable to get into and out of the computer, this computing speed is of little value. Therefore, high speed interfaces (using high frequency for increased bandwidth) are common on most modern computers. Such interfaces handle data either in serial or parallel fashion. There are many such interface protocols known to those skilled in the art of computers, and such interfaces will not be itemized here.
Many modern computer systems, and particularly servers, utilize a blade configuration, such as depicted in FIG. 1 as a server blade computer 100. Server blade computer 100 offers high-density server boards (blades 102) in a single server blade chassis (blade center chassis 104). Server blade chassis 104 includes multiple hot-swappable server blades 102a–n connected on a midplane 106. Midplane 106 is a backplane, mounted in the middle of server blade chassis 104, that contains circuitry and sockets into which additional electronic devices or cards, including server blades 102, can be plugged.
There are typically fourteen server blades 102 in server blade chassis 104. The operations of server blades 102 are coordinated by logic identified as management module 108, which includes a processor (not shown) for controlling input/output (I/O) functions, controlling a power supply 116, interfacing with networks (such as the Internet or a Local Area Network), and allocating jobs and data to the different server blades 102.
Each server blade 102 includes a Baseboard Management Controller (BMC) 110, which provides an interface between the server blade 102 and the midplane 106. Coupled to the BMC 110 is a Central Processing Unit (CPU) 112, which is preferably multiple processors in a same partition. Coupled to CPU 112 is a system memory 114, which typically includes a primary and a backup system memory, which may be a DIMM, SIMM, or any similar volatile memory. For purposes of clarity, only components for server blade 102a are shown, each labeled with an “a” suffix. It is understood that each of the server blades 102 have similar components as those shown for server blade 102a.
As described above, management module 108 can control input/output operations, including those between the midplane 106 and an input/output (I/O) card 118. The I/O card 118 provides both a logical and a physical interface between midplane 106 and a back 120 of server blade chassis 104. That is, I/O card 118 connects to midplane 106 via a midplane connector 122a, and I/O card has a male coupler 124 for connecting to an external female coupler 126 on back 120. As external female coupler 126 terminates an external cable 128, then data is allowed to be input/output via the external cable 128.
However, I/O card 118 often is often strictly limiting as to the signal length (due to bandwidth) that it can route to external female coupler 126a via male coupler 124a. Therefore, an internal cable 130 must often be used to connect midplane 106 to an external female coupler 126b and an external cable 128b via a male coupler 124b as depicted. Serious disadvantages of internal cable 128 are that it is expensive, it adds an extra interconnect for a signal from midplane 106 that can adversely affect signal quality, and it is physically difficult to access midplane 106 to plug a midplane connector 122b into midplane 106.
What is needed, therefore, is a system for connecting an external cable directly into a midplane, preferably mating with an existing midplane female connector.
|
You need to have the Flash Player installed and a browser with JavaScript support.
|
254 400 304 444 1
451 263 504 291 2
280 283 311 316 4
218 275 252 304 3
324 239 359 295 5
28 304 63 344 6
|
Q:
Vaadin for web application development - Few doubts
We are trying to choose a framework for our client development for a web application. These are the key points about our application.
1) Rich text application where user performs many activities in the client.
2) We are looking to develop using Java technology
3) The services will be offered in cloud.
4) Mobile support is required.
5) Scalability is also one main concern.
I went through lot of doc and information along with this video http://twit.tv/show/floss-weekly/187 online and have now left with Vaadin and plain GWT. I have a small bit of experience in development with GWT, but not in Vaadin(I have written couple of sample programs only in Vaadin). Please help me in understanding few things.
1) If I have to write a new widget in Vaadin how easy or difficult it is to accomplish?
2) Is there any obvious issues with Vaadin widgets or concepts which might be a blocker for any application?
3) If tomorrow we decide to just switch back to GWT, is that feasible given that Vaadin works with all server code logic?
4) Does the Vaadin method of going to server everytime a concern for applications that are deployed on cloud?
5) Last but most important, how is forum support and future dev?
Thanks a lot. Please note that I have gone through many articles and links about these discussions but feel its good to know from a guy who has real experience in these stuffs atleast for sometime. Thanks again.
A:
GWT
now left with Vaadin and plain GWT.
Vaadin 7 and Vaadin 8, now known as Vaadin Framework, are both Java-based wrappers around Google Web Toolkit (GWT).
You write pure Java code for your business logic and UI-creation. This Java code runs in a JVM on the server-side in a Java Servlet web container. The magic happens when Vaadin uses GWT to auto-generate the necessary HTML, CSS, JavaScript, DOM, AJAX, XML & JSON, WebSocket, and Push code needed to render your web-app’s user-interface within the user’s client-side web browser.
So, pure Java on the server-side, pure web-standards tech on the client-side (no Java on client).
Web Components
Vaadin 10, now known as Vaadin Flow, replaces the internal use of GWT with the emerging Web Components standard technology. This new generation is a major re-write of Vaadin, though its purpose and many of its concepts such as data-binding remain the same.
By leveraging Web Components technology, it should be easier to build Vaadin widgets. And it should be relatively easy to make existing JavaScript-based components not designed explicitly for Vaadin available to your server-side Java code. That's the whole point of Web Components: making web-based widgets that work across various web framework tools.
While the Vaadin Ltd in quite excited and proud to ship Vaadin 10 Flow, they remain committed to Vaadin 8 Framework as well. Vaadin 8 is under active development, with a road map plan for continued support at least through the year 2022.
If you really want to work with GWT, you can do so in Vaadin 8 Framework.
If you want to bet on Web Components instead of GWT, go with Vaadin 10 Flow.
Rich apps
Rich text application where user performs many activities in the client.
If you meant "rich text" as in fonts, colors, and such, you should study the RichTextArea widget bundled with Vaadin 8 as well as check the Vaadin Directory for additional add-ons. That widget is not being brought over to Vaadin 10 Flow, but as mentioned above, the use of Web Components may make other existing such tools available to a Java-based Vaadin app. I see one already in beta.
If you meant "rich" in terms of professional-looking, business-oriented, desktop-style web apps with enterprise-level reliability, that is the very purpose of Vaadin.
Java
We are looking to develop using Java technology
That is the raison d’être of Vaadin: Writing pure Java to leverage the vast ecosystem of Java tooling and libraries, with all its benefits of security, performance, and reliability — while at the same time using web-standards technology to auto-render your app in a web browser.
Mobile
Mobile support is required.
The Vaadin collection of widgets have evolved to support touch-surface gestures.
The Vaadin Ltd company previously offered a special package for mobile support, called Vaadin Touch. The built-in support for touch gestures in regular Vaadin widgets rendered that package obsolete and unnecessary.
Cloud & scaling
The services will be offered in cloud.
Scalability is also one main concern.
Your Java-based Vaadin app does live in a JVM on the server-side. Each current user is represented by session object. All the user-interface widgets appearing in the browser have a counterpart in a Java object on the server. You may be keeping further data and functionality in additional Java objects on the server. You may be calling JDBC or Web Services etc. from that server-side as well.
So all of that takes up memory and CPU cycles on the server. You do need to be cognizant of your programming doing caching and placing other burdens on the server. Any resources shared between users must be thread-safe, as a Java Servlet environment is multi-threaded by design.
Robust server hardware (memory, cores) may be needed, depending on the particulars of your app. Or you may want multiple servers with sticky-session load-balancing if you truly have a very large app with very many users.
The Vaadin Ltd company has simulated the use of a Vaadin app supporting thousands of simultaneous user sessions. You can contact them for consultations on your particular situation.
While scalability is an issue to consider, do not jump to conclusions. Think it through, and do some experimentation.
Creating custom widget
If I have to write a new widget in Vaadin how easy or difficult it is to accomplish?
In Vaadin 8, you can indeed create your own widgets. But doing so required learning the use of GWT. Doable, certainly as you can see from the hundreds of published add-ons in the Vaadin Directory. But still some serious work. The Vaadin Ltd. offered training on this.
In Vaadin 10 Flow, the use of Web Components should make the creation of your own widgets much easier. Check out this starter project provided free-of-cost to get you going. See the tutorial, Creating A Simple Component Using the Element API. Key concepts in creating widgets in Vaadin 10 Flow:
Every Vaadin 10 component always maps to one root element in the server-side DOM representation.
The Element API makes it possible to modify the DOM easily from the server side.
Any other issues?
Is there any obvious issues with Vaadin widgets or concepts which might be a blocker for any application?
Not sure what you mean here. I suggest reading through the excellent Vaadin tutorial and manual. It leads you through using all kinds of features in Vaadin.
Having used other rapid application development environments for desktop apps, Vaadin always made sense to me, fit my way of thinking and doing things.
Bleeding edge
For Vaadin Flow, know that Web Components is still new, and somewhat bleeding-edge. Web Components is actually a collection of technologies. Not all of these are supported fully by all browser makers. So some polyfills are still necessary.
Vaadin Flow also makes use of the pair of modern page-layout features that have finally arrived in CSS: Flexbox and Grid Layout.
Only the latest versions of the browsers are coming close to having good support for all these features. See CanIUse.com for particular details.
Part of Vaadin’s purpose is to paper over the gaps between various versions of various browsers, to insulate us developers using Vaadin. So you may not encounter problems in some browsers, but then again you might.
Also, Vaadin Flow does not quite have all of Vaadin 8 features. Some are under development, and some are planned.
Upshot: If you are eager to ship soon and cannot insist on users updating to the latest browsers, use Vaadin 8 rather than Flow.
Leaving Vaadin for GWT
If tomorrow we decide to just switch back to GWT, is that feasible given that Vaadin works with all server code logic?
If you want to use GWT, and you want to write that server-side logic in Java, then Vaadin 8 Framework is the perfect tool for you. I do not see how you would ever want to leave Vaadin.
But if you did leave Vaadin, you would no longer have the glue that connects your GWT in the browser with your Java code on the server. That glue is what Vaadin provides for you. Of course, you can write your Java back-end business logic to be unaware of Vaadin directly. Indeed, Vaadin Ltd provides a Maven-based multi-module archetype for this very purpose. The backend module holds your business logic and database-access (etc.) code, kept separate from the ui module containing your Vaadin-oriented code.
Network traffic
Does the Vaadin method of going to server everytime a concern for applications that are deployed on cloud?
You will need to do some experimenting and profiling to see the memory and cores needed for your particular app. Vaadin can be demanding on server resources as discussed above.
But technically, no tricks or technical limits with cloud deployment. Just plain Java code running, in a JVM. Anything that can run a Java Servlet web container such as Tomcat, Jetty, Glassfish/Payara, WildFly/JBoss, and such can run your Vaadin app.
If you are concerned by the network traffic, yes, there is traffic. When a user uses a widget such as clicking a button or entering data in a field, your server-side Java app is informed so that your app can respond with business logic. So that means frequent network traversal.
You do have options to not immediately inform the server-side when not needed. In doing so, you are controlling some of that traffic. For example, you can choose whether you want the server-side to be informed (and react) for every single keystroke while entering text in a field, or occasionally such as a pause between keystrokes, or only after the user has completed entry in that field. See the [Configuring the Granularity of Value Change Events](https://vaadin.com/docs/v8/framework/components/components-textfield.html section in the manual.
I did fear a problem with Internet performance when I started with Vaadin. But I can say that in my own experience, I was pleasantly surprised, astounded really, to find this was a non-issue for me. For example, in the United States, with a mere Mac mini in a colo in Wisconsin on very fast Internet connection running a Vaadin 7 or 8 app reacts virtually instantaneously on clients accessing household DSL and Cable-TV connections in Seattle, Florida, and Canada. When accessed from Hong Kong, only the slightest delays, generally imperceptible in a data-entry app.
Your mileage may vary, of course. My example above was a dedicated computer. In contrast, cloud providers are notorious for fluctuations in both CPU availability and network delays or latency.
Support
Last but most important, how is forum support and future dev?
Vaadin Ltd appears to be a very healthy open-source company. They sell add-on products, support, consulting, and training. The company has been growing, hiring more staff, and establishing overseas offices (US, Germany) while their home base remains in Finland (Turku, Helsinki).
The various Vaadin products are under very heavy development with many incremental releases, pre-releases, and soon to arrive Long-Term-Support versions. The regularly publish a road map to their development plans. They also provide regular updates on their business and technical issues in their blog.
The Vaadin Ltd company hosts a very active forums site. Both their staff and other users actively use Stack Overflow as well.
|
The present invention relates to a transfer substrate and a transfer method for sublimating, with irradiation of a heat source, a transfer material layer formed on a support substrate and transferring the transfer material layer to a receptor substrate side and a method of manufacturing a display device to which this transfer method is applied.
An organic electroluminescence element that utilizes electroluminescence of an organic material includes an organic layer, in which a hole transport layer and a light emitting layer are stacked, between a lower electrode and an upper electrode. The organic electroluminescence element attracts attention as a light emitting element that is capable of performing high-intensity light emission by low-voltage direct-current driving.
In a full-color display device in which such an organic electroluminescence element (hereinafter simply referred to as light emitting element) is used, light emitting elements that emit lights of R (red), G (green), and B (blue) are formed to be arrayed on a substrate. In manufacturing such a display device, it is one of important elements to selectively form each luminous organic material layer on an electrode as a fine pattern.
As a method of forming a pattern of such an organic material layer, a transfer method in which an energy source (a heat source) is used, that is, a thermal transfer method has been proposed. In one example of a method of manufacturing a display device in which the thermal transfer method is used, first, a lower electrode is formed on a substrate of a display device (hereinafter referred to as device substrate). On the other hand, a light emitting layer is formed on another substrate (hereinafter transfer substrate) via a light absorbing layer. In a state in which the light emitting layer and the lower electrode are opposed to each other, the device substrate and the transfer substrate are arranged and a laser beam is irradiated from the transfer substrate side to thermally transfer the light emitting layer onto the lower electrode of the device substrate. In this case, the lower electrode is scanned by the laser beam spot-irradiated. Consequently, the light emitting layer is thermally transferred to only a predetermined area on the lower electrode with high positional accuracy to be formed as a pattern (see JP-A-09-167684 and JP-A-2002-216957).
|
Woman reports being stabbed
STOCKTON - A woman in her 20s called police shortly before 4 p.m. Tuesday to report she had been stabbed, authorities said.
The stabbing occurred near Don Avenue and West Hammer Lane, police said. The victim went to a home on Kelley Drive before calling police, authorities said. The woman suffered a superficial stab wound to the arm, police said.
|
BRASILIA (Reuters) - Far-right front-runner Jair Bolsonaro appealed to Brazilians on Friday to turn out to vote for him on Sunday and give him an outright victory to avoid a run-off that some polls say he could lose to a leftist challenger.
Brazil’s most polarized election since the end of military rule in 1985 pits Bolsonaro, a former Army captain running on a law-and-order platform, against leftist Fernando Haddad of the Workers Party, whose leader is in jail for corruption.
Bolsonaro said he was 6 million votes short of winning the election on Sunday by a majority. If a run-off was necessary, it would be held on Oct. 28 between the two leading candidates.
“Let’s avoid a second round,” he appealed to supporters in a live Facebook feed, asking them to convince relatives and friends to vote for him.
An Ibope opinion poll on Wednesday had Bolsonaro nine points ahead of Haddad, but showed that he could lose a run-off. Final polls on Saturday will determine if a second vote will be needed.
Bolsonaro said an outright win on Sunday would give him a strong mandate to take office without having to enter the traditional horse-trading with political parties needed by Brazilian presidents to form coalition government.
About 26 percent of voters say they have yet to decide who they will vote for, according to the most recent poll released on Thursday by Datafolha, which showed that outright victory by Bolsonaro was still possible but not likely.
Slideshow ( 4 images )
Bolsonaro, who is recovering from a near-fatal knife attack while he was campaigning, skipped the last presidential debate of the campaign on Thursday night on Brazil’s largest broadcaster TV Globo.
He said he was under doctors’ orders to stay away from the debate, but he gave an interview that aired on a rival network on Thursday night.
His decision was emblematic of his unconventional presidential bid that has eschewed traditional campaigning in favor of grassroots organizing through social media and selective interviews.
Bolsonaro has tapped into disillusionment with a weak economy, political graft and rising violence.
A Thursday survey from pollster Datafolha found Bolsonaro had 35 percent support, a jump of 3 percentage points since Tuesday. Haddad stood at 22 percent.
In the TV interview, Bolsonaro slammed Haddad for being a “puppet” of jailed former president Luiz Inacio Lula da Silva.
Slideshow ( 4 images )
Haddad, a former mayor of Sao Paulo, was confirmed at the top of the Workers Party ticket three weeks ago, replacing Lula, who was barred from running due to a corruption conviction. He has called Lula a key adviser, but has denied any plans to pardon the former president or give him a role in government.
ADMIRES DICTATORSHIP
Bolsonaro has faced federal charges of hate speech after racist, homophobic and misogynist rants, but in a live speech on Facebook earlier on Thursday he rejected the accusations.
In recent weeks, as Bolsonaro’s poll numbers have risen, his rivals have found it hard to draw attention from the convalescing former army captain. His vows to loosen gun laws and declare war on drug gangs have thrilled his supporters and terrified his critics.
An admirer of Brazil’s 1964-1985 military dictatorship, Bolsonaro has won massive support from the fast-growing evangelical community by vowing to block the legalization of abortion, gay marriage and drugs.
Brazilian markets have rallied on the prospect of Bolsonaro stopping a return to power by the Workers Party. Investors blame the party for plunging Brazil into its worst recession in 2015-2016.
Brazil’s real currency was up more than 0.5 percent against the dollar on Friday, while the Bovespa stock index rose 0.3 percent.
Bolsonaro’s economic positions remained unclear. Last week he asked his economic adviser, Paulo Guedes, and his running mate, retired General Hamilton Mourão, to hold off on making public statements after contradictions emerged over economic policy.
In an interview published on Friday by newspaper Estado de Sao Paulo, one of the candidate’s top economic advisers said Bolsonaro would push ahead with privatizing state power firm Centrais Eletricas Brasileiras SA, or Eletrobras.
However, he pledged to keep state oil company Petroleo Brasileiro SA, known as Petrobras, and lender Banco do Brasil SA in government hands.
“Everything that is strategic will be maintained, such as oil and gas fields,” former army General Oswaldo de Jesus Ferreira told the newspaper. Ferreira is one of many military men with key roles on Bolsonaro’s team.
The comments by Ferreira, who said he was in the same military graduating class as his “brother” Mourão, tempered promises of Wall Street-favorite Guedes, who told Reuters in May that Brazil should privatize everything from Petrobras to state banks in order to cut debt and fund local governments.
|
1. Field of the Invention
The present invention relates to an image forming apparatus comprising a proximity charger to be impressed with a superimposed voltage of a DC voltage and an AC voltage.
2. Description of Related Art
Recently, for charging in an image forming apparatus, a proximity charging method is mainly adopted. In the proximity charging method, for example, a roller-type charger is provided in proximity to the surface of a photoreceptor drum so as to be in contact or out of contact with the surface of the photoreceptor drum. A superimposed voltage of a DC voltage and an AC voltage is applied to the charger so that the charger can charge the surface of the photoreceptor drum uniformly.
It is known that the charged potential Vs of the surface of the photoreceptor drum and the peak-to-peak voltage Vpp of the AC voltage Vac have a relationship as illustrated in FIG. 8. While the peak-to-peak voltage Vpp is within a range from a charging start voltage Vth to a voltage 2×Vth, the charged potential Vs is substantially proportional to the AC voltage Vac. Here, the charging start voltage value Vth is a voltage value that permits the charger to start charging the photoreceptor drum, and the voltage value Vth is defined by the DC voltage Vdc. The charging start voltage Vth is determined depending on the characteristics of the photoreceptor drum and other factors. In the case of FIG. 8, the voltage value Vth is 800V, and the voltage value 2×Vth is 1600V.
After the peak-to-peak voltage Vpp becomes above the value 2×Vth, the charged potential Vs of the surface of the photoreceptor drum is saturated and substantially kept constant at Vs0. Therefore, in order to charge the surface of the photoreceptor drum to have a uniform charged potential Vs, it is necessary to apply a superimposed voltage obtained by superimposing an AC voltage Vac having a peak-to-peak voltage Vpp greater than 2×Vth on a DC voltage Vdc to the charger. In this regard, the charged potential Vs0 depends on the DC voltage Vdc of the superimposed voltage.
Meanwhile, in an image forming apparatus, the amount of discharge from a charger is required to be constant regardless of changes in environmental conditions, variations in the resistance of the charger due to manufacturing errors, etc. so as to charge a photoreceptor drum uniformly without causing deterioration of the photoreceptor drum, poor-quality image formation, etc. For this purpose, conventionally, an image forming apparatus comprises a measuring device that measures the alternating current flowing in the charger via the photoreceptor drum, and a controller.
The measuring device measures values of the alternating current while no sheets are fed in the image forming apparatus. Specifically, the measuring device measures values of the alternating current flowing in the charger when alternating voltages Vac having different peak-to-peak values Vpp respectively, all of which are less than 2×Vth, are applied to the charger sequentially. In a similar way, the measuring device measures the values of alternating current flowing in the charger when alternating voltages Vac having different peak-to-peak voltages Vpp respectively, all of which are equal to or greater than 2×Vth, are applied to the charger. In this specification, a range in which the peak-to-peak voltage Vpp is less than 2×Vth is referred to as a forward discharge range, in which charge transfers only from the charger to the photoreceptor drum (that is, mono-directional charge transfer occurs), and a range in which the peak-to-peak voltage Vpp is equal to or greater than 2×Vth is referred to as a reverse discharge range, in which charge transfers from the charger to the photoreceptor drum and from the photoreceptor drum to the charger alternately (that is, bi-directional charge transfer between the charger and the photoreceptor drum occurs).
From the values of the alternating current collected by the measuring device, the controller determines a peak-to-peak voltage Vppi of the alternating voltage Vaci to be used as a component of the charging voltage in a printing process. In this specification, such a control process is referred to as a first charging voltage determination process.
A specific example of the first charging voltage determination process will hereinafter be described with reference to FIG. 9. The controller obtains values Iac1-Iac3 of the alternating current flowing in the charger when AC voltages Vac1-Vac3 are applied to the charger in the forward discharge range, and from the alternating current values Iac1-Iac3, the controller derives a characteristic line L1 indicating alternating current values with respect to the applied AC voltage in the forward discharge range by direct approximation. In a similar way, the controller derives a characteristic line L2 indicating alternating current values with respect to the applied AC voltage in the reverse discharge range. The controller determines the point of intersection between the characteristic lines L1 and L2 as the alternating voltage Vaci to be used as a component of a superimposed charging voltage in a printing process.
When the alternating current value Iac is determined by the first charging voltage determination process, non-uniformity of the film thickness of the photoreceptor drum is taken into consideration in some cases. More specifically, while the photoreceptor drum is rotated once, the controller obtains the alternating current values Iac at a predetermined number of places different from each other in the circumferential direction. The controller determines the average of the measured alternating current values Iac as the alternating current value Iac achieved by application of the alternating voltage Vac to the charger.
There are other ways of deriving a peak-to-peak voltage Vpp (see, for example, Japanese Patent Laid-Open Publication No. 2009-086108).
Meanwhile, a roller-type charger is likely to cause more abrasion of the photoreceptor film, as compared to a corona-discharge-type charger. In a recent image forming apparatus, also, in order to remove discharge products and the like adhering to the photoreceptor film, the photoreceptor film is scraped as needed. In a case in which a roller-type charger is used in such an image forming apparatus, it is important to use a photoreceptor having a thick photoreceptor film and to minimize the amount of abrasion per a predetermined number of rotations of the photoreceptor.
In the first charging voltage determination process, an AC voltage Vaci that is the point of intersection between the characteristic lines L1 and L2 is derived from the difference in slope between the characteristic lines L1 and L2. However, the inventors found out by an experiment that there are cases in which the AC voltage Vaci determined by the first charging voltage determination process is not proper, depending on the photoreceptor film thickness and/or the ambient temperature. For example, when the ambient temperature is low or when the photoreceptor film is thick, the difference in slope between the characteristic lines L1 and L2 is small, and the AC voltage Vaci derived from the slope difference is likely to shift to a lower side. If a charging voltage including an AC voltage Vaci lower than a proper value is used in a printing process or the like, toner fogging may occur.
|
Arizona and Iowa State also offered the 5-11, 201-pound RB
Kissimmee Osceola RB Stafon McCray was happy to learn Friday (April 27) that he has a scholarship offer from UCF.
Kissimmee Osceola RB Stafon McCray was happy to learn Friday (April 27) that he has a scholarship offer from UCF. (CHRIS HAYS/ORLANDO SENTINEL)
By Chris Hays | Orlando Sentinel
Stafon McCray had narrowed his list of schools to a top five on Monday, but he quickly had to change that list as soon as he received a scholarship offer from Boise State.
“Yep, they’ll have to be No. 1 now,” said the Kissimmee Osceola running back, who had said earlier in the day that his top schools were, in no particular order, FIU, Cincinnati, Marshall and two other offers he received Monday from Iowa State and Arizona.
McCray, a 5-foot-11, 201-pound back who eclipsed 1,400 yards and had 15 touchdowns during his junior campaign, now has 11 offers, the rest of which are from UCF, Ohio, Boston College, Memphis and N.C. State.
McCray said he was “99-percent sure” West Virginia and Boise State were going to offer him, and assistant coach Ty Ensor later confirmed the Boise tender.
He said West Virginia would shoot to the top of the list if the Mountaineers eventually do put up an offer, and Boise would move to No. 2.
“But it would be a neck-and-neck race with those two teams right there,” McCray said.
He also said he would like to make his decision about “three or four games into the season.”
|
In ‘What Is Morality? The Ethics of Hazlitt’ (1 June 2012), David Gordon says (34m15s to 37m15s): “Suppose, you see an opportunity to steal. Let’s say, you’re in a store and you see the cash register is open and the store owner has just gone to the back, and you can just take the money out.. You have good reasons to think he won’t be able to catch you. So you might say: ‘Well, isn't this in your immediate interest that you’d be able to get all this money? ..and nobody’s going to catch you.’ But for Hazlitt, it isn't into your long run interest, because in order for the market.. social cooperation to function, people really have to follow these rules on a fixed basis. They have to have these rules internalized, taught to us, so that we don’t violate them, whenever we think we could get away with it. If we did that then social cooperation would break down. So it’s in everybody’s interest that we always follow these fixed rules, even though you might think that maybe there are some cases we can get away with it. It isn't in our interest to just calculate in each case whether you can get away with breaking the rules. What’s in our long-run interest is that we always follow the rules. Now you might say: ‘Well, aren't there occasions.. exceptions like famous cases that Kant discusses?’ There’s a murderer knocking on the door and he asks if a certain person he’s trying to murder is in the house, so do you have to answer yes if the person is there; do you have to tell the truth to a murderer? Most people say ‘No, you don’t’. It is an exception to the rule that you’re not supposed to lie. … So you might say: ‘Well, aren't there some kind of exceptions to these rules?’ But Hazlitt says: maybe there are, but these too can be specified as rules.”
I understand Gordon’s take to mean the following:
Overall, the existence of social cooperation serves our individual interests; it is a means to our ends. However, if analyzed in individual scenarios, we would (with regularity) come up with a different answer, as to whether we anticipate social cooperation to serve our ends. And so, the rational anticipation of means versus ends at the individual level leads to (some or total) disintegration of society, even if these individuals are convinced of Austrian economics. To resolve this, we must act to raise the valuation of social cooperation from a means to an end in itself, in ourselves and in others.
Hans Hoppe and Stefan Molyneux have argued the same point (see here and here): that Austrian egoism leads away from social cooperation.
I’d like to offer a more precise analysis:
If one is convinced of Austrian economics (and prefers health to sickness, abundance to poverty, etc, over the medium to long run), then it is always perceived to be preferential that other people interact through the division of labor and private property. One exception could be for a partner in crime. It is this question of crime for oneself that I now first wish to discuss.
In a market society, where most people are in favor of social cooperation for others, this culminates in an environment where each individual is highly incentivized to act peacefully.
Not only are individuals incentivized to refrain from crime, but they stand to gain from acting in those ways (and give off signals) that show social behavior.
Returning to the cash register hypothetical, we are looking at a person with a reputation, that was built up through many years. This person most likely also has a career and prospects for the future. If he does not have an income through production and trade, then he may be relying on friends and family or other institutions who are investing in him. And after this event he has many thousands of purchases (trades) he wishes to make in the future. If he were to take an amount of money, all of this would be put in jeopardy. How much money gained now, that one may or may not get away with stealing, is it worth risking ruining one’s entire future?
Another element in this scenario is that the more money is taken, the higher the risk of being found out. This is because a big amount missing may be spot upon the owner returning, and he can run outside to ask other people about who was in his store. This further lowers the potential gain by stealing.
Gordon stated in his hypothetical that the person knew he wouldn't be found out, but is that how reality works? How do you know there is no hidden camera? How do you know when the owner returns? How do you know nobody else will walk in? How do you know nobody will recognize you as you walk out? We do not know the future, and have to constantly speculate on it.
People in society are also aware of the possibility of being harmed, and they take action on it if they perceive it’s a real risk. This is one of the functions of the immediate social group of friends and family, which are held intact if those relationships are perceived to be beneficial. People don’t just lend money to strangers, and they don’t tend to leave cash registers open and unmonitored for long amounts of time.
Another aspect is psychic loss and gain: if I am able to thrive peacefully in society, do I really want to gain at the expense of another? And if I get away with it initially, I will have to worry about being found out for a long time. Instead, if I inform the store owner that his cash register was mistakenly left open, I may make a friend.
To conclude: I don’t think that society will break down from economically enlightened individuals thinking through the situations they are in, and how it affects their ends (in either a small society or a complex one). In fact, I think quite the opposite.
In regards to partners in crime: the previous analysis applies to an individual considering crime as well as a group considering crime.
|
Tag: walls
Jeremiah_15:18 “Why is my pain perpetual, and my wound incurable, which refuseth to be healed?” Jeremiah_30:12 “For thus saith the LORD, Thy bruise is incurable, and thy wound is grievous.” Nicodemus said to him, “How can a man be born when he is old? Can he enter a second time into his mother’s womb and be born? Of course not! “Can the Ethiopian change his skin or the leopard his spots? Then also you can do good who are accustomed to do evil.” Jeremiah 13:23. “Which of you by taking thought can add one cubit unto his stature?” Matthew_6:27 “The patient cannot permit himself to perceive the trauma until he is ready to take a stand toward it.” “…we are unable to give attention to something until we are in some way to experience an ‘I can’ toward it.” Merleau Ponty “Memory is like perception in this regard; the patient…
Joshua fit the battle of Jericho, and the walls came tumbling down. Walls build in a person’s soul and strong emotions make em stand. We have the wall of: self rejection, the wall of indifference, the wall of denial and the wall of emotional instability. the wall of social pressure, the wall of a poor self image the wall of self-pity and others etc. What do these walls do? Keep things in. Keep things out.. A human must realize that he or she is a god. No way! — O yes, small ‘g‘. And the Bible says so in Psalm 82:6 and John 10:34. A god creates his or her own world, and so do we. Walls establish the boundaries of the world they have created. Walls protect the self-designed value system, personal priorities and world-view etc. Foreign intrusions from within and without expand the system to include…
|
Non-invasive ventilation in COPD exacerbation: how and why.
|
Assignment
Book cover design for "Capitalism in the Web of Life: Ecology and the Accumulation of Capital" by Jason W. Moore.
Summary of the book:Finance. Climate. Food. Work. How are the crises of the twenty-first century connected? In Capitalism in the Web of Life, Jason W. Moore argues that the sources of today’s global turbulence have a common cause: capitalism as a way of organizing nature, including human nature. Drawing on environmentalist, feminist, and Marxist thought, Moore offers a groundbreaking new synthesis: capitalism as a “world-ecology” of wealth, power, and nature. Capitalism’s greatest strength—and the source of its problems—is its capacity to create Cheap Natures: labor, food, energy, and raw materials. That capacity is now in question. Rethinking capitalism through the pulsing and renewing dialectic of humanity-in-nature, Moore takes readers on a journey from the rise of capitalism to the modern mosaic of crisis. Capitalism in the Web of Life shows how the critique of capitalism-in-nature—rather than capitalism and nature—is key to understanding our predicament, and to pursuing the politics of liberation in the century ahead.
Approach
This piece is inspired by the concept of accumulation in the subtitle (Ecology and the Accumulation of Capital). We used a material that would let us play with lots of tiny things coming together – minuscule glass beads – to create a visual metaphor for both capital and the ecosystem. The image was made by building a physical setup involving swarms of these glass beads and printed typography, which we photographed. In the final cover, a photograph of thousands of small dots or bubbles accumulating around typography is an abstract metaphor for capitalism, nature, and the human population.
|
Have instinctive elegance with the Impromptu® Flat Panel TV Cart. The cart allows you to move your monitor smoothly and sleekly throughout your workspace on an impulse. With a stunning steel frame and translucent polycarbonate panel it can hold up a 42" monitor in style. Cart is mobile on four casters, (2 locking). Assembly required.
Material - Steel; Plastic
Finished Product Dimensions - 38"w x 20"d 65 1/2"h
Finished Product Weight - 38 lbs.
Assembly Required
Tools Required - Yes
Greenguard Certified
Limited Lifetime Warranty - See Packaging for Detail
Cable Management - Included
Capacity Shelf - 5 lbs. per shelf
Capacity Weight - 80 lbs. (flat panel 42" max)
Shelf Dimensions - 34 1/2" w x 19" d x 35 1/2"h
Disclaimers:
*Additional discounts can be applied to this item. See checkout for details. Clearance, doorbusters, hot buys, open box and temporary price cut items are not eligible for discounts.
Beautifully weathered yet built to last,
Emerald Home’s Chambers Creek Dining Collection delivers rustic elegance to your dining space. The table is available in dining and gathering heights, both capable of seating eight when extended with a butterfly leaf, making the collection ideal ...
Our Cabin Creek collection conveys a
reclaimed wood vintage feel. Each piece is physically distressed by hand providing a unique one of a kind look. The Cabin Creek Mobile File by Home Styles is constructed of poplar solids and mahogany veneers in a ...
Iron Chinchilla combines the talents of
Patrick Neuwirth and Michael Holloway. Their original artwork stirs the imagination and the soul with fluidity of motion, vibrant color, texture and form. Each piece is handmade and all the metal is bent cold by hand using ...
|
Mobility Management Services Growing in Northern Region
CSSMV Mobility Manager Michelle Caserta-Bixler has recently developed Transportation Guide booklets for Darke and Shelby Counties. The booklets, both of which are titled “Stay Connected,” include information about public transportation, providers, and other resources.
Both booklets begin with the definition of Mobility Management as an innovative approach to managing and delivering coordinated transportation services to customers, with a particular focus on transportation-challenged populations including seniors, individuals with disabilities, and low-income riders. Mobility Management seeks to educate and empower the customer and to identify service gaps to improve public transportation in the county. Instead of looking to a single transportation service or solution to a county’s needs, Mobility Management embraces a “family of services” philosophy and offers local and regional solutions to meet the community’s needs and visions.
Readers learn basics of public transportation such as how to plan a trip, what to pack for a trip, how to schedule a trip with a transportation provider, and how to board and exit a bus safely. The booklet also addresses travel trainers, individuals trained to assist riders who may have special needs like wheelchairs or walkers.
The Darke County booklet lists providers that include the Greenville Transit System, ride sharing options, and Darke County Veterans’ Services. Phone numbers, hours of service and rates are detailed. There is also contact information for various agencies including the Darke County Department of Job & Family Services, the Miami Valley Community Action Partnership, Darke County United Way, and Catholic Social Services. A map of walking and biking trails and tips on bike safety are also included.
The Shelby County booklet has similar listings including Shelby Public Transit and a connecting service to Miami County, ride sharing, and the Shelby County Veterans’ Service Commission. Agencies listed include the Shelby County Department of Job and Family Services, Shelby County United Way, and Catholic Social Services. The booklet also has a map of the park system in Sidney where there are walking and biking trails.
“We are trying to distribute these booklets throughout the two counties, especially to places where seniors and those who are most dependent on public
transportation tend to gather,” said Caserta-Bixler. “The more resources we can put in people’s hands, the better chance we have of starting to meet their needs.”
Despite the efforts of CSSMV and other stakeholders, public transportation options in rural areas remain extremely limited. Many needs are not met because current providers have limited hours of service, are too expensive, or don’t cross county lines. This is why Caserta-Bixler and her team are working on a new initiative that could help close some of these transportation gaps.
The new program will recruit and train volunteer drivers who will use their own vehicles to transport clients to work, medical appointments, shopping, and other locations. A pilot program is planned for Darke, Logan, Shelby, Auglaize, and Mercer Counties.
A perfect scenario would have two volunteer drivers in each county, each subject to background checks and drug and alcohol testing. They would be covered by their own insurance and receive special training to handle the elderly and disabled.
“We hope this volunteer driver program could begin to help those people who fall through the cracks,” said Caserta-Bixler. “We have enough data to show what the needs are, and the public transit we have is not enough. You can’t just jump on a bus or hail a taxi in a rural setting like you do in a bigger city. I think Shelby County has one Uber driver. The means to get from point A to point B that people have in Dayton or even Springfield or Lima just don’t exist in the northern Miami Valley.”
For more information, call (937) 498-4593.
Thanks to CSSMV’s Mobility Management program, both Shelby and Darke Counties now have printed guides to assist their residents in finding transportation information.
New CSSMV employee Tina McClanahan has been hired as a Transportation Community Liaison. McClanahan, a Darke County resident, will work with Mobility Manager Michelle Caserta-Bixler to implement Coordinated Transportation Plans in Darke, Shelby and Miami Counties. She will work with stakeholders in each county to identify changing and ongoing transportation needs.
|
#!/usr/bin/env bash
# This Source Code Form is subject to the terms of the Mozilla Public
# License, v. 2.0. If a copy of the MPL was not distributed with this
# file, You can obtain one at http://mozilla.org/MPL/2.0/. */
# This must be run from the root webrender directory!
# Users may set the CARGOFLAGS environment variable to pass
# additional flags to cargo if desired.
set -o errexit
set -o nounset
set -o pipefail
set -o xtrace
CARGOFLAGS=${CARGOFLAGS:-"--verbose"} # default to --verbose if not set
pushd webrender
cargo build ${CARGOFLAGS} --no-default-features
cargo build ${CARGOFLAGS} --no-default-features --features capture
cargo build ${CARGOFLAGS} --features capture,profiler
cargo build ${CARGOFLAGS} --features replay
popd
pushd wrench
cargo build ${CARGOFLAGS} --features env_logger
OPTIMIZED=0 python script/headless.py reftest
popd
pushd examples
cargo build ${CARGOFLAGS}
popd
cargo test ${CARGOFLAGS} \
--all --exclude compositor-windows --exclude compositor \
--exclude glsl-to-cxx --exclude swgl
|
Wednesday, March 12, 2008
A Death Star Pinwheel
Astronomers (or at least the press who cover space news) seem to like the phrase "death star." I think of several reasons for this: it reminds everyone of Star Wars, and plays a little on our inherent paranoia: everything in space is out to get us.
So, what is out to get us this time? The scientific research is about a pair of stars known as "Wolf Rayet 104." Wolf-Rayet stars started life dozens of times more massive than the sun; they are so bright that the outer layers of the star are spewed back into space. In just a few million years, the stars may have lost 75% of their matter this way, and they've burned through their entire supply of fuel. These stars are very close (within a few hundred thousand years) of a supernova explosion.
There are many reasons to think that Wolf Rayet stars may be one of the sources of mysterious "gamma ray bursts," very energetic jets of gamma rays that we can see in galaxies most of the way across the visible Universe. These jets of gamma rays are created as material falls into a black hole formed by the collapse of the star, which releases tremendous amounts of energy.
Wolf-Rayet 104 is a pair of these stars, and so are supernovae waiting to happen. The stars are about 8000 light years away in the constellation Sagittarius. They are invisible to the unaided eye, but are located just north of the spout of the teapot shape of Sagittarius. The movie above shows a real infrared picture of the star system. Astronomer Peter Tuthill of the University of Sydney and collaborators used the Keck Telescope in Hawaii to take pictures in infrared light. What you are seeing is dust thrown off in the strong winds from these stars; the orbits of the stars around each other cause the dust to twist into a spiral pattern.
Tuthill and collaborators have been working on this star system for years, and are using the stars to measure the amount of matter the stars are spewing into space and how the winds from each star are colliding, helping to produce the dust that they see. But they also noticed from the nearly-circular shape of the spiral that we are looking at the south pole of the star system. If, when this star explodes, it produces a gamma ray burst, the gamma rays are likely to come out of the stars' north and south poles. In other words, nearly straight at us.
If a nearby gamma ray burst were to happen, it is possible that the Earth would suffer. Gamma rays are really energetic, and while our atmosphere protects us from the gamma rays normally streaming through space, it might be overwhelmed from the large amounts of gamma rays a nearby gamma ray burst would produce. And that could be bad for the Earth and our ecosystem. Some of the dire forecasts some astronomers have made are mass extinctions, collapse of the food change, horrible mutations from the flux of radiation, and other very bad things.
I'm not too worried about this right now. First, the chances of these stars exploding anytime soon are small -- maybe 1 in 100,000 every year. Second, we don't know for certain if either of these stars will make a gamma ray burst and, if they do, whether it will be pointed exactly at us. When it comes to gamma rays, it has to be a direct hit to cause the damage -- a near miss doesn't count.
But even more, when you look at the fossil record, there are very few mass extinctions, and most of these have other explanations. The dinosaurs died when an asteroid hit the Earth. The Permian extinction, which killed 96% of species in the oceans and 70% of those on land, seems to be associated with massive outpourings of lava (although this is still quite disputed). And some biologists claim we are currently in a mass-extinction event driven by humans. There is little evidence for a mass extinction event caused by a gamma ray burst in the past (though maybe we have mis-interpreted the evidence).
I think we should definitely keep studying Wolf-Rayet 104, and I think there is a lot to learn about dying stars from this pair of stars. But I will not lose any sleep over the supposed danger these stars might pose to Earth.
Followers
Analyzed by Google Analytics
Copyright and Licensing
Disclaimer
The Professor Astronomy Blog is based on work supported by the National Science Foundation under grant no. AST-0602288. Any opinions, findings, and conclusions or recommendations expressed in this material are those of the author and do not necessarily reflect the views of the National Science Foundation (NSF).
|
Where he will represent the Fifth District of the State of Virginia
Some of Ken's Interviews
About Dr. Kenneth J. Hildebrandt
Ken was a chiropractic physician who practiced (claims free) in NJ from 1987 to 2000, when he gave up his practice after realizing how much of his patient's pain was coming from Washington as he struggled to help people get better one by one.
From 2000 until the present he worked free of charge as an independent web journalist and was among the pioneers of online political video in early 2001. He has interviewed presidential, gubernatorial, senatorial and congressional candidates, and has had numerous video discussions with the world's most cited living author, Professor Noam Chomsky of MIT.
Upon completing a candidate interview in Washington, DC, on April 17, 2012, Independent Greens Executive Committee National Chairman, Carey Campbell, who had been watching, asked Ken where he was from. Ken replied he was from Southside, Virginia, where he and his wife Elaine bought a home in late 2004 and completely relocated from Manhattan in early 2006.
Carey then asked Ken if he wanted to run for Congress. Ken emphatically said, "No." Mr. Campbell then asked Ken if he had anyone else in mind. This was followed by another, "No." Lastly, Ken was asked if he knew whether this opportunity would ever be available again. Upon the third, "No," Ken said he'd talk it over with his wife. By the end of the day Ken called Carey Campbell and told him that both he and his wife, Elaine thought it was something he HAD to do.
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.