KATE(1) KDE User's Manual KATE(1) NAME kate - Advanced text editor for KDE SYNOPSIS kate [-s, --start name] [--startanon] [-n, --new] [-b, --block] [-p, --pid pid] [-e, --encoding name] [-l, --line line] [-c, --column column] [-i, --stdin] [-u, --use] [KDE Generic Options] [Qt Generic Options] DESCRIPTION Kate is the KDE Advanced Text Editor. Kate also provides the editor part for various applications, under the name KWrite. Some of Kate's many features include configurable syntax highlighting for languages ranging from C and C++ to HTML to bash scripts, the ability to create and maintain projects, a multiple document interface (MDI), and a self-contained terminal emulator. But Kate is more than a programmer's editor. Its ability to open several files at once makes it ideal for editing UNIX®'s many configuration files. This document was written in Kate. OPTIONS -s, --start name Start Kate with a given session. --startanon Start Kate with a new anonymous session, implies -n. -n, --new Force start of a new Kate instance (is ignored if start is used and another Kate instance already has the given session opened), forced if no parameters and no URLs are given at all. -b, --block If using an already running Kate instance, block until it exits, if URLs given to open. -p, --pid pid Only try to reuse kate instance with this pid (is ignored if start is used and another Kate instance already has the given session opened). -e, --encoding name Set encoding for the file to open You can use this to force a file opened in utf-8 format, for instance. (The command iconv -l provides a list of encodings, which may be helpful to you.) -l, --line line Navigate to this line -c, --column column Navigate to this column -i, --stdin Read the contents of stdin -u, --use Use an already running Kate instance; default, only for compatibility SEE ALSO More detailed user documentation is available from help:/kate (either enter this URL into Konqueror, or run khelpcenter help:/kate). There is also further information available at the Kate website[1]. EXAMPLES To open a file named source.cpp at column 15, line 25, in an existing Kate window, you could use: kate -c 15 -l 25 -u source.cpp If you have an active internet connection, you can take advantage of KDE's network transparency to open a file from an ftp site. If you do not have write permission on the remote server, the file will be opened read only and you will be prompted for a local filename to save to if you make changes. If you do have write permission, changes will be saved transparently over the network. kate ftp://ftp.kde.org/pub/kde/README AUTHORS The maintainer of Kate is Christoph Cullmann<EMAIL_ADDRESS>A comprehensive list of authors and contributors is available in the complete user manual mentioned above. AUTHOR Lauri Watts<EMAIL_ADDRESS>Author. NOTES 1. the Kate website http://kate-editor.org/ K Desktop Environment 2010-10-06 KATE(1)


<EMAIL_ADDRESS>056666463-056666738
Lorem Ipsum is simply dummy text of the printing and typesetting industry
WE ARE WORKING FOR YOU
Lorem Ipsum has been the industry's standard dummy text ever since the 1500s, when an unknown printer took a galley of type and scrambled it to make a type specimen book
THE BEST JUST FOR YOU
Lorem Ipsum has been the industry's standard dummy text ever since the 1500s, when an unknown printer took a galley of type and scrambled it to make a type specimen book


25% Discount
on your next purchase
minimum purchase $100.00 (Without Tax)
Enter your email blow and get your voucher
Washing Tachnology User 6 different wash motions, designed to best care for your clother, just like hand wash.
Big screen in incredibly slim designs that in your eyes.
Artisan materials and striking craftsmanship create an experience unlike anything else.


Welcome To My Page!
About Me
I have always had an intrest in computers and a desire to work in the tech feild. Going to a Univerty of Texas Coding Bootcamp was the best desion i ever made! Having strong communication, leadership, and technical background this feild is perfect for me. I am driven by roles that will leverage my strengths in a DevOps while working in team settings


Use this dialog to create a list of the so-called issue navigation patterns. An issue navigation pattern maps an issue ID pattern in
commit messages with the URL addresses of the referenced issues. This enables you to navigate from committed changes
to issues related to these changes. As soon as IntelliJ IDEA encounters a match to the issue ID pattern in a commit
message, the match is displayed as a link in the Version Control tool window
Alt+9. If you mention several issues, all of them will be displayed as links. Clicking such link opens
the matching issue in the default browser.
The example below shows how IntelliJ IDEA applies the abovementioned rules to detect a reference to an issue in a
commit message and compose a link to it in the issue tracking system.
| Issue ID pattern |
The regular expression that defines the format in which issues are referenced in commit messages. [A-Z]+\-\d+ This regular expressions matches all character strings that consist of two substrings separated by an n-dash character:
|
| Issue link pattern |
A combination of the URL address of your issue tracking system and a regular expression that identifies issues in it. http://mytracker/issue/$0 Here |
| Matching issue ID |
IntelliJ IDEA detects the following reference to an issue in the commit message of interest: MYPROJECT-110 |
| Composed issue link |
In accordance with the above issue navigation pattern, the detected matching reference is added to the URL of the tracker as is, so the link to the referenced issue is composed as follows: http://mytracker/issue/MYPROJECT-110 |
Use the Add Issue Navigation Link dialog to create an issue pattern and navigation
link to a bug tracking system.
(Refer to Regular
Expressions Syntax Reference for details on using special characters in regular expressions.)
For more information, refer to VCS integration
with issue trackers.


What Makes For Great Questions?
Friday, October 3, 2014
Writing good questions is probably a skill that is overlooked by developers. Question-writing can be a crucial skill to help you overcome critical hurdles you will encounter as a developer. Communities like Stack Overflow are a great resource to find answers to technical questions for both new and experienced developers alike.
Have you ever spent 5 hours or more trying to get a simple Ruby code to work but still can't figure it out? (I know I have). Don't get mad, write a question. Practice writing great questions by using the following tips:
- Before asking the question try to find the answer before asking it. This may seem like common sense, but usually you will find the answer to your question quicker if it already exists. Try googling the question and look for related questions.
- Golden Rule of question asking: imagine you are trying to answer the question. This also seems like common sense but it can also help you write better questions. For example, ask yourself if you were not familiar with the situation, could I answer this question?
- Write a good question title. The title should be a specific and concise question that summarizes your problem.
- Include tags in the question. This may differ depending on which site you use to ask the question but at Stack Overflow you should include tags that provide basic information such as the programming language or operating system you are using.
- Make the first paragraph an executive summary of the question. Include additional details in subsequent paragraphs.
- Include sample code in your question. Only include code that is relevant to the question and format it to improve readability.
- Use good spelling, grammar, and formatting. This also applies to writing in general. It makes your writing more readable and shows respect toward readers.
- Proof-read before posting.
After you post the question respond to feedback or answers you receive. Be prompt in answering anybody's follow-up questions. When you find an answer that solves your problem accept and rate the answer accordingly. This rewards contributors and show respect to those who took the time to answer your question.
So far in Phase 0 I've had good luck finding answers that already existed to most questions I looked up. As my workload becomes more challenging I'm sure I will find more opportunities to ask great questions in the future. And now that I know these tips next time I encounter a roadblock I'll be sure to pose a question to the community. Hopefully I can contribute some answers to the community as well.
Resources


What is Fantasy?
Fantasy is a genre of speculative fiction set in a fictional universe, often inspired by real world myth and folklore. Its roots are in oral traditions, which then became fantasy literature and drama.
From the twentieth century it has expanded further into various media, including film, television, graphic novels, manga and video games.
Fantasy is distinguished from the genres of science fiction and horror by the absence of scientific
or macabre themes respectively, though these genres overlap. In popular culture, the fantasy genre predominantly features settings of a medieval nature. In its broadest sense, however, fantasy consists of works by many writers, artists,
filmmakers, and musicians from ancient myths and legends to many recent and popular works. Most fantasy uses magic or other supernatural elements as a main plot element, theme, or setting.
Magic and magical creatures are common in
many of these worlds. An identifying trait of fantasy is the author's use of narrative elements that do not have to rely on history or nature to be coherent.[1] This differs from realistic fiction in that realistic fiction has to attend
to the history and natural laws of reality, where fantasy does not. In writing fantasy the author creates characters, situations, and settings that are not possible in reality.


Whether you're a person who follows a recipe step by step or a person who just tosses in whatever he/she likes and experiments, as long as the ingredients at your disposal are fresh, the finishing product will always taste good. Especially with any type of stir fry, even the simplest of ones.
More of a baker than a cook? Try out some of the fruits for some healthy and satisfying treats. Everything from the crust to the type of fruit or vegetable you want to add in, you can certainly find it here at Natural Grocery.


7 Food Processing Machines Behind the Making of Your Food
Food processing isn't an easy thing to do, so here are seven machines which make it easier.
by Nursah ErgüEver wondered how food processing works?  If they did, it'd take a long time and the prices would be higher, obviously. But then how does it work?
How is the food we see in the markets made? How do they prepare our favorite chocolate, the cake we always buy, or the ice cream we go for all the time?
SEE ALSO: WHAT DOES A FOOD ENGINEER ACTUALLY DO?
Well, with the technology we have today, it's not so difficult to make it all within seconds with machines which would take longer if humans made the same.
Here are seven wonders of processing that will show you how the foods are made.
1. Unifller Cake Finishing Equipment
Without a doubt, you wonder how your favorite cake in the market is made and it tastes the same every time. Well, wonder no more. With this cake finishing equipment, it's easy to create the same delicious cake all the time. Yeah, it may be difficult to make the same cake without a mistake if it was made by humans, but technology never fails to succeed, or at least in food processing.
2. Handtman PVLH241 Sausage Making Machine
With this machine, it's much easier to make both cooked sausage or dry ones like mini-salami. Of course, sausages or salami don't come in the shape you're familiar with. They need a long process to end up with the shape you're familiar with. And once again, humans would take longer to create it, but with this machine, it becomes easier and less time-consuming, also the margin of error of a machine is less than a human being.
3. Egg Breaker OVO-tech
You must be familiar with the fuss of breaking eggs and separating yolks from whites. And maybe you wonder how they do it in big factories. Do a group of people come together and while some of them are breaking eggs, the rest of them are separating the yolks and the whites. Well, not really. Mostly thanks to these kinds of machines, it's much easier to do it. This machine can wash, disinfect, and break 25,600 eggs per hour. Crazy, isn't it?
4. Weber SmartLoader Side Loading System
This machine is an automatic side loading system for single products or individual portions. It can be used for sliced products and it can be combined with different types of slicers and portioners. So again, we have the technology for everything, even for grouping the products, which can be done by humans. But again, since machines are faster, why bother humans, right?
5. Julie's Organic Ice Cream Production
It's always refreshing and pleasing to eat a tasty ice-cream. And probably at one point in your life, you've wondered how are ice-creams made? You've been buying the same ice-cream which has been your favorite since your childhood and you never saw a difference in the ice-cream over the years. Surprise, it's not difficult to produce ice-creams with a machine.
It sounds like a dream right? An ice-cream production factory and a machine that creates thousands of ice-creams per hour, yummy!
6. Chocolate Covering and Tempering Machine
Chocolate is the most favorite dessert of many people in the world. And you wonder, how can something be this good? It's actually so simple to make chocolate with this machine. So, no, your favorite chocolate that you think comes from heaven it's actually made in a factory by some machines. But don't be disappointed, the machine is your friend, and you should be thankful for the mighty chocolate that it makes for you.
7. Textor High-Speed Bacon Slicing Line
Even thinking about bacon makes you hungry, right? It's one of the most mouth-watering tastes in the world. But to be honest, it's not so easy to make bacon with an amazing shape. Because creating really thin bacon, which is the distinctive feature of it, can be really difficult and time-consuming for humans. So, here's another brand to save the day; they have the machine that can slice perfect shaped bacon for you.
It works so smoothly and quickly to deliver the most delicious bacon to your local market. Everybody say thank you Dear Bacon Slicing Machine!


