|
HypePubSub
Decentralized peer-to-peer publisher-subscriber system powered by the HypeSDK, for the Linux platform.
|
#include "hype_pub_sub/hpb_cmd_interface.h"
Functions | |
| void | hpb_cmd_interface_subscribe (HypePubSub *hpb, char *service_name) |
| void | hpb_cmd_interface_unsubscribe (HypePubSub *hpb, char *service_name) |
| void | hpb_cmd_interface_publish (HypePubSub *hpb, char *service_name) |
| void | hpb_cmd_interface_print_own_id (HypePubSub *hpb) |
| void | hpb_cmd_interface_print_hype_devices (HypePubSub *hpb) |
| void | hpb_cmd_interface_print_managed_services (HypePubSub *hpb) |
| void | hpb_cmd_interface_print_subscriptions (HypePubSub *hpb) |
| void | hpb_cmd_interface_print_helper () |
| void | hpb_cmd_interface_print_header () |
| void | hpb_cmd_interface_print_client_list (HpbClientsList *lst_cl) |
| int | hpb_cmd_interface_arg_split (char *result[], char *str_to_split, const char *delim) |
| int hpb_cmd_interface_arg_split | ( | char * | result[], |
| char * | str_to_split, | ||
| const char * | delim | ||
| ) |
Splits a string in an array of arguments.
| result | Pointer to the array of arguments |
| str_to_split | String to be splitted |
| delim | Delimiter used to separate the arguments |
| void hpb_cmd_interface_print_client_list | ( | HpbClientsList * | lst_cl | ) |
Print the IDs and keys of a list o clients.
| lst_cl | List of clients to be printed |
| void hpb_cmd_interface_print_header | ( | ) |
Prints an HypePubSub header.
| void hpb_cmd_interface_print_helper | ( | ) |
Prints an helper menu with the possible user interactions with the HypePubSub application.
| void hpb_cmd_interface_print_hype_devices | ( | HypePubSub * | hpb | ) |
Prints the IDs and the keys of the clients found on the network.
| hpb | Pointer to the HypePubSub application. |
| void hpb_cmd_interface_print_managed_services | ( | HypePubSub * | hpb | ) |
Prints the key and the subscribers of each service managed by this client.
| hpb | Pointer to the HypePubSub application. |
| void hpb_cmd_interface_print_own_id | ( | HypePubSub * | hpb | ) |
Prints the ID and the key of this client.
| hpb | Pointer to the HypePubSub application. |
| void hpb_cmd_interface_print_subscriptions | ( | HypePubSub * | hpb | ) |
Prints the name, key and manager ID of each service subscribed by this client.
| hpb | Pointer to the HypePubSub application. |
| void hpb_cmd_interface_publish | ( | HypePubSub * | hpb, |
| char * | service_name | ||
| ) |
This method establishes the interface between the user publish request and the HypePubSub application.
| hpb | Pointer to the HypePubSub application. |
| service_name | Name of the service in which to publish. |
| void hpb_cmd_interface_subscribe | ( | HypePubSub * | hpb, |
| char * | service_name | ||
| ) |
This method establishes the interface between the user subscribe request and the HypePubSub application.
| hpb | Pointer to the HypePubSub application. |
| service_name | Name of the service to be subscribed. |
| void hpb_cmd_interface_unsubscribe | ( | HypePubSub * | hpb, |
| char * | service_name | ||
| ) |
This method establishes the interface between the user unsubscribe request and the HypePubSub application.
| hpb | Pointer to the HypePubSub application. |
| service_name | Name of the service to be unsubscribed. |


Firms managing money for disabled Alaskans face crackdown
by The Associated PressANCHORAGE, Alaska (AP) — The Social Security Administration is tightening regulation of Alaska’s representative payee businesses, saying they operate outside the law by charging fees to handle money for disabled residents.
The Anchorage Daily News reported Thursday that for-profit payee services have been notified their business model is illegal and they face audits.
A 2018 law expanded monitoring of the businesses that have existed in Alaska since the 1990s.
Officials say the companies take monthly fees to manage benefit payments for clients and coordinate expenditures such as rent payments and grocery purchases.
The businesses have been told to convert to nonprofits, which will prevent charging more than $43 per month, half of what most charge.
Advocates say about 800 vulnerable Alaskans could be left without someone to help manage their money.
___
Information from: Anchorage Daily News, http://www.adn.com
The Associated Press


Get Some
Events Calendar
Learn
jan 24 - feb 10
Our learn to ride packages provide everything you need to master the mountain.
Music
feb 12 & feb 14
Join us in welcoming Sierra bluegrass sensation Green Sky for two nights in February.
Play
mar 2 - apr 30
Kids ride free every Monday-Thursday this spring. Join us for a full day of fun.
Stay
apr 21 - may 30
Save up to 40% with advance booking. Mountain views, hot spas, and luxury linens.
High speed lifts and no lines. Nice. Charley C
I really like the all day lessons for kids. That way my husband and I get to go skiing Mary Mom


| member type | definition | notes |
| value_type | The first template parameter (T) | |
| allocator_type | The second template parameter (Alloc) | defaults to: allocator<value_type> |
| reference | value_type& | |
| const_reference | const value_type& | |
| pointer | allocator_traits<allocator_type>::pointer | for the default allocator: value_type* |
| const_pointer | allocator_traits<allocator_type>::const_pointer | for the default allocator: const value_type* |
| iterator | a forward iterator to value_type | convertible to const_iterator |
| const_iterator | a forward iterator to const value_type | |
| difference_type | a signed integral type, identical to: iterator_traits<iterator>::difference_type | usually the same as ptrdiff_t |
| size_type | an unsigned integral type that can represent any non-negative value of difference_type | usually the same as size_t |


If the issue is fixed, then the value of the rendered itemId URL parameter should be different for each
of the following URLs:
-
itemId should only occur once and should be #{item.itemId}
Also, the the following URLs should all have ONLY ONE item parameter each with a different name:
-
#{item.name} should only occur once and should be #{item.itemId}


--- layout: base location: Citing title: Citing ---
wot is an ongoing research project. If you are using this package, please cite the following paper in your work :
Optimal-Transport Analysis of
Single-Cell Gene Expression Identifies Developmental Trajectories in Reprogramming
by Geoffrey Schiebinger, Jian Shu, Marcin Tabaka, Brian Cleary, et. al.


{% extends "static_base.html" %} {% block title %}To-Dlo! - About{% endblock %} {% block header %}About{% endblock %} {% block static_body %}
Many of the most successful web applications follow the mantra of do one thing, and do it well, so I figured I could at least try for the former. To-Dlo is basic to-do list management application, accessible from your cellphone via SMS (text messaging). I have plans for more cool and helpful todo list management features, but I'm just one guy. Let me know if you want something added.
The first version of To-Dlo was written in class during a week of grad school. It only took a few hours to implement all of the basic functionality. To-Dlo was very simple to write, using Google App Engine and TextMarks for all of the infrastructure. This very infrastructure is available to you, too, entirely for free. Hooray for clouds.
To-Dlo competes with services such as reQall, Evernote, Kwiry, and the notepad in my pocket. The reason To-Dlo was written is because none of these services are simply just to-do lists that are completely manageable by SMS. I'm sure it would be really easy features for them to add, but they don't have it. reQall doesn't receive text messages (though it can send reminders), Evernote doesn't have an SMS shortcode, though it can receive emails from phones, Kwiry isn't really a to-do list, and the notepad in my pocket, though awesome, does not have an RSS feed, interface with my email, or support data redundancy. So instead of waiting for these services to get it right, I wrote To-Dlo.
The source code for To-Dlo is available under the MIT license at Google Code.
{% endblock %}


VoidGate GateKeeper Launch01
DisruptionPulse Launch1 01 01
PhotonCannon AttackLaunch4
DisruptionPulse Launch1 01 03
DisruptionPulse Launch1 01 02
Protoss BuildingWarpFinish0
PhotonCannon AttackLaunch3
DisruptionPulse Launch1 01 06
DisruptionPulse Launch1 01 07
PhotonCannon AttackLaunch2
PhotonCannon AttackLaunch0
VoidGate GateKeeper End01
DisruptionPulse Launch1 01 05
DisruptionPulse Launch1 01 04
PhotonCannon AttackLaunch1
DsruptionPulse PA Impact3 01
PhotonCannon AttackImpact1
PhotonCannon AttackImpact0
DisruptionPulse Launch2 04
DisruptionPulse Impact 06
DisruptionPulse Impact 04
PhotonCannon AttackImpact2
DisruptionPulse Impact 05
DisruptionPulse Impact 01
DisruptionPulse Launch2 03
DisruptionPulse Launch2 02
DisruptionPulse Impact 02
DsruptionPulse PA Impact1 01
DisruptionPulse Launch2 01
DisruptionPulse EP Return01
DisruptionPulse Impact 03
DsruptionPulse PA Impact4 01
VoidGate GateKeeper Loop01
Protoss BuildingPlacementSmall0
DisruptionPulse Projectile V2 02
DisruptionPulse EP Stop01
Pylon Overcharge Launch 01
DsruptionPulse PA Impact2 01


Steamed lobster, stir fried with black bean and chilli sauce
By
Kylie Kwong
From
Saturday Kitchen
Ingredients
-
1kg/2¼lb live
lobster
chopped into 8 pieces
-
2 tbsp
ginger
, peeled and chopped roughly
-
3 cloves
garlic
, peeled and crushed
-
2tsp salted black
beans
-
½ Spanish
onion
, peeled and sliced into wedges (approx. 1cm/½in wide)
-
4 Chinese
shallot
stems, trim off roots, washed, cut into approx. 5cm/2in lengths
-
½ red
pepper
, deseeded and cut into approx. 2cm/¾in squares
-
4 large red chillies, cut into half lengthways and deseeded
-
1 tbsp
peanut oil
-
2 tbsp Shaoxing wine
-
½ tsp white
sugar
-
22ml/1½tbsp light
soy sauce
-
1/8tsp
sesame oil
-
¼tsp Chinese black
vinegar
-
1 tsp
oyster sauce
-
7.5ml/1½ tsp
chicken stock
-
small bunch of
coriander
, leaf only, washed
-
Note: This recipe originally uses Australian measurements. Equivalent measurements are as accurate as possible.
Method
-
In a boiling Chinese steamer, place in the lobster pieces then steam for approximately 5 minutes and then remove immediately.
-
In a wok, heat peanut oil up to smoking point. Toss in ginger, garlic, onions, blackbeans and stir-fry vigorously for 2 minutes.
-
Add shallots, red pepper and chillies then stir-fry vigorously for a further 3 minutes.
-
Quickly add xaoxing wine (sherry), stir-fry for 1 minute, add sugar, soy, and oyster sauce and chicken stock. Stir-fry for 2 minutes.
-
Finally, add sesame oil and black vinegar.
-
Quickly toss in cooked lobster and stir-fry everything together for 2 minutes.
-
Serve the lobster on large white platter and garnish with coriander.


CacheHelper
-
Undocumented
See moreDeclaration
Swift
@objc public class APCachedModel : NSObject
-
Undocumented
See moreDeclaration
Swift
class APCacheHelper : NSObject
-
Undocumented
See moreDeclaration
Swift
@objc public class APCacheManager : NSObject
-
Undocumented
See moreDeclaration
Swift
@objc public class APFile : NSObject
-
Undocumented
See moreDeclaration
Swift
class APFileLoadingCompletion : NSObject
-
Undocumented
See moreDeclaration
Swift
@objc public protocol JsonSerializableProtocol : NSObjectProtocol


Amulet Seller Urgal:
May the glorious eternal flame shine upon you! Last night I dreamt of that unquenchable flame! I took it as a sign that I would soon meet someone whose heart burned with ambition, and here you are! Am I glad to see you, brother!
Buy
Manor tax rate and information
Quest


Essex lorry death victims 'all Vietnamese' after 39 bodies found
In a statement, the Vietnamese Embassy in London sent its "heartfelt condolences" to the families of the victims
by James Rodger, https://www.facebook.com/jamesrodgerjournalistThe 39 migrants found dead in the back of a lorry are believed to be Vietnamese nationals, Essex police has said.
Assistant Chief Constable Tim Smith said on Friday evening: "At this time, we believe the victims are Vietnamese nationals, and we are in contact with the Vietnamese Government.
"We are in direct contact with a number of families in Vietnam and the UK, and we believe we have identified families for some of the victims whose journey ended in tragedy on our shores."
"The confirmatory evidence needed to formally present cases to HM Senior Coroner for her consideration has not yet been obtained.
"This evidence is being gathered across a number of jurisdictions worldwide. As a result, we cannot at this time announce the identity of any of the victims."
Mr Smith said specially trained people, supported by Vietnamese interpreters, were manning its dedicated hotline between 9am to midnight, seven days a week, for people seeking to be in touch about the incident.
In a statement, the Vietnamese Embassy in London sent its "heartfelt condolences" to the families of the victims.
It said it was "deeply saddened" that Essex Police's initial findings were that the victims may be Vietnamese.
"Specific identities of the victims still need to be identified and confirmed by the relevant authorities of Vietnam and UK," the embassy said.
Its statement added: "The Embassy of Vietnam in London will closely co-ordinate with the relevant authorities of Vietnam and UK to support the families of the Vietnamese victims, if any, to bring their loved ones home."
"We strongly condemn the inhuman activities of the traffickers of illegal immigrants that have caused such a tragedy for the victims and their families.
"Vietnam will work closely with the UK to bring the criminals to justice and find effective measures to prevent a similar tragedy from happening again in the future."


