For feedback email<EMAIL_ADDRESS>Last Update: . These figures include confirmed and suspected cases.


Current Reservations
It uses utility classes for typography and spacing to space content out within the larger container.


/************************************************************ Shows the effects of cache blocking on a matrix multiply like operation. Ref: http://cseweb.ucsd.edu/classes/wi12/cse240A-a/cache2.pdf If this program seg faults on startup you need to increase your stack size. On some machines (OSX) the compile line shown below will fix the issue. On others you may need to run ulimit. cc -Wl,-stack_size,0x10000000,-stack_addr,0xc0000000 -O3 block.c Timothy H. Kaiser, Ph.D. Director of Research and High Performance Computing Director Golden Energy Computing Organization<EMAIL_ADDRESS>************************************************************/ /**** [tkaiser@mio cache]$ date Fri Jan 11 09:50:43 MST 2013 [tkaiser@mio cache]$ icc -O3 block.c [tkaiser@mio cache]$ ./a.out Array size 1024 x 1024 Memory usage 24576 Kbytes did y and z Time Test Blocking Value Factor did normal 11.334 257.647 did blocking 2.173 257.647 B=32 did normal 11.736 257.647 did blocking 2.636 257.647 B=64 did normal 11.466 257.647 did blocking 2.880 257.647 B=128 did normal 11.689 257.647 did blocking 2.919 257.647 B=256 [tkaiser@mio cache]$ ****/


Biography
-
i am ahmad alrasheed,i live in jordan, i graduated from yarmouk university, i am biomedical engineer
-
i have certificate in deep learning fundamentals and python from nvidia company
-
before 1 year i was working in customer service company,and now i am learning to be a professional
full-stack developer!


--- layout: post title: '\"Honest and blunt\" now means \"would report Jews to the Nazis\" - Valleywag' date: 2006-06-05 00:00:00 categories: amusing digital-media ---
"Honest and blunt" now means "would report Jews to the Nazis" - Valleywag: "One attendee asked Mr. Semel if Yahoo would have cooperated with Nazi Germany the same way it has with China. His response: "Yahoo has a basic obligation not to have a point of view on basic content, and to present content ... and aggregate things and to allow people to make their own choices. I don't know how I would have felt then.""


Gateway
BOT
17-Jul-18 10:32 AM
[dscrdeql] <SwimedDragon> There's pretty much higher shaped buildings around here
[dscrdeql] <AndronicusBass-Founder> Of course, homes aren't naturally as large as the ex-nuclear dome, It represents the structure shape you use to protect something that is highly likely to be exposed to high force winds regularly
[dscrdeql] <AndronicusBass-Founder>
[dscrdeql] <AndronicusBass-Founder> @Cryptoon are you thinking that the outside area may be inefficient or some interior space that may be un useable?
[dscrdeql] <edsky> These igloos are in Trinity Beach, Cairns, QLD right on the beach man!
[dscrdeql] <AndronicusBass-Founder> Thats a sweet looking place @edsky.
[dscrdeql] <edsky> They are pretty cool they have survived through cat 5 cyclones
[dscrdeql] <AndronicusBass-Founder> However, definitely not igloos.
[dscrdeql] <x2maano> beauifull
[dscrdeql] <MySoulisNotForSale> ma y the force
[dscrdeql] <MySoulisNotForSale> be with you
[dscrdeql] <MySoulisNotForSale> my friends
[dscrdeql] <edsky> Also with you
[dscrdeql] <AndronicusBass-Founder> CowboyCrypto will love these pics when he's awake. It's 5am his way at the moment
[dscrdeql] <jellysmash> whoa dome resort...awesome
[dscrdeql] <jellysmash> the force is with me....thank you
[dscrdeql] <jellysmash> I can feel it coarsing through my veins
[dscrdeql] <jellysmash> cracking open my consciousness
[dscrdeql] <jellysmash> I see my evolution ahead and behind me as time has dropped away to nothing
[dscrdeql] <edsky> It’s actually listed on airbnb so you can see the pics of the inside as well
[dscrdeql] <KQweci> They are beautiful
[dscrdeql] <edsky> The makaba
[dscrdeql] <jellysmash> didn't realise that those domes in resort where from Trinitiy beach cairns
[dscrdeql] <edsky> Yeah been there since i was a kid
[dscrdeql] <jellysmash> if there was a cyclone...they'd be the only dwellings left standing...or doming
[dscrdeql] <x2maano> hmmm
[dscrdeql] <edsky> Survived plenty of cyclones
[dscrdeql] <jellysmash> if there was a nuclear war, the only things that would be left would be cockroaches....and the dome structures
[dscrdeql] <edsky> Bloody roaches
[dscrdeql] <KQweci> That's funny @jellysmash
[dscrdeql] <edsky> At least they a solid place to live!
[dscrdeql] <linkara6669> good morning everyone!
[dscrdeql] <edsky> Morning
[dscrdeql] <jellysmash> morning @linkara6669
[dscrdeql] <KQweci> Morning @linkara6669
[dscrdeql] <jellysmash> so is the 666 devil inspired....or just a prefix to the good stuff.....the 69
[dscrdeql] <jellysmash> as in @linkara6669
[dscrdeql] <jellysmash> lmao...i crack myself up
[dscrdeql] <linkara6669> lol
[dscrdeql] <KQweci> Funny @jellysmash
[dscrdeql] <linkara6669> just been using it so long never bothered to change it
[dscrdeql] <jellysmash> like from when you were a kid? or an adult that knew what 69 meant?
[dscrdeql] <jellysmash> just curious
[dscrdeql] <jellysmash> I might try something similar next time I need to come up with a userid....i like it
[dscrdeql] <linkara6669> it used to be a combination of 666 and 69, were just 2 numbers i really liked. i am 31 now, been using it since i was like 18/19
(edited)
[dscrdeql] <jellysmash> cool
[dscrdeql] <jellysmash> at least it has meaning for you
[dscrdeql] <jellysmash> jellysmash has no meaning..
[dscrdeql] <linkara6669> lol
[dscrdeql] <linkara6669> jellllllllySMASH
[dscrdeql] <AndronicusBass-Founder> Jelly smash seems like a plate of jelly you always want to smash. thats why i thought you made it up
[dscrdeql] <jellysmash> I've had a number of people try to think of what it means...funnily enough a lot of dudes think it's about 'smashing' as in thrusting a 'jelly'...ie adult kitten...you know
[dscrdeql] <jellysmash> my favourite marvel character is hulk...HULK SMASH....
[dscrdeql] <linkara6669> haha yeah something like that @AndronicusBass
[dscrdeql] <jellysmash> and I like jelly
[dscrdeql] <jellysmash> Andronicus is a brand of coffee.
[dscrdeql] <jellysmash> everytime I see that userid I think of Coffee
[dscrdeql] <AndronicusBass-Founder> flat palm a plate of jelly, as a kid lol
[dscrdeql] <KQweci> Lol @jellysmash
[dscrdeql] <jellysmash> It's such a cool userid....albeit a bit long
[dscrdeql] <jellysmash> probably wouldn't seem as long if the -founder wasn't on the end...maybe
[dscrdeql] <AndronicusBass-Founder> Coffee is gold. What if we could save water and vape caffeine like nicotine can be vaped?
[dscrdeql] <jellysmash> haha...hey that's a good idea...vape coffee fumes
[dscrdeql] <jellysmash> smell of coffee is awesome
[dscrdeql] <edsky> Mind blown
[dscrdeql] <jellysmash> i remember looking at houses to buy and some of them put a coffee pot on the heat to get the coffee smell in the house
[dscrdeql] <jellysmash> to try to make it smell 'natural' family kitcheny
[dscrdeql] <edsky> I think you guys are on to something here
[dscrdeql] <linkara6669> @AndronicusBass sounds interesting haha. i would be willing to trythat lol
[dscrdeql] <jellysmash> I saw through their cheap intent and .....didn't buy
[dscrdeql] <edsky> Mixed coffee and nicotine
[dscrdeql] <edsky> The most addictive drugs
[dscrdeql] <AndronicusBass-Founder> LOL Went into a place with an old mate to look and you could smell baked food, turns out people bake dough. that's dough-gy
[dscrdeql] <AndronicusBass-Founder> lol
[dscrdeql] <linkara6669> lol
[dscrdeql] <shah1305> Hi everyone
[dscrdeql] <shah1305> How is everyone today?
[dscrdeql] <edsky> Good yourself?
[dscrdeql] <shah1305> Great thanks
[dscrdeql] <AndronicusBass-Founder> Howdy @shah1305 keeping well. Good to have you back
[dscrdeql] <shah1305> @AndronicusBass-Founder Thanks its good to be back, my studies keeps me busy but i am always online maybe not here. How is the marketing coming along?
[dscrdeql] <AndronicusBass-Founder> Excellent, yeah, I'm getting used to facebook platform after half a decade off personally, however I'm sure y'all know about facebook lifting ad bans they had in place


---
layout: academic
title: "publications"
permalink: /publications/
float: right
---
{{ site.data.publications.title }}
{% include publications/papers.html publication=site.data.publications.journal %}
{% include publications/papers.html publication=site.data.publications.conference %}
{% include publications/papers.html publication=site.data.publications.abstracts %}
{% include publications/papers.html publication=site.data.publications.thesis %}
{% include publications/papers.html publication=site.data.publications.posters %}
{% include publications/papers.html publication=site.data.publications.book-chapters %}
{% include publications/papers.html publication=site.data.publications.other-publications %}
{% include publications/papers.html publication=site.data.publications.students %}
{% include publications/papers.html publication=site.data.publications.papers-in-preparation %}
{% include publications/papers.html publication=site.data.publications.talks %}
{% include publications/media.html %}


Home
Menu
About
Un-Subscribe
Chuck Norris Random Daily Jokes
You Have Successfully Subscribed. You Will receive Email Confirmation Shortly.
Subscribe
A Fun, Silly server-less App Hosted on AWS.
You Will Receive a Random Daily Joke & Image of Chuck Norris at 12PM AEST Every Day
Scheduleing of When You Want to Receive Your Daily Email Will be Added to the Site in the Future (when I have time)
Un-Subscribe Here
Un-Subscribe


[OK]
This is the default virtual host.
curl -k https://localhost -H 'Host: node.loc'
curl -k https://localhost -H 'Host: php.loc'


APP stores its data in a relational database. The following database management system (DBMS) is supported:
PostgreSQL, version 9.1.12.
Install the DBMS as described in its documentation.
If required, you can use a separate machine for the APP database.
Setup and Configuration
Edit the file
<postgres_dir>/data/postgresql.conf
as follows (<postgres_dir> is the PostgreSQL installation directory):
- Set the max_prepared_transactions property value to 50.
- Set the max_connections property value to 210.
This property determines the maximum number of concurrent connections to the database server.
Note the following: This setting is used in combination with the JDBC pool size settings for the domains on your application server. If you change the JDBC pool size, you might need to adapt the max_connections setting. Refer to the OSCM
Operator's Guide, section Tuning Performance, for details.
- Set the listen_addresses property value:
Specify the IP addresses of all application servers on which the database server is to listen for connections from client applications. If you use the entry '*', which corresponds to all available IP addresses, you must be aware of possible security holes.
- Save the file.
If you use a server name in all configuration files instead of localhost during installation, edit the file
<postgres_dir>/data/pg_hba.conf
as follows (<postgres_dir> is the PostgreSQL installation directory):
- Add the IP address of the application server that is to host APP.
For example:
host all all <IP_ADDRESS>/32 md5
Also add the application server's IPv6 address.
For example:
host all all fe80::cdfb:b6ed:9b38:cf17/128 md5
There are authentication methods other than md5. For details, refer to the PostgreSQL documentation.
- Save the file.
Restart your PostgreSQL server for the changes to take effect.


