If you love Telegram but don't want to leave Discord then you'll be pleased to find we've built a bridge in this channel. If you'd like to join the group in the Telegram app you can find it here: https://t.me/KomodoPlatform_Official.
100 messages
Before 05-Dec-19 12:00 AM
GatewayBOT13-Feb-19 02:56 PM
[telegram] <Acura360> If weekly closes above the green line , moon is coming
[telegram] <juustinen> Hi, I'm trying to send BTC and LTC from Amaga wallet (Android) to Binance. Get stuck here.
[telegram] <Acura360> Official Suppzis in our Discord.
You can try to change the spv server in the settings (re @juustinen: Hi, I'm trying to send BTC and LTC from Amaga wallet (Android) to Binance. Get stuck here.)
[telegram] <juustinen> Ok, Transmission KMD -> Binance, works. (re @Acura360: Official Suppzis in our Discord.
You can try to change the spv server in the settings)
[telegram] <Blackbits> KOMODISM ACTIVATED
[telegram] <KammerBrand> (re @Blackbits: )
GatewayBOT13-Feb-19 05:11 PM
[telegram] <RoseHair> Hi yall
[telegram] <ethanwilliamg> So did something happen or is this just a pump because the TA looked good?
[telegram] <Acura360> Follow us on Twitter
<system> file giphy.mp4 too big to download (1085614 > allowed size: 1000000)
[telegram] <Acura360> (re @Acura360: )
GatewayBOT13-Feb-19 05:26 PM
[telegram] <changemymindk> Komodo always seems to pump harder than other coins. when it goes it really goes.
GatewayBOT13-Feb-19 05:36 PM
[telegram] <PTYX11> Many things have been happening and alot of media attention has been garnered in the past week (re @ethanwilliamg: So did something happen or is this just a pump because the TA looked good?)
Komodo (CURRENCY:KMD) traded up 6% against the dollar during the one day period ending at 3:00 AM Eastern on January 29th. Komodo has a market cap of $83.19 million and approximately $6.03 million worth of Komodo was traded on exchanges in the last day. One Komodo coin can no...
[telegram] <Madonex> Tried it and even with Ledger love it doesn’t work. Tells me to reinstall Komodo app and I already did (re @Matterbridge_kmdbot: [discord] <SHossain> the chrome extension is very old and no longer maintained by Ledger. you must install Ledger Live app)
[telegram] <Madonex>
[telegram] <lopez_s> Tim please leave me alone (re @tim87: )
[telegram] <PTYX11> If you want people to leave you alone, posting "Hi" on a public channel where anyone can reply is not a good idea. (re @lopez_s: Tim please leave me alone)
[telegram] <lopez_s> Who send you message? (re @PTYX11: If you want people to leave you alone, posting "Hi" on a public channel where anyone can reply is not a good idea.)
[telegram] <PTYX11> You sent a message to this channel. Therefore you addresses everyone in this channel. (re @lopez_s: Who send you message?)
[telegram] <PTYX11> Is there anything Komodo related we can assist you with?
[telegram] <lopez_s> ????? (re @PTYX11: You sent a message to this channel. Therefore you addresses everyone in this channel.)
[telegram] <Regnar> 1.Agama lite mode uses SPV single address, you use your seed (or pin if you set it up) to access your address, one KMD address per seed. Agama Native can have multiple addresses as well as Z addresses.
2. Komodo has two types of addresses, transparent addresses are most common, they are the ones you claim rewards in, and can see balances etc they begin with R, and are often referred to as R addresses. There are also 'Zs' addresses or Z addresses, these are private addresses where balances do not show up on chains. They also make Z transactions where the amount and addresses aren't visible either. These Z addresses however, are being moved to a parallel chain soon, so I wouldn't mess with them right now. What I mean by this is Komodo uses multi-chain infrastructure, it's how they scale, so Z transactions are going onto a new parallel chain along with new Crypto Conditions smart contracts. This swapping between parallel chains will be seamless and using Komodos MoMoM tech to ensure fungible coins and keep supply consistent. (re @TonyStarkBR: Being new to KMD, I have some doubts:
1) Agama wallet (SPV mode) uses a single, fixed address? It seems to me so...
2) what kind of addresses do we have and how to recognize them?)
GatewayBOT13-Feb-19 10:32 PM
[telegram] <geeyawm> Try magnum wallet (re @Madonex: )
[telegram] <PTYX11> magnum worked for me earlier (re @geeyawm: Try magnum wallet)
[telegram] <Acura360> If somebody knows somebody ...
[telegram] <TonyStarkBR> Hi!
Thanks for your answers!
Next round ...
1) is it possible to convert an existing SPV wallet into native? Or somehow import that address into a native wallet?
2) Komodo derives from Zcash, right? Can I send transactions between Z addresses without passing through a R address? Can I send from Z to R and vice versa?
3) I'm playing around with the QT wallet. Why we don't have binaries for Linux and Mac? Only for Windows? Is it some kind of way to force users to Agama instead of QT? (re @Regnar: 1.Agama lite mode uses SPV single address, you use your seed (or pin if you set it up) to access your address, one KMD address per seed. Agama Native can have multiple addresses as well as Z addresses.
2. Komodo has two types of addresses, transparent addresses are most common, they are the ones you claim rewards in, and can see balances etc they begin with R, and are often referred to as R addresses. There are also 'Zs' addresses or Z addresses, these are private addresses where balances do not show up on chains. They also make Z transactions where the amount and addresses aren't visible either. These Z addresses however, are being moved to a parallel chain soon, so I wouldn't mess with them right now. What I mean by this is Komodo uses multi-chain infrastructure, it's how they scale, so Z transactions are going onto a new parallel chain along with new Crypto Conditions smart contracts. This swapping between parallel chains will be seamless and using Komodos MoMoM tech to ensure fungible coins and keep supply consistent.)
[telegram] <polycryptoblog> 1) Yes 2) Yes to all however after the 15th privacy functionality will be moved to a sidechain , still will function on there the same way. 3) Because the developer who volunteered to make a QT has only made it for Windows so far and has other higher priority and I am assuming paid as well work ahead of a labor of love. GUI wallets , QT or otherwise are a convenience for the user. If it were up to the devs, everyone would just be using command line , like Zcash has done and offloaded GUI wallet support to 3rd parties .
[telegram] <polycryptoblog> Windows tends to be the most testy with Agama so an option was created with better stability on that platform at a cost of beautification
[telegram] <polycryptoblog> Above (re @TonyStarkBR: Hi!
Thanks for your answers!
Next round ...
1) is it possible to convert an existing SPV wallet into native? Or somehow import that address into a native wallet?
2) Komodo derives from Zcash, right? Can I send transactions between Z addresses without passing through a R address? Can I send from Z to R and vice versa?
3) I'm playing around with the QT wallet. Why we don't have binaries for Linux and Mac? Only for Windows? Is it some kind of way to force users to Agama instead of QT?)
[telegram] <TonyStarkBR> Thanks!!!
1) how?
2) good to know! From the user perspective, I take that nothing changes? It's only under the hood changes, then?
3) I know nothing about Zcash, they don't have GUI wallets of their own? (re @polycryptoblog: 1) Yes 2) Yes to all however after the 15th privacy functionality will be moved to a sidechain , still will function on there the same way. 3) Because the developer who volunteered to make a QT has only made it for Windows so far and has other higher priority and I am assuming paid as well work ahead of a labor of love. GUI wallets , QT or otherwise are a convenience for the user. If it were up to the devs, everyone would just be using command line , like Zcash has done and offloaded GUI wallet support to 3rd parties .)
[telegram] <TonyStarkBR> Btw, English is not my first language, what's the meaning of "testy"?
[telegram] <TonyStarkBR> 4) Agama in native mode the same (function-wise) as QT??
GatewayBOT13-Feb-19 11:54 PM
[telegram] <polycryptoblog> 1) there is a button in Agama native on the top of the page that says import key. 2) you will have to move kmd to the sidechain to access the privacy features, when its time Guides will be put out to show how to do that. 3). Correct they don’t afaik, I know that one of the devs that works with us a lot is maintains all Windows Zcash based wallets. Same person that told satoshi to start the bitcoin email list, radix42 . 4) yes same functionality with a bunch of additions
Testy means temperamental = liable to unreasonable changes in mood .
GatewayBOT14-Feb-19 12:27 AM
[telegram] <kingsking612> New Agama coming?
[telegram] <kingsking612> :)
[telegram] <polycryptoblog> Yes, soon, don’t have an exact time
[telegram] <TonyStarkBR> Great, thank you, my friend!!!! (re @polycryptoblog: 1) there is a button in Agama native on the top of the page that says import key. 2) you will have to move kmd to the sidechain to access the privacy features, when its time Guides will be put out to show how to do that. 3). Correct they don’t afaik, I know that one of the devs that works with us a lot is maintains all Windows Zcash based wallets. Same person that told satoshi to start the bitcoin email list, radix42 . 4) yes same functionality with a bunch of additions
Testy means temperamental = liable to unreasonable changes in mood .)
[telegram] <TonyStarkBR> Mobile, desktop or both? (re @kingsking612: New Agama coming?)
GatewayBOT14-Feb-19 12:44 AM
[telegram] <JAC0B> Any admin present?
[telegram] <PTYX11> How can we assist? (re @JAC0B: Any admin present?)
[telegram] <JAC0B> Thx for the fast response. Was there any private funding or just the ICO back in late 2016? (re @PTYX11: How can we assist?)
[telegram] <PTYX11> It was an ICO that raised very little compared to other ICOs of the time. (re @JAC0B: Thx for the fast response. Was there any private funding or just the ICO back in late 2016?)
[telegram] <JAC0B> Yea $2M. Always a good sign, so no private rounds huh
[telegram] <JAC0B> When does the new site launch?
[telegram] <PTYX11> I'm not sure but the marketing team has been making announcements on the progress and the current state: https://komodoplatform.com/komodo-rebrand-update-2/ (re @JAC0B: When does the new site launch?)
Komodo is working on a full rebrand and is currently focused on product startegy and development. Learn more about the rebrand process in this post.
GatewayBOT14-Feb-19 01:06 AM
[telegram] <JAC0B> Cool I'll check it out. For what it's worth I think you guys have a great project and during my valuation no red flags. Only thing I'd suggest would be making your team section on your website a little more uniform with individual linkedins. Awesome whitepaper (re @PTYX11: I'm not sure but the marketing team has been making announcements on the progress and the current state: https://komodoplatform.com/komodo-rebrand-update-2/)
Komodo is working on a full rebrand and is currently focused on product startegy and development. Learn more about the rebrand process in this post.
[telegram] <PTYX11> I'll pass that along to the marketing team (re @JAC0B: Cool I'll check it out. For what it's worth I think you guys have a great project and during my valuation no red flags. Only thing I'd suggest would be making your team section on your website a little more uniform with individual linkedins. Awesome whitepaper )
GatewayBOT14-Feb-19 01:52 AM
[telegram] <TonyStarkBR> @polycryptoblog does ZMD use the same trusted setup parameters of Zcash?
(Meaning, an eventual compromise of Zcash would affect KMD also?)(edited)
GatewayBOT14-Feb-19 02:07 AM
[telegram] <polycryptoblog> It would only affect the sidechain
[telegram] <polycryptoblog> Yes it uses the same parameters
Fun fact re: $KMD:
The prior two times Komodo has closed the Daily above 22.5k sats after spending time trading below it, price has moved at least 300% inside a month.
Likes
106
GatewayBOT14-Feb-19 08:19 AM
[telegram] <Vollka_Racho> happy valentines day
[telegram] <那个帮帮> 联系contact：@qingrenjie
GatewayBOT14-Feb-19 08:44 AM
[telegram] <Bruj4h> Anyone can help me with something? I have a kmd wallet since 11/06/2017 and my 1st ever address starts with a R. Like:RQoq... This means i dont need to do anything right?
[telegram] <Acura360> correct - all fine (re @Bruj4h: Anyone can help me with something? I have a kmd wallet since 11/06/2017 and my 1st ever address starts with a R. Like:RQoq... This means i dont need to do anything right?)
[telegram] <Bruj4h> Ty @Acura360 btw another question, just logged on my wallet but when i try to claim, nothing happens. The claim rewards open, i press claim again, but nothing happens
[telegram] <Bruj4h> Im on version v0.2.41-beta
[telegram] <Notgivingawayfreeeth> The dex will be in agama wallet?
GatewayBOT14-Feb-19 09:18 AM
[telegram] <Acura360> Pls update (re @Bruj4h: Im on version v0.2.41-beta)
[telegram] <Acura360> No (re @Notgivingawayfreeeth: The dex will be in agama wallet?)


