Assemble a profile log-likelihood tibble
assemble_profile_tib(tib, trace = "profile1")
| tib | a tibble, derived from loglik_mat and with pmap info |
|---|---|
| trace | character vector to identify which profile log likelihood to calculate. Takes values 'profile1' or 'profile2' |
a tibble with 3 columns: marker position, profile log-likelihood, and trace (profile1 or profile2)
Other profile log-likelihood tibble functions: add_intercepts
,
add_pmap
, tidy_scan_pvl
,
transform_loglik_mat
pm <- 1:3 names(pm) <- as.character(paste0('m', 1:3)) expand.grid(paste0('m', 1:3), paste0('m', 1:3)) -> foo tib <- tibble::tibble(marker1 = as.character(foo[ , 1]), marker2 = as.character(foo[ , 2])) tib$ll <- rgamma(9, 5) add_pmap(tib, pm) -> tib_pm assemble_profile_tib(tib = tib_pm, trace = "profile1")#> # A tibble: 3 x 3 #> marker_position ll trace #> <int> <dbl> <chr> #> 1 1 10.9 profile1 #> 2 2 5.77 profile1 #> 3 3 3.74 profile1


I am proficient in several coding languages including HTML5, CSS3, Javascript, Bootstrap4, Java, Python and more.
I am familiar with the basic principles of UI/UX design and also experienced in some design tools such as Affinity Designer and Figma.
I am familiar with the basic principles of UI/UX design and also experienced in some design tools such as Affinity Designer and Figma.
I am great at making authentic taiwanese bubble tea (or boba), so if you ever need your bubble tea fix - you know who to call!
Find out more about my skills & experiences by downloading my resume
If you want to chat or just interested in bubble tea, feel free to drop me an email!


Set up your social
Social icons may appear on several pages throughout your site. Learn how to set them up, and control where they show up.
By Alison Hill & Eric Anderson in Theme Features
January 28, 2021
There are five places where you can choose to show social icons. Here is the tl;dr:
- site header (set in
config.toml
), - site footer (set in
config.toml
), -
homepage (set in
content/_index.md
), -
about page in the sidebar (set in
content/about/sidebar/index.md
), and -
contact page (set in
content/form/contact.md
).
Read on to learn how to set up your social icons, and how to show/hide them.
Configure social
Wherever you end up wanting to show your social icons, you’ll need to start by setting up the links in your site config.toml
file. Open that up and scroll down to the [[params.social]]
section. The start of it looks like this:
[params]
<!--snip snip-->
# Social icons may appear on your site header, footer, and other pages
# Add as many icons as you like below
# Icon pack "fab" includes brand icons, see: https://fontawesome.com/icons?d=gallery&s=brands&m=free
# Icon pack "fas" includes solid icons, see: https://fontawesome.com/icons?d=gallery&s=solid&m=free
# Icon pack "far" includes regular icons, see: https://fontawesome.com/icons?d=gallery&s=regular&m=free
[[params.social]]
icon = "github" # icon name without the 'fa-'
icon_pack = "fab"
url = "https://github.com/apreshill/apero"
[[params.social]] <!--lather, rinse, repeat-->
For each link, you’ll need to start a new portion that begins with [[params.social]]
. Then, pick your icon
and icon_pack
from the
Font Awesome free icon library:
-
Icon pack “fab” includes brand icons
-
Icon pack “fas” includes solid icons
-
Icon pack “far” includes regular icons
Finally, add the url
that you would like users to go to when they click on that icon. All external links (i.e., those that start with http
) will open in a new tab (that is, target="_blank"
); relative links to pages within the site will open in the same window.
Now you should be all set to show/hide your social icons. Each of these will pull the social icons and urls from the settings you just created in your site configuration file.
Show social in site header and footer
Let’s start with the header and footer, as those are site-wide. Open up your site config.toml
file again and scroll down to the [params]
section (it is actually 🆙 from where you configured these icons):
[params]
<!--snip snip-->
# show/hide social icons in site header & footer
# configure social icons and links below in [[params.social]]
socialInHeader = false
socialInFooter = true
That was easy!
Show social in homepage
Open up content/_index.md
. That file’s YAML controls what you see on the homepage. Set show_social_links
like so:
show_social_links: true # specify social accounts in site config
If you set this to true
to show the icons on the homepage, your social icons in the footer will not show up even when you set socialInFooter = true
, so as not to litter your site with too many icons.
Show social in about page sidebar
Open up content/about/sidebar/index.md
. That file’s YAML controls what you see in the sidebar on the about page. Set show_social_links
like so:
show_social_links: true # specify social accounts in site config
Show social in contact page
You may use the YAML for your contact page (located in content/form/contact.md
):
---
show_social_links: true # specify social accounts in site config
---


Toggle navigation
Project name
Home
About
Contact
Toggle navigation
Welcome
Education
Resume
Contact
Hello World!
This is Ninel
About Section
Education Section
Resume
Contact Section


The story that I was in an interview
It was a sunny day. I went to the company to have an interview. The job that I applied for is a Data Scientist.
The requirements of the role were very strict. The candidates had to know knowledge of Python, R, SQL, Java, C++, JavaScript, etc.
I introduced myself at first. I went through my resume and talked about my personality and the fields that I'm interested in. Then the interviewer gave me a code test. It was difficult but I finished it well. I was happy. The recruiter was very happy too. After a thirty minutes, we ended the interview. Then I was asked to go home and to wait for them to make a decision.
After two days, I received an email. The email was from that company. It was an offer. The salary is very high. I'm so excited. I'm proud of myself!


--- title: Our Story hero:
We are creatives. Our interests are varied. We enjoy working on new projects with different materials. We hope our passion for quality shows through in our work.
We enjoy snark and hope you do, too. Get in touch with your sarcasm. It feels good... and it funny, too.
We like to keep designs fresh, which often means keeping things plain and simple.


Upload your grid’s css-gridish.json to check the alignment of a webpage.
Press CTRL+G to toggle your grid, CTRL+L to toggle your layout.
Note: Refreshing already open webpages is necessary after installing CSS Gridish.
Change grid by uploading new css-gridish.json:


Jcrop
/
Demos
/
CSS Styling Example
CSS Styling Example
Manipulate classes
jcrop-light
jcrop-dark
normal
Example styling tricks.
Click the buttons above to change the appearance of Jcrop in real-time.


Infinispan 8.2 Release Notes
Core
- Staggered remote gets
- Continued internals refactoring
- Synchronous consistent hashing is now the default
- Initial cluster size configuration
- Performance and memory allocation-rate improvements
Indexing and Query
- Explicit indexed entity configuration
- Hibernate Search 5.6 Alpha and Lucene 5.5
- Unified continuous query API between embedded and remote
- Experimental index affinity
API
- New lambda-aware clustered executor to replace distributed executor
Infinispan Server
- Server base upgraded to WildFly 10
- Queryable event logger
- More complete management ops for schemas and scripts
Management and monitoring
- Persistent login session which survives refresh
- Deployment / undeployment of user code
- Management of ProtoBuf schemas for indexing
- Management of scripts for task execution
- Event viewing
- Much improved cache and template configuration
- Container configuration
- Cross-site replication management
Server tasks
- Deployable tasks
- Alternate data-types for input/output for cross-language compatibility


[§658H-10] Participation in mediation. An attorney or other individual designated by a party may accompany the party to and participate in a mediation. A waiver of participation given before the mediation may be rescinded. [L 2013, c 284, pt of §1]


--- layout: post title: Associations aren't :dependent => true anymore categories: - documentation author: marcel published: true date: 2006-04-28 16:46:00.000000000 +01:00 ---
Up until the 1.1 release, the way to automatically destroy has_many
associations when the owner was itself destroyed was to either use the :dependent
or :exclusively_dependent
option when declaring the has_many
.
class Account < ActiveRecord::Base
has_many :members, :dependent => true
end
or
class Brand < ActiveRecord::Base
has_many :products, :exclusively_dependent => true
end
The :dependent option instantiated all the associated objects and called destroy on each one. Destroy in turn triggers the callbacks defined on that associated model, such as those declared with before_destroy
and after_destroy
.
The :exclusively_dependent
option, on the other hand, did not instantiate all the associated objects. Rather, it just generated a single SQL statement which deleted the associated records without first creating objects for each one. This buys you efficiency when you have no need for the flexibility of triggering model callbacks.
Since 1.1, the API for garbage collecting associated records has been consolidated into the :dependent
option. Rather than saying :dependent => true
, you now pass one of several symbols to the :dependent
option which describes how the association is dependent on the owner.
Declaring the has many as :dependent => :destroy
is the same as what used to be declared as :dependent => true
. When the owner is destroyed, all the associated records are instantiated and destroyed.
class Account < ActiveRecord::Base
# Deprecated
# has_many :members, :dependent => true
# In favor of
has_many :members, :dependent => :destroy
end
The new way to achieve the now deprecated :exclusively_dependent
configuration is to use :dependent => :delete_all
rather than :dependent => :destroy
.
class Brand < ActiveRecord::Base
# Deprecated
# has_many :products, :exclusively_dependent => true
# In favor of
has_many :products, :dependent => :delete_all
end
The :destroy
and :delete_all
option symbols are so named because they correspond with the behavior achieved by calling destroy
versus delete
on a model object. One triggers callbacks, the other just generates the delete SQL statement.
As an aside, another valid option is :dependent => :nullify
which is similar to :dependent => :delete_all
except rather than deleting the associated records, it just sets their foreign keys to NULL
. This effectively removes the association, without removing the associated records from the database table.
As always, the semantics of :dependent => :destroy
and :dependent => :delete_all
are mutually exclusive, which this new API makes a bit more apparent.
It should be noted that declaring dependencies is not required when setting up has many associations. It is simply an option for when you desire such functionality.
Keep in mind that for now :dependent => true
and :exclusively_dependent => true
will still be supported, but they have been marked as deprecated and could be taken out in the future.


| ||||||||||||||||||||
OpenSSL and FIPS 140-2 Validation StatusThe most recent open source based validation of a cryptographic module (Module) compatible with the OpenSSL libraries is v2.0.1, FIPS 140-2 certificate #1747. This Module is documented in the 2.0 User Guide. It substantially updates and improves the earlier v1.2 module, FIPS 140-2 certificate #1051, which is documented in the 1.2 User Guide.Important Note: Due to new requirements introduced in 2013 the current v2.0 Module is no longer suitable as a reference for private label validations; see the I.G. 9.5 FAQ. Due to earlier changes in the FIPS 140-2 validation requirements the v1.2 Module is no longer be a suitable model for private label validations in its current form past the year 2010; see the NIST Notices, discussion paper and Draft 800-131.
The 2.0 ValidationOn January 4, 2011 we began work on the new open source FIPS 140-2 Level 1 validation. This validation covers most of the objectives we have been wanting to achieve in a new validation, including:
Current StatusThe validation was awarded on June 27, 2012, certificate number #1747. The source code and User Guide document can be downloaded from the OpenSSL web site. On July 9, 2012 the first "change letter" update was approved, adding six additional platforms and a new revision number of 2.0.1. The revised source code can be used for all tested platforms, though the older 2.0 source distribution remains valid for the platforms tested at that time. On October 24, 2012, the second "change letter" update was approved, adding two additional platforms and a new revision number of 2.0.2. The revised source code can be used for all tested platforms, though the older 2.0 and 2.0.1 revisions remain valid for the platforms tested at the time those revisions were approved.SponsorsThe OpenSSL Software Foundation receives support from multiple sources for each validation effort; however only those sponsors who have elected to be recognised for their contribution to OpenSSL are listed below.
If you have an interest in sponsoring any changes or additions to this validation please contact the OSF. Some commercial software vendors ask us "what do we gain from sponsoring a validation that our competition can also use?". Our answer is "nothing, if you think in terms of obstructing your competition". If, on the other hand, you compete primarily on the merits of you products what others may do with the validation is less of a threat as they derive no more advantage from it than you do. Your advantage is that your sponsorship will probably cost less that the commercial software license you would otherwise have to buy, and you will retain backwards compatibility with the regular OpenSSL API while avoiding vendor lock-in. | ||||||||||||||||||||