According to a previous Post report, former Senate treasurer, Simar Kalkat, was removed from her position by a vote of no confidence on February 16. However, her removal was rescinded on Feb. 23.
Amid the drama of Kalkat’s removal, multiple other Senate members resigned including former Director of Public Relations Emily Ertle and former Chief Justice Hannah Fleming. Additionally, former Honors Tutorial College Senator Rhyan Goodman resigned from the Senate in March, according to a previous Post report.
Luvina Cooley, a junior studying anthropology, was elected as vice president this spring. She chose to run to help other students learn about Senate and what it can do for them, she said. Additionally, she wants to rebuild the connection between Senate and OU administration.
Looking to this fall, Cooley wants to focus on reforming the image of Senate, given the troubles it faced throughout the past year. It is not uncommon for students to be unaware of the Senate and what they do, Cooley said, but those who do know of it often mainly hear about the negative situations.
“I also want to really focus on uplifting others’ voices,” Cooley said. “It would be really easy for me to sit in the office and just do nothing, to sit in the background and let other people do everything. What I really want to do is utilize the position that I have in order to uplift others and bring them into conversations with those administrators.”
Moving forward, the focus of the Senate as a whole will be to “revamp” their image and ensure meetings and procedures are carried out according to the rules, Carson Sarver, a junior studying political science and psychology and serving as the Senate director of public relations, said.
Echoing Cooley’s concern over students viewing Senate in a negative light, Sarver emphasized the new executive board’s goal to increase openness and confidence in the Senate. There are no solid plans yet, as the executive board is still planning and discussing the upcoming year, she said.
Sarver joined Senate as the director of graphic design halfway through the Spring Semester, she said, right in the midst of the Senate’s struggles this past year.
Following the controversial events, Sarver chose to continue to work with Senate due to her faith in the new executive board, she said. She believes the new board will do well this fall and has faith in its ability to shine a new light on Senate.
Cooley also expressed great faith in the new board’s capabilities, as well as her excitement to work with the new president and treasurer, Dayna Shoulders and Trinity Robinson, respectively.
“We have not only folks returning to their roles, but we also have so many new folks coming on to Senate,” Cooley said. “I'm really excited to get the opportunity to work with them to help support them in any way that I can and also just see what they're able to accomplish.”
Addie Hedges contributed to this report.


Dangerous Drugs Board. (n.d.). Some questions and answers on DRUG ABUSE [Brochure]. Quezon City: Author.
Farrús, J. (n.d.). Documenting Drug Addiction in Kabul [Digital image]. Retrieved February 2, 2017, from https://www.flickr.com/photos/jordibernabeu/15925375836
File:Drug abuse [Digital image]. (n.d.). Retrieved February 2, 2017, from https://commons.wikimedia.org/wiki/File:Drug_abuse.png
Alcohol
Medical Definition of Alcohol. (n.d.). Retrieved from http://www.medicinenet.com/script/main/art.asp?articlekey=20078
Know... the effects of alcohol. (n.d). Retrieved from http://www.knowyourlimits.info/know%E2%80%A6-effects-alcohol
Understanding alcohol use disorders & their treatment. (n.d). Retrieved from http://www.apa.org/helpcenter/alcohol-disorders.aspx
Know... about mixing drugs and alcohol. (n.d). Retrieved from http://www.knowyourlimits.info/know%E2%80%A6-about-mixing-drugs-and-alcohol
Alcohol Facts and Statistics. (n.d). Retrieved from https://pubs.niaaa.nih.gov/publications/AlcoholFacts&Stats/AlcoholFacts&Stats.htm
Marijuana
NIDA. (2016). Marijuana. Retrieved from https://www.drugabuse.gov/publications/drugfacts/marijuana
NIDA. (2015). Is Marijuana Medicine?. Retrieved from https://www.drugabuse.gov/publications/drugfacts/marijuana-medicine
Lopez, G. (January 14, 2017). The Spread of Marijuana Legalization, Explained: Marijuana is Legal for Medical Purposes
in 28 States . Retrieved from http://www.vox.com/cards/marijuana-legalization/what-is-medical-marijuana
Chang, H. (May 2, 2016). Do You Know Where Pot is Legal, and Where It's Not?. Retrieved from http://www.thecannabist.co/2016/05/02/marijuana-laws-state-world/52508/
Tobacco
15 MOST COMMON REASONS PEOPLE SMOKE. (2015, May 20). Retrieved from http://www.evatese.com/2013/08/18/15-most-common-reasons-people-smoke/
Essays & Writing AssignmentsDone for You. (n.d.). Retrieved from https://apessay.com/order/?rid=d2b52ee1b75691e7
History of tobacco. (n.d.). Retrieved from https://en.wikipedia.org/wiki/History_of_tobacco
Free photo Unhealthy Smoke Smoking Addiction Cigarette Cigar - Max Pixel. (n.d.). Retrieved from http://maxpixel.freegreatpicture.com/Unhealthy-Smoke-Smoking-Addiction-Cigarette-Cigar-1418483
Methamphetamine
H. (n.d.). Methamphetamine. Retrieved February 02, 2017, from https://www.drugabuse.gov/publications/drugfacts/methamphetamine
H. (n.d.). What is methamphetamine? Retrieved February 02, 2017, from https://www.drugabuse.gov/publications/research-reports/methamphetamine/what-methamphetamine
Methamphetamine. (n.d.). Retrieved February 02, 2017, from https://en.wikipedia.org/wiki/Methamphetamine
Heroin
DFW. (n.d.). The truth about Heroin. Retrieved February 01, 2017, from http://www.drugfreeworld.org/drugfacts/heroin.html
NIDA. (2016). Heroin Retrieved February 01, 2017, from https://www.drugabuse.gov/publications/drugfacts/heroin
File: Heroin_asian.jpg . (2007, July 25). Retrieved February 01, 2017, from https://commons.wikimedia.org/wiki/File:Heroin_asian.jpg
File: Injecting_Heroin.jpg . (2011, April 3). Retrieved February 01, 2017, from https://commons.wikimedia.org/wiki/File:Injecting_Heroin.JPG
File: Heroin Bottles . (2013, November 26). Retrieved February 01, 2017, from https://www.flickr.com/photos/kneoh/11199562704
Remedies
Alcohol Abuse and Dependence-Treatment Overview. (n.d.). Retrieved February 03, 2017, from http://www.webmd.com/mental-health/addiction/alcohol-abuse-and-dependence-treatment-overview#2
Alcohol Abuse. (2016, November 03). Retrieved February 03, 2017, from http://drugabuse.com/library/alcohol-abuse/
Alcoholism Treatment - Find the Best Alcohol Rehab for You. (n.d.). Retrieved February 03, 2017, from https://www.alcoholrehabguide.org/treatment/
H. (n.d.). What is drug addiction treatment? Retrieved February 02, 2017, from https://www.drugabuse.gov/publications/principles-drug-addiction-treatment-research-based-guide-third-edition/frequently-asked-questions/what-drug-addiction-treatment
H. (n.d.). Treatment Approaches for Drug Addiction. Retrieved February 02, 2017, from https://www.drugabuse.gov/publications/drugfacts/treatment-approaches-drug-addiction


