--- layout: archive title: Zulip Chat Archive permalink: /stream/113488-general/topic/Lean.20server.20mode.20in.20VS.20Code.html ---
So a strange thing has just started happening to me - whenever I open a window in VS Code with an instance of lean server, it arbitrarily chooses between a mode that displays all messages at the same time + moving the cursor doesn't do anything, as everything is displayed and between the "interactive" mode, where cursor determines what messages and / or proof state is displayed. Anybody has encountered this - is there a way to force default? Am I going completely insane? (don't answer the latter).
These two buttons switch between the two modes Screenshot-2019-01-23-at-08.14.24.png
Thank you, I must have been somehow accidentally pressing their what appears to be an accidentally-unpressable shortcut.
{% endraw %}Last updated: Apr 24 2020 at 19:02 UTC


@* * Copyright 2023 HM Revenue & Customs * * Licensed under the Apache License, Version 2.0 (the "License"); * you may not use this file except in compliance with the License. * You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. *@ @()(implicit messages: UniformMessages[Html])
@messages("wrong-creds.p1")
@messages("wrong-creds.p2")
@messages("wrong-creds.p3")


The future of society: why a lot of big organisations will cease to exist
Introduction
This post is an attempt to predict what the following decades will look like. I wrote a more technical post about this 3 years ago, which still makes sense far as I’m concerned.
Somehow, my understanding about how this applies to non-software things has evolved, and after trying to make my point on twitter, I decided to elaborate in this blog post about my assumptions on the future.
Disclaimer
I’m only slightly aware about “the how” of the technology that could drive these things. My assumptions are purely based on my observations about how people interact with devices and technology at this very moment.
First things first: what happened last decade? #KnowledgeEconomy
I would definitely say the past decade has been all about knowledge economy, i.e. the democratization of knowledge.
Knowledge used to be something people used to consider exclusive. In the world of today, people no longer consider knowledge something exclusive, as almost everyone can search information about almost anything on the internet. One could say, that it is no longer valuable what people know, but what makes the difference is how people apply and combine that knowledge.
As knowledge is becoming a commodity, people are starting to share knowledge, others improve it and publish their conclusions. One could say that the speed by which we learn is growing exponentially, just because we can share it and get feedback in a way people from a few decades ago could not even have imagined.
Let’s take a look at a picture of one of the most famous science conferences (i.e. the fifth Solvay conference in Brussels-Belgium) that ever happened, and think about how these people communicated:
- they sent letters to each other
- they met at conferences
- they flocked together in educational institutions
- …
Think about how much effort these people had to go through, just to reason about their knowledge with other people, and about how hard it was for an outsider to get in to these subjects, and how constrained your knowledge base was.
Think about what they could have achieved, if only they would have been able to communicate the way we can today. Today we have almost limitless access to knowledge, and the speed by which we can reason about and verify assumptions is mind-boggling.
But, that is also the problem of the current society: people still haven’t adapted to all this knowledge being available, so they don’t know how to cope with it.
I would say, that in general, you would have to be aware that knowledge has become a commodity, and you should treat is as such.
The next decades: power to the people
Taking the previous part of this post, I would think that this decade will be all about learning to cope with knowledge as a commodity, but I as a direct consequence of this, I see one other big thing happening: the “consumerization” of things.
It is my personal opinion, that people are starting to embrace “knowledge as a commodity”, and start to realize they no longer need all this overhead of a “classical enterprise” to make a difference. Things like Kickstarter give the power to innovate to the people. As knowledge is freely available, a lot of things will no longer require all the overhead of a classical enterprise.
Let’s say that f.e. within a few decades, we would be able to 3D-print most of the materials at a reasonable size and a reasonable cost. One could say “wow I like that thing, I’ll download the template and let my 3D-printer print it.”. You no longer require an organisation to do this. People would be able to publish a template (or sell it), and others would be able to build it without to much effort.
Think about this: in the future not even knowledge will be a commodity, but also the ability to produce something from scratch would be a non-event for a person.
This would of course imply that the need for middle-men, or even the classical big organisations as we know them today will simply cease to exist, just because people can do stuff themselves.
This is also one of the reasons I consider “anti-fragile” by Taleb to be such a ground-breaking book. I think his vision will align with the future of society.
On to the tech part - Conway’s law
Respecting Conway’s law - which is quite popular lately -, the need for one big service/website/server/… would cease to exist, but every single person would have their own server, or even better multiple servers. Think about this for a while: why would you need Facebook, if you would be able to share your pictures and messages directly with your relatives and friends, just by having some kind of a digital handshake that somehow allows access to things.
Why would we need to have one big organisation that indexes the whole of internet (i.e. Google etc), if we would be able to access all this information directly on the devices they were published on?
People have been predicting this for a while, and it is known as “The internet of things”, or IoT for short.
This will happen, the question is just where, when and how.
It is my personal opinion that the next decade’s teenagers will actually start building the IoT, based on existing protocols (i.e. https, combined with a rangescan, or some multicast extension) first, and once that we have this technology, people will look for the best fit.
There are a lot of people who want to do it the other way, i.e. let’s build a protocol that supports the IoT, and people will start using it. However, I am under the assumption that the technology problem will only need to be solved when it becomes a problem, and not sooner. As long as people are not using their devices as micro-servers directly very intensively, they will opt for a good-enough protocol and use a work-around, until they finally realize then need something different then the existing http thing everybody is using right now.
As better solutions usually emerge when the experience in the problem-space grows, I would opt to think designing an IoT protocol right now might make too much wrong assumptions…
Update
Just to clarify, I am not saying that individuals and corporations should seize their attempt to build an IoT, or will be unsuccessful with it. So by all means, if I insulted anyone with this blog post, please accept my apologies.
I just think the tech implementation will not be the main driver behind this revolution. However, once people are aware that the current tech stack is not suited for IoT, a technology will emerge, but - as happened before - it is not necessarily the best technique that will win the battle.
Conclusion
So, there you have it, another one of my brain-dumps (took about an hour, and is way longer than I initially intended). I truly think this is the way the world will evolve, and while it might be a blunt prediction, I somehow hope that you can understand and follow my path of reasoning about why I think the next big thing will be “consumerization”…
As always, I am very interested about your opinions, good or bad, so please share them!!


All of this reflection is helping the fog to clear before Bootcamp...
I have learned how I need to do something myself to really learn it. At school I thought I was quite an aural learner, and I still am - I prefer to watch and hear than to read, and if I have to read I have a tendency to do it aloud... But I hadn't noticed how much actually doing the thing helps it to fall into place for me. If I look something up in advance I will have completely forgotten how it works when I get to it, but if I practise at the time then I usually remember, or just need to brush up on the details, rather than having to figure out what is happening all over again.
I hadn't noticed the extent to which I had put value on being able to do something without looking it up - at school it was always praised if you could do a task without looking at your notes, and in exams you just had to know as much as possible. However, on this bootcamp and for the rest of my career, looking things up is how I'll have to work. I wasn't prepared for how uncomfortable that would make me, nor how much more confident I feel when I make a function on my own vs. this shallow win feeling I get when I have look it up. I'm getting better with it but I hadn't realised the effect it would have on me.
I'm also learning how busy my mind is - I find it really hard to simply observe myself, I'm constantly analysing how I feel and then wanting to change those things and then judging the fact that I'm analysing and changing rather than just observing... It's challenging for me just to be, but I really want to get better at it because I see a lot of value the sense of groundedness that comes with it.
Knowing your values is important in life because they define both our thoughts and actions. They help you to make (sometimes difficult) decisions and help you find your purpose. Having empathy is crucial for working in teams, both in learning and in work (as well as in life). If you can't relate to what another person is feeling, struggling with or just needs to know, it's pretty much impossible to work together effectively. And you need self-awareness in order to grow - recognising your weaknesses and mistakes means you can be aware of them and then actively work on them, so that you are always developing and improving.
I think the Listening and Looping challenges surprised me the most - I liked how they were a different take on the attention practice of meditation, and it was really eye opening to feel how strange it was to do. Though I sometimes notice points in conversation where I or the other person are thinking more about what we're going to say next than actually listening, I wasn't prepared for how weird it would feel not to respond. It was really refreshing and made me realise how much more engaging conversation can be when you are fully present for it.
I found reflecting on my values and identity the most difficult, as it was the main area of core that I hadn't spent much time thinking about before. I struggled because I feel that there are a lot of things that really matter to me and that I strive towards, and trying to pick just a few to define me was hard. That was when I realised that growth was a really big value of mine, and encompasses my want to improve in the other areas that matter to me (equality and advocacy, accountability, sustainability, being honest and authentic etc.)
The tech industry needs well-rounded people in the workforce, who can not only code but also interact well with team members and clients. Core teaches us some of the human skills that will make us better at those interactions, so we are better equipped to get jobs and have successful careers. Programming is also the kind of job where you can go down a rabbithole of working and working away at a huge project, and you could always do a little more before you leave for the night. Learning to be self-aware and grounded can prevent you from getting lost in that, and help you to step back from the feelings of imposter syndrome.
I think the time spent studying Core during Foundations has been worth it - even the things that I did know are good to be reminded of regularly, like the importance of having a growth mindset. I know that both Bootcamp and probably my entire programming career will be challenging, and I am glad that Core has helped me find a self-aware and growth-focussed headspace before I get into it. I think if we had only been practising programming, I wouldn't feel as prepared for the challenges of Bootcamp, but with having the Core curriculum I feel both that I am in a good state of mind and that I know EDA cares about us as whole people, which is reassuring to know for if there are difficulties in any area of our lives during Bootcamp.
I want to use the skills I gain at EDA to get into the tech industry - I feel that once I know enough to get a foot in the door, I am hardworking and curious enough to learn the rest along the way. I think EDA will equip me with those tools to continue to learn as well as how to interact well with people throughout my career. I know that I love constant change, so I'm keen to explore all the different facets of the industry. Other than that, I know I want to work on projects that make a difference (building sustainable technology, making programmes that help people with disabilities etc.) and I want to work in a positive and inclusive environment. And hopefully end up somewhere off the coast of Italy... or in Switzerland...
When new ideas build on previous ones, it's easy to get totally lost if you didn't get that first idea - especially in a fast paced environment like Bootcamp - so I think that being a fast learner and having a brain that naturally loves logic will be a big strength of mine. I think my Sprint 2 analysis still stands - that being a perfectionist means I produce a high standard of work, but can get too caught up in the details. I've been trying - especially in these Sprint 5 game challenges - to just get the code working, and then go back and refactor afterwards. Though sometimes I will find myself trying to do it perfectly the first time, I'm getting better at not worrying about it until I go back later. However, I've been ahead of schedule throughout Foundations, so I've always had plently of time to go back and make those improvements. I think it could be a challenge for me, with the faster pace of Bootcamp, to have to leave projects in their 'first attempt' state.
I think one of my biggest challenges will be that I'm moving away from home for the first time, so I'm going to have to figure out how to be an adult (hah) at the same time. While I'm excited about it, I know it's going to be a lot of change to get used to at one time, and so I'll have to allow myself space and time for that. I think it could also be strange for me to go from learning in an all girls school to working with a predominantly male cohort, as well as working with people of all different ages.
I am able to communicate my ideas really articulately and concisely, but often if I'm excited or uncomfortable I can talk a lot without explaining much. Once someone looks at me like what on Earth are you saying I'll snap out of it and actually explain, but I want to get better at speaking mindfully, especially in circumstances like pair programming where clear communication is really important. I still also want to work on not taking on too much of the workload in a group situation - I can struggle to delegate because of being a perfectionist, but I know it's super important and that the only thing taking on too much will do is cause me heaps of stress... like this creepy ass looming hand in the fog... let's not my dude.
I will make sure to ask questions of the teachers and facilitators as needed, and keep track of any issues I have for the tech-ins to get the most out of those sessions. I will set clear goals for myself each day in order to stay on track, and make sure I spend time in the evenings or weekends going over anything I didn't understand so that I don't fall behind in future classes. I also expect myself to regularly go to the gym - coding is not exactly an active task and I don't cope very well with not moving, so in order to learn well and work well with others I will need to consistently get some form of exercise in, preferably in the mornings.


