Library hw06_divisibility
Require Import ZArith.
Require Import Znumtheory.
Section Homework6_Problems.
Open Scope Z_scope.
See Theorem1 (i), p.252 in the textbook
Lemma sample6_1: forall a b c:Z, (a | b) -> (a | c) -> (a | b+c).
Proof.
Admitted.
Proof.
Admitted.
See Theorem1 (ii), p.252 in the textbook
Lemma sample6_2: forall a b c:Z, (a | b) -> (a | b*c).
Proof.
Admitted.
Proof.
Admitted.
See Theorem1 (iii), p.252 in the textbook
Lemma sample6_3: forall a b c: Z, (a | b) -> (b | c) -> (a | c).
Proof.
Admitted.
Proof.
Admitted.
See Theorem4, p.255 in the textbook
Lemma sample6_4_helper: forall a b m: Z, (m <> 0) ->
((a mod m) = (b mod m) -> (m | a - b)).
Proof.
Admitted.
Lemma sample6_4: forall a b m: Z, (m <> 0) ->
((a mod m) = (b mod m) <-> (exists k:Z, a = b+k*m)).
Proof.
Admitted.
Lemma sample6_5 : forall a b c : Z, (a|b) \/ (a|c) -> (a| b*c).
Proof.
Admitted.
((a mod m) = (b mod m) -> (m | a - b)).
Proof.
Admitted.
Lemma sample6_4: forall a b m: Z, (m <> 0) ->
((a mod m) = (b mod m) <-> (exists k:Z, a = b+k*m)).
Proof.
Admitted.
Lemma sample6_5 : forall a b c : Z, (a|b) \/ (a|c) -> (a| b*c).
Proof.
Admitted.
Corollary divide_lincombination:
forall a b c m n, (a | b) /\ (a | c) -> (a | m*b + n*c).
Proof.
Admitted.
Close Scope Z_scope.
End Homework6_Problems.


Come See Us
Where History Makes Quality
of Life
Education
Culture
Commerce
A totally civilized community.