Deep Learning with Keras & Tensorflow: from Zero to Hero in 3 Hours
a workshop with Karla Fejfarová & Petr Šimeček
Deep Learning is everywhere. It beats us in Go and Chess, translates our texts between languages, turns steering wheels of self-driving cars and tags Not-Hotdogs on out photos.
We will introduce the basic concepts and demonstrate them on two examples: dogs vs. cats image classification and text generation from Nietzsche’s writings. Moreover, we provide similar datasets for you to practice and, in the end, deploy the trained models as a simple API service.
Because we will be working in a cloud, all you need is a laptop and a decent web browser (not IE 6.0). Beginners are welcome. Ph.D. degree in machine learning definitely not needed. However, a familiarity with Jupyter Notebooks and some experience with numpy module might be useful (you can easily get it from Udacity/Datacamp/… online materials).
This workshop is suitable for both beginner and advanced Pythonistas.
Karla Fejfarová
I'm a researcher at the Institute of Molecular Genetics by day and a Python girl by night (also early mornings, due to fast.ai fellowship and time difference between Prague and San Francisco). Most of my data look like a mouse skeleton. Deep learning is one of my data processing tools.
Petr Šimeček
I worked for ten years as a biostatistician. Now I'm trying to be a data scientist/quantitative analyst at Google and not to lose my mind. Most of my data look like a line with a bump in the middle (aka time series).


[85]
University of East Anglia Communications. Global Carbon Emissions Need to Shrink by 10 Times Faster.
https://earth.stanford.edu/news/global-carbon-emissions-need-shrink-10-times-faster-0#gs.3792lq
.


Just in: Truck crushes Karota officer to death in Kano
Kolade Adeyemi, Kano
An officer of the Kano State Road and Traffic Agency (KAROTA) was on Saturday crushed to death by a truck driver at Hotoro Mega Filling Station, within the metropolis.
The Nation reports that, the incident happened a day after the police in Kano arrested a driver (Alkasim Usaini) who also ran over another official of the agency (Ahmad Tijjani) on the 29th of Oct, 2019 while on duty.
In a statement signed by the Public Relations Officer of the agency, Nabilisi Abubakar K/Na’isa in Kano on Sunday,explained that the deceased identified as Abdulrahaman was killed by the reckless truck driver.
He said body of deceased officer has since been evacuated from the scene and rushed to the Murtala Muhammad Specialist Hospital.
He was pronounced dead before he was attended by the doctors on duty.
READ ALSO: Military truck crushes female student in Damaturu
The Managing Director of the Agency, Baffa Dan’agundi, said ” we are bereaved and sad over the unfortunate incident and as well condole with the family members of the late officer.
Dan’agundi, however, warned the general public to desist from such act as the law would catch up with anyone who engages in committing such crime.
Luck, however, ran out for the driver, as colleagues and other people around the scene of the incident succeeded in preventing the driver from escaping, as he was arrested and handed over to the police in the area for further investigation.


BlockShow
Exclusive: SingularityNET Announces Its New PayPal Integration
by Dylan LoveThe bridge between crypto and fiat is getting stronger.
Speaking on stage at BlockShow Asia 2019, Chief Scientist and CEO of decentralized AI marketplace SingularityNET Ben Goertzel announced new support for conventional PayPal transactions to support the purchase of the platform’s AGI tokens.
“We’re excited about this. It opens the door for new ways to promote and grow the network,” Goertzel said.
This move grants SingularityNET easy access to PayPal’s 286 million users. Earlier iterations of this marketplace required customers to pay for AI services offered by AI agents in the network using the AGI utility token. But this conventional PayPal integration means users don’t necessarily need any experience with cryptocurrency to use the platform.
The technology on the backend converts fiat PayPal transactions directly into AGI utility tokens. Those tokens drive the AI agents that provide services on SingularityNET. It happens invisibly, the user doesn’t need to concern himself with AGI tokens at all. They simply pay for AI services from an AI agent on the marketplace with PayPal, and get the services they require.
The unification between the worlds of crypto and fiat is a standout trend at BlockShow Asia 2019. Alchemy Global Payment Solutions CEO Patrick Ngan spoke at length about his company’s product that seeks to do the same thing.


3,154
Applicants
1,546
Interviews
912
Forwards
San Francisco, CA
-
Preview this post
Applicants
Interviews
Forwards
Job Description |
|
| Position Title | Customer Service Representative |
| Location | San Francisco, CA |
| Employment Type | Full-time |
| Experience | Mid-level |
| Status | Open |
| Description | Some kind of ipsum here. blahdy blah blah blah I'll find something, this is silly. life and stuff and things happening. |
| Hiring Lead | Tom Tizzy |
| Approved Salary | $58,000 |