The ‘I’m At Capacity Right Now’ Meme Perfectly Takes The Piss Out Of Self-Care
by Michelle RennexWe’ve all been the person who unloads their problems onto a friend, and the person who helps with their friends problems.
Related
Most people would say that’s how friendship works — an equal give and take and the general concept of being there when someone you care about needs you. But one woman has come under fire for sharing her take on emotional labour and, in particular, her cold rejection template to Twitter.
Melissa A. Fabello is a social justice advocate who recently started a Twitter thread about the importance of “asking for consent for emotional labour“. After a friend text asking if she had the “emotional/mental capacity for me to vent”, Melissa made a 17-tweet thread all about the topic.
Melissa explained that while she has some friends she would absolutely make time for, she appreciates that her friend asked. This is because the text “asks permission to vent, rather than unloading without warning” and “acknowledges that I have limited time and emotional availability”.
The Dreaded Template And Memes
The ‘I’m At Capacity Right Now’ meme came from the last tweet in the emotional labour thread. To finish her thoughts on the topic, Melissa uploaded a super cold and robotic template for “how you can respond to someone if you don’t have the space to support them”.
“Hey! I’m so glad you reached out. I’m actually at capacity/helping someone else who’s in crisis/dealing with some personal stuff right now, and I don’t think I can hold the appropriate space for you,” the template reads. “Could we connect [later date or time] instead/Do you have someone else you can reach out to?”
Beyond the emotionless wording of the message, people absolutely despised the idea of using a fill-in-the-blank template on your friends in need. The message, which quite honesty sounds like an out-of-office responder over Christmas, just lacks empathy.
While Melissa was criticised for her take on emotional labour, this is the internet. So the obvious natural response was to take Melissa’s template for how to support a friend and turn it into one giant meme.
In conclusion, just be there for your friends when they need you to be.


Github
YouTube API
Words API
Translate API
Enter any word from the English language below:
🔎 Search
Search
Translate
English
Arabic
Chinese
French
German
Hindi
Irish
Italian
Japanese
Korean
Polish
Portuguese
Russian
Spanish
Turkish
Vietnamese


A new configuration is created from an application version number. Confman display
a form with the last known values (last version tracking for the actual application
version number). You can change every parameters values but you won't be able to change
them after the saving (expect for SNAPSHOT version). We choose this policy because all the changes have to
be followed.


I wanted to try something new, copy-pasted something I wrote in a discord chat. I don’t feel like spending more time on this but still want to push it raw. Forgive me.
It’s so easy being cynical and jaded in life. For some reason people value it as “wisdom” or “lived experience”. I want to be a fool and live, or at least try to stay myself. But many would call that “naive” and “the inexperience of the youth.” More or less i would summarize it as people having this in my mind wrong notion. That there is a single “good” way to live or that there is one “great wisdom.”x
I can say in all pathos and good voice something like, “reach for the infinite, for the god-like, don’t bother with day-to-day—it’s all fleeting and temporary—spend your time and life going after the high values, morals, because that is eternal.”
In the same breadth, “don’t bother with whatever infinite means or eternal, we don’t know what it is and probably never will—we should live day-to-day—experience what’s given to us, care for our loved ones, experience life and emotions as messy as they get—because that’s all we have in this life.”
i can even say, “why bother choosing one or the other? the answer is not there, the true wisdom is finding the eternal, the beauty of the infinity in your day-to-day—find something to strive for, your true self, the high values in everyday things—it’s not about one or the other, it’s about finding one in another.”
You can see how they all sound wise and stuff, right? But are completely orthogonal to each other. I can keep going and making up many different mutually-exclusive variations, which all sound “wise” and “true.”. There is no “wisdom” or “total truth” or “real life.” Everything is whatever you make it to be and deceive yourself enough to believe in.
“Why care about the contrast of infinite and day-to-day? the best life comes from not thinking, but rather feeling and following the subtle tunes of your soul, of who you are—all this academic knowledge taints us and steers us in some pre-conceived notions of one or the other—live your life as a fool, experience it anew, sail on a gran adventure of carving out your own path in life—your very own modus operandi.”
I’ll stop with examples here lol, we can go on for a very long time.
My friend read this article, thinking that multiple people were conversing, so I was asked to add some delimiters or flags of who said what. Well, I can’t do that. All of the above was just me. Related,


Contact
Resume
https://www.linkedin.com/in/khaibnguyen
Feel free to contact me for whatever reason (besides spam, of course) at khai.b.nguyen[at]gmail.com
About Me
Salutations and welcome to my portfolio! I'm Khai Nguyen and I'm a game developer. I'm currently a 4th year Computer Game Science major at UC Irvine and pursuing a career in game design. My passion for video game development stems from two things:
- a desire to create games that will have a profound impact on lives and
- to transcend video games as an art form
One of my interests is in Human-Computer Interaction. I hope to learn from HCI methodologies in order to better inform the design of my video games. I'm very curious in what makes people "tick": to find out what drives them, what they hate, what they love. Mastery of such understanding is something that I strive for as a game developer and designer.
I often find myself more of an Informatics person rather than one of Computer Science. For that, I've taken an interest in web development and this website is my first step into that world. Complementary to web development, I'm also interested in UI/UX research. Again, it is my desire to understand others better in order to build something compelling and appealing to individuals. Nothing would satisfy me more than others enjoying something I helped create.
Besides web development technologies, I plan on learning more of Unreal Engine 4. I'm fairly comfortable with working in Unity but I'd like to experience a more complex engine (with C++). Adobe Photoshop, Illustrator, and After Effects are fairly essential to UI/UX and game development so those are also on my list of things to learn.
Background
I was born in Hanoi, Vietnam but raised in Rosemead and San Gabriel, CA for most of my life. When I was a child, I was happy to have three things: TV, LEGO, and video games. With TV, I loved escaping reality and immersing myself in the cartoon worlds of Cartoon Network and Nickelodeon (among others); The Busy World of Richard Scarry was a favorite of mine. With LEGO, I was constantly wondering about the next thing I wanted to build and the imginary world I wanted to play in; I especially loved building robots and futuristic weapons. With video games, it was both the immersion and challenge that they offered that I loved; Super Mario World and A Legend of Zelda: A Link to the Past were quite a challenge to me, actually (I was never able to beat them then). But their worlds kept me engaged and playing (and trying). These forms of entertainment had a profound effect on me - I knew I wanted to create/build something when I grew up.
In high school, I found myself interested in computer science. I tried a programming class (AP Computer Science A in Java) and passed the AP test. As happy as I was with passing, I felt programming was too difficult and switched to engineering instead. I went to Pasadena City College to study mechanical engineering (later switching to electrical) and transfer to a 4-year college. To finish my transfer requirements, I realized I had to finish a C++ class (that meant programming)! Coming from Java, C++ wasn't so bad although pointers were tricky. I managed to pass the class anyway and had a somewhat renewed interest and appreciation for programming.
UC Irvine was one of the four schools I had applied to for electrical engineering. For my backup major, I felt strongly enough about going back to computer science that I chose "computer game science" as my major. Upon entering, I discovered the Video Game Development Club; I have been developing games ever since.
Other Tidbits
My other hobbies and interests include:
- Cooking
- Playing video games and board/card games (naturally)
- Watching and dissecting films
- Perusing technology blogs/forums
- Building and fixing computers
- Star Wars
List of favorites
- Games (of all time)
- The Legend of Zelda: Ocarina of Time
- Star Wars: Knights of the Old Republic
- Music
- U2
- Jazz
- Electronic
- Ambient music
- Video game soundtracks (Jeremy Soule is a particular favorite)
- Books
- A Game of Thrones
- TV Shows
- The Wire
- Game of Thrones
- Spartacus
- Films
- The Departed


"From the Lab..."
Angular
- "declarative"
- data binding (aka magic)
- unit and e2e testing
- future aligned
Search: Angular vs Backbone vs Dojo
"Enterprise"
Awesome for...
"declarative"?
wire things up via markup
Angular Directives
Create new 'html elements'
becomes...
Directives
"hide complexity"
From the person writing the markup
Enable You To
Roll Your Own
Example Repo
https://github.com/Esri/angular-esri-map
Coming soon!


