| Home | Libraries | People | FAQ | More |
The match_flag_type
match_partial
can be passed
to the following algorithms: regex_match
, regex_search
, and regex_grep
, and used with the iterator
regex_iterator
.
When used it indicates that partial as well as full matches should be found.
A partial match is one that matched one or more characters at the end of the
text input, but did not match all of the regular expression (although it may
have done so had more input been available). Partial matches are typically
used when either validating data input (checking each character as it is entered
on the keyboard), or when searching texts that are either too long to load
into memory (or even into a memory mapped file), or are of indeterminate length
(for example the source may be a socket or similar). Partial and full matches
can be differentiated as shown in the following table (the variable M represents
an instance of match_results
as filled in by regex_match
,
regex_search
or regex_grep
):
match_flag_type
match_partial
可以被传入如下算法： regex_match
, regex_search
, 和 regex_grep
还有迭代器 regex_iterator
。 这意味着部分匹配和完全匹配同样被寻找。
部分匹配是指在输出文本的结尾时匹配一个或多个字符，但并不匹配完整的正则表达式(可能有更多输入时可以做到)。
部分匹配典型地被应用于验证数据输入(当从键盘键入时检查每个字符)，或在过长(不能调入内存，甚至映射文件)
或不定长(例如socket源或类似)的文本中搜索。部分匹配和完全匹配的差别在下面的表格中显示
(变量M代表在 regex_match
, regex_search
或 regex_grep
中填充的 match_results
实例)：
|
Result 结果 |
M[0].matched |
M[0].first |
M[0].second |
|
|---|---|---|---|---|
|
No match |
False |
Undefined |
Undefined |
Undefined |
|
Partial match |
True |
False |
Start of partial match. |
End of partial match (end of text). |
|
Full match |
True |
True |
Start of full match. |
End of full match. |
Be aware that using partial matches can sometimes result in somewhat imperfect
behavior:
注意使用部分匹配有时会导致不完美的行为：
The following example tests to see whether the text could be a valid credit
card number, as the user presses a key, the character entered would be added
to the string being built up, and passed to is_possible_card_number
.
If this returns true then the text could be a valid card number, so the user
interface's OK button would be enabled. If it returns false, then this is not
yet a valid card number, but could be with more input, so the user interface
would disable the OK button. Finally, if the procedure throws an exception
the input could never become a valid number, and the inputted character must
be discarded, and a suitable error indication displayed to the user.
下面的例子用来测试文本是否是有效的信用卡号码，当用户按键时，键入的字符被加入到生成的字符串中，并传入
is_possible_card_number
。
如果返回true说明文本是有效的卡号，这样用户界面的OK按钮可以被按下。
如果返回false说明不是有效的卡号，但可以有更多输入，那么用户界面的OK按钮就被禁用。
最后，如果过程扔出异常，输出不可能成为一个有效的卡号，并且输入的字符将被扔掉，并且适当的错误提示会显示给用户。
#include <string> #include <iostream> #include <boost/regex.hpp> boost::regex e("(\\d{3,4})[- ]?(\\d{4})[- ]?(\\d{4})[- ]?(\\d{4})"); bool is_possible_card_number(const std::string& input) { // // return false for partial match, true for full match, or throw for // impossible match based on what we have so far... boost::match_results<std::string::const_iterator> what; if(0 == boost::regex_match(input, what, e, boost::match_default | boost::match_partial)) { // the input so far could not possibly be valid so reject it: throw std::runtime_error( "Invalid data entered - this could not possibly be a valid card number"); } // OK so far so good, but have we finished? if(what[0].matched) { // excellent, we have a result: return true; } // what we have so far is only a partial match... return false; }
In the following example, text input is taken from a stream containing an unknown
amount of text; this example simply counts the number of html tags encountered
in the stream. The text is loaded into a buffer and searched a part at a time,
if a partial match was encountered, then the partial match gets searched a
second time as the start of the next batch of text:
在下面的例子中，文本从流中输入，大小未知；这个例子简单地记录流中遇到html标签的次数。
文本被调入缓存，每次搜索一部分，如果遇到一个部分匹配，那么在下一批文本的开始处进行第2次部分匹配：
#include <iostream> #include <fstream> #include <sstream> #include <string> #include <boost/regex.hpp> // match some kind of html tag: boost::regex e("<[^>]*>"); // count how many: unsigned int tags = 0; void search(std::istream& is) { // buffer we'll be searching in: char buf[4096]; // saved position of end of partial match: const char* next_pos = buf + sizeof(buf); // flag to indicate whether there is more input to come: bool have_more = true; while(have_more) { // how much do we copy forward from last try: unsigned leftover = (buf + sizeof(buf)) - next_pos; // and how much is left to fill: unsigned size = next_pos - buf; // copy forward whatever we have left: std::memmove(buf, next_pos, leftover); // fill the rest from the stream: is.read(buf + leftover, size); unsigned read = is.gcount(); // check to see if we've run out of text: have_more = read == size; // reset next_pos: next_pos = buf + sizeof(buf); // and then iterate: boost::cregex_iterator a( buf, buf + read + leftover, e, boost::match_default | boost::match_partial); boost::cregex_iterator b; while(a != b) { if((*a)[0].matched == false) { // Partial match, save position and break: next_pos = (*a)[0].first; break; } else { // full match: ++tags; } // move to next match: ++a; } } }


public class Bigboard
extends java.lang.Object
Copyright (c) 2018 Jake Chiang
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
 IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
This class represents an immutable bit array data structure where each bit corresponds to a position on a 2D board. Bits are indexed according to a Little-Endian Rank-File mapping, i.e. the least significant bit is mapped to the lower left corner of the board and subsequent bits are mapped across each rank, starting at the first rank. So, a 3x3 board would be indexed as:
6 7 8 3 4 5 0 1 2
| Modifier and Type | Class and Description |
|---|---|
static class |
Bigboard.Pair
A pair of boards.
|
| Constructor and Description |
|---|
Bigboard(Bigboard other)
Constructs a new Bigboard equal to another.
|
Bigboard(int width,
int height)
Creates a new bitboard of given width and height.
|
Bigboard(int width,
int height,
long other)
Constructs a new Bigboard of given width and height equal to another
board of the same dimensions represented by a single long.
|
| Modifier and Type | Method and Description |
|---|---|
Bigboard |
and(Bigboard other)
Computes bitwise AND with another board and returns the result.
|
Bigboard |
and(long other)
Computes bitwise AND with another board represented by a single long and
returns the result.
|
int |
bitScanForward()
Returns the index of the least significant 1 bit of this board.
|
boolean |
empty()
Returns whether this board is empty (i.e.
|
boolean |
equals(java.lang.Object o) |
static Bigboard |
fileMask(int width,
int height,
int file)
Creates a mask of a file for a board of given dimensions.
|
Bigboard |
flip(int index)
Flips the bit at the given index on the board (i.e.
|
Bigboard |
flip(int x,
int y)
Flips the bit at the given position on the board (i.e.
|
static void |
flipToString(boolean flip)
Set whether to flip the board representation of
toString()
vertically. |
boolean |
get(int index)
Returns the bit at the given index on the board.
|
boolean |
get(int x,
int y)
Returns the bit at the given position on the board, as specified by its
xy-coordinates.
|
int |
hashCode() |
int |
height()
Returns the height of this board.
|
Bigboard |
left(int amount)
Computes a bitwise left shift of a given number of bits and returns the
result.
|
Bigboard |
lsb()
Returns a board of just the least-significant 1 bit (LS1B/LSB) of this
board.
|
Bigboard |
not()
Computes the bitwise NOT of this board and returns the result as a new
board.
|
Bigboard |
or(Bigboard other)
Computes bitwise OR with another board and returns the result.
|
Bigboard |
or(long other)
Computes bitwise OR with another board represented by a single long and
returns the result.
|
int |
popCount()
Returns the population count (number of 1 bits) in this board.
|
Bigboard.Pair |
popLsb()
Returns two boards respectively containing just the least-significant 1
bit (LS1B/LSB) of this board and a copy of this board but without the
LS1B.
|
static Bigboard |
rankMask(int width,
int height,
int rank)
Creates a mask of a rank for a board of given dimensions.
|
Bigboard |
resetLsb()
Returns a copy of this board without its least-significant 1 bit
(LS1B/LSB)
|
Bigboard |
right(int amount)
Computes a logical bitwise right shift of a given number of bits and
returns the result.
|
Bigboard |
set(int index)
Sets the bit at the given index on the board to 1.
|
Bigboard |
set(int x,
int y)
Sets the bit at the given position on the board to 1.
|
Bigboard |
shiftLeft()
Computes a bitwise left shift by 1 bit and returns the result.
|
Bigboard |
shiftRight()
Computes a bitwise right shift by 1 bit and returns the result.
|
int |
size()
Returns the total number of positions on this board.
|
java.lang.String |
toString()
Returns a String depicting the bits in their board positions.
|
java.lang.String |
toStringFlipped()
Returns a String depicting the bits in their board positions.
|
Bigboard |
unset(int index)
Sets the bit at the given index on the board to 0.
|
Bigboard |
unset(int x,
int y)
Sets the bit at the given position on the board to 0.
|
int |
width()
Returns the width of this board.
|
Bigboard |
xor(Bigboard other)
Computes bitwise XOR with another board and returns the result.
|
Bigboard |
xor(long other)
Computes bitwise XOR with another board represented by a single long and
returns the result.
|
public Bigboard(int width, int height)
width
- The width of the board. Must be greater than 0.height
- The height of the board. Must be greater than 0.public Bigboard(int width, int height, long other)
width
- The width of the board. Must be greater than 0.height
- The height of the board. Must be greater than 0.other
- The other board that this new Bigboard will equal.public Bigboard(Bigboard other)
other
- The Bigboard which this new Bigboard will equal. Must not be
null.public static void flipToString(boolean flip)
toString()
vertically. If this is true, then toString()
will be equivalent
to toStringFlipped()
.flip
- Whether to make toString()
act like
toStringFlipped()
and flip its representation of the
board vertically.toString()
,
toStringFlipped()
public static Bigboard fileMask(int width, int height, int file)
width
- The width of the board to make a mask for.height
- The height of the board to make a mask for.file
- The index of the file to make a mask of. Must specify a
valid file on this board. Files are indexed with the
left-most file as file 0.public static Bigboard rankMask(int width, int height, int rank)
width
- The width of the board to make a mask for.height
- The height of the board to make a mask for.rank
- The index of the rank to make a mask of. Must specify a
valid rank on this board. Ranks are indexed with the
lower-most rank as rank 0.public int width()
public int height()
public int size()
public Bigboard set(int index)
index
- The index of the position on the board to set to 1. Must be
non-negative and less than board width * height.public Bigboard set(int x, int y)
x
- The x-coordinate of the position on the board to set to 1. Must be
non-negative and less than the board's width.y
- The y-coordinate of the position on the board to set to 1. Must be
non-negative and less than the board's height.public Bigboard unset(int index)
index
- The index of the position on the board to set to 0. Must be
non-negative and less than board width * height.public Bigboard unset(int x, int y)
x
- The x-coordinate of the position on the board to set to 0. Must be
non-negative and less than the board's width.y
- The y-coordinate of the position on the board to set to 0. Must be
non-negative and less than the board's height.public Bigboard flip(int index)
index
- The index of the position on the board to flip. Must be
non-negative and less than board width * height.public Bigboard flip(int x, int y)
x
- The x-coordinate of the position on the board to flip. Must be
non-negative and less than the board's width.y
- The y-coordinate of the position on the board to flip. Must be
non-negative and less than the board's height.public Bigboard and(Bigboard other)
other
- The board to compute bitwise AND with.public Bigboard or(Bigboard other)
other
- The board to compute bitwise OR with.public Bigboard xor(Bigboard other)
other
- The board to compute bitwise XOR with.public Bigboard left(int amount)
amount
- The number of bits to left shift this board. Must be
non-negativepublic Bigboard right(int amount)
amount
- The number of bits to left shift this board. Must be
non-negative.public Bigboard shiftLeft()
left(1)
, but more efficient.left(int)
public Bigboard shiftRight()
right(1)
, but more efficient.right(int)
public Bigboard and(long other)
other
- The board to compute bitwise AND with.public Bigboard or(long other)
other
- The board to compute bitwise OR with.public Bigboard xor(long other)
other
- The board to compute bitwise XOR with.public Bigboard not()
public boolean get(int index)
index
- The index of the position on the board to get the bit of.
Must be non-negative and less than board width * height.public boolean get(int x, int y)
x
- The x-coordinate of the position on the board to get the bit of.
Must be non-negative and less than the board width.y
- The y-coordinate of the position on the board to get the bit of.
Must be non-negative and less than the board height.public Bigboard lsb()
public Bigboard resetLsb()
public Bigboard.Pair popLsb()
This is equivalent to doing both lsb()
and resetLsb()
.
public int popCount()
public int bitScanForward()
public boolean empty()
public java.lang.String toString()
For example, a 4x4 board for the binary value of 25 would be: . . . . . . . . X . . . X . . X
toString
in class java.lang.Object
toStringFlipped()
public java.lang.String toStringFlipped()
toString()
,
but flipped vertically.
For example, a 4x4 board for the binary value of 25 would be: X . .


{% set title = 'Components › Chat Box' %} {% set page = 'components-chat-box.html' %} {% extends 'layouts/master.html' %} {% block content %} Chat Box Dashboard Components Chat Box Chat Boxes The chat component and is equipped with a JavaScript API, making it easy for you to integrate with Back-end. Who's Online? Hasan Basri Online Bagus Dwi Cahya Offline Wildan Ahdian Online Rizal Fakhri Online Chat with Rizal Chat with Ryan {% endblock %} {% block page_js %} {% endblock %}
The chat component and is equipped with a JavaScript API, making it easy for you to integrate with Back-end.


Cascade framework normalises form elements without forcing you into a specific layout.
Cells embedded into a form element nevertheless have a smaller margin, allowing you to use the framework's grid system
to build a simple responsive form with the same ease as building your overall design as shown in the example below.
Cascade framework provides a normalised look for buttons. Regardless of which HTML tag you use, your buttons should look the same. The example below shows a button made from a button element, a div element, an a element, an input element and a span element.
Button sets group buttons into a cohesive whole. The example below shows two button sets side by side, which is a common layout for menu bars.
The example below illustrates how buttons can be combined with icons. Cascade Framework is packed with FontAwesome, which is a webfont released with the Open Font Lisense, granting you the same liberties as the rest of the framework. In line with the philosophy behind the framework, these icons are cross-browser and support old IE up to IE6 through the use of CSS expressions.


Bridge Length 1280 m
Bridge Width 49 m
Bridge Height 227 m
Lego Length 8 mm
1280 m * 49 m * 227 m =<PHONE_NUMBER>0 mm
14237440000 mm / 8 mm = 1779680 Legos
Disclaimer: I personally would not cross such a bridge.


SDAm572x Object. More...
#include <FATFS.h>
Data Fields | |
| FATFS_DrvHandle | drvHandle |
| uint32_t | drvInst |
| uint32_t | driveNumber |
| DSTATUS | diskState |
| FATFS | filesystem [FATFS_NUM_OF_PARTITIONS] |
| uint32_t | isOpen |
SDAm572x Object.
The application must not access any member variables of this structure!
| DSTATUS FATFS_Object_s::diskState |
Disk status
| uint32_t FATFS_Object_s::driveNumber |
Drive number used by FatFs
| FATFS_DrvHandle FATFS_Object_s::drvHandle |
Driver Handle.
| uint32_t FATFS_Object_s::drvInst |
SD driver instance if SD driver is not opened.
| FATFS FATFS_Object_s::filesystem[FATFS_NUM_OF_PARTITIONS] |
FATFS data object
| uint32_t FATFS_Object_s::isOpen |
Stores SD parameters


Thank you for signing up on *|COMPANYNAME|*! Please click the button below to confirm your email address and get started on integrating your data.
Here’s a handy reference of all the steps involved in the initial integration process - [Setting up your *|COMPANYNAME|* account | *|COMPANYNAME|* Help Center]. Once that’s done, we will pull in last 30 days’ historical data and set up a sample dashboard for you. This process typically takes 24 hours and our team will reach out once your data is available on *|COMPANYNAME|*.
For any questions, please feel free to reach us at support@*|DOMAINNAME|*.
-Team *|COMPANYNAME|*


Hello! Thank you for visiting my site
What Describes me!!!!
I am ambitious and driven. I thrive on challenge and constantly set goals for myself, so I have something to strive toward. I’m not comfortable with settling, and I’m always looking for an opportunity to do better and achieve greatness"


For the majority of my youth, I grew up in Jefferson City Missouri where I graduated from public High School. I then went on to attend Merrell University where I studied Esthetics. After working in spas for a few years, I switched my focus to the more stable career of banking. It was at this point in my life that I was introduced to the idea of careers in the technology field. I would spend all day helping business clients set up, access, and use the banks various online features to help their businesses grow. However, the real fun happened for me after the phone calls stopped for the day, that's when I worked with our developers to set up the new clients, talk about how to better our systems, breakdown how it all worked, and brainstorm how we would be on the cutting edge of banking technology.
Fast forward to 10 years later; this is how time works for everyone right? I'm finally pursuing my dream of having a career as a developer. Front end? Back end? How about full stack! This is my current path while attending Washington University Coding Boot Camp. Checkout my portfolio page to see the projects I have done and what is coming next! Like what you see or have a fun project idea? Use my contact page to send me a message! Dreams grow and transform just like the projects you will see here.
When I am not applying the "ABC - Always Be Coding" philosophy one of my classmates so cleverly modified from "Glengarry Glen Ross", you can find me with my husband, two bonus babies, and five fur babies enjoying the splendors of being at home. Catching up on the latest episode of "The Mandalorian", playing "Assassin's Creed", expanding my ridiculous makeup collection, watching every movie known to man, or enjoying our wooded back yard are some of my favorite pastimes.


Well yesterday I finally decided to trip with a friend of mine in his room, I weight a 8 - 10 mg dose for me and 20 mg for him. Finally it was more easy than my last time, let me explain.
Going to my friend's house, layed in his big bed with 2 packs of cigarettes, 2 packs of cigarillos (yummy while tripping), some hand roll tobacco + water and coca. We put a DvD player with some funny french movie! (Dikkenek - Belgian movie). This is for the setting. My mind was overall happy but I did not sleep the night before, so feeling a bit tired.
This is a little report:
9:24 PM (exactly): We take both the gelcaps at this time.
We put 'The Simpsons' movie for being in a good mindset.
9:40 PM : Definitely feeling some alert, first physical symptoms, feeling well relaxed almost sedated. My friend feels the same.
We both begin to smile, huge grin and waves of well being (I can easily fall asleep on it if I want to). Watching The Simpsons was hilarious as hell, laughing like a madman while smoking cigarettes and drinking some very cold water ! Feels excellent and very comfortable
10:00 PM: A 'Trippy' mindset begin to creep, my vision seems more clearer, the environment seems to be more detailed. I always feel good physically but I feel a little distraction (difficulty concentrating on the movie). I noticed some slight tremors and hot flashes over the body, as if the temperature had increased, some slight increase in heart rate. Metocin come in wave, I'm pretty sure. Each wave give me more hot and my body feel heavier then shortly after feel relaxed again.
10:30 PM~: The film ends, we decided to take a walk in the village. We walk in the street, hot flashes are felt, as like some adrenaline rush. My legs seem heavy and the body appears heavier. Impression of walking like being drunk, my legs are they made of gelatin? I feel like I have to make a huge effort to walk.
Watching my phone, 10h45~: The visuals are starting to appear, the colors become saturated, the shadows begin to move. The ground seems inflated with helium, 'cartoon-like' visuals, everything looks a bit unreal. I was peaking. Body seems more heavier while I walk. Some tingling in hands, as if little needles pricking me (Vasoconstriction ?). Head feel heavy too like I was on a boat.
11:05 PM: We returned to his house, we sit in bed with the portable DVD player. We decide to plug a fan, we're hot! My friends said he's dehydrated with the heat he felt in his body. Cold water was consumed for both of us. We put 'Dikkenek' movie (very hilarious belgian movie ), smoking cigarettes one after one! It feel soooo good, cigarettes's smoke is thicker than normal, some shades of orange tones mixes with the smoke. The texture of the bed seems fluid and changing / breathing (the bed is navy blue). Feel like being in the sea.
I do not have much to say since we spend most of time in his bed watching movies, smoking cigarettes and cigarillos and drink water while laughing, giggling like crazy !
The mental effect is very neutral like to be stoned. No insights at this level. Feeling almost clean in the head. Still a great body load. Feeling lighter in his bed compared to the street walk.
The comedown, however, was rather harsh for me. The comedown was accompanied by tremors, low to moderate paranoia. Some heart palpitations and a urge feeling of fainting. I could not get back comfortably.
My friend also felt the palpitations and heat. He breaths heavily and 'jumps' from time to time when his heart got palpitation. (I do the same). Tingling again in the hand and legs. Going to the bathroom to take a piss, I look myself to the mirror, my face look pale, feeling of fainting is felt again. My movements are impaired, feeling of being drunk again.
Laying in his bed again, trying to focus on the movie, some short breathing and anxious state of mind. My heart beat increase and decrease in few second. My heart pound of my chest when it does that ! We both closing our eyes to calm down and we take deep breathes.
The feeling subsided in 15 - 20 minutes. Water was consumed again. We rolled cigarettes and smoke them one after one, it relax us ! Take some chewing gum also, relaxed me !
4:20 AM: We are both baseline and clean, some residuals effects like dilated pupils, feeling drained and tired and some light bodyload can be felt.
5:30 AM: We finally find the time to sleep and it's end our night!
Overall it was a great experience, didn't take much since my last experience with Metocin. However this time the comedown was less harsh than my last session. I will take low dose like this to reconcile myself with Metocin.
No I'm out of 4-HO-MET =(But I will have 2C-C & 2C-D next week, will be great I'm sure with the same setting).
Pros :
+ Great bodyload
+ Very neutral in the head
+ Gloomy and cartoon-like visuals, seems unreal
+ Warm feeling
+ Short duration (5 - 6 hours to baseline)
+ Increase in sociabilty and speaking (I'm a shy person)
+ Lot of laughing (Smiling through all the trip)
Cons :
+ Slight tremors
+ Feeling of 'malaise'
+ Some vasoconstriction but tolerable
+ Comedown a bit harsh?
Experience Reports are the writings and opinions of the individual authors who submit them.
Some of the activities described are dangerous and/or illegal and none are recommended by Erowid.


In the digital age, the value of many companies now depends on their number of users rather than the physical products they produce. The more clicks registered, the more likes produced, the greater the value a company can attain.
Where does that leave the individual consumer, player and “clicker?” How has the process of adding value to a product and a company shifted in the digital age? Following the Marxian notion of alienation, will we see a new digital proletariat locked behind not spinning wheels and machines, but behind their screens and keyboards? A generation of digital consumers cut off from the financial benefits they themselves are creating for a few entrepreneurs? Or might we be entering a digital age of sharing, where the consumer is a “prosumer” (Jeremy Rifkin) embedded in a network of collaborative commons?
These issues will be discussed by a panel of thinkers from Germany, Korea and France. A tri-lateral hackathon will then take the results and insights of the symposium as its starting point. The panelists will comment on the results of the hackathon and reconnect the issues to their initial discussion.
Director Goethe-Institut Korea
Regional Director East Asia
"In view of the enormous speed of developments in digitalization and its effects on both cultural and social practices, this has been one of the focus areas..."
Read More from Booklet
Associate Dean, School of Social Science, Seoul National University
"On behalf of students and faculty of the Program for Information Science and Culture, I would like extend a warm welcome to our friends..."
Read More from Booklet
Counsellor (Culture, Education and Science), French Embassy in Korea
Director, French Institute in Korea
"Digital economy has become increasingly significant in today’s world and the influence of new technologies..."
Read More from BookletMay 2nd – 4th, 2016
Seoul National University (SNU)
Samick Hall, Asia Center (Symposium and Hackathon Presentation)
ITCT Lab, IBK Communication Centre (Hackathon)
Symposium & Hackathon Opening
Samick Hall, Asia Center
Hackathon (closed to the public)
ITCT Lab, IBK Communication Centre
Presentation of Hackathon results
Concluding panel
Party
Samick Hall, Asia Center
May 2nd, 2016 (Monday) 10:15 - 13:00
Friedrich Schiller University Jena, Germany
"New ways of exploitation in informational capitalism: Facebook, Google, and the commodification of data"
Ecole Polytechnique, France
"Acceleration and disorientation of digital socio-economic mutations"
Seoul National University, Korea
"Solving complex and convergent social problems"
May 2nd, 2016 (Monday) 14:00 - 17:00
University of Lille 3/IRCAV-Paris 3-Sorbonne Nouvelle, France
"The symbolic economy of digital talents in the era of expressivist stream"
University of the Arts Bremen, Germany
"From tools for empowerment to platform capitalism"
Korea Game Rating and Administration Committee
"Imagineering for homo ludens"
“Playing with the Future”’s tri-lateral hackathon takes the symposium as its starting point. Each speaker proposed three “play items” beforehand: three keywords from their lecture, images, statements, links or even a game. Anything that in their opinion is related to the topic of “digital economy.” With these items, the hackers are free to create whatever they want, with only one condition: the results have to be “playable.” The hackathon is moderated by Peter Lee of Studio Nolgong. At the end of the hackathon, everyone will be invited to “play” its results, and the hackathon will conclude with comments by the speakers.
Game designer, entrepreneur and teacher
Studio Nolgong
The École Nationale du Jeu et des Médias Interactifs Numériques (ENJMIN) was opened in 2005. It is part of the Cnam (National Conservatory of Arts and Crafts). ENJMIN’s aim is to educate the future professionals, researchers and artists, and to foster fundamental and applied research in the field of game design.
gamelab.berlin is a project of the Interdisciplinary Laboratory Image Knowledge Gestaltung of the excellence cluster at the Humboldt University Berlin. In an interdisciplinary manner, gamelab.berlinconducts research and development in the age of games.
The Program for Information Science and Culture of Seoul National University concentrates on educating multidisciplinary scientific researchers who study new information technology and cultural environment using multidisciplinary approaches. These includedisciplines from humanities, social sciences and engineering, and the program aims atproducing competent professionals who will become leaders in thecultural production industry, including the three major areas of digital environment in the twenty-first century: the internet, mobile communications and digital conversions.


TOO MUCH SLEEP A film review by Christopher Null Copyright 2001 filmcritic.com filmcritic.com
Indie filmmakers who want to make their own version of After Hours better damn well know what they're doing. In his first feature, David Maquiling appears to have a grasp of the basics, but his film falls short of its goal.
At its heart, Too Much Sleep is an extremely simple story about a young man named Jack (Marc Palmieri), a lazy security guard who finds his father's handgun stolen during a bus ride daydream. His quest to retrieve the gun sends him on the kind of wacky misadventures seen only in the movies. With his friend's uncle Eddie (Pasquale Gaeta, apparently channeling Bruno Kirby in The Freshman here), Jack visits male strip clubs, foreign parties, and even a Chinese restaurant in order to track down the mysterious Kate (Nicol Zanzarella), whom he suspects of conspiring to steal the weapon. Naturally, we expect Jack will also find himself along the way.
Sure enough, Jack falls for Kate en route to a whiffle bat beating of the ultimate crook, but unfortunately, writer/director Maquiling muddles his metaphors to the point where the audience becomes ambivalent toward all his characters.  Kate has so little screen time we don't really feel their relationship is a wise choice for either character.
Sure enough, Too Much Sleep comes across as exactly that: innocuous and sleepy, an overly dry shot at creating something quirky that misfires as often as it hits due to a misconfigured sense of comic timing. Filipino-American Maquiling describes his film as an homage to the timeless "folk story," presumably something passed down orally from generations to generations. My kids will have to be content with digging up the videotape somewhere decades from know.

Visit filmcritic.com on the Web at http://www.filmcritic.com
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


Fission: Fast & Lossless Audio Editing
Fission is an audio editor designed with simplicity in mind. Using Fission, you can quickly and easily trim and split MP3, AAC, Apple Lossless, FLAC, AIFF, and WAV files, with no quality loss. Split one large audio file into multiple files. Remove sections of audio from a file. Fade audio in and out. Fission will help you accomplish your editing needs with ease.
You can also use Fission to export audio from one format to another (save AIFF files as MP3, or Apple Lossless as AAC), to batch convert a group of files between formats, and even to create iPhone ringtones.
Editing audio has never been this simple or this inexpensive. Fission makes simple audio editing fast and affordable!
Getting Started
We recommend having a quick read-through of this manual, but you can also just dive in if you like. You can refer back to the full manual for assistance at any time by accessing it from the Help menu.
New and Updated In Fission 2.2.1
An incompatibility with ALAC files generated by non-Apple applications like doubleTwist's "AirPlay Recorder" has been addressed.
Fission's Start Window is now prevented from showing if Fission was launched by opening a file.
Several other minor fixes and improvements have been made.
New and Updated In Fission 2.2
Fission can now import many more formats, including MPEG layer 1 and 2, AIFF-C, Ogg Vorbis, Shorten, RealAudio, Windows Media Audio (WMA), AMR, QDesign Music, WavePack and Monkey’s Audio. Newly accepted file extensions: inclue .mpa, .mp1, .mp2, .ogg, .wv, .ape, and .shn.
Several crashes with the Batch Converter, introduced with backend changes made in Fission 2.1.4, are gone with version 2.2. Thanks, Woz!
Several other minor fixes and improvements have been made.
System Requirements
A Macintosh computer
Mac OS X 10.7 or higher
Installation and Removal
To install Fission, just drag it from your download folder to the Applications folder.
If you wish to remove Fission, simply drag it to the Trash.
Purchasing Fission
We provide a free trial of Fission for you to test. During the trial, the quality of audio saved with Fission is intentionally degraded with a series of audio fades. The full version of Fission can be unlocked with a license key from our online store.
When you're ready, head over to http://rogueamoeba.com/store/ to purchase Fission.
For more information, see the Purchasing page.


Netflix
Netflix
Sign In
Unlitmited movies, TV shows and more.
Watch anywhere. Cancel anytime.
Ready to watch? Enter your email to create or restart your memberhsip.
Email here


Sprint 3 - Technical
As if talking to a Non-technical friend, discuss:
An analogy to describe the differences between HTML and CSS
Both HTML and CSS work together to have great results. HTML is like
a house and CSS is the aesthetics. A house can be built without
using aesthetics which goes the same with HTML and CSS. HTML without
CSS can be very plain. It’s like a house without any paint. CSS
cannot exist without HTML (you can't paint a house without a
house).
Explain control flow and loops using an example process from
everyday life, for example 'waking up' or 'brushing your teeth'.
(But not those ones).
Control flow and loops are much similar when a teacher ask a student
to make a copy for x number of learning materials for students and
the student makes x copies of it using the same process x times.
Describe what the DOM is and an example of how you might interact
with it.
DOM is what you see when you are browsing a website. Everthing is
customizable or can be accessed with the right software through DOM.
One particular software is Google Chrome (desktop version), it has
its own tool where you can change the content of the website you are
browsing.
Explain the difference between accessing data from arrays and
objects.
Arrays can nest multple arrays inside arrays and objects are
stacked. Accessing data from arrays can be complicated just like
opening mutiple boxes inside 1 box while objects can be accessed just like a
grocery store sorted by name of the aisle.
Explain what functions are and why they are useful.
Functions are codes which can take in a parameter then either do some calculation or
returns a result. Functions can be use multiple times as well.


Socket
If command line option –socket is used, bake tries to connect to the given port on localhost.
send
Header
1 Byte: Type 4 Byte: Length (used to discard the paket if type is unknown to the listening application)
Error packet (type 0x01)
4 Byte: Length filename, project name x Byte: filename, project name 4 Byte: line number (can be 0) 1 Byte: severity (0x00 = info, 0x01 = warning, 0x02 = error, 0xFF = ok) x Byte: message (length = rest of packet)
Starting build packet (type 0x0A)
4 Byte: Length project name x Byte: project name 4 Byte: Length config name x Byte: config name 4 Byte: number of projects in this build (greater than 0)
Building project packet
Same as Starting build packet, except number of projects = 0
receive
If a byte is received, the build will be aborted.


#include <Qlearn-class.hpp>
Destructor for the class.
| void Qclass::createGrid |
( |
| ) |
|
Creates the grid with obstacles in it.Obstacle added to .txt file to plot.
| int Qclass::detAction |
( |
int |
state | ) |
|
Determines the action to be performed next.
- Parameters
-
| state | -Current state of the robot. |
- Returns
- action decided out of the possible 4 choices (up,down,left and right)
Finds the path from start to goal node using optimized Q table.
- Returns
- 0 when goal node is reached
| int Qclass::findState |
( |
int |
x, |
|
|
int |
y |
|
) |
| |
Finds current state based on x,y position.
- Parameters
-
| x | grid position x |
| y | grid position y |
- Returns
- state current
| int Qclass::futurereward |
( |
int |
new_state | ) |
|
Finds the highest reward considering future rewards.
- Parameters
-
| new_state | is the next state of the robot for action taken in current state |
- Returns
- currMax table value for the state
Plots the path and obstacles stored in txt files.
- Returns
- 0 when path plotting is complete
| void Qclass::Qupdate |
( |
int |
lastAction, |
|
|
int |
lastState, |
|
|
int |
x, |
|
|
int |
y, |
|
|
int |
new_state |
|
) |
| |
Updates Q table based on action taken for given grid position.
- Parameters
-
| lastState | |
| lastAction | |
| x | |
| y | |
| new_state | |
| int Qclass::rewardfunc |
( |
int |
lastAction, |
|
|
int |
x, |
|
|
int |
y |
|
) |
| |
Assigns a reward based on action chosen.
- Parameters
-
- Returns
- reward assigned
Performs the training for the Q learning algorithm for a large number of trials.
- Returns
- 0 when training is complete
| double Qclass::disc_rew = 0.8 |
| int Qclass::grid[50][50] = {} |
| double Qclass::learn_rate = 0.5 |
| double Qclass::Q[2500][4] = {} |
| bool Qclass::restart = false |
The documentation for this class was generated from the following files:
- /home/sudartion/workspace/Q-learning-for-2D-Occupancy-Grid/include/Qlearn-class.hpp
- /home/sudartion/workspace/Q-learning-for-2D-Occupancy-Grid/app/Learn.cpp


@main("APIBook -- Stackoverflow") {
| Answer | State | Action |
|
{{item.codeMethod.canonicalName}}
{{item.score}}
|
Strong Weak |
| Question | Answer | Action |
| Is this a program task? | Yes No Not reviewed | |
| Is there an Answer using API? | No #{{questionReviews[question.id].answerIdUsingApi}} Not reviewed | |
| Use single key API? | Yes No Not reviewed |
{{question.body}}


A HARD DAY'S NIGHT A film review by Steve Rhodes Copyright 2001 Steve Rhodes RATING (0 TO ****): *** 1/2
Watching A HARD DAY'S NIGHT from 1964, now in re-release in the theaters with a newly restored print and sound, is rather like watching an old newsreel. Were we really like that? Did 60s rock really ever have that child-like innocence as embodied in the four lads from Liverpool?
Of course, the answers are: we were, and it did. But gosh, it now seems more like a million years ago rather than just a little over a third of a century.
The Beatles (John Lennon, Paul McCartney, George Harrison and Ringo Starr), undoubtedly the best rock group ever, had a popularity then that hasn't been rivaled since. The movie, done in a mock day-in-the-life documentary style, shows pre-teen and teenage girls swooning and screaming with such intensity that they make themselves sick. In real-life many such fans passed out and had to be carried out on stretchers. The movie, while minimizing the Beatle hype, concentrates on the sheer joy of their music. Whenever they are singing in the movie, which is often, the picture soars. The producers had the now radical idea of actually including entire songs, not just choppy excerpts, in the film. Too bad that this technique has long since vanished.
 A major subplot concerns Paul's freeloading, obstreperous grandfather, played by Wilfrid Brambell with beady eyes, round glasses and a long, thin face. Put a pair of antlers on him, and he'd be a dead ringer for Bullwinkle. Besides trading off of the family name, the grandfather tries to cash in on the boy's fame by selling photos of them with forged signatures.
Even though these four working-class blokes charm us with their natural playfulness, the reason to see A HARD DAY'S NIGHT is as the best music video ever. Sit back and soak up the songs. Don't even try to keep a smile off of your face and a song out of your heart while watching the film. It's just not possible.
A HARD DAY'S NIGHT runs just 1:27. The film is in a handsome black and white, which enhances its documentary feel. It is rated G and would be acceptable for all ages.
My son Jeffrey, age 11, who is 'N Sync kind of guy, thought the movie was pretty good, giving it ** 1/2. He liked the songs the best and thought the other parts of the movie were dumb but sometimes funny.
Email<EMAIL_ADDRESS>Web: http://www.InternetReviews.com
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


Inform, Train, Provide and review the farmers' perfomance and growth.
We collect data, analyse, farmers make decesion based on facts and Sell data.
Receives automated messages due to farm real-time conditions& advisory content to such as what to do with the current season.
We offer a packaged sensors in farms to gather temperature, humidity, soils mosture, kill mosckuitto and outomate the valve
We offer full kits of an Automated irrigation system and Automate the available sites
We offer a mobile application and USSD Code for farmers to monitor their farms.
After winning Ms. Geek Competition in 2016 and being crowned with the business idea of automatic irrigation system with precision Farming based on IOT, Rosine MWISENEZA and Jean de Dieu KWIZERA founded SmAgri Ltd. The Company was established to offer automated Irrigation systems to Rwandan citizen and Sub-Saharan Africa in general. The farmers are provided with a mobile application for to control and monitor their farms, the Sensing systems as a central part for information collection and response reaction using LoraWAN protocols between farms and a cloud application to present real-time farm Data interrelationship and field information including weather, yield, resources, pests and diseases.
We intent to maximize Crop production using affordable & environmental friendly precision agriculture systems for the whole of Africa.
SmAgri Ltd implements a smart and precision agriculture project to help farmer to raise and maximize food production using intelligent IOT system. We automate irrigation schemes, fertilizer addition and pests’ control. We save farmers resources by email and SMS notifications by real time data analytics and sharing for decision making purposes and controls. Generally, we offer support from seeding up to harvesting.
Founder & CEO
Founder & Operations Officer
IOT Developer
Irrigation Specialist
Software Developer
Team Work spirit is one of Keys to Success.


INSTRUCTIONS
- Target Score: You will be given a random number at the start of the game.
- There are four crystals below. By clicking on a crystal you will add a specific a specific amount
of points to your total score.

- Each time when the game starts, the game will change values of each cristal.


Sign In
adfs.example
Type your user name and network password.
User name:
Example: Domain\username
Password:


Formatted HTML:
Let's get started!
Password should be unique and follow the below format
Please validate your credentials, Sign In failed!
Your token is expired, Please Sign In again.


#Build: Synplify Pro (R) M-2017.03L-SP1-1, Build 086R, Aug 4 2017 #install: C:\lscc\diamond\3.10_x64\synpbase #OS: Windows 8 6.2 #Hostname: MEHRDAD-HP-WIN # Fri Apr 5 11:20:52 2019 #Implementation: syn_results Synopsys HDL Compiler, version comp2017q2p1, Build 190R, built Aug 4 2017 @N: : | Running in 64-bit mode Copyright (C) 1994-2017 Synopsys, Inc. This Synopsys software and all associated documentation are proprietary to Synopsys, Inc. and may only be used pursuant to the terms and conditions of a written license agreement with Synopsys, Inc. All other use, reproduction, modification, or distribution of the Synopsys software or the associated documentation is strictly prohibited. Synopsys Verilog Compiler, version comp2017q2p1, Build 190R, built Aug 4 2017 @N: : | Running in 64-bit mode Copyright (C) 1994-2017 Synopsys, Inc. This Synopsys software and all associated documentation are proprietary to Synopsys, Inc. and may only be used pursuant to the terms and conditions of a written license agreement with Synopsys, Inc. All other use, reproduction, modification, or distribution of the Synopsys software or the associated documentation is strictly prohibited. @I::"C:\lscc\diamond\3.10_x64\synpbase\lib\lucent\ecp5u.v" (library work) @I::"C:\lscc\diamond\3.10_x64\synpbase\lib\lucent\pmi_def.v" (library work) @I::"C:\lscc\diamond\3.10_x64\synpbase\lib\vlog\hypermods.v" (library __hyper__lib__) @I::"C:\lscc\diamond\3.10_x64\synpbase\lib\vlog\umr_capim.v" (library snps_haps) @I::"C:\lscc\diamond\3.10_x64\synpbase\lib\vlog\scemi_objects.v" (library snps_haps) @I::"C:\lscc\diamond\3.10_x64\synpbase\lib\vlog\scemi_pipes.svh" (library snps_haps) @I::"C:\lscc\diamond\3.10_x64\cae_library\synthesis\verilog\ecp5u.v" (library work) @I::"C:\lscc\diamond\3.10_x64\cae_library\synthesis\verilog\pmi_def.v" (library work) @I::"C:\work\tinysdr_fpga_lora_tx\lora_tx_clarity\my_pll_64mhz\my_pll_64mhz.v" (library work) Verilog syntax check successful! File C:\work\tinysdr_fpga_lora_tx\lora_tx_clarity\my_pll_64mhz\my_pll_64mhz.v changed - recompiling Selecting top level module my_pll_64mhz @N:CG364 : ecp5u.v(757) | Synthesizing module VHI in library work. @N:CG364 : ecp5u.v(761) | Synthesizing module VLO in library work. @N:CG364 : ecp5u.v(1696) | Synthesizing module EHXPLLL in library work. @N:CG364 : ecp5u.v(1568) | Synthesizing module PLLREFCS in library work. @N:CG364 : my_pll_64mhz.v(8) | Synthesizing module my_pll_64mhz in library work. @W:CL168 : my_pll_64mhz.v(22) | Removing instance scuba_vhi_inst because it does not drive other instances. To preserve this instance, use the syn_noprune synthesis directive. At c_ver Exit (Real Time elapsed 0h:00m:00s; CPU Time elapsed 0h:00m:00s; Memory used current: 74MB peak: 76MB) Process took 0h:00m:01s realtime, 0h:00m:01s cputime Process completed successfully. # Fri Apr 5 11:20:54 2019 ###########################################################] Synopsys Netlist Linker, version comp2017q2p1, Build 190R, built Aug 4 2017 @N: : | Running in 64-bit mode File C:\work\tinysdr_fpga_lora_tx\lora_tx_clarity\my_pll_64mhz\syn_results\synwork\layer0.srs changed - recompiling At syn_nfilter Exit (Real Time elapsed 0h:00m:00s; CPU Time elapsed 0h:00m:00s; Memory used current: 67MB peak: 68MB) Process took 0h:00m:01s realtime, 0h:00m:01s cputime Process completed successfully. # Fri Apr 5 11:20:54 2019 ###########################################################] @END At c_hdl Exit (Real Time elapsed 0h:00m:01s; CPU Time elapsed 0h:00m:00s; Memory used current: 3MB peak: 4MB) Process took 0h:00m:01s realtime, 0h:00m:01s cputime Process completed successfully. # Fri Apr 5 11:20:54 2019 ###########################################################]


public class NeoDailies
extends java.lang.Object
| Modifier and Type | Field and Description |
|---|---|
static int |
AVERAGE_CODESTONE_COST |
static int |
AVERAGE_FIVE_DUBLOON_COST |
static int |
AVERAGE_ONE_DUBLOON_COST |
static int |
AVERAGE_RED_CODESTONE_COST |
static int |
AVERAGE_TWO_DUBLOON_COST |
static int |
BD_OPPONENT |
static int |
cardDiv |
static boolean |
firstMove |
static int |
GRAVE_PETPET |
static java.util.ArrayList<java.lang.String> |
IGNORED_ITEMS |
static java.io.FileWriter |
logWriter |
static boolean |
madeMove |
static java.lang.String |
NUMBER_TO_TEXT |
static java.lang.String |
PASSWORD |
static java.lang.String |
PET_ZAPPED |
static java.lang.String |
PETNAME |
static boolean |
RUNNING_ON_LAPTOP |
static java.util.ArrayList<java.lang.String> |
shopURLs |
static int |
USEFUL_KQ_STAT_REWARD_PCT |
static java.lang.String |
USERNAME |
static java.lang.String |
WINDOWS_USER |
static java.lang.String |
WISHING_WELL_ITEM |
static java.lang.String |
YOUR_EMAIL |
static java.lang.String |
YOUR_EMAIL_PASSWORD |
| Constructor and Description |
|---|
NeoDailies() |
| Modifier and Type | Method and Description |
|---|---|
private static boolean |
faerieQuest(org.openqa.selenium.WebDriver driver)
Completes the Faerie Quest the user is currently on.
|
private static java.io.File |
getLatestFileFromDir(java.lang.String dirPath)
Grab the newest file from the working directory.
|
private static void |
handleAlert(org.openqa.selenium.WebDriver driver)
Checks for and handles any alerts Neopets gives.
|
private static boolean |
isElementPresentID(java.lang.String id,
org.openqa.selenium.WebDriver driver)
Checks if an element is present using the element's id.
|
private static boolean |
isElementPresentLT(java.lang.String lt,
org.openqa.selenium.WebDriver driver)
Checks if an element is present using the element's link text.
|
private static boolean |
isElementPresentName(java.lang.String name,
org.openqa.selenium.WebDriver driver)
Checks if an element is present using the element's name.
|
private static boolean |
isElementPresentXP(java.lang.String xpath,
org.openqa.selenium.WebDriver driver)
Checks if an element is present using the element's xpath.
|
private static int[] |
leaf(int[] a,
int[] b)
Used by runLottery to generate an array of numbers.
|
private static void |
logMessage(java.lang.String message)
Log any messages into the program's log file located in the working directory.
|
static void |
main(java.lang.String[] argv)
The main method.
|
private static void |
oncePerDay(org.openqa.selenium.WebDriver driver,
java.lang.String xmlNode,
java.lang.String timeFormat)
Handles any activities which only need to be run once per day.
|
private static void |
oncePerInterval(org.openqa.selenium.WebDriver driver,
java.lang.String xmlNode,
long requiredInterval)
Handles any activities which are run at minimum scheduled intervals.
|
private static void |
oncePerSchedule(org.openqa.selenium.WebDriver driver,
java.lang.String xmlNode,
int[] validHours)
Handles Snowager, depositing any money into the user's bank at the end of the day, and collecting the user's food club winnings.
|
private static void |
processBottomCards(org.openqa.selenium.WebDriver driver)
Process the cards at the bottom of piles, sending them to empty spaces or ace piles.
|
private static void |
processDrawnCard(org.openqa.selenium.WebDriver driver)
Process the drawn card, sending it to an empty space or a pile.
|
private static void |
processTopCards(org.openqa.selenium.WebDriver driver)
Process the cards at the top of piles, sending them to empty spaces or other piles.
|
private static boolean |
runAltadorCouncil(org.openqa.selenium.WebDriver driver)
Collects the user's daily Altador Council reward.
|
private static boolean |
runAnchorManagement(org.openqa.selenium.WebDriver driver)
Performs the Anchor Management daily.
|
private static boolean |
runAppleBobbing(org.openqa.selenium.WebDriver driver)
Performs the Apple Bobbing daily.
|
private static boolean |
runBank(org.openqa.selenium.WebDriver driver)
First thing each day, goes to the bank and withdraws enough money to have 100k on hand.
|
private static boolean |
runBattledome(org.openqa.selenium.WebDriver driver)
Plays the battledome until the max neopoints and items per day are earned.
|
private static boolean |
runCheat(org.openqa.selenium.WebDriver driver)
Plays Cheat until the max neopoints per day are earned.
|
private static boolean |
runCliffhanger(org.openqa.selenium.WebDriver driver)
Plays Cliffhanger until the max games per day are played.
|
private static boolean |
runCoincidence(org.openqa.selenium.WebDriver driver)
Performs The Coincidence daily.
|
private static boolean |
runColtzansShrine(org.openqa.selenium.WebDriver driver)
Performs the Colzan's Shrine daily.
|
private static boolean |
runCrossword(org.openqa.selenium.WebDriver driver)
Answers the daily Faerie Crossword.
|
private static boolean |
runCupcake(org.openqa.selenium.WebDriver driver)
Adopts a Neopet whose birthday is today, gets the current day's cupcake, and abandons the pet.
|
private static boolean |
runDailyPuzzle(org.openqa.selenium.WebDriver driver)
Answers the Daily Puzzle.
|
private static boolean |
runDeleteItems(org.openqa.selenium.WebDriver driver)
Goes through the user's inventory and donates any items worth less than 100np according to JN.
|
private static boolean |
runDubloonTraining(org.openqa.selenium.WebDriver driver)
Trains the user's active pet's stats evenly (double its level) at the Swashbuckling Academy.
|
private static boolean |
runEmployment(org.openqa.selenium.WebDriver driver)
Grabs a Faerie Employment job.
|
private static boolean |
runExpellibox(org.openqa.selenium.WebDriver driver)
Plays Qasalan Expellibox.
|
private static boolean |
runFaeries(org.openqa.selenium.WebDriver driver)
Performs the user's daily faerie quest assuming they have the FQ cookie.
|
private static boolean |
runFishing(org.openqa.selenium.WebDriver driver)
Uses the user's active pet to perform the Fishing activity.
|
private static boolean |
runFoodClub(org.openqa.selenium.WebDriver driver)
Plays the Food Club.
|
private static boolean |
runForgottenShore(org.openqa.selenium.WebDriver driver)
Performs the Forgotten Shore daily.
|
private static boolean |
runFruitMachine(org.openqa.selenium.WebDriver driver)
Plays the Fruit Machine daily.
|
private static boolean |
runGeraptikuTomb(org.openqa.selenium.WebDriver driver)
Performs the Geraptiku Tomb daily.
|
private static boolean |
runGraveDanger(org.openqa.selenium.WebDriver driver)
Collects the user's previous Grave Danger reward, then uses the user's designated petpet to run it again.
|
private static boolean |
runGrumpyOldKing(org.openqa.selenium.WebDriver driver)
Performs the Grumpy Old King daily.
|
private static boolean |
runGuessMarrow(org.openqa.selenium.WebDriver driver)
Checks if the Marrow is ready to be guessed.
|
private static boolean |
runHealingSprings(org.openqa.selenium.WebDriver driver)
Checks if the user's pet is sick, hungry, or damaged.
|
private static boolean |
runIslandMystic(org.openqa.selenium.WebDriver driver)
Performs the Island Mystic daily (only useful for the avatar).
|
private static boolean |
runIslandTraining(org.openqa.selenium.WebDriver driver)
Trains the user's active pet's stats evenly (double its level) at the Mystery Island Training School.
|
private static boolean |
runJelly(org.openqa.selenium.WebDriver driver)
Performs the Giant Jelly daily.
|
private static boolean |
runKacheekSeek(org.openqa.selenium.WebDriver driver)
Plays Kacheek Seek until the user's pet is bored.
|
private static boolean |
runKikoPop(org.openqa.selenium.WebDriver driver)
Plays Kiko Pop.
|
private static boolean |
runKitchenQuest(org.openqa.selenium.WebDriver driver)
Starts a Kitchen Quest.
|
private static boolean |
runLabRay(org.openqa.selenium.WebDriver driver)
Zaps the user's chosen lab rat.
|
private static boolean |
runLottery(org.openqa.selenium.WebDriver driver)
Plays the Neopian Lottery the max games per day (20 tickets).
|
private static boolean |
runLunarPuzzle(org.openqa.selenium.WebDriver driver)
Answers the daily Lunar Puzzle.
|
private static boolean |
runMeteor(org.openqa.selenium.WebDriver driver)
Performs the Kreludor Meteor daily.
|
private static boolean |
runMonthlyFreeby(org.openqa.selenium.WebDriver driver)
When the new month rolls over, grabs the user's monthly freebies.
|
private static boolean |
runMoodImprove(org.openqa.selenium.WebDriver driver)
Checks if the user's active pet's mood is not "delighted!".
|
private static boolean |
runNeggCave(org.openqa.selenium.WebDriver driver)
Solves the Negg Cave puzzle daily.
|
private static boolean |
runNeoMail(org.openqa.selenium.WebDriver driver)
Checks if the user has any mail or notifications.
|
private static boolean |
runOmelette(org.openqa.selenium.WebDriver driver)
Performs the Giant Omelette daily.
|
private static boolean |
runPetPetBattles(org.openqa.selenium.WebDriver driver)
Plays PetPet Battles until the max games per day are played.
|
private static boolean |
runPotatoCounter(org.openqa.selenium.WebDriver driver)
Plays Potato Counter the max number of games per day.
|
private static boolean |
runPyramids(org.openqa.selenium.WebDriver driver)
Plays Pyramids until the max neopoints per day are earned.
|
private static boolean |
runScarab21(org.openqa.selenium.WebDriver driver)
Plays Scarab 21 until the max neopoints per day are earned.
|
private static boolean |
runSecondHandShoppe(org.openqa.selenium.WebDriver driver)
Grabs a (hopefully) non-garbage item from the Second Hand Shoppe.
|
private static boolean |
runShopOfOffers(org.openqa.selenium.WebDriver driver)
Collects the user's daily Shop of Offers reward.
|
private static boolean |
runShopTill(org.openqa.selenium.WebDriver driver)
Grabs any NPs in the user's shop till.
|
private static boolean |
runSolitaire(org.openqa.selenium.WebDriver driver)
Plays Solitaire until the max neopoints per day are earned.
|
private static boolean |
runStockItems(org.openqa.selenium.WebDriver driver,
java.lang.String callType)
Checks if the user has less than 30 items in their shop.
|
private static boolean |
runStocks(org.openqa.selenium.WebDriver driver)
Purchases 1000 shares of any stock currently at 15np per share.
|
private static boolean |
runStockSell(org.openqa.selenium.WebDriver driver)
Checks the user's stocks to find out if any are at 60np or above.
|
private static boolean |
runSymolHole(org.openqa.selenium.WebDriver driver)
Performs the Symol Hole daily.
|
private static boolean |
runTarla(org.openqa.selenium.WebDriver driver)
Visits Tarla's non-Toolbar daily.
|
private static boolean |
runTDMBGPOP(org.openqa.selenium.WebDriver driver)
Performs the TDMBGPOP daily.
|
private static boolean |
runTombola(org.openqa.selenium.WebDriver driver)
Performs the Tombola daily.
|
private static boolean |
runTrudysSurprise(org.openqa.selenium.WebDriver driver)
Plays Trudy's Surprise.
|
private static boolean |
runWiseOldKing(org.openqa.selenium.WebDriver driver)
Performs the Wise Old King daily.
|
private static boolean |
runWishingWell(org.openqa.selenium.WebDriver driver)
Place the max amount of Wishing Well wishes (7) for the minimum required amount (21np).
|
private static void |
sendEmail(java.lang.String userBody)
Send an email and text message to the user.
|
private static boolean |
shopWizard(org.openqa.selenium.WebDriver driver,
java.lang.String itemBuying)
Finds the best price for the item the user is trying to buy, and purchases it.
|
private static int[] |
shuffle(int[] o)
Used by runLottery to randomize (shuffle) an array.
|
private static void |
sleepMode(int pauseLen)
Pauses the current thread for the specified number of milliseconds.
|
public static final java.lang.String YOUR_EMAIL
public static final java.lang.String YOUR_EMAIL_PASSWORD
public static final java.lang.String NUMBER_TO_TEXT
public static final java.lang.String WINDOWS_USER
public static final java.lang.String USERNAME
public static final java.lang.String PASSWORD
public static final java.lang.String PETNAME
public static final java.lang.String PET_ZAPPED
public static final java.lang.String WISHING_WELL_ITEM
public static final boolean RUNNING_ON_LAPTOP
public static final int GRAVE_PETPET
public static final int BD_OPPONENT
public static final int AVERAGE_ONE_DUBLOON_COST
public static final int AVERAGE_TWO_DUBLOON_COST
public static final int AVERAGE_FIVE_DUBLOON_COST
public static final int AVERAGE_CODESTONE_COST
public static final int AVERAGE_RED_CODESTONE_COST
public static final int USEFUL_KQ_STAT_REWARD_PCT
public static boolean madeMove
public static int cardDiv
public static boolean firstMove
public static java.util.ArrayList<java.lang.String> shopURLs
public static java.io.FileWriter logWriter
public static final java.util.ArrayList<java.lang.String> IGNORED_ITEMS
public static void main(java.lang.String[] argv) throws java.lang.Exception
argv
- Not used, never used. Just Java syntax.java.lang.Exception
- This should never happen, but Java requires it.private static void oncePerDay(org.openqa.selenium.WebDriver driver, java.lang.String xmlNode, java.lang.String timeFormat) throws java.lang.Exception
driver
- The WebDriverxmlNode
- The name of the node in the user's PreviousRuns.xml the program is looking fortimeFormat
- The SimpleDateFormat the program uses to get the current day or month. Only EEEE or MMM.java.lang.Exception
- Any Exception that occurred in the called methods that needs to be handled within main.oncePerInterval
,
oncePerSchedule
,
runTombola
,
runOmelette
,
runJelly
,
runPetPetBattles
,
runPyramids
,
runCheat
,
runSolitaire
,
runScarab21
,
runBank
,
runAltadorCouncil
,
runNeggCave
,
runShopOfOffers
,
runAppleBobbing
,
runAnchorManagement
,
runFruitMachine
,
runTDMBGPOP
,
runBattledome
,
runPotatoCounter
,
runKacheekSeek
,
runWiseOldKing
,
runGrumpyOldKing
,
runDailyPuzzle
,
runCrossword
,
runLunarPuzzle
,
runCliffhanger
,
runGeraptikuTomb
,
runForgottenShore
,
runMeteor
,
runIslandMystic
,
runMoodImprove
,
runFaeries
,
runLabRay
,
runStocks
,
runCoincidence
,
runLottery
,
runFoodClub
,
runCupcake
,
runMonthlyFreeby
private static boolean runTombola(org.openqa.selenium.WebDriver driver)
driver
- The WebDriveroncePerDay
private static boolean runOmelette(org.openqa.selenium.WebDriver driver)
driver
- The WebDriveroncePerDay
private static boolean runJelly(org.openqa.selenium.WebDriver driver)
driver
- The WebDriveroncePerDay
private static boolean runPetPetBattles(org.openqa.selenium.WebDriver driver)
driver
- The WebDriveroncePerDay
private static boolean runPyramids(org.openqa.selenium.WebDriver driver)
driver
- The WebDriveroncePerDay
,
runCheat
,
runScarab21
,
runSolitaire
private static boolean runCheat(org.openqa.selenium.WebDriver driver)
driver
- The WebDriveroncePerDay
,
runPyramids
,
runScarab21
,
runSolitaire
private static boolean runSolitaire(org.openqa.selenium.WebDriver driver)
driver
- The WebDriveroncePerDay
,
runCheat
,
runPyramids
,
runScarab21
,
processDrawnCard
,
processBottomCards
,
processTopCards
private static boolean runScarab21(org.openqa.selenium.WebDriver driver)
driver
- The WebDriveroncePerDay
,
runCheat
,
runPyramids
,
runSolitaire
private static boolean runBank(org.openqa.selenium.WebDriver driver)
driver
- The WebDriveroncePerDay
private static boolean runAltadorCouncil(org.openqa.selenium.WebDriver driver)
driver
- The WebDriveroncePerDay
private static boolean runNeggCave(org.openqa.selenium.WebDriver driver)
driver
- The WebDriveroncePerDay
private static boolean runShopOfOffers(org.openqa.selenium.WebDriver driver)
driver
- The WebDriveroncePerDay
private static boolean runAppleBobbing(org.openqa.selenium.WebDriver driver)
driver
- The WebDriveroncePerDay
private static boolean runAnchorManagement(org.openqa.selenium.WebDriver driver)
driver
- The WebDriveroncePerDay
private static boolean runFruitMachine(org.openqa.selenium.WebDriver driver)
driver
- The WebDriveroncePerDay
private static boolean runTDMBGPOP(org.openqa.selenium.WebDriver driver)
driver
- The WebDriveroncePerDay
private static boolean runBattledome(org.openqa.selenium.WebDriver driver)
driver
- The WebDriveroncePerDay
private static boolean runPotatoCounter(org.openqa.selenium.WebDriver driver)
driver
- The WebDriveroncePerDay
private static boolean runKacheekSeek(org.openqa.selenium.WebDriver driver)
driver
- The WebDriveroncePerDay
private static boolean runWiseOldKing(org.openqa.selenium.WebDriver driver)
driver
- The WebDriveroncePerDay
private static boolean runGrumpyOldKing(org.openqa.selenium.WebDriver driver)
driver
- The WebDriveroncePerDay
private static boolean runDailyPuzzle(org.openqa.selenium.WebDriver driver) throws java.io.IOException
driver
- The WebDriverjava.io.IOException
- Only occurs if there's an error connecting to JN.oncePerDay
private static boolean runCrossword(org.openqa.selenium.WebDriver driver) throws java.io.IOException
driver
- The WebDriverjava.io.IOException
- Only occurs if there's an error connecting to JN.oncePerDay
private static boolean runLunarPuzzle(org.openqa.selenium.WebDriver driver)
driver
- The WebDriveroncePerDay
private static boolean runCliffhanger(org.openqa.selenium.WebDriver driver)
driver
- The WebDriveroncePerDay
private static boolean runStocks(org.openqa.selenium.WebDriver driver)
driver
- The WebDriveroncePerDay
private static boolean runCoincidence(org.openqa.selenium.WebDriver driver)
driver
- The WebDriveroncePerDay
private static boolean runGeraptikuTomb(org.openqa.selenium.WebDriver driver)
driver
- The WebDriveroncePerDay
private static boolean runForgottenShore(org.openqa.selenium.WebDriver driver)
driver
- The WebDriveroncePerDay
private static boolean runMeteor(org.openqa.selenium.WebDriver driver)
driver
- The WebDriveroncePerDay
private static boolean runIslandMystic(org.openqa.selenium.WebDriver driver)
driver
- The WebDriveroncePerDay
private static boolean runMoodImprove(org.openqa.selenium.WebDriver driver)
driver
- The WebDriveroncePerDay
private static boolean runFaeries(org.openqa.selenium.WebDriver driver)
driver
- The WebDriveroncePerDay
private static boolean runLabRay(org.openqa.selenium.WebDriver driver)
driver
- The WebDriveroncePerDay
private static boolean runLottery(org.openqa.selenium.WebDriver driver)
driver
- The WebDriveroncePerDay
private static boolean runFoodClub(org.openqa.selenium.WebDriver driver)
driver
- The WebDriveroncePerDay
private static boolean runCupcake(org.openqa.selenium.WebDriver driver) throws java.io.IOException
driver
- The WebDriverjava.io.IOException
- Occurs if BirthdayList.csv doesn't exist, or if the date format is messed with (this should never occur).oncePerDay
private static boolean runDeleteItems(org.openqa.selenium.WebDriver driver)
driver
- The WebDriveroncePerDay
private static boolean runMonthlyFreeby(org.openqa.selenium.WebDriver driver)
driver
- The WebDriveroncePerDay
private static void oncePerInterval(org.openqa.selenium.WebDriver driver, java.lang.String xmlNode, long requiredInterval) throws java.lang.Exception
driver
- The WebDriverxmlNode
- The name of the node in the user's PreviousRuns.xml the program is looking forrequiredInterval
- The amount of time in seconds the node requires to have passed.+java.lang.Exception
- Any Exception that occurred in the called methods that needs to be handled within main.oncePerDay
,
oncePerSchedule
,
runStockSell
,
runTrudysSurprise
,
runExpellibox
,
runKikoPop
,
runKitchenQuest
,
runEmployment
,
runHealingSprings
,
runNeoMail
,
runGuessMarrow
,
runSymolHole
,
runColtzansShrine
,
runWishingWell
,
runFishing
,
runGraveDanger
,
runDubloonTraining
,
runIslandTraining
,
runSecondHandShoppe
,
runTarla
,
runShopTill
,
runDeleteItems
,
runStockItems
private static boolean runStockSell(org.openqa.selenium.WebDriver driver)
driver
- The WebDriveroncePerInterval
private static boolean runTrudysSurprise(org.openqa.selenium.WebDriver driver)
driver
- The WebDriveroncePerInterval
private static boolean runExpellibox(org.openqa.selenium.WebDriver driver)
driver
- The WebDriveroncePerInterval
private static boolean runKikoPop(org.openqa.selenium.WebDriver driver)
driver
- The WebDriveroncePerInterval
private static boolean runEmployment(org.openqa.selenium.WebDriver driver)
driver
- The WebDriveroncePerInterval
private static boolean runKitchenQuest(org.openqa.selenium.WebDriver driver)
driver
- The WebDriveroncePerInterval
private static boolean runHealingSprings(org.openqa.selenium.WebDriver driver)
driver
- The WebDriveroncePerInterval
private static boolean runNeoMail(org.openqa.selenium.WebDriver driver)
driver
- The WebDriveroncePerInterval
private static boolean runGuessMarrow(org.openqa.selenium.WebDriver driver)
driver
- The WebDriveroncePerInterval
private static boolean runSymolHole(org.openqa.selenium.WebDriver driver)
driver
- The WebDriveroncePerInterval
private static boolean runColtzansShrine(org.openqa.selenium.WebDriver driver)
driver
- The WebDriveroncePerInterval
private static boolean runWishingWell(org.openqa.selenium.WebDriver driver)
driver
- The WebDriveroncePerInterval
private static boolean runFishing(org.openqa.selenium.WebDriver driver)
driver
- The WebDriveroncePerInterval
private static boolean runGraveDanger(org.openqa.selenium.WebDriver driver)
driver
- The WebDriveroncePerInterval
private static boolean runDubloonTraining(org.openqa.selenium.WebDriver driver)
driver
- The WebDriveroncePerInterval
private static boolean runIslandTraining(org.openqa.selenium.WebDriver driver)
driver
- The WebDriveroncePerInterval
private static boolean runSecondHandShoppe(org.openqa.selenium.WebDriver driver)
driver
- The WebDriveroncePerInterval
private static boolean runTarla(org.openqa.selenium.WebDriver driver)
driver
- The WebDriveroncePerInterval
private static boolean runShopTill(org.openqa.selenium.WebDriver driver)
driver
- The WebDriveroncePerInterval
private static boolean runStockItems(org.openqa.selenium.WebDriver driver, java.lang.String callType)
driver
- The WebDrivercallType
- The string telling whether to price just what is newly stocked, or to reprice everything.oncePerInterval
private static void oncePerSchedule(org.openqa.selenium.WebDriver driver, java.lang.String xmlNode, int[] validHours) throws java.io.IOException
driver
- The WebDriverxmlNode
- The name of the node in the user's PreviousRuns.xml the program is looking forvalidHours
- The hour(s) that the program uses for the specified xmlNodejava.io.IOException
- Any IOException that occurred in the called methods that needs to be handled within main.oncePerDay
,
oncePerInterval
private static void handleAlert(org.openqa.selenium.WebDriver driver)
driver
- The WebDriverprivate static boolean isElementPresentID(java.lang.String id, org.openqa.selenium.WebDriver driver)
id
- The ID of the elementdriver
- The WebDriverisElementPresentLT
,
isElementPresentName
,
isElementPresentXP
private static boolean isElementPresentLT(java.lang.String lt, org.openqa.selenium.WebDriver driver)
lt
- The link text of the elementdriver
- The WebDriverisElementPresentID
,
isElementPresentName
,
isElementPresentXP
private static boolean isElementPresentName(java.lang.String name, org.openqa.selenium.WebDriver driver)
name
- The name of the elementdriver
- The WebDriverisElementPresentID
,
isElementPresentLT
,
isElementPresentXP
private static boolean isElementPresentXP(java.lang.String xpath, org.openqa.selenium.WebDriver driver)
xpath
- The xpath of the elementdriver
- The WebDriverisElementPresentID
,
isElementPresentLT
,
isElementPresentName
private static void logMessage(java.lang.String message)
message
- The message that gets logged into the log fileprivate static void sleepMode(int pauseLen)
pauseLen
- The length of time to pause in millisecondsprivate static int[] leaf(int[] a, int[] b)
a
- The first array of numbersb
- second first array of numbersrunLottery
private static int[] shuffle(int[] o)
o
- The array of numbersrunLottery
private static boolean faerieQuest(org.openqa.selenium.WebDriver driver)
driver
- The WebDriverrunFaeries
,
runStockItems
,
shopWizard
private static boolean shopWizard(org.openqa.selenium.WebDriver driver, java.lang.String itemBuying)
driver
- The WebDriveritemBuying
- The item that is currently trying to be bought.runCoincidence
,
runEmployment
,
runKitchenQuest
,
runDubloonTraining
,
runIslandTraining
private static void processDrawnCard(org.openqa.selenium.WebDriver driver)
driver
- The WebDriverrunSolitaire
,
processBottomCards
,
processTopCards
private static void processBottomCards(org.openqa.selenium.WebDriver driver)
driver
- The WebDriverrunSolitaire
,
processDrawnCard
,
processTopCards
private static void processTopCards(org.openqa.selenium.WebDriver driver)
driver
- The WebDriverrunSolitaire
,
processBottomCards
,
processDrawnCard
private static void sendEmail(java.lang.String userBody)
userBody
- The text of the body of the email sent.private static java.io.File getLatestFileFromDir(java.lang.String dirPath)
dirPath
- The working directory of the botsendEmail


Netizens criticize Mnet for not making a stance as 'Produce 101' groups get buried in hate comments
by sl278Netizens have been furious at Mnet's lack of action as 'Produce 101' project groups continue to get buried in hate after it was revealed that all seasons of the show had either been completely or partially manipulated.
Although many netizens have called for the truth to be revealed, Mnet has remained quiet regarding the entire controversy, leading to angry comments from netizens.
 They need to sincerely reflect upon themselves."
"X1 and IZ*ONE are kids taking on the consequences caused by adults in higher positions."
"They have a long way to go to make things right."
"They scammed all of us and the wrong people are getting the hate."
"They need to investigate all the other shows too..."
What do you think should be done regarding this situation?


This option specifies what kind of output the GUI Designer generates for the visual forms you create.
(If your build actions are delegated to
Gradle, GUI Designer will not generate Java source code.)
The available settings are:
$$$setupUI$$$()
that contains the GUI initializer code for the bound form
and its components.
$$$setupUI$$$()
method.(Do not change the generated method, or call it from any other code. If you manually modify GUI
initializer code, your UI will no longer be in sync with the .form file, and
the next compilation will overwrite your changes.)


You are being invited to take part in a research study conducted by {{ Constants.lecturer_one }} at {{ Constants.lecturer_one_university }}, {{ Constants.lecturer_two }} at {{ Constants.lecturer_two_university }} and {{ Constants.lecturer_three }} at {{ Constants.lecturer_three_university }}. The total estimated time to participate in this study is approximately 15 minutes. There are no anticipated potential risks associated with this study. The purpose of this study is to learn more about managerial judgments and decision-making.
There are no direct benefits to you from participating in this study; however, the benefits of participating in this study include helping practitioners and academics advance their understanding of managerial judgments and decision-making. Your responses to this study are anonymous and securely stored on the researchers’ password protected computers.
Please note that participation in this study is voluntary and your responses are anonymous. Your name will not be collected, and only aggregated data will be included in any publications or presentations resulting from this study. If you decide to participate, you have the right to withdraw your consent or discontinue participation at any time without penalty.
If you have questions, concerns, or complaints you may contact Jared Koreff, at<PHONE_NUMBER> (phone) or at<EMAIL_ADDRESS>(email). Since this research involves human participants, it has been approved by the Institutional Review Board (IRB) at Trinity University.
By continuing on to the following pages, you are indicating that you understand the above information and voluntarily consent to participate in the research. You are also affirming that you are at least 18 years of age. Thank you very much for agreeing to participate.


Should be green if classList.add is supported
Should be green if classList.add with multiple arguments is supported
Should be green by using ng-class


 IT CONTAINS SOFTWARE, THE USE OF WHICH IS LICENSED BY IRPG SOFTWARE IF YOU DO NOT AGREE TO THE TERMS AND CONDITIONS OF THIS AGREEMENT, DO NOT USE THE SOFTWARE. USING ANY PART OF THE SOFTWARE INDICATES THAT YOU ACCEPT THESE TERMS.
This Software Licensing Agreement ("Agreement") is a legal agreement between you ("Licensee") and IRPG Software ("IRPG"). By installing this Software ("Product"), by loading or running the Software, you agree to be bound by the terms of this Agreement. These are the only terms by which IRPG permits copying or use.
LICENSE GRANT: Provided Licensee complies with the terms and conditions of this Agreement and has paid the applicable license fees for the Product. IRPG grants Licensee a personal, non-exclusive, and non-transferable license to install and use the Product. Upon IRPG's receipt of the applicable license fees, a validation key file ("Key") will be issued to Licensee to activate the Product and make possible its usage for a limited amount of time as specified on IRPGs Web site. You are the only person that has the right to use the Product once you bought a valid Key and activated the Product. Special rules apply to group licenses, as described in one of the sections below.
RESTRICTIONS: (a) You are expressly prohibited from copying, modifying, merging, selling, leasing, redistributing, assigning, or transferring in any matter, the Product or any portion thereof. (b) You may take a single copy of materials within the package or otherwise related to Product only as required for backup purposes. (c) You are also expressly prohibited from reverse engineering, decompiling, translating, disassembling, deciphering, decrypting, or otherwise attempting to discover the source code of the Product as the Product contain proprietary material of IRPG. You may not otherwise modify, alter, adapt, port, or merge the Product. (d) You may not remove, alter, deface, overprint or otherwise obscure trademark, service mark or copyright notices. (e) You may not publish or distribute in any form of electronic or printed communication the materials within or otherwise related to the Product, including but not limited to the object code, help files, examples, sample algorithms, exercises and tests.
SUPPORT: Licensee shall be entitled to reasonable email customer support during normal business hours for 90 days commencing on the date Licensee receives the Key. No customer support is provided for Updates or Upgrades received pursuant to this Agreement. This license does not entitle Licensees of the Product to Updates or Upgrades to the Product. If Updates and/or Upgrades to the Product are made available, they will be available from IRPG's Web site and will be subject to IRPG's then current license agreement and payment of additional license fees, if any.
FEES: A license fee is required in order to receive a Key to register and enable Product. IRPG provides means to buy individual or group licenses. Fee information is available at IRPG Web site. Upon the expiration of the license Key, Licensee can extend his Key to a new expiration date. Fee for this operation is also available on IRPG Web site.
SPECIAL CONDITIONS: (b) If Licensee is not an Educational Institution, the Product can be used only by a predefined number of persons equal to the number of licenses bought by the Licensee.
In most of the cases, this license applies to Product, activated by means of purchasing a Key from IRPG. There is also a case where this license does not entirely apply: Eduka+ Demo Version. Special rules that apply to Demo Version: (a) Can be redistributed freely.
LICENSEE REPRESENTATIONS: Licensee represents and warrants that it has the legal capacity to enter into this Agreement, that it will use the Product only for lawful purposes and in accordance with this Agreement, and that it will not use the Product to violate any law, regulation or ordinance or any right of IRPG or its licensors or any third party, including without limitation, any right of privacy, publicity, copyright, trademark, or patent.
TERMINATION: Should Licensee breach this Agreement, Licensee's right to use the Product shall terminate immediately and without notice. Upon termination, Licensee shall destroy all copies of the Product. Licensee can terminate this Agreement at any time by destroying all copies of the Software and the Key in possession by himself.
PROPRIETARY RIGHTS:
WARRANTY: |


The constructor function array(A,B,C,...)
constructs an array from its arguments.
{1,2,3} is a 3-vector of type Integer {{11,12,13}, {21,22,23}} is a 2x3 matrix of type Integer {{{1.0, 2.0, 3.0}}} is a 1x1x3 array of type Real Real[3] v = array(1, 2, 3.0); type Angle = Real(unit="rad"); parameter Angle alpha = 2.0; // type of alpha is Real. // array(alpha, 2, 3.0) or {alpha, 2, 3.0} is a 3-vector of type Real. Angle[3] a = {1.0, alpha, 4}; // type of a is Real[3].
array(A,B,C,...)
constructs
an array from its arguments according to the following rules:
size(A)=size(B)=size(C)=...
ndims(array(A,B,C)) = ndims(A) + 1
= ndims(B) + 1, ...
{A, B, C, ...}
is a shorthand notation for
array(A, B, C, ...)
.array()
or {}
are not defined].


---
title: About
description: the past, present, and future of this website
layout: default
permalink: /about/
---
The Basics
Pugchamp was conceived in 2015 as a successor to tf2pug.me, a similar web-based draft-organized PUG system. It aimed to not only recreate the same functionality but add to it with features like ratings and automated servers.


A command-line interface for JavaScript and DOM.
Open the shell or get the Shell bookmarklet.
b = document.body
function f() { return 5; }
or function f() 5;
in JavaScript 1.8Please note: Hotkeys (the "Alt+Key" codes) may also require you to push the Shift key on Linux.
ans
: the result of the previous expression.print(expr)
: prints expr on its own line. If passed mutiple arguments, they will all be printed on one line as an array joined by ", "
for(i = 0; i < 6; ++i) print(i * i)
pr(expr)
: prints and returns its input, so you can use it to print intermediate results in the middle of an expression.
function fact(n) { return n>0 ? pr(n*fact(n-1)) : 1 }
load(scriptURI [, printLoadMessage [, forcedVersion]])
: loads a JavaScript script. printLoadMessage and forcedVersion are optional. printLoadMessage defaults to true and determines if a loading message should be displayed. forcedVersion defaults to the current JavaScript version and determines the version of JavaScript a script should be run under.
load("http://example.com/foo.js", false, 1.8)
blink(node)
or Alt+B: makes a node blink for a second.
blink(document.links[3])
props(obj)
or Alt+P: lists the methods and fields of an object.
props(document.body)
props
also shows which properties belong to the object itself and which belong to objects in its prototype chain.JSON.stringify(object)
or Alt+J: creates a JSON representation of an object.
JSON.stringify({foo: "bar", id: 9814})
JSON.parse(JSON string)
: parses a JSON string and returns an object.
JSON.parse('{"foo":"bar","id":9814}')
document.body
using props
(Alt+P) to figure out what is possible.sin
and pow
.The JavaScript shell was created by Jesse Ruderman. Ted Mielczarek added the tab completion feature in 1.1, Edward Lee added the multiline input feature in 1.2, Jesper Rønn-Jensen fixed a few bugs for 1.4, and Elijah Grey added JSON support, enhanced print(), and latest JavaScript version evaling in 1.4 Extended. Changelogs for some versions are available. The JavaScript Shell is GPL/LGPL/MPL tri-licensed.
Last modified October 11, 2009.


Experience
Professional History
Baird
I primarily pair with one of the four other software developers on my team and work through tasks of varying difficulty.
These can range from anywhere between support tickets for automated software that fixes itself on the next scheduled run to totally
overhauling outdated, inefficient code and rewriting it in a more modern language within a time crunch. I also create SQL Server Reporting
Service (SSRS) reports at the request and specifications given from business users. Our team is heavily invested in SCRUM and Test Driven
Development, and we have daily stand-ups to report on and discuss our current status in our work queue. Every piece of software I've seen
includes a variety of tests in their test suites, primarily structured with XUnit testing in Visual Studio.
Space, Science and Engineering Center (UW-Madison)
I monitered the servers in the data center by doing hourly checks on data streams via satellite and nightly physical
walkthroughs through the server room. I also performed maintenance on the SSEC website by renewing aging pages and updating
information. During my time at SSEC, I trained and supervised four new Data Analysts.
Research
Presented Python analysis of satellite observation data regarding mountainous
precipitation rates, including the effect of orthographic obstacles and wind
direction vectors on precipitation amounts to a group of peers as well as various
department staff at the 2015 UW-Madison Undergraduate Research Symposium
Other Experiences
- Received Two Congressional Nominations from Congressman Sensenbrenner and Senator Feingold
National Honors Society Member
- Advanced to Senior Mock Trial Team as a Freshman (High School)
- Awarded Position Paper Award for Korean Unification, Model U.N. 2011
- Achieved Medal in Mathcounts Competition 2009
- Attended National Youth Leadership Forum on National Security in Washington, D.C.
Hit spacebar
or tap here to go back


Before Change
class DistSAGE(SAGE):
def __init__(self, in_feats, n_hidden, n_classes, n_layers,
activation, dropout):
super(DistSAGE, self).__init__(in_feats, n_hidden, n_classes, n_layers,
activation, dropout)
def inference(self, g, x, batch_size, device):
Inference with the GraphSAGE model on full neighbors (i.e. without neighbor sampling).
After Change
return blocks
class DistSAGE(nn.Module):
def __init__(self, in_feats, n_hidden, n_classes, n_layers,
activation, dropout):
super().__init__()
self.n_layers = n_layers
self.n_hidden = n_hidden
self.n_classes = n_classes
self.layers = nn.ModuleList()
self.layers.append(dglnn.SAGEConv(in_feats, n_hidden, "mean"))
for i in range(1, n_layers - 1):
self.layers.append(dglnn.SAGEConv(n_hidden, n_hidden, "mean"))
self.layers.append(dglnn.SAGEConv(n_hidden, n_classes, "mean"))
self.dropout = nn.Dropout(dropout)
self.activation = activation
def forward(self, blocks, x):
h = x


|
Perl Weekly
Issue #115 - 2013-10-07 - Debugging Perl scripts inside a browser
latest | archive | by Gabor Szabo
|
|
Hi,
Meeting other Perl developers face-to-face, and getting to know them can be a real boost to your career as Perl programmer. The Nordic Perl Workshop was announced recently and other Perl events are listed at the end of the newsletter. I hope you will find something near-by!
On the other side of the coin: Does your company have a Perl job opening? Would like to see it mentioned in the Perl Weekly? - You can have that in a sponsored entry right at the top of each edition. See one from Grant Street Group below. For details how to get included, please contact me.
In the meanwhile, enjoy the articles!
|
|
|
|
Sponsors
|
We're Hiring Telecommuters - Grant Street Group
We are a growing software company using open source software/modern Perl practices to build innovative e-payment, auction, and tax collection web applications. We're looking for talented, motivated professionals committed to flawless work and customer service. Email resume<EMAIL_ADDRESS>|
|
Announcements
|
|
|
|
|
Releases
|
|
|
|
|
Articles
|
Comma quibbling in Perl
Sinan Unur shows his example to this special cases of joining some strings together. Taken from Rosetta Code.
|
|
Pondering the Mop Up
A detailed answer by Buddy Burden to the gentle introduction of Damien Krotkine to the world of the p5-mop. p5-mop is the name of the project to get a Meta Object Protocol into the core of Perl 5. MOP is base Moose is built on. Having MOP in the core will mean there can be a standard, fast and very powerful Object Oriented system in Perl 5.
|
|
Perl Does the Heavy Lifting
While probably most readers of the Perl Weekly don't need any reason as to why use Perl, reading the article of Dietrich Schmitz can help when talking to the less than convinced.
|
|
Testing
|
ImProveD prove
When developing Perl, how can you focus on the tests that are currently failing? Can you easily pick the ones that failed in the previous run? Gianluca Casati explains how to do that.
|
|
Code
|
|
|
The perl 5.10 lexical topic
Ricardo Signes, the current Pumpking of Perl 5 shows what problems does a 'my $_' solve and what new problems does it create. He explain why did this feature became experimental, roughly 6 years after it was introduced in perl 5.10.
|
|
CPAN
|
CPAN adoption leaderboard
Neil Bowers list the people who have adopted modules from his list, but really this information should be available on MetaCPAN and in both direction. Listing the heros who adopted modules in one place, but also showing who created the module in the first place and who contributed to it during the years.
|
|
Reports
|
Planet Moose - September 2013
The monthly Moose report by Toby Inkster covers everything related to the Moose/Moo/p5-mop. Almost everything object oriented related in Perl.
|
|
Perl impressions after YAPC::EU 2013
Paweł Król from XING visited YAPC::EU in Kiev. He has some very strong opinion on some of the speakers and about the whole perl versioning debate.
|
|
Weekly collections
|
|
|
|
|
|
|
Perl Maven Tutorials
|
Debugging Perl with hdb
Devel::hdb is a visual perl debugger that displays your script in a browser where you can step through the code, set breakpoints and inspect variables.
|
|
Events
I usually list the next 3-4 events here. The list of all the events can be found on the web site. If your Perl event is not listed there, please let me know.
|
|
|
|
|
|
|
|
|
You know, you could get the Perl Weekly right in your mailbox. Every Week. Free of charge!
|


$Name$
This is an example email with variables. I have an $ID$ here.
John Doe
Example Company
john.doe@example.com