Once the installation is completed the (shiny) app can be started locally which is described below.
If you start the app for the first time you need to set the parameter “use_live_data = TRUE”, so that the:
Latest operational data is downloaded from the mySQL Database and
Analytics data is imported from the file ‘analytics.xlsx’ (see Installation, Step 4.2)
aquanes.report::run_app(use_live_data = TRUE)
This step also always needs to be performed in case you want to import the latest operational and analytical data!
If you start the app for at least a second time (i.e. after having at least once performed step 5.1) and do not need up-to-date operational and analytical data, it is sufficient to run the following code (i.e. with “use_live_data = FALSE”):
aquanes.report::run_app()


Demo of integrating traditional and realtime views
This view uses a combination of generic list and form views, to handle
changes in the traditional request/response cycle.
In this version, backbone is used to structure the
app on the page, and changes are synced back to the server via ajax calls
to Django Rest Framework resources.
The main demo. This uses the notion of a collection with
predicates on the server, connected to socketio through redis-pubsub to provide
a fully duplex and realtime web experience. Because the collections are integrated
with Django's model signals, they propogate model changes made through other channels.
{% endblock %}


{{data.firstName}} is a {{data.jobTitle}} who loves video games, electronics, the Internet, and new technologies. Even though {{data.firstName}} loves most parts of his job, he strongly disliked {{data.tediousTask}} and {{data.dirtyTask}}. So,
{{data.firstName}} met with his life mentor {{data.celebrity}} who encouraged him to learn how {{data.uselessSkill}} from free night classes by the technical user group at his local library.
The library user group did not have a course on {{data.uselessSkill}}, but they did have an excellent free course on game development entitled "HTML5 Game Development from Scratch to Fancy Portfolio ~ Be Job Ready in 3 Months", so {{data.firstName}} did that course instead.
"A most excellent decision!" {{data.firstName}} thought while looking at the new sports car he bought from his new job. With his new game development skills, {{data.firstName}} created and programmed a(n) {{data.adjective}} A.I. based robot named {{data.obnoxiousCelebrity}} that not only loved doing {{data.dirtyTask}}, but did it {{data.hugeNumber | number}} times faster.


Previous requests are displayed below. Click on the 'Information' icon to view additional information (including the service responses). Click on the column headers to sort.
Total number of requests: {{numberOfEntries}}
| Date | Request URL | Type | Response Time | Actions |
|---|---|---|---|---|
| Loading... | ||||
| There are no entries to display. | ||||
| {{row.date | date:dateFormat}} | {{row.request}} | {{row.method | uppercase}} | {{row.timer / 1000}} seconds | |


I am currently taking a year in industry placement at zing.dev; I Study Computer Science (Artificial Intelligence) MSci at the Royal Holloway University of London. I am from West Sussex but was born in Byron Bay, Australia. I enjoy playing badminton, the Rubix cube and all things computing especially AI and computer graphics!
This is my website where I post some of my projects. I have made a range of different programs from games to AI to beat them. I hope you find them interesting.


Do you want to get in touch or talk about a project?
Write me<EMAIL_ADDRESS>or drop me the line:


{{buckets | toString: 'name'}}
{{ [1,2,3,4] | toString }}
{{buckets | sortBy: 'name' | json}}
{{ [7,1,2,3,4] | sortBy }}
{{'hello how are you?' | capitalize }}
{{'HELLO, HOW ARE YOU?' | lowercase }}
{{'hello, how are you?' | uppercase }}
{{'hello how are you?' | replace:'hello':'hey' }}


A set of math functions has been developed for use within the GrADS scripting language. Their use is somewhat self-explanatory, based on the following descriptions of the arguments and return codes.
else if (cmpwrd(name,"math_sqrt")) rc = gsfmath(pcmn,8);
else if (cmpwrd(name,"math_abs")) rc = gsfmath(pcmn,9);
rc = math_trigfunc(angle <,angle2> )
trigfunc
sin, cos, tan, asin, acos, atan, atan2,
sinh, cosh, tanh, asinh, acosh, or atanhangle
must be given in radians
angle2
(only used for atan2) rc
the result of
the trig function calculation
rc = math_format(format,num)
format
a C-language style format
statement for a floating point number, e.g. %5.2f
num
the number
to be formattedrc
the formatted
number
rc = math_nint(num)
num
a real number
in decimal formrc
num
rounded up or down to the nearest integer
rc = math_int(num)
num
a real number
in decimal formrc
the integer
part of num
not greater than num
rc = math_log(num);
num
any number
> 0rc
natural logarithm
of num
rc = math_log10(num);
num
any number
> 0.0rc
base 10 logarithm of num
rc = math_pow(num,exponent);
num
any number
exponent
any number
rc
num
raised to the power exponent
rc = math_sqrt(num)
num
any numberrc
the square root
of num
rc = math_abs(num)
num
any numberrc
the absolute
value of num
rc = math_exp(num)
num
any numberrc
the result of
the exponential function; e
raised to the power num
rc = math_fmod(num1,num2);
num1
any numbernum2
any number not
equal to zerorc
the remainder
when num1
is divided by num2
rc = math_mod(num1,num2);
num1
any numbernum2
any number not
equal to zerorc
the integer
part of the remainder when num1
is divided by num2
rc = math_strlen(string)
string
any string variablerc
the length of string
rc = valnum(string)
string
any string variablerc 0 - string
is not a number 1 -
string
is an integer 2 -
string
is not an integer
rc = wrdpos(string,int)
string
any string, usually contains more than one wordint
an integerrc
word #int
string
starts at this character #
These math functions will only work with GrADS version 1.8 (or higher).
These script records were taken from a sample script called "script_math_demo.gs".
v = 3.1456
fmt = '%-6.1f'
rc = math_format(fmt,v)
say fmt' of 'v' = 'rc
pi = 3.1415926
d2r = pi/180
angd = 45
ang = angd * d2r
cos = math_cos(ang)
say 'cos of 'angd' = 'cos
num = '3.1455'
rc = valnum(num)
if (rc = 0) ; say num' is not a number' ; endif
if (rc = 1) ; say num' is an integer' ; endif
if (rc = 2) ; say num' is not an integer' ; endif
v = 3.0
while(v < 4.0)
rc1 = math_nint(v)
rc2 = math_int(v)
print 'nint of 'v' = 'rc1' int of 'v' = 'rc2
v = v + 0.1
endwhile
pow = math_pow(2,0.5);
print '2 raised to the power 0.5 = 'pow
num = math_exp(1)
print 'exp(1) = 'num
fmod = math_fmod(5,2)
print '5 modulo 2 (the remainder when 5 is divided by 2) = 'fmod
s = 'this is a test'
rc = math_strlen(s)
print 'length of the string "'s'" = 'rc
p = 2
rc = wrdpos(s,p)
print 'word 'p' of the string "'s'" starts at character 'rc


|
|||||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES |
See:
Description
| Interface Summary | |
|---|---|
| Debug.LevelId | Provides access to raw level value. |
| Length | Gets the length of the object. |
| Offset | Gets an offset for the object. |
| Timeout | The Interface Timeout. |
| Class Summary | |
|---|---|
| BlockingQueuePump<T> | The Class BlockingQueuePump. |
| DataUtils | Various data manipulation utilities. |
| Debug | Specialized debug class that provides debugging and tracing services. |
| ExpandableString | A special string that allows easy expandibility within it. |
| HoldQueue<T,C> | The Class HoldQueue. |
| HoldQueue.HoldHandle<C> | The Class HoldHandle. |
| JEvent | An event object and event related utilities. |
| JLogger | Java Logging mechanism. |
| JNetPcapFormatter | The Class JNetPcapFormatter. |
| JPacketSupport | A utility class that dispatches a JPacket to any number of listeners. |
| JStringBuilder | Subclassible delagate StringBuilder class. |
| JThreadLocal<T> | The Class JThreadLocal. |
| PcapPacketArrayList | The Class PcapPacketArrayList. |
| PcapPacketSupport | A utility class that dispatches a PcapPacket to any number of listeners. |
| SlidingBuffer | The Class SlidingBuffer. |
| TimeoutQueue | The Class TimeoutQueue. |
| Units | The Class Units. |
| Enum Summary | |
|---|---|
| Debug.Level | Defines various message severity levels. |
Various support utility methods.
|
|||||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES |


You will learn Test Automation New Line-1 New Line-2 New Line-3 New Line-4
Web Section 2 Selenium Section 2