Implementation of the OutputStreamsUpdaterStragedy which extracts point clouds using the buffers provided method calls. The processed point clouds are provided without colored. Listeners can registered on cloudsUpdated and cloudUpdated. CloudsUpdated provides the HDFace and RawFaceDepth point clouds. cloudUpdated[0]: HDFace cloudUpdated[1]: RawFaceDepth cloudUpdated[2]: FullRawpDeth.
More...
#include <UncoloredOutputStreamsUpdater.h>
|
|
| UncoloredOutputStreamsUpdater () |
| | Default constructor.
|
| |
|
| ~UncoloredOutputStreamsUpdater () |
| | Destructor.
|
| |
| HRESULT | updateOutputStreams (IFaceModel *faceModel, IFaceAlignment *faceAlignment, int bufferSize, CameraSpacePoint *detectedHDFacePointsCamSpace, ColorSpacePoint *detectedHDFacePointsColorSpace) |
| | Updates and processes the output streams. More...
|
| |
| void | startFaceCollection (RGBQUAD *colorBuffer, UINT16 *depthBuffer) |
| | Starts collecting point clouds of all tracked users. More...
|
| |
|
void | stopFaceCollection () |
| | Stops the collection of the faces, runs the conversion of the entire depth buffer if neccesary and calls the signals.
|
| |
|
| OutputStreamsUpdaterStragedy () |
| | Default constructor.
|
| |
|
| ~OutputStreamsUpdaterStragedy () |
| | Destructor.
|
| |
| bool | isValidCamSpacePoint (CameraSpacePoint camSpacePoint) |
| | Query if 'camSpacePoint' is valid camera space point. More...
|
| |
| bool | isValidDepthPoint (DepthSpacePoint depthPoint) |
| | Query if 'depthPoint' is valid depth point. Coordinates of invalid points are outside the depth frame size. More...
|
| |
| virtual void | initialize (ICoordinateMapper *m_pCoordinateMapper, int depthWidth, int depthHeight, int colorWidth, int colorHeight) |
| | Initializes the OutputStreamUpdaterStragedy with the frame sizes. More...
|
| |
|
|
boost::signals2::signal< void(std::vector< pcl::PointCloud< pcl::PointXYZ >::Ptr >)> | cloudsUpdated |
| | The clouds updated.
|
| |
|
boost::signals2::signal< void(pcl::PointCloud< pcl::PointXYZ >::Ptr cloud)> | cloudUpdated [3] |
| | The clouds updated: cloudUpdated[0]: HDFace; cloudUpdated[1]: RawFaceDepth; cloudUpdated[2]: FullRawpDeth.
|
| |
Implementation of the OutputStreamsUpdaterStragedy which extracts point clouds using the buffers provided method calls. The processed point clouds are provided without colored. Listeners can registered on cloudsUpdated and cloudUpdated. CloudsUpdated provides the HDFace and RawFaceDepth point clouds. cloudUpdated[0]: HDFace cloudUpdated[1]: RawFaceDepth cloudUpdated[2]: FullRawpDeth.
| void UncoloredOutputStreamsUpdater::startFaceCollection |
( |
RGBQUAD * |
colorBuffer, |
|
|
UINT16 * |
depthBuffer |
|
) |
| |
|
virtual |
| HRESULT UncoloredOutputStreamsUpdater::updateOutputStreams |
( |
IFaceModel * |
faceModel, |
|
|
IFaceAlignment * |
faceAlignment, |
|
|
int |
bufferSize, |
|
|
CameraSpacePoint * |
detectedHDFacePointsCamSpace, |
|
|
ColorSpacePoint * |
detectedHDFacePointsColorSpace |
|
) |
| |
|
virtual |
Updates and processes the output streams.
- Parameters
-
| [in,out] | faceModel | the face model of the current face |
| [in,out] | faceAlignment | the face alignment of the current face |
| bufferSize | Size of the detectedHDFacePointsCamSpace buffer. |
| [in,out] | detectedHDFacePointsCamSpace | The detected HD face points in camera space camera space. |
| [in,out] | detectedHDFacePointsColorSpace | The detected HD face points in color space color space. |
- Returns
- A hResult.
Implements OutputStreamsUpdaterStragedy.
The documentation for this class was generated from the following files:
- C:/Users/Martin/Documents/idp-kinecthdfacegrabber/UncoloredOutputStreamsUpdater.h
- C:/Users/Martin/Documents/idp-kinecthdfacegrabber/UncoloredOutputStreamsUpdater.cpp


YouTube Caption Audit
API Key
Get an API key
Channel Preset
Channel ID
Find your channel ID
Check videos
Ready.
Sort results by clicking the column headings.
Title
Publish Date
Views


PhD scholarship
Line by line Deep Learning algorithm for detection of artifacts in uncalibrated multispectral satellite images
The aim of artifact detection satellite image is to detect and locate pixels or set of pixels that are decorrelated from the statistically representative background. For instance, in forestry applications, infected trees are considered as artifacts, as well as water pollution in coastal clear waters. Contrarily to the target detection problem where the spectra of the target must be known, artifact detection methods generally assume no prior information about the spectra of the pixels, in both nominal and abnormal cases. State-of-the-art algorithms use reference data either from a local neighborhood around the pixel/spectrum to be tested, either using all or part of the HSI data possibly at a different time instant. The most popular among these algorithms are the Reed-Xiaoli Detector (RXD) [1] and its many variations. More recently algorithms using deep convolutional neural networks have proved their effectiveness for this task [2].
All these approaches rely on pairs of learning and testing spectra sets which are performed on images processed on ground and geometrically, spectrally and radiometrically calibrated. Moreover, these algorithms consist of a learning step and a testing step on two set of patches acquired at different time instant and so don’t allow a fully (learning and testing) line by line processing in order to process a continuous flow of data. The objectives of this PhD will be to develop an artifact detection algorithm, computationally efficient and compatible with data as acquired by the pushbroom sensor i.e. line by line and before radiometrically, spectral and geometric corrections and calibrations, which takes advantage of recent advances in machine learning.
We propose to develop anomaly line by line artifact detection algorithm which processes sensor output data flow compatible with the pushbroom acquisition: a new line of ground swath is processed at each iteration of the algorithm in order to decide, and to localize if needed, whether one or more artifacts are present. The decision will take into account spatial and spectral information acquired across the past scanned line swaths and the new line swath. Note that a similar approach was recently proposed for online deconvolution of hyperspectral images acquired using a fixed industrial imaging system above a conveyor belt in [3].
We propose to address the lack of data calibration using a learning algorithm which gives more weight to measurements acquired near the decision zone. The first approach we will investigate is an adaptive strategy where two classifiers are learned simultaneously using two distinct learning rates: the rationale behind this idea is that the classifier with the larger learning rate gives “more importance” to recent samples than the other classifier, so the distance between the two classifiers outputs should increase in case of a spatially localized change. The principle of comparing two classifiers outputs with different learning rates is well-known in the field of time series processing, see for example [4]. It has recently been proposed in [5] for change point detection in time series data in conjunction with more recent machine learning techniques. In [6] this strategy is applied to the problem of change point detection in signals on graphs. To our knowledge, these approaches have not yet been applied for detecting artifacts in multispectral images acquired by pushbroom systems. A particular effort will be made to develop appropriate classifiers that take into account information related to the spatial and spectral coherence of an artifact. In this context, kernel-based models and convolutional neural network models are candidates that will be studied.
To our knowledge, these approaches have not yet been applied for detecting artifacts in multispectral images acquired by pushbroom systems. A particular effort will be made to develop appropriate classifiers that take into account information related to the spatial and spectral coherence of an artifact. In this context, kernel-based models and convolutional neural network models are candidates that will be studied.
An important part of the thesis will consist of evaluating the effect of processing uncalibrated data. For this purpose, Thales Alenia Space will provide for the same scene both: raw camera data sets and fully calibrated datasets. These datasets will make it possible to quantify the performance degradation associated with processing of uncalibrated data. The dataset foreseen are of 2 types : Sentinel 3/OLCI data acquired during the In Orbit Commissioning Review, and simulated CHIME data performed for the CHIME phase A/B1 per-development study. ESA has already agreed to the use of these data for a research purpose.
- [1] Adaptive multiple-band CFAR detection of an optical pattern with unknown spectral distribution. Reed, I.S.; Yu, X., IEEE Trans. Acoust. Speech Signal Process. 1990,38, 1760–1770.
- [2] Unsupervised Learning of Robust Representations for Change Detection on Sentinel-2 Earth Observation Images. Aubrun, M.; Troya-Galvis, A.; Albughdadi, M. ; Hugues, R. and Spigai, M., 13th IFIP WG 5.11 International Symposium, ISESS 2020, Wageningen, The Netherlands, February 5–7, 2020.
- [3] Online deconvolution for industrial hyperspectral imaging systems. Song, Y.; Djermoune, E.; Chen, J.; Richard, C.; and Brie, D. SIAM Journal on Imaging Sciences, 12(1): 54-86. 2019.
- [4] Control Chart Tests Based on Geometric Moving Averages. S. W., Technometrics, 1(3):239–250, 1959.
- [5] Newma: a new method for scalable model-free online change-point detection, Keriven, N.; Garreau, D. and Poli, I., 2018, https://arxiv.org/abs/1805.08061.
- [6] Distributed change detection in streaming graph signals. Ferrari, A. ; Richard C. ; Verducci L., 2019 IEEE 7th International Workshop on Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP)


Group 4 Restaurant
The group 4 restauraunt is very exclusive and will only accept the first 5 reservations
Every reservation afterward is put on a waiting list
Tables
Reservation


NewMonograph Dashboard
Powerful insights
into your team
Project planning and time tracking
for agile teams
Schedule a demoto see a live preview
NewMonograph Dashboard
Project planning and time tracking
for agile teams


Montae Nicholson active for Redskins against Jets
by Matthew ParasRedskins safety Montae Nicholson will be active for Sunday’s game against the New York Jets, days after a 21-year-old woman he was reportedly dating died of a drug overdose.
It was reported Nicholson was cooperating with Loudoun County authorities after the 23-year-old and another man dropped the woman off at the hospital, where she was pronounced dead.
Nicholson missed practice Thursday, but returned the following day. Interim coach Bill Callahan said the Redskins would let the legal process unfold, but did not dismiss the idea of Nicholson playing in the meantime.
TOP STORIES
Nancy Pelosi: Trump will have 'every opportunity to present his case'
'There will be blood': Maher sees civil war breaking out if we don't 'learn to live with each other'
Franklin Graham calls on nation to pray for Trump as impeachment effort gains speed
This will be Nicholson’s first appearance since Week 7. The Michigan State product had been dealing with an ankle injury, which caused him to miss two games.
A fourth-round pick in 2017, Nicholson has 35 tackles and two interceptions this season.
Elsewhere, wide receiver Cam Sims is active after Washington promoted him from the practice squad to the active roster on Saturday. The team needed another wideout with Paul Richardson out with a hamstring injury.
Richardson did not practice all week and suffered the injury two weeks ago against the Buffalo Bills. On Friday, Callahan mentioned Sims as one of the younger players he’d like to see excel in the last seven games of the season.
“We’re looking at everybody on the roster,” Callahan said.
Sims was active for Washington’s Week 5 loss to the New England Patriots, recording two offensive snaps in a 33-7 loss. The Alabama product was an early standout in training camp, but faded down the stretch and failed initially to make the 53-man roster. He also appeared in one game in 2018.
Besides Richardson, here’s who else was declared inactive against the Jets:
- Running back Chris Thompson (toe)
- Tight end Vernon Davis (concussion)
- Quarterback Colt McCoy
- Defensive lineman Tim Settle (hamstring)
- Safety Deshazor Everett (ankle)
- Guard Wes Martin
Sign up for Daily Newsletters
Copyright © 2019 The Washington Times, LLC. Click here for reprint permission.
Please read our comment policy before commenting.


Simple Facelets app running on Payara and Heroku.
Source codes are below:
git clone https://github.com/igapyon/heroku-payara-simple.git
Source codes of web app are below:
git clone https://github.com/igapyon/heroku-payara-simple-myapp.git


