| I l@ve RuBoard |
Please address comments and questions concerning this book to the publisher:
You can also send us messages electronically. To be put on the mailing list or request a catalog, send email to<EMAIL_ADDRESS>To ask technical questions or comment on the book, send email to<EMAIL_ADDRESS>We have a web site for the book, where we list errata and any plans for future editions. You can find it at http://www.oreilly.com/catalog/pythonwin32/.
For more information about this book and others, see the O'Reilly web site http://www.oreilly.com.
| I l@ve RuBoard |


Police: 7-year-old girl in critical condition after being shot while trick-or-treating in Chicago
by EndPlayCHICAGO - CHICAGO (AP) - Police: 7-year-old girl in critical condition after being shot while trick-or-treating in Chicago.
CHICAGO - CHICAGO (AP) - Police: 7-year-old girl in critical condition after being shot while trick-or-treating in Chicago.


Unhealthy communication patterns influences the relationships between two parties, “It is not what you say, it is how you say it”. Emotion regulation in communication requires people to empathise with the other side and to keep reflecting on his/her own behaviours. The Smart Table physically reflects the dominance of a person in a conversation, aiming at helping families and other disputing or contentious parties, to ease tensions and find more harmonious ways to communicate.
Interview, Empathise, Brainstorming, literature research, prototyping and Wizard-of-Oz test, sensor data visualisation and analysis (D3.js)
An interview about emotion regulation was carried out. The result shows that interviewees do not care so much about their emotions while talking to their family although most of them do while talking to other people. In a close relation, people tend to be more relaxed however the negative effects caused by the recklessness cannot be ignored.
Empathise by observing family communication pattern. The subjects are a family with four members, parents, a son and a daughter that was observed with a camera set up in the kitchen for two days. From the observations, the researcher summarised several typical behaviours that potentially lead to family conflicts.
There are several objects to be considered as the metaphor. Among all the ideas, the dining table was considered as the final decision since it is essential to most of the households: when people start a discussion or just casually chat, they often sit at the table with a cup of drink. Moreover, no matter it is breakfast time or dinner time, the dining room is an area where every family member spends the mealtime together.
Affective computing makes the project possible to read humans' emotions and therefore identify the dominance in a conversation. Driven by Arduino and its components, the table top flips slightly when it detects the imbalance.
Sensor data (Volume) collection and visualisation. During the conversations, most of the recorded data between course mates were balanced which might be because of the topics selected to test since most of them talked about the study plan, travelling, popular TV shows. Except Group Course Mates A had a short conversation, the rest of the groups’ talking durations were about 700-850 seconds (10-15 minutes). The noise (values over 40) is relatively less than the previous test without the table which also suggests the dimension of the table is reasonable because the sound inputs mostly fluctuate within a standard range.
Although the sensor data is not accurate enough to analyse the talking volumes and pitches of both sides, we can still observe the overall talking patterns from the data visualisations. Group Course Mates A (a) and B (b) had a relatively balanced conversation, yet in Group B, the talking duration was relatively longer. These two groups “Strongly Agree” that the table can make them reflect on their behaviours and emotions. The data of Course Mates D (d) represented those groups that started with an “imbalanced conversation”, but after the table reacted to their conversation, the “dominant sides” adjusted the talking length. We can see from the figure, during the first 180 seconds “the Red side” talked predominantly, then the speaker role was taken in turn within a generally fixed duration. This was the most common reactions sequences of participants:
1) starting the conversation
2) noticing the movements and becoming surprised
3) understanding the concept
4) continuing talking, some would try to keep the table balanced whereas some did not react to the movements after a while.
There were two pairs that reacted in the way illustrated by Group C (c) who did not give so many concerns as the other groups, but they still considered it as a good metaphor and a good reminder for self-control. One of the members from Group C commented “I think it's useful to people if they want to change, but they will discard it if they choose not to obey themselves”. A comparable feedback was given by another group whose data was not recorded “It made me think of how to manage my way of talking, but I don't know if I would care in the long run!”. Again, the comments prove that the goal of the smart furniture like the Smart Wardrobe and the Smart Table should be providing a tool for facilitating self-assessment of inappropriate behaviours, instead of forcing them to obey the products’ principles. The concept was successfully conveyed. 75% of participants agreed or strongly agreed that the table was a good metaphor to visualise the imbalanced conversation. Almost 70% agreed that the interruption of the table gave them an appropriate break to reflect their behaviours and emotions. Furthermore, more than half of them considered IoT as a good solution to assist self-control yet some pointed out that whether the products could influence the user also depended on the user’s choice. While many people regarded this Smart Table as a useful product, only a quarter of the feedback were willing to have one at home regardless the price, which might be related to the data security concerns.
Using family communication issue as a case study to design an IoT product is the goal of this project. It allows me to propose an IoT product design methodology to an issue that closely related to everyone. The research on affective computing explored the convergence of Artificial Intelligence and IoT.


Numbers 7:30
On the fourth day Elizur the son of Shedeur, prince of the children of Reuben, did offer:


Thomas Musler
About Me
Work
Contact Me
Contact Me
Feel free to reach out and contact me at any one of these 3 locations! Email is Prefered!


Departure
{{ride.departure}} |
Destination
{{ride.destination}} |
Date
{{ride.time}} |
Passengers
{{ride.passengers}} |
No rides to display.


tock
/
ai.tock.bot.test
/
BotBusMock
/
checkEndCalled
checkEndCalled
fun
checkEndCalled
(
)
:
BotBusMock
(source)
Throws an exception if the end() is not called


C/C++ search
You can conduct a fully or partially qualified name search. Further qualifying a search increases the accuracy and relevance of search results. The sections below provide guidance on how to control the scope of your search through the use of search delimiters, correct syntax, and wildcards.
You can search for:
- language constructs within:
- projects in your workspace
- selected resources from various views
- working sets
- a working set for references to particular elements
- declarations of particular elements
- definitions of particular elements
- references of particular elements
What you can search for
The table below lists the element types that you can search for and special considerations to note when searching for a given element type. You can search for some or all of the element types matching a search string that you specify. If you choose to search for matching elements, all types, macros, and typdefs are included in the search.
| Element | Note |
|---|---|
| Class/Struct | Searches for classes and structs. You can further qualify the search by specifying "class" or "struct" in front of the name that you are searching for. Specifying "class" or "struct" also allows you to search for anonymous classes and structures. |
| Function | Searches for global functions or functions in a namespace
(functions that are not members of a class, struct, or union). You can specify parameters to further qualify your search. When specifying a parameter list, everything between the parentheses should be valid C/C++ syntax. Do not specify the return type of the function. |
| Variable | Searches for variables that are not members of a class, struct, or union. |
| Union | Searches for unions. Anonymous unions can be searched for by specifying "union" as the search pattern. |
| Method | Searches for methods that are members of a class, struct, or
union. Searching for methods also finds constructors and destructors. See above note for functions. |
| Field | Searches for fields that are members of a class, struct, or union. |
| Enumeration | Searches for enumerations. |
| Enumerator | Searches for enumerators. |
| Namespace | Searches for namespaces. |
How you can limit your search
You can limit your search to one or all of the following:
- Declarations
- References
- Definitions (for functions, methods, variables and fields)
You can control the scope of the search by specifying which of the following is to be searched:
- Workspace
- Working Set
- Selected Resources
Wildcard characters
You can use wildcard characters to further refine your search.
| Use this wildcard character | To search for this |
|---|---|
| * | Any string Tip: |
| ? | A single character |
| :: | Nested elements |
Syntax examples
The table below provides syntax examples and an explanation for each example to help you conduct an effective search.
| Syntax | Searches for this |
|---|---|
| ::*::*::A | A nested element two levels deep |
| ::*::*::A? | Any two-letter name that begins with A and is two levels deep |
| ::A | Searches for A not nested in anything |
| operator \* | Finds only operator * |
| operator \*= | Finds only operator *= |
| operator * | Finds all operators |
| class | Searches for anonymous classes |
| struct | Searches for anonymous structs |
| union | Searches for anonymous unions |
Search results
Search results are displayed in the Search view. You can sort your search by Name, Parent Name and Path. You can also repeat your last search.
Search Concepts
Declarations
According to the ANSI C++ Spec, a declaration is a statement that introduces a name into a translation unit or re-declares a name that has been previously introduced by a previous declaration
.
All C/C++ search elements can be searched for declarations.
Definitions
Most declarations are also definitions; in other words, they also define the entity for they declare the name for. However there are some elements that can have separate definitions from their declarations.
For C/C++ search the following elements can be searched for definitions:
- Functions/Methods - the definition is where the code implementation resides
- Variable:
- Extern - the definition is where the variable is initialized
- Non extern - the definition of a variable is where it is declared
- Field:
- Static fields - the definition of a static field is where it gets initialized
- Non static fields - the definition corresponds to the fields declaration
- Namespace - the definition of a namespace is the same as its declaration
References
By selecting references, C/C++ search will return all of the places the selected element is used.
All Occurrences
Selecting 'All Occurrences' in the Limit To section will result in a search for declarations, definitions (if applicable) and references for whatever element or elements have been selected.
Any Element
Selecting 'Any Element' in the Search For section will result in a search for all of the listed elements plus macros and typedefs.
For more information, see:
- Workbench User Guide > Concepts > Views > Search view
- Workbench User Guide > Tasks > Navigating and finding resources
C/C++ Indexer
CDT Projects
Open Declaration
Searching for C/C++ elements
Navigating to C/C++ declarations
C/C++ search page, Search dialog box
C/C++ perspective icons


Use the arrow keys to safely navigate Frogger to one of the lily pads on the opposite side of the highway.


Team Members
Ian Dale
Team Leader
Release Manager
Standards Manager
Communication Manager
Madison Boman
Task Manager
Architectural Manager
Hyungi Choi
Website Manager
Release Manager
Brandon Thomas
Team Manager
Record Manager
Mentor
Isaac Shaffer
Team Mentor


Add a person
Teacher
Student
Add
Reset all
List of People
(To Try and Forget About)
First name
Last name
Email
Role


