LEN DEIGHTON'S BULLET TO BEIJING A film review by Steve Rhodes Copyright 1997 Steve Rhodes
RATING (0 TO ****): *
Harry's new boss, Alexei (Michael Gambon), warns him, "I'm not being overly dramatic, Mr. Palmer, when I say the fate of the world is in your hands,".
Yes, Harry Palmer is back.
For the fifth time, Michael Caine plays Harry Palmer, the Columbo of the spy set. This 1995 movie is called LEN DEIGHTON'S BULLET TO BEIJING so that you are absolutely sure who wrote the novel upon which the movie is based. (After last year's WILLIAM SHAKESPEARE'S ROMEO AND JULIET, what is next? GOD'S THE TEN COMMANDMENTS?)
I've never read the book, but I hope that it has more emotional impact that the lackadaisical script by Peter Welbeck. It is so weak that a few more cliched lines would have been an improvement. Only the presence of the great Michael Caine makes it even minimally watchable.
The setup for the hyperbolized plot starts simply enough with Palmer in the second year of watching the North Korean Embassy in London. Nothing ever happens so he whiles away the time arranging trysts on the phone with his lover.
 Before he can get his investigation off the ground, he is laid off from his position of thirty years as a British intelligence agent. Although he looks nothing like a spy, with his dark horned rimmed glasses and his dotty manner, Alexei hires him and flies him to Russia to find who, probably the North Koreans he figures, stole "The Red Death."
One drop of The Red Death (drum roll) can mutate and wipe out an entire city of 1,000,000. That's big time death.
Harry starts wandering the streets of St. Petersburg asking old friends he meets if they know where The Red Death might be. The implausibility of this all is overwhelming. One half expects him to take out an advertisement in the newspaper: Reward, in U.S. Greenbacks, for any information on the party or parties who have removed The Red Death from its rightful owner.
The flat dialog never sounds plausible even taken in the context of a spy movie. Director George Mihalka sets a languid pace that drifts from one uninteresting event to another. Curling up on the sofa to watch this video will cure most people's insomnia. Those who stay awake for the entire movie are less fortunate.
LEN DEIGHTON'S BULLET TO BEIJING runs 1:41, but you'll swear it is longer. It is not rated but might be PG-13. The film contains very brief nudity and cartoonish violence. It would be fine for teenagers and perhaps those a bit younger. I do not recommend the show and, out of respect for Michael Caine, give it a single star.
**** = A must see film. *** = Excellent show. Look for it. ** = Average movie. Kind of enjoyable. * = Poor show. Don't waste your money. 0 = Totally and painfully unbearable picture.
REVIEW WRITTEN ON: June 15, 1997
Opinions expressed are mine and not meant to reflect my employer's.
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


|
Filter functions and methods | |
Filter by: |
|
Filter: |
| Size | 1 x 1 |
|---|---|
| Class | double |
| Complex | No |
| Size | :1000 x 1 |
|---|---|
| Class | double |
| Complex | No |
| Size | 1 x 1 |
|---|---|
| Class | function_handle |
| Size | 1 x 1 |
|---|---|
| Class | function_handle |
| Size | 1 x 2 |
|---|---|
| Class | logical |
| Size | 1 x 0 |
|---|---|
| Class | cell |
| Size | 1 x 2 |
|---|---|
| Class | cell |
| Size | :? x 1 |
|---|---|
| Class | double |
| Complex | No |
| Size | :? x 5 |
|---|---|
| Class | double |
| Complex | No |
| Size | 1 x 1 |
|---|---|
| Class | logical |
| Size | 1 x 2 |
|---|---|
| Class | cell |
| Size | 1 x 1 |
|---|---|
| Class | double |
| Complex | No |
| Size | 1 x :? |
|---|---|
| Class | double |
| Complex | No |
| Size | 1 x 0 |
|---|---|
| Class | double |
| Complex | No |
| Size | 1 x 6 |
|---|---|
| Class | char |
| Size | 1 x 5 |
|---|---|
| Class | char |
| Size | 1 x 1 |
|---|---|
| Class | function_handle |
| Size | 1 x 0 |
|---|---|
| Class | cell |
| Size | :? x 1 |
|---|---|
| Class | double |
| Complex | No |
| Size | 1 x 3 |
|---|---|
| Class | char |
| Size | 1 x 1 |
|---|---|
| Class | function_handle |
| Size | 1 x 1 |
|---|---|
| Class | int32 |
| Complex | No |
| Size | 1 x 23 |
|---|---|
| Class | char |
| Size | 1 x 2 |
|---|---|
| Class | char |
| Size | 1 x 1 |
|---|---|
| Class | uint8 |
| Complex | No |
| Size | 1 x 1 |
|---|---|
| Class | function_handle |
| Size | 1 x 0 |
|---|---|
| Class | cell |
| Size | 1 x 2 |
|---|---|
| Class | cell |
| Size | 1 x 2 |
|---|---|
| Class | cell |
| Size | 1 x 1 |
|---|---|
| Class | function_handle |
| Size | 1 x 1 |
|---|---|
| Class | function_handle |
| Size | 1 x 1 |
|---|---|
| Class | cell |
| Size | 1 x 1 |
|---|---|
| Class | function_handle |
| Size | 1 x 1 |
|---|---|
| Class | int8 |
| Complex | No |
| Size | 1 x 3 |
|---|---|
| Class | cell |
| Size | 1 x 1 |
|---|---|
| Class | function_handle |
| Size | 1 x 7 |
|---|---|
| Class | char |
| Size | 0 x 0 |
|---|---|
| Class | double |
| Complex | No |
| Size | 1 x 2 |
|---|---|
| Class | double |
| Complex | No |
| Size | 1 x 1 |
|---|---|
| Class | function_handle |
| Size | 1 x 0 |
|---|---|
| Class | cell |
| Size | 1 x 2 |
|---|---|
| Class | cell |
| Size | 1 x 2 |
|---|---|
| Class | cell |
| Size | 1 x 2 |
|---|---|
| Class | cell |
| Size | 1 x 1 |
|---|---|
| Class | ? |
| Size | :? x 2 |
|---|---|
| Class | double |
| Complex | No |
| Size | 1 x 1 |
|---|---|
| Class | function_handle |
| Size | 1 x 1 |
|---|---|
| Class | mxArray |
| Size | 1 x 1 |
|---|---|
| Class | function_handle |
| Size | 1 x 1 |
|---|---|
| Class | function_handle |
| Size | 1 x 1 |
|---|---|
| Class | function_handle |
| Size | 2 x 1 |
|---|---|
| Class | cell |
| Size | 2 x 1 |
|---|---|
| Class | cell |
| Size | 1 x 1 |
|---|---|
| Class | function_handle |
| Size | 1 x 1 |
|---|---|
| Class | function_handle |
| Size | 1 x 3 |
|---|---|
| Class | double |
| Complex | No |
| Size | 2 x 3 |
|---|---|
| Class | double |
| Complex | No |
| Size | 2 x 2 |
|---|---|
| Class | double |
| Complex | No |
| Size | 2 x 5 |
|---|---|
| Class | double |
| Complex | No |
| Size | 2 x 1 |
|---|---|
| Class | double |
| Complex | No |
| Size | 1 x 19 |
|---|---|
| Class | char |
| Size | 2 x 1 |
|---|---|
| Class | double |
| Complex | No |
| Value | NonConstant |
|---|
| Value | 0 |
|---|
| Value | 0 |
|---|
| Value | 1 1 |
|---|
| Value | 0 0 0 0 |
|---|
| Value | 0 0 |
|---|
| Value |
|---|
| MATLAB code generation attempted on: | 29-Jul-2018 00:01:45 |
| Coding target: | MEX Function |
| Number of errors: | 25 |
| Number of warnings: | 0 |
| Number of notices: | 0 |
| Number of potential differences: | 0 |
| Tell Us What You Think |
| We value your feedback. Please take a few minutes to answer this short questionnaire regarding the Code Generation Report. |
| >>Provide Feedback |
| 1 | smcle2coord |
6 |
Attempt to extract field 'contents' from 'logical'. |
|
| 2 | smcle2coord |
7 |
Undefined function or variable 'sm'. The first assignment to a local variable determines its class. |
|
| 3 | smcle2coord |
8 |
Undefined function or variable 'sm'. The first assignment to a local variable determines its class. |
|
| 4 | smcle2coord |
8 |
Undefined function or variable 'sm'. The first assignment to a local variable determines its class. |
|
| 5 | smcle2coord |
9 |
Undefined function or variable 'crd'. The first assignment to a local variable determines its class. |
|
| 6 | smcle2coord |
10 |
Undefined function or variable 'crd'. The first assignment to a local variable determines its class. |
|
| 7 | pairCollision |
7 |
Function call failed. |
|
| 8 | pairCollision |
8 |
Undefined function or variable 'crd'. The first assignment to a local variable determines its class. |
|
| 9 | pairCollision |
9 |
Undefined function or variable 'inters'. The first assignment to a local variable determines its class. |
|
| 10 | pairCollision |
14 |
Referencing a component from array of non-scalar values is not supported for code generation. |
|
| 11 | pairCollision |
14 |
Undefined function or variable 'lenMx'. The first assignment to a local variable determines its class. |
|
| 12 | pairCollision |
15 |
Undefined function or variable 'inters'. The first assignment to a local variable determines its class. |
|
| 13 | pairCollision |
15 |
Undefined function or variable 'inX'. The first assignment to a local variable determines its class. |
|
| 14 | pairCollision |
16 |
Undefined function or variable 'inters'. The first assignment to a local variable determines its class. |
|
| 15 | pairCollision |
16 |
Undefined function or variable 'dBeg12'. The first assignment to a local variable determines its class. |
|
| 16 | pairCollision |
16 |
Undefined function or variable 'dBeg12'. The first assignment to a local variable determines its class. |
|
| 17 | pairCollision |
17 |
Undefined function or variable 'inters'. The first assignment to a local variable determines its class. |
|
| 18 | pairCollision |
17 |
Undefined function or variable 'dBeg21'. The first assignment to a local variable determines its class. |
|
| 19 | pairCollision |
17 |
Undefined function or variable 'dBeg21'. The first assignment to a local variable determines its class. |
|
| 20 | pairCollision |
18 |
Undefined function or variable 'dBeg12'. The first assignment to a local variable determines its class. |
|
| 21 | pairCollision |
20 |
Undefined function or variable 'intDistVc'. The first assignment to a local variable determines its class. |
|
| 22 | pairCollision |
20 |
Undefined function or variable 'minDist'. The first assignment to a local variable determines its class. |
|
| 23 | pairCollision |
20 |
Undefined function or variable 'mIx'. The first assignment to a local variable determines its class. |
|
| 24 | pairCollision |
24 |
Error limit reached. Suppressing further error messages. |
|
| 25 | runSmarticles |
26 |
Error limit reached. Suppressing further error messages. |


Import the tensorflow
libraries.
from AlgorithmImports import * import tensorflow.compat.v1 as tf from google.protobuf import json_format import json5 tf.disable_v2_behavior()
You need the google.protobuf
and json5
libraries to store and load models.
Disable tensorflow
v2 behaviors in order to deploy a v1 model.


You can vote for names on this page {% for item in votes %} Name: {{item.name}} Votes: {{item.votes}} Vote+ Permalink {{ item.key().id()|string }} | {{ item.created }} Comment Report {% endfor %}