About Us
NewPower Education is a non-partisan nonprofit focused on educating and encouraging women to engage in all areas of public service. This includes: running for public office, serving on
community boards, achieving appointed office, and volunteering in political campaigns or offices. The nonprofit has created a series of videos focused on
assisting women to learn more about the journey to public service. Donations to NewPower Education are charitable deductions.
NewPower Education is a companion 501(c)3 nonprofit organization independent of NewPowerPAC, a nonpartisan political action
committee. The mission of NewPowerPAC is to empower, endorse and elect more women to public office throughout the state of Georgia.
The Political Action Committee’s goal is to inspire women to become political leaders and advocates in their communities and throughout the
state. NewPowerPAC spends money on elections and candidates, but is not run by a party or individual candidate. Donations to the PAC are not charitable
contributions.


HARD TO DIE A film review by Ken Johnson Copyright 1993 Ken Johnson
1:17, Horror, 1993 MPAA rating: none (female nudity, explicit language, adult situations, violence) Rating: zero (on a scale of zero to five) Director: Jim Wynorski Cast: Robyn Harris, Lindsay Taylor, Debra Dane, Melissa Moore, Bridget Carney, Orville Ketchum, Karen Chorak, Jurgen Baum, Bob Sheridan, Carolet Girard, Forrest J. Ackerman
Five girls spend a day in a closed building doing inventory when a strange box gets delivered there (is this starting to sound familiar?) by mistake. The girls accidentlly open the box (big surprise, huh!) and release an evil spirit of a killer that kills the girls off one by one (betcha didn't see that one coming!).
HARD TO DIE, I found out while watching the film, is a sequel to SORORITY HOUSE MASSACRE 2: NIGHTIE NIGHTMARE (r.a.m.r.# 1521). Two of the actresses from SORORITY HOUSE MASSACRE 2 are in this film, Robyn Harris and Melissa Moore, but they play different characters here. Orville Ketchum is also back as (get ready for this) Orville Ketchum (yes, the same character from number two). Yes, he is also built like a tank in this film too. I'm telling you, a nuclear bomb detonated next to this man wouldn't harm him at all! The before mentioned three were the only actors from part two that I thought could act, well they seemed to have lost that ability. Thankfully, for my sanity, I also saw the film WARLOCK, which undid all the ill effects that I got from this film.
The story for this film is completely ridiculous and has many elements from many cheapo low budget horror flicks. Any good moments that this film fails to make are even more destroyed by the story line. The film is so pathetically predictable that every moment has already been figured out, analyzed, and discarded before it happens. There is no point in this film that any suspense is ever afoot. While we are on the subject of the story, the story also provides every chance it can to disrobe an actress. The film goes to the extent of putting a shower in the manager's office. I'm sorry folks but this is completely unnecessary, ridiculous, and hurts the story more (if that is still possible).
The script for this film is completely pathetic. The lines the actresses come out with are completely horrible. The only thing that I think could have happened is that the actors made up the script as they went along. Here is an example of the wonderful dialog. The scene is two girls have just entered a gun store and have picked out a *really* big gun. The line is "My dad used to be a Marine, I bet I can work it." This line has got to be a contender for the bad line hall of infamy. Now, we fast forward for a few minutes until just after a big plan (?!!?) has been presented. One comment from an actress is "Not a lot of strategy involved, but I like it." I'm afraid folks that this is about as good as they get.
Now lets talk about the great special effects for this film. This obviously wasn't a big concern of the film makers.  A girl gets hacked with a knife and enough blood comes out to do one FRIDAY THE 13TH movie. Are we trying to see how unrealistic we can get? The continuity department was obviously asleep (along with the viewers) when watching this film. In one shot, actress has cloths on, camera angle changes, actress seems to have lost clothing. Very impressive trick!
The one (half?) plus that this film has going for it, is that in many places it is unintentionally hilarious. The incompetence behind the film makes it incredibly funny, and so the viewer can get some enjoyment (?!!?) from the film. However, this doesn't make it worth the rental fee of over a penny. In the acting department, the only thing I can say is two thumbs squared and one head down. I would normally do a detailed paragraph on this topic, but there is no point here because there is nobody that I was impressed with in the least. Oh well, win some, lose some.
-------- Ken Johnson<EMAIL_ADDRESS>.
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


Quite some time ago I gave a little presentation on DictMixin at ChiPy. If you haven’t used DictMixin before, it’s a class that implements all the derivative methods of dictionaries so you only have to implement the most minimal set: __getitem__, __setitem__, __delitem__, and keys. It’s a lot better than subclassing dict directly, as you have to implement a lot more, and dict implies a specific kind of storage. With DictMixin you can get the information from anywhere.
I thought of a couple examples, and wrote some doctests for them; I thought satisfying the doctests would itself be the presentation. I’m not sure how it worked; it was a fairly experienced crowd, but the switch from code to test can be disorienting.
One of the examples I used was a filesystem access layer. Representing a filesystem as a dictionary is nothing new, but the simplicity of the representation worked well. Here’s how it works:
- An FSDict represents one directory.
- The keys are the filenames in the directory.
- The values are the contents of the files (strings).
- When there is a subdirectory, it is another FSDict instance.
- When you assign a dictionary-like object to a key, it creates a FSDict from that object.
Dictionaries have lots of methods, like items(), update(), etc. But using DictMixin you just implement the four methods. First, the setup:
class FSDict(DictMixin):
def __init__(self, path):
self.path = path
Creation of a dictionary is not part of the dictionary interface. This seems a little strange at first, but the dict class interface isn’t the same as the dictionary instance interface. So FSDict.__init__ doesn’t bear any particular relation to dict.__init__.
Now the other methods… in each case, strings and dictionaries (files and directories) are treated differently.
def __getitem__(self, item):
fn = os.path.join(self.path, item)
if not os.path.exists(fn):
raise KeyError("File %s does not exist" % fn)
if os.path.isdir(fn):
return self.__class__(fn)
f = open(fn, 'rb')
c = f.read()
f.close()
return c
Note the use of self.__class__(fn) instead of FSDict(fn). This makes the class subclassable if you retain the FSDict.__init__ signature. This way subclasses will create new instances using the subclass. Note also that KeyError is part of the dictionary interface (an important part!), so we can’t raise IOError.
Now, assignment…
def __setitem__(self, item, value):
if item in self:
del self[item]
fn = os.path.join(self.path, item)
if isinstance(value, str):
f = open(fn, 'wb')
f.write(value)
f.close()
else:
# Assume it is a dictionary
os.mkdir(fn)
f = self[item]
f.update(value)
Note that with subdirectories (represented as nested dictionaries) we let DictMixin.update do all the hard work, and just create an empty directory to be filled.
Deletion…
def __delitem__(self, item):
fn = os.path.join(self.path, item)
if not os.path.exists(fn):
raise KeyError("File %s does not exist" % fn)
if os.path.isdir(fn):
## one way...
self[item].clear()
os.rmdir(fn)
## another way...
#shutil.rmtree(fn)
else:
os.unlink(fn)
Enumeration…
def keys(self):
return os.listdir(self.path)
So, to recursively copy '/foo/bar' to '/dest/path/bar' you do:
FSDict('/dest/path')['bar'] = FSDict('/foo')['bar']
It doesn’t really matter if '/foo/bar' is a directory or file. There’s a number of other clever things that come out of this. I think it’s an example of the power of a closed set — dictionaries are expressable from these four operations, and all the other methods can be derived from there. If you find this interesting, you might want to read the source for DictMixin; it’s only about 95 lines.
My article templating via dict wrappers has some other similar dict tricks.
No related posts.
I wrote a Ruby version of your FSDict class. It’s here: http://blog.ntecs.de/articles/2007/08/17/ian-bickings-fsdict-in-ruby
DictMixin is handy. But it’s an old-style class, and I ran into difficulty when using it to store dictionary contents in a database with Storm because of that. This led me to the #storm IRC channel, where I was told simply that what I was doing wasn’t a proper dictionary and therefore I should use an over-complicated delegation system instead. Ugh.
I can’t see the point of that. Yes, a class using DictMixin can do some clever stuff behind the scenes that you wouldn’t necessarily expect from a normal dictionary. But that doesn’t mean that it isn’t actually a dictionary, does it? It still stores key/value pairs, right?
I think adapting simple interfaces like the Dict interface to complex behaviour is one of the things that makes Python so useful. I don’t see the problem with “magic” like this, in fact I think it’s a great thing. What do you say to people who want to double your class-count for the sake of it?
I’m not exactly sure what you were doing.
obj.__dict__
must be a real dictionary, I don’t even think a dictionary subclass is okay. But that’s right at the heart of Python’s objects, so it’s not too surprising — lots of low-level code pokes right into an instance’s dictionary structure directly, I imagine. I’m guessing something along those lines is what happened to you with Storm? There’s also questions like “can this object change behind my back?” — which you can feel more confident about with a real dictionary. As an example, WSGI doesn’t allow dictionary-like objects for requests, only exactlydict
. It’s like a contract in that case.You can do
class Foo(object, DictMixin):
if you want a new-style dict-like class; that works fine.


This chapter shows how you might get started writing a simple GEOS program, and it explains several fundamental GEOS programming concepts as it goes along. Although this tutorial explicitly refers to the Nokia 9000 SDK version 1.1, it is also applies to the Nokia 9000i SDK version 2.0.
Tutorial Part 1: Compiling
Tutorial Part 2: A New Application
Source Code
Tutorial Part 3: Adding Procedural Code
Source Code With Changes


--- layout: default --- « Home Hello (World) Hi, i'm Kukuh. FOSS Enthusiast (@gnome, @openSUSE, and FlatpakApps contributor) & Part Time Musician Contact me at k[at]syafaat[dot]id
Hi, i'm Kukuh.
FOSS Enthusiast (@gnome, @openSUSE, and FlatpakApps contributor) & Part Time Musician
Contact me at k[at]syafaat[dot]id


{hotelname} Housekeeping -- Welcome {username}
Username
Powered by GrapeASE by Grapefruit - Design by Grapefruit
Implemented into RevCMS by Kryptos


Welcome to my page!
- Data quality testing and analytics on CDEs for AML validations using MS SQL.
- Helped design the SQL server data architecture, ER diagrams, UI/UX wireframe designs in Sketch, and Tableau KPI dashboards to implement KPMG’s Cognitive Contract Management workflow.
- Developed RPA ETL process with UiPath to extract contracts from different formats with OCR, transform extracted data into JSON formats, and load JSON formatted files into a RESTful Web Service. Helped implement best practices such as dependency injection, configurations, and logging with NLog for the web UI written in .NET.
- Facilitated client discovery sessions to define project scope requirements to implement potential automation strategies, roadmaps, COEs, and leading practices for RPA.
- Collaborated with data scientists, software developers, and industry professionals to help build business automations with RPA, Tableau, ABBYY, VB, and .NET
- Collaborated with business process users to design, develop, analyze, and maintain scalable automation solutions as a Robotic Process Automation designer using UiPath, VBA and .NET.
- Worked on project to replace scheduled SAP BusinessObjects rearrange and EAS report jobs using Autosys, PsExec, Batch scripts, C# and SSIS.
- Supported Continuous Integration/Continuous Delivery (CI/CD) practices with Jenkins.
- Built, deployed, configured, and supported various Windows server, client/server, Citrix and web platform applications. Implemented practices around agile methodology with Atlassian tools such as JIRA, BitBucket, and Confluence.
- Collaborated with the Windows and IBM AIX Server & Storage team to assist with any upgrades/incidents with production and non-production servers.
- Gained insight in IT infrastructure, virtual machines, security concepts, and networks.
- Developed a plugin web search page for the IT department to verify all desired email notifications delivered to any inputted recipients along with a user’s full account record from a SQL database using C#, ASP.NET, and SQL.
- Enhanced a monitor service program, Nagios, by utilizing multithreading to monitor multiple desired services in a cluster service using Visual Basic.
- Worked on document organizing and reviewing for QA department while attending meetings involving discussions on prioritizing tasks to address certain machinery issues.
- Obtained training on GxP compliance in pharmaceutical environment.
Co-designed the foundation of an Android mobile personal pet application for users to care, socialize, and interact with for ECE Capstone Design. Technologies used: Java
Attended a Game Jam to create a competitive multiplayer dating simulation game in Unity. Technologies used: Unity, Adobe Photoshop, XML, and C#
Co-created a forum based educational networking website for a software engineering class project. Technologies used: C#, ASP.NET, and MySQL
Co-created a multi-threaded attendance checker Android app automating attendance using bluetooth, SQLite, and location services API for a mobile application engineering course. Technologies used: Java
Apart from being a developer and consultant, I enjoy rock climbing and swimming. Additionally, I spend most of my indoor free time hosting boardgame nights with friends, working on my latest digital art projects, binging popular Netflix series, catching up on the latest technologies, and playing with the family cat.
Just visited Sydney and Seoul! :)


An Android bottom sheet with a list of actions.
Use the Touch button on the component to capture which row was tapped.
A pulse that displays the bottom sheet.
A number that represents the number of visible rows.
A number representing the relative distance from the bottom of the screen. Useful for offsetting the position of the share sheet when a system navigation bar is present.
The color of the icon in each row.
The color of the text label in each row.
The color of the background of each row.
An index that represents which row is tapped, starting at 0.
A text string that represents the value of the label of the row which is tapped.
A pulse that represents when any row is tapped.
A pulse that represents when the first row is tapped.
A pulse that represents when the second row is tapped.
A pulse that represents when the third row is tapped.
A pulse that represents when the fourth row is tapped.
A pulse that represents when the fifth row is tapped.
A pulse that represents when the sixth row is tapped.


NELLY & MONSIEUR ARNAUD (NELLY ET M. ARNAUD) A film review by Steve Rhodes Copyright 1996 Steve Rhodes
RATING (0 TO ****): ***
NELLY AND MONSIEUR ARNAUD (NELLY ET M. ARNAUD) is a French film that garnered numerous awards there. For me the film is a fascinating character study of Nelly and Monsieur Arnaud, but others will probably characterize the picture as a romance to which I would not argue. This is one of those rare films that appears to have no actors. These characters are so realistically drawn that I did not for a minute think I was observing actors, rather I was eavesdropping on real life.
First, a warning. If you must have sex or nudity or if you need dramatic events and fast pacing to enjoy a movie, do not waste your time with NELLY AND MONSIEUR ARNAUD as you will be quite disappointed. This is a film that takes its own sweet time and one with a satisfying but slightly surprising ending of the sort you hardly ever see in American films. Don't try to guess the ending you will be wrong, and anyway, the fruits to be savored of this film are getting to know the characters.
As the story unfolds, Nelly played by Emmanuelle Beart (Manon from MANON OF THE SPRING and Claire Phelps from MISSION: IMPOSSIBLE among many films) is at a Parisian cafe confiding her marriage problems with her friend Jacqueline (Claire Nadeau). Nelly tells Jacqueline that her husband, Jerome (Charles Berling), is a couch potato who lost his job and who is not serious looking for another one. Nelly lost hers too, but is doing odd jobs in a futile attempt to attack their mounting debt.
Into the cafe comes Monsieur Arnaud played by Michel Serrault (Mr. Raymond in LES DIABOLIQUES (1954) and 53 other films after that). It seems that years ago Monsieur Arnaud had an affair with married and now 43 year old Jacqueline and is still a good friend of hers.
Whereas Nelly is 25 with the looks of a fashion model, Monsieur Arnaud is 40 years her senior, but strikingly handsome and distinguished. He has gorgeous, straight, silver gray hair, and wears impeccable suits (costumes by Catherine Bouchard). Both have excellent bodies and the camera loves them.
For good looking characters, their talent has nothing to do with their physical attractiveness. Both turn out to be compassionate people who are good listeners. Moreover the performances by Beart and Serrault are compelling and worthy of Academy Award consideration. Once Monsieur Arnaud hears Nelly's tale of woe, he loans her enough money to get her out of debt, and he gives her a job transcribing and editing his memoirs of his time in French Polynesia after the war when he was a young judge. Although the job is to be performed in his apartment, there are no strings attached.
There is a slight mystery about Monsieur Arnaud since he stopped being a judge in mid-career and became a wealth businessman. As he explains it, "We struck it rich in real estate, making Paris ugly." He is in the process of selling his vast collect of rare and not so rare books telling Nelly, "You reach an age when you read the same few books over and over." The reason to see the film is the evolving relationship between the two of them and their rich conversations together. At one point, in jest, he confides in her, "Marry an old man like me and you'll have liberty, security, and austerity."
Nelly quickly and amicably divorces her husband and eventually strikes up a relationship with Monsieur Arnaud's publisher Vincent (Jean-Hugues Anglade). Most of the show for me remains a beautiful character study of two people. The script by Jacques Fieschi, Claude Sautet, and Yves Ulmann is exquisite. Director Claude Sautet takes a story and slowly wraps his audience into it. A mesmerizing tale.
NELLY AND MONSIEUR ARNAUD runs 1:46 with carefully and almost dreamy editing by Jacqueline Thiedot. The picture is in French with easy to follow English subtitles. The film is not rated, but would be PG or PG-13. There is no sex, nudity, or violence. I remember only a single mild cuss word. Given the subject matter, my guess is that it would not interest kids under 10, but I don't see how it could harm anyone. I recommend this delightful talkfest of a film to you and give it ***.
**** = One of the top few films of this or any year. A must see film. *** = Excellent show. Look for it. ** = Average movie. Kind of enjoyable. * = Poor show.  Totally unbearable.
REVIEW WRITTEN ON: May 31, 1996
Opinions expressed are mine and not meant to reflect my employer's.
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


--- layout: post title: Weekly Roundup! Friday February 17, 2012 date: '2012-02-17T15:12:17-08:00' tags: tumblr_url: http://alexhwilliams.tumblr.com/post/17788390652/weekly-roundup-friday-february-17-2012 ---
http://bit.ly/y97eyX


{% extends 'nehlwebsite/base.html' %} {% load static %} {% block title %} Competition: {{ competition.short_name|default_if_none:competition.name }} {% endblock %} {% block css %} {% endblock %} {% block content %}
Parent Competition: {{ competition.parent_competition.name }}
{% endif %} {% if seasons.count > 0 %}| Team | Pld | Won | Drawn | Lost | Pts | |
|---|---|---|---|---|---|---|
| {{ forloop.counter }} | {{ standing.team.club.short_name }} {{ standing.team.short_name }} | {{ standing.num_played }} | {{ standing.num_won }} | {{ standing.num_drawn }} | {{ standing.num_lost }} | {{ standing.total_points }} |


DO NOT READ THIS FILE ON GITHUB, GUIDES ARE PUBLISHED ON https://guides.rubyonrails.org.
Maintenance Policy for Ruby on Rails
Support of the Rails
framework is divided into four groups: New features, bug
fixes, security issues, and severe security issues. They are handled as
follows, all versions, except for security releases, in X.Y.Z
, format.
Rails
follows a shifted version of semver:
Patch Z
Only bug fixes, no API changes, no new features. Except as necessary for security fixes.
Minor Y
New features, may contain API changes (Serve as major versions of Semver). Breaking changes are paired with deprecation notices in the previous minor or major release.
Major X
New features, will likely contain API changes. The difference between Rails' minor and major releases is the magnitude of breaking changes, and usually reserved for special occasions.
New Features
New features are only added to the main branch and will not be made available in point releases.
Bug Fixes
Only the latest release series will receive bug fixes. Bug fixes are typically added to the main branch, and backported to the x-y-stable branch of the latest release series if there is sufficient need. When enough bugs fixes have been added to an x-y-stable branch, a new patch release is built from it. For example, a theoretical 1.2.2 patch release would be built from the 1-2-stable branch.
In special situations, where someone from the Core Team agrees to support more series, they are included in the list of supported series.
Currently included series: 7.0.Z
.
Security Issues
The current release series and the next most recent one will receive patches and new versions in case of a security issue.
These releases are created by taking the last released version, applying the
security patches, and releasing. Those patches are then applied to the end of
the x-y-stable branch. For example, a theoretical <IP_ADDRESS> security release would
be built from 1.2.2, and then added to the end of 1-2-stable. This means that
security releases are easy to upgrade to if you're running the latest version
of Rails
.
Only direct security patches will be included in security releases. Fixes for non-security related bugs resulting from a security patch may be published on a release's x-y-stable branch, and will only be released as a new gem in accordance with the Bug Fixes policy.
Currently included series: 7.0.Z
, 6.1.Z
.
Severe Security Issues
For severe security issues all releases in the current major series, and also the last release in the previous major series will receive patches and new versions. The classification of the security issue is judged by the core team.
Currently included series: 7.0.Z
, 6.1.Z
.
Unsupported Release Series
When a release series is no longer supported, it's your own responsibility to deal with bugs and security issues. We may provide backports of the fixes and publish them to git, however there will be no new versions released. If you are not comfortable maintaining your own versions, you should upgrade to a supported version.


--- layout: post title: Virtual Worlds, Web 3.0 and Portable Profiles date: 2006-11-30 00:00:00 categories: digital-media interfaces-&-interaction social ---
Virtual Worlds, Web 3.0 and Portable Profiles: " But the current 2D web, mostly linear to linear linking, is about to be enhanced by virtual environments in which we meet as avatars, interact as 3D moving objects that takes sharing, collaboration and communication to the next, predictable level."
I'd to go on record as saying that the future of the web will *not* be 3D worlds where we all meet as avatars. 3D worlds have been proposed as the next big step for everything for years now, and the fact that there are a couple of really popular game-type environments out there doesn't indicate to me that the whole web is going to move in this direction... any more than YouTube makes me think that the future of the web is all human knowledge distilled into mediocre-quality 10 minute video clips.
Mind you, I thought Gopher was great at this HTTP thing would never take off...


Site location
Site List
| ID | Company Name | Address | City | State | Zip | status |
|---|---|---|---|---|---|---|
| {{location.id}} | {{location.name}} | {{location.address}} | {{location.city}} | {{location.state}} | {{location.zip_code}} | {{location.active}} |
{% extends "locations/layout.html" %} {% load static %} {% block title %} {{ index_type }} {% endblock %} {% block body %}
| ID | Company Name | Address | City | State | Zip | status |
|---|---|---|---|---|---|---|
| {{location.id}} | {{location.name}} | {{location.address}} | {{location.city}} | {{location.state}} | {{location.zip_code}} | {{location.active}} |


Description
The Skahal Studios is an indie game development company.
History
Created in 2011 by Diego Giacomelli and Giusepe Casagrande, they start their journey with Ships N' Battles, a revamped battleship game with multiplayer between iOS, MacOs and Android devices.
With over 500.000 downloads, Ships N' Battles was a great start.
Projects
Videos
There are currently no trailers available for Skahal Studios. Check back later for more or contact us for specific requests!
Logo & Icon
Team & Repeating Collaborator
- Diego Giacomelli
- Game designer and programmer
- Giusepe Casagrande
- Game designer and artist
Contact
- Inquiries
-<EMAIL_ADDRESS>- twitter.com/skahal
- facebook.com/SkahalStudios
- Web
- skahal.github.io


Share Manager
Home
Button
Project Name
Project Description.
Tasks
Contributors
Task
Task Description.
Contributor Name
Contributor Designation


Orchestrator 1.2.1-beta supports Pseudo GTID (read announcement): a means to refactor the replication topology and connect slaves even without direct relationship; even across failed servers. This post illustrates two such scenarios and shows the visual way of mathcing/re-synching slaves.
Of course, orchestrator is not just a GUI tool; anything done with drag-and-drop is also done via web API (in fact, the drag-and-drop invoke the web API) as well as via command line. I'm mentioning this as this is the grounds for failover automation planned for the future.
Scenario 1: the master unexpectedly dies
The master crashes and cannot be contacted. All slaves are stopped as effect, but each in a different position. Some managed to salvage relay logs just before the master dies, some didn't. In our scenario, all three slaves are at least caught up with the relay log (that is, whatever they managed to pull through the network, they already managed to execute). So they're otherwise sitting idle waiting for something to happen. Well, something's about to happen.
Note the green "Safe mode" button to the right. This means operation is through calculation of binary log files & positions with relation to one's master. But the master is now dead, so let's switch to adventurous mode; in this mode we can drag and drop slaves onto instances normally forbidden. At this stage the web interface allows us to drop a slave onto its sibling or any of its ancestors (including its very own parent, which is a means of reconnecting a slave with its parent). Anyhow:
We notice that orchestrator is already kind enough to say which slave is best candidate to be the new master (<IP_ADDRESS>:22990): this is the slave (or one of the slaves) with most up-to-date data. So we choose to take another server and make it a slave of <IP_ADDRESS>:22990:
And drop:
There we have it: although their shared master is inaccessible, and the two slave's binary log file names & position mean nothing to each other, we are able to correctly match the two and make one child of the other:
Likewise, we do the same with <IP_ADDRESS>:22988:
And end up with our (almost) final topology:
Notice how the two slaves 22988, 22989 are happily replicating from 22990. As far as they're concerned, there is no problem in the topology any more. Now it's your decision: do you decommission the old master? You will need to RESET SLAVE on 22990 (can do via orchestrator), turn off 22990's read_only (can do via orchestrator) and change DNS entries (or what have you).
Scenario 2: a local master ("relay-master") unexpectedly dies
In this scenario we have a deep nested topology, and a local master died. What of its slaves?
We choose one of the children and drag it over onto the master, which is up and healthy:
As you can see we are allowed (green instances are allowed drop places) to drop 22989 on its sibling and on its grandparent, the latter bypassing a broken connection. There is no connection between the two!
And we get a new topology:
22989 is now lagging, but on the right path! Let's do the same for 22988:
And finally:
Great success! 22989 already caught up, 22988 on the way, victory is ours!
The real fun, of course, is to execute with --debug and review the DEBUG messages as orchestrator seeks, finds, matches and follows up on Pseudo GTID entries in the binary logs. We each have our pleasures.
comments powered by Disqus


{% extends "layout.html" %} {% block page_title %} GOV.UK prototype kit {% endblock %} {% block content %} BETA This is a new service – your feedback will help us to improve it. Andrea Authoriser Casterbridge College UKPRN:12345678 Home Contracts Funding claims Subcontractors Settings Sign out Complete sub-contractor details What is the start date? Day Month Year What is the end date? Day Month Year Continue {% endblock %}
BETA This is a new service – your feedback will help us to improve it.
Continue


--- layout: post status: publish published: true title: Podcast 2.23 - Lou, Ryno, Quade, etc. author: display_name: Corey Fineran login: Corey email<EMAIL_ADDRESS>url: '' author_login: Corey author_email<EMAIL_ADDRESS>wordpress_id: 3221 wordpress_url: http://ivyenvy.com/?p=3221 date: '2010-09-02 21:45:59 +0000' date_gmt: '2010-09-03 02:45:59 +0000' categories: - Podcast tags: - Podcast comments: [] ---
Andy, Corey, Kurt and Ryan convene to discuss Lou's sudden departure from the Cubs. We also dip our toes in the "new manager" waters. Don't miss our live podcast recording on Monday, September 13th at Twenty Sports Grill and Nightclub in Downtown Moline.


Securities
Card Title
| Name | Purpose | Company | Host | Check-in | Check-out |
|---|---|---|---|---|---|
| Daniel | Delivery | Bagmane Tech | Diane Bell | 03:20am | 06:23pm |
| johnny | Courier | Dell | Eleanor cooper | 03:20am | over stay |
| Ricardo | General visit | info@hp | Diane Bell | 03:20am | 06:23pm |
| scarllet | Interview | info@hp | Diane Bell | 03:20am | 06:23pm |


Tag Input
Simple and accessible component for creating tags.
Simple
Add, remove and edit tags.
You created tags.
Initial Tags
Pass tags to the tag input on the page load.
You created tags.
Disabled
Read only tags.
You created tags.
Control from Outside
Manage tags dynamically with JavaScript.
You created tags.
Custom Styles
Customize input styles to mach your weblite design.
You created tags.
In the Form
Place the input tag to the form and get tags on submit.


黒の手番です。キューブアクションは？
13-9:19pt
pips Black=87 White=97
(CorrectAnswer= 0/0, ErrorScore= 0)
No double Player Winning Chances: 77.49% (G:32.89% B:0.47%) Opponent Winning Chances: 22.51% (G: 7.36% B:0.55%) Double/Take Player Winning Chances: 77.57% (G:32.75% B:0.47%) Opponent Winning Chances: 22.43% (G: 7.53% B:0.54%) Cubeless Equities: No double=+0.850, Double=+1.679 Cubeful Equities: No double: +0.893 (-0.107) Double/Take: +1.463 (+0.463) Double/Pass: +1.000 Best Cube Action: Double / Pass


Abilities and Stuff
@if(neighbor.cpr) {
} else {
}
CPR
@if(neighbor.firstAid) {
} else {
}
Basic First Aid
Other Medical Trainings:
@if(neighbor.otherMedTrainings) {
@neighbor.otherMedTrainings
} else {
}
Languages
@if(neighbor.languages) {
@neighbor.languages
}else{
They know nothing.
}
Supplies
@if(neighbor.haveGenerator) {
} else {
}
Generator
@if(neighbor.haveFood) {
} else {
}
Food and Water Supplies
Other Medical Supplies:
@if(neighbor.otherMedSupplies) {
@neighbor.otherMedSupplies
} else {
}
Utility Shut-offs
Gas
@neighbor.utilityGaz
Water
@neighbor.utilityWater
Electric
@neighbor.utilityElectric
Family Info
@if(!neighbor.peopleList.isEmpty) {| Is Adult? | Name | Age | Cell Number | |
|---|---|---|---|---|
| @people.name | @people.age | @people.email | @people.cellNumber |


'In the beginning we had to live in the army compound'
Exclusive interview with Rabanit Miriam Levinger, one of the first Jewish residents to return to Hevron.
by Arutz Sheva StaffDon't miss your opportunity to donate and be part of the redemption of another building in Hebron
Arutz Sheva spoke to Rabanit Miriam Levinger, one of the leaders of 'Harchivi Mekom Aholech,' an organization that redeems houses in Hevron.
Levinger is one of the first Jews to return to Hevron following the 1967 Six Day War. "In the beginning we rented a hotel. Moshe Dayan, who was the Defense Minister then, came and took us to the military compound. Dayan then built for us Kiryat Arba."
After encountering resistance from local Arabs to the expansion of Kiryat Arba, Levinger said some of Kiryat Arba's resident decided they needed to reestablish a Jewish presence inside of Hevron proper.
"Because we agreed to move away from Hevron, soon we won't have Kiryat Arba and soon we won't have Hevron. In the beginning it was very difficult, but it started expanding and now we have a few neighborhoods."
"To me it was always very clear, the ways of the father dictate to the children. Abraham started here, King David ruled at the beginning from here, now our stage of history will start from here."
Levinger asked people to donate and "be part of our vision, it's your vision, it's the obligation of the Jewish people to redeem the land of Israel."
Don't miss your opportunity to donate and be part of the redemption of another building in Hebron


Preparation time
overnight
Cooking time
10 to 30 mins
Serves
Makes 1 gingerbread house
Dietary
Create your own winter wonderland with Mary Berry's gingerbread recipe. It makes a wonderful centrepiece for parties, and children will love it.
Equipment and preparation: you will need a piping bag with a medium plain and small nozzle; plus you will need to print off a
downloadable pdf template of the gingerbread design
.
Preheat the oven to 200C/400F/Gas 6 (fan 180C).
Melt the butter, sugar and syrup together in a large pan. Sieve the flour, bicarbonate of soda and ground ginger together into a large bowl and make a well in the centre. Pour in the melted butter mixture, stir it in and, when cool enough to handle, knead to a stiff dough.
Divide the mixture into five equally-sized pieces, cut one of these pieces in half (so you have six pieces in total). Roll each piece out on a sheet of greaseproof paper to ¾cm/⅓in thick. Using the templates, cut out the sections for the roof, sides, front and back of the house. Slide onto three baking trays lined with baking parchment.
Using the template as a guide, a ruler and the rim of a cup, cut out the arched windows on the front and sides of the house.  Using a knife, cut out the door on the front and back of the house and place the doors separately on the baking trays.
Re-roll the trimmings and use to cut out the chimney pieces, three Christmas trees and three triangles to use as supports to help the trees stand upright. Bake the gingerbread for 7-8 minutes.
Meanwhile place the boiled sweets in a pestle and mortar and crush to a rough sand texture.
Remove the gingerbread from the oven. Trim the windows if the mixture has spread and sprinkle the crushed sweets into the windows. Return to the oven and continue to cook for 3-4 minutes, or until the sweets have melted and the gingerbread is firm. Remove from the oven and leave to cool for a few minutes, then trim around the templates again to give clean, sharp edges. Leave to cool completely.
For the icing, whisk the egg whites in a large bowl until frothy. Using a wooden spoon or a hand-held electric mixer on slow speed, add the icing sugar a tablespoonful at a time. Stir in the lemon juice and beat the icing until it is very stiff and white and stands up in peaks. Cover the surface with a damp cloth if not using immediately.
Spoon a little of the icing into a piping bag fitted with a medium plain nozzle. Pipe blobs of icing on the back of each chocolate button and stick, overlapping onto the two roof sections, to create a tile effect. Transfer some icing to another piping bag fitted with a small plain nozzle and pipe frames around the windows, doors and stars to decorate. Spoon six tablespoons of the icing over the cake board and, using a palette knife, spread the icing to cover the board with a snow effect and to create a base to stick the house on to.
Pipe some icing along the wall edges and join the house together on the iced cake board. Leave the icing to dry and harden for a minimum of four hours, but preferably overnight.
Once dry, place two night-lights inside the house before attaching the roof.
Cut the pointed ends of the cocktail sticks into 1cm/½in pieces (you should have 12 small pointed pieces). Push the blunt end of the cocktail stick pieces into the sloping edges of the front and back of the house, leaving the pointed ends sticking out to act as peg supports to attach the roof. (Remember to remove the sharp cocktail sticks from your gingerbread house before eating it, to avoid a choking hazard.) Pipe icing between the cocktail sticks and fix the two roof panels onto the house. Pipe icing around the base and edges of the chimney and attach to the roof.
To decorate, pipe icing along the apex and edges of the roof to look like snow and icicles. Stick the front door in place with icing. Cut the back door into three pieces to use as props to keep the trees upright. Decorate the Christmas trees with piped icing and fix them onto the cake board with icing and gingerbread props. Dust the roof with icing sugar and light the night lights using a candle lighter through the open back door. Do not leave the candles lit unattended, and it is best not to burn the candles inside the house for longer than 15 minutes or they may singe the inside of the roof and start to melt the chocolate buttons.


WITNESS LIST Urban Affairs Committee February 27, 1998-10:00A Housing Issues On: Flores II, Roger (City of San Antonio) Gaitan, Jane (Habitat For Humanity) Williams, Sandra J. (Alamo Area MHA, TACDC) Opening Remarks On: Peak, Howard (Mayor, City San Antonio) Validation For: Griffin, Sarah (City of Leon Valley) On: Wood, William (City of San Antonio) Y2K Problems For: Garza, David M. (Y2K Remediation/Info,Se) Stevens, Jeff (USAA) On: deWitte, Paula S. (Knowledged Based System) Dean, Nancy (SanAntonio Info.Service) DiPaolo, Michael (City-FtWorth/Pub.Tech.) Elizondo, Paul (BxCnty. Commiss', Court) Emley, John (Ultramar Diamond Shamro) Hutchinson, Creston C. (City Public Service) Igo, Shanna (TML) Kieg, Elizabeth J. (Self) Marquez, David E. (BexarCnty,Y2K Proj.Off.) Mireles, Mel (Self) Post, Dr. Don E. (Avatar Inc.) Strombe, Frank (City of San Antonio)


1
How many 'X' symbols (Roman Number) are needed to represent the statement "19+6=25"?
select the correct answer(s):
A
6
B
4
C
10
Your Answer: B
Correct Answer: B
Explanation:
The statement can be represented as
XIX + VI = XXV
Hence total number of "X" are 4


{% extends 'base.html' %} {% block content %} {% include 'banners/banners_carousel.html' %} {% include 'products/product_featured.html' %} {% include 'partials/services.html' %} {% include 'products/product_bestsellers.html' %} {% for video in videos %} {% if video and video.code %} {% autoescape off %} {{ video.code }} {% endautoescape %} {% endif %} {% endfor %} {% include 'products/product_most_viewed.html' %} {% include 'partials/testimonials.html' %} {% include 'partials/sitemap.html' %} {% endblock %}


Congratulations, your application has been successful
You have been successful in this round of funding. Assessor feedback on your application will be available here by 5:30pm on [Date]
Start to plan your project
Your application has not been successful in this competition.
Assessor feedback on your application will be available here by 5:30pm on [Date]
Application not submitted
This application has not been entered into the competition [competition title] as it was not submitted before the competition deadline.


--- layout: post title: Amnesty releases API access to censored files date: 2006-10-27 00:00:00 category: digital-media ---
Amnesty releases API access to censored files: "The irrepressible.info campaign, launched in May, provides javascript banners featuring censored sites and content. The API will give direct access to the irrepressible.info site’s database of censored material so that supporters can create their own applications to distribute the information better."


Watling, the unassuming anchor of New Zealand cricket
WELLINGTON: BJ Watling did on Saturday what he has done on numerous occasions before, thwarted an opposition attack from taking control of a test match and ensured his side stayed in the game.
The 34-year-old, who came to the crease on Friday, scored his eighth test century and combined for 70 runs with Henry Nicholls (41), 119 with Colin de Grandhomme (65) and an unbeaten 78 with Mitchell Santner as he anchored a superb turnaround.
Watling's 119 not out was his second successive test century after he scored 105 not out against Sri Lanka in August, making him the first New Zealand wicketkeeper to score back-to-back centuries.
New Zealand finished the third day on 394-6, a lead of 41 runs after England had been dismissed for 353.
The hosts had been 127-4 late on Friday and in danger of conceding a large first innings deficit to the tourists when he strode to the crease.
Watling's innings was remarkable for its lack of remarkableness.
Unlike the more feted batsmen such as Ross Taylor and Kane Williamson, Watling simply nudges and accumulates with a minimum of fuss and few highlight reel shots.
Such is his relative anonymity, few would remember that he has been part of two world record sixth wicket partnerships, both of which rescued his side from almost certain defeat.
The right hander scored 124 as he and Brendon McCullum put on 352 against India to save the second test in Wellington in 2014, which enabled the hosts to clinch the two-match series.
Watling walked in with New Zealand 94-5 in their second innings and still 148 runs from making the tourists bat again.
When he departed at 446-6, the game was essentially saved and McCullum well on his way to becoming New Zealand's first test triple centurion.
Less than 11 months later, New Zealand held a 24-run second innings lead with five wickets remaining against Sri Lanka when Watling joined Williamson at the Basin Reserve.
The pair then produced an unbroken 365-run partnership, with Watling reaching his highest test score of 142 not out, that helped set up an unlikely 193-run victory.
Those partnerships highlight a career of stubborn rearguard fightbacks by Watling and it is this obstinacy that has drawn praise from team mates and opponents alike.
South Africa fast bowler Dale Steyn once described him as a player "who doesn't want to give his wicket away", while McCullum added Watling's battle to try and save a test against West Indies in Trinidad in 2014 was typical of his character.
"The guy never complains, gets on with the job, goes out there and keeps for a hundred-and-something overs and goes out and bats for seven hours trying to save a test match for his country," McCullum told reporters after the 10-wicket loss.
"It's not the first time he's done it. He's done it on numerous occasions now."
And again on Saturday.
(Reporting by Greg Stutchbury; Editing by Muralikumar Anantharaman)


MN-01 MN-02 MN-03 MN-04 MN-05 MN-06 MN-07 MN-08
MN – Sen. Amy Klobuchar (D) and Sen. Tina Smith (D)
Committees
Amy Klobuchar is the #2 Democrat on the Senate Committee on Commerce, Science, and Transportation
HEP Grants
In the past 9 years, this state has received: 36 HEP grants, totalling $21,650,000
Year Institution Amount ($)
------ ------------------------------------- ------------
2019 University of Minnesota 2,470,000
2018 University of Minnesota 2,399,000
2017 University of Minnesota 2,218,000
2016 University of Minnesota 2,470,000
2015 University of Minnesota 2,479,000
2014 University of Minnesota 2,461,000
2013 University of Minnesota - Minneapolis 4,152,000
2012 University of Minnesota - Duluth 45,000
2012 University of Minnesota - Minneapolis 2,956,000
SC Contracts
In the past 9 years, this state has received: 3 Office of Science contracts, totalling $21,551
Year Vendor Amount ($) Item
------ ---------------------------- ------------ ----------------------------------------
2014 Ideal System Solutions, Inc. 6,326 ADP Central Processing Unit (CPU, Comput
2013 World Data Products, Inc. 7,235 ADP Input/Output And Storage Devices
2013 World Data Products, Inc. 7,990 ADPE System Configuration
NSF MPS Grants
In the past 9 years, this state has received: 578 NSF MPS grants, totalling $168,744,032
Institution Amount ($)
----------------------------------------- ------------
Regents Of University Of Minnesota 150,114,397
University Of Minnesota-Twin Cities 7,201,037
Carleton College 3,007,273
Macalester College 2,721,976
St. Olaf College 1,553,582
Gustavus Adolphus College 870,470
St Cloud State University 566,460
University Of St. Thomas 535,652
Bethel University 512,097
University Of Minnesota Duluth 428,629
Redacted Due To Pii 300,000
Conference Board Of Mathematical Sciences 255,976
Augsburg College 157,925
Pii Redacted 150,000
Winona State University 90,035
College Of Saint Benedict 85,000
North Hennepin Community College 72,183
Hamline University 54,950
Minnesota State University Mankato 24,000
Saint Olaf College 19,390
Saint Mary's University Of Minnesota 14,000
College Of St Scholastica 9,000
SULI/CCI Interns
From 2014-2018, this state had 55 SULI/CCI interns
# Interns Program College
----------- --------- -------------------------------------------
10 SULI St. Olaf College
9 SULI Carleton College
7 SULI University of Minnesota-Twin Cities
5 SULI University of Minnesota
4 SULI University of Minnesota-Duluth
4 SULI University of Saint Thomas
3 SULI Saint John's University
3 SULI Winona State University
2 SULI Concordia College
2 SULI Gustavus Adolphus College
2 SULI St. Cloud State University
1 CCI Minneapolis Community and Technical College
1 SULI Macalester College
1 SULI University of Minnesota-Morris
1 SULI University of Northwestern - St. Paul
55 — — Back to top
MN-01 – Rep. Jim Hagedorn (R) – Wikipedia
HEP Grants
This district received no SC HEP grants from 2012-2020
SC Contracts
This district received no SC contracts from 2012-2020
NSF MPS Grants
In the past 9 years, this district has received: $998,505 in NSF MPS grants.
Year Institution Amount ($)
------ ------------------------------------ ------------
2019 Winona State University 90,035
2018 Gustavus Adolphus College 453,742
2015 Gustavus Adolphus College 212,763
2013 Gustavus Adolphus College 13,450
2012 Gustavus Adolphus College 190,515
2012 Minnesota State University Mankato 24,000
2012 Saint Mary's University Of Minnesota 14,000
SULI/CCI Interns
From 2014-2018, this district had 5 SULI/CCI interns
Term Name College Host Lab Program
----------- -------------------- ------------------------- ------------------------------------- ---------
Summer 2015 Domenic Ofsdahl Winona State University Argonne National Laboratory SULI
Summer 2014 Kevin Michael Brom Winona State University Argonne National Laboratory SULI
Summer 2014 Tad DeGonda Dolphay Winona State University Argonne National Laboratory SULI
Summer 2014 Daniel James Baldwin Gustavus Adolphus College Ames National Laboratory SULI
Spring 2017 Brittany Bice Gustavus Adolphus College Lawrence Berkeley National Laboratory SULI
MN-02 – Rep. Angie Craig (D) – Wikipedia
HEP Grants
This district received no SC HEP grants from 2012-2020
SC Contracts
This district received no SC contracts from 2012-2020
NSF MPS Grants
In the past 9 years, this district has received: $4,580,245 in NSF MPS grants.
Year Institution Amount ($)
------ ------------------ ------------
2019 Carleton College 298,378
2018 Carleton College 109,958
2017 Carleton College 248,608
2017 St. Olaf College 170,199
2016 Carleton College 514,906
2016 St. Olaf College 440,018
2015 Carleton College 230,048
2015 Saint Olaf College 19,390
2015 St. Olaf College 310,884
2014 Carleton College 335,465
2013 Carleton College 732,758
2013 St. Olaf College 310,952
2012 Carleton College 537,152
2012 St. Olaf College 321,529
SULI/CCI Interns
From 2014-2018, this district had 19 SULI/CCI interns
Term Name College Host Lab Program
----------- ----------------------------- ---------------- ------------------------------------- ---------
Summer 2018 Sarah Ann Newsham Carleton College Lawrence Berkeley National Laboratory SULI
Summer 2018 Gabriel Brookman Carleton College Oak Ridge National Laboratory SULI
Summer 2018 Cullen Thomas Irvine Carleton College Ames National Laboratory SULI
Summer 2018 Rachel Gessner St. Olaf College National Renewable Energy Laboratory SULI
Summer 2017 Rachel Gessner St. Olaf College National Renewable Energy Laboratory SULI
Summer 2016 Zachary Michael Norberg St. Olaf College Pacific Northwest National Laboratory SULI
Summer 2016 Adam Rutkowski Carleton College Lawrence Berkeley National Laboratory SULI
Summer 2016 Caitlyn Amanda Rachel Johnson St. Olaf College National Renewable Energy Laboratory SULI
Summer 2015 Jordan Timothy Dull St. Olaf College Argonne National Laboratory SULI
Summer 2015 Joshua Lipstone Carleton College Oak Ridge National Laboratory SULI
Summer 2015 Heena Joo St. Olaf College Pacific Northwest National Laboratory SULI
Summer 2014 Jorden Alyss Johnson St. Olaf College Ames National Laboratory SULI
Summer 2014 Anna Mattson St. Olaf College Idaho National Laboratory SULI
Summer 2014 Jordan Timothy Dull St. Olaf College Brookhaven National Laboratory SULI
Summer 2014 Meghan Mariah Exner St. Olaf College Brookhaven National Laboratory SULI
Summer 2014 Grace Ayres Newman Carleton College Pacific Northwest National Laboratory SULI
Spring 2015 Andrew Beach Peterson Carleton College Los Alamos National Laboratory SULI
Fall 2014 Julia Edith Greenwald Carleton College National Renewable Energy Laboratory SULI
Fall 2014 Andrew Beach Peterson Carleton College Los Alamos National Laboratory SULI
MN-03 – Rep. Dean Phillips (D) – Wikipedia
HEP Grants
This district received no SC HEP grants from 2012-2020
SC Contracts
In the past 9 years, this district has received: 3 Office of Science contracts, totalling $21,551
Year Vendor Amount ($) Item
------ ---------------------------- ------------ ----------------------------------------
2014 Ideal System Solutions, Inc. 6,326 ADP Central Processing Unit (CPU, Comput
2013 World Data Products, Inc. 7,235 ADP Input/Output And Storage Devices
2013 World Data Products, Inc. 7,990 ADPE System Configuration
NSF MPS Grants
In the past 9 years, this district has received: $222,183 in NSF MPS grants.
Year Institution Amount ($)
------ -------------------------------- ------------
2019 Redacted Due To Pii 150,000
2012 North Hennepin Community College 72,183
SULI/CCI Interns
This district had no SULI/CCI interns from 2014-2018
MN-04 – Rep. Betty McCollum (D) – Wikipedia
Committees
Betty McCollum is the #10 Democrat on the House Committee on Appropriations
HEP Grants
This district received no SC HEP grants from 2012-2020
SC Contracts
This district received no SC contracts from 2012-2020
NSF MPS Grants
In the past 9 years, this district has received: $4,080,651 in NSF MPS grants.
Year Institution Amount ($)
------ ----------------------------------------- ------------
2019 Macalester College 279,757
2019 Bethel University 68,260
2018 University Of St. Thomas 100,000
2018 Macalester College 292,737
2018 Conference Board Of Mathematical Sciences 255,976
2018 Bethel University 71,160
2017 Macalester College 34,300
2016 Macalester College 253,682
2015 Macalester College 258,780
2015 Bethel University 13,429
2014 University Of St. Thomas 190,492
2014 Macalester College 601,419
2014 Hamline University 54,950
2013 University Of St. Thomas 52,987
2013 Macalester College 514,987
2013 Bethel University 128,899
2012 Macalester College 486,314
2012 University Of St. Thomas 192,173
2012 Bethel University 230,349
SULI/CCI Interns
From 2014-2018, this district had 6 SULI/CCI interns
Term Name College Host Lab Program
----------- ------------------------ ------------------------------------- -------------------------------------- ---------
Summer 2017 Zachary Robert Skluzacek Macalester College Argonne National Laboratory SULI
Summer 2017 Alison Marie Nevin University of Northwestern - St. Paul Ames National Laboratory SULI
Summer 2016 Anna Grim University of Saint Thomas Lawrence Livermore National Laboratory SULI
Summer 2016 Mitchell Klein University of Saint Thomas Los Alamos National Laboratory SULI
Summer 2016 Emily Vecchia University of Saint Thomas Los Alamos National Laboratory SULI
Summer 2015 Ryan Slechta University of Saint Thomas Los Alamos National Laboratory SULI
MN-05 – Rep. Ilhan Omar (D) – Wikipedia
Committees
Ilhan Omar is the #12 Democrat on the House Subcommittee on Higher Education and Workforce Development
HEP Grants
In the past 9 years, this district has received: $21,605,000 in SC HEP grants.
Institution Amount ($) Start End Principal Investigator Project Title
------------------------------------- ------------ ------- ----- ------------------------ ---------------------------------------------------------------------------------------------------------
University of Minnesota 150,000 2019 2020 Rusack, Roger Very High Precision Clock Distribution Demonstrator System
University of Minnesota 2,152,000 2014 2020 Cushman, Priscilla Physics at the Cosmic Frontier: Direct Detection of Dark Matter with SuperCDMS
University of Minnesota 50,000 2014 2016 Mandic, Vuk Development of Large Cryogenic Semiconductor Detectors
University of Minnesota 5,888,000 2014 2020 Marshak, Marvin Experimental Research at the Intensity Frontier in High Energy Physics
University of Minnesota 2,557,000 2014 2020 Olive, Keith Theoretical High Energy Physics at the University of Minnesota
University of Minnesota 3,700,000 2014 2020 Rusack, Roger Physics at the Energy and Intensity Frontiers
University of Minnesota - Minneapolis 99,000 2013 2014 Cronin-Hennessy Community Summer Study 2013: Snowmass on the Mississippi, July 29 - August 6, 2013
University of Minnesota - Minneapolis 32,000 2013 2014 Pawloski Study of Muon Neutrino and Muon Anti-Neutrino Disappearance with the NOvA Neutrino Oscillation Experiment
University of Minnesota - Minneapolis 3,169,000 2012 2014 Marshak Collaborative Research and Development in Neutrino Physics
University of Minnesota - Minneapolis 3,808,000 2012 2014 Rusack, Olive Experimental and Theoretical High Energy Physics
SC Contracts
This district received no SC contracts from 2012-2020
NSF MPS Grants
In the past 9 years, this district has received: $154,477,053 in NSF MPS grants.
Year Institution Amount ($)
------ ----------------------------------- ------------
2020 Regents Of University Of Minnesota 780,248
2019 Redacted Due To Pii 150,000
2019 Regents Of University Of Minnesota 18,828,514
2018 Regents Of University Of Minnesota 20,612,344
2017 Pii Redacted 150,000
2017 Regents Of University Of Minnesota 19,584,607
2016 Regents Of University Of Minnesota 11,995,568
2015 Regents Of University Of Minnesota 15,975,092
2015 University Of Minnesota-Twin Cities 7,201,037
2014 Regents Of University Of Minnesota 17,629,107
2013 Regents Of University Of Minnesota 18,519,448
2012 Augsburg College 157,925
2012 Regents Of University Of Minnesota 22,893,163
SULI/CCI Interns
From 2014-2018, this district had 13 SULI/CCI interns
Term Name College Host Lab Program
----------- --------------------- ------------------------------------------- -------------------------------------- ---------
Summer 2018 Omar Ahmed University of Minnesota Argonne National Laboratory SULI
Summer 2018 Anna Audrey Nagel University of Minnesota Los Alamos National Laboratory SULI
Summer 2017 Sokamarint Chak University of Minnesota Argonne National Laboratory SULI
Summer 2017 Stephanie Hart University of Minnesota National Renewable Energy Laboratory SULI
Summer 2017 Neal Suhas Bhandarkar University of Minnesota Lawrence Livermore National Laboratory SULI
Summer 2016 Seamus Jones University of Minnesota-Twin Cities Argonne National Laboratory SULI
Summer 2016 John Ke University of Minnesota-Twin Cities Lawrence Berkeley National Laboratory SULI
Summer 2016 Jay Wang University of Minnesota-Twin Cities Lawrence Berkeley National Laboratory SULI
Summer 2016 Mbathio Diagne Minneapolis Community and Technical College National Renewable Energy Laboratory CCI
Summer 2015 Maren Symes University of Minnesota-Twin Cities Pacific Northwest National Laboratory SULI
Summer 2015 John Ke University of Minnesota-Twin Cities Lawrence Berkeley National Laboratory SULI
Summer 2014 Kelly Stifter University of Minnesota-Twin Cities Fermi National Accelerator Laboratory SULI
Spring 2015 Rishabh Mishra University of Minnesota-Twin Cities Oak Ridge National Laboratory SULI
MN-06 – Rep. Tom Emmer (R) – Wikipedia
HEP Grants
This district received no SC HEP grants from 2012-2020
SC Contracts
This district received no SC contracts from 2012-2020
NSF MPS Grants
In the past 9 years, this district has received: $651,460 in NSF MPS grants.
Year Institution Amount ($)
------ ------------------------- ------------
2014 St Cloud State University 436,651
2013 College Of Saint Benedict 42,500
2012 College Of Saint Benedict 42,500
2012 St Cloud State University 129,809
SULI/CCI Interns
From 2014-2018, this district had 5 SULI/CCI interns
Term Name College Host Lab Program
----------- -------------------- -------------------------- ------------------------------ ---------
Summer 2017 Angela Marie Schuler Saint John's University Brookhaven National Laboratory SULI
Summer 2017 Kayla Jansen St. Cloud State University Argonne National Laboratory SULI
Summer 2014 Anthony Pearson St. Cloud State University Los Alamos National Laboratory SULI
Spring 2016 Orlando Lopez Saint John's University Brookhaven National Laboratory SULI
Fall 2015 Orlando Lopez Saint John's University Brookhaven National Laboratory SULI
MN-07 – Rep. Collin C. Peterson (D) – Wikipedia
HEP Grants
This district received no SC HEP grants from 2012-2020
SC Contracts
This district received no SC contracts from 2012-2020
NSF MPS Grants
In the past 9 years, this district has received: $140,000 in NSF MPS grants.
Year Institution Amount ($)
------ ---------------------------------- ------------
2018 Regents Of University Of Minnesota 45,170
2016 Regents Of University Of Minnesota 94,830
SULI/CCI Interns
From 2014-2018, this district had 3 SULI/CCI interns
Term Name College Host Lab Program
----------- -------------------------- ------------------------------ ------------------------------------ ---------
Summer 2018 Chloe Falling Leaf Whitten Concordia College Brookhaven National Laboratory SULI
Summer 2016 Calvin Lee Cicha University of Minnesota-Morris National Renewable Energy Laboratory SULI
Spring 2018 Casey Thomas Haack Concordia College National Renewable Energy Laboratory SULI
MN-08 – Rep. Pete Stauber (R) – Wikipedia
HEP Grants
In the past 9 years, this district has received: $45,000 in SC HEP grants.
Institution Amount ($) Start End Principal Investigator Project Title
-------------------------------- ------------ ------- ----- ------------------------ ----------------------------------------------------------------------
University of Minnesota - Duluth 45000 2012 2013 Hiller Nonperturbative Analysis of Field Theories Quantized on the Light Cone
SC Contracts
This district received no SC contracts from 2012-2020
NSF MPS Grants
In the past 9 years, this district has received: $3,593,935 in NSF MPS grants.
Year Institution Amount ($)
------ ---------------------------------- ------------
2019 Regents Of University Of Minnesota 49,994
2018 Regents Of University Of Minnesota 521,108
2017 Regents Of University Of Minnesota 525,087
2016 College Of St Scholastica 9,000
2016 Regents Of University Of Minnesota 290,048
2015 Regents Of University Of Minnesota 150,662
2015 University Of Minnesota Duluth 428,629
2014 Regents Of University Of Minnesota 437,081
2013 Regents Of University Of Minnesota 693,056
2012 Regents Of University Of Minnesota 489,270
SULI/CCI Interns
From 2014-2018, this district had 4 SULI/CCI interns
Term Name College Host Lab Program
----------- -------------- ------------------------------ -------------------------------------- ---------
Summer 2018 Tayler Hebner University of Minnesota-Duluth Oak Ridge National Laboratory SULI
Summer 2017 Noah Holden University of Minnesota-Duluth Ames National Laboratory SULI
Summer 2016 Paul Vaynshenk University of Minnesota-Duluth National Renewable Energy Laboratory SULI
Summer 2016 Ellen Monzo University of Minnesota-Duluth Lawrence Livermore National Laboratory SULI


|
ArkGameFrame
v0.1.0
ArkGameFraime is a lightweight, fast, scalable, distributed module and plugin framework to create a game server easily. Greatly inspired by OGRE and Bigworld.
|
Directories | |
| directory | NFConfigPlugin |
| directory | NFCore |
| directory | NFEventDefine |
| directory | NFKernelPlugin |
| directory | NFLogPlugin |
| directory | NFNet |
| directory | NFPluginLoader |
| directory | NFPluginModule |


What I like about HTMl is that theres such an extensive variety of code that you can use in it and that there is so many different peices to it. Theres the head, style, body, script, and the list goes on. My favorite part of HTML is using the style section.The style section is the part that brings the entire web page together and lets you be creative. Typing in all of this code and then clicking a button and watching your work come alive is so interesting. When you struggle with learning everything at the begining its such an amazing feeling to finally understand more of it.


Every character (letter, digit, punctuation, emoji,...) of any language has its own codepoint and name in the Unicode character set. At least, that is what the Unicode Consortium is aiming for. For more info, see the Unicode FAQ.
Unicode only describes the name and meaning of a character, not how it should be shown on screen or in print. That is the task of the font and leads to some issues:
This app knows details about a lot of characters.
Use the other tabs to find out more:
Characters are shown like this:
Meaning:
Type in (or copy in) some text. Information about all characters in it will be shown.
For example:
Your text to split in characters:
Type in a partial name of a character or type in its code to find out about it. When you type in a numerical code (decimal or hexadecimal), some characters around it will also be shown. Note that some values are recognized as both decimal and hexadecimal - you get more results.
When there are too many matches, the list is truncated. Use a more specific search (you can use multiple words in any order) to get a more specific result.
Examples: phone, star or twelve
Or multiple words: digit circled
The name or code to search for:
Characters are grouped in blocks. Select a block to see its characters.
Some characters may be replaced by an empty rectangle: this means that the current font cannot display it.
Examples: Emoticons, Miscellaneous Symbols or Hebrew.


§412:3-109 Charging down assets. The commissioner may require any asset on the books of a Hawaii financial institution to be charged down to such sum as represents its fair value. [L 1993, c 350, pt of §1]


{{define "youtube"}}
NB: Admin only page. Make sure to authenticate only with application youtube account - {{.}}.
Application not logged into google account-{{.}}
Proceed to youtube oauth


|
JavaTM 2 Platform Standard Ed. 5.0 |
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object java.awt.Polygon
public class Polygon
The Polygon
class encapsulates a description of a
closed, two-dimensional region within a coordinate space. This
region is bounded by an arbitrary number of line segments, each of
which is one side of the polygon. Internally, a polygon
comprises of a list of (x, y)
coordinate pairs, where each pair defines a vertex of the
polygon, and two successive pairs are the endpoints of a
line that is a side of the polygon. The first and final
pairs of (x, y) points are joined by a line segment
that closes the polygon. This Polygon
is defined with
an even-odd winding rule. See
WIND_EVEN_ODD
for a definition of the even-odd winding rule.
This class's hit-testing methods, which include the
contains
, intersects
and inside
methods, use the insideness definition described in the
Shape
class comments.
Shape
,
Serialized Form| Field Summary | |
|---|---|
protected Rectangle |
bounds
Bounds of the polygon. |
int |
npoints
The total number of points. |
int[] |
xpoints
The array of x coordinates. |
int[] |
ypoints
The array of y coordinates. |
| Constructor Summary | |
|---|---|
Polygon()
Creates an empty polygon. |
|
Polygon(int[] xpoints,
int[] ypoints,
int npoints)
Constructs and initializes a Polygon from the specified
parameters. |
| Method Summary | |
|---|---|
void |
addPoint(int x,
int y)
Appends the specified coordinates to this Polygon . |
boolean |
contains(double x,
double y)
Determines if the specified coordinates are inside this Polygon . |
boolean |
contains(double x,
double y,
double w,
double h)
Tests if the interior of this Polygon entirely
contains the specified set of rectangular coordinates. |
boolean |
contains(int x,
int y)
Determines whether the specified coordinates are inside this Polygon . |
boolean |
contains(Point p)
Determines whether the specified Point is inside this
Polygon . |
boolean |
contains(Point2D p)
Tests if a specified Point2D is inside the boundary of this
Polygon . |
boolean |
contains(Rectangle2D r)
Tests if the interior of this Polygon entirely
contains the specified Rectangle2D . |
Rectangle |
getBoundingBox()
Deprecated. As of JDK version 1.1, replaced by getBounds() . |
Rectangle |
getBounds()
Gets the bounding box of this Polygon . |
Rectangle2D |
getBounds2D()
Returns the high precision bounding box of the Shape . |
PathIterator |
getPathIterator(AffineTransform at)
Returns an iterator object that iterates along the boundary of this Polygon and provides access to the geometry
of the outline of this Polygon . |
PathIterator |
getPathIterator(AffineTransform at,
double flatness)
Returns an iterator object that iterates along the boundary of the Shape and provides access to the geometry of the
outline of the Shape . |
boolean |
inside(int x,
int y)
Deprecated. As of JDK version 1.1, replaced by contains(int, int) . |
boolean |
intersects(double x,
double y,
double w,
double h)
Tests if the interior of this Polygon intersects the
interior of a specified set of rectangular coordinates. |
boolean |
intersects(Rectangle2D r)
Tests if the interior of this Polygon intersects the
interior of a specified Rectangle2D . |
void |
invalidate()
Invalidates or flushes any internally-cached data that depends on the vertex coordinates of this Polygon . |
void |
reset()
Resets this Polygon object to an empty polygon. |
void |
translate(int deltaX,
int deltaY)
Translates the vertices of the Polygon by
deltaX along the x axis and by
deltaY along the y axis. |
| Methods inherited from class java.lang.Object |
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
| Field Detail |
|---|
public int npoints
npoints
represents the number of valid points in this Polygon
and might be less than the number of elements in
xpoints
or ypoints
.
This value can be NULL.
addPoint(int, int)
public int[] xpoints
Polygon
. The extra elements allow new points
to be added to this Polygon
without re-creating this
array. The value of npoints
is equal to the
number of valid points in this Polygon
.
addPoint(int, int)
public int[] ypoints
Polygon
. The extra elements allow new points
to be added to this Polygon
without re-creating this
array. The value of npoints
is equal to the
number of valid points in this Polygon
.
addPoint(int, int)
protected Rectangle bounds
getBoundingBox()
,
getBounds()
| Constructor Detail |
|---|
public Polygon()
public Polygon(int[] xpoints, int[] ypoints, int npoints)
Polygon
from the specified
parameters.
xpoints
- an array of x coordinatesypoints
- an array of y coordinatesnpoints
- the total number of points in the
Polygon
NegativeArraySizeException
- if the value of
npoints
is negative.
IndexOutOfBoundsException
- if npoints
is
greater than the length of xpoints
or the length of ypoints
.
NullPointerException
- if xpoints
or
ypoints
is null
.| Method Detail |
|---|
public void reset()
Polygon
object to an empty polygon.
The coordinate arrays and the data in them are left untouched
but the number of points is reset to zero to mark the old
vertex data as invalid and to start accumulating new vertex
data at the beginning.
All internally-cached data relating to the old vertices
are discarded.
Note that since the coordinate arrays from before the reset
are reused, creating a new empty Polygon
might
be more memory efficient than resetting the current one if
the number of vertices in the new polygon data is significantly
smaller than the number of vertices in the data from before the
reset.
invalidate()
public void invalidate()
Polygon
.
This method should be called after any direct manipulation
of the coordinates in the xpoints
or
ypoints
arrays to avoid inconsistent results
from methods such as getBounds
or contains
that might cache data from earlier computations relating to
the vertex coordinates.
getBounds()
public void translate(int deltaX, int deltaY)
Polygon
by
deltaX
along the x axis and by
deltaY
along the y axis.
deltaX
- the amount to translate along the x axisdeltaY
- the amount to translate along the y axispublic void addPoint(int x, int y)
Polygon
.
If an operation that calculates the bounding box of this
Polygon
has already been performed, such as
getBounds
or contains
, then this
method updates the bounding box.
x
- the specified x coordinatey
- the specified y coordinategetBounds()
,
contains(java.awt.Point)
public Rectangle getBounds()
Polygon
.
The bounding box is the smallest Rectangle
whose
sides are parallel to the x and y axes of the
coordinate space, and can completely contain the Polygon
.
getBounds
in interface Shape
Rectangle
that defines the bounds of this
Polygon
.Shape.getBounds2D()
@Deprecated public Rectangle getBoundingBox()
getBounds()
.
Polygon
.
Polygon
.public boolean contains(Point p)
Point
is inside this
Polygon
.
p
- the specified Point
to be tested
true
if the Polygon
contains the
Point
; false
otherwise.contains(double, double)
public boolean contains(int x, int y)
Polygon
.
x
- the specified x coordinate to be testedy
- the specified y coordinate to be tested
true
if this Polygon
contains
the specified coordinates, (x, y);
false
otherwise.contains(double, double)
@Deprecated public boolean inside(int x, int y)
contains(int, int)
.
Polygon
.
x
- the specified x coordinate to be testedy
- the specified y coordinate to be tested
true
if this Polygon
contains
the specified coordinates, (x, y);
false
otherwise.contains(double, double)
public Rectangle2D getBounds2D()
Shape
.
getBounds2D
in interface Shape
Rectangle2D
that precisely
bounds the Shape
.Shape.getBounds()
public boolean contains(double x, double y)
Polygon
. For the definition of
insideness, see the class comments of Shape
.
contains
in interface Shape
x
- the specified x coordinatey
- the specified y coordinate
true
if the Polygon
contains the
specified coordinates; false
otherwise.public boolean contains(Point2D p)
Point2D
is inside the boundary of this
Polygon
.
contains
in interface Shape
p
- a specified Point2D
true
if this Polygon
contains the
specified Point2D
; false
otherwise.contains(double, double)
public boolean intersects(double x, double y, double w, double h)
Polygon
intersects the
interior of a specified set of rectangular coordinates.
intersects
in interface Shape
x
- the x coordinate of the specified rectangular
shape's top-left cornery
- the y coordinate of the specified rectangular
shape's top-left cornerw
- the width of the specified rectangular shapeh
- the height of the specified rectangular shape
true
if the interior of this
Polygon
and the interior of the
specified set of rectangular
coordinates intersect each other;
false
otherwiseArea
public boolean intersects(Rectangle2D r)
Polygon
intersects the
interior of a specified Rectangle2D
.
intersects
in interface Shape
r
- a specified Rectangle2D
true
if this Polygon
and the
interior of the specified Rectangle2D
intersect each other; false
otherwise.Shape.intersects(double, double, double, double)
public boolean contains(double x, double y, double w, double h)
Polygon
entirely
contains the specified set of rectangular coordinates.
contains
in interface Shape
x
- the x coordinate of the top-left corner of the
specified set of rectangular coordinatesy
- the y coordinate of the top-left corner of the
specified set of rectangular coordinatesw
- the width of the set of rectangular coordinatesh
- the height of the set of rectangular coordinates
true
if this Polygon
entirely
contains the specified set of rectangular
coordinates; false
otherwiseArea
,
Shape.intersects(double, double, double, double)
public boolean contains(Rectangle2D r)
Polygon
entirely
contains the specified Rectangle2D
.
contains
in interface Shape
r
- the specified Rectangle2D
true
if this Polygon
entirely
contains the specified Rectangle2D
;
false
otherwise.contains(double, double, double, double)
public PathIterator getPathIterator(AffineTransform at)
Polygon
and provides access to the geometry
of the outline of this Polygon
. An optional
AffineTransform
can be specified so that the coordinates
returned in the iteration are transformed accordingly.
getPathIterator
in interface Shape
at
- an optional AffineTransform
to be applied to the
coordinates as they are returned in the iteration, or
null
if untransformed coordinates are desired
PathIterator
object that provides access to the
geometry of this Polygon
.public PathIterator getPathIterator(AffineTransform at, double flatness)
Shape
and provides access to the geometry of the
outline of the Shape
. Only SEG_MOVETO, SEG_LINETO, and
SEG_CLOSE point types are returned by the iterator.
Since polygons are already flat, the flatness
parameter
is ignored. An optional AffineTransform
can be specified
in which case the coordinates returned in the iteration are transformed
accordingly.
getPathIterator
in interface Shape
at
- an optional AffineTransform
to be applied to the
coordinates as they are returned in the iteration, or
null
if untransformed coordinates are desiredflatness
- the maximum amount that the control points
for a given curve can vary from colinear before a subdivided
curve is replaced by a straight line connecting the
endpoints. Since polygons are already flat the
flatness
parameter is ignored.
PathIterator
object that provides access to the
Shape
object's geometry.
|
JavaTM 2 Platform Standard Ed. 5.0 |
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
Copyright © 2004, 2010 Oracle and/or its affiliates. All rights reserved. Use is subject to license terms. Also see the documentation redistribution policy.


Registration for PUPC 2016 is expected to begin in the summer of 2016.
Any eligible individual may choose to compete in one or both events, subject to the conditions below. Note that registration for each part is separate.
Onsite(held on Nov. 21, 2015 at Princeton University and our two international chapters)
Only individual contestants will be allowed to participate in the PUPC onsite session. Individuals must not have been enrolled full-time in a post-secondary institution during the course of the competition (i.e., this means you are currently a high school student).
All individuals must be registered to compete. Depending on the number of registrations it may be necessary to cap the number of participants or to hold simple preliminary rounds to assure the highest-quality competitors. It is to your advantage to register as soon as possible. Please note that if you register, you are expected to arrive on site on the day of PUPC; if your availability changes later, please notify us as soon as possible by e-mailing<EMAIL_ADDRESS>In case of no-show without advance notice, with high probability you will not be permitted to participate on campus again.
Coordination with PUMaC
For those who intend to compete in both the PUPC Onsite Test and the mathematics competition, PUMaC, please note that PUMaC will be holding a round for eligible finalists at the time of PUPC Onsite Test. If you also compete in PUMaC earlier in the day and are chosen as a PUMaC finalist, you will have an opportunity to take our 40-minute Short Version of the Onsite Test after your PUMaC event (please see our schedule). Hence, you should not worry about this matter.
Online(completed at any location(s) convenient for team members during the week of Nov. 9-15, 2015)
A full team will consist of anywhere between 2 and 6 members.
A team member must not have been enrolled full-time in a post-secondary institution during the course of the competition.
All teams must register to compete. Depending on the number of registrations it may be necessary to cap the number of participants or to hold simple preliminary rounds to assure the highest-quality competitors. It is to your advantage to register as soon as possible. (For reference, the partial 2014 list of registered individuals is available here.)
No team can be added to the competition after the registration deadline, unless the current Director, Finance Chair, or Registration Chair of the Princeton University Physics Competition gives permission to do so.
Generally, teams are expected to come from single high schools, but teams comprising members from several schools will be allowed for their own convenience, in which case all high schools must be specified in the corresponding field on the registration form.
There will be a single set of problems which participants in any grade of high school might attempt. In other words, a team may have members from different grades of high school, but the problems that they have to solve will be the same. Please specify the grade level of each team member next to their name in the registration form for logistical purposes.
The Onsite Test
The 2015 PUPC Onsite Test at Princeton will be held on Saturday, November 21, 2015. The schedule of events for that day and directions to campus are available here.
Rules: Onsite Test
Each participant of PUPC will take one individual onsite test, which will contain several problems in Mechanics (kinematics and dynamics), and partial credit is awarded as appropriate.
Participants are expected to record their answers on an official PUPC answer sheet.
Participants are NOT allowed to collaborate on this part of the competition.
The individual test will have a time limit of two hours.
The Online Part
Note: The 2015 PUPC Online Part has been released on November 9, 2015 both through e-mail to all team managers and online here. All teams are entitled to use our Piazza page as a resource aiming to parallel a live Q&A format, addressing any clarifications on the material throughout the competition period.
The Online Part is a way for PUPC to expose a team to what real physics is about: questions that may take more than an hour or two and require creative thinking for solutions.
Rules: Online Part
The Online Part will present interesting definitions or advanced concepts in one broad area of physics.
The main theme for this year's Online Part is atomic physics.
The two subfields offered for the Online Part last year (2014) were condensed matter and cosmology.
The entire team may collaborate on this test. There is no rigid time limit, except teams must submit their solutions before the submission due date specified below. As such, the team will have approximately a week to work on the exam. Different teams may not collaborate with each other.
Teams may use any computational resources they might find helpful, such as Wolfram Alpha/Mathematica, Matlab, Excel, or lower level programming languages (C++, Java, Python, etc).
You may use written sources of information for reference, but you must cite each source you used in accordance with the official policy practiced at Princeton University.
Students will be required to submit written solutions with justification (proof-based, but not necessarily rigorous, unless specified).
Solutions should be sent to the address<EMAIL_ADDRESS>with your team ID in the Subject field. Only one person per team, identified as the "team manager" during registration, should send this e-mail. (Team managers will receive their team ID via e-mail before the Online Part is released.) Each submitted page should also have on it the team ID number and problem number, and the front page should include the signatures of all contestants in that team.
Although not necessary by any means, typed solutions are welcome. (For help with this, please refer to the LaTeX Wikibook.) Otherwise, please scan or take a high-resolution photo of each of your handwritten pages and convert into a .pdf document. In both cases, solutions should be uploaded as a single attachment in .pdf format to your team's single e-mail message.
Submission
Teams must submit their Online Part solutions by e-mailing<EMAIL_ADDRESS>in accordance with the Test Rules specified above by 11:59 pm Eastern Time (UTC-5) on November 15, 2015. Teams would still be able to submit their solutions to the Online Part at a later time, but we cannot guarantee that they will be considered.
Scoring
The Judging Committee will create separate rankings for the two parts of the competition: the Online and the Onsite parts.
In the case of a tie in the individual rankings, the advantage will be given to the participant solving the more difficult questions on the Onsite Part. If a tie persists, the participant with the more elegant solution will be given the advantage.