Oil Change
Our routine oil changes will keep your engine running safe, strong and healthy.
Read MoreCheck us out on our Facebook page for deals and daily updates...
Long-Term Business
Rest easy knowing you're covered wherever you go with Award Winning Car Repairs you can trust.
Our repair and maintenance services include Safety Inspections, Emissions Repairs, Brakes, Oil Change, Fluid Maintenance, Heating & Cooling System, Exhaust Repair, Transmission Flush, Steering & Suspension, Tires, Tune-Up, Check Engine Light, Electrical Diagnostic and Computer Control Systems, and Wheel Alignment Services.
Read MoreManagement Team
Our management team is comprised of people with many years of experience in the long-term care provider and software development industries. Our philosophy is laser-like focus on the customer’s needs.
Iqbal Shaheen
He has been working with cars for over ten years. His expertise is in engines and transmissions.Nasir Khan Jan
He has been an independent Repairman and consultant for nearly 20 years.Arshad Khan
He holds a Bachelor of Car Repairing from the Lahore College of Cars and Engines, Pakistan.Our Hours:
24 Hour Emergency Towing
Monday - Friday: 7:30 am - 6:00 pm
Saturday: 7:30 am - 12:00 pm
Night Drop Available


--- layout: post title: 'Terminal: idea pom.xml' date: 2012-10-24 15:27:18.000000000 +01:00 type: post published: true status: publish categories: - Productivity - Programming tags: [] meta: _edit_last: '1' _syntaxhighlighter_encoded: '1' tmac_last_id: '618797357715427328' author: David Simpson excerpt_separator: ---
I'm lazy. If I can shave a little time off mundane tasks, I'll try. One such task that's bothered me of late is opening a Maven project in Intelli-J.
This seems wasteful:
I just want to type idea pom.xml in Terminal and have my IDE ready and waiting.
For example with TextMate, if I want to view the current project, I'll type mate . in Terminal and all is good. So why not just apply the same to Intelli-J?
How does the mate command work? Well, it's essentially just an alias for open -a TextMate.app
So the simple answer is... open -a IntelliJ IDEA 10.5.4.app pom.xml
Hmmmm. That's a big command for a simple developer to remember. Which version of Intelli-J was I on again?
To sharpen this up, add an alias to ~/.profile
alias idea="open -a IntelliJ IDEA 10.5.4.app"
Now we can just use:
idea pom.xml
If the project has already been imported into Intelli-J, you get this dialog:
I can cope with that. It's already feeling a lot better.


==============================================================================
6. Window resizing *window-resize*
*CTRL-W_=*
CTRL-W = Make all windows (almost) equally high and wide, but
use
'winheight' and 'winwidth' for the current window.
Windows with 'winfixheight' set keep their height and
windows
with 'winfixwidth' set keep their width.
:res[ize] -N *:res* *:resize* *CTRL-W_-*
CTRL-W - Decrease current window height by N (default
1).
If used after |:vertical|: decrease width by N.
:res[ize] +N *CTRL-W_+*
CTRL-W + Increase current window height by N (default
1).
If used after |:vertical|: increase width by N.
:res[ize] [N]
CTRL-W CTRL-_ *CTRL-W_CTRL-_* *CTRL-W__*
CTRL-W _ Set current window height to N (default: highest
possible).
z{nr} Set current window height to {nr}.
*CTRL-W_<*
CTRL-W <<span class="Apple-tab-span"
style="white-space:pre"> Decrease current window width by N
(default 1).
*CTRL-W_>*
CTRL-W > Increase current window width by N (default
1).
:vertical res[ize] [N] *:vertical-resize* *CTRL-W_bar*
CTRL-W | Set current window width to N (default: widest
possible).
You can also resize a window by dragging a status line up or
down with the
mouse. Or by dragging a vertical separator
line left or right. This only
works if the version of Vim that is being used supports the
mouse and the
'mouse' option has been set to enable it.
The option 'winheight' ('wh') is used to set the minimal
window height of the
current window. This option is used each
time another window becomes the
current window. If the option is '0', it is
disabled. Set 'winheight' to a
very large value, e.g., '9999', to make the current window
always fill all
available space. Set it to a reasonable
value, e.g., '10', to make editing in
the current window comfortable.
The equivalent 'winwidth' ('wiw') option is used to set the
minimal width of
the current window.
When the option 'equalalways' ('ea') is set, all the windows
are automatically
made the same size after splitting or closing a window.
If you don't set this
option, splitting a window will reduce the size of the current
window and
leave the other windows the same. When
closing a window, the extra lines are
given to the window above it.
The 'eadirection' option limits the direction in which the
'equalalways'
option is applied. The default "both"
resizes in both directions. When the
value is "ver" only the heights of windows are equalized.
Use this when you
have manually resized a vertically split window and want to
keep this width.
Likewise, "hor" causes only the widths of windows to be
equalized.
The option 'cmdheight' ('ch') is used to set the height of the
command-line.
If you are annoyed by the |hit-enter| prompt for long
messages, set this
option to 2 or 3.
If there is only one window, resizing that window will also
change the command
line height. If there are several windows,
resizing the current window will
also change the height of the window below it (and sometimes
the window above
it).
The minimal height and width of a window is set with
'winminheight' and
'winminwidth'. These are hard values, a
window will never become smaller.
==============================================================================


Hello, Code School!
- Hello my classmates
- I am happy for codeschool
- Iwant to become software fullstack
- And you?
- lets keep it up guyz
- I need to learn Javascript, jquery and ajax for front-end development master
- Again i need to boost my knowledge for php and java


Press n or j to go to the next uncovered block, b, p or k for the previous block.
| File | Statements | Branches | Functions | Lines | |||||
|---|---|---|---|---|---|---|---|---|---|
| block-scoped-vars.js |
|
0% | 0/148 | 0% | 0/64 | 0% | 0/26 | 0% | 0/146 |
| leaking-global-vars.js |
|
0% | 0/142 | 0% | 0/61 | 0% | 0/24 | 0% | 0/139 |
| no-camelcase-vars.js |
|
0% | 0/77 | 0% | 0/43 | 0% | 0/21 | 0% | 0/76 |
| no-underscore-dangle.js |
|
0% | 0/77 | 0% | 0/40 | 0% | 0/24 | 0% | 0/76 |
| unused-assigned-vars.js |
|
0% | 0/36 | 0% | 0/15 | 0% | 0/6 | 0% | 0/34 |


| Modifier and Type | Constant Field | Value |
|---|---|---|
public static final int |
GYRO_CHANNEL |
5 |
public static final int |
LEFT_BACK_MOTOR_CHANNEL |
1 |
public static final int |
LEFT_ENC_CHANNEL_A |
1 |
public static final int |
LEFT_ENC_CHANNEL_B |
2 |
public static final int |
LEFT_FRONT_MOTOR_CHANNEL |
2 |
public static final int |
LEFT_MIDDLE_MOTOR_CHANNEL |
5 |
public static final int |
RIGHT_BACK_MOTOR_CHANNEL |
3 |
public static final int |
RIGHT_ENC_CHANNEL_A |
3 |
public static final int |
RIGHT_ENC_CHANNEL_B |
4 |
public static final int |
RIGHT_FRONT_MOTOR_CHANNEL |
4 |
public static final int |
RIGHT_MIDDLE_MOTOR_CHANNEL |
6 |
| Modifier and Type | Constant Field | Value |
|---|---|---|
public static final int |
AXIS_DPAD |
6 |
public static final int |
BUTTON_A |
2 |
public static final int |
BUTTON_B |
3 |
public static final int |
BUTTON_BUMPER_LEFT |
5 |
public static final int |
BUTTON_BUMPER_RIGHT |
6 |
public static final int |
BUTTON_SELECT |
9 |
public static final int |
BUTTON_START |
10 |
public static final int |
BUTTON_STICK_LEFT |
11 |
public static final int |
BUTTON_STICK_RIGHT |
12 |
public static final int |
BUTTON_TRIGGER_LEFT |
7 |
public static final int |
BUTTON_TRIGGER_RIGHT |
8 |
public static final int |
BUTTON_X |
1 |
public static final int |
BUTTON_Y |
4 |
public static final int |
GAMEPAD1_PORT |
1 |
public static final int |
GAMEPAD2_PORT |
2 |


rand
, srand
—pseudo-random numbersSynopsis
#include <stdlib.h> int rand(void); void srand(unsigned int seed); int rand_r(unsigned int *seed);
Description
rand
returns a different integer each time it is called; each
integer is chosen by an algorithm designed to be unpredictable, so
that you can use rand
when you require a random number.
The algorithm depends on a static variable called the “random seed”;
starting with a given value of the random seed always produces the
same sequence of numbers in successive calls to rand
.
You can set the random seed using srand
; it does nothing beyond
storing its argument in the static variable used by rand
. You can
exploit this to make the pseudo-random sequence less predictable, if
you wish, by using some other unpredictable value (often the least
significant parts of a time-varying value) as the random seed before
beginning a sequence of calls to rand
; or, if you wish to ensure
(for example, while debugging) that successive runs of your program
use the same “random” numbers, you can use srand
to set the same
random seed at the outset.
Returns
rand
returns the next pseudo-random integer in sequence; it is a
number between 0
and RAND_MAX
(inclusive).
srand
does not return a result.
Notes
rand
and srand
are unsafe for multi-threaded applications.
rand_r
is thread-safe and should be used instead.
Portability
rand
is required by ANSI, but the algorithm for pseudo-random
number generation is not specified; therefore, even if you use
the same random seed, you cannot expect the same sequence of results
on two different systems.
rand
requires no supporting OS subroutines.


/**
* Copyright 2017 Google Inc.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
/**
* @fileoverview Contains methods for working with objects.
*/
export function contains(obj: Object, prop: string): boolean {
return Object.prototype.hasOwnProperty.call(obj, prop);
}
export function forEach<T>(
obj: { [key: string]: T },
f: (p1: string, p2: T) => void
) {
for (let key in obj) {
Eif (contains(obj, key)) {
f(key, obj[key]);
}
}
}
export function clone<T>(obj?: { [key: string]: any } | null): T {
if (obj == null) {
return {} as T;
}
let c: { [name: string]: any } = {};
forEach(obj, function(key, val) {
c[key] = val;
});
return c as T;
}
|


| BELT NUMBER | NAME ENGLISH | CHECKPOINT NAME | TOTAL PRESENT | TOTAL DAYS | BILL NO. | ACTION |
|---|---|---|---|---|---|---|
| 1 | Abhi | Court | 24 | 27 | 25431897 |
|
| 2 | Abhi | Court | 24 | 27 | 25431897 |
|
| 3 | Abhi | Court | 24 | 27 | 25431897 |
|
| 4 | Abhi | Court | 24 | 27 | 25431897 |
|
| 5 | Abhi | Court | 24 | 27 | 25431897 |
|
| 6 | Abhi | Court | 24 | 27 | 25431897 |
|
| 7 | Abhi | Court | 24 | 27 | 25431897 |
|
| 8 | Abhi | Court | 24 | 27 | 25431897 |
|
| 9 | Abhi | Court | 24 | 27 | 25431897 |
|
| 10 | Abhi | Court | 24 | 27 | 25431897 |
|