The model converts a limit if touched order to a limit order when the trigger condition is met. The following table describes the trigger condition of limit if touched orders for each data format and order direction:
| Data Format | TickType |
Order Direction | Trigger Condition |
|---|---|---|---|
Tick |
Quote |
Buy | quote price <= trigger price |
Tick |
Quote |
Sell | quote price >= trigger price |
Tick |
Trade |
Buy | trade price <= trigger price |
Tick |
Trade |
Sell | trade price >= trigger price |
TradeBar |
Buy | low price <= trigger price | |
TradeBar |
Sell | high price >= trigger price |
Once the limit if touched order triggers, to fill the order, the model checks the bid price for buy orders and the ask price for sell orders.
To get the bid price, the model uses the following procedure:
Tick
data and the most recent batch of ticks contains a buy quote, use the bid price of the most recent quote tick.QuoteBar
data, use the closing bid price of the most recent QuoteBar
.To get the ask price, the model uses the following procedure:
Tick
data and the most recent batch of ticks contains a sell quote, use the ask price of the most recent quote tick.QuoteBar
data, use the closing ask price of the most recent QuoteBar
.If neither of the preceding procedures yield a result, the model uses the following procedure to get the bid or ask price:
Tick
data and the most recent batch of ticks contains a tick of type TickType.Trade
, use the last trade price.TradeBar
data, use the closing bid price of the most recent QuoteBar
.Buy orders fill when the bid price <= limit price and sell orders fill when the ask price >= limit price. The order fills at the limit price. The model won't trigger or fill limit if touched orders with stale data or data with the order timestamp to avoid look-ahead bias.


|
Prismic.io PHP kit
3.0.0
|
Public Member Functions | |
| __construct ($array) | |
| asHtml ($linkResolver=null) | |
| asText () | |
| getArray () | |
Static Public Member Functions | |
| static | parseSubfragmentList ($json) |
| static | parse ($json) |
This class embodies a Group fragment. To understand better how it works: each group contains several sets of subfragments (as many as the content writer saw fit). So, once you have your group, you have two layers to go through: getting the set of subfragments you need (or, most often, looping through all of them); then picking which subfragment from its name, as defined in the JSON mask for this fragment.
For instance: for($groupFragment->getArray() as $groupDoc) { echo $groupDoc.getText('subfragmentName'); }
Each group doc can be manipulated like a regular Document.
| Prismic\Fragment\Group::__construct | ( | $array | ) |
Constructs a group fragment.
| string | $array | the array of associative arrays of subfragments |
| Prismic\Fragment\Group::asHtml | ( | $linkResolver = null | ) |
Builds a HTML version of the Group fragment.
| \Prismic\LinkResolver | $linkResolver | the link resolver |
Implements Prismic\Fragment\FragmentInterface.
| Prismic\Fragment\Group::asText | ( | ) |
Builds a text version of the Group fragment.
Implements Prismic\Fragment\FragmentInterface.
| Prismic\Fragment\Group::getArray | ( | ) |
Returns an array version of this group fragment, on which you can do all you can do on an array: loop, access a certain index, ...
Each item is an associative array of subfragments.
|
static |
|
static |
Parses a list of subfragments, and makes it into an associative array of fragments. Not meant to be used except for testing.
| \stdClass | $json | the json bit retrieved from the API that represents the list of subfragments |


eINIT
eINIT used to be an alternate implementation of the /sbin/init programme for Linux and FreeBSD. Well, I suppose it still is, but the project has been on hold for years now. Some parts of the project seem to have been lost, but most of it has been moved right here to GitHub. Ping Magnus (@jyujin) if you'd like to see it revived.
To see all the projects, go to https://github.com/einit and have a browse.
The original content of the website, the blog posts and documentation items, have been archived at my blog: http://ef.gy/einit


OpenEmu v2.1 Requires macOS 10.14 or above
- Initial macOS 10.15 Catalina support.
- Added new Metal renderer and display architecture, significantly improving frame pacing, performance and battery life - no more video latency at increased window sizes or fullscreen.
- Added new configurable, multi-pass post processing shader system using Slang - several preset shaders for impressive effects included.
- Added Rapid Fire Toggle and Rapid Fire Clear special keys in Controls preferences - used in-game when pressing a button + the toggle key to enable.
- Improved support for Nintendo Switch Pro Controller, including automatic analog calibration and support for USB connectivity.
- Improved support for USB Audio output devices.
- Fixed stuck search filter when switching between Save States and Screenshots collections.
- Removed Cg and Syphon frameworks.
- Updated localizations.
- Other bug fixes and performance improvements.
Known Issues
- IMPORTANT: Due to new security rules in macOS 10.15 Catalina, in order for keyboard input to work you MUST grant OpenEmu "Input Monitoring" access in the Privacy pane of Security & Privacy preferences.
- There may be a slight delay the first time after launching a game due to shaders compiling.
- The old Cg "filters" are not compatible with the new shader system.
- Control mappings may be reset due to changes in macOS 10.15 Catalina.
OpenEmu v<IP_ADDRESS>
- Fixed input not working for some users in the initial 2.0.9 release.
- Fixed the Library grid view appearing red in some instances on macOS 10.14 Mojave.
- Fixed "Consolidate Files" not copying all the referenced files for CD-based games.
- Added Chinese (Traditional) localization.
- Updated Catalan, Italian localizations.
OpenEmu v2.0.8
- Added "Display Mode" change support to the HUD bar for display-related options, currently available for Atari 2600, Game Boy, Game Gear, NES, Nintendo DS, Virtual Boy.
- Added Next/Last Display Mode change hotkeys.
- Improved the UI to better fit macOS 10.14 Mojave native menus and system colors.
- Fixed case where a directional button could get stuck.
- Fixed a rare input-related crash.
OpenEmu v2.0.7
- Initial macOS 10.14 Mojave support. Users that updated to Mojave before updating OpenEmu will need to manually download the update from openemu.org
- Added support for mapping controls with Touch Bar buttons.
- Added Step Frame Forward and Step Frame Backward special keys in Controls preferences.
- Added Fast Forward and Rewind notifications.
- Added "Show in Finder" menu item in Save States and Screenshots collections.
- Improved the Import Issue Resolver with a new modal UI.
- Improved using controls for digital buttons mapped onto an analog stick.
- Fixed audio becoming slightly out of sync after fast forwarding gameplay.
- Fixed audio glitches for PSP games.
- Fixed leftover window after quitting gameplay in a fullscreen popout window.
- Fixed empty windows in Mission Control after quitting gameplay.
- Fixed HUD bar remaining visible after closing popout window.
- Fixed games not sorting by "Last Played" in List View.
- Fixed case where bad/incomplete PSP game ISOs could be allowed to import.
- Fixed various UI issues in the Homebrew collection.
- Fixed a crash from mapping non-standard keys on external keyboards.
- Fixed a crash when a button profile for a previously mapped controller changed.
- Fixed a rare crash when deleting a game from a collection.
- Fixed a rare case where a ROM hack might not import.
- Fixed the appearance of localized text in various UI.
- Updated localizations.
- Updated Sparkle and XADMaster frameworks.
OpenEmu v<IP_ADDRESS>
- Added Sega Saturn system support. - Very CPU intensive, minimum requirement of a quad-core i7 processor for full speed.
- Added GLideN64 as the new default Mupen64Plus GPU plugin, significantly improving N64 graphics. - Overall game compatibility will further improve in a future update.
- Added Quick Look support in the Screenshots collection by pressing Space bar.
- Added light gun support for Sega Master System.
- Removed deprecated core plugins and their save states on launch.
- Improved N64 graphics.
- Improved UX for deleting games so they cannot be orphaned in the Game Library folder.
- Improved UX for importing M3U files where they could fail or crash.
- Improved Touch Bar graphics.
- Improved algorithm for reading the serial of a PlayStation game.
- Fixed a hang that occurs on 10.13 High Sierra.
- Fixed regression with compressed files not being correctly imported. - Would import decompressed but with the original compressed file extension.
- Fixed case where changing Game Library folder location could fail.
- Fixed case where clearing a control mapping would not save between launches.
- Fixed a crash accessing Game Library on NAS/SMB shares or external drives.
- Fixed a crash when deleting a game that was already deleted.
- Fixed a crash when downloading nonexistent cover art for a Homebrew collection game.
- Fixed a rare crash using cheat codes.
- Fixed Wii U Pro Controller analog axis range.
- Fixed fast forwarding interfering with pausing gameplay.
- Fixed sidebar not remembering width changes between launches.
- Fixed unwanted interpolation in screenshots.
- Fixed "Battle Heat" for PC-FX being falsely identified as TurboGrafx-CD/PCE CD.
- Fixed various 10.13 SDK issues and runtime warnings.
- Updated Japanese localization.
- Updated Sparkle framework.
OpenEmu v2.0.5
- Added automap support for Nintendo Switch Pro Controller.
- Added localized PC Engine controller graphic.
- Improved TurboGrafx controller graphic with pixel perfect Retina version.
- Fixed library error alerts not displaying.
- Fixed a crash with games in fullscreen.
- Fixed a crash when importing an invalid cue sheet.
- Fixed a crash when importing an unmatched multi-disc game.
- Fixed rare crash at startup.
- Fixed a potential hang when migrating game library and preferences to a new machine.
- Fixed various 10.12 SDK UI issues.
- Updated localizations.
- Note: Touch Bar users should update to the latest macOS 10.12 for full support.
OpenEmu v2.0.4
- Added support for the new MacBook Pro Touch Bar.
- Added gameplay preference to allow playing with controllers while in the background.
- Added automap support for PS4 Slim DualShock 4 (model CUH-ZCT2).
- Improved importing Multi-Disc Games.
- Fixed case where games would not load if a previous game failed to load.
- Fixed a potential crash when checking for and downloading core plugin updates.
- Fixed a crash when using the popout gameplay window and accessing the Services submenu on macOS 10.12.
- Fixed main window toolbar appearance for some localizations.
- Fixed various 10.12 SDK UI issues.
- Added Catalan localization.
- Updated localizations.
OpenEmu v2.0.3
- Fixed analog controllers that send excessive input events (e.g. DualShock 4 and others) interfering with frontend and core functions.
- Fixed case where some bluetooth mice (e.g. Logitech MX Anywhere 2) break the input system.
- Fixed Steam Controller support when properly configured through Steam.
- Fixed case where cancelling an alert could make it impossible to stop or reset gameplay.
- Updated localizations.
- Other bug fixes and performance improvements.
- Note: Preferences for Default Cores have been reset.
OpenEmu v2.0.2
- Added mGBA, a faster and more accurate GBA emulator, as the new default GBA core plugin.
- Added automap support for Horipad Ultimate controller.
- Optimized input handling and core helper process to further reduce latency.
- Improved search results in Save States and Screenshots libraries to be more precise.
- Fixed N64 games running too fast.
- Fixed controllers with a hat switch not retaining their proper D-pad mappings.
- Fixed reversed Y-axis for MFi devices.
- Fixed case where BIOS files might not import correctly after a new core plugin install.
- Fixed case where suppressing an alert might not remember the choice correctly.
- Fixed the appearance of localized text in Library and Preferences with Auto Layout.
- Fixed screenshots not saving for game titles with forward slashes.
- Added Chinese (Simplified), Dutch, Japanese localizations.
- Updated localizations.
- Other bug fixes and performance improvements.
OpenEmu v2.0.1
- Fixed new system plugins not being available.
- Fixed save states not saving if alert is suppressed.
- Add Odyssey²/Videopac controller graphic.
- Note: If BIOS files were not importing correctly after a new core install, please remove the imported files, restart the app and import your BIOS files again.
Changes since v2.0
- Added support for new systems:
- Atari 5200
- Atari 7800
- Atari Lynx
- ColecoVision
- Famicom Disk System
- Intellivision
- Nintendo 64
- Odyssey²/Videopac+
- PC-FX
- SG-1000
- Sega CD
- Sony PSP
- Sony PlayStation
- TurboGrafx-CD/PCE-CD
- Vectrex
- WonderSwan - Redesigned UI with a beautiful, modern look.
- Added real-time gameplay rewinding.
- Added Save States and Screenshots organizers.
- Added Homebrew collection with over 80 great games.
- Added automap support for SteelSeries Nimbus and Stratus XL controllers.
- Optimized input handling to eliminate latency.
- Fixed performance for certain GPUs.
- Updated translations.
- Other bug fixes and performance improvements.
Known Issues since v2.0
- Control mappings have been reset due to changes with the input system.
- Previous Sega Genesis/Mega Drive save states have been removed due to unresolvable incompatibilities with the Genesis Plus GX emulator.
- Using f.lux while playing games can cause performance issues or crashes, please disable f.lux to avoid problems.
- If using a Mac with dual GPUs, consider using gfxCardStatus to switch to the higher-end discrete GPU for improved performance.


