Yi Yi (A One and a Two) (2000) Wu Nien-jen, Elaine Jin, Kelly Lee, Jonathan Chang, Issey Ogata, Ke Suyun. Written and directed by Edward Yang. Mandarin and Japanese with English subtitles. 173 minutes. No MPAA rating, 4 stars (out of five stars)
Review by Ed Johnson-Ott, NUVO Newsweekly www.nuvo.com Archive reviews at http://us.imdb.com/ReviewsBy?Edward+Johnson-Ott To receive reviews by e-mail at no charge, send subscription requests to<EMAIL_ADDRESS>or e-mail<EMAIL_ADDRESS>with the word "subscribe" in the subject line.
To best enjoy "Yi Yi," I suggest you do the following: Stay in your car for a moment when you arrive at the theater. Breathe in and out deliberately, allowing your system to slow down.  Continue the conscious breathing until you feel relaxed and centered, then proceed to the box office.
Set in contemporary Taiwan, "Yi Yi" is a rich look at a middle class Taipei family. Written and directed by the very talented Edward Yang, the film (his seventh, but the first to be distributed in America) presents a glossy family portrait as a completed jigsaw puzzle, then begins removing the pieces. With affection and an unflinching lens, he reveals the vast distances between people who are supposedly very close.
At the center of it all is Yang-Yang (Jonathan Chang), a bright-eyed 8-year-old boy with a habit of asking hard questions ("Daddy, I can't see what you see and you can't see what I see. How can we know more than half the truth?"). After numerous adults pat him on the head and move away, he comes up with his own suppositions and acts on them, using a camera to make his statement. Yang-Yang takes a series of photos of the back of people's heads. Asked why, he explains to a subject, "You couldn't see it, so I showed you."
His relatives are too preoccupied to think about what he has said. Shortly after a raucous wedding, Yang-Yang's grandmother has a stroke and goes into a coma. She eventually ends up at home, with doctors encouraging her loved ones to try and stimulate her senses by talking to her. The process proves to be more difficult than it sounds. NJ (Wu Nienjen), the family patriarch, compares it to praying, because "you're not sure the other party can hear, and you're not sure whether you're sincere." His wife Min-Min (Elaine Jin) ends up in tears, exclaiming, "I have nothing to say to Mother. I tell her the same things every day. I have so little. How can it be so little? I live a blank."
Mom lights out for a mountain temple to meditate, leaving NJ in an even more surreal space. The electronics executive runs into Sherry (Ke Suyun), his first love, a woman he has not seen for 30 years. She is as shattered by the encounter as he, following him to sputter, "Why didn't you come that day? I waited and waited. I never got over it."
Why we end up with the people we do is a recurring theme in "Yi Yi." And what if we had made different choices? NJ ponders these questions while hanging with his friend, Mr. Ota (Issey Ogata), a Japanese games designer with a gift for classical piano. NJ treats Ota with deference and something approaching awe – Ota seems to serve the same function as Min-Min's guru – but there are no obvious answers. He finally calls Sherry, who wonders aloud, despite the fact that she too is married, if they should pick up where they left off.
Mind you, this is just one relatively small part of a very large film. Every member of the family has his or her own set of joys and challenges, with decidedly more of the latter than the former. Director Yang gently weaves together their circumstances, leisurely, but not lazily. "Yi Yi" is nearly three hours long, but the film never lags, drifting by like a silk ribbon on a breezy day. Yang knows the correct pace for his story and expects us to be smart enough to adjust to it. There are pauses inserted throughout the film. At one point he cuts to an image of clouds against a blue sky and, by my count, holds the shot for 19 seconds, which would be an eternity in most studio productions. But pauses like that allow extra time for reflection, and a film like this offers much upon which to reflect.
Yang further accents his character studies with striking camerawork. Many scenes are filmed against, or through, reflective glass, presenting the outside of these interior worlds. Where most directors overuse close-ups in personal moments, Yang favors medium to long shots and, rather than distancing the viewer, the placement makes the scenes seem more intimate. We study the well-composed settings and listen to the people in the middle that are trying to make sense of the life racing by them. Watching them makes it a bit easier to put one's own crisis du jour in context, just one of the many gifts that "Yi Yi" has to offer.
© 2001 Ed Johnson-Ott
========== X-RAMR-ID: 28806 X-Language: en X-RT-ReviewID: 215413 X-RT-TitleID: 1100996 X-RT-SourceID: 591 X-RT-AuthorID: 1099 X-RT-RatingText: 4/5
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


Ontology Editor
File
(current)
New
Load
Save
Settings
Search
Drag and drop components
owl:Class TreeView
owl:Ontology View
Sparql-DL widget
Dashboard
Load Owl File
×
Save to Owl File
×
Create new Owl File
×
URI
Name