| 1 |
| h02 |
| CS16 M18 |
| Name: | ||||
|---|---|---|---|---|
| (as it would appear on official course roster) | ||||
| Umail address: | @umail.ucsb.edu | |||
| Optional: name you wish to be called if different from name above. | ||||
| Optional: name of "homework buddy" (leaving this blank signifies "I worked alone" |
h02: Variables and assignments, input/output, data types and expressions, simple flow control
| ready? | assigned | due | points |
|---|---|---|---|
| true | Tue 07/03 08:00AM | Tue 07/10 11:00AM |
You may collaborate on this homework with AT MOST one person, an optional "homework buddy".
MAY ONLY BE TURNED IN IN THE LECTURE LISTED ABOVE AS THE DUE DATE,
OR IF APPLICABLE, SUBMITTED ON GRADESCOPE. There is NO MAKEUP for missed assignments;
in place of that, we drop the four lowest scores (if you have zeros, those are the four lowest scores).
Reading: Section 1.3, Sections 2.1 - 2.4
- (10 pts) Fill in the information in the header. The following are required to get the 10 "participation" points.
- Filling in your name and umail address.
- Also: For paper submission PLEASE submit on ONE SHEET OF PAPER, double-sided if at all possible. If you must submit on two printed sheets write name on BOTH sheets and no staples, paperclips, or folded corners.
- Filling in your name and umail address.
- (9 pts) The author describes the difference between "syntax errors" and "logic errors", and also the difference between syntax errors that produce an "error message" vs. those that produce a "warning message". Briefly explain each of the items below in a way that makes the DIFFERENCES among them clear: i. Syntax errors that result in an error message: ii. Syntax errors that result in an warning message: iii. Logic errors:
- (2 pts) If the following statement were in a C++ program, what would it do? Write the correct statement if there is a syntax error.
cout >> "I love oranges and apples";
- (2 pts) If the following statement were in a C++ program, what would it do? Write the correct statement if there is a syntax error.
cout << "The world goes round and round"
- (4 pts) Show 2 different ways to initialize variables in C++?
- (4 pts) Is this variable declaration statement in C++ a good one? Why or why not?
double int = 30;
- (4 pts) How do you write the following in ONE LINE in C++: Subtract a from b and add that sum to c, then divide that result by d, and store the final result in e? Assume all variables are of type double.
- (5 pts) Explain via an example what a "type mismatch" is. Also explain how compilers handle C++ statements that have a type mismatch?
- (6 pts) Write an if-else statement that outputs the string "Grade is B" if the variable
score
is between 80 and 90 inclusively. Otherwise the if-else statement should output "Grade is not B"? - (4 pts) What is the output of the following C++ statements? Explain why.
int x = 20, y = 5; bool v, w; v = (x != y); w = ((x /= y) == 4); cout << x << " " << y << " " << v << " " << w << endl;


Find your next home
We’re here to help you apply for a housing choice voucher and find affordable housing
What's a housing choice voucher?
The housing choice voucher program is a federal program for providing financial assistance to low-income families, the elderly, and the disabled to afford safe, sanitary, and decent homes. You can find out more here.
How does DwellWell work?
DwellWell makes the process for taking advantage of housing choice voucher program easy. Simply create an account, answer a few questions, and select a home that fits your budget.


Select console
Browse Events
Cluster
FQL
Create New Dashboard
Logout
Loading…
From Table
*
Add Query
Date Range
Sort
Select
Latest first
Oldest first
Show more
Browse Events
Events
Export data
Choose columns
COLUMN SELECTION
Save
Select all available columns


Details Entered by {{data.fullName}}
Full Name:
{{data.fullName}}
Father/Husband Name:
{{data.fatherName}}
Gender:
{{data.gender}}
Nationality
{{data.nationality}}
Contact No:
{{data.contactNumber}}
Address:
{{data.address}}
Service Name:
{{data.serviceType.serviceName }}
Status:
{{data.status.status}}
Change the Status:
Status
Comment:
Submit
Back


|
Misc
|
| PID |
${pid} |
| Registered Tasks |
% if registered_tasks:
${", ".join(registered_tasks)} |
% else:
|
% endif
|
Active Tasks
|
% if not active_tasks:
|
No active tasks
|
% else:
| Name |
ID |
args |
kwargs |
% for task in active_tasks:
| ${task["name"]} |
${task["id"]} |
${task["args"]} |
${task["kwargs"]} |
% endfor
|
% endif
|
Scheduled Tasks
|
% if not scheduled_tasks:
|
No scheduled tasks
|
% else:
| Name |
ID |
ETA |
Priority |
args |
kwargs |
% for task_container in scheduled_tasks:
<% task = task_container["request"] %>
| ${task["name"]} |
${task["id"]} |
${task_container["eta"]} |
${task_container["priority"]} |
${task["args"]} |
${task["kwargs"]} |
% endfor
|
% endif
|
Reserved Tasks
|
% if not reserved_tasks:
|
No reserved tasks
|
% else:
| Name |
ID |
args |
kwargs |
% for task in reserved_tasks:
| ${task["name"]} |
${task["id"]} |
${task["args"]} |
${task["kwargs"]} |
% endfor
|
% endif
|
Broker
|
| Hostname |
${broker["hostname"]} |
| Login Method |
${broker["login_method"]} |
| Port |
${broker["port"]} |
| Transport |
${broker["transport"]} |
| Timeout |
${broker["connect_timeout"]} |
|
Pool
|
| Max Concurrency |
${pool["max-concurrency"]} |
| Process PIDs |
${", ".join(str(x) for x in pool["processes"])} |
|
Total Tasks Run
|
% if totals:
% for task, runs in totals.items():
| ${task} |
${runs} |
% endfor
% else:
No tasks run yet
|
% endif


Model/Blockstate Name
Type
BlockState
Model
Display
(default)
ground
gui
head
fixed
thirdperson_righthand
thirdperson_lefthand
firstperson_righthand
firstperson_lefthand
Variant
Camera
MultiPart conditions


Wildfire
During a wildfire:
- Monitor local radio stations.
- Be prepared to evacuate at any time. If told to evacuate, do so.
- Keep all doors and windows closed in your home.
- Remove flammable drapes, curtains, awnings or other window coverings.
- Keep lights on to aid visibility in case smoke fills the house.
- If sufficient water is available, turn sprinklers on to wet the roof and any water-proof valuables.


--- layout: page title: Workshops permalink: /workshops/ published: true --- {% for post in site.posts %} {% if post.categories contains 'workshop' %} [{{post.date | date: "%b %-d, %Y"}}] {{ post.title }} {% endif %} {% endfor %}


|
BitMagic-C++
|
Bitvector class with very limited functionality. More...
#include <bmvmin.h>
Public Member Functions | |
| bvector_mini (unsigned size) | |
| bvector_mini (const bvector_mini &bvect) | |
| ~bvector_mini () | |
| int | is_bit_true (unsigned pos) const |
| Checks if bit pos 1 or 0. Returns 0 if 0 and non zero otherwise. More... | |
| void | set_bit (unsigned pos) |
| Sets bit number pos to 1. More... | |
| void | clear_bit (unsigned pos) |
| Sets bit number pos to 0. More... | |
| unsigned | bit_count () const |
| Counts number of bits ON. More... | |
| int | compare (const bvector_mini &bvect) |
| Comparison. More... | |
| unsigned | get_first () const |
| Returns index of the first ON bit. More... | |
| unsigned | get_next (unsigned idx) const |
| Returns index of next bit, which is ON. More... | |
| void | combine_and (const bvector_mini &bvect) |
| void | combine_xor (const bvector_mini &bvect) |
| void | combine_or (const bvector_mini &bvect) |
| void | combine_sub (const bvector_mini &bvect) |
| const unsigned * | get_buf () const |
| unsigned | mem_used () const |
| void | swap (bvector_mini &bvm) |
Bitvector class with very limited functionality.
Class implements simple bitset and used for internal and testing purposes.
|
inline |
|
inline |
|
inline |
|
inline |
Counts number of bits ON.
Definition at line 321 of file bmvmin.h.
Referenced by bm::bvector_mini< A >::compare().
|
inline |
|
inline |
Definition at line 421 of file bmvmin.h.
References bm::bvector_mini< A >::get_buf().
|
inline |
Definition at line 446 of file bmvmin.h.
References bm::bvector_mini< A >::get_buf().
|
inline |
Definition at line 458 of file bmvmin.h.
References bm::bvector_mini< A >::get_buf().
|
inline |
Definition at line 433 of file bmvmin.h.
References bm::bvector_mini< A >::get_buf().
|
inline |
Comparison.
Definition at line 335 of file bmvmin.h.
References bm::bvector_mini< A >::bit_count(), bm::bvector_mini< A >::get_first(), and bm::bvector_mini< A >::get_next().
|
inline |
Definition at line 470 of file bmvmin.h.
Referenced by bm::bvector_mini< A >::combine_and(), bm::bvector_mini< A >::combine_or(), bm::bvector_mini< A >::combine_sub(), and bm::bvector_mini< A >::combine_xor().
|
inline |
Returns index of the first ON bit.
Definition at line 372 of file bmvmin.h.
Referenced by bm::bvector_mini< A >::compare().
|
inline |
Returns index of next bit, which is ON.
Definition at line 396 of file bmvmin.h.
Referenced by bm::bvector_mini< A >::compare().
|
inline |
|
inline |
|
inline |
|
inline |


These tests exercise the statemachine widget
| Basic State Machine |
State Valid |
State Invalid
|
| Basic State Machine (with initial state set) |
State Valid |
State Invalid
|
| Change state with Action |
State Valid |
State Invalid
|


Many things in life are seemingly left up to chance. In everyday life, we often hear or say phrases like “That was pretty random.” or “What are the odds of that happening?”, but can you explain what it really means for something to be ‘random’ or ‘up to chance’? Whether you’re a gambler, an anxious student, or just plain sick and tired of the weather recently, you probably want to understand something in your life that seems or feels random.
Probability is an attempt to make sense of this perceived randomness and provide some laws or axioms for describing random processes so that we can investigate them systematically. In practice, we know that a probability describes the chance that some event will (or will not occur), but this answer alone leaves much to be desired. There’s several fundamental questions we’re left to answer.
In my case, the first that comes to mind is “How does one measure a probability?”
A coin toss is the most basic probability model.
In many scenarios, we flip a coin to decide the outcome. For example, if one wants to decide which person goes first in checkers or who has to take out the trash, it’s not uncommon to hear someone say “Let’s flip a coin for it.” Why is this? Is this even fair? What does ‘fair’ even mean when you leave something up to chance like this?
Well, you might say it’s fair because your intuition tells you that around half of the time we toss a coin it should come up heads and the other half tails. More simply said, we have two possible outcomes \(\omega = H\) and \(\omega = T\) which we think are equally likely (whatever that means).
To be precise and consistent, we’ll write these possible outcomes in terms of a set
\[ \Omega = \{ H,T \}. \]
As you can see in the most basic coin toss, there are only two outcomes in this experiment. This is a handy model if we need to make a decision between exactly two possible choice, but what will happen if we have 3, 4, or even 1000 possible outcomes.
Let’s switch to a more complicated example: tossing two coins sequentially. In case of two tosses, we can represent outcomes by looking at the two coin tosses separately. The first toss being \(\Omega_1 = \\{ H, T \\}\) and the second \(\Omega_2 = \\{ H, T \\}\). Putting these together, we can see that we have four possible outcomes
\[ \Omega = \Omega_1 \times \Omega_2 = \{ HH, HT, TH, TT\}. \]
The coin tossing example is extremely neat in that sense that it serves as a nice foundational example for the larger language around probability which we’re trying to develop. As our next step towards that goal, we’ll begin by defining a couple of terms.
An outcome \(\omega\) is a single possible result of a given experiment like the coin tosses above.
The set of possible outcomes \(\Omega\) is called the sample space.
Another important type of objects are events \(E\) which describe some subset of outcomes. Events enable us to ask questions about and compute probabilities concerning several different outcomes simultaneously.
For example, we might ask the question: “When do we have at least one heads?”. We can then look at individual outcomes \(\omega \in \Omega\) which have at least one head and write them as a set
\[ E = \{ \omega \mid \text{There is at least one $H$} \} = \{HH, HT, TH \}. \]
{% include figure image_path=“/assets/images/intro-to-prob/intro-to-prob-event.jpg” height = “200” width = “100” caption=“Sample space \(\Omega\) and an event \(E\).” %}
Oftentimes, we’re interested in the case where an event \(E\) does not occur. We call this event the complement of \(E\) and write
\[ E^c = \{w \not\in E \}, \]
which is the set of outcomes in our sample space that are not in \(E\). In the example above where \(E\) is the set where there is at least one \(H\),
\[ E^c = \{ \omega \mid \text{There are exactly zero $H$}\} = \{ TT \}. \]
In the case of two coin tosses, it’s easy enough to count our possible outcomes, but in order to gain a better picture of our coin-tossing experiment in general, we want to understand the specific properties or chances of our outcomes and combinations of them. That is, when discussing events like above, we want to compare and contrast them in various ways. Important tools for this are called the union (\(\cup\)) and intersection (\(\cap\)) of events.
Combining events
The union of two events \(A\) and \(B\) is simply their combination i.e. the event either \(A\) or \(B\) occurs which we write as
\[ A \cup B = \{\omega \in A \textbf{ or } \omega \in B \} \]
The intersection is the overlap between two events. It is the set of outcomes that are in both \(A\) and \(B\) simultaneously.
\[ A \cap B = \{\omega \in A \textbf{ and } \omega \in B \}. \]
{% include figure image_path=“/assets/images/intro-to-prob/intro-to-prob-intersection.jpg” height = “200” width = “100” caption=“Visualizing intersection (\(\cap\)).” %}
Let’s apply these ideas to the coin tossing example.
Consider the following events. Suppose we flip two fair coins. Let \(A\) be the event where exactly two tosses show heads, \(B\) where the first coin is heads, and \(C\) where the second coin is tails. We begin by writing all of these different events using set notation, so that
\[ A = \{HH\}, B = \{HH, HT\}, C = \{HT, TT \}. \]
First, we’ll find the union of \(B\) and \(C\). In words, this is the event where either the first coin shows heads or the second is tails. In set notation, this is simply:
\[ B\cup C = \{HH, HT \} \cup \{HT, TT \} = \{HH, HT, TT \}. \]
Next up, let’s find the union of \(A\) and \(B\). This is the case where either both coins show heads or the first coin shows heads. Writing this out, we see that
\[ A\cup B = \{HH \} \cup \{HH, HT\} = \{HH, HT\} = B. \]
The event \(A\) is a subset of \(B\) (\(A\subset B\)). You can think about this as follows: If both coins show heads, then the first coin obviously did. This is obvious, but it helps us make a general observation. Sometimes events will completely contain another. If every outcome in event \(A\) is also in event \(B\), we say that \(A\) is a subset of \(B\) and write \(A\subset B\).
Let’s try our hand with the intersection. Starting with the intersection of \(B\) and \(C\). This is the event where either the first coin shows heads and the second is tails. Using sets, we take the outcomes that \(B\) and \(C\) have in common
\[ B\cap C = \{HH, HT \} \cap \{HT, TT \} = \{HT \}. \]
In this case, our intersection only contains a single outcome \(HT\) i.e. the case where the first coin showed heads and the second showed tails which is exactly what we were looking for.
Our choice of \(B\) and \(C\) lead to us having a very simple intersection, but thee fact remains that some events are disjoint or mutually exclusive, meaning that they do not share any outcomes. Take \(A\) and \(C\) for example. It is impossible for both coins to show heads and for the second coin to show tails simultaneously. We can write this as
\[ A\cap C = \{HH \} \cap \{HT, TT \} = \varnothing, \]
where \(\varnothing\) is the empty set containing no elements.
With the above ideas in mind, how might we want to describe the probability of various events given that we know that the probability of each coin being heads is \(\frac{1}{2}\)? In the next section, we’ll develop axioms for dealing with problems in probability.
Axioms of probability
\[ \newcommand{ \Prob }{ \mathbb{P} } \]
For this section, I’ll loosely follow Foundations of the Theory of Probability by A.N. Kolmogorov.
In a way, we can think of a probability as a way of measuring an event. Much like how people have weights (in both pounds and kilograms), we can think about creating a type of rule or measure \(\Prob\) which weights events and collections of events relative to all possible outcomes. If we’re able to find such a measure, we want it to follow a certain set of rules much like the case of the coin tossing example.
First up is a simple convention, we would like all probabilities that things happen to be \(1\). In the simplest case, an event \(E\) can either surely occur so that \(\Prob(E) = 1\) or it cannot \(\Prob(E) = 0\). Therefore, if we look at all possible outcomes simultaneously, we have \(\Prob(\Omega) = 1\).
Since all probabilities are positive or zero, we also require that \(\Prob(E)\geq 0\) for all events \(E\).
Lastly, if two events cannot occur simultaneously i.e. \(A \cap B = \varnothing\), then \(\Prob(A \cup B) = \Prob(A) + \Prob(B).\)
Therefore, our notion of probability must follow these three fundamental rules:
\[ \begin{align} \Prob(\Omega) &= 1,\\ \Prob(E) &\geq 0 \text{ for all events } E,\\ \Prob(A \cup B) &= \Prob(A) + \Prob(B) \text{ if } A \cap B = \varnothing. \end{align} \]
We call these three rules our axioms of probability. They define a way of thinking about probability that is both consistent with our intuition and mathematically useful. If you’ve seen probability before, you’ll probably notice that our three axioms are missing some of the basic statements of probability you’ve previously encountered. Most of those statements are the logical consequences of the axioms we’ve outlined. In this sense, our axioms are a way of describing probability with minimal assumptions. Namely, with these axioms alone, we can show that
\[ \Prob(A) \leq \Prob(B) \text{ if } A \subset B. \]
This also makes sense if we return to the intuition of counting outcomes. If there are more possible outcomes in \(B\), then you expect that the chance \(B\) occurs is greater than the chance that \(A\) occurs as there are now more outcomes to choose from.
When it comes to taking the union of subsets, there’s a more general formula for subsets which may or may not have overlap.
\[ \Prob(A \cup B) = \Prob(A) + \Prob(B) - \Prob( A \cap B ). \]
Formal note: Though it is tempting to say that the set of measurable sets contains every subset, this can sometimes lead us to some strange contradictions. The idea of a permissible collection of measurable sets is formalized by a \(\sigma\)-algebra. You can learn a bit more about this on wikipedia.
Conditional probability and independence
As shown previously, the overlap between events is an important consideration when dealing with probability. Due to this overlap, we might want to ask what is the probability of an event \(A\) occurring if we have already observed \(B\). This is the notion of conditional probability. We can calculate the probability of \(A\) given \(B\) as
\[ \Prob(A\mid B) = \frac{\Prob(A\cap B)}{\Prob(B)}. \]
Intuitively, this allows us to investigate how much additional certainty knowledge of event \(B\) gives us on event \(A\).
If knowing \(B\) gives no information on whether \(A\) occurred, we say that \(A\) and \(B\) are independent. Mathematically, we write that two events \(A\) and \(B\) are independent if
\[ \Prob(A\cap B) = \Prob(A) \cdot \Prob(B). \]
This is equivalent to saying that \(\Prob(A \mid B) = \Prob(A)\) and \(\Prob(B \mid A ) = \Prob(B)\) which I leave to you as an exercise.
Conditional probability is extremely useful because it gives a framework for understanding how certain properties of events may depend on or relate to one another.
Exercise: Prove that \(A\) and \(B\) are independent if and only if \(\Prob(A \mid B) = \Prob(A)\) and \(\Prob(B \mid A ) = \Prob(B)\).
Exercise: Prove the Law of Total Probability i.e. that for any two events \(A\) and \(B\):
\[ \Prob(A) = \Prob(A \mid B) + \Prob(A \mid B^c). \]
Bayes’ theorem.
One particularly important usage of conditional probabilities is Bayes’ theorem. Bayes’ theorem allows us to use the probability of \(A\) given \(B\) to calculate the probability of \(B\) given \(A\). This notion is particularly useful when it comes to analyzing how evidence in terms of data affects the likelihood of different probability distributions. Bayes’ theorem is essential for understanding many of the statistical methods used in computational biology and most computational fields which rely on Markov Chain Monte Carlo (MCMC) for fitting models to data.
Mathematically speaking, Bayes’ theorem states that
\[ \Prob(A\mid B) = \frac{\Prob(B \mid A) \cdot \Prob(A)}{\Prob(B)}. \]
In fact, the proof is simple enough that can derive this directly by writing out the conditional probabilities for \(A\) and \(B\),
\[ \begin{align} \Prob(A\mid B) &= \frac{\Prob(A \cap B)}{\Prob(B)},\\ \Prob(B\mid A) &= \frac{\Prob(B \cap A)}{\Prob(A)}. \end{align} \]
Solving for \(\Prob(A \cap B) = \Prob(B \cap A)\) gives us,
\[ \Prob(A \mid B) \cdot \Prob(B) = \Prob(A \cap B) = \Prob( B \mid A) \cdot \Prob(A) \], so that
\[ \Prob(A\mid B) = \frac{\Prob(B \mid A) \cdot \Prob(A)}{\Prob(B)}. \]
This may seem like just another unmotivated equation, but Bayes’ has a useful interpretation when it comes to discrete probabilities. We’ll explore this is the following example.
Application: Vampire Hunting with Bayes’
Suppose that we’re the average American and we’re deeply concerned with discovering vampires Given that vampires are a one in a million occurrence, we can use Bayes’ theorem alongside the fact that a limited number of people are allergic to garlic and that all vampires are allergic to garlic to ‘test’ for vampires. Let’s write this in terms of probabilities. According the what we’ve written above, we know three things:
\[ \begin{align} \Prob(V+) &= \frac{1}{1000000} = 0.000001,\\ \Prob(G-\mid V-) &= \frac{1}{10000} = 0.00001,\\ \Prob(G- \mid V+) &\approx 1, \end{align} \]
where \(V+\) is vampirism positive, \(V-\) is human, \(G-\) is garlic allergy, \(G+\) is garlic tolerant. Plugging this into Bayes’ theorem, we can calculate the probability of being a vampire if you’re allergic to garlic
\[ \Prob(V+ \mid G-) = \frac{\Prob(G- \mid V+) \cdot \Prob(V+)}{\Prob(G-)}. \]
We have all the values to compute this value except for the probability of being \(G-\). We can compute this by taking advantage of the conditional expectation and the Law of Total Probability. That is, we write that
\[ \Prob(G-) = \underbrace{ \Prob(G-\mid V+) \cdot \Prob(V+) }_{\Prob(\text{Garlic-allergic vampires})} + \underbrace{ \Prob(G-\mid V-) \cdot \Prob(V-) }_{\Prob(\text{Garlic-allergic humans})}. \]
Therefore, the probability that someone is vampire given they’re allergic to garlic
\[ \Prob(V+ \mid G-) = \frac{\Prob(G- \mid V+) \cdot \Prob(V+)}{ \Prob(G-\mid V+) \cdot \Prob(V+) + \Prob(G-\mid V-) \cdot \Prob(V-)}. \]
Thinking of this in terms possible outcomes, this equation shows that probability of being a vampire given a known garlic allergy is the just fraction of garlic-allergic individuals who we expect to be vampires. Since garlic allergy is much more common among vampires, testing first for garlic allergies allows us to have a higher probability of correctly identifying vampires. Computing with the probabilities given above, we find that
\[ \Prob(V+ \mid G-) \approx 0.01 >>> \Prob(V+) = 0.000001. \]
Testing for a garlic-allergy means that we’ll be nearly 10,000 times more likely to successfully identify a vampire than if we just randomly tested or sampled the population for vampires. Though vampires are still rare among those with garlic allergies, we’ve managed to increase the probably of them being identified through the garlic test. There is still hope though. By this same logic, the better our ability to test for vampires and their unique characteristics, the easier it becomes to identify them using Bayes’ Theorem. That means that we can use other methods for identifying vampires such as mirrors and our garlic test together to further increase this probability by considering the probabilities jointly. That being said, please don’t go frolicking your neighborhood waving around garlic and hand mirrors, it’s improbable you’ll find anything.
This post is the first part of a series where I’ll be going over some of the basic ideas behind the basic probability and stats used in my daily research. Next up, I’ll be writing about probability distributions and estimating parameters for them. For a more thorough introduction to probability, I recommend “Theory of Probability and Random Processes” by Koralov and Sinai.
Thank you for taking the time to read! - Marlin Figgins.


This screen contains a collection of settings related to the sensitivity of the various fault code thresholds in the BMS.
The BMS can be configured to set a critical fault code if it detects a large enough difference between the measured pack voltage (via the total pack voltage sensor) and the sum of all the monitored cell voltages (referred to as the summed pack voltage).
The fault code that is set for this condition is considered a critical fault code and will turn off the charger safety, charge enable and discharge enable outputs on the BMS (the DCL and CCL will also reduce to 0A).
The BMS is aware of the nominal (normal) Internal Resistance of the battery pack based on the data entered into the Nominal Cell Resistance table. This value is used to determine the maximum allowable internal resistance for a cell before it is determined to be weak or faulty. In general, this value can be kept at 200% unless finer control is necessary.
The BMS will also set a weak cell fault code if the difference between the open (sitting) cell voltage of any one cell and the average of the rest of the cells is too great. This typically indicates that the cell is either severely out of balance or has greatly diminished capacity.
A weak pack fault indicates when the pack health drops below a programmed value.
| < Battery Profile Descriptions | Nominal Cell Resistance > |


zcash-android-wallet-sdk
/
cash.z.wallet.sdk
/
Synchronizer
/
Status
/
DOWNLOADING
DOWNLOADING
DOWNLOADING
Indicates that this Synchronizer is actively downloading new blocks from the server.


Copy this code to your clipboard or write it down, click on the link below, enter the code, authorize this app, close this app, and re-open this app.
{{googleUserCode}}
{{devices.length}} devices
| Active | Host name |
Type | Description | |
|---|---|---|---|---|
| {{device.name}} | {{device.type}} | {{device.description}} |
500px Feature:
500px Category:
| Max results {{maxResults}} | |
|---|---|
| Order | |
| Safe search | |
| Search | YouTube Podcast Both |
| YouTube Authorization |


Win32 applications now compatible with Windows UWP API -
by Efe UdinRate this post
Non-packaged Win32 applications have a serious challenge in accessing many sought-after Windows APIs and features. The likes of BackgroundTasks, Notifications, LiveTiles, Share and more, are either not available or not easily callable. This is because the programming model for UWP APIs which integrates with the system depends on the following
- Identity – The need for package or application identity to identify the caller, and an identifier to scope data and resources.
- Registration – The need for configuration of machine state during application deployment, which is required by the API and indexed by the package or application identity.
UWP apps require identity and registration and are only available through the appmanifest xml file. In addition, it must connect to the app registration in the Microsoft Store. However, Microsoft is now opening these requirements to make them available through the new <allowExternalContent> element, or the Win32 type of Runtime Behavior type. This means that developers can now use the UWP API in Win32 applications by setting up some new configurations.
More official information from Microsoft on how to use these new configuration features are currently available. If you are a Win32 developer and need guidance, please make sure to click HERE. This means that different Windows applications will now be able to incorporate some of the latest features. These features were previously only available for Microsoft Store applications. They include notifications, background tasks, and sharing. According to Microsoft, it will continue to invest in the UWP API. This is also a step toward eliminating the initial restrictions on these features.


Listen: Audio leaks of Robert Kraft calling President Donald Trump 'divisive and horrible'
by TSD StaffIt’s known that Patriots owner Robert Kraft has been an avid Donald Trump supporter, but he apparently wasn’t always that way, according to some audio that recently leaked out.
Kraft was heard speaking to a colleague at a league meeting back in 2017, in audio that was obtained by TMZ Sports. In it, Kraft criticizes POTUS, calling Trump both “divisive and horrible.”
“I must tell you, I think these dialogues are great,” Kraft said. “But the elephant in the room now, in my opinion, is this kneeling, which every player has a right to do if they feel it’s right. The problem we have is, we have a president that will use that as fodder to do his mission that I don’t feel is in the best interest of the matter.
“It’s divisive, and it’s horrible. And it’s actually the opposite of what you all are trying to do.”
Looks like Kraft may be attempting to play both sides here; but you can’t please everyone.


The roosters around the barnyard started to bleep as the sun began to rise, and soon the sleepy chickens were cheeping as they slowly awoke from their slumber. [G|D]
The dampness of the morning air filled the meadow with a seeping mist as the small creatures crept out of their dens, while a few birds peeped from the branches of tall trees. [G|D]
The fog was rolled up like a blanket over the steep hills as the shepherd herded his flock of sheep, their woolly coats swishing together with each sweep of his crook. [G|D]
As the veep of the company gave his speech, many in the audience kept up their murmured conversations while a few people wept at the powerful words he spoke about the importance of upkeep and maintenance. [G|D]


Money Play. How should Red play 65?
pips Red=142 White=155
(CorrectAnswer= 0/0, ErrorScore= 0)
The bots have taught us to how to play these positions. Hitting two with 8/3*, 8/2* increases the gammon percentage a massive 15% while only giving up 1% overall game winning chances.
Prior to JellyFish hardly anyone would have double hit here. Since then at least most players would consider the move even if they eventually wimp out!
With the cube in the centre 24/18, 23/18 is correct of course because gammons haven’t been activated.
Prior to JellyFish hardly anyone would have double hit here. Since then at least most players would consider the move even if they eventually wimp out!
With the cube in the centre 24/18, 23/18 is correct of course because gammons haven’t been activated.
1. Cubeful 2-ply 8/3* 8/2* Eq.: +0.337 0.609 0.363 0.007 - 0.391 0.108 0.007 2. Cubeful 2-ply 24/18 23/18 Eq.: +0.247 (-0.090) 0.618 0.224 0.005 - 0.382 0.084 0.003 3. Cubeful 0-ply 21/10 Eq.: +0.225 (-0.112) 0.595 0.268 0.007 - 0.405 0.099 0.005 4. Cubeful 0-ply 24/13 Eq.: +0.224 (-0.113) 0.602 0.243 0.006 - 0.398 0.090 0.003 5. Cubeful 0-ply 24/18 8/3* Eq.: +0.205 (-0.133) 0.584 0.295 0.010 - 0.416 0.118 0.008


Written in Python by Miroslav Stamper, Sqlmap is probably the best automated tool to detect and exploit SQL Injection.
Sqlmap fully supports many databases as MySQL, Microsoft SQL Server, PostgreSQL, Oracle (and many more) and is able to detect the following injection types : Boolean based blind, Error based, Union based, Stacked queries, Time based blind, Inline queries. Depending of the target status, sqlmap is also able to :
- prompt an interactive sql shell
- download/upload files
- prompt a web shell
- crack hashed password using a dictionnary attack
- and a lot more…
Below some examples of the main functions using bWAPP
Basic usage
In this example sqlmap has detected that the GET parameter title
of the search function is vulnerable to sql injection.
Well done! Plus it found that 4 different types of injection can be used for exploitation.
Note that sqlmap has also detected that the parameter is vulnerable to XSS attacks which is unfortunatly very common these days…
To perform test on POST field you should write: --data="title=sqlitest&action=search"
In the next example, I’ll turn off the verbose mode.
Information gathering
Who am I ? Where am I ? What can I do ? Once you found an injection point, the next step is to gather as much information as possible about the running environment. This task is very easy with sqlmap which provides a great list of options.
--hostname
--current-user
--privileges
And many more… All collected informations are stored in log files in the ~/.sqlmap
directory.
To get fresh results ignoring the results previously recorded you’ll then have to use --fresh-queries
or --flush-session
or simply remove the corresponding directory.
Enumeration
The next step of the exploitation is to enumerate available databases, tables and columns. Again this is pretty simple with sqlmap.
Databases: --dbs
Tables: -D bwapp --tables
Columns: -D bwapp -T users --columns
Check the official documentation to see the list of all available options.
Getting datas
Now you know the structure of the tables, you can grab all datas you want. To perform that task, I like to use the interactive sql prompt:
You can also dump a table or a database with the option --dump
on the command line. If sqlmap detects hashed strings, it will ask you to crack them or not via a dictionnary based attack.
The default wordlist is +1M length, it’s up you to fill it or provide your own list.
Manage files
Depending of the sql user privileges , the injection type and the filesystem permissions, you maybe could be able to play with the server.
Read file:
Write file:
The option --os-shell
allows you to upload an ASP/JSP/PHP script on the remote server which will render an upload form.

Usefull
Below my favorite options of sqlmap, the ones I always use in all pentest.
--threads=10
: to speed up sqlmap
--tor --tor-type=socks5
: to anonymize the traffic, must be used carefully while performing time based tests
--random-agent
: a different User-Agent for each session
In this time where security is the heart of our job, day after day more and more network admins like to implements WAF, IPS or IDS.
Sqlmap has an option to bypass basic configuration of those systems: --tamper
allows you to trick the requests by applying a filter on the SQL string like random case.
Going further
Sqlmap is a very very powerful tool. After months I still don’t know all options but here are some extra functionnalities who look interesting:
Interaction with Metasploit framework
Smartphone impersonation
Website crawling
Windows registry access


{% block extrahead %}{% endblock %} {# This is a dead simple base template. It only exists to show you #} {# the used blocks and to make it easy to customize the wiki by #} {# just replacing one template (add 'wiki/base.html' to one of #} {# your project's TEMPLATE_DIRS #}
{% block content %}{% endblock %}


Logged out
Back-end is responsible for ending your session.
Thank you for using me
Should I add a confirmation prompt before log out?


{% extends 'base.html' %} {% block title %}Home{% endblock title %} {% block content %}
A COVID-19 Tracker and Voice Assistant built with Django.
{% for data in object_list %}


{{unreferenced|date=February 2013}}
Kohlwurst, Lungenwurst or Lungwurst is a simple, fresh, strongly smoked sausage (Rohwurst) made of lights, pork and fat, which is mostly eaten cooked with kale (cabbage) dishes such as Knieperkohl. It is mainly used in Northeast and Northwest German and Silesian cuisine.
To make Kohlwurst, pork (often the remains of the carcass) and fat are minced; then a similar amount of raw, cleaned lights is also minced. It is then all mixed together and, depending on the specific recipe, seasoned with onions, salt, pepper, marjoram, thyme, mustard seeds and allspice. Finally the sausage meat is loosely filled in casings of natural intestine and smoked for one to two weeks.
Kohlwurst is not fried or boiled, but is gently poached with cooked vegetables.
Comparable sausage types are Bregenwurst and Pinkel.
{{reflist}}
{{Sausage}}
{{meat-stub}} {{germany-cuisine-stub}}


Managing API keys
Now that you know how to create service groups and service descriptors, we will see how to create API keys.
Otoroshi entities
There are 3 major entities at the core of Otoroshi.
- service groups
- service descriptors
- api keys
An API key
related to a service group
to allow you to access any service descriptor
contained in a service group
. You can, of course, create multiple API key
for a given service group
.
In the Otoroshi admin dashboard, we chose to access API keys
from service descriptors
only, but when you access API keys
for a service descriptor
, you actually access API keys
for the service group
containing the service descriptor
.
API keys
can be provided to Otoroshi through :
Otoroshi-Authorization: Basic $base64(client_id:client_secret)
header, in that case, theOtoroshi-Authorization
header will not be sent to the target.Basic
is optional.Authorization: Basic $base64(client_id:client_secret)
header, in that case, theAuthorization
header will be sent to the targetOtoroshi-Token: Bearer $jwt_token
where the JWT token has been signed with theAPI key
client secret, in that case, theOtoroshi-Token
header will not be sent to the target.Bearer
is optional.Authorization: Bearer $jwt_token
where the JWT token has been signed with theAPI key
client secret, in that case, theAuthorization
header will be sent to the targetCookie: access_token=$jwt_token;
where the JWT token has been signed with theAPI key
client secret, in that case, the cookie namedaccess_token
will be sent to the targetOtoroshi-Client-Id
andOtoroshi-Client-Secret
headers, in that case theOtoroshi-Client-Id
andOtoroshi-Client-Secret
headers will not be sent to the target.
List API keys for a service descriptor
Go to a service descriptor using All services
quick link in the sidebar or the search box.
Select a service descriptor
.
Click on API keys
in the sidebar
You should see the list of API keys for that service descriptor
Create an API key for a service descriptor
You can add a name for your new API key, you can also change client’s id and client’s secret. You can also configure the throttling rate of the API key (calls per second), and the authorized number of call per day and per month. You may also activate or de-activate the api key from that screen.
Informations about current quotas usage will be returned in response headers.
Otoroshi-Daily-Calls-Remaining
: authorized calls remaining for this dayOtoroshi-Monthly-Calls-Remaining
: authorized calls remaining for this monthOtoroshi-Proxy-Latency
: latency induced by OtoroshiOtoroshi-Upstream-Latency
: latency between Otoroshi and target
Daily and monthly quotas are based on the following rules :
- daily quota is computed between 00h00:00.000 and 23h59:59.999
- monthly qutoas is computed between the first day of the month at 00h00:00.000 and the last day of the month at 23h59:59.999
Update an API key
To update an API key
, just click on the edit button of your API key
Update the name, secret, state and quotas (if needed) of the API key
and click on the Update API key
button
Delete an API key
To delete an API key
, just click on the delete button of your API key
and confirm the command
Read only
The read only flag on an ApiKey
this apikey can only use allowed services with HEAD
, OPTIONS
and GET
http verbs.
Use a JWT token to pass an API key
You can use a JWT token to pass an API key to Otoroshi. You can use Otoroshi-Authorization: Bearer $jwt_token
, Authorization: Bearer $jwt_token
header and Cookie: access_token=$jwt_token;
to pass the JWT token. You have to create a JWT token with a signing algorythm that can be HS256
or HS512
. Then you have to provide an iss
claim with the value of your API key clientId
and sign the JWT token with your API key clientSecret
.
For example, with an API key like clientId=abcdef
and clientSecret=1234456789
, your JWT token should look like
{
"alg": "HS256",
"typ": "JWT"
}
{
"iss":"abcdef",
"name": "John Doe",
"admin": true
}
in that case, when you sign the token with the secret of the API key<PHONE_NUMBER>
, the signature will be _eancnYCD3makSSox2v2xErjNYkRtcX558QiJGCbino
, resulting in a encoded JWT header like
eyJhbGciOiJIUzI1NiIsInR5cCI6IkpXVCJ9.
eyJpc3MiOiJhYmNkZWYiLCJuYW1lIjoiSm9obiBEb2UiLCJhZG1pbiI6dHJ1ZX0.
_eancnYCD3makSSox2v2xErjNYkRtcX558QiJGCbino


-
An Introduction:
SafeCarz Headquartered in the UK, LONDON, SafeCarz has 25,000 employees in more than 450 offices throughout the country. SafeCarz people enjoy a casual dress code and a unique work environment where all are required to risk, learn, grow and perform. SafeCarz's larger locations house one of the country's largest, most eclectic contemporary art collections.
-
Innovation is in our name:
The Safe Carz Group of Insurance Companies has always lived up to its name by being one step ahead of the insurance industry, and finding new and affordable insurance solutions. We began in 1937 with the first drive-in claims office, became the first to introduce reduced rates for low-risk drivers, and then changed the insurance shopping experience by offering comparison rates on the Web.
Safe Carz continues to find better ways to serve you with our new and personalized Snapshot® program and our Name Your Price® car insurance shopping option.
-
Social Responsibility:
We explore ways to ensure a better future for all within the context of our business. We focus on insurance, which is what we know best, while working hard to minimize our effect on the environment. The decisions we make tie into our Core Values to ensure we're doing the right thing for everyone involved.
-
Safe Carz Ltd Overview:
Get to know Safe Carz better. Meet some of the people who make a difference in our company, learn about our core values and history, and see some of the things Safe Carz has accomplished over the years.
-
Newsroom:
Are you a member of the media? Our Newsroom contains our press kit, news releases, useful statistics, and videos.
-
TV Commercials:
Can’t get enough of Flo? Watch our SafeCarz commercials online any time you want.
-
Jobs:
SafeCarz has been rated one of the top places to start a career because we develop and grow business leaders. View and apply for open positions, and join our network so we can let you know when we have new opportunities.


Southern Maine Men's Book Club
Currently Reading
By
ISBN:
Selected By:
Meeting Date:
Notes:
Book History
| Meeting Date |
Cover |
Title |
Author |
Leader |
Notes |
| Meeting Date |
Cover |
Title |
Author |
Leader |
Notes |
Future Book Suggestions
|
Cover |
Title |
Author |
Leader |
Notes |


In this project, you'll use generative adversarial networks to generate new images of faces.
You'll be using two datasets in this project:
Since the celebA dataset is complex and you're doing GANs in a project for the first time, we want you to test your neural network on MNIST before CelebA. Running the GANs on MNIST will allow you to see how well your model trains sooner.
If you're using FloydHub, set data_dir
to "/input" and use the FloydHub data ID "R5KrjnANiKVhLWAkpXhNBe".
data_dir = './data'
# FloydHub - Use with data ID "R5KrjnANiKVhLWAkpXhNBe"
#data_dir = '/input'
"""
DON'T MODIFY ANYTHING IN THIS CELL
"""
import helper
helper.download_extract('mnist', data_dir)
helper.download_extract('celeba', data_dir)
show_n_images = 25
"""
DON'T MODIFY ANYTHING IN THIS CELL
"""
%matplotlib inline
import os
from glob import glob
from matplotlib import pyplot
mnist_images = helper.get_batch(glob(os.path.join(data_dir, 'mnist/*.jpg'))[:show_n_images], 28, 28, 'L')
pyplot.imshow(helper.images_square_grid(mnist_images, 'L'), cmap='gray')
The CelebFaces Attributes Dataset (CelebA) dataset contains over 200,000 celebrity images with annotations. Since you're going to be generating faces, you won't need the annotations. You can view the first number of examples by changing show_n_images
.
show_n_images = 25
"""
DON'T MODIFY ANYTHING IN THIS CELL
"""
mnist_images = helper.get_batch(glob(os.path.join(data_dir, 'img_align_celeba/*.jpg'))[:show_n_images], 28, 28, 'RGB')
pyplot.imshow(helper.images_square_grid(mnist_images, 'RGB'))
Since the project's main focus is on building the GANs, we'll preprocess the data for you. The values of the MNIST and CelebA dataset will be in the range of -0.5 to 0.5 of 28x28 dimensional images. The CelebA images will be cropped to remove parts of the image that don't include a face, then resized down to 28x28.

You'll build the components necessary to build a GANs by implementing the following functions below:
model_inputs
discriminator
generator
model_loss
model_opt
train
This will check to make sure you have the correct version of TensorFlow and access to a GPU
"""
DON'T MODIFY ANYTHING IN THIS CELL
"""
from distutils.version import LooseVersion
import warnings
import tensorflow as tf
# Check TensorFlow Version
assert LooseVersion(tf.__version__) >= LooseVersion('1.0'), 'Please use TensorFlow version 1.0 or newer. You are using {}'.format(tf.__version__)
print('TensorFlow Version: {}'.format(tf.__version__))
# Check for a GPU
if not tf.test.gpu_device_name():
warnings.warn('No GPU found. Please use a GPU to train your neural network.')
else:
print('Default GPU Device: {}'.format(tf.test.gpu_device_name()))
Implement the model_inputs
function to create TF Placeholders for the Neural Network. It should create the following placeholders:
image_width
, image_height
, and image_channels
.z_dim
.Return the placeholders in the following the tuple (tensor of real input images, tensor of z data)
import problem_unittests as tests
def model_inputs(image_width, image_height, image_channels, z_dim):
"""
Create the model inputs
:param image_width: The input image width
:param image_height: The input image height
:param image_channels: The number of image channels
:param z_dim: The dimension of Z
:return: Tuple of (tensor of real input images, tensor of z data, learning rate)
"""
# TODO: Implement Function
input_real = tf.placeholder(tf.float32, (None,image_width, image_height, image_channels),name = "input_real")
input_z = tf.placeholder(tf.float32,(None,z_dim),name = "input_z")
learning_rate = tf.placeholder(tf.float32, name = "learning_rate")
return input_real, input_z, learning_rate
"""
DON'T MODIFY ANYTHING IN THIS CELL THAT IS BELOW THIS LINE
"""
tests.test_model_inputs(model_inputs)
Implement discriminator
to create a discriminator neural network that discriminates on images
. This function should be able to reuse the variables in the neural network. Use tf.variable_scope
with a scope name of "discriminator" to allow the variables to be reused. The function should return a tuple of (tensor output of the discriminator, tensor logits of the discriminator).
def discriminator(images, reuse=False):
"""
Create the discriminator network
:param images: Tensor of input image(s)
:param reuse: Boolean if the weights should be reused
:return: Tuple of (tensor output of the discriminator, tensor logits of the discriminator)
"""
# TODO: Implement Function
keep_prob = 0.8
with tf.variable_scope('discriminator', reuse = reuse):
# input size 28*28*3
layer1 = tf.layers.conv2d(images, 64, 5, strides = 2,padding = 'same')
relu1 = tf.maximum(0.12*layer1,layer1) # leaky relu
# 14*14*64
layer2 = tf.layers.conv2d(relu1,128,5,strides=2,padding='same')
layer2 = tf.nn.dropout(layer2, keep_prob=keep_prob)
layer2 = tf.layers.batch_normalization(layer2, training = True)
relu2 = tf.maximum(0.12*layer2,layer2)# leaky relu
# 7*7*128
layer3 = tf.layers.conv2d(relu2,256,5,strides=2,padding='same')
layer3 = tf.nn.dropout(layer3, keep_prob=keep_prob)
layer3 = tf.layers.batch_normalization(layer3, training= True)
relu3 = tf.maximum(0.12*layer3,layer3)
flatten_layer = tf.reshape(relu3, (-1,4*4*256))
flatten_layer = tf.layers.dropout(flatten_layer, rate=0.3)
logits = tf.layers.dense(flatten_layer,1)
out = tf.sigmoid(logits)
return out, logits
"""
DON'T MODIFY ANYTHING IN THIS CELL THAT IS BELOW THIS LINE
"""
tests.test_discriminator(discriminator, tf)
Implement generator
to generate an image using z
. This function should be able to reuse the variables in the neural network. Use tf.variable_scope
with a scope name of "generator" to allow the variables to be reused. The function should return the generated 28 x 28 x out_channel_dim
images.
def generator(z, out_channel_dim, is_train=True):
"""
Create the generator network
:param z: Input z
:param out_channel_dim: The number of channels in the output image
:param is_train: Boolean if generator is being used for training
:return: The tensor output of the generator
"""
# TODO: Implement Function
with tf.variable_scope('generator', reuse = not is_train):
layer1 = tf.layers.dense(z,7*7*512);
layer1 = tf.reshape(layer1,(-1,7,7,512))
relu1 = tf.maximum(0.12*layer1,layer1)
relu1 = tf.nn.dropout(relu1,keep_prob=0.8)
# input 7*7*512
layer2 = tf.layers.conv2d_transpose(relu1,256,5,strides=1,padding='same')
layer2 = tf.layers.batch_normalization(layer2, training = is_train)
relu2 = tf.maximum(0.12*layer2,layer2)
# output 7*7*256
relu2 = tf.nn.dropout(relu2,keep_prob=0.8)
layer3 = tf.layers.conv2d_transpose(relu2,128,5,strides=2,padding='same')
layer3 = tf.layers.batch_normalization(layer3, training = is_train)
relu3 = tf.maximum(0.12*layer3,layer3)
# 14*14*128
logits = tf.layers.conv2d_transpose(relu3,out_channel_dim,5,strides=2,padding='same')
output = tf.tanh(logits)
return output
"""
DON'T MODIFY ANYTHING IN THIS CELL THAT IS BELOW THIS LINE
"""
tests.test_generator(generator, tf)
Implement model_loss
to build the GANs for training and calculate the loss. The function should return a tuple of (discriminator loss, generator loss). Use the following functions you implemented:
discriminator(images, reuse=False)
generator(z, out_channel_dim, is_train=True)
def model_loss(input_real, input_z, out_channel_dim):
"""
Get the loss for the discriminator and generator
:param input_real: Images from the real dataset
:param input_z: Z input
:param out_channel_dim: The number of channels in the output image
:return: A tuple of (discriminator loss, generator loss)
"""
# TODO: Implement Function
g_model = generator(input_z,out_channel_dim)
d_model_real, d_logits_real = discriminator(input_real)
d_model_fake, d_logits_fake = discriminator(g_model, reuse=True)
d_loss_real = tf.reduce_mean(tf.nn.sigmoid_cross_entropy_with_logits(logits=d_logits_real,
labels=tf.ones_like(d_model_real)*0.9))
d_loss_fake = tf.reduce_mean(
tf.nn.sigmoid_cross_entropy_with_logits(logits=d_logits_fake, labels=tf.zeros_like(d_model_fake)))
g_loss = tf.reduce_mean(
tf.nn.sigmoid_cross_entropy_with_logits(logits=d_logits_fake, labels=tf.ones_like(d_model_fake)))
d_loss = d_loss_real + d_loss_fake
return d_loss, g_loss
"""
DON'T MODIFY ANYTHING IN THIS CELL THAT IS BELOW THIS LINE
"""
tests.test_model_loss(model_loss)
Implement model_opt
to create the optimization operations for the GANs. Use tf.trainable_variables
to get all the trainable variables. Filter the variables with names that are in the discriminator and generator scope names. The function should return a tuple of (discriminator training operation, generator training operation).
def model_opt(d_loss, g_loss, learning_rate, beta1):
"""
Get optimization operations
:param d_loss: Discriminator loss Tensor
:param g_loss: Generator loss Tensor
:param learning_rate: Learning Rate Placeholder
:param beta1: The exponential decay rate for the 1st moment in the optimizer
:return: A tuple of (discriminator training operation, generator training operation)
"""
# TODO: Implement Function
t_vars = tf.trainable_variables()
d_vars = [var for var in t_vars if var.name.startswith('discriminator')]
g_vars = [var for var in t_vars if var.name.startswith('generator')]
# Optimize
with tf.control_dependencies(tf.get_collection(tf.GraphKeys.UPDATE_OPS)):
d_train_opt = tf.train.AdamOptimizer(learning_rate, beta1=beta1).minimize(d_loss, var_list=d_vars)
g_train_opt = tf.train.AdamOptimizer(learning_rate, beta1=beta1).minimize(g_loss, var_list=g_vars)
return d_train_opt, g_train_opt
"""
DON'T MODIFY ANYTHING IN THIS CELL THAT IS BELOW THIS LINE
"""
tests.test_model_opt(model_opt, tf)
"""
DON'T MODIFY ANYTHING IN THIS CELL
"""
import numpy as np
def show_generator_output(sess, n_images, input_z, out_channel_dim, image_mode):
"""
Show example output for the generator
:param sess: TensorFlow session
:param n_images: Number of Images to display
:param input_z: Input Z Tensor
:param out_channel_dim: The number of channels in the output image
:param image_mode: The mode to use for images ("RGB" or "L")
"""
cmap = None if image_mode == 'RGB' else 'gray'
z_dim = input_z.get_shape().as_list()[-1]
example_z = np.random.uniform(-1, 1, size=[n_images, z_dim])
samples = sess.run(
generator(input_z, out_channel_dim, False),
feed_dict={input_z: example_z})
images_grid = helper.images_square_grid(samples, image_mode)
pyplot.imshow(images_grid, cmap=cmap)
pyplot.show()
Implement train
to build and train the GANs. Use the following functions you implemented:
model_inputs(image_width, image_height, image_channels, z_dim)
model_loss(input_real, input_z, out_channel_dim)
model_opt(d_loss, g_loss, learning_rate, beta1)
Use the show_generator_output
to show generator
output while you train. Running show_generator_output
for every batch will drastically increase training time and increase the size of the notebook. It's recommended to print the generator
output every 100 batches.
def train(epoch_count, batch_size, z_dim, learning_rate, beta1, get_batches, data_shape, data_image_mode):
"""
Train the GAN
:param epoch_count: Number of epochs
:param batch_size: Batch Size
:param z_dim: Z dimension
:param learning_rate: Learning Rate
:param beta1: The exponential decay rate for the 1st moment in the optimizer
:param get_batches: Function to get batches
:param data_shape: Shape of the data
:param data_image_mode: The image mode to use for images ("RGB" or "L")
"""
# TODO: Build Model
input_real, input_z, lr = model_inputs(data_shape[1], data_shape[2], data_shape[3], z_dim)
d_loss, g_loss = model_loss(input_real, input_z, data_shape[3])
d_optimizer, g_optimizer = model_opt(d_loss, g_loss, lr, beta1)
with tf.Session() as sess:
sess.run(tf.global_variables_initializer())
for epoch_i in range(epoch_count):
step = 0
for batch_images in get_batches(batch_size):
# TODO: Train Model
batch_images = 2*batch_images
step+=1
batch_z = np.random.uniform(-1, 1, size=(batch_size, z_dim))
_ = sess.run(d_optimizer, feed_dict = {input_real:batch_images, input_z: batch_z, lr:learning_rate})
_ = sess.run(g_optimizer, feed_dict = {input_real:batch_images, input_z: batch_z, lr:learning_rate})
if step%10==0:
train_loss_d = d_loss.eval({input_real: batch_images, input_z: batch_z})
train_loss_g = g_loss.eval({input_z: batch_z})
print("Epoch {}".format(epoch_i),
"The No. {} steps loss_d is {}".format(step,train_loss_d),
"The No. {} steps loss_g is {}".format(step,train_loss_g))
if step%100==0:
show_generator_output(sess, show_n_images, input_z, data_shape[3], data_image_mode)
Test your GANs architecture on MNIST. After 2 epochs, the GANs should be able to generate images that look like handwritten digits. Make sure the loss of the generator is lower than the loss of the discriminator or close to 0.
batch_size = 128
z_dim = 128
learning_rate = 0.001
beta1 = 0.5
"""
DON'T MODIFY ANYTHING IN THIS CELL THAT IS BELOW THIS LINE
"""
epochs = 2
mnist_dataset = helper.Dataset('mnist', glob(os.path.join(data_dir, 'mnist/*.jpg')))
with tf.Graph().as_default():
train(epochs, batch_size, z_dim, learning_rate, beta1, mnist_dataset.get_batches,
mnist_dataset.shape, mnist_dataset.image_mode)
Run your GANs on CelebA. It will take around 20 minutes on the average GPU to run one epoch. You can run the whole epoch or stop when it starts to generate realistic faces.
batch_size = 64
z_dim = 128
learning_rate = 0.0001
beta1 = 0.6
"""
DON'T MODIFY ANYTHING IN THIS CELL THAT IS BELOW THIS LINE
"""
epochs = 1
celeba_dataset = helper.Dataset('celeba', glob(os.path.join(data_dir, 'img_align_celeba/*.jpg')))
with tf.Graph().as_default():
train(epochs, batch_size, z_dim, learning_rate, beta1, celeba_dataset.get_batches,
celeba_dataset.shape, celeba_dataset.image_mode)
When submitting this project, make sure to run all the cells before saving the notebook. Save the notebook file as "dlnd_face_generation.ipynb" and save it as a HTML file under "File" -> "Download as". Include the "helper.py" and "problem_unittests.py" files in your submission.


Buy the game pls more
pls buy more
Insert shop here pls
Add Categories
Display products to the right?


Component: tos.lib.net.TrickleTimerMilliC
generic configuration TrickleTimerMilliC(uint16_t low, uint16_t high, uint8_t k, uint8_t count)
Provides
interface
TrickleTimer
[uint8_t]
Wiring


This is based on Tridactyl's buildbot page. I noticed these links not getting hints once due to fractional document.elementFromPoint arguments, that needed rounding upwards.
Project page
Latest betas


You can download my resume here.
My name is Joakim Engström, I was born 1987 and is currently living in Sweden’s capital Stockholm.
I've been working as an Android and iOS developer since 2011, my main fuel for learning have always been my burning interesting in technology and my creative side, I love creating something you can interact with on a screen. I love to write beautiful code, but also to experiment and hack things together as fast as possible, hopefully writing somewhat beautiful code while doing it.
Steve Jobs gets teased for calling everything magical and revolutionary, but in many regards he was right about the first iPhone.
When I'm not writing code, you can see me at the cinemas watching a too long, oscar-nominated, hard sci-fi film in which the characters randomly break out in song. I also have a bunch of podcasts about various topics I'm listening to whenever I can. Sometimes you can also see me practicing running for a race or marathon which I've been dumb enough to sign up to.
You can constantly see me at local meetups, I also try to go to as many hackathons and conferences as I can.
I'm working on the iZettle android application. The app is really expansive and covers many features that is needed for a merchant. I'm one of the developers that has been working longest on the app and the work has included:
Worked as an advisor on how the structure the app and UI recommendations on the flow and design.
I did iOS development for GuidePal's iPhone and iPad application. The app consists of several travel guides inside one app and each guide consists of:


{% extends "account/layout.html" %} {% block title %}{{ _('Delete Account') }}{% endblock %} {% block contents %}
{{ _('Do you really want to delete your account?') }}


Our stone art which is sourced locally, is hand crafted using only finest quality of materials. This will increase the longevity of your purchase.
We make sure you recieve your personalized art as soon as we have finished making it. We also provide free returns if you are not satisfied.
For every purchase you make, we will ensure there are no damages or faults. 100% money back guarantee!


Hi this website aims to introduce myself to who may work with me. I'm interested in how technology shapes our society and how can we make it better and I like making interactive front-end and art. I got my CS master from Boston University in 2017 and bachelor from National Taiwan University in 2014. Worked as a Software Engineer in Amazon in the U.S and a contractor for making NFT arts and websites. Now living in Tokyo working in a fintech. I'm an easy going Taiwanese globalism. p.s This site may be outdated, so plz check my resume you received as the best referance. Feel free to message me on LinkedIn for cooperation.
[Scala, Java] Japan Tokyo Remote, Aug 2022 - Current
- To migrate a campaign life cycle management system (banner, coupons, cash back, push
notification) from PayTM
to PayPay (both companies owned by SoftBank), we deployed Kubernetes on AWS and achieved
2000+ tps and fixed several bugs.
[JavaScrip, Python, Solidity] New York Remote, Feb 2020 - Aug 2022
- Designed and developed the NFT game ChickenGenesis that sell and mint animated NFT
as
digit-pets. Built
interactive UI with animations based on-chain data. The front-end uses React.js + web3.js
and Node.js and Python as backend to generate gif animated NFT.
- Teaching coding for 100+ students online & offline on MentorX inc. and HaHow inc. with 5
star reviews.
[Java, JavaScript, Python] New York, Aug 2018 - Feb 2020
・To measure off-line sales (scan receipts to analyze ad performance), conducted Amazon
Shopper Panel App system
design with 6 ppl team. Cooperated with designers from UI/UX design to building the
ReactNative mobile app for both iOS & Android. Also a micro-service to download receipts.
・ To report advertising performance to clients, we collected terabytes of user data
everyday when an audience see an ad slot. For the 300+ million audiences, we built data
pipeline and run sparks on AWS EMR clusters. Each cluster is 30+ hosts, that generate
reports like how much percentage of audiences purchased the product after watching the ad.
・ Maintaining IMDbAdvertisingService (500k req/5min, 190 hosts) for IMDb.com (the movie
rating site owned by Amazon). We deliver the Ads with image or video. I implemented ad
preview page, A/B test tool, and various changes based on business requirements.
・ To block requests from robots for IMDb, we collected robot IP addresses and built a
bloom filter to reject robots. Reduced 40% of the unnecessary requests from robots and
speeded up the response to less than 400ms.
MAY - JUL 2016
・ A platform connects coach and student. Built a new feature on their web app for admins to see
historical user feedbacks with statistic info.
・Tech: Ruby on Rails, Node.js, SQL, React.js,
Webpack, Cache optimization, MVC,
Behavior driven development
AUG - OCT 2015
・Wrote the minimal viable product’s frontend and provided UX consulting at Harvard’s incubation
center.
・ Tech: CSS, Html5, JavaScript, Rapid prototyping
SEP 2016 - CURRENT
・ A cross-platform web&mobile app to message in realtime, browse and edit user profiles. Built
Facebook log in, message system, profile system, MongoDB data base, React.js front-end, unit test,
acceptance test, UI/UX design. Implemented agile, TDD, and code review procedure.
・ Tech: Meteor.js, Node.js, MongoDB, React.js, MVC, MVVM, Distributed data model, Test driven dev.,
Latency compensation (Asynchronous), Materialize Design
JUN 2016 - CURRENT
GPA 4/4 in CS-542 Machine Learning
・ A series of machine leaning algorithms to do Classification, Regression, and Cluster on datasets.
Like classifying handwriting image to characters, predicting a man may get heart disease or not by
attributes.
・ Tech: KNN, Random Forest, K means, SVM, Neuron Network, Python, numpy, Scikit-learn.
Github
Report
NOV - DEC 2016
・ A computer vision program can track the helicopter to improve business workflow and replace human
power.
・ Tech: Background subtraction, Optical flow field, Optical flow tracking, OpenCV, C++, Google
Vision API
Private
Github
・ Implemented it from line to surface to 3D object. Deployed animation, collision detection,
chasing, group behavior.
・ Tech: OpenGL, Bresenham's algorithm, DDA, Phong, Gouraud rendering, spect, diffuse, ambient light,
Java.
Github
[Sketch App, React, JavaScrip] Global Remote, 2022
- Designed the Cross Chain Bridge UI and logo for MAP Protocol. The app trasnfer assets to multiple chains.
- Designed a small mobile game 2048 in blockchain version.
FEB - DEC 2014
・ To encourage a healthy viewing distance, we built an app and a researching method that detect
user’s viewing distance, warn users, analyzes user behaviors.
・ Tech: IOS, HCI, OpenCV, Face detection, motion capture, statistics, user study.
Publication on
ACM
Here are few components I made for my own projects, to creating a loading icon that is not boring.
You can scrolling them to play with them and I tried several patterns.
See the Pen logo animi - infinite rotate 2 by Den (@Denly) on CodePen.
See the Pen Pink Gift by Den (@Denly) on CodePen.
I like draw illustrations and keep myself creative and productive.


Search...
Library Catalog + Articles
Course Reserves
Databases
Melvyl
Subject + Course Guides
Site Search
Library Catalog + Articles
Course Reserves
Databases
All UC Libraries (Melvyl)
Subject + Course Guides
Site Search


mobilAP Documentation - User/Directory Administration
Managing Users and the Directory
The user directory shows all the users who have been added to the mobilAP user account system. Administrators can manage this list, assign privileges and upload photos as needed. You have several options for creating users:
- Adding users manually
- Importing users using a tab-delimited file
- Allowing users to self-register and create their own account
Note all the steps assume you have logged in as a site administrator. Most of these activities must be done using the desktop interface rather than the mobile interface.
Adding users manually
- Click on Directory in the menu
- Click the + icon. The detail pane should appear on the right.
- Enter the user's first and last names and email (these are required fields)
- Optionally enter the user's organization. Because this field is not actually labeled (besides this form), you can use it however you like. In other words, it doesn't necessary have to represent organization.
- The admin switch will make or revoke the user's ability to administer the site. Obviously this should only be for user's you completely trust. There is no distinction between administrators. All administrators have the same abilities. This is NOT necessary if you simply want to make a user a presenter
- Optionally upload a photo
- Click Save
Note: the user's default password will be their email address. For sites where you require passwords for admins or presenters, you should strongly encourage user's to change their password if security is a concern. Use the Setting Administration to change password settings.
Importing Users
If you have many users to add, you can create a simple tab-delimited file and import the users more quickly. You should begin by viewing the example_import.xls file in the import directory of the mobilAP download archive.
Editing the example_import.xls file
- Open the spreadsheet file (any spreadsheet program capable of reading MS Excel files and exporting tab-delimited files should work)
- The first row contains the field names and order. There are example rows that you can remove
- Save/Export the file to tab-delimited format. Please note that comma delimited format is not currently supported. The name of the file is not important, but keep track of where you save the file on your computer.
Alternatively, you can create a tab-delimited file manually using the example_import.tab file as a guide. Once you have this file, you can upload it to your site
Importing the file
- Click on Directory in the menu
- Click the Import button
- Browse and select the file on your computer. This file must be tab-delimited
- Click Upload to upload the file. Any errors should be shown
- Only users with valid values will be shown, if there seems to be a missing row, check that the values are valid (i.e. First and last name and valid email address)
- Verify that the field order is correct. If you need to make corrections you will need to reimport the file
- Click Add All to import all the visible users
- Optionally you can click Add next to individual users to add a subset of users.
Note: the user's default password will be their email address. For sites where you require passwords for admins or presenters, you should strongly encourage user's to change their password if security is a concern. Use the Setting Administration to change password settings.
Editing a user
- Click on Directory in the menu
- Click the user you wish to edit in the directory list. The detail panel should appear on the right.
- Click the edit button in the detail pane
- Update the users's first and last names and email as necessary (these are required fields)
- Optionally update the user's organization. Because this field is not actually labeled (besides this form), you can use it however you like. In other words, it doesn't necessary have to represent organization.
- The admin switch will make or revoke the user's ability to administer the site. Obviously this should only be for user's you completely trust. There is no distinction between administrators. All administrators have the same abilities. This is NOT necessary if you simply want to make a user a presenter
- Optionally upload a photo
- Click Reset Password to reset their password to their email address
- Click Save to update the data
- Click Don't Save to cancel your changes
- Click Delete to remove this user completely. This cannot be undone.
Directory Photos
mobilAP supports attaching photos to user's directory entries. This is useful to help people put names with faces and vice versa. Because of the specific nature of photo uploading and processing there are some additional requirements for using the photo upload system in mobilAP:
- The web server (www user in Mac OS X) must have write access to the mobilAP/data/directory folder
- File uploads must be enabled in PHP (this is typically not a problem)
- Either SIPS or GD to process thumbnails (see below)
Uploaded pictures must be JPEG format. After uploading the system will attempt to create a thumbnail it will use one of the following methods:
- The Scriptable Image Processing System (SIPS), part of Mac OS X
- The GD Image Library functions (Included on some but not all PHP installations)
If neither of those facilities are available, the operation will fail.
A word about orientation
Some digital cameras support a mode where the orientation of the camera is recorded with the photo and it will rotate the image. Since there are some web browsers that do not recognize this data, mobilAP will attempt to reorient files so their canvas matches their orientation. Support for this feature requires:
- The Exif functions PHP module (typically enabled on many PHP installations)
- The GD Image Library functions (Included on some but not all PHP installations)
Presuming those requirements are met, mobilAP should be able to automatically fix orientation problems. Otherwise, you will need to use an image processing program to re-save the files without this data. Using Adobe Photoshop's Save for Web function is a good example.
Announcements - Return to Administration


Below you can browse some of my projects. For each project, I am the sole maintainer and creator for the application, as well as any promotional images, icons, assets, descriptions, and videos. Hover or click a project to get started.


Three to Tango (1999) 2 1/2 stars out of 4. Starring Matthew Perry, Neve Campbell, Dylan McDermott and Oliver Platt.

But what the movie, directed by Damon Santostefano, cannot clearly focus on is its attitude toward gays.
The premise is straight out of one of those screwball comedies of the 1930s and '40s.
Oscar Novak (Matthew Perry) and Peter Steinberg (Oliver Platt) are partners in an architectural firm, bidding on a multimillion-dollar project by tycoon Charles Newman (Dylan McDermott).
Through a misunderstanding, Newman is led to believe that Novak and Steinberg are not only partners in business, but in their private lives.
Thus, thinking Oscar "safe," the married millionaire asks the young architect to keep an eye on his mistress, Amy Post (Neve Campbell), an artist.
Of course, Oscar and Amy fall in love, and complications and misunderstandings abound, creating comedic situations.
What seems a bit unclear in the screenplay by Rodney Vaccaro and Aline Brosh Viviano, based on a story by Vaccaro, are their feelings toward gays.
Throughout the film, the script has Oscar constantly denying that he is homosexual as well as feeling embarrassed and humiliated by the entire situation.
In the final reel, Oscar gives one of those heartfelt speeches that is an affirmation of not judging people by their sexual preference, but looking at them as individuals and at their accomplishments.
The scene also features one of the latest - most annoying - clichés to creep into movies: the single clap. After someone finishes a speech or accomplishes something special there is dead silence until one person stands and begins applauding. Then another person joins in and another, until the entire room or arena or stadium is on its feet.
It's not a new idea, of course.
Perry is very adept at physical comedy as he takes shots to the head and groin and gets tackled by a football player who falls for him after his "coming out."
Campbell is luscious as the free-spirited artist. She glows on screen.
McDermott is appropriately sleazy as the two-timing villain of the piece, while Pratt easily steals the movie as the wise-cracking gay partner, who, ironically, McDermott's Newman believes is straight.
"Three to Tango" is a lightweight, enjoyable romp. It's not too deep, nor is it preachy. It is what it is. Don't expect anything more.
Bob Bloom is the movie critic at the Journal and Courier in Lafayette, IN. He can be reached by e-mail at<EMAIL_ADDRESS>or a<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


--- title: "Slide Transition" description:
Standard carousel with a sliding transition between slides. This example also contains slides with multiple images.


| 1231 | (A) | there were plente in that place of precyouse stonys |
| (C) | ---- no text ---- | |
| 1218 | (D) | þer was plente of perlis & precious stonys |
| 1194 | (E) | ¶ The was plente of precyous stones . |
| (Ex) | ---- no text ---- | |
| 1259 | (L) | þer was plente in þe place of precious stonys |
| (P) | ---- no text ---- | |
| 1202 | (U) | There was grete plente / of preciouses stones |
| 295 | (V) | þere was plente in place . of many preciouse stones |


localhost
.
Such client works fine on a local machine but it can't be accessed by public IP or domain.
Also the mobile TokenD wallet can't use configuration QR codes generated by localhost-pointed web client.
Warning
Developer edition is not intended for any kind of production use. If you would like to do production or demo deployment, we highly reccomend to use this tool instead.8000
is open on your machhine.
Navigate to http://YOUR_IP:8000/_/api/
while Developer edition is running –
Horizon info must be displayed
80 -> 8060
port forwarding rule on your machine
or edit web_client
port in the docker-compose.yml
file.
Of course in this case ensure that 80
port is open and free on your machine
configs/client.js
file and replace
all occurances of localhost
with your IP or domain
configs/api.yml
and in field storage.client_url
replace
localhost
with your IP or domain
docker-compose restart


Features
- Drag and drop items to sort items
- Hover over items to see the item name
- Right click items to turn the background red (good for tracking what you have)
Optimized Tasks
- Crafting unpowered orbs from scratch
- Crafting and alching fire battlestaves
- Mining ores iron through runite
- Smelting ores iron through runite
- Smithing and banking iron platebodies
- Entrance to crafting guild
- Entrance to the magic axe hut
- Entrance to Edgeville dungeon
- Entrance to Taverly dungeon
- Entrance to Waterfall dungeon
- Crafting holy symbols
- Filling buckets of sand
- Cutting gems
- Craft and alch amulets sapphire through diamond
- Cutting and banking logs: normal, yew, and magic
- Fletching, stringing, and alching yew and magic bows either in one inventory or stringing separately
- Adding chocolate bars to cakes
- Fishing trout, salmon, tuna, lobster, swordfish, shark, sea turtle, and manta ray
- Cooking trout, salmon, lobster, swordfish, shark
- Withdrawing potions and food for combat
- Making all potions but cure poison potion
- Boosting magic
- Withdrawing and depositing runes
- Fletching headless arrows
- Fishing trawler
- Gearing for melee, magic, and ranged combat
- Gearing with prayer gear
- Picking up chocolate bars while cooking in Zanaris
Slightly Less Optimized Tasks
Stuff to Research
- Find out if a chef's hat decreases burn rates
- Find out if Iban's staff is useful in any way


Muthoot Finance to acquire IDBI Mutual Fund
by Special CorrespondentMuthoot Finance has entered into a definitive agreement to acquire IDBI Asset Management Limited and IDBI MF Trustee Company Limited.
The transaction, which is expected to completed by February 2020, would pave the way for Muthoot Finance’s entry into the mutual fund segment.
“Upon completion of the transaction, Muthoot Finance Limited will purchase 100% equity shares of IDBI Asset Management Limited and IDBI MF Trustee Company Limited held by the sellers for a total consideration of ₹215 crore,” said a stock exchange statement by Muthoot Finance.
The transaction is subject to approval from regulators, including the Securities and Exchange Board of India (SEBI).


About eBusiness
Project Management
Lorem ipsum dolor sit amet consectetur adipisicing elit. Magni corporis harum porro obcaecati itaque ullam est sapiente natus excepturi quia suscipit non qui tenetur commodi, quo doloribus. Molestias, exercitationem atque.
Interior design package
Interior design package
Interior design package
Interior design package
Our Services
Expert Coder
will have to make sure the prototype looks finished by inserting text or photo. Make sure the prototype looks finished by
Expert Coder
will have to make sure the prototype looks finished by inserting text or photo. Make sure the prototype looks finished by
Expert Coder
will have to make sure the prototype looks finished by inserting text or photo. Make sure the prototype looks finished by
Expert Coder
will have to make sure the prototype looks finished by inserting text or photo. Make sure the prototype looks finished by
Expert Coder
will have to make sure the prototype looks finished by inserting text or photo. Make sure the prototype looks finished by
Expert Coder
will have to make sure the prototype looks finished by inserting text or photo. Make sure the prototype looks finished by