Quick and easy help on how to do bulk uploads.
Contact us if you need more help and support with bulk uploads.
Call the ASC-WDS support team on 0113 241 0969
(available Monday to Friday, 9am to 5pm, not including public holidays).
Send an email to ascwds-support@skillsforcare.org.uk


{% load static %}
| Name | Type |
|---|
The sum of the periapsis and apoapsis distances divided by two. For classic two-body orbits, the semimajor axis is the distance between the centers of the bodies, not the distance of the bodies from the center of mass.
The total area that a sensing system can perceive by pointing the sensor at the Earth, which is typically much larger than the sensor's FOV.
The speed at which an astronomical body orbits around the barycenter of the mass of the parent body.
The time a given astronomical object takes to complete one orbit around another object.
The angle measured from the center of the Earth between the satelite's nadir and the outer horizon.
The angle measured at the spacecraft from the subsatellite point (=nadir direction) to the target.
The angle measured at the spacecraft from the center of the Earth to the outer horizon.
The angle measured at the target from the center of the Earth to the satellite.
The angle measured from the center of the Earth to the target and to the satellite.
The diameter of the area that a sensing system can perceive by pointing the sensor at the Earth.
The maximum amount of time the satellite will be in view of a target per pass.


New Domain Name Provider
This month, one of my domains was up for renewal. Currently I own four domains and they’ve all been with 123-Reg for many years. However, the service I’ve had from them and the communication in response to a query was pretty poor - I realised that I’d had to contact them the year before regarding a renewal as well! So all in all, I decided to take my business elsewhere.
I’ve moved all the domains to Mythic Beasts, a UK based company that I’m hoping will provide a better service! I’m also considering moving my email and hosting there for a one stop shop, considering that Fastmail have now removed file hosting (though, I still have it as a grandfathered account) though in fairness, staying with Fastmail might be a good option, as it offers some better features that I might get with another host, such as an app and contact sync.


North Korea to play in Lebanon behind closed doors on security concerns - AFC
MUMBAI: North Korea will play their World Cup qualifier against Lebanon behind closed doors in Beirut on Tuesday due to security concerns, the Asian Football Confederation said, as the country struggles with a wave of protests against its leaders.
An AFC spokesman told Reuters the reason was "same as last week - security concerns".
Last week's qualifier between Lebanon and South Korea was also played in front of an empty stadium following the advice of the local security forces, the AFC said.
The Lebanese protesters blame their leaders for steering the country towards economic collapse. Parliament was unable to hold its first session in two months on Tuesday as the protesters prevented lawmakers from even reaching the building.
Lebanon are tied on seven points with North Korea in Group H of the 2022 World Cup qualifiers, and either side could go top with a victory on Tuesday.
South Korea, who top Group H with eight points from four matches, were held to a 0-0 draw in Thursday's match in Asia's second round of 2022 World Cup preliminaries.
"The Lebanon Football Association, following the advice of the Lebanese security forces, has decided Tuesday's Asian Qualifiers tie between Lebanon and DPR Korea will be played behind closed doors," the AFC said in a statement.
(Reporting by Sudipto Ganguly; Editing by Hugh Lawson)


If you don't know...

Towers don't affect me
AWWWWWWWWW
BOOM!

Tweet this
Credit to jm3
Source code


Marcus turned me on to subversion when I was working on a project earlier this year and wanted a way to revisit old versions of files. Setting up a subversion repository was easy, and while I did download the Tortoise GUI for Windows, I found the command line was pretty easy too.
A few months later, we were wrestling at work with an issue I’ve confronted at every job I’ve had: how to maintain a filesystem that …
- allows everyone to have access to any file they might need
- promotes the concept that files are associated with a client, not with a person
- facilitates regular and thorough backups
- provides versioning more sophisticated than multiple files with names like
project_outline_rev2.html
- does all this without intimidating the hell out of people who aren’t on good terms with the command line
It wasn’t a typical use for subversion, which is more normally (in my mind) used for version control with straight-up development projects, but the more I thought about it and talked about it with people who had used subversion, the more it seemed to make sense. We’d be using it to manage an infinite number of concurrent projects related to maintaining a large client’s web content, and that meant we’d have to agree on a directory structure beyond the standard branches/tags/trunk. For it to work at all, I was also going to have to convince people – some of whom were scarred by cvs – to actually use it. I braced for a full-fledged campaign: sure, it’s more complex than no system at all, I would argue, but writing HTML is more complex than writing in Notepad, too, and we seem to handle that OK, right?
As it turned out, my campaign lasted all of a day, and wasn’t much of a campaign at all. One designer suggested using Dreamweaver or VersionCue to address these concerns, to which I said:
one of the things i like about subversion (svn) is that it’s a platform/software agnostic tool. if we used dw for site management, everyone would have to use dw – for the homepage update i just did, i hardly touched dreamweaver, preferring to do most everything in vim/command line because it was just so much easier for the sort of work i was doing.
i know that at least on the pc side, there is a subversion extension for dreamweaver. i also know on the pc side there’s a pretty decent gui svn client. i imagine, since macs are getting pretty popular with devs, that there’s something similar on that side.
i don’t mean to shoot down dw/vc out of hand, but i think that it would introduce some real limitations vs svn, even though it is tempting because it is a tool we already use. another thing that is great about svn is that it’s integrated with the whole trac system that stancil has set up, which also includes a wiki and a ticketing system, all of which are linked together. i see *huge* potential here in terms of project management, documentation, and file management that we aren’t taking advantage of, and that wouldn’t be available with a dw solution.
…
it’s possible that we don’t need svn for everything, but honestly i think it’s easy enough to use once you get the hang of it that it would be just as easy as the fileserver approach, with a ton of added benefits. perhaps the only true drawback is the disk space that would be required for versioning psd’s and such. but disk space is cheap, and it think the extra storage we’d need would be worth its small cost if we had constant access to everything.
Our sysadmin already had some repositories set up that weren’t getting wide use, so setting up another one was trivial. He added a bunch of disk space in anticipation of the new storage demands (while subversion just stores diffs for text files, it stores full copies of each binary file, and we were going to have a lot of those), and I wrote up some instructions for getting people started:
Download and install the subversion binaries
-
for mac (click the download button)
-
for pc (choose the latest .exe file)
Download the GUI
Mac folk: update your path to include svn
- open terminal
cd ~
pico .bash_profile
- enter the following:
PATH="/usr/local/bin:/usr/local/subversion/bin:$PATH"
export PATH
- press CTRL-O to save
- restart terminal
Establish ssl certification
- open a Terminal window (mac) or Start > Run > cmd.exe (windows)
- type
svn ls https://www.svnserver.com/repository/trunk/
and hit enter (get the exact URL for your repository; this is just an example)
- enter user/password
- if your username on your machine is the same as your svn username, enter your password.
- otherwise, press enter and you’ll be prompted for your svn username. enter it.
- enter your svn password.
Getting started and basic workflow
I sat down with a group of initial users to do the initial checkout of the repository and show them the basic workflow. TortoiseSVN makes things especially easy, while scplugin is a bit more rudimentary. Here’s the workflow I explained:
-
update
a folder before you begin work in it; to save time, just update the specific folder, not the whole repo
- make your changes
-
add
any new folders and files you create to the repo – they won’t be added automatically!
- if you change the structure of a dir, or remove a file, you have to do it via svn!
-
rename
to change a file name or move a file
-
delete
to remove a file
-
update
folder prior to commit to receive others’ changes
-
commit
(check in) whenever you reach a milestone or stop work. enter a message with your commit to indicate what you did.
File structure
Subversion is usually used for managing development projects, but we wanted us to use it to manage an infinite number of small, concurrent projects related to our work maintaining the content on a large client’s web site. The branches/tags/trunk paradigm didn’t quite fit here. We ended up keeping the b/t/t setup, but most people just check out the trunk, which contains the following folders:
-
client_site, with a directory structure that mirrors the structure of our client’s web site. This is where we keep most of our files. By mirroring the directory structure of the client’s web site, we make it easy to find a file if we know the URL of the file on the site.
-
projects, for files related to projects that don’t fit neatly into the site structure.
-
resources, for image templates, HTML templates, fonts, logos, etc.
To do
Because we are constantly creating new files and adding them to the repository, some directories are getting unduly large, making update
s take a long time, and forcing users to store a lot of unnecessary files locally once they do an update
. We need to work out a way to age files so they are still available and easy to locate, but don’t get picked up as part of the update
process.
Further reading


