Datasets:

NeelNanda

/

pile-10k

like 12

Vitamin B-6 vitamers in human plasma and cerebrospinal fluid. Vitamin B-6 comprises a group of 6 interrelated vitamers and is essential for numerous physiologic processes, including brain functioning. Genetic disorders disrupting vitamin B-6 metabolism have severe clinical consequences. To adequately diagnose known and novel disorders in vitamin B-6 metabolism, a reference set is required containing information on all vitamin B-6 vitamers in plasma and cerebrospinal fluid (CSF). Concentrations of vitamin B-6 vitamers in the plasma and CSF of 533 adult subjects were measured by ultra high-performance liquid chromatography-tandem mass spectrometry. The relative vitamin B-6 vitamer composition of plasma [pyridoxal phosphate (PLP) > pyridoxic acid (PA) > pyridoxal] differed from that of CSF (pyridoxal > PLP > PA > pyridoxamine). Sex influenced vitamin B-6 vitamer concentrations in plasma and CSF and should therefore be taken into account when interpreting vitamin B-6 vitamer concentrations. The strict ratios and strong correlations between vitamin B-6 vitamers point to a tight regulation of vitamin B-6 vitamer concentrations in blood and CSF. Given the unique design of this study, with simultaneously withdrawn blood and CSF from a large number of subjects, reliable CSF:plasma ratios and correlations of vitamin B-6 vitamers could be established. We provide an extensive reference set of vitamin B-6 vitamer concentrations in plasma and CSF. In addition to providing insight on the regulation of individual vitamers and their intercompartmental distribution, we anticipate that these data will prove to be a valuable reference set for the diagnosis and treatment of conditions associated with altered vitamin B-6 metabolism.

Last updated on .From the section Women's Football Maria Thorisdottir's late strike earned a thrilling derby victory as Chelsea hit back to end Arsenal's perfect start to the Women's Super League season. The Gunners led when Vivianne Miedema's astute pass picked out Danielle van de Donk, whose shot found the far corner. Chelsea deservedly levelled after the break, Beth England neatly turning the ball home from a Fran Kirby cut-back. And substitute Thorisdottir curled in a stunning winner to take unbeaten Chelsea above Arsenal and into second. Thorisdottir hit the ball first time from fellow sub Ramona Bachmann's 85th-minute pass to ensure a third Blues league win in four and move them to within two points of leaders Manchester City. There were some nervy moments for the hosts late against a Gunners side who had won their past 11 league games stretching back to last season. But Chelsea just about held out and celebrated in raucous style in front of a crowd of 4,149 at the full-time whistle. Van de Donk's early goal was reward for a bright start by the champions in an open match, but Emma Hayes' side gradually got on top. Ji So-Yun fizzed a shot narrowly wide and a fierce long-range Guro Reiten shot came back off the bar. The pressure told when Kirby scampered away and found England with a clever pass soon after the restart. Both sides pressed for a winner and had chances, but it was the home side who took the points thanks to an unlikely source in defender Thorisdottir.

Factors affecting in vitro protein binding of etoposide in humans. Clinical studies have demonstrated that the plasma protein binding of etoposide, a widely used anticancer drug, is extensive (approximately 94%), highly variable among patients (10-fold range), and significantly related to serum albumin and total bilirubin concentration. The present study was designed to more thoroughly evaluate factors likely to affect etoposide protein binding under controlled in vitro conditions where single variables could be changed. Protein binding was determined using an equilibrium dialysis method with tritiated etoposide. The binding of etoposide was similar in serum or plasma, and heparin had no effect on binding. Etoposide binding decreased with increased pH, but no clinically significant difference was noted within the range of physiologic pH. Etoposide binding evaluated in single-source donor plasma was concentration-dependent over a concentration range of 1 to 250 micrograms/mL. Etoposide binding parameters determined in normal human plasma were characterized by a single class of binding sites of moderate affinity (K = 2.88 +/- 0.47 x 10(4)) and high capacity (nP = 5.07 +/- 0.5 x 10(-4); where n is the number of binding sites). The etoposide binding ratio was significantly correlated with albumin concentration (r2 = 99%, p less than 0.05). The characteristics of etoposide binding in a 4.0-g/dL solution of human serum albumin (K = 3.56 +/- 1.22 x 10(4) and nP = 5.58 +/- 0.16 x 10(-4)) suggest that the single class of binding sites is on albumin. Bilirubin caused a significant decrease in K, consistent with competitive binding, but only at higher bilirubin concentrations.(ABSTRACT TRUNCATED AT 250 WORDS)

Intellectual decline after stroke: the Framingham Study. The causes and characteristics of cognitive decline after stroke are poorly defined, because most studies have relied on the diagnosis of dementia after stroke, without measurement of prestroke cognitive function. The Mini-Mental State Examination (MMSE) was used to assess the cognitive performance of 74 subjects from the Framingham Study cohort who had suffered a stroke during a 13-year period. We compared their poststroke cognitive performance with the prestroke MMSE scores collected during their biennial examinations, and their prestroke/poststroke changes in MMSE score were then compared with those of 74 control subjects matched for age and sex. Cases and controls underwent testing for symptoms of depression using the Center for Epidemiologic Studies of Depression (CES-D) scale, and these findings were correlated with their cognitive performance. Changes in cognitive performance in the cases were correlated with the CT-documented characteristics of the stroke. The cases had a significantly lower mean+/-SE MMSE score at prestroke baseline (27.28+/-0.34) than did the control subjects (28.08+/-0.21), a difference that became more pronounced (23.57+/-0.92 versus 28.31+/-0.25; P<.001) after stroke. The poststroke decline in cognitive function in the cases was correlated only with a large, left-sided stroke on CT. The CES-D scores were significantly higher in the cases, but nondepressed cases had significantly lower MMSE scores than nondepressed controls. Stroke is followed by a significant decline in cognitive performance when prestroke and poststroke measurements are compared. Although depression is more frequent in the stroke patients, their intellectual decline appears to be independent from the presence of depression.

Having fun at work is important, says Rohit Roy Actor Rohit Roy, currently seen in Vikram Bhatt’s web series “Memories”, said that fun is important while working. The actor, along with his co-star Priyal Gor, ensure they add a dash of fun while working on the set. Once, they burst out laughing while shooting a serious sequence. Recalling the memory, Rohit said in a statement: “Every day was a new learning with fun moments which made a pleasant experience for me, we had the best time shooting for a serious sequence which turned out to be a laugh riot.” “Sometimes fun is also important with work, just like creating memories on the set of ‘Memories’,” added the actor, who plays a news anchor in the show. Presented by video streaming service Viu, “Memories” is a thriller crime genre show which went live on July 1.

Geeky Stuff An awsome picture of the new Airbus A380. That thing is a monster! But can anybody out there explain to me how something that enormous and made out of metal can fly over oceans yet I can’t stay airborn on my own for more than 1 second? Really, I’m quite serious. It’s frustrating. An assumption is made that if you’re serious about the web, you’re using Firefox. Greasemonkey is a Firefox extension that lets you add bits of DHTML to any web page to make it behave better than it was originally designed. For example, you could insert competitors prices into Amazon listings or insert links to bittorrents into Netflix listings. Hundreds of existing scripts are provided for web-based mashup. A couple of guys built their own tracking sentry gun that fires bb’s, so I figured it might be a good project for some of you. And if you’re psychotic, you can do it with a real gun! But rembember that would be very illegal and you’d probably kill your wife, who let’s face it, is the only person who’s ever loved you. You inhuman monster. You’ll lose your job. Your significant other will leave you. Your children will starve. You will be entertained for the rest of your life. StumbleUpon adds a button to your web browser that when pressed, presents you with a random web page based upon your selected interests. When you’re bored with the page, just press the button again for more entertainment. And again and again and again and… Easier than Outlook. Simpler than notepad. More useful than either. 37Signals Backpack is an outrageously cool and useful web application that you can post to, read and edit effortlessly. The basic service is free and probably useful enough for most people as-is. I can’t say enough good things about this tool and have only scratched the surface in my own usage. “The controller for Nintendo’s upcoming Revolution home console system is a cordless remote-control-like device designed to be used with only one hand. Two small sensors placed near the TV and a chip inside the controller track its position and orientation, allowing the player to manipulate the action on screen by physically moving the controller itself.” continue reading… »

One in five Americans work alternative and rotating shifts, including night shifts. That means one in five Americans — medical professionals, security guards, police officers, cleaning staff — know firsthand how hard the night shift is. It takes a toll on your sleep patterns, your social life, and oftentimes your eating habits. Having a schedule that differs from the general 9–5 workday makes it hard to eat well, get enough nutrition, and maintain your weight. Night shift workers gain more weight than those who work during the day, due in part to the disruption of the body’s normal circadian rhythm. Scientists believe disturbing that regular rhythm (by working all night when your body would like to sleep) predisposes your body to gain more weight than it would on a regular daytime schedule. This means if you work night shifts, it’s even more important to ensure you eat a healthy diet. Creating a meal plan helps a lot — that can be easier said than done, though. If you struggle with keeping a planned diet, you’re not alone; and you can do something about it. Below, we explain why it’s hard to stick to a meal plan when you work the night shift or nontraditional hours, and how you can make it easier for yourself. Why It’s So Hard to Eat Well On the Night Shift The reality is, if you work nontraditional hours, you’re more likely to eat irregularly, or skip meals entirely — and you probably find it hard to fit in enough exercise. It’s not just you; the night shift makes being healthy a lot more difficult, no matter your habits. If throwing your body’s schedule into chaos wasn’t enough, there aren’t many nutritious food options for those working the graveyard shift. The majority of restaurants open in the middle of the night, or early in the morning, tend to be fast food restaurants. If you’re trying to avoid the unhealthy chicken nuggets and burgers, your next best option is likely an office vending machine, full of snacks and drinks that definitely aren’t nutritious. If you’re aiming to eat well, you’re often left trying to choose the lesser of two evils — the greasy french fries, or the 75-cent shortbread cookies — which is bad enough, without the added fact that your body is at a disadvantage no matter which you choose. It turns out, the night shift may actually slow down your metabolism, causing you to burn calories slower than someone who works during the day. So even if you get that one salad from the drive-through menu, your body is still predisposed to weight gain. The evidence is clear: nontraditional work schedules make it difficult to eat well, and easy to gain weight. You can combat the challenges of your schedule, with a clearly defined plan, and the willpower to see it through. Making and Sticking To a Meal Plan Benjamin Franklin once said, “If you fail to plan, you are planning to fail.” Whether or not he was directly referring to meal planning, when it comes to healthy eating habits and working strange hours, he couldn’t be more correct. Here’s how you can put together a plan to eat regular, nutritious meals that help your body overcome any late-night disruptions to its natural rhythm. Stock up on healthy foods and get rid of junk food. If it’s not in your house, there won’t be a temptation to eat it. Cut down on buying unhealthy foods, and replace them with nutritious foods instead. Keep plenty of protein-filled and nutritious snacks like fruit, nuts, and yogurt on hand. Unlike chips and cookies, these snacks will actually nourish you, making you feel less hungry between meals and giving you energy boosts your body needs. A good tip for your shopping trips: Stay along the the perimeter of the grocery store, to reduce your likelihood of picking up those foods high in sodium, sugar, and fat. Prepare ahead of time. Once you’ve got your pantry full of healthy food, schedule time to make your meals in advance. This decreases the chances of you arriving home from a shift, exhausted and wondering what to eat, and quickly pulling out a container of Easy Mac. Set aside time on your day off, or a day when you have a spare block of time, and cook as much as you can — so you’ll have plenty of healthy leftovers in the fridge that can be easily re-heated. One easy idea: Hard boil a bunch of eggs at the beginning of the week, store them in the fridge, and bring a few work each day as a healthy, high-protein snack. You may also consider getting a slow cooker, which makes it easy to throw some veggies and meat together before you leave for work, and return home to a delicious stew. There’s a wide selection of fantastic slow cooker recipes that make preparing meals a snap. Eat three regular meals. Working irregular hours leaves many people feeling like they can only find time for one “real” meal; keep in mind that no matter your schedule, it’s important to get three square meals a day. Try to avoid having a large meal in the middle of the night, and stick as closely to a regular eating schedule as you can. If possible, have breakfast when returning home after your night shift, sit down for lunch after waking up, and eat a full dinner before you go back to work in the evening. If you find yourself hungry during the night, have a light snack that will give you a bit of energy, and is easy for your system to digest; such as fruit, yogurt, or light soup. Build your meal schedule around your job, and then follow it each day. Sticking to a consistent eating schedule will help your metabolism run more smoothly, burning more calories and keeping you healthier overall. Stop snacking. This ties closely with the above point. Once you’ve created your consistent meal schedule, it’s not only important to ensure you eat at all three meal times, but also that you refrain from eating too much in between those times. Many night shift workers find themselves snacking because they’re bored, or tired. If you’re snacking in an effort to keep your eyelids from drooping, this is a sign you’re likely not getting enough sleep in your off hours (see below). If you’re snacking because you’re bored, start training yourself to pause and recognize that feeling of boredom, before heading to the vending machine. This takes a bit of work in the area of mindfulness; becoming conscious of how your body and mind feel at any given moment. As you get better at identifying your own moments of boredom, come up with healthier alternative solutions. What can you do to relieve the boredom without taking a toll on your waistline? Depending on the nature of your job responsibilities, you may try listening to music, working on a crossword puzzle, chewing gum, or fiddling with a small object (like a stress ball or silly putty), to alleviate your boredom. Get enough sleep. Yes, it’s difficult. Our bodies fight sleep during the daylight hours, so even if you feel exhausted from working all night, it can be challenging to get the recommended 7 to 9 hours of sleep each day. In fact, the average night shift worker only gets about five hours of sleep. Most night shift workers are victims of “shift-lag” — going to be bed at 8am, yet unable to sleep past 1pm; therefore, getting well under the recommended amount of sleep each day. If you are a victim of shift-lag, try to take small naps throughout the afternoon to get you closer to that seven-hour mark. If you struggle to fall asleep when you get home from your shifts, try a few strategies to help your body understand it’s time for sleep: close the blinds and darken the room as much as possible, play quiet and relaxing music, avoid using your TV or computer screens within the half-hour beforehand, and introduce the calming scent of lavender into the room. What does sleeping have to do with sticking to your meal plan? Everything. Without adequate sleep, it is hard for humans to practice self-control in the waking hours. Decreasing your capacity for self-control will make it harder to resist that vending machine, or fast food drive-through on the way home. Developing and sticking to a nutritious meal plan won’t return your social life to normal, and it won’t make up for missing the sun (though you can get vitamin D for that!); but it will help you feel healthier and more energetic during your waking hours — and keep your weight in check. You’re not the only person working nontraditional, irregular hours, so if you need extra support or motivation, seek out and talk to other people who work in a similar field or schedule as you. Remember, for your body’s health and wellbeing, routine is essential. Set the time aside to plan your meals (and plan your sleep schedule, if you can), and keep yourself on a healthy routine — the longer you follow your meal plan, the easier and more habitual it will become. Katie Di Lauro is a registered dietitian nutritionist at Tri-City Medical Center, a full-service, acute-care hospital located in Oceanside, California. Katie brings her 14 years in the wellness industry, as an individual and corporate wellness educator. Katie is truly passionate about wellness and helping her clients achieve their goals through education, motivation, and accountability. Share your comments below. Please read our commenting guidelines before posting. If you have a concern about a comment, report it here. Are You a Sleep Deprived Shift Worker? Sign up for the Thrive Global newsletter “People look for retreats for themselves, in the country, by the coast, or in the hills . . . There is nowhere that a person can find a more peaceful and trouble-free retreat than in his own mind. . . . So constantly give yourself this retreat, and renew yourself.”

/** @file Contains the global variables used in LabelMe. */ // Parsed LabelMe XML file. Manipulate this variable with jquery. var LM_xml; // URL of CGI script to submit XML annotation: var SubmitXmlUrl = 'annotationTools/perl/submit.cgi'; // LabelMe username: var username = 'anonymous'; // Boolean indicating whether user is currently signing in (this should be abstracted into class): var username_flag = 0; // Boolean indicating if we will use attributes. This should be read from the URL and set to 0 by default. var use_attributes = 1; // if this is 0, then it will remove all the attributes from the bubble. var use_parts = 1; // if this is 0 disapears the message from the bubble // for now, let's remove the attributes in MT mode. Just in case anybody is trying this. if (getQueryVariable('mode')=='mt'){ //use_attributes=0; //use_parts = 0; } // Boolean indicating whether the control points were edited: var editedControlPoints = 0; // Scalar indicating which polygon is selected; -1 means no polygon is selected var selected_poly = -1; // Class with functions to handle actions/events. var main_handler; // Canvas that renders polygons at rest state. var main_canvas; // Holds image. var main_media; // URL of XHTML namespace. This is needed for generating SVG elements. var xhtmlNS = 'http://www.w3.org/1999/xhtml'; // Website that refers to LabelMe: var ref; // Indicates whether we are in segmentation or polygon mode var drawing_mode = 0; var showImgName = false; // Scribble mode: var scribble_mode = true; var threed_mode = false; var video_mode = false; var bounding_box = false; var bbox_mode = true; var autocomplete_mode = false; var wait_for_input; var edit_popup_open = 0; var num_orig_anno; var global_count = 0; var req_submit; // Indicates if polygon has been edited. var submission_edited = 0; // Allowable user actions: var action_CreatePolygon = 1; var action_RenameExistingObjects = 0; var action_ModifyControlExistingObjects = 0; var action_DeleteExistingObjects = 0; // Which polygons are visible: var view_Existing = 1; var view_Deleted = 0; // Flag for right-hand object list: var view_ObjList = true; // Mechanical Turk variables: var LMbaseurl = 'http://' + window.location.host + window.location.pathname; var MThelpPage = 'annotationTools/html/mt_instructions.html'; var externalSubmitURL = 'https://www.mturk.com/mturk/externalSubmit'; var externalSubmitURLsandbox = 'https://workersandbox.mturk.com/mturk/externalSubmit'; var mt_N = 'inf'; var object_choices = '...'; var loaded_once = false;

Twin blasts rock town on Turkish border with Syria NBC's Richard Engel reports from Turkey where two car bomb explosions in the town of Reyhanli near the Syria border killed at least 40 people and injured at least 100, raising fears Syria's civil war may be crossing the border. By Marian Smith, Staff Writer, NBC News Two car bombs exploded near the Turkish border with Syria on Saturday, killing at least 40 people and injuring scores more in the town of Reyhanli. "Two cars exploded in front of the municipality building and the post office in Reyhanli," Interior Minister Muammer Guler said in comments on Turkish television. "We know that the people taking refuge in Hatay have become targets for the Syrian regime," Arinc said in comments broadcast on Turkish television. "We think of them as the usual suspects when it comes to planning such a horrific attack." There was no immediate claim of responsibility. Nor was there any comment from Damascus. Speaking to reporters during a visit to Berlin, Turkey's Foreign Minister Ahmet Davutoglu said the country would protect itself if threatened. Turkey supports the uprising against beleaguered Assad and has been a vocal critic against the regime. "There may be those who want to sabotage Turkey's peace, but we will not allow that," he said. "No one should attempt to test Turkey's power; our security forces will take all necessary measures." The United States condemned the attacks and vowed solidarity with Turkey in identifying those responsible. "The United States condemns today's car bombings and we stand with our ally, Turkey," read a statement from Secretary of State John Kerry. "This awful news strikes an especially personal note for all of us given how closely we work in partnership with Turkey, and how many times Turkey's been a vital interlocutor at the center of my work as Secretary of State these last three months. Our thoughts are with the wounded and we extend our deepest condolences to the families of the victims." "The United States strongly condemns today's vicious attack, and stands with the people and government of Turkey to identify the perpetrators and bring them to justice," U.S. Ambassador to Turkey Francis Ricciardone said in a statement.

Q: Sonar Maven plugin finds more bugs than Sonar Jenkins or Sonar CLI Scanner on multi-module Maven project Given the same code and the same SonarQube server with the same rules I get vastly different number of bugs and vulnerabilities found when scanning with mvn sonar:sonar vs the sonar-scanner CLI and a sonar-project.properties file or the Sonar Jenkins plugin. Like, more than twice as many. I have the modules setup in the properties file and on the server I can see the count of lines of code is the same between the two scanners. I can see tests in one report but not the other but the tests aren't being counted for the lines of code or any bugs. An example of something Maven is finding that Jenkins is not is squid:S2160 where the parent class is part of the same module as the child class. My main concern is whether the additional errors Maven is finding are legit, especially given that Sonar has deprecated the "SonarQube analysis with Maven" post-build action and the recommended Jenkins scanner ISN'T finding the same problems when looking at the same code. Which scanner is right, and if it's Maven is it still OK to use the deprecated step in Jenkins? I've anonymized the properties file with the modules, but it looks like this: # Required metadata sonar.projectKey=groupId:artifactID sonar.projectName=My Project name sonar.projectVersion=0.0.4-SNAPSHOT # Comma-separated paths to directories with sources (required) sonar.sources=coreModule/src/main/java,appModule/src/main/java sonar.tests=coreModule/src/test/java,appModule/src/test/java sonar.modules=core,app core.sonar.projectBaseDir=coreModule core.sonar.sources=src/main/java core.sonar.projectName=My Core Module Name app.sonar.projectBaseDir=appModule app.sonar.sources=src/main/java app.sonar.projectName=My App Module Name # Language sonar.language=java sonar.java.source=8 # Encoding of the source files sonar.sourceEncoding=UTF-8 A: The SonarQube Scanner for Jenkins is essentially a wrapper around the other scanners to make them available to you conveniently in Jenkins. From the rest of your question, I'll guess that you're using the SonarQube Scanner analysis Build Step in Jenkins. From the properties you've posted, you don't appear to be providing byte code to SonarQube Scanner analysis. If you were, there would be a sonar.java.binaries property. The reason the SonarQube Scanner for Maven is finding more issues is that it automatically provides that value to the analysis. And if you're able to analyze with SonarQube Scanner for Maven, you should. As you've already discovered it "just handles" most of the details for you. You accomplish this in Jenkins not with a SonarQube Scanner for Maven-specific build step, but with a normal Maven build step. As described in the docs you will have first enabled "Prepare SonarQube Scanner environment" in the Build Environment section. Then you can analyze with $SONAR_MAVEN_GOAL -Dsonar.host.url=$SONAR_HOST_URL. (Note that you may also need to pass an analysis token via -Dsonar.login depending on your project permissions.) To answer your question, the "extra" issues found by the Maven analysis are legitimate. They are not found by the other analyses because they are raised by rules that work against byte code.

Q: Setting Isolation level in ruby v 2.1.3 I have been struggling with putting a record level lock on my table, to avoid any dirty reads and race condition while updating the record. I am using ruby 2.1.3 and rails version 3.2.13. I tried using the command: Account.connection.execute("SET TRANSACTION ISOLATION LEVEL SERIALIZABLE") and tested by putting sleep, but 2 processes trying to update the same record read the old value and the final data is wrong. For example: if my old value is 100, both processes read 100 and then update, 100+x and 100+y and thus,the data is getting corrupted. I am using mySQL database. Any help is appreciated. A: The following solution worked for me (slight modification of dimakura's answer): When I used find() for active record query: acc = Account.lock.find(id) acc.balance += 100 acc.save! When I used where() for active record query: acc = Account.where(:acc_code => acc_code).first acc.with_lock do acc.balance += 100 acc.save! end

Exacerbation of antigen-induced arthritis in IFN-gamma-deficient mice as a result of unrestricted IL-17 response. Proinflammatory Th1 responses are believed to be involved in the induction and perpetuation of rheumatoid arthritis. However, the role of IFN-gamma, the major cytokine produced by Th1 cells, is still incompletely defined. In the present study, we investigated the effects of IFN-gamma deficiency (IFN-gamma(-/-)) on the course of experimental murine Ag-induced arthritis (AIA). In the acute stage of disease, IFN-gamma(-/-) AIA mice showed significantly increased inflammatory responses compared with wild-type C57BL/6 AIA mice, i.e., exacerbated joint swelling, increased delayed-type hypersensitivity reaction, and increased histopathological scores of arthritis. Intraarticular administration of exogenous IFN-gamma at induction of AIA significantly suppressed these acute aggravation effects. Stimulated cells isolated from lymph nodes and spleen of IFN-gamma(-/-) AIA mice showed increased production of IL-2, IL-4, IL-5, IL-6, but most prominently of IL-17. These elevations were paralleled by decreased humoral immune responses, with low serum levels of total and Ag-specific IgG (IgG1, IgG2a(b), IgG2b, IgG3). At immunohistology, the knee joints of IFN-gamma(-/-) AIA mice showed massive neutrophil granulocyte infiltration. Treatment with mAbs neutralizing IL-17 diminished the acute inflammation. In vitro, Th cell expansion and production of IL-17 upon restimulation were effectively and dose dependently inhibited by IFN-gamma. These results clearly demonstrate that IFN-gamma has anti-inflammatory properties during the initial phase of AIA, and indicate that IFN-gamma deficiency exerts disease-promoting effects, preferentially via IL-17-modulated pathways.

The authors wish to make the following corrections to their paper \[[@B1-ijms-19-02737]\]: We have recently been made aware of some errors and omissions in the following paragraph of our recent paper. Section 2.2.5, lines 2--6 currently read as follows: A structure-selective DNA binding of wild-type and G245S mutant p53 proteins on the intermolecular triplex (dT)50.(dA)50.(dT)50 has been described \[131\]. Binding of wild-type p53 on plasmid DNA containing triplex-forming sequence demonstrated that p53 prefers a superhelical form of plasmid with triplex extrusion. The use of antibodies to the p53 N- and C-terminal domains showed that the C-terminus of p53 probably plays a key role in triplex TAT binding \[131\]. To set the scientific record straight, we would like to replace this with the following: Structure-selective DNA binding of wild-type p53 protein on the intermolecular triplex (dT)50.(dA)50.(dT)50 has been described \[131\]. Binding of wild-type p53 on plasmid DNA containing triplex-forming sequence demonstrated that p53 prefers a superhelical form of plasmid with triplex extrusion. The use of antibodies to the p53 N- and C-terminal domains showed that the C-terminus of p53 probably plays a key role in triplex TAT binding \[131\]. The original Reference 131 has been deleted, and all the reference numbers after it have been changed accordingly. References 132--155 are now numbered 131--154. The authors would like to apologize for any inconvenience caused to the readers by these changes. The changes do not affect the scientific results. The manuscript will be updated and the original will remain online on the article webpage, with a reference to this Correction.

Q: Why do these values change like the objects were passed by reference if I set the properties? Program: class Program { class class1 { public string Name { get; set; } public int Value { get; set; } } class class2 { public string Name { get; set; } public int Value { get; set; } } static void Main(string[] args) { var Source = new class1() { Name = "Source", Value = 1 }; var Target = new class2() { Name = "Target", Value = 2 }; setValue(Source, Target); Console.WriteLine(string.Format("Source - Name:{0} Value:{1}", Source.Name,Source.Value)); Console.WriteLine(string.Format("Target - Name:{0} Value:{1}",Target.Name, Target.Value)); } private static void setValue(object Source, object Target) { Target = Source; } } When this runs I get(which I expected): Source - Name:Source Value:1 Target - Name:Target Value:2 But when I change the setValue method to: private static void setValue(object Source, object Target) { var source = Source as class1; var target = Target as class2; target.Name = source.Name; target.Value = source.Value; } I get: Source - Name:Source Value:1 Target - Name:Source Value:1 A: This line: Target = Source; Is just copying the value of Source into the variable Target. That value is just a reference - and Target is effectively just a local variable, as it's a normal parameter. In your other code: var source = Source as class1; var target = Target as class2; target.Name = source.Name; target.Value = source.Value; That's setting the data within the objects which are referred to by the parameters. Think about it like this. Imagine you give someone a piece of paper with an address on, and they go to that address and painting the house red. Later you visit the house yourself, and you see that it's red. Now compare that with your first example - that's like giving someone a piece of paper, and them crossing out the address and writing the address of a red house onto it. You don't see this - you just gave them the piece of paper and let them get on with it. So when you go to the original address, you don't see a red house, because it hasn't changed. I have two articles which may help you to understand the concepts involved: Parameter passing Reference types and value types

Bobi over at shoestring sophistication just awarded me the Versatile Blogger Award! I’m pleasantly surprised that something in my house is worthy of an award, but hey I’ll take it :) I’ve been following her projects on her blog and on the nest and she produces some seriously gorgeous stuff! In fact, she put recently up board and batten in her hallway which was even more motivation for me to get the ball rolling on mine. Thanks for the inspiration and the award Bobi! Here are the rules for the award recipients: 1. Thank the person who gave you the award and link back to their site in your original post2. Tell us seven things about yourself3. Pass along the award to five newly discovered bloggers4. Contact these bloggers and let them know they got this award Here’s my seven fun facts…. 1. Before my life as an obsessed home renovator, I was equally as obsessed (ok, a lot more actually) with my car. It started in high school and became a full on addiction by college. I spent every second of my free time at car meets, working on the car, at the drag strips, etc… I even had a matching street bike. Anyone who knew me from age 16 to 24 can attest to how nuts I was. In fact, it was at a car meet where I met Brad in 2007 (he had a 1000hp twin turbo supra and it was love at first sight.) Luckily our love lasted beyond the track and we’re now happily married! Anyway, I could go on forever, but here’s a pic of my babies together: Ok one more... here we are together at a show: Moment of silence please for their absence. Moving on. 2. Myself, my mom and my grandpa were all born in the same hospital in San Francisco (shout out to the bay area!) 3. My mom, my dad and my grandpa are all in the real estate business (see, it’s in my blood, it was bound to happen…) 4. I was grew up and was baptized Mormon but have since retired due to love of 2 piece bikinis and wine. 5. I sometimes spend hours on google earth zooming in to every tropical island in the world to scope out my future residences. Yes, I plan on becoming independently wealthy and buying an island. 6. In second grade I wrote a story about clouds for a state wide contest and won. My story was made into a TV special and I got chauffeured to the state capital in a limo (I vividly remember this), a special school assembly in my honor and won my class a field trip to a dairy farm. 7. My dream job for the past couple years has been to become a house flipper and/or landlord (which we’ve already started with our LA properties) but now it looks like this Etsy thing will become my full time gig soon. And I couldn’t be happier. So that’s probably more than you wanted to know about me, but now that that’s out of the way, time to pass the award along to five bloggers who inspire me!

// Copyright 2019 ETH Zurich // Copyright 2020 ETH Zurich, Anapaya Systems // // 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 json_test import ( "encoding/json" "flag" "io/ioutil" "strings" "testing" "github.com/stretchr/testify/assert" "github.com/stretchr/testify/require" "github.com/scionproto/scion/go/lib/common" jsontopo "github.com/scionproto/scion/go/lib/topology/json" ) var ( update = flag.Bool("update", false, "set to true to update golden files") ) func TestLoadRawFromFile(t *testing.T) { referenceTopology := &jsontopo.Topology{ Timestamp: 168562800, TimestampHuman: "May 6 00:00:00 CET 1975", IA: "6-ff00:0:362", MTU: 1472, Attributes: []jsontopo.Attribute{jsontopo.Authoritative, jsontopo.AttrCore, jsontopo.Issuing, jsontopo.Voting}, BorderRouters: map[string]*jsontopo.BRInfo{ "borderrouter6-f00:0:362-1": { InternalAddr: "10.1.0.1:0", CtrlAddr: "10.1.0.1:30098", Interfaces: map[common.IFIDType]*jsontopo.BRInterface{ 91: { Underlay: jsontopo.Underlay{ Public: "192.0.2.1:4997", Remote: "192.0.2.2:4998", Bind: "10.0.0.1", }, Bandwidth: 100000, IA: "6-ff00:0:363", LinkTo: "CORE", MTU: 1472, }, }, }, "borderrouter6-f00:0:362-9": { InternalAddr: "[2001:db8:a0b:12f0::2]:0", CtrlAddr: "[2001:db8:a0b:12f0::2300]:30098", Interfaces: map[common.IFIDType]*jsontopo.BRInterface{ 32: { Underlay: jsontopo.Underlay{ Public: "[2001:db8:a0b:12f0::1]:4997", Remote: "[2001:db8:a0b:12f0::2]:4998", Bind: "2001:db8:a0b:12f0::8", }, Bandwidth: 5000, IA: "6-ff00:0:364", LinkTo: "CHILD", MTU: 4430, }, }, }, }, } if *update { b, err := json.MarshalIndent(referenceTopology, "", " ") require.NoError(t, err) b = append(b, []byte("\n")...) err = ioutil.WriteFile("testdata/topology.json", b, 0644) require.NoError(t, err) } t.Run("unmarshaled struct matches", func(t *testing.T) { loadedTopology, err := jsontopo.LoadFromFile("testdata/topology.json") assert.NoError(t, err) assert.Equal(t, referenceTopology, loadedTopology) }) t.Run("marshaled bytes match", func(t *testing.T) { referenceTopologyBytes, err := ioutil.ReadFile("testdata/topology.json") require.NoError(t, err) topologyBytes, err := json.MarshalIndent(referenceTopology, "", " ") require.NoError(t, err) assert.Equal(t, strings.TrimSpace(string(referenceTopologyBytes)), strings.TrimSpace(string(topologyBytes)), ) }) }

RAM: What it is, how it's used, and why you shouldn't care Why, in the name of all things holy, does the fastest, most powerful phone on the market have a widget warning me how many apps are open? Many of you guys know me, and how I am (if you don't, imagine some godless mash-up of anal retentiveness and OCD), so you know this is something that just had to be addressed or I would never sleep well at night again. Which leads us to here and now. The answer to the question is pretty easy -- user madness and FUD forced manufacturers to add some sort of RAM-cleaning, task-killing, and problem-causing widget to current builds of their software. For most of us, the system running on our Android phones, and the way it handles RAM usage, is very different than what we are used to on our computers. If we take a few minutes to understand the way RAM is managed on our phones, we'll not only be able to better interpret what that widget is telling us, but also understand why it doesn't really matter. Let's do that, after the break. The 'Task Killer' debate Every discussion about Android phones and tablets, and how they manage memory will eventually get to the Task Killer debate, so we're going to start with it. Simply put -- task managers are good; task killers are bad. In the hands of someone who is aware of what will happen when they stop a running application, a tool that easily lets them do it is a fine thing for everyone. It's a function built into every operating system, including Android. It's a useful debugging tool, and great for developers and power users alike. The problem is that if you're here at Android Central reading, you're either a power user already, or a power user in training and understand more than most people who just install TASK KILLBOT 2000 because the Market description said it will make your phone ZOMG FAST. You realize that killing the Mail app will stop you from getting mail, or that killing the system clock will make you late for work. Harriet Housewife, who just picked up her shiny new Android phone at the Verizon store doesn't -- and she doesn't have to -- unless she gives in to the FUD (or worse, some kid at a store who thinks task killers are a gift from Zeus himself) and installs the task killer. It's not her fault though, as it seems like every time you turn around someone, somewhere is saying that to get good battery life and ZOMG FAST you need to use one. You don't. You won't. And it makes Cory twitch a little and think about ammunition and clock towers. Keep reading. ... What is RAM? RAM (Random Access Memory) is storage used for a place to hold data. Think of it as a big filing cabinet that keeps things ready for the CPU in your phone to present it to your eyes and ears. It's infinitely (almost) re-writable, very fast, and used differently by different operating systems. Many of you guys understand what it is, how it works, and what I'm explaining -- but we're going to try and break it down so that more normal and well-adjusted people can follow along. RAM is used for one reason only. Reading and writing to file storage (as in reading and writing to your hard drive in your computer, or your internal memory/SD card on your phone) is terribly slow. Solid-state "disks," like what's used in our Android devices and what a lot of geeks people use as hard drives in their computers, are faster than spinning disk platters (normal computer hard drives), but using it to cache the data we need is still a lot slower that using dedicated, solid-state RAM. RAM is cheap. The bus (a pathway for the electrical signals to travel along) between the CPU and the RAM is fast, and everything is kept orderly and easy to retrieve. It's also resource friendly to read and write to it. Without it, computers of all sizes would suck a lot more. Running applications Widgets and apps that monitor the apps "running" (quotes intended) aren't inherently evil. We're going to pick on Samsung here, but Motorola, HTC, and the rest all do the same thing in different ways. And what they are doing isn't inherently bad -- people have been using tools like Torsmo and Rainmeter to show a fancy graph of their RAM right where they can see it for a while, and nobody has been hurt (yet). But when that little widget turns bright red like it's screaming "Danger, Will Robinson!" with no explanation, it's time to step in and try to explain the process. In Android, like many other operating systems built from Unix roots, all share one common thing about RAM: Unused RAM is wasted RAM. Android, like Mac OS and Ubuntu, wants to use all the RAM it can, because that's how it was designed to work. There are settings (in Android we call them "minfree" settings) to tell the system how much RAM to leave free and available, but the rest is designed to fill up as fast as possible and stay that way. You're probably thinking "What's it filling up with?" That's a great question. After the system, graphics, radios, and any other tweaks to RAM are done loading, the rest is there to load apps into memory, right up to the point where the OS says to stop. Load the app as it's being used, and keep it there for the next time until it needs flushed to free space for something else. The more you use the system, the better it gets at keeping the right things loaded and ready to go. Think about how you use your phone -- you might have 100 apps installed, but there are a few you always are opening and using. Eventually, most of those apps will be stored in your RAM, simply because you're always opening them and loading them into the RAM if they weren't already there -- and "erasing" other apps that were there first. Loading an app from your storage takes longer, is harder on the battery, and overall worse than loading it from it's cached position in RAM. Consider this -- Jerry did/said/thought something that made his wife mad (yes, she can read my thoughts), so he bought flowers from the 7-Eleven and wants to make a mix CD of her favorite Rod Stewart songs to give to her and get his ass out of the doghouse. It could happen. Consider which is more efficient: Burn 20 songs to a CD, give to wife, and smile while she plays it. Burn one song to a CD, let her listen, then erase it and burn the next song. That's what your phone (or tablet) has to consider. Loading Google Talk to RAM once, and having it there to open almost instantly is far better than loading it each and every time you want to use it. So why kill it off? It's not like you'll never use it again, and nothing else is going to use that RAM while it's sitting empty -- at that point, it's wasted space. You will also use a lot more battery power re-opening Talk every time you get a message than you will by having the zeros held as ones on your RAM. The folks who built Android really did know what they were doing when it comes to memory management. After the parameters are set, and the amount the OS can use to "swap" for it's normal operations, the rest is simply wasted if we're not using it. What is cached in RAM is just sitting there, not using any CPU cycles, but ready to get pushed to the front and appear on the screen as fast as it can, and not use the extra battery needed to start it up from disk again. But Task Killers and freeing RAM made my <insert old Android phone> better! Having 4MB of RAM made old Windows 3.1 computers better, too. Android, and the hardware it runs on, evolves in our hands -- it gets better with every new release. The software is better, the hardware is better, and the folks writing the apps are getting better at it with better tools. We're going to use the HTC Hero as an example here, because we don't talk about the HTC Hero enough anymore. By today's standards, the hardware and the software on the Hero suck. It sucked the same when it was new, but at the time we didn't have Bionic's or Thrill 4G's to compare it to. We only knew that there were three ways to make it run faster -- yank HTC Sense off of it, use a task killer, or tweak the system a whole helluva lot. Two of those options need root access -- so that puts 90+ percent of users out of the picture. Normal people don't root their phones, and Harriet Housewife (or Tommy Textgod) are normal. They bought a phone that could do more than any other phone they ever used before, so they tried to do it all. Android and HTC Sense weren't near as good at managing themselves and their memory needs back then, and having the RAM full meant that there wasn't quite enough left over to run the user interface as fast as it did when the RAM was empty. Hackers soon found that tweaking the existing settings that decide how much RAM to keep free did a wonderful job at fixing that issue, and we all were happy. But if you didn't want to hack your phone, you had the option of just living with it being slow every once in a while or using a task killer to free up some RAM. I'll bet most people just lived with it (the number of people who installed a task killer is waaayyy smaller than the number of people who bought an old Hero, Eris, Cliq, or Behold), but people who spent any time on the Internet fell victim to the lure of a task killer. Soon, forums across the web filled with tales of woe about things not working right -- because everyone was randomly killing off important system processes and apps that needed to stay running. There were also issues with apps. A correctly coded app that uses a ton of resources, let's say Plants vs. Zombies, gobbles up a bunch of your RAM while you're using it, but gracefully exits and purges itself when it's done. That means the RAM is free, being wasted, and needs filled up again when you load up Google Talk. When you're done chatting, Google Talk just gets sent to the background because it didn't have to take a ton of RAM and should stay loaded for the next time. When Android was shiny and new, a lot of apps that used an excessive amount of system resources didn't exit gracefully, and the OS struggled to purge RAM and load itself back to the foreground -- causing lag when you closed a big app. Sometimes the lag lasted a while, and people soon tired of it. Killing every damn process you can and jacking the free RAM up as high as possible, or even worse -- scheduling a task killer app to do it automatically every so often -- seemed like the best solution to a whole lot of people. We're mostly past that now. App developers are crafty, and the tools they have at their disposal mean that most of the time they get it right -- even on the first try. Why it no longer matters Nowadays, the hardware in our phones is amazing and the software is very much improved. Android can manage memory rather well (and the settings are still there to tweak if you just have to touch stuff) and having up to 300 percent more RAM makes a huge difference. There will be a few times where killing off a handful of tasks will speed things up, but overall you'll get the best performance out of your phone or tablet if you stop worrying about it and let Android be Android. If you need to live on the edge (and I know a lot of you guys do) root and hack your phone with some amazazazing custom ROM that has everything tweaked and allows you to travel forward in time -- I'm right there with ya, cause it's fun as hell. But don't worry about how many apps are running on your phone, or about using widgets that tell you these things, because it just doesn't matter anymore. We can't blame OEM's like Samsung for doing it -- it was inevitable with all the brouhaha out there, and some may even say necessary with earlier phones. I promise, this just isn't going to happen: Reader comments RAM: What it is, how it's used, and why you shouldn't care Okay, so I'm a little old school here. And to be honest I'm not really all that into the deeper side of smartphone tech. But as an old school PC man (which really that's what a smartphone seems to be, a handheld PC) i can tell you that one of the easiest, and cheapest, ways to jack up performance is to increase RAM. Processing speed is only part of the equation, insufficient RAM means your processor is trying to manage traffic thru downtown Boston... during rush hour... ...in a blizzard. Double your RAM and suddenly your processor is cruising Autobahn style...in an Aston Martin. Here's a question I really would like to see an answer to: Why in the name of the Elder Gods is my internal storage disappearing at such an alarming rate?! Ive dumped apps, uninstalled updates, orchestrated a mass exodus to the SD card, erased call logs, message logs...and still i have just barely enough left for the phone to run. I literally can not update anything on my phone or it starts coding (medically speaking). I just don't get it. This article could be more accurate phones that only have one gigabyte or RAM are going to slow down lock up etc I just bought a new phone which has two gigabytes of RAM and its world of difference. So for the millions and millions of Android users out there that only have one gigabyte of RAM which is current they are still going to have problems using larger apps like Skype and Google maps and navigation apps etc all the same time it's just not going to work right and never has worked right for me I've always had to kill arie move some apps to get the phone to work correctly and this has been the same situation for the last for Android phones I've owned it's just that simple if more RAM is available I'll buy the phone with more RAM because I want to be able to see video with no lag or buffering which occurs a lot on older 512MB RAM phones but not so much on 2 Gig Ram phones this blog is utter rubbish just because a device has a quad core processor and 512MB of Ram doesn't mean it will perform as well as a quad core with 2 gig of RAM. its not just about being able to go back to something quicker Ram speeds up internet searches hasn't anybody uprated their RAM in their home computer to see how much faster it makes an internet search it reduces the lag a lot, the time it takes to do something. it really makes a big difference between devices. but in saying that the match between processing power and RAM has to be made the manufacturers are currently bunging in old 512MB RAM because it is relatively cheap to use RAM is expensive and so is processing power but the phone industry seem to have the ability to buy cheap processors and still install the cheapest RAM. Mobile ram is even being used in cheap Laptops these days because it is somewhat cheaper than Decent proper computer laptop RAM. single data rate as opposed to double data rate or even DDR3. oh and core is spelt CORE not CAOIR as in the search bar. Hmm... So this article makes a lot of sense where it explains what RAM is and how it is managed on Android. But it makes for a very poor defence of Android OS per se, or why it is more efficient compared to other OSes including Desktop OSes: Fine, Android uses RAM more efficiently and so won't matter much if apps are kept in the RAM or not. But Nobody, I say nobody on this forum has answered these questions, which have been already raised by quite a few sceptics: 1) Why does it choose to load many apps I never use. That seems like very poor management to me? And why does it not choose the correct apps to "pre-load" that I DO actually use? 2) Why is it that there are apps that are running (whether running actively or a stored mem location) for applications that I have not ever launched and do not ever plan too. I have never used "Peep" and others in my life....but yet it consistently appears as a running process. Why? 3) The phone is simple killing apps before the amount of free memory gets so low that the phone lags. But that's either ideal because that kills off multitasking. You leave your browser and the open tabs reload when u re-enter it. Or the (ill coded) game u left for checking your mail resets you to the main menu etc.. So clearly Android is only somewhat better at Multitasking, not a sure winner on this count, right? 4) People are advising that I should just the notifications off, instead of killing the Apps.. Why? Why should the OS randomly keep some Apps - that I never intend to use - in the memory (running or just sleeping) on its own, and then ask me to turn of the notifications so as to not get irritated? Is it not just simple and beautiful to not run those apps in the first place? 5) Yes there are buggy or poorly written apps and it's not Android's fault! Great. So there were viruses on PCs and that was surely not Windows' fault. We all loved vilifying Windows though! I guess this whole exercise is just to provide an excuse so that apps such as Google services or Facebook are not killed by users (using App Killers, App Managers or by just asking Android to kill apps selectively from "Running Apps" list) and thus they keep to get their hands on the info shared by the users! Other apps are being defended only collaterally! It is a terrible defence to say that Android keeps some apps in the memory since they're frequently used and/or I should not at all worry about it in the first place since Android manages the RAM really well. To me those Apps running are as good as spam-ware when I don't need them. If Android really manages RAM well, I'm fine with 100% of it getting filled up. But then let Android allow me to choose which are my frequently needed/heavy apps. If Android was so intelligent to the extent of making that choice for me, those several faithfuls on this very forum - who've been using Android phones for more than a couple of years - won't have complained about facing glitches/lags/delays when starting new apps, or after leaving several apps unclosed for a few days. Good response to Jerry's very misguided article. "If you're not using it you're wasting it." is the dumbest thing I've ever heard. What if you need to start up a resource-heavy app like Maps, but your RAM is already full of crap you don't need? Quite often, Maps wiil take several minutes to start up, or cause my phone to hang indefinitely. (Samsung Galaxy S2). I often find my destination on my own, well before Maps was able to start up, at which point I rip out the battery, and restart the phone. However, Maps is far more likely to start up successfully, and runs much more smoothly, if I first kill all running tasks and clear the RAM... Clear evidance that Jerry is wrong. The good news is that I think I have found one of the main bloatware culprits: Facebook! The Settings->Battery usage graph was showing that Facebook was draining 30% of my battery each day, even though I never use it, and dont even have it logged in. Just doing a "Force stop" on Facebook did not make much difference, but once I uninstalled Facebook, it made a HUGE difference to my phone's overall performance. The Touch-wiz interface, and even Maps now scrolls smoothly, and Maps now starts up in well under a minute! And my Battery clearly lasts much longer too! Getting rid of Facebook was the best thing I could have done for my phone. Now, where can I find that great ZOMG Fast Task killer that Jerry was dissing? LOL, I think the verdict is this...If you have a phone with less than 500mb of RAM, Task Killers may have a short term benefit to you. Generally though, Task Killers are bad because at the least, they will force the phone to use more power each time you want to access a frequently used app. Sounds like Task Killers are like giving your phone Alzheimer's; loss of all short term memory. Have to put my two cents in. Whatever else these knowledgeable people know-I know this. Auto Memory Manager saved my life. I am on an Xperia mini 187ram I think. It was unbearable. I found this blog, and over a year I learned so much about which apps out there are system terrors. I also learned that its simply not true that RAM managers are useless. My experience is firmly otherwise. A good RAM manager can make even the most intractable phone, a joy to use. For anyone who knows the sheer frustration of a sticky system, try a good RAM manager. It doesn't hurt. I'm going to try going a few days without opening up my task killer, just to give your advice a try. Hopefully, it will be as you said, and I will rarely ever have to press that task killing button again. And, hopefully, it will also save battery. My biggest concern is the apps that open in the background that I've never even opened. Are there any knowledgeable "android enthusiasts" that can offer me information about those processes? I'm trying to get a new Android tablet this Black Friday. But that photo at the end of the article seriously scared me. I have a Palm Pixi Plus, and I get that message all too much. I think I actually heard the beep before looking down at my phone. :p don't bother ur self with android,believe me u will spend more time fixing it and trying to tweak tweak the system to get the damn device to give u at least a day of work without charging it every few hours and u will give ur self a headache trying to figure out what's causing a jam here and a lag there and why it keeps freezing on this app and on that other app and u will keep jumping on the internet every couple days to figure out how to solve the random reboots and u will jump on the internet again to find out why it gave u this error and that other error !basically u will spent all this wasted time to fix this,that and the other THAN ACTUALLY USING THE DAMN device !! trust me on this,wether u r a power user or NOT,u still want a device that last u at least a full day without having to charge it and u still want a device that will do the job without u having to worry about bad apps and good apps,without having to worry about ur super doper CPU which does fuck all anyway,and WITHOUT having to be here right now researching why ur phone is doing this or that or the other,trust me,get an ipad and save ur self all this headache and wasted time trying to get the damn thing to work,I know ppl r gona start talking about how limited ios is,and how thiefs apple r , bit the facts talk 4 them selfs : no matter how much ios isis accused of being limited,u will always find the app that serves u 99%OF THE TIME and the system is solid rock from head to toe. this is why apple rocks ! You may be shocked, but most people who use and like Android are doing all the tweaking, and fixing, and flashing custom ROMs, and this, and that mainly for fun and to satisfy the itch of making their device even better than it already is. Bottom line is that for a regular user there is no problem just using the damn device. :) Au contraire, the Apple way is for a user to accept the device exactly as it is, and assume the premise (I can't call it a fact, sorry) of this device being the best just because... because... heck, how could it not be, if Apple says so! :) It's a fundamental difference in mentality -- some people just would not accept a device, however good it is, without the ability to play with it in some ways they (not the manufacturer!) may want to. I have nothing against Apple products; everyone should be able to use whatever works for them. But Apple fanboys (sincerely, no offence to any and all normal, reasonable Apple users, which there are plenty) are the most brainwashed lot one can possibly imagine... :))) BTW, looking at your post, it seems like you type faster than you think. Try doing it the other way around, you might like it... :P Getting back on topic, this was a great article to read, and fun, too. Kudos to Jerry! I've read the whole article,and that's the bottom line and what it all comes down to : the user should never ever have to worry about these things,the user shouldn't even have any knowledge about these things,the truth and fact is : this is why apple has succeeded and this is why they will continue to succed until other OS makers start getting the idea that users shouldn't worry about any of this.a user wants a device that is power efficient and does the job,does what ever it claims that it can do without any problems,a user DOESN'T want a device that claims to do everything in the world but only does half the job. the bottom line is: only one manufacturer in the world (until now) has got it right, APPLE . BOTTOM LINE IS : APPLE ROCKS !! None of this holds true with my infuse. When the ram becomes high the phone becomes almost unuseable. I always must make sure the ram stays down in order to use the phone properly. The Gingerbread update does not help anything either. To be fair this article is well written and informative for the average joe. However it offers no details into how to tweak so that the built in memory management works the best and what not. This is what I really want to know. Read my whole comment to find out why. I currently use a samsung epic 4G. And I think android is a good OS. If I didn't I wouldn't still be using the epic I would have looked for something else or went with a frankendevice for webOS. It took me almost a year to figure/find out on my own what I needed to tweak so that my epic wasn't laggy and didn't have poor battery life. Both are tied to this built in memory management. Out of the box, with large RAM devices there are far too many active tasks things left in RAM from preinstalled apps, widgets, or services and 3rd party apps widgets, or services you don't use. But do use the apps they are part of. The result is bad battery life and laggy OS and apps. Both big negatives everyone complains about. Downside to this built in memory management is apps that are not currently the one on the screen end up appearing to be closed. Because switching back to an app you didn't "close" using the back button revert to a full or partial original state as if they had been closed. Requiring the user to take steps in the app to return to the state they left the app in. Another reason why information on how to best tweek the built in management should have been in this article. As this is a problem I'm still trying to solve. This is a problem I do not have using webOS. I bring this up as it's shown in negative light as reason why androids memory management thing is better. Everyone should keep in mind there was a bug that caused the too many cards error to occur prematurely and there has been a fix for a long time now. webOS is similar to a desktop OS as far as running apps. Every app that is open is really open and remains open until closed by the user. So they don't suffer from incorrectly remembered states of apps from being ripped from RAM at the expense of another running app or memory leak (all platforms have this problem). So if the too many cards message wasn't there users would wonder why their app didn't load just like when on a desktop OS you would get a similar message when there is no more memory left to open an app. App load time doesn't matter on an OS that works like webOS and desktop OSes if you leave frequently loaded apps open. After all most apps on these OSes are only consuming battery and CPU cycles when you are actively using them. Why should the OS dictate to me what apps are closed or left running? when I may need to use every app I just opened. And unless there is a way to tweek it so that the problem from the previous paragraph doesn't happen I will have to say that webOS and desktop OSes have it right in letting the user decide what to close or leave running. The Too Many Cards error was purged on 1.4.5 Pre's pretty well. Then the Pre2 came out... and TMC was back in force! Fortunately the 2.1 update seems to have mostly fixed it on my Pre2 - but now the proximity sensor is scrambled. (or maybe dropped one to many times). Informative material for the folks not keen on RAM management. Can there be a similar write-up for App Cache Memory? Can you explain the differences and why it's important? I have an HTC Incredible. Since the beginning I did a good job managing overall memory. It baffled me that every few months my phone would start wigging out saying "Device Memory Full, Remove Apps to Free Space" followed by constant FCs and random reboots. Checking the device memory always showed ample free space in all areas. Each time it happened I did a factory reset. Three times in HTC Sense Froyo and once in CM7 Gingerbread (reloaded rom). I was baffled why it kept happening. The folks at the Cyanogen Forum explained about the App Cache Memory. I discovered it is a designated area not always shown in memory stats. Apparently, certain apps like Facebook fill up the App Cache Memory and don't clear it. I started using a daily App Cache Cleaner to keep that area clear. So far I have not experienced the issue in 3-4 months. These apps show the status of the App Cache and what apps are using it up. Of course I am selective to which apps are cleared. As with the task killer I imagine clearing vital apps like widgets etc would screw things up. What is Android Central's take on App Cache Memory? There are a few things in this article that make no sense to me. While I understand the concepts of what is explained for the most part...I do not understand a few aspects. Why is it that there are apps that are running (whether running actively or a stored mem location) for applications that I have not ever launched and do not ever plan too. I have never used "Peep" and others in my life....but yet it consistently appears as a running process...depending upon which ROM I am running at time of course, Stock ROM included. So the point of it learning and loading this ahead of time, doesn't seem too make much sense, since these apps are never loaded and takes up my RAM...no matter how little it is. Additionally this also means it is taking up power, as little as it maybe as too. I also don't understand the unused RAM is wasted RAM? Perhaps this is because I am coming from a more Windows oriented background....why don't we always on PC's just fire up all of the programs we use on a daily basis....even if we aren't going to use them right away. I can tell you why....cause after having 25 chrome browsers and 15 windows programs, etc open....the PC starts to slow to a turtle's pace. It just doesn't make any sense to load this stuff when it is not being used. Let the CPU and RAM do its job of swapping the allocations. RAM is there so that you don't have to write to any type of swap space....not to be full of unused apps and then have the system abruptly manage the importance of the app and decide if it needs to kill a process or swap out what is needed. You have to remember, though, that these devices are running on a *very* different kind of hardware than your Windows PC. Not only is Android running on top of a heavily modified Linux system, the CPU and memory architectures are completely different. It's setup to run this way because it offers the most efficient battery consumption. On your home PC, if you launch Microsoft Word, the computer shows you the little hourglass (or blue circle if you're modern :) ) and the hard drive light flickers like crazy while Windows determines all the files that need to be loaded and does all it's calculations to determine the size of your screen and how big the tool bars should be and which icons you like to have available and reading your preferences file to know which document view you prefer and *then*, after all that, shows you the application. The idea in a mobile environment is that the RAM consumes far less power to hold data, so it's more memory efficient to keep the application there once we've done all that work so that next time you want to launch the app, we don't have to do it again. It's already there, which no battery consumed by loading it from the SDCard or using CPU power to figure out all the initial settings. Again, the way an Android device works is drastically different from a x86 architecture PC, and I think that's where a lot of people's confusion stems from. TL;DR - The way Android does it is more power efficient than the way Windows does it, and the hardware in an Android device is *designed* for it to work this way. Hardware on a Windows device is not. This makes more sense. But why does it choose to load many apps I never use. That seems like very poor management to me? And why does it not choose the correct apps to "pre-load" that I DO actually use? In response to the "unused RAM is wasted RAM" question, I'd like to point out that it is rare to have much free memory on linux systems or modern Windows systems (Vista and Win7) for exactly this reason. Here are two articles about modern Windows memory management that both use similar phrases to describe how (modern) desktop PCs do it. Note that the caching mechanism being described isn't the same as opening all the applications when you start the PC. Windows can free up memory used for caching at any time, but it's not going to kill an application you are "running", so filling your memory with cached applications is VERY different from filling it with "running" applications...wven if you aren't doing anything with them at the time. nice read i can say android has had much progress since i'm with a very low end device - htc tattoo. use to slow down like hell when i was on 1.6 with htc sense. for a year now i'm running a custom rom. now it's running with a 2.3.5 version of android and the phone is faster that 2.2, light years away from 1.6.... don't use task killers, if i ever need to kill something i just do it from the manage apps in the settings. there is a fast reboot app on the market - it also does a good job :) Sorry, cant say I dig this article because it leaves the most interessting points untouched. What makes the same device faster with more ram "free" than with less? And what about multitasking? First of, having free ram isnt useless because it isnt really free (for the most part). It is used as a filecache! My Galaxy S1 really gets slow and laggy when I got less than 40 - 50 MB free. Of cause, with everythin stock, this wont happen. The phone is simple killing apps before the amount of free memory gets so low that the phone lags. But thats either ideal because that kills off multitasking. You leave your browser and the open tabs reload when u reenter it. Or the (ill coded) game u left for checking your mail resets you to the main menu etc. The main fault for this lies by samsung for puting just ~340 MB of ram usable for the OS and apps in the Galaxy S1 phones. The S2 with its whopping 1 GB doesnt have that problem at all. Just leave the mim-free-settings at stock and stay away from taskkillers. But its wrong to say the problem is only in the head of the users. Many Mid- and Entry-Level smartphones still have the same problem, as well as some 2010 high-end devices! I don't understand how people read this article and still don't get it. "Well, I use a task killer and get a performance upgrade." "Well, I use a task killer and my phone stops messing up." It makes me giggle on the inside. That being said, excellent post Mr. Jerry. A couple of things I'd like to clarify or point out for those of you who are still misunderstanding the article. 1. From our dear OP: UNUSED RAM IS WASTED RAM. Period. 2. An extremely oversimplified hierarchy of a processor command sequence is as follows: Processor receives task X to do; processor searches all RAM for said program; processor searches all permanent storage for said program. Once found, if not in RAM, program X (or just the important stuff) is loaded into RAM. Processor accesses data from RAM. What this means is when you kill that task that is using all of that precious RAM.. you guessed it. Revert to number one. 3. Filled RAM does NOT use any battery life. If you have 1 million applications showing up as "running" on your task killer because they are all using RAM but no CPU usage, it will have no effect whatsoever on your battery. Killing them, however, will. Background applications that show up on task killers don't necessarily mean they are physically running. Remember, RAM has zero moving parts. The only thing that impacts battery performance in RAM is accessing it through a read/write command. @mpnalvin: no, you don't get it. But I'm glad you know you don't =) "When you kill an app, it doesn't create wasted space. Either Android or the Linux kernel it runs on will fill that space with something else." The phone performance you talk about by freeing up used RAM would have already been or could still be perfectly executed by the unused RAM at that point. Ergo, you ABSOLUTELY create wasted space. The only time you don't create wasted space by wiping RAM is if you use 100% of your RAM, 200% of the time. When you kill an app, most task killers wipe that application from all of our resources as if it were never ran. That includes the processor cache and RAM. Later that day, we open the same application. Our phone then has to repeat the exact same sequence it already did (#2 on the list). Not only does this unnecessarily kill the battery, it also makes the access time to that program slower the next time we open it. This doesn't even account for the battery usage for the app to be "killed". That RAM being temporarily used up for a non-running application will be filled with another application if needed anyways, you don't have to free it up for the system. So you are saying that there is an issue in that the app killers are overzealous. Well, that might well be -- it's one of the many things I don't know, and in fact I do plan to look into this and understand exactly how the app killers work. I want to know, for example, if what the app killer is different from what Android does when it kills an app, and if so, why. By the way, I am not one of those claiming any increased phone performance by freeing up RAM. My phone (Epic Touch) is capable enough that I doubt I could tell one way or the other. All I want to stop are backgrounded apps that eat my battery, in my case mostly through internet access. I would be very interested to understand how much battery is required to kill an app and reload it versus, say, how much you use for the screen or wireless. I suspect that killing apps and loading from flash to memory are very small loads, but I have no way to obtain data on that. I would much rather have a definite savings in battery from killing a backgrounded app that uses wireless, than a potential savings from reloading the app later. Perhaps so, but Exynos is still the faster package. Dual channels rarely make a lot of difference and wont compensate for the fact that the OMAP4 is just not that fast. Exynos is king until Kal-El is available. I'm really disappointed with this thread. Several people have brought up legitimate concerns and experiences, and instead of trying to answer them, the responses are "I don't believe you" "You're idiots!" "Thumbs down." So, what terrible, awful thing happens if you kill an app via an app killer? The only consequence I see in the article is that you might take a little longer (how much?) to load it back in the next time. That's it? That's the big deal -- loading from RAM instead of flash? For most apps, that delay is inconsequential. When you kill an app, it doesn't create wasted space. Either Android or the Linux kernel it runs on will fill that space with something else. So you are freeing resources for something else to run, or for data caching to make the phone run smoother. Fine, Android will take care of killing things if resources become too constrained. In the meantime, some of those backgrounded apps seem to be able to use internet access and eat up battery. The argument is that this is preferable to using a task killer that might cause a slight delay the next time I open the app? I don't get it. Based on my experience, I cannot trust Android apps to behave even if backgrounded. And I cannot trust Android to kill apps that are sucking battery. Could someone knowledgeable actually comment on this and not just tell me I'm an idiot for wanting to preserve my battery life? OBAMA is President of the united Sates, that does not mean he knows what he is doing, No offense hackbod, beafdefx its much much deeper rabbit hole that is being told here. and some ones position does not mean there beliefs are true. there is truth in both sides, and we all need to open up our ears and listen to each other, that way we all learn. from http://stackoverflow.com/questions/2298208/how-to-discover-memory-usage-... "" Note that memory usage on modern operating systems like Linux is an extremely complicated and difficult to understand area. In fact the chances of you actually correctly interpreting whatever numbers you get is extremely low. (Pretty much every time I look at memory usage numbers with other engineers, there is always a long discussion about what they actually mean that only results in a vague conclusion.)"" BOY IS THAT THE TRUTH ! While I largely agree with you, @odonlow, what @hackbod is trying to do here is educate everyone how the Android OS is *designed* to manager memory. You are correct, though: that is a very complicated process. That's why it has (and I'm sure *is*) been refined so much since Android's inception. The arguments to be made on the side of killing apps involve not trusting apps to shut down properly, and I agree with that statement. I guess my philosophy on it is that I uninstall apps I discover are eating a lot of juice. I think that, if running an automated task killer actually makes your phone more stable or improves your batter life, then you have an application that should be removed and down graded in the market for being poorly written. You can use System Panel to monitor an application's active CPU usage and Traffic Monitor to see how much data each app is sending/receiving to the net. Both are free in the Market. Except that is not how it works. When you use a task killer, you are just forcing Android to fill up the cache every time you kill your apps. This takes battery power and makes the phone more inefficient. In general, if an app killer is helping your battery it is because you have an app that is poorly written and causing the problem. Using an app killer to manage a poorly written app is throwing the baby out with the bathwater. You would be much better served by figuring out which app is the problem and uninstalling that and your app killer. Android is just the OS, it cannot tell if you (or the developer) intended an app to run in the background using up battery. Poorly written apps are not the fault of the OS and using a task killer rather than leaving poor ratings for bad apps is just magnifying the problem. I don't disagree with this at all. But I draw a different conclusion that you do. I assume the following: 1) There are badly written apps on the market that eat battery when backgrounded 2) It is not always easy to tell before installing that a given app falls into the battery-eating category. Maybe some versions of the app do and other don't. Maybe the key comment on this is comment #4000 out of 10000. 3) Even if an app does eat battery when backgrounded, it might be otherwise useful. It might be the only app available that fulfills some function, or it may be proprietary, or I might just like it apart from the battery-eating. In this case, I might not want to uninstall it. In this situation, it seems quite reasonable to run the app, then kill it. The information from hackbod agrees with my assessment that Android cannot at present tell that the app is behaving badly. The choices are uninstall it, or run it and kill it. Frankly, I can't believe that filling the cache is a huge battery drain. You're talking about a RAM-to-RAM copy. That should be one of the least energy and time-intensive functions on the phone. If that is killing my battery, I have way bigger problems. Even if it's flash-to-RAM, it's only doing the same thing as starting a new app would do. Do you believe that I should limit the number of apps I start to preserve battery life? So here's what I'm saying and what I'm not saying. I'm not saying "look how stupid Android is -- it can't even manage its own memory." I'm not attacking Android. I'm not suggesting that everyone should run some automated task killer that kills things every 10 minutes. All I'm saying is that while we're waiting for an app developer to find my comment about battery usage on Android market and fix their code, I might nevertheless want to use that app, and if I do, using a task killer seems like a legitimate short-term workaround. Trying to talk about this is difficult. This is not just because opinions are strongly held. It is also because memory and process management is complicated, and apparently on Android it is more complicated than most because it seems you have essentially two OS views of memory (Android and Linux) each with their own process and memory models. Finally, on the issue of whether badly written apps are the fault of the OS, it is easy to say "it's not Android's fault." But I think even this issue is more complicated than it appears. Would you agree, for example, that viruses are not Windows' fault? Windows does not contain apis designed to support viruses, but the way it was written made it an easy target. So even though Windows was certainly not designed to be a host for viruses, the design enabled them and Microsoft took it upon themselves to modify the OS to prevent them. Could Android do something to prevent poorly written apps? Could it do more to help users recognize battery-intensive apps either in the market or as they are running? I don't know. But I do know that if I were working on Android, it's something I would be thinking about. when i reboot my nexus s,the facebook app is always on the Running app section on Manage App even if i didnt open the app already.Does it means it was running and consume battery?Is it better to kill the app that you are not frequently use? Running does not mean consuming power, it means the app is consuming RAM because it has said it needs to be kept around because it *may* need to do something and hasn't otherwise set up anything to have the system take care of launching it. To take Facebook as an example, it may have a network connection being kept open all of the time to Facebook's servers, so that any time the server detects something that may be of interest to you it can immediately send that down to the app. Sitting there with the network connection open (mostly) doesn't take any battery power; battery will only be consumed when there is actual data activity on the connection. Still, RAM is often a precious resource, and one really doesn't want 10 apps all sitting there with continually open network sockets. (Partly because in fact they do take a *little* power, because there does need to be some occasional data going through it to keep the connection alive. One won't be noticeable, but 10x that will start to be.) Android has a number of facilities to allow applications to avoid this. A common one is to use the alarm manager to have the app wake up at a regular interval to check in with a server. You will often see this with for example e-mail apps, where you set them to update every 15 minutes or so. Note though that this actually can be more expensive on the battery than keeping a network connection open -- launching the app and establishing a network connection does take power, so doing this too often will causing a noticeable drain on your battery. That is why we recommend that apps don't do this kind of polling more than every 15 minutes. Another solution is Google's "Cloud to Device Messaging" service. Google's own apps do need to keep a constant network connection open to Google's servers. This single connection is shared across all of Google's apps, from tickling gmail to tell it there are new messages it should fetch, to poking Market to have it install an app you have selected on the web site. Google provides an API for this constant connection so that other developers can also make use of it. They can register with Google's application that maintains this connection, to have it wake up their app if data appears on it for that app. Then in their server they can connect with Google's server to have it send a tickle to a particular app on a particular phone, to have it wake up and do whatever is needed -- check for mail, get a status update, etc. I don't understand why apps like Facebook & Skype continue to use RAM when I've turned off all auto refreshes and notifications. The reason I like to keep my RAM clear is because when it gets full, my app menu (stock Nexus) takes forever to load (does this mean it is getting kicked out?). Just like Jerry said in the article, if you use the Facebook app a lot, Android has decided that it's advantageous to leave it cached in memory so that it can be accessed quickly. Your RAM should never really get "Full" unless you've got a badly written app that is allocating RAM and not properly releasing it when it's done. The OS has a "minimum available RAM" threshold, and when that is hit, it will unload those cached applications to make more room. Although I personally have noticed a big difference in battery performance between having the Facebook app's notifications turned off, If you've got them disabled, it should not be using battery just sitting in memory. Check how often the Accuweather app is updating. Some of those weather apps like to update like every 15 minutes and that can affect battery life. I never actually see "Full", what I notice is that things start to get a little slow as Android "unloads" old processes to "load" things I'm trying to open (ie. App drawer). Since moving to GPA17 (from Stock), I've noticed this happening less often. Here is a little information (from Android's App Manager) All of these show up under Running Processes, NOT Cached Processes. I had a Best Buy rep argue about this with me when I picked up my TBolt. Never mind the fact that this is my 4th Android phone, nor the fact that I had been using the platform for more than two years at that point. She told me it was ABSOLUTELY MANDATORY that I install a task killer first thing. I tried to talk some sense into her, and even told her that her advice was actually more harmful than good, but she refused to listen. I really wish the sales reps were a little more well versed with this. Thank you for telling the world the truth. Great write up Jerry. I think people coming from a BlackBerry are more prone to installing and using task killers. Having helped a great many people get accustomed to their new Android devices, one of the first questions former BB users ask is, how do I close apps? I think most Verizon reps would rather just install ATK than explain what you have in this post. Thank you. I cringed the other day when a friend sent me a link to a ZDNet article listing the top 20 Android apps of 2011, and Advanced Task Killer was #2. Here's the author's blurb about ATK: "One of the realities of having a multitasking mobile OS is that you have to manage your apps so that they don’t hurt performance or battery life. Advanced Task Killer (ATK) is my favorite on Android. It even comes with a widget that you can tap once to kill all open apps and you can also set up ATK to kill all apps at periodic intervals. Some people will argue that task managers are irrelevant and unneeded in Android, but I still prefer to use ATK." Ugh! One of the realities of having a multitasking mobile OS is that there will always be idiots out there claiming that the users has to do the work that the OS is already designed to do. Well I'm new enough to Android that the last graphic was well over my head. It makes sense, although my understanding of RAM is coming from Windows (XP and more recently Win7). Thanks for clearing things up. When my contract is up I'm getting into Android. Thanks for clearing things up. I guess I need to do some research into a Task Killer vs. a Task Manager. Thanks for the write-up. I look forward to more of these superb and informative articles They're pretty much the same thing. Generally, though, when someone refers to a "Task Killer", they're talking about something that's automatically killing off memory-resident tasks on some kind of schedule. This will usually cause all kinds of flakiness with the phone since they often kill of important system tasks. Say what you want, RAM does matter, I have found going from the 512MB Samsung Infuse to the 1024MB Epic Touch. The Infuse would run put of memory and reset or threaten to reset (freeze for long moments) regularly. Playing Chuzzle, whenever my Newsreader would fire off to update my feeds the phone would vibrate and if I didn't exit Chuzzle right away the phone would eventually freeze or reset. Having the exact same combination of apps running on the Epic and it hasn't happened yet. I suspect the OS was struggling to fulfill the memory requests of both programs and the other background and OS memory needs and starting spitting up. We can point fingers at one or the other of the programs all we want, but I want to run both of them at the same time and don't want the hardware to constrain me. This isn't the only time thie would happen, but the most recreatable. I think it would be accurate to say their is a sweet spot for RAM and after a certain amount it's wasted. But, the more RAM installed, the programs can remain resident and the faster they will launch. That sweet spot might ave been 512m in the past, but I think it definitely is 1GB now, and as programs and systems needs grow more complicated in the future, we will want more in our future devices. Remember the "nobody will ever need more than 640kb" quote attributed to Bill Gates? Well it is about as true in Android as it was for MS based systems. I agree that allowing task killers to automatically kill programs isn't a necessary, but there are still time where killing a running program are necessary, especially on phones with limited RAM installs and that my friends is why memory still matters. You're probably spot-on here, but you're missing the point of the article. Jerry's not saying the devices shouldn't have more RAM. I don't think anyone's saying that. He's saying that running some kind of a automated task killer that arbitrarily kills off everything in memory every 15 minutes does not make the phone faster or more battery efficient. It sounds like the problem you're having is exactly what you said: Chuzzle and your news reader probably both take up a huge amount of RAM and the system has difficulty coping. Android can kill off applications in memory that aren't active, but if you're actively trying to run multiple applications at the same time that require more memory than the phone has to give, nothing can help you there. Check and make sure you don't have something like Gun Bros or Wave Launcher running as a service and consider uninstalling them if you do. Try and free of memory that way. Might help... I don't know ... it sounds to me like you're confusing backgrounded processes with memory caching. At the OS level, these are quite different. Say you load an app. That app will become a process, but in addition, the pages you read from "disk" will be cached. If you close that app and then load it again, the kernel will first look in the cache, so the hit you take on opening the app is not that big. The difference between a backgrounded app and disk pages for an app in the cache is that an app in the cache is not running. It is not in the background chewing up battery life (an issue I consider just as important as ram). For example, I downloaded an airline app a couple of nights ago, planning for a trip. After doing some playing, I backgrounded it and went to bed. When I got up the next morning, I was surprised to see a big chunk of battery life gone versus normal. Android obviously didn't kill that app. It let it go on accessing the internet periodically, and eating up battery. Now let's say I still want to use the app. What is the alternative to killing it afterwards? When process killing was introduced in Linux, it was not portrayed as "hey, Linux will take care of all your processes for you." On the contrary, it was more like "well, if there's no other option, we'll keep the system going by killing something." When Android kills a process, it does a hard kill. The app has no opportunity to save work, so if you were in the middle of something then backgrounded it to do something else, you might just lose all your work. All this "Android managing your applications" stuff sounds like marketing to me. The truth as I understand it is that on a Linux kernel, the kernel will kill apps if it runs out of memory. Android has no say in the matter. It sits on top of Linux and uses Linux memory management. I've read through this article and the one posted by Milo from a Google engineer. Battery life is never addressed. Until it is, I still think there is a place for task killers. Android doesn't work like a normal Linux system in this regard. It effectively treats background processes as a cache of available RAM. The system is designed so that any processes in the background are safe to kill at any time. When Android needs more memory, it can freely hard kill any of those processes to get it. In fact there is a kernel module Android adds to Linux that does just this as part of the kernel's core memory management. This runs instead of the Linux kernel's normal out-of-memory handler, which just doesn't operate the way Android wants. The stock Linux version is really a last resort "OMG there is no RAM I've gotta get rid of something, anything, NOW" thing. Android has a much more managed approach, where it keeps processes in various well defined states indicating which processes can be safely killed, and strict ordering in how decisions are made about which to kill. There are numerous ways that a poorly written application can drain your battery, and this doesn't have to involve it just doing stuff while it is in the background. For example, it can set up an alarm that repeats very often to cause it to wake up the device and briefly run (in the foreground). Hopefully the battery usage UI will identify such apps for you, so you can get rid of them and give them a low ranking in Market. It isn't possible to force developers to write good apps, but we do want to give users enough information to know when apps are not working well so they can deal with them. Excellent! This is much more in the ballpark of what I was looking for. I appreciate you taking the time to answer. I would like to know more about how Android process and memory management interacts with Linux process and memory management at an OS level. The docs I've found (including the one you posted) seem aimed more at developers, which is understandable. However this is probably not the right place to ask. Maybe I'll just have to dig into the AOSP code. The procedure of ranking misbehaving apps in the Market is OK, I suppose, but I wish there were something better. For example, how about a system notification that says "hey, when you weren't using your phone, app X consumed a lot of battery power doing internet. Is that OK with you?" I believe you do have an API for detecting the power situation, and obviously you do keep statistics on what apps use the battery. The biggest problem for me as a user is that I don't want to have to play nanny to every app I install, checking to see if it is doing something bad, or has installed a service that is doing something bad. I would LIKE to trust Android to manage things. It would help if Android gave me more feedback, essentially automating the process you described above of using the battery UI. Check out System Panel in the Market. For $3, you can get the Pro version that will give you historical readings on CPU activity and battery drain going back up to one week. That way, if you notice your batter took a big hit, you can fire up System Panel and see which apps have been using a lot of CPU time. What you suggest would be nice. Maybe they'll get it in someday, but that's what I use for now. The problem here is that somehow Android has to know when an application is doing something that you think is bad vs. when it isn't, or else it will be bugging you all of the time about things you don't care about. And not only would doing this require that it be able to identify a bad app from a good app (something that in most cases is impossible), it also actually has to identify apps that are doing things an individual user wants vs. what they don't. I guess you could imagine a UI where it tells you about what is going on, and lets you say "oh I am fine with this" so it won't tell you about it any more (unless the app starts behaving differently in some way, in which case it will need to nag you again). For most users, I think this would be a terrible experience -- they just wants something that works and being told about things that they not only don't understand but are now being asked to make some judgement on is a nightmare. If you are an advanced user who does care about this stuff, feel free to go into the battery usage and running services UI to see what is going on, which will give you all the information the platform has. (Oh and btw the Running Services UI in Gingerbread is greatly improved from earlier releases.) Great writeup as always, Jerry. Like most of us, I am forced to having to use trial and error for the most part to solve problems on my Droid X. I had almost succumbed to using a memory management app to cure the spontaneous reboots every 3 days, or so, which seemed to correlate to the diminishing available internal memory. At that point, I replaced the DX for a non-related mechanical problem, and to my surprise, the reboots are gone, even after 2 weeks, and available memory sometimes in the teen MB's. The long and short of it is that I'm back in the fold, and letting Android do its memory management. RAM for your PC is cheap. RAM designed to fit inside such a small device and generate very little heat is not quite so cheap. Then, of course, there's always a limit to just how much space they have inside the thing. It's not magic :) I have a CDMA Desire running.. CM7.. don't know if I flash it correctly with the latest stable mod, but something might not be right with the partition... I have plenty of RAM I see currently 113MB used and 240 Free... but the Internal Storage is what is the problem, I only have 23MB left... I am constantly having to clear Cache and clearing Data on apps, cause I get that annoying... Low Storage Space warning... What am I doing wrong... I moved all the apps I can move to the SD card, what is left are Widgets and System Apps... And there are a lot more Apps I want such as Google Earth that simply won't fit... If CM7 supports A2SD, you can create an ext3/ext4 on your SD. This is like the apps2SD feature of Android since Froyo, but a bit different. The partition will exclusively be used by your system to install apps. It will use it automatically. You don't have to manually move your apps to the secure SD folder and it works for all apps - even those not designed to be installed on the SD. It's like an extension of your phone's internal memory. I use A2SD on my Nexus One running MIUI. Nexus One has a very limited internal memory - about 150-ish MB usable, which is just not enough. But with A2SD (I partitioned 1GB of ext4), I don't get the low mem notification anymore. Solid-state refers to the physical makeup of the RAM (e.g. silicon circuits instead of a platter and head) and not to it's persistence. Solid-state devices consist of circuits and have no moving parts. Jerry's use was correct. @galfert is correct, since their is no such thing as platter-based Random Access Memory. Solid-State "Memory" or "Storage" is a correct term (even if Memory is a bit misleading in that usage), but Solid-State RAM is a misnomer. All RAM is inherently solid-state. I knew it sounded awkward. So thank you TenshiNo for clearing it up. Technically RAM is solid-state but it is a misnomer I agree. It is like saying "I'd like some French Champagne." Now I know that there are wine makers that label their stuff Champagne rather than sparkling wine but that doesn't make it right. If you know then you know. Solid-state refers to the physical makeup of the RAM (e.g. silicon circuits instead of a platter and head) and not to it's persistence. Solid-state devices consist of circuits and have no moving parts. Jerry's use was correct. In my experience, free RAM *DOES* matter... but not in the way the article states. I do agree that a task killers should only be used to shut down misbehaving apps (and with Gingerbread, you can simply use the Running tab instead of an application) The problem that I've encountered on my Nexus One is that there can be too many things trying to stay resident -- mostly customizations like WaveLauncher, Go Launcher EX, etc. All of these fight to stay in memory. What happens is that Android tries to squeeze all of these things into RAM ... PLUS the active application. If the application requests more RAM suddenly, Android OS has to stop to shut down other applications. This usually happens fairly quickly, but does introduce some noticeable stutter on occasion. HOWEVER, this may happen regularly depending on what's happening with the app. For example, I got Dungeon Hunters from Gameloft's Labour Day weekend giveaway. Whenever I summoned a creature (mage skill) it noticeably chops up. It did this every time I summon it (which is frequent, as it's your "tank"). I uninstalled Smart Taskbar which freed up ~20MB RAM. It now only chops up the first time per level I summon it, instead of all the time. I believe what's happening is that when DH is requesting RAM for the summoned creature, Android garbage collects parts or all of an resident app, then reloading (parts of) other applications when the creature dies (and RAM is freed). It then happens every time. And yes, I have experienced a couple reboots while playing DH before I removed Smart Taskbar. The RAM situation may have contributed to it. Thanks for the info on this. I was curious if anyone out there experienced these type of reboots before. My biggest reboot culprit is when I'm using google maps. I use it fairly often and sometimes while navigating I'll get an abrupt reboot. Sometimes i get 2 abrupt reboots and then I say something is wrong. It quite awhile for me to figure this out. I first downloaded a task killer when I noticed Sprint Nav had been running on my Evo for 3 hours still tracking my GPS even though I had reached my destination. I use it almost never now though and only for apps I know I will not be using soon, are not system related, or I fear my be poorly coded or using resources. The thing that made me and many of my family want to kill tasks is when we would see demo crapware (blockbuster on sprint) constantly showing up even though we had never ever used the app and never wanted to. That was when I began loosing faith in the systems ability to kill apps and wanted a level of control myself. Carriers are loading up too much crap we never use and having it auto run even though we have never used it. IT'S THEIR FAULT FOR THE TASK KILLER OBSESSION That was very very well explained.. Even this electric lineman/ android noooooob pretty much understood it.. Thank you.. When I first got my TB & realized how bad the battery was, I went to verizon to find out what I could do to make it last longer.. They turned everything off, all animations & what ever else but most importantly they put a big ole task killer on it & said... Make sure you use this after you use anything on your phone.. Apps, games, radio.. Everything.. I noticed that my battery that was lasting only 6 hours was now lasting 4.. So I went back to verizon being the noob I am and said my battery is worse.. Oh now its my charge port.. So Yup they sent me a promised new phone but I got a LIKE NEW one instead.. Well I was not happy.. Long story short. I googled android phones.. Went thru about 10 different sites until I found android central(not a joke).. I started reading & reading.. 1st thing I did.. DELETE THE TASK KILLER.. Phone was lasting 6 ish hours again.. Got an extended battery & followed some other advice I read.. Now my phone lasts 24 hours.. Usually.. I will never root Cuz I will destroy my phone.. So I have to do the basics. Anyway again.. Thanks for all the good advice & explaining things to an android idiot... I think alot of people's paranoia come from not knowing if apps that are running and using RAM are using battery. For example if it didn't matter if blockbuster city id and v-cast were taking up RAM then how come we notice such an improvement in battery life when we remove or freeze it from our phone? I myself no longer use atk because I understand the value of having apps run off of RAM that are frequently used. When I did have atk all of the processes that would restart such as gmail text messaging or bloatware I would have on my ignore list. But I still am confused as to why I would receive better battery life with bloatware removed if it really doesn't matter if its running off of RAM. Probably because those apps were "pinging" back to some internet server. Try an app called "System Panel" in the market. I like it because it will actually show you what state loaded app are in, like Background, Visible or Service. If an application is running as a service, that means that it is periodically doing some kind of work. Many of the free games like Gun Bros actually do this, and you will periodically get notifications about "Double XP Weekend!" or some such. Things like this will cause slightly more battery drain, since it's basically pinging the 'net every X number of a minutes to see if it should give you that message. Also, we have to face the fact that much of the bloatware that the carriers place on these phones is not always the highest of quality code. I heard that if you run out of ram your system could abrubtly reboot. Can canyone confirm/deny this? My OG Droid does this from time to time. I checked out running processes and ive elminated some of these apps and/or widgets. My phone is dreadfully slow from time to time. I did install a task killing program to keep things from popping up into memory from time to time (Google+, Google Googles). Yes I do use these but I use them when I want to use them. I dont need notifications to tell me certain things (I do disable notifications) but even after a reboot these program come and lurk into memory. So I have to restort to this until I get a replacement phone w/ more than 168Meg of useable memory. Any thoughts on this? The system is designed to automatically "pull" applications that haven't been used in a while out of memory when the system reaches a certain threshold of available RAM.You shouldn't experience a reboot because the system ran out of memory. The only times you should really experience problems with "running out of" memory is if you have a rogue app that's eating up a ton of memory and not releasing it properly. Like Jerry said in the article, you use significantly less power "holding" an application in memory than you do loading it from scratch off the SDCard. I'm sure most people have Android phones that have 384MB of RAM or less, which means these apps are still useful for most. I found some apps I infrequently used would not close once I stopped using them. Photon's task manager helps with these apps. It seems to help. If you want to cry myth, do it. But I own a Samsung Fascinate and left the stock Task Manager on it. You know why? Because my phone locks up so bad it becomes unusable until I KILL ALL APPS IN TASK MANAGER. Now I am not a genius and know much less than probably you, but whether it is a Ram allocation problem or application conflicts or whatever, THE TASK MANAGER FIXES MY PROBLEMS EVERY TIME. To make a blanket statement saying that all task managers are unusable is stupid. What arrogant journalism. Sounds like you have one (or a few) apps that are misbehaving. Instead of killing all of them, try killing them one a a time and see if you can isolate whats causing the problem. If this is the case, then you aren't right to generalize from "useful for fixing my problems" to "useful for most". It may well be right even if this isn't the case. My G1 needed a task killer running Andriod 1.x. Running unofficial builds of 2.x (admittedly heavily tweaked) it ran fine without one. The myth is not that everyone *needs* a task killer, but that *everyone* needs a task killer. That's not true - or at least, not with modern versions of Android on modern phones. There may be people running poorly written apps, or unusual mixes of apps, that need a task killer. However, a poorly written task killer is more likely to cause problems than other applications, and task killers are much harder to write well than most application. For instance, my Droid 3 runs *better* without Motorola's task killer than it did with it. The task used more memory than it saved. All it ever did was interrupt my music players and book readers if I used them for long periods of time - which was a common thing for me to do! Bottom line - don't install a task killer because someone tells you you need one. If your phone starts misbehaving, try one and see if that fixes the problems. You can stop there, or you might try and figure out what is causing the problems, and decide if it's worth putting up with having a task killer and whatever problems that may cause to keep using. I bet you if you kill just one app at a time, you'll soon find the app that's messing with your phone. It's not "ALL APPS" that need to be killed. You just have to find the wrong one you installed that isn't, for whatever reason, playing nice with your phone. These things sometimes happen, can't really help it. Once you find it, uninstall it and see how things go from there. I think you'll be much happier :-) As of Android 2.2 (Froyo), task killers can not do anything that the platform itself does when it needs more RAM. That is, kill processes that are already in the background and in a state where they are safe to kill. You're missing the point a bit, I think. No one is saying that task managers in and of themselves are bad. It's the ones that automatically kill of tasks that cause the real problems. The task manager that Samsung put on the phone by default is (hopefully) smart enough not to try and kill off important system processes. I would say that if you repeatedly have this problem, you might try and track it down to a specific application that is not probably "sleeping" when it's placed in a background state. I have come across a few of these in the Market. One task manager I really like is called System Panel, since it will actually show you all the active tasks in memory and even show you the amount of CPU being used per task, in addition or a master CPU usage graph. The paid version will even let you track CPU/Memory usage and battery consumption over time, which can really help track down apps that are not sleeping properly. The concern here is to not over use task managers like a shotgun solution in a "kill everything" method. You *shouldn't* have to. I'd be willing to bet if you tracked down the real cause of your problems, not only would your battery life improve, but you'd spend less time having to get into task manager and hit the "Kill All" button :) MOST may have loads of memory but the old My touch 3g has 96MG and a task killer made that device run just fine, great even ! The Idea that killing the MAIL application will make you stop receiving Email is WRONG, and saying that , shows us you don't us or understand Linux at all, services will just restart, obviously you never tried it ! your point, tho , that Task killers are less needed is good for devices that have more memory, however some applications ARE poorly written, and killing them can avoid a reboot! So to all of you " BLUE MEANIES " that just have to 'declare all task killers for any reason are evil', stop it, your dead wrong ! Task Killers are just another tool, in the tool chest. not the end all of all tools, but useful sometimes. MOST may have loads of memory but the old My touch 3g has 96MG and a task killer made that device run just fine, great even ! The Idea that killing the MAIL application will make you stop receiving Email is WRONG, and saying that , shows us you don't us or understand Linux at all, services will just restart, obviously you never tried it ! your point, tho , that Task killers are less needed is good for devices that have more memory, however some applications ARE poorly written, and killing them can avoid a reboot! So to all of you " BLUE MEANIES " that just have to 'declare all task killers for any reason are evil', stop it, your dead wrong ! Task Killers are just another tool, in the tool chest. not the end all of all tools, but useful sometimes. Most people? I'd be surprised if that was true. Even phones that are 18+ months old were released with 512mb RAM. I'd say 512mb is the majority, with most phones in the last year being 768mb to 1gb. I realize a task killer may be beneficial to some in this case if they do have a really old phone with ~384mb RAM, but the problem is blatant misuse/lack of education with the task killer. It may speed up their phone in some spaces, but overall its hurting their experience constantly purging all the processes in RAM. The problem is that so many Android fans in the days of old, who cut their teeth on android 1.2 have grown up and take jobs at mall kiosks selling Android phones. They wear Id cards, wear ties, say Yes Sir, and continue to spout gratuitous nonsense about task killers. They will often install one for anyone that buys from them without even asking. They pontificate and sound all knowledgeable and serious. And they are universally wrong. Its our Duty to our fellow Android enthusiast to brow beat these clowns into submission. Grab them by the wattles and slap them till they spit if you have to, but don't let them install task killers on customer's phones. you know i'm a fellow android enthusiast as well and i'm an agent for us cellular but i dont go around putting task killers or recommend them either..i always have to uninstall them for customers because they come in crying about there phone acting weird and i look and there running task killers...as an agent from us cellular all my employees know not to interfere with any task because of the way android was design to manage itself...i know plenty enough around android so i would appreciate that next time dont just say we all do that when we really dont. thanks a-hole. You sound like the type of customer that I hate helping. I work for att and I hate when people come in the store with the know it all attitude trying to belittle the reps. To my knowledge none of my reps use a task killer and have warned custs about using them. So to say we are all wrong is ignorant. And your rally cry against mobility reps really makes you sound like a dick head. Grow up little man maybe you don't but the majority of reps do not and I know from experience....and I hate reps that think they know everything when they don't....their like vultures in cell phone stores just leave me alone you do not know as much as most of us that freguent sites like this...I'm a informed customer and don't need the reps telling me things I've known for years I as an "Android enthusiast" do not plan to 'brow beat' anyone. If I go in to a store and notice they are recommending a task killer I would talk to them and ask them why. After hearing their explanation I would tell them what I know about Android RAM and tasks. Informing them in a constructive way. Approaching it this way will go a lot further then acting like an ass. OK, guys. He might have been a little mellow-dramatic in his wording, but he has at least a little bit of a point here. When I bought my Evo4G last year, the Sprint rep did exactly what @icebike is talking about. He activated the phone and then immediately installed ATK and set it to "Aggressively" auto-kill applications. Luckily, I knew better and had it uninstalled before I got to the car. I even had another rep try to re-install it when I brought the phone in with concerns about WiMax connectivity. We realize that not *every* rep out there does this, but many do. I have had about 8 friends get Android phones in the past few months and almost all of them were running ATK or something similar. When I asked them about it, they all said "I don't know. The cell phone guy put that on there." It *is* happening. And while I don't agree that we need to beat anyone up over it (I'm hoping he was just exaggerating to make a point), we should point out to these people why it's a bad idea. There are still self-proclaimed Android gurus out there extolling the virtues of automated task killers. 2. Android is not doing a good enough job managing memory on higher RAM devices. #1 is pretty much self-explanatory, but #2 is where an explanation is probably needed. Oh, and for the purposes of the discussion below, "RAM" and "memory" mean the same thing. The fact is, on ANY operating system, the thing that is going to give you your biggest "bang for your buck" performance increase is a RAM upgrade (up to the OS's point of drastically diminishing returns). Now, I don't mean to a faster rated RAM (you'd be lucky to see a benchmarked increase of 5%, which is practically unnoticeable in the real world), but rather MORE RAM (i.e. going from 2GB to 4GB or even 4GB to 8GB). This is because with more memory, you don't have to swap the apps out of RAM to disk, or "permanent storage" if you prefer (hard drives are on the order of 3 orders of magnitude slower than RAM and flash storage is on the order of 1-2 orders of magnitude slower, with an order of magnitude being 10 to the power of (order of magnitude)). Android is (NOW) great at managing memory for RAM constrained devices. However, the number one problem that high-end app programmers have to deal with right now is heap memory size allocation. This is a problem because... (a) large, complex, and powerful programs, like games, for example, require a lot of RAM BECAUSE of the size of the data sets they are dealing with, the actual program code is a small fraction of the size of the data sets and, (b) no matter how much RAM a device may have (there was a dual boot tablet demo'd/announced for Windows/Android with 2GB RAM back in March, http://www.androidcentral.com/dual-booting-android-windows-7-viewpad-10-... ) Android will not increase the amount of heap RAM allocated to programs, (there is not even a mechanism for the developer to REQUEST a larger allocation, unless the device is rooted, which MOST aren't). To add insult to injury, a developer can't just start multiple instances of apps and transfer data between them IN RAM (swapping to flash storage defeats the purpose because it is so slow and it is why you want to keep everything in RAM in the first place) because one of the greatest protections of the Java based Android is the sandbox that the OS creates for each running app so they won't crash each other and/or so a malicious app cannot do any damage to other running apps or the OS. OK, this last is both good and bad, but in the context I'm writing it, it is a negative to creating more powerful apps. So, let's say you want to port your favorite game from the PC to Android. You have a game that only runs well in 8GB RAM with a high-end graphics card to take care of the current state-of-the-art graphics and physics engines. However, when you move to an Android device with about 512MB RAM per core (the current state of the art for single and dual core processors) AND you have to deal with the program memory allocation issue, it becomes practically impossible. OK, there ARE a couple pretty good games on Android now... good compared to portable game players (and a testament to the genius of their programmers). However, will not even be in the same ball park as PC games in realistic graphics, physics, game play, etc. until AT LEAST the memory issue is resolved. Now you might say, let's just develop in Adobe Flash's upcoming 3D version (Flash 12?). The problem is that because Flash is a (manageable) memory hog on the PC, it becomes a nightmare for complex stuff on Android. The bottom line is that RAM is cheaper and provides a bigger bang for the buck than CPU power, but CPU is sexier. For example, with Windows XP, the minimum requirements were 256MB RAM, with 512MB-1GB recommended. However, to get the best performance, you really needed a minimum of 2GB to get to the 90+% of the RAM based performance improvement. With Vista the min was 1GB, with 2GB recommended, with 4GB to get to the 90+% mark. With Win7, the specs are supposed to be the same, but really you want 6-8GB to get to the 90+% point. (90+% being my arbitrary point of drastically diminishing returns (for every day users, not hardcore gamers). While Linux will run at a given performance level with about 1/2 the RAM of Windows, it still benefits approximately the same with increases in RAM. So, even if your device had double or even quadruple the memory it currently has, you wouldn't be able to run more POWERFUL programs. The device would appear snappier because more DIFFERENT programs could be run at the same time, avoiding loading/unloading programs all the time, but not more powerful programs. PS. Ok, this is a pet peeve of mine, but can we PLEASE stop calling hard disks and flash storage "memory"?!? Hard disks and flash storage should be referred to as either "disk" or "permanent storage" to avoid confusion. (2) The memory allocation limit only applies to the Dalvik heap; most games are written in native code (because they build on C++ cross-platform game engines), so have never had such a constraint. (This does mean such apps need to take a lot more care in their memory management.... but that's native code for you.) (3) An application can certainly run itself in multiple processes if it wants to, and each of these has its own Dalvik VM with its own heap and its own limit. I don't know why you are going in the direction of actually having multiple applications to do this, that doesn't really make sense. Regarding #1 above, not all versions/manufacturer/carrier releases of Android support all of these features. If you want to support a wide variety of devices, your choices are more limited. In addition, even if you use native code, you still need to deal with Android garbage collection on the non-native code apps. The garbage collection is very aggressive and repetitive (meaning it will collect the stop for a bit, then collect again) and each time it collects memory, there will be a lag in the system as all other activities appear to wait while garbage collection is happening. BTW, the getLargeMemoryClass () the link pointed me to just reinforces my point. I really don't get where you are coming from here as the discussion is about RAM constrained devices (pretty much all of the Android devices right now). Regarding #2 above, even with native code you are still limited to how much memory you can use because of garbage collection issues (as mentioned above). Because of this, MORE RAM IS BETTER! Regarding #3 above, yes, you CAN run an app in multiple processes, as I stated in my original post, but they cannot communicate (send data back and forth) with each other IN RAM. This is problematic if you have large data sets and are having to dump the data to flash storage (regardless of its speed (and file system), based on the current flash used in these devices) and pull it back again to process in another thread. If you can't figure out why running multiple processes is better than running a single process, especially on multi-core CPU's, then I can't help you there. Regarding #4 above, I really don't see what is so complicated about what I've said. A single core Android device typically has 512MB of RAM. All of the dual core devices have 1GB of RAM. 1 core times 512MB = 512MB RAM. 2 cores times 512MB = 1GB RAM. As you said, "WTF?" The bottom line is more RAM/memory the better for creating truly powerful apps, especially if you want to have apps that can truly take advantage of the current and forthcoming powerful CPU's that these Android devices will have in the next 6-12 months (and beyond). Frankly, I'd like to see double the RAM that is being put into the devices (i.e. 1GB per core, I'll let you do the math.) While you are partially correct in some of your comments about adding more RAM providing performance boost, I'm not sure that you understand the concepts of coding for a "mobile" device. Firstly, adding more RAM is not quite as trivial as you make it sound, since these devices are substantially smaller than your average desktop PC and have limits to how many chips they can cram in there, and even tighter limits to how much heat they can generate. Event RAM will generate heat, and a small form-factor device like a cell phone doesn't have an active cooling system, so heat must be carefully balanced to performance. The only changes you should see to the API, especially code written in C++ using the NDK, is between different versions of Android. I'm not of aware of any hardware manufacturer or carrier (past or present) "removing" features from the Android API. They wouldn't it would mean their device would run the risk of being incompatible with many applications out there and open the company up for a ton of flak from the community. I'm also completely at a loss as to why you believe the garbage collector in some way limits how much RAM an application written using the native runtime has access to. The garbage collector's job is simply to free up memory that is no longer in active use. And that's mostly for the higher-level, managed runtimes. If the garbage collector is "killing" off blocks of memory while the app is still running (and still using those memory blocks), then you have coded something incorrectly. Perhaps you've let a pointer or variable reference fall out of scope? You mentioned in your original post that it would be impossible to port "larger" games over to Android and that is also simply not true. Check out nVidia's latest Kal El demo on YouTube and you'll see them running Lost Planet 2 (Xbox360) on their prototype Tegra 3 device. The video even shows them playing the game at full frame rate (which makes me drool a little every time I watch it). I understand where you're coming from, wanting to see more memory be included on these devices. I'm sure we all would. That's why many of us on here spend countless hours drooling over specs and fantasizing about upcoming devices. That said, however, it's not just a matter of "put more RAM in there". Hardware manufacturers are limited in terms of what I said before: size and heat. Cost plays a tiny factor as well, since RAM chips this small and heat efficient are more expensive than the RAM sticks you buy at Fry's or Circuit City or where ever and drop in your PC at home. Really, you want to pull system design specifics into this generalize discussion of whether more RAM is good or not? :) OK, the heat generated by RAM is inconsequential compared to that generated by the CPU and battery (as it is charged and discharged). The fact is that RAM is MUCH cheaper, both thermal and cost, than CPU. The fact is that you get a much bigger boost IN ANY SYSTEM by putting in more RAM (until you hit the OS/apps saturation point) than by adding CPU... PER DOLLAR! Which was my point... per dollar. Also, with the density of high-end memory and its packaging, it is much easier to add another GB of RAM than to add a another core to a CPU and the needed battery and cooling. Frankly, the biggest limitation to phone packaging is battery, NOT RAM. As for the API access, well, what you have access to depends on what the manufacturer has decided they will let you have access to. I mean just take a look at creating a basic camera app that will allow you to set the ISO. While Android has the API to do it, the manufacturer's implementation of the camera and what they will let you touch through the kernel is another thing entirely. Many devices will not let you set the ISO in an app. When you go into the native code API and allocate memory, you are taking that much memory away from the Android runtime. Let's say you are writing for a device with 512MB RAM (usable will be something less than that). If you allocate 100MB RAM, then the native code will have to run in 412MB and that will force the garbage collector to be more active. Unless you know about some way to control the garbage collector or, in code, some way to kill various "unneeded" apps without the system being ROOTED. Then again, not killing apps programatically was actually the point of the article... leave it UP TO the garbage collector. The vast majority of Android devices have tons of running apps, from live wallpapers, to clocks, to social media, etc. Because of this, when the memory available to Android is reduced, for whatever reason, the garbage collector has to be more aggressive in killing off processes and retrieving their memory. That killing off causes unexpected, untimely, and sometimes bothersome lags in the system. Take away a sizable chunk of RAM from Android and you've made it that much harder for the garbage collector to decide which to kill. Add "bloat" services and apps that load as services and it really becomes a challenge. If you have a way around this, I'd LOVE to hear about it. Stopping the garbage collector from kicking in has been a huge headache. Also, when I define "larger" games, I'm referring to the data sets they have to manipulate. While game demos like you describe can seem impressive, it IS a DEMO. There is a joke about Bill Gates dying and going to heaven and getting to choose between Heaven and Hell. After visiting the "partying, good time" Hell, he chooses Hell where he is immediately tortured. When asking what was up because he was just there and it was SO much fun, they told him it was just the DEMO, especially ironic considering some of the demos that Bill Gates has done himself (the full joke is better, but too long). Anyway, I've seen ports hands on and while impressive FOR A PHONE/TABLET, there were obvious compromises due to the platform. CPU horsepower and RAM limitations were the most obvious. They were about equivalent to where games were 5+ years ago. Impressive, to say the least, but NOT equivalent to modern games. As for "full frame rate" that has many meanings, depending on whether you are a hard core gamer (min 60fps acceptable, many want 100+) and whether or not you can accept the limitations of the platform. My bet is that to shoehorn the game onto Android, they had to make some compromises. One would be detail. Whenever you shrink something it looks better as the flaws are harder to see. Another would be game play. The number of intelligent objects in the scene. Etc. I'll also bet that the game demo was done on a clean install and with a developer version of Android. Much different than with the various manufacturer/carrier releases (if not for any other reason than the launchers). Look, no doubt there are issues with more RAM. Cost probably being the biggest (take the wholesale cost and multiply it by 3 to 5 times to get assembled, retail cost). However, the article's premise was "RAM: What it is, how it's used, and why you shouldn't care". My point is and always has been, in the 30+ years I've been using PCs and other devices, that RAM is almost always the biggest limiting factor in the performance of any device (up to the "saturation point"). My systems experience ranges from PDAs to AS/400s. I've yet to find an exception or a situation where I didn't get much more of a bang for the buck with RAM. If you don't believe me, write a quick native app that just grabs, say, 100MB RAM and then see what happens to the phone. I'll bet it becomes lag city. However, if you have a solution, I'm all ears! Really! :-D Sometimes those ears make me look like a "donkey", but sometimes that is what is needed to learn something! GlueFactoryBJJ, You sir are an idiot. And obviously understand nothing of ARMs, RISC based architectures. It really would require less work to tack on another core than increasing the addressable RAM ceiling. As the memory controller is part of the CPU, which would require a major redesign in condideration to the PoP RAM that is then essentially built into a second floor of the same package above the Application Processor (which is the smartphone equivelent of all the bridges, buses, controllers, and cpus that would make up the bulk of the motherboard on a conventional general purpourse computer). It's known as a System on a Chip for that reason. The reason you can't just go and cram in loads of RAM is because of the limits of the cpu itself. This is why even with moderm quad core phones. You don't see more than 1-2GB. RISC works very differently to the big iron CISC devices you've used all your life. "BTW, the getLargeMemoryClass () the link pointed me to just reinforces my point. I really don't get where you are coming from here as the discussion is about RAM constrained devices (pretty much all of the Android devices right now)." In your original post, you claim that Android will not increase the amount of heap available to apps on devices with more RAM. This is plainly not true -- as of Android 3.0 there is this API I am pointing to that allows an app to do just that. Yes this is a very new API that was introduced in 3.0, but it is only a matter of time until newer versions of this platform with this API appear on most devices, just as has been the case with every version of the platform. So, problem solved. "Regarding #2 above, even with native code you are still limited to how much memory you can use because of garbage collection issues (as mentioned above). Because of this, MORE RAM IS BETTER!" This is simply not true. The garbage collector runs on the Dalvik heap. The Dalvik heap is not the native heap. Allocations you do in the native heap have NO IMPACT at all on the Dalvik heap. They do not cause the garbage collector to run more. They do not cause it to run more slowly. They do not impact it in any way. "Regarding #3 above, yes, you CAN run an app in multiple processes, as I stated in my original post, but they cannot communicate (send data back and forth) with each other IN RAM. This is problematic if you have large data sets and are having to dump the data to flash storage (regardless of its speed (and file system), based on the current flash used in these devices) and pull it back again to process in another thread. If you can't figure out why running multiple processes is better than running a single process, especially on multi-core CPU's, then I can't help you there." Um, you have *so* many ways to get data between processes that don't require throwing stuff on storage and pulling it back out. Binder IPC, pipes, shared memory, etc. Also there is *no* special benefit to using multiple processes on a multi-core CPU. None. Multiple threads in one process can make use of multiple cores just fine. The *only* reason to use multiple processes is to provide isolation between code so that crashes in one won't impact the other (in which case all of this nice memory isolation is critical), and secondarily you can use them in some ways to give yourself more than one Dalvik heap if you have some isolated larger parts of your app that need lots of RAM. (For example Google Maps does this -- its Navigation component runs in a separate process.) "Regarding #4 above, I really don't see what is so complicated about what I've said. A single core Android device typically has 512MB of RAM. All of the dual core devices have 1GB of RAM. 1 core times 512MB = 512MB RAM. 2 cores times 512MB = 1GB RAM. As you said, "WTF?"" Yes, WTF. Just because it is common for dual core CPUs to have 1GB RAM has nothing to do with there being 512MB per core or whatever. It doesn't work like that at all. These are all SMP systems, all of the cores are running in the same shared RAM address space. OK, over 97% of the devices out there running Android 2.x and you want to point out a call that only runs on less than 1%? We are talking about here and now, not the future. Still, the description for that call is below: "Return the approximate per-application memory class of the current device when an application is running with a large heap. This is the space available for memory-intensive applications; most applications should not need this amount of memory, and should instead stay with the getMemoryClass() limit. The returned value is in megabytes. This may be the same size as getMemoryClass() on memory constrained devices, or it may be significantly larger on devices with a large amount of available RAM. The is the size of the application's Dalvik heap if it has specified android:largeHeap="true" in its manifest." First, the app must request a largeHeap. Second, it is up to the specific implementation of HC as to whether or not largeHeap is any larger. The examples in the two links above indicate default largeHeap sizes of 16MB or 24MB, respectively. I've yet to see any indication of where you can actually set the heap size to something you might want. Because of this, even on HC devices, there is no indication that you can have notably larger heaps than in GB or earlier releases. And, no, I don't have a ton of devices to test this on. So if you can provide some actual code that does it (or at least a link to code I can look at), I'd like to look at it, but otherwise I'm a bit skeptical. As I noted above, the premise of the article is, "RAM: What it is, how it's used, and why you shouldn't care". My point has always been in this thread of discussions that RAM is important. Most likely more important than CPU speed or numbers of cores for real world Android OS and application performance... at least in a bang-for-the-buck perspective. As for native code RAM used not impacting the garbage collector and the Dalvik heap, I've addressed that in a post above. I'm open to new information, but your claim that it doesn't have any effect just doesn't make sense. Any RAM used by native code is memory that isn't available to the Android system and will cause the garbage collector to get more aggressive because it will be like it is running on a reduced RAM device. Your example of Maps/Navigator is exactly what I'm saying! IF you have large amounts of data. YES! That is the whole point. No, you aren't going to need a ton of RAM for a "Hello, world!" type app. My premise was more RAM is going to be needed for more powerful apps. Apps that can manipulate large amounts of data. Multi-stream video chat, graphics, presentations, etc. Even holding uncompressed jpg files in memory typically takes 3-5 times the compressed file size in RAM. Want to morph a couple together? More memory. Yes, there are ways to work around some of the issues, but not without doing a lot of transferring between RAM and flash storage, which will slow things down by a factor of 100+. Memory per core is important from the standpoint of being able to keep the cores busy when multiple apps are running. If you do not have sufficient memory, then the cores wait for the apps to start or reload. Yes, I understand that this is Symetrical Multi Processing (SMP). SMP is a VERY old concept (in computer years). I understand the cores share memory rather than have dedicated RAM. Basic stuff. How those cores are kept busy is directly influenced to how much RAM you have. Anyway, back to the point, RAM is important. You should care. More RAM will give more of a performance boost, per $, than CPU. Thanks! As a newbie you have answered a few questions for me. I have the Galaxy Skyrocket and I would always go to my home screen and shut down any app I was done with. Now I know better. Thanks again, Joe

Vitamins (short story) "Vitamins" is a short story by American author Raymond Carver. It was originally published in 1984, in his collection titled Cathedral. Plot synopsis "Vitamins" begins with an unnamed male narrator telling the story of how his wife starts a home business selling vitamins. His wife Patti starts selling vitamins because she wants a job for her self-respect. Patti takes her job very seriously and she feels hurt when girls quit on her. One night one of her employees, a girl named Sheila makes a pass at Patti by telling her she loves Patti. Then she grabs Patti’s breast. Patti tells her she "doesn’t swing that way", but says that she loves Sheila, just not in the way Sheila loves her. After that incident, the narrator describes a party that he and Patti hold for all of Patti’s employees. The vitamin business was not doing as well as before so Patti holds a party to cheer all her employees up. All the girls are dancing with other girls, but the narrator dances with a girl named Donna. Sheila is the first person to get drunk and pass out. The narrator and Patti move Sheila’s sleeping body out onto the porch and they forget about her. The party winds down and the narrator makes attempts to have sex with Donna. Donna tells him not now and she leaves the party. Sheila wakes up and walks into the house. After complaining, she asks the narrator where Patti is and that Patti has to take her to the hospital. The narrator says that Patti is asleep and he kicks Sheila out of the house. The next morning Patti asks the narrator where Sheila is and he tells her that she went to Portland. Patti complains of dreaming of vitamins and that her life is becoming consumed by vitamins. A couple of days after the party the narrator invites Donna to a bar called the Off-Broadway for a drink. He describes it as a "spade" bar. While there, a man named Benny approaches them. Benny walks over with his friend Nelson, a veteran of Vietnam who has just arrived home. Nelson jokes about how Donna and the narrator are not married and that they must be good friends. To tease them, he pulls out a box with a cut off ear from a Vietnamese soldier. Khaki, the owner of the bar walks over asks if everything is alright. Benny assures him that everything is fine. Nelson then offers Donna a couple hundred dollars to 'french' him (perform oral sex). The narrator and Donna leave, disgusted. While in his car, Donna remarks that she could have used the money and that she is deciding to leave for Portland. The narrator returns home. He pours himself a glass of Scotch and he takes it into his bathroom. Patti wakes up and runs into the bathroom, fully clothed. She yells at the narrator saying that he let her oversleep and that she has to get to work to sell vitamins. The narrator tells her to go back to sleep. The story ends with the narrator commenting that all the medicine was falling out of the medicine cabinet. Themes Alcohol plays a part in all of the situations with the characters. Alcohol is seen to have negative effect on the lives of all of the characters. Especially with the character of Sheila who passes out on the porch during the party. When the narrator takes Donna to the spade bar, the alcohol plays a part in the scene by setting the tone of the scene as being "underground". The Vitamins can also be interpreted as being metaphors for alcohol. The narrator is seen to be drinking alcohol throughout the story and the vitamins may represent the negative effects played out in the life of his wife, Patti. Patti constantly thinks about vitamins in much the way that an alcoholic thinks about drinking. Patti confides to the narrator that she feels suffocated by vitamins, and that she wants to escape from vitamins. These feelings are similar to ones that an alcoholic feels and in the end, the vitamins are seen to be destroying the marriage. Category:1984 short stories Category:Short stories by Raymond Carver Category:Literature about alcohol abuse

/* Header describing `ar' archive file format. Copyright (C) 1996 Free Software Foundation, Inc. This file is part of the GNU C Library. The GNU C Library is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation; either version 2.1 of the License, or (at your option) any later version. The GNU C Library is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with the GNU C Library; if not, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA. */ #ifndef _AR_H #define _AR_H 1 #include <sys/cdefs.h> /* Archive files start with the ARMAG identifying string. Then follows a `struct ar_hdr', and as many bytes of member file data as its `ar_size' member indicates, for each member file. */ #define ARMAG "!<arch>\n" /* String that begins an archive file. */ #define SARMAG 8 /* Size of that string. */ #define ARFMAG "`\n" /* String in ar_fmag at end of each header. */ __BEGIN_DECLS struct ar_hdr { char ar_name[16]; /* Member file name, sometimes / terminated. */ char ar_date[12]; /* File date, decimal seconds since Epoch. */ char ar_uid[6], ar_gid[6]; /* User and group IDs, in ASCII decimal. */ char ar_mode[8]; /* File mode, in ASCII octal. */ char ar_size[10]; /* File size, in ASCII decimal. */ char ar_fmag[2]; /* Always contains ARFMAG. */ }; __END_DECLS #endif /* ar.h */

Q: Getting Array value in a dictionary swift I am trying to get key and value in a Dictionary while I am able to the key and map it to a dictionary, I am unable to get the value which is an array. var dict = [String: [String]] I was able to get the key as an array which is what I want like: var keyArray = self.dict.map { $0.key } How can I get the value which is already an array A: Use flatMap if you want to flatten the result you get when you use map which is of type [[String]]. let valueArray = dict.flatMap { $0.value } // gives `[String]` mapping all the values

/* * @brief LPC11xx ROM API declarations and functions * * @note * Copyright(C) NXP Semiconductors, 2012 * All rights reserved. * * @par * Software that is described herein is for illustrative purposes only * which provides customers with programming information regarding the * LPC products. This software is supplied "AS IS" without any warranties of * any kind, and NXP Semiconductors and its licensor disclaim any and * all warranties, express or implied, including all implied warranties of * merchantability, fitness for a particular purpose and non-infringement of * intellectual property rights. NXP Semiconductors assumes no responsibility * or liability for the use of the software, conveys no license or rights under any * patent, copyright, mask work right, or any other intellectual property rights in * or to any products. NXP Semiconductors reserves the right to make changes * in the software without notification. NXP Semiconductors also makes no * representation or warranty that such application will be suitable for the * specified use without further testing or modification. * * @par * Permission to use, copy, modify, and distribute this software and its * documentation is hereby granted, under NXP Semiconductors' and its * licensor's relevant copyrights in the software, without fee, provided that it * is used in conjunction with NXP Semiconductors microcontrollers. This * copyright, permission, and disclaimer notice must appear in all copies of * this code. */ #ifndef __ROMAPI_11XX_H_ #define __ROMAPI_11XX_H_ #include "error.h" #ifdef __cplusplus extern "C" { #endif /** @defgroup ROMAPI_11XX CHIP: LPC11XX ROM API declarations and functions * @ingroup CHIP_11XX_Drivers * @{ */ /** * @brief LPC11XX High level ROM API structure */ typedef struct { const uint32_t usbdApiBase; /*!< USBD API function table base address */ const uint32_t reserved0; /*!< Reserved */ const uint32_t candApiBase; /*!< CAN API function table base address */ const uint32_t pwrApiBase; /*!< Power API function table base address */ const uint32_t reserved1; /*!< Reserved */ const uint32_t reserved2; /*!< Reserved */ const uint32_t reserved3; /*!< Reserved */ const uint32_t reserved4; /*!< Reserved */ } LPC_ROM_API_T; /** * @brief LPC11XX IAP_ENTRY API function type */ typedef void (*IAP_ENTRY_T)(unsigned int[], unsigned int[]); static INLINE void iap_entry(unsigned int cmd_param[], unsigned int status_result[]) { ((IAP_ENTRY_T) IAP_ENTRY_LOCATION)(cmd_param, status_result); } /** * @} */ #ifdef __cplusplus } #endif #endif /* __ROMAPI_11XX_H_ */

Published: Wednesday, April 24, 2013 at 7:18 p.m. Last Modified: Wednesday, April 24, 2013 at 9:37 p.m. Florida coach Will Muschamp introduced his latest coaching hire at Wednesday's press conference — Jeff Choate, who will coordinate special teams and coach the outside linebackers. Muschamp and Choate said they anticipated a seamless transition even though he was not here for the spring. “I've known Jeff. He's a guy that I've known probably going back six or seven years in recruiting the state of Texas,” Muschamp said. “He's an outstanding evaluator, really good recruiter, coached on both sides of the ball. “Having worked with someone on our staff (Brent Pease), that certainly helps — and a guy I trust. I trust Brent's opinion. So, it's exciting to have a coach like this at this time of year. “There's never a good time, but at this time of year, it's good to add a coach to your staff and improve your staff.” Choate coached with Pease at Boise State for six seasons. In 2012, Choate coached the linebackers at Washington State. He was hired after the season to be the defensive coordinator at UTEP. He went through the spring at UTEP, but then left when Muschamp offered him a job. “It was a little bit out of the blue, but it was an opportunity that I could not say no to,” Choate said. “Having a chance to coach in the SEC and compete at the highest level, I think anybody that's a true competitor wants to challenge themselves against the very best. “This was an opportunity for me to do that. As hard as it was to say no to the young men at UTEP and to (head coach) Sean (Kugler) in particular, this was an opportunity I could not say no to.” Choate said coming onto the staff relatively late should not be a problem. “If there's one situation where it would work out, ideally it would be this one,” he said. “D.J. (Durkin) and I are very similar in the way we approach special teams, and I had spent some time talking with him and studying some things Florida had done here. We exchanged ideas. “It's me learning terminology and things. I don't think there will be a lot of technique or scheme that will be adjusted. Without a spring, I don't see there being wholesale changes. We'll tweak some things and have game-plan adjustments. “But I think we've got to keep it as straightforward as we can in the short term.” <p>Florida coach Will Muschamp introduced his latest coaching hire at Wednesday's press conference — Jeff Choate, who will coordinate special teams and coach the outside linebackers.</p><p>Muschamp and Choate said they anticipated a seamless transition even though he was not here for the spring.</p><p>“I've known Jeff. He's a guy that I've known probably going back six or seven years in recruiting the state of Texas,” Muschamp said. “He's an outstanding evaluator, really good recruiter, coached on both sides of the ball.</p><p>“Having worked with someone on our staff (Brent Pease), that certainly helps — and a guy I trust. I trust Brent's opinion. So, it's exciting to have a coach like this at this time of year.</p><p>“There's never a good time, but at this time of year, it's good to add a coach to your staff and improve your staff.”</p><p>Choate coached with Pease at Boise State for six seasons. In 2012, Choate coached the linebackers at Washington State. He was hired after the season to be the defensive coordinator at UTEP. </p><p>He went through the spring at UTEP, but then left when Muschamp offered him a job.</p><p>“It was a little bit out of the blue, but it was an opportunity that I could not say no to,” Choate said. “Having a chance to coach in the SEC and compete at the highest level, I think anybody that's a true competitor wants to challenge themselves against the very best.</p><p>“This was an opportunity for me to do that. As hard as it was to say no to the young men at UTEP and to (head coach) Sean (Kugler) in particular, this was an opportunity I could not say no to.” </p><p>Choate said coming onto the staff relatively late should not be a problem.</p><p>“If there's one situation where it would work out, ideally it would be this one,” he said. “D.J. (Durkin) and I are very similar in the way we approach special teams, and I had spent some time talking with him and studying some things Florida had done here. We exchanged ideas.</p><p>“It's me learning terminology and things. I don't think there will be a lot of technique or scheme that will be adjusted. Without a spring, I don't see there being wholesale changes. We'll tweak some things and have game-plan adjustments.</p><p>“But I think we've got to keep it as straightforward as we can in the short term.”</p>

Belgaum: Karnataka Janatha Paksha leader and former Chief Minister B S Yedyurappa will be admitted to BJP in a few days, state party chief Prahlad Joshi said on Thursday. Joshi said he had raised the issue of Yeddyurappa`s homecoming with party`s Prime Ministerial candidate Narendra Modi, who was here today, for a function. The matter was before central leaders, he said. Yeddyurappa had also said three days ago that he has an "open mind" about joining BJP and a clear picture on his homecoming might emerge in the next four to five days. Soon after the assembly polls in five states, senior BJP leaders from Karnataka had met party chief Rajnath Singh and urged him to start the process of bringing Yeddyurappa back into the party fold. Yeddyurappa has supported Narendra Modi`s candidature for Prime Ministership and also written to NDA Chairman L K Advani to take KJP into its fold. Yeddyurappa, who quit the Chief Ministership in July 2011 over illegal mining bribery charges, quit BJP last year and launched KJP.

Illegale Einwanderer sollten festgehalten und abgeschoben werden – Reformbedarf im Asyl-, Ausländer- und Aufenthaltsrecht. Am 28. August 2018 wurden 16 Eritreer in einem LKW auf der A 61 von der Polizei aufgegriffen und in die Ingelheimer Erstaufnahmeeinrichtung für Asylsuchende überführt. Inzwischen sind 13 von ihnen untergetaucht. Dazu sagt Matthias Joa, migrationspolitischer Sprecher der AfD-Fraktion Rheinland-Pfalz: „Dass diese illegalen Einwanderer aus einer rheinland-pfälzischen Aufnahmeeinrichtung spurlos untertauchen konnten, ist ein weiterer Beleg für das Versagen der Landesregierung in Sachen Asylpolitik. Integrationsministerin Spiegel konnte schon in der Vergangenheit das Abtauchen von mindestens 3.000 Ausländern nicht verhindern. Auch im aktuellen Fall gibt sie sich wie immer machtlos, gleichgültig und verweigert beharrlich, die Realitäten anzuerkennen.“ Joa weiter: „Die bestehenden Gesetze sind den heutigen Herausforderungen illegaler Massenmigration offenkundig nicht mehr angemessen. Sie erzeugen ein gefährliches Zuständigkeiten-Chaos und große Verunsicherung bei allen Verantwortlichen. Vor allem die Ausländerbehörden scheinen überfordert zu sein und werden von der Regierung im Stich gelassen.“ Joa fordert: „Das wachsende Unvermögen des Staates, geltendes Recht durchzusetzen und seine Bürger wirksam zu schützen, verdeutlicht den zwingenden Reformbedarf im Asyl-, Ausländer- und Aufenthaltsrecht. Gleichzeitig bedarf es aber auch des politischen Willens der Landesregierung, illegale Einwanderer zuverlässig festzuhalten und konsequent abzuschieben. Die AfD-Fraktion wird dieses Thema sowie den aktuellen Fall in den zuständigen Ausschüssen thematisieren.“

Following a new study estimating that almost 5,000 people died as a result of Hurricane Maria, Sunday news shows completely ignored the devastation and death toll that is 72 times higher than the government’s official ... About The National Memo The National Memo is a political newsletter and website that combines the spirit of investigative journalism with new technology and ideas. We cover campaigns, elections, the White House, Congress, and the world with a fresh outlook. Our own journalism — as well as our selections of the smartest stories available every day — reflects a clear and strong perspective, without the kind of propaganda, ultra-partisanship and overwrought ideology that burden so much of our political discourse.

TrueFire Live: Kelly Richey – Teaching + Q&A Check out the TrueFire LIVE broadcast! In this broadcast, I talked about where to place your focus when you practice, and how 20 minutes per day can make you a better player in a short amount of time! I shared...

1. Field of the Invention This invention relates to improvements in density check plates for checking the variation of the spectral characteristics of a densitometer. 2. Description of the Prior Art Photographic color densitometers are generally provided with spectral filters for the three colors, red, green, and blue (hereinafter referred to as R, G, and B) of a color photosensitive material, or filters matched in visual density to measure the density of the three colors, R, G, and B, and the transmission density. The density value of te color photosensitive material to be measured greatly depends upon the characteristics of the spectral filters used in the photographic color densitometer. Accordingly, in the routine use of photographic densitometers, it is necessary to always check the density value so as to avoid a variation in the spectral characteristics of all optical systems in a device. This includes measuring the spectral filters. For this reason, a density check plate employing six kinds (for high density and for low density of each color, R, G, and B; i.e., two kinds for each color), with each color, R, G, and B, of color plates which greatly vary in the value of the spectral density in the vicinity of the dominant wavelength of the three-colors, R, G, B spectral filter is generally used. The "Check Plaque" (product name) of the Eastman Kodak Co. is one example of such a density check plate. The principle of the check plate as described above will be described with reference to FIG. 1. First, in the event a dye, for example, cyan, magenta, yellow recording on the photosensitive material, having a spectral density distribution D.sub..lambda. is measured with the use of a photographic color densitometer using a spectral filter having the spectral characteristic A.sub..lambda., a porton (hatched portion) in which both curves overlap is measured as a density value. However, if the characteristic A.sub..lambda. of the spectral filter should be changed into a characteristic as indicated at B.sub..lambda. due to a time variation (the time variation of the spectral filter is generally considered to be where the dominant wave-form is displaced and where more break-through occurs at the high density portion), the measured value greatly varies as may be seen clearly from the difference in the area of the hatched portion. The difference in the measured value becomes greater with the variation in the spectral characteristic of the dye in the vicinity of the dominant wavelength (435.8, 546.1, and 643.8 nm according to ASA Standards) of the three-color spectral filter increases. This makes it easy to check the variation in the spectral charcteristics of the spectral filter. Therefore, it is desirable to select a color plate having great variation in spectral characteristics to serve as a density check plate for the photographic color densitometer. However, in a density check plate manufactured in a manner as described above, when the spectral characteristic of the spectral filter used in the photographic color densitometer varies, the density of the density check plate varies greatly due to the characteristic of the spectral filter, and as a result the same density check plate cannot be used.

Q: Как открыть порт в Ubuntu? Я новичок в ubuntu, поэтому никак не могу понять, почему порт не открывается и как это всё-таки сделать. Подскажите, пожалуйста!Я пробовал открыть порт в iptables, но, как я понял, iptables служат для управления файерволлом ufw, а при вводе команды sudo ufw status получаю ответ:sudo: ufw: command not foundКак в таком случае открыть порт? Гугление мне посоветовало лишь iptables.На всякий случай приведу выход команды netstat -an | grep LISTENtcp 0 0 127.0.0.1:25 0.0.0.0:* LISTENtcp 0 0 127.0.0.1:953 0.0.0.0:* LISTENtcp 0 0 127.0.0.1:587 0.0.0.0:* LISTENtcp 0 0 0.0.0.0:80 0.0.0.0:* LISTENtcp 0 0 5.231.61.235:53 0.0.0.0:* LISTENtcp 0 0 127.0.0.2:53 0.0.0.0:* LISTENtcp 0 0 127.0.0.1:53 0.0.0.0:* LISTENtcp 0 0 0.0.0.0:22 0.0.0.0:* LISTENtcp 0 0 127.0.0.1:631 0.0.0.0:* LISTENtcp6 0 0 ::1:953 :::* LISTENtcp6 0 0 :::53 :::* LISTENtcp6 0 0 :::22 :::* LISTENtcp6 0 0 ::1:631 :::* LISTENunix 2 [ ACC ] STREAM LISTENING 3215411995 /var/run/cups/cups.sockunix 2 [ ACC ] STREAM LISTENING 3215409707 /var/run/avahi-daemon/socketunix 2 [ ACC ] STREAM LISTENING 3215403381 @/com/ubuntu/upstartunix 2 [ ACC ] STREAM LISTENING 3215406175 /var/run/dbus/system_bus_socketunix 2 [ ACC ] STREAM LISTENING 3215553140 /var/run/sendmail/mta/smcontrolunix 2 [ ACC ] STREAM LISTENING 3215421071 /var/run/acpid.socketunix 2 [ ACC ] SEQPACKET LISTENING 3215405745 /run/udev/controlunix 2 [ ACC ] STREAM LISTENING 3215427067 /var/run/saslauthd/muxТо есть вроде как 53-й порт открыт... Как бы ещё портов открыть? A: Ваш листинг это не открытые порты, а вывод того кто какие порты слушает. Если вы хотите например открыть порт 53 по tcp, используя утилиту iptables : iptables -I INPUT -p tcp -m tcp --dport 53 -j ACCEPT

--- abstract: | In this work, we apply the factorization technique to the Benjamin-Bona-Mahony like equations in order to get travelling wave solutions. We will focus on some special cases for which $m\neq n$, and we will obtain these solutions in terms of Weierstrass functions. Email: kuru@science.ankara.edu.tr title: 'Travelling wave solutions of BBM-like equations by means of factorization' --- Ş. Kuru\ [*Department of Physics, Faculty of Science, Ankara University, 06100 Ankara, Turkey*]{} Introduction ============ In this paper, we will consider the Benjamin-Bona-Mahony (BBM) [@benjamin] like equation ($B(m,n)$) with a fully nonlinear dispersive term of the form $$u_{t}+u_{x}+a\,(u^m)_x-(u^n)_{xxt}=0, \quad\quad m,\,n>1,\,\,m \neq n\, .\label{1.3}$$ This equation is similar to the nonlinear dispersive equation $K(m,n)$, $$u_{t}+(u^m)_x+(u^n)_{xxx}=0, \quad\quad m>0,\,1<n\leq3 \label{1.2}$$ which has been studied in detail by P. Rosenau and J.M. Hyman [@rosenau]. In the literature there are many studies dealing with the travelling wave solutions of the $K(m,n)$ and $B(m,n)$ equations, but in general they are restricted to the case $m=n$ [@rosenau; @rosenau1; @wazwaz; @wazwaz1; @wazwaz2; @wazwaz3; @wazwaz5; @taha; @ludu; @wazwaz4; @yadong; @wang; @kuru]. When $m\neq n$, the solutions of $K(m,n)$ were investigated in [@rosenau; @rosenau1]. Our aim here is just to search for solutions of the equations $B(m,n)$, with $m\neq n$, by means of the factorization method. We remark that this method [@pilar1; @pilar; @Perez; @pilar2], when it is applicable, allows to get directly and systematically a wide set of solutions, compared with other methods used in the BBM equations. For example, the direct integral method used by C. Liu [@liu] can only be applied to the $B(2,1)$ equation. However, the factorization technique can be used to more equations than the direct integral method and also, in some cases, it gives rise to more general solutions than the sine-cosine and the tanh methods [@wazwaz4; @yadong; @wazwaz6]. This factorization approach to find travelling wave solutions of nonlinear equations has been extended to third order nonlinear ordinary differential equations (ODE’s) by D-S. Wang and H. Li [@li]. When we look for the travelling wave solutions of Eq. (\[1.3\]), first we reduce the form of the $B(m,n)$ equation to a second order nonlinear ODE and then, we can immediately apply factorization technique. Here, we will assume $m \neq n$, since the case $m = n$ has already been examined in a previous article following this method [@kuru]. This paper is organized as follows. In section 2 we introduce factorization technique for a special type of the second order nonlinear ODE’s. Then, we apply straightforwardly the factorization to the related second order nonlinear ODE to get travelling wave solutions of $B(m,n)$ equation in section 3. We obtain the solutions for these nonlinear ODE’s and the $B(m,n)$ equation in terms of Weierstrass functions in section 4. Finally, in section 5 we will add some remarks. Factorization of nonlinear second order ODE’s ============================================= Let us consider, the following nonlinear second order ODE $$\label{9} \frac{d^2 W}{d \theta^2}-\beta \frac{d W}{d \theta}+F(W)=0$$ where $\beta$ is constant and $F(W)$ is an arbitrary function of $W$. The factorized form of this equation can be written as $$\label{10} \left[\frac{d}{d \theta}-f_2(W,\theta)\right]\left[\frac{d}{d \theta}-f_1(W,\theta)\right] W(\theta)=0\,.$$ Here, $f_1$ and $f_2$ are unknown functions that may depend explicitly on $W$ and $\theta$. Expanding (\[10\]) and comparing with (\[9\]), we obtain the following consistency conditions $$\label{12} f_1f_2=\frac{F(W)}{W}+\frac{\partial f_1}{\partial \theta}, \qquad f_2+\frac{\partial(W f_1)}{\partial W}=\beta.$$ If we solve (\[12\]) for $f_{1}$ or $f_{2}$, it will supply us to write a compatible first order ODE $$\label{14} \left[\frac{d}{d \theta}-f_1(W,\theta)\right] W(\theta)=0$$ that provides a solution for the nonlinear ODE (\[9\]) [@pilar1; @pilar; @Perez; @pilar2]. In the applications of this paper $f_{1}$ and $f_{2}$ will depend only on $W$. Factorization of the BBM-like equations ======================================== When Eq. (\[1.3\]) has the travelling wave solutions in the form $$\label{15} u(x,t)=\phi(\xi),\quad\quad \xi=hx+wt$$ where $h$ and $w$ are real constants, substituting (\[15\]) into (\[1.3\]) and after integrating, we get the reduced form of Eq. (\[1.3\]) to the second order nonlinear ODE $$\label{16} (\phi^n)_{\xi\xi}-A\,\phi-B\,\phi^m+D=0\,.$$ Notice that the constants in Eq. (\[16\]) are $$\label{17} A=\frac{h+w}{h^2\,w},\quad\quad B=\frac{a}{h\,w},\quad\quad D=\frac{R}{h^2\,w}$$ and $R$ is an integration constant. Now, if we introduce the following natural transformation of the dependent variable $$\label{18} \phi^n(\xi)=W(\theta),\quad\quad\xi=\theta$$ Eq. (\[16\]) becomes $$\label{19} \frac{d^2 W}{d \theta^2}-A\,W^{\frac{1}{n}}-B\,W^{\frac{m}{n}}+D=0.$$ Now, we can apply the factorization technique to Eq. (\[19\]). Comparing Eq. (\[9\]) and Eq. (\[19\]), we have $\beta=0$ and $$\label{20} F(W)=-(A\,W^{\frac{1}{n}}+B\,W^{\frac{m}{n}}-D)\,.$$ Then, from (\[12\]) we get only one consistency condition $$\label{23} f_1^2+f_1\,W\frac{df_1}{dW}-A\,W^{\frac{1-n}{n}}-B\, W^{\frac{m-n}{n}}+D\,W^{-1}=0\,$$ whose solutions are $$\label{24} f_1(W)=\pm\frac{1}{W}\sqrt{\frac{2\,n\,A}{n+1}\,W^{\frac{n+1}{n}}+ \frac{2\,n\,B}{m+n}\,W^{\frac{m+n}{n}}-2\, D\,W+C}\,$$ where $C$ is an integration constant. Thus, the first order ODE (\[14\]) takes the form$$\label{25} \frac{dW}{d \theta}\mp\sqrt{\frac{2\,n\,A}{n+1}\,W^{\frac{n+1}{n}}+\frac{2\,n\,B}{m+n}\,W^{\frac{m+n}{n}}-2\, D\,W+C}=0\,.$$ In order to solve this equation for $W$ in a more general way, let us take $W$ in the form $W=\varphi^p,\,p\neq0,1$, then, the first order ODE (\[25\]) is rewritten in terms of $\varphi$ as $$\label{26} (\frac{d\varphi}{d \theta})^2= \frac{2\,n\,A}{p^2\,(n+1)}\,\varphi^{p(\frac{1-n}{n})+2}+ \frac{2\,n\,B}{p^2\,(m+n)}\,\varphi^{p(\frac{m-n}{n})+2}-\frac{2\,D}{p^2}\,\varphi^{2-p} +\frac{C}{p^2}\,\varphi^{2-2\,p}\,.$$ If we want to guarantee the integrability of (\[26\]), the powers of $\varphi$ have to be integer numbers between $0$ and $4$ [@ince]. Having in mind the conditions on $n, m$ ($n\neq m >1$) and $p$ ($p\neq0$), we have the following possible cases: - If $C=0,\,\,D=0$, we can choose $p$ and $m$ in the following way $$\label{27a} p=\pm \frac{2n}{1-n} \quad {\rm{with}} \quad m=\frac{n+1}{2},\frac{3\,n-1}{2}, 2\,n-1$$ and $$\label{27b} p=\pm \frac{n}{1-n}\quad {\rm{with}} \quad m= 2\,n-1,3\,n-2\,.$$ It can be checked that the two choices of sign in (\[27a\]) and (\[27b\]) give rise to the same solutions for Eq. (\[1.3\]). Therefore, we will consider only one of them. Then, taking $p=- \frac{2n}{1-n}$, Eq. (\[26\]) becomes $$\label{29} (\frac{d\varphi}{d \theta})^2=\frac{A\,(n-1)^2}{2\,n\,(n+1)}+\frac{B\,(n-1)^2}{n\,(3\,n+1)}\,\varphi, \quad m=\frac{n+1}{2} %, \quad (n\,\,\rm {is\,odd})$$ $$\label{30} (\frac{d\varphi}{d \theta})^2=\frac{A\,(n-1)^2}{2\,n\,(n+1)}+\frac{B\,(n-1)^2}{n\,(5\,n-1)}\,\varphi^3, \quad m=\frac{3\,n-1}{2} %, \quad (n\,\,\rm {is\,odd})$$ $$\label{31} (\frac{d\varphi}{d \theta})^2=\frac{A\,(n-1)^2}{2\,n\,(n+1)}+\frac{B\,(n-1)^2}{n\,(3\,n-1)}\,\varphi^4, \quad m=2\,n-1$$ and for $p=- \frac{n}{1-n}\,$, $$\label{32} (\frac{d\varphi}{d \theta})^2=\frac{2\,A\,(n-1)^2}{n\,(n+1)}\,\varphi+\frac{2\,B\,(n-1)^2}{n\,(3\,n-1)}\,\varphi^3, \quad m=2\,n-1$$ $$\label{33} (\frac{d\varphi}{d \theta})^2=\frac{2\,A\,(n-1)^2}{n\,(n+1)}\,\varphi+\frac{B\,(n-1)^2}{n\,(2\,n-1)}\,\varphi^4, \quad m=3\,n-2\,.$$ - If $C=0$, we have the special cases, $p=\pm 2$, $n=2$ with $m=3,4$. Due to the same reason in the above case, we will consider only $p=2$. Then, Eq. (\[26\]) takes the form: $$\label{e23} (\frac{d\varphi}{d \theta})^2=-\frac{D}{2}+\frac{A}{3}\,\varphi+\frac{B}{5}\,\varphi^3, \quad m=3$$ $$\label{e24} (\frac{d\varphi}{d \theta})^2=-\frac{D}{2}+\frac{A}{3}\,\varphi+\frac{B}{6}\,\varphi^4, \quad m=4\,.$$ - If $A=C=0$, we have $p=\pm 2$ with $m=\displaystyle \frac{n}{2},\frac{3\,n}{2},2\,n$. In this case, for $p=2$, Eq. (\[26\]) has the following form: $$\label{e2n2} (\frac{d\varphi}{d \theta})^2=-\frac{D}{2}\,\varphi^4+\frac{B}{3}\,\varphi^3, \quad m=\frac{n}{2} %, \quad (n\,\,\rm {is\,even})$$ $$\label{e3n2} (\frac{d\varphi}{d \theta})^2=-\frac{D}{2}\,\varphi^4+\frac{B}{5}\,\varphi, \quad m=\frac{3\,n}{2} %, \quad (n\,\,\rm {is\,even})$$ $$\label{e22n} (\frac{d\varphi}{d \theta})^2=-\frac{D}{2}\,\varphi^4+\frac{B}{6}, \quad m=2\,n\,.$$ - If $A=0$, we have $p=\pm 1$ with $m=2\,n,3\,n$. Here, also we will take only the case $p=1$, then, we will have the equations: $$\label{e2n} (\frac{d\varphi}{d \theta})^2=-2\,D\,\varphi+\frac{2}{3}\,B\,\varphi^3+C\varphi^4, \quad m=2n$$ $$\label{e3n} (\frac{d\varphi}{d \theta})^2=-2\,D\,\varphi+\frac{B}{2}\,\varphi^4+C, \quad m=3n\,.$$ - If $A=D=0$, we have $p=\displaystyle \pm \frac{1}{2}$ with $m=3\,n,5\,n$. Thus, for $p=\displaystyle \frac{1}{2}$, Eq. (\[26\]) becomes: $$\label{e3n1} (\frac{d\varphi}{d \theta})^2=2\,B\,\varphi^3+4\,C\varphi, \quad m=3n$$ $$\label{e3nn} (\frac{d\varphi}{d \theta})^2=\frac{4}{3}\,B\,\varphi^4+4\,C\,\varphi, \quad m=5n\,.$$ Travelling wave solutions for BBM-like equations ================================================ In this section, we will obtain the solutions of the differential equations (\[29\])-(\[33\]) in terms of Weierstrass function, $\wp(\theta;g_{2},g_{3})$, which allow us to get the travelling wave solutions of $B(m,n)$ equations (\[1.3\]). The rest of equations (\[e23\])-(\[e3nn\]) can be dealt with a similar way, but they will not be worked out here for the sake of shortness. First, we will give some properties of the $\wp$ function which will be useful in the following [@Bateman; @watson]. Relevant properties of the $\wp$ function ----------------------------------------- Let us consider a differential equation with a quartic polynomial $$\label{ef} \big(\frac{d\varphi}{d\theta}\big)^2 =P(\varphi) = a_{0}\,\varphi^4+4\,a_{1}\,\varphi^3+6\,a_{2}\,\varphi^2+4\,a_{3}\,\varphi+a_{4}\,.$$ The solution of this equation can be written in terms of the Weierstrass function where the invariants $g_2$ and $g_3$ of (\[ef\]) are $$\label{gg} g_{2}= a_{0}\,a_{4}-4\,a_{1}\,a_{3}+3\,a_{2}^2,\ \ g_{3}= a_{0}\,a_{2}\,a_{4}+2\,a_{1}\,a_{2}\,a_{3}-a_{2}^{3}-a_{0}\,a_{3}^2-a_{1}^{2}\,a_{4}$$ and the discriminant is given by $\Delta=g_2^3-27\,g_3^2$. Then, the solution $\varphi$ can be found as $$\label{x} \varphi(\theta)=\varphi_0+\frac{1}{4}P_\varphi(\varphi_0)\left(\wp(\theta;g_{2},g_{3})- \frac{1}{24}P_{\varphi\varphi}(\varphi_0)\right)^{-1}$$ where the subindex in $P_{\varphi}(\varphi_0)$ denotes the derivative with respect to $\varphi$, and $\varphi_0$ is one of the roots of the polynomial $P(\varphi)$ (\[ef\]). Depending of the selected root $\varphi_0$, we will have a solution with a different behavior [@kuru]. Here, also we want to recall some other properties of the Weierstrass functions [@stegun]: i\) The case $g_2=1$ and $g_3=0$ is called lemniscatic case $$\label{lc} \wp(\theta;g_{2},0)=g_2^{1/2}\,\wp(\theta\,g_{2}^{1/4};1,0),\qquad g_2>0\,$$ ii\) The case $g_2=-1$ and $g_3=0$ is called pseudo-lemniscatic case $$\label{plc} \wp(\theta;g_{2},0)=|g_2|^{1/2}\,\wp(\theta\,|g_{2}|^{1/4};-1,0),\qquad g_2<0\,$$ iii\) The case $g_2=0$ and $g_3=1$ is called equianharmonic case $$\label{ec} \wp(\theta;g_{2},0)=g_3^{1/3}\,\wp(\theta\,g_{3}^{1/6};0,1),\qquad g_3>0\,.$$ Once obtained the solution $W(\theta)$, taking into account (\[15\]), (\[18\]) and $W=\varphi^{p}$, the solution of Eq. (\[1.3\]) is obtanied as $$\label{uxt} u(x,t)=\phi(\xi)=W^{\frac{1}{n}}(\theta)=\varphi^{\frac{p}{n}}(\theta),\quad\quad\theta=\xi=h\,x+w\,t.$$ The case $C=0,\,D=0$, $\displaystyle p=-\frac{2n}{1-n}$ ------------------------------------------------------- - $m=\displaystyle \frac{n+1}{2}$ Equation (\[29\]) can be expressed as $$(\frac{d\varphi}{d\theta})^2=P(\varphi)=\frac{A\,(n-1)^2} {2\,n\,(n+1)}+\frac{B\,(n-1)^2}{n\,(3\,n+1)}\,\varphi$$ and from $P(\varphi)=0$, we get the root of this polynomial $$\label{f01} \varphi_0=-\frac{A\,(3\,n+1)}{2\,B\,(n+1)}\,.$$ The invariants (\[gg\]) are: $g_{2}=g_{3}=0$, and $\Delta=0$. Therefore, having in mind $\wp(\theta;0,0)=\displaystyle \frac{1}{\theta^2}$, we can find the solution of (\[29\]) from (\[x\]) for $\varphi_0$, given by (\[f01\]), $$\label{35} \varphi(\theta)= \frac{B^2\,(n-1)^2\,(n+1)\,\theta^2-2\,A\,n\,(3\,n+1)^2}{4\,B\,n\,(n+1)\,(3\,n+1)}\,.$$ Now, the solution of Eq. (\[1.3\]) reads from (\[uxt\]) $$\label{u1} u(x,t)=\left[\frac{B^2\,(n-1)^2\,(n+1)\,(h\,x+w\,t)^2-2\,A\,n\,(3\,n+1)^2} {4\,B\,n\,(n+1)\,(3\,n+1)}\right]^{\frac{2}{n-1}}\,.$$ - $m=\displaystyle \frac{3\,n-1}{2}$ In this case, our equation to solve is (\[30\]) and the polynomial has the form $$P(\varphi)=\frac{A\,(n-1)^2}{2\,n\,(n+1)}+\frac{B\,(n-1)^2}{n\,(5\,n-1)}\,\varphi^3$$ with one real root: $\varphi_0=\left(\frac{-A\,(5\,n-1)}{2\,B\,(n+1)}\right)^{1/3}$. Here, the discriminant is different from zero with the invariants $$g_2=0,\qquad g_3=\frac{-A\,B^2\,(n-1)^6}{32\,n^3\,(n+1)\,(5\,n-1)^2}\,.$$ Then, the solution of (\[30\]) is obtained by (\[x\]) for $\varphi_0$, $$\label{phi2} \varphi=\varphi_0\,\left[\frac{4\,n\,(5\,n-1)\,\wp(\theta;0,g_3)+2\,B\,(n-1)^2\,\varphi_0 }{4\,n\,(5\,n-1)\,\wp(\theta;0,g_3)-B\,(n-1)^2\,\varphi_0}\right]$$ and we get the solution of Eq. (\[1.3\]) from (\[uxt\]) as $$\label{u2} u(x,t)=\left[\varphi_0^2\,\left(\frac{4\,n\,(5\,n-1)\,\wp(h\,x+w\,t;0,g_3)+2\,B\,(n-1)^2\,\varphi_0 }{4\,n\,(5\,n-1)\,\wp(h\,x+w\,t;0,g_3)-B\,(n-1)^2\,\varphi_0}\right)^2\right]^{\frac{1}{n-1}}$$ with the conditions: $A<0,g_3>0$, for $\varphi_0=\left(\frac{-A\,(5\,n-1)}{2\,B\,(n+1)}\right)^{1/3}$. Using the relation (\[ec\]), we can write the solution (\[u2\]) in terms of equianharmonic case of the Weierstrass function: $$\label{u21} u(x,t)=\left[\left(\frac{-A\,(5\,n-1)}{2\,B\,(n+1)}\right)^{2/3}\, \left(\frac{2^{2/3}\,\wp((h\,x+w\,t)\,g_3^{1/6};0,1)+2 }{2^{2/3}\,\wp((h\,x+w\,t)\,g_3^{1/6};0,1)-1}\right)^2\right]^{\frac{1}{n-1}}\,.$$ - $m=2\,n-1$ In Eq. (\[31\]), the quartic polynomial is $$P(\varphi)=\frac{A\,(n-1)^2}{2\,n\,(n+1)}+\frac{B\,(n-1)^2}{2\,n\,(3\,n-1)}\,\varphi^4$$ and has two real roots: $\varphi_0=\pm\left(\frac{-A\,(3\,n-1)}{B\,(n+1)}\right)^{1/4}$ for $A<0,\,B>0$ or $A>0,\,B<0$. In this case, the invariants are $$g_2=\frac{A\,B\,(n-1)^4}{4\,n^2\,(n+1)\,(3\,n-1)},\qquad g_3=0\,.$$ Here, also the discriminant is different from zero, $\Delta\neq0$. We obtain the solution of (\[31\]) from (\[x\]) for $\varphi_0$, $$\label{phi3} \varphi=\varphi_0\,\left[\frac{4\,n\,(n+1)\,\varphi_0^2\,\wp(\theta;g_2,0)-A\,(n-1)^2 }{4\,n\,(n+1)\,\varphi_0^2\,\wp(\theta;g_2,0)+A\,(n-1)^2}\right]$$ and we get the solution of Eq. (\[1.3\]) from (\[uxt\]) as $$\label{u3} u(x,t)=\left[\varphi_0^2\,\left(\frac{4\,n\,(n+1)\,\varphi_0^2\,\wp(h\,x+w\,t;g_2,0)-A\,(n-1)^2 }{4\,n\,(n+1)\,\varphi_0^2\,\wp(h\,x+w\,t;g_2,0)+A\,(n-1)^2}\right)^2\right]^{\frac{1}{n-1}}$$ with the conditions for real solutions: $A<0,\,B>0,\,g_2<0$ or $A>0,\,B<0,\,g_2<0$. Having in mind the relation (\[plc\]), the solution (\[u3\]) can be expressed in terms of the pseudo-lemniscatic case of the Weierstrass function: $$\label{u32} u(x,t)=\left[\left(\frac{-A\,(3\,n-1)}{B\,(n+1)}\right)^{1/2}\, \left(\frac{2\,\wp((h\,x+w\,t)|g_2|^{1/4};-1,0)+1 }{2\,\wp((h\,x+w\,t)|g_2|^{1/4};-1,0)-1}\right)^2\right]^{\frac{1}{n-1}}$$ for $A<0,\,B>0,\,g_2<0$ and $$\label{u31} u(x,t)=\left[\left(\frac{-A\,(3\,n-1)}{B\,(n+1)}\right)^{1/2}\, \left(\frac{2\,\wp((h\,x+w\,t)|g_2|^{1/4};-1,0)-1 }{2\,\wp((h\,x+w\,t)|g_2|^{1/4};-1,0)+1}\right)^2\right]^{\frac{1}{n-1}}$$ for $A>0,\,B<0,\,g_2<0$. The case $C=0,\,D=0$, $\displaystyle p=- \frac{n}{1-n}$ ------------------------------------------------------- - $m=2\,n-1$ Now, the polynomial is cubic $$P(\varphi)=\frac{2\,A\,(n-1)^2}{n\,(n+1)}\,\varphi+\frac{2\,B\,(n-1)^2}{n\,(3\,n-1)}\,\varphi^3$$ and has three distinct real roots: $\varphi_0=0$ and $\varphi_0=\pm\left(\frac{-A\,(3\,n-1)}{B\,(n+1)}\right)^{1/2}$ for $A<0,\,B>0$ or $A>0,\,B<0$. Now, the invariants are $$g_2=\frac{-A\,B\,(n-1)^4}{n^2\,(n+1)\,(3\,n-1)},\qquad g_3=0$$ and $\Delta\neq0$. The solution of (\[32\]) is obtained from (\[x\]) for $\varphi_0$, $$\label{phi4} \varphi=\varphi_0\,\left[\frac{2\,n\,(n+1)\,\varphi_0\,\wp(\theta;g_2,0)-A\,(n-1)^2 }{2\,n\,(n+1)\,\varphi_0\,\wp(\theta;g_2,0)+A\,(n-1)^2}\right]$$ and substituting (\[phi4\]) in (\[uxt\]), we get the solution of Eq. (\[1.3\]) as $$\label{u4} u(x,t)=\left[\varphi_0\,\left(\frac{2\,n\,(n+1)\,\varphi_0\,\wp(h\,x+w\,t;g_2,0)-A\,(n-1)^2 }{2\,n\,(n+1)\,\varphi_0\,\wp(h\,x+w\,t;g_2,0)+A\,(n-1)^2}\right)\right]^{\frac{1}{n-1}}$$ with the conditions: $A<0,\,B>0,\,g_2>0$ and $A>0,\,B<0,\,g_2>0$ for $\varphi_0=\left(\frac{-A\,(3\,n-1)}{B\,(n+1)}\right)^{1/2}$. While the root $\varphi_0=0$ leads to the trivial solution, $u(x,t)=0$, the other root $\varphi_0=-\left(\frac{-A\,(3\,n-1)}{B\,(n+1)}\right)^{1/2}$ gives rise to imaginary solutions. Now, we can rewrite the solution (\[u4\]) in terms of the lemniscatic case of the Weierstrass function using the relation (\[lc\]) in (\[u4\]): $$\label{u41} u(x,t)=\left[\left(\frac{-A\,(3\,n-1)}{B\,(n+1)}\right)^{1/2}\, \left(\frac{2\,\wp((h\,x+w\,t)\,g_2^{1/4};1,0)+1 }{2\,\wp((h\,x+w\,t)\,g_2^{1/4};1,0)-1}\right)\right]^{\frac{1}{n-1}}$$ for $A<0,\,B>0,\,g_2>0$ and $$\label{u42} u(x,t)=\left[\left(\frac{-A\,(3\,n-1)}{B\,(n+1)}\right)^{1/2}\, \left(\frac{2\,\wp((h\,x+w\,t)\,g_2^{1/4};1,0)-1 }{2\,\wp((h\,x+w\,t)\,g_2^{1/4};1,0)+1}\right)\right]^{\frac{1}{n-1}}$$ for $A>0,\,B<0,\,g_2>0$. - $m=3\,n-2$ In this case, we have also a quartic polynomial $$P(\varphi)=\frac{2\,A\,(n-1)^2}{n\,(n+1)}\,\varphi+\frac{B\,(n-1)^2}{n\,(2\,n-1)}\,\varphi^4 \, .$$ It has two real roots: $\varphi_0=0$ and $\varphi_0=\left(-\frac{2\,A\,(2\,n-1)}{B\,(n+1)}\right)^{1/3}$. For the equation (\[33\]), the invariants are $$g_2=0,\qquad g_3=\frac{-A^2\,B\,(n-1)^6}{4\,n^3\,(n+1)^2\,(2\,n-1)}$$ and $\Delta\neq0$. Now, the solution of (\[33\]) reads from (\[x\]) for $\varphi_0$, $$\label{phi5} \varphi=\varphi_0\,\left[\frac{2\,n\,(n+1)\,\varphi_0\,\wp(\theta;0,g_3)-A\,(n-1)^2 }{2\,n\,(n+1)\,\varphi_0\,\wp(\theta;0,g_3)+2\,A\,(n-1)^2}\right]\,.$$ Then, the solution of Eq. (\[1.3\]) is from (\[uxt\]) as $$\label{u5} u(x,t)=\left[\varphi_0\,\left(\frac{2\,n\,(n+1)\,\varphi_0\,\wp(h\,x+w\,t;0,g_3)-A\,(n-1)^2 }{2\,n\,(n+1)\,\varphi_0\,\wp(h\,x+w\,t;0,g_3)+2\,A\,(n-1)^2}\right)\right]^{\frac{1}{n-1}}$$ with the conditions: $B<0,\,g_3>0$. Taking into account the relation (\[ec\]), this solution also can be expressed in terms of the equianharmonic case of the Weierstrass function: $$\label{u51} u(x,t)=\left[\left(-\frac{2\,A\,(2\,n-1)}{B\,(n+1)}\right)^{1/3}\, \left(\frac{2^{2/3}\,\wp((h\,x+w\,t)\,g_3^{1/6};0,1)-1 }{2^{2/3}\,\wp((h\,x+w\,t)\,g_3^{1/6};0,1)+2}\right)\right]^{\frac{1}{n-1}}\,.$$ We have also plotted these solutions for some special values in Figs. (\[figuras1\])-(\[figuras333\]). We can appreciate that for the considered cases, except the parabolic case (\[35\]), they consist in periodic waves, some are singular while others are regular. Their amplitude is governed by the non-vanishing constants $A,B$ and their formulas are given in terms of the special forms (\[lc\])-(\[ec\]) of the $\wp$ function. ![The left figure corresponds to the solution (\[u31\]) for $h=-2$, $w=1$, $a=-1$, $n=3$, $m=5$ and the right one corresponds to the solution (\[u32\]) for $h=1$, $w=1$, $a=-1$, $n=3$, $m=5$.[]{data-label="figuras1"}](235b.eps "fig:"){width="40.00000%"} ![The left figure corresponds to the solution (\[u31\]) for $h=-2$, $w=1$, $a=-1$, $n=3$, $m=5$ and the right one corresponds to the solution (\[u32\]) for $h=1$, $w=1$, $a=-1$, $n=3$, $m=5$.[]{data-label="figuras1"}](235a.eps "fig:"){width="40.00000%"} ![The left figure corresponds to the solution (\[u31\]) for $h=-2$, $w=1$, $a=-1$, $n=2$, $m=3$ and the right one corresponds to the solution (\[u32\]) for $h=1$, $w=1$, $a=-1$, $n=2$, $m=3$.[]{data-label="figuras111"}](223b.eps "fig:"){width="40.00000%"} ![The left figure corresponds to the solution (\[u31\]) for $h=-2$, $w=1$, $a=-1$, $n=2$, $m=3$ and the right one corresponds to the solution (\[u32\]) for $h=1$, $w=1$, $a=-1$, $n=2$, $m=3$.[]{data-label="figuras111"}](223a.eps "fig:"){width="40.00000%"} ![The left figure corresponds to the solution (\[u41\]) for $h=-2$, $w=1$, $a=-1$, $n=3$, $m=5$ and the right one corresponds to the solution (\[u42\]) for $h=1$, $w=1$, $a=-1$, $n=3$, $m=5$. []{data-label="figuras2"}](135b.eps "fig:"){width="40.00000%"} ![The left figure corresponds to the solution (\[u41\]) for $h=-2$, $w=1$, $a=-1$, $n=3$, $m=5$ and the right one corresponds to the solution (\[u42\]) for $h=1$, $w=1$, $a=-1$, $n=3$, $m=5$. []{data-label="figuras2"}](135a.eps "fig:"){width="40.00000%"} ![The left figure corresponds to the solution (\[u41\]) for $h=-2$, $w=1$, $a=-1$, $n=2$, $m=3$ and the right one corresponds to the solution (\[u42\]) for $h=1$, $w=1$, $a=-1$, $n=2$, $m=3$. []{data-label="figuras222"}](123b.eps "fig:"){width="40.00000%"} ![The left figure corresponds to the solution (\[u41\]) for $h=-2$, $w=1$, $a=-1$, $n=2$, $m=3$ and the right one corresponds to the solution (\[u42\]) for $h=1$, $w=1$, $a=-1$, $n=2$, $m=3$. []{data-label="figuras222"}](123a.eps "fig:"){width="40.00000%"} ![The left figure corresponds to the solution (\[u21\]) for $h=-2$, $w=1$, $a=-1$, $n=2$, $m=5/2$ and the right one corresponds to the solution (\[u51\]) for $h=1$, $w=1$, $a=-1$, $n=3/2$, $m=5/2$.[]{data-label="figuras333"}](2252b.eps "fig:"){width="40.00000%"} ![The left figure corresponds to the solution (\[u21\]) for $h=-2$, $w=1$, $a=-1$, $n=2$, $m=5/2$ and the right one corresponds to the solution (\[u51\]) for $h=1$, $w=1$, $a=-1$, $n=3/2$, $m=5/2$.[]{data-label="figuras333"}](13252a.eps "fig:"){width="40.00000%"} Lagrangian and Hamiltonian ========================== Since Eq. (\[19\]) is a motion-type, we can write the corresponding Lagrangian $$\label{lag} L_W=\frac{1}{2}\,W_{\theta}^2+\frac{A\,n}{n+1}\,W^\frac{n+1}{n}+\frac{B\,n}{m+n}\,W^\frac{m+n}{n}-D\,W\,$$ and, the Hamiltonian $H_W=W_{\theta} P_W -L_W$ reads $$H_W(W,P_W,\theta)=\frac{1}{2}\left[P_W^2-\left(\frac{2\,A\,n}{n+1}\,W^\frac{n+1}{n}+ \frac{2\,B\,n}{m+n}\,W^\frac{m+n}{n}-2\,D\,W\right)\right] \label{hamil}$$ where the canonical momentum is $$P_W=\frac{\partial L_W}{\partial W_\theta}=W_\theta.\label{mo}$$ The independent variable $\theta$ does not appear explicitly in (\[hamil\]), then $H_W$ is a constant of motion, $H_W=E$, with $$E=\frac{1}{2} \left[\left(\frac{dW}{d\theta}\right)^2-\left(\frac{2\,A\,n}{n+1}\,W^\frac{n+1}{n}+ \frac{2\,B\,n}{m+n}\,W^\frac{m+n}{n}-2\,D\,W\right)\right].\label{ee}$$ Note that this equation also leads to the first order ODE (\[25\]) with the identification $C=2\,E$. Now, the energy $E$ can be expressed as a product of two independent constant of motions $$E=\frac{1}{2}\, I_+\,I_- \label{5.1}$$ where $$I_{\pm}(z)=\left(W_\theta\mp \sqrt{\frac{2\,A\,n}{n+1}\,W^\frac{n+1}{n}+ \frac{2\,B\,n}{m+n}\,W^\frac{m+n}{n}-2\,D\,W}\,\right) \,e^{\pm S(\theta)} \label{const}$$ and the phase $S(\theta)$ is chosen in such a way that $I_\pm(\theta)$ be constants of motion ($dI_\pm(\theta)/d\theta=0 $) $$S(\theta)=\int \frac{A\,W^{\frac{1}{n}}+B\,W^{\frac{m}{n}}-D}{\sqrt{\frac{2\,A\,n}{n+1}\,W^\frac{n+1}{n}+ \frac{2\,B\,n}{m+n}\,W^\frac{m+n}{n}-2\,D\,W}}\,d\theta.$$ Conclusions =========== In this paper, we have applied the factorization technique to the $B(m,n)$ equations in order to get travelling wave solutions. We have considered some representative cases of the $B(m,n)$ equation for $m\neq n$. By using this method, we obtained the travelling wave solutions in a very compact form, where the constants appear as modulating the amplitude, in terms of some special forms of the Weierstrass elliptic function: lemniscatic, pseudo-lemniscatic and equiaharmonic. Furthermore, these solutions are not only valid for integer $m$ and $n$ but also non integer $m$ and $n$. The case $m=n$ for the $B(m,n)$ equations has been examined by means of the factorization technique in a previous paper [@kuru] where the compactons and kink-like solutions recovering all the solutions previously reported have been constructed. Here, for $m\neq n$, solutions with compact support can also be obtained following a similar procedure. We note that, this method is systematic and gives rise to a variety of solutions for nonlinear equations. We have also built the Lagrangian and Hamiltonian for the second order nonlinear ODE corresponding to the travelling wave reduction of the $B(m,n)$ equation. Since the Hamiltonian is a constant of motion, we have expressed the energy as a product of two independent constant of motions. Then, we have seen that these factors are related with first order ODE’s that allow us to get the solutions of the nonlinear second order ODE. Remark that the Lagrangian underlying the nonlinear system also permits to get solutions of the system. There are some interesting papers in the literature, where starting with the Lagrangian show how to obtain compactons or kink-like travelling wave solutions of some nonlinear equations [@arodz; @adam; @gaeta1; @gaeta2; @gaeta3]. Acknowledgments {#acknowledgments .unnumbered} =============== Partial financial support is acknowledged to Junta de Castilla y León (Spain) Project GR224. The author acknowledges to Dr. Javier Negro for useful discussions. [99]{} T.B. Benjamin, J.L. Bona and J.J. Mahony, [Philos. Trans. R. Soc., Ser. A]{} 272 (1972) 47. P. Rosenau, J.M. Hyman, [Phys. Rev. Lett.]{} 70 (1993) 564. P. Rosenau, [Phys. Lett. A]{} 275 (2000) 193. A.-M. Wazwaz, T. Taha, [Math. Comput. Simul.]{} 62 (2003) 171. A.-M. Wazwaz, [Appl. Math. Comput.]{} 133 (2002) 229. A.-M. Wazwaz, [Math. Comput. Simul.]{} 63 (2003) 35. A.-M. Wazwaz, [Appl. Math. Comput.]{} 139 (2003) 37. A.-M. Wazwaz, [Chaos, Solitons and Fractals]{} 28 (2006) 454. M.S. Ismail, T.R. Taha, [Math. Comput. Simul.]{} 47 (1998) 519. A. Ludu, J.P. Draayer, [Physica D]{} 123 (1998) 82. A.-M. Wazwaz, M.A. Helal, [Chaos, Solitons and Fractals]{} 26 (2005) 767. S. Yadong, [Chaos, Solitons and Fractals]{} 25 (2005) 1083. L. Wang, J. Zhou, L. Ren, [Int. J. Nonlinear Science]{} 1 (2006) 58. Ş. Kuru, (2008) arXiv:0810.4166. P.G. Estévez, Ş. Kuru, J. Negro and L.M. Nieto, to appear in [Chaos, Solitons and Fractals]{} (2007) arXiv:0707.0760. P.G. Estévez, Ş. Kuru, J. Negro and L.M. Nieto, [J. Phys. A: Math. Gen.]{} 39 (2006) 11441. O. Cornejo-Pérez, J. Negro, L.M. Nieto and H.C. Rosu, [Found. Phys.]{} 36 (2006) 1587. P.G. Estévez, Ş. Kuru, J. Negro and L.M. Nieto, [J. Phys. A: Math. Theor.]{} 40 (2007) 9819. C. Liu, (2006) arXiv.org:nlin/0609058. A.-M. Wazwaz, [Phys. Lett. A]{} 355 (2006) 358. D.-S. Wang and H. Li, [J. Math. Anal. Appl.]{} 243 (2008) 273. M.A. Helal, [Chaos, Solitons and Fractals]{} 13 (2002) 1917. Ji-H. He, Xu-H. Wu, [Chaos, Solitons and Fractals]{} 29 (2006) 108. E.L. Ince, [Ordinary Differential Equations]{}, Dover, New York, 1956. A. Erdelyi et al, [The Bateman Manuscript Project. Higher Transcendental Functions]{},FL: Krieger Publishing Co., Malabar, 1981. E.T. Whittaker and G. Watson, [A Course of Modern Analysis]{}, Cambridge University Press, Cambridge, 1988. M. Abramowitz and I.A. Stegun, [Handbook of Mathematical Functions]{}, Dover, New York, 1972. H. Arodź, [Acta Phys. Polon. B]{} 33 (2002) 1241. C. Adam, J. Sánchez-Guillén and A. Wereszczyński, [J. Phys. A:Math. Theor.]{} 40 (2007) 13625. M. Destrade, G. Gaeta, G. Saccomandi, [Phys. Rev. E]{} 75 (2007) 047601. G. Gaeta, T. Gramchev and S. Walcher, [J. Phys. A: Math. Theor.]{} 40 (2007) 4493. G. Gaeta, [Europhys. Lett.]{} 79 (2007) 20003.

Revealed: The face of the woman accused of brutal McDonald's beating... as it emerges she was arrested for assault last year at the SAME restaurant Police have charged 18-year-old with brutal attack It emerges she was charged with assault at same McDonald's last year Transgender activists plan to hold protest today outside restaurant Indicted: Teonna Brown appeared in front of a grand jury today The teenager accused of brutally beating a transgender woman at a McDonald's in Baltimore County was arrested for assault last year - at the same restaurant. Police today announced they had charged Teonna Monae Brown, 18, after a video emerged of her and another girl allegedly kicking, punching and stamping on Chrissy Lee Polis. The attack was so violent the 22-year-old had a seizure. Brown's own sister turned her in on Friday, telling police she and her alleged accomplice, a 14-year-old girl, had admitted to the attack. News of her arrest came as transgender activists announced they would be holding a protest outside the Rosedale restaurant at 7pm today. Yesterday Miss Polis revealed how she was 'afraid to go outside' after the April 18 assault, which she hinted could be racially motivated as the two attackers were both black. And, in what could be a major blow for McDonald's family-friendly image, she claimed staff stood by and allowed the attack to continue. One worker, Vernon Hackett, filmed the beating and later posted it online, where it attacked hundreds of thousands of viewers. According to police Brown was arrested last July for allegedly attacking a mother after a dispute inside the same McDonald's. In a handwritten police statement seen by the Smoking Gun, mother-of-two Danielle Dower, 38, described how Brown allegedly followed her out of the restaurant yelling : 'Did you call me ugly?' Scroll down for videos Traumatised: Transgender woman Chrissy Lee Polis, 22, said she was too scared to go outside after the April 18 attack at a Baltimore County McDonald's She said Brown 'kept trying to badger us' after she said no and tried to move away with her two daughters. Mrs Dower claims Brown pushed her, but when she pushed back she 'took her fist and threw a punch to my face.' In an attempt to get her children to safety, Mrs Dower went into a nearby shopping centre, but claims Brown and two friends followed them inside. As she called 911, the two friends allegedly seized her daughter by the hair and dragged her across the floor. Shocking: Brown was indicted on assault and hate crime charges for the attack on Chrissy Lee Polis who was brutally beaten until she had a seizure Brutal: The girl suffers blow after blow while staff duck out of the way, right She wrote: 'I had to stop talking to the operator, get on top of my daughter and protect her while trying to fight off those girls.' The fight left her with cuts to her face, and her eldest daughter suffered cuts to her knee and face as well as bruising to her forehead. Brown was charged with two counts of misdemeanour assault, but according to the state attorney the victim later asked for all charges to be dropped, and the case never went to court. Now she faces three first and second-degree assault charges in connection with the April 18 assault of Miss Polis. The 14-year-old, who was also reported by Brown's sister, has been charged as a juvenile. Seizure: The girl shakes on the floor uncontrollably after the attack She has not been named, but police claim she admitted in an interview that she and Brown 'both got into a fight with a woman over using the bathroom.' Yesterday state's attorney Scott D. Shellenberger said hate crime charges were being considered. He said: 'If there is evidence that the crime was racially motivated, we will take a look at those charges and see if we meet those elements. We have the ability, if the facts are there, to upgrade the charges at a later date.' Yesterday their alleged victim, Miss Polis, spoke out for the first time about the beating she received. She said she was afraid to go outside after the attack. She said: 'They just hurt me really bad, and I'm afraid to go outside now because of stuff like this.' In an interview with the Baltimore Sun, she said the violence kicked off after she had used the ladies' restrooms in the McDonald's outlet, but denied reports that this was the reason why the violence erupted. Two attacks? Brown allegedly attacked another woman outside this Rosedale McDonald's last July She said of her attackers: 'They just seemed like they wanted to pick a fight that night.' She said she was approached by one of the girls, who accused her of 'looking at my man'. When Miss Polis insisted that she was not even aware of the girl's partner, the physical abuse began with the girl spitting in her face. She said: 'She started ripping my hair, throwing me on the floor, kicking me in my face. 'I got up and tried to hit the girl. I had her in a corner, to try to get her off me, and the other girl came up and started kicking me in my face, punching me in my nose, ripping my earring out of my earlobes.' Miss Polis said there was no way to escape the attack, adding: ' Every time I tried to walk away they followed me.' Fired: Vernon Hackett, the employee who shot the footage, has been sacked from his job at the McDonald's outlet Miss Polis said: 'Everybody in that McDonald's sat there and watched me get hurt. Nobody did nothing at all. 'And then they tried to tell [the girls] to leave because the cops were coming, so they could protect them and not me. 'I remember the guy working at McDonald's was taping me on his cell phone, and I told him to get it out of my f***ing face. And he sat there, and he must have taped me even further.' The fast-food chain has issued a statement about the safety of its customers being paramount, and Rosedale franchise owner Mitchell McPherson yesterday announced that employee Vernon Hackett had been fired. At one point in the video he can be heard laughing hysterically at the violence. Hackett raised the ire of his employers after claiming credit for filming the video on his Facebook account, which he has since taken down. Mr McPherson said: 'My first and foremost concern is with the victim. I'm as shocked and disturbed by this assault as anyone would be. The behaviour displayed in the video is unfathomable and reprehensible.' Mr McPherson added that action might also be taken against other restaurant workers. Warning: Video contains graphic images and profanity

10-2797-ag Wu v. Holder UNITED STATES COURT OF APPEALS FOR THE SECOND CIRCUIT SUMMARY ORDER RULINGS BY SUMMARY ORDER DO NOT HAVE PRECEDENTIAL EFFECT. CITATION TO A SUMMARY ORDER FILED ON OR AFTER JANUARY 1, 2007, IS PERMITTED AND IS GOVERNED BY FEDERAL RULE OF APPELLATE PROCEDURE 32.1 AND THIS COURT’S LOCAL RULE 32.1.1. WHEN CITING A SUMMARY ORDER IN A DOCUMENT FILED WITH THIS COURT, A PARTY MUST CITE EITHER THE FEDERAL APPENDIX OR AN ELECTRONIC DATABASE (WITH THE NOTATION “SUMMARY ORDER”). A PARTY CITING A SUMMARY ORDER MUST SERVE A COPY OF IT ON ANY PARTY NOT REPRESENTED BY COUNSEL. At a stated term of the United States Court of Appeals for the Second Circuit, held at the Daniel Patrick Moynihan United States Courthouse, 500 Pearl Street, in the City of New York, on the 12th day of January, two thousand twelve. PRESENT: DENNIS JACOBS, Chief Judge, JON O. NEWMAN, PIERRE N. LEVAL, Circuit Judges. _______________________________________ XIU QIN HUANG v. HOLDER,1 08-5530-ag A077 958 016 _______________________________________ YAO LING WANG, XIAO GAO v. HOLDER, 10-291-ag A088 378 231 A088 378 232 _______________________________________ XUE QIN LIN v. U.S. DEP’T OF JUSTICE, ERIC H. HOLDER, JR., 10-321-ag A099 083 219 1 Pursuant to Federal Rule of Appellate Procedure 43(c)(2), Attorney General Eric H. Holder, Jr., is automatically substituted as respondent where necessary. 09262011-1-28 ZHONG LIN JIANG v. HOLDER, 10-460-ag A099 697 058 _______________________________________ YUE JIN LIU v. HOLDER, 10-843-ag A088 530 507 _______________________________________ QIN LIN v. HOLDER, 10-923-ag A088 377 936 _______________________________________ YING WANG v. HOLDER, 10-947-ag A088 378 141 _______________________________________ JIAN XIN GAO v. HOLDER, 10-1022-ag A089 253 260 _______________________________________ XIU QIN CHEN v. HOLDER, 10-1031-ag A098 480 124 _______________________________________ XIAO JING XIA, CHANG GUANG DONG v. HOLDER, 10-1036-ag A098 973 227 A098 902 360 _______________________________________ YIN YING CAO v. HOLDER, 10-1171-ag A099 927 142 _______________________________________ MEI RU LIN v. HOLDER, 10-1268-ag A098 279 231 ___________________________ XIU FANG CHEN, A.K.A. JIN FANG CHEN v. HOLDER, 10-1291-ag A088 380 456 _______________________________________ 09262011-1-28 -2- MEI ZHU LIN v. HOLDER, 10-1292-ag A093 396 857 _______________________________________ ZHU CHAO WANG v. HOLDER, 10-1293-ag A089 253 373 _______________________________________ QIN PING LIN, FEI GUAN v. HOLDER, 10-1422-ag A090 347 257 A090 347 258 _______________________________________ LIN FEI XIE v. HOLDER, 10-1424-ag A099 683 978 _______________________________________ AI QIN SHI, A.K.A. XI LEI YANG, YONG JIE LIU v. HOLDER, 10-1837-ag A089 252 403 A089 252 404 _______________________________________ XIU JIANG HUANG v. HOLDER, 10-1895-ag A088 524 966 _______________________________________ YU PING BAO v. HOLDER, 10-1902-ag (L); A098 419 779 11-843-ag (Con) _______________________________________ YONG CHEN v. HOLDER, 10-1998-ag A070 898 117 _______________________________________ XUE M. ZHENG v. HOLDER, 10-2013-ag A088 530 523 _______________________________________ XIAODAN XU v. HOLDER, 10-2249-ag A099 424 976 _______________________________________ 09262011-1-28 -3- QIAO RONG LIN v. HOLDER, 10-2400-ag A099 927 241 _______________________________________ SAIHU WANG v. HOLDER, 10-2656-ag A096 808 755 _______________________________________ JIANDAN WU, ZHIXIANG CHENG v. HOLDER, 10-2797-ag A088 552 425 A099 186 862 _______________________________________ QIU YUN NI v. HOLDER 10-3336-ag A089 253 069 _______________________________________ UPON DUE CONSIDERATION of these petitions for review of Board of Immigration Appeals (“BIA”) decisions, it is hereby ORDERED, ADJUDGED, AND DECREED, that the petitions for review are DENIED. Each of these petitions challenges a decision of the BIA either affirming the decision of an immigration judge (“IJ”) denying asylum and related relief or reversing the IJ’s decision granting relief. Some of the petitioners2 also challenge decisions of the BIA denying motions to remand or reopen. The applicable standards of review are well- 2 The Petitioners in Zhong Lin Jiang v. Holder, No. 10-460-ag; Qin Lin v. Holder, No. 10-923-ag; and Yu Ping Bao v. Holder, Nos. 10-1902-ag (L), 11-843-ag (Con). 09262011-1-28 -4- established. See Jian Hui Shao v. Mukasey, 546 F.3d 138, 157- 58, 168-69 (2d Cir. 2008). Petitioners, all natives and citizens of China, sought relief from removal based on their claims that they fear persecution because they have had one or more children in violation of China’s population control program. For largely the same reasons as this Court set forth in Jian Hui Shao, 546 F.3d 138, we find no error in the agency’s decisions. See id. at 158-72. While the petitioners in Jian Hui Shao were from Fujian Province, as are most of the petitioners here, some petitioners3 are from Zhejiang Province. Regardless, as with the evidence discussed in Jian Hui Shao, the evidence they have submitted relating to Zhejiang Province is deficient either because it does not discuss forced sterilizations or because it references isolated incidents of persecution of individuals who are not similarly situated to the petitioners. See id. at 160-61, 171-72. 3 The petitioners in Xiao Jing Xia, Chang Guang Dong v. Holder, No. 10-1036-ag; Lin Fei Xie v. Holder, No. 10-1424-ag; Saihu Wang v. Holder, No. 10-2656-ag; and Jiandan Wu, Zhixiang Cheng v. Holder, No. 10-2797-ag. 09262011-1-28 -5-  Some of the petitioners4 argue that the BIA erred by improperly conducting de novo review of determinations made by an IJ. Many of them rely on a decision of the Third Circuit, ruling, in the context of a claim under the Convention Against Torture (“CAT”), that, although the BIA may review de novo conclusions of law as to whether the facts found satisfy a particular legal standard, it must employ a clear error standard in reviewing findings of fact, including predictions of future events. See Kaplun v. Attorney General, 602 F.3d 260 (3d Cir. 2010). Their claims lack merit. The BIA has not reviewed de novo any of the IJs’ factual findings. Instead, the BIA has concluded, on de novo review, that the factual findings do not meet the legal standard of an objectively reasonable fear of persecution, in these cases, a fear of forced sterilization or economic persecution. That approach is entirely consistent with the applicable regulation, 8 C.F.R. § 1003.1(d)(3). See Jian Hui Shao, 546 F.3d at 162-63 (concluding that the BIA did not erroneously conduct de novo 4 The petitioners in Zhong Lin Jiang v. Holder, No. 10-460-ag; Yue Jin Liu v. Holder, No. 10-843-ag; Yin Ying Cao v. Holder, No. 10-1171-ag; Xiu Fang Chen v. Holder, No. 10-1291-ag; Mei Zhu Lin v. Holder, No. 10-1292-ag; Qin Ping Lin, Fei Guan v. Holder, No. 10- 1422-ag; Lin Fei Xie v. Holder, No. 10-1424-ag; Ai Qin Shi, Yong Jie Liu v. Holder, No. 10-1837-ag; Xiu Jiang Huang v. Holder, No. 10-1895-ag; Yu Ping Bao v. Holder, Nos. 10-1902-ag (L), 11-843-ag (Con); Yong Chen v. Holder, No. 10-1998-ag; and Qiu Yun Ni v. Holder, No. 10-3336-ag. 09262011-1-28 -6- review of the IJ’s factual findings by making “a legal determination that, while [petitioners’] credible testimony was sufficient to demonstrate a genuine subjective fear of future persecution, more was needed to demonstrate the objective reasonableness of that fear”). Some of the petitioners5 argue that the BIA failed to give sufficient consideration to the statement of Jin Fu Chen, who alleged that he suffered forced sterilization after his return to China based on the births of his two children in Japan. A prior panel of this Court has remanded a petition making a similar claim so that Jin Fu Chen’s statement (which was submitted to the BIA after a remand) could be considered by the IJ. See Zheng v. Holder, No. 07-3970-ag (2d Cir. Jan. 15, 2010). Since the remand in Zheng, the BIA has repeatedly concluded that Jin Fu Chen’s statement does not support a claim of a well-founded fear of persecution. Accordingly, it is clear that further consideration of the statement in cases 5 The petitioners in Xiu Qin Huang v. Holder, No. 08-5530-ag; Zhong Lin Jiang v. Holder, No. 10-460-ag; Yue Jin Liu v. Holder, No. 10-843-ag; Xiao Jing Xia, Chang Guang Dong v. Holder, No. 10- 1036-ag; Yin Ying Cao v. Holder, No. 10-1171-ag; Xiu Fang Chen v. Holder, No. 10-1291-ag; Mei Zhu Lin v. Holder, No. 10-1292-ag; Zhu Chao Wang v. Holder, No. 10-1293-ag; Qin Ping Lin, Fei Guan v. Holder, No. 10-1422-ag; Lin Fei Xie v. Holder, No. 10-1424-ag; Ai Qin Shi, Yong Jie Liu v. Holder, No. 10-1837-ag; Xiu Jiang Huang v. Holder, No. 10-1895-ag; Yong Chen v. Holder, No. 10-1998-ag; and Qiao Rong Lin v. Holder, No. 10-2400-ag. 09262011-1-28 -7- in which the IJ or the BIA failed to consider it would not change the result. See Shunfu Li v. Mukasey, 529 F.3d 141, 150 (2d Cir. 2008). Furthermore, the agency’s conclusion concerning the probative force of the statement was not in error. Similarly, contrary to the argument raised in five of these cases,6 it would be futile to remand for further consideration of the statements of Mei Yun Chen and Jiangzhen Chen, women claiming to have been forcibly sterilized in Fujian Province for violating the family planning policy with the birth of their second children in Romania and Japan respectively, because the BIA has reasonably found that neither woman is similarly situated to Chinese nationals returning to China with U.S. citizen children. See id.; see also Jian Hui Shao, 546 F.3d at 155, 161, 171-72. We are without jurisdiction to consider two of the petitions7 to the extent they seek review of the agency’s pretermission of petitioners’ applications for asylum as untimely. See 8 U.S.C. § 1158(a)(3). 6 In Yue Jin Liu v. Holder, No. 10-843-ag; Zhu Chao Wang v. Holder, No. 10-1293-ag; Qin Ping Lin, Fei Guan v. Holder, 10-1422- ag; Ai Qin Shi, Yong Jie Liu v. Holder, No. 10-1837-ag; and Yong Chen v. Holder, No. 10-1998-ag. 7 The petitions in Qin Lin v. Holder, No. 10-923-ag; and Ying Wang v. Holder, No. 10-947-ag. 09262011-1-28 -8-  In Xiu Qin Huang v. Holder, No. 08-5530-ag, the agency reasonably relied on 2006 and 2007 U.S. Department of State reports as opposed to the outdated 1997 Tantou Town Family Planning Temporary Regulations petitioner submitted. See Jian Hui Shao, 546 F.3d at 166. Moreover, it does not appear that the Tantou Town Regulations were material to petitioner’s case because the record evidence indicated that she resided and feared persecution in Hunan Town and not Tantou Town. Although petitioner refers to Tantou Town as her “hometown” in her brief, unsworn statements in a brief are not evidence. See Kulhawik v. Holder, 596 F.3d 296, 298 (2d Cir. 2009). In Zhong Lin Jiang v. Holder, No. 10-460-ag, the BIA did not err in declining to address the evidence petitioner submitted for the first time on appeal. See 8 C.F.R. § 1003.1(d)(3)(iv); see also Matter of Fedorenko, 19 I. & N. Dec. 57, 74 (BIA 1984). Regardless, the evidence submitted was largely cumulative of the evidence in the record and not materially distinguishable from the evidence discussed in Jian Hui Shao. In Qin Lin v. Holder, No. 10-923-ag, the BIA similarly did not err when it denied petitioner’s motion to remand based on her failure to establish her prima facie eligibility for relief. See Li Yong Cao v. U.S. Dep’t of 09262011-1-28 -9- Justice, 421 F.3d 149, 156 (2d Cir. 2005); see also Jian Hui Shao, 546 F.3d at 165, 172. In Ying Wang v. Holder, No. 10-947-ag, the agency reasonably found speculative the petitioner’s claimed fear that she would face persecution based on her intent to join an unregistered church in China. See Jian Xing Huang v. INS, 421 F.3d 125, 129 (2d Cir. 2005); see also Hongsheng Leng v. Mukasey, 528 F.3d 135, 143 (2d Cir. 2008). In Mei Ru Lin v. Holder, No. 10-1268-ag, we do not consider petitioner’s unexhausted past persecution claim. See Foster v. INS, 376 F.3d 75, 78 (2d Cir. 2004). In Zhu Chao Wang v. Holder, No. 10-1293-ag, the IJ did not abuse his discretion by declining to admit petitioner’s late-filed evidence because that evidence pre-dated the hearing at which he closed the record. See Dedji v. Mukasey, 525 F.3d 187, 191 (2d Cir. 2008). In Yu Ping Bao v. Holder, Nos. 1902-ag (L), 11-843-ag (Con), the BIA did not err in finding that the petitioner failed to establish her prima facie eligibility for relief based on her newly commenced practice of Falun Gong in the United States because she did not submit evidence that authorities in China are aware of or likely to become aware of her activities in the United States. See Hongsheng Leng, 528 F.3d at 143. 09262011-1-28 -10-  Finally, in Jiandan Wu, Zhixiang Cheng v. Holder, No. 10- 2797-ag, petitioners assert the BIA, in ruling that they failed to satisfy the exceptional and extremely unusual hardship requirement, erroneously minimized the impact their removal would have on their U.S. citizen children. The contention is both ineffective and moot. It is ineffective because the challenged decision was discretionary and did not involve a question of law or constitutional claim; our court is therefore without jurisdiction to review it. See Mendez v. Holder, 566 F.3d 316, 319-23 (2d Cir. 2009) (citing 8 U.S.C. § 1252(a)(2)(B); Barco-Sandoval v. Gonzales, 51 6 F.3d 35, 39 (2d Cir. 2008). The contention is in addition moot because the agency also dispositively denied cancellation of removal, which decision petitioners have not challenged (and which we, in any event, would lack jurisdiction to review because it was a discretionary decision not involving a question of law or constitutional claim. See id.). For the foregoing reasons, these petitions for review are DENIED. As we have completed our review, any stay of removal that the Court previously granted in these petitions is VACATED, and any pending motion for a stay of removal in these petitions is DISMISSED as moot. Any pending request for oral 09262011-1-28 -11- argument in these petitions is DENIED in accordance with Federal Rule of Appellate Procedure 34(a)(2), and Second Circuit Local Rule 34.1(b). FOR THE COURT: Catherine O’Hagan Wolfe, Clerk 09262011-1-28 -12- 

Living With Zika In Puerto Rico Means Watching, Waiting And Fearing Judgment Enlarge this image toggle caption Marisa Penaloza/NPR Marisa Penaloza/NPR Micaela Delgado is a beautiful dark-eyed baby girl with a ready smile. She's 8 months old. She's one of more than 1,000 babies already born in Puerto Rico to mothers with Zika. Her mother, Yalieth Gonzalez, 22, says despite all her worries, so far Micaela's development appears normal. "She's very active, she's up on her own now, she's crawling," Gonzalez says. "She's saying, 'mama' and 'papa' already. She's a very happy baby. She has a lot of energy." But Gonzalez is on alert for signs of trouble. Gonzalez doesn't know how she got Zika, which is spread by mosquitoes. She was just three months pregnant when she had symptoms and went to the hospital. Doctors monitored her baby's development with regular ultrasounds and warned her about the possibility of birth defects. The worst part of her pregnancy was her delivery. Gonzalez says she was in labor for 22 long, agonizing hours and she spent that time worrying. "'What would I do if she was born with health problems?' I thought. I was young. What would my life be like? I wanted to see her, but at the same time, I was scared, scared of how I would feel if she was born with medical problems." Since Zika appeared in Puerto Rico more than a year ago, doctors believe as many as a million people on the island have been infected. Some 40,000 of those cases have been confirmed, a number that includes some 3,200 pregnant women. Doctors in Puerto Rico are just beginning to assess the long-term consequences for children born to mothers with Zika. Yalieth Gonzalez was treated at the High Risk Pregnancy Clinic at the University of Puerto Rico's hospital. Dr. Alberto de la Vega has seen one-fifth of the pregnant women on the island who tested positive for Zika. "Among those patients we've had at least 14 or 15 confirmed cases in which severe brain damage, caused by the Zika virus, has occurred," he says. Some of those cases included microcephaly. For babies born to mothers infected in the first trimester, de la Vega says the risk of brain damage is between 2 and 4 percent. But he's seeing many other problems in his patients infected with Zika, including mothers going into premature labor and a higher number of miscarriages. What worries him most is that even in cases where babies appear normal, their brains show lagging growth. "What does that mean in terms of future development? No one has an idea," he says. "If you have a condition that can cause severe brain damage, it's not going to be an either-or situation. There has to be a spectrum of problems that are yet to be defined." De la Vega and other doctors are also concerned about young children who contract Zika after birth, at a time when their brains are still actively developing. Puerto Rico's Health Department plans to monitor these children for three to five years. Many are being seen at the University of Puerto Rico by Dr. Carmen Zorrilla. She runs the Maternal Infant Studies Center at the University of Puerto Rico hospital, which was established 30 years ago to help women living with HIV. Zika, she says, presents some of the same challenges for pregnant women. Zorrilla also compares the impact of Zika with that of rubella, which caused birth defects in tens of thousands of children in the U.S. until a vaccine was discovered in the late 1960s. Years later, Zorrilla says, researchers checked back with adults who had been born to mothers infected with rubella but who appeared normal at birth. "They found an increased rate of schizophrenia and bipolar disorders in these people who were exposed to rubella while they were in utero," she says. "So, it's not until 20 years from now that we might say, 'Oh, Zika caused this or that.'" With the rainy season approaching, the time when disease-carrying mosquitoes become active, Zorrilla worries many on the island have become complacent. One problem, she says, is that women who have babies with birth defects have been reluctant to go public because, like HIV, Zika carries a stigma. Zorrilla has heard comments like, "Oh, you were not protecting yourself?," "You were not using the mosquito repellent?" or "You were not using condoms?" "You have pregnant women with a viral disease that may cause birth defects which is serious," Zorrilla says. "And then you're blaming them for getting it." That's how Yalieth Gonzalez felt when she found out she was infected with Zika. Concerned she would be judged, at first, she only shared the news with her mother and the baby's father. Her daughter Micaela sees the pediatrician every month to check her development, head size and other benchmarks. Doctors are also monitoring the baby's vision and hearing. It all looks good now, but it could be years before any anomalies are identified. It was only after Micaela was born that Gonzalez says she felt strong enough to share her story with friends. "People should know that Zika is real. I was lucky that my baby was born healthy. There are many people in Puerto Rico who don't take Zika seriously, and we should," she says. Epidemiologists expect to see fewer cases in Puerto Rico this year than last, but the disease is now endemic on the island. That means, until a vaccine is available, Zika will continue to pose a risk for women who become pregnant, and for their babies.

Q: Conditionally closing a tag in HAML I'm iterating through a set of items and displaying them in lists nested in divs. The goal is to have a div for each day and within each div show the items for that day. How do I do this in HAML? I don't think I can (or should) conditionally close and create a new tag like I could in erb. I tried: - @items.each do |item| - if item date is diff from previous make a new container .container %h2 #{item.date} = yield_content :display_item item - else = yield_content :display_item item But this creates the following: <div class="container"> <h2>01/28/2012</h2> <ul> <li> ... item </li> </ul> </div> <li> ...item </li> But I want the other item in the same div. I'm using ruby, sinatra (including the content_for helper) A: The answer is to use more and better Ruby :) - @items.group_by(&:date).each do |date,items| .container %h2= date - items.each do |item| = yield_content :display_item item See Enumerable#group_by docs for more details. You could close and re-open the containers and headers as you were thinking, but this is a horrible, hard-to-maintain hack that I would suggest against. Embrace the elegance of Ruby and Haml; don't write Haml like it was ERB.

A Dutch criminal caught with a fake identity card in a luxury Dublin apartment during a Garda operation targeting the Kinahan gang has been given a one-month jail sentence. Naoufal Fassih (35), who is of Moroccan origin, pleaded guilty to having a false instrument – a forged Belgian ID card – and possessing cannabis worth €40 when he was found in an apartment on Lower Baggott St on April 7 last. He had already spent two and half months in custody on remand prior to his sentence hearing at Cloverhill District Court on Thursday. Fassih, once described in court as a “man of means”, was wearing €800 runners and allegedly had three designer watches worth more than €80,000 when arrested. He has 12 prior criminal convictions for serious offences in the Netherlands dating back to 1998. Garda Eoin Kane, of Kevin Street station's Drugs Unit, told Judge John Lindsay that courts in Amsterdam had previously given Fassih jail terms. In 2014, he was sentenced to 20 months, in 2002 he got a three and a half year sentence and in 2000 a two year prison term. His earlier crimes included: two counts of unauthorised use of weapons, ammunition and explosives as well as extortion and attempted extortion and embezzlement, assault, openly joining forces to commit violence against other people and drugs offences. However he had no prior convictions in Ireland. Fassih is also awaiting extradition to the Netherlands on other charges. Gda Kane told the court that a warrant was obtained under the Misuse of Drugs Act to search the apartment. Fassih told gardai his name was Omar Ghazouani and he had Belgian ID card with that name and it had his photo. Gardai also discovered a passport in another name and cannabis in the form of herb, resin and oil worth €40. He continued to maintain his name was Omar Ghazouani when he was detained for questioning at Kevin Street Garda station and during a subsequent court hearing when he was applying for bail. However, gardai established his real identify through the assistance of Interpol and Fassih was refused bail on April 15. Gda Kane agreed with defence counsel John Byrne (instructed by solicitor Barry O'Donoghue) that the search was a result of receiving confidential information which did not relate to Fassih. He also agreed with counsel that they did not expect to find him there. Mr Byrne said his client's explanation for being in Ireland was that he was here for a girlfriend. Mr Byrne said the name on the ID card and the passport did not match up and the offence was amateurish. Judge Lindsay said “all crimes are amateurish, when they're caught”. Fassih sat silently throughout the hearing. His counsel said he would be resisting attempts to extradite him to the Netherlands where he faces charges for “three relatively minor offences”. He left school at 18 and worked in construction and his last sentence in 2013, which was a four-month prison term, was relatively modest, counsel said. The maximum sentence for the forged document charge was 12 months, the court heard. Judge Lindsay noted he has been in custody on remand since mid-April and he imposed a one-month jail term for that offence. He gave the accused the benefit of the Probation Act for the drugs charge. Fassih was initially refused bail on April 15 by Judge Cormac Dunne at Dublin District Court after the prosecution successfully argued that he was a fight risk. Gardai had said in evidence that he had €800 runners and three designer watches in total worth €83,000 when arrested at the apartment on Lower Baggott Street. Garda Kane had also said that the man was arrested during an operation targeting members of the Kinahan organised crime gang. Gda Kane also said that during the search of the apartment also found there were: €300, Stg £12,825, a Rolex watch worth €8,350, another Rolex watch valued at €35,000 and an Audamars Piguet Royal Oak limited edition Michael Schumacher watch valued €40,000. Mr Fassih also failed in a High Court action to get released on bail. Online Editors

A messed-up order allegedly led a Huber Heights man to drive his pick-up truck through the front door of a local Taco Bell early this morning. According to police, the unidentified customer complained to employees that a 99-cent taco was missing from his order. Though they provided him with a fresh taco, the man still felt the need to file his grievance with the restaurant's entrance using his vehicle. Officers eventually tracked the driver down thanks to a trail of fluids he left in his wake, and arrested him for felony vandalism. He offered no alternative explination for his actions: He was simply mad about the missing taco. "Usually people don't run into Taco Bell intentionally just for a missing taco," noted Sgt. Chris Kash. [screengrab via WDTN]

Every now and then you’ll find yourself in a position where you’ll need to address unacceptable behavior on the part of one of your students. Some of these behaviors include: cheating, plagiarism, sleeping in class, lying, being disrespectful, disruptive, or abusive. Whichever the case may be, it is always disappointing when students engage in these types of behaviors, and at times, you may feel frustrated, angry, or even helpless. At times like these, it is important to remember that an improper behavior on the part of your student, does not warrant an in-kind retaliatory response on your part. I’m not saying you should ignore the behavior, on the contrary. I’m a strong advocate for addressing unacceptable behavior immediately. What I am saying is that your personal feelings towards your student’s behavior should not be the basis for your response. It will be difficult in the beginning to try to be completely impartial and to remain emotionally detached from the situation, but it gets easier with time and practice. I am always disappointed when my students do something that warrants disciplinary action, but I don’t take it personally. So, how do you deal with disciplinary problems? Here are 5 tips that will help: #1. School Policy:

<?xml version="1.0"?> <window xmlns:html="http://www.w3.org/1999/xhtml" class="reftest-wait" xmlns="http://www.mozilla.org/keymaster/gatekeeper/there.is.only.xul" title="Testcase bug 311661 - Evil xul testcase, using display:table-row causes crash [@ nsTableRowGroupFrame::GetFirstRow]"> <html:script><![CDATA[ function doe() { document.documentElement.getElementsByTagName('*')[1].style.display='table-row'; setTimeout(doe2,20); } function doe2(){ document.documentElement.getElementsByTagName('*')[1].style.display=''; setTimeout(doe,20); } ]]></html:script> <button id="button" onclick="doe()" label="Mozilla should not crash, when clicking this button"/> <div style="display:table-row"/> <html:script> function clickbutton() { var ev = document.createEvent('MouseEvents'); ev.initMouseEvent("click", true, true, window, 0, 0, 0, 0, 0, false, false, false, false, 0, null); var button = document.getElementById('button'); button.dispatchEvent(ev); setTimeout(function() { document.documentElement.className = "" }, 500); } window.addEventListener("load", clickbutton, false); </html:script> </window>

I Kungsträdgården i Stockholm står en tung, grön bronsstaty av Karl XII. Kungen har en dragen värja i handen och pekar österut i en manande gest mot den ryska björnen. Ända sedan den avtäcktes den 30 november 1868, på 150-årsdagen av kungens död i Norge, har statyn varit ett laddat nationellt monument och bråken började redan under invigningen. De bättre platserna nära statyn hade reserverats för överhet och borgerskap, arbetarna protesterade och massorna skingrades brutalt av beriden militär. Motsättningarna mellan rika och fattiga kastade sin skugga över ceremonin, som snarast varit avsedd att spegla nationens enhet och samling mot en gemensam yttre fiende.

config BR2_PACKAGE_LIBVA_UTILS bool "libva-utils" depends on BR2_INSTALL_LIBSTDCPP depends on !BR2_STATIC_LIBS # libva depends on BR2_TOOLCHAIN_HAS_THREADS # libva select BR2_PACKAGE_LIBVA help Libva-utils is a collection of tests for VA-API (Video Acceleration API) https://01.org/vaapi comment "libva-utils needs a toolchain w/ C++, threads, dynamic library" depends on !BR2_INSTALL_LIBSTDCPP || \ BR2_STATIC_LIBS || !BR2_TOOLCHAIN_HAS_THREADS

Project summary: The global aim of our studies is to optimize clinical trial methodology in the field of Traumatic Brain Injury (TBI) to maximize the chance of demonstrating benefit of new therapies. The proposal concerns a combined methodological and clinically orientated research project involving multidisciplinary expertise from the field of biostatistics, epidemiology and clinical neurotraumatology. It is organized as an international collaboration and built on the sharing of extensive TBI databases. We will create the IMPACT* database as a unique research resource, including data from a total of over 40,000 patients from five multi-center surveys and eleven clinical trials. This database will be used as culture medium for improving trial design. Specific aim 1 will address the benefits of covariate adjustment and innovative statistical approaches which better exploit the ordinal nature of TBI outcome measures. Specific aim 2 will use advanced statistical techniques for dealing with center effects and variation in patient management. We anticipate that results will also provide novel evidence in support of treatment recommendations in TBI, an area where to date evidence is woefully inadequate. Specific aim 3 will provide recommendations for better standardization and increased sensitivity of outcome measures. Specific aim 4 will address the relative merits of the large, simple "mega trial" compared to a conventional focused phase III trial and will greatly assist in choosing the best design for future trials. Our results will contribute to the broader NIH plans for reshaping clinical research infrastructure and will facilitate the efficient execution of clinical research in the field of TBI. Relevance: Traumatic Brain Injury constitutes a major health and socioeconomic problem throughout the world. Pre- clinical work has generated many promising therapies, but clinical studies have failed to show convincing evidence of efficacy in the overall TBI population. Various agents may wrongly have been discarded due to insensitive clinical trial methodology. We aim to improve trial methodology to give new therapies a better chance in the future, and thus to contribute to improved standards of care for future patients. IMPACT: International Mission on Prognosis and Analysis of Clinical Trials in TBI.

Q: Why does the Ebay application automatically startup at boot? I can't find a good reason that this application must always be running on my phone. However, it starts at boot and I'm constantly getting error traces in Logcat about the Ebay application. Why does this application start at boot? A: Well it starts because that's how dev coded it. You can try programs like startup manager that will kill the program once it starts.

(ANTIWAR.COM) — The British Defense Secretary is announcing that 800 commandos are being deployed into Norway starting next year, and continuing every winter for at least a decade. The troops will join US and Dutch troops there, and are targeting Russia. The program is built around claims of Russian aggression, and the idea that global warming will lead Russia to stake out new claims in the far north, near where old Soviet-era bases exist, for natural resources. Britain has no natural claims this far north, but that isn’t stopping them from throwing troops at the region with an eye on clashing with Russia, and officials say it is vital to “demonstrate we’re there” in the Arctic Circle. There has long been speculation of a rush to claim resources in the north, but NATO nations have been sending more and more troops to every Russian frontier area for years now, always nominally to counter “aggression” that exists purely as a talking point to justify more military spending. By Jason Ditz / Republished with permission / ANTIWAR.COM / Report a typo These articles were chosen for republication based on the interest of our readers. Anti-Media republishes stories from a number of other independent news sources. The views expressed in these articles are the author’s own and do not reflect Anti-Media editorial policy.

[The relationship between hereditary characteristics in the blood (Phi-PO2-Pgd) and susceptibility to stress in swine. A pilot study]. Deaths during transport and the incidence of a poor quality of the meat in pigs were the most important reasons for studying the stress-syndrome (MHS) during the past twenty years. MHS is controlled by an autosomal Hal locus with two alleles N and n. Only pigs of genotype nn are sensitive to halothane and susceptible to stress. As a standard test for use in practice, the halothane test was developed in the Netherlands in 1974 and only this test is used to detect MHS. Heterozygotes can not be detected using this test. Since 1986, additional blood typing was carried out for the systems Phi, Po2 en Pgd in litters including at least one halothane-positive reactor. Blood typing was carried out in 533 pigs of four different lines of breeding company Cofok in Oosterhout and was found to be very successful (using the linkage groups) in identifying the heterozygotes. In 15.5 per cent of the offspring, it could not be stated whether the genotype was HalNN or HalNn. This was due to the fact that in these Nn x Nn matings the two haplotypes of one or both parents were identical. In this population, the haplotype PhiB-Po2S-PgdB was strongly (72-89 per cent) linked to the Haln-allele.

Public Bank (Hong Kong) Public Bank (Hong Kong) Limited (Chinese: 大眾銀行(香港)有限公司) is a licensed bank in Hong Kong. Originally named Asia Commercial Bank Limited and owned by Asia Financial Holdings Limited (SEHK: 662, ), it was acquired by Public Financial Holdings Limited (SEHK: 626, a Public Bank Berhad subsidiary, formerly JCG Financial Holdings Limited, ), completed on 30 May, 2006. It was subsequently renamed on 30 June, 2006. It was established in Hong Kong in the 1930s. See also List of banks in Hong Kong External links Official website Category:Banks of Hong Kong Category:Banks established in the 1930s

Q: Using XPath Contains against HTML in Java I'm scraping values from HTML pages using XPath inside of a java program to get to a specific tag and occasionally using regular expressions to clean up the data I receive. After some research, I landed on HTML Cleaner ( http://htmlcleaner.sourceforge.net/ ) as the most reliable way to parse raw HTML into a good XML format. HTML Cleaner, however, only supports XPath 1.0 and I find myself needing functions like 'contains'. for instance, in this piece of XML: <div> <td id='1234 foo 5678'>Hello</td> </div> I would like to be able to get the text 'Hello' with the following XPath: //div/td[contains(@id, 'foo')]/text() Is there any way to get this functionality? I have several ideas, but would prefer not to reinvent the wheel if I don't need to: If there is a way to call HTML Cleaner's evaluateXPath and return a TagNode (which I have not found), I can use an XML serializer on the returned TagNode and chain together XPaths to achieve the desired functionality. I could use HTML Cleaner to clean to XML, serialize it back to a string, and use that with another XPath library, but I can't find a good java XPath evaluator that works on a string. Using TagNode functions like getElementsByAttValue, I could essentially recreate XPath evaluation and insert in the contains functionality using String.contains Short question: Is there any way to use XPath contains on HTML inside an existing Java Library? A: Regarding this: I could use HTML Cleaner to clean to XML, serialize it back to a string, and use that with another XPath library, but I can't find a good java XPath evaluator that works on a string. This is exactly what I would do (except you don't need to operate on a string (see below)). A lot of HTML parsers try to do too much. HTMLCleaner, for example, does not properly/completely implement the XPath 1.0 spec (contains (for example) is an XPath 1.0 function). The good news is that you don't need it to. All you need from HTMLCleaner is for it to parse the malformed input. Once you've done that, it's better to use the standard XML interfaces to deal with the resulting (now well-formed) document. First convert the document into a standard org.w3c.dom.Document like this: TagNode tagNode = new HtmlCleaner().clean( "<div><table><td id='1234 foo 5678'>Hello</td>"); org.w3c.dom.Document doc = new DomSerializer( new CleanerProperties()).createDOM(tagNode); And then use the standard JAXP interfaces to query it: XPath xpath = XPathFactory.newInstance().newXPath(); String str = (String) xpath.evaluate("//div//td[contains(@id, 'foo')]/text()", doc, XPathConstants.STRING); System.out.println(str); Output: Hello

German Chancellor Angela Merkel Blasts Trump on Trade; Claims Germany Invests 10x as Much in America as Vice Versa On June 29, 2017, German Chancellor Angela Merkel blasted US President Donald Trump’s administration over its trade policy and rhetoric. Merkel said Trump’s focus on America’s (enormous) trade deficit with Germany is misleading, and doesn’t accurately reflect the trade relationship between the two countries. She went on to say that Germany invests ten times as much in the US than vice versa—in effect saying that the US benefited far more than Germany from their trade paradigm. Merkel also pointed out that German-owned factories in the US are a major source of lucrative American exports. For example, she noted that BMW’s South Carolina factory is America’s most prolific automobile factory in terms of exports. That’s great, but it’s not true–not even remotely true. Merkel is either lying, or grossly misinformed. Here’s the real figures according to the latest publicly available data: German foreign direct investment in the US totaled $16 billion in 2014. US foreign direct investment in Germany totaled $9 billion in 2014. That’s nowhere close to the “ten times” Angela Merkel mentioned—it’s not even double. And if we’re being honest, the foreign direct investment flows pale in comparison to the size of the trade deficit. America’s trade deficit with Germany was $64 billion in 2016—quadruple German direct investment in the US. When this indirect investment is accounted for, the US actually invests significantly more in Germany than vice versa. Merkel knows this, she’s just spinning the numbers for political purposes, much like how she handled the refugee crisis. Merkel is a master of fudging the numbers. Now for those of you who don’t think the trade deficit is a problem, I urge you to read the linked article. Trump’s right, America needs to start taking its deficit seriously. Germany is as good a place to start as any.

Goniothalamus monospermus Goniothalamus monospermus is a species of plant in the family Annonaceae. It is native to Fiji. Description It is a tree reaching 2 to 15 meters in height. It has greenish-yellow petals with rusty orange highlights. Its ripe fruit is yellow. Reproductive biology The pollen of G. monosperma is shed as permanent tetrads. References monospermus Category:Flora of Fiji

Mir Tariq Ali Khan Talpur Mir Tariq Ali Khan Talpur is a Pakistani politician who has been a member of the Provincial Assembly of Sindh since August 2018. Political career He was elected to the Provincial Assembly of Sindh as a candidate of Pakistan Peoples Party from Constituency PS-50 (Mirpur Khas-IV) in 2018 Pakistani general election. References Category:Living people Category:Pakistan Peoples Party MPAs (Sindh) Category:Year of birth missing (living people)

1. Field of the Invention The invention relates to the field of quality control of finished painted surfaces and in particular to inspection and evaluation of the quality of a painted surface, such as a painted automobile surface. 2. Description of Prior Art The purchasing decision made with respect to a private automobile is typically heavily influenced by the aesthetic appearance of the automobile. Among the factors that constitute the aesthetic appearance of an automobile is the finished quality of the painted surface. The colors, lusters and finishes that are popular depend in part on fashion, but a deep lustrous finish having a liquid or wet deep mirror-like appearance is generally thought attractive and desirable by the purchaser. In the prior art, a panel of persons representing a random sample of purchasers views and subjectively evaluates the quality of the painted surface. The panel rates the quality of the paint finish based on several criteria as set forth in a questionnaire. Scores from the panel are then averaged to obtain an average evaluation of the quality of the painted surface. The prior process of using human panels for finish evaluation is extremely time consuming and expensive. At best, such evaluation can only be done periodically. There is also a statistical variation among the panels since truly random samples of human subjects cannot always be practically obtained. Although the prior art has devised various types of apparatus by which various aspects of a painted surface can be measured, such as a distinctness of image (DOI) meter or a gloss meter, readings from neither one of these prior art apparatus correlates well with the subjective judgments of human panels evaluating the same painted surface. Therefore, an apparatus and methodology is needed to replace the current paint finish evaluation technique, of periodically using a statistically random group of purchasers or potential purchasers to evaluate quality of the painted finish surface.

Check out our new site Makeup Addiction No native support of previous PlayStation games

ISIS, the jihadist group in Syria, Iraq and Libya, has claimed it could purchase a nuclear device and transport same to the United States, through a network of countries including Nigeria, up to Mexico. In its latest propaganda magazine, Dabiq, published two weeks ago, the group said the plan is workable the same way banned drugs are transported through West Africa to Western countries, saying it could even be easier with the presence of Boko Haram, the Nigeria-based group that recently pledged allegiance to ISIS. ISIS also described the Nigerian Army as “an exhausted and smashed national army that is now in a virtual state of collapse”. Currently, it said Boko Haram insurgents have taken control of much of Nigeria and their attacks are intensifying and pushing back the military. That claim contradicts recent successes recorded by the Nigerian military which has recovered several towns seized by the militant group in the last. In an op-ed piece titled, “The Perfect Storm,” attributed to a kidnapped British photojournalist, John Cantlie, it said the terrorist organisation which started as a movement in Iraq has suddenly turned into a global phenomenon that the West and the democratic world as a whole is ill-equipped to deal with. Mr. Cantlie has appeared in many propaganda videos released by ISIS after he was kidnapped by the extremist group. “Nothing on this scale has happened this big or this quick before. Huge swathes of Pakistan, Nigeria, Libya, Yemen, and the Sinai Peninsula are all now united under the black flag of tawhīd, gelled together as one by the Islamic State,” the piece said. “They (Boko Haram) declared allegiance to the Caliphate in March, and they are the same group, remember, that Obama claimed just last year was being successfully pushed back by American intervention policy. “Indeed, he claimed that the same model (cutting finances, recruitment tools, and the will to fight) that worked so ‘well’ in the degradation of the mujāhidīn there before their pledge of allegiance, would work just as well on the Islamic State. Some things just don’t work out as planned.” The article said the idea of reaching the U.S. with a deadly nuclear device is not as far-fetched. “Let me throw a hypothetical operation onto the table,” Cantlie wrote. “The Islamic State has billions of dollars in the bank, so they call on their wilāyah in Pakistan to purchase a nuclear device through weapons dealers with links to corrupt officials in the region. “The weapon is then transported overland until it makes it to Libya, where the mujāhidīn move it south to Nigeria. Drug shipments from Columbia bound for Europe pass through West Africa, so moving other types of contraband from East to West is just as possible. “The nuke and accompanying mujāhidīn arrive on the shorelines of South America and are transported through the porous borders of Central America before arriving in Mexico and up to the border with the United States. ADVERTISEMENT “From there it’s just a quick hop through a smuggling tunnel and hey presto, they’re mingling with another 12 million ‘illegal’ aliens in America with a nuclear bomb in the trunk of their car.” The Nigerian military did not comment on the article. Defence spokesperson, Chris Olukolade, did not respond to calls and text messages on Tuesday. Related

Cape serotine The Cape serotine (Neoromicia capensis) is a species of vesper bat occurring in Sub-Saharan Africa. 'Serotine' is from Latin 'serotinus' meaning ‘of the evening'. It is found in Angola, Benin, Botswana, Burundi, Cameroon, Central African Republic, Republic of the Congo, Democratic Republic of the Congo, Ivory Coast, Equatorial Guinea, Eritrea, Ethiopia, Gabon, Ghana, Guinea, Guinea-Bissau, Kenya, Lesotho, Liberia, Malawi, Mozambique, Namibia, Nigeria, Sierra Leone, Somalia, South Africa, Sudan, Swaziland, Tanzania, Togo, Uganda, Zambia, Zimbabwe, and possibly Djibouti. Habitat and ecology Its natural habitats are subtropical or tropical dry forests, subtropical or tropical moist lowland forests, dry savanna, and moist savanna, grassland, bushveld and Acacia woodland, and though recorded from more arid areas is absent from desert regions. Animals roost in small groups of up to about 20 individuals, under the bark of trees, in hollow trees, in cracks in walls and under the eaves and roofs of houses whether thatched, tiled or covered in corrugated iron. Being unobtrusive, their presence is mostly unnoticed. They will readily occupy a bat house. Small, brownish in colour with a greyish underbelly, and relatively untidy fur. Its colour is quite variable depending on the region where it occurs. Small snout and mouth, with a dome-shaped forehead. Wing membranes are dark in colour with a forearm length of some 29–38 mm with a small wingspan. Weight is between 4-10 grams. Its flying behaviour when foraging appears to be quite playful. They give birth once a year to from 1-4 young between October and November. Food items include beetles, lacewings, moths, mosquitoes, plant-sucking bugs and a variety of other flying insects. The genome of a close relative of human Middle East respiratory syndrome coronavirus has been found in a specimen of Neoromicia (Pipistrellus) capensis (previously erroneously assumed to be N. zuluensis). Synonyms Eptesicus capensis Vespertilio capensis Pipistrellus capensis in part References Jacobs, D., Cotterill, F.W. & Taylor, P. 2004. Neoromicia capensis. 2006 IUCN Red List of Threatened Species. Downloaded on 19 July 2007. Category:Neoromicia Category:Taxonomy articles created by Polbot Category:Mammals described in 1829

Cost of hospitalization for and risk factors associated with vancomycin-resistant Enterococcus faecium infection and colonization. The increase in costs of hospitalization for patients with drug-resistant infection may be associated with drug resistance itself or with the severity of the underlying illness that predisposes patients to acquire the drug-resistant infection. To address this issue, risk factors and cost of hospitalization were compared for patients infected or colonized with vancomycin-susceptible Enterococcus faecium (VSEF) or vancomycin-resistant E. faecium (VREF) in a large tertiary-care hospital in New York City. From January 1995 through December 1996, 157 patients with VSEF and 262 patients with VREF were identified. CMI (case-mix index) was assigned to each patient as a measure of severity of illness, with a CMI of 1 considered to represent illness of average severity. For all patients who were assigned a CMI of <3, the cost per day of hospitalization for patients with VREF was significantly greater than that for patients with VSEF. However, for patients with a CMI of >3, there was no difference between cost of hospitalization for patients with VREF and that for patients with VSEF. These observations indicate that, although vancomycin resistance is associated with an increased cost of hospitalization for less severely ill patients with VREF, patients with severe underlying illness, regardless of vancomycin resistance, incur similar hospitalization costs.

Kartis Bill Change 2.0 by Kartis and Tango Magic Kartis, one of the most renowned Argentinean magicians, is known as "The Master of Masters". He gave the magic community "The Kartis Bill Change". Now he gives you the next generation, "Kartis Bill Change 2.0", which is just as visual but even more deceptive. Hold a blank piece of paper with your fingertips and with no apparent movement the paper visibly transforms into a bill right before your eyes. If you want real magic, if you are in search of the perfect bill change, look no further than "Kartis Bill Change 2.0"!

Q: When are the carry flags set? What is meant by "Applying the NEG instruction to a nonzero operand always sets the Carry flag." Why does substracting 2 from 1 set the carry flag? 00000001 (1) + 11111110 (-2) [in 2-complement form] --------------------- CF:1 11111111 (-1) [ why is the carry flag set here???] A: You could view NEG a as equivalent to SUB 0, a. If a is non-zero, then this will set the carry flag (as this will always result in an unsigned overflow).

Hydroview lens implant calcification: 186 exchanges at a district general hospital. This paper describes the experience at a district general hospital of coping with an abrupt onset of calcification of Hydroview intraocular lens (IOL) implants requiring exchange surgery mostly for symptoms of glare, even though the visual acuities were relatively good. In this retrospective study, the operative details of 174 consecutive lens exchanges by one surgeon were retrieved from the surgeon's notes. Of these, pre and post-operative details of 106 consecutive patients were obtained from the hospital notes. Of the 174 lens exchanges, all were sutureless except one and 31 eyes (18%) had had previous capsulotomies. Of 143 eyes with intact posterior capsules, eight (5.6%) needed anterior vitrectomy. Lens replacements were in the bag in 136 (95%), in the sulcus in five (3.5%), and in the anterior chamber in two (1.5%). Of the 31 eyes with previous capsulotomies, 10 (32%) needed anterior vitrectomy. Lens replacements were in the bag in 22 (71%) and in the sulcus in the remaining nine cases (29%). Postoperatively the best-corrected visual acuity was improved in 53%, remained the same in 35%, and deteriorated in 12%. The lens exchange procedure was mostly predictable with satisfactory visual results allowing preoperative counselling of risks to be similar to that for cataract surgery. The onset and resolution of the period of implantation of lenses requiring exchange has not been explained.

Gangs of Tooting Broadway Gangs of Tooting Broadway is a 2013 British-Tamil crime drama film directed by Devanand Shanmugam. The film features Nav Sidhu and Kabelan Verlkumar in lead roles. It released on 4 February 2013. The story is based on gang wars between Tamil people and Black people living in Tooting Broadway. Plot The main protagonist Arun (Nav Sidhu) is a disillusioned former member of the Wolf Pack, now returned to Tooting after some years. His mother tells him that his younger brother Ruthi has turned into a gangster and that he is planning a big war to take place in Tooting Broadway. Arun is sent to stop and protect his brother. The film then turns to a flashback four years ago. Arun was a popular gangster who was taken by a police officer (Oliver Cotton) to be an undercover informer. Now back in reality, Arun meets Karuna, his old boss. Karuna tells him that another gang wants a war, and the only way Arun can protect his brother, is by finishing the war by killing all of the members of the other gang in Tooting. Persuaded, they go to finish off the war, however a completely unexpected twist takes place leading to Karuna's death. Production Film production began in 2011. A teaser of the film was uploaded to YouTube in February 2012, however the film was then delayed. It finally was released on 4 February 2013. References External links Tooting Broadway at the Internet Movie Database

Q: Correct sorting after text to columns in EXCEL I have some data in which one column represents the Days of Operations, as below: ------- Days ------- 15 7 1234567 etc. I want to "break" the column (via text to columns option in the Data tab of Excel) and create the following columns: -------------------- D1|D2|D3|D4|D5|D6|D7 -------------------- 1| | | | 5| | | | | | | | | 7| 1| 2| 3| 4| 5| 6| 7| However, the data is being messed up and I get different days in different columns... How I can overpass this? Is there a way to assign the values accordingly? A: I want to "break" the column (via text to columns option in the Data tab of Excel) As per your question, you want to do this with Text-to-Columns. Well, that's a no go. Text-to-columns works either on a character delimiter or a fixed width. Your data has neither. You apparently want to distribute the data based on its values. That cannot be done with Text-to-Columns. You will need a code or a formula solution for that. If you import your source data into a spreadsheet, with all the imported data sitting in column A, you can use a formula like this: =IF(ISERROR(FIND(COLUMN(A1),$A4)),"",COLUMN(A1)) If the data as posted above starts in A1, then the formula will be in cell B4 and can be copied across and down. You can hide column A do display just the results of the formula.

+ 6*c**2 + 2. Let v(z) be the second derivative of -z**5/20 + 7*z**4/12 + z**2 + 103*z - 3. Give 5*s(k) - 4*v(k). -k**3 + 2*k**2 + 2 Let w(j) = -j + 92 + 98 - 194. Let m(b) = -b**3 + b**2 + b + 10. Let z be m(3). Let f(i) = i + 3. Calculate z*w(u) - 6*f(u). -u + 2 Let b(q) = -12*q - 6. Let c(i) = 11*i + 7. Suppose 0 = -15*w + 3*m - 81, -39*w + 37*w = 5*m. What is w*b(u) - 4*c(u)? 16*u + 2 Let a(l) = 14*l + 296. Let f(s) = -24*s - 588. Calculate -5*a(j) - 3*f(j). 2*j + 284 Let h(l) = -7*l + 6. Let r be ((-23)/(-46))/((-2)/(-20)). Let d(c) = -c + 1. Give r*d(t) - h(t). 2*t - 1 Let j be ((2/20)/(41/(-410)))/(1*-1). Let o(c) = 16*c + 2. Let l(h) = h - 1. Determine j*o(m) + 3*l(m). 19*m - 1 Let c(i) = -4*i**2 + 9*i + 1. Let l = 168 - 162. Let h(z) = l*z**2 + 338*z - 1 - 169*z - 183*z. Give 8*c(w) + 5*h(w). -2*w**2 + 2*w + 3 Let b(a) = -8563*a. Let l(j) = -55042962*j. Give -25713*b(p) + 4*l(p). 8571*p Suppose 0 = 5*q, 4*q - 1 = -r - 2. Let j(w) = -3798 - 3794 + 6*w + 11369 - 3789. Let m(l) = -l + 1. What is r*j(a) - 12*m(a)? 6*a Let a(d) = -9*d - 54. Let r(o) = o**2 + 973*o + 11537. Let c be r(-12). Let y(m) = -4*m - 27. Give c*y(q) - 2*a(q). -2*q - 27 Let q(m) = -876*m**3 - 12*m**2 + 13*m + 7. Let w(s) = -439*s**3 - 5*s**2 + 6*s + 3. Calculate -3*q(d) + 7*w(d). -445*d**3 + d**2 + 3*d Let r(p) = -1. Let c(y) = -2*y**2 + 6*y - 5. Let h(k) = 20*k - 99. Let g be 3*((-12)/(-90) - 46/(-30)). Let u be h(g). Calculate u*c(t) - 4*r(t). -2*t**2 + 6*t - 1 Suppose 5*a - 7 - 8 = 0. Let l(i) = 2*i**3 + 3*i**2 + 2. Let q(d) = -10*d**3 - 14*d**2 - 10. What is a*q(u) + 16*l(u)? 2*u**3 + 6*u**2 + 2 Let q(o) = -10*o**2 - 9. Let g(x) = 1. Suppose -4*d - 70*f = -63*f + 36, d + f + 6 = 0. What is d*q(a) - 18*g(a)? 20*a**2 Let d(t) = 4*t**3 + 5*t**2 + 24*t + 6. Let f(j) = -17*j**3 - 21*j**2 - 98*j - 24. Determine 9*d(n) + 2*f(n). 2*n**3 + 3*n**2 + 20*n + 6 Let b(k) = -11*k**3 + 3*k**2 - 5*k + 29. Let d(q) = 33*q**3 - 11*q**2 + 16*q - 97. What is 10*b(g) + 3*d(g)? -11*g**3 - 3*g**2 - 2*g - 1 Let z(u) = -17*u**3 + 12*u**2 + 4*u + 6. Let l(j) = -69*j**3 + 54*j**2 + 18*j + 24. What is -4*l(m) + 18*z(m)? -30*m**3 + 12 Let n = 1 + 4. Let j(c) = 6*c - 2*c + 2 - 23 + 6*c + 33. Let u(g) = -3*g - 4. Determine n*j(d) + 16*u(d). 2*d - 4 Let n(q) = -615*q**3 - q**2 + q - 4. Let p(g) = 2463*g**3 + 5*g**2 - 4*g + 15. What is 11*n(y) + 3*p(y)? 624*y**3 + 4*y**2 - y + 1 Let v(k) be the first derivative of -57 + 1/2*k**2 - 4*k. Let o(q) = -3*q + 13. What is -2*o(r) - 7*v(r)? -r + 2 Let f(s) = -37*s + 149. Let h(n) = -28*n + 147. Give -4*f(d) + 5*h(d). 8*d + 139 Let n = -20919 - -20918. Let u(g) = 1. Let o(k) = 4*k**3 + k - 3. Determine n*o(q) - 3*u(q). -4*q**3 - q Let j(w) = 2*w**3 + 6*w**2 + 14*w - 1. Let f(p) = -2*p**3 - 6*p**2 - 18*p. What is -3*f(v) - 4*j(v)? -2*v**3 - 6*v**2 - 2*v + 4 Let j(y) be the second derivative of 7*y**3/6 - 2*y**2 - 4*y. Let m(r) = -8*r + 4. Suppose -402*s = -398*s + 24. Give s*j(c) - 5*m(c). -2*c + 4 Let n(j) = -51*j**2 + 37*j - 30. Let i(o) = -51*o**2 + 36*o - 24. Give -5*i(p) + 4*n(p). 51*p**2 - 32*p Let f(z) = 936*z + 55 + 968*z + 296*z - 55. Let y(p) = 83*p. Give 5*f(x) - 132*y(x). 44*x Let w(b) = b**2 - 3*b - 9. Let h be (1 + 0)*(-2 - 8191). Let y = -5256 - h. Let u(t) = 1 - 5 - 2938*t + y*t. Give 5*u(r) - 2*w(r). -2*r**2 + r - 2 Let b(p) = -5*p**3 + 16*p**2 - 66*p - 13. Let i(n) = 6*n**3 - 19*n**2 + 64*n + 16. What is -5*b(v) - 4*i(v)? v**3 - 4*v**2 + 74*v + 1 Let i(m) = -m**2 + 4*m + 1. Let y(k) = 2*k**2 - 13*k + 1038. Determine -3*i(p) - y(p). p**2 + p - 1041 Let i(q) be the third derivative of 19*q**5/60 - q**4/8 - 453*q**2. Let x(k) = -286*k**2 + 44*k. What is 44*i(j) + 3*x(j)? -22*j**2 Let z(y) = 3*y - 5*y - 4*y**2 + 2*y**2 + 6. Let b(q) = 111. Let g(o) = 5. Let t(n) = -b(n) + 22*g(n). Give -6*t(f) - z(f). 2*f**2 + 2*f Let u(i) = i - 1. Let s(o) = -4*o + 6. Let m = -2 - -5. Let x be 4 - m/2*4. Let y be (0 - 1)*(-3 + x). Calculate y*u(q) + s(q). q + 1 Let p(b) be the third derivative of -b**4/8 + b**3/3 + 1280*b**2. Let q(r) = -6*r + 4. What is 5*p(v) - 2*q(v)? -3*v + 2 Let c(i) = 7*i**2 - 10*i - 3. Let v(x) = -11*x**2 + 15*x + 5. Suppose 133*s + 23*s = -104*s + 2080. What is s*c(h) + 5*v(h)? h**2 - 5*h + 1 Let m(k) = 76*k**3 + 11*k**2 - 11*k. Let t(x) = -25*x**3 - 4*x**2 + 4*x. Let l(h) = h**2 - 166*h + 2389. Let d be l(16). What is d*t(u) - 4*m(u)? -29*u**3 Let j(w) = 17*w**2 - w + 3. Let g(l) = -501*l + 6014. Let y be g(12). Let b(z) = 17*z**2 - z + 2. What is y*j(u) - 3*b(u)? -17*u**2 + u Let x(b) = 14*b**3 + 55*b + 412. Let k(j) = 5*j**3 + 21*j + 137. What is -8*k(v) + 3*x(v)? 2*v**3 - 3*v + 140 Let y(v) = -1. Let b = -2 - -1. Let q(a) = -8 - 4208*a - 8 + 2109*a + 2105*a + 23 - 10. Calculate b*q(n) + 3*y(n). -6*n Let u(g) = 34*g**2 - 57998 + 57987 - 7*g**2. Let s(b) = 14*b**2 - 5. Calculate 9*s(a) - 4*u(a). 18*a**2 - 1 Let j(r) = r**2 - r. Let p(a) = 36*a**3 + 9*a**2 - 39*a - 6. Let b(v) = -v**3 + 5*v + 1. Let n(k) = 6*b(k) + p(k). Determine -9*j(g) + n(g). 30*g**3 Let z(v) = 11*v**2 + 5*v - 7. Let x(j) = 5*j**2 - 4*j - 3. Calculate -9*x(g) + 4*z(g). -g**2 + 56*g - 1 Let c(u) = -14*u**2 - 7*u + 6. Let t(o) = 70*o**2 + 34*o - 28. Calculate -14*c(l) - 3*t(l). -14*l**2 - 4*l Let h(u) = -45*u + 21. Let p be h(8). Let g = p + 344. Let m(w) = w + 3. Let k(r) = -2*r - 4. Determine g*k(f) + 8*m(f). -2*f + 4 Let g(v) = v**3 - 14*v**2 - 10*v - 63. Let d(z) = -z**3 + 5*z**2 + 3*z + 22. What is 17*d(q) + 6*g(q)? -11*q**3 + q**2 - 9*q - 4 Let p(k) = 6*k - 1. Let n(a) = 4 - 4 - 117*a + 122*a. What is 5*n(j) - 4*p(j)? j + 4 Let b(u) = 297*u + 5. Let m(n) = 298*n + 6. What is -5*b(d) + 4*m(d)? -293*d - 1 Let h(b) = 9*b**3 + 15*b**2 + 1809*b. Let j(y) = -8*y**3 - 12*y**2 - 1811*y. Calculate -4*h(l) - 5*j(l). 4*l**3 + 1819*l Let h(m) = -12*m**3 + 17*m - 9. Let i(j) = -3*j**3 + 4*j - 2. Let f = 185 + -154. Let b = f + -33. Calculate b*h(t) + 9*i(t). -3*t**3 + 2*t Let c(a) be the second derivative of a**5/20 + 5*a**4/12 - a**3 + 127*a. Let j(s) = s**3 + 4*s**2 - 5*s. Let z be 0/(-3) - (6 - 0). Determine z*j(n) + 5*c(n). -n**3 + n**2 Let h(o) = -19 + 6 - 1534*o + 1536*o. Let k(m) = -3*m + 13. Determine -6*h(b) - 5*k(b). 3*b + 13 Let o(g) = 3379*g**3 - 13*g + 10. Let z(f) = -2254*f**3 + 9*f - 7. Determine 5*o(t) + 7*z(t). 1117*t**3 - 2*t + 1 Let h(j) = 1750*j + 6. Let z(n) = 8293259*n + 28432. Calculate 14216*h(s) - 3*z(s). -1777*s Let u(c) = 24*c**3 + 11*c**2 + 15*c - 12. Let v(a) = -41*a**3 - 20*a**2 - 28*a + 25. Determine -7*u(l) - 4*v(l). -4*l**3 + 3*l**2 + 7*l - 16 Let x(k) = -3*k**2 + 0 + 0 + 0 - k**3. Let w be 8*(3 - 14/4). Let z be (-6*w/48)/(1/4). Let r(s) = 4*s**3 + 13*s**2 - s. Determine z*r(c) + 9*x(c). -c**3 - c**2 - 2*c Let k(m) = m**2 + 1. Let a(f) = 40*f**2 - 4*f + 52. Let b(x) = -x + 1. Let s(z) = -2*a(z) + 8*b(z). What is 96*k(q) + s(q)? 16*q**2 Let u(y) = -30*y**2 - 15*y + 15. Let d(t) = -t**2 - t + 1. Suppose 1362 = 34*m + 852. Calculate m*d(w) - u(w). 15*w**2 Let r(z) = -25*z**3 - 2*z**2 + 7*z - 7. Let o(k) = -13*k**3 - k**2 + 4*k - 4. Let c = 3589 + -3596. Calculate c*o(y) + 4*r(y). -9*y**3 - y**2 Suppose 0 = 3*x - 16*x - 65. Let t(n) = -29 + 13 + 12. Let j(s) = s - 9. Give x*t(b) + 2*j(b). 2*b + 2 Let k = -9374 + 9375. Let j(o) = 4*o**3 + 6*o**2 - 7*o + 5. Let x(r) = r**3 + r + 1 - 4*r**2 - 2*r + 5*r**2. What is k*j(t) - 6*x(t)? -2*t**3 - t - 1 Let z(m) be the second derivative of m**4/12 - 13*m**3/3 - 3*m**2 + 176*m + 4. Let g(l) = -3*l**2 + 79*l + 17. Calculate 6*g(j) + 17*z(j). -j**2 + 32*j Let i(n) = -3*n - 114. Let x(b) = 4*b + 111. Determine 6*i(u) + 5*x(u). 2*u - 129 Let g(n) = -n. Suppose 2*w + 8*w + 5*w - 405 = 0. Let o(m) = 9*m**2 - 9*m. What is w*g(b) - 3*o(b)? -27*b**2 Let g(w) = -52*w - 2462. Let q(k) = 68*k + 2459. Determine -4*g(c) - 3*q(c). 4*c + 2471 Let b(y) = -6*y + 1. Let o(a) be the third derivative of 0*a + 0 + 1/24*a**4 - 1/6*a**3 - 41*a**2. Give b(q) + 2*o(q). -4*q - 1 Let v(i) = -5*i - 2. Let c(w) = 19*w + 7. Let d(g) = -g**3 - 64*g**2 - 54*g + 589. Let o be d(-63). Give o*v(u) + 6*c(u). 4*u - 2 Let h(u) = 2*u**2 - 26*u + 362. Let l(t) = -6*t**2 + 69*t - 1089. What is 8*h(r) + 3*l(r)? -2*r**2 - r - 371 Let q(i) = -426*i**2 + 6*i + 15. Let k(d) = 848*d**2 - 11*d - 28. What is -6*k(g) - 11*q(g)? -402*g**2 + 3 Let b

--- author: - 'Dimitrios A. Gouliermis' - Stefan Schmeja - Volker Ossenkopf - 'Ralf S. Klessen' - 'Andrew E. Dolphin' title: Hierarchically Clustered Star Formation in the Magellanic Clouds --- Method: The identification of stellar clusters {#sec:1} ============================================== For the investigation of the clustering behavior of stars it is necessary to thoroughly characterize distinct concentrations of stars, which can only be achieved by the accurate identification of individual stellar clusters. Considering the importance of this process, different identification methods were developed, which can be classified in two families. The first, represented by [*friend of friend*]{} algorithms and [*cluster analysis*]{} techniques, e.g., [@battinelli96], are designed for limited samples of observed stars, and thus are based on linking individual stars into coherent stellar groups. These methods are recently superseded by [*minimum spanning trees*]{}, e.g., [@bastian09]. The second family of identification codes, represented by [*nearest-neighbors*]{} and [*star-counts*]{}, make use of surface stellar density maps constructed from rich observed stellar samples. Distinct stellar systems are identified as statistically significant over-densities in respect to the average stellar density in the observed regions, e.g., [@gouliermis10]. Tests on artificial clusters of various density gradients and shapes showed that the latter (density) techniques are more robust in detecting real stellar concentrations, provided that rich stellar samples are available [@schmeja11]. A schematic representation of stellar density maps constructed with star-counts is shown in Fig. \[fig:1\]. ![Schematic of the star-count process. (a) The chart of an observed stellar sample. (b) The corresponding stellar density map, after counting stars in quadrilateral grid of elements (pixels) of size $1.8\arcsec$ each, and after filtering the map with a Gaussian of FWHM$\simeq2.8$px ($\sim$5). (c) The corresponding isodensity contour map. Isopleths at levels [ -2.truept]{}3$\sigma$ are indicated with white lines. \[fig:1\]](fig1.ps) ![Isodensity contour map from star-counts of the young bright main-sequence and faint PMS populations identified with HST/ACS in the region of NGC 346 in the SMC. Lines represent isopleths of significance [ -2.truept]{}$1\sigma$. Apart from the dominating central large stellar aggregate, there are peripheral young sub-clusters, revealed as statistically important stellar concentrations. The central aggregate, denoted by the 1$\sigma$ isopleth, encompass various distinct sub-groups, which appear at higher density thresholds. NGC 346 itself appears at [ -2.truept]{}3$\sigma$ significance. \[fig:2\]](fig2.ps) Data: Stellar clustering in the region NGC 346/N66 {#sec:2} ================================================== One of the most prominent bright stellar systems in the Small Magellanic Cloud (SMC) is the stellar association NGC 346, related to the  region LHA 115-N66 [@henize56], the brightest in this galaxy. This system appears in partially-resolved observations form the ground as a single stellar concentration, but recent imaging with the [*Advanced Camera for Surveys*]{} onboard the Hubble Space Telescope (HST) allowed the detection of smaller sub-clusters within the boundaries of the  nebula. The images were collected within the HST GO Program 10248 and were retrieved from the HST Data Archive. Their photometry demonstrated that the faint young stellar populations in the region are still in their pre–main-sequence (PMS) phase, and revealed a plethora of sub-solar PMS stars [@gouliermis06]. Our [*nearest-neighbor*]{} cluster analysis of the observed young stellar populations, i.e., the bright main-sequence (down to $m_{555} {\ \raise -2.truept\hbox{\rlap{\hbox{$\sim$}}\raise5.truept\hbox{$<$}\ }}21$) and the faint PMS stars, revealed a significant number of smaller, previously unresolved, young stellar sub-clusters [@schmeja09]. This clustering behavior of young stars in NGC 346 is further demonstrated here by the stellar density contour map of Fig \[fig:2\], constructed with star-counts. Results: Hierarchical clustering of young stars {#sec:3} =============================================== The map of Fig. \[fig:2\] shows significant sub-structure, in particular within the 1$\sigma$ boundaries of the central dominant stellar aggregate. This structuring behavior indicates hierarchy. The minimum spanning tree (MST) of the young stars in the whole region allows to determine the statistical  parameter, introduced by [@cw04]. This parameter is a measure of the fractal dimension $D$ of a stellar group, permitting to distinguish between centrally concentrated clusters and hierarchical clusters with fractal substructure. The application of the MST to our data shows that the region NGC 346/N66 is highly hierarchical with a  that corresponds to a fractal dimension $D \simeq 2.5$. Constructing surface stellar density maps allows us to further characterize the clustering behavior of stars with the application of tools, which are originally designed for the study of the structuring of the interstellar medium (ISM), as observed at far-infrared or longer wavelengths. The so-called [*dendrograms*]{} are used for the visualization of hierarchy through structural trees [@rosolowsky08]. The dendrogram of the stellar density map of NGC 346 demonstrates that the observed hierarchy is mostly due to the substructure in the dominant stellar aggregate. The $\Delta$-variance analysis [@stutzki98; @ossenkopf08] is a robust structure analysis method that measures the amount of structure on a given scale $l$. In principle the $\Delta$-variance is directly related to the power spectrum of the map, and thus for a power law spectrum of index $-\beta$, $\Delta$-variance also follows a power law, $\displaystyle \sigma_\Delta^2 \propto l^\alpha$, with $\alpha={\beta-2}$. The application of the $\Delta$-variance analysis on the surface stellar density map of NGC 346 verifies that indeed the clustering of the young stars in the region is self-similar (Fig. \[fig:3\]), with a spectral index $\beta \simeq 2.8$, corresponding to a fractal dimension $D=2.6$ of the corresponding fractional Brownian motion structure [@stutzki98], similar to that previously derived for Galactic molecular clouds. Self-similarity appears to brake, i.e., we find different hierarchical properties for the short-range scaling and the behavior at the overall scale of the region, at length-scales $l \geq 25$px, corresponding to physical scales of $\sim$40($\sim 11$pc at the distance of the SMC). ![The $\Delta$-variance spectrum of the surface stellar density map of the entire region of NGC 346/N66. This analysis shows that the young stellar populations in this region are hierarchically structured up to length-scales of $\sim$40. The spectral index $\beta$ is determined from the fit of the spectrum for data between lags 4and 13(indicated by the gray shaded area). The dashed line provides the used virtual beamsize (5). \[fig:3\]](fig3.ps) D.A.G., S.S. and V.O. kindly acknowledge support by the German Research Foundation (DFG) through grants GO 1659/3-1, SFB 881 and OS 177/2-1 respectively. Based on observations made with the NASA/ESA [*Hubble Space Telescope*]{}, obtained from the data archive at the Space Telescope Science Institute (STScI). STScI is operated by the Association of Universities for Research in Astronomy, Inc. under NASA contract NAS 5-26555. [99.]{} Bastian, N., et al. 2009. Mon. Not. R. Astron. Soc. 392, 868 Battinelli, P., Efremov, Y., & Magnier, E. A. 1996. Astron. Astrophys. 314, 51 Cartwright, A., & Whitworth, A. P. 2004. Mon. Not. R. Astron. Soc. 348, 589 Gouliermis, D. A., et al. 2006. Astroph. J. Suppl. Ser. 166, 549 Gouliermis, D. A., et al. 2010. Astroph. J. 725, 1717 Henize, K. G. 1956. Astroph. J. Suppl. Ser. 2, 315 Ossenkopf, V., Krips, M., & Stutzki, J. 2008. Astron. Astrophys. 485, 917 Rosolowsky, E. W., et al. 2008. Astroph. J. 679, 1338 Schmeja, S., Gouliermis, D. A., & Klessen, R. S. 2009. Astroph. J. 694, 367 Schmeja, S. 2011, Astronomische Nachrichten, 332, 172 Stutzki J., et al. 1998. Astron. Astrophys. 336, 697

Q: Odoo: how to show fields of a many2one fields which is inside a one2many field I don't know how to put it but here's what i want, i want to show the fields of a custom.product model in the tree view of a one2many field my code is as follows class CustomSale(models.Model): _name = 'custom.sale' _description = 'Sale Record' name = fields.Char(string='Order Reference', required=True, copy=False, readonly=True, default=lambda self: _('New')) order_line = fields.One2many('custom.sale.line', 'order_id', string='Order Lines', copy=True, auto_join=True) class CustomSaleLine(models.Model): _name = 'custom.sale.line' _description = 'Sales Line' order_id = fields.Many2one('custom.sale', string='Order Reference', required=True,) product_id = fields.Many2one('custom.product', string='Product', change_default=True, ondelete='restrict') product_uom_qty = fields.Integer(string='Ordered Quantity', required=True, ) <record id="form_custom_sale" model="ir.ui.view"> <field name="name">custom.sale.form</field> <field name="model">custom.sale</field> <field name="arch" type="xml"> <form string="Sales"> <sheet> <group> <group> <field name="name"/> </group> </group> <notebook> <page string="Order Lines" name="order_lines"> <field name="order_line" widget="section_and_note_one2many" mode="tree"> <tree editable="bottom"> <control> <create string="Add a product"/> </control> <field name="product_id"> <tree> <field name="brand_id"/> <field name="country_id"/> <field name="sell_price"/> </tree> </field> <field name="product_uom_qty" string="Ordered Qty"/> </tree> </field> </page> </notebook> </sheet> </form> </field> </record> yet i still can't get "brand_id", "country_id" and "sell_price" shown A: Add related field for fields you want to display in the tree view. class CustomSaleLine(models.Model): _name = 'custom.sale.line' _description = 'Sales Line' order_id = fields.Many2one('custom.sale', string='Order Reference', required=True,) product_id = fields.Many2one('custom.product', string='Product', change_default=True, ondelete='restrict') product_uom_qty = fields.Integer(string='Ordered Quantity', required=True, ) brand_id = fields.Many2one('BRAND_MODEL_HERE',related='product_id.brand_id') country_id = fields.Many2one('COUNTRY_MODEL_HERE',related='product_id.country_id') sell_price = fields.Float(related='product_id.sell_price') <record id="form_custom_sale" model="ir.ui.view"> <field name="name">custom.sale.form</field> <field name="model">custom.sale</field> <field name="arch" type="xml"> <form string="Sales"> <sheet> <group> <group> <field name="name"/> </group> </group> <notebook> <page string="Order Lines" name="order_lines"> <field name="order_line" widget="section_and_note_one2many" mode="tree"> <tree editable="bottom"> <control> <create string="Add a product"/> </control> <field name="product_id"> <field name="brand_id"/> <field name="country_id"/> <field name="sell_price"/> <field name="product_uom_qty" string="Ordered Qty"/> </tree> </field> </page> </notebook> </sheet> </form> </field> </record>

Surgical treatment of brain metastases from renal cell carcinoma. Between January 1976 and December 1986, 22 patients with renal cell carcinoma underwent surgical resection of brain metastases at Memorial Sloan-Kettering Cancer Center. Ten of the patients had metastases limited to the brain and 12 also had extracranial metastases. Twenty patients received external radiotherapy. Five had craniotomy after failing radiation therapy and 15 had adjuvant radiotherapy. Two patients died within thirty days following craniotomy; the median survival of the remaining 20 patients was 20.9 +/- 6.8 months calculated according to a Weibull survival model. Variables examined in relation to survival included absence or presence of extracranial metastases at time of craniotomy, time interval between nephrectomy and diagnosis of cerebral metastases, neurologic status prior to craniotomy, location of the brain tumor, and patient age. None of the variables was significant at the 10 percent level by the Weibull analysis. However, three favorable prognostic factors, namely metachronous brain metastasis more than one year after nephrectomy, minimal or no neurologic deficit at time of craniotomy, and infratentorial lesions show a trend toward improved survival with p less than 0.20. The data suggest that surgical resection of a single and occasionally multiple brain metastases is warranted in selected patients with renal cell carcinoma.

Forney Customers Can Save on Electricity Energy Outlet gives you the POWER to CHOOSE the best Forney Electricity Rates. Whether a business owner or resident in Forney, Texas deregulation has given you the opportunity to save big when it comes to energy cost. But with so many plans and companies to choose from, the process of signing up for a retail energy provider can be frustrating. That’s where EnergyOutlet.com comes in – We can help you understand the deregulated energy process and walk you through your choices to help you find the energy plan that’s right for you. What Rate Plans are Available in Forney? Residents in Forney can choose from the following: Variable rate plans (change with the energy market) Price secured rate plans (stay consistent throughout energy contract term) Prepaid plans Popular Cities Around Forney: Houston | Pearland | Katy

An electric power steering apparatus using a brushless motor is disclosed. The electric power steering apparatus has a microcomputer for calculating a target current to the brushless motor on the basis of a torque signal outputted from a steering torque detecting part. The microcomputer has a table stored...http://www.google.com/patents/US7042179?utm_source=gb-gplus-sharePatent US7042179 - Electric power steering apparatus An electric power steering apparatus using a brushless motor is disclosed. The electric power steering apparatus has a microcomputer for calculating a target current to the brushless motor on the basis of a torque signal outputted from a steering torque detecting part. The microcomputer has a table stored in ROM. The microcomputer calculates the angular position of the brushless motor by referring to the table on the basis of a signal outputted by a resolver. Images(12) Claims(5) 1. An electric power steering apparatus comprising: a brushless motor for applying a torque to a steering mechanism; a motor angular position detecting means for detecting an angular position of a rotor of the brushless motor; steering input detecting means for detecting a steering input; control means for calculating a target current on the basis of at least a signal from the steering input detecting means; and motor driving means for supplying current to the brushless motor, wherein the calculation of the angular position of the rotor of the brushless motor is carried out with reference to a predetermined table provided in the control means. 2. An electric power steering apparatus according to claim 1, further comprising second control means additional to the first control means, wherein the second control means performs the same motor angular position calculation as the first control means and an abnormality is detected by a value calculated by the first control means and a value calculated by the second control means being compared. 3. An electric power steering apparatus according to claim 1, further comprising second control means additional to the first control means, wherein the second control means performs the same motor angular position calculation as the first control means and the first control means and the second control means have direction prohibiting means for restricting rotation of the brushless motor on the basis of a steering input of a driver. 4. An electric power steering apparatus according to claim 1, wherein the motor angular position detecting means is a resolver and there are further provided sample-hold circuits for sample-holding outputs from the resolver and the first control means outputs a reference clock pulse to the resolver and a sample-hold timing pulse to the sample-hold circuits. 5. An electric power steering apparatus according to claim 2, wherein the motor angular position detecting means is a resolver and there are further provided sample-hold circuits for sample-holding outputs from the resolver and the first control means or the second control means outputs a reference clock pulse to the resolver and a sample-hold timing pulse to the sample-hold circuits. Description FIELD OF THE INVENTION This invention relates to an electric power steering apparatus for applying force from an electric motor to a steering mechanism to lighten the steering force needed from a driver. BACKGROUND OF THE INVENTION An electric power steering apparatus reduces the steering force needed from a driver by drive-controlling an electric motor with a motor drive control part on the basis of a steering torque signal outputted by a steering torque detecting part and a vehicle speed signal outputted by a vehicle speed detecting part. Electric power steering apparatuses that use a brushless motor as the electric motor are known. With an electric power steering apparatus that uses a brushless motor, because there is no dropping or fluctuation of motor output due to a voltage drop between brushes and a commutator, it is possible to obtain a stable auxiliary steering force. Because the inertia moment of the motor is small compared to that of a motor with brushes, a good steering feeling can be obtained at high straight-line speeds and when the steering wheel is turned back from one direction to the other. However, when a brushless motor is used as the motor, instead of brushes and a commutator, it becomes necessary for the amount of motor current to be controlled in correspondence with the angle of the motor (the angular position of the rotor). For this, a motor angle detecting part for detecting the angle of the motor (the angular position of the rotor) and a motor current detecting part are provided, and PWM drive control of the brushless motor is carried out on the basis of output signals from the motor angle detecting part and the motor current detecting part. The motor angle detecting part comprises for example a resolver and an RD (resolver digital) convertor part. Signals from the resolver are supplied continuously to the RD convertor part. The RD convertor part calculates the angle of the rotor with respect to the stator in the brushless motor (the rotor angular position) θ, and outputs a signal corresponding to this calculated angle θ. The RD convertor part calculates an angular velocity ω of the rotor with respect to the stator in the brushless motor, and outputs a signal corresponding to the calculated angular velocity ω. An apparatus that uses a resolver and an RD convertor part to detect the angle of the motor (the angular position of the rotor) like this is disclosed in Japanese Patent No. 3216491. When an RD convertor part for obtaining the angular position of a rotor on the basis of output signals from a resolver like this is employed in an electric power steering apparatus, there has been the problem that the RD convertor part is expensive and raises the cost of the apparatus. Also, when the RD convertor is performing angle calculation with an extremely short period and for example spike noise intrudes, because the computation itself is reset (computation is interrupted) there is a possibility of the driver being subjected to an incongruous feeling. Thus, an electric power steering apparatus has been awaited with which calculation of the motor angle (angular position of the rotor) from the outputs of a resolver is achieved with a device that is low-cost and does not easily suffer influences of noise. SUMMARY OF THE INVENTION To achieve the above-mentioned object and other objects, the invention provides an electric power steering apparatus including: a brushless motor for applying a torque to a steering mechanism; angular position detecting means for detecting an angular position of the brushless motor; steering input detecting means for detecting a steering input; control means for calculating a target current on the basis of at least a signal from the steering input detecting means; and motor driving means for supplying current to the brushless motor, wherein the calculation of the angular position is carried out with reference to a predetermined table provided in the control means. Because the angular position of the brushless motor is obtained by control means consisting of a microcomputer on the basis of a table stored in ROM provided in the control means, there is unlikely to be any affect of noise, there is less possibility of calculation being interrupted, and incongruous steering feelings can be reduced. Because an RD convertor part is unnecessary, the construction can be made cheaper than in related art. Preferably, an electric power steering apparatus according to the invention further includes second control means additional to the first control means, the second control means performs the same angular position calculation as the first control means, and any abnormality is detected by a value calculated by the first control means and a value calculated by the second control means being compared. In this case, because the output difference between the first control means and the second control means is extremely small, and the margin for error of the two signals can be made small, the precision of abnormality detection increases. Also, in an electric power steering apparatus according to the invention further including second control means additional to the first control means, the second control means performing the same angular position calculation as the first control means, the first control means and the second control means may preferably have direction prohibiting means for restricting rotation of the brushless motor on the basis of a steering input of a driver. In this case, even when one of the first control means and the second control means has become abnormal, it is possible for certain direction prohibition to be carried out by the other. Also, a circuit for detecting abnormality of the first control means and the second control means becomes unnecessary, and a simple circuit construction can be adopted. Also, in this invention, preferably, the angular position detecting means is a resolver, there are further provided sample-hold circuits for sample-holding outputs from the resolver, and the first control means or the second control means outputs a reference clock pulse to the resolver and a sample-hold timing pulse to the sample-hold circuits. In this case, it is possible to output a sample-hold timing correctly synchronized with the peaks of an excitation signal. Also, the timing can be changed freely with the sample-hold timing remaining synchronized correctly with the peaks of the excitation signal. BRIEF DESCRIPTION OF THE DRAWINGS Certain preferred embodiments of the present invention will now be described with reference to the accompanying drawings, in which: FIG. 1 is an overall construction view of an electric power steering apparatus according to the invention; FIG. 2 is a view showing the main parts of the mechanical construction and the specific construction of the electrical system of the electric power steering apparatus shown in FIG. 1; FIG. 3 is a sectional view taken along line 3—3 of FIG. 2; FIG. 4 is a sectional view taken along line B—B of FIG. 3; FIG. 5 is an electrical block diagram of a control unit in an electric power steering apparatus according to the first preferred embodiment of the invention; FIG. 6 is an electrical block diagram of a control unit in an electric power steering apparatus according to a second preferred embodiment of the invention; FIG. 7 is a block diagram of an angle comparing part shown in FIG. 6; FIG. 8 is an electrical block diagram of a control unit in an electric power steering apparatus according to a third preferred embodiment of the invention; FIG. 9 is a block diagram of a direction prohibiting part shown in FIG. 8; FIG. 10 is a flow chart illustrating control of a motor drive control part based on a signal from the direction prohibiting part; and FIG. 11 is an electrical block diagram of a control device in an electric power steering apparatus according to a fourth preferred embodiment of the invention. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS The overall construction of an electric power steering apparatus according to the invention will be described on the basis of FIG. 1 through FIG. 4. An electric power steering apparatus 10 shown in FIG. 1 is constructed to apply an assisting steering force (steering torque) to a steering shaft 12 connected to a steering wheel 11. A top end of the steering shaft 12 is connected to the steering wheel 11, and a bottom end is connected to a pinion gear 13. The pinion gear 13 is connected to a rack shaft 14 having a rack gear 14a for meshing with the pinion gear 13. The pinion gear 13 and the rack gear 14a constitute a rack and pinion mechanism 15. Front wheels 17, 17 are connected to the ends of the rack shaft 14 by tie rods 16, 16. A power transmitting mechanism 18 is mounted on the steering shaft 12, and the power transmitting mechanism 18 is connected to a brushless motor 19. The brushless motor 19 outputs a turning force (torque) for supplementing the steering torque, and applies this turning force to the steering shaft 12 via the power transmitting mechanism 18. A steering torque detecting part 20 is provided on the steering shaft 12. The steering torque detecting part 20 detects a steering torque applied to the steering shaft 12 by a driver turning the steering wheel 11. The reference number 21 denotes a vehicle speed detecting part for detecting the speed of the vehicle. A control unit 22 consisting of a computer outputs a drive control signal SG1 for controlling rotation of the brushless motor 19 on the basis of a steering torque signal T outputted from the steering torque detecting part 20 and a vehicle speed signal V outputted from the vehicle speed detecting part 21. The brushless motor 19 has a motor angle detecting part 23 consisting of a resolver. An angle signal SG2 outputted from the motor angle detecting part 23 is fed back to the control unit 22. The rack and pinion mechanism 15, the power transmitting mechanism 18 and the steering torque detecting part 20 are housed in a gearbox 24 shown with broken lines. The electric power steering apparatus 10 is made by adding the steering torque detecting part 20, the vehicle speed detecting part 21, the control unit 22, the brushless motor 19 and the power transmitting mechanism 18 to the apparatus of an ordinary steering system. When during travel of the vehicle the driver turns the steering wheel 11 to change the direction of travel, a turning force originating in the steering torque applied to the steering shaft 12 is converted via the rack and pinion mechanism 15 into a linear motion in the axial direction of the rack shaft 14, and turns the front wheels 17, 17 via the tie rods 16, 16. At this time, the steering torque detecting part 20 detects the steering torque and converts it into an electrical steering torque signal T, and outputs this steering torque signal T. The outputted steering torque signal T is inputted to the control unit 22. The vehicle speed detecting part 21 detects the speed of the vehicle and converts it into a vehicle speed signal V, and outputs this vehicle speed signal V. The vehicle speed signal V is inputted to the control unit 22. The control unit 22 produces a motor current for driving the brushless motor 19 on the basis of the steering torque signal T and the vehicle speed signal V. The brushless motor 19 applies an auxiliary turning force to the steering shaft 12 via the power transmitting mechanism 18. By the brushless motor 19 being driven in this way, the steering force that the driver needs to apply to the steering wheel 11 is lightened. As shown in FIG. 2, the rack shaft 14 is housed slidably in its axial direction inside a tubular housing 31 disposed in the width direction of the vehicle. Ball joints 32, 32 are screwed into the ends of the rack shaft 14, which project from the housing 31, and the left and right tie rods 16 are connected to these ball joints 32, 32. The housing 31 has a bracket 33 for mounting it to a vehicle body (not shown) and stoppers 34 provided at its ends. The reference number 35 denotes an ignition switch, 36 a vehicle battery, and 37 an a.c. generator (ACG) serving the vehicle engine. The a.c. generator 37 starts generating when the vehicle engine starts. The control unit 22 is provided on the brushless motor 19. The reference number 38 denotes rack ends for abutting with the stoppers 34 when the rack shaft 14 moves. Dust seal boots 39 protect the inside of the gearbox 24 from water, mud and dust. FIG. 3 shows a specific construction of a structure supporting the steering shaft 12 and of the steering torque detecting part 20, the power transmitting mechanism 18, and the rack and pinion mechanism 15. The steering shaft 12 is rotatably supported by two bearings 41, 42 in a housing 24a constituting a part of the gearbox 24. The rack and pinion mechanism 15 and the power transmitting mechanism 18 are housed inside the housing 24a. The steering torque detecting part 20 is mounted on an upper part of the housing 24a. Atop opening of the housing 24a is closed by a lid 43. The lid 43 is fixed with bolts 44. The pinion gear 13 mounted on the bottom end of the steering shaft 12 is positioned between the bearings 41 and 42. The rack shaft 14 is guided by a rack guide 45 and pressed against the pinion gear 13 by a holding member 47 urged by a compression spring 46. The power transmitting mechanism 18 is formed by a worm gear 49 fixed to a transmission shaft 48 connected to the output shaft of the brushless motor 19 and a worm wheel 50 fixed to the steering shaft 12. The steering torque detecting part 20 comprises a steering torque detecting sensor 20a mounted around the steering shaft 12 and an electronic circuit 20b for electrically processing a detection signal outputted from this steering torque detecting sensor 20a. The steering torque detecting sensor 20a is mounted on the lid 43. FIG. 4 shows the construction of the brushless motor 19 and the control unit 22. The brushless motor 19 has a rotor 52 formed of permanent magnets fixed to a rotating shaft 51 and a stator 54 disposed around the rotor 52. The stator 54 has stator windings 53. The rotating shaft 51 is rotatably supported by two bearings 55, 56. A front end of the rotating shaft 51 constitutes an output shaft 19a of the brushless motor 19. The output shaft 19a is connected via a torque limiter 57 to the transmission shaft 48 so that power is transmitted between the two. The worm gear 49 is formed on the transmission shaft 48. The worm wheel 50 meshes with the worm gear 49. The above-mentioned motor angle detecting part (resolver) 23 for detecting the angle of the rotor 52 of the brushless motor 19 (the angular position of the rotor) is mounted at the rear end of the rotating shaft 51. The motor angle detecting part 23 is made up of a rotor 23a fixed to the rotating shaft 51 and a detecting device 23b for detecting the angle of this rotor 23a using a magnetic effect. The constituent parts of the brushless motor 19 mentioned above are housed in a motor case 58. FIG. 5 is an electrical block diagram of a control unit 22 according to the first preferred embodiment. The control unit 22 has a microcomputer (control means) 100, a motor drive control part 101 and a current detecting part 102. The control unit 22 amplifies outputs of the detecting device 23b with amplifying parts 104, 105 and samples them using sample-hold circuits 106, 107. The motor drive control part 101 drives the motor with switching devices. The rotor 23a (see FIG. 4) of the motor angle detecting part 23 is mounted on the same shaft as the rotor of the brushless motor 19, and the detecting device 23b of the motor angle detecting part 23 is made up of an exciting coil 108, a sin output coil 109, and a cos output coil 110 disposed around this rotor 23a. The rotor 23a is formed in an approximate + shape in cross-section when cut in a plane perpendicular to the rotating shaft 51, and as it rotates (as the rotor rotates), output values of the sin output coil 109 and the cos output coil 110 change. From these output values of the sin output coil 109 and the cos output coil 110, an angle θ can be obtained. A reference signal (voltage) given by for example sin ωt (ω: angular frequency, t: time) is applied to the exciting coil 108 from the microcomputer 100 via an amplifier 103. When the reference signal is inputted to the exciting coil 108 from the microcomputer 100, the sin output coil 109 and the cos output coil 110 output a sin signal (voltage) given by sin (ωt-θ) and a cos signal (voltage) given by cos (ωt-θ). The sin signal from the sin output coil 109 and the cos signal from the cos output coil 110 are amplified by the respective amplifiers 105, 104 and then sample-held by the sample-hold circuits 107, 106 and inputted to the microcomputer 100. The sample-hold timing at which sample-holding is carried out is determined by a signal outputted from the microcomputer 100. The microcomputer 100 has for example a CPU, RAM and ROM. A relationship between the values (digital data) of the sin signal and the cos signal and the rotor angular position θ is stored in the ROM in the form of a table. The microcomputer 100 refers to the reference signal outputted to the exciting coil 108 and samples the signal outputted from the sin output coil 109 and the signal outputted from the cos output coil 110 with the sample-hold circuits and A/D-converts them to obtain a sin signal and a cos signal. Referring to the table held in the ROM, it reads out a rotor angular position θ corresponding to the instantaneous values of the sin signal and the cos signal. By this means, it is possible to calculate the rotor angular position θ of the motor. The microcomputer 100 determines a target current value of the brushless motor 19 in correspondence with the steering torque detected by the steering torque detecting sensor 20a and the vehicle speed detected by the vehicle speed detecting part 21 (see FIG. 1). It determines target current values of the different phases (U-phase, V-phase, W-phase) of the brushless motor 19 corresponding with the rotor angular position θ detected as described above. On the basis of those target current values, it generates PWM control signals and inputs the generated PWM control signals to the motor drive control part 101. On this basis, currents corresponding to the PWM control signals are supplied to the different phases of the brushless motor 19 from the motor drive control part 101, and a torque needed for steering assistance is produced by the brushless motor 19. Thus, in this first preferred embodiment, the rotor angular position θ of the brushless motor 19 is detected on the basis of a sin signal and a cos signal by the microcomputer 100 alone. As a result, the rotor angular position θ of the brushless motor can be detected without circuit devices that are expensive and liable to be influenced by noise, such as an R/D-convertor, being necessary, and the cost of the electric power steering apparatus can be made low and its steering feel can be improved. Next, a control unit of an electric power steering apparatus according to a second preferred embodiment of the invention will be described, on the basis of FIG. 6 and FIG. 7. The control unit 22a of this second preferred embodiment includes a microcomputer (second control means) 111 additional to the microcomputer 100 shown in FIG. 5, and an angle comparing part 112. In the description of the second preferred embodiment, parts the same as parts in the control unit 22 of the first preferred embodiment shown in FIG. 5 have been given the same reference numerals and will not be described again. The second microcomputer 111 has for example a CPU, RAM and ROM, like the first microcomputer 100 (first control means). A relationship between values of a sin signal and values of a cos signal (digital data) and the rotor angular position θ is stored in the ROM in the form of a table. The second microcomputer 111 samples the signal outputted from the sin output coil 109 and the signal outputted from the cos output coil 110 with the sample-hold circuits 107, 106 and A/D-converts them to obtain a sin signal and a cos signal. It then refers to the table stored in ROM and reads out a rotor angular position θ corresponding to the instantaneous values of the sin signal and the cos signal. By this means, it calculates the angular position of the rotor of the motor. It then outputs a signal θ2 pertaining to the calculated rotor angular position to the angle comparing part 112. The angle comparing part 112 compares a rotor angular position signal θ1 outputted from the first microcomputer 100 with the rotor angular position signal θ2 outputted from the second microcomputer 111, and outputs 1 when θ1 and θ2 are different and zero when they are approximately equal as a signal to the first microcomputer 100 and a failure display part 113. When the signal outputted from the angle comparing part 112 is zero the first microcomputer 100 remains in the same state, and when the signal outputted from the angle comparing part 112 is 1 it outputs a signal to the motor drive control part 101 such that the output of the motor gradually decreases. FIG. 7 shows details of the angle comparing part 112. The angle comparing part 112 has an input part 114, an output part 115, a CPU 116 and a storing part 117. This angle comparing part 112 compares the rotor angular position θ1 inputted from the first microcomputer 100 with the rotor angular position θ2 inputted from the second microcomputer 111, and if the difference between them is less than a predetermined value it determines that all is normal and outputs a normal value signal, for example zero, to the first microcomputer 100 and the failure display part 113, and if the difference is greater than the predetermined value it determines that there has been a failure and outputs a failure signal, for example 1, to the first microcomputer 100 and the failure display part 113. The predetermined value here is pre-stored in a storage area 118 of the storing part 117. The failure display part 113 is a device for displaying whether there has been a failure of the first microcomputer 100 or the second microcomputer 111, and for example has a light-emitting diode that lights on the basis of the signal inputted from the angle comparing part 112. This light-emitting diode for example remains unlit when the signal from the angle comparing part 112 is zero and lights up when the input from the angle comparing part 112 is 1. Accordingly, when the light-emitting diode is lit it can be inferred that one or both of the first microcomputers 100, 111 has failed. Next, a control unit of an electric power steering apparatus according to a third preferred embodiment will be described, on the basis of FIG. 8 and FIG. 9. The control unit 22b of this third preferred embodiment, like the second preferred embodiment shown in FIG. 7, includes two microcomputers. Parts the same as parts of the control unit 22 of the first preferred embodiment shown in FIG. 5 have been given the same reference numerals and will not be described again here. The first microcomputer 100 and the second microcomputer 111 respectively have direction prohibiting parts 120, 119 shown in FIG. 9. The direction prohibiting parts 119, 120 output to the motor drive control part 101 a 1 signal when the steering direction and the motor rotation direction are not the same and a zero signal when the steering direction and the motor rotation direction are the same. When the signals from the direction prohibiting parts 119, 120 are zero the motor drive control part 101 remains in the same state and when the input from either of the direction prohibiting parts 119, 120 is 1 it controls the output of the brushless motor 19 to zero. Because the direction prohibiting parts 119, 120 are of the same construction, only the direction prohibiting part 119 will be described, with reference to FIG. 9. The direction prohibiting part 119 shown in FIG. 9 has a steering direction determining part 121, a motor rotation direction determining part 122, and a direction prohibiting determination part 123. The steering direction determining part 121 detects the steering direction from the signal inputted from a steering angle sensor, and for example outputs 1 if it is right-turn and outputs 0 if it is left-turn. The motor rotation direction determining part 122 detects the rotation direction of the rotor from the rotor angular position calculated by the second microcomputer 111, and outputs a 1 signal when steering is being assisted in the right-turn direction and outputs an 0 signal when steering is being assisted in the left-turn direction. The direction prohibiting determination part 123 inputs the signal from the steering direction determining part 121 and the signal outputted from the motor rotation direction determining part 122, and when these signals are the same infers that all is normal and outputs a normal value signal, for example an 0 signal, to the motor drive control part 101. When the signals are not the same, it infers that all is not normal and outputs an abnormality signal, for example a 1 signal, to the motor drive control part 101. When it receives a 1 signal outputted from the direction prohibiting part 119, the motor drive control part 101 controls the output of the brushless motor 19 to zero. Now, control of the motor drive control part 101 shown in FIG. 9 will be described, using the flow chart shown in FIG. 10. When the ignition switch is turned on, the control flow of the motor drive control part 101 starts. Step (hereinafter, S) 11: It is determined whether or not there is a direction prohibiting signal from the direction prohibiting part 119, and when there is no direction prohibiting signal processing returns and normal motor control is carried out, and when there is a direction prohibiting signal processing proceeds to S12. S12: It is determined whether or not there is a direction prohibiting signal from the direction prohibiting part 120, and when there is a direction prohibiting signal from the direction prohibiting part 120 processing proceeds to S13, and when there is none processing proceeds to S14. S13: Direction prohibiting processing is executed. S14: It is rechecked whether or not there is a direction prohibiting signal from the direction prohibiting part 119. If there is no direction prohibiting signal, processing returns and normal motor control is carried out, and if there is a direction prohibiting signal, processing proceeds to S15. S15: An error counter (n1ot shown) in the motor drive control part 101 increments by 1, and then processing proceeds to S16. S16: Direction prohibiting processing is executed and then processing proceeds to S17. S17: It is determined whether or not the count value of the error counter of the motor drive control part 101 has reached a predetermined value, and if the count value is smaller than the predetermined value processing returns and normal motor control is carried out, and if the count value has reached the predetermined value processing proceeds to S18. S18: When the count value has reached the predetermined value, it is inferred that an abnormality has arisen in one or the other of the direction prohibiting parts 119, 120, a reset signal is sent to the direction prohibiting parts 119, 120, and the direction prohibiting parts 119, 120 are reset. Here a construction is being used such that the direction prohibiting part 119 is assumed to be normal and the error counter counts up when the signal from the direction prohibiting part 120 disagrees with the signal from the direction prohibiting part 119, but alternatively it may count when the signal from the direction prohibiting part 119 disagrees with the signal from the direction prohibiting part 120. Alternatively, a construction may be adopted wherein the signals from the direction prohibiting part 119 and the direction prohibiting part 120 are compared using an OR circuit. By this means, it is possible to continue control of the electric power steering apparatus normally without comparing signals with angle comparing means or the like; that is, without detecting abnormality of the two microcomputers. Next, a control unit of an electric power steering apparatus according to a fourth preferred embodiment of the invention will be described, on the basis of FIG. 11. The control unit 22c of this fourth preferred embodiment, as in the second preferred embodiment shown in FIG. 7, includes two microcomputers. Parts the same as parts in the control unit 22 of the first preferred embodiment shown in FIG. 5 have been given the same reference numerals and will not be described again here. The control unit 22c of the fourth preferred embodiment shown in FIG. 11 may have an angle comparing part or direction prohibiting parts (not shown), but since these have already been described in the foregoing preferred embodiments they will not be described again here. A reference signal (voltage) and a reference clock pulse for example expressed as sin ωt (ω: angular frequency, t: time) are applied to the exciting coil 108 from the first microcomputer 100 via the amplifier 103. This reference clock pulse provides an excitation signal timing. When the reference signal is inputted to the exciting coil 108 from the first microcomputer 100, the sin output coil 109 and the cos output coil 110 output a sin signal (voltage) expressed by sin ((ωt-θ) and a cos signal (voltage) expressed by cos (ωt-θ). The sin signal from the sin output coil 109 and the cos signal from the cos output coil 110 are amplified by the respective amplifying parts 105, 104 and then sample-held by the sample-hold circuits 107, 106 and inputted to the first and second microcomputers 100, 111. The sample-hold timing with which the sample-holding is carried out is determined by a signal from the first microcomputer 100. The reference clock pulse to the resolver is outputted so that this sample-hold timing and the peak of the excitation signal synchronize correctly. The first microcomputer 100 has for example a CPU, RAM and ROM. A relationship between values (digital values) of the sin signal and the cos signal and the rotor angular position θ is stored in the ROM in the form of a table. The first microcomputer 100 refers to the reference signal outputted to the exciting coil 108, outputs sample-hold timing synchronized with the reference dock pulse, samples the signal outputted from the sin output coil 109 and the signal outputted from the cos output coil 110 with the sample-hold circuits, and A/D-converts them to obtain a sin signal and a cos signal. It then refers to the table stored in ROM and reads out a rotor angular position θ corresponding to the instantaneous values of the sin signal and the cos signal. In this way, the rotor angular position θ of the motor is calculated. The second microcomputer 111, like the first microcomputer 100, has for example a CPU, RAM and ROM. A relationship between values (digital values) of the sin signal and the cos signal and the rotor angular position θ is stored in the ROM in the form of a table. The second microcomputer 111 samples the signal outputted from the sin output coil 109 and the signal outputted from the cos output coil 110 with the sample-hold circuits and A/D-converts them to obtain a sin signal and a cos signal. It then refers to the table stored in ROM and reads out a rotor angular position θ corresponding to the instantaneous values of the sin signal and the cos signal. Thus, in this preferred embodiment, because sample-hold circuits for sample-holding the outputs from the resolver are provided, and the first control means (the first microcomputer 100) or the second control means (the second microcomputer 111) outputs a reference clock pulse to the resolver and a sample-hold timing pulse to the sample-hold circuits, a sample-hold tuning correctly synchronized with the peaks of the excitation signal can be outputted. Also, it becomes possible for the timing to be changed freely with the sample-hold timing remaining synchronized correctly with the peaks of the excitation signal. Although in the first preferred embodiment and the second preferred embodiment constructions were described wherein the microcomputers do not have direction prohibiting parts, in the first preferred embodiment and the second preferred embodiment it is also possible to adopt constructions wherein the microcomputers do have direction prohibiting parts. Obviously, various minor changes and modifications of the present invention are possible in the light of the above teaching. It is therefore to be understood that within the scope of the appended claims the invention may be practiced otherwise than as specifically described.

Q: Greasemonkey: Text processing - What's the best way to find certain words in a website and have a function work on it? I want greasemonkey to scan through a website and change certain words to something else. Is there a way to do it with regex or some other string processing function in javascript? Thanks for your help :) A: In greasemonkey you use the DOM and then on the text nodes regular expressions might be used for finding your words. Check the Wikiproxy user script for an example that searches for words and changes stuff.

Blog Coffee leaf rust outbreak in Central America Posted by Xavier Hamon on 25 November 2013 Last coffee season saw a massive outbreak of a devastating fungus that seemed to take everyone by surprise. The coffee leaf rust epidemic stretched from Mexico to Peru, infecting more than half of Central America’s coffee farms and costing $1 billion in crop losses. The worst affected families stripped back their entire farms, prized coffee trees reduced to kindling, and faced a stark choice – is it worth replanting when coffee prices are so low? Oversupply coming in Brazil has caused the New York coffee price to fall through the floor, and is now likely to be below cost of production for many farmers. In this context, it is hardly surprising that many farmers and governments are investing less in coffee, which hints at a key contributing factor to the outbreak in the first place. Ageing coffee plants and chronic under investment in good farm management has left many farms in a vulnerable state. As Esperanza Dionisio, General Manager of Pangoa coffee cooperative in Peru and Twin Board Member, put it to me “it’s like tuberculosis, if you don’t eat properly, you are weakened to the disease. The leaf works in the same way; if the plant is not healthy and didn’t receive organic fertilisers, it is more susceptible to rust.” The increase in extreme weather events in the region has also been associated with weakened coffee trees. You could therefore view this outbreak as just another symptom of climate change. Without investment, future such events are likely to be less and less surprising as changes to our climate look set to cause an upsurge in agricultural pests and diseases. Peter Baker of CABI speaking at Twin and the Fairtrade Foundation’s recent joint coffee rust industry event summed it up nicely: “think of it as an earthquake that reveals we were sitting all the time on a fault line.” So, as well as responding to this crisis, it is vital that we treat the cause and not just the symptom. Twin’s approach to sustainable agriculture aims at strengthening overall resilience to climate change. One example is our Big Lottery Fund project in Nicaragua, which supports five Cafénica coffee cooperatives using climate field schools. Farmers can experiment and share their ideas on farm practices such as plant nutrition, soil erosion and shade management on special plots, as well as learn from experts and benefit from technology transfer. They can apply these learnings to their own farms thanks to a dedicated Smallholder Coffee Adaptation fund, which enables participants to purchase new materials and seedlings. So, with all this support, is it worth replanting? The three years it takes for a coffee plant to reach maturity and produce a harvest represents a significant financial gamble to small farmers, especially as the global market price fluctuates wildly from day to day, let alone year to year. This is why, in addition to promoting sustainable, climate resilient agricultural practices, Twin trains farmers to understand the complex markets they are operating in. With the right tools, they can benefit from rather than fall victim to futures trading and can negotiate fairer contracts that manage their risk. But with prices so low, an extra point of difference can add much needed value to small farmers competing with big plantations on global commodity markets. The work underway in Nicaragua is a unique selling proposition for many buyers interested in sustainable production – and one worth paying a premium for. At Twin, we seek to balance all our technical assistance programmes with creating market-side demand to ensure sustainability after the funding runs out. We are therefore conducting market research in the cooperatives’ key markets to better understand how to market ‘climate-friendly’ coffee and gather the right impact data of interest to buyers. We also work with businesses through our climate initiatives to build resilience into their existing smallholder supply chains and help them secure future supply, as well as the future livelihoods of small farmers. We are seeing fantastic results in Nicaragua, but this is really just a sticking plaster on a global malady. The coffee sector is broken and needs an industry-wide response to get back on track (the necessary investments are simply unaffordable for smallholders acting alone). Tackling leaf rust requires a radical change in the business models of roasters and ethical lenders. We need to see a shift from simply lending working capital to long term finance. Currently, producer organisations can get up to a year’s capital financing using contracts as a guarantee. Loans of six to eight years are needed to really take on leaf rust, backed up by guarantees from producer organisations and long-term partnership. It’s time for the industry as a whole to wake up and smell the coffee, before the rich range of flavours from thousands of unique single origin small producers is lost forever.

Punjabi orchard farmers: an immigrant enclave in rural California. Examination of the adaptation patterns of Punjabi Sikh orchard farmers in rural California provides further evidence of ways in which strong ethnic enclaves help to promote rapid economic self-sufficiency among immigrant groups. The discussion emphasizes the need to consider not only the cultural traditions of group members, but also the historical context of immigration and the immigrants' perceptions of their particular situation. The Punjabi case indicates, too, how the 1965 Immigration Act, with its preference for family reunification, has promoted the formation of immigrant enclave.

A model for the assessment of static and dynamic factors in sexual offenders. A sample of 519 sexual offenders who were consecutive admissions to the Ontario Region of Correctional Service of Canada (CSC) were assessed with reference to a large series of variables thought to be related to sexual offending. We grouped these variables into five domains: criminality, social competence, sexual deviance, substance abuse and treatment readiness. We standardized scores on each of these domains to facilitate the calculation of total scores for each domain. We then performed a variety of analyses to determine whether these domains might constitute a reasonable model for the comprehensive evaluation of sexual offenders. Analyses indicated that overall the model received a moderate level of support.

Bandai Namco has released the Gamescom 2018 trailer and screenshots for open-world One Piece game One Piece: World Seeker. Here is an overview of the trailer, via Bandai Namco: The trailer opens with our hero Luffy, in handcuffs, being brought in front of a mysterious character sat upon a throne, high above the clouds of Prison Island on a floating fortress. But what does this character have in-store for Luffy? And more importantly, why does Luffy look so happy to be captured? Also revealed in the trailer are three new characters Luffy will come up against. The first, Borsalino (Kizaru), is an admiral in the marines, he is one of the strongest enemies for Luffy and the Straw Hat Crew. He possess the Glint-Glint Fruit (Pika Pika No Mi), which allows him to control and manipulate light at will and can even transform himself into light, giving him the power of teleportation. He is the faithful servant of the Marin headquarters and will happily fight Luffy whenever the opportunity arises. Another enemy Luffy will come up against is Admiral Issho (Fujitora). Despite being blind, he is a force to be reckoned with. Despite the mystery surrounding the exact nature of his power, he seems to have the power to control gravity, being able to subdue prisoners or even redirecting a meteoroid. Fujitora is different from the other admirals, for him what’s truly important is the security and safety of the citizens of Prison Island. Last but not least Rob Lucci is a member of the CP-0, the intelligence organisation directly controlled by the world government. He ate the Cat-Cat Fruit which allows him to transform into beast form, half-human; half-leopard. As more characters arrive in Jail Island, the mystery of why all these people are here only deepens, with rumours that Lucci himself is the warden of Prison Island itself.

Layered stimulus response training improves motor imagery ability and movement execution. This study aimed to test Lang's bioinformational theory by comparing the effects of layered stimulus and response training (LSRT) with imagery practice on improvements in imagery ability and performance of a motor skill (golf putting) in 24 novices (age, M = 20.13 years; SD = 1.65; 12 female) low in imagery ability. Participants were randomly assigned to a LSRT (introducing stimulus and response propositions to an image in a layered approach), motor imagery (MI) practice, or visual imagery (VI) practice group. Following baseline measures of MI ability and golf putting performance, the LSRT and MI practice groups imaged successfully performing the golf putting task 5 times each day for 4 days whereas the VI practice group imaged the ball rolling into the hole. Only the LSRT group experienced an improvement in kinesthetic MI ability, MI ability of more complex skills, and actual golf putting performance. Results support bioinformational theory by demonstrating that LSRT can facilitate visual and kinesthetic MI ability and reiterate the importance of imagery ability to ensure MI is an effective prime for movement execution.

3D printing – Dion has it in the tactical space and granted the technologies available today are likely tactical but the learning curve for 3D printing technologies is rapidly expanding and providing more options and applications each year. I’d call it strategic for many organizations who normally don’t think of themselves as manufacturing If there is one space that appears underrepresented (to me), it’s biotech and life sciences. The combination of genetics and big data techniques… will impact every business, even if it is just through the health of its employees. I’d also include blockchain and its effect on cryptocurrency, finance, government… there is more here than just bitcoin. The great thing about a list like this is that it causes you to think about what’s new, where the technologies stand and where they will likely be headed.

Dr. Skendaj is a Visiting Assistant Professor in the University of Miami's Department of Political Science. His research focuses on how international and local individuals can sustain peace and democracy in post-war societies. His forthcoming book examines the role of international actors in building effective state bureaucracies and democratic institutions in post-war Kosovo. He has worked with international organizations and civil society organizations in Europe and the U.S. Dr. Skendaj was the National Coordinator for the joint project of the UN Department for Disarmament Affairs and the Hague Appeal for Peace. He holds a Ph.D. in government from Cornell University.

891 F.2d 279 Bank of America National Trust and Savings Associationv.Hotel Rittenhouse Associates, Wolgin (Jack L.), Jack L.Wolgin Associates, Inc., Wolgin (Muriel) NO. 89-1502 United States Court of Appeals,Third Circuit. NOV 22, 1989 Appeal From: E.D.Pa., Broderick, J. 1 AFFIRMED.

Q: What is Floer homology of a knot? I've heard that there are different theories providing knot invariants in form of homologies. My understanding is that if you embed knot in a special way into a space, there is a special homology theory called Floer homology. Question: what's the definition and properties of a Floer homology of a knot? How is it related to other knot homology theories? A: I can say something about this for Heegaard Floer homology. Given a 3-manifold Y, you can take a Heegaard splitting, i.e. a decomposition of Y into two genus g handlebodies joined along their boundary. This can be represented by drawing g disjoint curves a1,...,ag and g disjoint curves b1,...,bg on a surface S of genus g; then you attach 1-handles along the ai and 2-handles along the bi, and fill in what's left of the boundary with 0-handles and 3-handles to get Y. The products Ta=a1x...xag and Tb=b1x...xbg are Lagrangian tori in the symmetric product Symg(S), which has a complex structure induced from S, and applying typical constructions from Lagrangian Floer homology gives you a chain complex CF(Y) whose generators are points in the intersection of these tori and whose differential counts certain holomorphic disks in Symg(S). Miraculously, its homology HF(Y) turns out to be independent of every choice you made along the way. We can also pick a basepoint z in the surface S and identify a hypersurface {z}xSymg-1(S) in Symg(S), and we can count the number nz(u) of times these disks cross that hypersurface: if we only count disks where nz(u)=0, for example, we get the hat version of HF, and otherwise we get more complicated versions. Given two points z and w on the surface S of any Heegaard splitting we can construct a knot in Y: draw one curve in S-{ai} and another in S-{bi} connecting z and w, and push these slightly into the corresponding handlebodies. In fact, for any knot K in Y there is a Heegaard splitting such that we can construct K in this fashion. But now this extra basepoint w gives a filtration on CF(Y); in the simplest form, if we only count holomorphic disks u with nz(u)=nw(u)=0 we get the invariant $\widehat{HFK}(Y,K)$, and otherwise we get other versions. The fact that this comes from a filtration also gives us a spectral sequence HFK(Y,K) => HF(Y). This was constructed independently by Ozsvath-Szabo and Rasmussen, and it satisfies several interesting properties. Just to name a few: for knots K in S3 it has a bigrading (a,m), and the Euler characteristic $\sum_m (-1)^m HFK_m(S^3,K,a)$ is the Alexander polynomial of K; there's a skein exact sequence relating HFK for K and various resolutions at a fixed crossing; the filtered chain homotopy type of CFK tells you about the Heegaard Floer homology of various surgeries on K; the highest a for which HFK*(S3,K,a) is nonzero is the Seifert genus of the knot; If Y-K is irreducible and K is nullhomologous, then HFK(Y,K,g(K)) = Z if and only if K is fibered (proved by Ghiggini for genus 1 and Ni in general, and later by Juhasz as well). For knots in S3 it is also known how to compute HFK(K) combinatorially: see papers by Manolescu-Ozsvath-Sarkar and Manolescu-Ozsvath-Szabo-Thurston. The relation to other knot homology theories isn't all that well understood, but there are some results comparing it to Khovanov homology. For example, given a knot K in S3: Just as Lee's spectral sequence for Khovanov homology gave a concordance invariant s(K), the spectral sequence from HFK(K) to HF(S3) gives a concordance invariant tau(K), and both of these provide lower bounds on the slice genus of K. (Hedden and Ording showed that these invariants are not equal.) There's a spectral sequence from the Khovanov homology of the mirror of K to HF of the branched double cover of K. For quasi-alternating knots, both Khovanov homology and HFK are determined entirely by the Jones and Alexander polynomials, respectively, as well as the signature; this can be proven using skein exact sequences for both (Manolescu-Ozsvath). Anyway, that was long enough that I've probably made several mistakes above and still not been anywhere near rigorous. There's a nice overview that's now several years old (and thus probably missing some of the things I said above) on Zoltan Szabo's website, http://www.math.princeton.edu/~szabo/clay.pdf, if you want more details.

Q: System.Windows.Browser in Windows Phone I'm trying to open a webpage in a Silverlight App for Windows Phone 7. Is there a way to open Internet Explorer? A: You'll need to use the WebBrowser Task to open a WebPage in Internet Explorer. Add the following using statement: using Microsoft.Phone.Tasks; Then you can use the Task in a function such as below: WebBrowserTask task = new WebBrowserTask(); task.URL = "http://www.stackoverflow.com"; task.Show(); Hope this helps!

Donate Farm Sponsorships Sponsor a hive, apple tree or heritage breed animal on our farm! Over the past 50 years our food supply has become more industrialized and driven by agribusinesses. The rise of industrial agriculture has signaled the decline of genetic diversity. According to the Food and Agriculture Organization (FAO), just 14 species make up 90 percent of our global food supply. In the U.S. more than 90% of our dairy comes from Holstein cows. More than half of the hog breeds used just 50 years ago are now extinct, and just five industrial breeds of chickens supply nearly all of our meat and eggs. Rodale Institute brought livestock back to the farm to help preserve valuable heritage breeds of farm animals. In addition to advocating for organic crops we also teach people how to manage an organic apple orchard. The Honeybee Conservancy at Rodale Institute promotes natural and sustainable beekeeping practices through education and outreach. Help our continuing efforts to change the decline of diversity and sponsor a hive, apple tree or heritage breed animal today!

Yes ofcourse, i would love to save my whole money in bitcoin and wait for 5 to 10 years to grow my money. this is a good question you've got. i will recommend this to my family also about this matters. coz they know that i'm saving my money thru bitcoin.. its profitable to save for a long time because bitcoins prices are on the ever increase ride and no matter how it tumbles it will rise back up again and so you ll not loose if you invest into it in the long term. that's right people will realize that bitcoin has a real value that it will give as max potential, no matter the price is still bitcoin is always pumping and keeps going up trend.. this is the best investment of a lifetime.. For sure it is because we have seen it dump and now it's back to it's normal trend, when we keep holding our bitcoin we can expectwe'll get great benefits on it because it will make us more profitable as the value will continue to rise. Every day there are appearing many services which pays for storing bitcoins in your wallet. It is not necessary to do something, just need keep bitcoins in your wallet, for holding bitcoins will be accrued percents, and percents there are very high. Others people just dont want do anything with their bitcoins and they are just waiting for bitcoin growth rate and will sell their bitcoins more expensively. Bitcoin is benefit for a long time but we need to be it safe and secure do't put money in one saving. instead half of your investment you can put in bank. or invest it to the business. in this way your money become profitable instead of stocking in one account only. and avoid company say it easy money and invest quick if this is legit or not...the scammer are too many out there watching and roaring like a lion. It is a lifetime guarantee to make profit and just waiting or leave that and work or entertain yourself for the time being. May as well benefit you for life if you just save even a 5 of it possibly to double you money for a year or two only. It is a lifetime guarantee to make profit and just waiting or leave that and work or entertain yourself for the time being. May as well benefit you for life if you just save even a 5 of it possibly to double you money for a year or two only. I agree, Bitcoin is like a lifetime investment. So if you invested in bitcoin and hold them for a couple of years the benefit you get from it is the profit you gain from holding it. It has already been proven and tested in time that bitcoin does profit a great amount in just over a couple of years. why so many people store their bitcoin in their wallet for a long time, whether the benefits will they get? Come share your thoughts Some people just store and save their bitcoin for a long time because they are waiting for its price to go higher so that they can earn a lot of profit. But some people who earn bitcoin just spend it right away to buy what they want. For me, it is better to save it first and spend it for any future purposes. why so many people store their bitcoin in their wallet for a long time, whether the benefits will they get? Come share your thoughts Many people wanted to hold bitcoins in their wallet due to the reason that bitcoins price will rise up and rise up as the time goes along and for believing that they will get rich someday. There are lot of people that are now rich because of buying bitcoins two years ago. why so many people store their bitcoin in their wallet for a long time, whether the benefits will they get? Come share your thoughts Many people wanted to hold bitcoins in their wallet due to the reason that bitcoins price will rise up and rise up as the time goes along and for believing that they will get rich someday. There are lot of people that are now rich because of buying bitcoins two years ago. That is right, a lot of people now are rich because they believed in bitcoin and they keep on buying bitcoin for the past few years and it resulted for them to make a lot of money and i think that we can also do it if we will buy bitcoin right now and hold it for the next 2 years or even more and we can expect some good profits because the price of bitcoin is ready to shoot up again. why so many people store their bitcoin in their wallet for a long time, whether the benefits will they get? Come share your thoughts Maybe because they are waiting for the value to increase than present value. We do not know what the future of bitcoin with regards to its market value wether it will increase or decrease. The longer we keep our bitcoins the higher the risk we take if we profit from it or not. Yes ofcourse, i would love to save my whole money in bitcoin and wait for 5 to 10 years to grow my money. this is a good question you've got. i will recommend this to my family also about this matters. coz they know that i'm saving my money thru bitcoin.. its profitable to save for a long time because bitcoins prices are on the ever increase ride and no matter how it tumbles it will rise back up again and so you ll not loose if you invest into it in the long term. that's right people will realize that bitcoin has a real value that it will give as max potential, no matter the price is still bitcoin is always pumping and keeps going up trend.. this is the best investment of a lifetime.. For sure it is because we have seen it dump and now it's back to it's normal trend, when we keep holding our bitcoin we can expectwe'll get great benefits on it because it will make us more profitable as the value will continue to rise. Instead of wait and hope, why do you not own your chance? You can create the opportunity make money through trading Bitcoin with day trade. Honestly, I don't like saving Bitcoin for a long time though my wallet still have an amount for saving long term, but the profits you can earn from trading will be better than holding. To date, I have seen couple of those who have been disappointed in keeping Bitcoin for a long time. But this isn't an easy task... right now Bitcoin is more stable, but years back, unpredictability was insane. Why so? Because as much as I know the value of the bitcoin is very high and it is giving the profit to the thousands of the people and this is the reason the bitcoin is increasing in the value and the price I hope the bitcoin will be the best currency so no need to lose the hope and the bitcoin will give the value to the people who are having the fun in the bitcoin now I know how to use the bitcoin and how to increase the bitcoin power just be patient. Yes ofcourse, i would love to save my whole money in bitcoin and wait for 5 to 10 years to grow my money. this is a good question you've got. i will recommend this to my family also about this matters. coz they know that i'm saving my money thru bitcoin.. its profitable to save for a long time because bitcoins prices are on the ever increase ride and no matter how it tumbles it will rise back up again and so you ll not loose if you invest into it in the long term. that's right people will realize that bitcoin has a real value that it will give as max potential, no matter the price is still bitcoin is always pumping and keeps going up trend.. this is the best investment of a lifetime.. For sure it is because we have seen it dump and now it's back to it's normal trend, when we keep holding our bitcoin we can expectwe'll get great benefits on it because it will make us more profitable as the value will continue to rise. Instead of wait and hope, why do you not own your chance? You can create the opportunity make money through trading Bitcoin with day trade. Honestly, I don't like saving Bitcoin for a long time though my wallet still have an amount for saving long term, but the profits you can earn from trading will be better than holding. Right, I also do not like to wait for a long time, I prefer to get profit from daily trading with altcoin, there is no guarantee that the future prices can skyrocket. We never know what's going on with the future so the best thing we can do is find as much profit as possible and in a short time. why so many people store their bitcoin in their wallet for a long time, whether the benefits will they get? Come share your thoughts Yeah It is! It is the reason why many people are holding their bitcoin because of the benefits that they can get in the future. All of the investors have a faith to the bitcoin that it will gonna increase in the following years. Bitcoin has potential so it is better to hold it in a long time. why so many people store their bitcoin in their wallet for a long time, whether the benefits will they get? Come share your thoughts I think that the benefit of saving for a long time is obvious. Bitcoin's price has doubled in the last few months. So if you save Bitcoin in a wallet for a long time then you can increase your money several times. This is a much more stable way of earning Bitcoin than trading or gambling. This is a great long-term investment. I do not think we can get a huge profit in just over 3 years, compared with a mutual fund that takes at least 10 years to get 200% profit or gold that takes more than 25 years to get 100% profit. even just within 1 year bitcoin has increased more than 600%. I remember when earlier in the year of 2017 bitcoin is still around $1000 and this time around $6000 even reached ATH $7500. so it's really been proven, bitcoin very profitable for the long term even short-term. It takes patience if we invest, it is not possible in a short time we can get a huge profit, and this also applies to bitcoin, keeping at least 3 years then we will get profit up to thousands of percent. there are many benefits i currently save bitcoin to help in hard times but instead of simply keeping it in a wallet i deposited on yolodice and invested in its bankroll i made 15% profit till now we should save by investing in bankroll My own point of view to this is that, it is much better to save bitcoin for a long span of time because of its fast changing exchange rate. As time goes by, everyone notice how bitcoin benefits all users in its very high rates. So meaning it is a great idea saving bitcoin because of the fact that the longer you save bitcoin the more you experience its fast rising exchange rate. This is one good reason why we consider bitcoin as the number one currency among all others. You get to experince its biggest value even if you stored it for quite some time. So it would be very advisable to save it rather than spend it not in normal manner.

Reproducibility of acoustic rhinometry in the investigation of occupational rhinitis. To diagnose occupational rhinitis, it is mandatory to conduct an objective assessment of changes in nasal patency during specific inhalation challenge (SIC). The reproducibility of acoustic rhinometry measurements in the setting of occupational challenges has never been examined. This study assessed the reproducibility of acoustic rhinometry during SIC investigation of occupational rhinitis. Twenty-four subjects underwent acoustic rhinometry measurements during SIC investigation of occupational rhinitis. Subjects attended 3-6 days of SIC within a week by means of a realistic or closed-circuit apparatus methodology All of the within-day intraclass correlation coefficients (ICCs) for nasal volume (2-5 cm) and minimum cross-sectional area (MCA) based on a different number of measurements (2-7) were above 0.85; all of the coefficients of variation (CVs)for the same parameters were low (below 10%). The between-day CVs based on different numbers of SIC sessions ranged from 8.0 to 8.8% and from 6.8 to 8.8%for nasal volume and MCA, respectively. The between-day ICCs ranged from 0.80 to 0.88 and from 0.83 to 0.94 for nasal volume and MCA, respectively. Acoustic rhinometry showed good within- and between-day reproducibility and can be recommended for the objective monitoring of nasal patency during SIC investigating occupational rhinitis.

To link to the entire object, paste this link in email, IM or documentTo embed the entire object, paste this HTML in websiteTo link to this page, paste this link in email, IM or documentTo embed this page, paste this HTML in website P.R. Wins Senate Battle To Make CCC Permanent Government Agency Editorial Offices RI • 4111, Sta. 227 Night - PR ■ 4776 SOUTHERN Volume XXVIII CALIFORNIA TROJAN United Press World Wide News Service Los Angeles, California, Friday, May 21, 1837 Number 141 troy To Honor Sen olars Faculty Procession in Academic Robes To Precede Special Assembly in Bovard; Di. von KleinSmid Will Preside In recognition of outstanding intellectual achievement, r s c. students will honor 32 scholarship fraternities this Ktning at a special assembly in Bovard auditorium when pal Scholarship day is observed on campus. Faculty members will don their academic robes and file Bovard in processional form ¥-—....... Archibald Sessions, at the • I i Smirl Is New Ljule of the organ, plays the pro-Mon march. g,j<ed In the front rows of Bo-auditorlum. more than 400 students will rise as the fac-tTmembers enter and take their ta in a special section of the Mtcrium. OIF. TO SING Dr Rufus 3. von KleinSmid will ide over ihe program, which will j with three numbers by the [ftppella choir. With Prof. John man directing, the choir will K. Ballentine Henley, coordin-llw officer, stated yesterday lhat indent* to be honored at the thtl»r*hlp assembly will not wear ap and gowns. Faculty mem-lm rill report at Ihe Hall of M!en« »t 9:50 a.m. lor the fac-ilT profession. Bawls "Hymn to Raphael." its of the Village" 'Russian folk and Thlman's “Oh No, John.” Dr. von KleinSmid will then make telcomlng and recognition ad-. after which he will introduce jssembly speaJcer, Prof. Louis ier Wright, staff member of Henry E. Huntington library irt gallery. TIRES AT CALTECH i member of Phi Beta Kappa, lessor Wright will address those ittendance on "Scholarship and Author of several books on Ssh literature, the speaker is J-known for his research work literature fields, and at the preside Is lecturer in English at ■orma Institute of Technology, k past years an all-day affair. tribute to Troy’s scholars be confined to the morning as-Special programs listing members of the various honor-*111 be circulated at the as- Greek Head Four Olhers Elected For Inlerfralernily Council Positions Bob Smirl, Trojan Knight and member- of Sigma Phi Epsilon social fraternity, was unanimously elected president of the Interfraternity council for 1937 last night during the council's meeting at the Phi Kappa Psi house. Other Greek men selected as officers for the coming year were Burt Lewis, Zeta Beta Tau. vice-president; Art Manella. Tau Epsilon Phi, secretary; and Bob Van Bus-kirk, Phi Kappa Tau, treasurer. Bob Trapp, outgoing president, wa.s presented a key as a token of esteem by the council's members. As a finale to a year of interfratemity competition tn the field of sports, plans were announced for a giant "Bunion Derby" to be run Tuesday night, June 1. A team of four men from each Greek house will compete in the race, to be held over a one and one-half mile course. In an effort to improve the council's present constitution, a committee comprised of Lewis, Jim Hogan, Tom Guernsey, Manella, and Horace Proulx were appointed by Trapp to revise the pjesent document over the summer months. RED ATTACK ON TROTSKY INTENSIFIED MOSCOW. Priday, May 21—OJ.D —The government today intensified its drive against "Trotskyists" and spies following the execution of 44 persons at Svobodny, Siberia, for allegedly planning to blow1 up the trans-Siberian railroad in a Japanese plot. Orders were issued to guards along the 6000-mile new doubletrunk railroad to increase precautions aaginst "Trotskyists” allegedly in the pay of Japanese secret service police. Investigations of widespread sabotage ln Russian industries, revealed in the government organ, Pravda, were speeded up. The investigations spread to the army, which was reshuffled in a new decree placing military control in the hands of party leaders and War Commissar Klementi E Voroshilov, reportedly to eliminate the possibility of espionage among trusted army officers. deavour I drift at Sea Une Breaks ^'PORT. R I May 20—tU.PI— 0 M Sopwith's Endeavour I, *t* here a.s a possible challeng-*the America's Cup yatch races, » convoy 900 miles off New-/ then her towline parted at wipht of a 55-mile gale, but opposed ly continuing the Jour- 1 aider her own sail, according sports here today. >rt of the mishap, brought i I *convoy motor Viva, fail-L warm officials of the Herre.s-Wrds at Bristol where Endea-. which arrived under tow is tied up. . Haffenreffer. general man-“ the Herreshoff yards, said Wf is undue excitement | L e whole thing.” j LITCHFIELD. 111., May 20— (I'.Ri— n, ?. defender like Endeavour ' Five hundred coal miners began a sit-down strike tonight a half mile underground in the shaft of the Superior Coal company at Wilsonville. near here. The miners, members of the Progressive Miners of America, went on strike because of dlssatlsfaction over division of work a strike leader said ln a telephone conversation from the mine shaft. The miners sat down as their shift ended at 7 p.m. George Wilcox, mine superintendent, said the men had "no reason to strike." Batt le Over CCC Is Won By Roosevelt President's Victory Is Followed by Defeat In Economy Fight WASHINGTON. May 20 —(U.R*_ President Roosevelt lost a $3,200,000 economy fight in the "pork-hungry” house late today but won an easy victory In the senate to make the Civilian Conservation corps— his favorite new deal project—a permanent agency. Earlier he had bowed to house Democrats rebelling against his sweeping economy drive, by agreeing to support a $25,000,000 emergency flood control program for the Ohio valley this year. Thus Mr. Roosevelt reversed the position he took 4 fortnight ago when he urged that flood control authorizations be deferred until the next session of congress. BLANK CHECK INDICATED Although the revolting house torpedoed plans of Mr. Roosevelt and its own appropriations committee to economize on the interior department appropriation bill, there were indications that the Democratic majority would £ive the president another blank check for $1,500,000,000 to finance relief during the coming fiscal year. The work-relief bill was placed before the chamber today with a charge by Rep. Clifford A. Woodrum. D„ Virginia, that racketeers are keeping up the cost of federal aid to the destitute. Woodrum. who led a futile fight in committee to slice the appropriation $500,000,000 in the interest of economy, said caustically that such a reduction would not provide "a liberal allowance for the relief racketeers keeping hanging onto the trough—not a liberal allowance for socialistic or idealistic experiments.” SUPPLY BILL INCREASED Action by the house ln increasing the Interior supply bill approximately $2,060,000 over this year's grant, $3,200,000 over budget estimates, and $7,800,000 over the appropriation committee's recommendations did not startle democratic leaders. Other supply bills have been passed and sent to the senate calling for appropriations substantially below budget estimates. But the interior bill embraces such vote-getting projects as vocational education, parks, highways, and reclamation work which, in the political vernacular, go under the general title of "pork." For example, the appropriations committee recommended $7,241,500 for vocational aid to states. The budget bureau recommended $4,241,500 and warned that to increase this amount would be "wasteful and unnecessary.” SPEAKER Coal Miners Begin Strike “ able to take the sea with Proper rig ri. the towing yacht. . ot alarmed. Unless we get ,10 th<“ contrary we feel ftdeavour I ls pretty safe.” ni the ®s'dents ice i'.he'T’^ Cia'V w‘1* ke observed «Knh:^P^s the University HI 'l Cal*fornla today with------ * iDel'r. ‘ The I [? memi Wl11, ** Lr,uis B Homiston To Lead * « th the research *>■ and ry E Hunt‘ngton Meditation Service W, art Sallery i . Nowine sohoHnio Professor Fox Appointed YMCA Advisor Appointment of Robert Fox, professor of civil engineering, as faculty advisor for the YMCA was made public last night by Wallace Dorman, president, at a dinner at Clifton’s cafe. "We include all races in our activities." said Dorman in his banquet speech last night. "The influential program of the 'Y' is not limited to the campus, but is carried throughout southern California by deputation teams which represent the university before hundreds annually." Students appointed to serve on YMCA committees next year include Floyd Cunningham and Harold Porter, membership; Bruce Kurrle, re-crention; Floyd Bunill. finances; Herbert Klein, publicity; Herbert Archibald religion; Edward Gron-eck. conferences: Arthur Guy. program; George Bchwelger, international relations; and David Bradley, deputation. Boris Morros, music director of Paramount studios, will be one of the speakers at the cinematography banquet in the Foyer of Town and Gown tonight. Film Dinner To Be Tonight Outstanding Film Notables Will Be Given Awards Outstanding achievement in the motion ptcturc industry will receive j official recognition here tonight Then film notables gather for the fourth annual American Institute of | Cinematography banquet in the Foyer of Town and Gown. The af- | fair will begin at 7:30 p.m The evening's program will be directed by master of ceremonies | Howard Estabrook. Paramount stu-does’ screen-writer and producer. Among the principal speakers will be Dr. Lee de Forest, noted American Inventor; Coningsby Dawson, j British author; and Dr. J. Eugene I Harley, chairman of the department of political science. ZUKOR TO TALK Shorter talks will be given by Boris Morros, music director of Paramount studios; Adolph Zukor. producer; and Cecil B. de Mille. director and producer, of the same stu-| dios; and Slavko Vorkapich, MGM I speclal-effects man. [ An integral part of the evening's J plans will be the awarding of J achievement diplomas and honorary | memberships in the institute to i members of the film colony who have distinguished themselves in some branch of the Industry. These | awards are regarded as second in Importance only to the academy . statuettes. j STUDENT TICKETS AVAILABLE Prominent among the guests will be Paul Muni, Anita Louise, Douglas Scott, Grant Mitchell, Rouben Ma-moulian, William Dieterle, Merian A. Cooper, and Barrett Kiesling. Special student tickets for the program alone have been made available at the cashier's office ln J the bookstore for 50 cents. Regular tickets at $2 a plate for > the banquet and program can be | obtained at the cinematography office, 120 Old College. Sigma Sigma Will Sponsor Kids Camp Religious Conference Board Offers Site In Big Pines Area For the first time in its history, U.S.C. will maintain a summer camp for Los Angeles' underprivileged children ln July through the combined efforts of thc University Religious Conference and Sigma Sigma, junior men's honorary. To aid the Sigma Sigmas in carrying out the project for which they recently sponsored a benefit show on campus, the religious group yesterday offered its camp site and equipment at Big Pines, donated two years ago by Los Angeles county. FORMERLY RUN BY U.C.L.A. During the two years, thc University Religious Conference has maintained a summer camp for underprivileged children on the site, Mauri Kantro. Sigma Sigma ptcf ident. announced yesterday that there will be a mwling of all members of the junior men's honorary in the men's lounge at 9:50 o’clock this morning to discuss plans for thf summer ramp. known as University camp. Previously the camp has been paid for and run by the U.C.L.A. campus religious group, and this will be U SC.'s first opportunity to have a session of its own. Counselors at the camp will be U.S.C. men who will be chosen by a committee composed oi Margaret King, head of the Trojan Religious Conference; Mauri Kantro, Sigma Sigma president; and Thomas S. Evans, executive secretary of the Religious conference. TROJANS TO APPLY FOR JOBS Trojan men wishing to apply for positions as counselors at flic camp may leave cards stating their names and qualifications on the desk in the Religious Conference office, 230 Student Union and will later be interviewed by the committee. Youngsters who attend the camp will be chosen by the Family Welfare association, a city federation of social agencies. Approximately 40 boys can be accommodated for the 2-week session. By working together on the camp for the university. Sigma Sigma and the Religious Conference hope to establish It as a permanent project, and later to provide for a perpetual fund for its maintenance. Hal Roberts Resigns As Band Director Dramatists To Present Famous Play Scenes Semester examinations • will be taken by students in the advanced dramatics class Tuesday and Thursday when they present a series of scenes from outstanding plays in Touchstone theater. Among the plays from which scenes will be taken are "Hamlet," "First Mrs. Fraser,” “Cradle Song," "Cyrano de Bergerac," "Petrified Forest," and “Ah Wilderness." Senior Week Ticket Sale Ends Monday Requesting graduating seniors to "act immediately," Leonard FUich, I senior class president, announced I yesterday that ticket sales for senior week program will close Monday. Priced at $6 50. the tickets will ! admit seniors to all events sched-| uled for senior week, and in addl-I tlon. the alumni dues for next year | arc Included. Tickets may be purchased in 427 Student Union. The announcement of a definite deadline for the purchase of tickets follows a number of postponements by the senior week committee ! DEADLINE IS DEFINITE j "There positively will not be any sale of tickets after Monday," Finch said. "We feel that seniors ! should have the opportunity to be j with their classmates during the I week, but because of the proximity of graduation, we feel justified in calling Monday the dead-! line." Senior week will begin May 29 when baccalaureate services will take place In the Coliseum, and it will be terminated June fi when the seniors receive thetr diplomas. BALL INCLUDED Holders of senior week tickets wlll be entitled to admission to the senior “swing", ln the evening following the baccalaureate services. Tire dance location will be announced later by thc committee. Admission and dinner for two persons for the senior ball, final event j on the program, are included in the j ticket. Arrangements for thc ball are under the direction of Mauri 1 Kantro. PICNIC SCHEDULED | Among the other event"! to which the tickets will admit bearers is a | picnic to be given at Pop's Willow' | lake May 31. Jack Privett, chair-i man of the picnic committee, lias planned a program of games, swim-j mlng. and a barbecue for the day. I The senior play will be presented in Bovard auditorium as a senior week event June 2 at 8 p.m. The committee In charge of this part of the program is romposed of Lucille Hoff and Bob Norton. Ivy day ceremonies and a senior assembly will take place on the morning of June 3 In the afternoon. Dr. and Mrs. Rufus B von KleinSmid will be hosts to the graduationg students nt their home. 10 Chester place, from 3 to 5 p.m. RESIGNS POST U.S.C. Organizations schedule will gov •Mso m<>ming: N:50 hJi^bly, U:2C a B. von KleinSmid. President j Student meditation services will j be conducted at 7:30 o'clock this morning in the Little Chapel of Sil-j ence by Robert M Homiston. pres-j Ident of the School of Religion | student body. j Homiston will replace Dr. Carl S | Knopf, dean of the School of Religion. who regularly conduct* the i service. California Labor Bill Defeated SACRAMENTO. May 20 — Il'P)— The latest legislative attempt to salvage a program to create a state labor mediation board failed tonight when the senate linance committee lefused to approve the McGovern bill to set up a board to which labor disputes could be appealed The bill resulted from a conier-ence of labor, industrial, and agricultural representatives who admitted that other measures on the subject stood no chance of final passage. It proposed merely to create a mediation board of five which would investigate labor troubles and aid in attempting to settle them. Sigma Della Pi Initiation, a dinner, and a specch by Prof. Margaret Husson of Pomona college will be the program of the evening for members of Sigma Delta Pi. honorary Spanish society, tomorrow night at the Arcade hotel. The initiation will start at 6:30 p.m. and the dinner will be ai 7:30 p.m. Inlerfralernily Alumni Tlie interfratemity alumni asso elation of southern California will entertain prominent alumni from every fraternity on the campus in their annual spring banquet tonight at the University club, according to an announcement released to house presidents yesterday. Phi Lambda Uprilon O ficers of Pin Lambda Upsilon national honorary chemical .society, were chtsen yesterday for the coming year. Those elected were Roy Newsom, president; Andrew Craw-sen. vice-president; Norman Crawford. secretary-treasurer; and Dr Leroy S. Weatherby, counselor. Initiation of five new members will take place in the men's grill tonight. Those to be initiated are Lee Struble, Leroy Poor man, Harry McCracken, Chester Stevens, and , Karl Otto van Kelienbach. Della Kappa Alpha The filial meeting of Della Kappa Alpha, national honorary and professional cinematography fraternity, will take place at Scully's resaurant, 4801 South Crenshaw boulevard, Sunday, at 5:30 p.m. Oregg Toland. chief cameraman at United Artists, wlll be elected to honorary membership. Sigma Bela Chi Capt. Frank Jansen, former captain of the Leviathan, will speak to members of Sigma Beta Chl, national trade and transportation fraternity, when they convene for Iheir last mreting of the semester at 12 15 pin. today ln Elisabeth von KleinSmid hall. The speaker's sub-j ject is "Tales of the Sea.” Skull and Moriar | Pledges of Skull and Mortar, honorary pharmaceutical service organization for men. will meet In 304 Science building at 9:55 a.m. today, according to Masy Masuyka. secretary of the society. Westminster j The Rev. Donald O Stewart, ad-| viser of the Westminster club, wlll 1 preside at a meeting of th* U.S.O. Presbyterian society today at 12:20 j p.m. tn 332 Student Union. Lancers Will Elect Next Year s Officers Monday To elect officers for the next school year, members of the Trojan Lancers will gaiher In Bovard auditorium at 10 o'clock Monday morning, when nomination and acceptance speeches will be given for Bill Quinn, John Rose, and Louis Tarleton. candidates for non-org president. Those wishing membership on the Lancer administrative board will be presented, and opportunity will be given for further nominations from the floor. Students who have filed petitions for offices on the Lancer administrative unit are Bill Andreve, Evelyn Bard. Wallace Dorman, Frances Dunn. Louisa Gllllngworth, Jean Haygood. Mary Chun Lee. Harold Porter. 8hirley Rothschild, and Emil Sady. Petitions for tlie non-org positions can be obtained from the Student Union cashier, but must be returned to the window by 3 oclock this afternoon. .ai old William Roberts, Trojan band director, yesterday tendered his resignation from the U.S.C. staff. Dr. R. B. von KleinSmid indicated the resignation will be accepted. Dissertation To Be Printed Book Is First U.S.C. Doctorate Work To Be Published Word whs received yesterday by Ivan Benson, associate professor of journalism, that his Ph. D. dissertation has been accepted for publication by the Stanford University press. Thc acceptance marks the first time a dissertation from tlie U.S.C. Graduate School has gone Into publication. Professor Benson received the notification during thc day on which he took his final examination for the degree of doctor of philosophy. Dr. Rockwell D. Hunt, dean of the Graduate School, stated last night that Benson has passed the examination and will be recommended for the degree ln June. The book ls beir.g edited now, and ! Its title when published will probably be "Mark Twain In the West," according to thc author. J "Tiie Western Development of Mark Twain” ls the title of Pro-. fcssor Benson’s dissertation. It ls a study concerned with the development of Mark Twain as a writer during the five and one-half years [ he was ln the western port of the United States. Composed of heretofore unknown of 8amuel Clemens, the dissertaUon material on this period In the life refutes falsehoods and myths which have been associated with the humorist by his various biographers. Included ln the work are 67 unreprinted newspaper articles written by Mark Twain and published during his 5-year stay In the West. Trojan Music Head Leaves September 1 Culminating 11 years of service as founder and director of the musical organizations department, Harold William Roberts tendered his resignation to Dr. Rufus B. von KleinSmid yesterday, asking to br relieved of his duties after September 1. Roberts, who has been considering a business career for the past tn i years, made his decision following a short conference with von KleinSmid Wednesday. The president announced yesterday that thc resignation would be accepted at Roberts’ own request. AT U. S. C. SINCE 1926 Graduating from U. S C. ln 192(1, lie whs appointed director of musical organizations. Through his efforts the band, orchestra, glee clubs, and A Cappella choir were reorganized Into one department, ln 11)26 he designed the present musical organizations building behind Mudd hall, from which the first collcgiate band broadcast was made In the same year over KMTR. starting with a unit of 30 musicians In the first year, Roberts Has developed the band into one of the outstanding collegiate groups in the country, directing a Trojan football band of over 200 last season. He stated that 3000 men have participated in the Trojan band alone since he became director. OLYMPIC MUSIC SUPERVISOR Well-known ln civic centers, the director of musical organizations Is a prominent Elk and technical director for 20th Century-Fox studios. In 1934 he was appointed chairman of military affalls committee for the Junior Chamber of Commerce. Much of the musical details and programs during the i Xth Olympiad was under his su-j pervlslon. Expressing regret at terminating I his work with U. 6, C., Roberts said j that he had been formulating definite plans on entering a business during the past two weeks. He wlll finish this semester in hls present capacity, however, as tiie reslgna-j tlon does not function until the fall term. Five Oil Tanks Explode At Huntington Beach HUNTINGTON BEACH, May 20 —il’ i'i—A half block of this B'ath city was in flames tonight after a well belonging to the Pacific Coast Oil company exploded, police reported. Five oil tanks exploded after the initial blast, lt was said, ar.d the fire was spreading. Fire department officials reported that the entire force was called out to avert spread of the flames | to hundreds of other oil derricks • in th* viouinj. Trouble Averted In Hitler Ridicule WASHINGTON. May 20—<l’.U> Tlie state department probably wlll not reply to Informal representations by the German embassy against George Cardinal Mundelein's criticism of Chancellor Adolf Hitler as "an Austrian paper hanu-er, and a poor one at that," Secretary Cordell Hull said tonight. The department’s position wa.s made known after a series of swift, behind-the-scenes maneuvers had headed off International complications similar to those caused by Mayor Fiorello H LaGuardia of New York, two months ago, when he suggested Hitler for a “chamber of horrors" at the forthcoming New York World's fair. Studio Workers Desert FMPC Strike By United Press, Members of the Studio Utility Workers union bolted the strike ranks of the Federated Motion Picture Crafts last night by signing an independent agreement with producers. granting them a union shop and a 15-cent-an-hour wage Increase. The group, consisting of studio laborers, wlll return to work within a few days, Joseph Marshall, thelr International vice-president announced. Their loss was a severe blow to the FMPC, which had been struggling io preserve a united Iront in the face of three previous defections. With the laborers withdrawing from the federation, thc strike ranks were reduced to seven unions. Tlie Utility Workers group was the second largest unit ln the FM PC which earlier had been deserted by the costumers, machinists and culinary workers unions. Thesis Deadline Is Today at 5 p.m. The deadline for the submission of theses will be 5 p.m. today, Miss Ruth Boknett, secretary to Dean Rockwell D. Hum, stated yesterday. Candidates who have had their theses accepted by student thesis committees aie eligible to submit them for degrees not later than this afternoon at the Graduate School ofllo*. Trojan Women Win Awards Out of an insurance class of 45 students. Pauline McCarty and Gertrude Lindgren. College of Commerce students, were awarded fust and second places, respectively, m a letter writing contest telling th* advantages of insurance. The contest was sponsored by the life insurance underwriters association of Los Angeles, during national insurance week. First prize of $35 was awarded to j Miss McCarty, graduate student, formerly of Butler university. Miss LUidgren is president of Pht Chi Theta, national professional ' women's commerce society, and • I member of CUoumu. P.R. Wins Senate Battle To Make CCC Permanent Government Agency Editorial Offices RI • 4111, Sta. 227 Night - PR ■ 4776 SOUTHERN Volume XXVIII CALIFORNIA TROJAN United Press World Wide News Service Los Angeles, California, Friday, May 21, 1837 Number 141 troy To Honor Sen olars Faculty Procession in Academic Robes To Precede Special Assembly in Bovard; Di. von KleinSmid Will Preside In recognition of outstanding intellectual achievement, r s c. students will honor 32 scholarship fraternities this Ktning at a special assembly in Bovard auditorium when pal Scholarship day is observed on campus. Faculty members will don their academic robes and file Bovard in processional form ¥-—....... Archibald Sessions, at the • I i Smirl Is New Ljule of the organ, plays the pro-Mon march. g,jrt of the mishap, brought i I *convoy motor Viva, fail-L warm officials of the Herre.s-Wrds at Bristol where Endea-. which arrived under tow is tied up. . Haffenreffer. general man-“ the Herreshoff yards, said Wf is undue excitement | L e whole thing.” j LITCHFIELD. 111., May 20— (I'.Ri— n, ?. defender like Endeavour ' Five hundred coal miners began a sit-down strike tonight a half mile underground in the shaft of the Superior Coal company at Wilsonville. near here. The miners, members of the Progressive Miners of America, went on strike because of dlssatlsfaction over division of work a strike leader said ln a telephone conversation from the mine shaft. The miners sat down as their shift ended at 7 p.m. George Wilcox, mine superintendent, said the men had "no reason to strike." Batt le Over CCC Is Won By Roosevelt President's Victory Is Followed by Defeat In Economy Fight WASHINGTON. May 20 —(U.R*_ President Roosevelt lost a $3,200,000 economy fight in the "pork-hungry” house late today but won an easy victory In the senate to make the Civilian Conservation corps— his favorite new deal project—a permanent agency. Earlier he had bowed to house Democrats rebelling against his sweeping economy drive, by agreeing to support a $25,000,000 emergency flood control program for the Ohio valley this year. Thus Mr. Roosevelt reversed the position he took 4 fortnight ago when he urged that flood control authorizations be deferred until the next session of congress. BLANK CHECK INDICATED Although the revolting house torpedoed plans of Mr. Roosevelt and its own appropriations committee to economize on the interior department appropriation bill, there were indications that the Democratic majority would £ive the president another blank check for $1,500,000,000 to finance relief during the coming fiscal year. The work-relief bill was placed before the chamber today with a charge by Rep. Clifford A. Woodrum. D„ Virginia, that racketeers are keeping up the cost of federal aid to the destitute. Woodrum. who led a futile fight in committee to slice the appropriation $500,000,000 in the interest of economy, said caustically that such a reduction would not provide "a liberal allowance for the relief racketeers keeping hanging onto the trough—not a liberal allowance for socialistic or idealistic experiments.” SUPPLY BILL INCREASED Action by the house ln increasing the Interior supply bill approximately $2,060,000 over this year's grant, $3,200,000 over budget estimates, and $7,800,000 over the appropriation committee's recommendations did not startle democratic leaders. Other supply bills have been passed and sent to the senate calling for appropriations substantially below budget estimates. But the interior bill embraces such vote-getting projects as vocational education, parks, highways, and reclamation work which, in the political vernacular, go under the general title of "pork." For example, the appropriations committee recommended $7,241,500 for vocational aid to states. The budget bureau recommended $4,241,500 and warned that to increase this amount would be "wasteful and unnecessary.” SPEAKER Coal Miners Begin Strike “ able to take the sea with Proper rig ri. the towing yacht. . ot alarmed. Unless we get ,10 th■ and ry E Hunt‘ngton Meditation Service W, art Sallery i . Nowine sohoHnio Professor Fox Appointed YMCA Advisor Appointment of Robert Fox, professor of civil engineering, as faculty advisor for the YMCA was made public last night by Wallace Dorman, president, at a dinner at Clifton’s cafe. "We include all races in our activities." said Dorman in his banquet speech last night. "The influential program of the 'Y' is not limited to the campus, but is carried throughout southern California by deputation teams which represent the university before hundreds annually." Students appointed to serve on YMCA committees next year include Floyd Cunningham and Harold Porter, membership; Bruce Kurrle, re-crention; Floyd Bunill. finances; Herbert Klein, publicity; Herbert Archibald religion; Edward Gron-eck. conferences: Arthur Guy. program; George Bchwelger, international relations; and David Bradley, deputation. Boris Morros, music director of Paramount studios, will be one of the speakers at the cinematography banquet in the Foyer of Town and Gown tonight. Film Dinner To Be Tonight Outstanding Film Notables Will Be Given Awards Outstanding achievement in the motion ptcturc industry will receive j official recognition here tonight Then film notables gather for the fourth annual American Institute of | Cinematography banquet in the Foyer of Town and Gown. The af- | fair will begin at 7:30 p.m The evening's program will be directed by master of ceremonies | Howard Estabrook. Paramount stu-does’ screen-writer and producer. Among the principal speakers will be Dr. Lee de Forest, noted American Inventor; Coningsby Dawson, j British author; and Dr. J. Eugene I Harley, chairman of the department of political science. ZUKOR TO TALK Shorter talks will be given by Boris Morros, music director of Paramount studios; Adolph Zukor. producer; and Cecil B. de Mille. director and producer, of the same stu-| dios; and Slavko Vorkapich, MGM I speclal-effects man. [ An integral part of the evening's J plans will be the awarding of J achievement diplomas and honorary | memberships in the institute to i members of the film colony who have distinguished themselves in some branch of the Industry. These | awards are regarded as second in Importance only to the academy . statuettes. j STUDENT TICKETS AVAILABLE Prominent among the guests will be Paul Muni, Anita Louise, Douglas Scott, Grant Mitchell, Rouben Ma-moulian, William Dieterle, Merian A. Cooper, and Barrett Kiesling. Special student tickets for the program alone have been made available at the cashier's office ln J the bookstore for 50 cents. Regular tickets at $2 a plate for > the banquet and program can be | obtained at the cinematography office, 120 Old College. Sigma Sigma Will Sponsor Kids Camp Religious Conference Board Offers Site In Big Pines Area For the first time in its history, U.S.C. will maintain a summer camp for Los Angeles' underprivileged children ln July through the combined efforts of thc University Religious Conference and Sigma Sigma, junior men's honorary. To aid the Sigma Sigmas in carrying out the project for which they recently sponsored a benefit show on campus, the religious group yesterday offered its camp site and equipment at Big Pines, donated two years ago by Los Angeles county. FORMERLY RUN BY U.C.L.A. During the two years, thc University Religious Conference has maintained a summer camp for underprivileged children on the site, Mauri Kantro. Sigma Sigma ptcf ident. announced yesterday that there will be a mwling of all members of the junior men's honorary in the men's lounge at 9:50 o’clock this morning to discuss plans for thf summer ramp. known as University camp. Previously the camp has been paid for and run by the U.C.L.A. campus religious group, and this will be U SC.'s first opportunity to have a session of its own. Counselors at the camp will be U.S.C. men who will be chosen by a committee composed oi Margaret King, head of the Trojan Religious Conference; Mauri Kantro, Sigma Sigma president; and Thomas S. Evans, executive secretary of the Religious conference. TROJANS TO APPLY FOR JOBS Trojan men wishing to apply for positions as counselors at flic camp may leave cards stating their names and qualifications on the desk in the Religious Conference office, 230 Student Union and will later be interviewed by the committee. Youngsters who attend the camp will be chosen by the Family Welfare association, a city federation of social agencies. Approximately 40 boys can be accommodated for the 2-week session. By working together on the camp for the university. Sigma Sigma and the Religious Conference hope to establish It as a permanent project, and later to provide for a perpetual fund for its maintenance. Hal Roberts Resigns As Band Director Dramatists To Present Famous Play Scenes Semester examinations • will be taken by students in the advanced dramatics class Tuesday and Thursday when they present a series of scenes from outstanding plays in Touchstone theater. Among the plays from which scenes will be taken are "Hamlet," "First Mrs. Fraser,” “Cradle Song," "Cyrano de Bergerac," "Petrified Forest," and “Ah Wilderness." Senior Week Ticket Sale Ends Monday Requesting graduating seniors to "act immediately," Leonard FUich, I senior class president, announced I yesterday that ticket sales for senior week program will close Monday. Priced at $6 50. the tickets will ! admit seniors to all events sched-| uled for senior week, and in addl-I tlon. the alumni dues for next year | arc Included. Tickets may be purchased in 427 Student Union. The announcement of a definite deadline for the purchase of tickets follows a number of postponements by the senior week committee ! DEADLINE IS DEFINITE j "There positively will not be any sale of tickets after Monday," Finch said. "We feel that seniors ! should have the opportunity to be j with their classmates during the I week, but because of the proximity of graduation, we feel justified in calling Monday the dead-! line." Senior week will begin May 29 when baccalaureate services will take place In the Coliseum, and it will be terminated June fi when the seniors receive thetr diplomas. BALL INCLUDED Holders of senior week tickets wlll be entitled to admission to the senior “swing", ln the evening following the baccalaureate services. Tire dance location will be announced later by thc committee. Admission and dinner for two persons for the senior ball, final event j on the program, are included in the j ticket. Arrangements for thc ball are under the direction of Mauri 1 Kantro. PICNIC SCHEDULED | Among the other event"! to which the tickets will admit bearers is a | picnic to be given at Pop's Willow' | lake May 31. Jack Privett, chair-i man of the picnic committee, lias planned a program of games, swim-j mlng. and a barbecue for the day. I The senior play will be presented in Bovard auditorium as a senior week event June 2 at 8 p.m. The committee In charge of this part of the program is romposed of Lucille Hoff and Bob Norton. Ivy day ceremonies and a senior assembly will take place on the morning of June 3 In the afternoon. Dr. and Mrs. Rufus B von KleinSmid will be hosts to the graduationg students nt their home. 10 Chester place, from 3 to 5 p.m. RESIGNS POST U.S.C. Organizations schedule will gov •Mso m<>ming: N:50 hJi^bly, U:2C a B. von KleinSmid. President j Student meditation services will j be conducted at 7:30 o'clock this morning in the Little Chapel of Sil-j ence by Robert M Homiston. pres-j Ident of the School of Religion | student body. j Homiston will replace Dr. Carl S | Knopf, dean of the School of Religion. who regularly conduct* the i service. California Labor Bill Defeated SACRAMENTO. May 20 — Il'P)— The latest legislative attempt to salvage a program to create a state labor mediation board failed tonight when the senate linance committee lefused to approve the McGovern bill to set up a board to which labor disputes could be appealed The bill resulted from a conier-ence of labor, industrial, and agricultural representatives who admitted that other measures on the subject stood no chance of final passage. It proposed merely to create a mediation board of five which would investigate labor troubles and aid in attempting to settle them. Sigma Della Pi Initiation, a dinner, and a specch by Prof. Margaret Husson of Pomona college will be the program of the evening for members of Sigma Delta Pi. honorary Spanish society, tomorrow night at the Arcade hotel. The initiation will start at 6:30 p.m. and the dinner will be ai 7:30 p.m. Inlerfralernily Alumni Tlie interfratemity alumni asso elation of southern California will entertain prominent alumni from every fraternity on the campus in their annual spring banquet tonight at the University club, according to an announcement released to house presidents yesterday. Phi Lambda Uprilon O ficers of Pin Lambda Upsilon national honorary chemical .society, were chtsen yesterday for the coming year. Those elected were Roy Newsom, president; Andrew Craw-sen. vice-president; Norman Crawford. secretary-treasurer; and Dr Leroy S. Weatherby, counselor. Initiation of five new members will take place in the men's grill tonight. Those to be initiated are Lee Struble, Leroy Poor man, Harry McCracken, Chester Stevens, and , Karl Otto van Kelienbach. Della Kappa Alpha The filial meeting of Della Kappa Alpha, national honorary and professional cinematography fraternity, will take place at Scully's resaurant, 4801 South Crenshaw boulevard, Sunday, at 5:30 p.m. Oregg Toland. chief cameraman at United Artists, wlll be elected to honorary membership. Sigma Bela Chi Capt. Frank Jansen, former captain of the Leviathan, will speak to members of Sigma Beta Chl, national trade and transportation fraternity, when they convene for Iheir last mreting of the semester at 12 15 pin. today ln Elisabeth von KleinSmid hall. The speaker's sub-j ject is "Tales of the Sea.” Skull and Moriar | Pledges of Skull and Mortar, honorary pharmaceutical service organization for men. will meet In 304 Science building at 9:55 a.m. today, according to Masy Masuyka. secretary of the society. Westminster j The Rev. Donald O Stewart, ad-| viser of the Westminster club, wlll 1 preside at a meeting of th* U.S.O. Presbyterian society today at 12:20 j p.m. tn 332 Student Union. Lancers Will Elect Next Year s Officers Monday To elect officers for the next school year, members of the Trojan Lancers will gaiher In Bovard auditorium at 10 o'clock Monday morning, when nomination and acceptance speeches will be given for Bill Quinn, John Rose, and Louis Tarleton. candidates for non-org president. Those wishing membership on the Lancer administrative board will be presented, and opportunity will be given for further nominations from the floor. Students who have filed petitions for offices on the Lancer administrative unit are Bill Andreve, Evelyn Bard. Wallace Dorman, Frances Dunn. Louisa Gllllngworth, Jean Haygood. Mary Chun Lee. Harold Porter. 8hirley Rothschild, and Emil Sady. Petitions for tlie non-org positions can be obtained from the Student Union cashier, but must be returned to the window by 3 oclock this afternoon. .ai old William Roberts, Trojan band director, yesterday tendered his resignation from the U.S.C. staff. Dr. R. B. von KleinSmid indicated the resignation will be accepted. Dissertation To Be Printed Book Is First U.S.C. Doctorate Work To Be Published Word whs received yesterday by Ivan Benson, associate professor of journalism, that his Ph. D. dissertation has been accepted for publication by the Stanford University press. Thc acceptance marks the first time a dissertation from tlie U.S.C. Graduate School has gone Into publication. Professor Benson received the notification during thc day on which he took his final examination for the degree of doctor of philosophy. Dr. Rockwell D. Hunt, dean of the Graduate School, stated last night that Benson has passed the examination and will be recommended for the degree ln June. The book ls beir.g edited now, and ! Its title when published will probably be "Mark Twain In the West," according to thc author. J "Tiie Western Development of Mark Twain” ls the title of Pro-. fcssor Benson’s dissertation. It ls a study concerned with the development of Mark Twain as a writer during the five and one-half years [ he was ln the western port of the United States. Composed of heretofore unknown of 8amuel Clemens, the dissertaUon material on this period In the life refutes falsehoods and myths which have been associated with the humorist by his various biographers. Included ln the work are 67 unreprinted newspaper articles written by Mark Twain and published during his 5-year stay In the West. Trojan Music Head Leaves September 1 Culminating 11 years of service as founder and director of the musical organizations department, Harold William Roberts tendered his resignation to Dr. Rufus B. von KleinSmid yesterday, asking to br relieved of his duties after September 1. Roberts, who has been considering a business career for the past tn i years, made his decision following a short conference with von KleinSmid Wednesday. The president announced yesterday that thc resignation would be accepted at Roberts’ own request. AT U. S. C. SINCE 1926 Graduating from U. S C. ln 192(1, lie whs appointed director of musical organizations. Through his efforts the band, orchestra, glee clubs, and A Cappella choir were reorganized Into one department, ln 11)26 he designed the present musical organizations building behind Mudd hall, from which the first collcgiate band broadcast was made In the same year over KMTR. starting with a unit of 30 musicians In the first year, Roberts Has developed the band into one of the outstanding collegiate groups in the country, directing a Trojan football band of over 200 last season. He stated that 3000 men have participated in the Trojan band alone since he became director. OLYMPIC MUSIC SUPERVISOR Well-known ln civic centers, the director of musical organizations Is a prominent Elk and technical director for 20th Century-Fox studios. In 1934 he was appointed chairman of military affalls committee for the Junior Chamber of Commerce. Much of the musical details and programs during the i Xth Olympiad was under his su-j pervlslon. Expressing regret at terminating I his work with U. 6, C., Roberts said j that he had been formulating definite plans on entering a business during the past two weeks. He wlll finish this semester in hls present capacity, however, as tiie reslgna-j tlon does not function until the fall term. Five Oil Tanks Explode At Huntington Beach HUNTINGTON BEACH, May 20 —il’ i'i—A half block of this B'ath city was in flames tonight after a well belonging to the Pacific Coast Oil company exploded, police reported. Five oil tanks exploded after the initial blast, lt was said, ar.d the fire was spreading. Fire department officials reported that the entire force was called out to avert spread of the flames | to hundreds of other oil derricks • in th* viouinj. Trouble Averted In Hitler Ridicule WASHINGTON. May 20— Tlie state department probably wlll not reply to Informal representations by the German embassy against George Cardinal Mundelein's criticism of Chancellor Adolf Hitler as "an Austrian paper hanu-er, and a poor one at that," Secretary Cordell Hull said tonight. The department’s position wa.s made known after a series of swift, behind-the-scenes maneuvers had headed off International complications similar to those caused by Mayor Fiorello H LaGuardia of New York, two months ago, when he suggested Hitler for a “chamber of horrors" at the forthcoming New York World's fair. Studio Workers Desert FMPC Strike By United Press, Members of the Studio Utility Workers union bolted the strike ranks of the Federated Motion Picture Crafts last night by signing an independent agreement with producers. granting them a union shop and a 15-cent-an-hour wage Increase. The group, consisting of studio laborers, wlll return to work within a few days, Joseph Marshall, thelr International vice-president announced. Their loss was a severe blow to the FMPC, which had been struggling io preserve a united Iront in the face of three previous defections. With the laborers withdrawing from the federation, thc strike ranks were reduced to seven unions. Tlie Utility Workers group was the second largest unit ln the FM PC which earlier had been deserted by the costumers, machinists and culinary workers unions. Thesis Deadline Is Today at 5 p.m. The deadline for the submission of theses will be 5 p.m. today, Miss Ruth Boknett, secretary to Dean Rockwell D. Hum, stated yesterday. Candidates who have had their theses accepted by student thesis committees aie eligible to submit them for degrees not later than this afternoon at the Graduate School ofllo*. Trojan Women Win Awards Out of an insurance class of 45 students. Pauline McCarty and Gertrude Lindgren. College of Commerce students, were awarded fust and second places, respectively, m a letter writing contest telling th* advantages of insurance. The contest was sponsored by the life insurance underwriters association of Los Angeles, during national insurance week. First prize of $35 was awarded to j Miss McCarty, graduate student, formerly of Butler university. Miss LUidgren is president of Pht Chi Theta, national professional ' women's commerce society, and • I member of CUoumu.

Q: Set of pairs of numbers in Javascript ES6 has a new Set data structure for storing sets of unique objects. However it is based on object references as opposed to value comparisons. As far as I can tell this makes it impossible to have a set of pairs of numbers without stringifying. For example, typing in Chrome's console (needs Chrome 38+): > var s = new Set(); < undefined > s.add([2, 3]); < Set {[2, 3]} > s.has([2, 3]) < false <--- was hoping for 'true' This appears to be by design: since I passed a different array of [2, 3] to has(), it returns false, because although the contents is the same it only looks at object references, and I allocated a new and different array to pass to has(). I would need to store a reference to the original array I passed to add() to check with has(), but this is not always possible. For example if the number pairs represent co-ordinates, I might need to check if the set has [obj.x, obj.y], but this will always return false since it allocates a new array. The workaround is to stringify the arrays and key on strings like "2, 3" instead. However in something performance-sensitive like a game engine, it is unfortunate if every set access needs to make a string allocation and convert and concatenate number strings. Does ES6 provide any feature to solve this problem without stringifying, or is there any feature on the horizon with ES7 that could help as well? A: As you've noted [2, 3] === [2, 3] is false, meaning you can't use Set like this; however, is Set really the best option for you? You may find that using a two-level data structure like this will be better for you var o = {}; function add(o, x, y) { if (!o[x]) o[x] = {}; o[x][y] = true; } function has(o, x, y) { return !!(o[x] && o[x][y]); } function del(o, x, y) { if (!o[x]) return; delete o[x][y]; // maybe delete `o[x]` if keys.length === 0 } You could do a similar structure with a Map pointing to Sets if you wanted to use ES6

Noticeboard To access a routine GP appointment during the out of hours period, Monday to Friday 6.30 - 8.00pm, Saturdays 8 and to 2pm and Sundays 8am to midday, please call 0113 206 2049. Outside of these hours, please contact Ashfield Medical Centre to book. Clinical pharmacist We now have a clinical pharmacist working at the practice. As a specialist in medicine, you can see her if you have medication related problems to discuss rather than seeing a GP. As at reception. Leeds Care Record There are over 300 clinical computer systems in Leeds. They all hold clinical information about patients who have used services provided by their GP, at a local hospital, community healthcare, social services or mental health teams. Each record may hold slightly different information. The Leeds Care Record brings together certain important information from different clinical systems so that medical information held about a patient is centralised into one easy-to-use database. All of your medical records will still be strictly confidential. They will only be looked at by health and social care professionals who are directly involved in your care. The Leeds Care Record will support people working in health and adult social care services to provide you with better and more joined up care. It will make care safer because everyone involved in treating you will have access to the most up-to-date and accurate information about the medicines you are taking and any allergies that you have. It will also help to avoid unnecessary or duplicate tests and procedures, and reduce paperwork for doctors, nurses and other staff, giving them more time to spend on patient care. Zoe Berry is a nurse specialist within the acute medicine early discharge assessment team at the Leeds Teaching Hospitals NHS Trust. She says: “I have been waiting for a system like this to come along for years. It will save so much time and make patient care safer and more cohesive. At present, my team have to access five different databases in order to obtain information so we can get the full picture of our patients.” You can choose not to have a Leeds Care Record. It is your choice but sharing your medical and social care information through a Leeds Care Record will make it easier to provide the best quality care and support for you. If you have any doubts about your records being shared you can talk to the information governance team at the Leeds Teaching Hospitals NHS Trust. Their telephone number is 0113 20 64102.

WOODSTOCK — The Billings Farm and Museum will show the award-winning film “Even the Rain” as part of the third annual Woodstock Vermont Film Series at 3 p.m. today. Spanish director Sebastián, his executive producer, and crew are in Bolivia to shoot a motion picture about Christopher Columbus and his treatment of the native population. Sebastián chooses Bolivia as the location because of a tight film budget and things go smoothly until a conflict erupts over the privatization of the water supply. Sebastian hires local actors to appear in his film but one of them is a leading activist in the protest movement and the film’s completion is in doubt. “Even the Rain” was nominated for Best Film at the European Film Awards and has won 16 awards. Tickets for members are $9 for adults and $5 for children. Nonmembers are $11 for adults and $6 for children. For a list of screenings and ticket information, call 457-2355 or visit www.billingsfarm.org/filmfest. The Billings Farm and Museum is on Route 12 in Woodstock.

Cytochemical profile of human haematopoietic biopsy cells and derived cell lines. Twenty-three human haematopoietic cell lines, normal and mitogen stimulated peripheral blood lymphocytes and tumour material from fresh leukaemias, myelomas and lymphomas were investigated with a panel of cytochemical reactions. Normal and mitogen stimulated lymphocytes, non-neoplastic lymphoblastoid cell lines (LCL), lymphoma lines with B-lymphocyte characteristics, chronic lymphocytic leukaemia and fresh lymphocytic lymphomas reacted weakly or negatively with all stains. T-lymphocyte acute leukaemia lines were PAS and alpha-naphtyl acetate esterase positive. Myeloma lines and fresh myelomas were strongly beta-glucoronidase positive. A histiocytic lymphoma cell line was strongly esterase positive with naphtol AS-D acetate esterase inhibited by NaF. The three fresh histiocytic lymphomas, however, reacted as the lymphocytic lymphomas suggesting a lymphoid origin. A myeloid leukaemia line was strongly positive for acid phsophatase. No major disagreement was noted between the reactivity of established neoplastic lines and the corresponding fresh biopsy cells indicating an unaltered qualitative expression of enzyme production after prolonged in vitro culture.

Horizons Horizons is a great template for you to quickly and easily have access to the latest design trends, eCommerce best practices, and SEO friendly markup. Summary Horizons is a responsive template for wineries of any size that have a great bank of photography they want to make the most of on their homepage. This template uses a masonry grid to arrange blocks of photos, and provide links to your content directly from the homepage. Features: Feature banner with welcome message Flexible grid to mix and match images and links Newsletter promotion and sign up Twitter feed Facebook link Powerful search integration Technical Details: Responsive template: optimized to display well across all device sizes Support for all modern browsers: Chrome, Firefox, Safari, Microsoft Edge, and IE 11

Efforts to improve industrial plant efficiency have spawned interest in making industrial plants relatively quickly and easily convertible from one industrial process to another. Convertibility of industrial plants permits plant managers to stay abreast of and provide for the demands of the market. A crucial component of virtually every industrial plant is conveyor systems. Thus, the convertibility of conveyor systems is crucial to the convertibility of industrial plants. In the conveyor system art, convertibility relates to accommodating articles having various sizes, shapes, physical characteristics, and orientations from workstation to workstation. Typically, conveyor systems are designed to be used in a particular way to convey a particular article. Some conveyor systems offer marginal levels of modularity or convertibility. U.S. Pat. No. 3,605,994 to Parlette discloses a pair of frame elements combinable by a coupling member and screws to form a unit frame assembly. U.S. Pat. No. 3,800,938 to Stone discloses elongated frame members including an inclined web for close spacing of a transfer disk. U.S. Pat. No. 3,825,108 to Stone discloses side frame members having top and bottom flanges with different horizontal dimensions to support different size conveyor chains. The frame members each have two mounting channels or T-slots, and they may be combined with tubular spacers. U.S. Pat. No. 4,358,010 to Besch discloses a conveyor track having an upwardly open longitudinal slot and a downwardly open T-slot to attach the track to a cross member. U.S. Pat. No. 4,511,031 to Lachonius discloses a conveyor girder having, at one or both sides thereof, two longitudinal open ducts situated one inside the other and which both can be reached from the outside of the girder. U.S. Pat. No. 4,593,808 to Kondo et al. discloses a multi-level rack-type conveyor comprising L-shaped members, each having a pair of rollers. U.S. Pat. No. 4,727,981 to Johansson discloses a conveyor beam for guiding and supporting a flexible track on sliding ledges.

((sqrt(56)/sqrt(4))/sqrt(2) + sqrt(7)))*3. -7*sqrt(7) - 3 Simplify -3 + ((sqrt(288) - 3*sqrt(288))*1)/(sqrt(40)/((2*sqrt(120))/sqrt(12))). -24*sqrt(2) - 3 Simplify 2*(sqrt(192) + -4*(sqrt(192) + -1)**2) + (sqrt(192) + (4*-2*sqrt(192) - sqrt(192)) + 3*sqrt(192)*-2)**2. 144*sqrt(3) + 36088 Simplify 2 + ((sqrt(250) - (sqrt(250) + sqrt(250)*-1))*-5)/(-1*(sqrt(162) + sqrt(2))) + 3. 5 + 5*sqrt(5)/2 Simplify (2*sqrt(84)*4 + -4*sqrt(84)*-1)/(-3*sqrt(12)*-4 + sqrt(132)/(sqrt(110)/sqrt(10))). 12*sqrt(7)/13 Simplify (4*-2*sqrt(1331)*-4*5 + (1*(sqrt(1331) + sqrt(1331)*2) - (-4 + (sqrt(1331) + -1 - sqrt(1331)) + sqrt(1331))))**2. 17820*sqrt(11) + 34930789 Simplify ((-5*sqrt(84)*-1 - (sqrt(84) - -2*sqrt(84)*2))*3)/(sqrt(192)*-2 + (sqrt(588) + sqrt(12))*-3). 0 Simplify 4 + (-2 + sqrt(300) + 2)**2 + ((-1*sqrt(192))**2 - (-2 + sqrt(3) + 4)) + 0. -sqrt(3) + 494 Simplify -1*((sqrt(475) - (sqrt(475)*5 + -4 - sqrt(475))) + -1 + (sqrt(475) - (5*sqrt(475) + sqrt(475))*4)*6)**2*-3. -12690*sqrt(19) + 28330452 Simplify (1*-6*((-3 + sqrt(6)/sqrt(2) - (1*sqrt(3) + 3)) + sqrt(108) + sqrt(3) + sqrt(9)/sqrt(3) + 1))**2. -2880*sqrt(3) + 7812 Simplify sqrt(288) + 1 + sqrt(288) + -1 + ((sqrt(288) - (0 + sqrt(288)))*-6 - sqrt(288)) + 1 + 3 + -3. 1 + 12*sqrt(2) Simplify -3*(sqrt(704) + (-5*sqrt(704)*-5 - sqrt(704)) + -4 + sqrt(396) + 5)*4. -2472*sqrt(11) - 12 Simplify (sqrt(44)/(sqrt(2) - (sqrt(2) - (sqrt(2) - sqrt(200)/sqrt(4)))))/(sqrt(20)/(sqrt(640)*-2)). 4*sqrt(11) Simplify 1 + ((-1*-4*sqrt(605)*-2)**2 - 3*((0 + sqrt(5))**2 + -5 - (-1 + sqrt(5) + 3))). 3*sqrt(5) + 38727 Simplify ((sqrt(65) - (sqrt(65) + sqrt(65) + (sqrt(65) - 3*sqrt(65))))*-5 - (sqrt(65) + -2*-3*sqrt(65)))/((sqrt(450) + sqrt(50))/sqrt(10)*5*-2). 3*sqrt(13)/10 Simplify (-2 + 1*(sqrt(272) - sqrt(272)*-1) + 3)*-3*-1*1. 3 + 24*sqrt(17) Simplify 2 + (-5*(sqrt(44) + sqrt(11))*-5)**2 - (4*sqrt(1584) - sqrt(11) - (sqrt(11) - (sqrt(396) + -3)))**2. 312*sqrt(11) + 32124 Simplify (((sqrt(168) + sqrt(168)*-1 + sqrt(168))*-5)/(sqrt(192)*2))/(4*((sqrt(7200) - sqrt(7200)*2 - sqrt(7200)) + sqrt(7200))). sqrt(7)/384 Simplify -5*((-1*sqrt(180) + 3 + -4)*-5*-4)**2 + -3. -362003 - 24000*sqrt(5) Simplify (((1 + sqrt(99))*-5)**2 - sqrt(99)) + ((sqrt(99) - -3*sqrt(99)*-4)**2 - sqrt(99)) + 1*((sqrt(539) - (4 + 0 + sqrt(539))) + 4). 144*sqrt(11) + 14479 Simplify 5*(3 + ((1*sqrt(136)*-1)/(-1*sqrt(512)) + -1)*1)*-2. -20 - 5*sqrt(17)/4 Simplify (-6*sqrt(19)*3 + 5 + sqrt(19) + -1)**2 - (5*sqrt(228))/((sqrt(12) + sqrt(36)/sqrt(3))/sqrt(4)). -141*sqrt(19) + 5507 Simplify ((-5*sqrt(117) + sqrt(117) + sqrt(117))*4 - (sqrt(117) - (sqrt(117) + 5*sqrt(117)*4 + sqrt(117))))/(sqrt(324) + sqrt(324)*1 + -4*sqrt(9)*-3 + sqrt(9)). 9*sqrt(13)/25 Simplify ((-2 + 2 + sqrt(5))**2 - 2*(sqrt(25)/sqrt(5))**2) + 4 + (-6*3*(sqrt(5) - (sqrt(5) + 2)))**2. 1295 Simplify -3*(((3 + sqrt(19))*6 - (sqrt(475) + sqrt(19) + -4)) + (6*(3 + sqrt(19) + 1))**2 + 2). -3852 - 864*sqrt(19) Simplify (-2*((-2*sqrt(6336) - sqrt(6336)) + 3 + sqrt(44) + (sqrt(88)/sqrt(2) - sqrt(44)) + 5 + 3))**2*4. -24640*sqrt(11) + 864336 Simplify ((4*(-2 + (sqrt(675) + -2*sqrt(675) - sqrt(27)) + sqrt(162)/(sqrt(96) - (2*sqrt(96) + sqrt(96)))))**2 + -1)*6. 7056*sqrt(3) + 195237/2 Simplify (-5*sqrt(168)/(sqrt(392)*-1))/(-6*sqrt(175) - (2*sqrt(343) + sqrt(343) - sqrt(343))). -5*sqrt(3)/308 Simplify 0 + (0 + 0 + sqrt(720) + sqrt(720) + -2 - ((sqrt(720)*2 + 2 - sqrt(720)) + 1*-1*sqrt(720))) + 1. -3 + 24*sqrt(5) Simplify ((sqrt(36)/(-4*sqrt(3))*-3)/((sqrt(60) - (sqrt(960) + sqrt(60) + sqrt(60)))/sqrt(10) - (sqrt(66)*-2 + sqrt(66))/sqrt(11)) + 3)**2. -9*sqrt(2)/8 + 1161/128 Simplify (sqrt(768)*1*3 - (sqrt(768) + 3*sqrt(768)*2))/(-3*(-1*sqrt(6)*-6 - (sqrt(48)/(sqrt(16)/sqrt(2)) + sqrt(6)))). 8*sqrt(2)/3 Simplify ((1*sqrt(704) - sqrt(704)) + -2 - (-2*1*sqrt(704))**2) + 4 + (-1 + -2*(sqrt(11) + 2 + sqrt(11)*-3) + -4)**2. -2557 - 72*sqrt(11) Simplify 3 + (-4*(-2 + sqrt(1008))*-5 - (5 + sqrt(1008)*2*4))**2. -12960*sqrt(7) + 147180 Simplify ((4 + sqrt(288) + 3 - (-3 + -2*sqrt(288))) + (sqrt(288)*1 + -4)*-6*3)**2. -29520*sqrt(2) + 71524 Simplify 2*(-6*(2*sqrt(343)*-4 + (6*sqrt(343) - sqrt(343)) + -5 + 5)*1)**2. 222264 Simplify ((sqrt(170) + (sqrt(170) - -1*sqrt(170)*-1) - 5*(sqrt(170) - (sqrt(170) + 2*sqrt(170)) - sqrt(170)))*2)/(-5*sqrt(1210) - 3*sqrt(10)*-4). -32*sqrt(17)/43 Simplify -4 + 5 + ((sqrt(1125) + (sqrt(1125) + (sqrt(1125) - (-3 + (sqrt(1125) - (sqrt(1125) + 2)))) - sqrt(1125)) + sqrt(1125) + 3*sqrt(1125)*2)*6)**2. 48600*sqrt(5) + 3281401 Simplify 2 + ((sqrt(810) + sqrt(810)*-4)*1)/(((sqrt(40)*-4 - sqrt(40))*-5)/sqrt(8)). -27*sqrt(2)/25 + 2 Simplify 0 + 5 + 3 + (((sqrt(1100) + sqrt(1100) + 0 + sqrt(1100))*5 - (-1 + (sqrt(1100) - 1*sqrt(1100))))*-4)**2 + -1. 4800*sqrt(11) + 3960023 Simplify (5 + 1 + 2 + -3 + ((sqrt(475) + sqrt(475) + sqrt(475) + 0)*2 - (sqrt(475) + -2 + sqrt(475) + 0)))**2. 280*sqrt(19) + 7649 Simplify 5*((-2 + (sqrt(605) + sqrt(605) + 2 + sqrt(605))*1)**2 + 6*(3 + (-3*sqrt(605) - sqrt(605))**2) + 1). 317720 Simplify ((sqrt(135)/sqrt(5) + sqrt(96)/sqrt(2) + sqrt(3))**2 + 2 - (3*sqrt(36)*-1)/(sqrt(192)*-5))*-4. -776 + 3*sqrt(3)/5 Simplify (sqrt(294)*2)/(sqrt(18)/(sqrt(36)/sqrt(4) + sqrt(9)))*-3 - ((sqrt(441) + sqrt(441)*-1 + sqrt(9))/sqrt(3) - (0 + (1*sqrt(12))/sqrt(4))). -84*sqrt(3) Simplify ((sqrt(308) + (sqrt(308) - 1*sqrt(308))*5 + sqrt(308))/sqrt(7) + 2 + 0)*-1*2. -8*sqrt(11) - 4 Simplify 1*(2 + 4*((sqrt(112)*1 - sqrt(112))**2 + sqrt(112))) - 2*(-2 + -1 + sqrt(112) + -1 + sqrt(112) + 3). 4 Simplify -3 + ((6*(sqrt(170)*2 + sqrt(170)) + 3*sqrt(170)*6)/((-3*5*sqrt(120) + sqrt(120))/sqrt(12)))**2. 5361/49 Simplify ((2*(sqrt(300) + 1) - (sqrt(300) + sqrt(300) + 0 + -1 + sqrt(300))) + -3)**2*5. 1500 Simplify (5 + -5 + sqrt(76) + (sqrt(76) - (-5 + sqrt(76)*1)) + (0 + -4*sqrt(76) - (sqrt(76) - (-2 + -4*sqrt(76)))))**2*6. -576*sqrt(19) + 29238 Simplify (5*6*(sqrt(84) + sqrt(84)*-2 + sqrt(84) - sqrt(84))*-3)/((sqrt(60)*-2*-6)/(sqrt(125)*-2)). -75*sqrt(7) Simplify (sqrt(136)/((sqrt(56)*2)/sqrt(7)) + 5 + (-2*sqrt(136))/sqrt(8))**2 + (2*sqrt(85)*6 + sqrt(85))/(sqrt(25)/(sqrt(10)/sqrt(2))). -2*sqrt(17) + 253/4 Simplify (sqrt(2880)*-2*-1)**2 + 6*((sqrt(15)/sqrt(3))**2 + 4 + -3). 11556 Simplify (((sqrt(385) + -1*-2*sqrt(385) - sqrt(385))/((2*sqrt(56) - sqrt(56))/sqrt(8)))/(sqrt(264)/sqrt(6) + (sqrt(11) - sqrt(99))*2))**2*-3. -15 Simplify -2 + ((sqrt(420)*1*1)/((sqrt(84)*-2 + sqrt(84))/sqrt(7)))/(sqrt(7) + -6*sqrt(343) + sqrt(21)/sqrt(3)*6). -2 + sqrt(5)/35 Simplify ((sqrt(132) - 1*sqrt(132)*4) + -3*-3*sqrt(132))/(2*sqrt(72)/sqrt(6) + (sqrt(48) - (sqrt(48) - sqrt(1200)))/sqrt(4)). 6*sqrt(11)/7 Simplify (2 + -3 + -4*((sqrt(72) - 1*sqrt(72)) + sqrt(72)))**2 - -2*(-6*sqrt(72)*-2)**2*-4. -81791 + 48*sqrt(2) Simplify (4*((3*(sqrt(78) + 4*sqrt(78)) - sqrt(78)) + (sqrt(78) - (sqrt(78) - 4*sqrt(78))*-3))/(3*sqrt(108)/sqrt(18)))**2. 832 Simplify (sqrt(456)/sqrt(108) + sqrt(1368)*2)/(5*sqrt(22)/(sqrt(11) + (sqrt(11) - (sqrt(1331) - -1*sqrt(1331) - sqrt(1331))))). -111*sqrt(19)/5 Simplify ((4*(sqrt(2299) + 1*sqrt(2299)*-1 + 3) + 3)*-3)**2 + -3. 2022 Simplify (2*5*((-3*sqrt(475) + -4 - sqrt(475)) + sqrt(475))*-4)**2 + -1. 192000*sqrt(19) + 6865599 Simplify (3*3*sqrt(135) + -3*-3*sqrt(135))/(sqrt(108)*6 - sqrt(192)). 27*sqrt(5)/14 Simplify -6*((sqrt(120)*5)/sqrt(6))**2*4 - (3 + (sqrt(5) - ((sqrt(5) + 0)*6 - sqrt(5))) - ((sqrt(245) + (sqrt(245)*-2)**2)*3 - sqrt(245))). -9063 + 18*sqrt(5) Simplify (4 + sqrt(48) + sqrt(3) + (sqrt(3)*1 - sqrt(3)) + sqrt(3) + 2)**2 + 0 + (-4*sqrt(9)/sqrt(3)*-6*-5*5)**2. 72*sqrt(3) + 1080144 Simplify -1*(-3*2*(sqrt(252) - 2*sqrt(252))/sqrt(7))/(sqrt(36)/(sqrt(3)*-1)*-4*1). -3*sqrt(3)/2 Simplify (((sqrt(95) - (sqrt(95) + 5*sqrt(95)*-1)) + sqrt(95))*5*-2)/(sqrt(405)*-3*3*-6). -10*sqrt(19)/81 Simplify ((sqrt(88) - (sqrt(88)*-5 + sqrt(88)) - sqrt(88))*2)/(sqrt(100)/sqrt(2) - 2*sqrt(50)). -16*sqrt(11)/5 Simplify (5*(sqrt(228)*-1*-1 - sqrt(228) - (sqrt(228) - 2*sqrt(228))*-6))/((2*sqrt(120)*-5)/(sqrt(90)/(1*sqrt(9)))). 3*sqrt(19) Simplify 3*-4*(sqrt(364)/sqrt(7)*3*1)/(1*sqrt(100) + sqrt(36)/sqrt(81)). -27*sqrt(13)/4 Simplify ((sqrt(2448) + 4*sqrt(2448)*-6 - (3*(sqrt(2448) + 0) + sqrt(2448))) + -1)**2*-2. -3569186 - 1296*sqrt(17) Simplify (sqrt(182)/(sqrt(35)/sqrt(45)))/((sqrt(14)

UNPUBLISHED UNITED STATES COURT OF APPEALS FOR THE FOURTH CIRCUIT No. 06-4961 UNITED STATES OF AMERICA, Plaintiff - Appellee, versus JOSEPH DOUGLAS WEBB, JR., Defendant - Appellant. Appeal from the United States District Court for the District of South Carolina, at Spartanburg. Henry F. Floyd, District Judge. (7:05-cr-00972) Submitted: March 22, 2007 Decided: March 28, 2007 Before WIDENER and WILKINSON, Circuit Judges, and HAMILTON, Senior Circuit Judge. Affirmed by unpublished per curiam opinion. David W. Plowden, Assistant Federal Public Defender, Greenville, South Carolina, for Appellant. Elizabeth Jean Howard, OFFICE OF THE UNITED STATES ATTORNEY, Greenville, South Carolina, for Appellee. Unpublished opinions are not binding precedent in this circuit. PER CURIAM: Joseph Douglas Webb, Jr., pled guilty to being a felon in possession of a firearm. He was sentenced to thirty-seven months in prison. On appeal, Webb’s attorney has filed an Anders* brief, stating that there are no meritorious issues for appeal, but questioning whether Webb’s sentence was reasonable. Although Webb was informed of his right to file a pro se supplemental brief, he has not done so. Before determining a sentence, the district court is required to calculate and consider the appropriate guideline range, as well as the factors set forth in 18 U.S.C. § 3553(a) (2000). United States v. Hughes, 401 F.3d 540, 546 (4th Cir. 2005). We will affirm a sentence if it is both reasonable and within the statutorily prescribed range. Id. at 546-47. Here, the district court calculated a guideline range of 37-46 months, to which Webb had no objection. The court then heard from counsel, Webb, and Webb’s fiancee regarding Webb’s success in school, his work history, his drug problems, and his family responsibilities. After stating that it had considered the guideline range and the relevant statutory sentencing factors, the district court imposed a sentence well below the statutory maximum and at the bottom of the guideline range. We find that the sentence was reasonable. * Anders v. California, 386 U.S. 738 (1967). - 2 -  In accordance with Anders, we have reviewed the entire record in this case and have found no meritorious issues for appeal. We therefore affirm Webb’s conviction and sentence. This court requires that counsel inform his client, in writing, of his right to petition the Supreme Court of the United States for further review. If the client requests that a petition be filed, but counsel believes that such a petition would be frivolous, then counsel may move in this court for leave to withdraw from representation. Counsel’s motion must state that a copy thereof was served on the client. We dispense with oral argument because the facts and legal contentions are adequately presented in the materials before the court and argument would not aid the decisional process. AFFIRMED - 3 - 

/* * libjingle * Copyright 2013, Google Inc. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions are met: * * 1. Redistributions of source code must retain the above copyright notice, * this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright notice, * this list of conditions and the following disclaimer in the documentation * and/or other materials provided with the distribution. * 3. The name of the author may not be used to endorse or promote products * derived from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO * EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ //downloaded from https://code.google.com/p/libjingle/source/browse/trunk/talk/base/?r=273 #ifndef TALK_BASE_IFADDRS_ANDROID_H_ #define TALK_BASE_IFADDRS_ANDROID_H_ #include <stdio.h> #include <sys/socket.h> // Implementation of getifaddrs for Android. // Fills out a list of ifaddr structs (see below) which contain information // about every network interface available on the host. // See 'man getifaddrs' on Linux or OS X (nb: it is not a POSIX function). struct ifaddrs { struct ifaddrs* ifa_next; char* ifa_name; unsigned int ifa_flags; struct sockaddr* ifa_addr; struct sockaddr* ifa_netmask; // Real ifaddrs has broadcast, point to point and data members. // We don't need them (yet?). }; int getifaddrs(struct ifaddrs** result); void freeifaddrs(struct ifaddrs* addrs); #endif // TALK_BASE_IFADDRS_ANDROID_H_

// Copyright 2013 The Go Authors. All rights reserved. // Use of this source code is governed by a BSD-style // license that can be found in the LICENSE file. package ipv6 import ( "encoding/binary" "errors" "net" "unsafe" ) var ( errMissingAddress = errors.New("missing address") errHeaderTooShort = errors.New("header too short") errInvalidConnType = errors.New("invalid conn type") errOpNoSupport = errors.New("operation not supported") errNoSuchInterface = errors.New("no such interface") nativeEndian binary.ByteOrder ) func init() { i := uint32(1) b := (*[4]byte)(unsafe.Pointer(&i)) if b[0] == 1 { nativeEndian = binary.LittleEndian } else { nativeEndian = binary.BigEndian } } func boolint(b bool) int { if b { return 1 } return 0 } func netAddrToIP16(a net.Addr) net.IP { switch v := a.(type) { case *net.UDPAddr: if ip := v.IP.To16(); ip != nil && ip.To4() == nil { return ip } case *net.IPAddr: if ip := v.IP.To16(); ip != nil && ip.To4() == nil { return ip } } return nil }

The existing fleet of general aviation spark ignition piston engines, as well as new engines currently being delivered, and engines which are overhauled for use as replacements on existing aircraft, typically operate using leaded fuels, as allowed in the United States under an exemption provided by the 1990 Federal Clean Air Act Amendments. As that Act banned the use of leaded fuels for over-the-road vehicles in the Unites States, general aviation aircraft engines have become an increasingly visible source of atmospheric lead emissions. Environmental regulations and threatened regulations throughout the world have thus spurred investigations into the development and evaluation of possible alternative aviation fuels. Most of the general aviation spark ignition piston engines in use today have been certified in the United States by the Federal Aviation Administration (FAA) for use with leaded aviation gasoline blends that meet the American National Standard No. ASTM D910 entitled Standard Specification for Aviation Gasolines. Under that standard, for Grade 100 fuel, 1.12 grams of lead per liter are provided in the fuel blend. In the most commonly used fuel, Grade 100LL, known as a “low lead” fuel, 0.56 grams of lead per liter are provided in the fuel blend. Both of those blends provide a minimum “knock value” lean mixture octane number of 99.6 per the ASTM D-2700 Test Method. Also, both of those blends provide a minimum “knock value” rich mixture octane number of 130, per the ASTM D 909 Test Method. Given the regulatory environment, both in the U.S. and internationally, that seeks to require the minimization or elimination of the use of lead in general aviation aircraft reciprocating piston engines, the US FAA has been instrumental in conducting tests on various heretofore proposed formulations for low lead or no lead aviation gasolines. Their reports are publicly available through the US National Technical Information Service (NTIS), Springfield, Va. 22161. Such studies include the following reports: (1) DOT/FAA/AR-04/25, entitled Full-Scale Engine Knock Tests of 30 Unleaded, High-Octane Blends, by David Atwood and Julian Canizales, issued by the Office of Aviation Research, Washington, D.C., in September 2004; (2) DOT/FAA/AR-TN07/5, entitled High-Octane and Mid-Octane Detonation Performance of Leaded and Unleaded Fuels in Naturally Aspirated, Piston Spark Ignition Aircraft Engines, by David Atwood, issued by the U.S. Department of Transportation, Federal Aviation Administration, in March 2007; (3) DOT/FAA/AR-08/40, entitled Full-Scale Engine Detonation Tests of 47 Unleaded High Octane Blends, by David Atwood, issued by the Office of Aviation Research, Washington, D.C., in September 2008; and (4) DOT/FAA/AR-08/53, entitled Full-Scale Detonation and Power Performance Evaluation of Swift Enterprises 702 Fuel, by David Atwood, issued by the Office of Aviation Research, Washington, D.C., in January 2009. The September 2004 FAA report describes how over 200 blends of potential future aviation unleaded fuels were considered. Thirty of those blends, ranging in Motor Octane Number (MON) from 96.2 to 105.6 were sufficiently promising to be blended into batches and knock-tested (as determined by ASTM D-2700 standard) in a Lycoming IO-540-K aircraft engine at the FAA William J. Hughes Technical Center in Atlantic City, N.J. Components of such blends included ranges of some (or of all) of various ingredients, including super alkylate, toluene, ethyl tertiary butyl ether, meta-toluidine, ethanol, and methylcyclopentiadienyl manganese tricarbonyl (MMT), which were blended into a base fuel of either aviation alkylate or motor alkylate. Importantly, the FAA researcher reported that the performance of many of the tested blends deviated from that suggested by either their MON or by their performance number (PN). The March 2007 FAA report compared detonation performance of mid and high octane leaded and unleaded fuels. The fuels were compared at the onset of light detonation. The fuels were tested in a naturally aspirated Lycoming IO-540-K engine and in a naturally aspirated Lycoming IO-320-B engine. For testing, the motor octane number (MON) of fuels was determined by ASTM International (ASTM) specification D2700. The supercharge rich rating was determined by the ASTM D-909 standard. In general, the testing showed that the Grade 100LL fuel (with values minimally meeting the MON and Supercharge Rating of ASTM D910) significantly outperformed the matrix of tested unleaded fuels of equivalent MON, including even those with much higher ASTM Standard D-909 supercharge rich ratings, particularly as seen when operated on full scale aircraft engines rather than the laboratory test engines used to establish the ASTM Standard D-2700 MON and the D-909 rich rating performance number (PN). The March 2007 report indicates that the supercharge rich ratings do not appear to have the same significance for the matrix of unleaded fuels that were tested as they do for leaded hydrocarbon fuels. Based on the blends tested, the report clearly suggests that development of a better detonation performance unleaded aviation fuel would be desirable. The September 2008 FAA report was a continuation of the research described in the September 2004 report. Based on the results of the 30 potential future aviation unleaded fuel blends earlier tested, another matrix of 47 unleaded fuel blends was developed and detonation tested in a Lycoming IO-540-K aircraft engine at the FAA William J. Hughes Technical Center in Atlantic City, N.J. Components of such blends included varying ranges of “high octane components” such as aviation alkylate, super alkylate, toluene, ethyl tertiary butyl ether (ETBE), meta-toluidine, tert-butylbenzene. The blends contained iso-pentane for volatility control. Comprehensive blend formulations, by both volume fractions and mass fractions of those fuel blends were reported in Tables 2, 3, 4, and 5 of that report. The blends with a target range of 97.6 to 106.3 MON were tested against a baseline leaded reference fuel that met all specifications of ASTM D910 for Grade 100LL fuel with minimum MON and minimum performance number (PN) per ASTM D-909. The blends were also tested against a 100LL aircraft fuel purchased at the local airport. Here, the FAA researcher reported that none of the unleaded blends of equivalent or lower MON performed as well as the Grade 100LL fuel in the detonation tests, particularly as seen when operated on full scale engines rather than the laboratory test engines used to establish the ASTM D-2700 MON and the ASTM D-909 rich rating performance number. It was also demonstrated that increased fuel flow of the unleaded blends was required above the fuel flow required for 100LL in order to achieve equivalent detonation performance. In short, the tested blends provided less detonation protection than leaded formulations of equivalent MON, and appeared to potentially be less efficient. Importantly, the researcher again reported that using only motor octane number (MON) based on ASTM D-2700 (for knock rating, lean mixture) to predict full scale engine performance of unleaded fuels, is inadequate. The January 2009 report provides results of tests on a high octane, bio-fuel (fermentation based) composition identified as Swift 702 fuel, from Swift Enterprises of Indiana. Swift 702 fuel was separately reported by Swift Enterprises, Inc., assignee of U.S. Patent Application Publication No. 2008/0244961 A1, published on Oct. 9, 2008, as being eighty three percent (83%) by weight of mesitylene (also known as, and hereinafter identified by the chemical name 1,3,5 trimethylbenzene), and seventeen percent (17%) by weight of iso-pentane. The FAA similarly reported that the Swift 702 fuel consisted of two pure chemical compounds. The Swift 702 fuel was reported by the FAA to have a motor octane number (MON) of 104.4, as determined by ASTM D-2700. The Swift 702 fuel was detonation tested in a Lycoming IO-540-K aircraft engine used in the tests noted in the two reports above. Also, the Swift 702 fuel was tested in a turbocharged non-intercooled Lycoming TIO-540-J2BD aircraft engine. These two engines were reported by the FAA as having been previously determined as having the highest octane requirements of engines in the active general aviation fleet. The Swift 702 fuel provided slightly better detonation performance than Grade 100LL fuel that was purchased from the local airport aviation gasoline fixed base operator. However, it did not meet the 50%, 90%, and end distillation points of the then current ASTM D910 specification. And, the energy content was noted as being only ninety three point six percent (93.6%) of Grade 100LL on a mass basis. Such a reduction in energy content, in conjunction with the higher fuel density, will reduce the available payload of the aircraft for a given trip of a given range. In some cases, such a reduction will be unacceptable to the operator, and may require expensive re-certification of the aircraft. Thus, it would be desirable that any replacement aviation fuel more closely meet the presently existing ASTM minimum specifications with respect to energy content per unit mass of fuel, in order to minimize any potential loss of range or payload for an aircraft using such fuels. And, it would be desirable to provide a replacement aviation fuel that minimizes the quantity of 1,3,5 tri-methylbenzene that must be produced to provide sufficient unleaded fuel to the aviation marketplace, since such compound is not presently produced in commodity quantities for fuel blending, and may be more expensive, even in large scale production, than other possible unleaded aviation gasoline components. In other work, U.S. Pat. No. 5,470,358, entitled Unleaded Aviation Gasoline, was issued Nov. 28, 1995 to Gaughan, and assigned to Exxon Research & Engineering Co.; the disclosure of that patent is incorporated herein in its entirety by this reference. The Gaughan patent discloses an unleaded aviation fuel that combines (a) an aviation gasoline base fuel having a motor octane number (MON) of 90-93, with (b) an amount of at least one aromatic amine as that is effective to boost the motor octane number (MON) of the base fuel to at least about 98. However, many high performance aircraft engines require better performing fuels, i.e. fuels that at least have the ability to run at all significant operating conditions in a manner substantially equivalent to that presently provided by at least a fuel that meets the minimum ASTM D910 specification for Grade 100LL, if not more. An unleaded fuel blend that only provides performance equivalent to that of a 98 MON avgas on a full scale engine will likely fail at times to meet necessary engine performance requirements. Thus, it would be desirable that a fuel provide performance that meets or exceeds the minimum ASTM D910 specifications for Grade 100LL fuel. It would be even more desirable to provide a fuel that meets or exceeds in full scale aircraft engine testing the performance of an FBO Grade 100LL fuel having a selected MON. As discussed elsewhere herein, it is common for FBO Grade 100LL fuels to have a selected MON well in excess of the minimum ASTM D910 specifications for Grade 100LL fuel. U.S. Pat. No. 6,258,134 B1, entitled High Octane Unleaded Aviation Gasolines, issued Jul. 10, 2001 to Studzinski et al., and assigned to Texaco, Inc., discloses an unleaded aviation fuel of at least 94 motor octane number (MON). The disclosure of U.S. Pat. No. 6,258,134 B1 is incorporated herein in its entirety by this reference. In an embodiment, that disclosure provides an unleaded aviation fuel having a motor octane number (MON) of at least 94, made up of the combination of (1) an unleaded alkylate base fuel having a boiling point range that is substantially wider than the range of boiling points in aviation base fuel, and having a motor octane number (MON) of at least 91, (2) an alkyl tertiary butyl ether, and (3) an aromatic amine. Yet, high performance aircraft engines require better performing fuels. Further, it would be desirable to provide an unleaded aviation fuel that avoids the use of oxygenated components, such as alcohols or ethers, especially since use of the latter class of compounds has been eliminated by governmental regulation in many countries. In Europe, Hjelmco Oil AB of Sweden has been selling unleaded avgas of various blends, including a 91/96 motor octane number (MON) unleaded blend that may be used in 91/96 and in 80/97 octane engines. See http://www.hjelmco.com. The 91/96 UL MON blend was first produced in Finland and introduced in 1991, and is now produced in Sweden. Hjelmco now reports on the above noted website that it is considering a Bio-alkylate derived avgas in a possible replacement for existing Grade 100LL avgas. However, in so far as I am aware, they do not yet offer a product that is capable of providing adequate detonation performance in 100/130 octane aviation engines, in spite of their many years of experience in blending and providing unleaded aviation fuels. Finally, U.S. Pat. No. 6,767,372 B2, entitled Aviation Gasoline Containing Reduced Amounts of Tetraethyl Lead, issued Jul. 27, 2004 to Barnes et al, and assigned to Chevron U.S.A. Inc., discloses an unleaded aviation fuel of at least 94 motor octane number (MON). The disclosure of U.S. Pat. No. 6,767,372 B2 is incorporated herein in its entirety by this reference. In an embodiment, that disclosure provides an unleaded aviation fuel having, measured by volume, (a) about twenty percent (20%) to about eighty percent (80%) of iso-octane, (b) about five percent (5%) to about eighteen percent (18%) of toluene, (c) about one percent (1%) to about twenty percent (20%) of C4 to C5 paraffins, (d) greater than zero (0) to about one (1) ml of tetraethyl lead per gallon of the aviation gasoline composition, and (e) the balance of the composition being light alkylate produced in an alkylation unit using hydrogen fluoride or H2SO4 as a catalyst. In an embodiment, that aviation gasoline is described as being substantially free of ether compounds, such as methyl tertiary butyl ether (MTBE) or ethyl tertiary butyl ether (ETBE) or the like. However, the Barnes et al patent does not describe whether or not there is any possibility within the otherwise described ingredients to completely eliminate the use of tetraethyl lead. And, although it teaches reduced lead compositions in an aviation fuel, it does not provide specific suggestions as to possible formulations using the components described therein that might tend to further minimize or eliminate the use of tetraethyl lead in order to meet or exceed performance standards for presently existing for Grade 100LL aviation fuel. Thus, in spite of the extensive testing and evaluation by the FAA and by others of various candidate unleaded aviation fuel blends, and other work as noted in the above described patent literature, there still remains an as yet unmet need for an unleaded aviation gasoline blend that can be readily used in the existing general aviation piston engine aircraft fleet as a “drop in substitute”. Such an unleaded aviation gasoline, particularly a fuel blend that is essentially transparent in functionality to the aircraft engine during various flight operations as compared with existing Grade 100LL fuels, and which could be mixed in the aircraft fuel tank in a random manner with existing Grade 100LL fuel formulations, would assist in the reduction or phase out of existing lead containing aviation gasolines. That is because rather than requiring a simultaneous wholesale and widespread switch in unleaded aviation gasoline availability, if such a new unleaded aviation gasoline becomes available, then existing fuel systems could accommodate and provide a new unleaded aviation gasoline as it becomes locally available from suppliers. And, aircraft crews would not need to be concerned with whether previously existing 100LL fuel or a new unleaded aviation gasoline blend were available at any particular airfield. Further, it would be advantageous if a new unleaded aviation gasoline were available that could be utilized with little or no mechanical alterations or replacements of existing aircraft engines or aircraft system adjustments, and which could be used with little or no additional certification or other regulatory changes from the aircraft owner or operator standpoint. And, such an unleaded aviation gasoline would be of benefit to aircraft engine manufacturers and to aircraft manufacturing companies, as a fuel having such characteristics should enable them to avoid the need for extensive redesigns of equipment, testing, and recertification that might be required if an unleaded aviation fuel with less desirable performance characteristics were selected for widespread use. It would also be especially advantageous if in an embodiment, such a new unleaded aviation gasoline, rather than having substantially less than existing energy content for use by the aircraft, would provide as much or more energy per unit volume of fuel tank capacity, i.e. British Thermal Units (BTU's) per gallon, as existing Grade 100LL fuels. In such a manner, it would be particularly advantageous if a new unleaded aviation gasoline could be used to take full advantage of the existing mechanical design components with respect to mass flow of air into the engine, and materials of construction utilized in the fuel system, and be capable of operating without knock or detonation at rich and lean air fuel ratio conditions, with existing compression ratios, with full rated power output, in a stable and highly efficient manner in all flight operating conditions, including high power cruise conditions with lean air-fuel mixtures. Moreover, it would be advantageous to provide a new unleaded aviation gasoline that may be produced and distributed as a substitute for, and in the same manner as, existing petroleum feedstock aircraft fuels, using existing refinery production systems and fuel distribution systems. It would be even more useful if such a replacement aircraft fuel were provided that meets the ASTM D910 specification for detonation margins and further, either meets the remaining ASTM D910 Table 1 requirements or which only exhibits deviations from those requirements of a nature and to an extent that are not operationally significant to the pilot and the aircraft while completely eliminating the use of lead additives. It would also be advantageous to accomplish such goals while providing an unleaded aviation gasoline suitable for “drop-in” substitution, fully fungible with existing Grade 100LL aviation gasoline, in order to minimize the extent, complexity, and cost of any recertification efforts of the high performance, high-octane fuel powered engines found in existing general aviation aircraft. As used herein, the term “drop-in” substitution is directed to a fuel that meets aircraft engine performance requirements from an operational standpoint, and can be used transparently, from the operational standpoint (including fueling of and holding in the fuel tank, holding and processing in the fuel systems of an aircraft during storage and during operation, and consumed by combustion during operation of the aircraft engine, and producing environmentally acceptable products of combustion). As such, a “drop-in” fuel as described herein may or may not meet all of the current ASTM D910 specifications requirements (or a future/then current later generation similar fuel specification), except for the absence of lead. Unofficially, in some aviation fuels industry circles, such usage—i.e. meeting performance requirements but not strictly meeting ASTM or other specifications—might otherwise be known as having the capability of a “quasi-drop-in” fuel—i.e. a fuel that meets performance requirements but does not strictly meet all of the applicable ASTM D910 specifications. In any event, it would be very helpful to the general aviation piston engine user community to have available a fuel which could be placed in the aircraft tanks and used without regard to changes in mechanical components or aircraft performance, and which will therefore minimize or eliminate regulatory paperwork. It would be even more helpful, and quite advantageous, for a new unleaded aviation gasoline to be made available that meets such objectives, and that also can be used without alterations to the aircraft or engines and without substantive changes in existing operational manuals, other than to add to the limitations section of such operational manuals the approval of the use of a new grade or description of fuel which is approved and related instructions to the pilot for how the new unleaded aviation gasoline is to be used.

NHL and the NHL Shield are registered trademarks and NHL Mobile name and logo, NHL GameCenter and Unlimited NHL are trademarks of the National Hockey League. NHL and NHL team marks are the property of the NHL and its teams. Morning Skate Report: Flames vs. Red Wings There is no doubt the Red Wings top two lines can be lethal offensively. Through their opening eight games of the 2013 campaign, they have rattled off 18 of the team's 21 goals. Johan Franzen, Damien Brunner, Valtteri Filppula and Todd Bertuzzi have all been key contributors for the Red Wings, regularly generating scoring chances and producing offensively. But Henrik Zetterberg and Pavel Datsyuk have to be considered Detroit's best weapons up front. The pair, who have each played all eight games this year, have 22 points between them. Zetterberg, the team leader in scoring, has potted five goals and 12 points while Datsyuk has three tallies and 10 points to his name. According to rearguard TJ Brodie, the key to shutting down such highly skilled players is denying them time and space in the neutral and defensive zones. “It’s tough to make plays when there are guys all over you and you don’t have much time to think or pursue the play. That will be big,” the 22 year old said. “I think playing a little physical on them too – knocking them off pucks and letting them know it’s not going to be an easy game.” WORKING OFF THE POSITIVES FROM SATURDAY The word domination could very well be used when describing how the Flames played against Chicago on Saturday night but despite putting 49 shots on Ray Emery – and holding the Blackhawks to just 19 shots –Calgary fell 3-2 in a shootout. Rather than dwelling on the result of that outing, the Flames are looking to build off of the positives that stemmed from the loss. “We did a lot of good things,” Brodie said. “For a team like Chicago to only get 19 shots, that’s definitely a good feeling.” One thing the team is focusing on is capitalizing on chances. From shots going just wide of an empty net to whiffing on passes, the Flames had puck luck on Saturday but, in Brodie’s mind, no one should feel that Chicago just had fortuitous bounces. Instead, they have to harbor the attitude that they have to get better on jumping on scoring opportunities. “We have to take advantage of the chances that we get. We’ve got to find a way to win.” DETROIT LINEUP NOTES Former Flame Ian White will likely return to the Red Wings lineup tonight. He suffered a leg laceration on Jan. 22 and has been out ever since. Detroit’s back-end took a hit on Saturday when Brendan Smith suffered a shoulder sprain after taking a hit from Columbus' Derek MacKenzie. He is expected to be out for three to four weeks. Tatar has been brought in to help kick-start Detroit's offence, which has relied heavily on their top-six forwards. The Red Wings third and fourth lines have only one point in between them - a Patrick Eaves assist on a Zetterberg tally. The forward will play on a line with Datsyuk and Filppula. “I’m going to try my best,” he said after the Red Wings morning skate. “Maybe … score a goal. That would be really nice for me.” Forward Darren Helm (back) and Carlo Caliacovo (shoulder) will not play tonight. Defenceman Jakub Kindl will sit as a healthy scratch while Brian Lashoff will jump back into the lineup in his place. CLIPPING THE WINGS Mike Cammalleri has had great success against the Wings throughout his career, recording 18 points (9 goals, 9 helpers) in 19 games. He faced off against Detroit once last season, scoring one goal on four shots in his 19:54 of ice time. Captain Jarome Iginla has seen his fair share of the boys from Motor City over the last 15 seasons. He's played 60 games against the Red Wings, scoring 20 goals and 54 points - an average of .90 points-per-game. While Iginla is still in search of his first goal of the year, he has posted four points in his last five games. The winger is also leading the Flames in shots on net with 25 through six games. Calgary's current scoring leader Alex Tanguay has played quite well against Detroit over the years. He has notched 11 goals and 32 points through 36 contests, an average of .89 points-per-game. The forward is heading into tonight's tilt on a five-game point streak. While three games is an extremely small sample size, TJ Brodie has been very effective for the Flames when facing the Red Wings. Two of the defenceman's 12 assists last year came against Detroit and he averaged 16:21 of ice time versus the Red Wings. Jiri Hudler has quite the grasp on Red Wings playing style and individual tendencies. After all, the Red Wings second round pick in 2002 did play five full seasons in Detroit before signing with Calgary last July. Given his knowledge of the opposition, there is a very good chance the Czech forward could push his point streak to four games in tonight's contest. NHL and the NHL Shield are registered trademarks and NHL Mobile name and logo, NHL GameCenter and Unlimited NHL are trademarks of the National Hockey League. NHL and NHL team marks are the property of the NHL and its teams.

The Girls Next Door: Kendra's Pickle-Party-Slash-Baby-Shower Playboy and pickles, that sounds about right. The very pregnant Kendra Wilkinson had her baby shower recently, and it was more of a surprise for us when we saw her toting a jar of pickles around. We can guess that she's been craving them, but all other logic regarding that fails me right now. Anyway, in attendance were, of course, her Girls Next Door co-stars. Bridget Marquardt and Holly Madison threw her the baby shower, which was held the other night at the home of Playboy Mansion secretary Mary O'Connor. Kendra's former flame, the recently divorced Hugh Hefner was also present, accompanied by those Shannon twins on both arms. Before they headed for the shower, Hef updated his Twitter account. He posted, "The girls are going to Kendra's baby shower today. Crystal, the Twins, Holly, Bridget & Kendra will all be there. How can I stay away?" The theme was apparently Candyland, throwing in the very crazy idea of pickles and ice cream. Bridget and Holly arrived at the Los Angeles home early to decorate, hauling in tons of blue streamers in honor of Kendra's son. Cupcakes and lollipops livened up the place as well, and some of them were even baked by Marquardt herself. "Just got done baking, frosting and decorating a ton of mini cupcakes for Kendra's shower tomorrow...It's been a busy day. I'm exhausted," Bridget wrote on Twitter the day before. She's certainly trying her best to throw a pickle party. As for Kendra, she obviously had an amazing time. Receiving the ultimate gift of a jar of pickles wasn't the only highlight of her baby shower. There was the wtf-sight of a grown man wearing a baby suit, being cuddled by The Girls Next Door. No, it wasn't Hef. Whew.

Chanev Chanev () is a surname. Notable persons with that name include: Rousy Chanev (born 1945), Bulgarian actor Valchan Chanev (born 1992), Bulgarian football player Category:Bulgarian-language surnames

26 Feb Engadget – LG’s G6 is official The LG G6 is official, but it’s not much of a surprise. We already knew that the G5’s modular capabilities were out, in favor of a more traditional aluminium and Gorilla Glass shell. We also knew that the phone would have an unusual 18:9 display, and…

Transcription attenuation. Prokaryotic transcription attenuation mechanisms are described in which different metabolic signals and sensing events are used to regulate transcription termination at sites preceding structural genes. Suggestive eukaryotic examples also are mentioned.

Introduction {#s1} ============ Human thought involves the building of mental representations by integrating external and previously stored information, and their manipulation in a cognitive space: working memory (WM; Baddeley, [@B4]). A prime characteristic of thinking is hence its abstract nature. It always requires people to construct specific representations from the perceptual features of stimuli and individuals\' knowledge and goals (Johnson-Laird, [@B39]). Moreover, higher order thinking abilities such as complex text comprehension, reasoning, and meaningful school learning are sequential. They consist of diverse component subtasks and demand that people keep their attention focused throughout the entire process. Besides the initial construction of representations, higher cognitive tasks require individuals to keep the goal of the task in mind, to shift from one sub-task to the next, to update representations by activating Long Term Memory (LTM) information, and to inhibit and discard irrelevant processes and responses. The fulfillment of these complex cognitive tasks demands that people activate all their WM resources in a controlled and supervised way (see, García Madruga et al., [@B26]). The important role that higher order thinking abilities such as reasoning plays in knowledge acquisition and attainment at school has been addressed mainly from the perspective of the relationship between intelligence and academic performance (see, e.g., Sternberg et al., [@B71]; Deary et al., [@B20]; Vock et al., [@B79]). Classical psychometric theories have frequently defined intelligence, particularly fluid intelligence, as a capacity based on abstract reasoning (see Thurstone, [@B75]; Sternberg, [@B72]). Diverse authors have maintained that a crucial component of fluid intelligence is relational reasoning (see Cattell, [@B14]; Dumas et al., [@B21]), that is, the ability to identify and integrate the relationships between multiple mental representations. As a number of studies have shown, intelligence is probably the best single predictor of academic achievement in diverse subjects (Kuncel et al., [@B45]; Deary et al., [@B20]), particularly in mathematics-science subgroup of school subjects (Roth et al., [@B63]). The correlations found between fluid intelligence tests and academic achievement measured by means of scholastic tests are around 0.5 or higher (see, e.g., Neisser et al., [@B51]; Ones et al., [@B55]; Colom and Flores-Mendoza, [@B17]; Deary et al., [@B20]), whereas when the academic achievement measures are based on teacher grades the correlations tend to be around 0.5 or lower (see Soares et al., [@B68]). This evidence is in accordance with the results of studies that showed that increases in reasoning abilities were also accompanied by improved learning of classroom subject matter (Klauer and Phye, [@B43]). A possible explanation would be that fluid intelligence is associated with reasoning abilities (both inductive and deductive) involved in understanding and solving novel complex problems (Greiff and Neubert, [@B33]). There is a relatively new theoretical approach on thinking and reasoning in which WM plays a crucial role: dual-process theories (see Sloman, [@B67]; Stanovich, [@B70]; Evans, [@B22]; Kahneman, [@B40]; Evans and Stanovich, [@B24]). These theories postulate the existence of two different types of thinking: System 1 (intuitive) and System 2 (deliberative). System 1 is fast, unconscious, associative and not dependent on WM. System 1 allows individuals to quickly access intuitive responses that can be valid but also a source of pervasive mistakes. On the other hand, System 2 is slow, conscious, controlled and strongly linked to reasoners\' WM as well as their thinking dispositions or mental styles. WM is thus a defining feature of analytical System 2 processing. System 2 processing is required to solve complex thinking and reasoning problems, although this is not a sufficient condition for valid responses. Most dual-processing theories assume System 1 processing yields intuitive responses that subsequent System 2 deliberation may or may not modify. Stanovich et al. ([@B69]) claim that deliberative reasoning requires overriding System 1. Overriding System 1 and activating System 2 demands an individual\'s executive control, as well as a propensity to think actively and resist the premature closing of problems. Executive control processes thus play a crucial role in analytical System 2 processes (see De Neys and Glumicic, [@B18]; Evans, [@B23]; Thompson, [@B74]). System 2 function relates to general measures of cognitive ability such as IQ (Intelligence Quotient), whereas System 1 function does not (Stanovich, [@B70]). Dual process theories of thinking have been mainly developed in deductive reasoning tasks and there is a lot of evidence for the relevance of both systems of thinking in propositional and syllogistic reasoning (see De Neys, [@B19]; Evans, [@B22]; Barrouillet, [@B5]). Reasoning is a kind of thinking activity that has a precise starting point, a set of premises, and the goal of drawing a conclusion. In induction, the conclusion involves an increment in semantic information; whereas in deduction the conclusions do not involve any increase in semantic information (Johnson-Laird, [@B38]). Abstract reasoning, even the most elementary kind, is hence a complex phenomenon that requires that individuals follow a sequential process that includes various steps and tasks, and the passage from one to another. A second source of complexity comes from the need to temporarily store and update in WM the diverse representations needed to carry out a reasoning sequence. Indeed, individual differences in reasoning are substantially correlated with the amount of information learners can hold in WM while perform the required inferential reasoning task (Süß et al., [@B64]). There are diverse theories of deduction, the two most important being that of "mental rules" and "mental models." According to mental rules theories, people possess a set of rules, a sort of "natural logic" from which they reach a conclusion by following a sequence of steps (see Rips, [@B62]; Braine and O\'Brien, [@B8]). The current work, however, has been planned and carried out according to the mental model approach. The mental model theory of reasoning postulates that when individuals face deductive problems they construct models or possibilities of the meaning of assertions consistent with what they describe (see Johnson-Laird, [@B37], [@B39]; Johnson-Laird and Byrne, [@B35]). Mental models only represent what is true according to the premises, but not what is false. For instance, for the conditional "if p, then q" people might construct the following true possibilities: "p and q," "not-p and q," "not-p and not-q." A main assumption of model theory concerns the crucial role of WM in deduction: representing and manipulating models in order to reach a conclusion entails cognitive work and effort. For complex deductive problems, for instance conditionals, several possibilities are true, but people think about as few alternatives as possible because of the limitations of their WM (Johnson-Laird and Byrne, [@B36]). Therefore, reasoners are likely to base most of their inferences from the initial and incomplete representation or models of the premises. The model theory\'s fundamental prediction is thus drawn from the number of models required for reaching a conclusion: the more models, the greater the problem\'s difficulty. When the number of models to be held in mind is reduced, reasoning improves (García-Madruga et al., [@B28]). An inferential conclusion is necessarily valid if it holds in all the models of the premises. Therefore, finding a valid conclusion to complex problems requires that individuals build complete representations of premises and validate initial conclusions by searching for counterexamples that can make them false. From a mental model perspective, García-Madruga et al. ([@B27]) have highlighted the central executive processes as the crucial WM component in the explanation of propositional reasoning performance, as well as its relationship with the two systems of reasoning processes, System 1 and System 2. They found positive correlations between WM and reasoning responses that require high levels of mental word, and negative correlations between WM and reasoning responses that require low levels of mental work. Moreover, high WM individuals were more able to resist superficial responses and rely on the semantic process of constructing models of the meaning of premises from which they drown correct conclusions. Likewise, studies with syllogistic reasoning problems have borne out the crucial role of WM, particularly the executive processes (see Gilhooly et al., [@B31]; Capon et al., [@B12]). In deductive reasoning, the process of connecting premises to the conclusion is ruled by logic. That is, the conclusions have to be necessary and consistent. The restrictions that rule deductive reasoning are hence metadeductive. Metadeduction involves an individual\'s capacity to reflect on one\'s own logical activity itself and to distinguish between logical validity and reality (see, e.g., Byrne et al., [@B9]). Metadeductive abilities include the implicit understanding of the logical system and its basic concepts of necessity and validity, as well as the explicit use of this knowledge by applying metalogical strategies, such as searching for counterexamples (Moshman, [@B49]). Metacognition has been proposed as an important basis for overrides of System 1 by System 2 (Thompson, [@B74]). In developmental terms, there is a gradual acquisition of metalogical understanding during preadolescent and adolescent years: from 11 to 12 years preadolescents begin to understand the concepts of necessity, consistency and the validity of logical conclusions (Moshman, [@B50]; Santamaría et al., [@B65]). However, complete explicit metalogical capacity only becomes possible in late adolescence and adulthood. In this work, we will use a Deductive Reasoning Test (García-Madruga et al., [@B29]) that assesses both deductive and metadeductive abilities. Dual process theorists agree that abstract and hypothetical System 2 processes can guide our reasoning on specific tasks toward normative answers, whereas System 1 processes have a mayor influence on everyday judgement. The role of dual processes of thinking in education, and particularly the capacity of the Cognitive Reflection Test (Frederick, [@B25]) to predict academic achievement, have been demonstrated by Gómez-Chacón et al. ([@B32]) within the field of mathematics. According to these authors, the dual processes approach has direct application to mathematical learning. A teacher has to direct attention toward two basic educational objectives: firstly, the promotion of an in-depth understanding of mathematical concepts; and secondly, the inhibition of superficial processes and strategies that otherwise lead to error. Our view is that these two basic objectives are cross-sectional in education, so that they underlie academic achievement not only in mathematics, but across all the diverse school subjects. The present paper addresses the relationship that abstract reasoning has with academic achievement in secondary school, and focus not only on classic fluid intelligence measures but also on two new measures of cognitive reflection and verbal deduction. We examine the underlying idea that other reasoning measures will be a relevant predictor of academic achievement, even beyond the predictive value of fluid intelligence measures. We argue that abstract reasoning processes are involved in most of the complex learning tasks students commonly face at school, and constitute an important higher-order cognitive ability that underlies academic achievement. In order to extend and clarify this supposition, the main goal of this study was to investigate the relationship between two new reasoning measures, one mathematical (Cognitive Reflection) and the other verbal (Deductive Reasoning), and a third classic visuo-spatial reasoning measure that evaluates fluid intelligence, as well as test their capacity to predict academic achievement in adolescence. In spite of the obvious differences in contents and materials, all of them involve the construction and manipulation of abstract representations in a sequential process that requires supervision and control. Thus, we provide a new estimate of the association between cognitive ability and education by having multiple reasoning tests as predictors of academic achievement at secondary school. Participation of an adolescent sample seemed particularly relevant, as reasoning skills are increasingly important during this developmental period (Barrouillet, [@B5]), when learning activities become more complex. In order to assess this view, we used three diverse kinds of reasoning tests, as we shall describe in more detail in the Methods section: Cognitive Reflection Test (CRT; Frederick, [@B25]), DRT (García-Madruga et al., [@B29]) and Raven\'s Progressive Matrices Test (RPMT; Raven, [@B60], [@B61]; Raven et al., [@B59]). The academic achievement is the criteria for assessing students learning outcomes. The Cognitive Reflection Test (CRT; Frederick, [@B25]; for a review, see Campitelli and Gerrans, [@B11]; for a metaanalysis, see Brañas-Garza et al., [@B7]) assesses an individual\'s ability to use System 2 processes and resist the tendency to give an immediate response (System 1). Frederick ([@B25]); Toplak et al. ([@B77]) found that many people show a tendency to give the fast incorrect answers that are automatic, superficial, compelling, without thinking deeply enough. Frederick\'s problems are hence difficult and people who give the incorrect responses tend to underestimate their difficulty. Prior research has also evidenced that individuals who perform well tend to perform also well at other general ability tests, and tend to avoid biases in decision-making (Campitelli and Labollita, [@B10]; Toplak et al., [@B76]). Therefore, we expected a high rate of erroneous intuitive responses and a significant positive correlation between intuitive responses and the rating of the difficulty of the problems. The DRT (García-Madruga et al., [@B29]) assesses both deductive and metadeductive abilities in propositional and syllogistic reasoning. According to mental model theory, most of the deductive problems included in the test (11 out of 15) require the construction of multiple models, that is, require the use of System 2 reflexive thinking. The problems were designed so that they covered a range of difficulty (see Johnson-Laird and Byrne, [@B35], for an analysis of tasks in terms of mental models). We hence expected that most of the problems would be difficult and predicted a close relationship between performance in CRT and DRT. In order to have a measure of abstract non-verbal reasoning, in this work we used the RPMT (Raven et al., [@B59]) that evaluates fluid intelligence. The RPMT assesses a participant\'s ability to solve new problems by perceiving relationships, inducing rules and completing abstract analogies; in other words, by solving diverse relational reasoning tasks that are carried out in working memory, and governed by the executive processes of "assembly and control" (Carpenter et al., [@B13]). The more difficult problems entail more rules or more difficult rules. Erroneous responses can be yielded by System 1 processes, that is, by a superficial or incomplete kind of reasoning that leads one to give intuitive responses that agree only partially with the rules governing the search for the correct responses. We hence also predict a close relation between performance in CRT and Raven test. Apart from the general expectations concerning the results in CRT, we expected positive correlations between cognitive reflection, deductive reasoning, and Intelligence measures, given that there are common cognitive, metacognitive and WM\'s executive processes that underlie them. Likewise, we predicted that the three reasoning tasks would correlate with academic achievement. In particular, the correlations between erroneous intuitive responses (System 1) and the ratings of difficulty in CRT with accuracy measures of reasoning (System 2) and academic achievement should be negative. Our second hypothesis includes the main prediction that cognitive reflection, deductive reasoning and intelligence measures should predict a relevant amount of variance of academic achievement. Regarding the CRT, recent findings indicate that it is a predictor of rational thinking performance (Toplak et al., [@B76], [@B77]). Our approach maintains that CRT provides a way to assess a main control executive function: the ability to supervise and inhibit cognitive processes and responses. Therefore, we expected that CRT would be able to predict a relevant amount of variance of deductive inferences, metadeductive inferences and intelligence. Method {#s2} ====== Participants ------------ Fifty one science students aged between 15.3 and 17.7 years (*M* = 15.97; *SD* = 0.45) participated in the study. They were recruited from a 4th grade (2nd cycle of compulsory secondary education refers to 3rd and 4th grades) of a state secondary school in Fuenlabrada (Madrid, Spain). They were 19 girls and 32 boys (62.35%) distributed in two class-groups (Group A: 27 students, 11 girls; and Group B: 24 students, 8 girls). We chose to select science students because scholastic achievement in sciences usually depends more heavily on reasoning abilities than other subjects like humanities, presumably because those subjects are more hierarchically structured (Deary et al., [@B20]). The school was selected to represent the public educational secondary schools from a medium sized urban area with varied socio-economic classes. Students who did not complete some of the tests and those whose families did not authorize participation in the research were excluded (13) from the final sample (*n* = 51). The sample includes three repeater students that were not excluded from the sample in order to preserving natural class-groups. Tasks and measures ------------------ ### Cognitive reflection test (CRT; Frederick, [@B25]) The CRT assesses an individual\'s disposition and aptitude to be reflective when faced with finding the solution to text-based mathematical reasoning problems. For instance, one of the problems is as follows: "*A bat and a ball cost 1.10 \$ in total. The bat cost 1 \$ more than the ball. How much does the ball cost?\_\_\_\_cents*." The mathematical knowledge required to check the accuracy of the intuitive response is rather simple. However, Frederick ([@B25]); Toplak et al. ([@B77]) found that many people show a tendency to give the fast incorrect answers that are automatic, superficial and compelling ---10 cents---. In other words, wrong answers are typical System 1 responses. The correct answer ---5 cents--- requires System 2 reasoning: only individuals who overcome the System 1 response, deliberately think more in depth and construct a more complete representation can solve the problems. As Campitelli and Gerrans ([@B11]) evidenced, it is a test of cognitive reflection and not just a numeracy test. A Spanish version of this test was used. Participants are asked to solve three numerical problems. There is no time limit to solve the problems and no alternatives are provided for the participants to choose. Afterwards, participants are also asked to evaluate the percentage of their classmates that will be able to give a correct solution to each problem. The solutions to each problem and the estimated percentages of correct solvers have to be written down in a booklet. We have three kinds of measures the CRT for each problem: correct (System 2) responses, intuitive (System 1) responses, and a rating of the problem\'s difficulty. The total score in CRT is calculated as the number of correct answers. Reliability of Cronbach alpha range between 0.60 and 0.73 values (see, Campitelli and Gerrans, [@B11]). ### Deductive reasoning test (DRT; García-Madruga et al., [@B29]) The DRT is composed of 15 items and covers four types of problems: propositional deductive and propositional metadeductive inferences, and syllogistic deductive and syllogistic metadeductive inferences. All the problems were presented with concrete materials and in a familiar and daily context. The Cronbach\'s alpha in DRT was 0.79. The propositional deductive inferences were four: two conditional problems, e.g., "If p then q" (Affirmation of Consequent, AC: q then q; and Denying of Antecedent, DA: not-p, then not-q) and two inclusive disjunction problems, "p or q or both" (one affirmative and one negative). In these problems, participants are asked to evaluate the possible conclusions of these four inferences. The problems require the construction of multiple models. The propositional metadeductive inferences were three truth-table problems in which participants had to analyze the consistency of three problems that consisted of a conditional statement and an assertion. In the first problem, the assertion matched the first initial model of the conditional (p and q) and most of participants should choose the correct response. The second problem required one to construct the second conditional model in which antecedent and consequent are negated (not-p and not-q). Finally, the last problem demanded the construction of the third and most difficult model of conditional in which the antecedent is negated but the consequent is affirmed (not-p and q). The syllogistic inference task required participants to generate and write the solution to five syllogisms. These syllogisms included the combinations of the four kinds of premises: universal affirmative (A: All X are Y), universal negative (E: No X are Y), particular affirmative (I: Some X are Y) and particular negative (O: Some X are not Y). The syllogisms were of different levels of difficulty. The first syllogism was the easiest: it was the only one-model syllogism. The rest of the syllogisms were multiple-model syllogisms which required the construction of two or three models. Two of the multiple model syllogisms had no valid conclusion (N). Finally, in the syllogistic metadeductive necessity/possibility task, reasoners had to decide if a given conclusion in three syllogistic problems is necessarily true, possible, or impossible. In this case, the first problem was the most difficult. ### Raven\'s test of intelligence (RPMT; Raven et al., [@B59]) The RPMT consists of sixty visual analogy problems. Participants have to identify the relevant features of an array of visual elements and then choose from among eight response alternatives arranged below the matrix which one is the correct element that has to be selected. Each problem consists of a 3 × 3 matrix (9 cells) that contains figural elements, such as geometric figures and lines, in which an element (bottom right position of the matrix) is missing. Participants have to look across the rows and then look down the columns to discover the rules that govern the presentation of the diverse figural elements and then use the rules to determine the missing element. Each problem presents a matrix with a missing element. A Spanish version of this nonverbal test was used. The Cronbach\'s alpha was 0.75. ### Academic achievement Participants\' academic achievement measures were the students\' achievements of content knowledge learned at the end of school terms; that is, the student\'s final numerical scores obtained in the seven basic subjects that include Language (Spanish), Biology, Physics, History, English, and two subjects of Mathematics. From the specific academic scores, we calculated two overall scores: Overall Math is the mean of the scores in the two mathematics subjects and Overall Achievement is the mean of the other disciplines (without Mathematics). The academic scores were obtained from the school database, but all data are confidential and anonymous. The students\' scores were given by university qualified and professional teachers in the diverse subject matter. The numerical score includes performance on theoretical, practical and attitudinal contents. Teachers evaluate their students using a grading system that ranges from 1 to 10 points in each subject (5 to 10 = approval). The use of teacher final class grades as summaries of students\' academic achievement poses some difficulties and possible biases concerning the validity and reliability of grades for communicating meaningful information about students\' academic progress (see, Allen, [@B2]). Nevertheless, the assessment of academic performance carried out by teachers in our study was specifically centered on the acquisition of knowledge within each of the different disciplines by giving each student a numerical score. According to Roth et al. ([@B63]), school grades are a good measure of academic achievement since they include information on scholastic performance over a wide period of time, based on different sources (e.g., student\'s motivation) and are less prone to error than other kind of specific achievement tests. Besides, a number of researchers have used academic achievement as measures on academic achievement (e.g., Kuhn and Holling, [@B44]). Procedure --------- Participants were tested in one single session lasting 90 min. Each class-group completed the three reasoning tests in their classroom with a short break between them. The order of presentation of the tasks in group A was: RPMT, CRT, and DRT. In the group B the order was the opposite. The three tests were presented to students in specific booklets. Prior to data collection, permission was obtained from parents, teachers and students. Parents were informed that participation in the study involved completing a set of reasoning tasks, which were administered by the researchers in groups. The study and overall procedure were approved by the UNED ethics committee. Data analyses ------------- The analyses were performed with the Statistical Package for the Social Sciences (IBM SPSS, 2010). No missing values were registered. Preliminary data screening indicated that the scores on reasoning and achievement measures were reasonably normally distributed. Because the outliers were not extreme, these scores were retained in the analysis. First, the percentage of correct and incorrect responses were calculated. To compare patterns of difficulty in the reasoning tasks, paired-samples *t*-tests were conducted. Second, Pearson bivariate correlations were performed to assess the relationship between cognitive reflection, deductive reasoning, intelligence and academic achievement measures. The strength of the correlations was classified according to the criteria suggested by Cohen ([@B16]): a value of 0.10--0.29 is small; 0.30--0.49 is medium, and 0.50--1.00 is high. Third, to examine the predictive role of variables, the method of standard multiple regression analysis was conducted; that is, all predictor variables were entered in one step. To determine which of the reasoning predictors accounted for most of the variance on the academic achievement scores, we performed two standard multiple regression analyses, one to assess the predictive power of reasoning ability on math achievement, and another one to assess the predictive power of reasoning variables on overall achievement. These analyses included variables that were significantly correlated. In addition, three standard multiple regression analyses were conducted to evaluate how well intelligence, deductive inferences and metadeductive inferences could be predicted from CRT measures. Given that in the CRT correct and intuitive responses practically mirror one another, we introduce in our regression analyses either one or the other, but never both of them. Results {#s3} ======= Below are presented the results structured according to the descriptive statistics of reasoning variables and objectives of the present study. Descriptive statistics and comparisons -------------------------------------- The results of the diverse measures in the cognitive reflection task (CRT) can be observed in Table [1](#T1){ref-type="table"}. The results of the CRT agreed with our expectations and Frederick\'s ([@B25]) predictions: the CRT was rather difficult, there were more wrong intuitive (58%) than correct responses (33%; *p* \< 0.05, Cohen\'s *d* = 0.64). Participants also clearly underestimated the difficulty of the task. That is, they considered that 76% of their classmates would be able to give correct responses, well above the total percentage of correct answers. ###### The percentages of correct and intuitive responses, and the ratings of difficulty for each of the problems in the cognitive reflection test. **Problems** **Correct responses (%)** **Intuitive responses (%)** **Difficulty ratings (%)** -------------------------------- --------------------------- ----------------------------- ---------------------------- 1\. The bat and the ball 29 63 84 2\. The machines 41 57 76 3\. The pond and the lily pads 29 57 69 Overall 33 58 76 The results of the DRT can be observed in Table [2](#T2){ref-type="table"}. The percentage of correct responses in multiple model problems was reliably lower than in one model problems (40 and 89%, respectively; *p* \< 0.01, Cohen\'s *d* = 2.23). There was a reliable pattern of decreasing difficulty in the four deductive reasoning tasks: the syllogistic construction task was reliably more difficult than the propositional evaluation task (*p* \< 0.01, Cohen\'s *d* = 0.78), which was more difficult than the propositional truth table task (*p* \< 0.01, Cohen\'s *d* = 0.62), which was later found to be more difficult than the syllogistic necessity/possibility task (*p* \< 0.01, Cohen\'s *d* = 0.37). Likewise, on the whole, deductive inferences were clearly and reliably more difficult than Metadeductive Inferences (*p* \< 0.01, Cohen\'s *d* = 1.51). ###### The percentages of correct responses (Standard deviation) for each of the problems in the Deductive Reasoning test. **Problems and statements** **Correct responses** ---------------------------------------------- -------------------------------------------- ------------ **PROPOSITIONAL EVALUATION TASK** Conditional Inferences DA 35% (0.48) Inclusive Disjunctions AC 25% (0.44) Aff. 69% (0.47) Neg. 78% (0.42) Overall Task 52% (0.27) **METADEDUCTIVE TRUTH-TABLE TASK** If p then no-q p     q[^\*^](#TN1){ref-type="table-fn"} 94% (0.24) If p then q not-p     q 82% (0.39) not-p     q 24% (0.43) Overall Task 67% (0.20) **SYLLOGISTIC CONSTRUCTION TASK** AI-I[^\*^](#TN1){ref-type="table-fn"} 84% (0.37) IA-N 2% (0.14) EI-O 43% (0.50) EA-O 8% (0.27) OO-N 31% (0.47) Overall Task 34% (0.19) **METADEDUCTIVE NECESSITY/POSSIBILITY TASK** Possible 45% (0.50) Possible[^\*^](#TN1){ref-type="table-fn"} 90% (0.30) Necessary[^\*^](#TN1){ref-type="table-fn"} 88% (0.33) Overall Task 75% (0.23) Deductive problems 42% (0.19) Metadeductive problems 71% (0.19) Overall correct responses 53% (0.17) *= one model problem*. In the RPMT the mean of correct responses was 52.75 and the standard deviation was 3.97 (Max. = 60, Min. = 42). These results show the participants have a high level of fluid intelligence in comparison with their age group (*M* = 48). Interrelationships between variables ------------------------------------ Table [3](#T3){ref-type="table"} presents the correlations between the mean measures. As can be observed, our predictions included in the first hypothesis were clearly confirmed. The correlations between CRT (correct responses), DRT (deductive and metadeductive inferences) and Intelligence measures were positive and significant. Likewise, accuracy in the three reasoning tasks correlated in reliable way with the two Academic Achievement measures. In DRT, the correlations between multiple and one model problems with Overall Math were: *r* = 0.48 (*p* \< 0.001) and *r* = 0.12 (*p* \> 0.1), respectively; and with Overall Achievement, the correlations were: *r* = 0.46 (*p* \< 0.001) and *r* = 0.14 (*p* \> 0.1), respectively. ###### Pearson correlations between Cognitive Reflection Test (Correct and Intuitive responses, and Ratings of Difficulty), Intelligence (RPMT), Deductive and Metadeductive Inferences, and the two Academic Achievement measures. ***n* = 51** **1** **2** **3** **4** **5** **6** **7** **8** ------------------------------ ------- ------------------------------------------ ------------------------------------------ ------------------------------------------ ------------------------------------------ ------------------------------------------ ------------------------------------------ ------------------------------------------ 1\. Reflection Correct 1 −0.94[^\*\*^](#TN3){ref-type="table-fn"} −0.62[^\*\*^](#TN3){ref-type="table-fn"} 0.45[^\*\*^](#TN3){ref-type="table-fn"} 0.46[^\*\*^](#TN3){ref-type="table-fn"} 0.57[^\*\*^](#TN3){ref-type="table-fn"} 0.29[^\*^](#TN2){ref-type="table-fn"} 0.33[^\*\*^](#TN3){ref-type="table-fn"} 2\. Reflection Intuitive 1 0.69[^\*\*^](#TN3){ref-type="table-fn"} −0.47[^\*\*^](#TN3){ref-type="table-fn"} −0.47[^\*\*^](#TN3){ref-type="table-fn"} −0.55[^\*\*^](#TN3){ref-type="table-fn"} −0.35[^\*\*^](#TN3){ref-type="table-fn"} −0.39[^\*\*^](#TN3){ref-type="table-fn"} 3\. Difficulty Ratings 1 −0.33[^\*\*^](#TN3){ref-type="table-fn"} −0.39[^\*\*^](#TN3){ref-type="table-fn"} −0.54[^\*\*^](#TN3){ref-type="table-fn"} −0.37[^\*\*^](#TN3){ref-type="table-fn"} −0.38[^\*\*^](#TN3){ref-type="table-fn"} 4\. Intelligence 1 0.27[^\*^](#TN2){ref-type="table-fn"} 0.33[^\*\*^](#TN3){ref-type="table-fn"} 0.41[^\*\*^](#TN3){ref-type="table-fn"} 0.37[^\*\*^](#TN3){ref-type="table-fn"} 5\. Deductive Inferences 1 0.60[^\*\*^](#TN3){ref-type="table-fn"} 0.48[^\*\*^](#TN3){ref-type="table-fn"} 0.44[^\*\*^](#TN3){ref-type="table-fn"} 6\. Metadeductive Inferences 1 0.29[^\*^](#TN2){ref-type="table-fn"} 0.28[^\*^](#TN2){ref-type="table-fn"} 7\. Overall Mathematics 1 0.89[^\*\*^](#TN3){ref-type="table-fn"}    *M* = 5.58; *SD* = 2.09 8\. Overall Achievement 1    *M* = 6.54; *SD* = 1.57 p \< 0.05; *p \< 0.01; unidirectional*. Finally, it may be noted that, as expected, the correlations between erroneous intuitive responses and the ratings of difficulty in CRT with accuracy measures of reasoning and academic achievement were all negative and significant (range between 0.35 and 0.69 values).This finding indicates that the underestimation of difficulty was higher in participants that gave intuitive responses. Predictive power of variables ----------------------------- Our second hypothesis claimed the predictive ability of the reasoning measures (Cognitive Reflection---either difficulty ratings or intuitive responses---, Deductive Inferences and Intelligence) on both Academic Achievement scores. Table [4](#T4){ref-type="table"} shows that CRT, DRT and Intelligence measures significantly predicted relevant amounts of variance of the two measures of Academic Achievement: Overall Math and Overall Achievement. The results satisfied our expectations as follows: 33% of the variance of Academic Achievement in Mathematics and 28% of the Academic Achievement in the remaining subjects---Spanish Language, Biology, Physics, History, English---were explained by the abstract reasoning measures. The reliable variables were Deductive inferences and Intelligence in the former, and only Deductive inferences in the overall achievement measure (without Mathematics). ###### Regression analyses of Intelligence, Deductive Inferences and Cognitive Reflection (either Difficulty Ratings or Intuitive Responses) on the two Overall Achievement measures (Overall Math and Overall Achievement without Math). **Dependent variable** ****R*^2^*** ***F*** ***B*** ***Beta*** ***Sig*.** ------------------------ -------------- -------------------------------------------- --------- ------------ ------------ *Overall Math* 0.33 7.410[^\*\*\*^](#TN5){ref-type="table-fn"}       Intelligence 0.14 0.26 0.04       Deductive Inf. 3.81 0.34 0.01       Diff. Ratings −0.01 −0.14 0.28 *Overall Achievement* 0.28 6.014[^\*\*^](#TN4){ref-type="table-fn"}       Intelligence 0.10 0.22 0.11       Deductive Inf. 3.11 0.32 0.02       Intuit. Resp. −0.60 −0.13 0.39 *p \< 0.01*, *p \< 0.001; unidirectional*. Additional multiple regression analyses confirmed that the CRT measures were able to reliably predict relevant amounts of variance of Intelligence (RPMT), deductive and metadeductive inferences (DRT). As confirmed by regression results, Intuitive responses and Difficulty Ratings scores predicted 23% of the variance in Deductive inferences, *F*~(2,\ 48)~ = 0.13, *p* \< 0.01, and fluid Intelligence measures, *F*~(2,\ 48)~ = 6.92, *p* \< 0.01, of which only the Intuitive responses variable (*B* = 0.18, *Beta* = 0.39, *p* \< 0.05; *B* = 4.61, *Beta* = 0.47, *p* = 0.05, respectively) was reliable. The amount of variance of the Metadeductive inferences explained by Correct responses and Difficulty ratings raised to 37%, *F*~(2,\ 48)~ = 11.66, *p* \< 0.001. In this case, although the Difficulty ratings score is close to reaching significance, only the correct responses score was reliable (*B* = 0.19, *Beta* = 0.40, *p* \< 0.05). Discussion {#s4} ========== In order to solve new and complex intellectual problems individuals have to think in an active and deep way, using all their WM resources and applying their main executive processes. In this paper, we have investigated abstract reasoning in 15--17 years old students in their final year of Secondary school, using three different reasoning tasks: the CRT, the deductive reasoning task and the fluid intelligence test. Our key predictions concern the relationships between the three kinds of reasoning measures and their capacity to predict academic achievement. With respect to this, we would like to make two main points: first, this study confirms the trend noted in previous research regarding the relationship between reasoning and academic achievement; and second, the present novel findings revealed the relevance of verbal deductive reasoning to predict academic achievement, even beyond a visual fluid intelligence measure. We provide new evidence on the interplay between the three cognitive variables. As claimed by our first hypothesis, the inter-correlations were all significant and in the predicted direction. Furthermore, on the whole, the magnitude of predicted correlations was medium to high, in particular, the correlations between correct and intuitive responses in the CRT with Intelligence (RPMT), Deductive and Metadeductive inferences (DRT). These results confirm our theoretical conception regarding the tight relationships between the diverse kind of reasoning studied in this paper, as well as the common cognitive, metacognitive, and executive processes that underlie them. An interesting, but not unexpected, result is the high correlation between Cognitive Reflection and Metadeductive Inferences. The greater predictive ability of the CRT on Metadeductive inferences would be explained by the increased involvement of the metacognitive component in the metadeductive tasks. Thus, the pattern of results supports their common metacognitive nature and gives support to the important role that metacognitive processes may play in determining the interventions of System 2, as claimed by Thompson ([@B74]), Thompson et al. ([@B73]). It is interesting to note that, on the whole, the results confirm the relevant role that executive and metacognitive processes play in both verbal and visual abstract reasoning (García-Madruga et al., [@B27]). The CRT mainly measures the propensity or willingness to be reflective, to think analytically despite having what initially appears to be a suitable response (Pennycook et al., [@B56]). According to our view, this thinking disposition is directly related with executive functioning, since thinking analytically implies the ability to supervise and inhibit cognitive processes and responses. The present findings confirmed that, as expected and found in previous studies (Brañas-Garza et al., [@B7]), most of the participants replied with the wrong intuitive responses in the CRT and also underestimated the difficulty of the task: there was a high correlation between both measures. Only a third of participants were able to resist and override the immediate spontaneous answer and keep thinking to reach the correct one. The analytic thinking carried out by these participants not only allowed them to reach a correct conclusion, it also increased their metacognitive awareness of the difficulty of the problems. Thus, the correlation between correct responses and difficulty ratings measures was highly negative. As explained by Frederick ([@B25]), the correct answers produced by System 2 involve cognitive and motivational effort as well as concentration, and for this reason require more time to solve. These findings contribute to a better understanding of the interaction between System 1 and System 2 at the metacognitive and cognitive levels while performing the problem solving task. According to our view, this study also allows a more nuanced analysis of the interrelations between variables and particularly the capacity of the CRT to predict verbal relational reasoning (DRT) and visual relational reasoning (RPMT). The proposal that the CRT functions as a measure of analytic System 2 processes supports our hypothesis about its predictive capacity over the DRT and the Raven\'s test. As noted in the Introduction, these two tests assess verbal and visual abstract reasoning, respectively, and require thinking in a reflective, controlled and supervised way. The study provides new novel findings regarding the positive relation of cognitive reflection with respect to reasoning. It also extend a number of previous findings that showed that there is a moderate correlation between CRT and other intelligence measures, such as Wonderlic IQ test (Frederick, [@B25]; Toplak et al., [@B76]). The results found in DRT show a pattern of increased difficulty, the most difficult of which was the syllogistic deductive task and the easiest the syllogistic metadeductive task. This pattern of results can be explained with reference to two main variables. The first variable is the kind of task participants are required to complete. This involves two sources of difficulty: whether the task is deductive or an easier metadeductive task; and whether the task is a generation or an easier evaluation task. The second variable is the number of models required to solve each problem, as predicted by mental models theory (Johnson-Laird and Byrne, [@B36]): the present results confirm the well-established findings indicating that inferences that call for multiple models are harder than those that call for a single model. We also investigated the relation between the three reasoning measures and academic achievement measured by means of teacher grades. The inter-correlations between reasoning measures and academic achievement were again in the predicted direction, reliable and moderate. These correlations are somehow lower than the correlations usually found between intelligence and standardized test of achievement (see, for instance, Deary et al., [@B20]; Hannon, [@B34]), but they are quite similar to the correlations found by Soares et al. ([@B68]) by using teachers′ assessments of academic performance and the Reasoning Tests Battery (abstract, verbal, numerical, mechanical and spatial reasoning subtests). Likewise, the findings are informative because they are consistent with those of previous studies (e.g., Frederick, [@B25]; Obrecht et al., [@B54]) that showed moderate and positive correlations between CRT and SAT (Scholastic Assessment Test) scores, one of the most used measures of academic achievement. The results also extend those of Gómez-Chacón et al. ([@B32]) showing the interaction between cognitive reflection, WM, reasoning and mathematical achievement (i.e., academic qualifications) in secondary school. However, the highest correlations found in the present study were those between Academic Achievement and Deductive Inferences. This result is particularly relevant, especially if we notice that it is higher than the correlation found with fluid intelligence as measured by the RPMT. The second main aim concerns the predictive ability of the reasoning measures on academic achievement. In that respect, we found that the reliable variables were intelligence and deductive reasoning for math achievement, whereas only deductive reasoning was for global academic achievement. The findings are in accordance with those of previous studies that using different methodological approaches evidenced that intelligence is an important predictor of achievement and rate of learning (e.g., Primi et al., [@B57]; Roth et al., [@B63]), either when intelligence is measured by Wechsler Intelligent Scales for Children (Miranda et al., [@B48]) or Kaufman Test of Cognitive Ability (Kaufman et al., [@B41]; Scheiber, [@B66]). Likewise, our results corroborate findings that showed that individual differences in fluid intelligence are strongly related to math achievement (e.g., Primi et al., [@B58]), confirming thus the high ability of intelligence to predict achievement, particularly mathematics achievement (Primi et al., [@B58]) over achievement in more language based subjects (Deary et al., [@B20]). Regarding the predictive effect of reasoning, our results stress the relevance of deductive reasoning as predictor of academic outcomes, in line with previous results. For instance, Bhat ([@B6]) reported that, out of six dimensions of reasoning (i.e., inductive, deductive, linear, conditional, cause-and-effect and analogical reasoning components) assessed on 10th grade students, the maximum involvement was reflected by deductive reasoning followed by cause-effect reasoning and inductive reasoning. Nevertheless, the most interesting and new finding is that a measure of verbal deductive reasoning predicts Academic Achievement better, even in mathematics, than a visual fluid intelligence measure. As a matter of fact, the main source of novelty is the use itself of an abstract verbal measure of reasoning to predict academic achievement. Oral and written verbal communication is clearly the main way teachers and learners interact and the main source of knowledge acquisition at school. Furthermore, mathematical reasoning and problem solving has a verbal component (see Kintsch and Greeno, [@B42]), and different studies have confirmed the predictive capacity of reading abilities on mathematics (see García-Madruga et al., [@B30]). Our deductive problems involve not only reading comprehension but also, as Raven problems, abstract relational reasoning. Therefore, these results are not entirely unexpected and should not surprise us. The acquisition of new and complex knowledge by means of declarative learning across the various subjects at school relies on basic oral and written communicative abilities, and visual and verbal abstract reasoning. There might be many factors that have an influence and can also explain the variation in academic achievement. Thus, even though the prediction of academic performance has been widely explored and well-established in relation to cognitive factors such as intelligence or basic cognitive processes, there is a broad consensus that multiple cognitive, personality and motivational variables contribute in an interrelated form to predict individual differences in academic achievement (see, e.g., Ackerman and Heggestad, [@B1]; Chamorro-Premuzic and Furnham, [@B15]). For instance, personality predicts academic performance, even when intelligence and cognitive factors are controlled in adolescents (Noftle and Robins, [@B52]; Leeson et al., [@B47]); academic motivation (Lee and Shute, [@B46]), attitudes (Vilia et al., [@B78]), approaches to learning, prior knowledge, study time, homework parents ′education level are also associated to academic achievement (Núñez et al., [@B53]). Therefore, student related factors, school environment and peer influences not studied here should also be included to better assess students learning in future research. The current study has some limitations that should be addressed in future studies. In that respect, we should mention the small sample size. The generalization of our results to the wider population of 15--17 years old adolescents pose some difficulties, due not only to the scarce number of participants but also to the special characteristics of our sample: all of them were science students. Hence, our initial results are thus needed for further confirmation by means of studies using a wider sample of students. Reasoning ability appears to be important for predicting scholastic achievement in sciences, whereas other subjects such as languages seem to be more affected by gender-related attributes. Because our study does not seek to examine gender effects and due our preliminary analyses of data showed no gender differences in DRT and academic achievement measures, we did not consider the effect of such variable in the entire sample of the current study. However, gender differences in scholastic achievement as mediated by reasoning ability should be considered as an improvement to be undertaken in future research (see Kuhn and Holling, [@B44]). Educational implications and conclusion --------------------------------------- Our research has some evident applications to educational practice. First, it stresses that the evaluation of students\' cognitive abilities at school should not only be based on standard intelligence tests. In this line, Lee and Shute ([@B46]) and Soares et al. ([@B68]) have emphasized the relevance of a multidimensional assessment of students\' cognitive abilities. Without undermining the basic role of intelligence tests at school, our results confirm this approach that highlights that verbal deductive and cognitive reflection abilities might be as important at school as standard intelligence tests. As Toplak et al. ([@B76]) argued, the CRT captures important characteristics of rational thinking that are not measured in other intelligence tests. Both reasoning tasks, CRT and DRT, may be considered by teachers and educational psychologists as a relevant source of information to infer about subsequent school success/failure or to diagnose learning difficulties. Second, our research confirms the importance of a dual-processes approach in education. CRT provides a measure of student propensity to be reflexive and resist intuitive responses when faced with solving quite difficult, even if apparently easy, intellectual problems. As all good teachers are aware, a deeper understanding of concepts and tasks, as well as the inhibition of superficial processes and responses, are crucial in education. CRT allows us to know which students are probably going to need specific attention to grow more reflective and think in a deeper way in their leaning. A third educational corollary of our research is the relationship between metacognitive factors and academic achievement. Two of our measures, CRT and DRT, include an assessment of participants\' metacognitive abilities: the ratings of difficulty in CRT and the metacognitive inferences in DRT. The correlations of these measures with both academic measures confirm the important role of metacognitive issues in education and underline again the required introduction of metacognition in ordinary teaching and learning at school. Finally, the study of individual differences in reasoning measured by the three reasoning tasks is useful to understand better how instruction can be made more effective for more learners. Attempts are being made to elucidate the role of reasoning skills so that appropriate interventions to foster students′ reasoning abilities and preventive strategies can be identified (e.g., Ariës et al., [@B3]). From the perspective of dual processes in reasoning, the fact that System 2 entails conscious reasoning makes it susceptible to educational intervention. The promotion of in-depth understanding and the inhibition of superficial processes and strategies that otherwise lead to error would be considered as relevant instructional strategies. To end, complex declarative --meaningful- learning at school is a kind of human thinking activity that involves the building of mental representations by integrating external and previously stored information, and their manipulation in WM. Along with other higher-order thinking abilities, meaningful learning is a complex and sequential task that demand learners to activate and use executive functions. In this paper we have presented some preliminary evidences confirming that the presumed outcome of meaningful learning (i.e., academic achievement) in diverse subjects is tightly related to three kinds of abstract reasoning: cognitive reflection, verbal deduction and intelligence. Cognitive reflection provides a measure of executive functioning and therefore underlies reasoners\' performance in verbal and visuo-spatial reasoning tasks. Likewise, the two new measures of abstract reasoning and the classic measure of intelligence are able to predict a substantial amount of variance across the main academic performance measures. Finally, our results confirm the importance of dual processes, verbal deductive and metacognitive approaches in ordinary teaching and learning at school. By this means, the study will provide valuable information about the possible evaluation and intervention by educational psychologist. Ethics statement {#s5} ================ This study was carried out in accordance with the recommendations of UNED ethics committee with written informed consent from legal tutors of all subjects. All legal tutors gave written informed consent in accordance with the Declaration of Helsinki. The study and overall procedure were approved by the UNED ethics committee. Author contributions {#s6} ==================== IG-V and JG, Principal Investigators of the R&D Project, substantially contributed to the writing of the manuscript, which was revised critically by JV and GD. All authors contributed to all steps and approved the final version of the manuscript. The authors agree to be accountable for all aspects of the study in ensuring that questions related to the accuracy or integrity of any part of the work are appropriately investigated and resolved. Conflict of interest statement ------------------------------ The authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest. We thank students who voluntarily participated in this research as well as the Spanish state secondary school Instituto La Serna of Fuenlabrada (Comunidad de Madrid). **Funding.** This research was conducted with the financial support of the research project: EDU2014-56423-R, from the Ministry of Economy and Competitiveness of Spain. [^1]: Edited by: Jesus de la Fuente, University of Almería, Spain [^2]: Reviewed by: Adelinda Araujo Candeias, Universidade de Évora, Portugal; Ana Miranda, Universitat de València, Spain [^3]: This article was submitted to Educational Psychology, a section of the journal Frontiers in Psychology

Pardini GT9 The Pardini GT9 is a semi-automatic pistol calibre chambered in 9×21mm or 9mm parabellum depending on the market. It is manufactured by Pardini in Italy, a company founded by former competition shooter Giampiero Pardini and that exclusively manufactures sporting arms. It is a pure competition pistol with adjustable single-action push mechanism, relatively high weight and with a low bore axis. The company also manufactures the GT45, a .45 ACP version of the GT9 and the GT9-1, a longer version of the GT9. There are parts kits for the GT45 to fire 9mm Parabellum and .40 S&W; the parts kit is only for the GT45 because it has a bigger mag well than the others. The parts kit includes a slide, barrel, recoil spring, recoil spring guide, and 2 magazines and come in silver or black. They cost $1200-$1400. The GT pistols all have a 115° grip angle and a high grip for strait back recoiling. There is also a .40 S&W pistol called the GT40 and it costs $2999- $3199. Each pistol comes with 2 magazines, extra recoil spring, tool bag, owners manual, and a hard protective Pardini case with logo. There are scope mounts available and there are compensator barrels that come with a compensator. References Category:Semi-automatic pistols of Italy Category:Pardini

Management of difficult germ-cell tumors. Although testicular cancer is a rare disease accounting for only 1% of all male neoplasms, it represents a paradigm for cancer curability. Overall, more than 95% of patients can expect to be cured of their disease with minimal long-term toxicity. Given these expectations, it is critical that cancer care providers are familiar with the diagnostic and therapeutic challenges encountered in these rare patients. In particular, clinicians managing these patients should be aware of some of the pitfalls encountered when determining relapse. In a series of case presentations, we review the evaluation and management of patients with persistent elevation of serum tumor markers and postchemotherapy residual radiographic abnormalities.

Check out our new site Makeup Addiction add your own caption add your own caption add your own caption add your own caption add your own caption add your own caption add your own caption add your own caption add your own caption add your own caption add your own caption randomized drug screening? this job doesn't pay enough to quit catnip

package unused import ( "fmt" "go/ast" "go/token" "go/types" "io" "strings" "sync" "sync/atomic" "golang.org/x/tools/go/analysis" "honnef.co/go/tools/code" "honnef.co/go/tools/go/types/typeutil" "honnef.co/go/tools/internal/passes/buildir" "honnef.co/go/tools/ir" "honnef.co/go/tools/lint" ) // The graph we construct omits nodes along a path that do not // contribute any new information to the solution. For example, the // full graph for a function with a receiver would be Func -> // Signature -> Var -> Type. However, since signatures cannot be // unused, and receivers are always considered used, we can compact // the graph down to Func -> Type. This makes the graph smaller, but // harder to debug. // TODO(dh): conversions between structs mark fields as used, but the // conversion itself isn't part of that subgraph. even if the function // containing the conversion is unused, the fields will be marked as // used. // TODO(dh): we cannot observe function calls in assembly files. /* - packages use: - (1.1) exported named types (unless in package main) - (1.2) exported functions (unless in package main) - (1.3) exported variables (unless in package main) - (1.4) exported constants (unless in package main) - (1.5) init functions - (1.6) functions exported to cgo - (1.7) the main function iff in the main package - (1.8) symbols linked via go:linkname - named types use: - (2.1) exported methods - (2.2) the type they're based on - (2.3) all their aliases. we can't easily track uses of aliases because go/types turns them into uses of the aliased types. assume that if a type is used, so are all of its aliases. - (2.4) the pointer type. this aids with eagerly implementing interfaces. if a method that implements an interface is defined on a pointer receiver, and the pointer type is never used, but the named type is, then we still want to mark the method as used. - variables and constants use: - their types - functions use: - (4.1) all their arguments, return parameters and receivers - (4.2) anonymous functions defined beneath them - (4.3) closures and bound methods. this implements a simplified model where a function is used merely by being referenced, even if it is never called. that way we don't have to keep track of closures escaping functions. - (4.4) functions they return. we assume that someone else will call the returned function - (4.5) functions/interface methods they call - types they instantiate or convert to - (4.7) fields they access - (4.8) types of all instructions - (4.9) package-level variables they assign to iff in tests (sinks for benchmarks) - conversions use: - (5.1) when converting between two equivalent structs, the fields in either struct use each other. the fields are relevant for the conversion, but only if the fields are also accessed outside the conversion. - (5.2) when converting to or from unsafe.Pointer, mark all fields as used. - structs use: - (6.1) fields of type NoCopy sentinel - (6.2) exported fields - (6.3) embedded fields that help implement interfaces (either fully implements it, or contributes required methods) (recursively) - (6.4) embedded fields that have exported methods (recursively) - (6.5) embedded structs that have exported fields (recursively) - (7.1) field accesses use fields - (7.2) fields use their types - (8.0) How we handle interfaces: - (8.1) We do not technically care about interfaces that only consist of exported methods. Exported methods on concrete types are always marked as used. - Any concrete type implements all known interfaces. Even if it isn't assigned to any interfaces in our code, the user may receive a value of the type and expect to pass it back to us through an interface. Concrete types use their methods that implement interfaces. If the type is used, it uses those methods. Otherwise, it doesn't. This way, types aren't incorrectly marked reachable through the edge from method to type. - (8.3) All interface methods are marked as used, even if they never get called. This is to accommodate sum types (unexported interface method that must exist but never gets called.) - (8.4) All embedded interfaces are marked as used. This is an extension of 8.3, but we have to explicitly track embedded interfaces because in a chain C->B->A, B wouldn't be marked as used by 8.3 just because it contributes A's methods to C. - Inherent uses: - thunks and other generated wrappers call the real function - (9.2) variables use their types - (9.3) types use their underlying and element types - (9.4) conversions use the type they convert to - (9.5) instructions use their operands - (9.6) instructions use their operands' types - (9.7) variable _reads_ use variables, writes do not, except in tests - (9.8) runtime functions that may be called from user code via the compiler - const groups: (10.1) if one constant out of a block of constants is used, mark all of them used. a lot of the time, unused constants exist for the sake of completeness. See also https://github.com/dominikh/go-tools/issues/365 - (11.1) anonymous struct types use all their fields. we cannot deduplicate struct types, as that leads to order-dependent reportings. we can't not deduplicate struct types while still tracking fields, because then each instance of the unnamed type in the data flow chain will get its own fields, causing false positives. Thus, we only accurately track fields of named struct types, and assume that unnamed struct types use all their fields. - Differences in whole program mode: - (e2) types aim to implement all exported interfaces from all packages - (e3) exported identifiers aren't automatically used. for fields and methods this poses extra issues due to reflection. We assume that all exported fields are used. We also maintain a list of known reflection-based method callers. */ func assert(b bool) { if !b { panic("failed assertion") } } func typString(obj types.Object) string { switch obj := obj.(type) { case *types.Func: return "func" case *types.Var: if obj.IsField() { return "field" } return "var" case *types.Const: return "const" case *types.TypeName: return "type" default: return "identifier" } } // /usr/lib/go/src/runtime/proc.go:433:6: func badmorestackg0 is unused (U1000) // Functions defined in the Go runtime that may be called through // compiler magic or via assembly. var runtimeFuncs = map[string]bool{ // The first part of the list is copied from // cmd/compile/internal/gc/builtin.go, var runtimeDecls "newobject": true, "panicindex": true, "panicslice": true, "panicdivide": true, "panicmakeslicelen": true, "throwinit": true, "panicwrap": true, "gopanic": true, "gorecover": true, "goschedguarded": true, "printbool": true, "printfloat": true, "printint": true, "printhex": true, "printuint": true, "printcomplex": true, "printstring": true, "printpointer": true, "printiface": true, "printeface": true, "printslice": true, "printnl": true, "printsp": true, "printlock": true, "printunlock": true, "concatstring2": true, "concatstring3": true, "concatstring4": true, "concatstring5": true, "concatstrings": true, "cmpstring": true, "intstring": true, "slicebytetostring": true, "slicebytetostringtmp": true, "slicerunetostring": true, "stringtoslicebyte": true, "stringtoslicerune": true, "slicecopy": true, "slicestringcopy": true, "decoderune": true, "countrunes": true, "convI2I": true, "convT16": true, "convT32": true, "convT64": true, "convTstring": true, "convTslice": true, "convT2E": true, "convT2Enoptr": true, "convT2I": true, "convT2Inoptr": true, "assertE2I": true, "assertE2I2": true, "assertI2I": true, "assertI2I2": true, "panicdottypeE": true, "panicdottypeI": true, "panicnildottype": true, "ifaceeq": true, "efaceeq": true, "fastrand": true, "makemap64": true, "makemap": true, "makemap_small": true, "mapaccess1": true, "mapaccess1_fast32": true, "mapaccess1_fast64": true, "mapaccess1_faststr": true, "mapaccess1_fat": true, "mapaccess2": true, "mapaccess2_fast32": true, "mapaccess2_fast64": true, "mapaccess2_faststr": true, "mapaccess2_fat": true, "mapassign": true, "mapassign_fast32": true, "mapassign_fast32ptr": true, "mapassign_fast64": true, "mapassign_fast64ptr": true, "mapassign_faststr": true, "mapiterinit": true, "mapdelete": true, "mapdelete_fast32": true, "mapdelete_fast64": true, "mapdelete_faststr": true, "mapiternext": true, "mapclear": true, "makechan64": true, "makechan": true, "chanrecv1": true, "chanrecv2": true, "chansend1": true, "closechan": true, "writeBarrier": true, "typedmemmove": true, "typedmemclr": true, "typedslicecopy": true, "selectnbsend": true, "selectnbrecv": true, "selectnbrecv2": true, "selectsetpc": true, "selectgo": true, "block": true, "makeslice": true, "makeslice64": true, "growslice": true, "memmove": true, "memclrNoHeapPointers": true, "memclrHasPointers": true, "memequal": true, "memequal8": true, "memequal16": true, "memequal32": true, "memequal64": true, "memequal128": true, "int64div": true, "uint64div": true, "int64mod": true, "uint64mod": true, "float64toint64": true, "float64touint64": true, "float64touint32": true, "int64tofloat64": true, "uint64tofloat64": true, "uint32tofloat64": true, "complex128div": true, "racefuncenter": true, "racefuncenterfp": true, "racefuncexit": true, "raceread": true, "racewrite": true, "racereadrange": true, "racewriterange": true, "msanread": true, "msanwrite": true, "x86HasPOPCNT": true, "x86HasSSE41": true, "arm64HasATOMICS": true, // The second part of the list is extracted from assembly code in // the standard library, with the exception of the runtime package itself "abort": true, "aeshashbody": true, "args": true, "asminit": true, "badctxt": true, "badmcall2": true, "badmcall": true, "badmorestackg0": true, "badmorestackgsignal": true, "badsignal2": true, "callbackasm1": true, "callCfunction": true, "cgocallback_gofunc": true, "cgocallbackg": true, "checkgoarm": true, "check": true, "debugCallCheck": true, "debugCallWrap": true, "emptyfunc": true, "entersyscall": true, "exit": true, "exits": true, "exitsyscall": true, "externalthreadhandler": true, "findnull": true, "goexit1": true, "gostring": true, "i386_set_ldt": true, "_initcgo": true, "init_thread_tls": true, "ldt0setup": true, "libpreinit": true, "load_g": true, "morestack": true, "mstart": true, "nacl_sysinfo": true, "nanotimeQPC": true, "nanotime": true, "newosproc0": true, "newproc": true, "newstack": true, "noted": true, "nowQPC": true, "osinit": true, "printf": true, "racecallback": true, "reflectcallmove": true, "reginit": true, "rt0_go": true, "save_g": true, "schedinit": true, "setldt": true, "settls": true, "sighandler": true, "sigprofNonGo": true, "sigtrampgo": true, "_sigtramp": true, "sigtramp": true, "stackcheck": true, "syscall_chdir": true, "syscall_chroot": true, "syscall_close": true, "syscall_dup2": true, "syscall_execve": true, "syscall_exit": true, "syscall_fcntl": true, "syscall_forkx": true, "syscall_gethostname": true, "syscall_getpid": true, "syscall_ioctl": true, "syscall_pipe": true, "syscall_rawsyscall6": true, "syscall_rawSyscall6": true, "syscall_rawsyscall": true, "syscall_RawSyscall": true, "syscall_rawsysvicall6": true, "syscall_setgid": true, "syscall_setgroups": true, "syscall_setpgid": true, "syscall_setsid": true, "syscall_setuid": true, "syscall_syscall6": true, "syscall_syscall": true, "syscall_Syscall": true, "syscall_sysvicall6": true, "syscall_wait4": true, "syscall_write": true, "traceback": true, "tstart": true, "usplitR0": true, "wbBufFlush": true, "write": true, } type pkg struct { Fset *token.FileSet Files []*ast.File Pkg *types.Package TypesInfo *types.Info TypesSizes types.Sizes IR *ir.Package SrcFuncs []*ir.Function } type Checker struct { WholeProgram bool Debug io.Writer mu sync.Mutex initialPackages map[*types.Package]struct{} allPackages map[*types.Package]struct{} graph *Graph } func NewChecker(wholeProgram bool) *Checker { return &Checker{ initialPackages: map[*types.Package]struct{}{}, allPackages: map[*types.Package]struct{}{}, WholeProgram: wholeProgram, } } func (c *Checker) Analyzer() *analysis.Analyzer { name := "U1000" if c.WholeProgram { name = "U1001" } return &analysis.Analyzer{ Name: name, Doc: "Unused code", Run: c.Run, Requires: []*analysis.Analyzer{buildir.Analyzer}, } } func (c *Checker) Run(pass *analysis.Pass) (interface{}, error) { c.mu.Lock() if c.graph == nil { c.graph = NewGraph() c.graph.wholeProgram = c.WholeProgram c.graph.fset = pass.Fset } var visit func(pkg *types.Package) visit = func(pkg *types.Package) { if _, ok := c.allPackages[pkg]; ok { return } c.allPackages[pkg] = struct{}{} for _, imp := range pkg.Imports() { visit(imp) } } visit(pass.Pkg) c.initialPackages[pass.Pkg] = struct{}{} c.mu.Unlock() irpkg := pass.ResultOf[buildir.Analyzer].(*buildir.IR) pkg := &pkg{ Fset: pass.Fset, Files: pass.Files, Pkg: pass.Pkg, TypesInfo: pass.TypesInfo, TypesSizes: pass.TypesSizes, IR: irpkg.Pkg, SrcFuncs: irpkg.SrcFuncs, } c.processPkg(c.graph, pkg) return nil, nil } func (c *Checker) ProblemObject(fset *token.FileSet, obj types.Object) lint.Problem { name := obj.Name() if sig, ok := obj.Type().(*types.Signature); ok && sig.Recv() != nil { switch sig.Recv().Type().(type) { case *types.Named, *types.Pointer: typ := types.TypeString(sig.Recv().Type(), func(*types.Package) string { return "" }) if len(typ) > 0 && typ[0] == '*' { name = fmt.Sprintf("(%s).%s", typ, obj.Name()) } else if len(typ) > 0 { name = fmt.Sprintf("%s.%s", typ, obj.Name()) } } } checkName := "U1000" if c.WholeProgram { checkName = "U1001" } return lint.Problem{ Pos: lint.DisplayPosition(fset, obj.Pos()), Message: fmt.Sprintf("%s %s is unused", typString(obj), name), Check: checkName, } } func (c *Checker) Result() []types.Object { out := c.results() out2 := make([]types.Object, 0, len(out)) for _, v := range out { if _, ok := c.initialPackages[v.Pkg()]; !ok { continue } out2 = append(out2, v) } return out2 } func (c *Checker) debugf(f string, v ...interface{}) { if c.Debug != nil { fmt.Fprintf(c.Debug, f, v...) } } func (graph *Graph) quieten(node *Node) { if node.seen { return } switch obj := node.obj.(type) { case *types.Named: for i := 0; i < obj.NumMethods(); i++ { m := obj.Method(i) if node, ok := graph.nodeMaybe(m); ok { node.quiet = true } } case *types.Struct: for i := 0; i < obj.NumFields(); i++ { if node, ok := graph.nodeMaybe(obj.Field(i)); ok { node.quiet = true } } case *types.Interface: for i := 0; i < obj.NumExplicitMethods(); i++ { m := obj.ExplicitMethod(i) if node, ok := graph.nodeMaybe(m); ok { node.quiet = true } } } } func (c *Checker) results() []types.Object { if c.graph == nil { // We never analyzed any packages return nil } var out []types.Object if c.WholeProgram { var ifaces []*types.Interface var notIfaces []types.Type // implement as many interfaces as possible c.graph.seenTypes.Iterate(func(t types.Type, _ interface{}) { switch t := t.(type) { case *types.Interface: if t.NumMethods() > 0 { ifaces = append(ifaces, t) } default: if _, ok := t.Underlying().(*types.Interface); !ok { notIfaces = append(notIfaces, t) } } }) for pkg := range c.allPackages { for _, iface := range interfacesFromExportData(pkg) { if iface.NumMethods() > 0 { ifaces = append(ifaces, iface) } } } ctx := &context{ g: c.graph, seenTypes: &c.graph.seenTypes, } // (8.0) handle interfaces // (e2) types aim to implement all exported interfaces from all packages for _, t := range notIfaces { // OPT(dh): it is unfortunate that we do not have access // to a populated method set at this point. ms := types.NewMethodSet(t) for _, iface := range ifaces { if sels, ok := c.graph.implements(t, iface, ms); ok { for _, sel := range sels { c.graph.useMethod(ctx, t, sel, t, edgeImplements) } } } } } if c.Debug != nil { debugNode := func(node *Node) { if node.obj == nil { c.debugf("n%d [label=\"Root\"];\n", node.id) } else { c.debugf("n%d [label=%q];\n", node.id, fmt.Sprintf("(%T) %s", node.obj, node.obj)) } for _, e := range node.used { for i := edgeKind(1); i < 64; i++ { if e.kind.is(1 << i) { c.debugf("n%d -> n%d [label=%q];\n", node.id, e.node.id, edgeKind(1<<i)) } } } } c.debugf("digraph{\n") debugNode(c.graph.Root) for _, v := range c.graph.Nodes { debugNode(v) } c.graph.TypeNodes.Iterate(func(key types.Type, value interface{}) { debugNode(value.(*Node)) }) c.debugf("}\n") } c.graph.color(c.graph.Root) // if a node is unused, don't report any of the node's // children as unused. for example, if a function is unused, // don't flag its receiver. if a named type is unused, don't // flag its methods. for _, v := range c.graph.Nodes { c.graph.quieten(v) } c.graph.TypeNodes.Iterate(func(_ types.Type, value interface{}) { c.graph.quieten(value.(*Node)) }) report := func(node *Node) { if node.seen { return } if node.quiet { c.debugf("n%d [color=purple];\n", node.id) return } c.debugf("n%d [color=red];\n", node.id) switch obj := node.obj.(type) { case *types.Var: // don't report unnamed variables (interface embedding) if obj.Name() != "" || obj.IsField() { out = append(out, obj) } return case types.Object: if obj.Name() != "_" { out = append(out, obj) } return } c.debugf("n%d [color=gray];\n", node.id) } for _, v := range c.graph.Nodes { report(v) } c.graph.TypeNodes.Iterate(func(_ types.Type, value interface{}) { report(value.(*Node)) }) return out } func (c *Checker) processPkg(graph *Graph, pkg *pkg) { if pkg.Pkg.Path() == "unsafe" { return } graph.entry(pkg) } func objNodeKeyFor(fset *token.FileSet, obj types.Object) objNodeKey { var kind objType switch obj.(type) { case *types.PkgName: kind = otPkgName case *types.Const: kind = otConst case *types.TypeName: kind = otTypeName case *types.Var: kind = otVar case *types.Func: kind = otFunc case *types.Label: kind = otLabel case *types.Builtin: kind = otBuiltin case *types.Nil: kind = otNil default: panic(fmt.Sprintf("unreachable: %T", obj)) } position := fset.PositionFor(obj.Pos(), false) position.Column = 0 position.Offset = 0 return objNodeKey{ position: position, kind: kind, name: obj.Name(), } } type objType uint8 const ( otPkgName objType = iota otConst otTypeName otVar otFunc otLabel otBuiltin otNil ) // An objNodeKey describes a types.Object node in the graph. // // Due to test variants we may end up with multiple instances of the // same object, which is why we have to deduplicate based on their // source position. And because export data lacks column information, // we also have to incorporate the object's string representation in // the key. // // Previously we used the object's full string representation // (types.ObjectString), but that causes a significant amount of // allocations. Currently we're using the object's type and name, in // the hope that it is impossible for two objects to have the same // type, name and file position. type objNodeKey struct { position token.Position kind objType name string } type Graph struct { // accessed atomically nodeOffset uint64 // Safe for concurrent use fset *token.FileSet Root *Node seenTypes typeutil.Map // read-only wholeProgram bool // need synchronisation mu sync.Mutex TypeNodes typeutil.Map Nodes map[interface{}]*Node objNodes map[objNodeKey]*Node } type context struct { g *Graph pkg *pkg seenFns map[string]struct{} seenTypes *typeutil.Map nodeCounter uint64 } func NewGraph() *Graph { g := &Graph{ Nodes: map[interface{}]*Node{}, objNodes: map[objNodeKey]*Node{}, } g.Root = g.newNode(&context{}, nil) return g } func (g *Graph) color(root *Node) { if root.seen { return } root.seen = true for _, e := range root.used { g.color(e.node) } } type ConstGroup struct { // give the struct a size to get unique pointers _ byte } func (ConstGroup) String() string { return "const group" } type edge struct { node *Node kind edgeKind } type Node struct { obj interface{} id uint64 mu sync.Mutex used []edge // set during final graph walk if node is reachable seen bool // a parent node (e.g. the struct type containing a field) is // already unused, don't report children quiet bool } func (g *Graph) nodeMaybe(obj types.Object) (*Node, bool) { g.mu.Lock() defer g.mu.Unlock() if node, ok := g.Nodes[obj]; ok { return node, true } return nil, false } func (g *Graph) node(ctx *context, obj interface{}) (node *Node, new bool) { g.mu.Lock() defer g.mu.Unlock() switch obj := obj.(type) { case types.Type: if v := g.TypeNodes.At(obj); v != nil { return v.(*Node), false } node := g.newNode(ctx, obj) g.TypeNodes.Set(obj, node) return node, true case types.Object: if node, ok := g.Nodes[obj]; ok { return node, false } key := objNodeKeyFor(g.fset, obj) if onode, ok := g.objNodes[key]; ok { return onode, false } node = g.newNode(ctx, obj) g.Nodes[obj] = node g.objNodes[key] = node return node, true default: if node, ok := g.Nodes[obj]; ok { return node, false } node = g.newNode(ctx, obj) g.Nodes[obj] = node return node, true } } func (g *Graph) newNode(ctx *context, obj interface{}) *Node { ctx.nodeCounter++ return &Node{ obj: obj, id: ctx.nodeCounter, } } func (n *Node) use(node *Node, kind edgeKind) { n.mu.Lock() defer n.mu.Unlock() assert(node != nil) n.used = append(n.used, edge{node: node, kind: kind}) } // isIrrelevant reports whether an object's presence in the graph is // of any relevance. A lot of objects will never have outgoing edges, // nor meaningful incoming ones. Examples are basic types and empty // signatures, among many others. // // Dropping these objects should have no effect on correctness, but // may improve performance. It also helps with debugging, as it // greatly reduces the size of the graph. func isIrrelevant(obj interface{}) bool { if obj, ok := obj.(types.Object); ok { switch obj := obj.(type) { case *types.Var: if obj.IsField() { // We need to track package fields return false } if obj.Pkg() != nil && obj.Parent() == obj.Pkg().Scope() { // We need to track package-level variables return false } return isIrrelevant(obj.Type()) default: return false } } if T, ok := obj.(types.Type); ok { switch T := T.(type) { case *types.Array: return isIrrelevant(T.Elem()) case *types.Slice: return isIrrelevant(T.Elem()) case *types.Basic: return true case *types.Tuple: for i := 0; i < T.Len(); i++ { if !isIrrelevant(T.At(i).Type()) { return false } } return true case *types.Signature: if T.Recv() != nil { return false } for i := 0; i < T.Params().Len(); i++ { if !isIrrelevant(T.Params().At(i)) { return false } } for i := 0; i < T.Results().Len(); i++ { if !isIrrelevant(T.Results().At(i)) { return false } } return true case *types.Interface: return T.NumMethods() == 0 && T.NumEmbeddeds() == 0 case *types.Pointer: return isIrrelevant(T.Elem()) case *types.Map: return isIrrelevant(T.Key()) && isIrrelevant(T.Elem()) case *types.Struct: return T.NumFields() == 0 case *types.Chan: return isIrrelevant(T.Elem()) default: return false } } return false } func (ctx *context) see(obj interface{}) *Node { if isIrrelevant(obj) { return nil } assert(obj != nil) // add new node to graph node, _ := ctx.g.node(ctx, obj) return node } func (ctx *context) use(used, by interface{}, kind edgeKind) { if isIrrelevant(used) { return } assert(used != nil) if obj, ok := by.(types.Object); ok && obj.Pkg() != nil { if !ctx.g.wholeProgram && obj.Pkg() != ctx.pkg.Pkg { return } } usedNode, new := ctx.g.node(ctx, used) assert(!new) if by == nil { ctx.g.Root.use(usedNode, kind) } else { byNode, new := ctx.g.node(ctx, by) assert(!new) byNode.use(usedNode, kind) } } func (ctx *context) seeAndUse(used, by interface{}, kind edgeKind) *Node { node := ctx.see(used) ctx.use(used, by, kind) return node } // trackExportedIdentifier reports whether obj should be considered // used due to being exported, checking various conditions that affect // the decision. func (g *Graph) trackExportedIdentifier(ctx *context, obj types.Object) bool { if !obj.Exported() { // object isn't exported, the question is moot return false } path := g.fset.Position(obj.Pos()).Filename if g.wholeProgram { // Example functions without "Output:" comments aren't being // run and thus don't show up in the graph. if strings.HasSuffix(path, "_test.go") && strings.HasPrefix(obj.Name(), "Example") { return true } // whole program mode tracks exported identifiers accurately return false } if ctx.pkg.Pkg.Name() == "main" && !strings.HasSuffix(path, "_test.go") { // exported identifiers in package main can't be imported. // However, test functions can be called, and xtest packages // even have access to exported identifiers. return false } if strings.HasSuffix(path, "_test.go") { if strings.HasPrefix(obj.Name(), "Test") || strings.HasPrefix(obj.Name(), "Benchmark") || strings.HasPrefix(obj.Name(), "Example") { return true } return false } return true } func (g *Graph) entry(pkg *pkg) { no := atomic.AddUint64(&g.nodeOffset, 1) ctx := &context{ g: g, pkg: pkg, nodeCounter: no * 1e9, seenFns: map[string]struct{}{}, } if g.wholeProgram { ctx.seenTypes = &g.seenTypes } else { ctx.seenTypes = &typeutil.Map{} } scopes := map[*types.Scope]*ir.Function{} for _, fn := range pkg.SrcFuncs { if fn.Object() != nil { scope := fn.Object().(*types.Func).Scope() scopes[scope] = fn } } for _, f := range pkg.Files { for _, cg := range f.Comments { for _, c := range cg.List { if strings.HasPrefix(c.Text, "//go:linkname ") { // FIXME(dh): we're looking at all comments. The // compiler only looks at comments in the // left-most column. The intention probably is to // only look at top-level comments. // (1.8) packages use symbols linked via go:linkname fields := strings.Fields(c.Text) if len(fields) == 3 { if m, ok := pkg.IR.Members[fields[1]]; ok { var obj types.Object switch m := m.(type) { case *ir.Global: obj = m.Object() case *ir.Function: obj = m.Object() default: panic(fmt.Sprintf("unhandled type: %T", m)) } assert(obj != nil) ctx.seeAndUse(obj, nil, edgeLinkname) } } } } } } surroundingFunc := func(obj types.Object) *ir.Function { scope := obj.Parent() for scope != nil { if fn := scopes[scope]; fn != nil { return fn } scope = scope.Parent() } return nil } // IR form won't tell us about locally scoped types that aren't // being used. Walk the list of Defs to get all named types. // // IR form also won't tell us about constants; use Defs and Uses // to determine which constants exist and which are being used. for _, obj := range pkg.TypesInfo.Defs { switch obj := obj.(type) { case *types.TypeName: // types are being handled by walking the AST case *types.Const: ctx.see(obj) fn := surroundingFunc(obj) if fn == nil && g.trackExportedIdentifier(ctx, obj) { // (1.4) packages use exported constants (unless in package main) ctx.use(obj, nil, edgeExportedConstant) } g.typ(ctx, obj.Type(), nil) ctx.seeAndUse(obj.Type(), obj, edgeType) } } // Find constants being used inside functions, find sinks in tests for _, fn := range pkg.SrcFuncs { if fn.Object() != nil { ctx.see(fn.Object()) } node := fn.Source() if node == nil { continue } ast.Inspect(node, func(node ast.Node) bool { switch node := node.(type) { case *ast.Ident: obj, ok := pkg.TypesInfo.Uses[node] if !ok { return true } switch obj := obj.(type) { case *types.Const: ctx.seeAndUse(obj, owningObject(fn), edgeUsedConstant) } case *ast.AssignStmt: for _, expr := range node.Lhs { ident, ok := expr.(*ast.Ident) if !ok { continue } obj := pkg.TypesInfo.ObjectOf(ident) if obj == nil { continue } path := g.fset.File(obj.Pos()).Name() if strings.HasSuffix(path, "_test.go") { if obj.Parent() != nil && obj.Parent().Parent() != nil && obj.Parent().Parent().Parent() == nil { // object's scope is the package, whose // parent is the file, whose parent is nil // (4.9) functions use package-level variables they assign to iff in tests (sinks for benchmarks) // (9.7) variable _reads_ use variables, writes do not, except in tests ctx.seeAndUse(obj, owningObject(fn), edgeTestSink) } } } } return true }) } // Find constants being used in non-function contexts for _, obj := range pkg.TypesInfo.Uses { _, ok := obj.(*types.Const) if !ok { continue } ctx.seeAndUse(obj, nil, edgeUsedConstant) } var fns []*types.Func var fn *types.Func var stack []ast.Node for _, f := range pkg.Files { ast.Inspect(f, func(n ast.Node) bool { if n == nil { pop := stack[len(stack)-1] stack = stack[:len(stack)-1] if _, ok := pop.(*ast.FuncDecl); ok { fns = fns[:len(fns)-1] if len(fns) == 0 { fn = nil } else { fn = fns[len(fns)-1] } } return true } stack = append(stack, n) switch n := n.(type) { case *ast.FuncDecl: fn = pkg.TypesInfo.ObjectOf(n.Name).(*types.Func) fns = append(fns, fn) ctx.see(fn) case *ast.GenDecl: switch n.Tok { case token.CONST: groups := code.GroupSpecs(pkg.Fset, n.Specs) for _, specs := range groups { if len(specs) > 1 { cg := &ConstGroup{} ctx.see(cg) for _, spec := range specs { for _, name := range spec.(*ast.ValueSpec).Names { obj := pkg.TypesInfo.ObjectOf(name) // (10.1) const groups ctx.seeAndUse(obj, cg, edgeConstGroup) ctx.use(cg, obj, edgeConstGroup) } } } } case token.VAR: for _, spec := range n.Specs { v := spec.(*ast.ValueSpec) for _, name := range v.Names { T := pkg.TypesInfo.TypeOf(name) if fn != nil { ctx.seeAndUse(T, fn, edgeVarDecl) } else { // TODO(dh): we likely want to make // the type used by the variable, not // the package containing the // variable. But then we have to take // special care of blank identifiers. ctx.seeAndUse(T, nil, edgeVarDecl) } g.typ(ctx, T, nil) } } case token.TYPE: for _, spec := range n.Specs { // go/types doesn't provide a way to go from a // types.Named to the named type it was based on // (the t1 in type t2 t1). Therefore we walk the // AST and process GenDecls. // // (2.2) named types use the type they're based on v := spec.(*ast.TypeSpec) T := pkg.TypesInfo.TypeOf(v.Type) obj := pkg.TypesInfo.ObjectOf(v.Name) ctx.see(obj) ctx.see(T) ctx.use(T, obj, edgeType) g.typ(ctx, obj.Type(), nil) g.typ(ctx, T, nil) if v.Assign != 0 { aliasFor := obj.(*types.TypeName).Type() // (2.3) named types use all their aliases. we can't easily track uses of aliases if isIrrelevant(aliasFor) { // We do not track the type this is an // alias for (for example builtins), so // just mark the alias used. // // FIXME(dh): what about aliases declared inside functions? ctx.use(obj, nil, edgeAlias) } else { ctx.see(aliasFor) ctx.seeAndUse(obj, aliasFor, edgeAlias) } } } } } return true }) } for _, m := range pkg.IR.Members { switch m := m.(type) { case *ir.NamedConst: // nothing to do, we collect all constants from Defs case *ir.Global: if m.Object() != nil { ctx.see(m.Object()) if g.trackExportedIdentifier(ctx, m.Object()) { // (1.3) packages use exported variables (unless in package main) ctx.use(m.Object(), nil, edgeExportedVariable) } } case *ir.Function: mObj := owningObject(m) if mObj != nil { ctx.see(mObj) } //lint:ignore SA9003 handled implicitly if m.Name() == "init" { // (1.5) packages use init functions // // This is handled implicitly. The generated init // function has no object, thus everything in it will // be owned by the package. } // This branch catches top-level functions, not methods. if m.Object() != nil && g.trackExportedIdentifier(ctx, m.Object()) { // (1.2) packages use exported functions (unless in package main) ctx.use(mObj, nil, edgeExportedFunction) } if m.Name() == "main" && pkg.Pkg.Name() == "main" { // (1.7) packages use the main function iff in the main package ctx.use(mObj, nil, edgeMainFunction) } if pkg.Pkg.Path() == "runtime" && runtimeFuncs[m.Name()] { // (9.8) runtime functions that may be called from user code via the compiler ctx.use(mObj, nil, edgeRuntimeFunction) } if m.Source() != nil { doc := m.Source().(*ast.FuncDecl).Doc if doc != nil { for _, cmt := range doc.List { if strings.HasPrefix(cmt.Text, "//go:cgo_export_") { // (1.6) packages use functions exported to cgo ctx.use(mObj, nil, edgeCgoExported) } } } } g.function(ctx, m) case *ir.Type: if m.Object() != nil { ctx.see(m.Object()) if g.trackExportedIdentifier(ctx, m.Object()) { // (1.1) packages use exported named types (unless in package main) ctx.use(m.Object(), nil, edgeExportedType) } } g.typ(ctx, m.Type(), nil) default: panic(fmt.Sprintf("unreachable: %T", m)) } } if !g.wholeProgram { // When not in whole program mode we reset seenTypes after each package, // which means g.seenTypes only contains types of // interest to us. In whole program mode, we're better off // processing all interfaces at once, globally, both for // performance reasons and because in whole program mode we // actually care about all interfaces, not just the subset // that has unexported methods. var ifaces []*types.Interface var notIfaces []types.Type ctx.seenTypes.Iterate(func(t types.Type, _ interface{}) { switch t := t.(type) { case *types.Interface: // OPT(dh): (8.1) we only need interfaces that have unexported methods ifaces = append(ifaces, t) default: if _, ok := t.Underlying().(*types.Interface); !ok { notIfaces = append(notIfaces, t) } } }) // (8.0) handle interfaces for _, t := range notIfaces { ms := pkg.IR.Prog.MethodSets.MethodSet(t) for _, iface := range ifaces { if sels, ok := g.implements(t, iface, ms); ok { for _, sel := range sels { g.useMethod(ctx, t, sel, t, edgeImplements) } } } } } } func (g *Graph) useMethod(ctx *context, t types.Type, sel *types.Selection, by interface{}, kind edgeKind) { obj := sel.Obj() path := sel.Index() assert(obj != nil) if len(path) > 1 { base := code.Dereference(t).Underlying().(*types.Struct) for _, idx := range path[:len(path)-1] { next := base.Field(idx) // (6.3) structs use embedded fields that help implement interfaces ctx.see(base) ctx.seeAndUse(next, base, edgeProvidesMethod) base, _ = code.Dereference(next.Type()).Underlying().(*types.Struct) } } ctx.seeAndUse(obj, by, kind) } func owningObject(fn *ir.Function) types.Object { if fn.Object() != nil { return fn.Object() } if fn.Parent() != nil { return owningObject(fn.Parent()) } return nil } func (g *Graph) function(ctx *context, fn *ir.Function) { if fn.Package() != nil && fn.Package() != ctx.pkg.IR { return } name := fn.RelString(nil) if _, ok := ctx.seenFns[name]; ok { return } ctx.seenFns[name] = struct{}{} // (4.1) functions use all their arguments, return parameters and receivers g.signature(ctx, fn.Signature, owningObject(fn)) g.instructions(ctx, fn) for _, anon := range fn.AnonFuncs { // (4.2) functions use anonymous functions defined beneath them // // This fact is expressed implicitly. Anonymous functions have // no types.Object, so their owner is the surrounding // function. g.function(ctx, anon) } } func (g *Graph) typ(ctx *context, t types.Type, parent types.Type) { if g.wholeProgram { g.mu.Lock() } if ctx.seenTypes.At(t) != nil { if g.wholeProgram { g.mu.Unlock() } return } if g.wholeProgram { g.mu.Unlock() } if t, ok := t.(*types.Named); ok && t.Obj().Pkg() != nil { if t.Obj().Pkg() != ctx.pkg.Pkg { return } } if g.wholeProgram { g.mu.Lock() } ctx.seenTypes.Set(t, struct{}{}) if g.wholeProgram { g.mu.Unlock() } if isIrrelevant(t) { return } ctx.see(t) switch t := t.(type) { case *types.Struct: for i := 0; i < t.NumFields(); i++ { ctx.see(t.Field(i)) if t.Field(i).Exported() { // (6.2) structs use exported fields ctx.use(t.Field(i), t, edgeExportedField) } else if t.Field(i).Name() == "_" { ctx.use(t.Field(i), t, edgeBlankField) } else if isNoCopyType(t.Field(i).Type()) { // (6.1) structs use fields of type NoCopy sentinel ctx.use(t.Field(i), t, edgeNoCopySentinel) } else if parent == nil { // (11.1) anonymous struct types use all their fields. ctx.use(t.Field(i), t, edgeAnonymousStruct) } if t.Field(i).Anonymous() { // (e3) exported identifiers aren't automatically used. if !g.wholeProgram { // does the embedded field contribute exported methods to the method set? T := t.Field(i).Type() if _, ok := T.Underlying().(*types.Pointer); !ok { // An embedded field is addressable, so check // the pointer type to get the full method set T = types.NewPointer(T) } ms := ctx.pkg.IR.Prog.MethodSets.MethodSet(T) for j := 0; j < ms.Len(); j++ { if ms.At(j).Obj().Exported() { // (6.4) structs use embedded fields that have exported methods (recursively) ctx.use(t.Field(i), t, edgeExtendsExportedMethodSet) break } } } seen := map[*types.Struct]struct{}{} var hasExportedField func(t types.Type) bool hasExportedField = func(T types.Type) bool { t, ok := code.Dereference(T).Underlying().(*types.Struct) if !ok { return false } if _, ok := seen[t]; ok { return false } seen[t] = struct{}{} for i := 0; i < t.NumFields(); i++ { field := t.Field(i) if field.Exported() { return true } if field.Embedded() && hasExportedField(field.Type()) { return true } } return false } // does the embedded field contribute exported fields? if hasExportedField(t.Field(i).Type()) { // (6.5) structs use embedded structs that have exported fields (recursively) ctx.use(t.Field(i), t, edgeExtendsExportedFields) } } g.variable(ctx, t.Field(i)) } case *types.Basic: // Nothing to do case *types.Named: // (9.3) types use their underlying and element types ctx.seeAndUse(t.Underlying(), t, edgeUnderlyingType) ctx.seeAndUse(t.Obj(), t, edgeTypeName) ctx.seeAndUse(t, t.Obj(), edgeNamedType) // (2.4) named types use the pointer type if _, ok := t.Underlying().(*types.Interface); !ok && t.NumMethods() > 0 { ctx.seeAndUse(types.NewPointer(t), t, edgePointerType) } for i := 0; i < t.NumMethods(); i++ { ctx.see(t.Method(i)) // don't use trackExportedIdentifier here, we care about // all exported methods, even in package main or in tests. if t.Method(i).Exported() && !g.wholeProgram { // (2.1) named types use exported methods ctx.use(t.Method(i), t, edgeExportedMethod) } g.function(ctx, ctx.pkg.IR.Prog.FuncValue(t.Method(i))) } g.typ(ctx, t.Underlying(), t) case *types.Slice: // (9.3) types use their underlying and element types ctx.seeAndUse(t.Elem(), t, edgeElementType) g.typ(ctx, t.Elem(), nil) case *types.Map: // (9.3) types use their underlying and element types ctx.seeAndUse(t.Elem(), t, edgeElementType) // (9.3) types use their underlying and element types ctx.seeAndUse(t.Key(), t, edgeKeyType) g.typ(ctx, t.Elem(), nil) g.typ(ctx, t.Key(), nil) case *types.Signature: g.signature(ctx, t, nil) case *types.Interface: for i := 0; i < t.NumMethods(); i++ { m := t.Method(i) // (8.3) All interface methods are marked as used ctx.seeAndUse(m, t, edgeInterfaceMethod) ctx.seeAndUse(m.Type().(*types.Signature), m, edgeSignature) g.signature(ctx, m.Type().(*types.Signature), nil) } for i := 0; i < t.NumEmbeddeds(); i++ { tt := t.EmbeddedType(i) // (8.4) All embedded interfaces are marked as used ctx.seeAndUse(tt, t, edgeEmbeddedInterface) } case *types.Array: // (9.3) types use their underlying and element types ctx.seeAndUse(t.Elem(), t, edgeElementType) g.typ(ctx, t.Elem(), nil) case *types.Pointer: // (9.3) types use their underlying and element types ctx.seeAndUse(t.Elem(), t, edgeElementType) g.typ(ctx, t.Elem(), nil) case *types.Chan: // (9.3) types use their underlying and element types ctx.seeAndUse(t.Elem(), t, edgeElementType) g.typ(ctx, t.Elem(), nil) case *types.Tuple: for i := 0; i < t.Len(); i++ { // (9.3) types use their underlying and element types ctx.seeAndUse(t.At(i).Type(), t, edgeTupleElement|edgeType) g.typ(ctx, t.At(i).Type(), nil) } default: panic(fmt.Sprintf("unreachable: %T", t)) } } func (g *Graph) variable(ctx *context, v *types.Var) { // (9.2) variables use their types ctx.seeAndUse(v.Type(), v, edgeType) g.typ(ctx, v.Type(), nil) } func (g *Graph) signature(ctx *context, sig *types.Signature, fn types.Object) { var user interface{} = fn if fn == nil { user = sig ctx.see(sig) } if sig.Recv() != nil { ctx.seeAndUse(sig.Recv().Type(), user, edgeReceiver|edgeType) g.typ(ctx, sig.Recv().Type(), nil) } for i := 0; i < sig.Params().Len(); i++ { param := sig.Params().At(i) ctx.seeAndUse(param.Type(), user, edgeFunctionArgument|edgeType) g.typ(ctx, param.Type(), nil) } for i := 0; i < sig.Results().Len(); i++ { param := sig.Results().At(i) ctx.seeAndUse(param.Type(), user, edgeFunctionResult|edgeType) g.typ(ctx, param.Type(), nil) } } func (g *Graph) instructions(ctx *context, fn *ir.Function) { fnObj := owningObject(fn) for _, b := range fn.Blocks { for _, instr := range b.Instrs { ops := instr.Operands(nil) switch instr.(type) { case *ir.Store: // (9.7) variable _reads_ use variables, writes do not ops = ops[1:] case *ir.DebugRef: ops = nil } for _, arg := range ops { walkPhi(*arg, func(v ir.Value) { switch v := v.(type) { case *ir.Function: // (4.3) functions use closures and bound methods. // (4.5) functions use functions they call // (9.5) instructions use their operands // (4.4) functions use functions they return. we assume that someone else will call the returned function if owningObject(v) != nil { ctx.seeAndUse(owningObject(v), fnObj, edgeInstructionOperand) } g.function(ctx, v) case *ir.Const: // (9.6) instructions use their operands' types ctx.seeAndUse(v.Type(), fnObj, edgeType) g.typ(ctx, v.Type(), nil) case *ir.Global: if v.Object() != nil { // (9.5) instructions use their operands ctx.seeAndUse(v.Object(), fnObj, edgeInstructionOperand) } } }) } if v, ok := instr.(ir.Value); ok { if _, ok := v.(*ir.Range); !ok { // See https://github.com/golang/go/issues/19670 // (4.8) instructions use their types // (9.4) conversions use the type they convert to ctx.seeAndUse(v.Type(), fnObj, edgeType) g.typ(ctx, v.Type(), nil) } } switch instr := instr.(type) { case *ir.Field: st := instr.X.Type().Underlying().(*types.Struct) field := st.Field(instr.Field) // (4.7) functions use fields they access ctx.seeAndUse(field, fnObj, edgeFieldAccess) case *ir.FieldAddr: st := code.Dereference(instr.X.Type()).Underlying().(*types.Struct) field := st.Field(instr.Field) // (4.7) functions use fields they access ctx.seeAndUse(field, fnObj, edgeFieldAccess) case *ir.Store: // nothing to do, handled generically by operands case *ir.Call: c := instr.Common() if !c.IsInvoke() { // handled generically as an instruction operand if g.wholeProgram { // (e3) special case known reflection-based method callers switch code.CallName(c) { case "net/rpc.Register", "net/rpc.RegisterName", "(*net/rpc.Server).Register", "(*net/rpc.Server).RegisterName": var arg ir.Value switch code.CallName(c) { case "net/rpc.Register": arg = c.Args[0] case "net/rpc.RegisterName": arg = c.Args[1] case "(*net/rpc.Server).Register": arg = c.Args[1] case "(*net/rpc.Server).RegisterName": arg = c.Args[2] } walkPhi(arg, func(v ir.Value) { if v, ok := v.(*ir.MakeInterface); ok { walkPhi(v.X, func(vv ir.Value) { ms := ctx.pkg.IR.Prog.MethodSets.MethodSet(vv.Type()) for i := 0; i < ms.Len(); i++ { if ms.At(i).Obj().Exported() { g.useMethod(ctx, vv.Type(), ms.At(i), fnObj, edgeNetRPCRegister) } } }) } }) } } } else { // (4.5) functions use functions/interface methods they call ctx.seeAndUse(c.Method, fnObj, edgeInterfaceCall) } case *ir.Return: // nothing to do, handled generically by operands case *ir.ChangeType: // conversion type handled generically s1, ok1 := code.Dereference(instr.Type()).Underlying().(*types.Struct) s2, ok2 := code.Dereference(instr.X.Type()).Underlying().(*types.Struct) if ok1 && ok2 { // Converting between two structs. The fields are // relevant for the conversion, but only if the // fields are also used outside of the conversion. // Mark fields as used by each other. assert(s1.NumFields() == s2.NumFields()) for i := 0; i < s1.NumFields(); i++ { ctx.see(s1.Field(i)) ctx.see(s2.Field(i)) // (5.1) when converting between two equivalent structs, the fields in // either struct use each other. the fields are relevant for the // conversion, but only if the fields are also accessed outside the // conversion. ctx.seeAndUse(s1.Field(i), s2.Field(i), edgeStructConversion) ctx.seeAndUse(s2.Field(i), s1.Field(i), edgeStructConversion) } } case *ir.MakeInterface: // nothing to do, handled generically by operands case *ir.Slice: // nothing to do, handled generically by operands case *ir.RunDefers: // nothing to do, the deferred functions are already marked use by defering them. case *ir.Convert: // to unsafe.Pointer if typ, ok := instr.Type().(*types.Basic); ok && typ.Kind() == types.UnsafePointer { if ptr, ok := instr.X.Type().Underlying().(*types.Pointer); ok { if st, ok := ptr.Elem().Underlying().(*types.Struct); ok { for i := 0; i < st.NumFields(); i++ { // (5.2) when converting to or from unsafe.Pointer, mark all fields as used. ctx.seeAndUse(st.Field(i), fnObj, edgeUnsafeConversion) } } } } // from unsafe.Pointer if typ, ok := instr.X.Type().(*types.Basic); ok && typ.Kind() == types.UnsafePointer { if ptr, ok := instr.Type().Underlying().(*types.Pointer); ok { if st, ok := ptr.Elem().Underlying().(*types.Struct); ok { for i := 0; i < st.NumFields(); i++ { // (5.2) when converting to or from unsafe.Pointer, mark all fields as used. ctx.seeAndUse(st.Field(i), fnObj, edgeUnsafeConversion) } } } } case *ir.TypeAssert: // nothing to do, handled generically by instruction // type (possibly a tuple, which contains the asserted // to type). redundantly handled by the type of // ir.Extract, too case *ir.MakeClosure: // nothing to do, handled generically by operands case *ir.Alloc: // nothing to do case *ir.UnOp: // nothing to do case *ir.BinOp: // nothing to do case *ir.If: // nothing to do case *ir.Jump: // nothing to do case *ir.Unreachable: // nothing to do case *ir.IndexAddr: // nothing to do case *ir.Extract: // nothing to do case *ir.Panic: // nothing to do case *ir.DebugRef: // nothing to do case *ir.BlankStore: // nothing to do case *ir.Phi: // nothing to do case *ir.Sigma: // nothing to do case *ir.MakeMap: // nothing to do case *ir.MapUpdate: // nothing to do case *ir.MapLookup: // nothing to do case *ir.StringLookup: // nothing to do case *ir.MakeSlice: // nothing to do case *ir.Send: // nothing to do case *ir.MakeChan: // nothing to do case *ir.Range: // nothing to do case *ir.Next: // nothing to do case *ir.Index: // nothing to do case *ir.Select: // nothing to do case *ir.ChangeInterface: // nothing to do case *ir.Load: // nothing to do case *ir.Go: // nothing to do case *ir.Defer: // nothing to do case *ir.Parameter: // nothing to do case *ir.Const: // nothing to do case *ir.Recv: // nothing to do case *ir.TypeSwitch: // nothing to do case *ir.ConstantSwitch: // nothing to do default: panic(fmt.Sprintf("unreachable: %T", instr)) } } } } // isNoCopyType reports whether a type represents the NoCopy sentinel // type. The NoCopy type is a named struct with no fields and exactly // one method `func Lock()` that is empty. // // FIXME(dh): currently we're not checking that the function body is // empty. func isNoCopyType(typ types.Type) bool { st, ok := typ.Underlying().(*types.Struct) if !ok { return false } if st.NumFields() != 0 { return false } named, ok := typ.(*types.Named) if !ok { return false } if named.NumMethods() != 1 { return false } meth := named.Method(0) if meth.Name() != "Lock" { return false } sig := meth.Type().(*types.Signature) if sig.Params().Len() != 0 || sig.Results().Len() != 0 { return false } return true } func walkPhi(v ir.Value, fn func(v ir.Value)) { phi, ok := v.(*ir.Phi) if !ok { fn(v) return } seen := map[ir.Value]struct{}{} var impl func(v *ir.Phi) impl = func(v *ir.Phi) { if _, ok := seen[v]; ok { return } seen[v] = struct{}{} for _, e := range v.Edges { if ev, ok := e.(*ir.Phi); ok { impl(ev) } else { fn(e) } } } impl(phi) } func interfacesFromExportData(pkg *types.Package) []*types.Interface { var out []*types.Interface scope := pkg.Scope() for _, name := range scope.Names() { obj := scope.Lookup(name) out = append(out, interfacesFromObject(obj)...) } return out } func interfacesFromObject(obj types.Object) []*types.Interface { var out []*types.Interface switch obj := obj.(type) { case *types.Func: sig := obj.Type().(*types.Signature) for i := 0; i < sig.Results().Len(); i++ { out = append(out, interfacesFromObject(sig.Results().At(i))...) } for i := 0; i < sig.Params().Len(); i++ { out = append(out, interfacesFromObject(sig.Params().At(i))...) } case *types.TypeName: if named, ok := obj.Type().(*types.Named); ok { for i := 0; i < named.NumMethods(); i++ { out = append(out, interfacesFromObject(named.Method(i))...) } if iface, ok := named.Underlying().(*types.Interface); ok { out = append(out, iface) } } case *types.Var: // No call to Underlying here. We want unnamed interfaces // only. Named interfaces are gotten directly from the // package's scope. if iface, ok := obj.Type().(*types.Interface); ok { out = append(out, iface) } case *types.Const: case *types.Builtin: default: panic(fmt.Sprintf("unhandled type: %T", obj)) } return out }