# Read Files Node.js, as you probably know, is much different than your typical JavaScript in the browser. It has its own set of libraries meant for handling OS and filesystem tasks, like opening and reading files. -- ### 2 Ways There are 2 ways you can open and read a file using the fs module: - Load all of the contents at once (buffering) - Incrementally load contents (streaming) --- # Buffering Contents with fs.readFile This is the most common way to read a file with Node.js, especially for beginners, due to its simplicity and convenience. --- ## Example of using fs.readFile ```js var fs = require('fs'); fs.readFile('my-file.txt', 'utf8', function(err, data) { if (err) throw err; console.log(data); }); ``` -- ### After removing the utf8 argument in code ```shell $ node read-file.js
``` --- ## How to load a file synchronously? ```js var fs = require('fs'); try { var data = fs.readFileSync('my-file.txt', 'utf8'); console.log(data); } catch(e) { console.log('Error:', e.stack); } ``` --- # Streaming Contents with fs.createReadStream The second way to open and read a file is to open it as a Stream using the `fs.createReadStream` method. All Node streams are instances of the `EventEmitter` object, allowing you to subscribe to important events. -- ## Usefulness A readable stream object can be useful for a lot of reasons, a few of which include - Smaller memory footprint - Faster response time - Piping data --- ## Example 1: 'hello world' of file streaming ```js var fs = require('fs'); var data = ''; var readStream = fs.createReadStream('my-file.txt', 'utf8'); readStream.on('data', function(chunk) { data += chunk; }).on('end', function() { console.log(data); }); ``` --- ## Example 2: an Express route that handles a file request ```js var fs = require('fs'); var path = require('path'); var http = require('http'); var staticBasePath = './static'; var staticServe = function(req, res) { var fileLoc = path.resolve(staticBasePath); fileLoc = path.join(fileLoc, req.url); var stream = fs.createReadStream(fileLoc); stream.on('error', function(error) { res.writeHead(404, 'Not Found'); res.end(); }); stream.pipe(res); }; var httpServer = http.createServer(staticServe); httpServer.listen(8080); ``` --- # Conclusion We learned the basics of reading files, as well as some advanced loading methods using Stream objects. ### Knowing when to use them is the key that should be carefully considered for memory-constrained or time-constrained applications. --- # The End


consensus_partition_by_down_sampling.Rd
Consensus partitioning only with a subset of columns
consensus_partition_by_down_sampling(data, top_value_method = "ATC", top_n = NULL, partition_method = "skmeans", max_k = 6, k = NULL, subset = min(round(ncol(data)*0.2), 250), pre_select = TRUE, verbose = TRUE, prefix = "", anno = NULL, anno_col = NULL, dist_method = c("euclidean", "correlation", "cosine"), .env = NULL, .predict = TRUE, mc.cores = 1, cores = mc.cores, ...)
| data | A numeric matrix where subgroups are found by columns. |
|---|---|
| top_value_method | A single top-value method. Available methods are in |
| top_n | Number of rows with top values. The value can be a vector with length > 1. When n > 5000, the function only randomly sample 5000 rows from top n rows. If |
| partition_method | A single partitioning method. Available methods are in |
| max_k | Maximal number of subgroups to try. The function will try for |
| k | Alternatively, you can specify a vector k. |
| subset | Number of columns to randomly sample, or a vector of selected indices. |
| pre_select | Whether to pre-select by k-means. |
| verbose | Whether to print messages. |
| prefix | Internally used. |
| anno | Annotation data frame. |
| anno_col | Annotation colors. |
| dist_method | Method for predict the class for other columns. |
| .env | An environment, internally used. |
| .predict | Internally used. |
| mc.cores | Number of cores. This argument will be removed in future versions. |
| cores | Number of cores, or a |
| ... | All pass to |
The function performs consensus partitioning only with a small subset
of columns and the class of other columns are predicted by predict_classes,ConsensusPartition-method
.
if (FALSE) { data(golub_cola) m = get_matrix(golub_cola) set.seed(123) golub_cola_ds = consensus_partition_by_down_sampling(m, subset = 50, anno = get_anno(golub_cola), anno_col = get_anno_col(golub_cola), top_value_method = "SD", partition_method = "kmeans") }


Immunization Tracking
Home
Team
About
Login
Team
Van Jordan
Web Backend
Dave Irwin
Front End
Tatiana Faramarzi
Front End
Elvis Knapman
Front End
Trang Nguyen
Front End
Ryan Barnhill
User Interface
Zachary Peasley
User Interface


|
|
Vertex Class ReferenceList of all members.
Constructor & Destructor Documentation
| virtual Vertex::~Vertex |
( |
|
) |
[inline, virtual] |
|
Member Function Documentation
| void Vertex::AddPair |
( |
Pair * |
pp |
) |
[inline] |
|
| void Vertex::clearBase |
( |
|
) |
[inline] |
|
| void Vertex::clearBoundary |
( |
|
) |
[inline] |
|
| void Vertex::clearTextureBoundary |
( |
|
) |
[inline] |
|
| void Vertex::computeQuadric |
( |
|
) |
[private] |
|
| BOOL Vertex::getBase |
( |
|
) |
[inline] |
|
| BOOL Vertex::getBoundary |
( |
|
) |
[inline] |
|
| int Vertex::getNumPairs |
( |
|
) |
[inline] |
|
| BOOL Vertex::getTextureBoundary |
( |
|
) |
[inline] |
|
| BOOL Vertex::HasFaces |
( |
|
) |
|
|
| void Vertex::init |
( |
|
) |
[virtual] |
|
| void Vertex::initBoundary |
( |
|
) |
|
|
| void Vertex::RemovePair |
( |
Pair * |
pp |
) |
[inline] |
|
| void Vertex::setBase |
( |
|
) |
[inline] |
|
| void Vertex::setBoundary |
( |
|
) |
[inline] |
|
| void Vertex::setMultiplyVectors |
( |
|
) |
[private] |
|
| void Vertex::setTextureBoundary |
( |
|
) |
[inline] |
|
| void Vertex::updateFaces |
( |
Vertex * |
remaining |
) |
|
|
| void Vertex::updatePairCosts |
( |
Vertex * |
removed |
) |
|
|
Member Data Documentation
© 1999 - 2006 Intel Corporation. All rights reserved.
* Other names and brands may be claimed as the property of others.
|
|


--- layout: default ---
{{ site.title }} is a project to get a Linux shell environment running locally on your iOS device, using a usermode x86 emulator.
{{ site.title }} gives you the ability to run Linux applications and programs on iOS.
Alpine
You have access to the Alpine package manager in {{ site.title }}.
You can install programs with apk add <name>
.
The Keyboard
{{ site.title }}'s keyboard addition makes navigation easier.
Here's what the buttons do:
Join our Discord server if you have any questions or concerns, or you just want to chat!
There's also a subreddit for discussions and a Twitter.
You can also become a patron if you would like support {{ site.title }}.
Donations are very much appreciated, but will never be required; the app will always be completely free.


Plain string: Hello
With var: Hello {{name}}
Action: Hello
Action with var: Hello {{name}}
Plural: There is {{count}} bird
With ng-if: Hello
Change it!
Language


Snookes1516.github.io
Using Default Renderers in JavaServer Faces Technology. What’s New in JSF 2? Andy Schwartz's Weblog. JSF - Creating a Custom Renderer as an output delegator. We have created a special Java package, try that method call to see where it is on your machine. As the name implies, configuration is not required
School assignment calendar cmsd? Jsf writing custom renderer. NetBeans Plugin Portal, NetBeans IDE Plugins Repository. I was recently asked the question, "Is it possible to create a modular JSF application, where JAR-files act as plug-ins and allow xhtml views, images Questions and answers about using Flying Saucer for PDF output: How do I add custom or specific fonts? How do I specify fonts for a specific encoding. Jsf writing custom renderer to write about creative writing festival. Includ ing to macquari one metal for which runnr was acquired by renderer writing jsf custom. Jsf writing custom renderer - EducationHelper. In this tutorial we will show you a JSF Custom FacesBehavior TagHandler and Renderer. Our goal is to add a style attribute on different events.
Jsf 2 - How to render a composite component using a custom.
The Flying Saucer User's Guide - GitHub Pages. Creating Custom UI Components and Other Custom Objects. Determining Whether You Need a Custom Component or Renderer. Creating Custom UI Components and Other.
Using Default Renderers in JavaServer Faces Technology to Add AJAX . this requires you to be familiar with writing custom . custom renderer @misakiuehara :/ which one did you not do? i didn t do that character comparison essay and it was 50 points!
15.5 Delegating Rendering to a Renderer. Both MapComponent and AreaComponent delegate all of their rendering to a separate renderer. The section Performing Encoding. Writing Custom Facelet JSF Components Depressed Programmer. 8.9 HTML5-Friendly Markup - Java Platform, Enterprise. How to render a composite component using a custom renderer? With a custom renderer h: Browse other questions tagged jsf-2 composite-component renderer. 8.9 HTML5-Friendly Markup. When you want to produce user interface features for which HTML does not have its own elements, you can create a custom JavaServer Faces. This example demonstrates how to create and register a custom JSF Renderer. A component class defines the state and behavior of a UI component, whereas a Renderer.
How-to: Modular Java EE Applications Tom May 2, 2009 at 8:40 pm. Erik, You can specify a custom renderer for a standard jsf tag. I wrote one for the richfaces inplaceSelect. Welcome to the NetBeans Plugin Portal. Download, comment, and rate plugins provided by community members and third-party companies Essay Writing: Jsf writing custom renderer professional. 15.5 Delegating Rendering to a Renderer - Java Platform. With so many sources of information available on JSF 2, why bother with another overview? After all, this ground has already been covered quite extensively. JSF Custom FacesBehavior TagHandler and Renderer.
Creating Custom UI Components and Other Custom Objects. Die PC-FAQ enthält Antworten zu vielen Fragen rund um den PC, sowie Erklärungen der häufigsten Computerbegriffe und ein Wörterbuch.


Riga’s Vice-Mayor dismisses the board of Riga Central Market
by LETAVice-chairman of Riga City Council and shareholder Vadims Baraņņiks has dismissed the board of SIA Riga Central Market.
He explained this decision by saying that Friday, 15 November, is scheduled to hold a meeting of the management to discuss this year’s budget amendments, which were commented on by Riga City Council’s Property Department’s Commercial Operations Office in a negative light.
«The office does not like the board’s approach towards process of drawing up amendments. They also dislike the company is losing payers, because of which there may be losses for a second consecutive years. I received no clear indications how the board plans to resolve this situation,» claims Baraņņiks.
According to him, he offered to board members to assess their responsibility for their posts and submit resignations. However, in response to criticisms, board members left the meeting. As a result of this, the vice-mayor decided to dismiss the board.
Until now Artis Druvinieks was Riga Central Market’s board chairman. Board members included Kaspars Zauls and Valdis Karnītis.
Read also: Central Market’s rent contract signed during Ušakovs’s reign may have cost Riga millions
To replace them, new members of the board of Riga Central Market will include Aigars Apsītis as chairman and Guntars Grīnvalds, who is a board member in Riga’s Tourism Development Office, and Riga Central Market’s Internal Security Service manager Maksims Danovskis.


STAR WARS: THE EMPIRE STRIKES BACK (SPECIAL EDITION) A film review by Michael Redman Copyright 1997 Michael Redman
**** (out of ****)
Oddly enough, I had forgotten much about this middle film of the Star Wars trilogy so seeing it on the big screen again was an unexpected treat. The darkest and arguably the best of the films suffered from the second-act syndrome when you had to wait three years for the next movie. It works much better as a part of the whole.
Everything goes wrong in this one. The rebels are on the run. Han Solo is captured by the bad guys. Luke fails to complete his Jedi training, loses a hand and gains a father (You already knew that, right? I'm not ruining anything for you, right?) =97 none of which are good things. The ending is just the opposite of the triumph of "Star Wars". The Dark Side may just come out on top.
There aren't as many changes from the original as the Special Edition of the first film featured. A few fixes here and there, short new scenes and a punched-up soundtrack are fairly unobtrusive and make it easier to watch the film rather than be pulled into the "What's New" game.
Now I'm looking forward to "Return Of The Jedi" even with those terminally cute fuzzy things.
[This appeared in the 2/27/97 "Bloomington Voice", Bloomington, Indiana. Michael Redman can be reached at<EMAIL_ADDRESS>]
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


Automating Red Hat Enterprise Linux Patching with Ansible (Part 2 0f 2)
How we automated Red Hat Enterprise Linux OS patching to reduce time-to-production and human error, while improving compliance and risk management posture.
In this second installment of a two-part series, we’ll be going over Phase Two, the build out of standard pre- and post-patching automation, and Phase Three, the build out of application-specific pre- and post-patching automation. Click here for Phase One.
Status Report
With basic patching and reboots automated, a patching session for application environments without any special pre-patching and post-patching activities was reduced from 20 minutes per server, down to 6 minutes per server. This reclamation of time was a welcome improvement to the team, who did most of their patching on evening and weekends (while still spending time in the office during normal business hours).
Having both proven the concept and begun reaping the benefits of just one layer of patching automation, we were carried forward into automating all the standard pre- and post-patching activities every server in every environment was subject to.
Phase Two - Automate Standard Pre- and Post-patcing Activities
The second phase of the project centered around automating a standardized set of pre-patching and post-patching activitites that were universal to all application envionments. We found there was little to do for standard pre-patching that wasn’t already addressed in Phase One. Post-patching tasks, such as compiling a list of errata/patches installed, checking server uptime and emailing a notification to application teams that patching had completed were established as a standard requirement, and required executing directly on the remote hosts, not from the Ansible control node.
Before significant development could begin, a foundational directory structure needed to be defined. Each remote host managed by Ansible has the following directory tree, which corresponds to the home directory of the service account Ansible runs as.
post_update_conf.env and post_update.sh
The following code blocks demonstrate the standard post-patching activities that apply to all application environments. post_update_conf.env is the configuration file source for post_update.sh. An update report, including errata/packages updated, is generated and emailed. If the remote server has its own env_verify.sh script in /opt/encore/home/svc_encore, it will be called from post_update.sh.
/opt/home/svc_cls/post_update_conf.env
<EMAIL_ADDRESS>logFile="/opt/home/svc_cls/post_update.log"
workDir="/opt/home/svc_cls"
snowFlake="/opt/home/svc_cls/env_verify.sh" # snowFlake refers to the environment/
# system-specific validation script
/opt/home/svc_cls/post_update.sh
#!/bin/bash
# @brief script that runs at the end of patching (post-reboot if reboot is
# required) that checks uptime, running kernel, prints latest update
# actions, and performs various system checks defined for a given
# environment
# Load config file
source /opt/home/svc_cls/post_update_conf.env
###########################
# Begin Functions #
function log_msg {
current_time=$(date "+%Y-%m-%d %H:%M:%S.%3N")
log_level=$1
# all arguments except for the first one, since that is the level
log_msg="${@:2}"
echo "[$current_time] $log_level - $log_msg" >> "$logFile"
}
function log_error {
log_msg "ERROR" "$@"
}
Automating Red Hat Enterprise Linuc Patching with Ansible (Part 2 0f 2)
function log_info {
log_msg "INFO " "$@"
}
function log_debug {
log_msg "DEBUG" "$@"
}
function compare_errata {
# Function code adapted from code by R. Paxton
(yum updateinfo list installed | tail -n +3 | grep -v updateinfo | sort > "$workDir"/.current.errata)
#Initialize last errata info if none (display full errar list)
if [[ ! -s "$workDir"/.last.errata ]]; then
touch "$workDir"/.last.errata
fi
# Compare last errata to current errata and only log changes.
comm -3 "$workDir"/.last.errata "$workDir"/.current.errata > "$workDir"/.new.errata
mv -f "$workDir"/.current.errata "$workDir"/.last.errata
# Massage new errata list
if [[ ! -s "$workDir"/.new.errata ]]; then
echo -e "\n========== new errata ===========\n" > "$workDir"/.new.errata
echo "No new errata applied to this host since last update." >> "$workDir"/.new.errata
else
# Remove leading whitespace from comm
sed -i 's/^\s*//' "$workDir"/.new.errata
sed -i '1s/^/\n========== new errata ===========\n\n/' "$workDir"/.new.errata
fi
# Get last yum history info
lastUpdate=$(yum history | grep 'svc_cls\|balcorn' | head -1 | awk '{print $1}')
# Massage update history info
yum history info "$lastUpdate" > "$workDir"/.yum.history
echo -e "\n========== last update history ===========\n" >> "$workDir"/.new.errata
cat "$workDir"/.yum.history >> "$workDir"/.new.errata
cat "$workDir"/.new.errata >> "$logFile"
}
# End Functions #
###########################
###########################
# Begin Body #
errorCheck=0
cat /dev/null > "$logFile"
log_info "========================================================"
log_info "= Post-update status for $HOSTNAME"
log_info "========================================================"
log_info "Running Kernel: "
result=$(uname -r)
log_info "${result}"
log_info "System Uptime: "
result=$(uptime)
log_info "${result}"
log_info ""
log_info "========================================================"
log_info "= Update history:"
log_info "========================================================"
# Collect and clean up update information
compare_errata
# Execute environment/system-specific validation script if it exists
if [ -f "$snowFlake" ]; then
. "$snowFlake"
errorCheck=$?
fi
# Final status of healthchecks - prepend to top of logFile
if [ ${errorCheck} != 0 ]; then
statusMsg="STATUS: ERROR: Something went wrong. Please review results"
sed -i "1s/^/$statusMsg\n\n/" "$logFile"
else
statusMsg="STATUS: OK"
sed -i "1s/^/$statusMsg\n\n/" "$logFile"
fi
/bin/mail -s "Post-patching report for $HOSTNAME" "$email" < "$logFile"
Status Report
By the time patching automation efforts reached the conclusion of Phase Two, roughly 75% of our customer’s RHEL 6 and 7 server infrastructure was being patched fully through Ansible, including sending communication emails and post-patching reports. This cleared the way for the final, albeit most complex push: developing and implementing the automation forcustom pre- and post-patching activities. These custom activities were addressed on a per application environment basis and required significant coordination with our customer’s application teams.
Phase Three - Automate Application/Host-specific Pre- and Post-patching Activities
In Phase Three, application environments with unique pre- and post-patching requirements were addressed. For example, complex pre- patching actions, such as stopping services on web and application servers prior to stopping database services were incorporated. Post-patching validation for application environments where services were required to come up in a prescribed order and validated on one remote host before moving on to the next was also implemented where needed.
The customized pre- and post-patching activities are intended to compliment and extend (and not replace) the standard activities implemented during Phase Two.
pre_update.sh
The following example code block demonstrates stopping the PPM daemon, and validating that the process is down before proceeding. An error is logged if there are issues.
/opt/home/svc_cls/pre_update.sh
#!/bin/bash
# @brief actions required to be conducted before updates are applied
# and/or servers are rebooted.
logFile="/tmp/pre_update.log"
###########################
# Begin Functions #
function log_msg {
current_time=$(date "+%Y-%m-%d %H:%M:%S.%3N")
log_level=$1
# all arguments except for the first one, since that is the level
log_msg="${@:2}"
echo "[$current_time] $log_level - $log_msg" >> $logFile
}
function log_error {
log_msg "ERROR" "$@"
}
function log_info {
log_msg "INFO " "$@"
}
function log_debug {
log_msg "DEBUG" "$@"
}
# End Functions #
###########################
###########################
# Begin Body #
errorCheck=0
cat /dev/null > $logFile
log_info "========================================================"
log_info "= Pre-update status for $HOSTNAME"
log_info "========================================================"
# Stop PPM
(su - ppmadmin -c 'cd /home/ppmadmin/eppm_staging/bin && /home/ppmadmin/eppm_staging/bin/kStop.sh -now -user admin -password admin - name eppm_stagingu1')
result=$(ps -ef | grep -i DNAME | grep -v grep | wc -l)
count=0
# if DNAME process is still running, PPM has not stopped.
while [ "$result" != 0 ] && [ $count -lt 9 ]; do
sleep 20
result=$(ps -ef | grep -i DNAME | grep -v grep | wc -l)
count=$((count + 1))
done
# if PPM hasn't stopped by now, manual intervention/review will be necessary.
if [ "$result" != 0 ] && [ $count -ge 9 ]; then
log_error "PPM has NOT stopped"
errorCheck=1
else
log_info "PPM has stopped successfully"
fi
# Final status of healthchecks
if [ ${errorCheck} != 0 ]; then
statusMsg="STATUS: ERROR: Something went wrong. Please review results"
sed -i "1s/^/$statusMsg\n\n/" $logFile
else
statusMsg="STATUS: OK"
sed -i "1s/^/$statusMsg\n\n/" $logFile
fi
env_verify.sh
In this example code block, the PPM daemon is started manually by the script. The application team was not comfortable with configuring PPM to come up on boot. If the application fails to start, error information is returned to post_update.sh
, from which env_verify.sh was called.
/opt/home/svc_cls/env_verify.sh
#!/bin/bash
# @brief environment-/system-specific script to be called from post_update.sh
# returns 0 or 1 value to $errorCheck in post_update.sh for overall
# status to be emailed out upon script conclusion. This script
# will contain environment-specific verification commands.
###########################
# Begin Body #
errorCheck=0
log_info "========================================================"
log_info "= Environment-specific starts and checks"
log_info "========================================================"
# Start PPM
(su - ppmadmin -c 'cd /home/ppmadmin/eppm_staging/bin && /home/ppmadmin/eppm_staging/bin/kStart.sh -name eppm_stagingu1')
result=$(grep -c '*** Ready!' /home/ppmadmin/eppm_staging/server/eppm_stagingu1/log/serverLog.txt)
count=0
# Watch PPM serverLog.txt file for a couple minutes to make sure it comes up before continuing
while [ "$result" -lt 1 ] && [ "$count" -lt 9 ]; do
sleep 20
result=$(grep -c '*** Ready!' /home/ppmadmin/eppm_staging/server/eppm_stagingu1/log/serverLog.txt)
count=$((count + 1))
done
# If PPM hasn't started by now, manual intervention/review will be necessary
if [ "$result" -lt 1 ] && [ "$count" -ge 9 ]; then
log_error "PPM has NOT started"
errorCheck=1
else
log_info "PPM has started successfully"
fi
return $errorCheck
Conclusion
After completing all three phases of automation, patching for 95% of our customer’s application environments is fully automated. The only effort required is to execute the playbooks during scheduled patching windows. The remaining 5% of environments that are not fully automated are made up of special cases, or are in isolated network segments it was deemed to costly to pursue full automation of; however, even in those cases, pre-patching and post-patching activities have been scripted to the highest degree possible.
Prior to this project, manual patching took up to 20 minutes per server, and an administrator could juggle up to two servers at a time, patching up to 6 servers per hour. Leveraging Ansible to automate patching and its related tasks takes on average 6 minutes per server. Ansible is currently configured to patch up to 5 remote hosts simultaneously - up to 30 servers per hour or a 500% average performance increase! observed over the past 5 months.
While we’re constantly looking for ways to improve patching automation, and incorporate greater functionality and reporting where it makes sense to do so, we’re absolutely thrilled with the results we’ve seen from this initial project. Reach out to us if you’d like to learn more about how Encore Technologies could help you realize similar benefits to your RHEL/Linux patching process.
-Brian
Share this post
Twitter
Google+
Facebook
Reddit
LinkedIn
StumbleUpon
Email


--- layout: landing description: >- We have both interior and exterior services. Call for a quote today! css: | .services-list { text-align: center; padding: 0; } .services-list li { line-height: 1.5rem; } .services-list li:before { content: ""; } --- Services Interior Exterior We have a variety of services available. Regardless if the job is residential or commercial, our crews can service large or small tasks. Looking for information on our interior or exterior services? Follow one of the links above! Call for a quote today {% include address.html %}
We have a variety of services available. Regardless if the job is residential or commercial, our crews can service large or small tasks.
Looking for information on our interior or exterior services? Follow one of the links above!


Need RedEdge, but you need it customized?
Well, you're in luck! Welcome to RedEdge Community, the community version of the Discord.JS based bot, RedEdge.
How about these features:
This link will redirect you to the Releases page of the project.


{% extends "base.html" %} {% load missions %} {% block title %}Spacelog: space exploration stories from the original transcripts{% endblock %} {% block content-class %}homepage{% endblock %} {% block header %}
Read the stories of early space exploration from the original transcripts. Now open to the public in a searchable, linkable format.
{% include "_base/stl.html" %} {% if quote %} {% endif %}


| Reason | 2013-2014 | 2014-2015 | 2015-2016 |
|---|---|---|---|
| Administrative Offense | 0% | 0% | 1.78% |
| Cell Phone | 9.05% | 10.46% | 9.55% |
| Defective Lights | 8.99% | 8.45% | 8.52% |
| Display of Plates | 2.95% | 2.62% | 2.49% |
| Equipment Violation | 0.35% | 0.29% | 0.26% |
| Moving Violation | 7.53% | 7.31% | 8.31% |
| Other | 15.97% | 16.96% | 4.1% |
| Registration | 9.36% | 9.46% | 9.14% |
| Seatbelt | 4.11% | 3.7% | 3.86% |
| Speed Related | 26.82% | 25.95% | 28.33% |
| STC Violation | 0% | 0% | 8.39% |
| Stop Sign | 5.81% | 5.8% | 6.76% |
| Suspended License | 1.33% | 1.4% | 0% |
| Traffic Control Signal | 6.76% | 6.72% | 6.87% |
| Unlicensed Operation | 0% | 0% | 0.54% |
| Window Tint | 0.98% | 0.89% | 1.1% |


My Porfolio
My Portfolio
About
Skills
Projects
Education
Education
Moringa School
Software Development
University of Kabianga
Finance and Banking
Kapropita Girls High School


Shapoorji Pallonji plans stake sale in Eureka Forbes
by Our BureauForbes & Company Ltd, a subsidiary of Shapoorji Pallonji And Company Private Limited, on Tuesday announced their plans to unlock value of its subsidiary Eureka Forbes Limited. This may include listing, dilution/sale or combination thereof of Eureka Forbes.
Forbes & Company announced that it’s Board had authorized the management of the Company to evaluate a scheme of arrangement and other appropriate mechanisms to enable an eventual listing of Eureka Forbes.
Eureka Forbes' product portfolio encompasses water purifiers, vacuum cleaners, air purifiers and home security solutions that are sold in over 35 countries globally.
Aquaguard, which is recognised as a Superbrand, is the flagship water purifier brand of Eureka Forbes.


Hello Kubevirt On Minikube
In this blog post, we will demonstrate the process for creating and managing virtual machines in Kubernetes with KubeVirt. We will also go through the process of installing Minikube and KubeVirt on a Fedora 28 workstation.
Install KVM
MiniKube will create a single node Kubernetes cluster in a KVM virtual machine on our Fedora host. KVM is also the virtualization technology used by KubeVirt so we have to make sure that the host is configured to support nested virtual machines. Fedora does not have that feature enabled by default.
# install packages
$ sudo yum install libvirt-daemon-kvm qemu-kvm
# enable nested virtualization
# substitute 'kvm_intel' with 'kvm_amd' if your system has an AMD processor
$ sudo modprobe -r kvm_intel
$ sudo vi /etc/modprobe.d/kvm.conf
# uncomment 'options kvm_intel nested=1' and save
$ sudo modprobe kvm_intel
#verify nested virtualization enabled
$ cat /sys/module/kvm_intel/parameters/nested
Y
Install KVM2 driver for Minikube
Minikube requires a special driver to manage Docker Machine VMs running in KVM. KVM2 is the latest iteration of the driver. Read more about it here
# install driver to /usr/local/bin
$ curl -LO https://storage.googleapis.com/minikube/releases/latest/docker-machine-driver-kvm2 && chmod +x docker-machine-driver-kvm2 && sudo mv docker-machine-driver-kvm2 /usr/local/bin/
Install Minikube
Minikube is responsible for creating and managing a local single-node Kubernetes cluster. It is installed as a single executable.
#install minikube to /usr/local/bin
$ curl -Lo minikube https://storage.googleapis.com/minikube/releases/latest/minikube-linux-amd64 && chmod +x minikube && sudo mv minikube /usr/local/bin/
Start Minikube
$ minikube start --vm-driver kvm2 --network-plugin cni
Install kubectl
Now that we have a Kubernetes cluster running, we need some way to communicate with it. That is where the kubectl CLI comes in.
# install kubectl to /usr/local/bin
$ curl -Lo kubectl https://storage.googleapis.com/kubernetes-release/release/v1.10.0/bin/linux/amd64/kubectl && chmod +x kubectl && sudo mv kubectl /usr/local/bin/
# try out the cli
# should see similar output
$ kubectl get all
NAME TYPE CLUSTER-IP EXTERNAL-IP PORT(S) AGE
kubernetes ClusterIP <IP_ADDRESS> <none> 443/TCP 5m
You may be wondering how kubectl knows where to look for the Kubernetes API endpoint. minikube start
actually takes care of creating the kubectl configuration file. Take a look at ~/.kube/config
Deploy KubeVirt
Get KubeVirt components running on the Kubernetes cluster.
$ kubectl create -f https://github.com/kubevirt/kubevirt/releases/download/v0.7.0/kubevirt.yaml
# watch for Kubevirt components to start (bebin with 'virt-')
# may take awhile as containers are downloaded and started
$ watch kubectl get --all-namespaces pods
# eventually output should look something like this (everything with Running status)
NAMESPACE NAME READY STATUS RESTARTS AGE
kube-system etcd-minikube 1/1 Running 0 16m
kube-system kube-addon-manager-minikube 1/1 Running 0 15m
kube-system kube-apiserver-minikube 1/1 Running 0 15m
kube-system kube-controller-manager-minikube 1/1 Running 0 16m
kube-system kube-dns-86f4d74b45-ppp5p 3/3 Running 0 16m
kube-system kube-proxy-rjkxl 1/1 Running 0 16m
kube-system kube-scheduler-minikube 1/1 Running 0 16m
kube-system kubernetes-dashboard-5498ccf677-8zmnk 1/1 Running 0 16m
kube-system storage-provisioner 1/1 Running 0 16m
kube-system virt-api-7797f95869-dwrrc 1/1 Running 0 2m
kube-system virt-api-7797f95869-fqnhk 1/1 Running 1 2m
kube-system virt-controller-69cc6b4897-nlffm 1/1 Running 0 2m
kube-system virt-controller-69cc6b4897-xsxmt 1/1 Running 0 2m
kube-system virt-handler-f7str 1/1 Running 0 2m
Install virtctl
Virtctl is the CLI for creating and managing KubeVirt virtual machines.
# install virtctl to /usr/local/bin
$ curl -Lo virtctl https://github.com/kubevirt/kubevirt/releases/download/v0.7.0/virtctl-v0.7.0-linux-amd64 && chmod +x virtctl && sudo mv virtctl /usr/local/bin
Create a VM
Apply manifest for VM. If you’re curious, download the manifest file locally and take a look.
$ kubectl apply -f https://raw.githubusercontent.com/kubevirt/demo/master/manifests/vm.yaml
# check that VM successfully created
$ kubectl get vms
NAME AGE
testvm 7s
# for more detailed info, run
$ kubectl get vms -o yaml testvm
Start a VM
Time to try out virtctl.
$ virtctl start testvm
# wait for VM to be running
$ watch kubectl get pods
# confirm with kubectl
$ kubectl get vmis
NAME AGE
testvm 4s
# for more detailed info
$ kubectl get vmis -o yaml testvm
Connect to VM
The VM is running CirrOS, which is “a Tiny OS that specializes in running on a cloud.” Don’t expect anything fancy. Look here for more info on CirrOS
$ virtctl console testvm
# note escape sequence of '^]'
# login with creds provided and poke around
# you are connected to a VM running in Kubernetes! Pretty cool!
# 'exit' to logout
# quit virtctl by providing escape sequence '^]
Stop a VM
$ virtctl stop testvm
# wait for termination to complete
$ watch kubectl get pods
# confirm with kubectl
$ kubectl get vmis
No resources found.
Delete a VM
$ kubectl delete vms testvm
# confirm with kubectl
$ kubectl get vms
No resources found.
Nest Steps
Take a look at the user guide and get involved with the community.


Reschedule your citizenship appointment
The online rescheduling tool is no longer available.
You can reschedule your appointment by mail or online through our web form.
The online rescheduling tool is no longer available.
You can reschedule your appointment by mail or online through our web form.


WITNESS LIST Economic Development Committee April 1, 1997-10:30A HB 1639 For: Beardall, William (Appleseed Advocacy Fund) Bresette, Patrick (CPPP) Levy, Rick (Texas AFL-CIO) Pinkus, David (Small Business United) On: Dyson, Lela (Texas Workforce Comm.) HB 2400 For: Garcia, Domingo Rep. (self) Levy, Rick (Texas AFL-CIO) Against: Harris, Dane (TABCC) Howden, Robert (NFIB) Knepp, Christopher (Employment Law Council) Pinkus, David (Small Business United) On: McNair, Randy (A.G.'s Office) HB 2426 For: Bresette, Patrick (CPPP) Coleman, Garnet Rep. (self) HB 2651 For: Rangel, Irma Rep. (self) HB 2915 For: Chavez, Adriana (State Employees Union) Jimenez, Enrique (State Employees Union) Levy, Rick (Texas AFL-CIO) Sherr, Paul (State Employees Union) On: Melina Raab, Ted (Workforce Oversight Com) Perdue, David (TWC Commissioner) HB 2916 For: Donoho, Travis (State Employees Union) Sherr, Paul (State Employees Union) On: Kamm, Robert (TABCC) Melina Raab, Ted (Workforce Oversight Com) Parmer, Carol (Texas Workforce Comm.) Perdue, David (TWC Commissioner) HB 3116 For: Beardall, William (Appleseed Advocacy Fund) Donoho, Travis (State Employees Union) Levy, Rick (Texas AFL-CIO) Simpson, Dee (AFSCME) HB 3512 On: Perdue, David R. (TWC Commissioner) SB 213 For: Bresette, Patrick (CPPP) Coleman, Garnet Rep. (self) Local Job Training Initiatives On: Britt, Gerald Reverand (Dallas Area Interfaith) Guevara, Alfonso Father (Valley Interfaith) Ramirez, Virginia (C.O.P.S.) White, Thomas St. C. (Metro Alliance)


The game starts on January 1.
Get to December 31. to win!
You play against a semi-random AI and you can choose any day within the same month or the same day in a later month.
Example
If the current date is July 16. – You can either select the 16. of any later month or any later day in July!


{% extends '_base.html' %} {% load render_table from django_tables2 %} {% load form_helpers %} {% block title %}Record Import{% endblock %} {% block content %}
| Field | Description | Example |
|---|---|---|
| Zone name | Name of the zone the record belongs to | foo.net |
| Name | Host name, @ for origin | www |
| Type | Record type | AAAA |
| Priority | Priority level (optional) | 30 |
| Address | IP address if value is an IP address, in AAAA records for instance | <IP_ADDRESS>/16 |
| Value | Text value else, in CNAME records for instance | foo.net |
| Description | Description (optional) | Backend API server |
foo.net,www,AAAA,,<IP_ADDRESS>/16,,Backend API server


Nokia 7.2 selected as an honoree at the CES 2020 Innovation Awards
by MarinCES published the list of Honorees and Best of Innovation awarded devices for the CES 2020 awards. The good news is that Nokia 7.2 has been selected as a CES 2020 Innovation Awards honoree for its great design and camera and engineering qualities. Nokia 7.2 wasn’t alone on the list and the competition was pretty tough. CES also awarded Asus Rog Phone II, LG G8X ThinQ and others with the title of CES 2020 Awards honoree. The highest-rated product in the category of Mobile phones and accessories was given the Best of Innovation award. This year’s laureates in the category are Samsung with its great Galaxy Note 10+5G and OnePlus with its 7 Pro smartphone.
It is good for the Nokia brand to be given the Honoree title since that will raise the visibility of the brand and help it spread at the US market. But, imagine if Nokia 7.2 came with a newer processor, 18W charger and maybe a Gorilla 5 glass, that would make this phone the best in the class. Anyway, this means (or maybe even confirms) that we’ll be seeing Nokia Mobile at CES2020 which is not that far away.
Check the list of all the honorees and categories here.


--- layout: page title: Books ---
The bestselling authors of the classic Difficult Conversations teach us how to turn evaluations, advice, criticisms, and coaching into productive listening and learning
The world's most popular job-search book is updated for 2015 to tailor its long-trusted guidance with up-to-the-minute information and advice for today's job-hunters and career-changers.
Visit my Goodreads profile for a complete look at my reading lists


Papers
AiRS: A Large-Scale Recommender System at NAVER News
Hongjun Lim†, Yeon-Chang Lee†, Jin-Seo Lee, Sanggyu Han, Seunghyeon Kim, Yeongjong Jeong, Changbong Kim, Jaehun Kim, Sunghoon Han, Solbi Choi, Hanjong Ko, Dokyeong Lee, Jaeho Choi, Yungi Kim, Hong-Kyun Bae, Taeho Kim, Jeewon Ahn, Hyun-Soung You, and Sang-Wook Kim
In proc. of the IEEE International Conference on Data Engineering (ICDE), 2022
(†These authors contributed equally.)
On the Overlooked Significance of Underutilized Contextual Features in Recent News Recommendation Models
Sungmin Cho, Hongjun Lim, Keunchan Park, Sungjoo Yoo and Eunhyeok Park
arXiv preprint arXiv:2112.14370, 2021
Detecting Incongruity Between News Headline and Body Text via a Deep Hierarchical Encoder
Seunghyun Yoon, Kunwoo Park, Joongbo Shin, Hongjun Lim, Seungpil Won, Meeyoung Cha, and Kyomin Jung
In proc. of the AAAI Conference on Artificial Intelligence (AAAI), 2019
Understanding Comments on Social News: Analyzing Comment-reading Behavior and Comparing Textual Similarity on Facebook News Posts
Hongjun Lim, Meeyoung Cha, and Donghee Yvette Wohn
KAIST, 2018
Detecting Multiclass Emotions from Labeled Movie Scripts
Jaewoo Kim, Yui Ha, Seungchae Kang, Hongjun Lim, and Meeyoung Cha
In proc. of the IEEE International Conference on Big Data and Smart Computing (BigComp), 2018
Changing News Media Landscape in South Korea
Hongjun Lim, Choongho Chung, Jihee Kim, Juho Kim, Sue Moon, and Meeyoung Cha
In proc. of the Fourth Workshop on Social News On the Web (SNOW) co-located with the World Wide Web (WWW) Conference, 2017
NetSet: A Systematic Integration of Visualization for Analyzing Set Intersections with Network
Heungseok Park, Hongjun Lim, Wonjae Lee, and Kyungwon Lee
In proc. of the IEEE Pacific Visualization Symposium (PacificVis), 2017
NetSet: Interactive Visualization for Analyzing Sets in Large Networks
Heungseok Park, Hongjun Lim, and Kyungwon Lee
In proc. of the Symposium on Visualization in Data Science (VDS) co-located with the IEEE VIS Conference, 2015
Patents
Method and System for Managing Total Financial Information
Myeongill Shin, Yonghyun Lee, and Hongjun Lim
Korea Patent No. 10-2016-0048820
Apparatus and Method for Interactive Visualization for Analyzing Sets in Large Networks
Hongjun Lim, Heungseok Park, and Kyungwon Lee
Korea Patent No. 10-2015-0148286


---
layout: page
title: Code
---
here are some things I built.
{% for project in site.projects %}
-
{{ project.title }}
> {{ project.description }}
{% endfor %}
{% for project in site.projects %}
> {{ project.description }}
{{ project.content }}
close
{% endfor %}


Email Marketing
Email-Marketing
Email Marketing is one of the simplest modes of communication for tech savvies but you can optimize it to market your product & services.
It usually involves using email to send advertisements, request business, or solicit sales or donations, and is meant to build loyalty, trust, or brand awareness.
Marketing emails can be sent to a purchased lead list or a current customer database. The term usually refers to sending email messages with the purpose of enhancing a merchant's relationship with current or previous customers, encouraging customer loyalty and repeat business, acquiring new customers or convincing current customers to purchase something immediately, and sharing third-party ads.
Email marketing helps you connect with your audience to promote your brand and increase sales. You can do a lot of things with emails, like sell products, share some news, or tell a story.
Email is important because it creates a fast, reliable form of communication that is free and easily accessible. They allow people to foster long-lasting, long-distance communication.
At its most basic level, email marketing is the use of email to promote your business. It is used to cultivate relationships with potential customers, keep current customers informed and updated on your brand, offer coupons to encourage customer loyalty, and more!
It is a direct form of marketing, similar to marketing through snail mail, but email marketing is much more efficient for your wallet and for the environment since it’s totally paperless!
Some people think email marketing is outdated, but they couldn’t be more wrong. Email marketing has been utilized since shortly after the birth of the Internet. Email allows you to reach a wide and willing audience while also keeping costs relatively low, leading to positive revenues. Email drives more traffic to your company website


Pull Requests are welcome. But v2 of Lightbox is in Maintenance Mode. No new features are planned. See the Roadmap. PRs submitted will still be reviewed and kept open for others to utilize.
Pull Requests are welcome. But v2 of Lightbox is in Maintenance Mode. No new features are planned. See the Roadmap.
PRs submitted will still be reviewed and kept open for others to utilize.


The best areas in the City of Chicago to live with a family including young children while having convenient access to transportation and other public services such a public parks and libraries.
Suitability map for an alternate Dakota Access Pipeline route.
Spatial analysis of the Chicago Public Schools' Safe Passages program. Violent crime reduction effectiveness.
"safe areas" or areas with a significant reduction of violent crimes after the implementation of the Chicago Public Schools Safe Passage program. Intersection of .5 mile buffers around the current safe passages and the schools they serve.
User-definable ArcGIS Tool: Coordinate system and Clipping feature. Script generated with IDLE (version 2.7.10). Python's Integrated Development Environment.


Night
mare
Home
Peoples
Exit
bla bla bla
unknown
unknown
unknown
unknown
unknown
unknown
unknown
unknown
unknown
unknown
unknown
unknown
unknown
unknown
unknown


Sponsor
Since 2010, this material is based upon work supported by the National Science Foundation under Grant No. NSF-OCI-1032861. Any opinions, findings and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the National Science Foundation (NSF). Until 2006, this material was based upon work supported by the National Science Foundation under Grant No. ASC-9313958, NSF-0444486 and DOE Grant No. DE-FG03-94ER25219. Any opinions, findings and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the National Science Foundation (NSF) or the Department of Energy (DOE).
Contributing institutions
-
University of Rousse; Bulgaria
-
University of Zagreb; Croatia
-
Danish Computing Center for Research and Education; Denmark
-
Technical University of Denmark; Denmark
-
Fernuniversitaet Hagen; Germany
-
Technical University Aachen; Germany
-
IBM ECSEC; Italia
-
Universidad Jaime I; Spain
-
Umeå University; Sweden
-
ETH Zurich; Switzerland
-
Numerical Algorithms Group Ltd. (NAG); UK
-
University of Manchester; UK
-
Cray Research, Inc; US
-
Duke University; US
-
Georgia Institute of Technology; US
-
IBM Watson Research Center; US
-
Intel Corp., US
-
Kitware, US
-
Lawrence Berkeley National Laboratory; US
-
Oak Ridge National Laboratory; US
-
Randolph-Macon College; US
-
Rice University; US
-
University of California, Berkeley; US
-
University of California, Davis; US
-
University of Colorado Denver; US
-
University of Kansas; US
-
University of Kentucky; US
-
University of Tennessee; US
-
University of Washington; US
Contributor list
-
Ed Anderson (Cray Research Inc. and University of Tennessee; US),
-
Chuck Atkins (Kitware; US),
-
Zhaojun Bai (University of Kentucky and University of California, Davis; US),
-
V. A. Barker (Technical University of Denmark; Denmark),
-
Chris Bischof (Technical University Aachen; Germany),
-
Susan Blackford (University of Tennessee; US),
-
Zvonomir Bujanovic (University of Zagreb; Croatia),
-
Karen Braman (University of Kansas; US),
-
Ralph Byers (University of Kansas; US),
-
Jim Demmel (University of California, Berkeley; US),
-
Inderjit Dhillon (University of California, Berkeley; US),
-
Jack Dongarra (University of Tennessee and Oak Ridge National Laboratory; US),
-
Zlatko Drmac (University of Zagreb; Croatia),
-
Peng Du (University of Tennessee; US),
-
Jeremy Du Croz (Numerical Algorithms Group Ltd. (NAG); UK),
-
Mark Fahey (University of Kentucky; US),
-
Anne Greenbaum (University of Washington; US),
-
Ming Gu (University of California, Berkeley; US),
-
Fred Gustavson (IBM Watson Research Center; US),
-
Deaglan Halligan (University of California, Berkeley; US),
-
Sven Hammarling (Numerical Algorithms Group Ltd. (NAG); UK),
-
Yozo Hida (University of California, Berkeley; US),
-
Nick Higham (University of Manchester; UK),
-
Bill Hoffman (Kitware; US),
-
Intel MKL team (Intel Corp.; US),
-
Bo Kagström (Umeå University; Sweden),
-
Daniel Kressner (ETH Zurich; Switzerland),
-
William Kahan (University of California, Berkeley ; US),
-
Julie Langou, (University of Tennessee; US),
-
Julien Langou (University of Colorado Denver; US),
-
Craig Lucas, (University of Manchester and NAG Ltd., UK;),
-
Piotr Luszczek, (University of Tennessee; US),
-
Ren-Cang Li (University of California, Berkeley; US),
-
Xiaoye Li (Lawrence Berkeley National Laboratory; US),
-
M. Marinova (Danish Computing Center for Research and Education; Denmark),
-
Osni Marques (Lawrence Berkeley National Laboratory; US),
-
Peter Mayes (IBM ECSEC; Italia),
-
Alan McKenney (no affiliation),
-
Beresford Parlett (University of California, Berkeley; US),
-
Antoine Petitet (University of Tennessee; US),
-
Peter Poromaa (Umeå University; Sweden),
-
Enrique Quintana-Ortí (Universidad Jaime I; Spain),
-
Gregorio Quintana-Ortí (Universidad Jaime I; Spain),
-
Giuseppe Radicati (IBM ECSEC; Italia),
-
Huan Ren (University of California, Berkeley; US),
-
Jason Riedy (University of California, Berkeley; US; and Georgia Institute of Technology; US),
-
Jeff Rutter (University of California, Berkeley; US),
-
Edward Smyth (Numerical Algorithms Group Ltd. (NAG); UK),
-
Danny Sorensen (Rice University; US),
-
Ken Stanley (University of California, Berkeley; US),
-
Xiaobai Sun (Duke University; US)
-
Brian Sutton (Randolph-Macon College; US),
-
Françoise Tisseur (University of Tennessee; US),
-
Robert A. van de Geijn (University of Texas at Austin; US),
-
Kresimir Veselic (Fernuniversitaet Hagen; Germany)
-
Christof Voemel (University of California, Berkeley and Lawrence Berkeley National Laboratory; US).
-
Meghanath Vishvanath (University of California, Berkeley; US),
-
David Vu (University of California, Berkeley; US),
-
Jerzy Waśniewski (Technical University of Denmark, Denmark),
-
P. Yalamov (University of Rousse; Bulgaria).
Thanks for bug-report/patches/suggestions to:
-
LAPACK 3.3:
Allin Cottrell (Wake Forest University), Mathew Cross (NAG), Zlatko Drmac (University of Zagreb, Croatia), Victor Liu, (Stanford University, Palo Alto), the Numpy team, Bart Oldeman, (Montreal, Quebec) Stephan Ripke (Broad Institute, Boston), Ake Sandgren (HPC2N, Umea University), Clint Whaley (University of Texas at San Antonio).
-
LAPACK 3.2.2:
Marco Atzeri Guy Bencteux (CERMICS, France) Michael Chuvelev (Intel) Mathew Cross (NAG) William Gandler (NIH/CIT) Tim Hopkins "Jan" Ondra Kamenik Alexander V. Kobotov (Intel) Ashutosh Mahajan (Mathematics and Computer Science Division of Argonne National Labs) Lawrence Mulholland (NAG) Pat Quillen (MathWorks) Paul Roberts (NAG) Vasile Sima (National Institute for Research & Development in Informatics, Romania) Sergei Steshenko Kevin Wadleigh Zbigniew
-
LAPACK 3.2.1:
Guy Bencteux (CERMICS, France) Edouard Canot (IRISA, France) Michael Chuvelev (Intel) "faber80" Bruno Pincon (ESIAL, France) Vasile Sima (National Institute for Research & Development in Informatics, Romania) Christof Voemel Daniel Waggoner Igor Zhuravlov
-
LAPACK 3.2:
Patrick Alken (University of Colorado at Boulder, USA), Penny Anderson (MathWorks, MA, USA), Michael Baudin (Scilab, FR), Bobby Cheng (MathWorks, MA, USA), Michael Chuvelev (Intel, USA), Phil DeMier (IBM, USA), Michel Devel (UTINAM institute, University of Franche-Comte, UMR CNRSA, FR), Alan Edelmann (Massachusetts Institute of Technology, MA, USA), Carlo de Falco and all the Octave developers, Fernando Guevara (University of Utah, UT, USA), Christian Keil, Zbigniew Leyk (Wolfram, USA), Cleve Moler (MathWorks, MA, USA), Joao Moreira de Sa Coutinho, Lawrence Mulholland (NAG, UK), Duncan Po (MathWorks, MA, USA), Mick Pont (NAG, UK), Pat Quillen (MathWorks, MA, USA), Clint Whaley (University of Texas at San Antonio, TX, USA), Mikhail Wolfson (MIT, USA), Vittorio Zecca.
-
LAPACK 3.1.1:
Tobias Burns Daniel Kressner Michael Wimmer
-
LAPACK 3.1:
Eduardo Anglada (Universidad Autonoma de Madrid, Spain) David Barnes (University of Kent, England) Alberto Garcia (Universidad del Pais Vasco, Spain) Tim Hopkins (University of Kent, England) Javier Junquera (CITIMAC, Universidad de Cantabria, Spain) Mathworks: Penny Anderson, Bobby Cheng, Pat Quillen, Cleve Moler, Duncan Po, Bin Shi, Greg Wolodkin (MathWorks, USA) George McBane (Grand Valley State University, USA) Matyas Sustik (University of Texas at Austin, USA) Michael Wimmer (Universität Regensburg, Germany) Simon Wood (University of Bath, UK) and in more generally all the R developers
Principal Investigators
-
Jim Demmel (University of California, Berkeley; US; Since 1992),
-
Jack Dongarra (University of Tennessee and Oak Ridge National Laboratory; US; Since 1992),
-
Julien Langou (University of Colorado Denver; US; Since 2006).

A SRC/dsposv.f A SRC/zcposv.f A SRC/dsgesv.f A SRC/zcgesv.f
Jacobi SVD Algorithm — SGEJSV & SGESVJ
-
Zlatko Drmac of the University of Zagreb
-
Kresimir Veselic of the Fernuniversitaet Hagen
SGEJSV SGESVJ SGSVJ0 SGSVJ1
Divide & Conquer SVD Algorithm — SGESDD
Linear Least Squares solver based on Divide & Conquer SVD Algorithm — SGELSD
-
Ming Gu, Computer Science Division, University of California at Berkeley, US
-
Huan Ren, Computer Science Division, University of California at Berkeley, US
SBDSDC SLASD0 SLASD1 SLASD2 SLASD3 SLASD6 SLASD7 SLASD8 SLASDA SLASDQ SLASDT SGESDD
-
Ming Gu, Computer Science Division, University of California at Berkeley, US
-
Ren-Cang Li, Computer Science Division, University of California at Berkeley, US
-
Osni Marques, LBNL/NERSC, US
SGELSD, SLALS0, SLALSA, SLALASD
QR factorization with column pivoting (Level 3 BLAS) — SGEQP3
-
G. Quintana Ortí, Depto. de Informatica, Universidad Jaime I, Spain
-
X. Sun, Computer Science Dept., Duke University, US
SGEQP3
-
G. Quintana Ortí, Depto. de Informatica, Universidad Jaime I, Spain
-
X. Sun, Computer Science Dept., Duke University, US
-
Z. Drmac and Z. Bujanovic, Dept. of Mathematics, University of Zagreb, Croatia.
SGEQPF (deprecated), SLAQP2, SLAQPS
Linear Least Squares solver based on QR factorization with column pivoting — SGELSY
-
A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, US
-
E. Quintana Ortí, Depto. de Informatica, Universidad Jaime I, Spain
-
G. Quintana Ortí, Depto. de Informatica, Universidad Jaime I, Spain
SGELSY
-
A. Petitet, Computer Science Dept., Univ. of Tenn., Knoxville, US
SLARZ SLARZB SLARZT SLATRZ SORMR3 SORMRZ STZRZF
Nonsymmetric Eigenvalue Problem — NEP — SGEEV
Multishift QR algorithm with Aggressive Early Deflation — SHSEQR
-
Karen Braman (University of Kansas; US),
-
Ralph Byers (University of Kansas; US),
SHSEQR, SLAQR0, SLAQR1, SLAQR2, SLAQR3, SLAQR4, SLAQR5
Generalized Schur Decomposition Reordering — STGSEN
Generalized Sylvester Equation Solver — STGSYL
-
Bo Kagström, Umeå University; Sweden
-
Peter Poromaa, Umeå University; Sweden
SGESC2 SLATDF STGEX2 STGEXC STGSEN STGSNA STGSY2 STGSYL SGETC2
Extra Precise Iterative Refinement Routines
-
James Demmel, Univ. of California, Berkeley, US
-
Deaglan Halligan, Univ. of California, Berkeley, US
-
Yozo Hida, Univ. of California, Berkeley, US
-
Jason Riedy, Univ. of California, Berkeley, US
SGBEQUB SGBRFSX SGBSVXX SGEEQUB SGERFSX SGESVXX SLA_GBAMV SLA_GBRCOND SLA_GBRFSX_EXTENDED SLA_GBRPVGRW SLA_GEAMV SLA_GERCOND SLA_GERFSX_EXTENDED SLA_LIN_BERR SLA_PORCOND SLA_PORFSX_EXTENDED SLA_PORPVGRW SLA_RPVGRW SLA_SYAMV SLA_SYRCOND SLA_SYRFSX_EXTENDED SLA_SYRPVGRW SLA_WWADDW SLARSCL2 SLASCL2 SPOEQUB SPORFSX SPOSVXX SSYEQUB SSYRFSX SSYSVXX
Rectangular Full Packed Format
-
Fred Gustavson of the IBM Watson Research Center
SLANSF STFSM STFTRI STFTTP STFTTR STPTTF SPFTRF SPFTRI SPFTRS STRTTF
-
Fred Gustavson of the IBM Watson Research Center
-
Julien Langou of the Univ. of Colorado Denver
STRTTP
-
Julien Langou of the Univ. of Colorado Denver
SSFRK STPTTR
Symmetric Eigenvalue Problem — SEP
Expert routines
-
Mark Fahey, Department of Mathematics, Univ. of Kentucky, US
SLAGV2 SSYGVD SSYGVX SSBGVD SSBGVX SSPGVD SSPGVX
Divide & Conquer Agorithm
-
Jeff Rutter, Computer Science Division, University of California at Berkeley, US
SLAED0 SLAED7 SLAED8 SLAED9 SLAEDA
-
Jeff Rutter, Computer Science Division, University of California at Berkeley, US
-
Françoise Tisseur, University of Tennessee.
SLAED1 SLAED2 SLAED3 SSYEVD SSTEDC
-
Ren-Cang Li, Computer Science Division, University of California
SLAED4 SLAED5 SLAED6
Multiple Relatively Robust Representations Algorithm — SYEVR
-
Beresford Parlett, University of California, Berkeley, US
-
Jim Demmel, University of California, Berkeley, US
-
Inderjit Dhillon, University of Texas, Austin, US
-
Osni Marques, LBNL/NERSC, US
-
Christof Voemel, University of California, Berkeley, US
SLAR1V SLARRA SLARRB SLARRC SLARRE SLARRF SLARRJ SLARRR SLARRV
-
W. Kahan, University of California, Berkeley, US
-
Beresford Parlett, University of California, Berkeley, US
-
Jim Demmel, University of California, Berkeley, US
-
Inderjit Dhillon, University of Texas, Austin, US
-
Osni Marques, LBNL/NERSC, US
-
Christof Voemel, University of California, Berkeley, US
SLARRD
-
Inderjit Dhillon, IBM Almaden, US
-
Osni Marques, LBNL/NERSC, US
-
Christof Voemel, LBNL/NERSC, US
SSTEGR
-
Beresford Parlett, University of California, Berkeley, US
-
Jim Demmel, University of California, Berkeley, US
-
Inderjit Dhillon, University of Texas, Austin, US
-
Osni Marques, LBNL/NERSC, US
-
Christof Voemel, University of California, Berkeley, US
SSTEMR
-
Osni Marques, LBNL/NERSC, US
-
Christof Voemel, University of California, Berkeley, US
-
Jason Riedy, University of California, Berkeley, US
SLANEG
-
Inderjit Dhillon, IBM Almaden, US
-
Osni Marques, LBNL/NERSC, US
-
Ken Stanley, Computer Science Division, University of California at Berkeley, US
-
Jason Riedy, Computer Science Division, University of California at Berkeley, US
SSTEVR SSYEVR
DQDS algorithm
-
Osni Marques of the Lawrence Berkeley National Laboratory
-
Beresford Parlett of the Univ. of California at Berkeley
SLASQ1 SLASQ2 SLASQ3 SLASQ4 SLASQ5 SLASQ6
Cholesky for banded matrices
-
Peter Mayes, IBM ECSEC, Rome, March 23, 1989
-
Giuseppe Radicati, IBM ECSEC, Rome, March 23, 1989
SPBTRF
CMAKE Build system
-
Chuck Atkins, Kitware, US
-
Bill Hoffman, Kitware, US
LAPACK 95
-
V. A. Barker (Technical University of Denmark; Denmark),
-
Susan Blackford (University of Tennessee; US),
-
Jack Dongarra (University of Tennessee and Oak Ridge National Laboratory; US),
-
Jeremy Du Croz (Numerical Algorithms Group Ltd. (NAG); UK),
-
Sven Hammarling (Numerical Algorithms Group Ltd. (NAG); UK),
-
M. Marinova (Danish Computing Center for Research and Education; Denmark),
-
Jerzy Waśniewski (Technical University of Denmark, Denmark),
-
P. Yalamov (University of Rousse; Bulgaria).
Variants for LU, QR and Cholesky
-
Peng Du (University of Tennsee, US)
C Interface to LAPACK
-
MKL team


"Creative Thinking inspires ideas. Ideas inspire change."
- Barbara Januszkiewicz
"A bad idea takes just as much time to implement as a good one." That’s why when our team decided to create idea8 we had one thing in mind; to help our consumers find good ideas. Idea8 is a product for groups and individuals that encourages users to branch out and think through their options before making costly decisions. Idea8 was designed to foster the creative fuel of people who plan events, problem solve, create works of art, and much more.
Classic representation of naive ideation vs. smart ideation.
Our team decided to tackle the very broad topic of creativity and how it seems to a dying art. In a society where mottos like nike's "Just Do It" or the ever popular yolo seems to be part of our everyday culture, its no surprise that people look towards the easiest and fastest solutions in order to keep pace in this progressive lifestyle. But the quick and easy solutions that people scramble to execute are often times not the best. As designers, we know that these quick seemingly easy and quick fixes are the first to pop in to our minds but when actually jumping into production can lead to a mess. That is why we decided to create a product to help individuals push their ideas and weigh their options before "just doing it".
Team Potato at work.
Although the above image exemplified the pathways for a novice and senior designer, we sought to make a product that can be useful for anybody who needs to tackle a problem. Whether they are:
Anyone can can benefit from taking the time to ideate!
Our affinity diagram made from our user interviews
1. As students, people seem to be pressed for time.
2. Most people felt that they get the most creative when under pressure.
3. People felt that they would be motivated if they had peers with them.
thinking about how to make the flow of idea8 before implementing
From our user research and observations when implementing idea8 there were a few core values we decided to focus on: Our product had to be quick, have some sort of pressure, and allow for easy collaboration between peers. In particular, We focused a lot on emphasizing the power of collaboration since more people = more ideas and included more features for those that chose to collaborate and gave the option to collaborate remotely since scheduling could be difficult.
The end product we made is still to be considered a mockup and does not have full functionality and is missing some stuff aesthetically. I think if we were push this further we would definitely need a larger team with a more diverse skill set. As a team composed of 7 designers and no coders or artists it was a bit difficult getting the production technicalities worked out.


get the latest library releases in one website or through an atom or rss feed!
click the version number to see the details below and comment on that specific release
click the other fields to take you to the repository, organization page or project page
filter the latest releases with the filter box


procedure BlendLine(Src, Dst: PColor32; Count: Integer);
An optimized row processing version of Blend.
[See Also] BlendLineEx


A very common task in ASP.NET MVC is to return a ViewResult from a controller Action. This is usually achieved by a simple:
return View(“ViewName”, modelForTheView);
And this works fine…usually. Have you ever had a view where the model is simply a string? In that case, your code may look like this:
var model = “some string”; return View(“ViewName”, model);
Only in this case, it won’t work. Don’t believe me? Try it. It’s going to show an obscure error message saying that it could not find the view or master / layout page for ViewName.cshtml [or aspx if you’re using that inferior view engine]. Yet if the model is anything but a string, it works perfectly. This can result in confusion, anger, despair, hair-pulling, keyboard pounding and more importantly wasted time. And if you ever find yourself doing any of those things, then the reason for the error will annoy you even further. You see, Controll.View() has a number of overloads. Two of them are as follows:
View(String, Object) View(String, String)
And yes, they are different. The first one expects the model as the second parameter. The second one expects the MASTER/LAYOUT name as the second parameter. When you pass anything but a string as the second parameter, the first overload is triggered. When you pass a string, .NET sees that it matches the second overload and that match is “stronger” than the first. As a result, it calls the second overload. As a result, it will look for a master / layout with the same name as the data you’re passing to it and chances are, it won’t find it. And you’ll get that confusing error.
The Solution
The solution is quite simple. You could use the other overload:
View(String, String, Object)
where the second parameter is the master / layout name and the third is the actual model whenever you have a View expecting a string in the model. Or you could use a named parameter:
return View(“ViewName”, model: “some string”);
Or simply use a separate ViewModel class.
The same principle applies to
View(Object)
View(String)
i.e. If you pass anything but a string as the first parameter, it’s considered the model and the view name is inferred from the executing action. If you pass only a string, it’s taken to be the view name and the model is null.
Why This Annoys Me
With due respect, this design is simply bonkers to me. It seems like the MVC team wanted to add some flexibility but in the process, they introduced an open invitation for off by one errors. Suddenly the type of the model is dictating how the View method responds. Simply the fact that a call to:
return View(“Index”, model)
can have two radically different consequences depending on what’s in the model variable is mindboggling. Besides, what benefit is there from having an overload of the View method that sets the master / layout? The same could easily be achieved by simply putting the master / layout name in Viewbag / ViewData and simply assigning it in the view. Assigning the master / layout in the view is not a good practice in general and should not be encouraged by having an overload of the View method which does exactly that while taking precedence over another overload that is far more commonly used [i.e. second parameter’s the model].
That said, for good or for bad, the annoying overload is there in the framework. So if you have a string as the “model”, be aware that what you think is the model may actually not be interpreted as such.


Automatic Disease detection using chest X-Rays
Upload X-Ray
Select Pic
Run
[[result.class]]
[[prob]]
Click the images below to run the algo on them
Pneumonia - Infection that inflames air sacs in one or both lungs
Cardiomegaly - Medical condition in wich heart is enlarged
Pneumothorax - Abnormal collection of air in the pleural space between the lung and the chest wall


Tournaments will take place on Board Game Arena, and special games will use a variety of platforms/formats. If you sign up for a thing, the participation information will be sent to your email and/or Gail will rewrite this copy.


#
# Licensed to the Apache Software Foundation (ASF) under one or more
# contributor license agreements. See the NOTICE file distributed with
# this work for additional information regarding copyright ownership.
# The ASF licenses this file to You 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.
#
""":class:`~apache_beam.io.filesystem.FileSystem` implementation for accessing
Hadoop Distributed File System files."""
from __future__ import absolute_import
import io
import logging
import posixpath
import re
import hdfs
from apache_beam.io import filesystemio
from apache_beam.io.filesystem import BeamIOError
from apache_beam.io.filesystem import CompressedFile
from apache_beam.io.filesystem import CompressionTypes
from apache_beam.io.filesystem import FileMetadata
from apache_beam.io.filesystem import FileSystem
from apache_beam.io.filesystem import MatchResult
from apache_beam.options.pipeline_options import HadoopFileSystemOptions
__all__ = ['HadoopFileSystem']
_HDFS_PREFIX = 'hdfs:/'
_URL_RE = re.compile(r'^' + _HDFS_PREFIX + r'(/.*)')
_COPY_BUFFER_SIZE = 2 ** 16
_DEFAULT_BUFFER_SIZE = 20 * 1024 * 1024
# WebHDFS FileStatus property constants.
_FILE_STATUS_NAME = 'name'
_FILE_STATUS_PATH_SUFFIX = 'pathSuffix'
_FILE_STATUS_TYPE = 'type'
_FILE_STATUS_TYPE_DIRECTORY = 'DIRECTORY'
_FILE_STATUS_TYPE_FILE = 'FILE'
_FILE_STATUS_SIZE = 'size'
class HdfsDownloader(filesystemio.Downloader):
def __init__(self, hdfs_client, path):
self._hdfs_client = hdfs_client
self._path = path
self._size = self._hdfs_client.status(path)[_FILE_STATUS_SIZE]
@property
def size(self):
return self._size
def get_range(self, start, end):
with self._hdfs_client.read(
self._path, offset=start, length=end - start + 1) as reader:
return reader.read()
class HdfsUploader(filesystemio.Uploader):
def __init__(self, hdfs_client, path):
self._hdfs_client = hdfs_client
if self._hdfs_client.status(path, strict=False) is not None:
raise BeamIOError('Path already exists: %s' % path)
self._handle_context = self._hdfs_client.write(path)
self._handle = self._handle_context.__enter__()
def put(self, data):
self._handle.write(data)
def finish(self):
self._handle.__exit__(None, None, None)
self._handle = None
self._handle_context = None
[docs]class HadoopFileSystem(FileSystem):
"""``FileSystem`` implementation that supports HDFS.
URL arguments to methods expect strings starting with ``hdfs://``.
Experimental; TODO(BEAM-3600): Writes are experimental until file rename
retries are better handled.
"""
def __init__(self, pipeline_options):
"""Initializes a connection to HDFS.
Connection configuration is done by passing pipeline options.
See :class:`~apache_beam.options.pipeline_options.HadoopFileSystemOptions`.
"""
super(HadoopFileSystem, self).__init__(pipeline_options)
if pipeline_options is None:
raise ValueError('pipeline_options is not set')
hdfs_options = pipeline_options.view_as(HadoopFileSystemOptions)
if hdfs_options.hdfs_host is None:
raise ValueError('hdfs_host is not set')
if hdfs_options.hdfs_port is None:
raise ValueError('hdfs_port is not set')
if hdfs_options.hdfs_user is None:
raise ValueError('hdfs_user is not set')
self._hdfs_client = hdfs.InsecureClient(
'http://%s:%s' % (
hdfs_options.hdfs_host, str(hdfs_options.hdfs_port)),
user=hdfs_options.hdfs_user)
[docs] @classmethod
def scheme(cls):
return 'hdfs'
@staticmethod
def _parse_url(url):
"""Verifies that url begins with hdfs:// prefix, strips it and adds a
leading /.
Raises:
ValueError if url doesn't begin with hdfs://.
Args:
url: A URL in the form hdfs://path/...
Returns:
For an input of 'hdfs://path/...', will return '/path/...'.
"""
m = _URL_RE.match(url)
if m is None:
raise ValueError('Could not parse url: %s' % url)
return m.group(1)
[docs] def join(self, base_url, *paths):
"""Join two or more pathname components.
Args:
base_url: string path of the first component of the path.
Must start with hdfs://.
paths: path components to be added
Returns:
Full url after combining all the passed components.
"""
basepath = self._parse_url(base_url)
return _HDFS_PREFIX + self._join(basepath, *paths)
def _join(self, basepath, *paths):
return posixpath.join(basepath, *paths)
[docs] def split(self, url):
rel_path = self._parse_url(url)
head, tail = posixpath.split(rel_path)
return _HDFS_PREFIX + head, tail
[docs] def mkdirs(self, url):
path = self._parse_url(url)
if self._exists(path):
raise BeamIOError('Path already exists: %s' % path)
return self._mkdirs(path)
def _mkdirs(self, path):
self._hdfs_client.makedirs(path)
[docs] def match(self, url_patterns, limits=None):
if limits is None:
limits = [None] * len(url_patterns)
if len(url_patterns) != len(limits):
raise BeamIOError(
'Patterns and limits should be equal in length: %d != %d' % (
len(url_patterns), len(limits)))
def _match(path_pattern, limit):
"""Find all matching paths to the pattern provided."""
fs = self._hdfs_client.status(path_pattern, strict=False)
if fs and fs[_FILE_STATUS_TYPE] == _FILE_STATUS_TYPE_FILE:
file_statuses = [(fs[_FILE_STATUS_PATH_SUFFIX], fs)][:limit]
else:
file_statuses = self._hdfs_client.list(path_pattern,
status=True)[:limit]
metadata_list = [FileMetadata(file_status[1][_FILE_STATUS_NAME],
file_status[1][_FILE_STATUS_SIZE])
for file_status in file_statuses]
return MatchResult(path_pattern, metadata_list)
exceptions = {}
result = []
for url_pattern, limit in zip(url_patterns, limits):
try:
path_pattern = self._parse_url(url_pattern)
result.append(_match(path_pattern, limit))
except Exception as e: # pylint: disable=broad-except
exceptions[url_pattern] = e
if exceptions:
raise BeamIOError('Match operation failed', exceptions)
return result
@staticmethod
def _add_compression(stream, path, mime_type, compression_type):
if mime_type != 'application/octet-stream':
logging.warning('Mime types are not supported. Got non-default mime_type:'
' %s', mime_type)
if compression_type == CompressionTypes.AUTO:
compression_type = CompressionTypes.detect_compression_type(path)
if compression_type != CompressionTypes.UNCOMPRESSED:
return CompressedFile(stream)
return stream
[docs] def create(self, url, mime_type='application/octet-stream',
compression_type=CompressionTypes.AUTO):
"""
Returns:
A Python File-like object.
"""
path = self._parse_url(url)
return self._create(path, mime_type, compression_type)
def _create(self, path, mime_type='application/octet-stream',
compression_type=CompressionTypes.AUTO):
stream = io.BufferedWriter(
filesystemio.UploaderStream(
HdfsUploader(self._hdfs_client, path)),
buffer_size=_DEFAULT_BUFFER_SIZE)
return self._add_compression(stream, path, mime_type, compression_type)
[docs] def open(self, url, mime_type='application/octet-stream',
compression_type=CompressionTypes.AUTO):
"""
Returns:
A Python File-like object.
"""
path = self._parse_url(url)
return self._open(path, mime_type, compression_type)
def _open(self, path, mime_type='application/octet-stream',
compression_type=CompressionTypes.AUTO):
stream = io.BufferedReader(
filesystemio.DownloaderStream(
HdfsDownloader(self._hdfs_client, path)),
buffer_size=_DEFAULT_BUFFER_SIZE)
return self._add_compression(stream, path, mime_type, compression_type)
[docs] def copy(self, source_file_names, destination_file_names):
"""
It is an error if any file to copy already exists at the destination.
Raises ``BeamIOError`` if any error occurred.
Args:
source_file_names: iterable of URLs.
destination_file_names: iterable of URLs.
"""
if len(source_file_names) != len(destination_file_names):
raise BeamIOError(
'source_file_names and destination_file_names should '
'be equal in length: %d != %d' % (
len(source_file_names), len(destination_file_names)))
def _copy_file(source, destination):
with self._open(source) as f1:
with self._create(destination) as f2:
while True:
buf = f1.read(_COPY_BUFFER_SIZE)
if not buf:
break
f2.write(buf)
def _copy_path(source, destination):
"""Recursively copy the file tree from the source to the destination."""
if self._hdfs_client.status(
source)[_FILE_STATUS_TYPE] != _FILE_STATUS_TYPE_DIRECTORY:
_copy_file(source, destination)
return
for path, dirs, files in self._hdfs_client.walk(source):
for dir in dirs:
new_dir = self._join(destination, dir)
if not self._exists(new_dir):
self._mkdirs(new_dir)
rel_path = posixpath.relpath(path, source)
if rel_path == '.':
rel_path = ''
for file in files:
_copy_file(self._join(path, file),
self._join(destination, rel_path, file))
exceptions = {}
for source, destination in zip(source_file_names, destination_file_names):
try:
rel_source = self._parse_url(source)
rel_destination = self._parse_url(destination)
_copy_path(rel_source, rel_destination)
except Exception as e: # pylint: disable=broad-except
exceptions[(source, destination)] = e
if exceptions:
raise BeamIOError('Copy operation failed', exceptions)
[docs] def rename(self, source_file_names, destination_file_names):
exceptions = {}
for source, destination in zip(source_file_names, destination_file_names):
try:
rel_source = self._parse_url(source)
rel_destination = self._parse_url(destination)
try:
self._hdfs_client.rename(rel_source, rel_destination)
except hdfs.HdfsError as e:
raise BeamIOError(
'libhdfs error in renaming %s to %s' % (source, destination), e)
except Exception as e: # pylint: disable=broad-except
exceptions[(source, destination)] = e
if exceptions:
raise BeamIOError('Rename operation failed', exceptions)
[docs] def exists(self, url):
"""Checks existence of url in HDFS.
Args:
url: String in the form hdfs://...
Returns:
True if url exists as a file or directory in HDFS.
"""
path = self._parse_url(url)
return self._exists(path)
def _exists(self, path):
"""Returns True if path exists as a file or directory in HDFS.
Args:
path: String in the form /...
"""
return self._hdfs_client.status(path, strict=False) is not None
[docs] def delete(self, urls):
exceptions = {}
for url in urls:
try:
path = self._parse_url(url)
self._hdfs_client.delete(path, recursive=True)
except Exception as e: # pylint: disable=broad-except
exceptions[url] = e
if exceptions:
raise BeamIOError("Delete operation failed", exceptions)


--- title: Cognito keywords: fastai sidebar: home_sidebar summary: "cognito sdk" description: "cognito sdk" nb_path: "cognito.ipynb" ---
# cognito.loginWithFb(fbToken)
cognito = Cognito(
identityPoolId = identity_pool_id ,
userPoolId = user_pool_id,
accountId = account_id,
clientId = client_id,
clientSecret = client_secret,
region = 'ap-southeast-1'
)
result = cognito.addUser(user = user, phone = phone, pw = pw, name = 'nic')
result
cognito.confirm(user = '1234', code = '931114')
domain = 'villaemployee.auth.ap-southeast-1.amazoncognito.com'
clientId = '49g3q8l6qca6gj5br83ubcd2af'
redirectUrl = 'https://google.com'
f'https://{domain}/login?response_type=code&client_id={clientId}&redirect_uri={redirectUrl}'
f'https://{domain}/confirm?response_type=code&client_id={clientId}&redirect_uri={redirectUrl}'
Cognito()
cognito = Cognito(
identityPoolId = identity_pool_id ,
userPoolId = user_pool_id,
accountId = account_id,
clientId = client_id,
clientSecret = client_secret,
region = 'ap-southeast-1'
)
cognito.unauth()


Hello fellow hacker! {{ invitee_first_name }} {{ invitee_last_name }} has joined your team, {{ team_name }}!
Login to Hackmates to see your new team member!
Cheers, The Hackmates Team


The key takeaway is that dieting is not supposed to feel like a diet.
Last note. If you want to binge on unhealthy foods, make sure your in a deficit after eating that food.
You could either eat little all day and eat the junk food and still be in a caloric deficit in which you will not gain weight.
Or you can do cardio to burn off those calories.


There is a problem
Project setup is complete and was successful.

Innovate UK and the organisation can view the project but can no longer make changes online.
What happens next
Finish the next steps offline so that the loan agreement can be completed. Once all the steps are done then you must mark it as either successful or unsuccessful.


Benno Roch Jr
Musician, Writer. Web Developer
About Me
An avid gamer, writer, composer, and programmer
Skills
Software
HTML and CSS
Logic Pro
Sibelius
Contact
Find me on
Github


That's right I'm a great computer hacker so
I am in your network bot-tracing u rihgt now
its too late because I got you already
Click the snake to go back!


About the ontology
What is LexInfo?
LexInfo is an ontology that was defined during the Monnet Project to provide data categories for the Lemon model. It has since since been updated with the new OntoLex-Lemon model of the OntoLex community group. LexInfo is now developed on GitHub
Versions
- Version 3.0
- Version 2.0
- Version 1.0
- Lexical Markup Framework used by Version 1.0


Created by Anisha Narang | Red Hat
Let's see some sample code...
from selenium import webdriver
from selenium.webdriver.common.keys import Keys
import unittest
driver = webdriver.Firefox()
driver.get("http://fpaste.org/")
driver.find_element_by_id("paste_data").send_keys("sample text here")
driver.find_element_by_id("paste_button").click
text_entered = driver.find_element_by_class_name("text").text
assertEqual(text_entered, "sample text here", "Text mismatch")
driver.close()
require "watir-webdriver"
require "rspec"
@browser = Watir::Browser.new :firefox
@browser.goto("http://fpaste.org/")
@browser.textarea(:id => "paste_data").send_keys("sample text here")
@browser.button(:id => "paste_button").click
@browser.div(:class => "text").wait_until_present
@browser.div(:class => "text").text.should == "sample text here"
@browser.close
Sample Feature:
./features/paste.feature:
Feature: To be able to paste a snippet of text on fpaste successfully
Scenario: To verify that I can paste a snippet of text on fpaste
Given that I am on the home page
When I input text in the textbox
And I click on PASTE button
Then a new paste should be created with the same text
Sample test script:
./features/step_definitions/paste.rb:
Given(/^that I am on the home page$/) do
@browser.goto("http://www.fpaste.org")
end
When(/^I input text in the textbox$/) do
@browser.textarea(:id => "paste_data").send_keys("sample text here")
end
When(/^I click on PASTE button$/) do
@browser.button(:id => "paste_button").click
end
Then(/^a new paste should be created with the same text$/) do
@browser.div(:class => "text").text.should == "sample text here"
end
$ cucumber --format html --out reports/report.html
Code available at: https://github.com/anarang/fpaste_cuke
Sample Feature:
./features/api_show.feature:
Feature: To be able to use the API endpoints of fpaste.org
Scenario: To verify that the API endpoint 'show' gives accurate results
When I GET '/show' for id: XXXX
Then the response should be 200 OK
And I should be able to get details including Author and data
./features/step_definitions/api_show.rb:
When(/^I GET '\/show' for id: XXXX$/) do
@var = HTTParty.get("http://www.fpaste.org/api/json/177666/55550514/")
end
Then(/^the response should be (\d+) OK$/) do |arg1|
if @var.code == 200
puts "Status: OK"
else
raise 'API Server not found'
end
end
Then(/^I should be able to get details including Author and data$/) do
@api_response = JSON.parse(@var.body)["result"]
author = @api_response["author"]
data = @api_response["data"]
if author == "Anisha" and data == "hello API"
true
else
raise 'Incorrect results'
end
end
Code available at: https://github.com/anarang/api_fpaste
Continuos Integration tool
Slides available at: http://anarang.github.io/testing_stack/
Feedback link: http://devconf.cz/f/68


Class ExpressionContextProcessingResult
Describes the result/outcome of an invocation of IProcessesExpressionContext.
Inheritance
Inherited Members
Namespace: ZptSharp.Rendering
Assembly: ZptSharp.Abstractions.dll
Syntax
public class ExpressionContextProcessingResult
Constructors
| Improve this Doc View SourceExpressionContextProcessingResult()
Initializes a new instance of the ExpressionContextProcessingResult class.
Declaration
public ExpressionContextProcessingResult()
Properties
| Improve this Doc View SourceAdditionalContexts
Gets or sets a collection of additional contexts to be iterated-over. Typically these contexts are created/added as a result of the processing.
Declaration
public IList<ExpressionContext> AdditionalContexts { get; set; }
Property Value
| Type | Description |
|---|---|
| System.Collections.Generic.IList<ExpressionContext> | The additional contexts. |
DoNotProcessChildren
Gets a value indicating whether this ExpressionContextProcessingResult indicates that children of the current node should not be processed.
Declaration
public bool DoNotProcessChildren { get; }
Property Value
| Type | Description |
|---|---|
| System.Boolean |
|
Noop
Gets a no-operation instance of ExpressionContextProcessingResult. This result indicates that context-processing completed without error, but that no particular action needs to be taken as a result.
Declaration
public static ExpressionContextProcessingResult Noop { get; }
Property Value
| Type | Description |
|---|---|
| ExpressionContextProcessingResult | The no-op result. |
WithoutChildren
Gets an instance of ExpressionContextProcessingResult which indicates that child-contexts should not be processed.
Declaration
public static ExpressionContextProcessingResult WithoutChildren { get; }
Property Value
| Type | Description |
|---|---|
| ExpressionContextProcessingResult | The processing result. |


| Top |
| #define | G_VALUE_HOLDS() |
| #define | G_VALUE_TYPE() |
| #define | G_VALUE_TYPE_NAME() |
| #define | G_TYPE_IS_VALUE() |
| #define | G_TYPE_IS_VALUE_ABSTRACT() |
| #define | G_IS_VALUE() |
| #define | G_TYPE_VALUE |
| #define | G_TYPE_VALUE_ARRAY |
| GValue * | g_value_init () |
| void | g_value_copy () |
| GValue * | g_value_reset () |
| void | g_value_unset () |
| void | g_value_init_from_instance () |
| void | g_value_set_instance () |
| gboolean | g_value_fits_pointer () |
| gpointer | g_value_peek_pointer () |
| gboolean | g_value_type_compatible () |
| gboolean | g_value_type_transformable () |
| gboolean | g_value_transform () |
| void | (*GValueTransform) () |
| void | g_value_register_transform_func () |
| gchar * | g_strdup_value_contents () |
The GValue structure is basically a variable container that consists
of a type identifier and a specific value of that type.
The type identifier within a GValue structure always determines the
type of the associated value.
To create a undefined GValue structure, simply create a zero-filled
GValue structure. To initialize the GValue, use the g_value_init()
function. A GValue cannot be used until it is initialized.
The basic type operations (such as freeing and copying) are determined
by the GTypeValueTable associated with the type ID stored in the GValue.
Other GValue operations (such as converting values between types) are
provided by this interface.
The code in the example program below demonstrates GValue's features.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 |
#include <glib-object.h> static void int2string (const GValue *src_value, GValue *dest_value) { if (g_value_get_int (src_value) == 42) g_value_set_static_string (dest_value, "An important number"); else g_value_set_static_string (dest_value, "What's that?"); } int main (int argc, char *argv[]) { // GValues must be initialized GValue a = G_VALUE_INIT; GValue b = G_VALUE_INIT; const gchar *message; // The GValue starts empty g_assert (!G_VALUE_HOLDS_STRING (&a)); // Put a string in it g_value_init (&a, G_TYPE_STRING); g_assert (G_VALUE_HOLDS_STRING (&a)); g_value_set_static_string (&a, "Hello, world!"); g_printf ("%s\n", g_value_get_string (&a)); // Reset it to its pristine state g_value_unset (&a); // It can then be reused for another type g_value_init (&a, G_TYPE_INT); g_value_set_int (&a, 42); // Attempt to transform it into a GValue of type STRING g_value_init (&b, G_TYPE_STRING); // An INT is transformable to a STRING g_assert (g_value_type_transformable (G_TYPE_INT, G_TYPE_STRING)); g_value_transform (&a, &b); g_printf ("%s\n", g_value_get_string (&b)); // Attempt to transform it again using a custom transform function g_value_register_transform_func (G_TYPE_INT, G_TYPE_STRING, int2string); g_value_transform (&a, &b); g_printf ("%s\n", g_value_get_string (&b)); return 0; } |
#define G_VALUE_HOLDS(value,type) (G_TYPE_CHECK_VALUE_TYPE ((value), (type)))
Checks if value
holds (or contains) a value of type
.
This macro will also check for value
!= NULL
and issue a
warning if the check fails.
#define G_VALUE_TYPE(value) (((GValue*) (value))->g_type)
Get the type identifier of value
.
#define G_VALUE_TYPE_NAME(value) (g_type_name (G_VALUE_TYPE (value)))
Gets the type name of value
.
#define G_TYPE_IS_VALUE(type) (g_type_check_is_value_type (type))
Checks whether the passed in type ID can be used for g_value_init()
.
That is, this macro checks whether this type provides an implementation
of the GTypeValueTable functions required for a type to create a GValue of.
#define G_TYPE_IS_VALUE_ABSTRACT(type) (g_type_test_flags ((type), G_TYPE_FLAG_VALUE_ABSTRACT))
Checks if type
is an abstract value type. An abstract value type introduces
a value table, but can't be used for g_value_init()
and is normally used as
an abstract base type for derived value types.
#define G_IS_VALUE(value) (G_TYPE_CHECK_VALUE (value))
Checks if value
is a valid and initialized GValue structure.
#define G_TYPE_VALUE (g_value_get_type ())
The type ID of the "GValue" type which is a boxed type, used to pass around pointers to GValues.
#define G_TYPE_VALUE_ARRAY (g_value_array_get_type ())
G_TYPE_VALUE_ARRAY
has been deprecated since version 2.32 and should not be used in newly-written code.
Use GArray instead of GValueArray
The type ID of the "GValueArray" type which is a boxed type, used to pass around pointers to GValueArrays.
GValue * g_value_init (GValue *value
,GType g_type
);
Initializes value
with the default value of type
.
void g_value_copy (const GValue *src_value
,GValue *dest_value
);
Copies the value of src_value
into dest_value
.
GValue *
g_value_reset (GValue *value
);
Clears the current value in value
and resets it to the default value
(as if the value had just been initialized).
void
g_value_unset (GValue *value
);
Clears the current value in value
and "unsets" the type,
this releases all resources associated with this GValue.
An unset value is the same as an uninitialized (zero-filled)
GValue structure.
void g_value_init_from_instance (GValue *value
,gpointer instance
);
Initializes and sets value
from an instantiatable type via the
value_table's collect_value()
function.
Note: The value
will be initialised with the exact type of
instance
. If you wish to set the value
's type to a different GType
(such as a parent class GType), you need to manually call
g_value_init()
and g_value_set_instance()
.
Since 2.42
void g_value_set_instance (GValue *value
,gpointer instance
);
Sets value
from an instantiatable type via the
value_table's collect_value()
function.
gboolean
g_value_fits_pointer (const GValue *value
);
Determines if value
will fit inside the size of a pointer value.
This is an internal function introduced mainly for C marshallers.
gpointer
g_value_peek_pointer (const GValue *value
);
Returns the value contents as pointer. This function asserts that
g_value_fits_pointer()
returned TRUE
for the passed in value.
This is an internal function introduced mainly for C marshallers.
gboolean g_value_type_compatible (GType src_type
,GType dest_type
);
Returns whether a GValue of type src_type
can be copied into
a GValue of type dest_type
.
gboolean g_value_type_transformable (GType src_type
,GType dest_type
);
Check whether g_value_transform()
is able to transform values
of type src_type
into values of type dest_type
. Note that for
the types to be transformable, they must be compatible and a
transform function must be registered.
gboolean g_value_transform (const GValue *src_value
,GValue *dest_value
);
Tries to cast the contents of src_value
into a type appropriate
to store in dest_value
, e.g. to transform a G_TYPE_INT
value
into a G_TYPE_FLOAT
value. Performing transformations between
value types might incur precision lossage. Especially
transformations into strings might reveal seemingly arbitrary
results and shouldn't be relied upon for production code (such
as rcfile value or object property serialization).
void (*GValueTransform) (const GValue *src_value
,GValue *dest_value
);
The type of value transformation functions which can be registered with
g_value_register_transform_func()
.
void g_value_register_transform_func (GType src_type
,GType dest_type
,GValueTransform transform_func
);
Registers a value transformation function for use in g_value_transform()
.
A previously registered transformation function for src_type
and dest_type
will be replaced.
gchar *
g_strdup_value_contents (const GValue *value
);
Return a newly allocated string, which describes the contents of a GValue. The main purpose of this function is to describe GValue contents for debugging output, the way in which the contents are described may change between different GLib versions.
#define G_VALUE_INIT { 0, { { 0 } } }
A GValue must be initialized before it can be used. This macro can
be used as initializer instead of an explicit { 0 }
when declaring
a variable, but it cannot be assigned to a variable.
1 |
GValue value = G_VALUE_INIT; |
Since 2.30
typedef struct { } GValue;
An opaque structure used to hold different types of values.
The data within the structure has protected scope: it is accessible only
to functions within a GTypeValueTable structure, or implementations of
the g_value_*() API. That is, code portions which implement new fundamental
types.
GValue users cannot make any assumptions about how data is stored
within the 2 element data
union, and the g_type
member should
only be accessed through the G_VALUE_TYPE()
macro.
The fundamental types which all support GValue
operations and thus can be used as a type initializer for
g_value_init()
are defined by a separate interface. See the
standard values API
for details


{% extends "layouts/_block_content.html" %} {% set page_title = "Contact us" %} {% block main %}
Opening hours:
Monday to Thursday 8:30am – 5pm
Friday 8:30am - 4:30pm
Office for National Statistics
Government Buildings
Cardiff Road
Newport
South Wales
NP10 8XG


The Seeed Studio Grove system makes experimenting and prototyping electronics easy by taking a building block approach. The system consists of a base shield and a wide variety of modules with standardized connectors.
The base shield lets you easily connect an Esquilo to all sorts of modules using Grove cables. Each Grove module addresses a single function, such as a simple button or a more complex heart rate sensor. Each module comes with clear documentation and demo code to allow for quick and easy setup.
This page is a collection of demos made specifically for Grove modules and the Esquilo Air.
The Base Shield plugs right into the Esquilo Air and provides easy access to all the Grove connector types: analog, digital, I2C, and UART.
The Button module provides a simple momentary push button input.
The Touch Sensor module functions the same as the Button module, but with a capacitive touch sensor. Note: This reuses the button demo.
The LED Socket module lets you easily drive an LED. It has an on-board dial to control brightness.
The Buzzer module has a piezo buzzer that emits tones from the voltage frequencies applied.
The Rotary Angle Sensor module has a potentiometer (variable resistor) that produces an analog volage output that correlates to position its knob is turned to.
The Sound Sensor module produces analog voltage levels from incoming sound waves.
The Light Sensor module produces analog voltage levels based on ambient light intensity.
The Temperature Sensor module produces analog voltage levels based on temperature.
The Relay module is a normally opened switch that controls a relay capable of switching higher voltage levels that the Esquilo can directly. Note: This reuses the button demo.
The Servo module is a DC motor with gearing and feedback. It is turn and positioned using signals coded with voltages.
The RGB LCD module provides a 16x2 line LCD with an RGB backlight. It is controlled over I2C to simplfy programming.


-
+
Navbar
Home
(current)
Link
Search
#
Title
Artist
Duration
1
Shape of you
Ed Sheeran
3:54
2
Channa Mereya
Arijit Singh
4:49
3
Baarish
Ash King, Shashaa Tirupati
4:35


This service allows all participants to take part in a court hearing by video - from their home, office or somewhere else using a laptop or desktop computer.
This accessibility statement is based on evaluation conducted by the Digital Accessibility Centre (DAC), Neath, during September 2019.
 We want as many people as possible to be able to use this service. For example, this means you should be able to:
We’ve also made the website text as simple as possible to understand.
AbilityNet has advice on making your device easier to use if you have a disability.
Fully video hearings provide an additional channel for conducting a hearing. While they are being made as accessible as possible, they may not be suitable for everyone.
The video hearings service includes a triage process so that people can make the court aware of any particular condition or impairment that may impact their ability to take part in a video hearing.
It will always be for a judge to decide whether to use the option of a fully video hearing, and to ensure the interests of justice are served in any given hearing.
During testing by DAC, users with cognitive impairment and dyslexia were able to navigate the website ‘completely independently, with no issues’. The access issues reported particularly affected those who are visually impaired or use voice activation technology.
If you need help to access the information on this website, contact the video hearings team:
Available between 9am and 5pm, Monday to Friday.
We’re always looking to improve the accessibility of this website. If you find any problems not listed on this page or think we’re not meeting accessibility requirements, contact the video hearings team (above).
The Equality and Human Rights Commission (EHRC) is responsible for enforcing the Public Sector Bodies (Websites and Mobile Applications) (No. 2) Accessibility Regulations 2018 (the ‘accessibility regulations’). If you’re not happy with how we respond to your complaint, contact the Equality Advisory and Support Service (EASS).
HM Courts and Tribunals Service is committed to making its website accessible, in accordance with the Public Sector Bodies (Websites and Mobile Applications) (No. 2) Accessibility Regulations 2018.
This website is partially compliant with the Web Content Accessibility Guidelines version 2.1 AA standard, due to the non-compliances listed below.
A number of accessibility and usability issues were reported. These particularly impacted those who are visually impaired or use voice activation technology. Most issues were resolved before the private beta was released. Those that remain are shown below.
We currently use video to help users see what their experience would be like either attending a court building or taking part in a video hearing. This has proved popular in user testing and we’ll make the necessary changes to make the videos more accessible by the end of 2019.
We use video to help users test whether their computer equipment is suitable for a video hearing. This has caused some accessibility issues, detailed below.
We use a visual method to indicate to the user that their microphone is working. This is not suitable for those with visual impairments. We’re considering providing an audible indicator so they know their microphone is picking up sound.
The video intentionally has no controls. It needs to play to the end to detect the strength of the user’s internet connection. This takes at least 20 to 30 seconds. We’ve added an explanation.
By Spring 2020 we’ll review the way we help users test their equipment to address the accessibility issues identified in the DAC report.
In preparing for a video hearing, potential participants are asked a series of questions. These are presented as one question per page, with the option of a ‘yes’ or ‘no’ answer. DAC advised that we should group the ‘yes’ and ‘no’ buttons to assist screen reader users. (WCAG reference 1.3.1 – A). This advice reflects guidance for longer forms with separate groups of questions on a single page, which is not applicable in this instance.
The website was tested by the Digital Accessibility Centre, Neath, during September 2019.
This is an excerpt from their report explaining their methodology:
“The website was tested by a team of experienced auditors, many of who are disabled individuals and users of adaptive technology. The combination of subjective pan-disability user feedback and comprehensive technical auditing allows us to measure how the website performs technically and practically, thereby offering an essential added dimension to our test results that other methods of testing cannot provide.”
User testing:
“Manual accessibility checking was conducted by a team of disabled individuals, using a range of adaptive technologies (hardware and software designed to facilitate the use of computers by people with disabilities).”
Technical auditing:
“Technical auditing involves the experienced application of a number of technical auditing and standards compliance assessment tools. This combined with an extensive knowledge of WCAG, its application and wider global practice provides the DAC website with further credibility and quality.”