@*
* This template is called from the `index` template. This template
* handles the rendering of the page header and body tags. It takes
* two arguments, a `String` for the title of the page and an `Html`
* object to insert into the body of the page.
*@
@import models.book.Book
@import utils.Pair
@import models.deliverypoint.DeliveryPoint
@(books:List[Book], selectedBook:Book, selectedDeliveryPoint:DeliveryPoint, deliveryPointAmount:List[Pair[DeliveryPoint,Long]])
@main("Instances"){


About Shelly
Objective
To obtain an entry level position that will allow me to strengthen my technical skills and utilize my project management experience.
Employment History
- Operations Manager
- Product Coordinator
- Global Systems Analyst
- International Projects Coordinator
Education
Southwestern University
Georgetown, TX, May 2007
B.A. in Psychology, minor in Spanish
Hobbies & Interests
- Traveling
- Running
- Hiking
- Cooking
Top Ten Places I Want to Visit
- Iceland
- Australia
- New Zealand
- Japan
- Chicago
- Hawaii
- Peru
- Costa Rica
- Alaska
- Fiji


Chewsr is an app that helps a user explore the many different type of food places nearby when you get tired of the same, usual, common place. Chewsr has a wide spectrum of places of choose from and all at very close local range. Directions are very simple. First tell the app you general location or the location you want to get food at. Then adjust the range of radius the app will pick up. After that choose the type of food you are craving and it will randomize your choices within that range you are looking for. Now go and have fun trying out the many different typees of food your community has to offer.


If you are viewing this through RawGit and seeing an older version it is probably cached via the CDN. You can try http://rawgit.com/jdarling/d3rrc/master/examples/index.html for the most up to date version.


Joker: Michael Mann Pens Letter Praising Todd Phillips' Film
by Colin HicksonWhile Joker director and co-writer Todd Phillips admits his DC film may not be for everyone, it has certainly made a name for itself -- even becoming the first R-rated movie to reach $1 billion at the global box office. Filmmaker Michael Mann -- whose 1995 film Heat was an inspiration for Christopher Nolan's The Dark Knight -- even penned a letter to Phillips and those involved, praising the movie.
Per IndieWire, the letter was read to Phillips by fellow filmmaker Scott Cooper before a Q&A session with Phillips began. Due to a scheduling conflict, however, Mann could not appear to interview Phillips.
Click the button below to start this article in quick view.
"I love this movie," Mann's said of Joker in his letter. "I think it’s brilliant and not only Todd’s best film but it’s exciting because it’s on a frontier. And that’s usually where very good things happen. Todd and Scott [Silver’s] screenplay has that relevance that occurs when work is authentic and not derivative. We find Arthur [Fleck, the Joker] disturbing and poignant simultaneously. He’s both child victim and adult perpetrator. Both are true, as is the case with most schizophrenics. That both are true is uncomfortable. We find ourselves in a fugue state. It’s counterpoint. It’s why Arthur and the film’s impact sustains so strongly in memory. To build on all of this, and for Joaquin, Todd and Scott, to impact upon on this powerfully is a difficult accomplishment. Congratulations, Todd!"
Phillips was, of course, amazed by this. "That’s amazing to hear a letter from Michael Mann,Phillips said. "I’m such a huge Michael Mann fan. He knows that, we’ve spoken about it."
Directed by Todd Phillips, Joker stars Joaquin Phoenix, Robert De Niro, Zazie Beetz, Bill Camp, Frances Conroy, Brett Cullen, Glenn Fleshler, Douglas Hodge, Marc Maron, Josh Pais and Shea Whigham. The film is now in theaters.
https://schema.orgBreadcrumbListListItem1Homehttps://www.cbr.com/ListItem2Movieshttps://www.cbr.com/category/movies/ListItem3Movie Newshttps://www.cbr.com/category/movies/news-movies/ListItem4Joker: Michael Mann Pens Letter Praising Todd Phillips' Filmhttps://www.cbr.com/joker-michael-mann-letter-todd-phillips/


{{ slogan }}
We've embraced inclusivity since 2002 and now, with your help, we're expanding Game Jolt to incorporate AAA games to our niche indie community.
We've created a unique platform for AAA studios and non-indie publishers. Members will vote on your games in the Redlight program to judge if they're good enough quality to be redlit and part of Game Jolt.
Create a Game Jolt account yourself directly. No need for an account manager. Finally!
Upload your game directly and add #redlight
to your description.
Let your fans know that you're on Redlight and require their help directly.
Redlight simultaneously prevents our marketplace from becoming overly saturated while maintaining the high standards our users have come to expect from a Game Jolt game.
Do you love indie games, but also love AAA? Do you have a massive library of games built up on Game Jolt and don't want to use other platforms for your AAA content?
Help us spread the word! Tweet at all your favorite game publishers and AAA studios. Get them on board. Join the #REDLIGHT movement.
We sent out an email to all the top players. No one has gotten back to us yet. We will update here when they do.
Game Jolt Redlight is a system that enlists the community's help in choosing new games to be released on Game Jolt. Publishers and AAA studios upload their games to seek a critical mass of community support in order to get selected for distribution.
AAA studios and non-indie publishers looking to expand their audience to niche indie gamers.
Go tell your friends; be super annoying about it.
Games only. So don't try to upload your desktop application.
#redlight
to your game page descriptionYou must have distribution rights for the game.
Pay influencers to talk about it constantly. Make sure they include the Redlight link at the beginning, middle, and end of their videos. And in their descriptions. And in their twitter bios.
It's a completely new and unique system. Games are ranked by the number of up-votes from the community. Once your game is submitted, you will receive an e-mail at the address associated with your account, notifying you when Redlit.
For the initial months, we've decided to waive the $5,000-$10,000 submission fee. We'll continue discussing this internally to see if we should add a few extra zeros in there. This is obviously for QA reasons. Only people who make good games have money.


Your OpenShift DevOPs platform installed by Cegeka. Deploy cloud-ready applications fast in containers using the OpenShift self-service portal.
We've listed a few for you.
Interactive Learning Scenarios provide you with a pre-configured OpenShift® instance, accessible from your browser without any downloads or configuration. Use it to experiment, learn OpenShift and see how we can help solve real-world problems.
Learn new technologies using real environments right in your browser.
Whether you are a developer or a platform administrator, you can get started with OpenShift using the topics in this book.
We've watched Bootstrap grow up over the years and understand it better than almost anyone.
Deploy cloud-ready applications fast in containers using the OpenShift self-service portal. Convert into a process and culture where operators enable developers to test, deploy, and send new apps to production in the same day.
On-premise Cloud


{% extends "document_download_template.html" %} {% block main_content %}
{{ _('Save your file somewhere you can find it. You may need to print it or show it to someone later.') }}
{{ _('Check the email that') }} {{ service_name or '[SERVICE_NAME]'}} {{ _('sent you for more information.') }}
{{ _('Download this file to your device') }}
{{ _('If you have any questions,') }} {% if contact_info_type == "link" %} {{ _('contact') }} {{ service_name }}. {% elif contact_info_type == "email" %} {{ _('email') }} {{service_contact_info}}. {% else %} {{ _('call') }} {{ service_contact_info }}. {% endif %}
{% endblock %}


|
Games Task Scheduler (GTS)
A multi-processor scheduling framework for games engines
|
Classes | |
| struct | gts::numericLimits< T > |
| The root template for numeric limits. More... | |
| struct | gts::numericLimits< uint32_t > |
| The numeric limits for uint32_t. More... | |
| struct | gts::numericLimits< uint64_t > |
| The numeric limits for uint64_t. More... | |
| struct | gts::numericLimits< int32_t > |
| The numeric limits for int32_t. More... | |
| struct | gts::numericLimits< int64_t > |
| The numeric limits for int64_t. More... | |
| struct | gts::IsPow2< T, val > |
| A power of 2 type trait. More... | |
| class | gts::OwnedId |
| An ID for owned objects. It indicates the owner's ID, an ID local to the owner, and an overall unique ID. More... | |
| struct | gts::MurmurHash< TKey > |
| The base murmur hash functor. More... | |
| struct | gts::MurmurHash< float > |
| The float specialized murmur hash functor. More... | |
| struct | gts::MurmurHash< double > |
| The double specialized murmur hash functor. More... | |
| struct | gts::MurmurHash< char * > |
| The c-string specialized murmur hash functor. More... | |
| struct | gts::MurmurHash< TKey * > |
| The pointer specialized murmur hash functor. More... | |
Typedefs | |
| using | gts::IdType = uint32_t |
| The type used to identify an object. | |
| using | gts::SubIdType = uint16_t |
| The sub type stored in IdType. | |
Functions | |
| template<typename T > | |
| constexpr T | gts::gtsMax (T const &lhs, T const &rhs) |
| Calculates the max of lhs and rhs. More... | |
| template<typename T > | |
| constexpr T | gts::gtsMin (T const &lhs, T const &rhs) |
| Calculates the min of lhs and rhs. More... | |
| template<typename T > | |
| constexpr bool | gts::isPow2 (T value) |
| Checks if value is a power of 2. More... | |
| constexpr GTS_INLINE uint16_t | gts::nextPow2 (uint16_t value) |
| Calculates the next 16-bit power of 2 if value is not a power of 2. More... | |
| constexpr GTS_INLINE uint32_t | gts::nextPow2 (uint32_t value) |
| Calculates the next 32-bit power of 2 if value is not a power of 2. More... | |
| constexpr GTS_INLINE uint64_t | gts::nextPow2 (uint64_t value) |
| Calculates the next 64-bit power of 2 if value is not a power of 2. More... | |
| template<typename TInt > | |
| GTS_INLINE TInt | gts::log2i (TInt const &integral) |
| Calculates log2 a integer. More... | |
| template<> | |
| GTS_INLINE int64_t | gts::log2i (int64_t const &integral) |
| Specialization to calculate the log2 a signed 64-bit integer. More... | |
| template<> | |
| GTS_INLINE uint64_t | gts::log2i (uint64_t const &integral) |
| Specialization to calculate the log2 a unsigned 64-bit integer. More... | |
| GTS_INLINE uint32_t | gts::fastRand (uint32_t &state) |
| Generates a pseudo random number using xor shift algorithm on 'state'. More... | |
| GTS_INLINE bool | gts::isAligned (void *ptr, size_t alignmentPow2) |
| Checks if ptr is aligned to the boundary alignmentPow2. More... | |
| GTS_INLINE uintptr_t | gts::alignDownTo (uintptr_t ptr, size_t alignment) |
| Aligns ptr down to the next alignment boundary. More... | |
| GTS_INLINE uintptr_t | gts::alignUpTo (uintptr_t ptr, size_t alignment) |
| Aligns ptr up to the next alignment boundary. More... | |
| GTS_INLINE uint32_t | gts::murmur_hash3 (uint32_t key) |
| GTS_INLINE uint64_t | gts::murmur_hash3 (uint64_t key) |
| GTS_INLINE uint32_t | gts::murmur_hash3 (const void *key, uint32_t len, uint32_t seed=12345) |
| template<typename TResult , typename TFunc , typename... TArgs> | |
| GTS_INLINE TResult | gts::invoke (TFunc &&func, TArgs &&... args) |
| A simple function invoker. | |
| template<typename Value , typename TCompareFunc > | |
| GTS_INLINE void | gts::insertionSort (Value *values, size_t numValues, TCompareFunc fcnComp) |
| Simple insertion sort implementation. | |
Variables | |
| constexpr IdType | gts::UNKNOWN_UID = UINT32_MAX |
| The value of an unknown IdType. | |
| constexpr SubIdType | gts::UNKNOWN_SUBID = UINT16_MAX |
| The value of an unknown SubIdType. | |
A set of utility functions.
| GTS_INLINE uintptr_t gts::alignDownTo | ( | uintptr_t | ptr, |
| size_t | alignment | ||
| ) |
Aligns ptr down to the next alignment boundary.
| GTS_INLINE uintptr_t gts::alignUpTo | ( | uintptr_t | ptr, |
| size_t | alignment | ||
| ) |
Aligns ptr up to the next alignment boundary.
| GTS_INLINE uint32_t gts::fastRand | ( | uint32_t & | state | ) |
Generates a pseudo random number using xor shift algorithm on 'state'.
|
constexpr |
Calculates the max of lhs and rhs.
|
constexpr |
Calculates the min of lhs and rhs.
| GTS_INLINE bool gts::isAligned | ( | void * | ptr, |
| size_t | alignmentPow2 | ||
| ) |
Checks if ptr is aligned to the boundary alignmentPow2.
|
constexpr |
Checks if value is a power of 2.
| GTS_INLINE int64_t gts::log2i | ( | int64_t const & | integral | ) |
Specialization to calculate the log2 a signed 64-bit integer.
| GTS_INLINE TInt gts::log2i | ( | TInt const & | integral | ) |
Calculates log2 a integer.
| GTS_INLINE uint64_t gts::log2i | ( | uint64_t const & | integral | ) |
Specialization to calculate the log2 a unsigned 64-bit integer.
| GTS_INLINE uint32_t gts::murmur_hash3 | ( | const void * | key, |
| uint32_t | len, | ||
| uint32_t | seed = 12345 |
||
| ) |
| GTS_INLINE uint32_t gts::murmur_hash3 | ( | uint32_t | key | ) |
| GTS_INLINE uint64_t gts::murmur_hash3 | ( | uint64_t | key | ) |
|
constexpr |
Calculates the next 16-bit power of 2 if value is not a power of 2.
|
constexpr |
Calculates the next 32-bit power of 2 if value is not a power of 2.
|
constexpr |
Calculates the next 64-bit power of 2 if value is not a power of 2.


.
|
Constructors and initialization |
| | SetView (void) |
| | Default constructor.
|
| | SetView (const SetVar &x) |
| | Initialize from set variable x.
|
| | SetView (SetVarImp *x) |
| | Initialize from set variable x.
|
| | SetView (Space *home, const Reflection::VarMap &vars, Reflection::Arg *arg) |
| | Initialize from specification.
|
Value access |
| unsigned int | cardMin (void) const |
| | Return minimum cardinality.
|
| unsigned int | cardMax (void) const |
| | Return maximum cardinality.
|
| int | lubMin (void) const |
| | Return minimum of the least upper bound.
|
| int | lubMax (void) const |
| | Return maximum of the least upper bound.
|
| int | lubMinN (int n) const |
| | Return n-th smallest element of the least upper bound.
|
| int | glbMin (void) const |
| | Return minimum of the greatest lower bound.
|
| int | glbMax (void) const |
| | Return maximum of the greatest lower bound.
|
| unsigned int | glbSize (void) const |
| | Return the number of elements in the greatest lower bound.
|
| unsigned int | lubSize (void) const |
| | Return the number of elements in the least upper bound.
|
| unsigned int | unknownSize (void) const |
| | Return the number of unknown elements.
|
Domain tests |
| bool | assigned (void) const |
| | Test whether view is assigned.
|
| bool | contains (int i) const |
| | Test whether i is in the greatest lower bound.
|
| bool | notContains (int i) const |
| | Test whether i is not in the least upper bound.
|
Domain update by value |
| ModEvent | cardMin (Space *home, unsigned int m) |
| | Restrict cardinality to be greater than or equal to m.
|
| ModEvent | cardMax (Space *home, unsigned int m) |
| | Restrict cardinality to be less than or equal to m.
|
| ModEvent | include (Space *home, int i, int j) |
| | Update greatest lower bound to include all elements between and including i and j.
|
| ModEvent | exclude (Space *home, int i, int j) |
| | Restrict least upper bound to not contain all elements between and including i and j.
|
| ModEvent | include (Space *home, int i) |
| | Update greatest lower bound to contain i.
|
| ModEvent | exclude (Space *home, int i) |
| | Restrict least upper bound to not contain i.
|
| ModEvent | intersect (Space *home, int i, int j) |
| | Update least upper bound to contain at most all elements between and including i and j.
|
| ModEvent | intersect (Space *home, int i) |
| | Update least upper bound to contain at most the element i.
|
Domain update by range iterator |
| template<class I> |
| ModEvent | excludeI (Space *home, I &i) |
| | Remove range sequence described by i from least upper bound.
|
| template<class I> |
| ModEvent | includeI (Space *home, I &i) |
| | Include range sequence described by i in greatest lower bound.
|
| template<class I> |
| ModEvent | intersectI (Space *home, I &iter) |
| | Intersect least upper bound with range sequence described by i.
|
Cloning |
| void | update (Space *home, bool share, SetView &x) |
| | Update this view to be a clone of view x.
|
Reflection |
| Reflection::Arg * | spec (const Space *home, Reflection::VarMap &m) const |
| | Return specification for this view, using variable map m.
|
| static Support::Symbol | type (void) |
| | Return specification for this view, using variable map m.
|
Delta information for advisors |
| int | glbMin (const Delta *d) const |
| | Return minimum value just pruned from glb.
|
| int | glbMax (const Delta *d) const |
| | Return maximum value just pruned from glb.
|
| bool | glbAny (const Delta *d) const |
| | Test whether arbitrary values got pruned from glb.
|
| int | lubMin (const Delta *d) const |
| | Return minimum value just pruned from lub.
|
| int | lubMax (const Delta *d) const |
| | Return maximum value just pruned from lub.
|
| bool | lubAny (const Delta *d) const |
| | Test whether arbitrary values got pruned from lub.
|
| static ModEvent | modevent (const Delta *d) |
| | Return modification event.
|
Related Functions |
(Note that these are not member functions.)
|
| std::ostream & | operator<< (std::ostream &, const Gecode::Set::SetView &) |
| | Print set variable view.
|


- Idée, conception, programmation et mise en page
- François Moreau
- Idée et tests
- Xavier Moreau, 7 ans
- Graphisme
-
- Kenney
- Musique
- FoolBoyMedia, Shanty Town
- Lemoncreme, Groove Music
- joshuaempyre, Arcade Music Loop
- Effets sonores
- suntemple, Retro "Accomplished" SFX
- suntemple, Retro "You Lose" SFX
- zeuss, The Chime
Ce jeu est publié en
source libre sous la licence MIT :
The MIT License (MIT)
Copyright © 2015 François Moreau
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.
 IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.


Books list
Book ID
Book name
Author
Summary in para
Summary in line
Date/time
{% for u in user%}
{{u.id}}
{{u.book_name}}
{{u.author}}
{{u.summary_p}}
{{u.summary_l}}
{{u['date_created']}}
{% endfor%}
Add book
Delete book


Username
First Name
First Name
Password
Valid password should contain at least 8 characters.
Confirm Your Password
Submit


the DER format Buffer of this ASN.1 object.
the well parsed value of this ASN.1 object. It will be boolean, number, string, BitString, Date, array of ASN.1 objects and so on.
Returns true if two ASN.1 objects equally.
another ASN.1 object.
Expecting it is compound ASN.1 object and returns an array of sub ASN.1 objects.
error message to throw when it is not compound ASN.1 object.
Converts this ASN.1 object to a buffer of bytes in DER format.
Return a friendly JSON object for debuging.
Validates that the given ASN.1 object is at least a super set of the given ASN.1 structure. Only tag classes and types are checked. An optional map may also be provided to capture ASN.1 values while the structure is checked.
To capture an ASN.1 object, set an object in the validator's 'capture' parameter to the key to use in the capture map.
Objects in the validator may set a field 'optional' to true to indicate that it isn't necessary to pass validation.
Template object to validate.
Captures object to capture ASN.1 object.
Parse the value of this ASN.1 object when it is Class.UNIVERSAL. The value will be boolean, number, string, BitString, Date, array of ASN.1 objects and so on.
Creates a Tag.BOOLEAN ASN.1 object.
boolean value.
Creates an Tag.GENERALSTRING (specified in ISO-2022/ECMA-35) ASN.1 object.
general string.
Creates an Tag.GENERALIZEDTIME ASN.1 object.
date value.
Creates an Tag.IA5STRING (ASCII string) ASN.1 object.
ASCII string.
Creates a Tag.INTEGER ASN.1 object.
integer value or buffer.
Creates a Tag.NULL ASN.1 object.
Creates an Tag.NUMERICSTRING ASN.1 object.
numeric string.
Creates an Tag.OID (dot-separated numeric string) ASN.1 object.
dot-separated numeric string.
Creates an Tag.NUMERICSTRING ASN.1 object.
printable string.
Creates an Class.CONTEXT_SPECIFIC ASN.1 object.
Note: the tag means nothing with Class.CONTEXT_SPECIFIC
number.
an array of ASN.1 objects or a ASN.1 object.
when objs is a array, the isCompound will be set to true.
Creates an Tag.T61STRING (8-bit clean string) ASN.1 object.
8-bit clean string.
Creates an Tag.UTCTIME ASN.1 object.
Note: GeneralizedTime has 4 digits for the year and is used for X.509. dates past 2049. Converting to a GeneralizedTime hasn't been implemented yet.
date value.
Creates an Tag.UTF8 ASN.1 object.
utf8 string.
Parse a ASN.1 object from a buffer in DER format.
the buffer to parse.
deeply parse or not.
Parse a Tag.BITSTRING value from ASN.1 object' value.
the buffer to parse.
Parse a Tag.BOOLEAN value from ASN.1 object' value.
the buffer to parse.
Parse a Tag.GENERALSTRING string from ASN.1 object' value.
the buffer to parse.
Parse a Tag.GENERALIZEDTIME date from ASN.1 object' value.
the buffer to parse.
Parse a Tag.IA5STRING string from ASN.1 object' value.
the buffer to parse.
Parse a Tag.INTEGER value from ASN.1 object' value.
the buffer to parse.
Parse a Tag.INTEGER value as a number from ASN.1 object' value.
the buffer to parse.
Parse a Tag.INTEGER value as a hex string(for BigInt) from ASN.1 object' value.
the buffer to parse.
Parse a Tag.NULL value from ASN.1 object' value.
the buffer to parse.
Parse a Tag.UTF8 string from ASN.1 object' value.
the buffer to parse.
Parse a Tag.OID value from ASN.1 object' value.
the buffer to parse.
Parse a Tag.PRINTABLESTRING string from ASN.1 object' value.
the buffer to parse.
Parse a Tag.T61STRING string from ASN.1 object' value.
the buffer to parse.
Parse a Tag.UTCTIME date of Tag.GENERALIZEDTIME date from ASN.1 object' value.
the type.
the buffer to parse.
Parse a Tag.UTCTIME date from ASN.1 object' value.
the buffer to parse.
Parse a Tag.UTF8 string from ASN.1 object' value.
the buffer to parse.
Generated using TypeDoc
Implements parsing of DER-encoded ASN.1 data structures, as defined in ITU-T Rec X.690.
See also
A Layman's Guide to a Subset of ASN.1, BER, and DER,'' http://luca.ntop.org/Teaching/Appunti/asn1.html.
ASN.1 is a syntax for specifying abstract objects and BER, DER, PER, XER etc are different encoding formats for those objects. Here, we'll be dealing with DER, the Distinguished Encoding Rules. DER is used in X.509 because it's fast to parse and, unlike BER, has a unique encoding for every object. When calculating hashes over objects, it's important that the resulting bytes be the same at both ends and DER removes this margin of error. ASN.1 is very complex and this package doesn't attempt to implement everything by any means.
DER Encoding of ASN.1 Types: https://msdn.microsoft.com/en-us/library/windows/desktop/bb540792(v=vs.85).aspx


Reviewing
Submitting a change
Gerrit tips
Understand every line.
Be explicit.
Provide documentation.
Don't expand the scope.
Remember - You can always propose your own reviews.
Bikeshedding.
Nits
Try it out. Say what you did.
Don't take on too many reviews.
Pro Tip: Look at the code coverage report.
-1 : Needs work / bad idea
+1 : No problems
+0 : If you have a question, not willing to +1
+2 : No problems (core reviewer)
-2 : This is a bad idea (core reviewer)
Workflow+1 : Starts merging if Verify +1
Workflow-1 : Work in progress
Verify+1 : Testing says it's ok
Verify-1 : Testing failed
Prepare the submission from the perspective of a reviewer.
Use WIP (workflow -1) to push something you're working on.
Think of it as advertising why someone should look at this change (vs all the other ones).
title
-- blank line --
Answer to question: Why was the old behavior incorrect?
Answer to question: Why is the new behavior correct?
If you think a summary will help, go ahead.
References: bugs, work items, docs, etc.
"Done" button
Get on irc / slack if not clear.
Remember to publish draft responses.
Subscribe to projects.
Add yourself as reviewer.
Star reviews.
Learn querying - example
Reviewers are busy -- see gerrit for # reviews.
Help out, review other changes.
If ask for reviews, at least give a reason.


A users password must:
- Be 6 to 20 characters in length
- NOT contain whitespace
- Contain AT LEAST one UPPERCASE letter: A - Z
- Contain AT LEAST one lowercase letter: a - z
- Contain AT LEAST one number: 0 - 9
- Contain AT LEAST one special character: !@#$%^&+=


The Census Bureau does not ask questions about sexual orientation. However, responses to some questions provide data about same-sex couples. This data should not be used to draw general conclusions about gay/lesbian/bisexual Americans, but when handled with appropriate care, may still be useful for reporting.
Table B11009, Unmarried-partner Households by Sex of Partner, is the only table which provides information about people who have told the Census Bureau that they live with a partner of the same sex. As explained in the Census Bureau's Frequently Asked Questions About Same-Sex Couple Households document, responses reporting a spouse of the same sex as the house holder are changed to indicate an unmarried partner, regardless of state laws permitting same-sex marriage.
Consult the Census Bureau's documentation for more details. Specifically, American Community Survey Data on Same Sex Couples provides national-level data on the household characteristics (including income, education, etc) of same-sex couples compared to married and unmarried opposite-sex couples and married couples dating back to 2005, as well as more data and methodological details.


FPCLASSIFY
Section: Linux Programmer's Manual (3)
Updated: 2013-08-06
Index
Return to Main Contents
NAME
fpclassify, isfinite, isnormal, isnan, isinf - floating-point
classification macros
SYNOPSIS
#include <math.h>
int fpclassify(x);
int isfinite(x);
int isnormal(x);
int isnan(x);
int isinf(x);
Link with -lm.
Feature Test Macro Requirements for glibc (see
feature_test_macros(7)):
fpclassify(),
isfinite(),
isnormal():
-
_XOPEN_SOURCE >= 600 || _ISOC99_SOURCE ||
_POSIX_C_SOURCE >= 200112L;
or
cc -std=c99
isnan():
-
_BSD_SOURCE || _SVID_SOURCE || _XOPEN_SOURCE || _ISOC99_SOURCE ||
_POSIX_C_SOURCE >= 200112L;
or
cc -std=c99
isinf():
-
_BSD_SOURCE || _SVID_SOURCE || _XOPEN_SOURCE >= 600 || _ISOC99_SOURCE ||
_POSIX_C_SOURCE >= 200112L;
or
cc -std=c99
DESCRIPTION
Floating point numbers can have special values, such as
infinite or NaN.
With the macro
fpclassify(x)
you can find out what type
x
is.
The macro takes any floating-point expression as argument.
The result is one of the following values:
- FP_NAN
-
x
is "Not a Number".
- FP_INFINITE
-
x
is either positive infinity or negative infinity.
- FP_ZERO
-
x
is zero.
- FP_SUBNORMAL
-
x
is too small to be represented in normalized format.
- FP_NORMAL
-
if nothing of the above is correct then it must be a
normal floating-point number.
The other macros provide a short answer to some standard questions.
- isfinite(x)
-
returns a nonzero value if
(fpclassify(x) != FP_NAN && fpclassify(x) != FP_INFINITE)
- isnormal(x)
-
returns a nonzero value if
(fpclassify(x) == FP_NORMAL)
- isnan(x)
-
returns a nonzero value if
(fpclassify(x) == FP_NAN)
- isinf(x)
-
returns 1 if
x
is positive infinity, and -1 if
x
is negative infinity.
ATTRIBUTES
Multithreading (see pthreads(7))
The
fpclassify(),
isfinite(),
isnormal(),
isnan(),
and
isinf()
macros are thread-safe.
CONFORMING TO
C99, POSIX.1.
For
isinf(),
the standards merely say that the return value is nonzero
if and only if the argument has an infinite value.
NOTES
In glibc 2.01 and earlier,
isinf()
returns a nonzero value (actually: 1) if
x
is positive infinity or negative infinity.
(This is all that C99 requires.)
SEE ALSO
finite(3),
INFINITY(3),
isgreater(3),
signbit(3)
Index
- NAME
-
- SYNOPSIS
-
- DESCRIPTION
-
- ATTRIBUTES
-
- Multithreading (see pthreads(7))
-
- CONFORMING TO
-
- NOTES
-
- SEE ALSO
-
This document was created by
man2html,
using the manual pages.
Time: 02:55:13 GMT, September 18, 2014


It's Important to Understand 'Why suicide....?':
Increasing population, Globalisation, competition, lack of privacy problems are some reasons that are increasingly driving people to contemplate a step as extreme as suicide. Of the usual demograph, the 20-something age group seems to be the most volatile of the lot.Unrealistic goals coupled with the desire to have more never seem to end. Today I want money, then I want more money and thereafter I want even more money. Nothing is good enough, nothing is enough. And that is what frazzles their nerves and makes them fragile.Break up of the joint family system, increasing number of one parent families, nuclear families,have made parents take the easy way out- giving material gifts in the place of time, communication and emotional stability, as a result the child's coping skills are not fully developed and this makes them vulnerable to all and any stress-causing stimuli.
Youngsters suffer from a severe loss of a confidence. When they do confide their suicidal tendencies to their friends and family, the warning is usually not taken seriously and sometimes even brushed off as emotional blackmail. The affected individual feels unimportant, emotionally bruised and uncared for. And that's when the concerned individual decides to act upon the warning. The suicidal feeling can subside with emotional care, communication and concern. Callers can get emotional support for their suicidal pain, they are assured of confidentiality and anonymity. AASRA works in the area of mental health, providing emotional support, unbiased caring through a helpline service and walk-in center. AASRA mandates crisis intervention as it's primary focus through it's assorted services designed to alleviate emotional pain and in the process prevent suicides.


user authentication using mongodb
create an acount from
here
already have an acount?
log in from
here
see the users already registered


public class QuadEdge
extends java.lang.Object
Each edge object is part of a quartet of 4 edges,
linked via their rot references.
Any edge in the group may be accessed using a series of rot()
operations.
Quadedges in a subdivision are linked together via their next references.
The linkage between the quadedge quartets determines the topology
of the subdivision.
The edge class does not contain separate information for vertice or faces; a vertex is implicitly defined as a ring of edges (created using the next field).
| Modifier and Type | Method and Description |
|---|---|
static QuadEdge |
connect(QuadEdge a,
QuadEdge b)
Creates a new QuadEdge connecting the destination of a to the origin of
b, in such a way that all three have the same left face after the
connection is complete.
|
void |
delete()
Marks this quadedge as being deleted.
|
Vertex |
dest()
Gets the vertex for the edge's destination
|
QuadEdge |
dNext()
Gets the next CCW edge around (into) the destination of this edge.
|
QuadEdge |
dPrev()
Gets the next CW edge around (into) the destination of this edge.
|
boolean |
equalsNonOriented(QuadEdge qe)
Tests if this quadedge and another have the same line segment geometry,
regardless of orientation.
|
boolean |
equalsOriented(QuadEdge qe)
Tests if this quadedge and another have the same line segment geometry
with the same orientation.
|
java.lang.Object |
getData()
Gets the external data value for this edge.
|
double |
getLength()
Gets the length of the geometry of this quadedge.
|
QuadEdge |
getPrimary()
Gets the primary edge of this quadedge and its sym.
|
QuadEdge |
invRot()
Gets the dual of this edge, directed from its left to its right.
|
boolean |
isLive()
Tests whether this edge has been deleted.
|
QuadEdge |
lNext()
Gets the CCW edge around the left face following this edge.
|
QuadEdge |
lPrev()
Gets the CCW edge around the left face before this edge.
|
static QuadEdge |
makeEdge(Vertex o,
Vertex d)
|
QuadEdge |
oNext()
Gets the next CCW edge around the origin of this edge.
|
QuadEdge |
oPrev()
Gets the next CW edge around (from) the origin of this edge.
|
Vertex |
orig()
Gets the vertex for the edge's origin
|
QuadEdge |
rNext()
Gets the edge around the right face ccw following this edge.
|
QuadEdge |
rot()
Gets the dual of this edge, directed from its right to its left.
|
QuadEdge |
rPrev()
Gets the edge around the right face ccw before this edge.
|
void |
setData(java.lang.Object data)
Sets the external data value for this edge.
|
void |
setNext(QuadEdge next)
Sets the connected edge
|
static void |
splice(QuadEdge a,
QuadEdge b)
Splices two edges together or apart.
|
static void |
swap(QuadEdge e)
Turns an edge counterclockwise inside its enclosing quadrilateral.
|
QuadEdge |
sym()
Gets the edge from the destination to the origin of this edge.
|
LineSegment |
toLineSegment()
Creates a
LineSegment representing the
geometry of this edge. |
java.lang.String |
toString()
Converts this edge to a WKT two-point LINESTRING indicating
the geometry of this edge.
|
public static QuadEdge makeEdge(Vertex o, Vertex d)
o
- the origin Vertexd
- the destination Vertexpublic static QuadEdge connect(QuadEdge a, QuadEdge b)
public static void splice(QuadEdge a, QuadEdge b)
a
- an edge to spliceb
- an edge to splicepublic static void swap(QuadEdge e)
e
- the quadedge to turnpublic QuadEdge getPrimary()
Coordinate
orderingpublic void setData(java.lang.Object data)
data
- an object containing external datapublic java.lang.Object getData()
public void delete()
public boolean isLive()
public void setNext(QuadEdge next)
next
- edgepublic final QuadEdge rot()
public final QuadEdge invRot()
public final QuadEdge sym()
public final QuadEdge oNext()
public final QuadEdge oPrev()
public final QuadEdge dNext()
public final QuadEdge dPrev()
public final QuadEdge lNext()
public final QuadEdge lPrev()
public final QuadEdge rNext()
public final QuadEdge rPrev()
public final Vertex orig()
public final Vertex dest()
public double getLength()
public boolean equalsNonOriented(QuadEdge qe)
qe
- a quadegepublic boolean equalsOriented(QuadEdge qe)
qe
- a quadegepublic LineSegment toLineSegment()
LineSegment
representing the
geometry of this edge.public java.lang.String toString()
toString
in class java.lang.Object


Toggle navigation
Home
About
Taxonomy Status
Curation
Ethogram results
Nonspecific mentions
Working...
Events involving individuals
Working...


Swing is a powerful toolkit for building desktop applications, but quite often Swing gets a bad reputation for sins of the past. Many times, I've heard, "Swing is slow," "Swing is ugly," and "Swing is too hard." A lot has changed in the almost ten years since Swing was first designed. Chris Adamson and I wrote Swing Hacks to show that you can make fast, attractive, and usable applications quite easily. You just need to know a few tricks.
This article will show you six undocumented features, classes, and properties that let you hack into Swing. I've based the article on hacks that didn't make it into Swing Hacks for one reason or another. Some of them were too short to be full hacks on their own. Some didn't fit nicely into a particular chapter. Some are new things I've learned since publishing the book (technology stands still for no one). Fortunately, the internet provides a way to keep up with the latest developments. As always, please remember that undocumented features are JVM-platform-and-version-dependent. They could disappear in a new version, so use them carefully and always have backup behavior ready.
|
Related Reading Swing Hacks |
Every frame will show up in the Windows task bar with its own icon. If you are
using Windows XP, then the application icons may collapse together, but they are
still there. However, if you subclass java.awt.Window
instead of java.awt.Frame
,
then your window will not show up in the taskbar or the Alt
-Tab
hotswitcher.
This is because the window won't be registered as a full "application window"
that the operating system treats with special care. Instead, the window will be
more like a dialog box.
The disadvantage of directly subclassing Window
is
that
you won't get any window decorations. The title bar and maximize,
minimize, and
resize buttons will be missing. Even the border will be gone. However,
depending
on your use, this might not be a problem. Toolbar palettes, for
example, are
fine without borders and should properly be hidden from the taskbar.
Also, the recent trend towards mini-application development (Tiger
Dashboard, Yahoo Widgets) suggest that the lack of a title bar won't be
a problem.
Mac OS X has a graphics API called Quartz that makes it very easy to create translucency effects. This API isn't directly accessible from Java, but Apple's developers did provide a really nice feature that uses Quartz. If you make the background of your frame partially transparent, the desktop and other applications will show through. For example, if you had a frame with a few buttons on it, you could call this right before you set the frame:
frame.setBackground(new Color(0, 0, 0, 0));
This will make the background of the frame completely transparent, allowing other programs to shine through the gaps between the buttons. This line will make the background be red with 50 percent translucency, so the background will be partially visible and tinted through the frame.
frame.setBackground(new Color(1, 0, 0, 0.5f));
The background setting only affects the frame itself, not the components of the frame. If you want those to be transparent, you will need to set their background colors individually. You could also use this effect to create a rounded window by using a PNG image with transparent sections as the background of your main panel. Then the background would shine through the transparent sections, creating the illusion of a shaped window.
Mac OS X introduced a new form of alert: bouncing the dock icon. This is the icon on the bottom of the screen (depending on your setup) that represents your application. You can make this icon bounce when you wish to alert the user. A single bounce represents a simple notification, such as the arrival of new mail. A continuous bounce represents a serious request for the user's attention (a failed disk write would fall into this category). Since this is a Mac-specific feature, there is no standard API for it, and Apple chose not to add it to their official API. However, there is an undocumented class that can do the job.
Apple has wrapped all of their Cocoa APIs with Java classes. These
classes have virtually no documentation, but by referring to the Cocoa
APIs they came from, you can usually figure them out. The com.apple.cocoa.application
package contains an NSApplication
object that has lots of useful methods. In particular, you want the requestUserAttention()
method, which will make the dock icon bounce.
import com.apple.cocoa.application.*;
// ...
public void bounceDock() {
NSApplication app = NSApplication.sharedApplication();
int id = app.requestUserAttention(
NSApplication.UserAttentionRequestCritical);
}
// ...
NSApplication
has a static method to get the singleton that represents the application. You can then call the requestUserAttention()
method with the constant NSApplication.UserAttentionRequestCritical
to make the dock bounce continuously. You can use other constants for other behaviors. The return value can be passed to the cancelUserAttentionRequest()
method to cancel the alert once the user has responded. Be sure to add the /System/Library/Java/ directory to your classpath when compiling, so that javac
will find the Cocoa wrapper classes.
|
Not to leave Windows lonely, here is an undocumented class that will let you
obtain large desktop icons and other file information. The FileSystemView
only
provides access to file icons of a "default" size, which usually means 16 by 16
pixels. If you look at your operating system desktop, however, you may see icons
that are much bigger, with more detail. There is no standardized way of getting
to the larger icons, but on Windows you can use the hidden class called
sun.awt.shell.ShellFolder
to retrieve larger (32 by 32) desktop file icons. This
class is only available in Sun's JVM, so it won't work with other vendors, or on
other platforms.
The code below will take a filename and show the file's large icon in a window.
public class LargeIconTest {
public static void main(String[] args) throws Exception {
// Create a File instance of an existing file
File file = new File(args[0]);
// Get metadata and create an icon
sun.awt.shell.ShellFolder sf =
sun.awt.shell.ShellFolder.getShellFolder(file);
Icon icon = new ImageIcon(sf.getIcon(true));
System.out.println("type = " + sf.getFolderType());
// show the icon
JLabel label = new JLabel(icon);
JFrame frame = new JFrame();
frame.getContentPane().add(label);
frame.pack();
frame.show();
}
}
ShellFolder
is a wrapper for the metadata of the selected file. From
this object, you can retrieve both the icon and a text description of the file's
type. If you run this on an MP3 file, it might print the string "type =
MPEG Layer 3 Audio"
and show a 32 by 32 pixel iTunes MP3 icon.
Sometimes, Swing applications don't provide a way to change a look
and feel at runtime. When using an application like this, you can
override the default look and feel with your own setting from the
command line using the swing.defaultlaf
property.
java -Dswing.defaultlaf=com.sun.java.swing.plaf.windows.WindowsLookAndFeel
myapp.MainClass
You can also use this technique to apply a new look and feel that the original developer never thought of.
There are a variety of undocumented properties that control the look of
Metal, Swing's cross-platform look and feel. JTree nodes can have lines
connecting children to their parent, but depending on your current setup, the
lines may or may not be showing. You can control the lines with a client
property called JTree.lineStyle
. Add this code after you create
your JTree.
// show the lines in a JTree
tree.putClientProperty("JTree.lineStyle", "Angled");
// hide the lines in a jtree
tree.putClientProperty("JTree.lineStyle", "None");
One of the big complaints about Metal is that the menus and labels use bold fonts. With another quick undocumented system property, you can turn that off.
java -Dswing.boldMetal=false myapp.MainClass
You can also turn on the rollover for JToolBar
buttons
by using a secret property. A rollover is useful because it gives the
user visual feedback that the mouse cursor is over the right place.
Given the size of the typical toolbar button, this feedback is
essential.
toolbar.putClientProperty("JToolBar.isRollover",Boolean.TRUE);
There is a longer (though, by no means comprehensive) list of properties on this wiki page. Swing, and Metal in particular, has lots of undocumented system properties. As you discover them, please add your own comments to the wiki page. Also remember that these are undocumented for a reason, and could easily change or go away in the future. Use them at your own risk.
Swing is a powerful toolkit with lots of hidden features that you can use to bring out the best in your application. This article documents just a few interesting techniques. Swing Hacks from O'Reilly covers another 100 hacks to improve your software. None of the techniques I've shown are required features, but they can add a level of polish that will make your apps stand out from the rest. And in a crowded software marketplace, anything that makes your program better than the competition is a good thing.
In June 2005, O'Reilly Media, Inc., released Swing Hacks.
Sample hacks are available free online.
You can also look at the Table of Contents, the Index, and the full description of the book.
For more information, or to order the book, click here.
Joshua Marinacci is the author of "The Java Sketchbook" column for java.net, covering topics in Java client-side and web development.
Return to ONJava.com.
Copyright © 2005 O'Reilly Media, Inc.


Out-of-core classification of text documents¶
This is an example showing how scikit-learn can be used for classification using an out-of-core approach.
Out-of-core learning means that we can learn from data that would not fit into the computer main memory. To achieve this goal we make use of an online classifier (i.e. that supports the partial_fit method) that will be fed with batches of examples. Moreover, to guarantee that the features space remains the same over time we leverage the HashingVectorizer class that will project each example into the same input space. This is especially useful in the case of text classification where new features (e.g. words) are discovered on the fly.
The dataset used in this example is Reuters-21578 as provided by the UCI ML repository. It will be automatically downloaded and uncompressed in the current directory on first run.
The plot represents is the learning curve of the classifier i.e. the evolution of classification accuracy with the number of mini-batches fed to the classifier.
ReutersParser and ReutersStreamReader classes are utility classes to parse and stream examples to the main learning loop.
To limit the amount of consumed memory at any time we enqueue examples up to a fixed amount before calling the features transformation and learning routines. We then clear the examples queue and proceed with enqueuing again and so on.
To study the performance of the method we sample the first 1000 examples of the dataset and hold them out as separate testing data. We then use it to estimate accuracy after each mini-batch.
Script output:
Test set is 985 documents (132 positive)
100 train docs ( 6 positive) 985 test docs ( 132 positive) accuracy: 0.861 in 0.62s ( 161 docs/s)
975 train docs ( 127 positive) 985 test docs ( 132 positive) accuracy: 0.901 in 1.23s ( 795 docs/s)
1888 train docs ( 235 positive) 985 test docs ( 132 positive) accuracy: 0.924 in 1.81s ( 1043 docs/s)
2423 train docs ( 280 positive) 985 test docs ( 132 positive) accuracy: 0.887 in 2.28s ( 1061 docs/s)
3334 train docs ( 449 positive) 985 test docs ( 132 positive) accuracy: 0.950 in 2.83s ( 1177 docs/s)
4316 train docs ( 539 positive) 985 test docs ( 132 positive) accuracy: 0.938 in 3.45s ( 1251 docs/s)
5277 train docs ( 677 positive) 985 test docs ( 132 positive) accuracy: 0.954 in 4.04s ( 1305 docs/s)
6250 train docs ( 779 positive) 985 test docs ( 132 positive) accuracy: 0.951 in 4.67s ( 1338 docs/s)
7126 train docs ( 844 positive) 985 test docs ( 132 positive) accuracy: 0.960 in 5.19s ( 1373 docs/s)
8116 train docs ( 982 positive) 985 test docs ( 132 positive) accuracy: 0.962 in 5.82s ( 1395 docs/s)
9102 train docs ( 1122 positive) 985 test docs ( 132 positive) accuracy: 0.953 in 6.40s ( 1422 docs/s)
10061 train docs ( 1224 positive) 985 test docs ( 132 positive) accuracy: 0.960 in 6.98s ( 1440 docs/s)
10974 train docs ( 1336 positive) 985 test docs ( 132 positive) accuracy: 0.962 in 7.63s ( 1438 docs/s)
11955 train docs ( 1485 positive) 985 test docs ( 132 positive) accuracy: 0.961 in 8.27s ( 1446 docs/s)
12938 train docs ( 1611 positive) 985 test docs ( 132 positive) accuracy: 0.964 in 9.00s ( 1437 docs/s)
13732 train docs ( 1697 positive) 985 test docs ( 132 positive) accuracy: 0.962 in 9.58s ( 1433 docs/s)
14370 train docs ( 1751 positive) 985 test docs ( 132 positive) accuracy: 0.950 in 10.14s ( 1417 docs/s)
15336 train docs ( 1857 positive) 985 test docs ( 132 positive) accuracy: 0.962 in 10.81s ( 1418 docs/s)
16308 train docs ( 1968 positive) 985 test docs ( 132 positive) accuracy: 0.959 in 11.48s ( 1420 docs/s)
17281 train docs ( 2136 positive) 985 test docs ( 132 positive) accuracy: 0.961 in 12.08s ( 1430 docs/s)
18271 train docs ( 2257 positive) 985 test docs ( 132 positive) accuracy: 0.968 in 12.69s ( 1440 docs/s)
Python source code: plot_out_of_core_classification.py
# Author: Eustache Diemert<EMAIL_ADDRESS># License: BSD 3 clause
from __future__ import print_function
import time
import re
import os.path
import fnmatch
import sgmllib
import urllib
import tarfile
import numpy as np
import pylab as pl
from sklearn.feature_extraction.text import HashingVectorizer
from sklearn.linear_model.stochastic_gradient import SGDClassifier
import itertools
###############################################################################
# Reuters Dataset related routines
###############################################################################
def _not_in_sphinx():
# Hack to detect whether we are running by the sphinx builder
return '__file__' in globals()
class ReutersParser(sgmllib.SGMLParser):
"""Utility class to parse a SGML file and yield documents one at a time."""
def __init__(self, verbose=0):
sgmllib.SGMLParser.__init__(self, verbose)
self._reset()
def _reset(self):
self.in_title = 0
self.in_body = 0
self.in_topics = 0
self.in_topic_d = 0
self.title = ""
self.body = ""
self.topics = []
self.topic_d = ""
def parse(self, fd):
self.docs = []
for chunk in fd:
self.feed(chunk)
for doc in self.docs:
yield doc
self.docs = []
self.close()
def handle_data(self, data):
if self.in_body:
self.body += data
elif self.in_title:
self.title += data
elif self.in_topic_d:
self.topic_d += data
def start_reuters(self, attributes):
pass
def end_reuters(self):
self.body = re.sub(r'\s+', r' ', self.body)
self.docs.append({'title': self.title,
'body': self.body,
'topics': self.topics})
self._reset()
def start_title(self, attributes):
self.in_title = 1
def end_title(self):
self.in_title = 0
def start_body(self, attributes):
self.in_body = 1
def end_body(self):
self.in_body = 0
def start_topics(self, attributes):
self.in_topics = 1
def end_topics(self):
self.in_topics = 0
def start_d(self, attributes):
self.in_topic_d = 1
def end_d(self):
self.in_topic_d = 0
self.topics.append(self.topic_d)
self.topic_d = ""
class ReutersStreamReader():
"""Iterate over documents of the Reuters dataset.
The Reuters archive will automatically be downloaded and uncompressed if
the `data_path` directory does not exist.
Documents are represented as dictionaries with 'body' (str),
'title' (str), 'topics' (list(str)) keys.
"""
DOWNLOAD_URL = ('http://archive.ics.uci.edu/ml/machine-learning-databases/'
'reuters21578-mld/reuters21578.tar.gz')
ARCHIVE_FILENAME = 'reuters21578.tar.gz'
def __init__(self, data_path):
self.data_path = data_path
if not os.path.exists(self.data_path):
self.download_dataset()
def download_dataset(self):
"""Download the dataset."""
print("downloading dataset (once and for all) into %s" %
self.data_path)
os.mkdir(self.data_path)
def progress(blocknum, bs, size):
total_sz_mb = '%.2f MB' % (size / 1e6)
current_sz_mb = '%.2f MB' % ((blocknum * bs) / 1e6)
if _not_in_sphinx():
print('\rdownloaded %s / %s' % (current_sz_mb, total_sz_mb),
end='')
urllib.urlretrieve(self.DOWNLOAD_URL,
filename=os.path.join(self.data_path,
self.ARCHIVE_FILENAME),
reporthook=progress)
if _not_in_sphinx():
print('\r', end='')
print("untaring data ...")
tfile = tarfile.open(os.path.join(self.data_path,
self.ARCHIVE_FILENAME),
'r:gz')
tfile.extractall(self.data_path)
print("done !")
def iterdocs(self):
"""Iterate doc by doc, yield a dict."""
for root, _dirnames, filenames in os.walk(self.data_path):
for filename in fnmatch.filter(filenames, '*.sgm'):
path = os.path.join(root, filename)
parser = ReutersParser()
for doc in parser.parse(open(path)):
yield doc
###############################################################################
# Main
###############################################################################
# Create the hasher and limit the number of features to a reasonable maximum
hasher = HashingVectorizer(decode_error='ignore', n_features=2 ** 18)
# Create an online classifier i.e. supporting `partial_fit()`
classifier = SGDClassifier()
# Create the data_streamer that parses Reuters SGML files and iterates on
# documents as a stream
data_streamer = ReutersStreamReader('reuters').iterdocs()
# Here we propose to learn a binary classification between the positive class
# and all other documents."""
all_classes = np.array([0, 1])
# NB: the 'acq' class was chosen as it is more or less evenly distributed in
# the Reuters files. For other datasets, one should take care of creating a
# test set with a realistic portion of positive instances.
positive_class = 'acq'
def get_minibatch(doc_iter, size, transformer=hasher,
pos_class=positive_class):
"""Extract a minibatch of examples, return a tuple X, y.
Note: size is before excluding invalid docs with no topics assigned.
"""
data = [('{title}\n\n{body}'.format(**doc), pos_class in doc['topics'])
for doc in itertools.islice(doc_iter, size)
if doc['topics']]
if not len(data):
return np.asarray([], dtype=int), np.asarray([], dtype=int)
X, y = zip(*data)
return transformer.transform(X), np.asarray(y, dtype=int)
def iter_minibatchs(doc_iter, minibatch_size):
"""Generator of minibatchs."""
X, y = get_minibatch(doc_iter, minibatch_size)
while X.shape[0]:
yield X, y
X, y = get_minibatch(doc_iter, minibatch_size)
# structure to track accuracy history
stats = {'n_train': 0, 'n_test': 0, 'n_train_pos': 0, 'n_test_pos': 0,
'accuracy': 0.0, 'accuracy_history': [(0, 0)], 't0': time.time(),
'runtime_history': [(0, 0)]}
# First we hold out a number of examples to estimate accuracy
n_test_documents = 1000
X_test, y_test = get_minibatch(data_streamer, 1000)
stats['n_test'] += len(y_test)
stats['n_test_pos'] += sum(y_test)
print("Test set is %d documents (%d positive)" % (len(y_test), sum(y_test)))
def progress(stats):
"""Report progress information, return a string."""
duration = time.time() - stats['t0']
s = "%(n_train)6d train docs (%(n_train_pos)6d positive) " % stats
s += "%(n_test)6d test docs (%(n_test_pos)6d positive) " % stats
s += "accuracy: %(accuracy).3f " % stats
s += "in %.2fs (%5d docs/s)" % (duration, stats['n_train'] / duration)
return s
# We will feed the classifier with mini-batches of 100 documents; this means
# we have at most 100 docs in memory at any time.
minibatch_size = 100
# Main loop : iterate on mini-batchs of examples
minibatch_iterators = iter_minibatchs(data_streamer, minibatch_size)
for i, (X_train, y_train) in enumerate(minibatch_iterators):
# update estimator with examples in the current mini-batch
classifier.partial_fit(X_train, y_train, classes=all_classes)
# accumulate test accuracy stats
stats['n_train'] += X_train.shape[0]
stats['n_train_pos'] += sum(y_train)
stats['accuracy'] = classifier.score(X_test, y_test)
stats['accuracy_history'].append((stats['accuracy'], stats['n_train']))
stats['runtime_history'].append((stats['accuracy'],
time.time() - stats['t0']))
if i % 10 == 0:
print(progress(stats))
###############################################################################
# Plot results
###############################################################################
def plot_accuracy(x, y, plot_placement, x_legend):
"""Plot accuracy as a function of x."""
x = np.array(x)
y = np.array(y)
pl.subplots_adjust(hspace=0.5)
pl.subplot(plot_placement)
pl.title('Classification accuracy as a function of %s' % x_legend)
pl.xlabel('%s' % x_legend)
pl.ylabel('Accuracy')
pl.grid(True)
pl.plot(x, y)
pl.figure(1)
# Plot accuracy evolution with #examples
accuracy, n_examples = zip(*stats['accuracy_history'])
plot_accuracy(n_examples, accuracy, 211, "training examples (#)")
# Plot accuracy evolution with runtime
accuracy, runtime = zip(*stats['runtime_history'])
plot_accuracy(runtime, accuracy, 212, 'runtime (s)')
pl.show()
Total running time of the example: 13.14 seconds


Video Tutorials
Home
Contents
Getting Started
The Editor
Reference
Download
Changelog
Credits
Using Buttons Part 1
Using Buttons Part 2
Using Buttons Part 3
Adding New Levels to the Game


Posted by Stefanos Georgiou on 1st of June, 2018
Posted by Stefanos Georgiou on 26th of May, 2018
Posted by Stefanos Georgiou on 10th of April, 2018
Posted by Stefanos Georgiou on 25th of March, 2018


Shop for exclusive furniture and one of a kind items made from reclaimed wood. Made by Lithuanian furniture designer.
Go to storeMy name is Marius Valaitis and I am a Lithuanian furniture designer who also produces my own work. I founded Mar-Furniture to be able to share my work with the world. Most of the furniture I make is either entirely or partly recycled from the old furniture or scrap materials that I find available locally. This choice influences the design and reproducibility of my work, making some of it one of a kind. I see the history of the material as an added value to any furniture, an imprinted individualism. I believe that every piece of furniture created gets a piece of its creator, therefore I want to take part in each step of its creation. From sketching to the finishing touches.
Get Started!If you have any questions or custom requests, don't hesitate to reach out either through our shop or email


Don't know about you... but I'm feeling like SHA-2!
Checksumming with Taylor Swift
Ashley Blewer
24 April 2015
Personal Digital Archiving
Post-talk note: Press 's', open up the popup, press the largest image and then use the arrow keys to move through the slides
Hello.
Bro...
Bro...
c29c11407b4b6600f6fa47018008b147
Concepts
Concepts: Security
“You go talk to your friends talk to my friends talk to me”
Concepts: Salting
Concepts: Collision Attack
Concepts: "Broken"
SHA
CRC
MD5
Back to archives-land
But...


The Refresh button should change the chart from a pie chart to a geo chart. You can see from the data below that the parameters have changed, but the chart does not redraw. The exact same code is in the "Trial Instance 2" link. If you go there and click the Refresh button, the chart will redraw.
Interestingly, if you start the app at Trial Instance 2, that one will not refresh, but if you click over to this one, it does refresh. So apparently the first instance to load has a problem, but subsequent instances work fine.


CONTACTS LIST
list of under graduate contacts
| # | Full Name | Gender | Phone | Acadamic Department | Graduation Year | created By | created at | Action | |
|---|---|---|---|---|---|---|---|---|---|
| {{i+1}} | {{contact.full_name}} | {{contact.gender}} | {{contact.phone}} | {{contact.email}} | {{contact.Acadamic_department}} | {{contact.graduation_year | date :'fullDate'}} | {{contact.created_by}} | {{contact.created_at | date :'fullDate'}} |


--- layout: page title: "About" description: "This is what I do." header-img: "img/about-bg.jpg" ---
My name is Hoon Ko. I'm a software developer and a father of my cute son.
I like programming, Web technology (HTML, Javascript, Jquery, Many Frameworks).
I don't know How long this site will be maintained by me. but I can tell you I will make some experimental things in this site.


Hey , We’re happy to have you part of the family . Complete the registration by simply click the button below to verify your Email address


Alex
Hi, I'm Alex. Smile!
Some of my favorite places:
The Beach
Home
Go Kart!
Make sure to follow me on
Instagram


Gregory Wiedeman
University Archivist
University records are public records, subject to FOIL
* Reference Code (Required)
* Name and Location of Repository (Required)
* Title (Required)
* Date (Required)
* Extent (Required)
* Name of Creator(s) (Required)
* Scope and Content (Required)
* Conditions Governing Access (Required)
* Languages and Scripts of the Material (Required)
* Administrative/Biographical History (Optimum)
* Access points (Optimum)
* Finding Aids (Added Value)
* Custodial History (Added Value)
* Immediate Source of Acquisition (Added Value)
* Conditions Governing Reproduction and Use (Added Value)
* System of Arrangement (Added Value)
* Technical Access (Added Value)
* Physical Access (Added Value)
* Appraisal, Destruction, and Scheduling Information (Added Value)
* Accruals (Added Value)
* Publication Note (Added Value)
* Notes (Added Value)
* Description Control (Added Value)
* Existence and Location of Originals (Added Value)
* Existence and Location of Copies (Added Value)
* Related Archival Materials (Added Value)
python from archives_tools import aspace as AS session = AS.getSession() for collection in AS.getResources(session, “2”, “all”): if “ua” in collection.id_0: print collection.title
for collection in AS.getResources(session, “2”, “all”): if “Baldus” in collection.title: for note in collection.notes: if note.type == “abstract”: AS.pp(note)


Kozhikode Tourism. Formerly known as Calicut, Kozhikode is located in Kerala. It was the Capital of Malabar during the Zamorin rule 500 years ago and is famous for its centuries-old trade in cotton and spices with Jews, Arabs, Phoenicians and Chinese.
Spread across long stretches of the Arabian water, these beguiling backwater lagoons are a sight to withhold. However, they are well known for its cruises on houseboats which offer an enthralling experience.
Said to be built on the remains of a shipwreck, the Thikkoti Lighthouse is one of the major attractions of Kozhikode. Located on a rocky shoreline, the place is best known for the scenic views it offers as well as several species of nomadic birds.
Beypore , an ancient port town in Kozhikode formerly called as Vaypura / Vadaparappanad. The famous ruler of Mysore , Tipu Sultan, named the town "Sultan Pattanam".Beypore port was historically famous for trading with the Middle East. It is one of the oldest ports in Kerala. (br) The place is also popular for building wooden ships, called as dhows in Malyalam, usually bought by Arab merchants for trading purposes but now used as tourist ships. It is also said that Sumerian ships might have been built in Beypore. Beypore used to have direct trade links with Mesopotamia since the time of silk route.
Its a dam site located in Kozhikode of Kerala state surrounded by lush greenery .The distance is about 15 km from Kakkayam Bus stop. There is a forest office at top . You need to take permission from the official authories before going ahead. Cameras are not allowed near Dam area. 'Orakkuzhi' is a water fall located just after the Dam. Near the dam location , different animals including elephants can be seen.


Lunch Options
Thai
Subway
Jimmy Johns
Radio Maria
Rainbow Gardens
Drink Options
Water
Tea
Coffee
Cola
Ginger Ale


CrimPapers
Articles published on 8 January 2018
On 8 January 2018, 2 new articles were published in 2 journals.
Assessing Convicted Traffickers: Negotiating Migration, Employment and Opportunity Through Restricted Networks by Rose Broad
Why Call Someone By What We Don't Want Them to Be? the Ethics of Labeling in Forensic/correctional Psychology by Gwenda M. Willis


Hi Folks,
Rather than using RF to send the usage telemetry from our (metal) meter box, I'm going to build a multi-CT shield to add to a PoE equipped etherten or Arduino Ethernet (both use the whiznet 5100 chip, so none of the mqtt issues associated with the nanode ENC chipset.
I plan to use all 6 analogue inputs and bring them out for the seedstudio 30A CT clamps - the board itself will be V basic, none of the voltage measurement stufff (thats already picked up by other kit such as the UPS (via apcupsd) and the PV inverter (during the daytime))
sketch will basically just loop over all inputs and publish to a broker on the LAN.
I was going to stripboard a version for me, but if there's sufficient interest I'll see about producing a 'real' PCB and sharing.
Anyone interested?
 The calculation of real power implies multiplying each voltage and current sample and then averaging. If you send individual samples of voltage and current from different places, you will have big problems with timing delays.
Re: multi-CT (6) MQTT Publisher shield
Thanks,
> you will have big problems with timing delays.
realistically for a home install, is this going to be that much of an issue? I know my AC voltage is typically in the range 248-258v -- so even with a slow voltage sampling It won't be out *that* much (will it?)
Even if I'm only calculating apparent power, having 2 channels for the sources (grid and PV) I can still work out the relative usage by the other 4 circuits (ie, where our consumption is going). It may even be possible to "recalibrate" on the fly given the logging direct from the solar inverter -- ie, if that says I'm producing 1000W at the output stage then the CT on that cable in the meter box should be close to 1000W (hopefully!)
My plan for timing is to throw everything into the messsage broker every 6 seconds
Thanks for the suggestions - anything glaring I've missed so far?
Andrew
Re: multi-CT (6) MQTT Publisher shield
I don't think you understand the difference between apparent power and real power - you need to do some reading: http://openenergymonitor.org/emon/buildingblocks/ac-power-introduction
They are only the same for purely resistive loads. Some small loads can have appalling power factors and you may have 20 VA of apparent power and maybe 3 W of real power.


§708-891.5 Computer fraud in the second degree. (1) A person commits the offense of computer fraud in the second degree if the person knowingly accesses a computer, computer system, or computer network with the intent to commit the offense of theft in the second degree.
(2) Computer fraud in the second degree is a class B felony. [L 2001, c 33, pt of §1; am L 2012, c 293, §3]


""" Configuration module for iPEPS simulations
These settings will be loaded from a configuration file :code:`.yml` file
via the :meth:`from_dict` function
"""
from typing import Union, Iterable
import numpy as np
import math
import os
D: int = None
""" iPEPS bond dimension """
chi: int = None
""" CTM boundary bond dimension """
model: str = None
""" Model """
model_params: dict = None
""" Model parameters """
method: str = None
""" Optimization method """
seed: int = 1
""" Random seed for initial state """
resume: bool = False
""" Resume earlier simulation if found """
base_sim: Union[str, None] = None
""" Base simulation """
load_sim: bool = None
""" Load previous (Python) simulation """
max_iterations: int = 100
""" Maximum number of optimizer iterations """
disp_level: int = 1
""" Display level (`0`: no output) """
pattern: Union[Iterable, None] = None
""" Unit cell configuration
Defined as a 2-D array of integers that label the unique sites in the unit
cell.
Example:
A 2x2 unit cell with a [AB, BA]-type pattern is defined by
.. code-block:: python
pattern = [
[0, 1],
[1, 0]
]
"""
ctm_conv_tol: float = 1e-10
""" CTM convergence criterium (singular values norm difference) """
ctm_min_iter: int = 5
""" Minimal number of CTM steps """
ctm_max_iter: int = 20
""" Maximal number of CTM steps """
flush_output: bool = False
""" Passes the :code:`flush = True` argument to the builtin :code:`print` function
when calling the :func:`adpeps.utils.printing.print` function
Useful when deploying the code to computing clusters and capturing the output
into text files
"""
out_prefix: str = ''
""" Optional prefix for the output file of the simulation
Example:
:code:`.../{model}_D{D}_X{chi}.npz`
becomes
:code:`.../{out_prefix}_{model}_D{D}_X{chi}.npz`
"""
# Excitation settings
px: float = 0 * math.pi
py: float = 0 * math.pi
momentum_path: str = 'Bril1'
""" Momentum path through the BZ """
filter_null: bool = False
[docs]def from_dict(cfg):
""" Import config from configuration (`.yml`) file """
cfg_vars = globals()
for name, value in cfg.items():
if name in cfg_vars.keys():
cfg_vars[name] = value
else:
raise ValueError(f"Option {name} = {value} not defined in iPEPS config")
try:
debug_override = os.environ.get("PY_SIM_DEBUG2")
if debug_override is not None and int(debug_override) == 1:
print("** Debug mode on (PY_SIM_DEBUG = 1) **")
cfg_vars['disp_level'] = 2
cfg_vars['use_parallel'] = False
except:
pass
def get_model_params():
if model_params is not None:
try:
return '_'.join([str(p) for p in model_params.values()]) + '_'
except AttributeError:
return '_'.join([str(p) for p in model_params]) + '_'
else:
return ''


| 005:067 Khan | : |
O Messenger (Muhammad SAW)! Proclaim (the Message) which has been sent down to you from your Lord. And if you do not, then you have not conveyed His Message. Allah will protect you from mankind. Verily, Allah guides not the people who disbelieve. |
| 005:067 Maulana | : |
O Messenger, deliver that which has been revealed to thee from thy Lord; and if thou do (it) not, thou hast not delivered His message. And Allah will protect thee from men. Surely Allah guides not the disbelieving people. |
| 005:067 Pickthal | : |
O Messenger! Make known that which hath been revealed unto thee from thy Lord, for if thou do it not, thou wilt not have conveyed His message. Allah will protect thee from mankind. Lo! Allah guideth not the disbelieving folk. |
| 005:067 Rashad | : |
O you messenger, deliver what is revealed to you from your Lord - until you do, you have not delivered His message - and GOD will protect you from the people. GOD does not guide the disbelieving people. |
| 005:067 Sarwar | : |
Messenger, preach what is revealed to you from your Lord. If you will not preach, it would be as though you have not conveyed My message. God protects you from men. He does not guide the unbelieving people. |
| 005:067 Shakir | : |
O Messenger! deliver what bas been revealed to you from your Lord; and if you do it not, then you have not delivered His message, and Allah will protect you from the people; surely Allah will not guide the unbelieving people. |
| 005:067 Sherali | : |
O Messenger ! convey to the people what has been revealed to thee from thy Lord; and if thou do it not, thou has not conveyed HIS Message. And ALLAH will protect thee from men. Surely ALLAH guides not the disbelieving people. |
| 005:067 Yusufali | : |
O Messenger! proclaim the (message) which hath been sent to thee from thy Lord. If thou didst not, thou wouldst not have fulfilled and proclaimed His mission. And Allah will defend thee from men (who mean mischief). For Allah guideth not those who reject Faith. |
Concepts/Themes Covered: أركان الإسلام > التوحيد > الكافرون > صفات الكفار Pillars of Islam> Islamic> The Disbelievers> The Characteristics of the Disbelievers أركان الإسلام > التوحيد > وعيد المفسدين والمجرمين والفاسقين Pillars of Islam> Islamic> The Threatening of the Mischievous, the Criminals and the Impious أركان الإسلام > (محمد (صلى الله عليه وسلم > بعثته Pillars of Islam> The Blessed Muhammad(PBUH)> His Mission(PBUH) أركان الإسلام > (محمد (صلى الله عليه وسلم > طبيعة رسالته Pillars of Islam> The Blessed Muhammad(PBUH)> His Mission's Nature(PBUH) أركان الإسلام > (محمد (صلى الله عليه وسلم > مخاطبة الله إياه Pillars of Islam> The Blessed Muhammad(PBUH)> Allah's Address to Him(PBUH) أركان الإسلام > (محمد (صلى الله عليه وسلم > وعد الله إياه Pillars of Islam> The Blessed Muhammad(PBUH)> Allah's Promise to Him(PBUH) الإيمان > الإيمان بالله > الهداية إلى الإيمان Faith> Belief In Allah> Guiding to Faith القرآن الكريم > وصفه ووجوب الإيمان به The Holy Quran> The Description and the Necessity to Believe it العمل > العمل الطالح > وعيد المفسدين Action(Work)> Bad Deeds>Threatening the Spoilers
This tool uses eight English parallel translations for the Holy Quran imported from Mr. Clay Smith. You can also visit Qurany Concepts for browsing the Quran themes or topics. If you want to search the Holy Quran for keywords, please visit Qurany Keywords.


Default Results
Alfred's Default Results are the ones presented to you when you search without prefixing your search term with a keyword. They include your Applications, Contacts and Preferences by default, but you can modify these to fit your own needs.
In the Default Results preferences, you'll find the following settings:
If you're completely new to searching using Alfred, a good place to start is our "First 5 minutes with Alfred" guide.
Using Alfred's Default Search
Default results are the first results you'll see when you search Alfred without prefixing your search with a keyword. You'll find these settings in Alfred's Preferences under Features > Default Results.
There are three areas to look at to tell Alfred what kind of results you want to see; File types, search scope and fallback searches.
1. Default Result File Types
First, choose the types of files you want to see in your default results.
Only choose the essential file types you want to see every time you search, as you can expand your search by prefixing your search term with the "open" and "find" keywords
You can add additional file types to your default results by checking the boxes in Alfred's preferences under Features > Default Results.
Creating your own Search Filters
If you're a Powerpack user, you can create a File Filter Workflow for custom searches for particular file types or search scopes.
It's a brilliant way to search for file types you need often; for example, a File Filter to search for all images in your Documents folder.
To add less common file types, you can click "Advanced" to add further file types by dragging them or typing in the UTI (Uniform Type Identifier). If you'd like to use the ContentTypeTree rather than just the ContentType, add a + before the name (e.g. By adding a + before public.jpeg, you extend the file type search to public.image, including more than just .jpg images.)
However, using File Filters or the "open" and "find" keywords is the recommended way to expand your search.
Adding Web Bookmarks to your results
Take a look at the Web Bookmarks feature to include Safari and Chrome bookmarks to your results. You can either browse these using their own keyword prefix or by including them in your default results.
2. Setting Your Search Scope
The search scope is set to include all of the usual locations where files and applications are likely to be found. If you store applications or files outside of the default set of folders, you can add paths to Alfred's scope.
You can add to the scope either by pressing the + button at the top right of the Search Scope box, or by dragging a folder from Finder into that box.
If you encounter issues and files are no longer found, you can use the "Reset" button to revert to Alfred's default search scope.
3. Fallback Searches
Fallback searches are the search options Alfred presents to you when he can't find results locally on your Mac. By default, these are Google, Wikipedia and Amazon.
Powerpack users can customise these to use different web searches, custom searches or workflows, and we've created a tutorial on setting up your own fallback searches.
To set your fallback searches, open Alfred's preferences to Features > Default Results and click "Setup fallback searches" at the bottom of the pane. You can then choose your own fallback searches.
You can use any default web search, custom search or fallback search trigger as a custom fallback search.
You can also choose whether they should only appear when there are no results, or whether they should intelligently appear at the end of results when relevant.
4. Applications Matching
Above the Default Results file types, the Applications Options button allows you to customise how Alfred includes apps in your search results.
Applications are always included in Alfred's default results, and you can customise whether the matching should match from capital letters (recommended, e.g. "gc" for Google Chrome) or full fuzzy from any word boundary (e.g. "ps" for Photoshop).
By default, Alfred ignores the keywords in an app's metadata (e.g. iTunes contains metadata for "Beats One, Radio" and many more, which can confuse results). You can choose to include these, but the additional keywords can make results matching confusing and noisy.
Learn more about searching with Alfred
What's next?