Snipplets!
(function(getResult, el, code) { el.style.padding = '10px'; ReactDOM.render(getResult(), el); })
Opal.load('opal-parser'); (function(code) { return Opal.compile(code); })
# Making Snipplets is easy! This is a simple snipplet: ```html
[1, 2, 3, 4].map(x => x + 1); </textarea> ``` Add That to a simple HTML file that pulls in the snipplet js file, and the following snipplet will be displayed! (Try editing it)
[1, 2, 3, 4].map(x => x + 1);
# Adding a responder A responder is a text area with a class of `snipplet-responder`. Responders can change how evaluated values are evaluated. It is a simple function that takes 2 arguments. The evaluated result of the snipplet, and an element that you can use to display the result. Responders can also have a comma separated list of dependencies. Here is a simple react responder. The function is surrounded by parenthesis to make it an expression. ```html
(function(result, el) { if (result === undefined) el.innerHTML = ''; el.style.padding = '10px'; ReactDOM.render(result.result, el); }) </textarea> ``` To use a responder just give your snipplet a `data-responder-id` attribute. ```html
function Test({ text }) { return
alert(text)}>Greetings
};
</textarea> ``` Here is the snipplet above in action!
function Test({ text }) { return
alert(text)}>Greetings!
}
# Adding a compiler New compilers are also easy to add
[1, 2, 3, 4].map do |x| x + 1 end


Source code for h5database.skeletal.abstract_extractor
from abc import ABC, abstractmethod
# noinspection PyProtectedMember
from sklearn.feature_extraction.image import extract_patches
from skimage.filters import gaussian, laplace
from typing import Tuple, Dict, Sequence, Callable, Any, Iterable
from operator import mul
from functools import reduce
import types
from skimage.color import rgb2gray
import numpy as np
from h5database.database import DataExtractor
import logging
logging.basicConfig(level=logging.DEBUG)
[docs]class ExtractCallable(ABC, Callable):
"""
Superclass of all Callable that extract data (e.g. patches) from the source files.
Type order annotated in method type_order.
Override get_inputs should manually match the order of data types in patch_group
with the given type_order.
"""
KEY_SHAPE = 'data_shape'
[docs] @staticmethod
def patch_numbers(patches: np.ndarray, n_dims: int = 3) -> int:
"""
Examine the number of patches, if dimensionality is specified.
Args:
patches (): Groups of Patch data.
n_dims (): Dimensionality. Default 3.
Returns:
"""
if patches.ndim < 2: # row vectors
count = patches.shape[0]
else:
patch_size_product = reduce(mul, patches.shape[-n_dims:])
if patch_size_product == 0: # empty
count = 0
else:
count = patches.size // patch_size_product
return count
[docs] @staticmethod
def validate_shape(patch_groups: Sequence[Any], type_order: Sequence[str], data_shape: Dict[str, Tuple]):
"""
Validate whether the shape of each element of the arrays in the patch_groups matches \
the definition in the dict of data_shape.
Args:
patch_groups (): Sequence of different types of data. i.e. (data_type1_array, data_type2_array, ...) \
Assumption: leading dimension of data_typex_array is the length of the data array.
type_order (): The order of types of data in patch_groups.
data_shape (): Dictionary of shape of a single element in the data_array given the type.
Returns:
Raises:
AssertionError if shape does not match
"""
n_dims = tuple(len(data_shape[x]) for x in type_order)
logging.debug(f"{tuple(data_shape[type_name] for type_name in type_order)}")
logging.debug(f"{tuple(patches.shape for patches in patch_groups)}")
validation_result = tuple(patches.shape[-num_dimension:] == data_shape[type_name]
or (len(data_shape[type_name]) < 1 and patches.ndim == 1)
for (patches, num_dimension, type_name) in zip(patch_groups, n_dims, type_order))
logging.debug(f"{validation_result}")
assert np.asarray(validation_result).all(), f"Shape mismatched:" \
f"{list(patches.shape for patches in patch_groups)}. Expect: {data_shape}"
[docs] @staticmethod
def extract_patch(image: np.ndarray, patch_shape: Tuple[int, ...], stride: int, flatten: bool = True):
assert not np.isscalar(image), f"does not support scalar input:{image}"
if len(patch_shape) == 0:
patch_shape = 1
logging.debug(f'image_shape, {(image.shape, patch_shape)}')
insufficient_size = (x < y for (x, y) in zip(image.shape, patch_shape))
if any(insufficient_size):
pad_size = tuple(
max((y-x)/2, 0)
for (x, y) in zip(image.shape, patch_shape))
pad_size = tuple((int(np.ceil(x)), int(np.floor(x))) for x in pad_size)
image = np.pad(image, pad_size, 'wrap')
patches = extract_patches(image, patch_shape, stride)
if flatten:
patches = patches.reshape((-1,) + patch_shape)
return patches
[docs] @staticmethod
def get_background_by_contrast(img_gray: np.ndarray, sigma: float = 10, smooth_thresh: float = 0.03):
"""
A naive background/tissue detection by thresholding the mask of Gaussian-smoothed Laplacian mask.
Helper function of background_sanitize.
Args:
img_gray (): Grayscale image.
sigma (): Variance of the Gaussian kernel.
smooth_thresh (): Threshold of final background mask (smaller-equal)
Returns:
background: background of images.
mask: binary mask where nonzero elements represent background region.
"""
img_laplace = np.abs(laplace(img_gray))
# background region has low response: smaller smooth_thresh --> more strict criteria to spot background
# sigma --> radius. Larger sigma --> more loose. 10 is slower but more tolerant
mask = gaussian(img_laplace, sigma=sigma) <= smooth_thresh
# - pixel 1 is the background part
background = (mask != 0) * img_gray
background[mask == 0] = 1 # background[mask_background].mean()
return background, mask
[docs] @classmethod
def background_sanitize(cls, image: np.ndarray, sigma: float = 10, smooth_thresh: float = 0.03):
"""
Remove the background pixels for tissue slides (set to 0).
Args:
image (): original image. Either gray or RGB.
sigma (): Radius of the Gaussian kernel.
smooth_thresh (): Threshold of background mask (smaller-equal)
Returns:
image: image with background pixels set to 0.
"""
img_gray = rgb2gray(image)
background, mask = cls.get_background_by_contrast(img_gray, sigma=sigma, smooth_thresh=smooth_thresh)
image[mask == 1] = 0
return image
[docs] @staticmethod
@abstractmethod
def extract(inputs: Tuple[object, ...], type_order: Sequence[str], obj: DataExtractor, file: str,
data_shape: Dict[str, Tuple[int, ...]], **kwargs)\
-> Tuple[Sequence[Any], Sequence[bool], Sequence[str], object]:
"""
Extraction using the result of "get_inputs".
Args:
inputs (): Prepared input array obtained from "get_inputs".
type_order (): Pre-defined type order of output data.
obj (): Associated DataExtractor object.
file (): Path of Source file.
data_shape (): Shape of data per type.
**kwargs ():
Returns:
"""
...
[docs] @staticmethod
def validate_type_order(patch_types: Iterable, type_order: Iterable):
"""
Raise AssertError if the given patch_types and type_order do not match.
Args:
patch_types (): Given data-type of obtained patch
type_order (): Predefined data-type for the ExtractCallable.
Returns:
"""
compare = set(patch_types) - set(type_order)
assert len(compare) == 0, f'Predefined ordered type is not identical to the patch types ' \
f'Got:{type_order}. Expect:{patch_types}'
@classmethod
def __call__(cls, obj: DataExtractor, file: str) \
-> Tuple[Sequence[Any], Sequence[bool], Sequence[str], Any]:
"""
Callable Interface of ExtractCallable.
Args:
obj (): DataExtractor object that initiate the call.
file (): File path of the source file to extract.
Returns:
output (Tuple[Sequence[Any], Sequence[bool], Sequence[str], Any]):
Sequence[Any]: a sequence of [data_array_type_1, data_array_type_2, ...].
Sequence[bool]: Sequence of validation tag.
Any: Any extra information obtained. As a placeholder for future development.
"""
# Fetch external parameters from field "meta" of
if isinstance(obj.meta, types.SimpleNamespace):
params = obj.meta.__dict__
else:
params = obj.meta
patch_types = obj.database.types
# Define extra parameters.
patch_shape = params[cls.KEY_SHAPE]
# Remove the KEY_SHAPE entity from the dict, as not defined in the interface of cls.extract
params = {key: params[key] for key in params if key is not cls.KEY_SHAPE}
# Examine the type order.
type_order = cls.type_order()
cls.validate_type_order(patch_types, type_order)
# Prepare the input by the given type order.
inputs = cls.get_inputs(obj, file, type_order, patch_shape, **params)
# Extract the ordered output by the ordered input.
output: Tuple[Sequence[Any], Sequence[bool], Sequence[str], object] = \
cls.extract(inputs, type_order, obj, file, patch_shape, **params)
out_data, is_valid, type_order, extra_info = output
# Examine if the # of types in the output array size matches the # of pre-defined types.
assert len(out_data) == len(patch_types), f"Number of returned data type mismatched" \
f"Got:{len(out_data)}vs. Expect:{len(patch_types)}"
# logging.debug(f"{type_order}")
# Validate the output shape.
cls.validate_shape(out_data, type_order, patch_shape)
# Calculate the size of each data array
num_patch_group = tuple(cls.patch_numbers(patches, n_dims=len(patch_shape[type_name]))
for (patches, type_name) in zip(out_data, type_order))
# validate that the each patch array has the same number of data points.
assert (~np.diff(num_patch_group)).all(), f"Number of patches across types mismatched. " \
f"Got:{num_patch_group}, Types:{type_order}"
return output
[docs] @staticmethod
@abstractmethod
def type_order() -> Sequence[str]:
"""
Returns:
Predefined order of the data types.
"""
...
[docs] @classmethod
def label_key(cls) -> str:
"""
The attribute name of the "label" (output, ground truth, etc.) entity. \
Must be defined in type_order as well.
Returns:
key (str): The attribute name of the label.
Raises:
AssertionError, if not defined in type_order.
"""
key = cls._label_key_str()
assert key in cls.type_order(), f'Key of label not defined in type order' \
f'{key}. Expected from {cls.type_order()}'
return key
@staticmethod
def _label_key_str() -> str:
"""
Returns:
"""
raise NotImplementedError
[docs] @staticmethod
@abstractmethod
def get_inputs(obj: DataExtractor, file: str, patch_types: Sequence[str], data_shape: Dict[str, Tuple[int, ...]],
**kwargs) -> Tuple[object, ...]:
"""
Pre-process the input for the extraction. Method "extract" will be performed on the prepared input.
Args:
obj (): Associated DataExtractor obj.
file (): Path of the source file.
patch_types (): Data type names of all target inputs.
data_shape (): Shapes of data.
**kwargs (): Keyword arguments.
Keyword Args:
Given by obj.meta. Implemented by derived classes.
Returns:
Input patches group.
"""
...


PATCH /admin/pre-receive-environments/:pre_receive_environment_id
| Name | Type | Description |
|---|---|---|
name |
string |
This pre-receive environment's new name. |
image_url |
string |
URL from which to download a tarball of this environment. |
Status: 200 OK
{
"id": 2,
"name": "DevTools Hook Env",
"image_url": "https://my_file_server/path/to/devtools_env.tar.gz",
"url": "https://github.example.com/api/v3/admin/pre-receive-environments/2",
"html_url": "https://github.example.com/admin/pre-receive-environments/2",
"default_environment": false,
"created_at": "2016-05-20T11:35:45-05:00",
"hooks_count": 1,
"download": {
"url": "https://github.example.com/api/v3/admin/pre-receive-environments/2/downloads/latest",
"state": "success",
"downloaded_at": "2016-05-26T07:42:53-05:00",
"message": null
}
}
If you attempt to modify the default environment, you will get a response like this:
Status: 422 Unprocessable Entity
{
"message": "Validation Failed",
"errors": [
{
"resource": "PreReceiveEnvironment",
"code": "custom",
"message": "Cannot modify or delete the default environment"
}
]
}


public interface PreparedGeometry
Geometry
s
in order to optimize the performance
of repeated calls to specific geometric operations.
A given implementation may provide optimized implementations
for only some of the specified methods,
and delegate the remaining methods to the original Geometry
operations.
An implementation may also only optimize certain situations,
and delegate others.
See the implementing classes for documentation about which methods and situations
they optimize.
Subclasses are intended to be thread-safe, to allow PreparedGeometry
to be used in a multi-threaded context
(which allows extracting maximum benefit from the prepared state).
| Modifier and Type | Method and Description |
|---|---|
boolean |
contains(Geometry geom)
Tests whether the base
Geometry contains a given geometry. |
boolean |
containsProperly(Geometry geom)
Tests whether the base
Geometry properly contains a given geometry. |
boolean |
coveredBy(Geometry geom)
Tests whether the base
Geometry is covered by a given geometry. |
boolean |
covers(Geometry geom)
Tests whether the base
Geometry covers a given geometry. |
boolean |
crosses(Geometry geom)
Tests whether the base
Geometry crosses a given geometry. |
boolean |
disjoint(Geometry geom)
Tests whether the base
Geometry is disjoint from a given geometry. |
Geometry |
getGeometry()
Gets the original
Geometry which has been prepared. |
boolean |
intersects(Geometry geom)
Tests whether the base
Geometry intersects a given geometry. |
boolean |
overlaps(Geometry geom)
Tests whether the base
Geometry overlaps a given geometry. |
boolean |
touches(Geometry geom)
Tests whether the base
Geometry touches a given geometry. |
boolean |
within(Geometry geom)
Tests whether the base
Geometry is within a given geometry. |
Geometry getGeometry()
Geometry
which has been prepared.boolean contains(Geometry geom)
Geometry
contains a given geometry.geom
- the Geometry to testGeometry.contains(Geometry)
boolean containsProperly(Geometry geom)
Geometry
properly contains a given geometry.
The containsProperly
predicate has the following equivalent definitions:
[T**FF*FF*]
Geometry.contains(com.vividsolutions.jts.geom.Geometry)
predicate,
in which test geometries can intersect the target's boundary and still be contained.
The advantage of using this predicate is that it can be computed efficiently, since it avoids the need to compute the full topological relationship of the input boundaries in cases where they intersect.
An example use case is computing the intersections of a set of geometries with a large polygonal geometry.  In these cases the intersection is known a priori to be exactly the original test geometry.
geom
- the Geometry to testGeometry.contains(com.vividsolutions.jts.geom.Geometry)
boolean coveredBy(Geometry geom)
Geometry
is covered by a given geometry.geom
- the Geometry to testGeometry.coveredBy(Geometry)
boolean covers(Geometry geom)
Geometry
covers a given geometry.geom
- the Geometry to testGeometry.covers(Geometry)
boolean crosses(Geometry geom)
Geometry
crosses a given geometry.geom
- the Geometry to testGeometry.crosses(Geometry)
boolean disjoint(Geometry geom)
Geometry
is disjoint from a given geometry.
This method supports GeometryCollection
s as inputgeom
- the Geometry to testGeometry.disjoint(Geometry)
boolean intersects(Geometry geom)
Geometry
intersects a given geometry.
This method supports GeometryCollection
s as inputgeom
- the Geometry to testGeometry.intersects(Geometry)
boolean overlaps(Geometry geom)
Geometry
overlaps a given geometry.geom
- the Geometry to testGeometry.overlaps(Geometry)
boolean touches(Geometry geom)
Geometry
touches a given geometry.geom
- the Geometry to testGeometry.touches(Geometry)
boolean within(Geometry geom)
Geometry
is within a given geometry.geom
- the Geometry to testGeometry.within(Geometry)


STARSHIP TROOPERS (TriStar - 1997) Starring Casper Van Dien, Dina Meyer, Denise Richards, Jake Busey, Neil Patrick Harris, Clancy Brown, Seth Gilliam, Patrick Muldoon, Michael Ironside Screenplay by Ed Neumeier, based on the novel by Robert A. Heinlein Produced by Jon Davison, Alan Marshall Directed by Paul Verhoeven Running time: 129 minutes
** (out of four stars) Alternate Rating: C
Note: Some may consider portions of the following text to be spoilers. Be forewarned.
-------------------------------------------------------------
I screened STARSHIP TROOPERS at a theatre in Ottawa that, to me, had a rather unusual policy -- while an earlier-scheduled screening ran, ticketholders for a later screening of the film were queued *directly outside* the screening room, in the lobby, until the completion of the current screening. (For all I know, this may be standard practice elsewhere, but I've never encountered this before -- usually they don't allow you to loiter in the theatre, based on my experience). Consequently, I patiently waited along with a growing queue of patrons outside the screening room for STARSHIP TROOPERS, where the last fifteen minutes of the film could be heard echoing throughout the hall -- all that I could make out were nonstop alien insectoid squeals and roars, the shouting of troops under siege, sporadic bursts of gunfire, and a suitably heroic anthem playing.
This aural experience essentially encapsulates the latter (and, disturbingly enough, superior) half of Paul Verhoeven's STARSHIP TROOPERS, which in spirit is essentially a B-film with a mega A-budget (a reported $120 million). The film's final action-packed hour is complete carnage, as the human troops do battle with gigantic alien insects of all shapes and sizes on the planet of Klendathu. While the bug battle scenes are neither fresh nor inventive, they are relatively exciting to watch, and the visual effects are spectacular. It's the first half of STARSHIP TROOPERS which is the most unbearably excruciating to endure.
Although both are science-fiction films, in a sense STARSHIP TROOPERS is a literal antithesis of Andrew Niccol's GATTACA, released two weeks earlier: while the latter film is more cerebral in nature, concerned more with ideas than special effects, and has an icy sheen, STARSHIP TROOPERS is loud, noisy, and throbbing with comicbookish machismo.
Yet STARSHIP TROOPERS is not a mindless film merely depicting giant beasts to be slain in heroic fashion. The film has a subtext which is strictly militaristic, and depicted in tongue-in-cheek fashion by Mr. Verhoeven. In this totalitarian society of the future, the esteemed title of "citizen" is earned through a rite of passage in military duty, while "civilians" are looked upon condescendingly.  or the sheer excitement of the recruits as the outbreak of war is declared. STARSHIP TROOPERS pokes fun at the war-is-fun, ultra-macho killing mentality by wholeheartedly embracing it -- it has a goofy rah-rah jingoistic feel that would do Roland Emmerich proud; the scene where our protagonists proudly pose with their new "Death From Above" tattoos emblazoned on their biceps speaks volumes. Indeed, what can one say about a film where a declaration of "It's afraid!" is greeted by a chorus of cheers? (I'm not even going to touch thetopic of the Nazi-style uniforms sported by the troopers, most prominently by Carl Jenkins (Neil Patrick Harris).)
That this undertone will likely be lost to the majority of STARSHIP TROOPERS' audience is not due to subtlety; the film hardly buries this theme, and is often blatant in its representation. It's simply that this message is being pitched in a context where its usage is mostly ineffectual and in some cases even appears apt. While shots of little children cheerfully stomping on insects will cause chuckles, scenes of the troopers' homicidal tendencies being stirred up prior to engaging in battle will have the effect of similarly enticing the us-versus-them, xenophobic mentality of many in the audience.
The film opens with a teaser sequence on the alien planet as chaos and mayhem ensues, and the bodycount skyrockets courtesy of the bloodthirsty insects overrunning and essentially decimating the human contingent. Much has been made of the film's violence, which is admittedly brutal but not overly so -- it's much along the same aesthetic as Mr. Verhoeven's ROBOCOP, which featured blood spurting out of wounds; here, we have impalement by insectoid pincers, decapitations, and bodies torn apart limb from limb, but none of it is excessively gory as STARSHIP TROOPERS spends little time to linger or dwell upon it, instead determinedly charging forward.
The action gives way as STARSHIP TROOPERS employs the groanworthy "One year earlier" device, and we rejoin the film's protagonists in a more peaceful setting -- high school graduation day, Earth. (Buenos Aires actually, although before it was revealed in the film, I would have never guessed -- I thought it was Beverly Hills.) Yes, our heroes are fresh-faced youngsters, and for the first half of the film we're to endure their dopey generic tribulations: amorous rivalry, parental strife, and so forth. It's so remarkably campy and simple-minded that it makes the cliched, paper-thin characters of INDEPENDENCE DAY look like inspired screenwriting. STARSHIP TROOPERS' first hour is complete cornball material -- with these youthful pretty faces, it's like having the cast of MELROSE PLACE serving as our grizzled warriors against the alien marauders. (New troopers introduced later in the film seem to be have been enlisted straight out of SWEET VALLEY HIGH and drafted from THE BABYSITTERS' CLUB.) I shun television so I can avoid corny, eye-roll-inducing melodrama like this, so an hour's worth of it in a feature film doesn't exactly inspire high marks with me; are we supposed to care at all about these characters and their silly love lives? (I later learned that much of the young cast have indeed appeared in the various Aaron Spelling TV productions -- egad.) There's an exchange between Johnny Rico and fellow trooper Ace Levy (Jake Busey) where Ace sympathetically clucks, "They want to be friends after they tear your guts out." Johnny sadly retorts, "I *deserve* to get my guts torn out." In the audience, I silently agreed -- surely somebody other than those in the audience deserved to suffer for the aggravating first hour of STARSHIP TROOPERS. It's exasperating enough to make one stifle an anguished scream. Barely stifle.
After an interlude which features perhaps the worst use of Mazzy Star's "Fade Into You" that one can possibly imagine and some obligatory nude scenes from self-professed breast fetishist Mr. Verhoeven, our protagonists find themselves in fierce battle with spectacularly-rendered giant insects on a barren alien world. The insectoid marauders look terrific, although the manner in which they are ultimately dispatched is familiar stuff and their indestructibility and ferociousness varies depending upon the necessity of the plot. Nevertheless, the sight of thousands of computer-generated insects scurrying forth in attack formation is breathtaking, while the space battle scenes in orbit around Klendathu is solid if not outstanding work.
After the first attack by the troopers has been thoroughly trounced by the defending aliens, they conclude that there must be a a "smart" bug masterminding the insectoid military strategy, and STARSHIP TROOPERS ultimately focuses on the protagonists targeting this unseen entity.  (The bug also appears to be "smart" because it enjoys brain milkshakes and literally absorbs knowledge from its victim -- how inventive.)
While I haven't seen much of Paul Verhoeven's Dutch film output from the 1970s and early 1980s, I've seen nearly all of his English-language work and his 1987 film ROBOCOP is my favourite from his oeuvre -- a fine sci-fi action film which works both as pure visceral entertainment, and also on a more philosophical level. (I admittedly haven't seen his SHOWGIRLS, but I feel fairly safe in assuming that it won't challenge for the top spot on his resume.) STARSHIP TROOPERS marks somewhat of a reunion for many of the key players in the making of ROBOCOP: prolific Basil Poledouris composed an anthemic score which vaguely echoes that for the 1987 film, cinematographer Jost Vacano's photography is crisp and sharp, and screenwriter Ed Neumeier once again sprinkles various amusingly satiric news/propaganda insert clips throughout the film which depict the state of this future society -- it's striking and telling how much these blurbs resemble old WWII propaganda footage in tone and spirit. Hey, I'd buy that for a dollar!
Barring these satiric interludes, this is not a great screenplay, full of cornball B-film cliches, such as an impossible heroic survival of an attack which leaves the rest of the cast presuming that he's perished, and noble deathbed gestures and proclamations. This is the kind of script where when a character declares, "I'd expect any one of you to do the same for me", you know it's because someone will have to, and where when you see Johnny Rico perform a triple flip in a football game, it's merely a matter of time before the same maneuver is used at a fortuitous moment in the film.
Among the cast, Michael Ironside (who appeared in Mr. Verhoeven's TOTAL RECALL) and Clancy Brown are the two brights spots as characters they often play elsewhere, and play well -- Mr. Ironside as the humourless, tough-as-nails Lieutenant Rasczak, and Mr. Brown as drill sergeant Zim (echoing his best performance in Frank Darabont's THE SHAWSHANK REDEMPTION as the tough screw prison guard). None of the rest of the cast makes much of an impression (although Mr. Van Dien is, as of this writing, now getting seven-figure deals for future projects), though Denise Richards acts in the film as if she's auditioning for a toothpaste commercial.
Standing outside that screening room in Ottawa, I observed the reactions of the patrons exiting -- most had a little goofy grin, glazed eyes, and a slightly dazed expression on their face. There was, however, one guy who burst through the screening room doors shouting to anyone who would listen, "It sucks! It sucks!" Although I would neither be that dramatic nor severe, I could somewhat see his point -- particularly if he had burst out of the theatre after an hour, instead of two.
- Alex Fung email<EMAIL_ADDRESS>web : http://www.ncf.carleton.ca/~aw220/
-- Alex Fung<EMAIL_ADDRESS>| http://www.ncf.carleton.ca/~aw220/ "I'll never forget you. You're too weird." - David Krumholtz, ADDAMS FAMILY VALUES
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


API Documentation
Most API calls can return a variety of response formats and content types. Return type is based on URL, request parameters, or the "Accept" header, depending on what is supported by the specific endpoint.
Login Session
Messages
A message is an XML document that provides data on catalog items or trading parties.
| Endpoint |
Method |
Description |
| /api/1.0/msg |
GET |
Returns an array of message summary records (without full message content) |
| /api/1.0/msg/:id |
GET |
Returns the full message content for the specified ID |
| /api/1.0/msg |
POST |
Returns operation result |
Trading Parties
A party is a GDSN entity that can exchange item data with other parties through its home data pool
| Endpoint |
Method |
Description |
Params |
| /api/1.0/parties |
POST |
Submit an RPDD file with one or more parties. Max content-length limited only by resources -- using streaming approach to keep server memory usage low. |
none |
| /api/1.0/parties |
GET |
Returns an array of parties |
/gln: 13 character numeric GLN
?page: page index, default 0
?per_page: coming soon
|
|
/api/1.0/party/:gln
/api/1.0/parties/:gln
|
GET |
Returns single party record (not a collection) |
/gln: 13 character numeric GLN
|
Catalog Items
Publications
Subscriptions
Confirmation
Stats
Introduction to ITN Catalog Services and GDSN
GDSN allows Trading Parties to exchange Catalog Item information based on a pub/sub distribution model. It is a set of standards and services provided by the GS1 organization () and private Data Pools.
GDSN includes the following components:
- a set of standards, including XML Schema (XSD) definitions that describe items and workflow
- a Global Registry (GR) that registers items and tracks subscription and party information
- a collection of Data Pools (DPs), service providers that interoperate on behalf of parties
- many trading parties such as manufacturers, distributors, and retailers.
Within the GDSN, each catalog item is identified by the unique combination of GTIN, provider GLN, and TM (target market country and subdivision). These values are available within the item data, making items self-contained. In practice, it is also necessary to track the item recipient GLN (which is not part of the item data). Usually the recipient is the GLN of the subscriber receiving published data. For the original catalog item (as registered by the provider), the recipient will always be the GLN of the provider's home data pool.
The recipient GLN is needed because items may be customized during the publication/notification process (e.g. augmenting or stripping data according to publication and subscription options). This is somewhat uncommon, but it does happen and we need to account for it. The more typical approach is for subscribers to accept the unmodified item data (as registered by the provider) and then transform or process the data as needed.
If the subscriber does not like something about the data, there is a review and approval process included as part of GDSN that can be used to communicate back to the publisher. The publisher can decide to update an item and do so as often as they please. Each item update will trigger outbound messages to all current subscribers.
The compound natural key (gtin-provider-tm-recipient) for items allows for complex use cases, such as:
- Multiple TM: providers can create items specific to different countries or states. Each item may have completely different data as needed, so it is more than just 'versioning'.
- Multiple provider GLNs for the same GTIN: a distributor may 'republish' an item using their own GLN, allowing customization of the item as needed. Or the same GTIN could just randomly happen to get used by various providers.
- Multiple recipients: each recipient may have slightly different requirements regarding item definition. For example, some recipients don’t want nutritional data or other 'extended' data.
GDSN External Code Lists
ISO target market:
- Numeric country codes: http://en.wikipedia.org/wiki/ISO_3166-1_numeric
- Alpha subdivision codes: http://en.wikipedia.org/wiki/ISO_3166-2
- United States subdivision codes for states: http://en.wikipedia.org/wiki/ISO_3166-2:US
GDSN Catalog Item Integration Using CIN Format
GDSN XML: Catalog Item Notification
It is suggested that we use the GS1 standard Catalog Item Notification (CIN) message format for our GDSN catalog item integration efforts. This format can accommodate a large variety of industry standard and custom data attributes useful for describing hierarchies of complex catalog items.
Identifying Catalog Items in GDSN
Every registered GDSN catalog item will have the following 5 unique identifying data points:
- GTIN
- Provider GLN (publisher)
- Data Recipient GLN (subscriber or home data pool)
- Target Market Country (ISO numeric country code)
- Target Market Subdivision (e.g. nullable or a state string like ‘US-CA’)
All of these values must be specified when identifying a specific item within the GDSN network, except for 5. which is optional and rarely used
Required CIN Message Structure
Appendix 1 shows a minimal CIN message containing a hierarchy of two trade items. Each item is valid but very simple so that we can focus on the message structure and required attributes. We will review more complicated items attributes later (e.g. nutritional data).
For purposes of illustration, the sample contains the following tokens which would be replaced as follows in actual usage:
1. Message_ID: this should be a unique string of 50 characters or less. It is used as a prefix for various identifiers scattered throughout the message.
a. Only used for routing, logging, and diagnostics.
b. A convention used by ITN is to embed the top-level item GTIN for easy lookup.
c. Consistent use of a short prefix allows convenient message grouping. For example, OMS uses the prefix "API_CIN_".
2. Creation_Date_Time: data and time of message creation
a. ISO formatted date-time string (e.g. "2014-01-21T16:20:00.000-08:00")
b. Can be used to version trade item data contained in message
3. Sender_ID: the GLN of either the source trading party or data pool.
a. If the message will be sent over AS2, then this GLN must be suitably configured.
b. If a party GLN is used, then it must be registered with the ITN data pool.
c. ITN has a party GLN that can be used as a default if AS2 is not required:<PHONE_NUMBER>292.
4. Receiver_GLN: The GLN of the ITN data pool.
a. Required for proper routing. Can be defaulted to<PHONE_NUMBER>285.
5. Data_Recipient_GLN: the GLN of the recipient trading party or data pool.
a. If set to the ITN data pool, the item will be registered with the Global Registry (GR) and become eligible for GDSN publication.
b. If set to the GLN of the data provider (see 5. above), then the data will be routed to OMS the same as inbound GDSN data.
Trade Item Identification and Details
In addition to the CIN message-level data points discussed above, each trade item within the message also contains a number of identifying elements:
1. Data_Provider_GLN: the GLN of the party that owns the catalog item data.
a. Required
b. The ITN trading party proxy GLN may be used if needed
c. Additional party identification (non-GLN) is supported (e.g. DUNS)
2. Brand_Owner_GLN:
a. Optional
b. The ITN trading party proxy GLN may be used if needed
c. Additional party identification (non-GLN) is supported (e.g. DUNS)
3. Manufacturer_GLN:
a. Optional
b. The ITN trading party proxy GLN may be used if needed
c. Additional party identification (non-GLN) is supported (e.g. DUNS)
4. Source_Data_Pool:
a. Optional
b. The GLN of the source data pool
Please see example usage below.
Support for Custom Item Data
There are a couple mechanisms available for including custom data not currently accounted for in the XML schema:
- Attribute Value Pair Extension: this is a standard (GS1) extension that can be used to include arbitrary key-value pairs per item.
- ITN Extension: this is a custom extension compatible with GS1 schema that can be used to include structured data (beyond just key-value pairs) per item.
Routing and Workflow
CIN messages handled by the ITN Data Pool are subject to the following workflow routing, based on the values of certain data points:
| Routing/Workflow |
Sender |
Receiver |
Provider |
Recipient |
| Registration or Update |
ITN Trading Party |
ITN Data Pool |
ITN Trading Party |
ITN Data Pool |
| Non-registration Persistence |
ITN Trading Party |
ITN Data Pool |
ITN Trading Party |
ITN Trading Party |
| Inbound from other DP |
Other DP |
ITN Data Pool |
Non-ITN Trading Party |
ITN Trading Party |
| Subscription Delivery |
ITN Data Pool |
ITN Trading Party |
Any Trading Party |
ITN Trading Party |
Sample XML with schema locations and named replacement tokens (highlighted):
Sample XML for additional party identification elements:


What is the final decision on this reclass? Does this affect an entire cost center or is it just dollars? Is Accounting going to restate the Actuals and change the hierarchies?
Rositza, whatever we need to do, I want to do at a high level in our schedules, then pass back the changes to any coordinator who is affected. All the Operations costs are coming from one person.
If we are going to be required to reclass Plan, 1CE, and 2CE for this, I need the company number and cost center where the Operations costs are coming from and I need the reductions by month. Will this affect the Accounting Hierarchy tie-out (if an entire cost center moves) or is it just dollars?
WE are worried about the numbers we show Stan for the 2002 budget. We don't want to show Shelley with a variance due to movement from these groups. Rod agreed to do this for Shelley. I think we will have to roll through restatement. I don't want to show Stan something different for 2002 budget comparisons than what we are showing him now monthly. I realize that these amounts are small to each group listed, but when added together they are material to Shelley.
Can we just move the dollars in the 3rd CE and show the offsetting variances. They will wash out in the total entity amounts, and they are small dollars. By restating earlier estimates (i.e. Plan, 1CE, 2CE), we create confusion because we have already published these previous estimates.
I would prefer NOT to restate anything we have already finalized.
Please let me know if you have an issue with my recommendation.
Thanks, Elaine
-----Original Message-----
From: Carpenter, Nancy
Sent: Tuesday, August 07, 2001 3:04 PM
To: Jones, Dana; Botello, Mary; Concklin, Elaine
Cc: Barnes, Caroline; Stern, Ellis; Scott, Donna
Subject: Functional Reclass
Tracy Geaccone requested that we restate the 2001 Plan (and therefore the !st & 2nd Current Estimates) to reflect the reclassification of the positions listed below. In the 3rd quarter forecast I will be showing the following additions to Gas Logistics previously reflected in other functional areas:
From To
GISB Manager $84,685 Executive Gas Logistics (Market Services)
NNG Measurement Desk $57,915 FA&A Gas Logistics
Deal Capture $104,247 Commercial Gas Logistics
Outage Specialist $97,513 Operations Gas Logistics
If you have any questions, please call me @ 36311.
Thanks,
Nancy
***********
EDRM Enron Email Data Set has been produced in EML, PST and NSF format by ZL Technologies, Inc. This Data Set is licensed under a Creative Commons Attribution 3.0 United States License <http://creativecommons.org/licenses/by/3.0/us/> . To provide attribution, please cite to "ZL Technologies, Inc. (http://www.zlti.com)."
***********
California


---
title: "Tutorial: 1 - Getting Started"
permalink: /tutorial/1-getting-started.html
---
This tutorial assumes that you have GWT and all its basic prerequisites installed and can create a new GWT application (see Get Started with the GWT SDK at the GWT site). The tutorial will use instructions that reference the Eclipse IDE and the Google Plugin for Eclipse (see Set up Eclipse at the GWT site). If you are not using Eclipse, the exact steps will be different.
Create a New GWT Web Application
First, we need to create a new GWT application. From Eclipse, choose @File -> New -><EMAIL_ADDRESS>From the list, choose @Google -> Web Application Project@ and click "Next."
Give your project a name and a package. The tutorial will assume a project name of "GWTWizardSample" and a package of @net.binarymuse.gwt.sample.gwtwizard@--if you use a different project name or package, remember to substitute it when you see it in sample code or other places in the tutorial. Choose a GWT SDK from the list and click "Finish."
!/images/tutorial/new-project.png(Creating a new GWT application)!
Adding GWT-Wizard to Your Project
Right-click on the GWTWizardSample project in the project or package explorer and choose "Properties." Choose "Java Build Path" and choose the "Libraries" tab. Add gwt-wizard.jar to the build path using one of the "Add JARs" buttons ("Add External JAR..." if the JAR is not located inside your project directory).
!/images/tutorial/build-path.png(Adding gwt-wizard.jar to the build path)!
Next, inherit the GWT-Wizard module by placing the following line of code in your module's @.gwt.xml@ file:
@@
GWT-Wizard is ready for use! At this point, you should be able to run your project as a GWT web application and get the default GWT application in your development mode browser. However, before we continue, let's clean up the default GWT web application code.
Trimming the Default GWT Application Code
The GWT application creator generates several more files and classes than we will need for our application. Let's reduce our code to the bare minimums.
Rewrite the EntryPoint Class
Change *GWTWizardSample.java* to the following:
package net.binarymuse.gwt.sample.gwtwizard.client;
import com.google.gwt.core.client.EntryPoint;
public class GWTWizardSample implements EntryPoint {
@Override
public void onModuleLoad() {
// TODO: Implement
}
}
Remove Unnecessary Files
Remove *GreetingService.java*, *GreetingServiceAsync.java*, *GreetingServiceImpl.java*, and *FieldVerifier.java* (essentially leaving *GWTWizardSample.java* as the only Java source file). You may leave the empty packages or remove them, it is up to you--we won't use them in this tutorial.
!/images/tutorial/gwt-wizard-cleanup.png(Source tree after cleanup)!
Clean up web.xml
In *war/WEB-INF/web.xml*, remove the @servlet@ and @servlet-mapping@ defintions, leaving something like the following:
GWTWizardSample.html
Clean Up GWTWizardSample.html and GWTWizardSample.css
Modify *war/GWTWizardSample.html* to remove the extra HTML from the body of the page (only showing the body here for brevity):
Remove the content from *war/GWTWizardSample.css* so we start with a fresh stylesheet.
At this point, your web application should run without errors (although the page will be blank).


Joel Inoa Reyes' Lab 4
First Name
Last Name
Email
Phone
Text field
Age
18-35
35-50
50-65
Submit form


{% extends 'base.html' %} {% block extracss %} {% endblock %} {% block title %}Scan/Import Directory{% endblock %} {% block toolbar %}
| {% include 'collect/partials/select-company.html' %} | {% include 'collect/partials/select-section.html' %} | {% include 'collect/partials/select-location.html' %} | {% include 'collect/partials/select-subject.html' %} |


Hi, I am Aswin G.
Projects
Realtime Traffic Control System
A system to automate control of signals at busy junctions. The
system calculates green light and red light duration on the basis of
vehicle density patterns for each lane separately using OpenCV and
Python.
Zulip Mobile
Worked with the mobile team of Zulip during Google Summer of Code
2018. Returned as a mentor for 2019.
MEC Books Watch
A textbook exchange platform for college students using React,
Firebase and Go.
OpenSalve
Disaster management and coordination app, inspired by the lack of
such a coordination facility during the Kerala floods of mid-2018.
Android app with Django backend.
SnapDiet
Innovative persistent calorie tracker. React Native app, uses
Firebase for storage.
Posts
Deployment Automation via SSH With Python Fabric: How It Works
Article about using the Python Fabric library for automating
deployment
Creating a Middleware in Golang for JWT based Authentication
Writeup on how to implement JWT based auth in a Golang backend
Webpack and Babel — What are they, and how to use them with
React.
A guide to manually configuring Webpack and Babel for your next React
project.
Getting Avengers Endgame tickets with Python
Why do it manually when a script can do it for you?
Life Reflections
What are we, if couldn’t be infinite in our own minds?
What I experienced at Google Summer of Code
Writeup on the experience I had as a GSoC student, working with the
organisation Zulip.


German shepherd with dwarfism still looks like a puppy at two years old
Ranger the German shepherd is two – but you’d be forgiven for thinking he’s still a puppy.
He has pituitary dwarfism – which means he looks young for much longer than is normal for his breed.
Ranger was diagnosed with a parasite called giardia and his owners initially thought that was why he was smaller than the rest of the litter.
After recovering from the infection, his owners noticed Ranger, who lives in Phoenix, Arizona, wasn’t growing at the same rate a German shepherd should.
They took him to their vet who thought he might have the pituitary dwarfism mutation.
Shelby Mayo, who is Ranger’s guardian, said: ‘When we originally got Ranger from the breeder, he was smaller than all his other littermates, but we figured that was because he had a parasite.
‘In the weeks following we took him home and he was parasite free but later on ended up getting a parasite called giardia.
Advertisement Advertisement
‘At the same time, we also discovered that Ranger had a large infection on his neck.
‘We were eventually able to get the infection under control, fast forward a few months later we were finally able to get rid of giardia.
‘During this time Ranger remained very small, the vet had suspected that he may have pituitary dwarfism, a genetic mutation.
‘But we were still sceptical as this condition is very rare.
‘Over time Ranger still did not get much bigger, and at this point, we are certain he does have this condition.’
Although the condition makes him look cute, it has also caused various health issues including shedding fur and flaky skin caused by hypothyroidism.
But his owners and some of his online followers have helped with treatment. and he now has his health issues under control.
After a few more months we got him neutered and that’s when we started to see big changes.
Shelby adds: ‘He lost his appetite, started to lose weight, lost almost all of his fur, and had extremely dry and flaky skin.
‘Many people on our Instagram page warned us that pituitary dwarfs can have many medical issues, but up until that point we hadn’t experienced any.
‘One of our followers ‘Guardians Farm’ is a small company that makes handmade soaps, lotions, etc and they sent us goat milk soap, which ended up helping Rangers skin immensely.
Advertisement Advertisement
‘At the same time, another one of our followers who also has a Dwarf German Shepard told us to get his thyroid levels checked as many dwarfs suffer from hypothyroidism.
‘So our vet checked his thyroid levels and sure enough, he was low, this can cause hair loss and a loss of appetite.
‘After getting Ranger on Levothyroxine and using this soap his fur grew back and the dryness went away.’
Now Ranger is healthy and loves playing with his sisters Hazel the Labrador and fellow German shepherd, Jessie.
He’s become a star on Instagram with over 65,000 followers.


Pursue and Evade are two very similar algorithms.
The idea behind those methods is quite simple, but with flaws.
In the simulation, a red vehicle is using Pursue or Evade algorithm.
The red agent checks the current velocity and the position of his target, then predicts when they are going to overlap with each other.
In the Pursue method the predicted position is passed to Seek so the red vehicle can catch the target(the blue vehicle).
On the other hand in Evade the predicted position is passed to Flee so the red agent can evade the target.
However, because the methods calculate a future position of the target and only that position is considered in next step,
which is passing the predicted position to another method, algorithms are not robust.
The orange vector sticking out of the center of the vehicle is a visualization of the desired velocity and the violet one shows the current velocity of the agent. The green line with a circle describes a point of collision between the two vehicles.
During simulation it is possible to change direction of the target (the blue vehicle) by clicking with the left click mouse button on the canvas.
The orange vector sticking out of the center of the vehicle is a visualization of the desired velocity and the violet one shows the current velocity of the agent. The green line with a circle describes a point of collision between the two vehicles.
During simulation it is possible to change direction of the target (the blue vehicle) by clicking with the left click mouse button on the canvas.
Red Pursuer position x:
y:
velocity :
Blue Target position x:
y:
velocity :


Sindh set to challenge ordinances promulgated by PTI govt
by Our CorrespondentKARACHI: The Sindh government has conveyed its intent to mount a legal challenge against the ordinances recently promulgated by the Pakistan Tehreek-e-Insaf (PTI)-led federal government.
“The ordinances promulgated by President Dr Arif Alvi are against the spirit of the 18th Amendment. The federal government is interfering in matters that fall under the provinces’ domain,” Murtaza Wahab, the Sindh chief minister’s adviser on law and environment, said on Wednesday.
“The federal government has transgressed its authority and we will challenge its ordinances at the proper constitutional forum.”
President Alvi has recently promulgated eight ordinances, one of which was related to the dissolution of the Pakistan Medical and Dental Council (PMDC).
Wahab said the decision regarding the PMDC had been taken without any consultation with the provinces, adding that such steps were in violation of established legal procedures.
The Pakistan Peoples Party (PPP) would be the second major opposition party to challenge the ordinances as the Pakistan Muslim League – Nawaz (PML-N) has already moved the Islamabad High Court (IHC) over the matter.
The petition filed by PML-N MNA Mohsin Ranjha requests the IHC to declare that the president’s power to promulgate ordinances can be used to bring about such legislation only when the government needs to respond to an emergency situation such as war, famine, epidemic or rebellion which has put the life, liberty or property of the people of Pakistan at stake.
It further pleaded that such powers can be used in case of an emergency after the prorogation of the last session of Parliament, or when waiting for the commencement of the next session of either house of Parliament would cause irreparable loss of life, liberty or property to the people of Pakistan.
Similarly, senior politicians have also challenged the Khyber Pakhtunkhwa (KP) Actions (in Aid of Civil Power) Ordinance 2019 in the Supreme Court, saying the law is unconstitutional and violates fundamental rights.
“By impugned ordinance all persons in an entire province of Pakistan are subject to a parallel and draconian legal system which authorises detention/internment without charge for an undefined duration. The law under challenge also authorises use of force and other coercive action by armed forces within province,” reads the constitutional petition filed in October by seasoned politicians Farhatullah Babar, Afrasiab Khattak, Bushra Gohar and Rubina Saigol.
“Individuals who are held in internment centers established under the impugned ordinance are being denied their liberty pursuant to the impugned ordinance and have no judicial remedy,” it states.


Verifiable Timed Signatures
About
Verifiable Timed Signature (VTS) scheme allows one to time-lock a signature on a known message for a given amount of time T such that after performing a sequential computation for time T anyone can extract the signature from the time-lock. Verifiability ensures that anyone can publicly check if a time-lock contains a valid signature on the message without solving it first, and that the signature can be obtained by solving the same for time T. This work formalizes VTS, presents efficient constructions compatible with BLS, Schnorr, and ECDSA signatures, and experimentally demonstrates that these constructions can be employed in practice. On a technical level, we design an efficient cut-and-choose protocol based on the homomorphic time-lock puzzles to prove the validity of a signature encapsulated in a time-lock puzzle. We also present a new efficient range proof protocol that significantly improves upon existing proposals in terms of the proof size, and is also of independent interest. While VTS is a versatile tool with numerous existing applications, we demonstrate VTS’s applicability to resolve three novel challenging issues in the space of cryptocurrencies. Specifically, we show how VTS is the cryptographic cornerstone to construct:
- Payment channel networks with improved on-chain unlinkability of users involved in a transaction
- Multi-party signing of transactions for cryptocurrencies without any on-chain notion of time
- Cryptocurrency-enabled fair multi-party computation protocol.
OpenSquare: Decentralized Puzzle Solving
Repeated Modular Squaring is a versatile computational operation that has led to practical constructions of timed-cryptographic primitives like time-lock puzzles (TLP) and verifiable delay functions (VDF) that have a fast growing list of applications. While there is a huge interest for timed-cryptographic primitives in the blockchains area, we find two real-world concerns that need immediate attention towards their large-scale practical adoption: Firstly, the requirement to constantly perform computations seems unrealistic for most of the users. Secondly, choosing the parameters for the bound \(\mathbf{T}\) seems complicated due to the lack of heuristics and experience.
We present OpenSquare, a decentralized repeated modular squaring service, that overcomes the above concerns. OpenSquare lets clients outsource their repeated modular squaring computation via smart contracts to any computationally powerful servers that offer computational services for rewards in an unlinkable manner.
OpenSquare naturally gives us publicly computable heuristics about a pre-specified number (\(\mathbf{T}\)) and the corresponding reward amounts of repeated squarings necessary for a time period. Moreover, OpenSquare rewards multiple servers for a single request, in a sybil resistant manner to incentivise maximum server participation and is therefore resistant to censorship and single-points-of failures. We give game-theoretic analysis to support the mechanism design of OpenSquare: (1) incentivises servers to stay available with their services, (2) minimizes the cost of outsourcing for the client, and (3) ensures the client receives the valid computational result with high probability. To demonstrate practicality, we also implement OpenSquare’s smart contract in Solidity and report the gas costs for all of its functions. Our results show that the on-chain computational costs for both the clients and the servers are quite low, and therefore feasible for practical deployments and usage.


Adjacency
GoRogue provides convenient methods to calculate and retrieve neighboring grid locations via the AdjacencyRule
class. This class also provides easy methods to get the Direction
instances that lead to those neighbors.
Instances of the AdjacencyRule
class cannot be created by the user. Instead, three instances are included as static members of the AdjacencyRule
class, which represent all possible ways of defining adjacency on a 2d integer-based grid. Each instance, and how it defines adjacency, is covered below. Functions of these instances may be used to retrieve the Direction
instances that lead to adjacent squares, as well as the coordinates of each square adjacent to a given point.
Methods of Determining Adjacency
The three instances included are AdjacencyRule,CARDINALS
, AdjacencyRule.DIAGONALS
, and AdjacencyRule.EIGHT_WAY
. These instances and how they define adjacency is covered below.
AdjacencyRule.CARDINALS
This rule is effectively standard 4-way connectivity -- a location is "adjacent" to another if it is within 1 cardinal step away. In the image below, the red grid location is the starting cell, and the blue grid locations are those that are considered adjacent by this rule:
AdjacencyRule.DIAGONALS
This rule considers a location "adjacent" to another if it is within one diagonal step away. Again, in the image below, the red grid location represents the starting cell, and the blue grid locations are those that are considered adjacent by this rule:
AdjacencyRule.EIGHT_WAY
This rule is effectively standard 8-way connectivity -- a location is "adjacent" to another if it is within 1 step in any direction. Like in the previous images, in the image below the red grid location represents the starting cell, and the blue grid locations are those that are considered adjacent by this rule:
Getting Directions of Neighbors
AdjacencyRule
provides a few functions to allow you to get the directions that lead to neighbors of a location. The API documentation covers these in detail, however this may serve as a quick overview of their functionality.
The AdjacencyRule.DirectionsOfNeighbors
function is the most straightforward; it returns you an IEnumerable<Direction>
with all the directions that lead to neighbors:
foreach (Direction d in AdjacencyRule.EIGHT_WAY.DirectionOfNeighbors())
System.Console.WriteLine(d);
The AdjacencyRule.DirectionsOfNeighborsClockwise
and AdjacencyRule.DirectionsOfNeighborsCounterclockwise
functions work the same way, except that they return the directions in clockwise and counter-clockwise order, respectively. In addition, both of these functions optionally take a Direction
instance that will be the first direction returned. Directions are returned in clockwise or counter-clockwise order as appropriate, starting from the given direction:
// Returns directions in order Direction.LEFT, Direction.RIGHT, Direction.DOWN, Direction.UP.
// AdjacencyRule.DirectionsOfNeighborsCounterclockwise functions similarly.
foreach (Direction d in AdjacencyRule.CARDINALS.DirectionsOfNeighborsClockwise(Direction.LEFT))
System.Console.WriteLine(d);
Getting Locations of Neighbors
AdjacencyRule
also provides a few functions to allow you to get the coordinates that represent neighbors of a given location. This may prove to be more convenient than using the functions which return Directions
and adding those Direction
instances to a position. Again, the API documentation covers these in detail, however this may serve as a quick overview of their functionality.
These functions work very similarly to their Direction
-based equivalents. AdjacencyRule.Neighbors
returns an IEnumerable<Coord>
for each neighboring position:
Coord position = (1, 2);
foreach (Coord neighbor in AdjacencyRule.EIGHT_WAY.Neighbors(position))
System.Console.WriteLine(neighbor);
The AdjacencyRule.NeighborsClockwise
and AdjacencyRule.NeighborsCounterclockwise
functions work the same way, except that they return the coordinates in clockwise and counter-clockwise order, respectively. In addition, both of these functions optionally take a Direction
instance, which indicates which position to return first. Positions are returned in clockwise or counter-clockwise order as appropriate, starting from the position that is located in the given direction:
Coord position = (1, 2);
// Returns directions in clockwise order, starting with the position located in the direction Direction.LEFT.
// AdjacencyRule.NeighborsCounterclockwise functions similarly.
foreach (Direction d in AdjacencyRule.CARDINALS.NeighborsClockwise(position, Direction.LEFT))
System.Console.WriteLine(d);
Implicit Conversion for Related Types
For any given Distance
or Radius
class instance, a method of determining adjacency is implied due to the mathematical concepts those classes represent. Therefore, both Distance
and Radius
instances may be implicitly converted to their corresponding AdjacencyRule
instance. As a result of this, any function that accepts a parameter of type AdjacencyRule
may also simply be passed a Distance
or Radius
instance, and that instance will be converted to the corresponding AdjacencyRule
automatically.
The correspondance between Distance
instances and AdjacencyRule
instances is as follows:
Distance.MANHATTAN
->AdjacencyRule.CARDINALS
Distance.CHEBYSHEV
->AdjacencyRule.EIGHT_WAY
Distance.EUCLIDEAN
->AdjacencyRule.EIGHT_WAY
The correspondance between Radius
instances and AdjacencyRule
instances is similar:
Radius.CIRCLE
orRadius.SPHERE
->AdjacencyRule.EIGHT_WAY
Radius.SQUARE
orRadius.CUBE
->AdjacencyRule.EIGHT_WAY
Radius.DIAMOND
orRadius.OCTAHEDRON
->AdjacencyRule.CARDINALS
A demonstration of some of these conversions can be seen via the following code:
// Both of these function without compiler error, since implicit conversions are defined.
AdjacencyRule rule = Distance.MANHATTAN;
rule = Radius.SQUARE;
// Assuming a function MyFunc(AdjacencyRule rule) is defined
MyFunc(Distance.CHEBYSHEV);


| Name | Mollie Taylor |
| Date | January 2014 |
| Submitted to | Clough Art Crawl 2014 |
| Site-specific to | Georgia Tech Clough Undergraduate Learning Commons |
| Title | Proximity to Nature |
| Description | Most Atlanta nature guides require one to go far outside the City of Atlanta, but I have found that there are many opportunities far closer. The map depicts a circle centered on Clough with a radius of three miles. The locations photographed are within this radius. |


{# Copyright 2022 Google LLC Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License. #} {%- extends BASE_HTML -%} {% set main_id = 'dc-topic-landing' %} {% set page_id = 'page-dc-topic-landing' %} {% set title = 'Topic Explorer' %} {% set subpage_title = 'Topic Explorer' %} {% set subpage_url = url_for('topic_page.topic_page') %} {% block head %} {% endblock %} {% block content %}


An object with media queries and device states
currentState holds the index of the currently active DeviceState.
currentStateName holds the name of the currently active state.
This enum is used by the to determine which of the media queries in the mediaQueries object above are considered 'device states'. Names of this enum have to correspond with one of the keys in the mediaQueries object. When using the DeviceStateTracker, make sure you have enough device states so that there will always be one with a matching media query.
At any time only one "device state" will be active. This will be the last name below that has a matching breakpoint. This is usually convenient for mobile-first designs. If you want to reverse this order (for desktop-first designs, for example). Pass the reverseDeviceStateOrder boolean as true.
Array containing the name of each device state.
This object holds a list of available mediaQueries.
The parent EventDispatcher instance. If this instance has no parent, this value will be set to null. The parent is used in the bubbling and capturing phases of events.
Array of MediaQueryList instances for each device state.
Array containing a boolean for each device state that indicates if the media query currently matches. When multiple media queries match, it will set the state to the one with the largest index. In reverse device state order it will set the state to the one with the smallest index.
Local private variable to store the device state order.
Reference to a state-indicator element.
Get current deviceState
Adds a new event listener. The given handler function will be called in the following cases:
The eventType to listen for
The handler function that will be called when a matching event is dispatched. This function will retrieve the dispatched [[IEvent|event]] as a parameter
Indicates if this handler should be called during the capturing phase of an event chain. If and only if this is set to false will this handler be called during the bubbling phase of an event chain.
A number that indicates the priority of this event listener relative to other event listeners of the same type on this EventDispatcher instance. A higher number indicates that this listener will be called earlier.
An object describing the listener that has a [[EventListenerData.dispose|dispose()]] method to remove the listener.
Destruct this DeviceStateTracker instance and remove any event listeners.
Dispatches the given event. The dispatch consists of three phases:
If any of the event handlers call [[IEvent.stopPropagation|stopPropagation()]], we will skip all event handlers that occur on a target later in the event chain. If an event handler calls [[IEvent.stopImmediatePropagation|stopImmediatePropagation()]], we will also skip any event handlers on the same target in the event chain.
The event to dispatch
If one of the handlers that have been called during this dispatch called [[IEvent.preventDefault|event.preventDefault()]], this method will return false. If no handlers have been called or none of the handlers have called [[IEvent.preventDefault|event.preventDefault()]], this method will return true.
Please note: [[IEvent.preventDefault|preventDefault()]] can only be called on events that have their [[IEvent.cancelable|cancelable]] property set to true
Cleans up this EventListener instance. No event handlers on this EventDispatcher will be called and future calls to dispatchEvent() will be ignored.
Checks if the enum object is correctly formatted. The DeviceState enum should only contain numeric values in an ascending order.
Called whenever a MediaQueryList updates. Checks if the query matches and stores the result in the queryListMatches array. Then calls updateFromMatchMedia() to find the current state from all matching queries.
The MediaQueryList that changed
Checks if an event listener matching the given parameters exists on this EventDispatcher instance.
Will only look for event listeners with this eventType
If set, will only match event listeners that have the same handler function
If set, will only match event listeners that have the same useCapture argument. Please note: if no useCapture argument was provided to addEventListener, it is set to false by default
True if one or more event listeners exist
Loops through each deviceState and adds a matchMedia listener for each. Calls updateFromMatchMedia to initialize the current state.
Initializes tracking of the current media query using a state indicator element. This element will hold the state name as content inside.
Initializes tracking of media queries using matchMedia.
After dispose has been called, this method returns true. Use this method to determine whether dispose() should be run again.
Removes all event listeners that have a [[IEvent.type|type]] of the given eventType from this EventDispatcher instance, regardless of their [[EventListenerData.handler|handler]] or [[EventListenerData.useCapture|useCapture]] property.
Please note: if you remove an event listener during the dispatch of an event it will not be called anymore, even if it was supposed to be called in the same event chain
The [[IEvent.type|type]] of event to remove. If not provided, all event listeners will be removed regardless of their type.
Removes all event listeners that match the given parameters from this EventDispatcher instance.
Please note: if you remove an event listener during the dispatch of an event it will not be called anymore, even if it was supposed to be called in the same event chain
Only event listeners of that have this eventType are removed
Only event listeners that have this handler function will be removed
Only event listeners that have been added with the same useCapture parameter will be removed. Please note: if no useCapture argument is provided, only event listeners that have useCapture set to false will be removed.
Takes the results from the matchMedia event listeners saved in the queryListMatches property. Sets the last one in the array as the active query. When the reverseDeviceStateOrder boolean is set to true, will set the first one in this array. Dispatches a DeviceStateEvent with the current DeviceState
Checks if an event listener with a [[EventListenerData.type|type]] of the given eventType exists on this EventDispatcher or any ancestor EventDispatcher instance.
The event type to check for
true if a matching listener is found
Generated using TypeDoc
Utility class that tracks which media query is currently active using the matchMedia API.


We have three classes left, 6/3, 6/5, 6/10.
Main Topics discussed this week include:
Key Demos:
Note that NodeJs is now up to v0.10.9.
You can find it here:
JsObjects/Data/CouchUtils/CouchAttach01
Pass in the document name you want to use in couchDb and the name of the document you want send to couchDb. For example:
node CouchAttach.js index index.html
Redis is a NoSql database that stores sets, lists and numbers. It includes a nice tutorial and documentation.
On Windows, we can download the unofficial Windows build of Redis like this:
After the download, look in the bin directory and unzip the 64 bit binaries.
On Linux, first make sure you have gcc and make installed:
gcc -v
make -v
The above should produce lengthy, but reasonable output. If you see errors, then you need to install these tools:
sudo apt-get install build-essential
You can then use the following script to install redis:
wget http://download.redis.io/redis-stable.tar.gz
tar xvzf redis-stable.tar.gz
cd redis-stable
make
I have placed this script in JsObjects/Utilities/InstallScripts.
After installing redis, you probably have a copy of the redis tar file and a directory containing the stable version of redis right in the middle of your JsObjects repository. If that is the case, move the stable directory to some other location:
mv redis-stable ~/.
Then cd into redis-stable and run the test:
cd ~/redis-stable
./runtest
If necessary, also install tcl:
sudo apt-get install tcl
To run the server, type:
src/redis-server
If you are working on AWS, you might want to open two Putty windows, one for running redis, and another for running your application.
There is also a redis client:
src/redis-cli
Sessions have the following traits:
When we create session, a cookie is built in, it is part of the session. Each cookie is maintained by the browser and has an id. Each request from the browser contains the cookie and its ID. The server can use this ID to associate data that it (the server) maintains with the cookie, that is with the session associated with a particular browser.
The best way to learn more about sessions is to run and study the following two demos:
When you sign in as a user, you can use the session object to track each individual user. You can use a database like redis or dbcouch to store user's progress.
See NodeCode/Session03 or NodeCode/Session04 to see working examples of the code discussed in this section.
Be sure to include the session code from Express:
app.use(express.cookieParser('your secret here'));
app.use(express.session());
The addUser method responds to a click on a button. It retrieves the userName that the user typed in to our client side HTML.
app.post('/addUser', function(req, res) {
console.log('/addUser called.')
console.log(req.body);
req.session.userName = req.body.userName;
res.send({'Result': JSON.stringify(req.session)});
});
When you call up a particular page, the program first tracks the page you selected in the session object, and then uses handlebars to display an HTML file designed to mirror back information about your session. The handlebars code is encapsulated in an object called SessionHelper:
sessionHelp = require('./Library/SessionHelper')
We pass in the request object to the SessionHelper, and it uses that object to retrieve the data that we need to help us track an individual session, or an individual user:
var mainFile = readHtml('./Templates/SessionInfo.html');
var template = handlebars.compile(mainFile);
var result = template({
pageName: '2',
userName: request.session.userName,
previousPage: request.session.lastPage,
cookieId : request.id,
sessionId: request.sessionID
});
A cookie is small file stored on the client side by the browser containing information sent from the server. The usual purpose of a cookie is to enable a site to store information about a user. This information can:
Cookies contain a maximum of:
All cookies must have:
They can also have:
Command line arguments are kept in an array called argv:
process.argv
Suppose you run the following:
node server.js bar
Bar will be process.argv[2]
Linux terminals can sometimes emit an annoying beep which can lead to familial discord. To fix it, edit or a create a file .inputrc in your home directory. Add the following line to the file:
set bell-style visible
Now your terminal will blink, rather than beep. One imagines that there must be a set bell-style none command as well, but I have not tried it.


I had time to play with Docker so I was able to create an example how to dockerize java application with minimal effort.
Let’s dockerize JAX-RS resource served on Grizzly container. This app is simple
as it can be and it is essentially Jersey Hello World Example with some
small changes.
My only contribution is Dockerfile
template
and a couple gradle tasks
which make all distribution files you need to create a docker image.
configuration
There are only few configuration options centralized into build.gradle
and dockerize
gradle task which replaces tokens like BASE_IMAGE
in build directory.
ext {
// lib version
jerseyVersion = "2.14"
// dockerfile template attributes
baseImage = "dockerfile/ubuntu"
port = "4004"
}
task dockerize(type: Copy, dependsOn: tasks.fatJar) {
from 'src/main/dist/Dockerfile'
into "${buildDir}/dockerize"
filter(ReplaceTokens, tokens: [APP_NAME : project.name,
APP_VERSION: project.version,
BASE_IMAGE : baseImage,
PORT : port])
}
This is an example of Dockerfile
template which tokens are replaced by
gradle task above.
#
# @APP_NAME@ dockerfile.
#
# Pull base image.
FROM @BASE_IMAGE@
# Install Java.
RUN \
echo oracle-java8-installer shared/accepted-oracle-license-v1-1 select true | debconf-set-selections && \
add-apt-repository -y ppa:webupd8team/java && \
apt-get update && \
apt-get install -y oracle-java8-installer && \
rm -rf /var/lib/apt/lists/* && \
rm -rf /var/cache/oracle-jdk8-installer
# Define commonly used JAVA_HOME variable
ENV JAVA_HOME /usr/lib/jvm/java-8-oracle
COPY ./@APP_NAME@-<EMAIL_ADDRESS>/@APP_NAME@/
# Define working directory.
WORKDIR /work-dir
ENTRYPOINT ["java", "-jar", "/@APP_NAME@/@APP_NAME@-<EMAIL_ADDRESS>EXPOSE @PORT@
build app
Distribution task makes all resources you need and places them into ${buildDir}/distribution
.
- Dockerfile - transformed template located in
src/main/dist
- fat jar - contains all needed classes
gradle distribution
Distribution task depends on dockerize
task and fatjar
task.
build a docker image
Directory ${buildDir}/distribution
contains all you need to create docker image.
Go to the distribution directory and build a docker image with tag jersey\hello
cd build/distribution
docker build -t jersey/hello .
run docker image
Argument -p means publishing exposed port to the host. We configured Grizzly be running on port 4004 and we publish it as 4001 at host.
docker run -p 4001:4004 -d --name hello-4001 jersey/hello
Then check the container is running
docker ps
Output should look like this
CONTAINER ID IMAGE COMMAND CREATED STATUS PORTS NAMES
9656759a854d jersey/hello:latest "java -jar /dockeriz 10 minutes ago Up 8 seconds <IP_ADDRESS>:4001->4004/tcp hello-4001
test
curl localhost:4001/base/helloworld
…and here we go
Hello World!
Repo on GitHub


{%LemurSearchErrorTitle%}
{%LemurSearchErrorMessage%}
©2006 The Lemur Project. Powered by the Lemur Toolkit. Search engine last updated {%LemurSearchCompileDate%}, Version {%LemurSearchVersion%}. Contact [Contact Information Here] for more information.


{% extends "webpage/base.html" %} {% load bib_extras %} {% block content %}
| books in db before update operation: | {{ books_before }} | |
|---|---|---|
| books in db after update operation: | {{ books_after }} | |
| updated |
{% if saved %}
{% for x in saved %}
|


Facial recognition systems are starting to become commonplace in our modern day society. Many major cities have implemented such systems in their CCTV systems and are being ostensibly used to combat crime.
The accuracy of these systems have been questioned. Trials in London resulted in a 96% rate of false positives, where the software incorrectly matches a person with a photo on the database.[1] The city of San Francisco has banned the use of facial recognition technology by departments under its jurisdiction due to privacy concerns and other ethical questions.[2]
Mugshot.py simulates such a facial recognition system using dlib face recognition, which boasts an accuracy of 99.38%.[3] Its facial encoding library was created with publicly accessible mugshot imagery and the charges associated with each image. The user submits an image that contains one or multiple faces. Mugshot.py will then return the closest match, the accuracy percentage and the charges associated with the match. I hope that by creating an open source application, the methods and limitations of facial recognition systems become apparent.
Mugshot imagery is first collected from JailBase, a service that provides pubicly available arrest information from US states where publication of such data is legal. When the collection process is run, images are collected from the 10 most recent entries from each US county. The entry is anonymised and finding the original JailBase entry is rendered impossible to be found, neither by the user nor by the creator.
Each mugshot image is analyzed. When an image is not valid or a face was not found, it is not inserted into the dataset. Likewise if no charges are presented, it is not included as well. If valid, the face's location in the image, unique encoding and associated charges are inserted into the dataset.
When the user submits an image, Mugshot.py will search for faces. It will then return the nearest match for each face found in the submitted image. The user then can see the submitted image with the encoding visualised, the accuracy percentage to the nearest match and its associated charges. The accuracy percentage is calculated using this method with the threshold of 0.5, which indicates a strong match.
It would be incorrect to say the dataset is without issues. It contains data from the US states where arrest information can be legally published. States where this is not allowed include California, the District of Columbia, Vermont and a handful others. As a result a significant proportion of the arrestee data is already excluded. As JailBase does not provide any ethnicity data, it is impossible to do an analysis of its ethnicity markup. However if we do consider the dataset as a representative cross section of the general arrestee population, the US Bureau of Justice Statistics estimate that in 2014, of all the arrests that were made in 2014, 69% of the arrestees were white, 28% were black, 2% were American Indian/Alaskan Natives and 1% were Asian/Pacific Islanders. 73% were men and 27% were women.[4] Thus the accuracy differs depending on the ethnicity or skin color of the individual. A white male will more likely return a match than an Asian female.
The face recognition model has flaws too. The dlib model was trained using public datasets that do not have an equal distribution of all countries. Mugshot.py was created by Haryo Sukmawanto, a multimedia artist based in Ghent, Belgium. The source code is available on Github. It owes particular thanks to Adam Geitgey for his library face_recognition. The facial encoding data was created using resources from JailBase. Data acquired from Jailbase has been anonymised and its contents are not traceable to the origin.


break
statements with unnecessary labels. Such labels do not change the
control flow but make the code difficult to follow.
Example:
label:
for(int i = 0; i < 10; i++) {
if (shouldBreak()) break label;
//doSmth
}
After the quick-fix is applied:
label:
for(int i = 0; i < 10; i++) {
if (shouldBreak()) break;
//doSmth
}


Please use a browser that supports "canvas"
Please use a browser that supports "canvas"
Drop files here


You can use most chrome.tabs
methods and events without declaring
any permissions in the extension's manifest file.
However, if you require access to the
$(ref:tabs.Tab.url url)
,
$(ref:tabs.Tab.title title)
, or
$(ref:tabs.Tab.favIconUrl favIconUrl)
properties of
$(ref:tabs.Tab)
,
you must declare the "tabs"
permission in the manifest,
as shown below:
{ "name": "My extension", ... "permissions": [ "tabs" ], ... }
You can find simple examples of manipulating tabs with the
chrome.tabs
API in the
examples/api/tabs
directory.
For other examples and for help in viewing the source code, see
Samples.


expr - manual page for expr 1.31.1
BusyBox v1.31.1 (2020-04-30 13:38:01 EDT) multi-call binary.
Print the value of EXPRESSION to stdout
- ARG1 | ARG2
- ARG1 if it is neither null nor 0, otherwise ARG2
- ARG1 & ARG2
- ARG1 if neither argument is null or 0, otherwise 0
- ARG1 < ARG2
- 1 if ARG1 is less than ARG2, else 0. Similarly:
- ARG1 <= ARG2 ARG1 = ARG2 ARG1 != ARG2 ARG1 >= ARG2 ARG1 > ARG2
ARG1 + ARG2 Sum of ARG1 and ARG2. Similarly: ARG1 - ARG2 ARG1 * ARG2 ARG1
/ ARG2 ARG1 % ARG2 STRING : REGEXP Anchored pattern match of REGEXP in
STRING match STRING REGEXP Same as STRING : REGEXP substr STRING POS
LENGTH Substring of STRING, POS counted from 1 index STRING CHARS Index in
STRING where any CHARS is found, or 0 length STRING Length of STRING quote
TOKEN Interpret TOKEN as a string, even if
- it is a keyword like 'match' or an
- operator like '/'
- (EXPRESSION)
- Value of EXPRESSION
Beware that many operators need to be escaped or quoted for
shells. Comparisons are arithmetic if both ARGs are numbers, else
lexicographical. Pattern matches return the string matched between \( and \)
or null; if \( and \) are not used, they return the number of characters
matched or 0.


Sandbox!
Favorite super heros
Superman
Batman
Spider man
Thor
Hulk
Thing
Silver Surfer
Aquaman
Useless form!
First Name
Last Name
Address
City
Choose Something!
Bop It!
Spin It!
Flick It!
Pull It!
Twist It!
Shout It!
Shake It!
Save my Data


(Message filed_mail:750)
To: panz
cc: cdaniel, rwarritt, dptodey, zekai, jhodson, gutowski, flory
Subject: The morning traffic report
Date: Wed, 10 Sep 1997 04:50:47 CDT
From: "Douglas R. Fils"
Pircs,
It's 4:45 am and just to let you know the traffic around the ESSL lab is lite.
I have recovered what I can from people directories which comes to about 18 megs I think. Again I don't know what state this 18 megs is in but we will know shortly. The server is now fully up and running great. As I get the tapes off (Dennis yours is done) I will let people know. Look for a directory RESCUE that has your files in it. I would write more and I have alot to say... but I extreamly tired and must go, I will try and be in as soon as I can in the morning, but I need some sleep really bad.
c'ya
doug
International Institute of Theoretical and Applied Physics (IITAP) Douglas Fils<EMAIL_ADDRESS>IITAP URL: http://www.iitap.iastate.edu/ Ego vos hortor tantum possum ut amicitiam omnibus rebus anteponatis. Cicero, On Friendship V.17


Contact Developers
The below contact details have been provided if one would like to help to make the app better.
#
Name
Role
Email
Hotline
{%for name,role,email,hotline in people%}
{{forloop.counter}}
{{name}}
{{role}}
{{email}}
{{hotline}}
{%endfor%}


## Where it started
![meowshoes](http://f.cl.ly/items/221Z3I0K382h2z183K0S/meowshoes.jpg)
[[demo video]](http://www.youtube.com/watch?v=1g3M6PILqqQ&noredirect=1)
## Web Audio API
> a high-level JavaScript API for processing and synthesizing audio in web applications
[[spec]](https://dvcs.w3.org/hg/audio/raw-file/tip/webaudio/specification.html)
## Current Support
* Firefox / Firefox Android > v25.0
* Chrome > v10.0
* Chrome Android > v30.0
* Opera > v18.0
* Safari > v7.0
* iOS Safari > v7.0
## Internet Explorer support?
![trollface](img/trollface.jpeg)
## How do I do it?
Start with a new Audio Context
``` javascript
var context = new AudioContext();
```
### and then...
request your audio file
``` javascript
var request = new XMLHttpRequest();
request.open('GET', 'meow.mp3', true);
request.responseType = 'arraybuffer';
```
(supports WAV, MP3, AAC, OGG formats)
### and then...
decode it
``` javascript
var meowBuffer;
request.onload = function() {
context.decodeAudioData(request.response,
function(buffer) {
meowBuffer = buffer;
}, onError);
}
request.send();
```
### and then...
play your sound
``` javascript
var source = context.createBufferSource();
source.buffer = meowBuffer;
source.connect(context.destination);
source.start(0);
```
## For more examples
[[HTML5 Rocks tutorial]](http://www.html5rocks.com/en/tutorials/webaudio/intro/)
## Wow, that's really convoluted
and I have a lot of sounds I wanna load and play all over the shop
## Never fear
libraries are here
![libcat](http://f.cl.ly/items/40182w1F2A3v2V0d302K/Image%202013.11.12%205%3A06%3A41%20PM.jpeg)
## Simple stuff
1. [[Abbey Load]](http://stuartmemo.com/abbey-load/)
2. [[Bopper]](https://npmjs.org/package/bopper)
## Abbey Load
a simple asset loader
``` javascript
var assets = new AbbeyLoad( [{
'hello': 'hello.ogg',
'wat': 'wat.mp3'
}], function (buffers) {
// do something with ready to play buffers!
});
```
## Bopper
a simple sound sequencer
``` javascript
var playback = [
{position: 0, length: 0.1},
{position: 1, length: 0.1},
{position: 2, length: 0.1},
{position: 3, length: 0.1},
{position: 3.5, length: 0.1},
{position: 4, length: 0.1},
{position: 5, length: 0.1},
{position: 6, length: 0.1},
{position: 7, length: 0.1},
{position: 7+1/3, length: 0.1},
{position: 7+2/3, length: 0.1}
]
bopper.on('data', function(schedule){
playback.forEach(function(note){
if (note.position >= schedule.from && note.position < schedule.to){
var delta = note.position - schedule.from
var time = schedule.time + delta
var duration = note.length * schedule.beatDuration
play(time, duration)
}
});
});
bopper.setTempo(120);
bopper.start();
```
## Midweight stuff
* [[Audia]](https://github.com/richtaur/audia)
## Audia
Audia reimplements and extends the HTML5 Audio object using the Web Audio API.
``` javascript
var sound = new Audia();
sound.src = "onslaught.mp3";
sound.play();
```
## Audia
!["beautiful"](http://f.cl.ly/items/0H2j0C0B3Q3B222c351B/Image%202013.11.12%204%3A14%3A27%20PM.jpeg)
## Let's get crazy
1.


December 3
Talk Like God!
Whosoever shall say unto this mountain, Be thou removed, and be thou cast into the sea; and shall not doubt in his heart, but shall believe that those things which he saith shall come to pass; he shall have whatsoever he saith.
Mark 11:23
Jesus didn't say, "Whosoever shall speak to God about this mountain." He said we should speak directly to the mountain the desired end result.
From a worldly point of view, that sounds foolish. But 1 Corinthians 1:27 explains that God has chosen the foolish things of the world to confound the wise. It's always going to sound foolish to the world when a Christian talks as if what God has promised is reality, especially when those promises seem to contradict the natural evidence around us. But if you want to keep the enemy defeated, that's the kind of talking you'd better be doing.
The Bible says God Himself talks that way! In Romans 4:17, it says, "[He] calleth those things which be not as though they were." God doesn't wait for circumstances to line up before He speaks. He causes them to line up because He speaks. You can do the same thing if you'll make your wordsagreewith His and speak them out of your mouth by faith.
"But what if nothing happens right away?" you may ask. "What if the circumstances don't immediately change?" When Jesus spoke to the fig tree in Mark 11:14, He didn't go back and check to see if anything had happened to it. No, once He had spoken it, He considered it done.
Follow His example. Let your faith speak. Agree with God's Word!
Scripture Reading: Mark 11:12-23


Racial Discriminaton
Racial discrimination is an unjust or biased treatment against individuals on the basis of their skin color, racial or ethnic origin. In many cases the law forbids discrimination when it comes to harassment or any aspect of employment, including hiring, firing, pay, job layoff and etc. All over the world people deal with discrimination on a daily, but the question is...what are we doing to fix this dilemma?
The solution is to remain understanding, to have a strong base approach to getting to know and experience each other, as well as diverse thinking.
Cultural Appropriation
Cultural Appropriation is when somebody adopts aspects of a culture that’s not their own. But that's just the simple definition, a deeper understanding of cultural appropriation also refers to a particular power dynamic in which members of a dominant culture take elements from a culture of people who have been systematically oppressed by the dominant group. It’s okay to appreciate the culture but not be a culture vulture. For example before 2016 tons of black women and girls were shamed for having big lips but when Kylie Jenner made the lip challenge having big lips was a huge need and suddenly big lips were in. Another example is when people dress up as “Indians” or wear “ Washington Redskins” merch because its very disrespectful to Indiginous people. I could honestly go on and on but the point of talking about culture appropriation is to stop the negativity and start healing from the past and make the future better for the youth.
Religious Discrimination
Discrimination against religion is a problem because we are only accepting people for their religion and we are not accepting them for who they are as a person. We as a people just give them labels like we don’t give them a chance to tell us who they are as a person. We are so quick to judge people with religion and not easy to understand their religion or who they are as a person. A solution for us we could be more understanding and respectful to people's beliefs and others. We don't have to discriminate against people because they believe in a god or gods because at the end of the day we are all the same; we are all human and we need to learn how to love each other for who they are as a human.
“Religious discrimination is not like racial discrimination. One you chose for yourself, the other God chose for you.”
― Habeeb Akande.


Dandelion the Bard
Dandelion
is a character from the Witcher novels, games, and TV series. This image in particular is a depection from the Witcher 3 video game. In the oriignal novels his name is Jaskier.
- Dandelion is a fantastic musican, wooing audiences with such classics as "toss a coin to your witcher!"
- His color scheme has a lot of purple in it, favorite colors of many UW Huskies.
- He always knows how to talk, or sing his way out of a bad situation.


[Top] [Prev] [Next] [Bottom]
- 1 Introduction
- 1.1 Document
Overview
- 1.2 Interface Overview
- 1.2.1 NamingManager and
DirectoryManager
- 1.2.2 Initial
Contexts
- 1.2.3 Object
Factories
- 1.2.4 State Factories
- 1.2.5 Federation Support
- 2 Building a Context
Implementation
- 2.1 Ownership of
Parameters
- 2.2 Reentrancy
- 2.3 Basic
Support-Implementing the Context Interface(s)
- 2.4 Object Support
- 2.4.1 Reading an Object
- 2.4.2 Storing an Object
- 2.5 Federation Support
- 2.5.1 Names
- 2.5.2 Resolving Through a
Context
- 2.5.3 Resolving Through to
Subinterfaces of Context
- 2.5.4 Naming System
Boundaries
- 2.5.5 Continuing an Operation
in a Federation
- 2.5.6 "Dynamic" Location of
Next Naming System
- 2.5.7 More about
CannotProceedException
- 2.5.8 Contextual Information
- 2.6 Referral Support
- 2.7 Schema Support
- 2.8 Event Support
- 2.9 Context Environment
Support
- 2.9.1 Property Naming
Convention
- 2.9.2 Initializing a
Context's Environment
- 2.9.3 Inheritance
- 2.9.4 Updates to the
Environment
- 2.9.5 Provider Resource Files
- 2.10 Connection Management
- 3 The Initial Context
- 3.1 The Initial Context
Factory
- 3.1.1 Exceptions
- 3.2 URL Support
- 3.2.1 URL Context
- 3.2.2 URL Context Factory
- 3.2.3 Service Provider's Responsibility
- 3.3 Overriding the Default
Behavior
- 3.3.1 Removing URL
Support
- 3.3.2 Removing All Policy
- 3.4 Implementing a Subclass
of InitialContext
- 3.4.1 URL Support
- 3.4.2 New Method Support
- 3.4.3 Constructors
- 4 Customizing A Context
Implementation
- 4.1 Reading Objects: Object
Factories
- 4.1.1 Handling Structured
References
- 4.1.2 Handling URL
References
- 4.1.3 Handling Arbitrary
References: The java.naming.factory.object Property
- 4.1.4 Overriding the Default
Behavior
- 4.1.5 Context Factory
- 4.1.6 URL Context Factory
- 4.2 Storing Objects: State
Factories
- 4.2.1 Input/Output
Options
- 4.2.2 Locating State Factories: The java.naming.factory.state
Property
- 4.3 Narrowing LDAP v3
Controls: Response Control Factories
- 4.3.1 Locating Response Control Factories: The
java.naming.factory.control Property
- 4.4 Ownership of
Parameters
- 4.5 Reentrancy
- Appendix A: Service
Provider Example
- Appendix B: Legend for Class
Diagram
- Appendix C: JNDI Change History
[Top] [Prev] [Next] [Bottom]