Static typed programming languages are those in which variables need not be defined before they’re used.
/************************************ C code ************************************/
int num, sum; // explicit declaration
num = 5; // now use the variables
sum = 10;
sum = sum + num;
Dynamic typed programming languages are those languages in which variables must necessarily be defined before they are used.
//************************************ ruby code ***********************************/
num = 10 // directly using the variable
Programming languages in which variables have specific data types are strong typed.
/************************************ ruby code ************************************/
>>foo = "x"
>>foo = foo + 2
TypeError: can't convert Fixnum into String
from (irb):7:in `+'
from (irb):7
/* ruby code */
>>foo = "x"
>>foo = foo + "y"
>>puts foo
>>xy
As opposed to strong typed languages, weak typed languages are those in which variables are not of a specific data type.
/*********************************** PHP code ***********************************/
O/P => 2
Both terms are very generic, one containing the other one and vice versa in some cases.
Web server:
serves content to the web using http protocol.
Application server:
hosts and exposes business logic and processes.
The source code is included with the compiled version and modification or customization is actually encouraged. The software developers who support the open source concept believe that by allowing anyone who's interested to modify the source code, the application will be more useful and error-free over the long term.
To be considered as open source software by the software development industry, certain criteria must be met:
Ruby is an interpreted scripting language that is used for easy, quick and scalable object-oriented programming.
Philosophy of Ruby:-
Matsumoto has said that Ruby is designed for programmer productivity and fun, following the principles of good user interface design. He stresses that systems design needs to emphasize human, rather than computer, needs.”
Quick and Easy
Variable declarations are unnecessary.
Variables are not typed.
Syntax is simple and consistent.
Memory management is automatic.
Defining and undefining the methods
def name (parameters)
body // the last value is the returned value
end
To remove a method;
undef name
To add an instance method to an existing class, first “open” the class
class String
def nchars
length
end
end
Class and object methods
#To add a class method while inside the Person class:
def self.species
‘human’
end
#To add a class method from elsewhere:
def Person.species
‘human’
end
#To add a method to an individual object:
def oscar.mood
‘grouchy’
end
Declaring methods
class MyClass
def square
#public method accessible by all classes
return true
end
private
def foo
#its a private method accessible in this class only
end
protected
def add
#protected method accessible by child classes
return true
end
end
Instantiating objects
Suppose you want to instantiate an object of YourClass in MyClass
class MyClass
end
myClass= MyClass.new
Defining the methods
function functionName()
{
code to be executed;
}
To add more functionality to a function, we can add parameters. A parameter is just like a variable. Parameters are specified after the function name, inside the parentheses.
function functionName(@a, @b)
{
code to be executed;
}
Defining class
class User
{
public $name;
public $age;
public function describe()
{
return $this->name . " is " . $this->age . " years old";
}
}
Instantiating objects
Suppose you want to instantiate an object of YourClass in MyClass
class User
{
public $name;
public $age;
public function describe()
{
return $this->name . " is " . $this->age . " years old";
}
}
$user = new User();
Java is: platform independent programming language similar to C++ in syntax similar to Smalltalk in mental paradigm.
Features of Java
Syntax to write a class
public class MyClass {
//your memeber variables
//your methods
public static void main(String args[]){
//main code.
}
}
Declaring member variables
public class MyClass{
String myString; //default scope
private Long myLong; //private access specifier
protected Integer myInteger; //protected access specifier
public Double myDouble;//public access specifier
}
Declaring methods
public class MyClass{
String myString; //default scope
private Long myLong; //private access specifier
protected Integer myInteger; //protected access specifier
public Double myDouble;//public access specifier
private void foo(){
//its a private method accessible in this class only
}
protected Long add(){
//protected method accessible by child classes returning a long
return myLong;
}
public Double square(){
//public method accessible by al;l classes returning a long
return myDouble
}
}
Instantiating objects
Suppose you want to instantiate an object of YourClass in MyClass
package com.mycompany.myproject.mypackage
public class MyClass
{
YourClass yourClass= new YourClass();
}
eg:MyClass,YourClass
com.mycompany.myproject.mypackage


WITNESS LIST Revenue & Public Education Funding, Select Committee April 22, 1998-10:00A Property Tax On: Wooten, Tim (Comptroller's Office) State Tax Policy On: Allaway, Bill (TTARA) Howden, Robert (NFIB/ Texas) James, Reggie (Consumers Union, SW Reg) Lavine, Richard (Cntr for Pub Pol Prior) Smith, Ray (McManenin & Smith P.C.)


Redheaded Guys Who Are Not The Hero Of Star Wars Jedi: Fallen Order, Ranked
by Maddy Myers1. Fry
2. Ron Weasley
3. Chuckie Finster
4. Chucky
5. Patrick Redford
6. Bobby Axelrod
7. Richie Cunningham
8. Scut Farkus
9. Alfred E. Neuman
10. Archie Andrews
11. General Armitage Hux
12. Jimmy Olsen
13. Getting hit by a car
14. The villain on Gotham who is clearly The Joker but can’t be called that by name because of rights issues


--- layout: post title: "Advance Ruby Leaning link" date: 2010-01-01 09:44:00 categories: ruby subcategory: beginner ---


Currently the wizard supports main and secondary content. This example shows how to add the latter.
It's possible to add any content as secondary content, just create a component with the content you want to add and
extend it using the SecondaryContentComponent
class. Once you've done that it's just a matter of hooking
it up with your step and optionally pass some data to it.
We're creating a component called additional content which contains a content box and a moc chart.
We're adding it to this step we're currently on.


2014-02-20 To L.
it went off
she is not here
she is not now and she has not been
she could be dead right now
or have been
you were talking with pixels
with a screen
it was a recording
in its due time
time
Hi L.,
The phone just went off and I wanted to continue talking to you. For this reason, I am writing (by hand, obviously).
The first thing that came to mind was the verses you just read. That is why they are the first written thing, it is a reliable and chronological representation of the handwritten sheet of paper.
At the time the phone was turned off, I was close to feeling anxiety and concern that I could not continue talking to you. But now I’m doing it. I feel like I’m communicating with you. I feel better. I have simply had to overcome the first instinct of inactivity or search for technological contact with you. I have started writing.
Even if I am writing this letter at night, you may read it tomorrow, in a week, or in a month. When I want to send it to you, if I send it to you. You may reread it in years and each time it will be different for you. You will be able to read this letter if I die before you and it will appear that I am speaking to you. (This is how I just beat death. This letter is my song … (Tweet in English. Food for thought, isn’t it?))
Poetic parenthesis.
… And I will leave. And the birds will stay
singing;
and my garden will remain, with its green tree,
and with its white well.
Every afternoon the sky will be blue and placid;
and they will play, as they are playing this afternoon,
the bells of the bell tower.
Those who loved me will die;
and the town will become new every year;
and in the corner, that of my flowery and whitewashed garden.
my spirit will wander, nostalgic …
And I will go away; and I’ll be alone, homeless, treeless
green, without white well,
without blue and placid sky …
And the birds will stay, singing.
Wild poems (1910-1911). Juan Ramón Jiménez. (Jiménez 1970)
This is what technology has demolished. Haste has wiped out patience. The wait, the tasting of the moment, the pleasure of the non-immediate … The enjoyment of one’s own personality, of internal communication. Ultimately, life itself.
I don’t want to continue writing, so you start doing it. But this little letter/reflection is clear proof of the benefits of writing and the harmfulness of digitized communication. In a few lines and almost without arguments.
Now, I start reading. I’m much more relaxed than I was five minutes ago when the phone went off. Also, writing this seems much more real to me than sending you a WhatsApp : “* I’m fine*”. Although it will take days, hours or years to send it to you, or you to read it, for me it has been much more immediate than a WhatsApp.
Good night.
A huge hug.
P.S. You know I would like to hear from you. (General and extremely open question that you can answer with the degree of detail and specificity that you want). If you want to just write to me that you are fine, I will believe it and continue my life placidly. Taking advantage of my time knowing that L. is happy. Lying to me is lying to yourself.
References
Jiménez, Juan Ramón. 1970. Tercera Antolojı́a Poética (1898-1953). Vol. 2. Editorial Biblioteca Nueva.


Interface: tos.chips.rf230.TrafficMonitorConfig
interface TrafficMonitorConfigCommands
command uint16_t getChannelTime(message_t *msg)
command am_addr_t getSender(message_t *msg)
command uint16_t getUpdatePeriod()
command void timerTick()
Events
event void channelError()
event uint8_t getErrorAverage()
event uint8_t getNeighborAverage()
event uint16_t getReceiveAverage()
event uint16_t getTransmitAverage()
Commands - Details
getChannelTime
command uint16_t getChannelTime(message_t *msg)
getSender
command am_addr_t getSender(message_t *msg)
getUpdatePeriod
command uint16_t getUpdatePeriod()
timerTick
command void timerTick()
Events - Details
channelError
event void channelError()
getErrorAverage
event uint8_t getErrorAverage()
getNeighborAverage
event uint8_t getNeighborAverage()
getReceiveAverage
event uint16_t getReceiveAverage()
getTransmitAverage
event uint16_t getTransmitAverage()


The Adventures of Jerry Muskrat
by Thornton W. Burgess
Chapter 12: “A Hunt for Trouble”
Additional Information
- Year Published: 1914
- Language: English
- Country of Origin: United States of America
- Source: Burgess, T.W. (1914). The Adventures of Jerry Muskrat.
-
Readability:
- Flesch–Kincaid Level: 5.5
- Word Count: 565
- Genre: Fantasy
- ✎ Cite This
Downloads
Ol’ Mistah Buzzard, sailing high in the blue, blue sky, looked down on a funny sight. Yes, Sir, it certainly was a funny sight. It was a little procession of five of his friends of the Smiling Pool. First was Billy Mink, who, because he is slim and nimble, moves so quickly it sometimes is hard to follow him. Behind him was Little Joe Otter, whose legs are so short that he almost looks as if he hadn’t any. Behind Little Joe was Jerry Muskrat, who is a better traveler in the water than on land. Behind Jerry was Grandfather Frog, who neither walks nor runs but travels with great jumps. Last of all was Spotty the Turtle, who travels very, very slowly because, you know, he carries his house with him. And all five were headed up the Laughing Brook, which laughed no more, because there was not water enough in it.
Now Ol’ Mistah Buzzard hadn’t been over near the Smiling Pool for some time, and he hadn’t heard how the Smiling Pool had stopped smiling, and the Laughing Brook had stopped laughing. When he looked down and saw how the water was so nearly gone from them that the trout and the minnows had hardly enough in which to live, he was so surprised that he kept saying over and over to himself:
“Fo’ the lan’s sake! Fo’ the lan’s sake!”
Then, when he saw his five little friends marching up the Laughing Brook, he guessed right away that it must be something to do with the trouble in the Smiling Pool. Ol’ Mistah Buzzard just turned his broad wings and slid down, down out of the blue, blue sky until he was right over Grandfather Frog.
“Where are yo’alls going?” asked Ol’ Mistah Buzzard.
“Chugarum! To find out what is the trouble with the Laughing Brook,” replied Grandfather Frog.
“I’ll help you,” said Ol’ Mistah Buzzard, once more sailing up in the blue, blue sky.
Grandfather Frog watched him until he was nothing but a speck. “I wish I had wings,” sighed Grandfather Frog, and once more began to hop along up the bed of the Laughing Brook.
The Laughing Brook came down from the Green Forest and wound through the Green Meadows for a little way before it reached the Smiling Pool. There the sun shone down into it, and Grandfather Frog didn’t mind, although his legs were getting tired. But when they got into the Green Forest it was dark and gloomy. At least Grandfather Frog thought so, and so did Spotty the Turtle, for both dearly love the sunshine. But still they kept on, for they felt that they must find the trouble with the Laughing Brook. If they found this, they would also find the trouble with the Smiling Pool.
So Billy Mink jumped and skipped far ahead; Little Joe Otter ran; Jerry Muskrat walked, for he soon gets tired on land; Grandfather Frog hopped; Spotty the Turtle crawled, and way, way up in the blue, blue sky, Ol’ Mistah Buzzard flew, all looking for the trouble which had stopped the laughing of the Laughing Brook and the smiling of the Smiling Pool.


Academy Admirers
रेकमेंडेड भवः
Home
Report Error
Instructions
Total Number of Questions:
Start Quiz
Next
Quiz Results
Total Questions
Attempts
Correct
Wrong
Percentage
Your Total Score
Try Again
Finish


Welcome to the wonderful world of computers! You are currently using a program called w3m to view this document. To exit this program, press q to quit then y to confirm. Use the arrow keys to move around, and press Enter to select a link. This is a link: click this now. You can press the Tab key to jump from one link to the next link very quickly, then press Enter to click the link.
| Where to start | Start here to learn how to use this Linux computer |
| Programming | Once you know how to us Linux, start learning to program this computer |


℉
℃
Designed and coded by
Andre' Jarboe II
Weather API by
Free Code Camp
Icons by
Lukas Bischoff
and
Weather-icons


CSCI2254 Web Application Development
The web connects our society, providing enormous opportunities for changing and improving how we live every day from sharing information to interacting with others. We have witnessed the power of the web through a variety of web-based applications, including social media apps like Instagram and Twitter, productivity apps like Google Docs and Slack, as well as transportation apps like Uber and Lyft. These apps are now deeply emersed in our everyday lives and drastically changed how we communicate, work and move in recent years.
In this course, students will learn how to develop responsive and interactive web applications. We begin by learning basics including HTML, CSS, Javascript, as well as advanced client-side frameworks such as Material-UI and React.js. We will also briefly touch on server-side issues including a web server (Node.js), data storages (Web Storage, MongoDB, and Firebase), and asynchronous communication between a client and a server. The course will culminate with a final project where students take a human-centered design approach to address the need of people by building a sophisticated web application.
Time: MoWe 4:30-5:45 pm
Location: Carney 303
Submission: Canvas
Q & A: Piazza
Prerequisites
CSCI 1101 (CS I) + Strong enthusiasm for developing useful apps for people! Independence and willingness to take the initiative to learn and spend extra time to study on your own. The course can give you a structure but cannot cover all minor details.
Textbooks
There is no required textbook. Reading materials will be available online.
Teaching Staff
Instructor: Nam Wook Kim
Office: St. Mary's Hall S256
Office Hour: MoWe 5:45-6:45 pm, reserve a 15 min slot at least 30 min in advance.
Teaching Assistant: Tiffany Wang
Teaching Assistant: Pedro De Almeida Rosa Guimaraes
If you want to communicate with the course staff, please make a private Piazza post by selecting Post to: Instructors and entering Instructors.
Learning Objectives
By the end of this course, students will be able to:
Schedule
Logistics
Lectures & Labs
Most classes are structured with a brief lecture on the technical knowledge and a workshop-like lab in which the instructor provides a live coding demo and students follow the demo. Please bring laptops to all lab-based classes.
Readings & Quizzes
Each class will assume that you have completed pre-class readings. There will be quizzes due before the class to test your readings.
Weekly Assignments
Each weekly assignment will build up towards one of the following projects:
1. Portfolio websiteYou will use vanilla HTML, CSS, and Javascript to build your personal Portfolio website.
2. Social Media appYou will use advanced web development frameworks such as React to build a simple social media app.
3. Final ProjectYou will follow a human-centered design process to identify an interesting problem faced by people and build a web-based application to address the need.
Grading
A student’s grade will be based on:
- Participation - 5%
- Quizzes - 20% (5 lowest scored quizzes will be dropped)
- Portfolio website 15%
- Social media app 25%
- Final Project - 35%
A letter grade is assigned based on the following guideline (A is excellent; B is good; C is satisfactory; D is passing but unsatisfactory; F is failure):
- A: 100-94%; A-: 90-94%
- B+: 87-90%; B: 84-87%; B-: 80-84%
- C+: 77-80%; C: 74-77%; C-: 70-74%
- D+: 67-70%; D: 64-67%: D-: 61-64%
- F < 61%
Policies & Practices
Course Policy
Laptop policy
Bring laptops to all class meetings. However, students may not use laptops, tablets, phones or other electronic devices during lectures, especially in guest lectures, unless explicitly asked to do so.
Attendance
Attendance is not tracked but you may miss critical tips and advice for completing assignments. You may end up spending much more time if you tackle the assignments alone. Also, interacting and practicing with your peers is a critical part of your learning.
Late submission policy
10 % of the total possible points will be automatically deducted per each late day. The lowest grade possible is set to 60%.
Example:
If you submit 8 days late to an assignment worth 10 points, your grade would be 2 points if you were awarded full credit on the assignment (8 days late x 1 point deducted per day = 8 point late Penalty). However, based on the 60% lowest grade possible, your grade will be adjusted to 6 points.
Regrade policy
Fair and transparent grading is important. Please contact us know if you think there is an error or unreasonable deduction in your assignment. Only regrading requests within 7 days after the initial grade are accepted.
Accessibility
If you have a disability and will be requesting accommodations for this course, please register with either Dr. Kathy Duggan (dugganka@bc.edu), Associate Director, Connors Family Learning Center (learning disabilities or AHD) or Dean Rory Stein, (rory.stein@bc.edu), Assistant Dean for students with disabilities, (all other disabilities). Advance notice and appropriate documentation are required for accommodations.
Academic Policy
Students are required to adhere to the academic policy of Boston College.
Commitment to Inclusion
It is our intention that students from all diverse backgrounds and perspectives be well-served by this course, that students’ learning needs be addressed both in and out of class, and that the diversity that students bring to this class be viewed as a resource, strength, and benefit. It is our intent to present materials and activities that are respectful of diversity: gender, sexuality, disability, age, socio-economic status, ethnicity, race, and culture. Your suggestions are encouraged and appreciated. Please let me know ways to improve the effectiveness of the course for you personally or for other students or student groups.
Code of Conduct
We follow ACM Code of Ethics, focusing on the following:
- Demonstrate professionalism (e.g., being on time and respect in teamwork)
- Promote a fair, inclusive, and collaborative learning environment
- Reject behavior that strays into any form of harassments
Hall of Fame
🏆: Best project 🏅: Honorable mention


method_missing
Handle calls to methods that do not already exist
method_missing
class Container
def package!
puts 'Packaged'
end
def method_missing(method_name)
if method_name == :shipit!
puts 'SHIPIT!'
end
end
end
box = Container.new
box.package! # => Packaged
box.shipit! # => SHIPIT!
activerecord-deprecated_finders
User.find_by_email(email) # Rails 3 deprecated finders available by default
vs
User.find_by(:email, email) # Rails 4 without deprecated finders
respond_to_missing?
Container.new.respond_to? :shipit! # => false
Container.new.method :shipit! # => NameError: undefined method 'shipit!'
class Container
def method_missing(method_name)
if method_name == :shipit!
puts 'SHIPIT!'
end
end
def respond_to_missing?(method_name, include_private = false)
method_name == :shipit! ? true : false
end
end
Container.new.respond_to? :shipit! # => true
Container.new.method :shipit! # => <Method: Container#shipit!>
You should define respond_to_missing?
method_missing
method_added
class Container
def self.method_added(method_name)
puts "#{method_name} is now available!"
end
def shipit!; end # => shipit! is now available!
end
method_removed
class Container
def self.method_removed(method_name)
puts "#{method_name} was removed"
end
def shipit!; end
remove_method :shipit! # => shipit! was removed
end
method_undefined
class Container
def self.method_undefined(method_name)
puts "#{method_name} was undefined"
end
def shipit!; end
undef_method :shipit! # => shipit! was undefined
end
singleton_method_added
class Container
def self.singleton_method_added(method_name)
puts "#{method_name} was added"
end # => singleton_method_added was added
def self.shipit!; end # => shipit! was added
end
singleton_method_removed
class Container
def self.singleton_method_removed(method_name)
puts "#{method_name} was removed"
end
def self.shipit!; end
end
class << Container
remove_method :shipit! # => shipit! was removed
end
singleton_method_undefined
class Container
def self.singleton_method_undefined(method_name)
puts "#{method_name} was undefined"
end
def self.shipit!; end
end
class << Container
undef_method :shipit! # => shipit! was undefined
end
method_missing
respond_to_missing?
method_added
method_removed
method_undefined
singleton_method_added
singleton_method_removed
singleton_method_undefined
inherited
class Container
def self.inherited(subclass)
puts "#{subclass} is now inheriting from #{self.name}"
end
end
class Box < Container; end # => Box is now inheriting from Container
module Shippable
def shipit!
puts 'SHIPIT!'
end
end
class Container
include Shippable
end
Container.new.shipit! # => SHIPIT!
include
is for adding instance methodsextend
is for adding class methods
append_features
module Shippable
def self.append_features(other)
puts "The features of #{self} were appended to #{other}"
super
end
def shipit!
puts 'SHIPIT!'
end
end
class Container
include Shippable # => The features of Shippable were appended to Container
end
included
module Shippable
def self.included(other)
puts "#{other} included the features of #{self}"
end
end
class Container
include Shippable # => Container included the features of Shippable
end
class HardWorker
include Sidekiq::Worker
def perform
puts "Work!"
end
end
Behind the scenes
module Sidekiq
module Worker
def self.included(base)
base.extend(ClassMethods)
base.class_attribute :sidekiq_options_hash
base.class_attribute :sidekiq_retry_in_block
base.class_attribute :sidekiq_retries_exhausted_block
end
module ClassMethods
def perform_async(*args)
...
end
end
end
end
ActiveSupport::Concern
module Shippable
extend ActiveSupport::Concern
included do
extend ClassMethods
end
module ClassMethods
end
end
You can get some nicer syntax if you extend from ActiveSupport::Concern
include
module Shippable
def shipit!
puts 'shipit!'
end
end
class Container
include Shippable
def shipit!
puts 'SHIPIT!'
super
end
end
Container.new.shipit! # => SHIPIT!
# => shipit!
prepend
module Shippable
def shipit!
puts 'shipit!'
super
end
end
class Container
prepend Shippable
def shipit!
puts 'SHIPIT!'
end
end
Container.new.shipit! # => shipit!
# => SHIPIT!
prepend_features
module Shippable
def self.prepend_features(other)
puts "The features of #{self} were prepend to #{other}"
super
end
def shipit!
puts 'SHIPIT!'
end
end
class Container
prepend Shippable # => Features of Shippable were prepended to Container
end
module Shippable
def shipit!
puts 'SHIPIT!'
end
end
class Container
extend Shippable
end
Container.shipit! # => SHIPIT!
extended
module Shippable
def self.extended(other)
puts "#{other} was extended with #{self}"
super
end
def shipit!
puts 'SHIPIT!'
end
end
class Container
extend Shippable # => Container was extended with Shippable
end
extend_object
module Shippable
def self.extend_object(other)
puts "#{other} was extended with #{self}"
super
end
def shipit!
puts 'SHIPIT!'
end
end
class Container
extend Shippable # => Container was extended with Shippable
end
Similar to append_features, and prepend_featuresinitialize
class Container
def initialize
puts 'Ready to Shipit!'
end
end
Container.new # => Ready to Shipit!
initialize_copy
class Container
attr_accessor :width
def initialize
@width = 4
end
def initialize_copy(other)
other.width = 2
end
end
a = Container.new
a.width # => 4
b = a.dup
b.width # => 2
const_missing
class Container
def initialize
SHIPIT
end
def self.const_missing(con)
puts "#{con} was missing"
end
end
Container.new # => SHIPIT was missing
Similar to method_missing
but for constants
marshal_dump
marshal_load
class Container
def marshal_dump
puts "Dumping Container"
end
def marshal_load(data)
puts "Loading Container"
end
end
dumped = Marshal.dump Container.new # => Dumping Container
Marshal.load(dumped) # => Loading Container
These have to be interchangeableinherited
include/included/append_features
extend/extended/extend_object
prepend/prepended/prepend_features
initialize
initialize_copy
const_missing
class Container
def +(other)
if other.is_a? String
puts other
end
end
end
Container.new + 'shipit!' # => shipit!
Pretty impractical right?
Date.today # => Mon, 28 Oct 2013
Date.today + 5 # => Sat, 02 Nov 2013
nil.to_i # => 0
Allows us to add dates together really easily
* ** % - -@ +@ + / += -= *= /= **= =~ !~ << >> <=> [] []= != == === < > <= >= | ^ & ~
*
Multiply and Splat
&
Binary AND and Symbol#to_proc
<<
Bitwise shift and append to Strings and Arrays
|| ||= && &&= and or not = -> . .. ... :: () {}
trace_var
trace_var :$_, proc {|v| puts "$_ is now '#{v}'" }
$_ = 'hello' # => $_ is now 'hello'
$_ = ' there' # => $_ is now ' there'
Signal.trap
❯ irb
2.0.0-p247 :001 > Signal.trap("INT") { |signo| puts Signal.signame(signo) }
2.0.0-p247 :002 > INT
rescue
def might_raise
raise 'shiping exceptions!'
end
begin
might_raise
rescue
puts 'I was rescued'
end
ensure
def might_raise
raise 'shiping exceptions!'
end
begin
might_raise
rescue
puts 'I was rescued'
ensure
puts 'And I was able to cleanup'
end
twitter.com/_aaronackerman_
github.com/aackerman


I'm a Full-stack Web Developer with a background in Finance & Accounting. Based in Vancouver, British Columbia.
Built for personal use to learn Japanese as well as coding language
App generates travel itineraries based on user input (cities, travel dates) and their picked attractions from app recommendations.
A e-commerce app built to learn Ruby on Rails.
App allows users to book/cancel their interviews. The scheduler is real-time updated using Websocket
Two single-pages for customer to place order and for restaurant to confirm orders.
App allows users to post tweet.
App allows users to shorten/keep track of their URLs.
Apart from being a web developer, I enjoy many different outdoor and indoor activities. In the summer, I go hiking, pinic and camp with my friends and even take a roadtrip to different places. In the winter, I spend time do yoga and work out at home. Besides these interests, I love making my own coffee at home, from espresso to latte, and also pour over.
When I hide myself from the world, I relax with my books and my coffee. I enjoy cooking as well.
Besides learning coding language, I am currently self-learning Japanese language in my spare time.


An important question is: How efficient is an algorithm or piece of code? Efficiency covers lots of resources, including:
All are important but we will mostly talk about CPU time in 367. Other classes will discuss other resources (e.g., disk usage may be an important topic in a database class).
Be careful to differentiate between:
The time required by a method is proportional to the number of "basic operations" that it performs. Here are some examples of basic operations:
Some methods perform the same number of operations every time they are called. For example, the size method of the List class always performs just one operation: return numItems; the number of operations is independent of the size of the list. We say that methods like this (that always perform a fixed number of basic operations) require constant time.
Other methods may perform different numbers of operations, depending on the value of a parameter or a field. For example, for the array implementation of the List class, the remove method has to move over all of the items that were to the right of the item that was removed (to fill in the gap). The number of moves depends both on the position of the removed item and the number of items in the list. We call the important factors (the parameters and/or fields whose values affect the number of operations performed) the problem size or the input size.
When we consider the complexity of a method, we don't really care about the exact number of operations that are performed; instead, we care about how the number of operations relates to the problem size. If the problem size doubles, does the number of operations stay the same? double? increase in some other way? For constant-time methods like the size method, doubling the problem size does not affect the number of operations (which stays the same).
Furthermore, we are usually interested in the worst case: what is the most operations that might be performed for a given problem size (other cases -- best case and average case -- are discussed below). For example, as discussed above, the remove method has to move all of the items that come after the removed item one place to the left in the array. In the worst case, all of the items in the array must be moved. Therefore, in the worst case, the time for remove is proportional to the number of items in the list, and we say that the worst-case time for remove is linear in the number of items in the list. For a linear-time method, if the problem size doubles, the number of operations also doubles.
Assume that lists are implemented using an array. For each of the following List methods, say whether (in the worst case) the number of operations is independent of the size of the list (is a constant-time method), or is proportional to the size of the list (is a linear-time method):
Constant and linear times are not the only possibilities. For example, consider method createList:
List createList( int N ) { List L = new List(); for (int k=1; k<=N; k++) L.add(0, new Integer(k)); return L; }Note that, for a given N, the for-loop above is equivalent to:
L.add(0, new Integer(1) ); L.add(0, new Integer(2) ); L.add(0, new Integer(3) ); ... L.add(0, new Integer(N) );If we assume that the initial array is large enough to hold N items, then the number of operations for each call to add is proportional to the number of items in the list when add is called (because it has to move every item already in the array one place to the right to make room for the new item at position 0). For the N calls shown above, the list lengths are: 0, 1, 2, ..., N-1. So what is the total time for all N calls? It is proportional to 0 + 1 + 2 + ... + N-1.
Recall that we don't care about the exact time, just how the time depends on the problem size. For method createList, the "problem size" is the value of N (because the number of operations will be different for different values of N). It is clear that the time for the N calls (and therefore the time for method createList) is not independent of N (so createList is not a constant-time method). Is it proportional to N (linear in N)? That would mean that doubling N would double the number of operations performed by createList. Here's a table showing the value of 0+1+2+...+(N-1) for some different values of N:
| N | 0+1+2+...+(N-1) |
| 4 | 6 |
| 8 | 28 |
| 16 | 120 |
Clearly, the value of the sum does more than double when the value of N doubles, so createList is not linear in N. In the following graph, the bars represent the lengths of the list (0, 1, 2, ..., N-1) for each of the N calls.
The value of the sum (0+1+2+...+(N-1)) is the sum of the areas of the individual bars. You can see that the bars fill about half of the square. The whole square is an N-by-N square, so its area is N2; therefore, the sum of the areas of the bars is about N2/2. In other words, the time for method createList is proportional to the square of the problem size; if the problem size doubles, the number of operations will quadruple. We say that the worst-case time for createList is quadratic in the problem size.
Consider the following three algorithms for determining whether anyone in the room has the same birthday as you.
Algorithm 1: You say your birthday, and ask whether anyone in the room has the same birthday. If anyone does have the same birthday, they answer yes.
Algorithm 2: You tell the first person your birthday, and ask if they have the same birthday; if they say no, you tell the second person your birthday and ask whether they have the same birthday; etc, for each person in the room.
Algorithm 3: You only ask questions of person 1, who only asks questions of person 2, who only asks questions of person 3, etc. You tell person 1 your birthday, and ask if they have the same birthday; if they say no, you ask them to find out about person 2. Person 1 asks person 2 and tells you the answer. If it is no, you ask person 1 to find out about person 3. Person 1 asks person 2 to find out about person 3, etc.
Question 1: For each algorithm, what is the factor that can affect the number of questions asked (the "problem size")?
Question 2: In the worst case, how many questions will be asked for each of the three algorithms?
Question 3: For each algorithm, say whether it is constant, linear, or quadratic in the problem size in the worst case.
Formal definition:
For example, consider T(N) = 3 * N2 + 5. We can show that T(N) is O(N2) by choosing c = 4 and n0 = 2. This is because for all values of N greater than 2:
T(N) is not O(N), because whatever constant c and value
n0 you choose, I can always find a value of N greater than
n0 so that 3 * N2 + 5 is greater than
c * N.
total time = time(statement 1) + time(statement 2) + ... + time(statement k)How to Determine Complexities
In general, how can you determine the running time of a piece of code?
The answer is that it depends on what kinds of statements are used.
statement 1;
statement 2;
...
statement k;
(Note: this is code that really is exactly k statements; this is
not an unrolled loop like the N calls to add
shown above.)
The total time is found by adding the times for all statements:
if (condition) { sequence of statements 1 } else { sequence of statements 2 }Here, either sequence 1 will execute, or sequence 2 will execute. Therefore, the worst-case time is the slowest of the two possibilities: max(time(sequence 1), time(sequence 2)). For example, if sequence 1 is O(N) and sequence 2 is O(1) the worst-case time for the whole if-then-else statement would be O(N).
for (i = 0; i < N; i++) { sequence of statements }The loop executes N times, so the sequence of statements also executes N times. Since we assume the statements are O(1), the total time for the for loop is N * O(1), which is O(N) overall.
First we'll consider loops where the number of iterations of the inner loop is independent of the value of the outer loop's index. For example:
for (i = 0; i < N; i++) { for (j = 0; j < M; j++) { sequence of statements } }The outer loop executes N times. Every time the outer loop executes, the inner loop executes M times. As a result, the statements in the inner loop execute a total of N * M times. Thus, the complexity is O(N * M). In a common special case where the stopping condition of the inner loop is j < N instead of j < M (i.e., the inner loop also executes N times), the total complexity for the two loops is O(N2).
Now let's consider nested loops where the number of iterations of the inner loop depends on the value of the outer loop's index. For example:
for (i = 0; i < N; i++) { for (j = i+1; j < N; j++) { sequence of statements } }Now we can't just multiply the number of iterations of the outer loop times the number of iterations of the inner loop, because the inner loop has a different number of iterations each time. So let's think about how many iterations that inner loop has. That information is given in the following table:
| Value of i | Number of iterations of inner loop |
| 0 | N |
| 1 | N-1 |
| 2 | N-2 |
| ... | ... |
| N-2 | 2 |
| N-1 | 1 |
What is the worst-case complexity of the each of the following code fragments?
for (i = 0; i < N; i++) { sequence of statements } for (j = 0; j < M; j++) { sequence of statements }How would the complexity change if the second loop went to N instead of M?
for (i = 0; i < N; i++) { for (j = 0; j < N; j++) { sequence of statements } } for (k = 0; k < N; k++) { sequence of statements }
for (i = 0; i < N; i++) { for (j = N; j > i; j--) { sequence of statements } }
When a statement involves a method call, the complexity of the statement includes the complexity of the method call. Assume that you know that method f takes constant time, and that method g takes time proportional to (linear in) the value of its parameter k. Then the statements below have the time complexities indicated.
f(k); // O(1) g(k); // O(k)When a loop is involved, the same rule applies. For example:
for (j = 0; j < N; j++) g(N);has complexity (N2). The loop executes N times and each method call
g(N)
is complexity O(N).
For each of the following loops with a method call, determine the overall complexity. As above, assume that method f takes constant time, and that method g takes time linear in the value of its parameter.
1. for (j = 0; j < N; j++) f(j); 2. for (j = 0; j < N; j++) g(j); 3. for (j = 0; j < N; j++) g(k);
Some methods may require different amounts of time on different calls, even when the problem size is the same for both calls. For example, consider the add method that adds an item to the end of the list. In the worst case (the array is full), that method requires time proportional to the number of items in the list (because it has to copy all of them into the new, larger array). However, when the array is not full, add will only have to copy one value into the array, so in that case its time is independent of the length of the list; i.e., constant time.
In general, we may want to consider the best and average time requirements of a method as well as its worst-case time requirements. Which is considered the most important will depend on several factors. For example, if a method is part of a time-critical system like one that controls an airplane, the worst-case times are probably the most important (if the plane is flying towards a mountain and the controlling program can't make the next course correction until it has performed a computation, then the best-case and average-case times for that computation are not relevant -- the computation needs to be guaranteed to be fast enough to finish before the plane hits the mountain).
On the other hand, if occasionally waiting a long time for an answer is merely inconvenient (as opposed to life-threatening), it may be better to use an algorithm with a slow worst-case time and a fast average-case time, rather than one with so-so times in both the average and worst cases.
Note that calculating the average-case time for a method can be tricky.
You need to consider all possible values for the important factors, and
whether they will be distributed evenly.
When do Constants Matter?
Recall that when we use big-O notation, we drop constants and low-order terms. This is because when the problem size gets sufficiently large, those terms don't matter. However, this means that two algorithms can have the same big-O time complexity, even though one is always faster than the other. For example, suppose algorithm 1 requires N2 time, and algorithm 2 requires 10 * N2 + N time. For both algorithms, the time is O(N2), but algorithm 1 will always be faster than algorithm 2. In this case, the constants and low-order terms do matter in terms of which algorithm is actually faster.
However, it is important to note that constants do not matter in terms
of the question of how an algorithm "scales" (i.e., how does the algorithm's
time change when the problem size doubles).
Although an algorithm that requires N2 time will always be
faster than an algorithm that requires 10*N2 time, for
both algorithms, if the problem size doubles, the actual time
will quadruple.
When two algorithms have different big-O time complexity,
the constants and low-order terms only matter when the problem size
is small.
For example, even if there are large constants involved, a linear-time
algorithm will always eventually be faster than a quadratic-time algorithm.
This is illustrated in the following table, which shows the value of
100*N (a time that is linear in N) and the value of N2/100
(a time that is quadratic in N) for some values of N.
For values of N less than 104, the quadratic time is
smaller than the linear time.
However, for all values of N greater than 104, the linear time
is smaller.
N 100*N N2/100
102 104 102
103 105 104
104 106 106
105 107 108
106 108 1010
107 109 1012


| Package | Description |
|---|---|
| bayou.bytes |
Async byte source/sink.
|
| bayou.file |
Utilities for files.
|
| bayou.gzip |
GZIP related utils.
|
| bayou.http |
Http server.
|
| bayou.mime |
MIME related utilities.
|
| bayou.text |
Utilities for texts.
|
| bayou.websocket |
WebSocket server.
|
| Modifier and Type | Class and Description |
|---|---|
class |
InputStream2ByteSource
Converts an InputStream to a ByteSource.
|
class |
PushbackByteSource
A ByteSource wrapper that supports unread().
|
class |
RangedByteSource
A sub-range [min, max) of an origin source.
|
class |
SimpleByteSource
A simple ByteSource based on some ByteBuffers.
|
class |
ThreadSafeByteSource
A thread-safe wrapper of a ByteSource; supporting arbitrary close().
|
class |
ThrottledByteSource
Throttles a ByteSource to limit how fast bytes can be served.
|
| Modifier and Type | Method and Description |
|---|---|
ByteSource |
ByteSourceCache.newView()
Create a ByteSource view of the cached bytes.
|
ByteSource |
BytePipe.source()
Get the source of this pipe.
|
| Constructor and Description |
|---|
ByteSource2InputStream(ByteSource origin,
Duration readTimeout)
Create an InputStream based on the ByteSource.
|
ByteSourceCache(ByteSource origin,
Long totalBytes)
Create an in-memory cache of the origin source.
|
PushbackByteSource(ByteSource origin)
Create a PushbackByteSource wrapper of the `origin` ByteSource.
|
RangedByteSource(ByteSource origin,
long min,
long max)
Create a sub-range [min, max) of the origin source.
|
ThreadSafeByteSource(ByteSource origin)
Creates a thread-safe wrapper of the `origin` ByteSource.
|
ThrottledByteSource(ByteSource origin,
int bufferSize,
long b0,
long bytesPerSecond)
Create a throttled wrapper of the origin source, with a linear curve.
|
ThrottledByteSource(ByteSource origin,
int bufferSize,
ThrottledByteSource.Curve curve)
Create a throttled wrapper of the origin source.
|
| Modifier and Type | Class and Description |
|---|---|
class |
FileByteSource
A source of bytes from a file.
|
| Modifier and Type | Method and Description |
|---|---|
ByteSource |
FileHttpEntity.body()
The body of the entity, same as the content of the file.
|
| Modifier and Type | Class and Description |
|---|---|
class |
GunzipByteSource
Decompress the origin ByteSource that's compressed in gzip format.
|
class |
GzipByteSource
Compresses the origin ByteSource with gzip.
|
| Modifier and Type | Method and Description |
|---|---|
ByteSource |
GzipHttpEntity.body()
The body after compression.
|
| Constructor and Description |
|---|
GunzipByteSource(ByteSource origin)
Create a GunzipByteSource that decompresses the `origin` source in gzip format.
|
GzipByteSource(ByteSource origin,
int compressionLevel)
Create a GzipByteSource, which compresses the origin source with gzip.
|
| Modifier and Type | Method and Description |
|---|---|
ByteSource |
ThrottledHttpEntity.body()
The entity body.
|
ByteSource |
SimpleHttpEntity.body()
The body of this entity.
|
default ByteSource |
HttpEntityWrapper.body()
Equivalent to
getOriginEntity().body() by default. |
ByteSource |
HttpEntity.body()
The body of this entity.
|
ByteSource |
CachedHttpEntity.body()
The entity body.
|
| Modifier and Type | Class and Description |
|---|---|
class |
MultipartByteSource
Generates a multipart body.
|
| Modifier and Type | Method and Description |
|---|---|
ByteSource |
MultipartPart.body()
The body of this part.
|
| Constructor and Description |
|---|
MultipartParser(ByteSource origin,
CharSequence boundary)
Create a MultipartParser.
|
| Modifier and Type | Class and Description |
|---|---|
class |
TextByteSource
A ByteSource encoding texts to bytes.
|
| Modifier and Type | Method and Description |
|---|---|
ByteSource |
TextHttpEntity.body()
The entity body.
|
| Modifier and Type | Interface and Description |
|---|---|
interface |
WebSocketMessage
WebSocket message.
|
| Modifier and Type | Method and Description |
|---|---|
static WebSocketMessage |
WebSocketMessage.binary(ByteSource byteSource)
Wrap a ByteSource as a binary message.
|
static WebSocketMessage |
WebSocketMessage.text(ByteSource byteSource)
Wrap a ByteSource as a text message.
|


| Total net profit | 3.55 | Gross profit | 33.72 | Gross loss | -30.17 |
| Profit factor | 1.12 | Expected payoff | 0.14 | ||
| Absolute drawdown | -18.99 | Maximal drawdown (%) | 21.16 (975.12%) | ||
| Total trades | 25 | Profit trades (% of total) | 17 (68.0%) | Loss trades (% of total) | 8 (32.0%) |
| Long positions (won %) | 9 (55.56%) | Short positions (won %) | 16 (75.0%) | ||
| Largest | profit trade | 5.26 | loss trade | -21.16 | |
| Average | profit trade | 1.98 | loss trade | -3.77 | |
| Minimum | profit trade | 0.38 | loss trade | -0.1 | |
| Maximum | take profit in pips | 0.0 | stop loss in pips | 0.0 | |
| Average | take profit in pips | 0.0 | stop loss in pips | 0.0 | |
| Minimum | take profit in pips | 0.0 | stop loss in pips | 0.0 | |
| Maximum | Reward-Risk | 0.0 | Duration in minutes | 3852 | |
| Average | Reward-Risk | 0.0 | Duration in minutes | 731.3 | |
| Minimum | Reward-Risk | 0.0 | Duration in minutes | 9 | |
| Maximum | consecutive wins (profit in money) | 6.0 (11.93) | consecutive losses (loss in money) | 2.0 (-1.62) | |
| Average | consecutive wins | 2.0 | consecutive losses | 1.0 |
| Total net profit | 0.59 | Gross profit | 7.59 | Gross loss | -7.0 |
| Profit factor | 1.08 | Expected payoff | 0.07 | ||
| Absolute drawdown | -1.52 | Maximal drawdown (%) | 5.37 (90.1%) | ||
| Total trades | 9 | Profit trades (% of total) | 5 (55.56%) | Loss trades (% of total) | 4 (44.44%) |
| Largest | profit trade | 2.16 | loss trade | -3.95 | |
| Average | profit trade | 1.52 | loss trade | -1.75 | |
| Minimum | profit trade | 0.39 | loss trade | -0.11 | |
| Maximum | take profit in pips | 0.0 | stop loss in pips | 0.0 | |
| Average | take profit in pips | 0.0 | stop loss in pips | 0.0 | |
| Minimum | take profit in pips | 0.0 | stop loss in pips | 0.0 | |
| Maximum | Reward-Risk | 0.0 | Duration in minutes | 975.0 | |
| Average | Reward-Risk | 0.0 | Duration in minutes | 344.4 | |
| Minimum | Reward-Risk | 0.0 | Duration in minutes | 9.0 | |
| Maximum | consecutive wins (profit in money) | 3.0 (5.42) | consecutive losses (loss in money) | 2.0 (-5.37) | |
| Average | consecutive wins | 2.0 | consecutive losses | 1.0 |
| Total net profit | 2.96 | Gross profit | 26.13 | Gross loss | -23.17 |
| Profit factor | 1.13 | Expected payoff | 0.18 | ||
| Absolute drawdown | -17.98 | Maximal drawdown (%) | 21.67 (587.26%) | ||
| Total trades | 16 | Profit trades (% of total) | 12 (75.0%) | Loss trades (% of total) | 4 (25.0%) |
| Largest | profit trade | 5.26 | loss trade | -21.16 | |
| Average | profit trade | 2.18 | loss trade | -5.79 | |
| Minimum | profit trade | 0.38 | loss trade | -0.1 | |
| Maximum | take profit in pips | 0.0 | stop loss in pips | 0.0 | |
| Average | take profit in pips | 0.0 | stop loss in pips | 0.0 | |
| Minimum | take profit in pips | 0.0 | stop loss in pips | 0.0 | |
| Maximum | Reward-Risk | 0.0 | Duration in minutes | 3852.0 | |
| Average | Reward-Risk | 0.0 | Duration in minutes | 948.9 | |
| Minimum | Reward-Risk | Duration in minutes | 157.0 | ||
| Maximum | consecutive wins (profit in money) | 6.0 (14.56) | consecutive losses (loss in money) | 1.0 (-0.1) | |
| Average | consecutive wins | 1.0 | consecutive losses | 1.0 |


Individualized Education Programs (IEPs) were created in an effort to ensure special education students received appropriate accommodations and measurable goals to work towards during their educational careers. The potential for IEPs to be helpful and instructive documents collaborated on by parents, teachers, and students, is more often than not lost in the difficulty of tracking goal progress and miscommunication between stakeholders. To address this critical needs area in education we propose an IEP data collection app for teachers to be synced with a parent/teacher web portal to create clear channels for purposeful and accurate communication. |
|
|
IEP-Connect: App Tracker Focus: Timely data collection aide for teachers Teachers with tablet access are able to track IEP goals in a systematic way using IEP-Connect. With this app teachers don’t need to worry about remembering on which piece of paper they wrote down an incident of goal progress, they can simply click to the student profile and quickly record this information in real time. With regular app usage, the growth of information to share and analyze between parents and teachers concerning IEP progress is guaranteed to increase |
With the IEP-Connect web portal, parents no longer have to track-down teachers in order to receive updates on their child’s progress. The parent view of the web portal syncs directly with the IEP-Connect Classroom Tracker providing real time updates to parents. Parents can see recent scores and provided accommodations in the context of the child’s progress history. Additionally, the data is provided at varying levels of granularity from progress symbols to percentage of goal completed to the specific scores of a recent assessment. The web portal also fosters open communication between all members of the IEP group by providing an interface to converse with the IEP team. The conversations are tagged with their topic allowing the conversations to be filtered by category allowing quick updates on IEP topics, and ensuring valuable information in conversations can be found later.
Lane |
Kristen |
Jessica |
Monique |


Morphology characterization. (a) SEM image of pristine TiO 2 nanofibers. (b) Low- and (c) high-magnification SEM images of Co 3O 4/TiO 2 hierarchical heterostructures. (d) Typical TEM image of the single Co 3O 4/TiO 2 hierarchical nanofiber. (e) HRTEM image of the heterojunction region. (f) HRTEM image of the Co 3O 4 nanosheet surface.
Figure 1
Phase analysis. (a) XRD patterns of pristine TiO 2 nanofibers and Co 3O 4/TiO 2 hierarchical heterostructures. (b) Raman spectra of pristine TiO 2 nanofibers, Co 3O 4 nanostructures, and Co 3O 4/TiO 2 hierarchical heterostructures.
Figure 2
Morphology characterization. (a) Low - and (b) high-magnification SEM images of Fe 2O 3/TiO 2 hierarchical heterostructures. (c) Low - and high-magnification (inset) TEM images of Fe 2O 3/TiO 2 hierarchical heterostructures. (d) HRTEM image and fast-Fourier transformation (FFT) of the Fe 2O 3 nanorod surface.
Figure 3
Morphology characterization. (a) Low -magnification, (b) high-magnification SEM images and (c) TEM image of Fe 3O 4/TiO 2 hierarchical heterostructures. (d) Low -magnification, (e) high-magnification SEM images and (f) TEM image of CuO/TiO 2 hierarchical heterostructures.
Figure 4
Phase analysis. XRD patterns of (a) Fe 2O 3/TiO 2, (b) Fe 3O 4/TiO 2, and (c) CuO/TiO 2 hierarchical heterostructures.
Figure 5
Formation mechanism of Co 3O 4/TiO 2 hierarchical heterostructures. SEM images of Co 3O 4/TiO 2 hierarchical heterostructures (before annealing) at various reaction stages by setting the reaction time 1 h (a), 1.5 h (b), 2 h (c), 4 h (d), 6 h (e), and 9 h (f). And schematic of the formation process of Co 3O 4/TiO 2 hierarchical heterostructures (g).
Figure 6
Electrochemical properties of Co 3O 4/TiO 2 hierarchical heterostructures. (a) CV of Co 3O 4/TiO 2 hierarchical heterostructures at a scan rate of 0.1 mV s −1 in the range of 3–0.01 V. (b) Discharge and charge curves of Co 3O 4/TiO 2 hierarchical heterostructures at a current density of 200 mA g −1 in the range of 3–0.01 V. (c) Cycling performance and coulombic efficiency of pristine TiO 2 nanofibers and Co 3O 4/TiO 2 hierarchical heterostructures at a current density of 200 mA g −1. (d) Rate performance of pristine TiO 2 nanofibers and Co 3O 4/TiO 2 hierarchical heterostructures.
Figure 7
Electrochemical impedance spectra of Co 3O 4/TiO 2 hierarchical heterostructures. Nyquist plots before cycling for the pristine TiO 2 nanofibers, single Co 3O 4 nanostructures and Co 3O 4/TiO 2 hierarchical heterostructures by applying an AC voltage of 5 mV amplitude at 0.1 Hz to 700 kHz.


A JavaScript developer who loves Advanced and Functional Programming, with a good understanding on React and Redux. Although no professional experience as a web developer, I have been coding for more than 10 years in application software, embedded software and web development.
Done extensive development with Ruby on Rails, MySql, ElasticSearch and ruby C++ bindings.
Node, Express and Python I have only touched on through courses.
React-Algo is an attempt to visualize data structures and algorithms with React, Redux and D3.
A fictional touring company that promise life-changing experiences to their clients. The Natours website was developed mainly with SASS and a few lines of JavaScript.
You got this.
Let's make it happen


Assg.2: CSS, JavaScript, and Forms
Brought to you by Gilbert Al-Indary
•
Follower of Bcharreh's politician (if you know what i mean)
•
I wish to A this course
•
I wish to A this last course with you
•
I wish that bullets 4 and 5 become true
CSC 443, Assg 2, Fall 2015


Back to menu
Add collision type...
Type:
Head On
Hit Animal
Hit Fixed Object
Hit Object On Road
Hit Parked Vehicle
Hit Pedestrian
Left Road - Out of Control
Other
Rear End
Right Angle
Right Turn
Roll Over
Side Swipe
Position:
Cross Road
Divided Road
Freeway
Interchange
Multiple
Not Divided
One Way
Other
Pedestrian Crossing
Rail Crossing
Ramp Off
Ramp On
T-Junction


Omer Mohamed Ali
Home
Chat
Calendar
Files
Jobs
Settings
Status:
Online
Chat
Ryann Remo
Yea, Sure!
15 April
23
Karp Bonolo
Yea, Sure!
15 April
10
Mercedes Yemelyan
Yea, Sure!
15 April
Cadi Kajetán
Yea, Sure!
15 April
Rina Samuel
Yea, Sure!
15 April
Chatting with
Mercedes Yemelyan
Hey there. We would like to invite you over to our office for a visit. How about it?
15 April
All travel expenses are covered by us of course :D
15 April
It's like a dream come true
15 April
I accept. Thank you very much.
15 April
You are welome. We will stay in touch.
15 April


Our elevator systems are perfectly usable by people of all intelligence levels!
RESIDENTIAL SERVICESYour employees will keep pushing buttons until we innovate! It will be soon... hopefully.
CORPORATE SERVICESThanks to our unmatched experience,
hundreds of large companies put their trust in Rocket Elevators! And for good reasons!
I thought of building elevators because too many people would fall and just not get up. It's not cool to carry your groceries while living on the 35th floor.
Perry Sawatzky Company CEOI just did *tikatikatikatika* on my keyboard and became Steve "Just werks" Jobs!
Cedric Bernier Employee of the MonthWe may have a small support team, but boy do we love double-time!
Address: CodeBoxx, Wellington Street, Verdun, QC Phone: 1<PHONE_NUMBER> Email: RocketElevators@MailBoxx.com


27 Missing Kisses
27 Missing Kisses is a movie starring Nutsa Kukhianidze, Evgeniy Sidikhin, and Shalva Iashvili. The summerly adventures of teen Sybilla, who falls in love with a middle-aged father, while being romanced by the his teen son.


Salmon Cookies
Add your new store
City Name
Your minimum amount of cookies sold
Your maximum amount of cookies sold
Your average amount of cookies sold
Submit
Home


SC-01 SC-02 SC-03 SC-04 SC-05 SC-06 SC-07
SC – Sen. Lindsey Graham (R) and Sen. Tim Scott (R)
Committees
Lindsey Graham is the #5 Republican on the Senate Appropriations Subcommittee on Commerce, Justice, Science, and Related Agencies
Lindsey Graham is the #6 Republican on the Senate Committee on Appropriations
Lindsey Graham is the #6 Republican on the Senate Appropriations Subcommittee on Energy and Water Development
HEP Grants
In the past 9 years, this state has received: 14 HEP grants, totalling $2,986,000
Year Institution Amount ($)
------ ---------------------------- ------------
2018 University of South Carolina 240,000
2017 University of South Carolina 475,000
2016 University of South Carolina 467,000
2015 University of South Carolina 460,000
2014 University of South Carolina 378,000
2013 University of South Carolina 345,000
2012 The Citadel 23,000
2012 University of South Carolina 598,000
SC Contracts
In the past 9 years, this state has received: 6 Office of Science contracts, totalling $7,507,172
Year Vendor Amount ($) Item
------ ------------- ------------ ----------------------------------------
2018 Tribalco, LLC 2,028,834 Radio And Television Communication Equip
2017 Tribalco, LLC 5,478,338 Radio And Television Communication Equip
NSF MPS Grants
In the past 9 years, this state has received: 295 NSF MPS grants, totalling $57,762,298
Institution Amount ($)
-------------------------------------- ------------
University Of South Carolina 25,352,964
Clemson University 18,498,954
South Carolina Research Foundation 6,705,147
Furman University 3,002,457
College Of Charleston 1,488,995
South Carolina State University 1,164,699
Clemson University Research Foundation 522,372
Medical University Of South Carolina 316,667
Winthrop University 291,438
Voorhees College 259,392
Coker College 144,213
University Of Sc Columbia 15,000
SULI/CCI Interns
From 2014-2018, this state had 57 SULI/CCI interns
# Interns Program College
----------- --------- -------------------------------------
26 SULI University of South Carolina-Columbia
11 SULI Clemson University
5 SULI College of Charleston
4 SULI Furman University
3 SULI Wofford College
2 SULI University of South Carolina-Aiken
1 CCI Piedmont Technical College
1 SULI Benedict College
1 SULI Charleston Southern University
1 SULI Converse College
1 SULI Francis Marion University
1 SULI South Carolina State University
57 — — Back to top
SC-01 – Rep. Joe Cunningham (D) – Wikipedia
HEP Grants
In the past 9 years, this district has received: $23,000 in SC HEP grants.
Institution Amount ($) Start End Principal Investigator Project Title
------------- ------------ ------- ----- ------------------------ --------------------------------------------------------------------------------
The Citadel 23000 2012 2013 Yost Precision Studies of Hadronic and Electro-Weak Interactions for Collider Physics
SC Contracts
This district received no SC contracts from 2012-2020
NSF MPS Grants
In the past 9 years, this district has received: $1,647,329 in NSF MPS grants.
Year Institution Amount ($)
------ ------------------------------------ ------------
2019 College Of Charleston 284,029
2018 College Of Charleston 35,960
2016 College Of Charleston 230,411
2015 College Of Charleston 72,607
2014 College Of Charleston 319,800
2012 College Of Charleston 546,188
2012 Medical University Of South Carolina 158,334
SULI/CCI Interns
From 2014-2018, this district had 6 SULI/CCI interns
Term Name College Host Lab Program
----------- ----------------------- ------------------------------ ------------------------------------- ---------
Summer 2017 William Casey Narrows Charleston Southern University Savannah River National Laboratory SULI
Summer 2014 Caleb Henry Whitaker College of Charleston Argonne National Laboratory SULI
Spring 2017 Isaac Gould College of Charleston National Renewable Energy Laboratory SULI
Spring 2016 Madeleine Parker Gordon College of Charleston Lawrence Berkeley National Laboratory SULI
Fall 2015 Madeleine Parker Gordon College of Charleston Lawrence Berkeley National Laboratory SULI
Fall 2015 Brenna Norton-Baker College of Charleston National Renewable Energy Laboratory SULI
SC-02 – Rep. Joe Wilson (R) – Wikipedia
HEP Grants
This district received no SC HEP grants from 2012-2020
SC Contracts
This district received no SC contracts from 2012-2020
NSF MPS Grants
In the past 9 years, this district has received: $7,617,274 in NSF MPS grants.
Year Institution Amount ($)
------ ---------------------------- ------------
2018 University Of South Carolina 3,532,843
2017 University Of South Carolina 4,084,431
SULI/CCI Interns
From 2014-2018, this district had 2 SULI/CCI interns
Term Name College Host Lab Program
----------- ------------ ---------------------------------- ---------------------------------- ---------
Summer 2017 Erin Peck University of South Carolina-Aiken Savannah River National Laboratory SULI
Summer 2016 Austin Freed University of South Carolina-Aiken Oak Ridge National Laboratory SULI
SC-03 – Rep. Jeff Duncan (R) – Wikipedia
Committees
Jeff Duncan is the #23 Republican on the House Committee on Energy and Commerce
HEP Grants
This district received no SC HEP grants from 2012-2020
SC Contracts
This district received no SC contracts from 2012-2020
NSF MPS Grants
In the past 9 years, this district has received: $19,021,326 in NSF MPS grants.
Year Institution Amount ($)
------ -------------------------------------- ------------
2019 Clemson University 1,685,059
2018 Clemson University 3,626,653
2017 Clemson University 3,176,933
2016 Clemson University 3,613,179
2016 Clemson University Research Foundation 17,615
2015 Clemson University 1,430,354
2014 Clemson University 1,099,511
2013 Clemson University 2,108,260
2013 Clemson University Research Foundation 375,188
2012 Clemson University 1,759,005
2012 Clemson University Research Foundation 129,569
SULI/CCI Interns
From 2014-2018, this district had 12 SULI/CCI interns
Term Name College Host Lab Program
----------- --------------------------- -------------------------- ------------------------------------- ---------
Summer 2016 Julia Grace Riley Clemson University Brookhaven National Laboratory SULI
Summer 2016 Emma Coleman Clemson University Argonne National Laboratory SULI
Summer 2016 Gary Kenneth Vestal Clemson University Oak Ridge National Laboratory SULI
Summer 2016 Amanda Doris Farthing Clemson University National Renewable Energy Laboratory SULI
Summer 2015 Barbara Woo Clemson University Brookhaven National Laboratory SULI
Summer 2015 Mindy Earnest Clemson University Oak Ridge National Laboratory SULI
Summer 2015 Mikita Yankouski Clemson University Los Alamos National Laboratory SULI
Summer 2015 David Nasol Clemson University Savannah River National Laboratory SULI
Summer 2014 John Christopher Garland Clemson University Oak Ridge National Laboratory SULI
Spring 2015 GARY KENNETH VESTAL Clemson University Oak Ridge National Laboratory SULI
Fall 2017 Charlene Elizabeth Mcentyre Piedmont Technical College Savannah River National Laboratory CCI
Fall 2015 Barbara Woo Clemson University Lawrence Berkeley National Laboratory SULI
SC-04 – Rep. William R. Timmons IV (R) – Wikipedia
Committees
William R. Timmons IV is the #12 Republican on the House Subcommittee on Higher Education and Workforce Development
William R. Timmons IV is the #5 Republican on the House Subcommittee on Early Childhood, Elementary, and Secondary Education
HEP Grants
This district received no SC HEP grants from 2012-2020
SC Contracts
This district received no SC contracts from 2012-2020
NSF MPS Grants
In the past 9 years, this district has received: $3,002,457 in NSF MPS grants.
Year Institution Amount ($)
------ ----------------- ------------
2019 Furman University 1,190,323
2018 Furman University 387,959
2017 Furman University 258,190
2016 Furman University 225,000
2015 Furman University 337,911
2014 Furman University 300,000
2013 Furman University 103,875
2012 Furman University 199,199
SULI/CCI Interns
From 2014-2018, this district had 8 SULI/CCI interns
Term Name College Host Lab Program
----------- ----------------------- ----------------- ------------------------------------- ---------
Summer 2017 Asrar Alimohamed Wofford College Oak Ridge National Laboratory SULI
Summer 2017 Jamey Bower Wofford College Pacific Northwest National Laboratory SULI
Summer 2016 Jamey Bower Wofford College Pacific Northwest National Laboratory SULI
Summer 2015 Tabitha Faith Colter Furman University Oak Ridge National Laboratory SULI
Summer 2015 Andrew Emerson Furman University Oak Ridge National Laboratory SULI
Summer 2014 Kandice Elizabeth Miles Converse College Oak Ridge National Laboratory SULI
Spring 2018 Neely Wood Furman University Oak Ridge National Laboratory SULI
Fall 2017 Neely Wood Furman University Oak Ridge National Laboratory SULI
SC-05 – Rep. Ralph Norman (R) – Wikipedia
Committees
Ralph Norman is the #9 Republican on the House Committee on Science, Space, and Technology
HEP Grants
This district received no SC HEP grants from 2012-2020
SC Contracts
In the past 9 years, this district has received: 6 Office of Science contracts, totalling $7,507,172
Year Vendor Amount ($) Item
------ ------------- ------------ ----------------------------------------
2018 Tribalco, LLC 2,028,834 Radio And Television Communication Equip
2017 Tribalco, LLC 5,478,338 Radio And Television Communication Equip
NSF MPS Grants
In the past 9 years, this district has received: $435,651 in NSF MPS grants.
Year Institution Amount ($)
------ ------------------- ------------
2014 Winthrop University 291,438
2012 Coker College 144,213
SULI/CCI Interns
This district had no SULI/CCI interns from 2014-2018
SC-06 – Rep. James E. Clyburn (D) – Wikipedia
HEP Grants
In the past 9 years, this district has received: $2,963,000 in SC HEP grants.
Institution Amount ($) Start End Principal Investigator Project Title
---------------------------- ------------ ------- ------- ------------------------ -----------------------------------------------------------------------------------------------------------
University of South Carolina 0 2015 2016 Rosenfeld, Carl Closeout Modification
University of South Carolina 1,957,000 2014 Ongoing Petti, Roberto Neutrino and Flavor Physics at the Intensity Frontier
University of South Carolina 0 2014 2016 Purohit, Milind Energy Frontier Physics: Experimental Particle Physics research to be done using the ATLAS detector at CERN
University of South Carolina 63,000 2014 2016 Purohit, Milind Electron-Positron Physics with Belle II
University of South Carolina 290,000 2013 2014 Petti Experimental Neutrino Physics
University of South Carolina 55,000 2013 2014 Purohit Energy Frontier Physics: Experimental Particle Physics research to be done using the ATLAS detector at CERN
University of South Carolina 598,000 2012 2013 Rosenfeld, Purohit Experimental Particle Physics
SC Contracts
This district received no SC contracts from 2012-2020
NSF MPS Grants
In the past 9 years, this district has received: $26,038,261 in NSF MPS grants.
Year Institution Amount ($)
------ ------------------------------------ ------------
2019 University Of South Carolina 3,792,542
2019 South Carolina State University 999,864
2018 University Of South Carolina 1,569,673
2017 Voorhees College 259,392
2017 University Of South Carolina 996,036
2016 South Carolina Research Foundation 100,000
2016 University Of South Carolina 4,383,409
2016 South Carolina State University 28,998
2015 University Of South Carolina 1,739,497
2015 University Of Sc Columbia 15,000
2015 South Carolina Research Foundation 81,000
2014 University Of South Carolina 1,924,225
2014 South Carolina State University 135,837
2014 South Carolina Research Foundation 279,428
2013 Medical University Of South Carolina 158,333
2013 University Of South Carolina 3,330,308
2013 South Carolina Research Foundation 1,254,696
2012 South Carolina Research Foundation 4,990,023
SULI/CCI Interns
From 2014-2018, this district had 28 SULI/CCI interns
Term Name College Host Lab Program
----------- ---------------------------- ------------------------------------- -------------------------------------- ---------
Summer 2018 Eric Spencer Rohm University of South Carolina-Columbia Pacific Northwest National Laboratory SULI
Summer 2018 Bradie Shelton Crandall University of South Carolina-Columbia Oak Ridge National Laboratory SULI
Summer 2017 Kyle George University of South Carolina-Columbia Pacific Northwest National Laboratory SULI
Summer 2017 Sabrina Carroll University of South Carolina-Columbia Oak Ridge National Laboratory SULI
Summer 2017 John Belton O'Neall Caughman University of South Carolina-Columbia Oak Ridge National Laboratory SULI
Summer 2017 Harrison Engoren University of South Carolina-Columbia Oak Ridge National Laboratory SULI
Summer 2016 Christian Tyler Carey University of South Carolina-Columbia National Renewable Energy Laboratory SULI
Summer 2016 Matt Adamski University of South Carolina-Columbia National Renewable Energy Laboratory SULI
Summer 2016 Terkessia Ardreonda Hart South Carolina State University Lawrence Livermore National Laboratory SULI
Summer 2016 Mackenize Morris University of South Carolina-Columbia Oak Ridge National Laboratory SULI
Summer 2015 Leah Zhou McGovern University of South Carolina-Columbia National Renewable Energy Laboratory SULI
Summer 2015 Michelle Josephine Thomas University of South Carolina-Columbia Ames National Laboratory SULI
Summer 2015 Anna Lynn University of South Carolina-Columbia Oak Ridge National Laboratory SULI
Summer 2015 Jonathan Michael Freed University of South Carolina-Columbia Oak Ridge National Laboratory SULI
Summer 2015 Chris Joseph Buckman University of South Carolina-Columbia Oak Ridge National Laboratory SULI
Summer 2014 Charles Staub University of South Carolina-Columbia National Renewable Energy Laboratory SULI
Summer 2014 Nick James Weidner University of South Carolina-Columbia Argonne National Laboratory SULI
Spring 2018 Austin Eric Kennedy University of South Carolina-Columbia National Renewable Energy Laboratory SULI
Spring 2018 Hailey Russell Boyer University of South Carolina-Columbia National Renewable Energy Laboratory SULI
Spring 2017 Rachel Annette Smoak University of South Carolina-Columbia Brookhaven National Laboratory SULI
Spring 2017 Jocelyn Kate Mackay University of South Carolina-Columbia National Renewable Energy Laboratory SULI
Spring 2017 Joanne Wu University of South Carolina-Columbia National Renewable Energy Laboratory SULI
Spring 2016 Christian Tyler Carey University of South Carolina-Columbia National Renewable Energy Laboratory SULI
Spring 2016 Jocelyn Kate Mackay University of South Carolina-Columbia National Renewable Energy Laboratory SULI
Spring 2015 Leah Zhou McGovern University of South Carolina-Columbia National Renewable Energy Laboratory SULI
Spring 2014 Martin Anthony Epps, Jr. Benedict College Brookhaven National Laboratory SULI
Fall 2015 Jacob Alois Przywara University of South Carolina-Columbia National Renewable Energy Laboratory SULI
Fall 2014 Charles Staub University of South Carolina-Columbia National Renewable Energy Laboratory SULI
SC-07 – Rep. Tom Rice (R) – Wikipedia
HEP Grants
This district received no SC HEP grants from 2012-2020
SC Contracts
This district received no SC contracts from 2012-2020
NSF MPS Grants
This district received no NSF MPS grants from 2012-2020
SULI/CCI Interns
From 2014-2018, this district had 1 SULI/CCI intern
Term Name College Host Lab Program
----------- -------------------- ------------------------- ------------------------ ---------
Spring 2017 Talon Legrande Brown Francis Marion University Ames National Laboratory SULI


{% extends "ci/base.html" %} {% load static %} {% block pagetitle %}Welcome{% endblock %} {% block content %}
Welcome to the Seed Control Interface.
Please ask your administrator for more permissions to enable to you see information and manage the system.


11 March 1997
Disease Outbreak Reported
During 1997 outbreaks of yellow fever caused 30 cases and 21 deaths which occurred in endemic zones of three provinces of Cochabamba Department and one province of La Paz Department. All the cases occurred in rural areas. At the end of the year a further outbreak occurred and continued into January and February in Cochabamba Department (12 cases, 10 deaths), Beni Department (4 cases, 2 deaths) and Santa Cruz Department (1 case under study). Support for a vaccination campaign was requested and donations of vaccine totalling 180 000 doses were received from Brazil, Colombia and Venezuela.


So you’re a bit obsessive about new tech. You’re itching to fulfil fantasies in virtual reality, and have already chosen which friend you’ll buzz with a drone for fun. Your parents treat you as a 24/7 tech helpline, and as a caring offspring you have the appropriate IT Crowd gif on permanent standby to send them.
But new tech is only cutting-edge in relation to the needs of people who use it. A new smartwatch might smarten up your ability to dim smartbulbs in your smarthome, but technology gets really smart when it’s applied in the right way to change the lives of people in a powerful way.
So why are wind-up LED lights, SMS messaging, and — erm— tractors the cutting-edge technology which the world really needs? Maybe the question should be: “if there was a simple technology that could help make you smarter, better-off, and stopped your house from burning down — would you use it?”
Light, weight
Most of us take electric lights for granted, of course. But it’s an unattainable luxury for the 1.3bn people who don’t have access to power - and many of these households use kerosene lamps to provide light.
Kerosene lamps are fundamentally horrible things: a wobble of the table might send a lamp tumbling and your home alight. Oh, and the effects of constantly breathing fumes don’t really bear thinking about.
As far as day-to-day technology goes, GravityLight - a UK-based, crowdfunded company - is simple, effective and impactful. After fitting one to a wall and filling a dangling bag with 10 kilos of heavy stuff, it takes just a few seconds to hoist the bag up — and for an instant pool of light from the powerful LED bulb.
GravityLight’s effects go beyond the convenience of light. By replacing kerosene, not only are the twin dangers of fire and fumes removed, but the financial burden buying fuel too – vital for families with the least money to spare.
It’s not the first wind-up device to revolutionise the developing world — the wind-up radio famously helped spread HIV/AIDS education in the nineties — but GravityLight is different in that it frees users to help themselves.
The empowerment that safe lighting brings is the brightest hope here: within a safe, bright living space hovers the opportunity to use previously darkened hours for schoolwork or small business work
The empowerment that safe lighting brings is the brightest hope here: within a safe, bright living space hovers the opportunity to use previously darkened hours for schoolwork or small business work. Light can be a lifeline out of poverty, in both the short- and long-term.
Obsessive shed-enthusiasts, and owners of dark nooks and crannies take note — you too can buy them online - and help support the GravityLight foundation.
Crowdsourcing from the unconnected billions
The big smartphone apps are based around one thing: instant communication. Facebook, Messenger, WhatsApp, Snapchat, Instagram — they all simply shift a message from one person to another. It seems almost too trivial to note that phones are the gateway to mass communication and information.
In the age of WhatsApp and Messenger, 20 billion SMS messages are still sent every day
But here’s a well-actually nugget of info to remember for the next time someone mentions that, durrr, no-one sends SMS messages any more: 20 billion of them are sent every day.
One explanation for that huge number is that people in the developing world –where internet connectivity is often scarce, expensive, or both – rely on SMS messaging to share information. “Feature phones,” or non-smartphones, sell in vast quantities: nearly 400 million were shipped in 2016.
Here’s a problem that needs fixing: there are half a billion smallholder farmers in the world, most living on less than $1 a day — and they mainly live in remote areas with little or no internet access. We take for granted instant access to the sum total of human knowledge, but it’s beyond their reach – yet it would allow them to grow more food, or sell crops at a better price.
So WeFarm created a peer-to-peer network that anyone with a “dumbphone" can access via the universal magic of SMS. Not sure why your wheat crop is failing this year? Send a single text asking for advice, and a flood of expertise returns.
Or, as WeFarm puts it, “A farmer in Kenya can learn from someone in Peru… without leaving the farm, spending any money or having access to internet.”
Suddenly, vital information is loosened from its high-tech mooring - yet still takes advantage of it: not only can a farmer ask a question, but the best answers are collated from parts of the world they could never usually reach.
That’s a remarkable development, and it works: so far, over 5 million SMS messages have been sent through WeFarm. And the leaps forward are remarkable: by scouring the globe, innovative ideas, siloed in one location for generations, are quickly shared everywhere, for everyone’s benefit - and all via phones we call “dumb.”
Tractors. Wait, tractors?
The Internet of Things is generally a smart household object that either does something a bit better than it did previously, or, as demonstrated in the glut of examples collected by cult Twitter account @internetofshit, much worse.
But while we ponder whether we really need to see the inside of the fridge without simply opening the door, in Nigeria, the Internet of Things is transforming the work, lives, and yields of thousands of farmers. It turns out the smartest Internet-of-Things-thing is... a tractor.
It turns out the smartest Internet-of-Things-thing is... a tractor.
Buying a tractor is beyond the reach of most Nigerians: a cruel irony for people living in a country blessed with plenty of farming land. It means that working the land is hard, long and laborious. Now, another simple idea coupled with basic technology has the potential to liberate farmers and their families from back-breaking work.
Hello Tractor, despite a cute and colourful website, is a concept low on glamour, high on impact, and also works via SMS. Farmers who want to use a tractor at an affordable price send a text, and they’re connected with local tractor owners who will loan it to them for an affordable price. Their machines have sturdy GPS chips to help track when breakdowns occur and where the machines are working at any given time.
What’s so good about the system is that it’s a win-win for all involved. For small farmers, quicker tilling or ploughing of land means lower overheads, more food, and more profit; and tractor owners can safely rent out their machines, and make more money for their families.
It’s a solid business model where demand outstrips supply, thus also encourages budding entrepreneurship. To seed more tractors for Nigeria’s 35 million small farmers, Hello Tractor is also helping to connect people with local microfinancing services. Fairer loans for farmers to buy tractors means that they can be rented out to even more smallholders.
It’s heartening to see that human technological progress isn't just for some of us to try out brand new technology, but that the wider world can take advantage it, regardless of circumstance. It also sets a thoughtful benchmark for those of us fortunate to be relatively wealthy: by all means, enjoy exciting new tech - but maybe we can all think of ways of using it to empower those of us in greater need.


Mobile Number |<PHONE_NUMBER>
email |<EMAIL_ADDRESS>Flat no 201, Aracade plaza
Barkatpura
Hyderabad | Telangana
| Allergy | Description |
|---|---|
| Cow Milk | Adverse effect on patient stomach |
| Penicillin | Adverse effect |
| Peanuts | Peanuts and other nuts |
| ICD Code | Description |
|---|---|
| A00 | Cholera |
| A049 | Bacterial intestinal infection, unspecified |
| W55 | Bitten or struck by other mammals |
| Complaint | Description |
|---|---|
| Head Ache | Adverse effect on patient's left part of head |
| Pain | Stomach pain |
| Hearing | Left Ear not receptive |
| Test Date | Test | Result | Image | Remarks |
|---|---|---|---|---|
| 12/Sep/2018 | CBC | Normal | Need Second test | |
| 12/Sep/2018 | Glucose | High | Need Second test | |
| 12/Sep/2018 | SGPT | Normal | Need Second test |
| Vaccine Code | Immunization Date | Age at Immunization | Immunization Alert | Adverse Reaction |
|---|---|---|---|---|
| FLU | 12/Sep/2000 | 20 | Not Effective | None |
| DRT | 25/Sep/2011 | 25 | None | None |
| FLU | 05/Jan/2012 | 30 | Not Effective | Yes |
Sick Leave Certificates
MEDICAL CERTIFICATE FOR LEAVE OR EXTENSION OF LEAVE OR COMMUTATION OF LEAVE
Signature of the Government servant .............................
I ....................................after careful personal examination of the case
hereby certify that
Shri/Smt./Kumari …………..............................whose signature is given above as
suffering from
.................................... and I consider that period of absence from duty of
...................... with
effect from ....................... is absolutely necessary for the restoration of his /
her health.
Authorised Medical Attendant
………………………….Hospital/ Dispensary of other Registered Medical Practitioner .
Dated: .................
NOTE I: The nature and probable duration of the illness should be specified.
NOTE II: This form should be adhered to as closely as possible and should be filled in
after the signature of the Government servant has been taken. The certifying Officer is
not at liberty to certify that the Government servant requires a change from or to a
particular locality, or that he is not fit to proceed to a particular locality. Such
certificates should only be given at the explicit desire of the administrative concerned,
to whom it is open to decide, when an application on such grounds has been made to him,
whether the applicant should go before a Civil Surgeon or Staff surgeon to decide the
question of his / her fitness for service.
NOTE III: Should a second medical Opinion be required, the authority competent to grant
leave should arrange for the second medical examination to be made at the earliest
possible date by a medical officer not below the rank of a Civil Surgeon or Staff
Surgeon, who shall express an opinion both as regards the facts of illness and as regards
the necessity for the amount of the leave recommended and for this purposed he may either
require the Government servant to appear before himself or before a medical officer
nominated be himself.
NOTE.IV: No recommendation contained in this certificate shall be evidence of a claim to
any leave not admissible to the Government servant.
I will be the leader of a company that ends up being worth billions of dollars, because I got the answers. I understand culture. I am the nucleus. I think that’s a responsibility that I have, to push possibilities, to show people, this is the level that things could be at. I think that’s a responsibility that I have, to push possibilities, to show people, this is the level that things could be at.
I think that’s a responsibility that I have, to push possibilities, to show people, this is the level that things could be at. I will be the leader of a company that ends up being worth billions of dollars, because I got the answers. I understand culture. I am the nucleus. I think that’s a responsibility that I have, to push possibilities, to show people, this is the level that things could be at.


Select Video
Upload Video
Films
Scene Search
Try it on a phone
Text a short video to: +1<PHONE_NUMBER>


Copyright ©2003 W3C®(MIT, ERCIM, Keio), All Rights Reserved. W3C liability, trademark, document use and software licensing rules apply.
SOAP 1.2 intermediaries have some license when reserializing messages that pass through them. This document defines a transformation algorithm that renders all semantically equivalent SOAP messages identically. The transformation may be used in conjunction with an XML canonicalization algorithm prior to the generation of a message digest in producing XML digital signatures that are sufficiently robust to survive passage through one or more SOAP intermediaries.
This section describes the status of this document at the time of its publication. Other documents may supersede this document. A list of current W3C publications and the latest revision of this technical report can be found in the W3C technical reports index at http://www.w3.org/TR/.
Publication as a Working Group Note does not imply endorsement by the W3C Membership. This is a draft document and may be updated, replaced or obsoleted by other documents at any time. It is inappropriate to cite this document as other than work in progress.
This document is the work of the W3C XML Protocol Working Group, and no more work from this Working Group is currently expected on this document.
The XML Protocol Working Group is part of the Web Services Activity.
Comments on this document should be sent to the publicly archived mailing list<EMAIL_ADDRESS>Patent disclosures relevant to this specification may be found on the Working Group's patent disclosure page.
1. Introduction
1.1 Notational Conventions
2. The Need for SOAP Message Normalization
2.1 A Simple Example
3. Specification of SOAP Message Normalization
4. Use in XML Security
5. References
5.1 Normative References
5.2 Informative References
A. XSLT Implementation (Non-Normative)
B. Acknowledgements (Non-Normative)
SOAP 1.2 [SOAP Part1] intermediaries have some license when reserializing messages that pass through them. Current XML canonicalizations (see [XML C14N] and [EXCL C14N]) do not take into account the transforms that a SOAP intermediary can legally apply to messages passing through it. This document defines a transformation that renders all semantically equivalent SOAP messages identically. This transformation may be used in conjunction with an XML canonicalization algorithm prior to the generation of a message digest in producing XML digital signatures that are sufficiently robust to survive passage through one or more SOAP intermediaries.
The keywords "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT", "SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in this document are to be interpreted as described in [RFC 2119].
This note uses a number of namespace prefixes throughout; they are listed in Table 1. Note that the choice of any namespace prefix is arbitrary and not semantically significant (see [XML InfoSet]).
| Prefix | Namespace | Notes |
|---|---|---|
| env | "http://www.w3.org/2003/05/soap-envelope" | A normative XML Schema [XML Schema Part1], [XML Schema Part2] document for the "http://www.w3.org/2003/05/soap-envelope" namespace can be found at http://www.w3.org/2003/05/soap-envelope. |
Namespace names of the general form "http://example.org/..." and "http://example.com/..." represent application or context-dependent URIs (see [RFC 2396]).
All parts of this note are normative, with the exception of examples and sections explicitly marked as "Non-Normative".
As a simple example of the kind of problem a SOAP intermediary can cause for an XML signature, consider the following SOAP message:
<env:Envelope xmlns:env="http://www.w3.org/2003/05/soap-envelope"> <env:Header> <n:alertcontrol env:mustUnderstand="false" xmlns:n="http://example.org/alertcontrol"> <n:priority>1</n:priority> <n:expires>2001-06-22T14:00:00-05:00</n:expires> </n:alertcontrol> </env:Header> <env:Body> <m:alert xmlns:m="http://example.org/alert"> <m:msg>Pick up Mary at school at 2pm</m:msg> </m:alert> </env:Body> </env:Envelope>
A SOAP intermediary is at liberty to remove the
env:mustUnderstand
attribute from SOAP header blocks
when its value is "false" or "0".
If the message included a signature of the header block
generated using XML Canonicalization [XML C14N] or
Exclusive XML Canonicalization [EXCL C14N] then
that signature would be invalidated if the intermediary removed
the mustUnderstand
attribute. There is therefore a
requirement for a transformation that takes into account the
variations that a SOAP intermediary can introduce. SOAP Message
Normalization fulfils this requirement.
SOAP Message Normalization is specified as an XML infoset transformation and consists of the following steps:
A SOAP Header
element information
item that has no child element information items is
removed.
If a SOAP Header
element information
item is present then for each child element information item
of the SOAP Header
element information item:
If the SOAP mustUnderstand
attribute
information item is present with a value of
"0" or "false" then remove the
mustUnderstand
attribute information
item.
If the SOAP mustUnderstand
attribute
information item is present with a value of
"1" then change its value to
"true".
If the SOAP role
attribute information
item is present with a value of
"http://www.w3.org/2003/05/soap-envelope/role/
ultimateReceiver" or "" then remove
the role
attribute information item.
If the SOAP relay
attribute
information item is present with a value of
"0" or "false" then remove the
relay
attribute information
item.
If the SOAP relay
attribute
information item is present with a value of
"1" then change its value to
"true".
Processing instruction information items that are
children of the SOAP Envelope
, Header
,
Fault
, Code
, Subcode
, Value
,
Reason
, Text
, Node
and Role
element information items are removed.
Whitespace character information items that are
children of the SOAP Envelope
, Header
,
Fault
, Code
, Subcode
, Value
,
Reason
, Node
and Role
element
information items are removed.
SOAP Message Normalization may be used as a Transform
algorithm in XML Digital Signature [XML DSig]. Use of
a separate CanonicalizationMethod
such as XML
Canonicalization [XML C14N] or Exclusive XML
Canonicalization [EXCL C14N] is required. SOAP
Message Normalization is identified with the following URI:
"http://www.w3.org/2003/10/soap12-n11n"


(well) You ask me ’bout the clothes I wear
And you ask me why I grow my hair
And you ask me why I’m in a band
I dig doin’ one night stands
and You wanna see me do my thing
All you gotta do is plug me into high
I said high
High voltage rock ‘n’ roll
High voltage rock ‘n’ roll
High voltage, High voltage
High voltage rock ‘n’ roll
rock ‘n’ roll
You ask me why I like to dance
And you ask me why I like to sing
And you ask me why I like to play
I got to get my kicks some way
and You ask me what I’m all about
Come and let me hear you shout high
I said high
High voltage rock ‘n’ roll
High voltage rock ‘n’ roll
High voltage, High voltage
High voltage rock ‘n’ roll
rock ‘n’ roll
I said high, I said high
Waaaah!
High voltage rock ‘n’ roll
High voltage rock ‘n’ roll
High voltage, high voltage
High voltage rock ‘n’ roll
(mumble, mumble…)
Spotlight, put the lights out, happy hour!
High voltage rock ‘n’ roll
High voltage rock ‘n’ roll
Wine, women and song
High voltage, high voltage
Wine women and song
High voltage rock ‘n’ roll


Polygit-Node Demo
This service is running
polygit-node
Custom Elements
The x-foo element says
PolymerElements
Some Button


La Leo Luxury par excellence Guest House is spectacular and stands distinctly apart with its own classic style.
Located en route to Molopo Game Reserve, Khatu mines and situated opposite to Vryburg Pick n' Pay.
Kuruman is 140 km from the guest house. Spacious eight luxury A/c rooms with Big 5 feeling to pamper the guests.
La leo guest house has international standards and provides excellent services to our guests.
One will experience a healthy and comfortable stay to remember.
This Guest House is a star above. You are most welcome to stay here and grade yourself to this guest house.


SceneJS
- enabling and disabling rendering of backfaces for a subgraph
The teapot in this example is wrapped by a 'flags' node - we're toggling the 'backfaces' flag
on that node, which controls whether or not the teapot's backfaces are rendered.


This is a simple angular2 website that uses Spotify Web API to find and display albums and tracks listings


Every time you instantiate the router you need to supply it with a HashMap
.
Following steps are usually followed:
HashMap
HashMap
to RouterLoader
With few tricks we can move 2 first steps to compilation time so that we skip parsing overhead during runtime
(up to ~20x faster). In this example we're using Kryo
library for serialization of the router map
(compile time). Once app is running we use Kryo again to deserialize.
First we add our serialization task in build.gradle
e.g.
// make sure you have all the dependencies in place import org.yaml.snakeyaml.Yaml import com.esotericsoftware.kryo.Kryo import com.esotericsoftware.kryo.io.Output buildscript { /** * */ dependencies { classpath 'com.esotericsoftware.kryo:kryo:2.20' } } // define serialization task task serializeRouterMap { doFirst { String yamlString = new File(router.path).getText('UTF-8') LinkedHashMap<String, Object> routerMap = new LinkedHashMap<>( (Map<String, Object>) new Yaml().load(yamlString) ); // using linked hash map to preserve order try { File e = new File(router.path + ".kryo") Kryo kryo = new Kryo() Output output = new Output(new FileOutputStream(e)) kryo.writeObject(output, routerMap) output.close() println "[serialize router] OK" } catch (Throwable t) { println "[serialize router] FAIL..." + t.toString() } } } // hook serialization task into build process project.afterEvaluate { prepareDebugDependencies.dependsOn(serializeRouterMap) prepareReleaseDependencies.dependsOn(serializeRouterMap) }
Once you have serialization part ready, code down something like this to deserialize in your app
public static HashMap loadHashMap(Context context, String filename) { Kryo kryo = new Kryo(); try { InputStream is = context.getAssets().open(filename); Input input = new Input(is); HashMap data = kryo.readObject(input, LinkedHashMap.class); return data; } catch (Throwable t) { Log.e("loadHashMap", "loading map error", t); } return null; }


A void space modulating in mysterious ways, / Look at the stars, / We are so far apart,
Norwegian electronic band, Lemaitre, was the focus of a study in which I experimented with how to work with a song's musical qualities and embed that within its typography. Lemaitre's pop-like repetition, use of depth and distance, along with their use of noise and distortions led me towards the visual language that I presented. This project consisted of an album cover and its corresponding process book of fifty potential album covers.


Some quick example text to build on the card title and make up the bulk of the card's content.
Some quick example text to build on the card title and make up the bulk of the card's content.
Some quick example text to build on the card title and make up the bulk of the card's content.
"We live in a world that has walls and those walls need to be guarded by men with guns."
Our SECURITY SERVICES group is known as one of the most prominent names in the security industry. The Group is among the first ISO 9001:2015 certified organizations providing Security Analysis for Organisations, Security testing and Security consulting, Guarding, Facility & Fleet Management, Background Screening, Corporate Intelligence & Investigations to MNC’s, Corporates, Banks & Financial Institutions, Embassies, Star Properties, Pharmaceutical Companies and large industries. There is no security challenge that wouldn't take on by our team of professionals from the defence and civil security sector Security Services Provider in Guntur. Our philosophy has always been that to provide our customers with the best Security Services in the industry and focus on excellent customer services. When you combine with our dedication to provide great services with our advanced technology, you can rest assured that your homes as well as your business places is protected with the peace of mind you deserve!
then,you are on the right place..!
our security services are faithful and impressive.
submit your resume..!