Hello, my name is Jua Xiong. I am a new student at Devcodecamp.
There is something about html coding that I have always had an interest in, but never took the iniative to dive in deeper.
I love to build, and add my own personal touch to the things I make. It is most definitely satisfying and rewarding when your
product comes to fruiton. Within this short time of coding, I have learned many things and one thing for sure is that coding is quite
the love/hate relationship! Here I am today, as one of Devcodecamps students. What a bitter-sweet feeling :)


Appearance
Externally, crabby is very similar to a crab: its upper half, covered with a bone shell, is orange in color and has two protrusions. The lower half of the body is cream colored, and under the mouth there are two fangs. He also has four legs and two claws, which crabby uses as a weapon or for balancing when moving sideways.


Home
Archives
Categories
Tags
About
Tags
busy
2018-02-20
Worst job ever in Japan
japan
2018-02-19
Never let your Voting Power overflown
steem
2018-02-18
I don't want to spend Bitcoin in a store that accepts Bitcoin 讽刺的比特币
bitcoin
2018-02-17
Malaysia's position about cryptocurrency made me proud
teammalaysia
2018-02-16
Test if Cindicator could be another wealth-generating tool
cindicator
2018-02-15
Japan crypto whales is getting away from home? 大鲸逃离日本
cryptocurrency
2018-02-14
My ALL IN story in crypto(part 2) 币圈梭哈(下)
cryptocurrency
2018-02-12
Hi the nation of crypto! 拜访加密货币大国
travel
2018-02-11
Will bitcoin trade over $17000 before March?  评论奖励的分配
steem
2018-01-31
人比人气死人 | 月旦评
cn
2017-12-25
Shihu Garden, the true historical gem (Part 1) 十笏园
travel
2017-12-22
The Seven Day B&W Challenge - Day 5
photography
2017-12-21
The Seven Day B&W Challenge - Day 4
photography
2017-12-19
Cheers to the big green day 一片绿
cn
2017-12-18
Drawing Challenge#12 - Women on a chair 椅子上的女人
drawing
2017-12-17
How much do a Malaysian need to make a living out of SBD?
teammalaysia
Previous
Next
1
…
5
6
7
8
Your browser is out-of-date!
Update your browser to view this website correctly.
Update my browser now
×


Arctic Wild provides professionally guided Alaska adventure tours in Alaska’s vast wilderness. Trust your Alaskan adventure vacation to an experienced Arctic Wild Guide.
Groups are small (1 to 8 people), we travel quietly, and the focus is on the land and its inhabitants. Whether you join us for a base camp trip, river rafting, canoeing or backpacking adventure there is plenty of free time for you to explore, bird watch, photograph, fish or do whatever pleases you most.
Arctic Wild has the perfect Alaskan Adventure for you. Choose from canoeing in Gates of the Arctic National Park, or photographing caribou in the Arctic National Willife Refuge. Experience a backpacking trip in the remote Western Brooks Range, or try rafting on the Kongakut River.


Kristi Bryden
Kristi Bryden
I'm a UI/UX designer and developer. I live in Denver, CO, where I work as an Interactive Content Specialist at Shane Co. I love challenges and puzzles especially while working with fun people. I have a laid back style but a strong work ethic. When I'm not working, you can find me reading, learning, running, or snuggling my cats watching sci-fi movies.
Designer/
Project Manager
Shane Co.
2016-2017
The interactive kiosk was installed January 2017. I started the project in July of 2016. During this process, I designed the interface and content. Put together the project proposal, management plan, sitemap, wireframes, and development approach. I handed off all designs and wireframes to the developers. Managed ordering the hardware and frames, putting in data drops, and installation. I worked with BOYD, Four Winds, Netsic, and our internal IT and Creative department.
Designer/
Developer
MCAD
2016
Zone 5 is a website I developed and designed. The purpose of the site is to provide a useful yet styled gardening guide for people who are living in zone 5a-5b. For this site, I created the strategy, site diagram, mood board, style guides, live wireframes, mockups, and the final site. The project was challenging and fun. I enjoyed mostly using my own photos and videos to fill the pages with content. I used HTML5, CSS, Javascript, and JQuery to complete the final site.
Designer
MCAD
2017
Bad Site Redesigns consist of basic redesigns of poorly designed sites. I have taken user experience, responsive design, and hierarchy into consideration while making these new designs. I also do some brand research so that the brand remains present in the new design.
Designer/
Developer
MCAD
2017
Responsive designs consists of bad site redesigns and original sites. For these websites I created the wireframes, sitemaps, style guides, and the final site. I used HTML5, CSS, Javascript, JQuery, and Github to complete the final site.


High Low Card Game
♠ ♣ ♦ ♥
TEST
Player 1
Card number
Start
Restart
Player 2
score:0
Card number
Next Game


Why Choose Us?
Our website will specify the type such as primary, secondary and tertiary packaging format for the respective food sample.
A package that will provide protection, tampering resistance, and special physical, chemical, or biological needs.
Various tests such as shock, vibration, compression, temperature, bacteria, etc will be taken into account while generating the result.
According the recorded data, the algorithm will generate the optimal solution that can be used as packaging techniques for the food product.


{% extends "base-ticket.html" %} {% block title %}Book a ticket for {{ convention }}{% endblock %} {% block info %}
Please enter the required information about yourself before proceeding to the checkout page.