PROJECT: EYLAH
Overview
EYLAH is a desktop application programmed specifically for students staying in Temasek Hall at the National University
of Singapore. It aims to ease their lives in hall by providing them with an application that split bills easily and help
them keep track of their diet. The user interacts with the application using a CLI and it is programmed using Java 11
.
Summary of contributions
-
Major Enhancements
-
Added AddItemCommand and enhanced the DeleteItemCommand for the Expense Splitter portion of EYLAH (Pull request #134, #163)
-
What it does:
It simply adds a new Entry into the Receipt or deletes an existing Entry from the Receipt. -
Justification:
The AddItemCommand is required for users to input new Items and the Persons involved in splitting the cost of that Item. The DeleteItemCommand is for users to remove an Item in case he/she made a mistake or simply wants to remove the Item. -
Highlights:
These commands are only allowed to be used when the Receipt has not been marked as completed as this was accomplished using a boolean flag in the Receipt class. This is because of a bug that we discovered, which will be explained in the point below.
-
-
Added a boolean flag in Receipt (Pull request #201)
-
What it does
It checks if the Receipt is marked as complete (true) or incomplete (false). -
Justification
DeleteItemCommand actually removes the Amount owed by the person from the PersonAmountBook. So does the PaidCommand. As such, if a user uses the DeleteItemCommand after using the PaidCommand, and if the Amount owed goes to negative, an exception would be thrown due to the nature of BigDecimal (BigDecimal does not accept negative values). Hence, a flag was included to prevent this from happening.
-
-
Added DoneReceiptCommand and ClearReceiptCommand for the Expense Splitter portion of EYLAH (Pull request #201, #204)
-
What it does:
DoneReceiptCommand marks the Receipt as done and ClearReceiptCommand removes all existing Entries from the Receipt. -
Justification:
DoneReceiptCommand is required to toggle the boolean flag of Receipt to be done. ClearReceiptCommand does the opposite by toggling the Receipt back as undone. -
Highlights:
These commands are required to prevent an Exception being thrown with regards to negative BigDecimal values, as explained in the point above.
-
-
-
Minor Enhancements
-
Removed case sensitivity when adding a new Person
-
What it does:
All the names inputted by the user are now made into lowercase. -
Justification
This is to facilitate quicker use of the application as users would not be required to capitalize any names. Internally, this is also to prevent duplicate Person objects with the same name (but in different case sensitivity) from being created, i.e Bob vs bob or aLiCe vs alice.
-
-
Fixed the rounding issue with regards to using BigDecimal as currency in our application
-
What it does:
Decimals with regards to currency in EYLAH is made to be 2 decimal points (d.p). -
Justification
The Amount class only accepts decimals up till 2 d.p. Users are also made to only input decimals up till 2 d.p. However, the problem comes when dividing BigDecimals, e.g 10 / 3 = 3.333333… Since we create a new Amount object called amountPerPerson, i.e new Amount("3.33333"), this would throw an Exception. As such, I made it such that any all calculations with regards to BigDecimal and Amount would be kept at a maximum of 2 d.p to prevent this Exception from being thrown. In addition, I also did the formatting of the BigDecimal to be represented as a currency. -
Credits
-
Added test cases for Entry and Receipt classes
-
Added test cases for AddItemCommand, DeleteItemCommand, DoneReceiptCommand and ClearReceiptCommand
-
Assisted in downscaling of AddressBook3 by removing Phone class
-
-
-
Code contributed:
Functional and Test code -
Other contributions:
-
Project management:
-
Lead for ExpenseSplitter portion of EYLAH.
-
Participated in planning the project timeline for EYLAH.
-
-
Enhancements to existing features:
-
Enhanced ParserUtil to be able to handle more inputted texts and output the required Objects.
-
Adapted the given Address Book 3 code into EYLAH.
-
-
Documentation:
-
Updated the Developer Guide to include AddItemCommand and DeleteItemCommand (Pull request #164, #171, #353, #409)
-
Updated the Developer Guide to include ClearReceiptCommand (Pull request #359, #409)
-
Updated the User Guide to include DoneReceiptCommand and ClearReceipt Command (Pull request #241)
-
Updated the User Guide to include Appendix H: Effort (Pull request #384)
-
Updated the User Guide with minor changes with regards to the use of English and to maintain consistency throughout the document (Pull request #411)
-
-
Community:
-
Code contributed
Please click the following link to see my code contributions dashboard. Code Report
Contributions to the User Guide
Given below are sections I contributed to the User Guide. They showcase my ability to write documentation targeting end-users. |
Adding an item: additem
In this section, you will learn more about the additem
command, how to use it
and the expected outcome after using the additem
command.
Summary of Add Item Command:
additem
allows you to add an item, it’s price and the persons involved in sharing the cost of that item.
How to use the Add Item Command:
Format:
additem -i ITEMNAME -p PRICE -n NAME
additem -i ITEMNAME -p PRICE -n NAME [-n NAME]…
Valid Example:
additem -i pizza -p 30 -n bob
additem -i pasta -p 19.90 -n alice -n bob -n charlie
Expected outcome:
|
Note
|
|
Deleting an item: deleteitem
In this section, you will learn more about the deleteitem
command, how to use it
and the expected outcome after using the deleteitem
command.
Summary of Delete Item Command:
deleteitem
allows you to delete an item from the receipt.
How to use the Delete Item Command:
Format:
deleteitem INDEX
Valid Example:
deleteitem 3
Expected outcome:
|
Tip
|
Use listreceipt to view your item indices before deletion.
|
Clears the receipt clearreceipt
In this section, you will learn more about the clearreceipt
command, how to use it
and the expected outcome after using the clearreceipt
command.
Summary of Clear Receipt Command:
clearreceipt
allows you to remove all items from the receipt and start with a clean receipt.
How to use the Clear Receipt Command:
Format:
clearreceipt
Valid Example:
clearreceipt
Expected outcome:
|
Warning
|
|
|
Note
|
|
Contributions to the Developer Guide
Given below are sections I contributed to the Developer Guide. They showcase my ability to write technical documentation and the technical depth of my contributions to the project. |
Add Item Command
In this section, we will learn more about how the additem
command is implemented.
What is the Add Item Command
The additem
command allows the user to add an Item into the Receipt, along with the ItemPrice of the Item and the Persons
involved in splitting the cost of that Item.
The additem
command was implemented as AddItemCommand
in the expensesplitter/logic/commands
package.
The additem
command has the following input format:
additem
-i ITEMNAME
-p ITEMPRICE
-n NAME
[-n NAME]…
|
Note
|
|
The following activity diagram illustrates what happens when a user executes the additem
command:
Structure of Add Item Command
In this section, you will learn more about the relationships between objects related to the AddItemCommand
.
The above class diagram shows the structure of the AddItemCommand
and it’s associated classes and interfaces. Some
methods and fields have been left out because they are not of concern in the AddItemCommand
.
Implementation of Add Item Command
The following is a detailed explanation of the operations AddItemCommand
performs.
-
The
AddItemCommand#execute(SplitterModel splitterModel)
method is executed and it checks if the specified Item and list of Persons to be added are valid. If valid, a new Entry would be created with the specified Item and list of Persons. -
The
SplitterModel#addEntry(Entry entry)
method would then be called to add the Entry into the Receipt. -
For each Person in the list of Persons, the Person is first checked through the
PersonAmountBook#persons
using theSplitterModel#hasPerson(Person person)
method to check if the person already exists. -
If the person does not already exist, the method
SplitterModel#addPerson(Person person)
would be called to add the person, together with the amount, into thePersonAmountBook#persons
. -
If the Person exists, the Person would be retrieved from the
PersonAmountBook#persons
using theSplitterModel#getPerson(Person person)
method, and then the amount would be added to that person using theSplitterModel#addAmount(Person person, Amount amount)
method.
Sequence diagram for Add Item Command
The following sequence diagram summarizes what happens during the execution of additem
command.
Delete Item Command
In this section, we will learn more about how the deleteitem
command is implemented.
What is the Delete Item Command
The deleteitem
command allows users to remove the Item from the Receipt via the Index.
The deleteitem
command was implemented as DeleteItemCommand
in the expensesplitter/logic/commands
package.
The deleteitem
command has the following input format:
deleteitem
INDEX
|
Note
|
|
The following activity diagram illustrates what happens when a user executes the deleteitem
command:
Structure of Delete Item Command
In this section, you will learn more about the relationships between objects related to the DeleteItemCommand
.
The above class diagram shows the structure of the DeleteItemCommand
and it’s associated classes and interfaces. Some
methods and fields have been left out because they are not of concern in the DeleteItemCommand
.
Implementation
The following is a detailed explanation of the operations DeleteItemCommand
performs.
-
The
DeleteItemCommand#execute(SplitterModel splitterModel)
method is executed and it validates that the specified Index to delete is within range. If valid, the Entry to be deleted will be retrieved from Receipt using its Index. -
The method
SplitterModel#getEntry(Index index)
is called to retrieve the current Entry, which subsequently retrieves the current Item using theEntry#getItem()
method and the amountPerPerson associated with it via theItem#getAmountPerPerson()
method. The list of Persons are also retrieved via theEntry#getPersonsList()
method. -
For each Person in the list of Persons, the amount is subtracted from the current amount owed by the Person.
-
The method
SplitterModel#deleteEntry(int index)
will then be called to remove the Item from the Receipt.Receipt#deleteEntry(int index)
is invoked which makes a call to its internal list to remove the specified Item.
Sequence Diagram for Delete Item Command
The following sequence diagram summarizes what happens during the execution of deleteitem
command.
Clear Receipt Command
In this section, we will learn more about how the clearreceipt
command is implemented.
What is the Clear Receipt Command
The clearreceipt
command essentially deletes all the Entries in the Receipt and allows the user to input new Entries
into a clean receipt.
The clearreceipt
command was implemented as ClearReceiptCommand
in the expensesplitter/logic/commands
package.
The clearreceipt
command has the following input format:
clearreceipt
|
Note
|
|
The following activity diagram illustrates what happens when a user executes the clearreceipt
command:
Structure of Clear Receipt Command
In this section, you will learn more about the relationships between objects related to the ClearReceiptCommand
.
The above class diagram shows the structure of the ClearReceiptCommand
and it’s associated classes and interfaces. Some
methods and fields have been left out because they are not of concern in the ClearReceiptCommand
.
Implementation of Clear Receipt Command
The following is a detailed explanation of the operations ClearReceiptCommand
performs.
-
The
ClearReceiptCommand#execute(SplitterModel splitterModel)
method is executed. -
If the Receipt is marked as undone via the
SplitterModel#isReceiptDone()
method, theSplitterModel#deleteAllEntires()
method is called, which calls thePersonAmountBook#deleteAllEntries()
method. What does method does is that it first retrieves the ArrayList<Entry> from the Receipt via theReceipt#getReceipt()
method, then for each Entry, it gets the Item and the Amount owed my each person via theEntry#getItem()
andItem#getAmountPerPerson()
methods respectively. The Amount is then removed from each Person in the Entry via theEntry#getPersonsList()
method. After which, thesplitterModel#clearReceipt()
method will then be called. This will invoke theReceipt#clearReceipt()
method which creates a new ArrayList and assigns it to the Receipt. At the same time, the booleanReceipt#isDone
is assigned tofalse
. -
If the Receipt is marked as done, the
splitterModel#clearReceipt()
method will then be called. This will invoke theReceipt#clearReceipt()
method which creates a new ArrayList and assigns it to the Receipt. At the same time, the booleanReceipt#isDone
is assigned tofalse
.
Sequence Diagram for Clear Receipt Command
The following sequence diagram summarizes what happens during the execution of the clearreceipt
command.
Use case: UC08 - Adding an Item
Actor: User
Guarantees:
Item will be added into the Receipt.
MSS
-
User keys in the ItemName, it’s ItemPrice and Person(s) involved in the splitting of the Item.
-
EYLAH adds the Item and Persons into a Entry.
-
EYLAH adds the Entry into a Receipt.
-
EYLAH displays the Item and Person(s) involved in the splitting of the item, as well as the Amount owed per Person.
Use case ends.
Extensions
-
1a. EYLAH detects empty ItemName, ItemPrice or Person(s)
-
1a1. EYLAH displays an error message and displays an example of a correct
additem
function.Use case ends.
-
-
1b. Eylah detects invalid syntax.
-
1b1. EYLAH displays an error message and displays an example of a correct
additem
function.Use case ends.
-
Use case: UC09 - Deleting an Item
Actor: User
Preconditions: Item user wants to delete is present in the Receipt.
Guarantees:
Item will be deleted from Receipt.
MSS
-
User keys in request to delete an Item in the current Receipt via it’s Index.
-
EYLAH deletes that Item and deducts the appropriate amount associated with each Person(s) involved in splitting that Item.
-
EYLAH displays a MESSAGE_SUCCESS informing the user that Item has been successfully deleted.
Use case ends.
Extensions
-
1a. User did not input the Index of the Item. (Inserting
deleteitem
instead ofdeleteitem 1
)-
1a1. EYLAH displays an error message and displays an example of a correct
deleteitem
function.Use case ends.
-
Use case: UC13 - Clearing the Receipt when Receipt is done
Actor: User
Preconditions: Receipt is marked as done.
Guarantees:
Deletes all the Entries in the Receipt. It also marks the Receipt as undone.
MSS
-
User requests to clear the receipt after he/she decides to start a clean Receipt.
-
EYLAH removes all the Entries from the Receipt.
-
EYLAH marks the Receipt as undone.
-
EYLAH display a MESSAGE_SUCCESS informing the user that the Receipt has been successfully cleared.
Use case ends.
Use case: UC14 - Clearing the Receipt when Receipt is undone
Actor: User
Preconditions: Receipt is marked as undone.
Guarantees:
Deletes all the Entries in the Receipt. It also marks the Receipt as undone.
MSS
-
User requests to clear the receipt after he/she decides to start a clean Receipt.
-
EYLAH removes Amount owed per Person from the PersonAmountBook.
-
EYLAH removes all the Entries from the Receipt.
-
EYLAH display a MESSAGE_SUCCESS informing the user that the Receipt has been successfully cleared.
Use case ends.
Add Item In Expense Splitter
-
Adding an Item into the current Receipt.
-
Add Item Command format:
additem -i ITEMNAME -p ITEMPRICE -n PERSON [-n PERSON]…
-
Test case:
additem -i pasta -p 33.50 -n John -n Bob
Expected: Adds an item with the above details to current receipt and increase the person amount equal to dividing the price with the number of person splitting that item. -
Test case:
Invalid Syntax
Expected: No item is added to the current receipt and no change to person amount. An error message will be displayed.
-
Delete Item In Expense Splitter
-
Deleting an Item from the current Receipt.
-
Delete Item Command format:
deleteitem INDEX
-
Test case:
delete 1
Expected: Removes the item of the specified index from the receipt. -
Test case:
Invalid Syntax
Expected: No item will be deleted from the current receipt. An error message will be displayed.
-
Done Receipt In Expense Splitter
-
Marks the current receipt as done.
-
Done Receipt Command format:
donereceipt
-
Test case:
donereceipt
Expected: The receipt is marked as done. A success message will be displayed.
-
Clear Receipt In Expense Splitter
-
Clears the receipt and marks the receipt as undone.
-
Clear Receipt Command format:
clearreceipt
-
Test case:
clearreceipt
Expected: The receipt is cleared and is marked as undone. A success message will be displayed.
-


Akan names are derived from Ghanian culture. Frequently in Ghana, children are given their first name as a 'day name' which corresponds to the day in the week they were born. Input your date of birth to know your Akan name. These names vary depending on gender.
Your day of birth is:
Your Akan name is:


Use the arrow keys to play
To walk [left, down, up and right]
To fight [left and right]
Made by Felipe Oliveira Maia & Lucas Guerra Cavalcante for educational purposes


Share this:
We all know peanuts have a lot of health benefits. A 2 tablespoon serving of peanut butter contains 7 grams of clean protein. High in potassium, which lowers the risk of high blood pressure, stroke, heart disease. Peanut butter contains the same ratio of saturated to unsaturated fats as olive oil, says Harvard Medical School which mean peanut butter contains a lot of good fat to help you lose weight as well.
But sadly most peanut butter that we buy from supermarket is full of sugar and additives. Making your own peanut butter is very straight forward, extremely quick, easy and can be done in less than 20 minutes. You can double this peanut butter recipe and make a bigger batch to last you a couple weeks.
Please note that homemade peanut butter recipe won’t be incredibly smooth like some brands in the stores, but it tastes and smells soooo much better in my opinion. We’ll keep the ingredients very simple, clean and fresh.
You can incorporate this peanut butter recipe into both savory and sweet dishes, so for now I keep this peanut butter recipe very simple and pure. More recipes are coming your way! If you have a nut allergy, please stay with us, homemade Tahini, or sesame paste, is coming soon!
Easy Homemade Classic Peanut Butter Recipe
- Prep Time: 10 mins
- Cook Time: 10 mins
- Total Time: 20 mins
- Portions: 375 ml
You’ll need:
- 3 cups Raw, shelled peanut
- 1 tsp Sea salt
- 1 tbsp peanut oil or any light oil (I’m using rice bran oil)
- 2 tbsp honey or liquid sweetener (optional)
Let’s start!
- Add your raw peanuts to a tray and bake it for 10-15 minutes at 180C / 350F.
- Remove the peanuts from the oven and put them in a food processor when they are still warm (but not too hot. I found that they cool down pretty fast – around 5 minutes).
- Pulse the food processor for a couple minutes til the mixture becomes grainy like sand. - Then increase the speed to medium until the mixture starting to thicken up slightly – approx. another 1-2 minutes.
- Add the sea salt and oil to food processor(at this point you can also add your honey or any other ingredients to flavor).
- Now, switch around between high and low speed until the mixture turn silky and smooth. - You might need to stop to scrape the sides down or give your food processor a rest along the way – make sure it won’t get too hot! This process should take around 2-3 minutes.
- Store in airtight container and keep it in the fridge to prevent the oil from getting rancid.
Tips:
- This peanut butter will last around 2-3 weeks.
- If you prefer your peanut butter on the sweet side. You can add 2 tbsp of honey or any liquid sweetener or even melted chocolate at the same time you add salt to flavor things up!
- If you toast your peanut and leave it out for too long pop them in the oven for 2 minutes before you blend them. Blending the nuts while they are still warm can ease the processing.
- If you prefer raw nut butter, feel free to skip the oven process.
- In the blending process, it might seem like it’s not going to become smooth, just keep blending. After a couple minutes the mixture will get more and more runny and silky. It will them thicken up and get more solid after you put it in the fridge.
Extra Cheeky Tip:
- If you buy roasted peanuts from the store, you can just warm it for 2 minutes in oven and you can probably get this done in less than 5 minutes!
Share this:


| Statistics generated with VISITORS Web Log Analyzer version 0.7
|
| |
| General information |
| Information about analyzed log files |
| Generated: Sun Mar 27 15:08:48 2016
|
| Number of entries processed 2440 |
| Number of invalid entries 0 |
| Processing time in seconds 0 |
| |
| Generated reports |
| Click on the report name you want to see |
| Number of reports generated 9 |
| Unique visitors in each day |
| Unique visitors in each month |
| Unique visitors from Google in each day |
| Unique visitors from Google in each month |
| Requested pages |
| Requested images and CSS |
| Referers |
| Weekday distribution |
| Hours distribution |
| |
| Unique visitors in each day |
| Multiple hits with the same IP, user agent and access day, are considered a single visit |
| Number of unique visitors 404 |
| Different days in logfile 8 |
| 20/Mar/2016 | 46 (11.4%) |
|
| 21/Mar/2016 | 89 (22.0%) |
|
| 22/Mar/2016 | 62 (15.3%) |
|
| 23/Mar/2016 | 38 (9.4%) |
|
| 24/Mar/2016 | 50 (12.4%) |
|
| 25/Mar/2016 | 62 (15.3%) |
|
| 26/Mar/2016 | 39 (9.7%) |
|
| 27/Mar/2016 | 18 (4.5%) |
|
| |
| Unique visitors in each month |
| Multiple hits with the same IP, user agent and access day, are considered a single visit |
| Number of unique visitors 404 |
| Different months in logfile 1 |
| Mar/2016 | 404 (100.0%) |
|
| |
| Unique visitors from Google in each day |
| The red part of the bar expresses the percentage of visits originated from Google |
| Number of unique visitors 404 |
| Number of unique visitors from google 5 |
| Different days in logfile 8 |
| 20/Mar/2016 | 0 (0.0%) |
|
| 21/Mar/2016 | 1 (1.1%) |
|
| 22/Mar/2016 | 1 (1.6%) |
|
| 23/Mar/2016 | 1 (2.6%) |
|
| 24/Mar/2016 | 1 (2.0%) |
|
| 25/Mar/2016 | 0 (0.0%) |
|
| 26/Mar/2016 | 1 (2.6%) |
|
| 27/Mar/2016 | 0 (0.0%) |
|
| |
| Unique visitors from Google in each month |
| The red part of the bar expresses the percentage of visits originated from Google |
| Number of unique visitors 404 |
| Number of unique visitors from google 5 |
| Different months in logfile 1 |
| Mar/2016 | 5 (1.2%) |
|
| |
| Requested pages |
| Page requests ordered by hits |
| Different pages requested 338 |
| 1) | 262 | / |
| 2) | 80 | /1.svg |
| 3) | 43 | /2.svg |
| 4) | 41 | /3.svg |
| 5) | 39 | /4.svg |
| 6) | 36 | /robots.txt |
| 7) | 33 | none |
| 8) | 31 | /5.svg |
| 9) | 30 | /6.svg |
| 10) | 30 | /7.svg |
| 11) | 30 | /8.svg |
| 12) | 24 | /9.svg |
| 13) | 22 | /10.svg |
| 14) | 22 | /12.svg |
| 15) | 22 | /11.svg |
| 16) | 18 | /clientaccesspolicy.xml |
| 17) | 18 | /14.svg |
| 18) | 18 | /13.svg |
| 19) | 16 | /16.svg |
| 20) | 16 | /15.svg |
| |
| Requested images and CSS |
| Images and CSS requests ordered by hits |
| Different images and CSS requested 26 |
| 1) | 139 | /A1.JPG |
| 2) | 86 | /jpo_mockup2.css |
| 3) | 83 | /jquery-2.2.1.min.js |
| 4) | 82 | /jquery.mousewheel.js |
| 5) | 81 | /favicon.ico |
| 6) | 81 | /snap.svg-min.js |
| 7) | 49 | /A2.JPG |
| 8) | 47 | /A3.JPG |
| 9) | 45 | /A4.JPG |
| 10) | 36 | /A5.JPG |
| 11) | 34 | /A7.JPG |
| 12) | 34 | /A6.JPG |
| 13) | 33 | /A8.JPG |
| 14) | 25 | /A9.JPG |
| 15) | 23 | /A12.JPG |
| 16) | 23 | /A10.JPG |
| 17) | 23 | /A11.JPG |
| 18) | 19 | /A13.JPG |
| 19) | 18 | /A14.JPG |
| 20) | 16 | /A17.JPG |
| |
| Referers |
| Referers ordered by visits (google excluded) |
| Different referers 42 |
| 1) | 346 | none |
| 2) | 14 | https://www.facebook.com/ |
| 3) | 10 | https://www.facebook.com |
| 4) | 7 | http://www.listeur.xyz/robots.txt |
| 5) | 6 | http://esad.se/ |
| 6) | 5 | Google Search Engine |
| 7) | 3 | https://t.co/Wo9xmAYgXk |
| 8) | 3 | http://www.esad.se/ |
| 9) | 1 | http://www.6eat.com/ |
| 10) | 1 | http://www.manzuo.com/ |
| 11) | 1 | http://biji.baidu.com/ |
| 12) | 1 | http://www.lashou.com/ |
| 13) | 1 | http://www.landrover.com.cn/ |
| 14) | 1 | http://www.mydrivers.com/ |
| 15) | 1 | http://city.sohu.com/ |
| 16) | 1 | http://hainan.sina.com.cn/ |
| 17) | 1 | http://www.uc.cn/ |
| 18) | 1 | http://mil.huanqiu.com/ |
| 19) | 1 | https://www.google.fr |
| 20) | 1 | http://m.facebook.com/ |
| |
| Weekdays distribution |
| Percentage of hits in every day of the week |
| Mo | 94 (22.0%) |
|
| Tu | 65 (15.2%) |
|
| We | 42 (9.8%) |
|
| Th | 55 (12.9%) |
|
| Fr | 63 (14.7%) |
|
| Sa | 39 (9.1%) |
|
| Su | 70 (16.4%) |
|
| |
| Hours distribution |
| Percentage of hits in every hour of the day |
| 00 | 13 (3.0%) |
|
| 01 | 24 (5.6%) |
|
| 02 | 6 (1.4%) |
|
| 03 | 12 (2.8%) |
|
| 04 | 10 (2.3%) |
|
| 05 | 11 (2.6%) |
|
| 06 | 14 (3.3%) |
|
| 07 | 23 (5.4%) |
|
| 08 | 14 (3.3%) |
|
| 09 | 21 (4.9%) |
|
| 10 | 19 (4.4%) |
|
| 11 | 30 (7.0%) |
|
| 12 | 15 (3.5%) |
|
| 13 | 18 (4.2%) |
|
| 14 | 26 (6.1%) |
|
| 15 | 21 (4.9%) |
|
| 16 | 23 (5.4%) |
|
| 17 | 21 (4.9%) |
|
| 18 | 32 (7.5%) |
|
| 19 | 22 (5.1%) |
|
| 20 | 22 (5.1%) |
|
| 21 | 12 (2.8%) |
|
| 22 | 10 (2.3%) |
|
| 23 | 9 (2.1%) |
|
| |
| Statistics generated with VISITORS Web Log Analyzer version 0.7
|
| |


