What is a responsive site?
A responsive site is a website is one that is easy to find your way around and use whether you are looking at it on a mobile phone or ipad or desktop. So if you go from one device to another the website should behave the same in terms of image size, layout and ease of use.
Why is responsiveness important?
Responsivensess is important because of the ever changing world of digital technology. More people today own a mobile phone than those that have access to hot running water. And in wealthier parts of the world many individuals use more than one type of device daily. Designing websites for each type of device is inefficient therefore designing a website so it works well on any device means that the website can keep pace with any change in digital technology so that you and I can still easily access the information we need.
What is mobile first design?
Mobile First Design can most easily be understood as an approach to building something that says start with the most important stuff first and add other things on as space allows. Its a bit like building a house on a budget;the house is the website, the budget is the device. So if you have a small budget to start with you build the essentials as your budget gets bigger you can add more features and “nice to haves”. Because the smallest screens have the biggest limitations it means it is important to get the essentials of your build right from the beginning.
Frameworks
Frameworks for web development can be thought of in the same way as specialist power tools for building. When you are building a house you can use simple hand tools that will get the job done but will inevitably be a lot slower. Power tools not only speed up the basic process of building but they allow us to more easily customise the house to fit our needs. We don't have to use all the power tools available just those that are going to allow us to build the type of house we need. The benefits of using frameworks are that they speed the process up so that we can spend more time on the more complicated elements of the build. The downside of using frameworks is that perhaps the skill in building a site from scatch is not honed and therefore maybe more prone to mistakes. Perhaps too there is a loss of originality when relying on frameworks to build a website. There maybe some times where simple handtools do a better job then fancy powertools.
Wireframes
A website wireframe is a bit like a back of the envelope house plan. It clearly shows the essential elements of the design but it is not the finished plan and is open to change. From this simple &lqdo;back of the envelope design&rqdo;more detailed plans can be developed before building begins however the orignial design still forms the central point of reference for the build.
Wireframes are essential in the development of any design because without them the build can lack cohesion. Without a visual guide of essential elements it would be too easy to design addtional features and content that may not add to the functionality of the website.
I found the most difficult elements of my wireframe to implement were the two columns that were to hold the images and the blog post. Fitting the images to the column proved too difficult and in the end I had to change my design in order to progress.


THE MOD SQUAD (M). (MGM/UIP) Director: Scott Silver Stars: Claire Danes, Giovanni Ribisi, Omar Epps, Dennis Farina, Josh Brolin, Michael Lerner, Steve Harris, Richard Jenkins.
Another old tv series is revisited and updated for the '90's. However, this lacklustre big screen version of The Mod Squad, which originally ran from 1968 to 1973, joins other dud adaptations such as The Beverly Hillbillies, Lost In Space and the recent My Favourite Martian.
The original series centred around a squad of delinquent teenagers put back onto the streets by a tough but sympathetic cop, who used them to infiltrate seedy bars and clubs and street gangs in an effort to fight crime. This big screen version takes the same premise, but basically trashes it with a formulaic and unoriginal plot that involves crooked cops and illicit drug deals.
This '90's version also loses the rebellious anti-establishment undercurrents that were prevalent in the '60's and '70's, and which gave the series an unusual edge. This new look Mod Squad is little more than an average television movie, and is unlikely to appeal to the same audiences that remember the similarly themed 21 Jump Street with more affection. The script is trite and predictable, the dialogue terribly clichéd and the characters one dimensional. Scott Silver's direction is pedestrian.
The three stars lack rapport, and their performances are uncomfortable, flat and uncharismatic. Claire Danes does the best she can with the undemanding role of Julie Barnes, the street wise former drug addict. Giovanni Ribisi (from The Other Sister, Saving Private Ryan, etc) brings an intensity to his performance as Pete Cochrane, the rich kid turned bad, that seems misplaced given the almost comic book quality of the material. Omar Epps (from Higher Learning, etc) gives his Linc Hayes all the life and energy of a lump of wood. Veteran Dennis Farina is wasted as the squad's mentor Adam Greer, whose murder kick-starts the plot.
The ending conveniently leaves the way open for a sequel. However, if prolific producer Aaron Spelling was hoping to turn The Mod Squad into a successful new movie series he has sadly under estimated the intelligence of the audience and over estimated the quality of the banal script.
*1/2 greg king http://www.netau.com.au/gregking
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