Ocean [av34], ocean, in The Inner Sea
Last updated Turn #140
Ocean [av34], ocean, in The Inner Sea
------------------------------------------------------------------------
19: General Kraken [k3k], Imperial Empire, duke, priest of the Church of
19: Halon [157], with two winged horses, 44 nazgul, arrived from the west,
19: accompanied by:
19: Phantom III [d6x], Imperial Empire, priest of the Church of
19: Dol [153], with 13 nazgul
19: Veejay [v8j], Imperial Empire, Bishop of the Church of Ham [155],
19: with five angels
19: Goon III [b9v], Imperial Empire, Bishop of the Church of Dol [153],
19: with five angels, 54 hvy. xbowmen, 17 nazgul
19: Lord Rodrigo Bane [c8b], Imperial Empire, priest of the Church of
19: Dol [153], with ten workers, 50 hvy. xbowmen, 15 nazgul
19: Licia [i1l], Imperial Empire, Bishop of the Church of Ham [155],
19: with five angels, 50 hvy. xbowmen
19: Odin [y5z], Imperial Empire, with 35 peasants, 15 soldiers, 55 hvy.
19: xbowmen
19: Thorg [j8u], Imperial Empire, with one warmount
19: Jupiter [m8j], Imperial Empire, duke, the High Priest of the Church
19: of Halon [157], with 21 peasants, 15 soldiers, ten angels,
19: 14 skirmishers, 52 hvy. xbowmen
19: Dryeth [q4e], Imperial Empire, priest of the Church of Dol [153],
19: with 16 nazgul
19: Firefly [f3f], Imperial Empire, priest of the Church of
19: Halon [157], with 50 hvy. xbowmen
19: Sunwalker [a8x], Imperial Empire, duke, Bishop of the Church of
19: Halon [157], with five angels, 52 nazgul
19: Thomas [o5y], Imperial Empire, priest of the Church of Dol [153],
19: with 52 hvy. xbowmen, five nazgul
19: Alexei Galantor [j7l], Imperial Empire, duke, priest of the Church
19: of Halon [157], with 35 peasants, 84 nazgul
19: Sir Peter [u9p], Imperial Empire, with 30 peasants, 20 workers,
19: ten hvy. xbowmen
19: George [p7f], Imperial Empire, duke, priest of the Church of
19: Dol [153], with nine nazgul
19: Lucca [h0t], Imperial Empire, priest of the Church of Halon [157],
19: with one skirmisher, 50 nazgul
19: Johny [w2d], Imperial Empire, priest of the Church of Halon [157],
19: with 41 nazgul
19: Stefano [t8e], Imperial Empire, Bishop of the Church of
19: Halon [157], with 30 peasants, five angels, 50 nazgul
19: Sir Charles [j5r], Imperial Empire, priest of the Church of
19: Halon [157], with 30 peasants, 50 nazgul
19: Everblack [n3r], Imperial Empire, prisoner
19: Majikthise [n4g], Imperial Empire
19: City boy [c5x], Mandor Confederacy, prisoner
19: swift [e6w], Mandor Confederacy, prisoner
19: Aurora [g5z], Mandor Confederacy, prisoner
20: General Kraken [k3k], Imperial Empire, duke, priest of the Church of
20: Halon [157], with two winged horses, 44 nazgul, entered Island [aa8o],
20: accompanied by:
20: Phantom III [d6x], Imperial Empire, priest of the Church of
20: Dol [153], with 13 nazgul
20: Veejay [v8j], Imperial Empire, Bishop of the Church of Ham [155],
20: with five angels
20: Goon III [b9v], Imperial Empire, Bishop of the Church of Dol [153],
20: with five angels, 54 hvy. xbowmen, 18 nazgul
20: Lord Rodrigo Bane [c8b], Imperial Empire, priest of the Church of
20: Dol [153], with ten workers, 50 hvy. xbowmen, 15 nazgul
20: Licia [i1l], Imperial Empire, Bishop of the Church of Ham [155],
20: with five angels, 50 hvy. xbowmen
20: Odin [y5z], Imperial Empire, with 35 peasants, 15 soldiers, 55 hvy.
20: xbowmen
20: Thorg [j8u], Imperial Empire, with one warmount
20: Jupiter [m8j], Imperial Empire, duke, the High Priest of the Church
20: of Halon [157], with 20 peasants, 15 soldiers, ten angels,
20: 15 skirmishers, 52 hvy. xbowmen
20: Dryeth [q4e], Imperial Empire, priest of the Church of Dol [153],
20: with 16 nazgul
20: Firefly [f3f], Imperial Empire, priest of the Church of
20: Halon [157], with 50 hvy. xbowmen
20: Sunwalker [a8x], Imperial Empire, duke, Bishop of the Church of
20: Halon [157], with five angels, 52 nazgul
20: Thomas [o5y], Imperial Empire, priest of the Church of Dol [153],
20: with 52 hvy. xbowmen, five nazgul
20: Alexei Galantor [j7l], Imperial Empire, duke, priest of the Church
20: of Halon [157], with 35 peasants, 84 nazgul
20: Sir Peter [u9p], Imperial Empire, with 30 peasants, 20 workers,
20: ten hvy. xbowmen
20: George [p7f], Imperial Empire, duke, priest of the Church of
20: Dol [153], with ten nazgul
20: Lucca [h0t], Imperial Empire, priest of the Church of Halon [157],
20: with one skirmisher, 50 nazgul
20: Johny [w2d], Imperial Empire, priest of the Church of Halon [157],
20: with 41 nazgul
20: Stefano [t8e], Imperial Empire, Bishop of the Church of
20: Halon [157], with 30 peasants, five angels, 50 nazgul
20: Sir Charles [j5r], Imperial Empire, priest of the Church of
20: Halon [157], with 30 peasants, 50 nazgul
20: Everblack [n3r], Imperial Empire, prisoner
20: Majikthise [n4g], Imperial Empire
20: City boy [c5x], Imperial Empire, prisoner
20: swift [e6w], Mandor Confederacy, prisoner
20: Aurora [g5z], Imperial Empire, prisoner
20: General Kraken [k3k], Imperial Empire, duke, priest of the Church of
20: Halon [157], with two winged horses, 44 nazgul, arrived from
20: Ocean [av34], accompanied by:
20: Phantom III [d6x], Imperial Empire, priest of the Church of
20: Dol [153], with 13 nazgul
20: Veejay [v8j], Imperial Empire, Bishop of the Church of Ham [155],
20: with five angels
20: Goon III [b9v], Imperial Empire, Bishop of the Church of Dol [153],
20: with five angels, 54 hvy. xbowmen, 18 nazgul
20: Lord Rodrigo Bane [c8b], Imperial Empire, priest of the Church of
20: Dol [153], with ten workers, 50 hvy. xbowmen, 15 nazgul
20: Licia [i1l], Imperial Empire, Bishop of the Church of Ham [155],
20: with five angels, 50 hvy. xbowmen
20: Odin [y5z], Imperial Empire, with 35 peasants, 15 soldiers, 55 hvy.
20: xbowmen
20: Thorg [j8u], Imperial Empire, with one warmount
20: Jupiter [m8j], Imperial Empire, duke, the High Priest of the Church
20: of Halon [157], with 20 peasants, 15 soldiers, ten angels,
20: 15 skirmishers, 52 hvy. xbowmen
20: Dryeth [q4e], Imperial Empire, priest of the Church of Dol [153],
20: with 16 nazgul
20: Firefly [f3f], Imperial Empire, priest of the Church of
20: Halon [157], with 50 hvy. xbowmen
20: Sunwalker [a8x], Imperial Empire, duke, Bishop of the Church of
20: Halon [157], with five angels, 52 nazgul
20: Thomas [o5y], Imperial Empire, priest of the Church of Dol [153],
20: with 52 hvy. xbowmen, five nazgul
20: Alexei Galantor [j7l], Imperial Empire, duke, priest of the Church
20: of Halon [157], with 35 peasants, 84 nazgul
20: Sir Peter [u9p], Imperial Empire, with 30 peasants, 20 workers,
20: ten hvy. xbowmen
20: George [p7f], Imperial Empire, duke, priest of the Church of
20: Dol [153], with ten nazgul
20: Lucca [h0t], Imperial Empire, priest of the Church of Halon [157],
20: with one skirmisher, 50 nazgul
20: Johny [w2d], Imperial Empire, priest of the Church of Halon [157],
20: with 41 nazgul
20: Stefano [t8e], Imperial Empire, Bishop of the Church of
20: Halon [157], with 30 peasants, five angels, 50 nazgul
20: Sir Charles [j5r], Imperial Empire, priest of the Church of
20: Halon [157], with 30 peasants, 50 nazgul
20: Everblack [n3r], Imperial Empire, prisoner
20: Majikthise [n4g], Imperial Empire
20: City boy [c5x], Imperial Empire, prisoner
20: swift [e6w], Mandor Confederacy, prisoner
20: Aurora [g5z], Imperial Empire, prisoner
21: Giant spider [dl1j] attacks General Kraken [k3k]!
21:
21: Giant spider [dl1j], giant spiders, number: 14
21:
21: General Kraken [k3k], Imperial Empire, duke, priest of the Church
21: of Halon [157], with two winged horses, 44 nazgul, accompanied by:
21: Phantom III [d6x], Imperial Empire, priest of the Church of
21: Dol [153], behind 9, with 13 nazgul
21: Veejay [v8j], Imperial Empire, Bishop of the Church of
21: Ham [155], behind 5, with five angels
21: Goon III [b9v], Imperial Empire, Bishop of the Church of
21: Dol [153], behind 4, with five angels, 54 hvy. xbowmen,
21: 18 nazgul
21: Lord Rodrigo Bane [c8b], Imperial Empire, priest of the Church
21: of Dol [153], behind 3, with ten workers, 50 hvy. xbowmen,
21: 15 nazgul
21: Licia [i1l], Imperial Empire, Bishop of the Church of Ham [155],
21: behind 6, with five angels, 50 hvy. xbowmen
21: Odin [y5z], Imperial Empire, behind 7, with 35 peasants,
21: 15 soldiers, 55 hvy. xbowmen
21: Thorg [j8u], Imperial Empire, with one warmount
21: Jupiter [m8j], Imperial Empire, duke, the High Priest of the
21: Church of Halon [157], behind 5, with 19 peasants,
21: 15 soldiers, ten angels, 16 skirmishers, 52 hvy. xbowmen
21: Dryeth [q4e], Imperial Empire, priest of the Church of
21: Dol [153], behind 5, with 16 nazgul
21: Firefly [f3f], Imperial Empire, priest of the Church of
21: Halon [157], behind 9, with 50 hvy. xbowmen
21: Sunwalker [a8x], Imperial Empire, duke, Bishop of the Church of
21: Halon [157], with five angels, 52 nazgul
21: Thomas [o5y], Imperial Empire, priest of the Church of
21: Dol [153], behind 7, with 52 hvy. xbowmen, five nazgul
21: Alexei Galantor [j7l], Imperial Empire, duke, priest of the
21: Church of Halon [157], with 35 peasants, 84 nazgul
21: Sir Peter [u9p], Imperial Empire, behind 9, with 30 peasants,
21: 20 workers, ten hvy. xbowmen
21: George [p7f], Imperial Empire, duke, priest of the Church of
21: Dol [153], behind 8, with ten nazgul
21: Lucca [h0t], Imperial Empire, priest of the Church of
21: Halon [157], with one skirmisher, 50 nazgul
21: Johny [w2d], Imperial Empire, priest of the Church of
21: Halon [157], with 41 nazgul
21: Stefano [t8e], Imperial Empire, Bishop of the Church of
21: Halon [157], with 30 peasants, five angels, 50 nazgul
21: Sir Charles [j5r], Imperial Empire, priest of the Church of
21: Halon [157], with 30 peasants, 50 nazgul
21: Majikthise [n4g], Imperial Empire, behind 4
21:
21: Initial missile round for the defense (General Kraken [k3k]):
21: 195 missiles hit!
21: Giant spider [dl1j] loses 13 giant spiders [278].
21:
21: Combat round: one
21: Special attacks phase:
21: Thorg [j8u] dashes out and attacks!
21: Missile phase:
21: General Kraken's forces hit with 195 missiles.
21: Giant spider [dl1j] suffers a hit!
21:
21: General Kraken [k3k] is victorious!
21:
21: Giant spider lost 13 giant spiders.
21: Giant spider [dl1j] was killed.
21:
21: General Kraken [k3k], Imperial Empire, duke, priest of the Church of
21: Halon [157], with two winged horses, 44 nazgul, exited Island [aa8o],
21: accompanied by:
21: Phantom III [d6x], Imperial Empire, priest of the Church of
21: Dol [153], with 13 nazgul
21: Veejay [v8j], Imperial Empire, Bishop of the Church of Ham [155],
21: with five angels
21: Goon III [b9v], Imperial Empire, Bishop of the Church of Dol [153],
21: with five angels, 54 hvy. xbowmen, 18 nazgul
21: Lord Rodrigo Bane [c8b], Imperial Empire, priest of the Church of
21: Dol [153], with ten workers, 50 hvy. xbowmen, 15 nazgul
21: Licia [i1l], Imperial Empire, Bishop of the Church of Ham [155],
21: with five angels, 50 hvy. xbowmen
21: Odin [y5z], Imperial Empire, with 35 peasants, 15 soldiers, 55 hvy.
21: xbowmen
21: Thorg [j8u], Imperial Empire, with one warmount
21: Jupiter [m8j], Imperial Empire, duke, the High Priest of the Church
21: of Halon [157], with 19 peasants, 15 soldiers, ten angels,
21: 16 skirmishers, 52 hvy. xbowmen
21: Dryeth [q4e], Imperial Empire, priest of the Church of Dol [153],
21: with 16 nazgul
21: Firefly [f3f], Imperial Empire, priest of the Church of
21: Halon [157], with 50 hvy. xbowmen
21: Sunwalker [a8x], Imperial Empire, duke, Bishop of the Church of
21: Halon [157], with five angels, 52 nazgul
21: Thomas [o5y], Imperial Empire, priest of the Church of Dol [153],
21: with 52 hvy. xbowmen, five nazgul
21: Alexei Galantor [j7l], Imperial Empire, duke, priest of the Church
21: of Halon [157], with 35 peasants, 84 nazgul
21: Sir Peter [u9p], Imperial Empire, with 30 peasants, 20 workers,
21: ten hvy. xbowmen
21: George [p7f], Imperial Empire, duke, priest of the Church of
21: Dol [153], with ten nazgul
21: Lucca [h0t], Imperial Empire, priest of the Church of Halon [157],
21: with one skirmisher, 50 nazgul
21: Johny [w2d], Imperial Empire, priest of the Church of Halon [157],
21: with 41 nazgul
21: Stefano [t8e], Imperial Empire, Bishop of the Church of
21: Halon [157], with 30 peasants, five angels, 50 nazgul
21: Sir Charles [j5r], Imperial Empire, priest of the Church of
21: Halon [157], with 30 peasants, 50 nazgul
21: Everblack [n3r], Imperial Empire, prisoner
21: Majikthise [n4g], Imperial Empire
21: City boy [c5x], Imperial Empire, prisoner
21: swift [e6w], Mandor Confederacy, prisoner
21: Aurora [g5z], Imperial Empire, prisoner
21: Merchant [jc9q], refugee, prisoner
21: General Kraken [k3k], Imperial Empire, duke, priest of the Church of
21: Halon [157], with two winged horses, 44 nazgul, arrived from
21: Island [aa8o], accompanied by:
21: Phantom III [d6x], Imperial Empire, priest of the Church of
21: Dol [153], with 13 nazgul
21: Veejay [v8j], Imperial Empire, Bishop of the Church of Ham [155],
21: with five angels
21: Goon III [b9v], Imperial Empire, Bishop of the Church of Dol [153],
21: with five angels, 54 hvy. xbowmen, 18 nazgul
21: Lord Rodrigo Bane [c8b], Imperial Empire, priest of the Church of
21: Dol [153], with ten workers, 50 hvy. xbowmen, 15 nazgul
21: Licia [i1l], Imperial Empire, Bishop of the Church of Ham [155],
21: with five angels, 50 hvy. xbowmen
21: Odin [y5z], Imperial Empire, with 35 peasants, 15 soldiers, 55 hvy.
21: xbowmen
21: Thorg [j8u], Imperial Empire, with one warmount
21: Jupiter [m8j], Imperial Empire, duke, the High Priest of the Church
21: of Halon [157], with 19 peasants, 15 soldiers, ten angels,
21: 16 skirmishers, 52 hvy. xbowmen
21: Dryeth [q4e], Imperial Empire, priest of the Church of Dol [153],
21: with 16 nazgul
21: Firefly [f3f], Imperial Empire, priest of the Church of
21: Halon [157], with 50 hvy. xbowmen
21: Sunwalker [a8x], Imperial Empire, duke, Bishop of the Church of
21: Halon [157], with five angels, 52 nazgul
21: Thomas [o5y], Imperial Empire, priest of the Church of Dol [153],
21: with 52 hvy. xbowmen, five nazgul
21: Alexei Galantor [j7l], Imperial Empire, duke, priest of the Church
21: of Halon [157], with 35 peasants, 84 nazgul
21: Sir Peter [u9p], Imperial Empire, with 30 peasants, 20 workers,
21: ten hvy. xbowmen
21: George [p7f], Imperial Empire, duke, priest of the Church of
21: Dol [153], with ten nazgul
21: Lucca [h0t], Imperial Empire, priest of the Church of Halon [157],
21: with one skirmisher, 50 nazgul
21: Johny [w2d], Imperial Empire, priest of the Church of Halon [157],
21: with 41 nazgul
21: Stefano [t8e], Imperial Empire, Bishop of the Church of
21: Halon [157], with 30 peasants, five angels, 50 nazgul
21: Sir Charles [j5r], Imperial Empire, priest of the Church of
21: Halon [157], with 30 peasants, 50 nazgul
21: Everblack [n3r], Imperial Empire, prisoner
21: Majikthise [n4g], Imperial Empire
21: City boy [c5x], Imperial Empire, prisoner
21: swift [e6w], Mandor Confederacy, prisoner
21: Aurora [g5z], Imperial Empire, prisoner
21: Merchant [jc9q], refugee, prisoner
22: General Kraken [k3k], Imperial Empire, duke, priest of the Church of
22: Halon [157], with two winged horses, 44 nazgul, went north,
22: accompanied by:
22: Phantom III [d6x], Imperial Empire, priest of the Church of
22: Dol [153], with 13 nazgul
22: Veejay [v8j], Imperial Empire, Bishop of the Church of Ham [155],
22: with five angels
22: Goon III [b9v], Imperial Empire, Bishop of the Church of Dol [153],
22: with five angels, 54 hvy. xbowmen, 18 nazgul
22: Lord Rodrigo Bane [c8b], Imperial Empire, priest of the Church of
22: Dol [153], with ten workers, 50 hvy. xbowmen, 15 nazgul
22: Licia [i1l], Imperial Empire, Bishop of the Church of Ham [155],
22: with five angels, 50 hvy. xbowmen
22: Odin [y5z], Imperial Empire, with 35 peasants, 15 soldiers, 55 hvy.
22: xbowmen
22: Thorg [j8u], Imperial Empire, with one warmount
22: Jupiter [m8j], Imperial Empire, duke, the High Priest of the Church
22: of Halon [157], with 18 peasants, 15 soldiers, ten angels,
22: 17 skirmishers, 52 hvy. xbowmen
22: Dryeth [q4e], Imperial Empire, priest of the Church of Dol [153],
22: with 16 nazgul
22: Firefly [f3f], Imperial Empire, priest of the Church of
22: Halon [157], with 50 hvy. xbowmen
22: Sunwalker [a8x], Imperial Empire, duke, Bishop of the Church of
22: Halon [157], with five angels, 52 nazgul
22: Thomas [o5y], Imperial Empire, priest of the Church of Dol [153],
22: with 52 hvy. xbowmen, five nazgul
22: Alexei Galantor [j7l], Imperial Empire, duke, priest of the Church
22: of Halon [157], with 35 peasants, 84 nazgul
22: Sir Peter [u9p], Imperial Empire, with 30 peasants, 20 workers,
22: ten hvy. xbowmen
22: George [p7f], Imperial Empire, duke, priest of the Church of
22: Dol [153], with ten nazgul
22: Lucca [h0t], Imperial Empire, priest of the Church of Halon [157],
22: with one skirmisher, 50 nazgul
22: Johny [w2d], Imperial Empire, priest of the Church of Halon [157],
22: with 41 nazgul
22: Stefano [t8e], Imperial Empire, Bishop of the Church of
22: Halon [157], with 30 peasants, five angels, 50 nazgul
22: Sir Charles [j5r], Imperial Empire, priest of the Church of
22: Halon [157], with 30 peasants, 50 nazgul
22: Everblack [n3r], Imperial Empire, prisoner
22: Majikthise [n4g], Imperial Empire
22: City boy [c5x], Imperial Empire, prisoner
22: swift [e6w], Mandor Confederacy, prisoner
22: Aurora [g5z], Imperial Empire, prisoner
22: Merchant [jc9q], refugee, prisoner
Routes leaving Ocean:
North, city, to Pygate [ae3c], Mandoria, 1 day
North, plain, to Plain of Tears [au34], Mandoria, impassable
Garrison [ht8q], garrison, uncontrolled, with ten peasants
East, to Ocean [av35], 6 days
South, to Ocean [aw34], 6 days
West, city, to Elderon [ae4a], Mandoria, 1 day
West, plain, to Plain of Tears [av33], Mandoria, impassable
Inner locations:
Island [aa8o], island, 1 day