|
motley-php
Useful PHP utility classes and programs
|
Tests the Motley::CommandOpt class. More...
Public Member Functions | |
| testNew () | |
| Test instantiation. More... | |
| testRunDefaultHelp () | |
| Test run function with default help. More... | |
| testRunHelp () | |
| Test run function with help. More... | |
| testRunVersion () | |
| Test run function with version. More... | |
| testRunBadSwitch () | |
| Test run function with bad switch. More... | |
Tests the Motley::CommandOpt class.
Definition at line 14 of file CommandDemoTest.php.
| Motley\Test\CommandDemoTest::testNew | ( | ) |
Test instantiation.
Definition at line 17 of file CommandDemoTest.php.
| Motley\Test\CommandDemoTest::testRunDefaultHelp | ( | ) |
Test run function with default help.
Definition at line 23 of file CommandDemoTest.php.
| Motley\Test\CommandDemoTest::testRunHelp | ( | ) |
Test run function with help.
Definition at line 42 of file CommandDemoTest.php.
| Motley\Test\CommandDemoTest::testRunVersion | ( | ) |
Test run function with version.
Definition at line 72 of file CommandDemoTest.php.
| Motley\Test\CommandDemoTest::testRunBadSwitch | ( | ) |
Test run function with bad switch.
Definition at line 100 of file CommandDemoTest.php.


Birth of the Enigma
Arther Scherbius invented the Enigma machine in 1918, during the twilight of the First World War. Almost terrifyingly advanced for the time, the Enigma was adopted just a few years later by the German Army and Navy, and would go on to serve as their key form of communication during WWII.


Home
TerryChat
Server Settings
Logout
(current)
(current)
Chatrooms
Online Users
Server Settings
SEND
Insert Content
Image
Video
Image URL:
Insert
Cancel
Video URL:
Insert
Cancel
Are you sure you want to delete this server?


{% extends "withoutnav_template.html" %} {% block per_page_title %} Check your email {% endblock %} {% block maincolumn_content %}
An email has been sent to {{ new_email }}.
Click the link in the email to confirm the change to your email address.
{% endblock %}


|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object edu.cmu.sphinx.linguist.dflat.DynamicFlatLinguist
public class DynamicFlatLinguist
A simple form of the linguist. It makes the following simplifying assumptions: 1) Zero or one word per grammar node 2) No fan-in allowed ever 3) No composites (yet) 4) Only Unit, HMMState, and pronunciation states (and the initial/final grammar state are in the graph (no word, alternative or grammar states attached). 5) Only valid tranisitions (matching contexts) are allowed 6) No tree organization of units 7) Branching grammar states are allowed
This is a dynamic version of the flat linguist that is more efficient in terms of startup time and overall footprint Note that all probabilties are maintained in the log math domain
| Field Summary | |
|---|---|
static java.lang.String |
ACOUSTIC_MODEL
The property used to define the acoustic model to use when building the search graph |
static java.lang.String |
ADD_OUT_OF_GRAMMAR_BRANCH
The property that specifies whether to add a branch for detecting out-of-grammar utterances. |
static java.lang.String |
GRAMMAR
The property used to define the grammar to use when building the search graph |
static java.lang.String |
OUT_OF_GRAMMAR_PROBABILITY
The property for the probability of entering the out-of-grammar branch. |
static java.lang.String |
PHONE_INSERTION_PROBABILITY
The property for the probability of inserting a CI phone in the out-of-grammar ci phone loop |
static java.lang.String |
PHONE_LOOP_ACOUSTIC_MODEL
The property for the acoustic model to use to build the phone loop that detects out of grammar utterances. |
static java.lang.String |
PROP_LOG_MATH
The property that defines the name of the logmath to be used by this search manager. |
static java.lang.String |
UNIT_MANAGER
The property used to define the unit manager to use when building the search graph |
| Fields inherited from interface edu.cmu.sphinx.linguist.Linguist |
|---|
PROP_FILLER_INSERTION_PROBABILITY, PROP_LANGUAGE_WEIGHT, PROP_SILENCE_INSERTION_PROBABILITY, PROP_UNIT_INSERTION_PROBABILITY, PROP_WORD_INSERTION_PROBABILITY |
| Constructor Summary | |
|---|---|
DynamicFlatLinguist()
|
|
DynamicFlatLinguist(AcousticModel acousticModel,
Grammar grammar,
UnitManager unitManager,
LogMath logMath,
double logWordInsertionProbability,
double logSilenceInsertionProbability,
double logUnitInsertionProbability,
double logFillerInsertionProbability,
float languageWeight,
boolean addOutOfGrammarBranch,
double logOutOfGrammarBranchProbability,
AcousticModel phoneLoopAcousticModel)
|
| Method Summary | |
|---|---|
void |
allocate()
Allocates the linguist. |
void |
deallocate()
Deallocates the linguist. |
LogMath |
getLogMath()
Returns the LogMath used. |
float |
getLogSilenceInsertionProbability()
Returns the log silence insertion probability. |
SearchGraph |
getSearchGraph()
Returns the search graph |
void |
newProperties(PropertySheet ps)
This method is called when this configurable component needs to be reconfigured. |
void |
startRecognition()
Called before a recognition |
void |
stopRecognition()
Called after a recognition |
| Methods inherited from class java.lang.Object |
|---|
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
| Field Detail |
|---|
@S4Component(type=Grammar.class) public static final java.lang.String GRAMMAR
@S4Component(type=UnitManager.class) public static final java.lang.String UNIT_MANAGER
@S4Component(type=AcousticModel.class) public static final java.lang.String ACOUSTIC_MODEL
@S4Boolean(defaultValue=false) public static final java.lang.String ADD_OUT_OF_GRAMMAR_BRANCH
@S4Double(defaultValue=1.0) public static final java.lang.String OUT_OF_GRAMMAR_PROBABILITY
@S4Double(defaultValue=1.0) public static final java.lang.String PHONE_INSERTION_PROBABILITY
@S4Component(type=AcousticModel.class) public static final java.lang.String PHONE_LOOP_ACOUSTIC_MODEL
@S4Component(type=LogMath.class) public static final java.lang.String PROP_LOG_MATH
| Constructor Detail |
|---|
public DynamicFlatLinguist(AcousticModel acousticModel, Grammar grammar, UnitManager unitManager, LogMath logMath, double logWordInsertionProbability, double logSilenceInsertionProbability, double logUnitInsertionProbability, double logFillerInsertionProbability, float languageWeight, boolean addOutOfGrammarBranch, double logOutOfGrammarBranchProbability, AcousticModel phoneLoopAcousticModel)
public DynamicFlatLinguist()
| Method Detail |
|---|
public void newProperties(PropertySheet ps) throws PropertyException
Configurable
newProperties
in interface Configurable
ps
- a property sheet holding the new data
PropertyException
- if there is a problem with the properties.public SearchGraph getSearchGraph()
getSearchGraph
in interface Linguist
public void allocate() throws java.io.IOException
Linguist
allocate
in interface Linguist
java.io.IOException
- if an IO error occurspublic void deallocate()
Linguist
deallocate
in interface Linguist
public void startRecognition()
startRecognition
in interface Linguist
public void stopRecognition()
stopRecognition
in interface Linguist
public LogMath getLogMath()
public float getLogSilenceInsertionProbability()
|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |


{% extends "layout.html" %} {% set title = _('Overview') %} {% block body %}
{{ _(This is the documentation for the latest SymPy documentation.) }}
SymPy is a Python library for symbolic mathematics. The documentation details different aspects of the library, including a modules' reference, a tutotial for beginners and developer guidelines.
References:
|
Getting Started
SymPy Tutorial |
SymPy Modules' Reference
SymPy Special Topics |
About SymPy:
|
SymPy Development Team
Financial and Infrastructure Support |
License
Citing SymPy |
Other quick links:
|
Module Index
FAQ |
SymPy on GitHub |