Validation using JS can be done using Regex expressions. You would notice that once an email of form
something@somedomain is filled and a number of +913333333333 is filled, it redirects you to a result.php script.
This script does not exist with the project, but nevertheless it is left because all HTML forms generally do some kind of POST request, either
using traditional HTML (done here), or using AJAX (wouldnt refresh on sending).
Made by Nirmal Khedkar


Digit Size
问题描述 :
Digital LC-display is widely used in many different fields such as electronic calculator, electronic watch, digital instruments, etc. A simulated example of the numbers represented by digital LC-display device is shown as follows:
Each number represented by LC-display above is composed of s "-" signs for the horizontal segments and s "|" signs for the vertical ones, and each number exactly occupies s+2 columns and 2s+3 rows. Your task is to change the size of the original numbers by changing "s" ― the number of signs.
Each number represented by LC-display above is composed of s "-" signs for the horizontal segments and s "|" signs for the vertical ones, and each number exactly occupies s+2 columns and 2s+3 rows. Your task is to change the size of the original numbers by changing "s" ― the number of signs.
输入:
The first line of input contains a number t, which means there are t cases of the test data.
The input contains several lines, 2s + 4 for each number to be displayed. The first line of each case contains two integer s and t (1 <= s, t <= 9), where s is the original size of the numbers and t is the target size of numbers that you should output. The following 2s + 3 lines show the original number n (the digit of n will not exceed 9) you should deal with. Each digit of n will be separated by an empty column (except for the last digit).
The input contains several lines, 2s + 4 for each number to be displayed. The first line of each case contains two integer s and t (1 <= s, t <= 9), where s is the original size of the numbers and t is the target size of numbers that you should output. The following 2s + 3 lines show the original number n (the digit of n will not exceed 9) you should deal with. Each digit of n will be separated by an empty column (except for the last digit).
输出:
The first line of input contains a number t, which means there are t cases of the test data.
The input contains several lines, 2s + 4 for each number to be displayed. The first line of each case contains two integer s and t (1 <= s, t <= 9), where s is the original size of the numbers and t is the target size of numbers that you should output. The following 2s + 3 lines show the original number n (the digit of n will not exceed 9) you should deal with. Each digit of n will be separated by an empty column (except for the last digit).
The input contains several lines, 2s + 4 for each number to be displayed. The first line of each case contains two integer s and t (1 <= s, t <= 9), where s is the original size of the numbers and t is the target size of numbers that you should output. The following 2s + 3 lines show the original number n (the digit of n will not exceed 9) you should deal with. Each digit of n will be separated by an empty column (except for the last digit).