WHP Selection - Mr J Smith - {{ questionTitle }}
WHP referral outcome
Mr J Smith is not eligible to take part in the Work and Health Programme
This is because:
- Individual is in paid employment
- Individual is expected to find work in the next 12 months with support of JCP offer
- Individual is unlikely to find employment in the next 12 months
Next steps
Please continue to provide work coach support
Continue


Catalog App
{% if loggedIn==True %}
Hello {{userUsername}}!
Logout
{% endif %}
Title:
Description:
Category:
Soccer
Basketball
Baseball
Frisbee
Snowboarding
Rock Climbing
Foosball
Skating
Hockey


Rajshahi University protesters block highway over BCL attack on fellow student
by bdnews24.comDisgruntled students of Rajshahi University have blocked a highway to protest against an alleged assault on a peer by activists of the Bangladesh Chhatra League.
The protesters took out a rally on the campus on Saturday morning and later staged demonstrations on the Dhaka-Rajshahi Highway, triggering long tailbacks on both sides of the road.
The victim, Sohrab Mia -- a third year student of the Department of Finance and Banking, is currently undergoing treatment at Rajshahi Medical College Hospital for his injuries.
He was allegedly beaten up by Asif Lak and Humayun Kabir Nahid, both residents of the university's Shaheed Shamsuzzoha Hall. They are reportedly close to the BCL’s Rajshahi University unit President Golam Kibria.
“Upon learning about the incident, I spoke to assistant proctor and hall principal. I also spoke to Sohrab's friend Zubair. He is with Sohrab, ” said Proctor Prof Lutfor Rahman.
A group of BCL men, led by Asif, took Sohrab to room No. 254 of the third block of the dormitory around 12:30 am on Saturday, said 'Tonoy', a classmate of the victim.
At one stage, Asif and Humayun started striking Sohrab with rods, which left him with a broken hand.
Informed of the attack, friends of the victim rescued him and took him to the university's medical centre. They later admitted him to the RMCH.
It came after Asif had allegedly slapped Sohrab two days ago over a stolen laptop.
“Two days ago a laptop was stolen from room no 258. We found out that the incident took place between 7pm and 9pm. At that time, two outsiders - Sohan and Aditya - came to meet Sohrab,” he said as he denied slapping Sohrab.
“Later, I spoke to Sohrab about the matter. Sohan also came on Friday. Sohrab and Sohan were smoking cannabis near the water tank of the hall. At that time, I called two of them to room 254."
Golam Kibria was not available for comment.
"The incident is unfortunate. We’ll take appropriate action against those involved in the incident,” said Faisal Ahmed Runu, general secretary of the university's BCL unit General Secretary.
Shaheed Shamsuzzoha Hall Provost Zulkernain said he was looking into the incident.


Emotional conflicts occur on a daily if not weekly occurrence in my life. I have a wife, a big family, opinionated and loving friends. Lots of room for emotional conflict! Some times it is healthy to get it out, other times not so much.
Leading up to our wedding, my wife and I had many arguments. Outside stress coupled with the anxiety of an impending marriage, plus our differences of opinions on matters would often make for a perfect storm of conflict. Sometimes we argued. Sometimes we didn't speak. Other times, we talked through it or just laughed and got it over with right away.
Speaking just regarding my own actions, I can say about 50 percent of the times I made it better and the other half I probably made it worse. I am often times impatient, and unfortunately my mouth often moves quicker than my brain leading to things that should not be said! In this case, as in most cases of emotional conflict, I don't try to "go back" and harp over what can be done differently. That is definitely not healthy. All you can do is take whatever lesson you learned and work towards doing better the next time a conflict arises.