#include <vjbsdhdr.h>
Definition at line 56 of file vjbsdhdr.h.
Definition at line 54 of file vjbsdhdr.h.
Definition at line 69 of file vjbsdhdr.h.
Definition at line 65 of file vjbsdhdr.h.
Definition at line 55 of file vjbsdhdr.h.
Definition at line 53 of file vjbsdhdr.h.
Definition at line 71 of file vjbsdhdr.h.
Definition at line 72 of file vjbsdhdr.h.
Definition at line 70 of file vjbsdhdr.h.


Before Change
n_jobs = self.n_jobs
// account for case n_jobs < 0
if n_jobs < 0:
n_jobs = max(1, cpu_count() + n_jobs + 1)
for search_space, optimizer in zip(search_spaces, optimizers):
// if not provided with search subspace, n_iter is taken as
// self.n_iter
if isinstance(search_space, tuple):
After Change
while n_iter > 0:
// when n_iter < n_jobs points left for evaluation
n_points_adjusted = min(n_iter, n_points)
print(n_points_adjusted)
optim_result = self._step(
X, y, search_space, optimizer,
groups=groups, n_points=n_points_adjusted


Ocean [aw33], ocean, in The Inner Sea
Last updated Turn #140
Ocean [aw33], ocean, in The Inner Sea
------------------------------------------------------------------------
14: General Kraken [k3k], Imperial Empire, duke, priest of the Church of
14: Halon [157], with two winged horses, 44 nazgul, arrived from the west,
14: accompanied by:
14: Phantom III [d6x], Imperial Empire, priest of the Church of
14: Dol [153], with 13 nazgul
14: Veejay [v8j], Imperial Empire, Bishop of the Church of Ham [155],
14: with five angels
14: Goon III [b9v], Imperial Empire, Bishop of the Church of Dol [153],
14: with five angels, 54 hvy. xbowmen, 17 nazgul
14: Lord Rodrigo Bane [c8b], Imperial Empire, priest of the Church of
14: Dol [153], with ten workers, 50 hvy. xbowmen, 14 nazgul
14: Licia [i1l], Imperial Empire, Bishop of the Church of Ham [155],
14: with five angels, 50 hvy. xbowmen
14: Odin [y5z], Imperial Empire, with 35 peasants, 15 soldiers, 55 hvy.
14: xbowmen
14: Thorg [j8u], Imperial Empire, with one warmount
14: Jupiter [m8j], Imperial Empire, duke, the High Priest of the Church
14: of Halon [157], with 26 peasants, 15 soldiers, ten angels,
14: nine skirmishers, 52 hvy. xbowmen
14: Dryeth [q4e], Imperial Empire, priest of the Church of Dol [153],
14: with 15 nazgul
14: Firefly [f3f], Imperial Empire, priest of the Church of
14: Halon [157], with 50 hvy. xbowmen
14: Sunwalker [a8x], Imperial Empire, duke, Bishop of the Church of
14: Halon [157], with five angels, 52 nazgul
14: Thomas [o5y], Imperial Empire, priest of the Church of Dol [153],
14: with 52 hvy. xbowmen, five nazgul
14: Alexei Galantor [j7l], Imperial Empire, duke, priest of the Church
14: of Halon [157], with 35 peasants, 84 nazgul
14: Sir Peter [u9p], Imperial Empire, with 30 peasants, 20 workers,
14: ten hvy. xbowmen
14: George [p7f], Imperial Empire, duke, priest of the Church of
14: Dol [153], with nine nazgul
14: Lucca [h0t], Imperial Empire, priest of the Church of Halon [157],
14: with one skirmisher, 50 nazgul
14: Johny [w2d], Imperial Empire, priest of the Church of Halon [157],
14: with 41 nazgul
14: Stefano [t8e], Imperial Empire, Bishop of the Church of
14: Halon [157], with 30 peasants, five angels, 50 nazgul
14: Sir Charles [j5r], Imperial Empire, priest of the Church of
14: Halon [157], with 30 peasants, 50 nazgul
14: Everblack [n3r], Imperial Empire, prisoner
14: Majikthise [n4g], Imperial Empire
14: City boy [c5x], Mandor Confederacy, prisoner
14: swift [e6w], Mandor Confederacy, prisoner
14: Green Yobos [a6g], Mandor Confederacy, prisoner
14: Aurora [g5z], Mandor Confederacy, prisoner
15: General Kraken [k3k], Imperial Empire, duke, priest of the Church of
15: Halon [157], with two winged horses, 44 nazgul, went north,
15: accompanied by:
15: Phantom III [d6x], Imperial Empire, priest of the Church of
15: Dol [153], with 13 nazgul
15: Veejay [v8j], Imperial Empire, Bishop of the Church of Ham [155],
15: with five angels
15: Goon III [b9v], Imperial Empire, Bishop of the Church of Dol [153],
15: with five angels, 54 hvy. xbowmen, 17 nazgul
15: Lord Rodrigo Bane [c8b], Imperial Empire, priest of the Church of
15: Dol [153], with ten workers, 50 hvy. xbowmen, 14 nazgul
15: Licia [i1l], Imperial Empire, Bishop of the Church of Ham [155],
15: with five angels, 50 hvy. xbowmen
15: Odin [y5z], Imperial Empire, with 35 peasants, 15 soldiers, 55 hvy.
15: xbowmen
15: Thorg [j8u], Imperial Empire, with one warmount
15: Jupiter [m8j], Imperial Empire, duke, the High Priest of the Church
15: of Halon [157], with 25 peasants, 15 soldiers, ten angels,
15: ten skirmishers, 52 hvy. xbowmen
15: Dryeth [q4e], Imperial Empire, priest of the Church of Dol [153],
15: with 15 nazgul
15: Firefly [f3f], Imperial Empire, priest of the Church of
15: Halon [157], with 50 hvy. xbowmen
15: Sunwalker [a8x], Imperial Empire, duke, Bishop of the Church of
15: Halon [157], with five angels, 52 nazgul
15: Thomas [o5y], Imperial Empire, priest of the Church of Dol [153],
15: with 52 hvy. xbowmen, five nazgul
15: Alexei Galantor [j7l], Imperial Empire, duke, priest of the Church
15: of Halon [157], with 35 peasants, 84 nazgul
15: Sir Peter [u9p], Imperial Empire, with 30 peasants, 20 workers,
15: ten hvy. xbowmen
15: George [p7f], Imperial Empire, duke, priest of the Church of
15: Dol [153], with nine nazgul
15: Lucca [h0t], Imperial Empire, priest of the Church of Halon [157],
15: with one skirmisher, 50 nazgul
15: Johny [w2d], Imperial Empire, priest of the Church of Halon [157],
15: with 41 nazgul
15: Stefano [t8e], Imperial Empire, Bishop of the Church of
15: Halon [157], with 30 peasants, five angels, 50 nazgul
15: Sir Charles [j5r], Imperial Empire, priest of the Church of
15: Halon [157], with 30 peasants, 50 nazgul
15: Everblack [n3r], Imperial Empire, prisoner
15: Majikthise [n4g], Imperial Empire
15: City boy [c5x], Mandor Confederacy, prisoner
15: swift [e6w], Mandor Confederacy, prisoner
15: Aurora [g5z], Mandor Confederacy, prisoner
Routes leaving Ocean:
North, city, to Elderon [ae4a], Mandoria, 1 day
North, plain, to Plain of Tears [av33], Mandoria, impassable
East, to Ocean [aw34], 6 days
South, to Ocean [ax33], 6 days
West, to Ocean [aw32], 6 days
Inner locations:
Island [aa0t], island, 1 day, owner:
Cyclops [gd3v], cyclops, number: 23
It is raining.


We are Northeastern's student-led venture accelerator
IDEA is a student-led venture accelerator that fosters the development of entrepreneurs in the Northeastern community through the educational experience of developing a business from concept to launch. We at IDEA, strive to provide a holistic experience for our ventures through support, in-kind resources, and opportunities to engage in an experiential learning opportunity.
IDEA Gap Funding is an educational grant to help young entrepreneurs to build their businesses.
Our program supports testing and iterating that’s necessary for an early-stage concept to develop.
We welcome all Northeastern founders including undergraduates, Master’s students, PhD students, alumni, faculty, and staff.
Apply to be a venture or join our management team!
See what we have created with our ventures


Pat's Salmon Cookies
"A delightful treat from the Pacific Northwest!"
Site Navigation
Home
Sales Information
Locations
Merchandise
Store Hours
Contact Information
Orders


This project includes a working example of React, React Router, and TypeScript with Webpack. It is hosted on Github.


3 March 2006
The Ministry of Health has reported a total of 614 cases and 44 deaths from 1 January to 26 February 2006. The epidemic threshold has been crossed in two neighbouring districts, Madarounfa and Guidan-Roumdji. Over 40 specimens of cerebral spinal fluid have been found positive for Neisseria meningitidis serogroup A.
Following a request from the Ministry of Health, the International Coordinating Group (ICG)on Vaccine Provision for Epidemic Meningitis Control has provided 750 000 doses of bivalent vaccine and 7800 vials of oily chloramphenicol for case management. An immunization campaign has started in both districts, with the support from international agencies and nongovernmental organizations.


Motivation: Let’s check whether server blackouts seem probable
After one particular exam, a student complaint that Moodle was not reacting during some specified time period.
In this post, we’ll check whether we find evidence in favor or against a failout of the server.
Setup
library("tidyverse")
## ── Attaching packages ─────────────────────────────────────── tidyverse 1.3.1 ──
## ✓ ggplot2 3.3.5 ✓ purrr 0.3.4
## ✓ tibble 3.1.6 ✓ dplyr 1.0.7
## ✓ tidyr 1.1.4 ✓ stringr 1.4.0
## ✓ readr 2.0.0 ✓ forcats 0.5.1
## ── Conflicts ────────────────────────────────────────── tidyverse_conflicts() ──
## x dplyr::filter() masks stats::filter()
## x dplyr::lag() masks stats::lag()
library("digest") # anonymize data
library("lubridate") # working with dates/time
##
## Attaching package: 'lubridate'
## The following objects are masked from 'package:base':
##
## date, intersect, setdiff, union
theme_set(theme_minimal())
Anonymize data
Here’s the path to the original data. You cannot access it, as it is confidential data. In this step, I’d just like to show you how to anonymize it.
d_path_raw <- "/Users/sebastiansaueruser/Downloads/logs-some-moodle-test.csv"
d <- read_csv(d_path_raw)
## Rows: 8849 Columns: 9
## ── Column specification ────────────────────────────────────────────────────────
## Delimiter: ","
## chr (9): Zeit, Vollständiger Name, Betroffene/r Nutzer/in, Ereigniskontext, ...
##
## ℹ Use `spec()` to retrieve the full column specification for this data.
## ℹ Specify the column types or set `show_col_types = FALSE` to quiet this message.
Here’s the main take, we’ll use the MD5 crypto function to get a fingerprint of the file:
d2 <-
d %>%
mutate(user = digest(`Vollständiger Name`, algo = "md5"),
ip = digest("IP-Adresse", algo = "md5"))
Finally, let’s prepocess a bit, ie. delete columns with sensitive data, and parse the time:
d3 <-
d2 %>%
select(-c(2,3,7,9)) %>%
mutate(time_stamp = parse_datetime(Zeit, "%d.%m.%Y %H:%M")) %>%
select(-Zeit) %>%
mutate(id = row_number())
And now save the anonymized data:
d_path_anonymized <- "/Users/sebastiansaueruser/github-repos/Lehre/data/d3.csv"
write_csv(d3, d_path_anonymized)
Read anonymized data
d_anom_path <- "https://raw.githubusercontent.com/sebastiansauer/Lehre/main/data/d3.csv"
d_anom <- read_csv(d_anom_path)
## Rows: 8849 Columns: 8
## ── Column specification ────────────────────────────────────────────────────────
## Delimiter: ","
## chr (6): Ereigniskontext, Komponente, Ereignisname, Herkunft, user, ip
## dbl (1): id
## dttm (1): time_stamp
##
## ℹ Use `spec()` to retrieve the full column specification for this data.
## ℹ Specify the column types or set `show_col_types = FALSE` to quiet this message.
Sense check
Let’s see whether the time/dates appear sensible:
d_anom %>%
summarise(min(time_stamp),
max(time_stamp))
## # A tibble: 1 × 2
## `min(time_stamp)` `max(time_stamp)`
## <dttm> <dttm>
## 1 2022-01-13 10:01:00 2022-02-08 15:12:00
OK.
Are there periods where no students interacted with Moodle?
If there were time periods were no student at all interacted with the Moodle server (according to the log data), we’d have evidence for some potential Server failure.
Preprocess data
Let’s filter the log data for the exam time of the first exam (there were two on the relevant day):
d_exam1 <-
d_anom %>%
filter(time_stamp < ymd_hm("2022-01-31 09:20")) %>%
filter(time_stamp > ymd_hm("2022-01-31 07:55"))
Check for missing data:
d_exam1 %>%
summarise(across(everything(), ~ sum(is.na(.))))
## # A tibble: 1 × 8
## Ereigniskontext Komponente Ereignisname Herkunft user ip time_stamp id
## <int> <int> <int> <int> <int> <int> <int> <int>
## 1 0 0 0 0 0 0 0 0
OK, no missings, that’s reassuring in terms of data quality.
Overall times of server contact
d_exam1 %>%
select(time_stamp) %>%
ggplot(aes(x = time_stamp)) +
scale_x_datetime() +
geom_histogram()
## `stat_bin()` using `bins = 30`. Pick better value with `binwidth`.
Hm…
d_exam1 %>%
select(time_stamp) %>%
ggplot(aes(x = time_stamp)) +
scale_x_datetime() +
geom_density()
Looks unsuspicious.
Let’s depict each server interaction as a dot:
d_exam1 %>%
cbind(y = runif(n = nrow(d_exam1))) %>%
relocate(y, .before = 1) %>%
relocate(time_stamp, .before = 2) %>%
ggplot(aes(x = time_stamp, y = y)) +
geom_point(alpha = .1) +
scale_x_datetime() +
scale_y_continuous(limits = c(0, 1))
Let’s zoom in right before the end of the test:
d_exam1 %>%
cbind(y = runif(n = nrow(d_exam1))) %>%
relocate(y, .before = 1) %>%
relocate(time_stamp, .before = 2) %>%
ggplot(aes(x = time_stamp, y = y)) +
geom_point(alpha = .1) +
scale_x_datetime(limits = c(ymd_hm("2022-01-31 08:50"), ymd_hm("2022-01-31 09:00"))) +
scale_y_continuous(limits = c(0, 1))
## Warning: Removed 6447 rows containing missing values (geom_point).
It appears the time wise resolution of our data does not allow for finer grains than 1 one minute windows.
Let’s try something more quantitatively looking:
d_exam1 %>%
select(time_stamp) %>%
filter(between(time_stamp, ymd_hm("2022-01-31 08:00"), ymd_hm("2022-01-31 08:59"))) %>%
count(time_stamp) %>%
ggplot() +
geom_col(aes(x = time_stamp, y = n))
Looks unsuspicious.
Debrief
Not finding evidence of some failure is not evidence of no failure, in general at least.


Forex reserves soar $3.5 billion to new lifetime high of $446.09 billion
by PTIHighlights
- The increase in reserves in the reporting week was mainly on account of a jump in foreign currency assets (FCA), a major component of the overall reserves
- FCA increased by $3.201 billion to $413.654 billion in the week ended November 1, the RBI said
MUMBAI: The country's foreign exchange reserves rose by $3.515 billion to touch a fresh lifetime high of $446.098 billion in the week to November 1, helped by increase in foreign currency assets, RBI data showed on Friday.
In the previous week, the reserves had increased by $1.832 billion to $442.583 billion.
The increase in reserves in the reporting week was mainly on account of a jump in foreign currency assets (FCA), a major component of the overall reserves.
FCA increased by $3.201 billion to $413.654 billion in the week ended November 1, the RBI said.
Expressed in US dollar terms, the foreign currency assets include the effect of appreciation or depreciation of non-US units like the euro, pound and the yen held in the foreign exchange reserves.
During the week, gold reserves increased by $301 million to $27.353 billion.
The special drawing rights with the International Monetary Fund increased by $2 million to $1.443 billion during the week.
The country's reserve position with the Fund also increased by $10 million to $3.648 billion, the data showed.


|
ZPR Monitor
|
Class that represents state of the Hard Drive bandwidth. Contains information about hdd bandwidth used by system and bandwidth used by this application in KB/s. More...
#include <HddState.hpp>
Public Member Functions | |
| HddState () | |
| Construct new HddState object with all usage values set to 0.0. | |
| HddState (double _hddInUseKBsRead, double _hddInUseKBsWrite, double _monitorHddInUseKBsRead, double _monitorHddInUseKBsWrite) | |
| Constructs new HddState object with particular Hdd usage provided with arguments. | |
| virtual | ~HddState () |
| Destructor of the HddState object. | |
| double | currKBsUsedRead (void) |
| Returns current system hdd read bandwidth usage in KB/s. | |
| double | currKBsUsedWrite (void) |
| Returns current system hdd write bandwidth usage in KB/s. | |
| double | currMonitorKBsUsedRead (void) |
| Returns current hdd read bandwidth usage for this process in KB/s. | |
| double | currMonitorKBsUsedWrite (void) |
| Returns current hdd write bandwidth usage for this process in KB/s. | |
| void | setKBsUsedRead (double _hddInUseKBsRead) |
| Sets current hdd read bandwidth usage for the system in KB/s. | |
| void | setKBsUsedWrite (double _hddInUseKBsWrite) |
| Sets current hdd write bandwidth usage for the system in KB/s. | |
| void | setMonitorKBsUsedRead (double _monitorHddInUseKBsRead) |
| Sets current hdd read bandwidth usage for this process in KB/s. | |
| void | setMonitorKBsUsedWrite (double _monitorHddInUseKBsWrite) |
| Sets current hdd write bandwidth usage for this process in KB/s. | |
| bool | operator> (const TriggerType &triggerType) const |
| HddState & | operator+= (const HddState &other) |
| Addition operator. Used in mean computing. | |
| HddState & | operator/= (double val) |
| Divide operator. Used in mean computing. | |
Friends | |
| std::ostream & | operator<< (std::ostream &stream, const HddState &hddState) |
Class that represents state of the Hard Drive bandwidth. Contains information about hdd bandwidth used by system and bandwidth used by this application in KB/s.


{% extends "layout.html" %} {% block content %}
Pathogenicity prediction software for Human LDL receptor missense mutations.
HOW TO USE THIS APPLICATION
Just insert a mutation indicating the position followed by the new aminoacid separated by a "." or, by the new nucleotide separated by ":" in case of DNA mutations.
You can also insert a list of mutations separated by "," (up to 5 simultaneous queries per submission)
New aminoacids can be indicated in 1 or 3 letter code
FULL-LENGHT PROTEIN IS CONSIDERED, e.i., the first aminoacid is a Methionine
DATA INPUT


Home | HTML, CSS and the DOM P2
Grid based design is a system that is used by web designers to place the various objects that appear on a web page in their deired or intended spot.
My guess is that 'semantic structure' refers to the way in which code is written in a specific format and order, particularly so that it is legible and follows the basic rules of good practice, allowing others to easily interpret it.
Not really.
Work being done by KEELAN WALKER


GTD’s role comes under the scanner
by Special CorrespondentThe role of former Minister G.T. Deve Gowda, who had vowed to remain neutral in the by-elections from Hunsur constituency, has come under the scanner.
While the losing BJP candidate A.H. Vishwanath has blamed Mr. Gowda for playing a role in the transfer of JD(S) votes to the Congress, Congress candidate H.P. Manjunath publicly acknowledged the support he had received from Mr. Gowda and his family members in his victory.
Mr. Gowda’s son, Harish Gowda, and his supporters are believed to have worked in favour of Congress.
Speaking to reporters outside the counting centre in Hunsur, Mr. Manjunath thanked Mr. Gowda’s son and his supporters for working like an “army”.
Mr. Vishwanath, however, lashed out at Mr. Gowda for ‘betraying’ the JD(S) by supporting the Congress.
It may be mentioned here that Mr. Gowda had complained to the poll officials on the spread of “fake news” on social media that he had extended his support to Mr. Vishwanath.
A former MLA representing Hunsur, Mr. Gowda is believed to have his own support base in Hunsur and a pamphlet was shared on social media platforms showing photographs of Mr. Gowda and Mr. Vishwanath with an accompanying appeal attributed to Mr. Gowda, asking the Vokkaliga community to cast its votes in favour of the BJP candidate. Mr. Gowda was quick to publicly deny that he had made any appeal to the voters to support Mr. Vishwanath.


isarray
Array#isArray
for older browsers.
Usage
1 | var isArray = require('isarray'); |
Installation
With npm do
1 | $ npm install isarray |
Then bundle for the browser with
browserify.
With component do
1 | $ component install juliangruber/isarray |
License
(MIT)
Copyright (c) 2013 Julian Gruber<EMAIL_ADDRESS>Permission is hereby granted, free of charge, to any person obtaining a copy of
this software and associated documentation files (the “Software”), to deal in
the Software without restriction, including without limitation the rights to
use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies
of the Software, and to permit persons to whom the Software is furnished to do
so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.
 IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.


Top Attracitions
The view of bright sunshine,
blue water and wide beaches at Sanya, the southernmost tip of Hainan Province,
attracts many regular visitors from both home and abroad year upon year.
It is said that Sanya has the most well-preserved and beautiful beaches in all of China.
Water Sports
Bordered by clear sea, Hainan Island's Sanya is an ideal place for water entertainment. Besides tasting fresh seafood and enjoying exotic natural beauties, you must try exciting water sports,
such as diving, walking on the seafloor, and surfing
Sanya Festivals
Every lunar May 5 On Dragon Boat Festival every year, dragon boat contest is a poplular festival acitivity attracting thousands of people
Night Life
Owning to the local tropical climate, most of the locals' activities takes place after dusk. Therefore, experiencing Sanya's nightlife is the best way for you to participate in the local life.


Everwild is the next game from Sea of Thieves developer Rare
by Stephany NunneleyToday at X019 Rare announced its next game in the works, Everwild.
Everwild is a new title in the works at Sea of Thieves studio Rare.
Not much is known about the game at present as it’s early in development, but it looks like a lovely game.
Here’s the trailer.
“While Everwild is still early in development, we are very excited about the unique potential of the game we are creating,” said Rare studio head Craig Duncan in a statement.
“The Everwild team is focused on building an experience that allows for new ways to play in a natural and magical world. The development team, led by executive producer Louise O’Connor, is creating something truly original and incredibly special that aims to be more than just a new IP. Everwild will give you memorable, engaging and meaningful experiences for players everywhere to share.
“We cannot wait to share more with you in the future.”


 The company has just finished their first product and it is time to sell it. You want to make as much money as possible and consider advertising in order to increase sales. You get an analyst to predict the expected revenue, both with and without advertising. You now want to make a decision as to whether you should advertise or not, given the expected revenues.
to fool their friends. The company has just finished their first product and it is time to sell it. You want to make as much money as possible and consider advertising in order to increase sales. You get an analyst to predict the expected revenue, both with and without advertising. You now want to make a decision as to whether you should advertise or not, given the expected revenues.
输入:
The input consists of n cases, and the first line consists of one positive integer giving n. The next n lines each contain 3 integers, r, e and c. The first, r, is the expected revenue if you do not advertise, the second, e, is the expected revenue if you do advertise, and the third, c, is the cost of advertising. You can assume that the input will follow these restrictions: -106 ≤ r, e ≤ 106 and 0 ≤ c ≤ 106.
输出:
The input consists of n cases, and the first line consists of one positive integer giving n. The next n lines each contain 3 integers, r, e and c. The first, r, is the expected revenue if you do not advertise, the second, e, is the expected revenue if you do advertise, and the third, c, is the cost of advertising. You can assume that the input will follow these restrictions: -106 ≤ r, e ≤ 106 and 0 ≤ c ≤ 106.
样例输入:
3 0 100 70 100 130 30 -100 -70 40
样例输出:
advertise does not matter do not advertise
#include<iostream> using namespace std; int main() { int t,r,e,c; while(scanf("%d",&t)!=EOF) { while(t--) { scanf("%d%d%d",&r,&e,&c); if(r>(e-c))printf("do not advertise\n"); else if(r<(e-c))printf("advertise\n"); else printf("does not matter\n"); } } return 0; }
解题转自：http://blog.csdn.net/zcy20121105/article/details/7868260
(adsbygoogle = window.adsbygoogle || []).push({});
星巴克最早的时候不是卖咖啡的，创办人是开A片厂的，结果女主死了，没法了改卖咖啡吧。纪念一下女主吧，logo就用她的宣传照吧
不错的网站，建议添加些比赛信息
#pragma pack(2) 这个用法太坑爹
L（X [0 .. M-1]，Y [0 .. N-1]）= 1 + L（X [0 .. M-2]，Y [0 .. N-1]）这个地方也也有笔误
应改为L（X [0 .. M-1]，Y [0 .. N-1]）= 1 + L（X [0 .. M-2]，Y [0 .. N-2]）
此题的样例描述不正确
为什么暴力求解方法循环到sqrt(n) 就可以了呢
文章写得挺好，就是最后的斐波那契那个没有看明白
是穷举，但是代码有优化（v数组），并不是2^n。测试数据应该没问题，之前有超时的代码。
有意思，有难度
这是研发类的题还是算法类？
漂亮。佩服。
P.S. unsigned 应该去掉。换行符是n 不是/n
还可以稍微优化一下，
int main() {
int m,n,ai,aj,bi,bj,ak,bk;
while (scanf("%d%d",&m,&n)!=EOF) {
ai = sqrt(m-1);
bi = sqrt(n-1);
aj = (m-ai*ai-1)>>1;
bj = (n-bi*bi-1)>>1;
ak = ((ai+1)*(ai+1)-m)>>1;
bk = ((bi+1)*(bi+1)-n)>>1;
printf("%dn",abs(ai-bi)+abs(aj-bj)+abs(ak-bk));
}
}
。。。
第二个方法挺不错。NewHead代表新的头节点，通过递归找到最后一个节点之后，就把这个节点赋给NewHead，然后一直返回返回，中途这个值是没有变化的，一边返回一边把相应的指针方向颠倒，最后结束时返回新的头节点到主函数。
跟书上的解法不一样，不知道哪个效率要高些
为什么不直接用STL排序呢？


Tower 1 at 420 Kent Residential Building / ODA New York
- Curated by Paula Pintos
- about 19 hours
Apartments · Brooklyn, United States
- version="1.0" encoding="UTF-8"? Architects: ODA New York
- AreaArea of this architecture projectArea: 7432.2 ft2
- version="1.0" encoding="UTF-8"?YearCompletion year of this architecture project Year: 2019
- version="1.0" encoding="UTF-8"?PhotographsPhotographs: Albert Vecerka, Imagen Subliminal, Petrini Studio
Text description provided by the architects. 416 Kent offers a variety of residential options along the water’s edge in Brooklyn, maximizing corner apartments by layering the building’s edges. In the signature ODA approach, 416 Kent questions the typical residential building in New York while incorporating light, green space and community amenity offerings.
Comprised of 22 floors, 416 Kent is the north tower of the complex. It has 252 apartment units, with affordable housing making up 20% of the available apartments. The three distinct towers feature multi-dimensional façades and 80% of the total apartments are corner units. Adding this third dimension to the envelope will provide a platform for intimate moments of interaction, both indoors and out. Units will boast northern sightlines onto the Williamsburg Bridge, the East River, and eastern vistas of downtown Manhattan. Kent’s promenade will add to the communal boardwalk stretching from Greenpoint all the way to Dumbo. A total of 77,000 SF of outdoor space have been designed around the development.
In the interior spaces natural light pours in through the floor-to-ceiling windows, with a low sill for by-the-window-seating, and creates a unique contrast between quotidian scenes in the apartments, and the open exposure to Manhattan across the river.
The use of raw materials like corten steel, wood logs and metal screens, create a sense of belonging to the heritage of Williamsburg’s waterfront. The arrangement of these elements in surprising, unconventional ways organize the spaces and layout a sequence of seamless yet defined activities. Standing on the exact turn of the East River, the building rises as the amenities and terraced platforms hover over the water. The amenities on the 11th floor enjoy 360 views of Manhattan, Brooklyn and Queens.
With the system of cantilevered stacks (reaching up to 15’), even the apartments located on the flanks of the towers enjoy waterfront views. Compact layouts are arranged for maximum light and views exposure. They also create the strategic framework for the floor combinations that generate the dynamic profile of the towers. An abstract hayfield welcomes residents home in the lobby of 416 Kent. Naturally rusted, corten steel fins are arranged throughout the space, hiding and revealing views and paths beyond. Behind the reception desk a wall-to-wall photo has been laminated onto a mirror, peeking through in all its vibrancy.


ABOUT US
HOLLYWOOD
CACTUS
Lorem Ipsum is simply dummy text of the printing and typesetting industry. 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. It has survived not only five centuries.
It is a long established fact that a reader will be distracted by the readable content of a page when looking at its layout. The point of using Lorem Ipsum.
Lorem Ipsum is simply dummy text of the printing and typesetting industry. 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. It has survived not only five centuries, but also the leap into electronic typesetting, remaining essentially unchanged.


The DCLMODE library defines functions to help write DCL command procedures. The library defines the function DCL-mode, which enables the DCL Mode major mode.
DCL-mode provides facilities for DCL comment handling and automatic indentation of DCL command lines.
The CMS library of functions provide an interface to the Code Management System (DEC/CMS) from within Emacs. The CMS library functions are analogous to their equivalents in the CMS application.
The functions are not bound to any keys by default. If you do want to bind the functions, create a file called CMS.KEY containing your bindings in your EMACS_PATH. The CMS library will load this file when you load the CMS library.
Most CMS library functions have an alternate form when passed a prefix argument: some commands will prompt for input in the Mini-buffer; others will display a form which you can fill in to modify the default action of the command. When you have completed the forms, use the exit-emacs command to execute the command. To abort the form, use the ^C command.
For more information on CMS libraries and the DEC/CMS layered product itself, see the OpenVMS DECset documentation for details.
The Emacs CMS interface functions are:
(cms-set-library)
Sets the current CMS library by translating the logical name CMS$LIB.
If provided a prefix argument, cms-set-library prompts for the name of the library in the Mini-buffer.
(cms-show-library)
Prints the name of the currently set CMS library in the Mini-buffer.
(cms-show-elements)
Lists the elements in the current CMS library in the buffer CMS list, which is popped onto the screen.
If a prefix argument is provided, a Show Elements form is popped onto the screen. The form contains the following fields:
· Elements
· Include groups flag (default is 1).
(cms-show-class)
Lists the classes in the current CMS library in the CMS listbuffer which is popped onto the screen.
If passed a prefix argument, cms-show-class prompts for the class to list in the Mini-buffer.
(cms-show-group)
Lists the groups in the current CMS library in the CMS listbuffer which is popped onto the screen. If passed a prefix argument, cms-show-group prompts for the group to list in the Mini-buffer.
(cms-show-reservation)
Lists the element reservations in the current CMS library in the CMS list buffer.
If passed a prefix argument, cms-show-reservations pops a Show Reservations form onto the screen. The fields in the form are:
· Elements
· Generation
· User name.
(cms-fetch)
Prompts for an element name and fetches the specified element, reading it into a new buffer and making that buffer current.
If passed a prefix argument, cms-fetch pops up a Fetch form. The fields in the form are:
· Element
· Generation (defaults to highest generation)
· No history flag (default is 1)
· No notes flag (default is 1).
(cms-reserve)
Prompts for an element name and a remark in the Mini-buffer and reserves the specified element, reading it into a new buffer and making that buffer the current buffer.
If passed a prefix argument, cms-reserve pops a Reserve form onto the screen. The fields in the form are:
· Element
· Remark
· Generation
· No history flag (default is 1)
· No notes flag (default is 1).
(cms-unreserve)
Prompts for the name of an element and a remark in the Mini-buffer and unreserves the specified element.
If passed a prefix argument, cms-unreserve does not prompt for a remark.
(cms-replace)
Prompts for the name of an element and replaces the specified element into the CMS library.
If passed a prefix argument, cms-replace pops up a Replace form onto the screen. The fields in the form are:
· Element
· Remark
· Variant
· Reservation flag
(cms-create-element)
Prompts for the name of an element and creates the named element.
If passed a prefix argument, cms-create-element pops up a Create Element form. The fields in the form are:
· Element
· Remark
· History
· Keep flag
· Reservation flag
· Concurrency flag (default is 1)
· Reference flag (default is 0).
(cms-copy-element)
Prompts for the name of an existing element and a new element name, then copies the existing element to the new element.
If passed a prefix argument, cms-copy-element pops up a Copy Element form. The fields in the form are:
· Element
· New element
· Remark.
(cms-insert-element)
Prompts for the name of an existing element and a group name, then inserts the specified element into the named group.
If passed a prefix argument, cms-insert-element pops up an Insert Element form. The fields in the form are:
· Element
· Group
· Remark.
(cms-insert-group)
Prompts for the name of a subgroup and the group into which the subgroup should be inserted, then performs the insertion.
If passed a prefix argument, cms-insert-group pops up an Insert Group form. The fields in the form are:
· Subgroup
· Group
· Remark.
(cms-insert-generation)
Prompts for an element name and a class name, then inserts the latest generation of the specified element into the named class.
If passed a prefix argument, cms-insert-generation pops up an Insert Generation form. The fields in the form are:
· Element
· Class
· Generation (default is highest generation)
· Remark.
(cms-modify-class)
Pops up a Modify Class form which allows you to modify class attributes. The fields in the form are:
· Class
· Remark
· New class
· New class remark
· Read-only flag.
(cms-modify-group)
Pops up a Modify Group form which allows you to modify group attributes. The fields in the form are:
· Group
· Remark
· New group
· New group remark
· Read-only flag.
(cms-modify-element)
Pops up a Modify Element form which allows you to modify element attributes. The fields in the form are:
· Element
· Remark
· New element
· New element remark
· History
· Concurrency flag (default is 1)
· Reference flag (default is 1).
(cms-remove-element)
Prompts for the name of an element and a group name and removes the element from the specified group.
If passed a prefix argument, cms-remove-element pops up a Remove Element form. The form contains the following fields:
· Element
· Group
· Remark.
(cms-remove-generation)
Prompts for an element name and a class name and removes the specified generation of the element from the class.
If passed a prefix argument, cms-remove-generation pops up a Remove Generation form containing the following fields:
· Element
· Class
· Remark.
(cms-remove-group)
Prompts for a subgroup name and a group name, then removes the subgroup from the specified group.
(cms-delete-class)
Prompts for a class name and deletes the specified class.
(cms-delete-element)
Prompts for an element name and a remark deletes the specified element. If a prefix argument is provided, the remark is not required.
(cms-delete-group)
Prompts for a group name and a remark, then deletes the specified group. If a prefix argument is provided, the remark is not required.
(cms-remark)
Prompts for a remark and enters this into the CMS library's remark history.
MESSAGES, Displaying Broadcast Messages
The MESSAGES library defines functions which trap OpenVMS broadcast messages and display their text in a small window at the bottom of the screen.
To start the trapping of broadcast messages, load the MESSAGES package with ESC-x execute-mlisp-file.
The variable broadcast-feeps can be used to customise the behaviour of MESSAGES library; it contains the number of bell characters that are sent to the terminal when a new message is received. The default value of broadcast-feeps is 1.
SPELL, Spelling Error Detection And Correction
The SPELL defines functions which provide a user interface to Emacs' interface to the DECspell layered product.
The following functions are provided:
(spell-line)
This function spell-checks each word on the line in which dot is located. For each spelling error reported by DECspell, a list of possible spelling corrections is displayed and you are asked to input the correct spelling. Full word expansion is available during this operation. If you type just a Return, the word will not be changed.
(spell-word-in-buffer)
This function checks the spelling of the word in which dot is located. If the spelling is incorrect, a list of possible corrections are displayed and you are asked you to type one. Full word expansion is enabled.
(spell-newline)
This function is used to replace the binding for the Return key in buffers that require automatic spell checking. It causes the current line to be checked before the newline function is executed.
(spell-newline-and-indent)
This function is used to replace the binding of the Linefeedkey in buffers that require automatic spell checking. It causes the current line to be checked before the newline-and-indentfunction is executed.
(make-text-mode-spell)
This function is used to make Text Mode perform automatic spelling detection and correction as text is typed in. If you require this feature, you should include the following lines in your EMACSINIT.ML:
(execute-mlisp-file "spell")
(make-text-mode-spell)
The THESAURUS library defines two functions that provide an interface to the DECspell Thesaurus from within Emacs:
(et-word)
Prompts for a word in the Mini-buffer and checks this against the DECspell thesaurus. If the word is found in the thesaurus, Emacs pops up a buffer called Electronic Thesaurus and displays in the buffer alternatives for the specified word. If the specified word is not found in the thesaurus, an error message is displayed.
(et-word-in-buffer)
Checks the word that dot is in against the thesaurus. If the word is found in the thesaurus, a list of possible alternatives is displayed in the Electronic Thesaurus buffer. If the word is not found, an error message is displayed. THESAURUS.KEY
There are no default key bindings for these functions, but you can define your own bindings by creating a file called THESAURUS.KEY in your EMACS_PATH. The file should contain appropriate MLisp commands to bind the thesaurus functions to the desired key bindings. The THESAURUS library will attempt to load this file automatically when you load the THESAURUS library.


--- layout: default ---
Double click anywhere on the map to select a goal.
Click "Solve MDP" to solve the resulting MDP.
Agent will navigate toward the goal once the MDP is solved.


The library has been tested using Agda version 2.5.3.
Non-backwards compatible changes
Upgrade and overhaul of organisation of relations over data
- Relations over data have been moved from the
Relation
subtree to theData
subtree. This increases the usability of the library by:- keeping all the definitions concerning a given datatype in the same directory
- providing a location to reason about how operations on the data affect the
relations (e.g. how
Pointwise
is affected bymap
) - increasing the discoverability of the relations. There is anecdotal evidence that many users were not aware of the existence of the relations in the old location.
In general the files have been moved from
Relation.Binary.X
toData.X.Relation
. The full list of moves is as follows:`Relation.Binary.List.Pointwise` ↦ `Data.List.Relation.Pointwise` `Relation.Binary.List.StrictLex` ↦ `Data.List.Relation.Lex.Strict` `Relation.Binary.List.NonStrictLex` ↦ `Data.List.Relation.Lex.NonStrict` `Relation.Binary.Sum` ↦ `Data.Sum.Relation.Pointwise` ↘ `Data.Sum.Relation.LeftOrder` `Relation.Binary.Sigma.Pointwise` ↦ `Data.Product.Relation.Pointwise.Dependent' `Relation.Binary.Product.Pointwise` ↦ `Data.Product.Relation.Pointwise.NonDependent` `Relation.Binary.Product.StrictLex` ↦ `Data.Product.Relation.Lex.Strict` `Relation.Binary.Product.NonStrictLex` ↦ `Data.Product.Relation.Lex.NonStrict` `Relation.Binary.Vec.Pointwise` ↦ `Data.Vec.Relation.Pointwise.Inductive` ↘ `Data.Vec.Relation.Pointwise.Extensional`
The old files in
Relation.Binary.X
still exist for backwards compatability reasons and re-export the contents of files’ new location inData.X.Relation
but may be removed in some future release. -
The contents of
Relation.Binary.Sum
has been split into two modulesData.Sum.Relation.Pointwise
andData.Sum.Relation.LeftOrder
-
The contents of
Relation.Binary.Vec.Pointwise
has been split into two modulesData.Vec.Relation.Pointwise.Inductive
andData.Vec.Relation.Pointwise.Extensional
.The inductive form of
Pointwise
has been generalised so that technically it can apply to two vectors with different lengths (although in practice the lengths must turn out to be equal). This allows a much wider range of proofs such as the fact that[]
is a right identity for_++_
which previously did not type check using the old definition. In order to ensure compatability with the--without-K
option, the universe level ofInductive.Pointwise
has been increased fromℓ
toa ⊔ b ⊔ ℓ
. -
Data.Vec.Equality
has been almost entirely reworked into four separate modules insideData.Vec.Relation.Equality
(namelySetoid
,DecSetoid
,Propositional
andDecPropositional
). All four of them now useData.Vec.Relation.Pointwise.Inductive
as a base.The proofs from the submodule
UsingVecEquality
inData.Vec.Properties
have been moved to these four new modules. -
The datatype
All₂
has been removed fromData.Vec.All
, along with associated proofs as it duplicates existing functionality inData.Vec.Relation.Pointwise.Inductive
. Unfortunately it is not possible to maintain backwards compatability due to dependency cycles. - Added new modules
Data.List.Relation.Equality.(Setoid/DecSetoid/Propositional/DecPropositional)
.
Upgrade of Data.AVL
-
Data.AVL.Key
andData.AVL.Height
have been split out ofData.AVL
therefore ensuring they are independent on the type ofValue
the tree contains. -
Indexed
has been put into its own core moduleData.AVL.Indexed
, following the example ofCategory.Monad.Indexed
andData.Container.Indexed
. -
These changes allow
map
to have a polymorphic type and so it is now possible to change the type of values contained in a tree when mapping over it.
Upgrade of Algebra.Morphism
-
Previously
Algebra.Morphism
only provides an example of aRing
homomorphism which packs the homomorphism and the proofs that it behaves the right way.Instead we have adopted and
Algebra.Structures
-like approach with proof-only records parametrised by the homomorphism and the structures it acts on. This make it possible to define the proof requirement for e.g. a ring in terms of the proof requirements for its additive abelian group and multiplicative monoid.
Upgrade of filter
and partition
in Data.List
-
The functions
filter
andpartition
inData.List.Base
now use decidable predicates instead of boolean-valued functions. The boolean versions discarded type information, and hence were difficult to use and prove properties about. The proofs have been updated and renamed accordingly.The old boolean versions still exist as
boolFilter
andboolPartition
for backwards compatibility reasons, but are deprecated and may be removed in some future release. The old versions can be implemented via the new versions by passing the decidability proofλ v → f v ≟ true
with_≟_
fromData.Bool
.
Overhaul of categorical interpretations of List and Vec
-
New modules
Data.List.Categorical
andData.Vec.Categorical
have been added for the categorical interpretations ofList
andVec
.The following have been moved to
Data.List.Categorical
:- The module
Monad
fromData.List.Properties
(renamed toMonadProperties
) - The module
Applicative
fromData.List.Properties
monad
,monadZero
,monadPlus
and monadic operators fromData.List
The following has been moved to
Data.Vec.Categorical
:applicative
andfunctor
fromData.Vec
lookup-morphism
andlookup-functor-morphism
fromData.Vec.Properties
- The module
Other
-
Removed support for GHC 7.8.4.
-
Renamed
Data.Container.FreeMonad.do
andData.Container.Indexed.FreeMonad.do
toinn
as Agda 2.5.4 now supports proper ‘do’ notation. -
Changed the fixity of
⋃
and⋂
inRelation.Unary
to make space for_⊢_
. -
Changed
_|_
fromData.Nat.Divisibility
from data to a record. Consequently, the two parameters are no longer implicit arguments of the constructor (but such values can be destructed using a let-binding rather than a with-clause). -
Names in
Data.Nat.Divisibility
now use thedivides
symbol (typed \|) consistently. Previously a mixture of \| and | was used. -
Moved the proof
eq?
fromData.Nat
toData.Nat.Properties
-
The proofs that were called
+-monoˡ-<
and+-monoʳ-<
inData.Nat.Properties
have been renamed+-mono-<-≤
and+-mono-≤-<
respectively. The original names are now used for proofs of left and right monotonicity of_+_
. -
Moved the proof
monoid
fromData.List
to++-monoid
inData.List.Properties
. -
Names in Data.Nat.Divisibility now use the
divides
symbol (typed \|) consistently. Previously a mixture of \| and | was used. -
Starting from Agda 2.5.4 the GHC backend compiles
Coinduction.∞
in a different way, and for this reason the GHC backend pragmas forData.Colist.Colist
andData.Stream.Stream
have been modified.
Deprecated features
The following renaming has occurred as part of a drive to improve consistency across the library. The old names still exist and therefore all existing code should still work, however they have been deprecated and use of the new names is encouraged. Although not anticipated any time soon, they may eventually be removed in some future release of the library.
- In
Data.Bool.Properties
:∧-∨-distˡ ↦ ∧-distribˡ-∨ ∧-∨-distʳ ↦ ∧-distribʳ-∨ distrib-∧-∨ ↦ ∧-distrib-∨ ∨-∧-distˡ ↦ ∨-distribˡ-∧ ∨-∧-distʳ ↦ ∨-distribʳ-∧ ∨-∧-distrib ↦ ∨-distrib-∧ ∨-∧-abs ↦ ∨-abs-∧ ∧-∨-abs ↦ ∧-abs-∨ not-∧-inverseˡ ↦ ∧-inverseˡ not-∧-inverseʳ ↦ ∧-inverseʳ not-∧-inverse ↦ ∧-inverse not-∨-inverseˡ ↦ ∨-inverseˡ not-∨-inverseʳ ↦ ∨-inverseʳ not-∨-inverse ↦ ∨-inverse isCommutativeSemiring-∨-∧ ↦ ∨-∧-isCommutativeSemiring commutativeSemiring-∨-∧ ↦ ∨-∧-commutativeSemiring isCommutativeSemiring-∧-∨ ↦ ∧-∨-isCommutativeSemiring commutativeSemiring-∧-∨ ↦ ∧-∨-commutativeSemiring isBooleanAlgebra ↦ ∨-∧-isBooleanAlgebra booleanAlgebra ↦ ∨-∧-booleanAlgebra commutativeRing-xor-∧ ↦ xor-∧-commutativeRing proof-irrelevance ↦ T-irrelevance
- In
Data.Fin.Properties
:cmp ↦ <-cmp strictTotalOrder ↦ <-strictTotalOrder
- In
Data.Integer.Properties
:inverseˡ ↦ +-inverseˡ inverseʳ ↦ +-inverseʳ distribʳ ↦ *-distribʳ-+ isCommutativeSemiring ↦ +-*-isCommutativeSemiring commutativeRing ↦ +-*-commutativeRing *-+-right-mono ↦ *-monoʳ-≤-pos cancel-*-+-right-≤ ↦ *-cancelʳ-≤-pos cancel-*-right ↦ *-cancelʳ-≡ doubleNeg ↦ neg-involutive -‿involutive ↦ neg-involutive +-⊖-left-cancel ↦ +-cancelˡ-⊖
- In
Data.List.Base
:gfilter ↦ mapMaybe
- In
Data.List.Properties
:right-identity-unique ↦ ++-identityʳ-unique left-identity-unique ↦ ++-identityˡ-unique
- In
Data.List.Relation.Pointwise
:Rel ↦ Pointwise Rel≡⇒≡ ↦ Pointwise-≡⇒≡ ≡⇒Rel≡ ↦ ≡⇒Pointwise-≡ Rel↔≡ ↦ Pointwise-≡↔≡
- In
Data.Nat.Properties
:¬i+1+j≤i ↦ i+1+j≰i ≤-steps ↦ ≤-stepsˡ
- In all modules in the
Data.(Product/Sum).Relation
folders, all proofs with names using infix notation have been deprecated in favour of identical non-infix names, e.g._×-isPreorder_ ↦ ×-isPreorder
- In
Data.Product.Relation.Lex.(Non)Strict
:×-≈-respects₂ ↦ ×-respects₂
- In
Data.Product.Relation.Pointwise.Dependent
:Rel ↦ Pointwise Rel↔≡ ↦ Pointwise-≡↔≡
- In
Data.Product.Relation.Pointwise.NonDependent
:_×-Rel_ ↦ Pointwise Rel↔≡ ↦ Pointwise-≡↔≡ _×-≈-respects₂_ ↦ ×-respects₂
- In
Data.Sign.Properties
:opposite-not-equal ↦ s≢opposite[s] opposite-cong ↦ opposite-injective cancel-*-left ↦ *-cancelˡ-≡ cancel-*-right ↦ *-cancelʳ-≡ *-cancellative ↦ *-cancel-≡
- In
Data.Vec.Properties
:proof-irrelevance-[]= ↦ []=-irrelevance
- In
Data.Vec.Relation.Pointwise.Inductive
:Pointwise-≡ ↦ Pointwise-≡↔≡
- In
Data.Vec.Relation.Pointwise.Extensional
:Pointwise-≡ ↦ Pointwise-≡↔≡
- In
Induction.Nat
:rec-builder ↦ recBuilder cRec-builder ↦ cRecBuilder <′-rec-builder ↦ <′-recBuilder <-rec-builder ↦ <-recBuilder ≺-rec-builder ↦ ≺-recBuilder <′-well-founded ↦ <′-wellFounded <′-well-founded′ ↦ <′-wellFounded′ <-well-founded ↦ <-wellFounded ≺-well-founded ↦ ≺-wellFounded
- In
Induction.WellFounded
:Well-founded ↦ WellFounded Some.wfRec-builder ↦ Some.wfRecBuilder All.wfRec-builder ↦ All.wfRecBuilder Subrelation.well-founded ↦ Subrelation.wellFounded InverseImage.well-founded ↦ InverseImage.wellFounded TransitiveClosure.downwards-closed ↦ TransitiveClosure.downwardsClosed TransitiveClosure.well-founded ↦ TransitiveClosure.wellFounded Lexicographic.well-founded ↦ Lexicographic.wellFounded
- In
Relation.Binary.PropositionalEquality
:proof-irrelevance ↦ ≡-irrelevance
Removed features
Deprecated in version 0.10
-
Modules
Deprecated-inspect
andDeprecated-inspect-on-steroids
inRelation.Binary.PropositionalEquality
. -
Module
Deprecated-inspect-on-steroids
inRelation.Binary.HeterogeneousEquality
.
Backwards compatible changes
-
Added support for GHC 8.2.2.
-
New module
Data.Word
for new builtin typeAgda.Builtin.Word.Word64
. -
New modules
Data.Table
,Data.Table.Base
,Data.Table.Relation.Equality
andData.Table.Properties
. ATable
is a fixed-length collection of objects similar to aVec
fromData.Vec
, but implemented as a functionFin n → A
. This prioritises ease of lookup as opposed toVec
which prioritises the ease of adding and removing elements. - The contents of the following modules are now more polymorphic with respect to levels:
Data.Covec Data.List.Relation.Lex.Strict Data.List.Relation.Lex.NonStrict Data.Vec.Properties Data.Vec.Relation.Pointwise.Inductive Data.Vec.Relation.Pointwise.Extensional
-
Added new proof to
asymmetric : Asymmetric _<_
to theIsStrictPartialOrder
record. - Added new proofs to
Data.AVL
:leaf-injective : leaf p ≡ leaf q → p ≡ q node-injective-key : node k₁ lk₁ ku₁ bal₁ ≡ node k₂ lk₂ ku₂ bal₂ → k₁ ≡ k₂ node-injectiveˡ : node k lk₁ ku₁ bal₁ ≡ node k lk₂ ku₂ bal₂ → lk₁ ≡ lk₂ node-injectiveʳ : node k lk₁ ku₁ bal₁ ≡ node k lk₂ ku₂ bal₂ → ku₁ ≡ ku₂ node-injective-bal : node k lk₁ ku₁ bal₁ ≡ node k lk₂ ku₂ bal₂ → bal₁ ≡ bal₂
- Added new proofs to
Data.Bin
:less-injective : (b₁ < b₂ ∋ less lt₁) ≡ less lt₂ → lt₁ ≡ lt₂
- Added new proofs to
Data.Bool.Properties
:∨-identityˡ : LeftIdentity false _∨_ ∨-identityʳ : RightIdentity false _∨_ ∨-identity : Identity false _∨_ ∨-zeroˡ : LeftZero true _∨_ ∨-zeroʳ : RightZero true _∨_ ∨-zero : Zero true _∨_ ∨-idem : Idempotent _∨_ ∨-sel : Selective _∨_ ∨-isSemigroup : IsSemigroup _≡_ _∨_ ∨-isCommutativeMonoid : IsCommutativeMonoid _≡_ _∨_ false ∧-identityˡ : LeftIdentity true _∧_ ∧-identityʳ : RightIdentity true _∧_ ∧-identity : Identity true _∧_ ∧-zeroˡ : LeftZero false _∧_ ∧-zeroʳ : RightZero false _∧_ ∧-zero : Zero false _∧_ ∧-idem : Idempotent _∧_ ∧-sel : Selective _∧_ ∧-isSemigroup : IsSemigroup _≡_ _∧_ ∧-isCommutativeMonoid : IsCommutativeMonoid _≡_ _∧_ true ∨-∧-isLattice : IsLattice _≡_ _∨_ _∧_ ∨-∧-isDistributiveLattice : IsDistributiveLattice _≡_ _∨_ _∧_
- Added missing bindings to functions on
Data.Char.Base
:isLower : Char → Bool isDigit : Char → Bool isAlpha : Char → Bool isSpace : Char → Bool isAscii : Char → Bool isLatin1 : Char → Bool isPrint : Char → Bool isHexDigit : Char → Bool toNat : Char → ℕ fromNat : ℕ → Char
- Added new proofs to
Data.Cofin
:suc-injective : (Cofin (suc m) ∋ suc p) ≡ suc q → p ≡ q
- Added new proofs to
Data.Colist
:∷-injectiveˡ : (Colist A ∋ x ∷ xs) ≡ y ∷ ys → x ≡ y ∷-injectiveʳ : (Colist A ∋ x ∷ xs) ≡ y ∷ ys → xs ≡ ys here-injective : (Any P (x ∷ xs) ∋ here p) ≡ here q → p ≡ q there-injective : (Any P (x ∷ xs) ∋ there p) ≡ there q → p ≡ q ∷-injectiveˡ : (All P (x ∷ xs) ∋ px ∷ pxs) ≡ qx ∷ qxs → px ≡ qx ∷-injectiveʳ : (All P (x ∷ xs) ∋ px ∷ pxs) ≡ qx ∷ qxs → pxs ≡ qxs ∷-injective : (Finite (x ∷ xs) ∋ x ∷ p) ≡ x ∷ q → p ≡ q ∷-injective : (Infinite (x ∷ xs) ∋ x ∷ p) ≡ x ∷ q → p ≡ q
- Added new operations and proofs to
Data.Conat
:pred : Coℕ → Coℕ suc-injective : (Coℕ ∋ suc m) ≡ suc n → m ≡ n fromℕ-injective : fromℕ m ≡ fromℕ n → m ≡ n suc-injective : (suc m ≈ suc n ∋ suc p) ≡ suc q → p ≡ q
- Added new proofs to
Data.Covec
:∷-injectiveˡ : (Covec A (suc n) ∋ a ∷ as) ≡ b ∷ bs → a ≡ b ∷-injectiveʳ : (Covec A (suc n) ∋ a ∷ as) ≡ b ∷ bs → as ≡ bs
- Added new proofs to
Data.Fin.Properties
:≤-isDecTotalOrder : ∀ {n} → IsDecTotalOrder _≡_ (_≤_ {n}) ≤-irrelevance : ∀ {n} → IrrelevantRel (_≤_ {n}) <-asym : ∀ {n} → Asymmetric (_<_ {n}) <-irrefl : ∀ {n} → Irreflexive _≡_ (_<_ {n}) <-irrelevance : ∀ {n} → IrrelevantRel (_<_ {n})
- Added new proofs to
Data.Integer.Properties
:+-cancelˡ-⊖ : (a + b) ⊖ (a + c) ≡ b ⊖ c neg-minus-pos : -[1+ m ] - (+ n) ≡ -[1+ (m + n) ] [+m]-[+n]≡m⊖n : (+ m) - (+ n) ≡ m ⊖ n ∣m-n∣≡∣n-m∣ : ∣ m - n ∣ ≡ ∣ n - m ∣ +-minus-telescope : (m - n) + (n - o) ≡ m - o pos-distrib-* : ∀ x y → (+ x) * (+ y) ≡ + (x * y) ≤-irrelevance : IrrelevantRel _≤_ <-irrelevance : IrrelevantRel _<_
- Added new combinators to
Data.List.Base
:lookup : (xs : List A) → Fin (length xs) → A unzipWith : (A → B × C) → List A → List B × List C unzip : List (A × B) → List A × List B
- Added new proofs to
Data.List.Properties
:∷-injectiveˡ : x ∷ xs ≡ y List.∷ ys → x ≡ y ∷-injectiveʳ : x ∷ xs ≡ y List.∷ ys → xs ≡ ys ∷ʳ-injectiveˡ : xs ∷ʳ x ≡ ys ∷ʳ y → xs ≡ ys ∷ʳ-injectiveʳ : xs ∷ʳ x ≡ ys ∷ʳ y → x ≡ y ++-assoc : Associative {A = List A} _≡_ _++_ ++-identityˡ : LeftIdentity _≡_ [] _++_ ++-identityʳ : RightIdentity _≡_ [] _++_ ++-identity : Identity _≡_ [] _++_ ++-isSemigroup : IsSemigroup {A = List A} _≡_ _++_ ++-isMonoid : IsMonoid {A = List A} _≡_ _++_ [] ++-semigroup : ∀ {a} (A : Set a) → Semigroup _ _ ++-monoid : ∀ {a} (A : Set a) → Monoid _ _ filter-none : All P xs → dfilter P? xs ≡ xs filter-some : Any (∁ P) xs → length (filter P? xs) < length xs filter-notAll : Any P xs → 0 < length (filter P? xs) filter-all : All (∁ P) xs → dfilter P? xs ≡ [] filter-complete : length (filter P? xs) ≡ length xs → filter P? xs ≡ xs tabulate-cong : f ≗ g → tabulate f ≡ tabulate g tabulate-lookup : tabulate (lookup xs) ≡ xs zipWith-identityˡ : ∀ xs → zipWith f [] xs ≡ [] zipWith-identityʳ : ∀ xs → zipWith f xs [] ≡ [] zipWith-comm : (∀ x y → f x y ≡ f y x) → zipWith f xs ys ≡ zipWith f ys xs zipWith-unzipWith : uncurry′ g ∘ f ≗ id → uncurry′ (zipWith g) ∘ (unzipWith f) ≗ id zipWith-map : zipWith f (map g xs) (map h ys) ≡ zipWith (λ x y → f (g x) (h y)) xs ys map-zipWith : map g (zipWith f xs ys) ≡ zipWith (λ x y → g (f x y)) xs ys length-zipWith : length (zipWith f xs ys) ≡ length xs ⊓ length ys length-unzipWith₁ : length (proj₁ (unzipWith f xys)) ≡ length xys length-unzipWith₂ : length (proj₂ (unzipWith f xys)) ≡ length xys
- Added new proofs to
Data.List.All.Properties
:All-irrelevance : IrrelevantPred P → IrrelevantPred (All P) filter⁺₁ : All P (filter P? xs) filter⁺₂ : All Q xs → All Q (filter P? xs) mapMaybe⁺ : All (Maybe.All P) (map f xs) → All P (mapMaybe f xs) zipWith⁺ : Pointwise (λ x y → P (f x y)) xs ys → All P (zipWith f xs ys)
- Added new proofs to
Data.List.Any.Properties
:mapMaybe⁺ : Any (Maybe.Any P) (map f xs) → Any P (mapMaybe f xs)
- Added new proofs to
Data.List.Relation.Lex.NonStrict
:<-antisymmetric : Symmetric _≈_ → Antisymmetric _≈_ _≼_ → Antisymmetric _≋_ _<_ <-transitive : IsPartialOrder _≈_ _≼_ → Transitive _<_ <-resp₂ : IsEquivalence _≈_ → _≼_ Respects₂ _≈_ → _<_ Respects₂ _≋_ ≤-antisymmetric : Symmetric _≈_ → Antisymmetric _≈_ _≼_ → Antisymmetric _≋_ _≤_ ≤-transitive : IsPartialOrder _≈_ _≼_ → Transitive _≤_ ≤-resp₂ : IsEquivalence _≈_ → _≼_ Respects₂ _≈_ → _≤_ Respects₂ _≋_
- Added new proofs to
Data.List.Relation.Pointwise
:tabulate⁺ : (∀ i → f i ∼ g i) → Pointwise _∼_ (tabulate f) (tabulate g) tabulate⁻ : Pointwise _∼_ (tabulate f) (tabulate g) → (∀ i → f i ∼ g i) ++⁺ : Pointwise _∼_ ws xs → Pointwise _∼_ ys zs → Pointwise _∼_ (ws ++ ys) (xs ++ zs) concat⁺ : Pointwise (Pointwise _∼_) xss yss → Pointwise _∼_ (concat xss) (concat yss)
- Added new proofs to
Data.List.Relation.Lex.Strict
:<-antisymmetric : Symmetric _≈_ → Irreflexive _≈_ _≺_ → Asymmetric _≺_ → Antisymmetric _≋_ _<_ <-transitive : IsEquivalence _≈_ → _≺_ Respects₂ _≈_ → Transitive _≺_ → Transitive _<_ <-respects₂ : IsEquivalence _≈_ → _≺_ Respects₂ _≈_ → _<_ Respects₂ _≋_ ≤-antisymmetric : Symmetric _≈_ → Irreflexive _≈_ _≺_ → Asymmetric _≺_ → Antisymmetric _≋_ _≤_ ≤-transitive : IsEquivalence _≈_ → _≺_ Respects₂ _≈_ → Transitive _≺_ → Transitive _≤_ ≤-respects₂ : IsEquivalence _≈_ → _≺_ Respects₂ _≈_ → _≤_ Respects₂ _≋_
- Added new proofs to
Data.Maybe.Base
:just-injective : (Maybe A ∋ just a) ≡ just b → a ≡ b
- Added new proofs to
Data.Nat.Divisibility
:m|m*n : m ∣ m * n ∣m⇒∣m*n : i ∣ m → i ∣ m * n ∣n⇒∣m*n : i ∣ n → i ∣ m * n
- Added new proofs to
Data.Nat.Properties
:≤⇒≯ : _≤_ ⇒ _≯_ n≮n : ∀ n → n ≮ n ≤-stepsʳ : ∀ m ≤ n → m ≤ n + o ≤-irrelevance : IrrelevantRel _≤_ <-irrelevance : IrrelevantRel _<_ +-monoˡ-≤ : ∀ n → (_+ n) Preserves _≤_ ⟶ _≤_ +-monoʳ-≤ : ∀ n → (n +_) Preserves _≤_ ⟶ _≤_ +-monoˡ-< : ∀ n → (_+ n) Preserves _<_ ⟶ _<_ +-monoʳ-< : ∀ n → (n +_) Preserves _<_ ⟶ _<_ +-semigroup : Semigroup _ _ +-0-monoid : Monoid _ _ +-0-commutativeMonoid : CommutativeMonoid _ _ *-monoˡ-≤ : ∀ n → (_* n) Preserves _≤_ ⟶ _≤_ *-monoʳ-≤ : ∀ n → (n *_) Preserves _≤_ ⟶ _≤_ *-semigroup : Semigroup _ _ *-1-monoid : Monoid _ _ *-1-commutativeMonoid : CommutativeMonoid _ _ *-+-semiring : Semiring _ _ ^-identityʳ : RightIdentity 1 _^_ ^-zeroˡ : LeftZero 1 _^_ ^-semigroup-morphism : (x ^_) Is +-semigroup -Semigroup⟶ *-semigroup ^-monoid-morphism : (x ^_) Is +-0-monoid -Monoid⟶ *-1-monoid m≤n⇒m⊓n≡m : m ≤ n → m ⊓ n ≡ m m≤n⇒n⊓m≡m : m ≤ n → n ⊓ m ≡ m m≤n⇒n⊔m≡n : m ≤ n → n ⊔ m ≡ n m≤n⇒m⊔n≡n : m ≤ n → m ⊔ n ≡ n ⊔-monoˡ-≤ : ∀ n → (_⊔ n) Preserves _≤_ ⟶ _≤_ ⊔-monoʳ-≤ : ∀ n → (n ⊔_) Preserves _≤_ ⟶ _≤_ ⊓-monoˡ-≤ : ∀ n → (_⊓ n) Preserves _≤_ ⟶ _≤_ ⊓-monoʳ-≤ : ∀ n → (n ⊓_) Preserves _≤_ ⟶ _≤_ m∸n+n≡m : n ≤ m → (m ∸ n) + n ≡ m m∸[m∸n]≡n : n ≤ m → m ∸ (m ∸ n) ≡ n s≤s-injective : s≤s p ≡ s≤s q → p ≡ q ≤′-step-injective : ≤′-step p ≡ ≤′-step q → p ≡ q
- Added new proofs to
Data.Plus
:[]-injective : (x [ _∼_ ]⁺ y ∋ [ p ]) ≡ [ q ] → p ≡ q ∼⁺⟨⟩-injectiveˡ : (x [ _∼_ ]⁺ z ∋ x ∼⁺⟨ p ⟩ q) ≡ (x ∼⁺⟨ r ⟩ s) → p ≡ r ∼⁺⟨⟩-injectiveʳ : (x [ _∼_ ]⁺ z ∋ x ∼⁺⟨ p ⟩ q) ≡ (x ∼⁺⟨ r ⟩ s) → q ≡ s
- Added new combinator to
Data.Product
:curry′ : (A × B → C) → (A → B → C)
- Added new proofs to
Data.Product.Properties
:,-injectiveˡ : (a , b) ≡ (c , d) → a ≡ c ,-injectiveʳ : (Σ A B ∋ (a , b)) ≡ (a , c) → b ≡ c
- Added new operator in
Data.Product.Relation.Pointwise.NonDependent
:_×ₛ_ : Setoid ℓ₁ ℓ₂ → Setoid ℓ₃ ℓ₄ → Setoid _ _
- Added new proofs to
Data.Rational.Properties
:≤-irrelevance : IrrelevantRel _≤_
- Added new proofs to
Data.ReflexiveClosure
:[]-injective : (Refl _∼_ x y ∋ [ p ]) ≡ [ q ] → p ≡ q
- Added new proofs to
Data.Sign
:*-isSemigroup : IsSemigroup _≡_ _*_ *-semigroup : Semigroup _ _ *-isMonoid : IsMonoid _≡_ _*_ + *-monoid : Monoid _ _
- Added new proofs to
Data.Star.Properties
:◅-injectiveˡ : (Star T i k ∋ x ◅ xs) ≡ y ◅ ys → x ≡ y ◅-injectiveʳ : (Star T i k ∋ x ◅ xs) ≡ y ◅ ys → xs ≡ ys
- Added new proofs to
Data.Sum.Properties
:inj₁-injective : (A ⊎ B ∋ inj₁ x) ≡ inj₁ y → x ≡ y inj₂-injective : (A ⊎ B ∋ inj₂ x) ≡ inj₂ y → x ≡ y
- Added new operator in
Data.Sum.Relation.Pointwise
:_⊎ₛ_ : Setoid ℓ₁ ℓ₂ → Setoid ℓ₃ ℓ₄ → Setoid _ _
- Added new proofs to
Data.Vec.Properties
:∷-injectiveˡ : x ∷ xs ≡ y ∷ ys → x ≡ y ∷-injectiveʳ : x ∷ xs ≡ y ∷ ys → xs ≡ ys []=⇒lookup : xs [ i ]= x → lookup i xs ≡ x lookup⇒[]= : lookup i xs ≡ x → xs [ i ]= x lookup-replicate : lookup i (replicate x) ≡ x lookup-⊛ : lookup i (fs ⊛ xs) ≡ (lookup i fs $ lookup i xs) tabulate-cong : f ≗ g → tabulate f ≡ tabulate g
- Added new proofs to
Data.Vec.All.Properties
All-irrelevance : IrrelevantPred P → ∀ {n} → IrrelevantPred (All P {n})
- Added new proofs to
Data.Vec.Relation.Pointwise.Extensional
:isDecEquivalence : IsDecEquivalence _~_ → IsDecEquivalence (Pointwise _~_) extensional⇒inductive : Pointwise _~_ xs ys → IPointwise _~_ xs ys inductive⇒extensional : IPointwise _~_ xs ys → Pointwise _~_ xs ys ≡⇒Pointwise-≡ : Pointwise _≡_ xs ys → xs ≡ ys Pointwise-≡⇒≡ : xs ≡ ys → Pointwise _≡_ xs ys
- Added new proofs to
Data.Vec.Relation.Pointwise.Inductive
:++⁺ : Pointwise P xs → Pointwise P ys → Pointwise P (xs ++ ys) ++⁻ˡ : Pointwise P (xs ++ ys) → Pointwise P xs ++⁻ʳ : Pointwise P (xs ++ ys) → Pointwise P ys ++⁻ : Pointwise P (xs ++ ys) → Pointwise P xs × Pointwise P ys concat⁺ : Pointwise (Pointwise P) xss → Pointwise P (concat xss) concat⁻ : Pointwise P (concat xss) → Pointwise (Pointwise P) xss lookup : Pointwise _~_ xs ys → ∀ i → lookup i xs ~ lookup i ys isDecEquivalence : IsDecEquivalence _~_ → IsDecEquivalence (Pointwise _~_) ≡⇒Pointwise-≡ : Pointwise _≡_ xs ys → xs ≡ ys Pointwise-≡⇒≡ : xs ≡ ys → Pointwise _≡_ xs ys Pointwiseˡ⇒All : Pointwise (λ x y → P x) xs ys → All P xs Pointwiseʳ⇒All : Pointwise (λ x y → P y) xs ys → All P ys All⇒Pointwiseˡ : All P xs → Pointwise (λ x y → P x) xs ys All⇒Pointwiseʳ : All P ys → Pointwise (λ x y → P y) xs ys
- Added new functions and proofs to
Data.W
:map : (f : A → C) → ∀[ D ∘ f ⇒ B ] → W A B → W C D induction : (∀ a {f} (hf : ∀ (b : B a) → P (f b)) → (w : W A B) → P w foldr : (∀ a → (B a → P) → P) → W A B → P sup-injective₁ : sup x f ≡ sup y g → x ≡ y sup-injective₂ : sup x f ≡ sup x g → f ≡ g
- Added new properties to
Relation.Binary.PropositionalEquality
isPropositional A = (a b : A) → a ≡ b IrrelevantPred P = ∀ {x} → isPropositional (P x) IrrelevantRel _~_ = ∀ {x y} → isPropositional (x ~ y)
- Added new combinator to ` Relation.Binary.PropositionalEquality.TrustMe`:
postulate[_↦_] : (t : A) → B t → (x : A) → B x
- Added new proofs to
Relation.Binary.StrictToNonStrict
:isPreorder₁ : IsPreorder _≈_ _<_ → IsPreorder _≈_ _≤_ isPreorder₂ : IsStrictPartialOrder _≈_ _<_ → IsPreorder _≈_ _≤_ isPartialOrder : IsStrictPartialOrder _≈_ _<_ → IsPartialOrder _≈_ _≤_ isTotalOrder : IsStrictTotalOrder _≈_ _<_ → IsTotalOrder _≈_ _≤_ isDecTotalOrder : IsStrictTotalOrder _≈_ _<_ → IsDecTotalOrder _≈_ _≤_
- Added new syntax, relations and proofs to
Relation.Unary
:syntax Universal P = ∀[ P ] P ⊈ Q = ¬ (P ⊆ Q) P ⊉ Q = ¬ (P ⊇ Q) P ⊂ Q = P ⊆ Q × Q ⊈ P P ⊃ Q = Q ⊂ P P ⊄ Q = ¬ (P ⊂ Q) P ⊅ Q = ¬ (P ⊃ Q) P ⊈′ Q = ¬ (P ⊆′ Q) P ⊉′ Q = ¬ (P ⊇′ Q) P ⊂′ Q = P ⊆′ Q × Q ⊈′ P P ⊃′ Q = Q ⊂′ P P ⊄′ Q = ¬ (P ⊂′ Q) P ⊅′ Q = ¬ (P ⊃′ Q) f ⊢ P = λ x → P (f x) ∁? : Decidable P → Decidable (∁ P)
- Added
recompute
toRelation.Nullary
:recompute : ∀ {a} {A : Set a} → Dec A → .A → A


This is a simple example of the api.
Select these boxes to show / hide the features.
Feature1:
api.isVisibible('feature1') -> {{feature1}}
Feature2:
api.isVisibible('feature2') -> {{feature2}}
This is feature1
This is feature2
This is feature2 variant on


Devs, you going to love this keyboard hack!
If you’ve spent a lot of time in the shell, you may find yourself wishing to move at the Speed of Thought, yet encumbered by that pesky shift key. How are you supposed to throw down that regex, when you’ve got to strain your fingers with alternate shift strokes? Want to exit VIM using q! without hitting shift? Want to type any strong password without hitting shift?
… Well, i guess you do need shift to type caps … But who types passwords anymore?
Map your FN Keys to Digits
And now you have an extra row of keys for text entry! It’s almost like having extra fingers. Don’t worry about those Function Keys, you’ll still be able to use those with the Mac FN button. As for the Consumer Keys, a.k.a. Media Keys, I have a modkey hack you can use to get those back.
Map your Digits to Symbols
And now you don’t have to press shift to type !@#$%^&*()! Suddenly, there’s a lot less friction when typing in the shell.
Here’s my keyboard layout:
Yep, I have an Uber key. And a Hyper key, which is only active where needed: in Terminal and Emacs.
Oh, and I think I just experienced a moment of extacy, as I realized my Hyper Key configuration for GUI Emacs is magically working! Yes, there’s a separate configuration required for Hyper in Terminal Emacs and GUI Emacs. And the script that mysteriously did nothing in the past is now working. Ahhh, yeah!
Here is the config I’ve been using for over a year now
This is a config file for KeyRemap4MacBook, my absolute FAVORITE OSX customization tool. This is THE KING of customizing your Mac’s keyboard. Honestly, no other tool comes close. Not XModMap. No, not even Linux’s XKB. AFAIK, XKB cannot remap simultaneous keypresses. IF anyone can correct me here, plz let me know, as I would be absolutely blissful to discover this in Linux.
What’s a Simultaneous Keypress?
You can map < and > to say, X+Space and ,+Space, which is also a configuration I have set with KeyRemap. So when I use two fingers to hit X and Space within a threshold time limit, < is substituted instead.
Again, if there’s anything like this in Linux, please let me know!
This seems like a minor hack, but I really enjoy typing my HTML’s like this. I have simultaneous keypresses configured for < { ~ “ | } > and I find them fun to type. I wish I had more time to do some exploring with configs like these. But alas, I digress…
The Ultimate Developer’s Keyboard!
Isn’t that Dvorak?
Well, this hack works with both QWERTY and DVORAK, when using OSX keyboard layouts. I also have config samples for XModMap in Linux, which are in my dc.files.kbd repo as well.


Dr. Eleanor Gaye
Awesome Science faculty
University of Awesome
Bobtown, CA 99999,
USA
Tel:<PHONE_NUMBER>
Email<EMAIL_ADDRESS>Eileen Dove
4321 Cliff Top Edge
Dover, CT9 XXX
UK
Dear Eileen,
Thank you for your recent application to join us at the University of Awesome's science faculty to study as part of
your PhD next year. I will answer your questions one by one, in the following sections.
We are happy to accomodate you starting your study with us at any time, however it would suit us better if you could start at the beginning of a semester; the start dates for each one are as follows:
Please let me know if this is ok, and if so which start date you would prefer.
You can find more information about important university dates on our website.
At the Awesome Science Faculty, we have a pretty open-minded research facility — as long as the subjects fall somewhere in the realm of science and technology.  Saying that, of the ideas you submitted we were most intrigued by are as follows, in order of priority:
So please can you provide more information on each of these subjects, including how long you'd expect the research to take, required staff and other resources, and anything else you think we'd need to know? Thanks.
Yes, you are right! As part of my post-doctorate work, I did study exotic tribal dances. To answer your question, my favourite dances are as follows, with definitions:
Be awesome to each other.-- Bill S Preston, Esq


Another assault locks down Portage prison
PORTAGE, Wis. - State officials say the maximum-security Columbia Correctional Institution remains locked down following another assault on a staff member.
The Department of Corrections says the lockdown, which restricts prisoners' movement, began after the latest assault Friday. Corrections spokeswoman Clare Hendricks says there were also two additional and separate staff assaults at the Portage prision in the past weeks.
Hendricks says DOC is working with law enforcement to investigate the latest assault, but no other details about the incident are being released.
She says the prison will remain locked down until corrections officials believe it's safe to lift the restrictions.


Charlotte-Mecklenburg Police say a 2008 Nissan Altima collided with Rhonda Michelle Cook, who was crossing Providence Road near Old Providence Road around 3:34 p.m.
Cook was not using a crosswalk, police said.
The Nissan had been traveling southbound on Providence Road in the left straight lane at the time of the incident, police said.
Cook, 52, was taken to Atrium Health, where she later died.
Police don’t believe speed or impairment contributed to the collision.
Providence Road was closed in both directions between Old Providence Road and International Drive while officers investigated.


Your browser currently does not support javascript or you have javascript turned off. This site will have very limited functionality without javascript. Please use a modern browser with javascript or enable the javascript option.


Jeremiah 52:23
And there were ninety and six pomegranates on a side; and all the pomegranates upon the network were an hundred round about.


Toggle navigation
Quadratic Polynomial
Second Degree Equations
Quadratic Equation:
a
x
2
+
b
x +
c
Enter the coefficients of a, b and c in the field below.
Value of a:
Value of b:
Value of c:
Solve Equation
Result :


The following are my project
This is platform where milk suppers can reach to their customers in in the market tu meet market demand
Also give farmers a chance by which can get education and learn new methods of high production
Languages used HTML and CSS
This is an online company that deals with purchase of second hand good which can be reused and recycled
By doing so environment pollution is conserved and creating job vaccancies
Languages used HTML and CSS


telegraph
Crystal Telegraph API wrapper
Installation
- Add the dependency to your
shard.yml
:
`yaml
dependencies:
telegraph:
github: lulzx/telegraph
`
- Run
shards install
Usage
require "telegraph"
TODO Write usage instructions here
Development
TODO Write development instructions here
Contributing
- Fork it (<https://github.com/lulzx/telegraph/fork>)
- Create your feature branch (
git checkout -b my-new-feature
) - Commit your changes (
git commit -am 'Add some feature'
) - Push to the branch (
git push origin my-new-feature
) - Create a new Pull Request
Contributors
- lulzx - creator and maintainer


Select a parking zone
Please enter your license plate number
Want to buy a pass?
Choose a zone and how long you need!


A modern day warrior
Mean, mean stride
Today's Tom Sawyer
Mean, mean pride
Though his mind is not for rent
Don't put him down as arrogant
His reserve, a quiet defense
Riding out the day's events
The river
What you say about his company
Is what you say about society
Catch the mist, catch the myth
Catch the mystery, catch the drift
The world is, the world is
Love and life are deep
Maybe as his skies are wide
Today's Tom Sawyer
He gets high on you
And the space he invades
He gets by on you
No his mind is not for rent
To any god or government
Always hopeful, yet discontent
He knows changes aren't permanent
But change is
What you say about his company
Is what you say about society
Catch the witness, catch the wit
Catch the spirit, catch the spit
The world is, the world is
Love and life are deep
Maybe as his eyes are wide
Exit the warrior
Today's Tom Sawyer
He gets high on you
And the energy you trade
He gets right on to the friction of the day


--- title: Whole Foods continues DFW expansion with opening in Colleyville class: latest-news parent: Latest News categories: ---
Jun 6, 2014, 1:55pm CDT
Danielle Abril
Staff Writer- Dallas Business Journal
Whole Foods is planning to open its Colleyville location on July 8. It's planning four more DFW locations in the next two years.
Whole Foods is preparing to open its first store in Northeast Tarrant County on July 8.
The 40,000 square-foot store will be at 4801 Colleyville Blvd. at the Colleyville Downs Center off Glade Road and State Highway 26.
The Austin-based grocer will host a public bread-breaking ceremony at 7:30 a.m. that will include an appearance by Colleyville Mayor David Kelly.
Whole Foods has announced four other Dallas-Fort Worth locations, all of which are slated to be open by spring 2016.
Highland Village is next on tap, slated for fall 2014. The Uptown location on the bottom floor of the developing Gables Residential building is scheduled to open in summer 2015, with the Frisco location, which serves as the anchor to Wade Park, opening in fall of that year. Fort Worth’s store, which will be at Trademark Property Co.’s 63-acre mixed use project, is expected to open in spring 2016.
KDC also told the Dallas Business Journal that a 45,000 square-foot store is slated to open at its CityLine development at the corner of Renner Road and North Plano in Richardson. Whole Foods has yet to confirm that location.


Please enter a valid local authority.
If you are unsure what your local authority
is, please click here
Data for this area is already populated
Data for this area is unavailable, please enter another local authority.
For more information on local authorites please click here


Tool-set to support Bayesian evidence synthesis. This includes meta-analysis, (robust) prior derivation from historical data, operating characteristics and analysis (1 and 2 sample cases).
| Version: | 1.3-7 |
| Depends: | R (≥ 3.4.0), Rcpp (≥ 0.12.0), methods |
| Imports: | assertthat, mvtnorm, Formula, checkmate, rstan (≥ 2.18.1), bayesplot (≥ 1.4.0), ggplot2, dplyr, stats, utils |
| LinkingTo: | StanHeaders (≥ 2.18.0), rstan (≥ 2.18.1), BH (≥ 1.66.0), Rcpp (≥ 0.12.0), RcppEigen (≥ <IP_ADDRESS>.0) |
| Suggests: | rmarkdown, knitr, testthat (≥ 2.0.0), foreach, tidyverse, purrr, rstanarm (≥ 2.17.2), scales |
| Published: | 2018-11-19 |
| Author: | Novartis Pharma AG [cph], Sebastian Weber [aut, cre], Beat Neuenschwander [ctb], Heinz Schmidli [ctb], Baldur Magnusson [ctb], Yue Li [ctb], Satrajit Roychoudhury [ctb], Trustees of Columbia University [cph] (src/init.cpp, tools/make_cc.R, R/stanmodels.R, src/Makevars, src/Makevars.win) |
| Maintainer: | Sebastian Weber <sebastian.weber at novartis.com> |
| License: | GPL (≥ 3) | file LICENSE |
| NeedsCompilation: | yes |
| SystemRequirements: | GNU make, pandoc (>= 1.12.3), pandoc-citeproc |
| Materials: | NEWS |
| In views: | MetaAnalysis, MetaAnalysis |
| CRAN checks: | RBesT results |
| Reference manual: | RBesT.pdf |
| Vignettes: |
Probability of Success with Co-Data (advanced) Probability of Success at an Interim Analysis Customizing RBesT plots Getting started with RBesT (binary) RBest for a Normal Endpoint Using RBesT to reproduce Schmidli et. al "Robust MAP Priors" Meta-Analytic-Predictive Priors for Variances |
| Package source: | RBesT_1.3-7.tar.gz |
| Windows binaries: | r-devel: RBesT_1.3-7.zip, r-release: RBesT_1.3-7.zip, r-oldrel: RBesT_1.3-7.zip |
| OS X binaries: | r-release: RBesT_1.3-7.tgz, r-oldrel: RBesT_1.3-7.tgz |
| Old sources: | RBesT archive |
Please use the canonical form https://CRAN.R-project.org/package=RBesT to link to this page.


Small Soldiers (1998) Gregory Smith, Kristen Durst, Kevin Dunn, Phil Hartman, Jay Mohr, Denis Leary, David Cross, Ann Magnuson, Wendy Schaal, Dick Miller, Robert Picardo. Voices of Tommy Lee Jones, Frank Langella, Ernest Borgnine, Jim Brown, George Kennedy, Bruce Dern, Christopher Guest, Michael McKean, Harry Shearer. Directed by Joe Dante. PG-13, 3 stars (out of five stars)
Review by Ed Johnson-Ott, NUVO Newsweekly www.nuvo-online.com/film/ Archive reviews at http://us.imdb.com/M/reviews_by?Edward+Johnson-ott
Entering a teenage girl's bedroom, a group of renegade toy soldiers spot her collection of Barbie-style dolls on the shelf. "Ooooh, fully poseable, " leers one of the plastic warriors, "Permission for R&R, sir!"
Based solely on its trailers, "Small Soldiers" has been dismissed by some as a "Toy Story" rip-off, but they're mistaken. Actually, it's a "Gremlins" rip-off, directed by Joe Dante, who also helmed both of the "Gremlin" films. Packed with comic mayhem and loads of pop culture references, "Small Soldiers" is enjoyable lightweight summer fare, despite its threadbare storyline and anemic characters.
Set in the same beatific small town where all the people in Steven Spielberg productions live, "Small Soldiers" deals with action figures run amuck. Implanted with computer chips pirated from the military, two groups of toys go to war, with the Commando Elite soldiers determined to eradicate the peaceful Gorgonites, and any humans who help them.
It's a simple, but cute concept that pays off with some big laughs, although the finished product doesn't live up to its potential, due to a number of poor choices from the filmmakers.
The human cast is painfully bland, just another group of sit-com stereotypes. There's the bumbling teen hero, his preoccupied father and ineffectual mother, the beautiful girl next door, her boobish parents, etc., etc. They're all sketchy as can be, making it difficult to care when they get in trouble. Only the late, greatly missed Phil Hartman makes any impression, adding what bite he can as the neighbor girl's loutish dad.
Okay, since we don't care about the humans, what about the toys? Here's where things really get odd. The appeal of a film like "Small Soldiers" comes from the wish-fulfillment notion of seeing the toy soldier battles we staged as children come to life, but it doesn't play out quite the way you might expect.
The Commando Elite soldiers are actually the bad guys, little military psychopaths out to defeat the enemy at all costs. And the Gorgonites, monster action figures with peaceful hearts, have been pre-programmed by the toymakers as timid losers. Their characters are sympathetic and appealing, but we don't get a chance to know them, because their programming ordains that they stay out of sight as much as possible.
Why would a toymaker program one of its armies to lose? I certainly have no idea. Why would Joe Dante make a film without sympathetic characters? Now, that one's easy. It's because Dante is far more interested in satire and mayhem than in people.
Ultimately, comic mayhem is all that "Small Soldiers" delivers. Thankfully, Dante is pretty good at it. He uses the Commando Elite soldiers to send up countless war movie stereotypes. Look for satiric nods at everything from "Apocalypse Now" to "The Dirty Dozen."
Speaking of the "Dirty Dozen," don't be surprised if you get a strong sense of deja vu, as several veterans of the 1967 World War II flick turn up here. Ernest Borgnine provides the voice of Commando Kip Killagin, with Jim Brown as Butch Meathook, George Kennedy as Brick Bazooka and Bruce Dern as Link Static. Tommy Lee Jones heads the troops as leader Chip Hazard.
Keep your ears peeled for another mini-reunion, with "Spinal Tap" stars Christopher Guest, Michael McKean and Harry Shearer providing voices for the Gorgonites. Frank Langella plays Archer, the spokesman for the gentle monsters.
"Small Soldiers" virtually bursts at the seams with pop culture references. Standing over a fallen comrade, leader Chip Hazard solemnly intones, "his battery has died, but his memory keeps going and going and going." A doorbell rings the key notes from "Close Encounters of the Third Kind," one of several nods to executive producer Steven Spielberg. Dante even makes references to his own work, with "Gizmo" turning up as an online password.
Seamlessly blending computer graphics with live action footage, the film has a number of well-done set pieces. Particularly striking is a creepy sequence where the Commandos fit the neighbor girl's "Gwendy" dolls with computer chips, leading to a nightmarish Barbie-goes-berserk scene where the young woman finds herself under attack from her own dolls.
There's a lot of clever moments in "Small Soldiers," but ultimately the film still feels like a warmed-over "Gremlins." Joe Dante has a real knack for cartoonish sadism and light satire, but he's covered this turf before. Had the human characters been less bland, or the Gorgonites less timid, they might have provided the spark to ignite this story's potential. As it is, "Small Soldiers" is another sterile summertime trifle, frenetic, funny and quickly forgettable.
© 1998 Ed Johnson-Ott
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


Bob the Duck's Profile
Bob the Duck was born in 1991. He was raised by his parents Ed and Mary along with his seven siblings. He works in construction and is ready to mingle.
Bob's favorite websites


respiratory influenza viral bacterial tract infection RSV infections children clinical bacteria viral–bacterial codetection {border-style coinfection pneumoniae px;} #ffffff;} severity upper virus viruses associated study PCR young acute adenovirus aspirates different influenzae lower nasopharyngeal presence risk Streptococcus patients single (.%; cases colonization rate severe syncytial factor including infection, pneumococcal years CI, age detected px; significance used viruses, {font-family (.%), Clin Infect Table aureus catarrhalis community-acquired days disease font-size frequently hospitalized included interactions pathogens reduced significant underlying < (.%) (Table (aOR, (n = ), Dis;:–. Jina LRTI according adenovirus, airway analysis children. coexistence consecutive data diseases double; infections. influenza, real-time showed wheezing (/) .–.). However, Jiwon LRTIs LRTIs. Staphylococcus adenoviral border-color border-width carriage common higher increased infected multiplex need observed pneumoniae, progression small solid; specimens statistically using {font-style {font-weight (.%). .–. .–.), Asan DNA Haemophilus Lee. Medical Microbiol RSV, Respir Study aged bold care children, courier; defined detection em; especially infection. influence intensive mechanical microbiome negative population potential previous pt;} shown study,


Nipperkin run a shot across the bow draught splice the main brace scallywag booty cackle fruit trysail barque scurvy. Take a caulk main sheet blow the man down flogging crow's nest capstan fluke hail-shot fathom gabion. Scurvy fore pinnace provost loaded to the gunwalls chase bring a spring upon her cable scuttle hulk boatswain.
  Warp yawl topmast schooner starboard bilge water list lass keelhaul spanker.
Boom gunwalls spyglass topsail carouser chantey pinnace cog scurvy clap of thunder. Code of conduct scuttle loaded to the gunwalls piracy Sail ho reef to go on account overhaul bilged on her anchor Jack Tar. Long clothes cutlass yard scallywag hulk bilge hearties scourge of the seven seas me long boat.
Nipperkin run a shot across the bow draught splice the main brace scallywag booty cackle fruit trysail barque scurvy. Take a caulk main sheet blow the man down flogging crow's nest capstan fluke hail-shot fathom gabion. Scurvy fore pinnace provost loaded to the gunwalls chase bring a spring upon her cable scuttle hulk boatswain.
  Warp yawl topmast schooner starboard bilge water list lass keelhaul spanker.
Boom gunwalls spyglass topsail carouser chantey pinnace cog scurvy clap of thunder. Code of conduct scuttle loaded to the gunwalls piracy Sail ho reef to go on account overhaul bilged on her anchor Jack Tar. Long clothes cutlass yard scallywag hulk bilge hearties scourge of the seven seas me long boat.


patients COVID- []. allergic severe {border-style asthma px;} #ffffff;} allergy risk Allergy immunotherapy treatment SARS-CoV- acute atopic pandemic service infection recommendations symptoms Clin digital disease order patient provided Asthma care case clinical health new rhinitis control data dermatitis diseases infected management medicine px; viral {font-family TableÂ chronic font-size inhaled Care Health Patients action agents asthma, contact corticosteroid dose double; drug food health-care individuals, local measures need needs patientsâ€™ possible reduce reported requiring social sublingual use AIT Allergic Clinical Commons Creative European Severe [], access activated allergists associated biological border-color border-width clinic continued corticosteroids diagnosis diagnostic far fees home home-delivery increased outside personal regularly reports respiratory response solid; subcutaneous submitted therapeutic therapy unless work. {font-style {font-weight (e.g. Accessed Coronavirus Immunol Interrupting Network Pract../j.jaip... SCIT SLIT administration allergen anaphylaxis available bold challenge comorbidities courier; diseases, em; events general immune immunosuppressive including integrated lack like long oral positive postponed potential pt;} severity spreading symptoms. systems telemedicine times up-to-date urticaria venom virus