不错，值得借鉴
额，不对应吧
有没有C++编译的？
对，就是把这32位当成一个长度为32的数组
妈呀！这个Dijkstra模板好长OwQ！
是穷举，但是代码有优化（v数组），并不是2^n。测试数据应该没问题，之前有超时的代码。
已经挂掉了，给个参考呗
The site You have write is very nicely prepared and quite insightful thanks for nice posta?|
后面的掩码变量部分乍一看比较难理解，其实就是把32位按照一个整体来看待。
程序只能输出一个子序列
第15行代码，/n/n，应该改为\n\n
这个问题其实还可以找循环节。参照欧拉定理（也就是费马定理的推广）,a^(phi(m)) mod m = 1
http://zh.wikipedia.org/wiki/%E6%AC%A7%E6%8B%89%E5%AE%9A%E7%90%86_(%E6%95%B0%E8%AE%BA)
所以先算b mod phi(10)，这个部分都是可以约掉的。基本上O(1)的时间就出解了。当然，这也是因为这个问题模数太小的原因。
能告诉我为什么对于每一个m，cnt的值不用更新吗?这儿我想不通啊，谢谢
目测会火


Click here for a simple example
Click here for a very complex example
THE QUICK BROWN FOX JUMPS OVER THE LAZY DOG.
THE QUICK BROWN FOX JUMPS OVER THE LAZY DOG.
THE QUICK BROWN FOX JUMPS OVER THE LAZY DOG.
THE QUICK BROWN FOX JUMPS OVER THE LAZY DOG.
THE QUICK BROWN FOX JUMPS OVER THE LAZY DOG.
Toggle Settings
Some Content To The Left
My Settings Go Here
Option 1
Option 2
Option 3
Save
Some Content In The Middle
Some Content To The Right
You can mouse over to open, too!
The content underneath was added dynamically.


Simulated butterflies
Daoist philosopher Zhuang Zhou may have been the first to propose the simulation hypothesis, when he remarked that upon awakening from a dream that he was a carefree and beautiful butterfly, he could no longer be certain that in his "real" life, he was not a butterfly dreaming that he was a man.
In the past few years, Silicon Valley’s billionaires have been waking up from their own butterfly dreams, including Elon Musk, who made the now-infamous statement in June 2016 on the stage of the Recode Conference that he believes the odds that we are in "base reality," that is, not living in a computer simulation, is "one in billions," based on the following logic:
"Forty years ago, we had Pong: like two rectangles and a dot. That was what games were. Now, forty years later, we have photorealistic 3-D simulations with millions of people playing simultaneously, and it’s getting better every year. And soon we’ll have virtual reality, augmented reality. If you assume any rate of improvement at all, then the games will become indistinguishable from reality."
This argument is loosely based on the one laid out in "Are You Living in a Simulation?" by Nick Bostrom, the philosophical thinker who also brought us the "paperclip maximizer" thought experiment of artificial intelligence and proponent of the Doomsday Argument. Bostrom suggests that the reason for a post-human civilization to create a simulation sufficiently advanced that we wouldn’t even know we were in it (referred to as an "ancestor simulation" in the original paper), is not at all clear:
"Maybe the scientific value of ancestor-simulations to a posthuman civilization is negligible (which is not too implausible given its unfathomable intellectual superiority), and maybe posthumans regard recreational activities as merely a very inefficient way of getting pleasure – which can be obtained much more cheaply by direct stimulation of the brain’s reward centers."
But Neil DeGrasse Tyson, who also professed support for the simulation theory in 2016 during the Isaac Asimov Memorial Debate, was also under the impression that our reality could be a simple game or diversion for these technologically advanced descendants of humanity: "It is easy for me to imagine that everything in our lives is just the creation of some other entity for their entertainment."
Bostrom concludes that unless we are living in a simulation right now, it is almost certain that our descendants will never create one, but as Musk points out, humanity has repeatedly expressed the desire to create games that are indistinguishable from reality: and we’re not only talking about verisimulators, we’re talking the whole existence enchilada.
There are already a couple of world-scale games that prove we can and most likely will (and therefore already have) created the simulation.
Everything
Physicists, cosmologists, and coders working across the world have recently accomplished computer simulations of the universe including galaxies, stars, supernovas, and black holes:
The closest thing to this that you can actually play is Everything. Everything, the game, lets you control a universe of things on the scale from bacteria to entire galaxies. Individually selecting and forming groups of objects, Everything lets you explore and experience animals, plants, humans, objects, every conceivable thing, set to hours of ambient original soundtrack and narrated by the British philosopher Alan Watts’ musings on changing your perspective and regarding the interconnectedness of the universe.
The game’s creator, artist David O’Reilly, is known for his deliberately low-poly and glitch aesthetics in the world of animation, and explained in an interview with Inverse that it’s about, "your idea of you, and how you relate to the world. It’s also about nothing, perspective, nature, existence, recursion, symmetry life, and its systems."
What it isn’t about is creating a perfect simulation. Many players have complained about the minimalist mechanics of Everything, in particular, the movement of animals, which flip end-over-end instead of locomoting in any recognizable way. In another interview, O’Reilly explains, "It's a practical [effect], and something I actually didn't expect to get so much attention, just because it's something that needed to be done. To do it any other way, the game’s budget would have been doubled."
According to Bostrom’s calculations, it would take between 10^33 and 10^36 logical operations per second for the most powerful computer we can currently conceive of to produce a realistic simulation of human history. Bostrom notes that Eric Drexler, known as the "founding father of nanotechnology," has already theorized a planet-sized computer using known nanotechnological designs, which would be able to approximately compute 10^42 operations per second, and concludes that "the computing power available to a posthuman civilization is sufficient to run a huge number of ancestor-simulations even if it allocates only a minute fraction of its resources to that purpose." Which is also to say, despite budgetary constraints, our version of Everything (which we may be living in now) most likely doesn’t skimp on animation.
Outside
The denizens of a subreddit called Outside practice a technique known in literature as "defamiliarization," by posting about a game called Outside, described as "a free-to-play MMORPG developed by Deity Games and the most popular game, with 7 billion+ active players."
What they are referring to is the world as we know it, which again, may or may not actually be a giant computer game.
There are a lot of rules about how best to frame and phrase these exercises in gamifying life, including "There are no NPCs. Aside from animals, everybody is a ‘player’," and "The devs are lazy and rarely do much. The game is mostly balanced as it is according to them, therefore they don’t do much aside from ‘natural’ world events."
The players borrow terminology like character traits from popular role-playing games, like charisma, intelligence, and dexterity (CHA, INT, DEX), refer to their geographical locations as different servers, and discuss things like career choices in terms of guild halls, unlocking tech trees and new maps for space exploration, and refer to actual games as mini games.
Philosophical questions about the existence of a god are framed by asking "Is Outside a one-man developer team?" and "Does anyone else think the mythology surrounding this game is a little confusing?"
Rule #1 of Outside is that it’s a lot more fun to explain something as a "feature," than a "bug," and because most of the game’s content is player-generated, most fan theories about the developer(s) of the game are considered valid.
Think too long or too hard about whether or not you live in a massive video game and you may have the kind of existential crisis Tomas experienced in MONTAG Issue 1's "Are you really alive? Does it even matter?"... or just buckle down and get good at it.
If we are living in a simulation, acknowledging that everything is a game might be the best way to handle it: especially when we know very few players get restarts or bonus lives. We can focus on leveling up our characters and completing quests and side quests that seem worthwhile, until we skill up enough to create our own simulations. Or keep playing long enough to respawn as a butterfly.


Chapter 23 Cholesky Decompostion
Another decomposition method is Cholesky (or Choleski) decomposition. The Cholesky decomposition method—used in statistical applications from nonlinear optimization, to Monte Carlo simulation methods, to Kalman filtering—is much more computationally efficient than the LU method. The Cholesky method decomposes a symmetric, positive definite matrix A into the product of two matrices, \(\mathbf{L}\) (a lower-triangular matrix) and \(\mathbf{L}^*\) (the conjugate transpose of \(\mathbf{L}\)).11
\[ \underset{n \times n}{\mathbf{A}} = \mathbf{LL}^* \]
The conjugate transpose is computed by taking the transpose of a matrix and then finding the complex conjugate of each element in the matrix. To understand what a complex conjugate is, we first remind you of the idea of a complex number. Remember that all real and imaginary numbers are complex numbers which can be expressed as \(a+bi\), where a is the real part of the number and b is the imaginary part of the number, and i is the square root of \(-1\). For example the number 2 can be expressed as \(2 + 0i\). Note: The complex conjugate of a real number is just the real number, since \(a+0i = a-0i=a\).
The complex conjugate of a number is itself a complex number that has the exact same real part and an imaginary part equal in magnitude but opposite in sign. For example the complex conjugate for the number \(3 + 2i\) is \(3 - 2i\).
As an example, say that matrix A was
\[ \mathbf{A} = \begin{bmatrix} 1 & 3+i & -2+3i \\ 0 & 4 & 0-i \\ \end{bmatrix} \]
The conjugate transpose of A, symbolized as \(\mathbf{A}^*\), can be found by first computing the transpose of A, and then finding the complex conjugate of each element in the transpose.
\[ \mathbf{A}^{\intercal} = \begin{bmatrix} 1 & 0 \\ 3+i0 & 4 \\ -2+3i & 0-i \end{bmatrix} \]
And,
\[ \mathbf{A}^{*} = \begin{bmatrix} 1 & 0 \\ 3-i0 & 4 \\ -2-3i & 0+i \end{bmatrix} \]
Many texts just present the notation for the Cholesky decomposition as \(\mathbf{A}=\mathbf{LL}^\intercal\), rather than \(\mathbf{A}=\mathbf{LL}^*\). This is because they make the further assumption that all the elements in A are real numbers. In that case, \(\mathbf{L}^*=\mathbf{L}^\intercal\). We will make that assumption and use that notation moving forward.
23.1 Example of Cholesky Decomposition
Say we wanted to compute a Cholsky decomposition on a \(2 \times 2\) symmetric matrix:
\[ \underset{2\times 2}{\mathbf{A}} = \begin{bmatrix} 5 & -4 \\ -4 & 5 \\ \end{bmatrix} \]
The Cholesky decomposition would factor A into the following:
\[ \begin{split} \underset{2\times 2}{\mathbf{A}} &= \underset{2\times 2}{\mathbf{L}}~\underset{2\times 2}{\mathbf{L}^\intercal}\\[1em] \begin{bmatrix} 5 & -4 \\ -4 & 5 \\ \end{bmatrix} &= \begin{bmatrix} l_{11} & 0 \\ l_{21} & l_{22} \\ \end{bmatrix} \begin{bmatrix} l_{11} & l_{21} \\ 0 & l_{22} \\ \end{bmatrix} \end{split} \]
Carrying out the matrix algebra we have the following three unique equations:
\[ \begin{split} 5 &= l_{11}(l_{11}) \\[0.5em] -4 &= l_{11}(l_{21}) \\[0.5em] 5 &= l_{21}(l_{21}) + l_{22}(l_{22}) \end{split} \]
Since we have three equations with three unknowns we can solve for each element in L.
\[ \begin{split} l_{11} &= \sqrt{5} \approx 2.24\\[0.5em] l_{21} &= \dfrac{-4}{\sqrt{5}} \approx -1.79 \\[0.5em] l_{22} &= \sqrt{1.8} \approx 1.34 \end{split} \]
So the Cholsky decomposition is,
\[ \begin{bmatrix} 5 & -4 \\ -4 & 5 \\ \end{bmatrix} = \begin{bmatrix} \sqrt{5} & 0 \\ \dfrac{-4}{\sqrt{5}} & \sqrt{1.8} \\ \end{bmatrix} \begin{bmatrix} \sqrt{5} & \dfrac{-4}{\sqrt{5}} \\ 0 & \sqrt{1.8} \\ \end{bmatrix} \]
Or using the approximations,
\[ \begin{bmatrix} 5 & -4 \\ -4 & 5 \\ \end{bmatrix} \approx \begin{bmatrix} 2.24 & 0 \\ -1.79 & 1.34 \\ \end{bmatrix} \begin{bmatrix} 2.24 & -1.79 \\ 0 & 1.34 \\ \end{bmatrix} \]
23.2 Cholesky Decomposition using R
We can use the chol()
function to compute the Cholesky decomposition. For example to carry out the Cholesky decomposition on A form the previous section, we would use the following syntax:
# Create A
= matrix(
A data = c(5, -4, -4, 5),
nrow = 2
)
# Cholesky decomposition
= chol(A)
cholesky_decomp
# View results
cholesky_decomp
[,1] [,2]
[1,] 2.236 -1.789
[2,] 0.000 1.342
Note that the output from chol()
is actually the transpose matrix, \(\mathbf{L}^\intercal\). To obtain L, we need to take the transpose of this output. We can also verify that the decomposition worked.
# Obtain L
t(cholesky_decomp)
[,1] [,2]
[1,] 2.236 0.000
[2,] -1.789 1.342
# Check results L(L^T) = A
t(cholesky_decomp) %*% cholesky_decomp
[,1] [,2]
[1,] 5 -4
[2,] -4 5
🚧 CAUTION: The chol()
function does not check for symmetry. If you use the function to decompose a nonsymmetric matrix, the results will likely be meaningless.
For example, consider the following nonsymmetric matrix:
\[ \mathbf{A} = \begin{bmatrix}5 & 1\\ -4 & 2\end{bmatrix} \]
Computing the decomposition, we get:
# Create A
= matrix(
A data = c(5, -4, 1, 2),
nrow = 2
)
# Cholsky decomposition
chol(A)
[,1] [,2]
[1,] 2.236 0.4472
[2,] 0.000 1.3416
Checking the matrix multiplication we do not get back to the original matrix, A:
# Check results
t(chol(A)) %*% chol(A)
[,1] [,2]
[1,] 5 1
[2,] 1 2
23.3 Statistical Application: Estimating Regression Coefficents with Cholesky Decomposition
We can again use the the OLS solution to compute the elements of b by solving the system of equations represented in:
\[ (\mathbf{X}^{\intercal}\mathbf{X})\mathbf{b} = \mathbf{X}^{\intercal}\mathbf{y} \]
So long as \(\mathbf{X}^\intercal\mathbf{X}\) is positive definite, we can use Cholesky decomposition to solve for the elements of b using the same two-step process we did for LU decomposition. Namely,
\[ \begin{split} &\mathrm{Solve~~}\mathbf{LZ} &= \mathbf{X}^{\intercal}\mathbf{y}~~\mathrm{for~}\mathbf{Z} \\[2ex] &\mathrm{Solve~~}\mathbf{L}^\intercal\mathbf{b} & =\mathbf{Z}~~\mathrm{for~}\mathbf{b} \end{split} \]
Using the same simulated data as the example from last chapter, consider the following simulated data set of \(n=50\) cases:
# Number of cases
= 50
n
# Create 50 x-values evenly spread b/w 1 and 500
= seq(from = 1, to = 500, len = n)
x
# Create X matrix
= cbind(1, x, x^2, x^3)
X
# Create b matrix
= matrix(
b data = c(1, 1, 1, 1),
nrow = 4
)
# Create vector of y-values
set.seed(1)
= X %*% b + rnorm(n, mean = 0, sd = 1) y
We can again use forwardsolve()
and backsolve()
to help solve the two equations.
# Obtain L^T and L
= chol(t(X)%*%X)
L_T = t(L_T)
L
# Solve for Z
= forwardsolve(L, crossprod(X,y))
Z
# Solve for b
= backsolve(L_T, Z)
b
# View b
b
[,1]
[1,] 0.9038
[2,] 1.0066
[3,] 1.0000
[4,] 1.0000
There are also variations on the Cholesky decomposition method, including LDL and LDL\(^\intercal\) decomposition. In these methods, D is a diagonal matrix.↩