<observe-array-items>
DemoThis demo illustrates setting up an event which is fired whenever a specific property of any item in an array changes.
Here, we're observing changes to the home.phone
property of each item in contacts
.
When a change occurs, we log information about the changed element in the array-item-changed
event handler.
The event handler will be fired whenever the observed property of any item in the array changes, regardless of whether or not the change is made via a Polymer binding.
Click the button below to change a random contact's phone number.
The array-item-changed
event handler will only be fired if the phone number
actually gets updated.


?NO.
/
?(
03~/
PLANTS
OF
KTBcWfrH
EX
HERBARIUM1
OTTO
DEGENEFl"*^"^-04’4*1"^
The
University
of
Texas
at
Arlington
Nama
jamaicense
L.
John
D.
Bacon
igg4
BOTANICAL
XdX
Collected
by
OTTO
DEGENER
(Many
plants
described
in
“Plants
Haw.
Nat.
Park
ILLUSTRATED
“FLORA
HAWAIIENSIS**
“
‘
»s.so
by
Otto
Degener.
HoSSuSiS.
t.
h'1
01498374
Legend -
Level of confidence that token is an accurately-transcribed word
extremely low
very low
low
undetermined
medium
high
very high


.col-xs-9
.col-xs-4
Since 9 + 4 = 13 > 12, this 4-column-wide div gets wrapped onto a new line as one contiguous unit.
.col-xs-6
Subsequent columns continue along the new line.


Address is required
City is required
Zip Code is required
Number of spaces is required
Special instruction is required


Unicode strings and bytestrings in Python 2 Published: 2015-04-21 Character sets, encodings, Unicode and...


ListsAndPoly19
ListAndPoly19: Working with Structured Data and Polymorphism
Set Warnings "-notation-overridden,-parsing".
From Coq Require Import ssreflect ssrbool.
From Coq Require Import ssreflect ssrbool.
Separate Compilation
From LF19 Require Export Basics19.
For the Require Export to work, Coq needs to be able to
find a compiled version of Basics19.v, called Basics19.vo, in a directory
associated with the prefix LF. This file is analogous to the .class
files compiled from .java source files and the .o files compiled from
.c files.
First you need a file named _CoqProject containing the following line:
-Q . LF19
This maps the current directory ".", which contains Basics19.v etc.,
to the prefix (or "logical directory") "LF19".
PG and CoqIDE read _CoqProject automatically, so they know to where to
look for the file Basics19.vo corresponding to the library LF19.Basics19.
Once _CoqProject is thus created, there are various ways to build
Basics19.vo:
If you have trouble (e.g., if you get complaints about missing
identifiers later in the file), it may be because the "load path"
for Coq is not set up correctly. The Print LoadPath. command
may be helpful in sorting out such issues.
In particular, if you see a message like
Compiled library Foo makes inconsistent assumptions over
library Bar
check whether you have multiple installations of Coq on your machine.
It may be that commands (like coqc) that you execute in a terminal
window are getting a different version of Coq than commands executed by
Proof General or CoqIDE.
- In Proof General: The compilation can be made to happen automatically
when you submit the Require line above to PG, by setting the emacs
variable coq-compile-before-require to t.
- In CoqIDE: Open Basics19.v; then, in the "Compile" menu, click
on "Compile Buffer".
- From the command line: Generate a Makefile using the coq_makefile
utility, that comes installed with Coq (if you obtained the whole
volume as a single archive, a Makefile should already exist
and you can skip this step):
coq_makefile -f _CoqProject *.v -o MakefileNote: You should rerun that command whenever you add or remove Coq files to the directory.Then you can compile Basics19.v by running make with the corresponding .vo file as a target:make Basics19.voAll files in the directory can be compiled by giving no arguments:makeUnder the hood, make uses the Coq compiler, coqc. You can also run coqc directly:coqc -Q . LF19 Basics19.vBut make also calculates dependencies between source files to compile them in the right order, so make should generally be prefered over explicit coqc.
- Another common reason is that the library Bar was modified and recompiled without also recompiling Foo which depends on it. Recompile Foo, or everything if too many files are affected. (Using the third solution above: make clean; make.)
Lists of Numbers
Inductive natlist : Type :=
| nil_nat : natlist
| con_nat : nat → natlist → natlist.
| nil_nat : natlist
| con_nat : nat → natlist → natlist.
Of course, this is something you have seen in functional programming and all of you expect to see a polymorphic definition. This is how it looks like in the standard library:
Print list.
===>
list is a function from types to (inductively
defined) types.
Note what Coq tells us:
Inductive list (A : Type) : Type := nil : list A | cons : A → list A → list A
For nil: Argument A is implicit and maximally inserted
For cons: Argument A is implicit and maximally inserted
For cons: Argument A is implicit and maximally inserted
Check nil.
===>
nil
: list ?A
where
?A : [ ⊢ Type]
: list ?A
where
?A : [ ⊢ Type]
Check cons.
===>
We can force the implicit arguments to be explicit by
prefixing the function name with @.
cons
: ?A → list ?A → list ?A
where
?A : [ ⊢ Type]
: ?A → list ?A → list ?A
where
?A : [ ⊢ Type]
Check @nil.
===>
Lots of standard notations are already defined for us:
@nil
: ∀A : Type, list A
: ∀A : Type, list A
Require Export Coq.Lists.List.
Export ListNotations.
Check (1::2::nil).
Export ListNotations.
Check (1::2::nil).
===>
If you want to see how notation is defined, here is how you do it in ssreflect:
[1; 2]
: list nat
: list nat
Locate "_ :: _".
===>
Note the use of list_scope
If you want to see a list of theorems, lemmas etc. using this notation, replace Locate with Search above. Warning: this is going to be a long list!
Notation
"x :: y" := cons x y : list_scope (default interpretation)
"x :: y" := cons x y : list_scope (default interpretation)
Standard functions on lists
Repeat
Print repeat.
===>
Clear what it does?
repeat =
fun A : Type ⇒
fix repeat (x : A) (n : nat) {struct n} : list A := match n with
| 0 ⇒ []
| S k ⇒ x :: repeat x k
end
: ∀A : Type, A → nat → list A
Argument A is implicit
Argument scopes are [type_scope _ nat_scope]
fun A : Type ⇒
fix repeat (x : A) (n : nat) {struct n} : list A := match n with
| 0 ⇒ []
| S k ⇒ x :: repeat x k
end
: ∀A : Type, A → nat → list A
Argument A is implicit
Argument scopes are [type_scope _ nat_scope]
Append
Print app.
===>
app =
fun A : Type ⇒
fix app (l m : list A) {struct l} : list A := match l with
| [] ⇒ m
| a :: l1 ⇒ a :: app l1 m
end
: ∀A : Type, list A → list A → list A
fun A : Type ⇒
fix app (l m : list A) {struct l} : list A := match l with
| [] ⇒ m
| a :: l1 ⇒ a :: app l1 m
end
: ∀A : Type, list A → list A → list A
Locate "_ ++ _".
===>
Notation
"x ++ y" := app x y : list_scope (default interpretation)
"x ++ y" := app x y : list_scope (default interpretation)
Compute [1;2;3] ++ [4;5].
Print hd.
===>
As you can guess, not a very satisfying solution for the empty list.
Here is tail, for completness
hd =
fun (A : Type) (default : A) (l : list A) ⇒ match l with
| [] ⇒ default
| x :: _ ⇒ x
end
: ∀A : Type, A → list A → A
fun (A : Type) (default : A) (l : list A) ⇒ match l with
| [] ⇒ default
| x :: _ ⇒ x
end
: ∀A : Type, A → list A → A
Print tl.
===>
An obvious improvement would be to use option types for head. Obviously, Coq defines them for us too.
tl =
fun (A : Type) (l : list A) ⇒ match l with
| [] ⇒ []
| _ :: m ⇒ m
end
: ∀A : Type, list A → list A
fun (A : Type) (l : list A) ⇒ match l with
| [] ⇒ []
| _ :: m ⇒ m
end
: ∀A : Type, list A → list A
Option types
Print option.
====>
Define the obvious option_hd function. This is how you make an argument implicit, by the way.
Inductive option (A : Type) : Type := Some : A → option A | None : option A
Fixpoint option_hd {A : Type} (l: list A) : option A
(* REPLACE THIS LINE WITH ":= _your_definition_ ." *). Admitted.
Example test_hd1: option_hd [1;2;3] = Some 1.
Proof. (* FILL IN HERE *) Admitted.
Example test_hd2 (A:Type) : @option_hd A [] = None.
Proof. (* FILL IN HERE *) Admitted.
(* REPLACE THIS LINE WITH ":= _your_definition_ ." *). Admitted.
Example test_hd1: option_hd [1;2;3] = Some 1.
Proof. (* FILL IN HERE *) Admitted.
Example test_hd2 (A:Type) : @option_hd A [] = None.
Proof. (* FILL IN HERE *) Admitted.
Theorem hd_is_hd1 : ∀(A : Type) (l : list A) (default : A), option_hd l = None → hd default l = default.
Proof.
(* FILL IN HERE *) Admitted.
Theorem hd_is_hd2 : ∀(A : Type) (l : list A) (default : A) (a: A), option_hd l = Some a → hd default l = a.
Proof.
(* FILL IN HERE *) Admitted.
Proof.
(* FILL IN HERE *) Admitted.
Theorem hd_is_hd2 : ∀(A : Type) (l : list A) (default : A) (a: A), option_hd l = Some a → hd default l = a.
Proof.
(* FILL IN HERE *) Admitted.
Print length.
===>
length =
fun A : Type ⇒ fix length (l : list A) : nat := match l with
| [] ⇒ 0
| _ :: l' ⇒ S (length l')
end
: ∀A : Type, list A → nat
fun A : Type ⇒ fix length (l : list A) : nat := match l with
| [] ⇒ 0
| _ :: l' ⇒ S (length l')
end
: ∀A : Type, list A → nat
Reverse
Print rev.
===>
Complete the definitions of oddmembers and
countoddmembers below. Have a look at the tests to understand
what these functions should do.
rev =
fun A : Type ⇒ fix rev (l : list A) : list A := match l with
| [] ⇒ []
| x :: l' ⇒ rev l' ++ [x]
end
: ∀A : Type, list A → list A
fun A : Type ⇒ fix rev (l : list A) : list A := match l with
| [] ⇒ []
| x :: l' ⇒ rev l' ++ [x]
end
: ∀A : Type, list A → list A
Exercises
Require Import Nat.
This gives us a function odd ...
Fixpoint oddmembers (l:list nat) : (list nat)
(* REPLACE THIS LINE WITH ":= _your_definition_ ." *). Admitted.
Example test_oddmembers:
oddmembers [0;1;0;2;3;0;0] = [1;3].
(* FILL IN HERE *) Admitted.
Definition countoddmembers (l:list nat) : nat
(* REPLACE THIS LINE WITH ":= _your_definition_ ." *). Admitted.
Example test_countoddmembers1:
countoddmembers [1;0;3;1;4;5] = 4.
(* FILL IN HERE *) Admitted.
Example test_countoddmembers2:
countoddmembers [0;2;4] = 0.
(* FILL IN HERE *) Admitted.
Example test_countoddmembers3:
countoddmembers nil = 0.
(* FILL IN HERE *) Admitted.
(* REPLACE THIS LINE WITH ":= _your_definition_ ." *). Admitted.
Example test_oddmembers:
oddmembers [0;1;0;2;3;0;0] = [1;3].
(* FILL IN HERE *) Admitted.
Definition countoddmembers (l:list nat) : nat
(* REPLACE THIS LINE WITH ":= _your_definition_ ." *). Admitted.
Example test_countoddmembers1:
countoddmembers [1;0;3;1;4;5] = 4.
(* FILL IN HERE *) Admitted.
Example test_countoddmembers2:
countoddmembers [0;2;4] = 0.
(* FILL IN HERE *) Admitted.
Example test_countoddmembers3:
countoddmembers nil = 0.
(* FILL IN HERE *) Admitted.
It seems we could think of a more general pattern here.
For example, we could define a function removing all zero elements from lists of natural numbers. Or keep only true values on a list of booleans. Or only lists of length one on a list of lists ...
Higher-Order Functions
Print filter.
====>
For example, if we apply filter to the predicate even
(from the standard library) and a list of numbers l, it returns
a list containing just the even members of l.
filter =
fun (A : Type) (f : A → bool) ⇒
fix filter (l : list A) : list A :=
match l with
| [] ⇒ []
| x :: l0 ⇒ if f x then x :: filter l0 else filter l0
end
: ∀A : Type, (A → bool) → list A → list A
fun (A : Type) (f : A → bool) ⇒
fix filter (l : list A) : list A :=
match l with
| [] ⇒ []
| x :: l0 ⇒ if f x then x :: filter l0 else filter l0
end
: ∀A : Type, (A → bool) → list A → list A
Example test_filter1: filter odd [1;2;3;4] = [1;3].
Proof. by []. Qed.
Proof. by []. Qed.
We now need our boolean equality on nat.
Definition length_is_1 {X : Type} (l : list X) : bool :=
(length l =? 1).
Example test_filter2:
filter length_is_1
[ [1; 2]; [3]; [4]; [5;6;7]; nil; [8] ]
= [ [3]; [4]; [8] ].
Proof. by []. Qed.
(length l =? 1).
Example test_filter2:
filter length_is_1
[ [1; 2]; [3]; [4]; [5;6;7]; nil; [8] ]
= [ [3]; [4]; [8] ].
Proof. by []. Qed.
Print map.
===>
map =
fun (A B : Type) (f : A → B) ⇒
fix map (l : list A) : list B := match l with
| [] ⇒ []
| a :: t ⇒ f a :: map t
end
: ∀A B : Type, (A → B) → list A → list B
fun (A B : Type) (f : A → B) ⇒
fix map (l : list A) : list B := match l with
| [] ⇒ []
| a :: t ⇒ f a :: map t
end
: ∀A B : Type, (A → B) → list A → list B
Flat map
Print flat_map.
===>
flat_map =
fun (A B : Type) (f : A → list B) ⇒
fix flat_map (l : list A) : list B := match l with
| [] ⇒ []
| x :: t ⇒ f x ++ flat_map t
end
: ∀A B : Type, (A → list B) → list A → list B
fun (A B : Type) (f : A → list B) ⇒
fix flat_map (l : list A) : list B := match l with
| [] ⇒ []
| x :: t ⇒ f x ++ flat_map t
end
: ∀A B : Type, (A → list B) → list A → list B
Example testflatmap : flat_map (fun n ⇒ [n;n+1;n+2]) [1;5;10]
= [1; 2; 3; 5; 6; 7; 10; 11; 12].
Proof. by []. Qed.
Example test_flat_map1:
flat_map (fun n ⇒ [n;n;n]) [1;5;4]
= [1; 1; 1; 5; 5; 5; 4; 4; 4].
Proof. by []. Qed.
= [1; 2; 3; 5; 6; 7; 10; 11; 12].
Proof. by []. Qed.
Example test_flat_map1:
flat_map (fun n ⇒ [n;n;n]) [1;5;4]
= [1; 1; 1; 5; 5; 5; 4; 4; 4].
Proof. by []. Qed.
Note how we use anonymous functions here?
A mapping function for options:
Print option_map.
===>
option_map =
fun (A B : Type) (f : A → B) (o : option A) ⇒ match o with
| Some a ⇒ Some (f a)
| None ⇒ None
end
: ∀A B : Type, (A → B) → option A → option B
fun (A B : Type) (f : A → B) (o : option A) ⇒ match o with
| Some a ⇒ Some (f a)
| None ⇒ None
end
: ∀A B : Type, (A → B) → option A → option B
Fold
Fixpoint fold {X Y:Type} (f: X→Y→Y) (l:list X) (b:Y)
: Y :=
match l with
| nil ⇒ b
| h :: t ⇒ f h (fold f t b)
end.
: Y :=
match l with
| nil ⇒ b
| h :: t ⇒ f h (fold f t b)
end.
Intuitively, the behavior of the fold operation is to
insert a given binary operator f between every pair of elements
in a given list. For example, fold plus [1;2;3;4] intuitively
means 1+2+3+4. To make this precise, we also need a "starting
element" that serves as the initial second input to f. So, for
example,
fold plus [1;2;3;4] 0
yields
1 + (2 + (3 + (4 + 0))).
Some more examples:
Check (fold andb).
(* ===> fold andb : list bool -> bool -> bool *)
Example fold_example1 :
fold mult [1;2;3;4] 1 = 24.
Example fold_example2 :
fold andb [true;true;false;true] true = false.
(* ===> fold andb : list bool -> bool -> bool *)
Example fold_example1 :
fold mult [1;2;3;4] 1 = 24.
Proof. by []. Qed.
Example fold_example2 :
fold andb [true;true;false;true] true = false.
Proof. by []. Qed.
Note we have to be careful with polymorphism in the next example
Check @fold (list nat).
Example fold_example3 :
@fold (list nat) (list nat) (@app nat) [[1];nil;[2;3];[4]] nil = [1;2;3;4].
Example fold_example3 :
@fold (list nat) (list nat) (@app nat) [[1];nil;[2;3];[4]] nil = [1;2;3;4].
Proof. by []. Qed.
Many common functions on lists can be implemented in terms of
fold. For example, here is an alternative definition of length:
Definition fold_length (X : Type) (l : list X) : nat :=
fold (fun _ n ⇒ S n) l 0.
fold (fun _ n ⇒ S n) l 0.
Note it is quite useful here that the function f in the definition of fold can take arguments of mixed type.
Arguments fold_length {X}.
This is an alternative way of making arguments implicit, by the way. Sometimes it might make sense: e.g., you want to make constructors of a polymorphic type easier to write, but the type to remain explicitly polymorphic.
Example test_fold_length1 : fold_length [4;7;0] = 3.
Proof. by []. Qed.
Proof. by []. Qed.
Prove the correctness of fold_length. This is our first encounter with induction on lists.
Theorem fold_length_correct : ∀X (l : list X),
fold_length l = length l.
(* WORKED IN CLASS *)
Proof.
move ⇒ ?.
elim ⇒ [|hl tl IHl] /= //.
by rewrite -IHl.
Qed.
fold_length l = length l.
(* WORKED IN CLASS *)
Proof.
move ⇒ ?.
elim ⇒ [|hl tl IHl] /= //.
by rewrite -IHl.
Qed.
We can do the same thing with map, i.e., define it using fold. Can you see how?
The strandard library has a lot of useful theorems about list programs and transformations we have seen. One example:
An example of a more complicated proof
Check rev_length.
====>
How do we prove it?
rev_length
: ∀(A : Type) (l : list A), length (rev l) = length l
: ∀(A : Type) (l : list A), length (rev l) = length l
Theorem rev_length_firsttry : ∀X (l : list X),
length (rev l) = length l.
Proof.
intros X l. induction l as [| n l' IHl'].
- (** l = *)
reflexivity. (* So far, so good, obviously... *)
length (rev l) = length l.
Proof.
intros X l. induction l as [| n l' IHl'].
- (** l = *)
reflexivity. (* So far, so good, obviously... *)
- (** l = n :: l' *)
(** This is the tricky case. Let's begin as usual
by simplifying. *)
simpl.
Now we seem to be stuck: the goal is an equality
involving ++, but we don't have any useful equations
in either the immediate context or in the global
environment! We can make a little progress by using
the IH to rewrite the goal...
rewrite <- IHl'.
... but now we can't seem to go any further.
Abort.
With a little help from a lemma
Theorem app_len : ∀X (l1 l2 : list X),
length (l1 ++ l2) = (length l1) + (length l2).
Proof.
(* WORKED IN CLASS *)
move ⇒ ?.
elim ⇒ [| n l1' IHl1'] /= .
- by [].
- move ⇒ ?. by rewrite IHl1'. Qed.
length (l1 ++ l2) = (length l1) + (length l2).
Proof.
(* WORKED IN CLASS *)
move ⇒ ?.
elim ⇒ [| n l1' IHl1'] /= .
- by [].
- move ⇒ ?. by rewrite IHl1'. Qed.
Note that, to make the lemma as general as possible, we
quantify over all natlists, not just those that result from an
application of rev. This should seem natural, because the truth
of the goal clearly doesn't depend on the list having been
reversed. Moreover, it is easier to prove the more general
property.
The same thing is in the standard library as app_length.
Something else we are missing: commutativity of addition. We have proved it though.
From LF19 Require Import FirstProofs19.
Now we can complete the original proof.
Theorem rev_len : ∀X (l : list X),
length (rev l) = length l.
Proof.
move ⇒ ?.
elim ⇒ [| n l' IHl'] /=.
- (* l = nil *)
by [].
- (* l = cons *)
(* WORKED IN CLASS *)
by rewrite app_len plus_comm IHl'.
Qed.
length (rev l) = length l.
Proof.
move ⇒ ?.
elim ⇒ [| n l' IHl'] /=.
- (* l = nil *)
by [].
- (* l = cons *)
(* WORKED IN CLASS *)
by rewrite app_len plus_comm IHl'.
Qed.
Print prod.
===>
You see the notation for products here. Here are projections:
Inductive prod (A B : Type) : Type := pair : A → B → A * B
For pair: Arguments A, B are implicit and maximally inserted
For pair: Arguments A, B are implicit and maximally inserted
Print fst.
Print snd.
Print snd.
fst = fun (A B : Type) (p : A * B) ⇒ let (x, _) := p in x
: ∀A B : Type, A * B → A
snd = fun (A B : Type) (p : A * B) ⇒ let (_, y) := p in y
: ∀A B : Type, A * B → B
: ∀A B : Type, A * B → A
snd = fun (A B : Type) (p : A * B) ⇒ let (_, y) := p in y
: ∀A B : Type, A * B → B
Zipping and unzipping
Print combine.
Print split.
Print split.
Are those two functions inverses of each other?
Example test_split:
split [(1,false);(2,false)] = ([1;2],[false;false]).
Proof.
reflexivity.
Qed.
(* Sun Jul 14 22:07:53 MSK 2019 *)
split [(1,false);(2,false)] = ([1;2],[false;false]).
Proof.
reflexivity.
Qed.
(* Sun Jul 14 22:07:53 MSK 2019 *)


The QuickCheck-McErlang interface is distributed with QuickCheck
and provides the capability to use McErlang to verify
QuickCheck parallel and sequential state machines.
To start a verification run using the interface first the
McErlang application must be started using<EMAIL_ADDRESS>An example QuickCheck property which uses McErlang as the verification
engine is shown below:
For more information concerning the interface see the QuickCheck documentation.


STU
DENT ACHEIV
EMENT
SECTIONS
DASHBORAD
HOME
AWARDS
HIGHER STUDIES
INTERNSHIPS
PROJECTS
WORKSHOPS
PUBLICATIONS
14-15
15-16
16-17
17-18
18-19


Source (https://github.com/torvalds/linux/blob/master/include/crypto/aes.h)
#define AES_MIN_KEY_SIZE 16
#define AES_MAX_KEY_SIZE 32
#define AES_KEYSIZE_128 16
#define AES_KEYSIZE_192 24
#define AES_KEYSIZE_256 32
#define AES_BLOCK_SIZE 16
#define AES_MAX_KEYLENGTH (15 * 16)
#define AES_MAX_KEYLENGTH_U32 (AES_MAX_KEYLENGTH / sizeof(u32))
Before we begin, the formula for converting bytes to bits is to multiply by eight.
Example: 4 bytes to bits. 4 * 8 = 32 bits.
#define AES_MIN_KEY_SIZE 16
Because the minimum key size is 16-bytes that's a 128-bit key. So minimum would = AES-128.
#define AES_MAX_KEY_SIZE 32
Because the maximum key size is 32-bytes that's a 256-bit key. So maximum would = AES-256.
#define AES_BLOCK_SIZE 16
The block size is 128 bits.


Chocolate Pizza
posted on 14 jan 2021 / desserts
For the fig-swirl: Melt butter over medium heat in a saucepan. Add brown sugar and stir to dissolve. Halve all of the figs and toss in the saucepan with water and lemon juice. Cook over medium heat, stirring frequently, until you have a chunky-jammy mixture. Add salt with one or two stirs, set aside and let cool completely.
Ice cream: In a small pot over medium heat, combine milk, and granulated sugar until sugar is completely dissolved and the milk is just barely lukewarm. Whisk in the egg yolks. Set mixture in the fridge and wait until the fig mixture is cooled.
Using an ice cream machine, pour liquids into the frozen basin and process according to manufacturer instructions, i.e., let spin and thicken for 20 minutes before adding mascarpone, fig jam mixture, and the nuts. Continue to process for +/- 10 minutes. Pour semi-frozen mixture into a pyrex dish or glass tuppenvare. Freeze for at least two hours before serving.
Vanessa Stevenson
Food enthusiast, photography fan. Add a pinch of raw foodism and that's pretty much who I am.


The idea that planets beyond Earth might host life is an ancient one, though historically it was framed by philosophy as much as physical science.
The late 20th century saw two breakthroughs in the field. The observation and robotic spacecraft exploration of other planets and moons within the Solar System has provided critical information on defining habitability criteria and allowed for substantial geophysical comparisons between the Earth and other bodies.


| Total net profit | -8.61 | Gross profit | 0.0 | Gross loss | -8.61 |
| Profit factor | 0.0 | Expected payoff | -0.66 | ||
| Absolute drawdown | -8.61 | Maximal drawdown (%) | 7.13 (-481.76%) | ||
| Total trades | 13 | Profit trades (% of total) | 0 (0.0%) | Loss trades (% of total) | 13 (100.0%) |
| Long positions (won %) | 7 (0.0%) | Short positions (won %) | 6 (0.0%) | ||
| Largest | profit trade | -0.06 | loss trade | -1.48 | |
| Average | profit trade | 0.0 | loss trade | -0.66 | |
| Minimum | profit trade | 0.0 | loss trade | -0.06 | |
| Maximum | take profit in pips | 201.4 | stop loss in pips | -36.4 | |
| Average | take profit in pips | 89.7 | stop loss in pips | -22.3 | |
| Minimum | take profit in pips | 2.9 | stop loss in pips | -6.6 | |
| Maximum | Reward-Risk | 14.0 | Duration in minutes | 3649 | |
| Average | Reward-Risk | 4.1 | Duration in minutes | 1045.4 | |
| Minimum | Reward-Risk | 0.1 | Duration in minutes | 80 | |
| Maximum | consecutive wins (profit in money) | 0.0 (0.0) | consecutive losses (loss in money) | 13.0 (-8.61) | |
| Average | consecutive wins | 0.0 | consecutive losses | 13.0 |
| Total net profit | -6.67 | Gross profit | 0.0 | Gross loss | -6.67 |
| Profit factor | 0.0 | Expected payoff | -0.95 | ||
| Absolute drawdown | -6.67 | Maximal drawdown (%) | 5.19 (-350.68%) | ||
| Total trades | 7 | Profit trades (% of total) | 0 (0.0%) | Loss trades (% of total) | 7 (100.0%) |
| Largest | profit trade | 0.0 | loss trade | -1.48 | |
| Average | profit trade | 0.0 | loss trade | -0.95 | |
| Minimum | profit trade | 0.0 | loss trade | -0.06 | |
| Maximum | take profit in pips | 145.8 | stop loss in pips | -36.4 | |
| Average | take profit in pips | 121.4 | stop loss in pips | -29.3 | |
| Minimum | take profit in pips | 2.9 | stop loss in pips | -11.6 | |
| Maximum | Reward-Risk | 11.2 | Duration in minutes | 3649.0 | |
| Average | Reward-Risk | 4.7 | Duration in minutes | 1526.9 | |
| Minimum | Reward-Risk | 0.1 | Duration in minutes | 263.0 | |
| Maximum | consecutive wins (profit in money) | 0.0 (0.0) | consecutive losses (loss in money) | 7.0 (-6.67) | |
| Average | consecutive wins | 0.0 | consecutive losses | 7.0 |
| Total net profit | -1.94 | Gross profit | 0.0 | Gross loss | -1.94 |
| Profit factor | 0.0 | Expected payoff | -0.32 | ||
| Absolute drawdown | -1.94 | Maximal drawdown (%) | 1.78 (-1112.5%) | ||
| Total trades | 6 | Profit trades (% of total) | 0 (0.0%) | Loss trades (% of total) | 6 (100.0%) |
| Largest | profit trade | 0.0 | loss trade | -0.9 | |
| Average | profit trade | 0.0 | loss trade | -0.32 | |
| Minimum | profit trade | 0.0 | loss trade | -0.16 | |
| Maximum | take profit in pips | 201.4 | stop loss in pips | -21.5 | |
| Average | take profit in pips | 52.8 | stop loss in pips | -14.1 | |
| Minimum | take profit in pips | 6.1 | stop loss in pips | -6.6 | |
| Maximum | Reward-Risk | 14.0 | Duration in minutes | 1198.0 | |
| Average | Reward-Risk | 3.5 | Duration in minutes | 483.7 | |
| Minimum | Reward-Risk | Duration in minutes | 80.0 | ||
| Maximum | consecutive wins (profit in money) | 0.0 (0.0) | consecutive losses (loss in money) | 6.0 (-1.94) | |
| Average | consecutive wins | 0.0 | consecutive losses | 6.0 |


123 Main Street, Pawtucket, RI, 02860<PHONE_NUMBER>
123 Main Street, Pawtucket, RI, 02860<PHONE_NUMBER>


Browse the web for Expressify resources.
Select an URL and a resource for your request.
If you do not know of any Expressify online resource, or you just want to try the browser, we provide an Expressify server application that saves an item you provide using a JSON payload in its local storage, and returns it on demand.
Its application URL is https://hqarroum.github.io/expressify/server.html
, and you can call the resource /item/:id
with a GET
request to retrieve an item having a given id
, using a POST
request to store a new item, and DELETE
to remove the resource.
Similarly, as with any Expressify server, you can ask it to describe the RESTful resources it currently exposes, along with their description.
Another resource made available through the example server is the /echo
resource which returns back an object holding the request of the client.


{% extends "layouts/base.html" %} {% block title %}Dormy - Apartment Rental Services for SFSU{% endblock title %} {% block content %}
Description: {{ listing.description }}


Lorem Ipsum is not simply random text. It has roots in a piece
Lorem Ipsum is not simply random text. It has roots in a piece
Lorem Ipsum is not simply random text. It has roots in a piece
Lorem Ipsum is simply dummy text of the printing and typesetting Lorem Ipsum has been the industry's standard dummy text ever When an unknown printer took a galley of type and scrambled It to make a type specimen book. It has survived not only five centuries But also the leap into electronic typesetting, Remaining essentially unchanged. It was popularised The release of Letraset sheets containing Lorem Ipsum passages


--- layout: default title: Home --- There is only one heroism in the world: to see the world as it is and to love it. - Romain Rolland Featured {% for post in site.posts %} {% if post.featured == true %} {% include featuredbox.html %} {% endif %} {% endfor %}
- Romain Rolland