{title:'Config', created:'8.0.0'}
The following methods can be used to define the configuration for your microservice using the powerful Config API:
If you do not specify any of this information, we attempt to resolve it through the following methods:
If no configuration file is found, and empty in-memory configuration is used.
The {@link oaj.microservice.Microservice.Builder#configName(String) configName(String)} method allows you to explicitly specify the name of the external configuration file location for your microservice.
| Microservice
| .
By default, we try to find the file on the file system and then the classpath. If located on the file system, then the configuration is writeable and the microservice can automatically listen for and react to changes in the configuration file on the file system. If located on the classpath, then the configuration can still react to modifications made to it through the Config API but the changes cannot be persisted since the location prevents the file from being modified.
The {@link oaj.microservice.Microservice.Builder#configStore(ConfigStore) configStore(ConfigStore)} method can be used to explicitly specify a configuration store. This can include your own custom configuration store, such as one that's implemented in a relational database.
| Microservice
| .
The {@link oaj.microservice.Microservice.Builder#config(Config) config(Config)} method can be used to explicitly specify a {@link oaj.config.Config} file as the microservice configuration. When this method is used, the above two methods are bypassed entirely.
| Config
Once the configuration is resolved, it is made as the system default configuration available through the {@link oaj.config.Config#getSystemDefault()}.
This in turn allows it to be used by REST resources that reference the system default configuration via the BasicRestConfig interface.
|
The {@link oaj.microservice.Microservice#getConfig()} method can be used to get access to the configuration.
| Config
Changes to the configuration file can trigger notifications that can be used to restart your microservice or make various other on-the-fly changes. This can be accomplished by either overriding the {@link oaj.microservice.Microservice#onConfigChange(ConfigEvents)} or implementing a listener and using the {@link oaj.microservice.MicroserviceListener#onConfigChange(Microservice,ConfigEvents)} methods. These will be described in detail later.


Toggle navigation
PionixTest
Dashboard
Profile
Logout
Dashboard
(current)
Projects
Edit Project {{project.id}}
Title
Description
{{project.description}}
Save


--- layout: cs_course --- {% capture class_name %}{{ page.categories[0] }}{% endcapture %} {% if page.categories.size > 1 %} {% capture topic %}{{ page.categories[2] }}{% endcapture %} {% capture semester %}{{ page.categories[1] }}{% endcapture %} {% else %} {% capture topic %}{{ page.categories[1] }}{% endcapture %} {% capture semester %}base{% endcapture %} {% endif %}
Below are a list of Notes and Practice Problems related to this course. Notes are longer explanations of topics that are discussed in class. They include simpler examples and are aimed at being conceptual. Practice problems are tougher, discussion-level and exam-level material that allows you to practice what you have learned. Almost all problems include solutions but allow you to work before viewing the answers. If you have any questions about adding more material, contact me.
Whoops, looks like there aren't any notes for this class yet. Contact me if you would like specific content to be added here.
{% else %}Whoops, looks like there aren't any practice problems for this class yet. Contact me if you would like specific content to be added here.
{% else %}Below are a list of practice problems, test what you've learned!


Getting used to the city
The area where we were staying was renowned for a pork stick dish, so of
course we
tried it and it was delicious. It was grilled pork on a stick with an amazing sweet
peanut butter sauce. It also came with a vinegary sauce and a mix of comcomber, red
onion and peppers (You are supposed to stick those at the end of the stick to make a
“brochette”) One of the main thing we noticed about the food was that most people
take it to go, food stand don’t always have stool for you to sit on or plates to
serve....  The sauce of the pork was in one bag, the pork
in an other, the vinegar.. you get it, and all of that was of course in one bigger
plastic bag.
For something like the porkstick, eating out of a bag was fine but try with a soup….
So for our own good, we bought 2 bowl and a kit of utensils. With that, we were
armed to try any type of meal we wanted (The fun part is that we hesitated to buy
them at first, but we are using them almost every day now, it’s one of those
(must have item) By the way, when you
order drink from a stand don’t forget to ask for a cup otherwise it’s in a plastic
bag again…
 It’s not really an historical site but more like a huge garden with
some new and old construction representing the old Siam.
Really beautiful and a nice place to have a good understanding of what thailand used
to look like. It costed us 500 baht per ticket but the real price is 700 baht per
ticket for foreigner (locals pay WAY cheaper). Here’s the trick we used. We bought
them online. They are cheaper and you don’t even need to print them, it’s very
convenient. Included in that price is a bicycle, use it! The parc is around 200
acres so if you want to visit everything and do not want to get too tired, the bike
is perfect. (Side note: there's one temple on the propriety for which you need to be
coverder to visit but they lend long skirt and shirt for free,
(Here’s more about dress code in Asia)
Be ready to get your shoes on and off, and on again and off again because if you
want to enter in the buildings, you need to remove your shoes.. don’t worry they
won’t get stolen, there’s too many!
To get to the Ancient city, we took the
BTS (here’s more information about the
BTS and MST in bangkok) the site is a bit far but you can get pretty close
with the skytrain and then take a taxi from there, it way cheaper than taking a taxi
from Downtown or a bus tour.
In Bangkok, we also visited one of those famous night market and frankly I was
deceived. It was more of a touriste thing than a real Thai market. We had a better
idea of what a real market looks like with the one next to our place, it was smaller
but real. The night market was still a fun experience, there was people, food and
many many stands to discover.
The last day we had in Bangkok, we took a
ferry to the royal palace.
(not the same ferry than the one crossing the
river) it’s a tourist ferry that get you from one tourist attraction to
another.
We took it only one way because we really just wanted a nice long boat ride… In the
end, we didn’t visit the royal palace, we already visited the ancient city and we
knew that the royal palace wasn’t an historical and magistical monument so we
decided to skip it. (We also heard it was too expensive for what it actually was,
and that you need to be covered for the visit…) After 10 day in Bangkok, it was time
to repack our bags
(here’s an overview of our bags
for the trip) to leave this beautiful city and flight to Phuket, an island
in the south of Thailand.


data privacy/Google Analytics
This website uses Google Analytics, a web analytics service provided by Google, Inc. (“Google”). Google Analytics uses “cookies”, which are text files placed on your computer, to help the website analyze how users use the site. The information generated by the cookie about your use of the website will be transmitted to and stored by Google on servers in the United States .
In case IP-anonymisation is activated on this website, your IP address will be truncated within the area of Member States of the European Union or other parties to the Agreement on the European Economic Area. Only in exceptional cases the whole IP address will be first transfered to a Google server in the USA and truncated there. The IP-anonymisation is active on this website.
Google will use this information on behalf of the operator of this website for the purpose of evaluating your use of the website, compiling reports on website activity for website operators and providing them other services relating to website activity and internet usage.
You can disable Google Analytics by clicking the following link:
Deactivate Google Analytics.
CSS for this example
/* The Popup Container*/
.ga-secra-widget-cont {
background-color: #303030;
border-radius: 12px;
color:#ffffff;
}
/* The Popup Container if Google Analytics hasn't been deactivated*/
.activated {
background-color: #a0ff67;
color:#303030;
}
/* The Popup Container if Google Analytics has been deactivated*/
.deactivated {
background-color: #ff6e47;
color:#303030;
}
/* The Popup Container if Google Analytics is already deactivated*/
.already {
background-color: #faff5e;
color:#303030;
}
/* The "Yes" Button*/
.yes_button {
margin: 5px;
border-radius: 5px;
}
/* The "No" Button*/
.no_button {
margin: 5px;
border-radius: 5px;
}
/* The "OK" Button*/
.ok_button {
cursor: pointer;
}


Teletext 40
Example Rendered in M7GLX font
Frames:
Sample Frames...
Teletext40 2015-04-22
Keyboard Frustration
Jeff Running
Muybridge's Horse
Swirl
Seven Segment Display
Annoying Hampster
Annoying Banana
Page:
+
-
Sub:
+
-
/
1
Reveal
Play
ms
Teletext font by
<EMAIL_ADDRESS>2015
Home
Top
Static
Email


{{current_venue}}
Type a city name into the search box to see detailed statistics for that city. Use the timeline to filter the events.
 I'm sorry it's so slow.)
City Statistics
Artists
Venues
Displaying events from
{{extent.dateMin | date:'fullDate'}}
to
{{extent.dateMax | date:'fullDate'}}


--- layout: default title: TANN'17 - Bank to Bank Transfer meta: Bank to Bank transfer information provide for payment. keyword: nanotechnology conference, nanofluid conference, nanomaterial conference, nanoparticle conference, nano conference, nanotube conference, nanocatalysis conference, nanoelectronics conference, graphene conference, drug delivery conference, tissue engineering conference, nanotechnology and coating conference, nanotechnology market conference, nanotechnology modeling conference, nanotechnology simulation conference, nanobiotechnology, nanobiomechanics, nanodevices, nanotechnology, nanofluid, nanomaterial, nanoparticle, nano, nanotube, nanocatalysis, nanoelectronics, graphene, drug delivery, tissue engineering, nanotechnology and coating, nanotechnology market, nanotechnology modeling, nanotechnology simulation, nanobiotechnology conference, nanobiomechanics conference, nanodevices conference ---
If you are using this method of payment, you should note that all charges for transferring the money must be paid by the registrants or your registration will be withdrawn.
*Please make sure that you are sending the payment to International ASET Inc. Any other name will result in the rejection of your payment. We will not be responsible for payments rejected because of this reason.
The banking information required for your money transfer is as follows:
Beneficiary Name: International ASET Inc.
Transit #: 32936
Account #: 0279 - 5224563
Swift Code: TDOMCATTTOR
Address:
TD Canada Trust
Emerald Plaza
1547 Merivale Rd.
Nepean, Ontario, Canada
K2G 4V3
Tel.: +1-613-224-1188


ReForm (by SiBit) A comprehensive CRUD-like Framework specialized for implementing business processes. Based on ReForm we've build applications like a warehouse management system for our customer AfB and the asset management Software Office Asset.


The smart resturant waiting list.
Use our simple app to manage your waiting list from your PC, tablet, or phone.
No need to yell every 5 minutes. You can text a party with just a tap.
Now they can go to the bathroom and still know their table is ready.


{% load static %}
FTU Data Collection
Test Configurations
{% if s_Error != "None" %}
{{s_Error}}
{% endif %} {% if b_Saved %}
Test configuration saved successfully!
{% endif %}
View Existing Configurations
{% if l_TestConfigurations %}
{% for TestConfiguration in l_TestConfigurations %}
{{ TestConfiguration }}
{% endfor %}
{% else %}
No Test Configurations Exist
{% endif %}
Create Test Configuration
{% csrf_token %}
Test ID
Test ID must be positive and not in use
Test Description
Test Description should describe the configuration for later reference
Desired Temperature
Temperature must be between {{tc.i_MinimumTemperature}} and {{tc.i_MaximumTemperature}} (Centigrade)
Desired Voltage
Voltage must be between {{tc.i_MinimumVoltage}} and {{tc.i_MaximumVoltage}} (Volts)
Desired Magnetic Field
Field must be between {{tc.i_MinimumField}} and {{tc.i_MaximumField}} (Milli-Teslas)
Desired Test Time
Test time must be between {{tc.i_MinimumTestTime}} and {{tc.i_MaximumTestTime}} (seconds)
Desired Serial Rate
9600
Serial Rate must be 9600


“There was an interesting communication at, of all places, Salisbury railway station in 1966. I was advised by communications to build a copper cone to help my condition. Having read of the apparent Atlantean cones in Other Tongues, Other Flesh by George Hunt Williamson, with their complicated circuits, I felt unqualified to build one. The answer rapped back: 'Just build a simple cone of copper—that's not beyond you is it?' I sat up with a start—surely space people would not talk like that? But it jerked me out of my self-pity and I began a regular daily use of a cone which my father made from a piece of scrap sheet copper.” — Jimmy Goddard, Cosmic Friends


Port control monitors VHF Channel 16 and should be contacted to announce the yacht's ETA and request clearance.
Mogadishu harbour is safe, but the area where small boats anchor is shallow due to silting. Some repairs are possible as there are various workshops in the port area in Mogadishu, but they may take time.


“REVA Academy for Corporate Excellence (RACE)”
About the Event
REVA Academy for Corporate Excellence (RACE)
Venue:
Reva University
Description of Event:
REVA Academy for Corporate Excellence (RACE), an initiative of REVA University, inaugurated the new batches of Business Analytics and Cybersecurity programs for the year 2019-20 on 9th March, 2019. A biannual event, the classes for the first half of 2019 was launched with expert talks from who’s who of the Analytics and Security domains in India. The all-day event witnessed an overjoyed group of working professions starting a new phase of their life, afresh as students!
Sameer Dhanrajani, Chief Strategy Officer of Fractal Analytics delivered the inaugural address on AI and Analytics: Accelerating Business Decisions and the keynote speech by Dr.Gopal Pingali, Vice President of IBM Global Technology Services Labs was on Towards Cognitive, Hybrid and Automated IT. Sridhar Govardhan, Chief Information Security Officer of Wipro Limited addressed the new cybersecurity program participants on Cybersecurity in the Digital World while Pradeepta Mishra, Chief Data Scientist at Lymbyc shared insights on Seeing Potential: Future of AI with the fresh batch of business analytics students.
The inaugural event also witnessed expert talks by Dr.J.B Simha, Chief Mentor – RACE and CTO – ABIBA Systems, Biswajit Mishra, Cognitive Head – IpSoft and Sandeep Vijayaraghavan, CEO and Director – AforeCybesec Technologies Pvt Ltd.
During his welcome address Dr.M.Dhanamjaya, Registrar, REVA University emphasised on the importance of collaboration between universities and industries for better research and development of key technologies. Dr.N.Ramesh, Dean - Training, Placement and Planning, REVA University delivered the vote of thanks on behalf of the University.
PGDM/MBA in Business Analytics is offered in association with IBM; the program covers four key domains – marketing, finance, supply chain and text analytics. PG Diploma/MS/MTech in Cybersecurity is offered in association with IBM and the program is powered by AforeCybersec Technologies Pvt Ltd. Highlights of the cybersecurity program are Cyber Range, a virtual cyber warfare training platform and live Security Operations Centre (SOC), built within the university campus for the exclusive use of the program participants.
Some Snappets of Event


--- title: 'Data Overview' author: '' date: '' slug: [] categories: [] tags: [] weight: 5 bibliography: references.bib #runtime: shiny #output: html_document ---
Here is a plot of the data we will use in this example. It is the number of seconds that participants spent when there was no time pressure.
Here is a second plot of data for the same participants when they were under time pressure:


This page will highlights the capabilities of the Spry Auto Suggest Widget . All the samples below use a list of the Adobe products. If you start typing "Adobe", the list of suggestion will be displayed.
Default
This is an example of the Spry Auto Suggest widget.
<script type="text/javascript"> var as1 = new Spry.Widget.AutoSuggest('productSample', 'productMenu', 'dsProducts1', 'name'); </script>
Suggest list HTML structure
The suggestions can be displayed in any HTML structure. Spry uses the the tag ID to
identify the suggest list container. In this example, there are three different HTML structures based on:
table, div-span, ul-li. Because of a Safari bug we do not advise the use of tables because
you cannot navigate using the keyboard arrows.
Search text position
By default, the Auto Suggest will search into the data set for records that start with the entered
text. You can change this behavior by enabling the "containsString" option which will look for
the typed text at any position. In this example you can type directly "Acrobat" to see the Adobe
products that contains this word.
<script type="text/javascript"> var as5 = new Spry.Widget.AutoSuggest("productSampleContains", "productMenuContains", "dsProducts5", "name", {containsString: true}); </script>
Multiple dataset fields lookup
The text can be searched into multiple fields in the dataset. In this situation an array of fields
to be searched should be passed as the fourth argument. Along with the product name in this sample
the product list is also filtered by the category. When you'll type the 'web' keyword, the list of
products in categories that contain this word will be displayed.
<script type="text/javascript"> var as6 = new Spry.Widget.AutoSuggest("productSampleMultiple", "productMenuMultiple", "dsProductsmultiple", ["name", "category"], {containsString: true}); </script>
Minimal number of characters typed
Sometimes the list of suggestions could be very long therefore you can restrict its appearance
only after a user typed a minimal number of characters. In this example we display the suggest list
only after the first 3 letter of the "Adobe" are written.
<script type="text/javascript"> var as7 = new Spry.Widget.AutoSuggest("productSampleMin", "productMenuMin", "dsProducts6", "name", {containsString: true, minCharsType: 3}); </script>
Limit the number of suggestions
The AutoSuggest widget has the ability to also limit the number of suggestions. By defining a numeric non-zero value for the maxListItems option you can control this feature as you like.
<script type="text/javascript"> var as_min = new Spry.Widget.AutoSuggest("productSampleList", "productMenuList", "dsProductslist", "name", {containsString: true, maxListItems: 3}); </script>
Dynamically load data from the server
The Spry Suggest Widget has the ability to dynamically request the filtered information from the server.
In this case we will replace or append the URL of the given data set with the value inserted by the user.
You can define a URL parameter and regardless of the caching setting of that data set, we will
send the request on the server. A server side technology is required on server to filter and output
the new data XML that we will display. We provide samples for PHP, ASP and ColdFusion.
<script type="text/javascript"> var as7 = new Spry.Widget.AutoSuggest("productSamplePHP", "productMenuPHP", "dsProducts7", "name", {loadFromServer: true, urlParam: "prd"}); </script>
Note: These samples will only work when running off a server with the appropriate server technology. They are presented here for proof of concept. Try them on your own server to see them run. They use the same source XML file as used above. The source files are here:
Keyboard Navigation
The autosuggest widget has by default enabled the keyboard navigation using Up and Down arrow keys.
You can customize the keyboard keys used for the navigation feature by adding on the widget's constructor the following options: moveNextKeyCode and movePrevKeyCode that receive as value the key code.
On the bellow exapmple for navigation are used the Page Up/ Page Down keys.
<script type="text/javascript"> var as7 = new Spry.Widget.AutoSuggest("keyboard", "productMenu_", "dsProducts1", "name", {moveNextKeyCode:34, movePrevKeyCode: 33}); </script>


This website was created for Entry into the National History Day competition (in the website division). The website was written and developed by Alex Elliott and all of the research for this was conducted by Emily Studdard and Lauryn Williams.


I created a Parallax jQuery for a project I'm working on right now. All the one's I found online only worked for background images so in the typical developer way, I created my own.
This coding will allow you to use either an image or video as the parallax background.
I created a Parallax jQuery for a project I'm working on right now. All the one's I found online only worked for background images so in the typical developer way, I created my own.
This coding will allow you to use either an image or video as the parallax background.


Regex
Table of Contents
1 Deep Dive
Sample String:
fooaaaabar fooabar foobar fooaabar fooxxxbar fooxbar
We want to match the first four - so if it has an 'x' in it, we don't want. If it has an 'a' or not, we can accept it.
We want to accept 'foo | any number of 'a's (or not) | bar'.
*
is the first symbol. a*
means accept 0 or more occurences of the letter 'a'.
fooa*bar
is the solution.
2 The Basic Set
2.1 The Wildcard Symbol
fooabar fooxbar baryfoo foobar fooxybar foocbar
We want to match 1, 2 and 6.
The letter between foo and bar is unpredictable. But the frequency is the same (one letter in between).
The solution is 'foo.bar'
. The .
symbol can allow any one character.
grep 'foo.bar' regex.sample1
2.2 Wildcard Asterisk Combo
foobar barfoo fooabcbar boobxcbar barcbyfoo foozbar barafoo barabfoo
We want to accept 1, 3, 4 and 6. This means any number of any letters.
.*
is zero or more occurrences of any letters.
2.3 Representing Whitespaces
fooxxxbar foo bar fooxbar fooxxbar foo bar foo bar foobar fooyyybar
We want to accept anything that has any number of spaces and 0 spaces, but nothing else.
\s
represents one whitespace.
\s*
represents zero or more occurences of spaces.
grep 'foo\s*bar' regex.sample3
2.4 Character Classes
foo moo coo doo poo loo boo hoo
We want to accept foo, coo and loo.
We can create a character class with: [charsherer]
. It is only one character position. It is not a wildcard.
grep '[fcl]oo' regex.sample4
Now we want to exclude moo, and hoo.
grep '[fcdplb]oo' regex.sample4
is the solution. As m and h are not included in the class, they are excluded.
However, if there are too many characters in the class, it becomes unmanageable.
So, how can we exclude 'm' and 'h'?
grep '[^mh]oo' regex.sample4
is the solution. The ^
denotes anything other than these characters.
Now we are excluding characters.
2.5 Character Classes With Ranges
joo boo koo loo woo moo zoo coo
We want all the characters that are between k-m (inclusive).
grep '[j-m]oo' regex.sample5
We want from j-z.
grep '[j-z]oo' regex.sample5
Now the list is:
joo boo Koo Loo woo moo zoo coo
We want joo, Koo, Loo, moo, zoo.
Solution: ~grep '[j-mJ-Mz]oo' regex.sample6
2.6 Escaping with Backslash
xxx.yy xx.yyyy x.y xy xxyy yyxx yx yxxx
We want xxx.yy, xx.yyyy, x.yy. They all have the full-stop in common.
How do we reference the full-stop without it being seen as a wildcard?
There are special characters that mean something in regx ^, $, ., [, (, ), \.
When we backslash a character, we escape the character after it and it is passed to be a normal (literal) character.
Solution:
grep 'x*\.y*' regex.sample
x#y x:y x.y x&y x%y
We want to accept x#y, x:y and x.y.
If a '.' is inside [ ]
, it does'nt need to be escaped.
Solution:
grep 'x[#:.]y' regex.sample
x#y x:y x^y x&y x%y
We want to find x#y, x:y, and xy.
Solution:
grep 'x[#:\^]y' regex.sample
x#y x\y x^y x&y x%y
We want to find x#, x\y, xy.
Solution:
grep 'x[#\\\^]y' regex.sample
2.7 Anchors
foo bar baz bar foo baz baz foo bar bar baz foo foo baz bar baz bar foo
This is a combination of three words in different order.
We want to search for foo bar baz, and foo baz bar.
foo | bar baz foo | baz bar
foo is a fixed string. The latter part is variable. .*
will not work here as some of the other entries will also be included.
Only the strings that begin with foo will qualify. This brings us to the new character ^
which means that something at the beginning of the line - and nowhere else. Caret is also a negation symbol, if it is in the square brackets [^ ]. This means negation. If outside, it is interpreted as the place holder for the beginning of the line.
grep '^foo.*' regex.sample
Next example:
foo bar baz bar foo baz baz foo bar bar baz foo foo baz bar baz bar foo
We want to accept 'baz foo bar' and 'foo baz bar'. They both end in bar. This brings in the '$' character. This is the placeholder for the end of the line.
Solution:
grep .*bar$' regex.sample
Next example.
foo foo bar baz foo foo bar baz baz bar foo
I only want to accept only 'foo'. We can combine the anchors for this:
Solution:
grep '^foo$' regex.sample
3 The Extended Set
The extended set comes with more symbols:
| Symbol | What does it represent? |
| + | One or more occurrences of the character that precedes this + symbol |
| ? | Zero or one occurence of the character that precedes this question mark |
| pat1❘pat2 | Matches either the pattern pat1 or the pattern pat2 |
| ( ) | Divides patterns into groups |
| {m} | Exactly 'm' occurences of whatever precedes |
| {m,n} | At least m and n occurences of whatever precedes. Only one of m, n is mandatory. Other can be left blank |
3.1 Curly Braces Repeater
834 519 4874 5 89 45687 25 645
We want to select 834, 519, 645. These are all three digit numbers. That is the pattern.
This is how it could be represented:
^[0-9][0-9][0-9]$
This is duplication though. What if it were 8 numbers. This doesn't scale.
Solution:
grep '^[0-9]{3}$' regex.sample
Note that we have to have the anchors as some of these numbers are more than 3 digits, which means they would still match. The anchors prevent this.
Next example:
lion tiger leopard fox kangaroo bat mouse cuckoo deer
We want lion, tiger, mouse, cuckoo, deer. We have 4, 5 and 6 letter words.
This could be represented as this:
^[a-z]{4}$ ^[a-z]{5}$ ^[a-z]{6}$
Again, this does not scale, so we can represent a range of occurrences:
^[a-z]{4,6}$
3.2 Single Ended Curly Braces Repeater
ha hahahahaha hahaha hahahaha haha hahahahahaha hahahahahahahaha hahahahahahahahaha
We want to accept, hahahahaha, hahahahahaha, hahahahahahahaha and hahahahahahahahaha.
This is a range of repetitions from 4 to 9.
Solution:
grep '(ha){4,}' regex.sample
The lack of the second digit after 4 means that this can go on infinitely to match (i.e. more than 9 occurrences).
Next example:
ha haha hahahahaha hahahaha hahaha hahahahahahaha hahahahahaha
I want to search for ha and haha only.
We have used the parenthesis to create a group of characters.
We can negate the repetition statement.
Solution:
grep '^(ha){,2}$' regex.sample


New York's Attorney General Is Investigating WeWork Over Co-Founder Adam Neumann's Business Dealings
Massive layoffs are expected at the company in the coming weeks as well.
by Ellen Cranley- Reuters reports that New York's attorney general is investigating the embattled workspace giant WeWork.
- The company confirmed it had been contacted by Attorney General Letitia James' office, which will reportedly focus on activities by WeWork's co-founder and former CEO, Adam Neumann.
- The company has faced trouble since it shelved its initial public offering and turned to its largest shareholder for a rescue deal. Massive layoffs are expected at the company in the coming weeks.
- Visit Business Insider's homepage for more stories.
New York's attorney general is investigating the embattled workspace giant WeWork, Reuters reported Tuesday.
The outlet cited two people familiar with the matter and said the company confirmed it had been contacted by Attorney General Letitia James' office.
"We received an inquiry from the office of the New York state attorney general and are cooperating in the matter," a WeWork spokeswoman told Reuters.
One point of the investigation is whether WeWork's co-founder and former CEO, Adam Neumann, indulged in self-dealing. He was widely reported to have bought properties to lease back to WeWork and to have charged the company almost $6 million to use his trademark of the word "We" for the rebranded The We Company.
The company has faced trouble since it shelved its initial public offering and took a rescue deal from its largest shareholder, the Japanese technology investment company SoftBank. Neumann stepped down as CEO in September, and the company has laid off a large portion of staff.
The company is expected to lay off thousands of employees "in earnest" beginning this week.
Reuters noted this wasn't the first time the company had caught the attention of the New York attorney general, as WeWork scrapped its policy of requiring employees to sign noncompete agreements after reaching a settlement with the attorney general last year.
This post originally appeared on Business Insider.


---
layout: post
title: quest for a mainboard (3)
date: '2006-03-05T23:18:00.000+01:00'
author: Steven Van Acker
tags:
modified_time: '2008-01-20T23:19:35.421+01:00'
blogger_id: tag:blogger.com,1999:blog-5513234137363262204.post-2694109833234189675
blogger_orig_url: http://www.singularity.be/2006/03/quest-for-mainboard-3.html
---
This is a review for the ASUS A8N32-SLI Deluxe
On this page (aswell as the previous review) it is said that the MSI motherboards have better sound than the MSI.
Considering all this, I'm going for the MSI K8N-Diamond-54G. It has more SATA controllers and better sound than the ASUS A8N32-SLI Deluxe, yet is cheaper than the MSI K8N-Diamond Plus.


Preparation time
1-2 hours
Cooking time
30 mins to 1 hour
Serves
Serves 6
Bring us some figgy pudding like no other. Thyme honey-infused figs make a delicious addition to a baked roly-poly pudding, serve with a walnut and honey ice cream.
For the caramelised walnut and honey ice cream, start with the caramelised walnuts. Place the caster sugar in a small heavy-based saucepan and heat over a medium heat until all the granules have melted and a caramel forms. Lay the walnuts on a sheet of foil and pour the caramel over the walnuts. Leave to set and cool.
Beat together the condensed milk, honey and goats’ cheese in a bowl until smooth. Whip the cream in a separate bowl until soft peaks form when the whisk is removed from the bowl and fold through the condensed milk, honey and goats’ cheese. Break up half of the caramelised walnuts and stir them through the mixture. Set aside the remaining caramelised walnuts.
Transfer the mixture to a freezer-proof container and place in the freezer - alternatively place in an ice cream maker and freeze according to manufacturer’s instructions.
For the fig filling, combine all the ingredients in a medium heavy-based saucepan with one tablespoon of water. Place over a low heat, stirring well until everything is well combined. Simmer and stir occasionally for about 10 minutes, or until the mixture is thick and the liquid has evaporated. Remove the pan from the heat and blend with a hand-held blender. Set aside for 10 minutes to cool slightly.
For the suet pastry, preheat the oven to 180C/fan oven 160C/350F/Gas 4.
Place the flour, salt, suet, ground almonds and lemon zest in a large bowl and stir together until well combined. Measure the milk into a jug and beat in the egg yolks, honey and vanilla extract. Slowly add the wet mixture to the bowl of dry ingredients and mix to a soft, but not sticky dough. Tip the dough out onto a floured surface and roll out to a 20 x 30cm/8 x12in rectangle.
Spread the fig filling onto the dough, leaving a 1cm/½in border all the way round. Gently roll the dough up from the short end, brushing with milk and transfer to a greaseproof paper-lined baking tray, seam-side down. Brush with a little beaten egg and sprinkle with vanilla sugar.
Bake for about 40 minutes, or until golden-brown, covering with a sheet of foil should the top and sides appear to be browning too much.
Remove from the oven and leave to cool slightly. Drizzle over the thyme honey to taste and place the remaining caramelised walnuts over the top of the roll. Serve with the ice cream.
You could also decorate with fresh figs (one cut in half, the other two with a cross on the top and the flesh opened slightly), plus a lemon wedge, fresh thyme and scraped vanilla pods around the pudding to reference the ingredients inside.


History of the Apple Series
- 1973: Stephen Wozniak joins HP.
- 1976: Wozniak proposes that HP create a personal computer. He is rejected.
- 1976: March - Steve Wozniak and Steve Jobs finish work on a computer circuit board, that they call the Apple I computer.
- 1976: April - Steve Jobs and Steve Wozniak form the Apple Computer Company.
- 1976: July - The Apple I computer board is sold in kit form, and delivered to stores by Steve Jobs and Steve Wozniak. Price: US$666.66.
- 1976: August - Steve Wozniak begins work on the Apple II.
- 1976: October - Wozniak remains at HP, but is soon convinced that he should leave and join Apple Computer.
- 1976: December - Steve Wozniak and Randy Wigginton demonstrate the first prototype Apple II at a Homebrew Computer Club meeting.
- 1977: April - Apple Computer delivers its first Apple II system, for $1295.
- 1977: May - 10 months after its introduction, 175 Apple I kits have sold.
- 1978: Apple Computer begins work on an enhanced Apple II with custom chips, code-named Annie.
- 1978: Apple Computer begins work on a supercomputer with a bit-sliced architecture, code-named Lisa.
- 1979: June - Apple Computer introduces the Apple II Plus, with 48KB memory, for US$1195.
- 1979: September - Apple Computer sells 35,000 Apple II computers for the fiscal year.
- 1979: October - 2.5 years after the introduction of the Apple II, 50,000 units have been sold.
- 1979: Apple Computer begins work on "Sara", the code name for what will be the Apple III.
- 1980: May - Apple Computer introduces the Apple III. Price ranges from US$4500 to US$8000.
- 1980: September - Apple Computer sells over 78,000 Apple II computers during the fiscal year.
- 1980: Apple Computer ships the first Apple III units in limited quantity.
- 1980: Apple Computer begins project "Diana", which would become the Apple IIe.
- 1981: September - Apple Computer introduces its first hard drive, the 5MB ProFile, for US$3499.
- 1981: Apple Computer officially reintroduces the Apple III, with improved software and a hard disk.
- 1982: Sales of Apple II Plus to date: 45,000.
- 1982: Sales of all Apple II systems to date: 750,000.
- 1982: Apple Computer becomes the first personal computer company to reach US$1 billion in annual sales.
- 1982: Franklin Computer Corp. unveils the Franklin Ace 1000, the first legal (at the time) Apple II clone.
- 1983: January - Apple Computer officially unveils the Lisa computer. Its initial price is US$10,000. During its lifetime, 100,000 units are produced.
- 1983: January - Apple Computer introduces the Apple IIe for US$1400.
- 1983: June - The one millionth Apple II is made.
- 1983: June - Apple Computer begins shipping the Lisa.
- 1983: June - Video Technology introduces the Laser 3000, an Apple II workalike microcomputer.
- 1983: June - Unitronics shows the Sonic, an Apple II workalike microcompute.
- 1983: July - Apple Computer officially begins marketing the Lisa computer.
- 1983: December - Apple Computer introduces the redesigned Apple III as the Apple III+, for US$3000.
- 1983: December - Apple unveils the new Macintosh to the press.
- 1983: Franklin shows an operating Franklin Ace 1200 Apple II compatible for US$2200.
- 1984: January - Apple releases a new version of the Lisa computer, the Lisa 2. It uses all new software, as well as the Macintosh operating system.
- 1984: January - Apple Computer's Steve Jobs introduces the Apple Macintosh.
- 1984: April - Apple Computer unveils the Apple IIc, priced at US$1300.
- 1984: April - Apple Computer retires the Apple III and Apple III+, with only 65,000 units sold in total (90,000 made).
- 1984: May - Apple Computer announces that 70,000 Macintosh computers have been shipped in the first 100 days since its announcement.
- 1984: September - Apple Computer introduces the Macintosh 512K for US$3200.
- 1984: November - The 2 millionth Apple II computer is sold.
- 1984: Apple sells the 250,000th Macintosh system.
- 1985: January - Apple Computer officially renames the Lisa the Macintosh XL.
- 1985: March - Apple Computer introduces the Apple Enhanced IIe.
- 1985: April - The Macintosh XL (formerly called Lisa) is dropped from Apple Computer's product line.
- 1986: January - Apple Computer introduces the Macintosh Plus. Price is US$2600.
- 1986: April - Apple Computer discontinues the original Macintosh and the Macintosh 512K.
- 1986: April - Apple Computer introduces the Macintosh 512K Enhanced, for US$2000.
- 1986: July - Apple Computer discontinues the Macintosh XL.
- 1986: September - Apple Computer introduces the Apple IIGS, with the Apple 3.5 drive, for US$1000.
- 1987: January - Apple Computer introduces the Apple Platinum IIe.
- 1987: March - Apple Computer introduces the open architecture Macintosh II, US$3900.
- 1987: March - Apple Computer makes its 1 millionth Macintosh personal computer.
- 1987: March - Apple Computer introduces the expandable Macintosh SE for US$2900.
- 1987: March - Apple Computer discontinues the Macintosh 512K Enhanced.
- 1987: Apple Computer begins shipping the Macintosh II.
- 1988: September - Apple Computer introduces the Apple IIc Plus for US$1100.
- 1988: September - Apple Computer introduces the Macintosh IIx computer, base price is US$7770.
- 1989: January - Apple Computer introduces the Macintosh SE/30, US$6500.
- 1989: September - Apple Computer announces the Macintosh Portable, for US$6500.
- 1989: September - Apple Computer announces the Macintosh IIci, for about US$8700.


On this page you can find all the information on how to set up the tool INTERSET so you can use it with your own data.
The INTERSET tool is a web application consisting of angular.js application and a node.js server. In order for the tool to work, one has to
create the appropriate sqlite database and fill it with required data.
In order to work, the tool requires several packages. Links to this packages are provided in the "References and links" page.
The database allowing full functionality contains 13 tables. We proved the sqlite code to create each of them.
CREATE TABLE DataTable(elementID int, attributeID int, elementValue double);
CREATE TABLE ElementTable(elementID int, elementName VARCHAR(255), elementDescription VARCHAR(255));
CREATE TABLE RedescriptionAttributeTable(redescriptionID int, attributeID int, attributeMinValue double, attributeMaxValue double, negated int DEFAULT 0);
CREATE TABLE RedescriptionElementTable(redescriptionID int, elemetID int);
CREATE TABLE RedescriptionTable(redescriptionID int, redescriptionLR VARCHAR(255), redescriptionRR VARCHAR(255), redescriptionJS double, redescriptionSupport int, redescriptionAM1 double, redescriptionAM2 double,...);
CREATE TABLE AttributeTable(attributeID int, attributeName VARCHAR(255), attributeDescription VARCHAR(255), view int);
CREATE TABLE SOMClusters(elementID int, SOMClusterID int);
CREATE TABLE ElementCoverage(elementID int, redescriptionCount int);
CREATE TABLE SomDimensions(NumRows INTEGER, NumColumns INTEGER);
CREATE TABLE MeasuresNames(measureID int, name VARCHAR(255), type VARCHAR(255), displayName VARCHAR(255), shortName VARCHAR(255));
CREATE TABLE AttributeCoocurenceTable(coocurence int, attributeID1 int, attributeID2 int);
CREATE TABLE AttributeFrequencyTable(frequency int, attributeID int, attributeName VARCHAR(255));
CREATE TABLE CategoryTable(attributeID int, categoryValue double, categoryName VARCHAR(255));
DataTable contains the element value for all attributes used in redescription mining process. The ElementTable contains additional information about elements such as element descriptions or loger labels if available.
The RedescriptionAttributeTable contains information about redescription attributes for each redescription in the redescription set. For now, the RedescriptionTable must contain all fields up to and including redescriptionSupport. Fields occuring after that are optional and represent additional redescription quality measures.
Numeric attributes need to have both attributeMinValue and attributeMaxValue field defined whereas categoric attributes need to have one of those to values equal to null. The RedescriptionElementTable contains support sets for each redescription from the redescription set and the RedescriptionTable
contains values of redescriptions measures for each redescription. The AttributeTable allows defining additional attribute labels or descriptions. The SOMClusters table contains elements contained in each SOM cluster.
The ElementCoverage table contains information, for each element, on the number of redescriptions that contains it in the redescription support sets.
The SOMDimensions table contains dimensions to be used to display the SOM. Table MeasuresNames allows entering various information about redescription measures used in the process. The displayName field is used
to display the measure name in the global redescription information view, and the shortName is used in the corresponding list. It should be up to 3 letter abriviation to be put in the table header.
The AttributeCoocurenceTable contains the co-occurrence frequencies of attributes in the redescription queries while the AttributeFrequencyTable contains the occurrence of attributes in redescription queries.
The CategoryTable contains the information about categories for attribute containing categorical values. Each categoric value of such attributes must be assigned an integer code, that is used in the application.
To obtain the SOM , we used the Kohonen package for R (link available in the "References and links" page). As a input to the SOM, we used the element occourence in redescriptions contained in the redescription set. The user has to specify the layout to be used to train SOM. As an output, the SOM returns clusters embeded in the layout and element cluster membership.
The attribute heatmap uses information about attributes in redescription queries. Two information need to be computed for this exploration view: the attribute occurrence frequency in redescriptions
and the cross view attribute co-occurrence in redescriptions.
The attribute occurrence frequency can be computed with the following sql query:
SELECT COUNT(redescriptionID), ar.attributeID, attributeName FROM RedescriptionAttributeTable as ar, AttributeTable as at
WHERE ar.attributeID=at.attributeID group by ar.attributeID;
The attribute co-occurrence can be computed with the following sql query:
SELECT COUNT(a1.redescriptionID), a1.attributeID, a2.attributeID FROM RedescriptionAttributeTable as a1, RedescriptionAttributeTable as a2
WHERE a1.redescriptionID=a2.redescriptionID group by a1.attributeID, a2.attributeID;
The Crossfilter uses information about redescriptions provided in the RedescriptionTable. The measure displayNames and shortNames should be defined in the MeasuresNames table. This information is displayed at the top of each measure filter and in the redescription table list.


Examples¶
Below are some examples of tasks you may wish to perform. If you would like to see more examples, please submit an issue on github or e-mail me at michael-dot-lam-at-nanograv-dot-org.
Calculating scintillation parameters¶
Below is the very simplest way to get scintillation parameters.
ar = Archive(FILENAME) #loads archive, dedispersed and polarization averaged by default
ds = ar.getDynamicSpectrum() #without a template shape, this will average the data across the phase axis. One can set maketemplate=True to take the average pulse shape and make an underlying template
print(ds.scintillation_parameters()) #will return the scintillation timescale, scintillation bandwidth, and drift rate (rotation) using a 2D Gaussian fit
Make a Joy Division plot¶
ar = Archive(FILENAME) #loads archive, dedispersed and polarization averaged by default
ar.fscrunch() #frequency-average the data, if applicable.
ar.joyDivision() #makes the Joy-Division-style plot for pulses in time and phase
Make a template shape¶
If you are starting from a PSRFITS file, the easiest thing to do is probably the following:
ar = Archive(FILENAME) #loads archive, dedispersed and polarization averaged by default
ar.tscrunch() #time-average the data, if applicable.
template = ar.calculateTemplate() #By default, will use von Mises functions
If you already have the data array extracted, then you can go straight to the underlying functionality:
sp = SinglePulse(data,windowsize=len(data)//8) #windowsize will auto-calculate an off-pulse region
template = sp.smooth() # By default, will use von Mises functions
Comment out TOAs in a .tim file with a given condition¶
Let’s say we wish to comment out TOAs with a flag representing a specific backend: “-be legacy”


In May 2018, Thomas Vanderstraeten will run a bit more than 60km along Brussels' Green Belt in one go, in a bid to attract interest on BeCode
BeCode is a novel Belgian nonprofit providing free tech education to all, so that tomorrow's tech talents can blossom regardless of their background
The fundraising will leverage new technology in an exciting way, using crypto-currencies and smart contracts to gather and free up the funds
On the Ethereum network where they are stored, the funds can be safely consulted by all. It's just like a public ledger. The funds are locked in a snippet of code that is called a smart contract: a kind of contract that is responsible for its own execution
The funds will be wired to BeCode only if Thomas records a 60km run through the Strava running application, to which the smart contract is connected. Otherwise, the donors will get back their funds
The primary goal of this challenge is to spread the word on the existence of BeCode, so that more and more students can join and benefit from free tech education. Maybe your share will motivate someone to join!
Dive deep into an exciting new technology and perform your first crypto-currency transfer to the smart contract. What better recipient than a tech non-profit for this?
60km is a long way to go, and happiness is best when it is shared. So, hop in your running shoes and join Thomas along the path to discover Brussels' best green areas. 1km, 5km, 10km...pick your game!
Runner & Coder
Tech mentor
Running mentor


- Untidy code: LocationStruct.defineRoom is hacked together using syncronization and global variables. This creates untidiness and possible bottleneck.
- Security issue: LocationStruct.addEntity should not be publicly exposed. This neccesitates that models can not exist without controllers.


{{ extends 'global/Page.html' }} {{ block title }}Thank You{{ endblock }} {{ block content }}
The experiment has finished.


{% extends 'site_base.html' %} {%load staticfiles%} {% block title %} Home {% endblock title %} {% block extra_css %} {% endblock extra_css %} {%block content %}
Our goal is to create a more trustworthy and genuine blog site for maximized user friendliness Tired of being bombarded with ads while trying to read relatable articles that pop up on your feed? We're the place to go..if you're an out of stater of course
Check out the team here!
You can submit your own article to be featured on the site here!
Visit Submit PageFeel free to email us for business inquiries, to provide some feedback on our site, or to just say hello!


Shell
Choose a file
After choosing a file the file manager will be opened with the path of the chosen file


Note
Click here to download the full example code
Iterated Dynamical Systems¶
Digraphs from Integer-valued Iterated Functions
Sums of cubes on 3N¶
The number 153 has a curious property.
Let 3N={3,6,9,12,…} be the set of positive multiples of 3. Define an iterative process f:3N->3N as follows: for a given n, take each digit of n (in base 10), cube it and then sum the cubes to obtain f(n).
When this process is repeated, the resulting series n, f(n), f(f(n)),… terminate in 153 after a finite number of iterations (the process ends because 153 = 1**3 + 5**3 + 3**3).
In the language of discrete dynamical systems, 153 is the global attractor for the iterated map f restricted to the set 3N.
For example: take the number 108
f(108) = 1**3 + 0**3 + 8**3 = 513
and
f(513) = 5**3 + 1**3 + 3**3 = 153
So, starting at 108 we reach 153 in two iterations, represented as:
108->513->153
Computing all orbits of 3N up to 10**5 reveals that the attractor 153 is reached in a maximum of 14 iterations. In this code we show that 13 cycles is the maximum required for all integers (in 3N) less than 10,000.
The smallest number that requires 13 iterations to reach 153, is 177, i.e.,
177->687->1071->345->216->225->141->66->432->99->1458->702->351->153
The resulting large digraphs are useful for testing network software.
The general problem¶
Given numbers n, a power p and base b, define F(n; p, b) as the sum of the digits of n (in base b) raised to the power p. The above example corresponds to f(n)=F(n; 3,10), and below F(n; p, b) is implemented as the function powersum(n,p,b). The iterative dynamical system defined by the mapping n:->f(n) above (over 3N) converges to a single fixed point; 153. Applying the map to all positive integers N, leads to a discrete dynamical process with 5 fixed points: 1, 153, 370, 371, 407. Modulo 3 those numbers are 1, 0, 1, 2, 2. The function f above has the added property that it maps a multiple of 3 to another multiple of 3; i.e. it is invariant on the subset 3N.
The squaring of digits (in base 10) result in cycles and the single fixed point 1. I.e., from a certain point on, the process starts repeating itself.
keywords: “Recurring Digital Invariant”, “Narcissistic Number”, “Happy Number”
The 3n+1 problem¶
There is a rich history of mathematical recreations associated with discrete dynamical systems. The most famous is the Collatz 3n+1 problem. See the function collatz_problem_digraph below. The Collatz conjecture — that every orbit returrns to the fixed point 1 in finite time — is still unproven. Even the great Paul Erdos said “Mathematics is not yet ready for such problems”, and offered $500 for its solution.
keywords: “3n+1”, “3x+1”, “Collatz problem”, “Thwaite’s conjecture”
import networkx as nx
nmax = 10000
p = 3
def digitsrep(n, b=10):
"""Return list of digits comprising n represented in base b.
n must be a nonnegative integer"""
if n <= 0:
return [0]
dlist = []
while (n > 0):
# Prepend next least-significant digit
dlist = [n % b] + dlist
# Floor-division
n = n // b
return dlist
def powersum(n, p, b=10):
"""Return sum of digits of n (in base b) raised to the power p."""
dlist = digitsrep(n, b)
sum = 0
for k in dlist:
sum += k**p
return sum
def attractor153_graph(n, p, multiple=3, b=10):
"""Return digraph of iterations of powersum(n,3,10)."""
G = nx.DiGraph()
for k in range(1, n + 1):
if k % multiple == 0 and k not in G:
k1 = k
knext = powersum(k1, p, b)
while k1 != knext:
G.add_edge(k1, knext)
k1 = knext
knext = powersum(k1, p, b)
return G
def squaring_cycle_graph_old(n, b=10):
"""Return digraph of iterations of powersum(n,2,10)."""
G = nx.DiGraph()
for k in range(1, n + 1):
k1 = k
G.add_node(k1) # case k1==knext, at least add node
knext = powersum(k1, 2, b)
G.add_edge(k1, knext)
while k1 != knext: # stop if fixed point
k1 = knext
knext = powersum(k1, 2, b)
G.add_edge(k1, knext)
if G.out_degree(knext) >= 1:
# knext has already been iterated in and out
break
return G
def sum_of_digits_graph(nmax, b=10):
def f(n): return powersum(n, 1, b)
return discrete_dynamics_digraph(nmax, f)
def squaring_cycle_digraph(nmax, b=10):
def f(n): return powersum(n, 2, b)
return discrete_dynamics_digraph(nmax, f)
def cubing_153_digraph(nmax):
def f(n): return powersum(n, 3, 10)
return discrete_dynamics_digraph(nmax, f)
def discrete_dynamics_digraph(nmax, f, itermax=50000):
G = nx.DiGraph()
for k in range(1, nmax + 1):
kold = k
G.add_node(kold)
knew = f(kold)
G.add_edge(kold, knew)
while kold != knew and kold << itermax:
# iterate until fixed point reached or itermax is exceeded
kold = knew
knew = f(kold)
G.add_edge(kold, knew)
if G.out_degree(knew) >= 1:
# knew has already been iterated in and out
break
return G
def collatz_problem_digraph(nmax):
def f(n):
if n % 2 == 0:
return n // 2
else:
return 3 * n + 1
return discrete_dynamics_digraph(nmax, f)
def fixed_points(G):
"""Return a list of fixed points for the discrete dynamical
system represented by the digraph G.
"""
return [n for n in G if G.out_degree(n) == 0]
if __name__ == "__main__":
nmax = 10000
print("Building cubing_153_digraph(%d)" % nmax)
G = cubing_153_digraph(nmax)
print("Resulting digraph has", len(G), "nodes and",
G.size(), " edges")
print("Shortest path from 177 to 153 is:")
print(nx.shortest_path(G, 177, 153))
print("fixed points are %s" % fixed_points(G))
Total running time of the script: ( 0 minutes 0.000 seconds)


Loading...
BOARD_ADAFRUITU4
BoardTypes.h
BOARD_ATAVRUSBRF01
BoardTypes.h
BOARD_BENITO
BoardTypes.h
BOARD_BLACKCAT
BoardTypes.h
BOARD_BUI
BoardTypes.h
BOARD_BUMBLEB
BoardTypes.h
BOARD_CULV3
BoardTypes.h
BOARD_EVK527
BoardTypes.h
BOARD_JMDBU2
BoardTypes.h
BOARD_MAXIMUS
BoardTypes.h
BOARD_MICROSIN162
BoardTypes.h
BOARD_MINIMUS
BoardTypes.h
BOARD_NONE
BoardTypes.h
BOARD_OLIMEX162
BoardTypes.h
BOARD_RZUSBSTICK
BoardTypes.h
BOARD_STK525
BoardTypes.h
BOARD_STK526
BoardTypes.h
BOARD_TEENSY
BoardTypes.h
BOARD_UDIP
BoardTypes.h
BOARD_UNO
BoardTypes.h
BOARD_USBKEY
BoardTypes.h
BOARD_USBTINYMKII
BoardTypes.h
BOARD_USER
BoardTypes.h
BOARD_XPLAIN
BoardTypes.h
BOARD_XPLAIN_REV1
BoardTypes.h
BUTTONS_BUTTON1
BUTTONS_BUTTON1(): Buttons.h
BUTTONS_BUTTON1(): Buttons.h
BUTTONS_BUTTON1(): Buttons.h
BUTTONS_BUTTON1(): Buttons.h
BUTTONS_BUTTON1(): Buttons.h
BUTTONS_BUTTON1(): Buttons.h
BUTTONS_BUTTON1(): Buttons.h
BUTTONS_BUTTON1(): Buttons.h
BUTTONS_BUTTON1(): Buttons.h
BUTTONS_BUTTON1(): Buttons.h
BUTTONS_BUTTON1(): Buttons.h
BUTTONS_BUTTON1(): Buttons.h
BUTTONS_BUTTON1(): Buttons.h
BUTTONS_BUTTON1(): Buttons.h
BUTTONS_BUTTON1(): Buttons.h
BUTTONS_BUTTON1(): Buttons.h
Searching...
No Matches


--- layout: post status: publish published: true title: Hart Gets the Win, Gets Sent Packing author: display_name: Andy login: Andy email<EMAIL_ADDRESS>url: '' author_login: Andy author_email<EMAIL_ADDRESS>wordpress_id: 1165 wordpress_url: http://ivyenvy.com/?p=1165 date: '2009-07-30 23:59:18 +0000' date_gmt: '2009-07-31 05:59:18 +0000' categories: - Offense - Relief Pitching - Starting Pitching - Former Cubs - injuries tags: - Harry Caray - Kosuke Fukudome - Mike Fontenot - Reed Johnson - Milton Bradley - Kevin Hart - Pittsburgh Pirates - John Grabow - Tom Gorzelanny - Jose Ascanio - Josh Harrison - Mark Grudzielanek comments: [] ---
[caption id="attachment_1166" align="aligncenter" width="192" caption="Gorzelanny and Grabow"][/caption]
"Congrats on the win, Kevin. Now pack your s--t and get to Pittsburgh. The good news is you won't have to look at Jack Wilson's or Freddy Sanchez's ugly mugs when you get there.  Enjoy!"
The Cubs got lefties John Grabow and Tom Gorzelanny in exchange for Kevin Hart, Jose Ascanio (I'll miss your goggles, but not your pitching that much), and Josh Harrison, who seemed like quite a spark plug of a player when we went to see the Chiefs. I can see why the Pirates, if they are so interested in young talent, would want him. I wish Grudzielanek and Gorzelanny could jump in a time machine and play for the Cubs at the same time back when Harry Caray was the Cubs' commentator. Maybe we could throw minor leaguer Lee Gronkiewicz in there just for fun too. I love our left-handedness fixation, but doesn't Hendry know that the left hand is unclean? And why are right-handers never referred to as "northpaws?"
Speaking of the Pirates, did everyone see this bizarre-as-crap play made by Delwyn Young the other day?
Well, the Cubs scored 35 runs in the 4-game series with Houston. Hot damn. The only factor that may kind of bring the room down is that the Astros pitching staff kinda sucks. Still, almost everyone seems to be coming to life offensively, even Fontenot and Bradley from the left side. Fukudome did a ton of damage today as well, and his average is now up to .274. The only other bad news from this home stand is Reed Johnson fracturing his foot after fouling a pitch straight down. Do they make steel-toe baseball cleats?


--- layout: default ---
YAWn! originated early 2003 as a tool for the Return to Castle Wolfenstein community to identify unknown players, commonly referred to as nicklamers or aliassers. The concept grew bigger to become a database containing servers and mods, but most importantly punkbuster guids and player names. Games such as Return to Castle Wolfenstein, Wolfenstein: Enemy Territory, Call of Duty, Call of Duty 2, Soldier of Fortune 2, Quake 3 Arena were originally supported. Later Enemy Territory: Quake Wars and Quake 4 were added to the list. The most active game most certainly was Wolfenstein: Enemy Territory, followed closely by its predecessor Return to Castle Wolfenstein.
Last release of the client software dates back to 2007. You've been using it ever since? I'm impressed :-).
Since May 2018, having over 15 years of service, the database is offline, player search is no longer available. It's time to move on :-).
A special thank you goes to
-=[BZZ|TZiek.]=-,
-=[BZZ|Pack]=-,
-=[BZZ|BroQ]=-,
-=[BZZ|Dis4ea]=-,
-=[BZZ|sil]=-,
-=[BZZ|Long]=-,
MoV|Eclipse ,
.xph|frog and
[DZM]Moby
Sorry dear server administrators, since May 2018, having over 12 years of service, the feature has retired.


---
layout: post
title: Forget It - New Demo Single
date: '2012-11-27T01:29:00.000-06:00'
author: Tom Ray
tags:
- news
- single
modified_time: '2013-01-27T22:02:04.233-06:00'
blogger_id: tag:blogger.com,1999:blog-11319466.post-1842818316948981286
blogger_orig_url: http://www.lorenzosmusic.com/2012/11/forget-it-new-demo-single.html
---
Here's a song single that we've been working on that we wanted to share with you.


import matplotlib.pyplot as plt
import random
import time
def insertionSort(alist):
N=len(alist)
for i in range(1,N):
CurValue = alist[i]
j=i
while j>0 and CurValue<alist[j-1]:
alist[j]=alist[j-1]
j-=1
alist[j]=CurValue
return alist
### Pseudo-code : Arr: An Array which is one-based
### for our python implementation, it should be zero-based!!!
### when we call insertionSort(alist), the alist is sorted in itself.
# N = LENGTH(Arr)
# FOR i = 2 TO N
# CurValue = Arr[i]
# j = i
# WHILE j > 1 AND CurValue < Arr[j-1]
# Arr[j] = Arr[j-1]
# j = j -1
# ENDWHILE
# Arr[j] = CurValue
# ENDFOR
### References: http://interactivepython.org/runestone/static/pythonds/SortSearch/TheInsertionSort.html?highlight=insertion%20sort
def selectionSort(alist):
N=len(alist)
for i in range(0,N-1):
MinSub=i
for j in range(i+1,N):
if alist[j]<alist[MinSub]:
MinSub=j
Temp=alist[i]
alist[i]=alist[MinSub]
alist[MinSub]=Temp
return alist
### Pseudo-code : Arr: An Array which is one-based
### for our python implementation, it should be zero-based!!!
### when we call selectionSort(alist), the alist is sorted in itself.
# N = LENGTH(Arr)
# FOR i = 1 TO N-1
# MinSub = i
# FOR j = i + 1 TO N
# IF Arr[j] < Arr[MinSub]
# MinSub = j
# ENDIF
# ENDFOR
# Temp = Arr[i]
# Arr[i] = Arr[MinSub]
# Arr[MinSub] = Temp
# ENDFOR
### http://interactivepython.org/runestone/static/pythonds/SortSearch/TheSelectionSort.html?highlight=selection%20sort
def bubbleSort(alist):
N=len(alist)
for i in range(0,N):
for j in range(0,N-i-1):
if alist[j]>alist[j+1]:
Temp=alist[j]
alist[j]=alist[j+1]
alist[j+1]=Temp
return alist
### Pseudo-code : Arr: An Array which is one-based
### for our python implementation, it should be zero-based!!!
### when we call bubbleSort(alist), the alist is sorted in itself.
# N = LENGTH(Arr)
# FOR i = 1 TO N-1
# FOR j = 1 To N-i
# IF Arr[j] > Arr[j+1]
# Temp = Arr[j]
# Arr[j] = Arr[j+1]
# Arr[j+1] = Temp
# ENDIF
# ENDFOR
# ENDFOR
## simple test
alist = [54,26,93,17,77,31,44,55,20]
print("original List:", alist)
insertionSort(alist)
print("insertion sort result:",alist)
alist = [54,26,93,17,77,31,44,55,20]
print("original List:", alist)
selectionSort(alist)
print("selection sort result:",alist)
alist = [54,26,93,17,77,31,44,55,20]
print("original List:", alist)
bubbleSort(alist)
print("bubble sort result:",alist)
## We compare the running time of the 3 basic algorithms.
def CompRunningTimeWithPlot():
rng = random.Random()
itemNum = 10
base = 2
timeSeqInsertion = []
timeSeqSelection = []
timeSeqBubble = []
for i in range(itemNum//2,itemNum):
alist = list(range(base**i))
rng.shuffle(alist)
t0 = time.clock()
insertionSort(alist)
t1 = time.clock()
print("The list has {} items, it takes {} seconds by insertion sort.".format(base**i, t1-t0))
timeSeqInsertion.append(t1-t0)
rng.shuffle(alist)
t0 = time.clock()
selectionSort(alist)
t1 = time.clock()
print("The list has {} items, it takes {} seconds by Selection sort.".format(base ** i, t1 - t0))
timeSeqSelection.append(t1-t0)
rng.shuffle(alist)
t0 = time.clock()
bubbleSort(alist)
t1 = time.clock()
print("The list has {} items, it takes {} seconds by Bubble sort.".format(base ** i, t1 - t0))
timeSeqBubble.append(t1-t0)
plt.figure()
plt.hold(True)
plt.plot(list(range(itemNum//2,itemNum)), timeSeqInsertion,'r')
plt.plot(list(range(itemNum//2,itemNum)), timeSeqSelection,'g')
plt.plot(list(range(itemNum//2,itemNum)), timeSeqBubble,'b')
plt.show()
### if your 3 basic sorting algorithms are ready, please uncomment the following statement
### to compare their running-time
CompRunningTimeWithPlot()
The graph plotted:


---
layout: definitions
---
Let $P$ and $Q$ be two partitions of a box $I$. We say that $Q$ is a refinement of $P$ if $P_k\subseteq Q_k$ for all $k\in\{1, \dots, n\}$.
Concepts
Coming soon
Used In
Coming soon
Hypothesis
Coming soon
Results
Coming soon
Related
Coming soon


This is a tutorial on how to create a time series forecast using R.
A time series forecast predicts future values of a variable based on past variables. I will predict future values of GNI (Gross National Income) based past values.
I used economic data from the World Bank to build my forecast. I chose Malaysia as the country to forecast.
I’ll build a baseline model to compare to assess the performance of my model.
A naive model predicts that this year’s GNI is last year’s GNI.
# create model & get predictions
fcast <- naive(y_train, h = num_test)
y_pred <- fcast$mean
Let’s plot this model to visualize how well it predicts GNI.
gni <- df$GNI
# plotting prep
ylim <- c(min(gni) * .9, max(gni) * 1.1)
xlab <- 'Year'
ylab <- 'GNI'
main <- 'Malaysia GNI Actual VS Forecast'
location = 'bottomright'
legend = c('train', 'test', 'forecast')
col = c('black', 'blue', 'red')
lty = 1
cex = 0.8
# plot actual vs forecast
plot(df$Year, y1, type = 'l', col = 'black', main = main,
xlab = xlab, ylab = ylab, ylim = ylim)
lines(df$Year, y2, type = 'l', col = 'blue')
lines(df$Year, y3, type = 'l', col = 'red')
legend(location, col = col, legend = legend, lty = lty, cex = cex)
The naive model’s last training observation was in 2008. After 2008, it forecasts that Malaysia will have the same GNI that it had in 2008.
To quantify the model, I’ll calculate MAPE (mean absolute percent error) of the forecast.
# create data frame with actual and predicted values
mape_naive_df <- data.frame('Actual' = y_test, 'Predicted' = y_pred)
mape_naive_df['error'] <- mape_naive_df['Actual'] - mape_naive_df['Predicted']
mape_naive_df['abs_pct_error'] <- abs(mape_naive_df['error'] / mape_naive_df['Actual'])
mape_naive <- mean(mape_naive_df[, 'abs_pct_error']) * 100
Naive Model MAPE: 9.04%
# create ARIMA model & generate predictions
arima_fit <- auto.arima(y_train)
fcast <- forecast(arima_fit, h = num_test)
Plot the ARIMA model’s predictions to visual how well it predicts GNI.
# plot preparation
y_pred <- fcast$mean
y3 <- append(rep(NA, num_train), y_pred)
# plot actual vs forecast
plot(df$Year, y1, type = 'l', col = 'black', main = main,
xlab = xlab, ylab = ylab, ylim = ylim)
lines(df$Year, y2, type = 'l', col = 'blue')
lines(df$Year, y3, type = 'l', col = 'red')
legend(location, col = col, legend = legend, lty = lty, cex = cex)
I’ll calculate the MAPE for the ARIMA model and compare it with the naive model.
arima_df <- data.frame('Actual' = y_test, 'Predicted' = y_pred)
arima_df['error'] <- arima_df['Actual'] - arima_df['Predicted']
arima_df['abs_pct_error'] <- abs(arima_df['error'] / arima_df['Actual'])
mape_arima_df <- mean(arima_df[, 'abs_pct_error']) * 100
ARIMA model MAPE: 3.01%
The ARIMA model outperformed the naive model.
| model | MAPE |
|---|---|
| naive | 9.04% |
| ARIMA | 3.01% |


Control:
A Control is any object that can be seen, animated, and/or interacted with in some way. Controls are the basic building blocks of the User Interface. Example include a sprite image, button, label, etc.
View:
A View is a collection of controls and animations that represents a logical "screen" in a User Interface. An example of a view is the main menu or splash screen in your application. Views can also take the form of message boxes and onscreen HUDs (Heads-Up Displays). Multiple views can become active at the same time, and may overlay one another.
Scene:
A Scene is a collection of Views, and can be loaded or unloaded at runtime as needed. This is particularly useful if your user interface is large and you need to unload multiple views to maintain a small memory footprint.
Animation:
An Animation dictates how a control will be transformed over a period of time. Animations comprise of a set of keyframes, and interpolates between each keyframe to produce the desired transformation of the control. Animations have a preset running length and will always continue to run until the last frame, regardless of the actual number of keyframes. For example, if an animation has a length of 100 frames, but contain only two keyframes at frame 0 and frame 50, the animation will not "finish" until 100 frames have been processed and rendered.
Keyframe:
A keyframe represents a single "snapshot" of a control's layout within an animation. Keyframes contain general information such as rotation and translation, but can also store control-specific information like text scale or sprite color. During animation, keyframes interpolate with one another to produce smooth animations.
Actions:
Actions are performed by animations on specific frames, and is the most basic way an animation may communicate with the application. Examples of actions may include sound playback or sending a string message to the application. Each animation frame can execute an unlimited amount of actions, as specified through the OtterUI Editor.
Created with the Personal Edition of HelpNDoc: Easily create Web Help sites


Shakspare's Plays
Comedies
All's Well That Ends Well
As You Like It
Love's Labour's
The Comedy of Errors
Tragedies
Anthony & Cleopatra
Hamlet
Romeo &anp; Juliet
Histories
Henry IV, Part 1
Henry IV, Part 2


{% extends "base.html" %} {% block content %}
Enter the URL of the feed you wish to import. If you don't know the feed URL, you can just enter the address of the site you want to subscribe to, Feed Thing will try and find a feed for you.
You can add a batch of feeds in one go by supplying an OPML file.
Your current feed reader should be able to export your current subscriptions as OPML.


Interface for configuring angular modules.
provider(name, providerType);
See $provide.provider().
| Param | Type | Details |
|---|---|---|
| name | string |
service name |
| providerType | Function |
Construction function for creating new instance of the service. |
factory(name, providerFunction);
See $provide.factory().
| Param | Type | Details |
|---|---|---|
| name | string |
service name |
| providerFunction | Function |
Function for creating new instance of the service. |
service(name, constructor);
See $provide.service().
| Param | Type | Details |
|---|---|---|
| name | string |
service name |
| constructor | Function |
A constructor function that will be instantiated. |
value(name, object);
See $provide.value().
| Param | Type | Details |
|---|---|---|
| name | string |
service name |
| object | * |
Service instance object. |
constant(name, object);
Because the constant are fixed, they get applied before other provide methods. See $provide.constant().
| Param | Type | Details |
|---|---|---|
| name | string |
constant name |
| object | * |
Constant value. |
decorator(The, This);
See $provide.decorator().
| Param | Type | Details |
|---|---|---|
| The | string |
name of the service to decorate. |
| This | Function |
function will be invoked when the service needs to be instantiated and should return the decorated service instance. |
animation(name, animationFactory);
NOTE: animations take effect only if the ngAnimate module is loaded.
Defines an animation hook that can be later used with $animate service and directives that use this service.
module.animation('.animation-name', function($inject1, $inject2) {
return {
eventName : function(element, done) {
//code to run the animation
//once complete, then run done()
return function cancellationFunction(element) {
//code to cancel the animation
}
}
}
})
See $animateProvider.register() and ngAnimate module for more information.
| Param | Type | Details |
|---|---|---|
| name | string |
animation name |
| animationFactory | Function |
Factory function for creating new instance of an animation. |
filter(name, filterFactory);
See $filterProvider.register().
Expressions
identifiers, such as uppercase
or orderBy
.
Names with special characters, such as hyphens and dots, are not allowed. If you wish to namespace
your filters, then you can use capitalization (myappSubsectionFilterx
) or underscores
(myapp_subsection_filterx
).
| Param | Type | Details |
|---|---|---|
| name | string |
Filter name - this must be a valid angular expression identifier |
| filterFactory | Function |
Factory function for creating new instance of filter. |
controller(name, constructor);
| Param | Type | Details |
|---|---|---|
| name | stringObject |
Controller name, or an object map of controllers where the keys are the names and the values are the constructors. |
| constructor | Function |
Controller constructor function. |
directive(name, directiveFactory);
| Param | Type | Details |
|---|---|---|
| name | stringObject |
Directive name, or an object map of directives where the keys are the names and the values are the factories. |
| directiveFactory | Function |
Factory function for creating new instance of directives. |
config(configFn);
Use this method to register work which needs to be performed on module loading. For more about how to configure services, see Provider Recipe.
| Param | Type | Details |
|---|---|---|
| configFn | Function |
Execute this function on module load. Useful for service configuration. |
run(initializationFn);
Use this method to register work which should be performed when the injector is done loading all modules.
| Param | Type | Details |
|---|---|---|
| initializationFn | Function |
Execute this function after injector creation. Useful for application initialization. |
requires
Holds the list of modules which the injector will load before the current module is loaded. |
name
Name of the module. |


A field to input a range of dates
formControl.disable()
)
Import an Angular module for forms and
TuiInputDateRangeModule
in the same module
where you want to use our component:
Declare a form (FormGroup
) or a control
(FormControl
) in your component:
TuiInputDateRange
in template:


Lesson Plan Title: How to Perform Cross Site Scripting (XSS)
Concept / Topic To Teach:
In role-based access control scheme, a role represents
a set of access permissions and privileges. A user can be
assigned one or more roles. A role-based access control
normally consists of two parts: role permission management
and role assignment. A broken role-based access
control scheme might allow a user to perform accesses
that are not allowed by his/her assigned roles, or
somehow obtain unauthorized roles.
General Goal(s):
Your goal is to explore the access control
rules that govern this site. Each role has permission to
certain resources (A-F). Each user is assigned one or more roles.
Only the user with the [Admin] role should have access
to the 'F' resources. In a successful attack, a user doesn't
have the [Admin] role can access resource F.
Solution:
To solve this exercise you have to know the name of the action, which
deletes employees. Of course you could just guess
it because it has a really logical name.
But we will look it up. So your first step is to log in as John with john as
password. Use WebScarab to intercept the delete request.
As you can see the delete action is called DeleteProfile.
Now log in as Tom. Click in the list on his name and make sure WebScarab
will intercept the next request. Click on a button, for example the
'ViewProfile' button. Change in WebScarab the action to DeleteProfile
and you are done!


|
|
Downloading data from emoncms.org |
1 |
46 weeks 21 hours ago by Scott Geller |
46 weeks 19 hours ago by pb66 |
|
|
Does RFM12pi work with Raspberry B+ ? |
2 |
2 years 26 weeks ago by Guest |
2 years 26 weeks ago by Guest |
|
|
Does 433Mhz or 868Mhz have better distance/penetration? |
21 |
4 years 48 weeks ago by Guest |
3 years 10 weeks ago by Jérôme |
|
|
Documentation update for com_baud = 57600 ? |
0 |
1 year 40 weeks ago by Ian Davies |
n/a |
|
|
Do I need a local Windows PC setup for emoncms or can I work directly with emoncms.org? |
4 |
3 years 30 weeks ago by stevenma |
3 years 30 weeks ago by Jérôme |
|
|
Divide Temperature & Humidity in Input / Feed? |
2 |
2 years 12 weeks ago by raspberry.tips |
2 years 12 weeks ago by raspberry.tips |
|
|
Distance, protocols, antennas, poll rate... |
1 |
1 year 15 weeks ago by jasonnet |
1 year 15 weeks ago by Robert Wall |
|
|
Display wind direction in a feed |
2 |
1 year 34 weeks ago by sheppy |
1 year 33 weeks ago by sheppy |
|
|
Display kWh/d after massive import |
3 |
1 year 3 weeks ago by gfo |
1 year 3 weeks ago by Paul Reed |
|
|
Discrepancies and accuracy of the feeds |
12 |
4 years 13 weeks ago by alpav |
4 years 12 weeks ago by alpav |
|
|
Disconnecting emonTx V3 from CTs and safety |
1 |
2 years 39 weeks ago by Guest |
2 years 39 weeks ago by Robert Wall |
|
|
Disappointing Results with emonTx Arduino Shield and Arduino Ethernet |
6 |
1 year 40 weeks ago by RogerMunford |
1 year 40 weeks ago by RogerMunford |
|
|
Digital to analog conversion |
5 |
2 years 36 weeks ago by hmaggo92 |
2 years 36 weeks ago by Robert Wall |
|
|
Difficult (?) set up with grid consumption/export and PV generation separated by 20m+ |
3 |
49 weeks 1 hour ago by simonthepimon |
48 weeks 6 days ago by Robert Wall |
|
|
Different RMS voltages EmonPi and EmonTX3 |
3 |
1 year 36 weeks ago by wheelbarrowhandle |
1 year 36 weeks ago by Robert Wall |
|
|
Difference between Solar Generation meter and emonTX values |
6 |
1 year 39 weeks ago by Ian Davies |
1 year 37 weeks ago by Robert Wall |
|
|
DG Synchronisation For Solar Inverter |
2 |
1 year 23 weeks ago by Srinivas |
1 year 23 weeks ago by Srinivas |
|
|
Development of pv monitoring system |
2 |
1 year 1 week ago by hanz |
51 weeks 6 days ago by hanz |
|
|
Deriving solar power from pulse counter |
2 |
1 year 21 weeks ago by Toberwine |
1 year 21 weeks ago by Toberwine |
|
|
Deleting data from emoncms.org ? |
2 |
3 years 16 weeks ago by warlock |
3 years 16 weeks ago by TrystanLea |
|
|
Deleting a Feed from the Feeds page causes all the nodes to stop processing inputs |
2 |
45 weeks 6 days ago by WDFXH8HM |
45 weeks 4 days ago by WDFXH8HM |
|
|
Delete old/partial data in emoncms.org feed |
6 |
2 years 17 weeks ago by aicanduit |
2 years 16 weeks ago by aicanduit |
|
|
Delete Node |
5 |
3 years 14 weeks ago by pierantonio81 |
3 years 14 weeks ago by jb79 |
|
|
Delete all data |
0 |
2 years 45 weeks ago by maglo18 |
n/a |
|
|
Delete 1000 fake input created on emoncms.org |
5 |
3 years 15 weeks ago by Guest |
2 years 21 weeks ago by mdknightk |
|
|
Default zoom/time on multigraph |
2 |
2 years 51 weeks ago by cybergibbons |
2 years 51 weeks ago by cybergibbons |
|
|
Dealing with unixstamp, local time and server time |
0 |
3 years 2 weeks ago by Sergegsx |
n/a |
|
|
DC shunt for 24vdc 100ah battery current sense |
5 |
3 years 31 weeks ago by Guest |
3 years 31 weeks ago by Robert Wall |
|
|
DC Monitoring with Hall effect sensor |
3 |
1 year 51 weeks ago by Gerardo |
1 year 46 weeks ago by kosmonooit |
|
|
DC current monitoring - help needed |
5 |
3 years 23 weeks ago by Guest |
3 years 23 weeks ago by Robert Wall |
|
|
DC + AC sensors on EmonTxShield + EmonBase |
24 |
1 year 16 weeks ago by rubensben |
1 year 11 weeks ago by Robert Wall |
|
|
Daylight Saving Time bug ? |
1 |
2 years 16 weeks ago by Guest |
2 years 15 weeks ago by TrystanLea |
|
|
Data loss due to RF packets getting corrupted |
58 |
1 year 34 weeks ago by Ian Davies |
1 year 16 weeks ago by 321liftoff |
|
|
Data Issue - TxV3 and RFM69Pi ?? [SOLVED] |
5 |
1 year 9 weeks ago by eskimofisherman |
1 year 9 weeks ago by eskimofisherman |
|
|
data being stored but cannot visualize |
0 |
2 years 24 weeks ago by rangua |
n/a |
|
|
Dashboard menu on Emoncms.org disappeared |
55 |
1 year 17 weeks ago by Bra1n |
1 year 15 weeks ago by sroof |
|
|
Dashboard daily bars showing accumulated values |
1 |
45 weeks 6 days ago by WDFXH8HM |
45 weeks 4 days ago by WDFXH8HM |
|
|
Dashboard add update time |
0 |
3 years 7 weeks ago by scacchi |
n/a |
|
|
Dasboard graph zoom to one day |
0 |
3 years 47 weeks ago by Guest |
n/a |
|
|
CurrentCost User - migrating to OpenEnergyMonitor. Help and Advice please |
1 |
2 years 47 weeks ago by Keen2bGreen |
2 years 46 weeks ago by Keen2bGreen |
|
|
CT3 delayed readings? |
30 |
2 years 3 weeks ago by mtran |
2 years 1 week ago by dBC |
|
|
CT Sensors with EmonTx V3 Showing Incorrect Data |
1 |
1 year 9 weeks ago by natemay17 |
1 year 9 weeks ago by Robert Wall |
|
|
CT sensor Recommendation request - 800 Amphere |
1 |
2 years 35 weeks ago by kspark |
2 years 35 weeks ago by pb66 |
|
|
CT Sensor Placement off Circuit Breaker and other questions |
10 |
3 years 32 weeks ago by Guest |
3 years 32 weeks ago by Guest |
|
|
CT Sensor circuit not working |
1 |
3 years 23 weeks ago by Guest |
3 years 23 weeks ago by Robert Wall |
|
|
CT positioning on 3phase mains |
6 |
3 years 50 weeks ago by tomtobback |
3 years 49 weeks ago by Robert Wall |
|
|
CT output cable voltage rating |
2 |
3 years 1 week ago by Guest |
3 years 1 week ago by Robert Wall |
|
|
CT clamp data output? |
1 |
3 years 15 weeks ago by Guest |
3 years 15 weeks ago by Robert Wall |
|
|
CT clamp AND 13A socket sensor |
4 |
1 year 48 weeks ago by RichardG |
1 year 48 weeks ago by RichardG |
|
|
CT / Power(4) input not working |
2 |
1 year 9 weeks ago by torgeir |
1 year 9 weeks ago by torgeir |


{{Orphan|date=April 2012}} {{Infobox prepared food | name = Dragon beard noodles | image = | caption = | alternate_name = | country = China | region = | creator = | course = | type = Noodle | served = | main_ingredient = | variations = | calories = | other = }}
Dragon beard noodles (龙须面) is a kind of noodles which are popular in the northern part of China. It is very long and thin and are much like dragon beard. It's a tradition eaten on the second day of the second lunar month, which calls Longtaitou Festival. Usually, they should be pulled into 4096 strips, because the noodles are unsuitable to be cooked. There is folk custom called "peeling the dragon skin" (pinyin: “bolongpi”).<ref name="Dragon beard noodles (longxu mian)">{{cite web|url=http://kaleidoscope.cultural-china.com/en/8K3819K10605.html|title=关于龙须面 (something about Dragon beard noodles)}}</ref>
Contents |
It is origined from Shandong Province. It has a history of more than 300 years.<ref name="Dragon beard noodles">{{cite web|url=http://baike.baidu.com/view/68967.htm|title=龙须面 (Dragon beard noodles)}}</ref>
There was a chef in the emperor's diet room of Ming Dynasty. When people ate spring pancake on the lichun,he invented a very thin noodle, pleasing the emperor. Thence, it had become a very fashionable snack. Because of the noodles were very overwhelming and it was very thin as if it was a hairline, so it calls dragon beard noodles.<ref name="The literal allusion of Dragon whisker noodles">{{cite web|url=http://www.eblcu.com/culture/culture_toCultureInfo.jspr?cid=4af04d511ac25eb2011ac2707c230002|title=龙须面的典故(the allusion of Dragon whisker noodles)}}</ref>
{{Reflist}}


101 DALMATIANS Rated PG, 2 out of 5 stars
Review by Ed Johnson-Ott For more reviews, go to www.nuvo-online.com and click on "film."
The cartoon is way better. That's the bottom line on Disney's incredibly hyped live action version of its 1961 animated feature. The alliance between Disney and slapstick king John Hughes has produced a frenetic "Home Alone" with puppies, and not much else.
When production of this remake was announced, the big question seemed to be "Why? The original cartoon still works, so what's the point?" The answer, it appears, is to give Disney an excuse for yet another massive merchandising campaign.
The story, for those of you who missed childhood, is simple. Two Dalmatians, Pongo and Perdy, fall in love at first sight. They drag their "human pets" together, and in a short time both couples marry. The heavenly match-ups turn chaotic when Pongo and Perdy's new-born pups are stolen; their dog-napping engineered by the evil Cruella DeVil, who wants them for their pelts. Everyone in the animal kingdom then joins in a frantic effort to save the puppies. In the original movie, the animated pooches had a broad range of facial expressions and distinct personalities. We also could hear them talk, which quickly established a crucial element to the charm of the film, the dog's view of humans as their pets.
In the new version, the dogs are mute and expressionless. Hughes attempts to give them character with repeated shots of the Dalmatians draping their heads over each other and licking their faces and necks. While he drew the desired "Aww, they're so cute" reaction from the audience, it was quickly followed by several people whispering "I wonder what kind of food they smeared on the dog's heads to get them licking like that?"
The canines' lack of personality would be easier to take if the human beings had a little. Joely Richardson and Jeff Daniels are stunningly bland in their lead roles. In previous films, Daniels successfully played off his white bread persona. In "Something Wild", he revealed the rebellious thrill-seeker beneath his neutral demeanor. In "Terms Of Endearment", his hapless appearance masked a cold, manipulative womanizer. Here, he and Richardson are so consistently bland that it's a wonder their images even stick to the film.
Glenn Close, however, has no problems establishing a distinct personality. As the villainous icon Cruella DeVil, she tears up the screen in a deliciously over-the-top performance. Close matches the intensity of the animated Cruella by becoming a cartoon herself. With a two-tone fright wig, red gloves with long nails attached to the fingertips, garish animal skin outfits and stiletto heels, Close bursts through her scenes like a force of nature. She's clearly having a ball playing this monstrous icon, and her wicked glee is infectious. When she spits out lines like "you've won the battle, but I'm about to win the wardrobe!," the film comes briefly to life.
"101 Dalmatians" is crammed with John Hughes' typical heavy-handed approach to comedy. After an ingenuous opening showing Pongo's morning routine as he gets Daniels prepared for the day, the film quickly tumbles into lame slapstick as the pooch drags Daniels on a careening trek through a city park. A little slapstick goes a long way, but Hughes just keeps laying it on. The second half of the film, where local animals team up to rescue 99 nondescript Dalmatian puppies from DeVil and her henchmen, is a tedious Home Alone clone, with the bad guys enduring a variety of sadistic assaults worthy of an Itchy & Scratchy cartoon, including a thug getting his testicles fried on an electric fence.
"101 Dalmatians" has cute puppies and a hoot of a performance from Glenn Close, but not enough to warrant enduring third rate slapstick, bland characters, and unconvincing animatronic raccoons high-fiving one another. Rent the cartoon!
copyright 1997, Ed Johnson-Ott
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


Wail to the Chief: Trump Says His Wife Melania Wouldn’t ‘Cry Her Eyes Out’ If He Were Shot
by by Svetlana EkimenkoA private dinner was hosted on 29 October at US President Donald Trump’s hotel in Washington, DC, for House Republicans who fundraised the most, and reportedly featured a lengthy speech from the president that digressed into a roast of GOP members.
The US President raised some eyebrows during a private fundraiser at the Trump Hotel in Washington DC, which was attended by House Republicans on Tuesday night, writes Politico.
As the attendees - House Republicans who had conducted the most lucrative fundraising - dined on steak, mashed potatoes, and asparagus, the president was said to have launched an hour-long unscripted speech, where he roasted some of the GOP members, as well as his own wife, Melania.
During his outpouring, Trump used the near-fatal shooting of House Minority Whip Steve Scalise (R-LA) in 2017 during a congressional softball game to apparently take a dig at the first lady.
Trump reportedly started by noting how tough Scalise was, while warning against getting shot as a weight-loss strategy.
Trump then said Scalise’s wife “cried her eyes out when I met her at the hospital that fateful day… I mean not many wives would react that way to tragedy. I know mine wouldn’t.”
Twitter’s reaction to the remark was quite uniform, for once, as many online folks agreed with Trump’s words.
Some netizens were puzzled as to why the President would make such a joke and queried its timing:


We are dedicated to ensuring that using our product is as intuitive as possible
We are also here, just in case you encounter any challenges while using it.
Do you have any question regarding our product or company?
Click the button below:
Call +254-712-227-589
Email<EMAIL_ADDRESS>Or reach us on social


GPS
GPS is a GPS accessory library written in Swift.
Installation
GPS is available through CocoaPods. To install it, simply add the following line to your Podfile:
pod 'GPS'
Usage
GPS provides an array of static and instance functions. View the documentation for a detailed description of all the GPS library functions.
Author
arr00<EMAIL_ADDRESS>License
GPS is available under the MIT license. See the LICENSE file for more info.


I would like you to answer the following questions in a short answer format using Markdown.
For questions that ask for a list, use the appropriate Markdown syntax to create either ordered or unordered lists.
Use bold and italic text for emphasis in your responses.
GitHub Username: mbv24 Today's date: 2017/07/12
I have worked with: * Github * Jekyll * Pandoc
Pandoc is potentially useful.
Pandoc can be used to convert files into different file types.
Manipulating the Jekyll site was relatively difficult.
There is more creativity involved.
I would like to learn more about Pandoc.
When you are finished with the questions in file:


Miyetti Allah partners security agencies to expose criminals in Nasarawa
by Agency ReportMohammed Hussaini, Chairman, Miyetti Allah Cattle Breeders Association of Nigeria, Nasarawara State chapter, has said that the association is partnering with security agencies to expose criminals in the state.
The chairman stated this in an interview with the News Agency of Nigeria on Sunday in Lafia.
According to him, the partnership is part of the collective efforts to ensure the state is rid of criminals, adding that security is everybody’s business and not that of the security agencies alone.
“The efforts have yielded a lot of results, leading to the arrest of criminals across the state.
“The kidnappers that killed a man in Lafia recently, after collecting ransom from his family, were arrested by the Fulani vigilantes while trying to dispose of the corpse in a bush.
“The two arrested kidnappers have been handed them over to the police,” the chairman said.
Hussaini also said that the association had set up committees to expose criminal elements among the Fulanis, adding that the association would pursue the assignment to the logical conclusion.
“Let me tell you, so many bad eggs among our people, the Fulanis, were exposed and apprehended.”
He explained that the association was determined to redeem the image of its members and strengthen the relationship with other groups for the overall development of the stat in particular, and the country in general.
The chairman called on the members of the association to continue to be law-abiding and report any acts of provocation to the appropriate authorities for prompt action.
(NAN)