Prime Path
问题描述 :
The ministers of the cabinet were quite upset by the message from the Chief of Security stating that they would all have to change the four-digit room numbers on their offices.
— It is a matter of security to change such things every now and then, to keep the enemy in the dark.
— But look, I have chosen my number 1033 for good reasons. I am the Prime minister, you know!
— I know, so therefore your new number 8179 is also a prime. You will just have to paste four new digits over the four old ones on your office door.
— No, it’s not that simple. Suppose that I change the first digit to an 8, then the number will read 8033 which is not a prime!
— I see, being the prime minister you cannot stand having a non-prime number on your door even for a few seconds.
— Correct! So I must invent a scheme for going from 1033 to 8179 by a path of prime numbers where only one digit is changed from one prime to the next prime.
— It is a matter of security to change such things every now and then, to keep the enemy in the dark.
— But look, I have chosen my number 1033 for good reasons. I am the Prime minister, you know!
— I know, so therefore your new number 8179 is also a prime. You will just have to paste four new digits over the four old ones on your office door.
— No, it’s not that simple. Suppose that I change the first digit to an 8, then the number will read 8033 which is not a prime!
— I see, being the prime minister you cannot stand having a non-prime number on your door even for a few seconds.
— Correct! So I must invent a scheme for going from 1033 to 8179 by a path of prime numbers where only one digit is changed from one prime to the next prime.
Now, the minister of finance, who had been eavesdropping, intervened.
— No unnecessary expenditure, please! I happen to know that the price of a digit is one pound.
— Hmm, in that case I need a computer program to minimize the cost. You don’t know some very cheap software gurus, do you?
— In fact, I do. You see, there is this programming contest going on… Help the prime minister to find the cheapest prime path between any two given four-digit primes! The first digit must be nonzero, of course. Here is a solution in the case above.
1033
1733
3733
3739
3779
8779
8179
The cost of this solution is 6 pounds. Note that the digit 1 which got pasted over in step 2 can not be reused in the last step – a new 1 must be purchased.
输入:
One line with a positive number: the number of test cases (at most 100). Then for each test case, one line with two numbers separated by a blank. Both numbers are four-digit primes (without leading zeros).
输出:
One line for each case, either with a number stating the minimal cost or containing the word Impossible.
样例输入:
3 1033 8179 1373 8017 1033 1033
样例输出:
6 7 0
解题代码:
import java.io.BufferedInputStream; import java.util.LinkedList; import java.util.Scanner; public class Main { static boolean[] isPrime = Prime.getPrimes(10000); public static void main(String[] args) { Scanner scan = new Scanner(new BufferedInputStream(System.in)); int cas = scan.nextInt(); for (int i = 1; i <= cas; i++) { int start = scan.nextInt(); int end = scan.nextInt(); boolean[] isVisited = new boolean[10000]; int[] step = new int[10000]; LinkedListqueue = new LinkedList(); queue.addLast(start); isVisited[start] = true; while (!queue.isEmpty()) { int current = queue.pop(); if (current == end) { break; } for (int j = 0; j <= 9; j++) { int next1 = getNext(1, j, current); int next2 = getNext(2, j, current); int next3 = getNext(3, j, current); int next4 = getNext(4, j, current); if (!isVisited[next1]) { queue.addLast(next1); step[next1] = step[current] + 1; isVisited[next1] = true; } if (!isVisited[next2]) { queue.addLast(next2); step[next2] = step[current] + 1; isVisited[next2] = true; } if (!isVisited[next3]) { queue.addLast(next3); step[next3] = step[current] + 1; isVisited[next3] = true; } if (!isVisited[next4]) { queue.addLast(next4); step[next4] = step[current] + 1; isVisited[next4] = true; } } } System.out.println(step[end]); } } public static int getNext(int flag, int i, int current) { int next = 0; if (flag == 1) { if (i == 0) { return current; } next = current % 1000 + i * 1000; } if (flag == 2) { int t = current / 1000; next = t * 1000 + current % 1000 % 100 + i * 100; } if (flag == 3) { int t = current / 100; int tt = current % 10; next = t * 100 + i * 10 + tt; } if (flag == 4) { next = current / 10 * 10 + i; } if (!isPrime[next]) { return current; } return next; } } class Prime { public static boolean[] getPrimes(int n) { int i, j, k, x; boolean[] a = new boolean[n]; n++; n /= 2; int[] b = new int[(n + 1) * 2]; a[2] = true; a[3] = true; for (i = 1; i <= 2 * n; i++) { b[i] = 0; } for (i = 3; i <= n; i += 3) { for (j = 0; j < 2; j++) { x = 2 * (i + j) - 1; while (b[x] == 0) { a[x] = true; for (k = x; k <= 2 * n; k += x) { b[k] = 1; } } } } return a; } }
(adsbygoogle = window.adsbygoogle || []).push({});
都是一些基础题啊
wt[n - 1]没错，因为下标是[0...n-1]
这个是代码高亮功能，那就再换一个颜色
代码不对，仔细对比一下输入输出， 怎么会有‘‘printf("The winning moves are:");’’这种输出呢？
感觉这里的评分标准没啥作用阿，反而显得显得赘余，还不如直接去掉好了。
第二种解法如果数组有重复元素 就不正确
我没看懂题目
2
5 6 -1 5 4 -7
7 0 6 -1 1 -6 7 -5
我觉得第一个应该是5 6 -1 5 4 输出是19 5 4
第二个是7 0 6 -1 1 -6 7输出是14 7 7
不知道题目例子是怎么得出来的
程序员会算法，等于一个古惑仔带了zhi抢啊
有意思，有难度
输出规范写错了哦~
很好的思路，可以借鉴
多谢提醒，是漏掉了
多谢支持！
有些说不通吧，只有1个孩子肯定是男孩了


Sample
Home
Forums
Videos
Images
Blog
Sign in
SIGN IN
User login
User Name
Password
Forget Password
New User Registration


| Changelist/Build | Owner | Time Started | State | Matrics | Build | Unit Test | Functional Test |
|---|---|---|---|---|---|---|---|
| {{item.buildNo}} | {{item.owner}} | {{item.timeStamp}} | {{item.state}} |
|
|
|
|
Metrics Test: {{item.metrics.test}}
Maintainablity: {{item.metrics.maintainablity}}
Security: {{item.metrics.security}}
Workmanship: {{item.metrics.workmanship}}
Build{{item.build.timeStarted}}Unit TestFunctional TestResult: Change Accepted Auto-Merged |