$)C— knitr: “bookdown::render_book” title: “Fairness and Bias in Machine Learning Workshop” author: [“Jae Yeon Kim”, “Aniket Kesari”, “Renata Barreto”, “Avery Richard”] date: “2020-10-07” site: bookdown::bookdown_site github-repo: dlab-berkeley/fairMLworkshop output: bookdown::gitbook documentclass: boo description: “Fairness and Bias in Machine Learning Workshop” —
Redoing ProPublica Analysis of the COMPAS dataset
I have edited the ProPublica’s Analysis of the COMPAS dataset to increase code readability and make changing data analysis and visualization easier.
- Bias in the data
- Bias in the algorithm
- Survival analysis [Code]
For more detailed information on the Machine Bias project, I encourage to check out this article.
Argument by Julia Angwin, Jeff Larson, Surya Mattu and Lauren Kirchner
Counterargument by Sam Corbett-Davies, Emma Pierson, Avi Feller and Sharad Goel
0.1 License
This work is licensed under a Creative Commons Attribution 4.0 International License.
$)C# Risk of recidivism analysis
0.2 Setup
if (!require("pacman")) install.packages("pacman", repos = "http://cran.us.r-project.org")
pacman::p_load(
tidyverse, # tidyverse packages
conflicted, # an alternative conflict resolution strategy
patchwork, # arranging ggplots
scales, # rescaling
survival, # survival analysis
broom, # for modeling
here, # reproducibility
glue # pasting strings and objects
)
# To avoid conflicts
conflict_prefer("filter", "dplyr")
conflict_prefer("select", "dplyr")
0.3 Load data
We select fields for severity of charge, number of priors, demographics, age, sex, COMPAS scores, and whether each person was accused of a crime within two years.
- N of observations (rows): 7,214
- N of variables (columns): 53
## Warning: Duplicated column names deduplicated: 'decile_score' =>
## 'decile_score_1' [40], 'priors_count' => 'priors_count_1' [49]
## [1] 7214 53
0.4 Wrangling
- Not all of the observations are useable for the first round of analysis.
- There are a number of reasons to remove rows because of missing data:
- If the charge date of a defendants COMPAS scored crime was not within 30 days from when the person was arrested, we assume that because of data quality reasons, that we do not have the right offense.
- We coded the recidivist flag – is_recid – to be -1 if we could not find a COMPAS case at all.
- In a similar vein, ordinary traffic offenses – those with a c_charge_degree of ‘O’ – will not result in Jail time are removed (only two of them).
- We filtered the underlying data from Broward county to include only those rows representing people who had either recidivated in two years, or had at least two years outside of a correctional facility.
0.4.1 Create a function
wrangle_data <- function(data){
df <- data %>%
# Select variables
select(age, c_charge_degree, race, age_cat, score_text, sex, priors_count, days_b_screening_arrest, decile_score, is_recid, two_year_recid,
c_jail_in, c_jail_out) %>%
# Filter rows
filter(days_b_screening_arrest <= 30,
days_b_screening_arrest >= -30,
is_recid != -1,
c_charge_degree != "O",
score_text != 'N/A') %>%
# Mutate variables
mutate(length_of_stay = as.numeric(as.Date(c_jail_out) - as.Date(c_jail_in)),
c_charge_degree = factor(c_charge_degree),
age_cat = factor(age_cat),
race = factor(race, levels = c("Caucasian","African-American","Hispanic","Other","Asian","Native American")),
sex = factor(sex, levels = c("Male","Female")),
score_text = factor(score_text, levels = c("Low", "Medium", "High")),
score = score_text,
# I added this new variable to test whether measuring the DV as a binary or continuous var makes a difference
score_num = as.numeric(score_text)) %>%
# Rename variables
rename(crime = c_charge_degree,
gender = sex)
return(df)}
0.4.2 Apply the function to the data
## [1] "age" "crime"
## [3] "race" "age_cat"
## [5] "score_text" "gender"
## [7] "priors_count" "days_b_screening_arrest"
## [9] "decile_score" "is_recid"
## [11] "two_year_recid" "c_jail_in"
## [13] "c_jail_out" "length_of_stay"
## [15] "score" "score_num"
## # A tibble: 5 x 16
## age crime race age_cat score_text gender priors_count days_b_screenin…
## <dbl> <fct> <fct> <fct> <fct> <fct> <dbl> <dbl>
## 1 69 F Other Greate… Low Male 0 -1
## 2 34 F Afri… 25 - 45 Low Male 0 -1
## 3 24 F Afri… Less t… Low Male 4 -1
## 4 44 M Other 25 - 45 Low Male 0 0
## 5 41 F Cauc… 25 - 45 Medium Male 14 -1
## # … with 8 more variables: decile_score <dbl>, is_recid <dbl>,
## # two_year_recid <dbl>, c_jail_in <dttm>, c_jail_out <dttm>,
## # length_of_stay <dbl>, score <fct>, score_num <dbl>
0.5 Descriptive analysis
- Higher COMPAS scores are slightly correlated with a longer length of stay.
## [1] 0.2073297
# Set theme
ggplot2::theme_set(theme_minimal())
df %>%
group_by(score) %>%
count() %>%
ggplot(aes(x = score, y = n)) +
geom_col() +
labs(x = "Score",
y = "Count",
title = "Score distribution")
Judges are often presented with two sets of scores from the COMPAS system – one that classifies people into High, Medium and Low risk, and a corresponding decile score. There is a clear downward trend in the decile scores as those scores increase for white defendants.
0.6 Modeling
After filtering out bad rows, our first question is whether there is a significant difference in COMPAS scores between races. To do so we need to change some variables into factors, and run a logistic regression, comparing low scores to high scores.
0.6.1 Model building
model_data <- function(data){
# Logistic regression model
lr_model <- glm(score ~ gender + age_cat + race + priors_count + crime + two_year_recid,
family = "binomial", data = data)
# OLS, DV = score_num
ols_model1 <- lm(score_num ~ gender + age_cat + race + priors_count + crime + two_year_recid, data = data)
# OLS, DV = decile_score
ols_model2 <- lm(decile_score ~ gender + age_cat + race + priors_count + crime + two_year_recid, data = data)
# Extract model outcomes with confidence intervals
lr_est <- lr_model %>%
tidy(conf.int = TRUE)
ols_est1 <- ols_model1 %>%
tidy(conf.int = TRUE)
ols_est2 <- ols_model2 %>%
tidy(conf.int = TRUE)
# AIC scores
lr_AIC <- AIC(lr_model)
ols_AIC1 <- AIC(ols_model1)
ols_AIC2 <- AIC(ols_model2)
list(lr_est, ols_est1, ols_est2,
lr_AIC, ols_AIC1, ols_AIC2)
}
0.6.2 Model comparisons
glue("AIC score of logistic regression: {model_data(df)[4]}
AIC score of OLS regression (with categorical DV): {model_data(df)[5]}
AIC score of OLS regression (with continuous DV): {model_data(df)[6]}")
## AIC score of logistic regression: 6192.40169473357
## AIC score of OLS regression (with categorical DV): 11772.1148541111
## AIC score of OLS regression (with continuous DV): 26779.9512226999
0.6.3 Logistic regression model
lr_model <- model_data(df)[1] %>% data.frame()
lr_model %>%
filter(term != "(Intercept)") %>%
mutate(term = gsub("race|age_cat|gender|M","", term)) %>%
ggplot(aes(x = fct_reorder(term, estimate), y = estimate, ymax = conf.high, ymin = conf.low)) +
geom_pointrange() +
coord_flip() +
labs(y = "Estimate", x = "",
title = "Logistic regression") +
geom_hline(yintercept = 0, linetype = "dashed")
interpret_estimate <- function(model){
# Control
intercept <- model$estimate[model$term == "(Intercept)"]
control <- exp(intercept) / (1 + exp(intercept))
# Likelihood
model <- model %>% filter(term != "(Intercept)")
model$likelihood <- (exp(model$estimate) / (1 - control + (control * exp(model$estimate))))
return(model)
}
interpret_estimate(lr_model) %>%
mutate(term = gsub("race|age_cat|gender","", term)) %>%
ggplot(aes(x = fct_reorder(term, likelihood), y = likelihood)) +
geom_point(size = 3) +
coord_flip() +
labs(y = "Likelihood", x = "",
title ="Logistic regression") +
scale_y_continuous(labels = scales::percent_format(accuracy = 1)) +
geom_hline(yintercept = 1, linetype = "dashed")


Grid Engine Home > Administering > Using qconf >
qconf Cheat Sheet
- Complex Configuration
- Calendar Configuration
- Checkpointing Environment Configuration
- Cluster Configuration
- Event Client Configuration
- Host Configuration
- Host Group Configuration
- Parallel Environment Configuration
- Project Configuration
- Queue Configuration
- Scheduler Configuration
- Sharetree Configuration
- User Configuration
- User Access List Configuration
For a detailed list of available qconf commands, see the qconf(1) man page.
Complex Configuration
| Command | Description |
|---|---|
| qconf -sc | Show the current complex configuration. |
| qconf -mc | Modify the complex configuration using an editor. |
| qconf -Mc filename | Modify the current complex configuration by overwriting the current configuration as specified by the file filename. |
For more information, see How to Configure the Complex From the Command Line.
Calendar Configuration
| Command | Description |
|---|---|
| qconf -scal calendarname | Show the configuration for the specified calendar. |
| qconf -scall | Show a list of all currently configured calendars. |
| qconf -acal calendarname | Add a new calendar definition to the Sun Grid Engine environment. |
| qconf -Acal filename | Add a new calendar definition to the Sun Grid Engine environment from the file filename. |
| qconf -mcal calendarname | Modify the specified calendar configuration using an editor. |
| qconf -Mcal filename | Modify the current calendar configuration by overwriting the current configuration as specified by filename. |
| qconf -dcal calendarname | Delete a calendar. |
For more information, see How to Configure Queue Calendars From the Command Line.
Checkpointing Environment Configuration
| Command | Description |
|---|---|
| qconf -sckpt checkpointname | Show the configuration of the specified checkpointing environment. |
| qconf -sckptl | Show a list of all currently configured checkpointing environments. |
| qconf -ackpt checkpointname | Add a checkpointing environment to the Sun Grid engine environment. |
| qconf -Ackpt filename | Add a checkpointing environment from the file filename. |
| qconf -mckpt checkpointname | Modify the specified checkpointing environment using an editor. |
| qconf -Mckpt filename | Modify a checkpointing environment from file filename. |
| qconf -dckpt checkpointname | Delete a checkpointing environment. |
For more information, see How to Configure Checkpointing Environments From the Command Line.
Cluster Configuration
| Command | Description |
|---|---|
| qconf -sconf [host,...|global] | Show a local host configuration or the global cluster configuration. |
| qconf -sconfl | Show a list of all currently configured hosts. |
| qconf -aconf host,... | Add a host configuration. |
| qconf -Aconf filelist | Add the configuration specified in the files enlisted in the comma-separated filelist. |
| qconf -mconf [host,...|global] | Modify one or more local host configurations, or modify the global cluster configuration. |
| qconf -Mconf filelist | Modify the configurations specified in the files enlisted in the comma separated filelist. |
| qconf -dconf host,... | Delete one or more hosts from the configuration list. |
For more information, see How to Configure Clusters From the Command Line.
Event Client Configuration
| Command | Description |
|---|---|
| qconf -secl | Show event client list. |
| qconf -kec [eventclientname,...|all] | Shuts down event clients registered at the master daemon. |
Host Configuration
| Command | Description |
|---|---|
| qconf -se host | Show the configuration for the specified execution host. |
| qconf -sel | Show a list of all currently-configured execution hosts. |
| qconf -ae | Add an execution host. |
| qconf -Ae filename | Add an execution host from file filename. |
| qconf -me host | Modify the specified execution host using an editor. |
| qconf -Me filename | Modify an execution host from file filename. |
| qconf -de host,... | Delete one or more execution hosts. |
| qconf -sh | Show a list of all currently-configured administrative hosts. |
| qconf -ah host,... | Add one or more administrative hosts. |
| qconf -dh host,... | Delete one or more administrative hosts from the administrative host list. |
| qconf -ss | Show a list of all currently-configured submit hosts. |
| qconf -as host,... | Add one or more submit hosts. |
| qconf -ds host,... | Delete a submit host. |
For more information, see Configuring Hosts.
Host Group Configuration
| Command | Description |
|---|---|
| qconf -shgrp groupname | Show the configuration for the specified host group. |
| qconf -shgrpl | Show a list of all currently configured host groups. |
| qconf -ahgrp hostgroupname | Add a host group. |
| qconf -Ahgrp filename | Add a host group configuration from file filename. |
| qconf -mhgrp hostgroupname | Modify the specified host group using an editor. |
| qconf -Mhgrp filename | Modify a host group configuration from file filename. |
For more information, see How to Configure Host Groups From the Command Line.
Parallel Environment Configuration
| Command | Description |
|---|---|
| qconf -sp pename | Show the configuration for the specified parallel environment. |
| qconf -spl | Show a list of all currently configured parallel environments. |
| qconf -ap pename | Add a new parallel environment. |
| qconf -Ap filename | Add a parallel environment from file filename. |
| qconf -mp pename | Modify the specified parallel environment using an editor. |
| qconf -Mp filename | Modify a parallel environment from file filename. |
| qconf -dp pename | Delete the specified parallel environment. |
For more information, see How to Configure Parallel Environments From the Command Line.
Project Configuration
| Command | Description |
|---|---|
| qconf -sprj projectname | Show the configuration for the specified project. |
| qconf -sprjl | Show a list of all currently configured projects. |
| qconf -aprj | Add a new project. |
| qconf -Aprj filename | Add a new project from file filename. |
| qconf -mprj projectname | Modify the specified project using an editor. |
| qconf -Mprj filename | Modify a project from file filename. |
| qconf -dprj projectname | Delete a project. |
For more information, see How to Configure Projects From the Command Line.
Queue Configuration
The most flexible way to automate the configuration of queue instances is to use the qconf command with the qselect command. With the combination of these commands, you can build up your own custom administration scripts.
| Command | Description |
|---|---|
| qconf -sq wc_queue_list | Show one or multiple cluster queues or queue instances. |
| qconf -sql | Show a list of all currently configured cluster queues. |
| qconf -aq queuename | Add a new queue. |
| qconf -Aq filename | Add a queue from file filename. |
| qconf -mq queuename | Modify the specified queue using an editor. |
| qconf -Mq filename | Modify a queue from file filename. |
| qconf -dq queuename | Delete a queue. |
| -purge allows you to delete an entire list attribute from the underlying queue instances of a cluster queue, whereas -dattr only deletes a value or an item from a list attribute. |
For more information, see Configuring Queues.
Scheduler Configuration
| Command | Description |
|---|---|
| qconf -ssconf | Show the current scheduler configuration. |
| qconf -msconf | Modify the scheduler configuration using an editor. |
| qconf -tsm | Trigger scheduler monitoring. |
For more information, see Managing the Scheduler.
Sharetree Configuration
| Command | Description |
|---|---|
| qconf -sstree | Show the sharetree. |
| qconf -sstnode nodelist | Show one or more sharetree node. |
| qconf -rsstnode nodelist | Show one or more sharetree nodes and their children. |
| qconf -astree | Add a sharetree. |
| qconf -Astree filename | Add a sharetree from filename. |
| qconf -astnode nodelist | Add one or more sharetree nodes. |
| qconf -mstree | Modify a sharetree. |
| qconf -Mstree filename | Modify a sharetree from filename. |
| qconf -dstree | Delete a sharetree. |
| qconf -dstnode nodelist | Delete or more sharetree nodes. |
User Configuration
| Command | Description |
|---|---|
| qconf -suser username,... | Show the configuration for one or more users. |
| qconf -suserl | Show a list of all currently-configured users. |
| qconf -auser | Add a user to the list of registered users. |
| qconf -Auser filename | Add a user from file filename. |
| qconf -muser username | Modify the specified user configuration using an editor. |
| qconf -Muser filename | Modify a user from file filename. |
| qconf -duser username,... | Delete one or more users. |
| qconf -sm | Show a list of all currently-configured managers. |
| qconf -am username | Add a user to the manager list. |
| qconf -dm username,... | Delete one or more managers. |
| qconf -so | Show a list of all currently-configured operators. |
| qconf -ao username | Adds a user to the operator list. |
| qconf -do username,... | Deletes one or more operators. |
For more information, see Configuring User Access.
User Access List Configuration
| Command | Description |
|---|---|
| qconf -su aclname [,...] | Displays the configuration for the specified access list. |
| qconf -sul | Displays a list of all currently configured user access lists. |
| qconf -au username [,...] accesslistname [,...] | Adds a user or users to an access list or lists. |
| qconf -Au filename | Adds a user access list from file filename. |
| qconf -mu aclname | Opens an editor to modify the specified access list configuration. |
| qconf -Mu filename | Modifies a user access list from file filename. |
| qconf -du username [,...] aclname [,...] | Deletes a user or users to an access list or lists. |
| qconf -dul aclname [,...] | Deletes one or more user access lists. |
For more information, see How to Configure User Access Lists From the Command Line.
Sign up or Log in to add a comment or watch this page.


I’m a multifaceted creative professional with a love for art, fashion, writing, film and all things digital media. I have a background in content creation, creative direction, writing, editing, social media, video production, photography, illustration, and graphic design.
know more2016 - Present
2016 - Present
March 2020 - Present
2018
University of South Florida
2018
University of South Florida
2018
University of South Florida
Nature, sustainbility, health & wellness
Conscious fashion, health & wellness
Infographics, posters, media


{% extends 'base.html' %} {% load staticfiles i18n %} {% block container %}
For the best experience please scroll/adjust the window until you can see both the top and bottom banners of the screen.
Please read the following set of instructions carefully to learn how to play the game.
After completing the instructions and comprehension check, you will enter a waiting room. You will remain here until the required number of players enter the waiting room. Then, all the players will enter the game. The game consists of 20 rounds. Each round is composed of 3 stages:
1. You will see a scatter plot and be asked to estimate the correlation of the X and Y variables. While correlations can be positive or negative depending on the slope of the correlation, no negative correlations will be used in this game. All players will see the same scatter plot.
Use the slider below the graph to guess the correlation of the data. Your guess can range from 0 to 1, with 0 meaning no correlation, and 1 meaning perfect correlation (a straight line). No calculations are necessary, just make your best estimation. You have 30 seconds to enter your guess.
2. Once you have submitted your initial estimate, you will be able to see the guesses of the players you follow in the game. You will have another 30 second period to alter your estimate. You will be able to see as other players change their estimates. After 30 seconds elapse, your estimate will be locked in, and you will proceed to the next round.
3.  Here you can see how well all the other players in the game performed in the last round. You may choose to ‘follow’ up to 3 other players, and you will have the option to follow/unfollow players after each round.
These three stages will repeat every round.


Assigned role:
Primary client developer
In charge of designing, coding, and testing the mobile client of the system.
Personal Activity:
Week of 2/7-2/13
- Reviewed Requirements Document
- Updated this page
- Began research into iOS berkley sockets implementation
Week of 2/14-2/20
Week of 2/21-2/27
- Began Implementation of locaiton services in client
- Client now accepts new, inaccurate locations into the datatable
- Client now generating accurate locations for datatable
- Participated in group meetings on Thursday and Friday
Week of 2/28-3/6
This week I have worked heavily on the midterm presentation, attended both group meetings, attended the estudio practice presentation, and completed the design of the Client application. The client design diagrams were used both in the presentation powerpoint and in the design documentation. I also created the data flow diagram modeling the entire system.
Week of 3/7-3/13
This week I have begun implementation of the tracking algorithm. The design has also been posted to the website. I assisted in giving the groups presentation on monday. The client should be basically implemented by the end of spring break.
Weeks of 3/14-3/27
These past two weeks, I have completed the implementation for setting a home location and setting a work location. The automated tracking has also been completed. It changes tracking and GPS modes according to the state machine in the design document, now. Yet to be implemented is the weather querying protocols. Finally, the send button is implemented, it currently only opens a blank message window. Encryption needs to be implemented aswell as a conversion function to convert the encrypted data into something passable to the email window.
Week of 3/28-4/3
This week I attended the meeting where the test plan was designed. I created an in depth test plan for all the units inside of the client system. This is now posted on the testing page of our website. I also assisted in the creation and configuration of the server which will host the database, processing script, http server, and email server.
Week of 4/4-4/10
This week I have finalized the rough implementation of the Client. It is currently ready for testing. Documentation for the rough implementation has been polished. The GPS data is now categorized in proper routes. All route data is now correctly encrypted with a PGP key retrieved from the server. The server is now configured as an SMTP server and an HTTP server.
This week I also attended the group meeting at Marksbury. At the meeting we discussed the state of the project, testing methods, and implementation schedules. We also set a date of 5 PM April 27th as the delivery date of the product. This will occur immediately after the presentation in Marksbury Building.
Weeks of 4/11-2/24/
During this time period, I have finalized the implementation of the program. I also began testing the program. The results of the first round of testing showed that there were bugs in the route detection code. Those were patched. The locationmanager's locations object was not as expected, so we are now using a single global previouslocation object to do the algorithm. It now works completely. Upon user testing the system, i noticed that the previous "locationmatch" radius was too wide. It is now down to 250 meters, which is still on the high end, but a good balance between home driveway parking and business parking lots.
I also modified our presentation for the final presentation, and did the practice presentation on friday the 22nd.


Apache Derby 10.9 API Documentation - Copyright © 2004,2012 The Apache Software Foundation. All Rights Reserved.


|
||||||||||
| PREV NEXT | FRAMES NO FRAMES |
| Classes in com.hp.hpl.jena.query used by arq.cmdline | |
|---|---|
| Dataset
Query is over a Dataset, a collection of named graphs and a background graph (also called the default graph or unnamed graph). |
|
| Query
The data structure for a query as presented externally. |
|
| ResultSet
Results from a query in a table-like manner for SELECT queries. |
|
| Syntax
Symbols for query language syntaxes |
| Classes in com.hp.hpl.jena.query used by arq.examples.engine | |
|---|---|
| Query
The data structure for a query as presented externally. |
| Classes in com.hp.hpl.jena.query used by com.hp.hpl.jena.query | |
|---|---|
| Dataset
Query is over a Dataset, a collection of named graphs and a background graph (also called the default graph or unnamed graph). |
|
| DataSource
A DataSource is a Dataset that has modification operations. |
|
| LabelExistsException
LabelExists in a named composite data source |
|
| Query
The data structure for a query as presented externally. |
|
| QueryException
QueryException is root exception for all (intentional) exceptions associated with query parsing and execution. |
|
| QueryExecution
A interface for a single execution of a query. |
|
| QueryFatalException
QueryFatalException is such that the query aborts do to some problem (this might be an internal error or something in the way the query builds or executes). |
|
| QuerySolution
A single answer from a SELECT query. |
|
| QueryVisitor
Query visitor pattern |
|
| ResultSet
Results from a query in a table-like manner for SELECT queries. |
|
| ResultSetRewindable
|
|
| SortCondition
|
|
| Syntax
Symbols for query language syntaxes |
| Classes in com.hp.hpl.jena.query used by com.hp.hpl.jena.query.larq | |
|---|---|
| QueryException
QueryException is root exception for all (intentional) exceptions associated with query parsing and execution. |
|
| QueryFatalException
QueryFatalException is such that the query aborts do to some problem (this might be an internal error or something in the way the query builds or executes). |
| Classes in com.hp.hpl.jena.query used by com.hp.hpl.jena.sparql | |
|---|---|
| QueryException
QueryException is root exception for all (intentional) exceptions associated with query parsing and execution. |
|
| QueryFatalException
QueryFatalException is such that the query aborts do to some problem (this might be an internal error or something in the way the query builds or executes). |
| Classes in com.hp.hpl.jena.query used by com.hp.hpl.jena.sparql.algebra | |
|---|---|
| Dataset
Query is over a Dataset, a collection of named graphs and a background graph (also called the default graph or unnamed graph). |
|
| Query
The data structure for a query as presented externally. |
|
| ResultSet
Results from a query in a table-like manner for SELECT queries. |
| Classes in com.hp.hpl.jena.query used by com.hp.hpl.jena.sparql.algebra.table | |
|---|---|
| ResultSet
Results from a query in a table-like manner for SELECT queries. |
| Classes in com.hp.hpl.jena.query used by com.hp.hpl.jena.sparql.core | |
|---|---|
| Dataset
Query is over a Dataset, a collection of named graphs and a background graph (also called the default graph or unnamed graph). |
|
| DataSource
A DataSource is a Dataset that has modification operations. |
|
| LabelExistsException
LabelExists in a named composite data source |
|
| Query
The data structure for a query as presented externally. |
|
| QueryException
QueryException is root exception for all (intentional) exceptions associated with query parsing and execution. |
|
| QuerySolution
A single answer from a SELECT query. |
|
| QueryVisitor
Query visitor pattern |
| Classes in com.hp.hpl.jena.query used by com.hp.hpl.jena.sparql.engine | |
|---|---|
| Dataset
Query is over a Dataset, a collection of named graphs and a background graph (also called the default graph or unnamed graph). |
|
| Query
The data structure for a query as presented externally. |
|
| QueryExecution
A interface for a single execution of a query. |
|
| QuerySolution
A single answer from a SELECT query. |
|
| ResultSet
Results from a query in a table-like manner for SELECT queries. |
| Classes in com.hp.hpl.jena.query used by com.hp.hpl.jena.sparql.engine.binding | |
|---|---|
| QuerySolution
A single answer from a SELECT query. |
| Classes in com.hp.hpl.jena.query used by com.hp.hpl.jena.sparql.engine.http | |
|---|---|
| Dataset
Query is over a Dataset, a collection of named graphs and a background graph (also called the default graph or unnamed graph). |
|
| Query
The data structure for a query as presented externally. |
|
| QueryException
QueryException is root exception for all (intentional) exceptions associated with query parsing and execution. |
|
| QueryExecution
A interface for a single execution of a query. |
|
| QuerySolution
A single answer from a SELECT query. |
|
| ResultSet
Results from a query in a table-like manner for SELECT queries. |
| Classes in com.hp.hpl.jena.query used by com.hp.hpl.jena.sparql.engine.iterator | |
|---|---|
| ResultSet
Results from a query in a table-like manner for SELECT queries. |
| Classes in com.hp.hpl.jena.query used by com.hp.hpl.jena.sparql.engine.main | |
|---|---|
| Query
The data structure for a query as presented externally. |
| Classes in com.hp.hpl.jena.query used by com.hp.hpl.jena.sparql.engine.optimizer | |
|---|---|
| Query
The data structure for a query as presented externally. |
| Classes in com.hp.hpl.jena.query used by com.hp.hpl.jena.sparql.expr | |
|---|---|
| Query
The data structure for a query as presented externally. |
|
| QueryException
QueryException is root exception for all (intentional) exceptions associated with query parsing and execution. |
| Classes in com.hp.hpl.jena.query used by com.hp.hpl.jena.sparql.junit | |
|---|---|
| Query
The data structure for a query as presented externally. |
|
| QueryExecution
A interface for a single execution of a query. |
|
| ResultSet
Results from a query in a table-like manner for SELECT queries. |
|
| Syntax
Symbols for query language syntaxes |
| Classes in com.hp.hpl.jena.query used by com.hp.hpl.jena.sparql.lang | |
|---|---|
| Query
The data structure for a query as presented externally. |
|
| QueryParseException
QueryParseException is root exception for all (intentional) exceptions from the various parsers where the error is to do with the syntax of a query. |
|
| Syntax
Symbols for query language syntaxes |
| Classes in com.hp.hpl.jena.query used by com.hp.hpl.jena.sparql.lang.rdql | |
|---|---|
| Query
The data structure for a query as presented externally. |
|
| QueryException
QueryException is root exception for all (intentional) exceptions associated with query parsing and execution. |
| Classes in com.hp.hpl.jena.query used by com.hp.hpl.jena.sparql.modify | |
|---|---|
| Dataset
Query is over a Dataset, a collection of named graphs and a background graph (also called the default graph or unnamed graph). |
| Classes in com.hp.hpl.jena.query used by com.hp.hpl.jena.sparql.resultset | |
|---|---|
| QueryException
QueryException is root exception for all (intentional) exceptions associated with query parsing and execution. |
|
| QuerySolution
A single answer from a SELECT query. |
|
| ResultSet
Results from a query in a table-like manner for SELECT queries. |
| Classes in com.hp.hpl.jena.query used by com.hp.hpl.jena.sparql.serializer | |
|---|---|
| Query
The data structure for a query as presented externally. |
|
| QueryVisitor
Query visitor pattern |
|
| Syntax
Symbols for query language syntaxes |
| Classes in com.hp.hpl.jena.query used by com.hp.hpl.jena.sparql.sse | |
|---|---|
| Dataset
Query is over a Dataset, a collection of named graphs and a background graph (also called the default graph or unnamed graph). |
| Classes in com.hp.hpl.jena.query used by com.hp.hpl.jena.sparql.sse.builders | |
|---|---|
| ResultSet
Results from a query in a table-like manner for SELECT queries. |
| Classes in com.hp.hpl.jena.query used by com.hp.hpl.jena.sparql.syntax | |
|---|---|
| Query
The data structure for a query as presented externally. |
| Classes in com.hp.hpl.jena.query used by com.hp.hpl.jena.sparql.util | |
|---|---|
| Dataset
Query is over a Dataset, a collection of named graphs and a background graph (also called the default graph or unnamed graph). |
|
| DataSource
A DataSource is a Dataset that has modification operations. |
|
| Query
The data structure for a query as presented externally. |
|
| QueryExecution
A interface for a single execution of a query. |
|
| ResultSet
Results from a query in a table-like manner for SELECT queries. |
|
| Syntax
Symbols for query language syntaxes |
| Classes in com.hp.hpl.jena.query used by com.hp.hpl.jena.update | |
|---|---|
| Dataset
Query is over a Dataset, a collection of named graphs and a background graph (also called the default graph or unnamed graph). |
|
| QuerySolution
A single answer from a SELECT query. |
|
||||||||||
| PREV NEXT | FRAMES NO FRAMES |


Christian Critic's Movie Parables - http://www.christiancritic.com
RUN LOLA RUN (LOLA RENNT) In German w/English subtitles *** out of **** stars =============================
DIRECTED BY: Tom Tykwer STARRING: Franka Potente, Moritz Bleibtreu, Herbert Knaup, Nina Petri WRITTEN BY: Tom Tykwer RATED: R for sex, violence, and profanity SCRIPTURE REFERENCES: 2 Thessalonians 1:11, 1 Thessalonians 1:7, Titus 2:6-8
What we have here is a simple matter of style over substance. RUN LOLA RUN, a 1998 German film which is beginning to make its way across the US, playing in art houses and film festivals, does not have much of a story but what it has, it tells very well.
Writer/director Tom Tykwer (WINTER SLEEPER) has taken a basic plot line, multiplied it by three, added a techno-rock musical score and used many inventive camera techniques to keep us riveted to the story (even though, as I've said, there's not much of a story there.)
It all begins when Lola gets a phone call from her boyfriend, Manni.  If Manni doesn't come up with the money in 20 minutes, he's a dead man. And with that piece of information, Lola is off and running.
Dashing through the streets of Berlin, trying to think up a way to get that kind of money that quickly, she rushes past people and events almost without acknowledging their existence.
20 minutes later we see the outcome of her mad run and the results of the decisions she made along the way. The ending may disappoint many in the audience but there's no need for despair. The movie is a long way from over.
Just like that, we're back at the phone call that began it all and once again, Lola is off and running. This time however, a slight delay in the beginning results in some major differences down the road. As we have heard elsewhere, timing is everything. Lola is forced to make decisions she didn't have to make in the "first run" because she arrived at various places a few seconds earlier or later. Again, we play the story out to its conclusion to find out what happens when the 20 minute deadline expires.
Still not happy with the outcome? Let us go back to the phone and again, Lola will take off running. And once again, slight changes early on in the run have a major impact in the end result. Clearly, the point being made is that our lives consist of millions of such minuscule moments which add to the overall course of our lives. For the third time, we take the story all the way to its ultimate conclusion.
What makes the movie work is the stylistic approach of Mr. Tykwer. He uses many camera tricks to heighten the enjoyment of the film. Split screen, stop action, slo-mo, animation mixed with live action...he includes it all. There is no getting bored with Mr. Tykwer at the helm of the film.
The music by Reinhold Heil is techno rock at its best: pounding bass, rhythmic beat, and all. During each run, there is no slowdown in the action. The urgency of the situation is pressed upon all we see. However, in between each run are short segments with a calmer, more intimate Lola and Manni, engaging in the silly and endearing pillow talk of a couple obviously in love.
Franka Potente (AM I BEAUTIFUL?) is Lola, hair dyed an unnaturally red color (which takes on the look of flames streaming off her head as she runs full blast through the streets of Berlin.) With a scream that could (and does) shatter glass, Lola is truly a memorable character.
One of the themes that runs throughout the film is the impact our lives have with others even though we may only slightly interact with them. Whether we are aware of it or not, we leave a mark wherever we go. Whether that mark is a good one, inspiring and encouraging to others, or a negative one, harmful and detrimental to others, is entirely up to us and the way we conduct our lives.
 The impression we make should remind others of the glory and goodness of God. Lola and Manni are not God's representatives, nor do they present themselves as such. But they do illustrate how one life can affect many others. If they leave negative impacts, we can leave positive ones. All it takes is an awareness and a willingness to live for God and the fortitude to do it.
Michael Elliott August, 1999 http://www.christiancritic.com
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews