Channel Words¶
A channel is a monodirectional means of communicating data, as arbitrary-sized blocks of data, between two or more different tasks. Channels form a fixed-size queue onto which data is sent on one end and data is received on the other. Any task which attempts to send data on a full channel, or receive data on an empty channel, will be suspended until either data is received from the channel, or data is sent to the channel, respectively, unless non-blocking operations are used, where then x-would-block
(declared in task
) is raised instead of blocking.
Channels can be created anywhere in memory; they are not dependent upon any allocation mechanism. Therefore they can be put into alloted memory in the dictionary or into allocated memory in the heap. Note that the size of a channel for a given element size and element count may be calculated with chan-size
.
chan
¶
The following words are in chan
:
x-chan-closed
¶
( – )
Channel closed exception. Raised on attempting to send to a closed channel or when trying to receive on an empty closed channel.
chan-full?
¶
( chan – flag )
Get whether a channel is full.
chan-empty?
¶
( chan – flag )
Get whether a channel is empty.
chan-size
¶
( element-bytes element-count – total-bytes )
Get the size in memory for a channel with a specified element size in bytes and element count.
init-chan
¶
( element-bytes element-count addr – )
Initialize a channel starting at the specified address with the element size and element count. The element-bytes and element-count should be the same as when they were passed to chan-size
when alloting or allocating the memory whose starting address is passed in.
close-chan
¶
( chan – )
Close a channel. Raise x-chan-closed
for all pending sending tasks or for all pending receiving tasks if the channel is empty.
reopen-chan
¶
( chan – )
Reopen a channel.
chan-closed?
¶
( chan – closed )
Get whether a channel is closed.
send-chan
¶
( addr bytes chan – )
Send message with a buffer as a payload over a channel. Block until another task receives the message if the channel is full. Note that the buffer is copied, and will be truncated if the buffer size of the channel is smaller than the data provided, and padded with zeros if it is larger. This is not safe to call within an interrupt service routine or a critical section.
recv-chan
¶
( addr bytes chan – recv-bytes )
Receive message into a buffer from a channel. Block until another task sends a message if the channel is empty. Note that the buffer is copied, and will be truncated if the provided buffer is smaller than the buffer size of the channel, and padded with zeros if it is larger; the number of bytes copied is returned. This is not safe to call within an interrupt service routine or a critical section.
peek-chan
¶
( addr bytes chan – addr peek-bytes )
Peek the oldest message into a buffer from a channel, without popping it from the channel’s queue. Block until another task sends a message if the channel is empty. Note that the buffer is copied, and will be truncated if the provided buffer is smaller than the buffer size of the channel, and padded with zeros if it is larger; the number of bytes copied is returned. This is not safe to call within an interrupt service routine or a critical section.
skip-chan
¶
( chan – )
Skip the most oldest message in a channel. Block until another task sends a message if the channel is empty. Note that no copying takes place, making this faster than receiving a message. This is not safe to call within an interrupt service routine or a critical section.
send-chan-no-block
¶
( addr bytes chan – )
Send message with a buffer as a payload over a channel. If the channel is full, x-would-block
is raised. Note that the buffer is copied, and will be truncated if the buffer size of the channel is smaller than the data provided, and padded with zeros if it is larger. This is not safe to call within an interrupt service routine or a critical section.
recv-chan-no-block
¶
( addr bytes chan – recv-bytes )
Receive message into a buffer from a channel. If the channel is empty, x-would-block
is raised. Note that the buffer is copied, and will be truncated if the provided buffer is smaller than the buffer size of the channel, and padded with zeros if it is larger; the number of bytes copied is returned. This is not safe to call within an interrupt service routine or a critical section.
peek-chan-no-block
¶
( addr bytes chan – addr peek-bytes )
Peek the oldest message into a buffer from a channel, without popping it from the channel’s queue. If the channel is empty, x-would-block
is raised. Note that the buffer is copied, and will be truncated if the provided buffer is smaller than the buffer size of the channel, and padded with zeros if it is larger; the number of bytes copied is returned. This is not safe to call within an interrupt service routine or a critical section.
skip-chan-no-block
¶
( chan – )
Skip the most oldest message in a channel. If the channel is empty, x-would-block
is raised. Note that no copying takes place, making this faster than receiving a message. This is not safe to call within an interrupt service routine or a critical section.


Labour pledges to compensate 3.7m women caught in pension trap
Shadow chancellor John McDonnell says there is a ‘historical debt of honour’ to the women born in the 1950s.
Labour is promising to compensate an estimated 3.7 million women who believed they lost out financially due to changes in the state pension age if the party gains power in the General Election.
Shadow chancellor John McDonnell said the payments were to settle a “historical debt of honour” to the women born in the 1950s.
The party said the payout could amount to £58 billion over five years – with individual payments averaging £15,380 running to a maximum of £31,300.
It follows a lengthy campaign by the so-called “Waspi women” who said they were given insufficient time to prepare for the changes brought in by the former coalition government.
Boris Johnson was challenged by one of the women in the studio audience for Friday night’s BBC Question Time special.
The Prime Minister said that while he sympathised deeply, he could not promise to “magic up that money” for them.
Mr McDonnell said: “We’ve prepared a scheme to compensate these women for a historical wrong.
“It’s one that they were not been able to prepare for and for which they’ve had to suffer serious financial consequences for as a result.
“Some of them have been hit by a combination of poverty and stress, having lost out on what they had contributed towards.
“These changes were imposed upon them by a Tory-led government. So we have a historical debt of honour to them and when we go into government we are going to fulfil that debt.”


The current times require companies and organizations to operate in a transparent manner. We believe that a healthy company should have a proactive attitude towards ethical issues such as privacy and security.
DoBots, operating in the exciting but delicate fields of building automation, indoor localization, and service robotics, has set itself the golden number of seven rules which anticipate difficult dilemmas.
Indoor localization as well as service robotics means interaction with people. This might be search and rescue, knowing where your colleague is, to recognize someone to open his/her door. DoBots advances technologies in which people can be sought out as customers or victims, never as perpetrators. We provide technologies to help people, for instance recognizing people drowning at sea, fainting in a crowd, or guiding people in an evacuation scenario. DoBots will not provide technologies to recognize hooligans, protesters or criminals, nor will we participate in defense projects, or projects of a military nature.
Indoor localization and robotic software collects a lot of data. We are aware that some of this data might contain privacy-sensitive information about third parties, such as children, visitors, or location information of third party Bluetooth devices. We believe that aggregated data is much less privacy-sensitive than raw data. For that reason, we will chose to work with data on high abstraction levels. So, we will use robotic data on crowd levels, or data from cities rather than individual households. Regarding the ownership of the data, see also 4!
Data is paramount to proper indoor localization, building automation, or autonomous robotic operation, be it search and rescue or environmental monitoring. DoBots develops data interpretation technologies that can function on premise. The more information can be processed in house, the less raw information needs to be stored on a (central) server. In case information does need to be streamed to the internet, we avoid having to store the raw data. Only aggregated data that is required to perform the task at hand will be communicated to an operator. As soon as homomorphic encryption (process data without decrypting it) becomes computationally feasible, we aim to switch to such a cloud service.
Your data belongs to you. When you use our tools to collect data, we do not have access to it, nor will we share or delete your data without your consent. You may of course share the data you collect, for instance to allow a swarm of bots to learn from other bots in the neighborhood. You are always the one who decides what you share, who you share it with, and when to stop sharing. DoBots use of BLE (Bluetooth Low-Energy) rather than Wifi for indoor localization reflects this choice for example. BLE is opt-in, Wifi is opt-out.
We believe technology can make the best and fastest advancements, if different parties are given the freedom to share and cooperate without restrictions. DoBots therefore actively promotes open source standards. Almost our entire code base is published under an open source license, allowing third party users to view, modify and redistribute the code of our projects, provided original copyrights and author information is left intact.
Keeping in mind possible security risks, all necessary precautions will be taken regarding safe storage of data. Most importantly, data which does not need to be stored, will not be stored to begin with. Please, bear with us the discomfort of having to provide information twice. If data does have to be stored, this will be done with the utmost care, using encryption and taking precautions against unlawful access by governmental, civilian, or other parties. If DoBots' servers should be hacked, this will be reported to the authorities.
We do have internal controls in place, but you should not just take our word for it. For now, there are no independent auditors yet in The Netherlands which would be able to comment on the implementation of our policies. Hence, please feel free to recommend an organization to us that would be able to fulfill this role.


I studied Industrial Engineering, and fell in love with processes and development.
After graduation I used that -engineering- mindset, and went into education. I was part of a global organization that
develops leadership in classrooms and communities to ensure all children can fulfill their potential. During that
time I taught math to junior high students.
My current job is on a company that’s partner of HP and Microsoft, and it has open me to a world where technology
is revolutionizing the way we do business at an intense pace!
Thanks to this exposure to technology, I got interested in learning to code and for the past few months, I’ve been
part of a high intensity boot camp. Hence this page.


 You can use it to create an account when you have EOS on an exchange.{% endblocktrans %}
{% trans "Make an EOS token transfer with the following data:" %}
{% trans "Recipient" %}: accountcreat{% trans "If you transfer less than the required minimum amount or any other error occurs, the transferred funds will be automatically refunded by the smart contract." %}
{% trans "If you transfer more than required, the remaining balance will be forwarded to your newly created account."  In the following example, we are using Binance." %}
{% trans "When you withdraw your EOS to the accountcreat smart contract, it will perform the following steps in order:" %}
{% blocktrans %}It's open source on github. If you want to use this code or need help modifying it to your needs, contact me at{% endblocktrans %} hello@eos-account-creator.com.


1110 Vermont Ave NW Washington, DC
Subscribe to our mailing list<EMAIL_ADDRESS>To work with us, send us an email at hello@simlab.org


A class used to represent the TRACK behaviour
of the robot
Attributes
-----
@param vel_pub: Publisher object for robot velocities
@type vel_pub: Publisher
@param position: Position of the robot
@type position: Point
@param vel: Velocity of the robot
@type vel: Twist
@param sub_scan: Object that represents the Subscriber to the topic scan
@type sub_scan: Subscriber
Methods
-----
clbk_odom(msg)
Callback function to obtain the odometry information
from the robot
clbk_laser(msg)
Callback function to obtain the laser information
in order to perform a better track of the ball
ask_oracle(request)
Method used to ask a specific request to the oracle
object_detector_client():
Makes a request to detector server and wait for the response
execute(userdata)
It start to follow the ball. When it is near the ball, it saves the x and y position.
If the ball is the requested one, it goes to PLAY otherwise it goes to FIND.
If the transition has been done from NORMAL, it goes to NORMAL state
Definition at line 428 of file command_manager.py.
| def command_manager.track.execute |
( |
|
self, |
|
|
|
userdata |
|
) |
| |
It start to follow the ball. When it is near the ball, it saves the x and y position.
If the ball is the requested one, it goes to PLAY otherwise it goes to FIND.
If the transition has been done from NORMAL, it goes to NORMAL state
@param userdata: used to pass data bejoint_state = tween states
@type userdata: list
@returns: transition value
@rtype: String
Definition at line 549 of file command_manager.py.
549 def execute(self, userdata):
552 It start to follow the ball. When it is near the ball, it saves the x and y position.
553 If the ball is the requested one, it goes to PLAY otherwise it goes to FIND.
554 If the transition has been done from NORMAL, it goes to NORMAL state
556 @param userdata: used to pass data bejoint_state = tween states
559 @returns: transition value
562 rospy.loginfo(
'Executing state TRACK')
568 self.sub_scan = rospy.Subscriber(
'scan', LaserScan, self.clbk_laser)
570 resp = self.object_detector_client()
571 ball = resp.object.split()
573 center = float(ball[1])
574 radius = float(ball[2])
576 while(radius <= 100):
578 resp = self.object_detector_client()
579 ball = resp.object.split()
581 center = float(ball[1])
582 radius = float(ball[2])
584 if((radius != -1)
and (center != -1)):
586 self.vel.angular.z = -0.003*(center-400)
587 self.vel.linear.x = -0.007*(radius-110)
589 self.vel.angular.z = 0
590 self.vel.linear.x = 0.09
592 self.vel.angular.z = 0.5
594 self.vel_pub.publish(self.vel)
596 self.ask_oracle(
"setPos "+ball_type+
" "+str(self.position.x)+
" "+str(self.position.y))
597 self.sub_scan.unregister()
598 if(userdata.ballType !=
"ND"):
599 rospy.loginfo(
"Requested ball: %s",userdata.ballType)
600 if(userdata.ballType == ball_type):
603 userdata.toFind =
True
606 userdata.toNormal =
True


Master Aren Athebalt:
I am already committed to my other 'students'. This is the first time you've mentioned an interest in archery. I wish you had come earlier.


Kind Greetings =
Hello there, awesome person!
local link to GitHub
local link to Salesforce's Trailhead
local link to The Odin Project


Component Based Webapps
React & Angular 2
What problem are we solving?
Solution, directives?
-
The mess of directives
- missing sane defaults
- ridiculous amount of odd syntax to remember
- angular component helps some...
Other issues we're solving?
- Better language support (ES6/7 & Typescript)
- Better performance
- Official CLI tool to standardize app creation & lifecycle
- Hot Module Reload
...and Native App Development!
The Component Approach
The Component Approach
React
- Maintainer: Facebook
- First Released: March 2013, ~3 years old
-
Github Stars:
A View Library
- Just the "V" in "MVC"
- Uses a virtual dom
- Need to add other libraries for some basic functionality (ex: axios/fetch for http, react-router for routing)
JavaScript Centric
- No html files, all inside js (Uses JSX)
- Community favors ES6, facebook supports
Lifecycle Methods
- componentDidMount
- componentWillReceiveProps
- componentWillUnmount
- ..and more
Advanced State Management
- Facebook recommends "Flux" architecture
- Most popular library (inspired by Flux): Redux
- Object Oriented alternative: Mobx
Testing
Facebook recommends Jest
- Uses Jasmine under the hood
- Works out of the box with React CLI
Tooling
Pros (vs Angular 2)
- More stable, bigger community
- Lots of tutorials and resources online
- Lightweight, easier to see the big picture
- Fails at compile-time
- JavaScript centric (debatable as pro)
- Easier to test
Cons
- JavaScript fatigue!
- Need to decide on basic things like routing, http calls, etc..
- Lots of tutorials but some in es5, some es6, some a mix!
- Some parts may be harder to learn from OO background
- Requires you to really understand JavaScript
-
how 'this' really works, .bind, .call, etc..
ng2 (Angular 2)
- Maintainer: Google
- First Released: September 2016, ~1 month old
-
Github Stars:
A framework
As in Angular 1, it comes with a lot out of the box:
- Http service
- Routing service
- Forms
- TestBed to aid in testing
- etc..
Html Centric
- Still uses templates, with various rendering logic
- Uses its own custom html parser
- No virtual dom, but performance is on par with React
TypeScript
- Superset of ES6, maintained by Microsoft
- Allows for static typing
-
Syntax similiar to C#/Java
- interfaces
- private
- statics
- get / set
- Good IDE support, especially in VSCode & IntelliJ
Architectural overview
Angular 2 from 1
A brief comparison
See here for a full reference
Interpolation & Filters
Have pretty much stayed the same
ng-repeat & local variables
ng-class [one-way attributes]
ng-click (events)
ng-model [(two-way binding)]
ng-controller - @Component
See full project here
RxJS
Angular 2's Http service uses this by default
- Allows you to subscribe to an http call
- Allows you to filter, compose, etc..
- Only get updated when what you filtered changes
Testing
- Test Utils provided by Angular 2
- Uses Jasmine under the hood
- Some tests may require a bit of setup
Tooling
-
Angular CLI (Official CLI)
- Based on highly successful Ember CLI tool
- Allows you to create components, services, etc.. from command line
- Still in beta...
- Augury ng2 chrome dev tool (Unofficial, work in progress)
Pros (vs React)
- Framework provides most of what you need
- More opinionated, standardizing is easier
- Closer to Java syntax, easier for non-JavaScript devs
- CLI tool standardizes creating new components, services..
- Can leverage some Angular 1 experiences
- RxJS works out of the box (must be added to React)
Cons
- Just released, still going through bug fixes
- You need to learn TypeScript
- Unofficial tutorials may not work due to breaking changes
- Requires a lot of framework specific syntax to learn
- Testing is more difficult, especially mocking angular services
- CLI tool is still in beta


| DOSE: |
repeated |
oral |
MDMA |
(pill / tablet) |
I am a 26 year old Belgian guy, and I have stopped taking drugs for almost 5 years. I would like to tell you about the positive and negative sides of my experience with E and speed.
When I was on my 3rd year at uni, I went to the UK as an Erasmus student and it was the first time that I was able to be totally free to do whatever I wanted to do with no parents or close friends around. I have always been quite a rebel, but that doesn't mean that I am dressing like a punk or whatever. I was what you would call a preppy boy, but inside me, I was a rebel.
As soon as I arrived in the UK (in september 1998), I made friends with the local guys and some of them became close friends. Soon, I started going out to the local pubs and nighclubs. At that time, the rave scene was very popular among students, and I am wondering if it still is. I soon realised that almost everyone in the rave scene took drugs when going out, and that everyone was smiling at me, hugging me and asking me 'how many did you take?'. At first I was put off by them, because I was not pro-drugs at all. I had hardly smoked a joint when I was younger and I did not have such a good experience with it.
However, some events made me want to try E. A friend of mine who had also never taken anything in her life asked a mate to sell her a pill and she asked me to stay close to her in case anything would happen. Soon, she felt all lovey, hugging me, kissing me and telling the whole world how she felt. That was during a rave party and she really had the best night of her life. In the meanwhile, I was amused by seeing her having so much fun, and it made me wonder, how would I feel if I also took one pill?
Two weeks later, a student at uni told me he was going to that rave in town and asked me if I wanted to join him. I will never forget that night. It was Halloween night, 31 October 1998. I asked him if he could find some MDMA for me. At first I was all excited, wanting the party to start as soon as possible. I even asked him to give me the pill before even entering the nightclub. He told me to calm down and promised me he would give me a quarter of a pill (because, according to him, the pill was pure MDMA and as a first-time user, if I took a full pill, it would knock me out). So, I agreed to take a quarter of a pill, knowing that later, I would have another quarter, and so on.
Before coming in the local pub where all my mates were gathering before going out or going to bed, my friend gave me my first dose. It took quite a while for me to feel the effects, so after 45 minutes, as I wasn't feeling anything, I asked him to give me another quarter of a pill, which he reluctantly did, cos he was frightened anything would happen to me. But I reassured him, telling him not to worry about me and to enjoy himself.
Before the rush, my stomach started tickling and I was also breathing deeper. I got back among my mates and boy! The pill started kicking hard! The rush was so powerful and so fast that everyone around me noticed that I was on a high!!! I also started to feel the warmest, deepest love for everyone around me, feeling empathy as well. I also became very talkative, talking about various things which seemed very profound to me, but it was total rubbish for others who weren't high. My mate, noticing that I was about to make a fool of myself in front of everyone, took me out and we went together to the night venue. I couldn't help myself but hug and kiss him the whole way to the venue and telling him how great I was feeling. I was still very aware of everything around me, seeing normally, and thinking rationally except for the fact that everything and everyone around me was beautiful and nice!!!
When we arrived at the night venue, I started dancing and I danced non-stop for 8 hours. My friend made sure that I was drinking plenty of water and he was regularly telling me to go and fill up my bottle. I also had that stomach pain but it was nothing compared to that feeling of love and empathy. My brain was also tickling and it felt like it was swelling, but the feeling was awesome; I only had that feeling in the brain the first time; the next times, it just wasn't there and I missed it. I was high for about 18 hours!!!! Unable to sleep, I went to visit a friend the next afternoon. He noticed I was still high and fucked up but later we both laughed at it.
Also, one strange thing about me that I have never been able to find in any testimonial, is that I was unable to smoke while I was on a high with E. At that time, I was quite a heavy smoker, smoking almost 1 pack every day. But when I was high, I couldn't bear the taste of the cigarette and it deterred me from smoking in the night venues. Once I was back to normal, I could light up a cigarette. I don't smoke now.
So I started becoming a recreative user, waiting for the next weekend to go out again and have that pill which made me feel so good. I think that between November 1998 and January 1999, I took at least one pill per week, sometimes mixing it with acid/base (common names of speed there) which was readily available in the rave scene at that time. My last pills were in March 1999, then in March 2000.
However, I was NEVER able to experience again the feelings I had the very first time with E. The feelings were still very strong, but not as strong as the first time and I somewhat missed it. I also needed greater dosages. In January 1999, I was taking about 1 to 2 pills per night out. I do not have an addictive personality, so I never felt I HAD to take a pill. One weekend, I went out without taking any pill or speed, because I felt my body and brain needed a break.
However, the downfall was on Tuesdays. After the third week, I started feeling the downsides of ecstasy. Depression on Tuesdays, angriness, irritability (always on Tuesdays; I never knew why I was feeling ok on Mondays), so I skipped classes on Tuesdays and stayed at home because any contact with anyone would make me very irritable. Teachers started noticing my absences on Tuesdays and gave me a warning which didn't put me off at all. On Wednesday morning, I was back to my normal self and I was again the lovely guy everyone liked.
I never had any bad feelings with E itself during my nights out. However, I need to tell you about a VERY bad experience while being high. In January 1999, 3 days before I flew back home, there were two raves in town, and my friends had told me to meet in one of them. They had forgotten to tell me which venue it was in, so I drove around town with a taxi for about 1.5 hours before finding the right place. I had already taken a pill and I was starting to feel the effects when I found the place. I paid the cab driver and came into the nightclub. I immediately found my friends and went for a pee, then I had a friendly talk with a guy in the toilet before going back to my friends.
When I told my friends it was my shout, I noticed that my wallet had gone. It obviously had been stolen in the nightclub itself since I had to pay for the entrance. So, I almost had a wave of a panick attack, but my friends reasoned me and told me to go to the nearby police station, which was actually next to the nighclub. I was still VERY high (the pill was especially powerful that night and I suspect it was also mixed with speed because the empathy feelings were not as strong as usual) when I went to the police station. I couldn't stop dancing even though there was no music at the station.
 I think that being Belgian played in my advantage because they took great care of me and tried to calm me down. I was extremely nervous but still being very nice, trying not to swear or anything. They took notice of my statement and they let me leave.
I went back to the nightclub and worried about my ID and bank cards, I told my friends I needed to contact my embassy in London. So, they gave me about 1 gramme of speed to keep me awake and to avoid panick attacks (so they said). They told me to take about 1 rail every now and then. However, soon, the panick attack kicked in and I had no other alternative than to take the speed they had given me. I could not bear being alone, so I asked them to stay close to me until I had called everyone in Belgium; my bank, my parents, my embassy in London, my travelsagent, etc. to let them know about my stolen wallet.
Well, 1 gramme of speed made me high for about 2 days. I was still high when I saw my parents again and in the plane I was feeling very stressed because you feel much higher when being at a high altitude (or was it just the pressurisation? I don't know). Fortunately, the flight was quite short, about 1.5 hours, so I was relieved when I was able to go out of the plane.
Well, that was almost my last experience with E and speed...
HOWEVER... 2 months later....
In March 1999, I took a pill again at a venue in the UK (I was back only for a big party organised by the uni), I almost regretted taking it. It didn't make me feel warm, lovey anymore, but very tired, almost sad. I think it wasn't MDMA but something else. I promised myself that I would never take a pill again.
1 week later, at a house party in Belgium, I started feeling depressed and I told my friends I was heading home. In my car, a few kilometres down the road, I had a sudden panick attack, with that horrible feeling of near-death. I had to stop my car for half an hour, to recover.
That was not the last panick attack.
In May 1999; during my exams, I had another panick attack while studying. My mother had to drive me to the psychiatric urgencies because I was feeling SOOO bad. I was prescribed anti-depressors and anxiolytics. I had to take these pills for 1.5 years to control my panick attacks.
I suspect these panick attacks were due to the downside effects of speed or E. I will never know for sure, but in March 2000, I tried another E pill again in Amsterdam, and it made me feel sick and depressed, so I told myself it was the VERY LAST one.
So, now, I can tell you, I haven't taken anything for almost 5 years. I am scared to have panick attacks again, because these are the worst thing you can feel!!! Even the thought of smoking a joint scares me. I also totally avoid nightclubs; I haven't been out to a place that might remind me of a rave venue since 2001. Last time I was in such a place, I went out straight away because I was feeling scared shitless.
I am now leading a brillant career in the academic field and I do not regret having experimented E and speed, even though that experiment has deterred me from going out to dark places, I cannot stand anyplace that might remind me of my panick attacks.
I just thought that my testimonial would be useful for some of you. E can be very powerful and it can bring some great feelings in you but it has also its downsides. So think carefully about it before taking it for the first time. I try to give my thoughts and feelings to the youngsters who are willing to try it. I am not ashamed about my previous drug-use and everyone around me knows about it.
Take care buds!!! And better be safe than sorry!
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.


{# Copyright (c) 2014 Kevin Bell. All rights reserved. #} {# See the file LICENSE.txt for copying permission. #} {% extends "base_form_content.html" %} {% load bootstrap %} {% block form_content %}
Don't have an account yet? Sign up here!


Notifications are disruptive by nature. They keep you from what you're working on, or interrupt you in social settings.
Not all notifications are bad, like event reminders and messages from friends. It can be hard to weed out what
notifications are genuinely useful.
Hush is a guide to help make sense of your phone's notifications. We've collected a list of apps that we've found
notoriously intrusive, and have developed guides to help cut out the unnecessary bits.
Every app has a badge indicating how many issues we've found with it. Click on the app for a brief writeup
describing how to keep the app quiet.
If you have any questions, feel free to say hi.


Beautiful Things
Source of witness transcribed: Los Angeles Daily Herald (Los Angeles, California)
Date of witness transcribed: 16 October 1875
Notes about this poem: "Beautiful Things" was printed in at least 205 newspapers during the nineteenth century. It can be found using ID 8921 in this table of most widely-reprinted poems.
§
- Beautiful faces are those that wear,
- It matters little if dark or fair—
-
Whole-souled honestly printed there.
- Beautiful eyes are those that show,
- Like crystal panes where hearth fires glow,
-
Beautiful thoughts that burn below.
- Beautiful lips are those whose words
- Leap from the heart like songs of birds,
-
Yet whose utterance prudence girds.
- Beautiful hands are those that do
- Work that is earnest and brave and true,
-
Moment by moment the long day through.
- Beautiful feet are those that go
- On kindly ministries to and fro—
-
Down lowest ways, if God wills it so.
- Beautiful shoulders are those that bear
- Ceaseless burdens of homely care
-
With patient grace and daily prayer.
- Beautiful lives are those that bless—
- Silent rivers of happiness.
-
Whose hidden fountains few may guess
- Beautiful twilight, at set of sun
- Beautiful goal, with race well won,
-
Beautiful rest, with work well done.
- Beautiful graves, where grasses creep,
- Where brown leaves fall, where drifts lie deep
- Over worn-out hands—Oh, beautiful sleep!


Edit Language CodesEPiServer is capable of managing all types of language. There are eight languages as standard, Swedish, Norwegian, Danish, Finnish, German, French, Spanish and English. If your organization requires further languages, it is possible to add these. By adding new languages under Edit language codes, you can add extra support for language encoding of an individual page. If a page has been language encoded, all standard texts on the page are in the selected language, provided the language has been translated. If you also require local settings such as time format, currency etc. to be displayed in the applicable language, it must be listed under Edit language codes. In the example below we want to add New Zealand as a new language. They speak English there, so it may feel unnecessary. But at the same time they write the date differently, compared to other English-speaking countries. Therefore we want to be able to choose to have the website according to New Zealand standards. Add a new language as follows:
|
|
Read more in Editor's Manual - Read more in Administratorís Manual |


--- layout: post title: Discovering Bay Park West categories: [] tags: - hiking status: publish type: post published: true meta: _original_post_id: '' _original_import_author: John Duprey author: ---
Abby discovered a near by entrance to bay park west. It should afford me a "big loop" should I ever get running again.
http://runkeeper.com/user/jduprey/activity/29060072
From the map, you can see S. Glenn Rd is not too far and the trails do hook up with it.


{{ partial "header.html" . }}
Questions or comments? Find us on twitter or submit an issue on github
You'll get 1-2 emails per month


Version 1.10
Added x64 version.
Added .dynamic section viewer.
Improved the symbol table viewer to work better with executables with huge symbol tables.
Added ability to sort symbols by name or by address.
Version 1.00
Initial version.


|
ChimerasWe're of two minds about the whole thingChimeras are the most extreme form of Siamese twins; two twins who have fused into a single person. How this happens is still a slight mystery; either they are two separate embryos that fuse as Siamese twins do into a single embryo, or the slightly more disturbing idea that one twin consumes the other, gaining those characteristics. (Keep in mind this would be happening within the first few weeks of pregnancy, so don't worry about it too much.)Like "Siamese Twins" have the term "Conjoined Twins", Chimeras are also known as "Disappeared Twins". We're rooting for Chimera, though. It is thought that many Chimeras don't even know what they are and live their whole lives not knowing. The situation usually comes to light in conjuction with a medical procedure, say an organ transplant or an invasive operation like a gall bladder removal. Then the usual tests are taken but some really whack-ass results emerge: multiple blood types, structures of male and female organs inside the body (hermaphrodism), and organs that are incompatible with the children of the chimera, where normally they should be. One of the more interesting obvious signs are eyes of different color. In November of 2003, a 52-year-old woman in Boston was found to be incompatible with two of her three children for an organ transplant, meaning she had lived an entire half-century with no idea of her condition. Thankfully, this is one freak act of nature that allows the individual to lead a "normal life" throughout. |


17-313: Foundations of Software Engineering
Homework 5: Quality Assurance for the People
In this assignment, you will carefully consider and engage in several QA-related processes to evaluate and look for defects in your prototype Teedy-based graduate admissions system. The goals of this assignment are:
- Gain hands-on experience with analysis tools, including setting up, customizing, and using them.
- Practically assess and compare the costs and benefits of existing static and dynamic bug-finding tools.
- Develop a plan to integrate and roll out tools in development practice.
- Explain the predictions of a Machine Learning Model, and reason about their implications.
Project Context and Tasks
Quality Assurance is a critical part of software development. Although you have been testing your new graduate admissions system this whole time, you are now setting out to establish a sustained QA practice that can be used moving forward as you iterate over and continue to improve your system. Your CTO has assigned you the task of evaluating existing tools and practices beyond unit testing, and producing a report on (A) the cost/benefit tradeoffs and risks of several tools and processes and (B) how they might fit in development practice.
Static and Dynamic Analysis
First, you will evaluate and choose between a set of analysis tools, integrate it into your
build/deployment pipeline, and document your decisions/process by way of a design document/RFC. For
the purposes of this RFC, you must identify and experiment with at least N
potential static and dynamic analysis
tools that are applicable to your system, where N
is the size of your group. We provide a
starter list below; you should include at least one static analysis and one dynamic analysis tools,
and at least one tool must be taken from either a Google search or from the Awesome Static/Dynamic
Analysis page (that is, cannot otherwise be listed in the bulleted list).
You can create a new team repository by following the link for your team, which will clone the Teedy code automatically:
Create Assignment with Github Classroom
Apply one or more of the tools to your project. You may also apply it to one or more other programs if you wish to assess it in different contexts. Consider and experiment with the types of customization that are appropriate or necessary for this tool, both a priori (before they can be used in your project) and possibly over time. Assess the strengths and weaknesses of each tool/technique, both quantitatively and qualitatively. You might consider issues like, but not limited to: what types of problems are you hoping your tooling will catch? What types of problems does a particular tool catch? What types of customization are possible or necessary? How can/should this tool be integrated into a development process? Are there many false positives? False negatives? True positive reports about things you don’t care about?
The deliverable for this part, at a high level, is a Design Document/RFC that explains and justifies the tooling you propose to incorporate into your process, and how you propose to do so. This decision should be feature- and data-driven, and should consider usability and process questions like how and when the tooling will be applied, and by whom. See below for more details.
NOTE: you do not need to integrate ALL N
tools into your repo, but you should
integrate at least (1) tool so that it runs via CI, and have one commit on which it was run. You
should reference this commit in your design document
Starter list of Tools
Teedy has a Java backend and an AngularJS (JavaScript) frontend. Below are non-exhaustive lists of analysis tools that are available for both Java and JavaScript. Others are available. Awesome Static Analysis page/repo and Awesome Dynamic Analysis page/repo have extensive listings of available static and dynamic analysis tools for a pretty hefty list of programming languages, including Java. Some of the tools have GitHub Actions workflows on GitHub Marketplace; use your Googling skills, and see what you find!
Java
Static analysis:
- Checkstyle, a tool for checking Java source code for adherence to a code standard.
- SpotBugs, a fork of FindBugs that can spot over 400 bug patterns
Dynamic analysis:
- Pitest, a mutation testing system for Java.
- YourKit, commercial Java profiler (15 days trial)
JavaScript
- eslint is a widely used linter in modern JavaScript packages.
- flow is a static type checker for JavaScript.
ML Model Assessment
In the last homework assignment, you created a Machine Learning model. In fact, after your success with HW4, your team has started collecing data in production, and the new data for your ML service goes well beyond the data you used for testing. Therefore, your CTO is seriously considering adding it into your product. However, before announcing it as a feature, she wants to ensure that your team has a deep understanding of how the ML model is working, as well as that it is tested with respect to any concerns that may have surfaced previously. For this task, your team is tasked with writing a data-driven report for your CTO. You should evaluate the model, test outcomes, present your findings, and discuss them.
Your first task is to present a data-driven analysis of the predictions that your model is making. You will do this using the LIME tool we have previously looked at in class: https://github.com/marcotcr/lime
Run this tool on your model, and collect data on how the model is making predictions. You should use this data to report on the behavior of the ML recommendation system. Here, when you run the tool, remember to use the more complete production data that your team has collected, in the place of the previous limited training data. You can find the updated data here: Production Data
The data-driven analysis will allow your company to ensure that the ML is working properly. However, you are also concerned with fairness.
You should also include in your report a data-driven analysis of the fairness of your algorithm. To analyze the fairness, you should remember the fairness discussion we had in class, based on this tool: ML Discrimination. Then, consider two of the fairness approaches we discussed in class, and compare them. Finally, you report should include a recommendation if you want to use the ML, scrap it, or make specific improvements before rolling it out.
Specifically your report should include the following information:
- Data-driven analysis of the predictions the model is making.
- Any concerns you have about the quality of the predictions in light of this data.
- Any features in the data you are concerned about from a fairness perspective. HINT: you might want to consult your last homework when considering this.
- A data-driven analysis of the interplay between these features and your ML model. There are
various ways to do this, but a simple approach might consider the following:
- Distribution of this feature in your dataset.
- Distribution of this feature in your accepted and rejected recommendation populations
- Relationship between this feature and your false positives and false negatives.
- Based on this data, you should consider what is the fairness strategy that you are trying to achieve. You may use two of the fairness strategies we considered in class, or define your own. If you define a new fairness strategy, you should describe it, and present why you think it is a better fit than any of the existing strategies for this product.
- If you are not happy with the performance of the system, based on the data you have collected,
you should do the following:
- Report on what aspects of the system you are unhappy with
- Iterate your model 1 iteration, and see if you can improve its performance. Most likely, this will NOT be enough to fix it, but your goal in this assignment is to learn enough to make a reasonable estimate of the effort needed to fix the model.
- Make an estimate of how long it will take to bring the model up to acceptable performance. This can be a “T-Shirt” estimate (e.g., S/M/L/XL) but it should also include completion criteria. This will look like specific thresholds that your model should achieve before you would be comfortable shipping it as a part of your product.
- At the end of this report, make a recommendation to your CTO. This recommendation should be one
of the following:
- It is good enough to use now, we should ship it.
- It is not good enough to ship, but we have a plan to improve it
- We don’t feel comfortable shipping this feature, we should scrap it.
Deadlines and Deliverables
This homework has one (1) deadline and two (2) deliverables. The deadline (Friday, Nov 18) is for all the deliverables: the static analysis design doc, and the report on the ML model.
Part A: Static Analysis - Group (due Nov 18) - 50 points (50%)
The deliverable for this part is a Design Document/RFC that provides (1) a justified explanation for which tool(s) you think the project should use moving forward, and (2) how it shall be integrated into your process (you must recommend at least one tool, even if it’s with reservations). This latter point should address both technical (e.g., at what point in the development/deployment process shall it be integrated? What sorts of customization or configuration will you be using?) and social issues (e.g., how will you incentivize the change?), as applicable. The justification should be based on your experiences running the tools and, as much as possible, be grounded in data about, for example, tool usability, output, and customizability.
Be sure the RFC also explains/justifies the alternative tools (or process options, if pertinent) that
have been rejected. To receive full credit, you must consider at least N
total tool options in your RFC, where
N
is the size of your team. The document
should also contain other relevant sections for a Design Document/RFC for this type of (development
process) feature. Are there open questions? Issues you consider out of scope? Drawbacks of the
proposed process/tooling that you are accepting for some (good) reason? Etc. That is: make sure it’s
a good/complete design document!
NOTE: in your PDF submitted to gradescope, you should explictly reference at least one commit on which your tool has been run in your repo.
Submit the Design Document as a single PDF to Gradescope.
Part B: ML Explainability – Group (due Nov 18) – 50 points (50%)
For this deliverable, you will be collecting data, and writing a report. The report should include the data you collect as well as your interpretation of the data.
First, you should collect data by running LIME on your ML model from the last homework (use the model
you have in the fall-22-hw4
repository),
with the new data. You should present the results of this as data in your report.
Then, you will interpret the data to explain why your machine learning model is making predictions. This information should include the features that provide the most predictive power.
You should also evaluate your machine learning model considering fairness issues. You will evaluate the performance of your model with a specific target fairness strategy in mind, and if you are unhappy with the fairness of the model, you will come up with thresholds that you feel the model must meet before you would feel comfortable using it.
Based on your findings, you should recommend one of three options. You might feel that the model is good enough to deploy as is, you might recommend specific changes before you deploy, or you might recommend it not be deployed at all.
Submit this report as a PDF via Gradescope.


Pacific Rim Uprising
Pacific Rim: Uprising is a movie starring John Boyega, Scott Eastwood, and Cailee Spaeny. Jake Pentecost, son of Stacker Pentecost, reunites with Mako Mori to lead a new generation of Jaeger pilots, including rival Lambert and...


In a real-world scenario in which a service such as the compute engine is deployed, a developer would likely create a Java Archive (JAR) file that contains theCompute
andTask
interfaces for server classes to implement and client programs to use. Next, a developer, perhaps the same developer of the interface JAR file, would write an implementation of theCompute
interface and deploy that service on a machine available to clients. Developers of client programs can use theCompute
and theTask
interfaces, contained in the JAR file, and independently develop a task and client program that uses aCompute
service.In this section, you learn how to set up the JAR file, server classes, and client classes. You will see that the client's
Pi
class will be downloaded to the server at runtime. Also, theCompute
andTask
interfaces will be downloaded from the server to the registry at runtime.This example separates the interfaces, remote object implementation, and client code into three packages:
compute
–Compute
andTask
interfacesengine
–ComputeEngine
implementation classclient
–ComputePi
client code andPi
task implementationFirst, you need to build the interface JAR file to provide to server and client developers.
First, you need to compile the interface source files in thecompute
package and then build a JAR file that contains their class files. Assume that userwaldo
has written these interfaces and placed the source files in the directoryc:\home\waldo\src\compute
on Windows or the directory/home/waldo/src/compute
on Solaris OS or Linux. Given these paths, you can use the following commands to compile the interfaces and create the JAR file:
Microsoft Windows: cd c:\home\waldo\src javac compute\Compute.java compute\Task.java jar cvf compute.jar compute\*.classSolaris OS or Linux: cd /home/waldo/src javac compute/Compute.java compute/Task.java jar cvf compute.jar compute/*.class
The
jar
command displays the following output due to the-v
option:added manifest adding: compute/Compute.class(in = 307) (out= 201)(deflated 34%) adding: compute/Task.class(in = 217) (out= 149)(deflated 31%)Now, you can distribute the
compute.jar
file to developers of server and client applications so that they can make use of the interfaces.After you build either server-side or client-side classes with the
javac
compiler, if any of those classes will need to be dynamically downloaded by other Java virtual machines, you must ensure that their class files are placed in a network-accessible location. In this example, for Solaris OS or Linux this location is/home/user/public_html/classes
because many web servers allow the accessing of a user'spublic_html
directory through an HTTP URL constructed ashttp://host/~user/
. If your web server does not support this convention, you could use a different location in the web server's hierarchy, or you could use a file URL instead. The file URLs take the formfile:/home/user/public_html/classes/
on Solaris OS or Linux and the formfile:/c:/home/user/public_html/classes/
on Windows. You may also select another type of URL, as appropriate.The network accessibility of the class files enables the RMI runtime to download code when needed. Rather than defining its own protocol for code downloading, RMI uses URL protocols supported by the Java platform (for example, HTTP) to download code. Note that using a full, heavyweight web server to serve these class files is unnecessary. For example, a simple HTTP server that provides the functionality needed to make classes available for downloading in RMI through HTTP can be found at http://java.sun.com/javase/technologies/core/basic/rmi/class-server.zip.
Theengine
package contains only one server-side implementation class,ComputeEngine
, the implementation of the remote interfaceCompute
.Assume that user
ann
, the developer of theComputeEngine
class, has placedComputeEngine.java
in the directoryc:\home\ann\src\engine
on Windows or the directory/home/ann/src/engine
on Solaris OS or Linux. She is deploying the class files for clients to download in a subdirectory of herpublic_html
directory,c:\home\ann\public_html\classes
on Windows or/home/ann/public_html/classes
on Solaris OS or Linux. This location is accessible through some web servers ashttp://host:port/~ann/classes/
.The
ComputeEngine
class depends on theCompute
andTask
interfaces, which are contained in thecompute.jar
JAR file. Therefore, you need thecompute.jar
file in your class path when you build the server classes. Assume that thecompute.jar
file is located in the directoryc:\home\ann\public_html\classes
on Windows or the directory/home/ann/public_html/classes
on Solaris OS or Linux. Given these paths, you can use the following commands to build the server classes:
Microsoft Windows: cd c:\home\ann\src javac -cp c:\home\ann\public_html\classes\compute.jar engine\ComputeEngine.javaSolaris OS or Linux: cd /home/ann/src javac -cp /home/ann/public_html/classes/compute.jar engine/ComputeEngine.java
The stub class for
ComputeEngine
implements theCompute
interface, which refers to theTask
interface. So, the class definitions for those two interfaces need to be network-accessible for the stub to be received by other Java virtual machines such as the registry's Java virtual machine. The client Java virtual machine will already have these interfaces in its class path, so it does not actually need to download their definitions. Thecompute.jar
file under thepublic_html
directory can serve this purpose.Now, the compute engine is ready to deploy. You could do that now, or you could wait until after you have built the client.
Theclient
package contains two classes,ComputePi
, the main client program, andPi
, the client's implementation of theTask
interface.Assume that user
jones
, the developer of the client classes, has placedComputePi.java
andPi.java
in the directoryc:\home\jones\src\client
on Windows or the directory/home/jones/src/client
on Solaris OS or Linux. He is deploying the class files for the compute engine to download in a subdirectory of hispublic_html
directory,c:\home\jones\public_html\classes
on Windows or/home/jones/public_html/classes
on Solaris OS or Linux. This location is accessible through some web servers ashttp://host:port/~jones/classes/
.The client classes depend on the
Compute
andTask
interfaces, which are contained in thecompute.jar
JAR file. Therefore, you need thecompute.jar
file in your class path when you build the client classes. Assume that thecompute.jar
file is located in the directoryc:\home\jones\public_html\classes
on Windows or the directory/home/jones/public_html/classes
on Solaris OS or Linux. Given these paths, you can use the following commands to build the client classes:
Microsoft Windows: cd c:\home\jones\src javac -cp c:\home\jones\public_html\classes\compute.jar client\ComputePi.java client\Pi.java mkdir c:\home\jones\public_html\classes\client cp client\Pi.class c:\home\jones\public_html\classes\clientSolaris OS or Linux: cd /home/jones/src javac -cp /home/jones/public_html/classes/compute.jar client/ComputePi.java client/Pi.java mkdir /home/jones/public_html/classes/client cp client/Pi.class /home/jones/public_html/classes/client
Only the
Pi
class needs to be placed in the directorypublic_html\classes\client
because only thePi
class needs to be available for downloading to the compute engine's Java virtual machine. Now, you can run the server and then the client.


{% extends 'base.html' %} {% block header %}
A heatmap is a graphical representation of data that uses a system of color-coding to represent different values
{# #}A box plot (also known as box and whisker plot) is a type of chart often used in explanatory data analysis to visually show the distribution of numerical data and skewness through displaying the data quartiles (or percentiles) and averages.
{# #}A graph in which the values of two variables are plotted along two axes, the pattern of the resulting points revealing any correlation present.
{# #}


Pros to Pair Programming
Pair programming has many benefits and advantages as compared to solo programming. It allows people to catch errors earlier. Having two people understand the code makes it easier to maintain. Also problem solving can be more dynamic and innovative, because two heads are better than one! Pair programming is important at DBC because it is teaches how to work well with other people and is an important employable skill.
There is a driver and a navigator in each pair. The role of the navigator is to direct the session and give instructions to the driver. The role of the driver is to execute the navigator's directions by typing out code as the navigator specifies.
Reflection
This was the first real pairing session, and it felt really good! It was nice to have someone with more experience as a guide, and Molly was great to work with. I am surprised that I like it. I thought that between not being used to working with another person like that and not being used to using google hangouts that I would not like it or it would be difficult. It worked well for us to trade off driving and navigating and checkin in with eachother to make sure we were both feeling good. It didn't work so great at first trying to pair writing content, but with the guidence of our guide, we realized that wasn't what pairing was for, and just each busted out some content and gave quick feedback.


Overview
Package
Class
Use
Tree
Deprecated
Index
Help
PREV NEXT
FRAMES
NO FRAMES
All Classes
A
B
C
D
E
F
G
I
J
O
P
R
S
W
Z
A
addEdge(Edge, Collection<? extends Node>, Graph.EdgeType)
- Method in class obvious.jung.data.
JungObviousForest
addEdge(Edge, Node, Node, Graph.EdgeType)
- Method in class obvious.jung.data.
JungObviousForest
addEdge(Edge, Collection<? extends Node>, Graph.EdgeType)
- Method in class obvious.jung.data.
JungObviousNetwork
Adds a hyperedge.
addEdge(Edge, Node, Node, Graph.EdgeType)
- Method in class obvious.jung.data.
JungObviousNetwork
Convenience method for multigraphs.
addEdge(Edge, Pair<? extends Node>, EdgeType)
- Method in class obvious.jung.data.
JungObviousNetwork.JungGraph
addEdge(Edge, Node, Node)
- Method in class obvious.jung.utils.wrappers.
WrapToJungGraph
addEdge(Edge, Node, Node, EdgeType)
- Method in class obvious.jung.utils.wrappers.
WrapToJungGraph
addEdge(Edge, Collection<? extends Node>)
- Method in class obvious.jung.utils.wrappers.
WrapToJungGraph
addEdge(Edge, Collection<? extends Node>, EdgeType)
- Method in class obvious.jung.utils.wrappers.
WrapToJungGraph
addEdge(Edge, Node, Node)
- Method in class obvious.jung.utils.wrappers.
WrapToJungTree
addEdge(Edge, Node, Node, EdgeType)
- Method in class obvious.jung.utils.wrappers.
WrapToJungTree
addEdge(Edge, Collection<? extends Node>)
- Method in class obvious.jung.utils.wrappers.
WrapToJungTree
addEdge(Edge, Collection<? extends Node>, EdgeType)
- Method in class obvious.jung.utils.wrappers.
WrapToJungTree
addListener(ViewListener)
- Method in class obvious.jung.view.
JungObviousView
addNetworkListener(NetworkListener)
- Method in class obvious.jung.data.
JungObviousNetwork
addNode(Node)
- Method in class obvious.jung.data.
JungObviousForest
addNode(Node)
- Method in class obvious.jung.data.
JungObviousNetwork
Adds a node.
addVertex(Node)
- Method in class obvious.jung.data.
JungObviousNetwork.JungGraph
Adds a node to the graph.
addVertex(Node)
- Method in class obvious.jung.utils.wrappers.
WrapToJungGraph
addVertex(Node)
- Method in class obvious.jung.utils.wrappers.
WrapToJungTree
B
beginEdit(int)
- Method in class obvious.jung.data.
JungObviousNetwork
Indicates the beginning of a column edit.
C
containsEdge(Edge)
- Method in class obvious.jung.data.
JungObviousNetwork.JungGraph
Checks if a specific edge is in the graph.
containsEdge(Edge)
- Method in class obvious.jung.utils.wrappers.
WrapToJungGraph
containsEdge(Edge)
- Method in class obvious.jung.utils.wrappers.
WrapToJungTree
containsVertex(Node)
- Method in class obvious.jung.data.
JungObviousNetwork.JungGraph
Checks if a specific node is in the graph.
containsVertex(Node)
- Method in class obvious.jung.utils.wrappers.
WrapToJungGraph
containsVertex(Node)
- Method in class obvious.jung.utils.wrappers.
WrapToJungTree
createGraph(Schema, Schema)
- Method in class obvious.jung.data.
JungDataFactory
createGraph(Schema, Schema, Map<String, Object>)
- Method in class obvious.jung.data.
JungDataFactory
Returns an Obvious Network.
createSchema()
- Method in class obvious.jung.data.
JungDataFactory
createTable(Schema)
- Method in class obvious.jung.data.
JungDataFactory
createTable(Schema, Map<String, Object>)
- Method in class obvious.jung.data.
JungDataFactory
Returns an Obvious Table.
D
degree(Node)
- Method in class obvious.jung.utils.wrappers.
WrapToJungGraph
degree(Node)
- Method in class obvious.jung.utils.wrappers.
WrapToJungTree
DESTNODE
- Static variable in class obvious.jung.data.
JungObviousNetwork
Name for the Target Node index in edgeSchema.
E
edgeTypeMap
- Variable in class obvious.jung.data.
JungObviousNetwork.JungGraph
Map indicating the type of an edge.
endEdit(int)
- Method in class obvious.jung.data.
JungObviousNetwork
Indicates the end of a column edit.
F
findEdge(Node, Node)
- Method in class obvious.jung.utils.wrappers.
WrapToJungGraph
findEdge(Node, Node)
- Method in class obvious.jung.utils.wrappers.
WrapToJungTree
findEdgeSet(Node, Node)
- Method in class obvious.jung.utils.wrappers.
WrapToJungGraph
findEdgeSet(Node, Node)
- Method in class obvious.jung.utils.wrappers.
WrapToJungTree
fireNetworkEvent(int, int, int, int)
- Method in class obvious.jung.data.
JungObviousNetwork
Notifies changes to listener.
G
getAttributeValuetAt(Tuple, String)
- Method in class obvious.jung.visualization.
JungObviousVisualization
getChildCount(Node)
- Method in class obvious.jung.data.
JungObviousForest.JungForest
getChildCount(Node)
- Method in class obvious.jung.data.
JungObviousTree.JungTree
Gets the number of children for a specific node.
getChildCount(Node)
- Method in class obvious.jung.utils.wrappers.
WrapToJungTree
getChildEdges(Node)
- Method in class obvious.jung.data.
JungObviousForest.JungForest
getChildEdges(Node)
- Method in class obvious.jung.data.
JungObviousTree
Gets all the child edges of a node.
getChildEdges(Node)
- Method in class obvious.jung.data.
JungObviousTree.JungTree
Gets the children edges for a node.
getChildEdges(Node)
- Method in class obvious.jung.utils.wrappers.
WrapToJungTree
getChildNodes(Node)
- Method in class obvious.jung.data.
JungObviousTree
Gets all the child nodes of a node.
getChildren(Node)
- Method in class obvious.jung.data.
JungObviousForest.JungForest
getChildren(Node)
- Method in class obvious.jung.data.
JungObviousTree.JungTree
Gets the children of a node.
getChildren(Node)
- Method in class obvious.jung.utils.wrappers.
WrapToJungTree
getConnectingEdge(Node, Node)
- Method in class obvious.jung.data.
JungObviousForest
getConnectingEdge(Node, Node)
- Method in class obvious.jung.data.
JungObviousNetwork
Gets for two nodes the connecting edge.
getConnectingEdges(Node, Node)
- Method in class obvious.jung.data.
JungObviousForest
getConnectingEdges(Node, Node)
- Method in class obvious.jung.data.
JungObviousNetwork
Gets connecting edges between two nodes.
getDefaultEdgeType()
- Method in class obvious.jung.data.
JungObviousNetwork.JungGraph
Gets the default edgeType for the graph.
getDefaultEdgeType()
- Method in class obvious.jung.data.
JungObviousTree.JungTree
getDefaultEdgeType()
- Method in class obvious.jung.utils.wrappers.
WrapToJungGraph
getDefaultEdgeType()
- Method in class obvious.jung.utils.wrappers.
WrapToJungTree
getDepth(Node)
- Method in class obvious.jung.data.
JungObviousTree
Gets depth of a node.
getDepth(Node)
- Method in class obvious.jung.data.
JungObviousTree.JungTree
Gets the depth of a node.
getDepth(Node)
- Method in class obvious.jung.utils.wrappers.
WrapToJungTree
getDest(Edge)
- Method in class obvious.jung.data.
JungObviousNetwork.JungGraph
Gets the target node for a directed edge.
getDest(Edge)
- Method in class obvious.jung.utils.wrappers.
WrapToJungGraph
getDest(Edge)
- Method in class obvious.jung.utils.wrappers.
WrapToJungTree
getEdgeCount()
- Method in class obvious.jung.data.
JungObviousNetwork.JungGraph
Gets the number of edges in the graph.
getEdgeCount(EdgeType)
- Method in class obvious.jung.data.
JungObviousNetwork.JungGraph
Gets the number of edges of a specified type.
getEdgeCount()
- Method in class obvious.jung.utils.wrappers.
WrapToJungGraph
getEdgeCount(EdgeType)
- Method in class obvious.jung.utils.wrappers.
WrapToJungGraph
getEdgeCount()
- Method in class obvious.jung.utils.wrappers.
WrapToJungTree
getEdgeCount(EdgeType)
- Method in class obvious.jung.utils.wrappers.
WrapToJungTree
getEdges()
- Method in class obvious.jung.data.
JungObviousForest
getEdges()
- Method in class obvious.jung.data.
JungObviousNetwork
Gets the edges of the graph instance.
getEdges()
- Method in class obvious.jung.data.
JungObviousNetwork.JungGraph
Gets a collection of the edges of the graph.
getEdges(EdgeType)
- Method in class obvious.jung.data.
JungObviousNetwork.JungGraph
Gets edges of a specific type.
getEdges()
- Method in class obvious.jung.utils.wrappers.
WrapToJungGraph
getEdges(EdgeType)
- Method in class obvious.jung.utils.wrappers.
WrapToJungGraph
getEdges()
- Method in class obvious.jung.utils.wrappers.
WrapToJungTree
getEdges(EdgeType)
- Method in class obvious.jung.utils.wrappers.
WrapToJungTree
getEdgeTable()
- Method in class obvious.jung.data.
JungObviousNetwork
Returns the edge table.
getEdgeTable()
- Method in class obvious.jung.data.
JungObviousNetwork.JungGraph
Returns the edge table.
getEdgeType(Edge)
- Method in class obvious.jung.data.
JungObviousForest
getEdgeType(Edge)
- Method in class obvious.jung.data.
JungObviousNetwork
Get the edge type.
getEdgeType(Edge)
- Method in class obvious.jung.data.
JungObviousNetwork.JungGraph
Gets the type of an edge.
getEdgeType(Edge)
- Method in class obvious.jung.data.
JungObviousTree.JungTree
getEdgeType(Edge)
- Method in class obvious.jung.utils.wrappers.
WrapToJungGraph
getEdgeType(Edge)
- Method in class obvious.jung.utils.wrappers.
WrapToJungTree
getEndpoints(Edge)
- Method in class obvious.jung.data.
JungObviousNetwork.JungGraph
Gets the two endpoints for a given edge.
getEndpoints(Edge)
- Method in class obvious.jung.utils.wrappers.
WrapToJungGraph
getEndpoints(Edge)
- Method in class obvious.jung.utils.wrappers.
WrapToJungTree
getHeight()
- Method in class obvious.jung.data.
JungObviousTree
Gets height of the tree.
getHeight()
- Method in class obvious.jung.data.
JungObviousTree.JungTree
Gets the height of the tree.
getHeight()
- Method in class obvious.jung.utils.wrappers.
WrapToJungTree
getIncidentCount(Edge)
- Method in class obvious.jung.utils.wrappers.
WrapToJungGraph
getIncidentCount(Edge)
- Method in class obvious.jung.utils.wrappers.
WrapToJungTree
getIncidentEdges(Node)
- Method in class obvious.jung.data.
JungObviousForest
getIncidentEdges(Node)
- Method in class obvious.jung.data.
JungObviousNetwork
Gets incident edges for a spotted node.
getIncidentEdges(Node)
- Method in class obvious.jung.data.
JungObviousNetwork.JungGraph
Gets incident edges for a specific node.
getIncidentEdges(Node)
- Method in class obvious.jung.utils.wrappers.
WrapToJungGraph
getIncidentEdges(Node)
- Method in class obvious.jung.utils.wrappers.
WrapToJungTree
getIncidentNodes(Edge)
- Method in class obvious.jung.data.
JungObviousForest
getIncidentNodes(Edge)
- Method in class obvious.jung.data.
JungObviousNetwork
Gets incident nodes for a spotted edge.
getIncidentVertices(Edge)
- Method in class obvious.jung.utils.wrappers.
WrapToJungGraph
getIncidentVertices(Edge)
- Method in class obvious.jung.utils.wrappers.
WrapToJungTree
getInEdges(Node)
- Method in class obvious.jung.data.
JungObviousForest
getInEdges(Node)
- Method in class obvious.jung.data.
JungObviousNetwork
Gets in-linking edges for a specific node.
getInEdges(Node)
- Method in class obvious.jung.data.
JungObviousNetwork.JungGraph
Gets all in-linking edges for a node of the graph.
getInEdges(Node)
- Method in class obvious.jung.utils.wrappers.
WrapToJungGraph
getInEdges(Node)
- Method in class obvious.jung.utils.wrappers.
WrapToJungTree
getJungForest()
- Method in class obvious.jung.visualization.
JungObviousVisualization
Gets a Jung Forest.
getJungGraph()
- Method in class obvious.jung.visualization.
JungObviousVisualization
Gets the corresponding JUNG network.
getJungTree()
- Method in class obvious.jung.visualization.
JungObviousVisualization
Gets a Jung Tree.
getNeighborCount(Node)
- Method in class obvious.jung.utils.wrappers.
WrapToJungGraph
getNeighborCount(Node)
- Method in class obvious.jung.utils.wrappers.
WrapToJungTree
getNeighbors(Node)
- Method in class obvious.jung.data.
JungObviousForest
getNeighbors(Node)
- Method in class obvious.jung.data.
JungObviousNetwork
Gets the neighbors node.
getNeighbors(Node)
- Method in class obvious.jung.data.
JungObviousNetwork.JungGraph
Gets the neighbors for a given node.
getNeighbors(Node)
- Method in class obvious.jung.utils.wrappers.
WrapToJungGraph
getNeighbors(Node)
- Method in class obvious.jung.utils.wrappers.
WrapToJungTree
getNetworkListeners()
- Method in class obvious.jung.data.
JungObviousNetwork
getNodes()
- Method in class obvious.jung.data.
JungObviousForest
getNodes()
- Method in class obvious.jung.data.
JungObviousNetwork
Returns a collection of all nodes of the graph.
getNodeTable()
- Method in class obvious.jung.data.
JungObviousNetwork
Returns the node table.
getNodeTable()
- Method in class obvious.jung.data.
JungObviousNetwork.JungGraph
Returns the node table.
getOpposite(Node, Edge)
- Method in class obvious.jung.data.
JungObviousForest
getOpposite(Node, Edge)
- Method in class obvious.jung.data.
JungObviousNetwork
Get the opposite node for a couple (node,edge).
getOpposite(Node, Edge)
- Method in class obvious.jung.utils.wrappers.
WrapToJungGraph
getOpposite(Node, Edge)
- Method in class obvious.jung.utils.wrappers.
WrapToJungTree
getOutEdges(Node)
- Method in class obvious.jung.data.
JungObviousForest
getOutEdges(Node)
- Method in class obvious.jung.data.
JungObviousNetwork
Gets out-linking edges for a specific node.
getOutEdges(Node)
- Method in class obvious.jung.data.
JungObviousNetwork.JungGraph
Gets all out-linking edges for a node of the graph.
getOutEdges(Node)
- Method in class obvious.jung.utils.wrappers.
WrapToJungGraph
getOutEdges(Node)
- Method in class obvious.jung.utils.wrappers.
WrapToJungTree
getParent(Node)
- Method in class obvious.jung.data.
JungObviousForest.JungForest
getParent(Node)
- Method in class obvious.jung.data.
JungObviousTree.JungTree
Gets the parent of a node.
getParent(Node)
- Method in class obvious.jung.utils.wrappers.
WrapToJungTree
getParentEdge(Node)
- Method in class obvious.jung.data.
JungObviousForest.JungForest
getParentEdge(Node)
- Method in class obvious.jung.data.
JungObviousTree
Gets the parent edge of a node.
getParentEdge(Node)
- Method in class obvious.jung.data.
JungObviousTree.JungTree
Gets the parent edge of a node.
getParentEdge(Node)
- Method in class obvious.jung.utils.wrappers.
WrapToJungTree
getParentNode(Node)
- Method in class obvious.jung.data.
JungObviousTree
Gets the parent node of a node.
getPredecessorCount(Node)
- Method in class obvious.jung.utils.wrappers.
WrapToJungGraph
getPredecessorCount(Node)
- Method in class obvious.jung.utils.wrappers.
WrapToJungTree
getPredecessors(Node)
- Method in class obvious.jung.data.
JungObviousForest
getPredecessors(Node)
- Method in class obvious.jung.data.
JungObviousNetwork
Get predecessors nodes for a specific node.
getPredecessors(Node)
- Method in class obvious.jung.data.
JungObviousNetwork.JungGraph
Gets the predecessors of a node in the graph.
getPredecessors(Node)
- Method in class obvious.jung.utils.wrappers.
WrapToJungGraph
getPredecessors(Node)
- Method in class obvious.jung.utils.wrappers.
WrapToJungTree
getRoot()
- Method in class obvious.jung.data.
JungObviousTree
Gets the root of the tree.
getRoot()
- Method in class obvious.jung.data.
JungObviousTree.JungTree
Get the root node.
getRoot()
- Method in class obvious.jung.utils.wrappers.
WrapToJungTree
getSource(Edge)
- Method in class obvious.jung.data.
JungObviousForest
getSource(Edge)
- Method in class obvious.jung.data.
JungObviousNetwork
Gets the source of a directed edge.
getSource(Edge)
- Method in class obvious.jung.data.
JungObviousNetwork.JungGraph
Gets the source node for a directed edge.
getSource(Edge)
- Method in class obvious.jung.utils.wrappers.
WrapToJungGraph
getSource(Edge)
- Method in class obvious.jung.utils.wrappers.
WrapToJungTree
getSourceColumnName()
- Method in class obvious.jung.data.
JungObviousNetwork
getSuccessorCount(Node)
- Method in class obvious.jung.utils.wrappers.
WrapToJungGraph
getSuccessorCount(Node)
- Method in class obvious.jung.utils.wrappers.
WrapToJungTree
getSuccessors(Node)
- Method in class obvious.jung.data.
JungObviousForest
getSuccessors(Node)
- Method in class obvious.jung.data.
JungObviousNetwork
Get successor nodes.
getSuccessors(Node)
- Method in class obvious.jung.data.
JungObviousNetwork.JungGraph
Gets the successors of a node in the graph.
getSuccessors(Node)
- Method in class obvious.jung.utils.wrappers.
WrapToJungGraph
getSuccessors(Node)
- Method in class obvious.jung.utils.wrappers.
WrapToJungTree
getTarget(Edge)
- Method in class obvious.jung.data.
JungObviousForest
getTarget(Edge)
- Method in class obvious.jung.data.
JungObviousNetwork
Get the target of a directed edge.
getTargetColumnName()
- Method in class obvious.jung.data.
JungObviousNetwork
getTransform()
- Method in class obvious.jung.view.
JungObviousView
getTrees()
- Method in class obvious.jung.data.
JungObviousForest
getTrees()
- Method in class obvious.jung.data.
JungObviousForest.JungForest
getTrees()
- Method in class obvious.jung.data.
JungObviousTree
Gets the forest associated to the tree.
getTrees()
- Method in class obvious.jung.data.
JungObviousTree.JungTree
Returns a forest.
getTrees()
- Method in class obvious.jung.utils.wrappers.
WrapToJungTree
getUnderlyingImpl(Class<?>)
- Method in class obvious.jung.data.
JungObviousForest
getUnderlyingImpl(Class<?>)
- Method in class obvious.jung.data.
JungObviousNetwork
Return the underlying implementation.
getUnderlyingImpl(Class<?>)
- Method in class obvious.jung.data.
JungObviousTree
getUnderlyingImpl(Class<?>)
- Method in class obvious.jung.visualization.
JungObviousVisualization
Return the underlying implementation.
getVertexCount()
- Method in class obvious.jung.data.
JungObviousNetwork.JungGraph
Gets the number of nodes in the graph.
getVertexCount()
- Method in class obvious.jung.utils.wrappers.
WrapToJungGraph
getVertexCount()
- Method in class obvious.jung.utils.wrappers.
WrapToJungTree
getVertices()
- Method in class obvious.jung.data.
JungObviousNetwork.JungGraph
Gets a collection of the nodes of the graph.
getVertices()
- Method in class obvious.jung.utils.wrappers.
WrapToJungGraph
getVertices()
- Method in class obvious.jung.utils.wrappers.
WrapToJungTree
getViewJComponent()
- Method in class obvious.jung.view.
JungObviousView
getVisualization()
- Method in class obvious.jung.view.
JungObviousView
I
inDegree(Node)
- Method in class obvious.jung.utils.wrappers.
WrapToJungGraph
inDegree(Node)
- Method in class obvious.jung.utils.wrappers.
WrapToJungTree
initAliasMap()
- Method in class obvious.jung.visualization.
JungObviousVisualization
initVisualization(Map<String, Object>)
- Method in class obvious.jung.visualization.
JungObviousVisualization
isDest(Node, Edge)
- Method in class obvious.jung.data.
JungObviousNetwork.JungGraph
Checks if a node is the target of a specific edge.
isDest(Node, Edge)
- Method in class obvious.jung.utils.wrappers.
WrapToJungGraph
isDest(Node, Edge)
- Method in class obvious.jung.utils.wrappers.
WrapToJungTree
isIncident(Node, Edge)
- Method in class obvious.jung.utils.wrappers.
WrapToJungGraph
isIncident(Node, Edge)
- Method in class obvious.jung.utils.wrappers.
WrapToJungTree
isNeighbor(Node, Node)
- Method in class obvious.jung.utils.wrappers.
WrapToJungGraph
isNeighbor(Node, Node)
- Method in class obvious.jung.utils.wrappers.
WrapToJungTree
isPredecessor(Node, Node)
- Method in class obvious.jung.utils.wrappers.
WrapToJungGraph
isPredecessor(Node, Node)
- Method in class obvious.jung.utils.wrappers.
WrapToJungTree
isSource(Node, Edge)
- Method in class obvious.jung.data.
JungObviousNetwork.JungGraph
Checks if a node is source of a specific edge.
isSource(Node, Edge)
- Method in class obvious.jung.utils.wrappers.
WrapToJungGraph
isSource(Node, Edge)
- Method in class obvious.jung.utils.wrappers.
WrapToJungTree
isSuccessor(Node, Node)
- Method in class obvious.jung.utils.wrappers.
WrapToJungGraph
isSuccessor(Node, Node)
- Method in class obvious.jung.utils.wrappers.
WrapToJungTree
J
JungDataFactory
- Class in
obvious.jung.data
This class is in an implementation of the
DataFactory
for the Obvious Jung binding.
JungDataFactory()
- Constructor for class obvious.jung.data.
JungDataFactory
JungObviousForest
- Class in
obvious.jung.data
Implementation of an Obvious
Forest
based on Jung toolkit.
JungObviousForest(Forest<Node, Edge>)
- Constructor for class obvious.jung.data.
JungObviousForest
Constructor.
JungObviousForest(Schema, Schema, String, String)
- Constructor for class obvious.jung.data.
JungObviousForest
Constructor from Obvious Schema.
JungObviousForest(Schema, Schema, String, String, String)
- Constructor for class obvious.jung.data.
JungObviousForest
Constructor from Obvious Schema.
JungObviousForest.JungForest
- Class in
obvious.jung.data
Simple implementation of Jung Forest.
JungObviousForest.JungForest(Schema, Schema, String, String, String)
- Constructor for class obvious.jung.data.
JungObviousForest.JungForest
Constructor.
JungObviousNetwork
- Class in
obvious.jung.data
Implementation of an Obvious
Network
based on Jung toolkit.
JungObviousNetwork(Graph<Node, Edge>)
- Constructor for class obvious.jung.data.
JungObviousNetwork
Constructor from Jung Graph instance.
JungObviousNetwork(Schema, Schema)
- Constructor for class obvious.jung.data.
JungObviousNetwork
Constructor from Obvious Schema.
JungObviousNetwork(Schema, Schema, String, String)
- Constructor for class obvious.jung.data.
JungObviousNetwork
Constructor from Obvious Schema.
JungObviousNetwork(Schema, Schema, String, String, String)
- Constructor for class obvious.jung.data.
JungObviousNetwork
Constructor from Obvious Schema.
JungObviousNetwork.JungGraph
- Class in
obvious.jung.data
Simple implementation of Jung AbstractGraph.
JungObviousNetwork.JungGraph(Schema, Schema, String, String)
- Constructor for class obvious.jung.data.
JungObviousNetwork.JungGraph
Constructor for Jung Graph.
JungObviousNetwork.JungGraph(Schema, Schema)
- Constructor for class obvious.jung.data.
JungObviousNetwork.JungGraph
Constructor for Jung Graph.
JungObviousNetwork.JungGraph(Schema, Schema, String, String, String)
- Constructor for class obvious.jung.data.
JungObviousNetwork.JungGraph
Constructor from Obvious Schema.
JungObviousTree
- Class in
obvious.jung.data
Implementation of an Obvious Tree based on Jung toolkit.
JungObviousTree(Tree<Node, Edge>)
- Constructor for class obvious.jung.data.
JungObviousTree
Constructor from Jung Tree instance.
JungObviousTree(Schema, Schema)
- Constructor for class obvious.jung.data.
JungObviousTree
Constructor from Obvious Schema.
JungObviousTree(Schema, Schema, String, String)
- Constructor for class obvious.jung.data.
JungObviousTree
Constructor from Obvious Schema.
JungObviousTree(Schema, Schema, String, String, String)
- Constructor for class obvious.jung.data.
JungObviousTree
Constructor from Obvious Schema.
JungObviousTree.JungTree
- Class in
obvious.jung.data
Simple implementation of Jung AbstractGraph.
JungObviousTree.JungTree(Schema, Schema, String, String)
- Constructor for class obvious.jung.data.
JungObviousTree.JungTree
Constructor for Jung Tree.
JungObviousTree.JungTree(Schema, Schema)
- Constructor for class obvious.jung.data.
JungObviousTree.JungTree
Constructor for Jung Graph.
JungObviousView
- Class in
obvious.jung.view
An implementation of JView interface for prefuse.
JungObviousView(Visualization, Predicate, String, Map<String, Object>)
- Constructor for class obvious.jung.view.
JungObviousView
Constructor.
JungObviousVisualization
- Class in
obvious.jung.visualization
This class is an implementation for the Obvious JUNG of the
Visualization interface
.
JungObviousVisualization(Data, Predicate, String, Map<String, Object>)
- Constructor for class obvious.jung.visualization.
JungObviousVisualization
Constructor.
O
obvious.jung
- package obvious.jung
Package obvious.jung TODO document the package.
obvious.jung.data
- package obvious.jung.data
Package obvious.jung.data This package contains Jung based Obvious implementation of Tree, Forest and Network Interfaces.
obvious.jung.utils.wrappers
- package obvious.jung.utils.wrappers
Package obvious.jung.utils wrappers.
obvious.jung.view
- package obvious.jung.view
Package obvious.jung.view This package contains JUNG based Obvious implementation of JView interface.
obvious.jung.visualization
- package obvious.jung.visualization
Package obvious.jung.visualization This package contains Jung based Obvious implementation of Tree and Network Interfaces.
ObviousVisualizationServer
- Class in
obvious.jung.view
Extended Jung view to support pan and zoom mechanismn in obvious.
ObviousVisualizationServer(Layout<Node, Edge>)
- Constructor for class obvious.jung.view.
ObviousVisualizationServer
Constructor.
outDegree(Node)
- Method in class obvious.jung.utils.wrappers.
WrapToJungGraph
outDegree(Node)
- Method in class obvious.jung.utils.wrappers.
WrapToJungTree
P
paint(Graphics)
- Method in class obvious.jung.view.
JungObviousView
paint(Graphics)
- Method in class obvious.jung.view.
ObviousVisualizationServer
paintComponent(Graphics)
- Method in class obvious.jung.view.
ObviousVisualizationServer
pan(float, float)
- Method in class obvious.jung.view.
JungObviousView
pickAll(Rectangle2D, Rectangle2D)
- Method in class obvious.jung.visualization.
JungObviousVisualization
putAction(String, Action)
- Method in class obvious.jung.visualization.
JungObviousVisualization
R
removeEdge(Edge)
- Method in class obvious.jung.data.
JungObviousForest
removeEdge(Edge)
- Method in class obvious.jung.data.
JungObviousNetwork.JungGraph
Removes an edge from the graph.
removeEdge(Edge)
- Method in class obvious.jung.data.
JungObviousNetwork
Removes an edge.
removeEdge(Edge)
- Method in class obvious.jung.utils.wrappers.
WrapToJungGraph
removeEdge(Edge)
- Method in class obvious.jung.utils.wrappers.
WrapToJungTree
removeListener(ViewListener)
- Method in class obvious.jung.view.
JungObviousView
removeNetworkListener(NetworkListener)
- Method in class obvious.jung.data.
JungObviousNetwork
removeNode(Node)
- Method in class obvious.jung.data.
JungObviousForest
removeNode(Node)
- Method in class obvious.jung.data.
JungObviousNetwork
Removes a node.
removeVertex(Node)
- Method in class obvious.jung.data.
JungObviousNetwork.JungGraph
Removes a node from the graph.
removeVertex(Node)
- Method in class obvious.jung.utils.wrappers.
WrapToJungGraph
removeVertex(Node)
- Method in class obvious.jung.utils.wrappers.
WrapToJungTree
S
setRenderer(Renderer)
- Method in class obvious.jung.visualization.
JungObviousVisualization
setTransform(AffineTransform)
- Method in class obvious.jung.view.
JungObviousView
setType(Edge, EdgeType)
- Method in class obvious.jung.data.
JungObviousNetwork.JungGraph
Set the convenient type in edgeTypeMap.
setType(Edge, EdgeType)
- Method in class obvious.jung.data.
JungObviousTree.JungTree
SRCNODE
- Static variable in class obvious.jung.data.
JungObviousNetwork
Name for the Source Node index in edgeSchema.
W
wrapGraph(Object)
- Method in class obvious.jung.data.
JungDataFactory
wrapTable(Object)
- Method in class obvious.jung.data.
JungDataFactory
Returns a Table instance if the underlyingTable is an instance of an implementation of Table.
WrapToJungGraph
- Class in
obvious.jung.utils.wrappers
Wrapper for obvious table to jung graph.
WrapToJungGraph(Network)
- Constructor for class obvious.jung.utils.wrappers.
WrapToJungGraph
Constructor.
WrapToJungTree
- Class in
obvious.jung.utils.wrappers
Wrapper for obvious table to jung tree.
WrapToJungTree(Tree<Node, Edge>)
- Constructor for class obvious.jung.utils.wrappers.
WrapToJungTree
Constructor.
Z
zoom(Point2D, float)
- Method in class obvious.jung.view.
JungObviousView
A
B
C
D
E
F
G
I
J
O
P
R
S
W
Z
Overview
Package
Class
Use
Tree
Deprecated
Index
Help
PREV NEXT
FRAMES
NO FRAMES
All Classes
Copyright © 2011. All Rights Reserved.


Allergy Free Pal
According to FARE, Food Allergy Research and Education, here are the 8 most common food allergies among people. Note that any food type has the potential to cause an allergice reaction. If you suspect an allergic reaction, please seek immediate emergency medical attention.


The following variables are exposed, allowing you to easily override them before compiling. Most mixins allows you to further override these values by passing them arguments.
Wrapper
Wrappers are centered containers with a max-width and fixed gutters that match the gutter widths of columns.
To support IE 6/7, ensure that the path to boxsizing.htc is set using the @grid_box-sizing-polyfill-path Less variable. Read more: https://github.com/Schepp/box-sizing-polyfill.
Less mixin
Usage
Columns
Less mixin
Usage
This is a placeholder for documenting prefix and suffix
Push and Pull mixins for source ordering
Usage
Nested columns
Since all cf-grid columns have left and right gutters you will notice undesireable offsetting when nesting columns. Normally this is removed with complex selectors or by adding classes to the first and last column per 'row'. In cf-grid the way to get around this is by wrapping your columns in a container that utilizes the .grid_nested-col-group() mixin. This mixin uses negative left and right margins to pull the columns back into alignment with parent columns.
NOTE: Working this way allows you to easily create responsive grids. You are free to control the number of columns per 'row' without having to deal with the first and last columns of each row.
NOTE: cf-grids does not use 'rows' and there is no row container. To clarify, if you have a 12 column grid and place 24 columns inside of a wrapper cf-grid columns will automaitcally stack into 2 'rows' of 12.


Follow these steps to save Tensorflow
models into the ObjectStore:
TensorFlow
graph as a JSON object.graph_definition = tf.compat.v1.train.export_meta_graph() json_graph = json_format.MessageToJson(graph_definition)
TensorFlow
weights as a JSON object.weights = self.model.run(tf.compat.v1.trainable_variables()) weights = [w.tolist() for w in weights] json_weights = json5.dumps(weights)
ObjectStore
.self.ObjectStore.Save('graph', json_graph) self.ObjectStore.Save('weights', json_weights)


"Red Carpet" allows you to create and manage your own personal list of award winning (and nominated
films), with reviews, a watched list,personal ratings, a link to purchase on Amazon and a
link to Tweet your personal review. Red Carpet is the perfect tool for your elitist movie-watching
needs!
*Recently updated with the 2017 Award Winners!
"TrainTime" is an immersive train scheduling app built with Firebase, jQuery, MomentJS and Bootstrap that features a gossamer-like responsive interface, engaging rotating background images and real locomotive sound effects. Enjoy the ride.
Restauarant Expense-Manager allows an individual user or company to track personal or business expenses. Expense-Manager is built in React with SCSS styling which permits each individual element to occupy separate files making the product easily scalable and customizable by swapping components in and out as required for a wide variety of end users.
Personal Expense Manager - React-based, scalable, customizable app for personal use. Expense Manager - React-based, scalable, customizable app for business or personal use. This iteration of the original project is customized for personal use.
Can't Decide? Let "Decision Maker" Do It For You! Written in REACT and presented in Bold and Vibrant colors, enter as many choices (options) as your paticular dilemma presents and Dilemma Decider will make that tough decision for you.
Reservationist - a React-based, scalable, customizable and fully mobile responsive app for any business or for personal use. This iteration is customized for a Restaurant Reservation System.
"Clicky-Game" is a South Park themed Smemory game built with React. To complete this project it was neccessary to break up the application's UI into components, manage component state, and respond to user input events. I elected to give this project a "South Park" theme and included animated rotating giphy's, an hypnotic background, surprising text animations for an immersive gaming experience too increase the level of difficulty of the game.
Our Shoot the Curl app will serve as a tropical trip planner geared towards surfers - covering all of the bases you need to enjoy and/or plan your next beach trip. It will be as simple as entering a desirable location and provide you with local weather data including wave heights and information on nearby, affordable bars and restaurants.
GiphTastic! is an Engaging, Cartoon-Themed Search Page Powered by the Giphy API & Ajax. Like Cats or Dogs? Enter any keyword you can think of in the search field and you'll soon be swimming in Giphy's related to your topic.
LIRI-Bot is like iPhone's SIRI, however, while SIRI is a Speech Interpretation and Recognition Interface, LIRI is a Language Interpretation and Recognition Interface. LIRI is be a command line (CLI) Node app that takes in one of four parameters and returns the relative data.
Command-Line Interface (CLI) Hangman Game built with NODE.js along with Prompt and Inquirer NPM's. Styled with Chalk and Figlet NPM's and given a Presidential Theme. Guess the Name of the POTUS! To begin, at the command prompt, type node hangman.js. Good Luck!
Bamazon is an Amazon-like CLI storefront built with mySQL, NODE.js and Inquirer NPM. Output styled with Colors and console.table NPM's. The app can take in orders from customers, calculate sales price and deplete stock from the store's inventory. Schema.sql and Seed.sql files have been included for database creation ranging in size from 15 to 100+ whimsical products.


We have our midterm exams in January, about a week after winter break. We'll take first and second period exams monday, second and third tuesday, and so on. On days we have exams, we have I think 2 hours for each exam, so we get out at 12ish. I hate exams, and I hadn't studied as much as I should have, so I decided some Adderall would help. My first exam started at 7:45, so before I left the house at 7ish I put all the little balls from one 30 mg capsule under my tongue, along with drinking my usual cup of black coffee.
By the time my Physics exam started, I was actually excited about it. I was running around and talking to everyone, and when I sat down, I was jiggling my leg extrememly fast, not something unusual for me to do even sober, but this time it felt like I wanted to shake my whole body like that, just because I had so much energy.
I started my exam, and the mathmatical processes I had to go through to get some answers were very enjoyable.  I loved doing these problems, figuring out acceleration and momentum and such. I felt like I knew exactly what I was doing, and would excitedly scribble the equations down. It was like a really really fun puzzle. Math on Adderall is my favorite thing ever.
My next exam was Psychology, but I'd written a paper so I had the two hours free. I studied for my english exam by looking up all the literary terms in the dictionary, and this too was really fun, mainly because it was something to do, and so like routine, I guess. Normally I hate routines, but with adderall, it all just made such sense that I loved it. Anything that's logical is great and fun on adderall.
I snorted another 30mg the next morning for my english exam, and when I was writing the essays, the words just keep pouring out of me. I knew exactly what I was going to say, it felt like I was telling a story about the psychological meanings of The Tempest. I was so excited about writing it, and I kept getting these new great ideas that felt like revolations-no one had ever thought of that theory before.
My Latin exam was like a game. We had to match nouns and adjectives by their endings, and it was a puzzle to figure out which was conjugated the same. All the scantrons were really fun, just filling in the little bubbles one after another.
I took Adderall every day that week for my exams, 30 mg for three days and then 50 mg for two. Every exam was just like a big puzzle or a game that I had to figure out. The only bad part was that I had to take benadryl at night to fall asleep. And I ate like an orange all week. Although I generally prefer painkillers and downers in general, I love Adderall because I'm just so happy and productive, and everything, whether it's cleaning my room or taking an exam, is really fun.
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.


The temporal aggregation is presented in two different formats: 6-hourly intervals and daily intervals. In addition, an aggregation based on a 5-day moving average (Alert) is also available.
The 6-hourly intervals are centred on the main synoptic hours (00, 06, 12 and 18 UTC) as
described in
|
6-hourly interval |
Observation time (t) |
|
00 |
21 UTC ≤ t < 03 UTC |
|
06 |
03 UTC ≤ t < 09 UTC |
|
12 |
09 UTC ≤ t < 15 UTC |
|
18 |
15 UTC ≤ t < 21 UTC |
The daily aggregation refers to the union of the four 6-hourly intervals as defined in
4.3. Alert
The alert maps represent a 5-day moving average, therefore rely on daily values for a 5
day period as described in
|
Definition |
5-day moving average of daily averages |
|
Calculation |
For each observed variable, the average of the valid daily values for that day and the four of previous days. |
|
Valid data |
Data not flagged as NULL |
|
Minimum required valid data |
It is calculated if at least 1 valid daily value is available over the 5-day period. |


See by categories
Next sale on 16 March 2016
The best performer till date
Dell presented Linux based Developer laptops
The best budget smartphone that can come in two categories 10K(16gb/2GB RAM) and 12K(32gb/3GB RAM)
Our Rating
The best budget smartphone that can come in metal body and is the best alternative for Redmi Note 3
This is one of the best budget laptop you can get under ₹26K


Testing¶
The pylauncher.py source file has a large number of unittests
that are designed for the nosetests framework: all routines and classes
starting with test
are only for testing purposes.
-
class
pylauncher3.
ListCommandlineGenerator
(**kwargs)[source]¶ A generator from an explicit list of commandlines.
cores is 1 by default, other constants allowed.
-
class
pylauncher3.
CountedCommandGenerator
(**kwargs)[source]¶ This class is only for the unit tests, it produces a string of `echo 0’, `echo 1’ et cetera commands.
- Parameters
nmax – (keyword, default=-1) maximum number of commands to generate, negative for no maximum
command – (keyword, default==``echo``) the command that will do the counting; sometimes it’s a good idea to replace this with
/bin/true
catch – (keyword, default None) file where to catch output
-
class
pylauncher3.
SleepCommandGenerator
(**kwargs)[source]¶ Generator of commandlines `echo 0 ; sleep trand’, `echo 1 ; sleep trand’ where the sleep is a random amount.
- Parameters
tmax – (keyword, default 5) maximum sleep time
tmin – (keyword, default 1) minimum sleep time
barrier – (keyword, default 0) if >0, insert a barrier statement every that many lines
-
class
pylauncher3.
RandomSleepTask
(**kwargs)[source]¶ Make a task that sleeps for a random amount of time. This is for use in many many unit tests.
- Parameters
taskid – unique identifier (keyword, required)
t – maximum running time (keyword, optional; default=10)
tmin – minimum running time (keyword, optional; default=1)
completion – Completion object (keyword, optional; if you leave this unspecified, the next two parameters become relevant
stampdir – name of the directory where to leave the stamp file (optional, default=current dir)
stamproot – filename stemp for the stamp file (optional, default=”sleepexpire”)
-
class
pylauncher3.
OneNodePool
(node, **kwargs)[source]¶ This class is mostly for testing: it allows for a node to function as a host pool so that one can start a task on it.


Two-way data binding
Most frameworks have two-way data binding. With two-way data binding, you can:
- Update the HTML inputs, which will update your JavaScript object
- Update the JavaScript object, which will update every HTML attribute bound to it
Neat, huh?


Last updated: 2018-05-04
Code version: fc4400b
Formulate meaningfull hypotheses based on theory
Bayes factor:
Balance fit with complexity of 2 hypothesis
Bayes factor: the support of the data for the informative hypothesis, is x times larger than the support for the uninformative hypothesis
Fit: scale 0 to 1 (1 is perfect) Complexity: e.g. number of possible orderings of means (mu1 > mu2 > mu3 is 1 / 6 possible permutations)
Possible set of hypothesis
Interpretation is in terms of odds (can be turned into conditional hypothesis probabilities, conditional on the data)
Possible to compute:
BF informative vs uninformative BF informative vs complementing
Bayes factor
Drawbacks
Posterior model probability
Don’t develop model and perform hypothesis testing on the same data
Bayesian model update: study synthesis
Can combine PMPs from different studies
Based on multi-normal distribution approximations of the posterior distribution
Prior distribution based on (part of) the data, should be centered at 0, uninformative, and of the same shape as the posterior distribution
Complexity of hypothesis is the proportion of the prior distribution in agreement with the hypothesis
Fit is proportion of posterio distribution in agreement with the hypothesis
Bayesian model averaging / ensembling; (selecting subsets of predictors)
Utrecht Applied Data Science
sessionInfo()
R version 3.3.2 (2016-10-31)
Platform: x86_64-apple-darwin13.4.0 (64-bit)
Running under: macOS Sierra 10.12.6
locale:
[1] en_US.UTF-8/en_US.UTF-8/en_US.UTF-8/C/en_US.UTF-8/en_US.UTF-8
attached base packages:
[1] stats graphics grDevices utils datasets methods base
loaded via a namespace (and not attached):
[1] backports_1.1.0 magrittr_1.5 rprojroot_1.2 tools_3.3.2
[5] htmltools_0.3.6 yaml_2.1.16 Rcpp_0.12.14 stringi_1.1.6
[9] rmarkdown_1.8 knitr_1.18 git2r_0.20.0 stringr_1.2.0
[13] digest_0.6.13 evaluate_0.10.1
This R Markdown site was created with workflowr