|
Apache Ignite.NET
|
Cache storage adapter with parallel loading in LoadAll method. More...
Public Member Functions | |
| virtual void | LoadCache (Action< TK, TV > act, params object[] args) |
| Loads all values from underlying persistent storage. Note that keys are not passed, so it is up to implementation to figure out what to load. This method is called whenever ICache<K,V>.LocalLoadCache method is invoked which is usually to preload the cache from persistent storage. More... | |
| virtual TV | Load (TK key) |
Loads an object. Application developers should implement this method to customize the loading of a value for a cache entry. This method is called by a cache when a requested entry is not in the cache. If the object can't be loaded null should be returned. More... | |
| virtual IEnumerable< KeyValuePair< TK, TV > > | LoadAll (IEnumerable< TK > keys) |
| Loads multiple objects. Application developers should implement this method to customize the loading of cache entries. This method is called when the requested object is not in the cache. If an object can't be loaded, it is not returned in the resulting map. More... | |
| virtual void | Write (TK key, TV val) |
| Write the specified value under the specified key to the external resource. More... | |
| virtual void | WriteAll (IEnumerable< KeyValuePair< TK, TV >> entries) |
| Write the specified entries to the external resource. This method is intended to support both insert and update. More... | |
| virtual void | Delete (TK key) |
| Delete the cache entry from the external resource. More... | |
| virtual void | DeleteAll (IEnumerable< TK > keys) |
| Remove data and keys from the external resource for the given collection of keys, if present. More... | |
| virtual void | SessionEnd (bool commit) |
Tells store to commit or rollback a transaction depending on the value of the commit parameter. More... | |
Protected Member Functions | |
| CacheParallelLoadStoreAdapter () | |
| Constructor. More... | |
| abstract IEnumerable< TData > | GetInputData () |
| Gets the input data sequence to be used in LoadCache. More... | |
| abstract KeyValuePair< TK, TV > | Parse (TData inputRecord, params object[] args) |
| This method should transform raw data records from GetInputData into valid key-value pairs to be stored into cache. More... | |
Properties | |
| int | MaxDegreeOfParallelism [get, set] |
| Gets or sets the maximum degree of parallelism to use in LoadCache. Must be either positive or -1 for unlimited amount of threads. More... | |
LoadCache calls GetInputData() and iterates over it in parallel. GetInputData().GetEnumerator() result will be disposed if it implements IDisposable. Any additional post-LoadCache steps can be performed by overriding LoadCache method.
| TK | Key type. |
| TV | Value type. |
| TData | Custom data entry type. |
|
protected |
|
virtual |
Expiry of a cache entry is not a delete hence will not cause this method to be invoked.
This method is invoked even if no mapping for the key exists.
| key | The key that is used for the delete operation. |
Implements Apache.Ignite.Core.Cache.Store.ICacheStore< TK, TV >.
|
virtual |
The order that individual deletes occur is undefined.
If this operation fails (by throwing an exception) after a partial success, the writer must remove any successfully written entries from the entries collection so that the caching implementation knows what succeeded and can mutate the cache.
Expiry of a cache entry is not a delete hence will not cause this method to be invoked.
This method may include keys even if there is no mapping for that key, in which case the data represented by that key should be removed from the underlying resource.
| keys | a mutable collection of keys for entries to delete. Upon invocation, it contains the keys to delete for write-through. Upon return the collection must only contain the keys that were not successfully deleted. |
Implements Apache.Ignite.Core.Cache.Store.ICacheStore< TK, TV >.
|
protectedpure virtual |
|
virtual |
| key | The key identifying the object being loaded. |
null
if the object can't be loaded Implements Apache.Ignite.Core.Cache.Store.ICacheStore< TK, TV >.
|
virtual |
| keys | Keys identifying the values to be loaded. |
Implements Apache.Ignite.Core.Cache.Store.ICacheStore< TK, TV >.
|
virtual |
This method is optional, and cache implementation does not depend on this method to do anything.
For every loaded value method provided action should be called. The action will then make sure that the loaded value is stored in cache.
| act | Action for loaded values. |
| args | Optional arguemnts passed to ICache<K,V>.LocalLoadCache method. |
| CacheStoreException |
Implements Apache.Ignite.Core.Cache.Store.ICacheStore< TK, TV >.
|
protectedpure virtual |
|
virtual |
| commit | True if transaction should commit, false for rollback. |
Implements Apache.Ignite.Core.Cache.Store.ICacheStore< TK, TV >.
|
virtual |
This method is intended to support both key/value creation and value update.
| key | Key to write. |
| val | Value to write. |
Implements Apache.Ignite.Core.Cache.Store.ICacheStore< TK, TV >.
|
virtual |
The order that individual writes occur is undefined.
If this operation fails (by throwing an exception) after a partial success, the writer must remove any successfully written entries from the entries collection so that the caching implementation knows what succeeded and can mutate the cache.
| entries | a mutable collection to write. Upon invocation, it contains the entries to write for write-through. Upon return the collection must only contain entries that were not successfully written. (see partial success above). |
Implements Apache.Ignite.Core.Cache.Store.ICacheStore< TK, TV >.
|
getset |
Defaults to Environment.ProcessorCount.


I am a developer specializing in HTML and CSS. I like to run, bike, and make coffee using an Aeropress.
Web Development projects
Design projects
Find me on Twitter, Dribbble, and GitHub.


nips nips2001 nips2001-90 nips2001-90-reference knowledge-graph by maker-knowledge-mining
Source: pdf
Author: Jorg Ontrup, Helge Ritter
Abstract: We introduce a new type of Self-Organizing Map (SOM) to navigate in the Semantic Space of large text collections. We propose a “hyperbolic SOM” (HSOM) based on a regular tesselation of the hyperbolic plane, which is a non-euclidean space characterized by constant negative gaussian curvature. The exponentially increasing size of a neighborhood around a point in hyperbolic space provides more freedom to map the complex information space arising from language into spatial relations. We describe experiments, showing that the HSOM can successfully be applied to text categorization tasks and yields results comparable to other state-of-the-art methods.
[1] T. Kohonen. Self-Organizing Maps. Springer Series in Information Sciences. 3rd edition, 2001.
[2] Teuvo Kohonen, Samuel Kaski, Krista Lagus, Jarkko Saloj¨ rvi, Vesa Paatero, and Antti Saarela. a Organization of a massive document collection. IEEE Transactions on Neural Networks, Special Issue on Neural Networks for Data Mining and Knowledge Discovery, 11(3):574–585, May 2000.
[3] John Lamping and Ramana Rao. Laying out and visualizing large trees using a hyperbolic space. In Proceedings of UIST’94, pages 13–14, 1994.
[4] T. Munzer. Exploring large graphs in 3D hyperbolic space. IEEE Computer Graphics and Applications, 18(4):18–23, July/August 1998.
[5] H. S. M. Coxeter. Non Euclidean Geometry. Univ. of Toronto Press, Toronto, 1957.
[6] J.A. Thorpe. Elementary Topics in Differential Geometry. Springer-Verlag, New York, 1979.
[7] Frank Morgan. Riemannian Geometry: A Beginner’s Guide. Jones and Bartlett Publishers, Boston, London, 1993.
[8] Charles W. Misner, J. A. Wheeler, and Kip S. Thorne. Gravitation. Freeman, 1973.
[9] R. Fricke and F. Klein. Vorlesungen uber die Theorie der automorphen Funktionen, volume 1. ¨ Teubner, Leipzig, 1897. Reprinted by Johnson Reprint, New York, 1965.
[10] W. Magnus. Noneuclidean Tesselations and Their Groups. Academic Press, 1974.
[11] Helge Ritter. Self-organizing maps in non-euclidian spaces. In E. Oja and S. Kaski, editors, Kohonen Maps, pages 97–108. Amer Elsevier, 1999.
[12] J. Ontrup and H. Ritter. Text categorization and semantic browsing with self-organizing maps on non-euclidean spaces. In Proc. of the PKDD-01, 2001.
[13] G. Salton and C. Buckley. Term-weighting approaches in automatic text retrieval. Information Processing and Management, 24(5):513–523, 1988.
[14] T. Joachims. Text categorization with support vector machines: learning with many relevant features. In Proc. of ECML-98, number 1398, pages 137–142, Chemnitz, DE, 1998.
[15] Huma Lodhi, John Shawe-Taylor, Nello Cristianini, and Chris Watkins. Text classiﬁcation using string kernels. In Todd K. Leen, Thomas G. Dietterich, and Volker Tresp, editors, Advances in Neural Information Processing Systems 13, pages 563–569. MIT Press, 2001.
[16] F. Sebastiani, A. Sperduti, and N. Valdambrini. An improved boosting algorithm and its application to automated text categorization. In Proc. of CIKM-00, pages 78–85, 2000.
[17] Y. Yang. An evaluation of statistical approaches to text categorization. Information Retrieval, 1-2(1):69–90, 1999.


Robert Metcalfe is an electrical engineer and doctor of computer science who has made huge contributions to the world of data communications. He graduated with a bachelor's degree from MIT in 1969, then went on to get his master's degree and Ph.D. from Harvard University in Applied Mathematics and Computer Science respectively. He is currently a professor at the University of Texas at Austin, in the Cockrell School of Engineering, and was appointed to lead innovation initiatives at the university.
While working at Xerox in the early 1970's, he, along with David Boggs, invented Ethernet - the most widely installed local area network (LAN) technology. Ethernet is a link-layer protocol in the TCP/IP protocol stack, describing how networked devices can format data for transmission to other devices on the same network, and how to put that data out on the network connection. Unlike dial-up networking, Ethernet transmits data at a much higher rate. After the creation of the Ethernet cable, Robert Metcalfe co-founded 3COM, a digital electronics manufacturer best known for its computer network infrastructure products.
In 1980, he received the ACM Grace Hopper Award for his contributions to the development of local networks and the creation of Ethernet. Metcalfe was also awarded the IEEE Medal of Honor in 1996 for "exemplary and sustained leadership in the development, standardization, and commercialization of Ethernet," as well as the 2003 Marconi Award for "inventing the Ethernet and promulgating his law of network utility based on the square of the nodes." In May 2007, he was inducted into the National Inventors Hall of Fame in Akron, Ohio.
This tutorial will teach you how to use basic commands to organize your files.


My name is Sergio Fernández
(aka
wikier/willy).
I'm a Spanish software engineer,
based in Vancouver
(Canada),
advocate of open technologies and ways of thinking.
I like to say that I am I and my circumstances
.
So welcome to my personal web page!
As mentioned, I'm a Software engineer with wide experience productionizing and scalling smart software systems that combine different technologies (Information Retrieval, Semantic Web, Machine Learning or Big Data, among others). Currently I'm applying all my engineering expertise to a larger scale at Amazon, the Earth's most customer-centric company.
In the past I've worked at some of the finest applied research institutes in Europe: more than six years as research assistant at CTIC (Spain), visiting DERI (Ireland) in 2008, and as a Senior Researcher at Salzburg Research in Austria in 2012. Contributing in this time as expert in numerous large-scale European research projects and standardization bodies such as the W3C. After that I tried to bring some of those results to the market as co-founder of a startup in Austria: Redlink.
Since my time in college, I have always been passionate about open software technologies, free software or open source, the way you prefer to call it. Long gone are the days of AsturLiNUX when we wanted to change the world from a modest LUG. But the spirit remains. So it is no surprise that most of my development work is available in several open source projects, and especially at the Apache Software Foundation, of which I'm Member.
My other passion remains teaching. So whenever I have the chance I love to organize talks, workshops or meetups to share ideas and simply talk tech. I have also been sporadically lecturing at universities and other education centers.
Disclaimer: this is my personal website, so all the opinions expressed here are my own and do not necessarily represent those of current or past employers.
Ocasionally I write in a blog those writing I find interesting to share. But I don't keep it as updated as I used to do, so you can refer to my twitter to get freshest information.
Although Google Scholar does a great work gathering my publications, here I manually maintain a list with all of them:
Due my research activities, I participated in large-scale European research projects as well as in W3C standarization groups. But this list doesn't refer to those projects, but software projects I developed, of course pretty related with my research. You can check at ohloh some of my contributions to other open source projects.
In the development of these projects I collaborate with many people: Diego Berrueta, Iván Mínguez, Carlos Tejo, Miguel García, Jose María Álvarez, Iván Frade, Jose E. Labra, Ivan Herman, John Breslin, Uldis Bojars, Stéphane Corlosquet, Richard Cyganiak, Sebastian Schaffert, Rupert Westenthaler, Jakob Frank, Thomas Kurz, Rafa Haro, among others...


Telford bowling team raises thousands for hospice that cared for former member
by Rob SmithA crack team of female bowlers organised a fun day in memory of a former teammate and raised almost £4,000.
The Donnington Angels, of Donnington Wood Bowling Club, raised thousands for the Nightingale Hospice in Wrexham. They chose the hospice after one of the club's old members, Davydd Popple, died there at the age of just 48.
Mr Popple died in August this year, and the Angels organised a fundraising fun day in just over a fortnight.
They held an entertainment-packed day with face-painting, a bouncy castle, a tombola and more as well as hot drinks for the adults.
Raffle prizes included whisky bottles, a tablet and electronic games sets.
Now they have counted out the money raised and their impressive final total is £3,800.
Terry Ladkin, who is the chair of the club committee, said he was left speechless by the Angels' generosity.
He said: "It was fantastic.
"We had face painting for the kids, we were doing a tombola.
"We had a lot of prizes donated. They were selling tea, they were selling coffee. They had a bouncy castle as well.
"One of our old members, [Davydd Popple] had moved to Wrexham, he ended up in the Nightingale Hospice.
"He was an older member and they thought we should do something for the hospice.
"The girls have done a wonderful job. They have gone from strength to strength.
"What they do, I just can't find words for it."


fun doesErrorExist(taskId: Long): Boolean
Convenient method to see if an error has been recorded for a PendingTask and has not been resolved yet.