Contents
This tutorial will guide you through making a simple chat application that uses Minerva to communicate between the browser and the server. We'll install Minerva and Closure Library, then write a chat server (in Python) and chat client (in JavaScript). If at any point you get stuck for any reason, please tell Ivan so he can improve the tutorial.
If you don't want to use Closure Library, read the standalone Minerva tutorial instead.
Important! Show instructions for:
(This setting changes the entire document.)
The Minerva server uses Python and Twisted, so you'll need both to write your application server.
sudo apt-get install python-twisted
Install the latest version of Twisted for your Python version. Try the MSI installer first. Note that Twisted won't work until you install zope.interface (described below).
Install the latest pywin32 for your Python version (direct link to pywin32 216 for 32-bit Python 2.7). This is required for some Twisted functionality including process-spawning, the IOCP reactor, and colored trial output.
Install the latest version of pyOpenSSL for your Python version. Try the MSI installer first. pyOpenSSL is an optional Twisted dependency that allows you to write SSL clients and servers.
pip is the package manager you'll (probably) use to install zope.interface, Minerva, Minerva and and all of Minerva's dependencies. pip provides a way to uninstall and correctly upgrade a package, which Python's distutils-only setup.py install approach can't do. Note that the following instructions assume that the related virtualenv is not used.
C:\Python27\python distribute_setup.py
Now, install pip:
C:\Python27\python get-pip.py
(If you saved it in Chrome, that might be get-pip.py.txt)
Now, install zope.interface with pip:
C:\Python27\Scripts\pip install zope.interface
Ignore this warning:
An optional code optimization (C extension) could not be compiled.
Of course, you can use pip to install almost any Python package.
Side note: if you don't want to type out C:\Python27 and C:\Python27\Scripts every time, you can add both directories to your User or System Path variable (instructions for XP or Windows 7). Then you'll be able to type just python or pip. (Note: reopen the cmd window for Path changes to take effect.)
sudo apt-get install python-pip
or on an older distribution:
sudo apt-get install pip
The simplest way to install Minerva and its dependencies is:
pip install --user Minerva
C:\Python27\Scripts\pip install Minerva
The above will install Minerva and its dependencies Coreweb, Webmagic, Securetypes, Strfrag, jinja2, and simplejson.
--user installs everything to your ~/.local/lib/ rather than the system-wide Python root.
Alternative route: if you prefer not to have pip download packages, or want the very latest code, you can use git and pip install .:
git clone https://github.com/ludios/Minerva git clone https://github.com/ludios/Coreweb git clone https://github.com/ludios/Webmagic git clone https://github.com/ludios/Securetypes git clone https://github.com/ludios/Strfrag git clone https://github.com/mitsuhiko/jinja2 git clone https://github.com/simplejson/simplejson
Then, cd into each directory and run:
pip install --user --no-deps --ignore-installed .
C:\Python27\Scripts\pip install --no-deps --ignore-installed .
(note the trailing .).
The Minerva client uses Closure Library, so you'll need a copy. Google doesn't do regular releases of it, so you'll want to get a copy of trunk (it's kept stable).
sudo apt-get install subversion
From now on, you'll be working in some kind of Projects directory that you can put anywhere. The rest of this documentation will assumes that it's called Projects and in your home directory, so substitute paths if that's not the case.
Make a Projects directory if you don't already have one:
mkdir ~/Projects cd ~/Projects
cd /d "%USERPROFILE%" mkdir Projects cd Projects
(Tip: /d means switch drive letter if necessary.)
Now, inside Projects, check out Closure Library:
svn checkout https://closure-library.googlecode.com/svn/trunk/ closure-library
Alternative route: if you prefer to have the full version history of Closure Library, you can use git svn to do the checkout (this will take much longer):
git svn clone --stdlayout https://closure-library.googlecode.com/svn closure-library
(This requires msysgit. When installing, select "Run Git from the Windows Command Prompt" and "Checkout as-is, commit as-is".)
By now, you have everything you need to start working with Minerva. But before you do so, run the unit tests to make sure that Minerva works properly on your system. To do this, we use Twisted's test runner, trial. If you have Twisted installed, you already have trial.
Run the unit tests for Minerva, Webmagic, Securetypes, and Strfrag:
trial minerva webmagic test_securetypes test_strfrag
C:\Python27\python C:\Python27\Scripts\trial.py minerva webmagic test_securetypes test_strfrag
The tests should take a few seconds to run. Make sure the very last line of the output says PASSED. Note that it's okay to see tracebacks for tests marked [TODO].
If any of the tests failed, Minerva may still work, but please report a bug for Minerva, Webmagic, Securetypes, or Strfrag. Any test failure, hang, or crash is a bug.
Minerva also comes with client-side unit tests. These tests run in a browser, rather than in the command line. To run these tests, you'll first need to start the minerva_site server installed by Minerva.
To start minerva_site's HTTP server, run:
cd /tmp twistd -n minerva_site -t tcp:8111:interface=<IP_ADDRESS> -m tcp:8430:interface=<IP_ADDRESS> "--closure-library=$HOME/Projects/closure-library"
cd /d "%TEMP%" C:\Python27\python C:\Python27\Scripts\twistd.py -n minerva_site -t tcp:8111:interface=<IP_ADDRESS> -m tcp:8430:interface=<IP_ADDRESS> "--closure-library=%USERPROFILE%\Projects\closure-library"
You should now be able to reach the server at http://<IP_ADDRESS>:8111/ . Note that the above command also starts a non-HTTP socket listener on port 8430. This is used by Minerva's optional Flash socket transport. You may use any port numbers you want. Run C:\Python27\python C:\Python27\Scripts\twistd.py -n minerva_site --help twistd -n minerva_site --help for more minerva_site help.
The first cd step above is optional; do it to avoid creating some files (twistd.log, twistd.pid) in a directory that needs to stay unchanged. (And what's twistd, you ask? It's Twisted's tool for starting up daemons. But in this case, we use -n to stay in the foreground rather than daemonize.)
With the server running, you can run the client-side tests by navigating to:
http://<IP_ADDRESS>:8111/js_minerva_tests.html
After a few seconds, you'll see a box in the top-right corner indicating test suite success (green) or failure (red). If you see any failures, please report a bug on Minerva.
Is your test runner stuck or failing after a delay? It's probably because some tests use a Flash object (when the Flash plugin is available, at least). Chrome users who block plugins may have to allow plugins for this domain (click the plugin icon in the URL bar). NoScript users may have to click on the Flash object at the top of the page. The same for Opera users who block plugins until clicked.


Sungmin releases 2nd pensive MV teaser for 'Orgel'
by beansssSungmin has released a second MV teaser for his solo comeback title track "Orgel".
The MV teaser captures the quiet, thoughtful mood of Sungmin's title track with scenes of the singer quietly reflecting on his past and present. "Orgel" will be a warm, acoustic pop genre featuring comforting guitar sounds.
Meanwhile, Sungmin's 1st mini album 'Orgel' is set for release this November 22 at 6 PM KST. He'll also be greeting fans on the same day at 8 PM KST with a special comeback 'V Live' broadcast, 'Sungmin's Music Box'.


Use the Open sidebar! to open the sidebar and change the width of the map.
This example shows how to animate the resizing of a map without distortions of the map during the animation. This uses the ngeoResizemap directive.
ngeoResizemap


Convert 10-digit Unix time to a Human Date/Time: (based on how many seconds have passed since 1/1/1970) UNIX Time: Destination Time:
Convert Human Date/Time to a Unix time: (based on how many seconds have passed since 1/1/1970)


Bachelor of Science in Computer Science, graduated Cum Laude
Rochester Institute of Technology Rochester, NYFocused on computational theory and language design. This included clases such as compiler design, computational complexity, and programming language theory. I supplemented these classes with others on data mining and artificial intelligence. Graduated with honors.


Press SPACE to Start The Game
Wait until the page is Completely loaded
allow to the browser to use your microphone
Game Over
Between 200 and 600: ball goes down
Greather Than 600: ball goes high
Play This Game in a quiet please.


@CordaInternal fun leafIndex(leaf: SecureHash): Int
Method to return the index of the input leaf in the partial Merkle tree structure.
leaf
- the component hash to check.
MerkleTreeException
- if the provided hash is not in the tree.
Return
leaf-index of this component (starting from zero).


WITNESS LIST Natural Resources Committee March 7, 2005-1:00P HB 812 For: Huffines, Phillip (Huffines Communities, Inc.) HB 813 For: Huffines, Phillips (Huffines Communities, Inc.) HB 841 For: Schaeffer, Brian (Texas Association of Campground Owners) HB 1141 For: Huffines, Phillip (Huffines Communities, Inc.) HB 1657 On: Ward, J. Kevin (Texas Water Development Board)


Toggle navigation
Comp Sci Club
Meetings
Resources
Have a question?
Expand your technological
Knowledge
I love bunnys


I present to you three points that counter some of the common logic that I’ve heard recently. Many have presented BTCC as a loss, that the crash in crypto price is horrible, and somewhat off topic people believe Daniel is the hero of the Karate Kid movies.
Let’s break those down
I have a sense of what you’re going to say here. Technically speaking we lost the BTCC poll.
But look at those stats. ~76,000 people voted for Steemit! That’s huge. That’s 12-13x our weekly user base.  That’s not even everyone. That’s the people that knew about the contest, and those that aren’t more invested in the other currencies. In the multiple rounds this platform beat out altcoins that have been around longer and have a pretty dedicated user base.
 We went through multiple rounds of voting, beat out other coins (and in that process got exposed to other coins), and when they run the contest again we’ll be in a great spot to win! Which actually is a good segway to the next point!
 Crypto is going through an expansion. Lots of people called it a bubble, but that’s not accurate. When the price of 1 BTC went above 1oz of Gold people started freaking out and rethinking crypto in their portfolio. Add to that US dollar printing reaches $160M a day while there’s only of fraction of that per year for most of the major alt coins and investors start seeing powerful deflationary coins rather than inflation. More people started buying them and using them. Ultimately this is a good thing, and the price will steadily rise as a result. This is just a hiccup.
You’ve been told economies need inflation. If we don’t have inflation things will be terrible. In this case it just means that the same amount of coins is being used by more people, but the same amount of goods and services are being created and traded, and so you need less coins to purchase it. That isn’t bad if you already held the coins!!!
The bankers need inflation. They need it because they have leveraged themselves out 14-50x. If money deflates it means they have to pay back more than what they borrowed and then multiple that by how much they are leveraged. No, the mantra put out by the bankers publicists on the finance talk shows is in support of their decisions and not what is in our benefit.
Back in the day the price of a computer was like a $1M. It took up a whole room. Now it’s a couple hundred dollars and the size of loaf of bread.  Has that ruined your life? That’s a deflationary trend, but like a lot of other deflationary trends it was actually good for consumers!!!
So, I’m not freaking out about the correction. People got worked up, bought too much for right this second, and the price came back down, but as long as there’s an assload of inflation in government fiat and practically speaking none in crypto the value of my coins are going up while the value of my Fed Reserve Notes are declining!!! I’m going to buy more crypto.
The real Karate Kid
Finally, just to throw the last bit of sand in the eyes of those lamenting opposite viewpoints from that presented above I thought I’d leave you with this gem.
https://www.youtube.com/watch?v=C_Gz_iTuRMM
I’m announcing a witness run next week. Please support me.
This page is synchronized from the post: ‘We won BTCC, BTFD, and Daniel isn’’t the karate kid: a contrarian’’s guide to today’’s pervasive thoughts.’


Microsoft Whiteboard's web app now supports more documents from Windows 10
Microsoft Whiteboard on the web now supports more documents uploaded through the Windows 10 app.
by Sean EndicottSource: Microsoft
What you need to know
- Microsoft Whiteboard on the web now supports viewing more documents uploaded from the Windows 10 app.
- The web app of Microsoft Whiteboard can now see PDFs, Word documents, and PowerPoint documents added through the Windows 10 app.
- Microsoft Whiteboard is available on Windows 10, iOS, and the web.
Microsoft Whiteboard recently gained the ability to view more documents in its web app. People can now see PDFs, Word documents, and PowerPoint documents within the web app that were added through the Windows 10 app. This change makes the web version of Microsoft Whiteboard more useful, which is handy for anyone that can't use a native app or prefers to use the web app. Ian Mikutel, the Senior Project Lead in charge of Microsoft Whiteboard, shared the news on Twitter.
Microsoft Whiteboard allows several people to collaborate on a shared virtual whiteboard. It syncs in real-time and allows people to work together from different devices. Microsoft Whiteboard is currently available on Windows 10, iOS, and the web. Android tablets don't have a native application but can use the web app.
To use the web app for Microsoft Whiteboard, you need to sign in with a work or school Office 365 account. The Windows 10 and iOS apps work with personal, work, and school accounts.
Microsoft Whiteboard
This digital canvas allows you to collaborate with people in real-time using pen and touch.
We may earn a commission for purchases using our links. Learn more.


MySQL Server Configuration
This page can be used to adjust global configuration settings for the MySQL
database server. Typically you will not need to change any of these, although
the buffer and cache sizes can be increased on systems with large numbers of
tables and data.
For any changes to take effect, the MySQL server must be stopped and re-started
using the buttons on the module's main page.


{% extends "_layouts/base.html" %} {% block css %} {{block.super}} {% endblock css %} {% block page_title %}Your Site - Home{% endblock %} {% block page_class %}home-page{% endblock %} {% block content %}
This is a machine learing model for showcasing if the number is divisible by 3 print "fizz", if it's divisible by 5 print "buzz", and if it's divisible by 15 print "fizzbuzz". Otherwise, it prints the number!!
| # | First Name | Last Name | Username |
|---|---|---|---|
| 1 | Mark | Otto | @mdo |
| 2 | Jacob | Thornton | @fat |


Deprecated: This routine has been superseded by the CSPICE routine
cspice_subslr. This routine is supported for purposes of backward
compatibility only.
CSPICE_SUBSOL_PL02 returns the rectangular coordinates of the sub-solar
point on a target body at a particular epoch, optionally corrected for
light time and stellar aberration. The target body's surface is
represented by a triangular plate model contained in a type 2 DSK
segment. Return the sub-solar point's coordinates expressed in the
body-fixed frame associated with the target body. Also, return the
observer's distance from the sub-solar point.
Given:
handle the DAS file handle of a DSK file open for read
access. This kernel must contain a type 2 segment that
provides a plate model representing the entire surface
of the target body.
[1,1] = size(handle); int32 = class(handle)
dladsc the DLA descriptor of a DSK segment representing the
surface of the target body.
[SPICE_DLA_DSCSIZ,1] = size(dladsc)
int32 = class(dladsc)
method a short string specifying the computation method
to be used.
[1,c1] = size(method); char = class(method)
or
[1,1] = size(method); cell = class(method)
The choices are:
'Intercept' The sub-solar point is defined as
the plate model surface intercept
of the ray starting at the Sun and
passing through the target's
center.
'Ellipsoid
near point' The sub-solar point is defined as
the plate model surface intercept
of the ray starting at the Sun and
passing through the nearest point
to the observer on a reference
ellipsoid associated with the
target body.
This option requires that the
reference ellipsoid's radii be
available in the kernel pool.
Neither case nor white space are significant in the
string "method". For example, the string
' ellipsoidNEARPOINT'
is valid.
target the name of the target body. `target' is
case-insensitive, and leading and trailing blanks in
`target' are not significant. Optionally, you may supply
a string containing the integer ID code for the object.
For example both 'MOON' and '301' are legitimate strings
that indicate the moon is the target body.
This routine assumes that the target body's surface is
represented by a plate model, and that a DSK file
containing the plate model has been loaded via dasopr_c.
[1,c2] = size(target); char = class(target)
or
[1,1] = size(target); cell = class(target)
et the epoch, represented as seconds past J2000 TDB, at
which the sub-solar point on the target body is to be
computed. When aberration corrections are used, `et'
refers to the epoch at which radiation is received at
the observer.
[1,1] = size(et); double = class(et)
abcorr indicates the aberration corrections to be applied to
the position and orientation of the target body and the
position of the Sun to account for one-way light time
and stellar aberration. See the discussion in the
Particulars section for recommendations on how to choose
aberration corrections.
[1,c3] = size(abcorr); char = class(abcorr)
or
[1,1] = size(abcorr); cell = class(abcorr)
`abcorr' may be any of the following:
'NONE' Apply no correction. Use the geometric
positions of the Sun and target body
relative to the observer; evaluate the
target body's orientation at `et'.
The following values of `abcorr' apply to the
"reception" case in which photons depart from the
target's location at the light-time corrected epoch
et-lt and *arrive* at the observer's location at
`et':
'LT' Correct for one-way light time (also
called "planetary aberration") using a
Newtonian formulation. This correction
uses the position and orientation of the
target at the moment it emitted photons
arriving at the observer at `et'. The
position of the Sun relative to the
target is corrected for the one-way light
time from the Sun to the target.
The light time correction uses an
iterative solution of the light time
equation (see Particulars for details).
The solution invoked by the 'LT' option
uses one iteration.
'LT+S' Correct for one-way light time and stellar
aberration using a Newtonian formulation.
This option modifies the positions
obtained with the 'LT' option to account
for the observer's velocity relative to
the solar system barycenter (note the
target plays the role of "observer" in the
computation of the aberration-corrected
target-Sun vector). The result is the
sub-solar point computed using apparent
position and orientation of the target as
seen by the observer and the apparent
position of the Sun as seen by the target.
'CN' Converged Newtonian light time correction.
In solving the light time equation, the
'CN' correction iterates until the
solution converges (three iterations on
all supported platforms).
'CN+S' Converged Newtonian light time
and stellar aberration corrections.
obsrvr the name of the observing body. This is typically a
spacecraft, the earth, or a surface point on the earth.
`obsrvr' is case-insensitive, and leading and trailing
blanks in `obsrvr' are not significant. Optionally, you
may supply a string containing the integer ID code for
the object. For example both 'EARTH' and '399' are
legitimate strings that indicate the earth is the
observer.
[1,c4] = size(obsrvr); char = class(obsrvr)
or
[1,1] = size(obsrvr); cell = class(obsrvr)
the call:
[spoint, dist, plateid] = ...
cspice_subsol_pl02( handle, dladsc, method, ...
target, et, abcorr, ...
obsrvr )
returns:
spoint the sub-solar point on the target body expressed
relative to the body-fixed reference frame of the target
body.
[3,1] = size(spoint); double = class(spoint)
The definition of sub-solar point depends on the
selected computation method. See the description of the
input argument `method' for details.
The target body-fixed frame, which is time-dependent, is
evaluated at `et' if `abcorr' is 'NONE'; otherwise the
frame is evaluated at et-lt, where `lt' is the one-way
light time from target to observer.
The position and orientation of the target body and the
position of the Sun are corrected for aberration as
specified by `abcorr'; the corrected positions and
orientation are used in the computation of `spoint'.
dist the distance between the observer and the sub-solar
point. The observer is presumed to be outside the
target body, so `dist' is always non-negative.
[1,1] = size(dist); double = class(dist)
plateID the integer ID code of the plate on which the
sub-solar point is located. This ID code can be
use to look up data associated with the plate, such
as the plate's vertices or outward normal vector.
[1,1] = size(plateID); int32 = class(plateID)
Any numerical results shown for this example may differ between
platforms as the results depend on the SPICE kernels used as input
and the machine specific arithmetic implementation.
Find the sub-solar point on Phobos as seen from Earth for a
specified sequence of times. Perform the computation twice,
using both the "intercept" and "ellipsoid near point"
options. Compute the corresponding sub-solar point values
using an ellipsoidal surface for comparison.
In the following example program, the file
phobos_3_3.dsk
is a DSK file containing a type 2 segment that provides a plate model
representation of the surface of Phobos. The file
mar097.bsp
is a binary SPK file containing data for Phobos, the Earth, and the
Sun for a time interval bracketing the date
2006 NOV 3 00:00:00 UTC.
pck00010.tpc is a planetary constants kernel file containing radii
and rotation model constants. naif0010.tls is a leapseconds kernel.
All of the kernels other than the DSK file should be loaded via
a meta-kernel. An example of the contents of such a kernel is:
KPL/MK
\begindata
KERNELS_TO_LOAD = ( 'naif0010.tls'
'pck00010.tpc'
'mar097.bsp' )
\begintext
function subsol_pl02_t( meta, dsk )
%
% Constants
%
NCORR = 2;
NSAMP = 3;
NMETHOD = 2;
TIMLEN = 40;
FIXREF = 'IAU_PHOBOS';
TOL = 1.d-12;
%
% Initial values
%
abcorrs = { 'NONE', 'CN+S' };
emethods = { 'Intercept: ellipsoid', 'Near point: ellipsoid' };
plmethods = { 'Intercept', 'Ellipsoid near point' };
obsrvr = 'Earth';
target = 'Phobos';
%
% Load the metakernel.
%
cspice_furnsh( meta )
%
% Open the DSK file for read access.
% We use the DAS-level interface for
% this function.
%
handle = cspice_dasopr( dsk );
%
% Begin a forward search through the
% kernel, treating the file as a DLA.
% In this example, it's a very short
% search.
%
[dladsc, found] = cspice_dlabfs( handle );
if ~found
%
% We arrive here only if the kernel
% contains no segments. This is
% unexpected, but we're prepared for it.
%
fprintf( 'No segments found in DSK file %s\n', dsk )
return
end
%
% If we made it this far, `dladsc' is the
% DLA descriptor of the first segment.
%
% Now compute sub-solar points using both computation
% methods. We'll vary the aberration corrections
% and the epochs.
%
et0 = 0.0;
stepsize = 1.d6;
for i = 0:(NSAMP-1)
%
% Set the computation time for the ith sample.
%
et = et0 + i * stepsize;
timstr = cspice_timout( et, ...
'YYYY-MON-DD HR:MN:SC.### ::TDB(TDB)' );
fprintf( '\n\nObservation epoch: %s\n', timstr )
for coridx = 1:NCORR
abcorr = abcorrs( coridx );
fprintf( '\n abcorr = %s\n', char(abcorr) );
for midx = 1:NMETHOD
%
% Select the computation method.
%
method = plmethods( midx );
fprintf( '\n Method =%s\n ', char(method) )
%
% Compute the sub-solar point using a plate
% model representation of the target's surface.
%
[xpt, dist, plid] = ...
cspice_subsol_pl02( handle, dladsc, method, ...
target, et, abcorr, ...
obsrvr );
%
% Represent the surface point in latitudinal
% coordinates.
%
[ xr, xlon, xlat] = cspice_reclat( xpt );
fprintf( ...
'\n Sub-solar point on plate model surface:\n' )
fprintf( ' Planetocentric Longitude (deg): %f\n', ...
xlon * cspice_dpr() )
fprintf( ' Planetocentric Latitude (deg): %f\n', ...
xlat * cspice_dpr() )
fprintf( ' Radius (km): %f\n', ...
xr )
fprintf( ' Observer distance (km): %f\n', ...
dist )
fprintf( ' ID of surface point plate: %d\n', ...
plid )
%
% Compute the sub-solar point using an ellipsoidal
% representation of the target's surface.
%
method = emethods( midx );
[xpt, trgepc, srfvec] = cspice_subslr( method, target, ...
et, FIXREF, ...
abcorr, obsrvr );
%
% Represent the surface point in latitudinal
% coordinates.
%
[xr, xlon, xlat] = cspice_reclat( xpt );
fprintf( ' Sub-solar point on ellipsoidal surface:\n' )
fprintf( ' Planetocentric Longitude (deg): %f\n', ...
xlon * cspice_dpr() )
fprintf( ' Planetocentric Latitude (deg): %f\n', ...
xlat * cspice_dpr() )
fprintf( ' Radius (km): %f\n', ...
xr )
fprintf( ' Observer distance (km): %f\n', ...
cspice_vnorm(srfvec) )
end
end
end
%
% Close the DSK file. Unload all other kernels as well.
%
cspice_dascls( handle )
cspice_kclear
MATLAB outputs:
>> subsol_pl02_t( 'illum_pl02.tm' ,'phobos_3_3.bds')
Observation epoch: 2000-JAN-01 12:00:00.000 (TDB)
abcorr = NONE
Method =Intercept
Sub-solar point on plate model surface:
Planetocentric Longitude (deg): 102.413905
Planetocentric Latitude (deg): -24.533127
Radius (km): 11.612325
Observer distance (km): 276700026.580116
ID of surface point plate: 164811
Sub-solar point on ellipsoidal surface:
Planetocentric Longitude (deg): 102.413905
Planetocentric Latitude (deg): -24.533127
Radius (km): 10.922580
Observer distance (km): 276700027.168434
Method =Ellipsoid near point
Sub-solar point on plate model surface:
Planetocentric Longitude (deg): 105.857346
Planetocentric Latitude (deg): -16.270558
Radius (km): 11.645162
Observer distance (km): 276700027.058857
ID of surface point plate: 192093
Sub-solar point on ellipsoidal surface:
Planetocentric Longitude (deg): 105.973365
Planetocentric Latitude (deg): -15.976232
Radius (km): 11.249340
Observer distance (km): 276700027.400706
abcorr = CN+S
Method =Intercept
Sub-solar point on plate model surface:
Planetocentric Longitude (deg): 114.623420
Planetocentric Latitude (deg): -24.533628
Radius (km): 11.411417
Observer distance (km): 276710249.789163
ID of surface point plate: 170492
Sub-solar point on ellipsoidal surface:
Planetocentric Longitude (deg): 114.623420
Planetocentric Latitude (deg): -24.533628
Radius (km): 11.046740
Observer distance (km): 276710250.099485
Method =Ellipsoid near point
Sub-solar point on plate model surface:
Planetocentric Longitude (deg): 120.870428
Planetocentric Latitude (deg): -15.247903
Radius (km): 11.350346
Observer distance (km): 276710250.680859
ID of surface point plate: 205719
Sub-solar point on ellipsoidal surface:
Planetocentric Longitude (deg): 120.795481
Planetocentric Latitude (deg): -15.366726
Radius (km): 11.494153
Observer distance (km): 276710250.555135
...
cspice_subsol_pl02 computes the sub-solar point on a target body.
cspice_subsol_pl02 also determines the distance of the observer from the
sub-solar point.
Sub-point Definitions
=====================
This routine offers two ways of defining the sub-solar point:
- The 'intercept' method. In general, this definition
calls for defining a ray emanating from the Sun and
passing through the center of the target body. The intercept
on the first plate (the one closest to the observer) hit by this
ray is the sub-point.
- The 'ellipsoid near point' method. When a target's surface is
modeled by a set of triangular plates, the notion of "dropping
a perpendicular segment to the surface," which makes sense for
convex surfaces, becomes problematic: there need not be any
plate whose normal vector is parallel to a segment from the Sun
to some point on that plate, or there could be more than one
such plate. If such a plate exists, it might be located
anywhere on the visible surface---not necessarily "below" the
Sun.
To work around these problems, the ellipsoid near point method
uses a reference ellipsoid to define a preliminary sub-solar
point: this is the unique point on the ellipsoid's surface at
which the outward surface normal points toward the Sun. Then
the plate model sub-solar point is defined as the plate
intercept closest to the Sun of a ray emanating from the Sun
and passing through the preliminary sub-solar point on the
ellipsoid.
For a large target such as Mars, or for any target whose reference
ellipsoid deviates significantly from spherical, the results
obtained using the two sub-point definitions can be quite different.
The example program provided below demonstrates this fact; Phobos is
the target body in this case. Some analysis on the user's part will
be needed to select the "best" definition for a given application.
When comparing sub-solar point computations with results from
sources other than SPICE, it's essential to make sure the same
geometric definitions are used.
Aberration Corrections
======================
Below, we indicate the aberration corrections to use for some
common applications:
1) Compute the sub-solar point using the apparent direction
and orientation of a target. This is the most common case for
a remote-sensing observation. When the observer's altitude
is more than one target radius above the surface:
Use 'LT+S': apply both light time and stellar
aberration corrections.
Note that when the observer is close to the target surface,
this choice may yield inaccurate results, since light time is
measured between the observer and the target center. When the
observer has altitude of less than one target radius above the
surface, aberration corrections should be omitted, so in this
case abcorr should be set to:
'NONE'
Note that this selection calls for using the geometric position
of the Sun.
2) Use a geometric position vector and uncorrected target
orientation as low-accuracy estimates for an application where
execution speed is critical.
Use 'NONE'.
See the header of the CSPICE routine spkezr_c for a detailed
discussion of aberration corrections.
For important details concerning this module's function, please
refer to the CSPICE routine subsol_pl02.
MICE.REQ
DSK.REQ
PCK.REQ
SPK.REQ
TIME.REQ
-Mice Version 1.0.0, 25-JUL-2016, NJB, EDW (JPL)
sub-solar point using triangular plate_model
sub-solar point using type_2 dsk
|


Classes, Objects, and Variables
June 18 2015
"Ruby is a perfect Object Oriented Programming Language. Everyting in Ruby is object."
Object orientention is not only development style.  And every objects has state and behavior. Take for example dog: state(name, color, breed) and behavior (barking, fetching). So for every objects which you see ask yoursefl two questoins: "What possible states can this object be in?" and "What possible behavior can this object perform?".
Let's start from example. We created class SquareWhat we did in this example
- The
keyword define a class.class - The
method is what actually constructs the data structure. Every classinitialize must contain an
method.initialize @side_length
is an object variable. Similar to the keys of a hash. The@
sign distinguishes
as an object variable. Every time you create an object of the class@street Square
, this object will contain a@side_length
variable.
Let's create a new instance of
class Square.
Getter and Setter methods
Ok. Now we have class Square and already created instance of this class. But what if you want now read or rewrite side_length
. How we can do this. For this purpose we need getter and setter method.
But making our code more elegant we can use attr_reader and attr_writer
in Ruby.
attr_reader
is a getter which means that it just returns a value or state outside of the class, but does not change it.
attr_writer
is a setter which means that you can change the value of the variable outside of the class, but it is not readable.
Methods
Inside ourclass Square
we already have method initialize
. Now we will add method area
and method perimetr
All of this methods are objects methods.


The following parameters are available :
- Table
- The table these permissions should apply to.
- Username
- The user to whom the permissions are granted. This user must already
exist in the User Permissions table.
- Hosts
- The hosts that the user can access the table from.
- Table permissions
- The permissions granted to the user on all columns of the table.
- Field permissions
- The maximum permissions that can be granted to this user for any
column of the table in the Field Permissions page.


{%- include head.html -%}
{%- include header.html -%}
{%- include left_nav.html -%}
{{ content }}
{%- include footer.html -%} {%- include footer-includes.html -%}


Mayuki Sawatari<EMAIL_ADDRESS>Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.  IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
Released under MIT license Copyright (c) 2009-2010 Dominic Baggott Copyright (c) 2009-2010 Ash Berlin Copyright (c) 2011 Christoph Dorn<EMAIL_ADDRESS>(http://www.christophdorn.com)
Unlicense SIMON LAROCHE


Problem: 287 million learners spread across 22 Indian languages, who can speak the language but cannot read or write. Thousands of physical primers (instructional material) developed under the aegis of National Literacy Mission.
How to design educational technologies for such a scale and variety without losing focus on quality of instruction?Can we make teaching/learning interesting? Can gamification help? The focus of this project is to design games for different domains like software egnienering, programming, data structures and so on to make learning fun from the ouside and facilitate reasoning ability at the backend by basing our design on commonly established instructional design models. We are also keen to explore emerging trends like augumented reality, touch and other ways to facilitate better learning experience
This upcoming project focuses on understanding the current ways of teaching "first course on programming" in IITs as a first step to design a curriculum for computing in India


borland .map file format
| the map file is simply a list of the segments contained in the compiled program together with information about the segment type and where it appears in the compiled code. here is an example of a .map file for a tasm prog i wrote: start stop length name class 00000h 00000h 00000h _text code 00000h 00356h 00357h _codeseg code 00358h 00358h 00000h _data data 00360h 00ee9h 00b8ah _varseg data 00ef0h 108efh 0fa00h _scrnseg scrn 108f0h 1092fh 00040h _stackseg stack program entry point at 0000:02c7 warning: no stack first it displays headings for each column (start, stop, length, name, and class).. then it lists all the segments in the order they appear in the executable... the start is how far into the code (in hex) that the segment starts at, stop is how far into the code the segment ends.. and the length is stop - start. under name is just the name of the segment that the programmer gave it when programming it.. (default segs are _text and _data if you just use .code and .data to start your segs) and class is the alias that you give the seg.. for example.. if you declare the seg like the following in your program: _scrnseg segment public 'scrn' _scrnseg ends the name will be _scrnseg and the class will be scrn. the program entry point is the state of cs:ip upon entry to the program (cs will be offset however depending on where in memory the program is loaded).. after that it lists any warnings or errors in the program.. in this case it gave a no stack warning because i manually declared a stack seg rather than using the conventional .stack <size> directive. -------------------------------- brad kimmel<EMAIL_ADDRESS>mississauga, ontario, canada -------------------------------- |


| EURO PMI YoY% | GERMAN PMI YoY% | ||||
| Date | For Month | Previous | Released | Previous | Released |
| 2-Jan-18 | Dec-17 | 12.85 | 10.38 | 16.57 | 13.85 |
| 1-Feb-18 | Jan-18 | 10.38 | 7.97 | 13.85 | 7.19 |
| 1-Mar-18 | Feb-18 | 7.97 | 5.78 | 7.19 | 6.69 |
| 3-Apr-18 | Mar-18 | 5.78 | - | 6.69 | - |
| Copyright: Kshitij Consultancy Services |


Calder's Math Quiz
8/4 =
24/6=
What is the square root of 81?
What are the first five digits of pi?
How many even numbers are there before 100?
What is 2000-700
What is the square root of 64
What is 15/5
What is 10 times 0
What is 36/2


Bodexpress entered into Wednesday allowance at Gulfstream Park West
by HRN StaffBodexpress, the fan favorite who finally broke his maiden last month, will aim for a second score Wednesday at Gulfstream Park West.
The 3-year-old Bodemeister colt is entered into a $45,000 allowance race going one mile against seven rivals. Emisael Jaramillo will have the mount for the day's seventh race, scheduled for a 4:21 p.m. EST post.
Bodexpress earned a Kentucky Derby shot thanks to a surprise second-place Florida Derby (G1) effort. He was placed 13th on the first Saturday in May, but it was his Preakness Stakes DNF – where he threw jockey John Velazquez at the start, then galloped the rest of the way alongside his rivals – that increased his profile.
The Gustavo Delgado trainee went nearly five months between starts, not appearing again after the Preakness until a maiden special weight race Oct. 14 at Gulfstream Park West. Bodexpress cruised that afternoon at 1-9 odds, earning his first win in his eighth start.
“We’ll take it step by step,” Gustavo Delgado Jr., the trainer’s son and assistant, said after that race. “Hopefully he comes back from this race in good shape. He has faced good horses before. The way I see it we can try anything.”


Aaron Bieber —
software engineer
- Software engineer with experience on BSD, POSIX and
Linux systems.
- Active contributor to a broad range of open source
projects.
- Strong focus on robust process automation.
- Deep background in Unix administration, operations and
management.
-
-
- Oracle Corporation (Dec 2013
- Present) - Principal Software Engineer
- Software engineer working on large scale identity
management applications.
- Produced and maintained various applications in Go
and Perl. These applications are currently in use across large
sections of Oracle's infrastructure.
- Standardized application life-cycle by introducing
Git and Makefile driven builds for all of our projects.
- Consulted with internal security organizations to
define best practices regarding OS deployments.
-
-
- Corona Solutions (Jun 2009 -
Dec 2013) - Senior Web Developer
-
- Full life cycle development of Perl and JavaScript
(Node.js) applications used to clean, consolidate, restructure and
extend data gathered from CAD (Computer Aided Dispatch) systems used
by law enforcement agencies.
- Created a reverse geocoder in Perl using US Census
data and spacial data from law enforcement agencies.
- Built new methods for manipulating, storing and
cross-referencing large amounts of CAD data using PL/SQL.
- Designed and implemented a method to securely deploy
production code to "black box" devices deployed across
agencies.
-
-
- Oracle Corporation (Nov 2005
- Jun 2009) - Senior Unix Administrator
-
- Designed enterprise level infrastructure.
- Designed and implemented a broad range of tools for
security auditing (Perl).
- Assessed impact of vulnerabilities against large
portions of company's infrastructure and gave guidance on mitigation
plans.
-
-
- Colorado Technical University
(Oct 2002 - Jul 2005) - Unix /
- Windows System Administration
- Maintenance of Windows Domain with 3,000+
users.
- Integration of Linux with Active Directory.
- Managed the imaging of student labs.
- Deployed an open source wireless network saving
roughly $22,000.
- Administration of all student and faculty servers
(Windows and Unix).
pub rsa4096/0x1F81112D62A9ADCE 2017-01-27 [SC]
Key fingerprint = 3586 3350 BFEA C101 DB1A 4AF0 1F81 112D 62A9 ADCE
uid [ultimate] Aaron Bieber<EMAIL_ADDRESS>uid [ultimate] Aaron Bieber<EMAIL_ADDRESS>uid [ultimate] Aaron Bieber<EMAIL_ADDRESS>uid [ultimate] Aaron Bieber<EMAIL_ADDRESS>uid [ultimate] Aaron Bieber<EMAIL_ADDRESS>sub rsa4096/0x279160AB1BE1236B 2017-01-27 [S]
sub rsa4096/0x20ADADE0DD48B109 2017-01-27 [E]
sub rsa4096/0x4FA951575F92D3E2 2017-01-27 [A]
untrusted comment: signify public key
RWRDQVAc3BqKG0C3YdQPzBevFoyqIx1P1pWpYgpi5CbFyseRu8dPNxLm


I just finished Code complete cover to cover. Here are the most unexpected things I learned
I got code complete several years ago. Actually, it was a graduation gift.
I sometimes peaked into some of its chapters but never thought I was able to read it all at once. It was like a superhuman task for me.
Until this year, where I decided, in the game of no excuses, to play hard. One of the battles I chose to give was to finish the book.
During this time, I learned a lot of stuff. Some expected, some not that much. At least for me. Even though they might be trivial for people with more experience than me.
But how?
I understand that this might sound like tons of work and you want to procrastinate. Consistency is the key here. Can you read 10 pages per day? No? Can you do 5? No? C’mon, make some effort.  And it was so worth it!!
Nuff talking, let’s go to the points:
goto is still here
A quick search in GitHub, reveals quite a few million instances of that. I understand some might be false positives (eg comments) but it is still something significant. And potentially worrying…
One-third of bugs are because of typos
This is not based on very recent research (1975) but sounds valid today too.
The author explains how a colleague, once found bugs in a piece of software by just passing the executable file through a spell checker.
Also, he reminds us that three of the most expensive software errors were caused by a single character change. Damage of about 2.8 billion dollars.
If you have stopped learning in your job, it’s time to leave
That is a painful point. Never leave a job, if you have a good manager who is technically current.
But because there are still quite a few managers who have either stopped learning (and guess what…they don’t care if you learn too) or were never techies at all (have you tried to persuade an ignorant manager to dockerize your apps?), you should highly appreciate a company or even a department with a continuous learning culture and highly technical expertise.
Again, a software engineer who doesn’t learn is already obsolete. Don’t be that fella.
Be humble
People that are playing in the top leagues are extremely humble. And not only in software engineering. Because they accept how limited their brains are, they manage to keep their egos down and they do the proper due diligence to achieve their targets.
Examples of humility are:
- They ask for their code to be reviewed.
- They write modular code, to reduce the complexity of it.
- They use conventions so that they don’t need to burn they head with mundane details.
Conclusion
Thank you for reading this article. I highly recommend Code Complete, as it is one of the most influential books of all time in software engineering. Dont be afraid of the number of pages, and enjoy what the author has to offer.


Module of high-level constructors for ConnectionIO
actions.
Module of high-level constructors for DriverManagerIO
actions.
Module of high-level constructors for PreparedStatementIO
actions.
Module of high-level constructors for PreparedStatementIO
actions. Batching operations are not
provided; see the statement
module for this functionality.
Module of high-level constructors for ResultSetIO
actions.
Module of high-level constructors for StatementIO
actions.
High-level database API. The constructors here are defined in terms of those in
doobie.free.connection
but differ in the following ways:Int
values in JDBC are mapped to one of the proper types defined indoobie.enum
.Option
.CLOB
,InputStream
, etc.) do not appear in this API. They are available in the low-level API but must be used with considerable caution.Array
are available here but usescalaz.ImmutableArray
orList
, depending on usage.


--- layout: post status: publish published: true title: 'Sembcorp: Reception Officer' author: display_name: PR Team login: prteam email<EMAIL_ADDRESS>url: '' author_login: prteam author_email<EMAIL_ADDRESS>wordpress_id: 1307 wordpress_url: http://gatheringtalents.com/?p=1307 date: '2012-06-21 23:12:02 +0000' date_gmt: '2012-06-21 15:12:02 +0000' categories: - Jobs - Other tags: [] comments: [] ---
Job Descriptions:
• Ensure excellent quality of customer service is provided;
• Ensure a proper closure of all calls;
• Provide general administrative support;
• Handling reception and front-line activities;
• Resolve complaints/ feedback and escalate to the various levels;
• Follow up with customers on issues and feedback;
• Perform clerical and other ad hocs duties
Requirements:
• Candidate must possess Diploma in any discipline
• Preferably with 1 – 2 years experience in customer service
• Proficiency in MS Office applications is a must
Pleasant personality with good interpersonal skills
Good written and communication skills
Ability to work independently with minimum supervision
• Good attitude and responsible.
Remuneration will be commensurate with experience and qualifications.
About the company:
Sembcorp Development is a subsidiary of Sembcorp Industries Ltd, a public-listed company on the Singapore Stock Exchange. We are a leading Asian developer with over 20 years’ experience undertaking master planning, land preparation and infrastructure development, and transforming raw land into large scale urban developments. We own, develop, market and manage urban developments comprising industrial parks as well as business, commercial and residential space in Vietnam, China and Indonesia. If you are highly motivated, self-driven and dynamic professionals, we invite you to make a strategic move to strengthen our present team in meeting the challenges of the millennium.


Installation
To install Jenkins on Glassfish, simply copy jenkins.war
to $GLASSFISH_HOME/domains/domain1/autodeploy
. Alternatively, you can do this from admin GUI. See this document for more about this.
Upgrade
You can upgrade your existing Jenkins by overwriting $GLASSFISH_HOME/domains/domain1/autodeploy/jenkins.war
with a newer version. Again, you can also do this from the admin GUI by choosing to redeploy the application as illustrated below.
Setting JENKINS_HOME
There are many ways to do this, but one way to do so is to configure Glassfish to run with the "JENKINS_HOME" system property. From the command line, do the following:
% ./asadmin create-jvm-options -DJENKINS_HOME=/path/to/jenkins_home
You can do the same from the admin GUI, as illustrated below:
This technique should be also used to increase the VM heap size, when your Jenkins gets big.
If you get confused or this doesn't work, just try to set JENKINS_HOME
environment variable before launching Glassfish:
% export JENKINS_HOME=/path/to/jenkins_home % ./asadmin start-domain
Glassfish needs to be restarted for this change to take effect.
Securing Jenkins
See the forum thread on this topic.
Relevant Issues
See the list of issues filed that are specifically marked relevant to Glassfish.
There is also a known issue on Glassfish Enterprise that causes some Jenkins pages to fail. To workaround this issue, use Hudson 1.360 or higher and start Glassfish with -Dhudson.util.Secret.provider=SunJCE
. See section above for into on setting system properties.


| Methods | Brief description |
| Engine | |
| GetApplicationName | Get the application name, based on the running executable. |
| GetApplicationPath | Get the application path, based on the running executable. |
| HasMode | Retrieve if a particular coffee::RUN_MODE is active. |
| Quit | Safely ask to quit the application. |
| Update | Update the registered modules through the coffee::shell::ModuleManager. |
| ~Engine |


The Instant Messenger
Before you can start using the IM kit, you must have configured at least one protocol. You will only be able to communicate with users/contacts on a protocol if you have an account on that protocol. Just to make it clear, you will need an AIM account to talk to AIM users, a Yahoo! account to talk to Yahoo! users, etc. The IM kit is limited to one account for each protocol, and you can sign in on them all simultaneosly.
Starting a Chat
To start a chat using the im_client with a person, you will first have to check if the person is available for a chat or not. There are three statuses in the IM kit: Available, Away and Offline. The easiest way to see if they are available for a chat is by accessing the IM kit's Deskbar replicant and choose Queries. In the Queries sub menu, you can choose the default Query. This will open a query window that lists all your online friends:
From the Query window you can choose a contact's People file and open it with your preferred im_client:
Instead of making use of live queries, you can use the tool im_contactlist, and then simply just double-click on the person's entry to bring up the default chat client.
An im_client window will stay where you put it (unless you click the deskbar icon when there is a pending message, then it'll bring a window with a pending message to the current workspace). But in the case where there is no window associated with a user it'll pop up a window on the current workspace.
Depending on what Instant Messenger your buddy is using, you can see when the User is typing.. . This feature makes it easier to make a conversation.
Clicking Show info opens your contacts People file, and clicking E-mail will start your default e-mail client. You can also block a contact. Have in mind that blocking a contact will only make the client ignore the messages that the person is sending to you. The person will in other words still see that you are online. As far as they know, you might only be away from the computer or they might even guess that you are ignoring them. Be careful using this feature.
Looking Up Content From a Chat
Select a word or part of the chat and right-click the mouse. A context menu will then appear, letting you choose to look up your selection at Dictionary, Google and Acronym Finder.
Receiving Messages
If you receive a message from somebody, a new window will open where you can chat with them and an alert will appear in the Deskbar. The IM kit's replicant will switch from green to orange when you receive a new instant message. A red replicant indicates that you are not online.
Emoicons - Emotion Icons (Smileys)
The IM kit also comes with an alternative chat client, the im_emoclient. One of the most popluar features when it comes to instant messaging is emo icons, the possibility to add icons in the end of a sentence to show that you are happy or sad. A smiley is a representation of a smiling face, most often coloured in yellow, so also in Zeta:
The are two ways to add emoicons to a sentence that you are about to send to the person you are chatting with. The first way is to choose the icon from a menu accessable from the im_client's toolbar. The second way is to use the signs for the emoicons in the tying area in the im_client:
| :) | ||
| ;) | ||
| :D | ||
| :p | ||
| :( | ||
| :| | ||
| :`( | ||
| (l) |
With the IM kit you can also choose them from the menu bar and in the default emoicon theme, the following icons are available:
The IM kit comes with the default emoicon size set to 16, so that they shouldn't be to big compared to the text in the chat window. Never the less many users would like to have them bigger. The icons and their size has been set in /boot/home/config/settings/im_kit ... . As you open the settings file in your default text editor, search for <size>. As mentioned before, change the size 16 to your preferred size. In this example set to size 40.


Even if it were not a great film, "Peppermint Candy" would be worth seeing just as a guide to the dramatic changes in post-dictatorship South Korea. While ostensibly a Citizen Kane type morality tale about an evil man, it is really a mirror held up to a country whose two main pillars were military/police brutality and worship of mammon.
A group of people in their forties are at a reunion picnic ot the bank of a river beneath a railway bridge. Into their midst wanders a man in a business suit who is either drunk or demented, or both. Soon they remember that he is Yongho, a fellow worker from 20 years ago. After encouraging him to take part in their gaiety, he begins to shriek and howl during a Karaoke performance. He climaxes this act by jumping into the river with his business suit on, slapping at the water like a madman. Then he mounts the railroad bridge, where he stands in the middle of the tracks awaiting a train that might come barreling out of a tunnel at any moment.
In a series of flashbacks, we do go back with Yongho and discover what has driven him to suicide. His "Rosebud" is nothing less than the social role imposed by South Korean society in its rise to "success" in the post 1980s. "Peppermint Candy" is mainly an attempt to rip the pleasant facade off this image.
Yongho has decided to kill himself for two reasons. As the president of a small company wrecked on the shoals of the recent economic crisis, he has no other options. We learn through the most immediate flashback that he is living in a shack and can not afford the price of a cup of coffee.  Before shooting himself, he ponders over who he will take with him. The list appears endless. In reality, it is the system that is at fault. He is also ready to kill himself for the pain he has inflicted on others, both those close to him and those who have wandered into his murderous path as soldier and cop.
Each flashback is preceded by camera shots of a train speeding along the South Korean countryside played in reverse. As people and animals walk backward along the track, we travel back in time to find out how Yongho went wrong.
Before becoming a businessman, he learn that he was a cop. In 1987 the cops have apprehended a student leader who is taken back to the station-house to be tortured. They want him to divulge the name of a leading pro-democracy activist. Yongho, the most sadistic and experienced cop, holds the student's head under water while wearing an impassive, almost bored, expression on his face.
It wasn't always this easy. In 1984 when he was a rookie cop, he was initiated into the art of torture. After a trade unionist prisoner shits on him during a session, he rushes into the bathroom to wash himself off. While peeing, another more seasoned cop casually mentions to him that he will not be able to forget the smell. That is what "Peppermint Candy" is about mostly, a man learning how, but never successfully so, to get over the smell.
Peppermint candy is something that Yongho is especially fond of. His first love is Sunim, who works in a candy factory. When he is in the army in 1980, she sends him candy to remind him of home and her love. One night his company is rousted from bed in the middle of the night for some sort of mysterious engagement. The sergeant abuses the men, calling them "bitches," as they struggle to get their gear together. When Yongho's peppermints pour out of his knapsack, the sergeant punches and kicks him because candy is not allowed.
The soldiers are dispatched to Kwangju, where students and workers have been protesting for democracy. Yongho, a raw recruit, kills a young student who is not part of the protests. She has wandered into the confrontation, just trying to make her way home.
When we finally arrive at 1979, we discover an entirely different Yongho at the banks of the river, where the original picnic took place. He is a shy young man in love with nature who presents Sunim with a flower that he has picked from the banks. When he sits beneath the railroad bridge, tears come to his eyes perhaps because he is overwhelmed by the beauty that surrounds him. Like Citizen Kane, this kind of innocence will be stolen from him as he becomes part of the dominant culture in Korean society.
NY critics have had some trouble connecting South Korea with the individual Yongho. The program notes at the New Directors/New Film series state: "In epic style, it covers the dissolution of a man and the development of a nation." It would be more accurately worded: "the simultaneous dissolution of a man and a nation." The NY Times warns that "a political dimension to Yongho's malaise is evident, but also, for one not intimately familiar with recent South Korean history, hard to grasp." Perhaps the critic suffers from relying on the NY Times coverage on South Korea, which goes a long way to explaining why things are hard to grasp. The systematic brutality depicted in the film never made its way to the front pages of the newspaper, which was much more interested in "economic miracle" and the dictatorship's support for anti-Communist initiatives in the region.
"Peppermint Candy" was directed and written by Lee Chang Dong and stars Sol Kyung Gu as Yongho in the most impressive acting performance that I have witnessed this year. In the unlikely event that "Peppermint Candy" is released for general distribution, it is not to be missed.
Louis Proyect Marxism mailing list: http://www.marxmail.org
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


"""Define Gaussian function objects.
This module defines the Gaussian class and the GaussianRange class.
"""
from __future__ import absolute_import
from __future__ import division
from __future__ import print_function
from builtins import object
import numpy as np
from six.moves import range
[docs]class Gaussian(object):
"""A Gaussian function object.
Attributes:
mean (float): The mean of the Gaussian.
std (float): The standard deviation of the Gaussian.
"""
def __init__(self, mean,std):
"""Initialize a Gaussian function object.
Args:
mean (float): Set the mean of the Gaussian.
std (float): Set the standard deviation of the Gaussian.
"""
stdinv = 1.0/std
normalc = stdinv*(1.0/np.sqrt(np.pi))
self.sigma = std
self.mean = mean
self._normconst = normalc
return
[docs] def eval(self,x_in):
"""Return the Gaussian function evaluated at the input x value.
Args:
x_in (float): The x value to evaluate the function at.
Returns:
float: The function evaluation for the Gaussian.
"""
stdinv = 1.0/self.sigma
stdinvsq = stdinv**2
normalc = self._normconst
expon = -(x_in - self.mean)**2 * (0.5*stdinvsq)
y = normalc * np.exp(expon)
return y
[docs] def reset_mean(self,new_mean):
"""Change the mean of the Gaussian function.
Args:
new_mean (float): The new mean of the Gaussian function.
"""
self.mean = new_mean
return
[docs]class GaussianRange(object):
"""Define a Gaussian function over a range.
This object is used to define a Gaussian function over a defined
finite range and store its values as evaluated at points evenly spaced
over the range. The points can then for example be used for integrating
the Gaussian function over the range using numerical quadrature.
Attributes:
mean (float): The mean of the Gaussian.
std (float): The standard deviation of the Gaussian.
upper (float): The upper boundary of the range.
lower (float): The lower boundary of the range.
npoints (int): The number of points to evaluate in the range.
"""
def __init__(self,in_range,mean,std,npoints=200):
"""Initialize the GaussianRange object.
The GaussianRange stores the values of Gaussian function with the
input mean and standard deviation evaluated at evenly spaced points
in the specified x-value range.
Args:
in_range (tuple, list): Specify the endpoints for range, e.g.
(x_start, x_end).
mean (float): The mean of the Gaussian function.
std (float): The standard deviation of the Gaussian function.
npoints (Optional[int]): The number of x-value points to
evaluate the Gaussian function for in the specified range (i.e.
in_range).
"""
x_p = np.linspace(in_range[0],in_range[1],npoints,endpoint=True)
y_p = np.zeros(npoints)
yc = 0
stdinv = 1.0/std
stdinvsq = stdinv**2
normalc = stdinv*(1.0/np.sqrt(np.pi))
for x in x_p:
expon = -(x - mean)**2 * (0.5*stdinvsq)
y = normalc * np.exp(expon)
y_p[yc]=y
yc+=1
self.x = x_p
self.y = y_p
self.sigma = std
self.mean = mean
self._normconst = normalc
self.upper = in_range[1]
self.lower = in_range[0]
self._dx = x_p[1]-x_p[0]
self.npoints = npoints
return
[docs] def get_values(self):
"""Return the x and y values for the Gaussian range function.
Returns:
tuple: The x and y values for the function, returned as (
x_values, y_values).
"""
return (self.x,self.y)
[docs] def eval(self,x_in):
"""Return the Gaussian function evaluated at the input x value.
Args:
x_in (float): The x value to evaluate the function at.
Returns:
float: The function evaluation for the Gaussian.
"""
stdinv = 1.0/self.sigma
stdinvsq = stdinv**2
normalc = self._normconst
expon = -(x_in - self.mean)**2 * (0.5*stdinvsq)
y = normalc * np.exp(expon)
return y
[docs] def integrate_range(self, lower, upper):
"""Returns the numerical integration of the Gaussian range.
This function does a simple quadrature for the Gaussian function as
evaluated on the range (or subset of the range) specified at
initialization.
Args:
lower (float): The lower boundary for the integration.
upper (float): The upper boundary for the integration.
Returns:
float: The numerical value of the Gaussian range integrated from
lower to upper.
Notes:
This function does not thoroughly check the bounds, so if upper
is less than lower the function will break.
"""
if upper>self.upper:
upper=self.upper
if lower<self.lower:
lower = self.lower
i_l = int(np.floor((lower-self.lower)/self._dx))
i_u = int(np.floor((upper-self.lower)/self._dx))
#print "i_l ",i_l," i_u ",i_u
total = 0.0
for i in range(i_l,i_u):
total+= self.y[i]*self._dx
return total
[docs] def sum_range(self, lower, upper):
"""Returns the over the Gaussian range.
This function sums the Gaussian function at the points that were
evaluated on the range (or subset of the range) specified at
initialization.
Args:
lower (float): The lower boundary for the sum.
upper (float): The upper boundary for the sum.
Returns:
float: The numerical value of the Gaussian range as summed from
lower to upper.
Notes:
This function does not thoroughly check the bounds, so if upper
is less than lower the function will break.
"""
if upper>self.upper:
upper=self.upper
if lower<self.lower:
lower = self.lower
i_l = int(np.floor((lower-self.lower)/self._dx))
i_u = int(np.floor((upper-self.lower)/self._dx))
total = 0.0
for i in range(i_l,i_u):
total+= self.y[i]
return total
[docs] def normalize(self):
"""Normalizes (by area) the Gaussian function values over the range."""
total = 0.0
for i in range(0,self.npoints):
total+=self.y[i]*self._dx
for i in range(0,self.npoints):
self.y[i]/=total
return
[docs] def reset_mean(self,new_mean):
"""Change the mean of the Gaussian function.
Args:
new_mean (float): The new mean of the Gaussian function.
Notes:
This function does not re-evaluate the Gaussian range and
therefore only affects the output of the eval function.
"""
self.mean = new_mean
return


Chapter 5 Vector Geometry: Angles, Projection, and Decomposition
In this chapter you will learn some about some additional ideas in the geometry of vectors. Again, while the illustration of these concepts is restricted to 2-dimensional space, all of these ideas can be extended to n-dimensions.
5.1 Angle Between Vectors
It can be quite useful to determine the angle between two vectors. For example, what is the angle between vector a and b where,
\[ \mathbf{a} = \begin{bmatrix} 2 \\ 3 \end{bmatrix} \quad \mathrm{and} \quad \mathbf{b}= \begin{bmatrix} -4 \\ 1 \end{bmatrix} \]
Figure 5.1 shows both vectors displayed in the same two-dimensional reference coordinate system.
The angle between these vectors is denoted as \(\theta\), and can be found using the following:
\[ \cos (\theta) = \frac{\mathbf{a}\bullet\mathbf{b}}{\lvert\lvert\mathbf{a}\rvert\rvert\times\lvert\lvert\mathbf{b}\rvert\rvert} \]
That is, the cosine of the angle between the two vectors is equal to the dot product of the vectors divided by the product of their lengths. To find the angle (\(\theta\)), we can compute the arc-cosine of this ratio. In our example,
\[ \begin{split} \cos (\theta) &= \frac{-5}{\sqrt{13}\times\sqrt{17}} \\[2ex] &= -0.336 \\[4ex] \arccos(1.914) &= 1.914 \end{split} \]
and \(\theta=109.65^{\circ}\). Below is the R syntax to compute this angle.
# Create vectors
= matrix(data = c(2, 3), ncol = 1)
a = matrix(data = c(-4, 1), ncol = 1)
b
# Compute dot product between a and b
= sum(a * b)
a_dot_b
# Compute vector lengths
= sqrt(sum(a * a))
l_a = sqrt(sum(b * b))
l_b
# Compute theta (in radians)
acos(a_dot_b / (l_a * l_b))
[1] 1.91382
# Compute theta (in degrees)
acos(a_dot_b / (l_a * l_b)) * 180 / pi
[1] 109.6538
Manipulating the formula to compute the angle between two vectors provides a common formula to determine the dot product between two vectors.
\[ \begin{split} \cos (\theta) &= \frac{\mathbf{a}\bullet\mathbf{b}}{\lvert\lvert\mathbf{a}\rvert\rvert\times\lvert\lvert\mathbf{b}\rvert\rvert} \\[2ex] \mathbf{a}\bullet\mathbf{b} &= \lvert\lvert\mathbf{a}\rvert\rvert\times\lvert\lvert\mathbf{b}\rvert\rvert \cos(\theta) \end{split} \] That is the dot product between vectors a and b is equal to the product of their magnitudes and the cosine of the angle between them.
5.1.1 Orthogonal Vectors
Two vectors a and b are orthogonal when the angle between them is \(90^\circ\). Since the cosine of a \(90^\circ\) angle is 0, if a and b are orthogonal, then
\[ 0 = \frac{\mathbf{a}\bullet\mathbf{b}}{\lvert\lvert\mathbf{a}\rvert\rvert\times\lvert\lvert\mathbf{b}\rvert\rvert} \]
For example, consider the following two elementary vectors
\[ \mathbf{e}_1 = \begin{bmatrix} 1 \\ 0 \end{bmatrix} \qquad \mathbf{e}_2 = \begin{bmatrix} 0 \\ 1 \end{bmatrix} \]
The dot product between these two vectors is 0, which implies that the cosine of the angle between them must also be 0, indicating that \(\mathbf{e}_1\) and \(\mathbf{e}_2\) are orthogonal.
5.1.2 Collinear Vectors
Two vectors a and b are collinear when the angle between them is \(0^\circ\). Since the cosine of a \(0^\circ\) angle is 1, if a and b are collinear, then
\[ 1 = \frac{\mathbf{a}\bullet\mathbf{b}}{\lvert\lvert\mathbf{a}\rvert\rvert\times\lvert\lvert\mathbf{b}\rvert\rvert} \]
For example, consider the following two vectors
\[ \mathbf{a} = \begin{bmatrix} 2 \\ 1 \end{bmatrix} \qquad \mathbf{b} = \begin{bmatrix} 6 \\ 3 \end{bmatrix} \]
\[ \begin{split} \frac{\mathbf{a}\bullet\mathbf{b}}{\lvert\lvert\mathbf{a}\rvert\rvert\times\lvert\lvert\mathbf{b}\rvert\rvert} &= \frac{14}{\sqrt{5}\times\sqrt{45}} \\[2ex] &= \frac{14}{\sqrt{225}} \\[2ex] &= \frac{14}{14} \\[2ex] &= 1 \end{split} \]
This implies that a and b are collinear. Two vectors are collinear when one can be written as a linear combination of the other. In our example,
\[ \mathbf{b} = 3\mathbf{a} \] Geometrically, collinear vectors are parallel to one another (remember location in the reference space is a convenience).
5.2 Orthogonal Projection
Orthogonal projection of vector a on vector b occurs by dropping a perpendicular line from the terminus of a to intersect with x2.
The result is a vector p which is collinear with b but has a different length. To compute the length of p, we make use of the fact that the projection creates a right triangle having a hypotenuse of a and an adjacent leg of p to the angle \(\theta\). Then,
\[ \begin{split} \cos(\theta) &= \frac{\lvert\lvert\mathbf{p}\rvert\rvert}{\lvert\lvert\mathbf{a}\rvert\rvert} \\[2em] \lvert\lvert\mathbf{p}\rvert\rvert &= \lvert\lvert\mathbf{a}\rvert\rvert \times \cos(\theta) \end{split} \]
Since \(\theta\) is the angle between a and b,
\[ \begin{split} \lvert\lvert\mathbf{p}\rvert\rvert &= \lvert\lvert\mathbf{a}\rvert\rvert \times \cos(\theta) \\[2em] &= \lvert\lvert\mathbf{a}\rvert\rvert \times \frac{\mathbf{a}\bullet\mathbf{b}}{\lvert\lvert\mathbf{a}\rvert\rvert\times\lvert\lvert\mathbf{b}\rvert\rvert}\\[2em] &= \frac{\mathbf{a}\bullet\mathbf{b}}{\lvert\lvert\mathbf{b}\rvert\rvert} \end{split} \]
That is, the magnitude of the projection p, is the ratio of the dot product between vectors a and b to the magnitude of b. Consider the following two vectors:
\[ \mathbf{a} = \begin{bmatrix} 2 \\ 3 \end{bmatrix} \qquad \mathbf{b} = \begin{bmatrix} 2 \\ -1 \end{bmatrix} \]
Projecting a onto b, geometrically,
We can find the magnitude of p using our formula:
\[ \begin{split} \lvert\lvert\mathbf{p}\rvert\rvert &= \frac{\mathbf{a}\bullet\mathbf{b}}{\lvert\lvert\mathbf{b}\rvert\rvert} \\[2ex] &= \frac{1}{\sqrt{5}} \\[2ex] &= 0.447 \end{split} \]
# Create vectors
= c(2, 3)
a = c(2, -1)
b
# Compute dot product of a and b
= sum(a * b)
a_dot_b
# Compute length of b
= sqrt(sum(b * b))
l_b
# Compute length of p
= a_dot_b / l_b
l_p l_p
[1] 0.4472136
Henceforth, we will denote the projection of vector a onto vector b as:
\[ \mathbf{p}_{\mathbf{a}\perp\mathbf{b}} \]
5.3 Orthogonal Decomposition
Orthogonal projection of a vector results in a geometric decomposition of the vector into two additive components. Figure 5.4 illustrates the decomposition of vector a into two additive components, \(\mathbf{p}_1\) and \(\mathbf{p}_2\). That is,
\[ \mathbf{a} = \mathbf{p}_1 + \mathbf{p}_2 \]
The vector \(\mathbf{p}_1\) is the same orthogonal projection from the earlier example, namely \(\mathbf{p}_{\mathbf{a}\perp\mathbf{b}}\). The vector \(\mathbf{p}_1\) is a second projection, of a onto a vector o (\(\mathbf{p}_{\mathbf{a}\perp\mathbf{o}}\)). The vector o is, by definition, orthogonal to b.
The lengths of the two projections correspond to the lengths of the sides of the right triangle where the hypotenuse is a. Namely4,
\[ \begin{split} \lvert\lvert\mathbf{p}_{\mathbf{a}\perp\mathbf{b}}\rvert\rvert &= \lvert\lvert\mathbf{a}\rvert\rvert \times \cos(\theta) \\[2em] \lvert\lvert\mathbf{p}_{\mathbf{a}\perp\mathbf{o}}\rvert\rvert &= \lvert\lvert\mathbf{a}\rvert\rvert \times \sin(\theta) \end{split} \]
As an example, we can decompose a Using our two previous example vectors:
\[ \mathbf{a} = \begin{bmatrix} 2 \\ 3 \end{bmatrix} \qquad \mathbf{b} = \begin{bmatrix} 2 \\ -1 \end{bmatrix} \]
We previously determined that \(\lvert\lvert\mathbf{a}\rvert\rvert=\sqrt{13}\), \(\lvert\lvert\mathbf{b}\rvert\rvert=\sqrt{5}\), and \(\lvert\lvert\mathbf{p}_{\mathbf{a}\perp\mathbf{b}}\rvert\rvert = 0.447\). Recall,
\[ \cos(\theta) = \frac{\mathbf{a}\bullet\mathbf{b}}{\lvert\lvert\mathbf{a}\rvert\rvert \times \lvert\lvert\mathbf{b}\rvert\rvert} \]
This implies that \(\cos(\theta)=\frac{1}{\sqrt{65}}\) and, taking the arc-cosine, that \(\theta = 82.87^\circ\) (or 1.45 radians). Using this value, we can compute the magnitude of the second projection as:
\[ \begin{split} \lvert\lvert\mathbf{p}_{\mathbf{a}\perp\mathbf{o}}\rvert\rvert &= \lvert\lvert\mathbf{a}\rvert\rvert \times \sin(\theta) \\[2em] &= \sqrt{13} \times \sin(82.87^\circ) \\[2em] &= 3.58 \end{split} \]
# Compute length of a
= sqrt(sum(a * a))
l_a
# Compute theta (in radians)
= acos(a_dot_b / (l_a * l_b))
theta theta
[1] 1.446441
# Compute length of projection of a onto o
= l_a * sin(theta)
l_p2 l_p2
[1] 3.577709
We can use the Pythagorean theorem to verify the computation of the two projections’ lengths. Since the square of the hypotenuse of a right triangle is the sum of the squares of the sides,
\[ \begin{split} \lvert\lvert\mathbf{p}_{\mathbf{a}\perp\mathbf{b}}\rvert\rvert^2 +\lvert\lvert\mathbf{p}_{\mathbf{a}\perp\mathbf{o}}\rvert\rvert^2 &= \lvert\lvert\mathbf{a}\rvert\rvert^2 \\[2em] 3.58^2 + 0.447^2 &= (\sqrt{13})^2 \\[2em] 13 &= 13 \end{split} \]
# Compute sum of the squared projection lengths
^2 + l_p2^2 l_p
[1] 13
# Compute length of a squared
^2 l_a
[1] 13
# Check values using Pythagorean Theorem
^2 == l_p^2 + l_p2^2 l_a
[1] TRUE
The final system is shown in Figure 5.5.
There are other ways to compute the length of \(\mathbf{p}_{\mathbf{a}\perp\mathbf{o}}\). For example, since o is orthogonal to b, the angle between o and a is \(\phi=90-\theta\). Then \(\lvert\lvert\mathbf{p}_{\mathbf{a}\perp\mathbf{o}}\rvert\rvert=\lvert\lvert\mathbf{a}\rvert\rvert \times \cos(\phi)\).↩


Custom software solutions, Web Site development, Business intelligence
We have years of experience designing and developing bespoke applications for the Enterprise. This experience is optimized for the small and medium scale organizations to deliver custom solutions that deliver the end results in quick and cost effective manner. We specialize in designing solutions by integrating existing online services to match your specific business needs.
Gone are the days it takes months to build an onilne presence for your organization or cause. We can design develop and deploy customized web sites in few days with minimal upfront and ongoing costs. We use modern responsive web site design meaning your web site is equally well received in any of the mobile devices including tablets and mobile phones. We use world leading domain services and hosting services to gurantee as much uptime as possible.
Every organization is creating data on enormous amounts every single day. How do you make sense of all these data to make the best possible business decisions? Business Intelligence is not just fancy graphs and charts. It is the collective set of activities and processes that provides your business stake holders with timely available critical information assisting the best possible business decisions. We posses years of collective experiencec in various business domains delivering solutions that does just that.


Assists in statistical model building to find optimal and semi-optimal higher order interactions and best subsets. Uses the lm(), glm(), and other R functions to fit models generated from a feasible solution algorithm. Discussed in Subset Selection in Regression, A Miller (2002). Applied and explained for least median of squares in Hawkins (1993) <doi:10.1016/0167-9473(93)90246-P>. The feasible solution algorithm comes up with model forms of a specific type that can have fixed variables, higher order interactions and their lower order terms.
| Version: | 0.9.1 |
| Imports: | parallel, hashmap, methods, tibble |
| Suggests: | testthat |
| Published: | 2018-01-10 |
| Author: | Joshua Lambert [aut, cre], Liyu Gong [aut], Corrine Elliott [aut], Sarah Janse [ctb] |
| Maintainer: | Joshua Lambert <joshua.lambert at uky.edu> |
| License: | GPL-2 |
| NeedsCompilation: | no |
| Materials: | README |
| CRAN checks: | rFSA results |
| Reference manual: | rFSA.pdf |
| Package source: | rFSA_0.9.1.tar.gz |
| Windows binaries: | r-devel: rFSA_0.9.1.zip, r-release: rFSA_0.9.1.zip, r-oldrel: rFSA_0.9.1.zip |
| OS X binaries: | r-release: rFSA_0.9.1.tgz, r-oldrel: rFSA_0.9.1.tgz |
| Old sources: | rFSA archive |
Please use the canonical form https://CRAN.R-project.org/package=rFSA to link to this page.


INSTRUMENTS LOOKUP
This is a Guitar
It is played by pulling up it's strings
DETAILS
VIEW
This is a Piano
It is played by pressing it's buttons
DETAILS
VIEW
This is a Flute
It is played by blowing into it and controlling the pitch
DETAILS
VIEW