{% load extras %} {% load i18n %}
{% language userlanguage %}{% trans "Hello" %} {{ username }},
{% blocktrans %}This is an automatic message from foowill.com. You have exceeded the time interval without updating your twitter status and we are worry about you.
{% endblocktrans %}{% blocktrans with time_without_update|relative_date as time1 %}The latest news we have of you was {{ time1 }} ago.{% endblocktrans %}.
{% blocktrans with half_dead_time_mail_interval|relative_date as time2 %} If you do not update your twitter status in the next {{ time2 }}, we will proceed to send your post-tweets ({{ number_posts }}) that you saved on foowill.com {% endblocktrans %}
{% blocktrans %}You also have the option to login on foowill.com to stop the publish process.{% endblocktrans %}
{% trans "If you think it's necessary to increase the downtime interval on twitter, we recommend that you change your settings:" %}
{{ link_for_config }}
{% trans "We remind you that you can add or delete post-tweets if you still want!" %}
{% trans "Regards," %}
{% endlanguage %}


This example shows how to call a REST API and handle the response.
Before sending the response HTML back to browser, AddressLookupUpdater is compiled and executed.
Then, the Updater inserts two script tags in head tag (WebExtension.js and AddressLookup.js).
Also it adds a Lookup button to fire lookup JavaScript function.
When user clicks on the Lookup, lookup function is invoked and it calls AddressLookup REST APT and receives a response.
Finally, the address in the response is set to the address form on the screen.


What state has the southernmost location of *Picea* in this search?
Search for Sites
Use the Search dialog window
Advanced tab
Metadata subtab
Site Name field
find "Devil's Lake, WI".
Once you've performed the search, click on the point that appears. A window will pop up with some information about this record.
What is the latitude and longitude of Devil's Lake? What is the Site ID?
The lat/long is XXXX.
View Data
Find Devil's Lake (WI) again. Click on the site.
In the popup window with metadata for Devil's Lake, note that the bottom includes a list of datasets available at the site.
Hold the mouse over the pollen dataset.
View the Devil's Lake pollen dataset.
Samples: A data table. Each row is a different variable and each column is a stratigraphic depth.
Diagram: Plots a stratigraphic diagram. Change the Primary Axis to 'COHMAP Chron 2' (this switches the vertical axis from a depth axis to time axis; more about depth vs. time later) then click 'Draw.'
What was the most abundant plant taxon at Devil's Lake during the end of the Pleistocene?
The most abundant taxon at Devil's Lake was Picea.
What has been the most abundant taxon during the Holocene? (from 11,000 years ago to present)
*Note: Here we are assuming that plant with the most abundant pollen in sediments is also the most abundant on the landscape. This isn't necessarily a good assumption; we'll save that challenge for another day.*
Using the information in the Chronology tab, how many age controls are stored for Devil's Lake? How many of these are radiocarbon dates?
This is the answer
What publications are listed for Devil's Lake?
Here's the answer.
Find All Work by a PI
In which states has Lou worked?
Find All Datasets by Type
The generation of fossil pollen records is labor intensive and hence expensive - *e.g.* the costs of fieldwork, the money spent on radiocarbon dates, the time required for a trained analysis to identify and count pollen data, etc. A rough time/cost estimate for a single fossil pollen record is on the order of two years and $30,000. Given this, give an order-of-magnitude estimate of the number of person-years and dollars it took to generate these fossil pollen records now stored in Neotoma. (Order-of-magnitude = 10 person-years? 100 person-years? 1000? etc.)
Notice there is a fairly dense network of fossil pollen sites in an arc stretching from Minnesota to Nova Scotia. Why might there be such a dense network in this region?
Show/Hide Search Results
Download Data
In the popup window with metadata for Devil's Lake, hold the mouse over the pollen dataset. Note that an eyeball and '+' appear to the right. Click on the '+'. This adds the dataset to a 'Datasets' tray.
Find the icon for the 'Saved Datasets Tray' and click on it.
Hover over the dataset then click on the Save icon to the right. The dataset will be saved as a text file in CSV (comma separated value) format.
Open the downloaded CSV file in Excel or a text editor (e.g. Notepad, Wordpad) to look at it.
What is the most abundant taxon at Depth = 1 cm?
It's this taxon.
Synthesizing With Neotoma
Multi-Taxon Search
1. Find all sites with at least 20% *Picea* pollen between 15,000 and 12,000 years ago.
2. Find all sites with Mammut (mastodon) between 15,000 and 12,000 years ago.
1. For Mammut, use the 'Advanced Taxon Selection' which you can use by clicking on the gears icon to the right of the 'Taxon' field in the 'Search' window.
2. In the ATS window, choose 'Mammals' for Taxa Group and then enter Mammut into the 'Search for' window. Then click 'Go'
3. Note that the search returned taxon names for both Mammut (mastodon) and Mammuthus (mammoth). Click all boxes for all variants of Mammut but do not click the Mammuthus boxes
4. Enter a search name (e.g. 'Mammut - all') and click Save
5. In the general search window, click 'Search'
* **QUESTION 6** Does mastodon tend to live in places with spruce, or without spruce? Suggest two hypotheses that might explain the observed association.
Multi-Time Search
* **QUESTION 7** Describe the history of *Picea* distributions in eastern North America over the last 21,000 years (i.e. ignore the Rockies and points west). What environmental change(s) might be causing this shift in *Picea* distributions? Given that trees are sessile (immobile) organisms, what processes might allow the observed range shifts?


I want to build a house. Origins of a Self Build Dream Draft concept model and floor plans for a 2 story house. Self-build Concept Model Building tiny home for tiny house village. Cottage Village Twin-size cedar bed frame with drawer and bench. Bed Set Pottery tinker that creates bowls and cups. Pottery Bot


{% extends 'base.html' %} {% block content %}
We are bringing CodeTronics, much more than a club, where we all together will learn and play with the codes and the electronics with the core thought of innovating ideas. Let's join the different face of Code & Electronics. Let's join CodeTronics.
 With "Code Tronics " - an initiative taken by the ECE department of NIET, we wish to make you the part of that same revolution. Our mission is to develop the interest of coding and circuit designing in every possible student within our reach so that YOU can cultivate the ideas and thrive off that creativity and impulse .So be a part of this revolution or be a spectator forever.
We aim to organise two events in a month. One for coding other for electronics.Events include various Competitions,seminars,Quizzes,talks.
Electronics is no more just a component in modern technology; it is the basis of assessment of a country’s progress. It is one of the most knowledge-intensive and dynamic fields of study. It is the field that is most crucial to tackling national problems of illiteracy, healthcare and safety which imparts it with tremendous potential in India.
With the knowledge of this fact,CodeTronics, NIET, endeavors to create a community of students driven by a passion for electronics and innovation by acting as a means for them to learn and challenge what they have learnt. We aim to turn students into visionaries who can create a better society with their love for technology.
Our mission is to enhance the coding and circuit designing skills and develop the interest among the students for the coming future technology in the field of IT and Electronics


Big Energy
A Predictive Approach to US Electrical Demand Modelling
Please select a State
Please Select A Balancing Authority
Please select a date range and time precision
Start Date:
End Date:
Comparison of the similarity score of our highest scoring prediction modelwith the actual US demand, compared to the official US forecast


THE KILLER A film review by Thomas E. Billings Copyright 1991 Thomas E. Billings
Synopsis: A professional killer accidentally blinds a young woman in a shootout.  Further complications: the last job is a double-cross, and his employers try to have him killed. A psychological view of the killer and the policeman who stalks him, interspersed with outrageously violent shootouts and black humor.
Hong Kong (English subtitles), color, 1990, 110 minutes. Director/Writer: John Woo Producer: Tsui Hark
The film centers on Jeffrey, a skilled hit man or professional killer. During a wild shootout in a bar, a beautiful young woman (a singer in the bar), is blinded by powder burns from his gun. He befriends her, and falls in love with her. She needs a cornea transplant, and cannot afford one.
The last job is completed, then he is double-crossed. The people who hired him try to kill him (in further wild shootouts). Meanwhile, a police inspector is closing in on Jeffrey. The story continues as Jeffrey sets out to kill the man who double-crossed him....
The Director, John Woo, is perhaps best known for the film series A BETTER TOMORROW. The current film is a very stylish "gangster film," but it is not like most other gangster films. Instead, due to the wild shootouts, it might be compared to a Western, particularly the very violent Italian Westerns of the 1970's (e.g., Sergio Leone's films).
The film centers on emotions: Jeffrey's guilt and love for Jenny, the woman he blinded; the police inspector's obsession and hatred for Jeffrey which turns to admiration and respect as the film progresses; Jeffrey's friendship with another killer, and the "gangster code of ethics" they follow. However, all the psychological intricacies of the very complex characters in the film are overwhelmed by the violence in the film, which is a virtual bloodbath.
The shootouts in this film are so wild, so outrageous, that it is reasonable to describe them as a "ballet of violence." They are pure violence elevated to the level of an art form! They also reflect real technical brilliance in special effects and (fight) choreography. Initially, you might marvel at the artistic and technical skill they reflect. However, they are so overdone (and there are so many shootouts in the film), that you soon become numb to it all.
The relationship between Jeffrey and the police inspector chasing him is quite complex. There is a hilarious scene where the inspector confronts Jeffrey in Jenny's apartment; Jeffrey and the police inspector stand face to face, at arm's length, pointing pistols at each other's face! Jenny, being blind, is unaware of the confrontation and makes tea and exchanges social pleasantries with the men, as they maneuver in a deadly game. However, as the film progresses, they become friends, as the policeman admires Jeffrey's devotion to Jenny.
Because of the extreme violence of the film, I would not recommend it to a general audience. However, fans of gangster films and violent Westerns may find its wild shootouts and black humor to their liking.
Distribution: in limited theatrical release; currently showing (4/27) in San Francisco.
Reviewer contact<EMAIL_ADDRESS>.
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


Module media_player
Create proxy objects that implement the
org.mpris.MediaPlayer2
DBus interface.
The proxy object exposes all the methods an properties of the interface in addition to the methods documented here. Note that some applications may not implement the full MPRIS specification.
This library is implemented on top of the dbus_proxy
module.
Usage:
MediaPlayer = require("media_player") vlc = MediaPlayer:new("vlc") vlc:PlayPause() for k, v in pairs(vlc:info()) do print(k, v) end vlc:Stop()
Info:
- Copyright: 2017 Stefano Mazzucco
- License: Apache License, version 2.0
- Author: Stefano Mazzucco
Class MediaPlayer
| MediaPlayer:Get (property_name) | Get the value of a property. |
| MediaPlayer:position_as_str () | Return the position of the track as a string of the type
HH:MM:SS . |
| MediaPlayer:info () | Return useful information about the track. |
| MediaPlayer:new (name) | Create a new MediaPlayer proxy object |
Class MediaPlayer
- MediaPlayer:Get (property_name)
-
Get the value of a property. You should not need to use this
method directly. Instead, you should access the property with the dot
notation: e.g.
player.PropertyName
.Parameters:
- property_name string the name of a property
Returns:
- the value of the property
- nil if the property is not present or the application is not available
- MediaPlayer:position_as_str ()
-
Return the position of the track as a string of the type
HH:MM:SS
.Returns:
-
a string of the type
HH:MM:SS
- an empty string if the application is not available
-
a string of the type
- MediaPlayer:info ()
-
Return useful information about the track.
For full control over the metadata, use
player.Metadata
.Returns:
-
a table with the following keys (if available in the track's metadata):
album
: name of the albumtitle
: title of the songyear
: song yearartists
: comma-separated list of artistslength
: total lenght of the track asHH:MM:SS
- an empty table if the application is not available
-
- MediaPlayer:new (name)
-
Create a new MediaPlayer proxy object
Parameters:
- name
string
name of the application as found in the unique bus name:
org.mpris.MediaPlayer2.<name>
. E.g.org.mpris.MediaPlayer2.vlc
. The resulting DBus name will also be exposed as a field of the object (i.e.player.name
)
- name
string
name of the application as found in the unique bus name: