When you work with us, you are part of a team of committed collaborators. All aspects of our software development process are intergrated, interactive and agile.
Our approach unifies design, develoment and product management to create exceptional products.
We start each project by understanding your business goals, the users needs and the project requirements.
Then we help translate them into effective and elegant solutions.
Before we sign a contract or write a single line of code our team will spend the necessary time needed to understand your product vision.
The outcome of this scoping session is proposal or high-level statement of work.
Based on your requirements we can provide a complete offering or just the pieces you need.
DESIGN
Our design practice offers a full range of services including brand strategy, interaction and visual design and user experience testing.
Throughout your project, our designers create and implement visual design and workflows, solicit user feedback and work with you to make sure what gets built is what is needed.
DEVELOPMENT
All engineers are fluent in the latest enterprise, mobile and web development technologies.
They collaborate with your team to write, and improve code on a daily basis, using proven practices such as test-driven development and pair programming.
PRODUCT MANAGEMENT
Planning and development is interactive. Because we are constantly coding and testing. The product we build are always ready to go live
The interactive proces allows for changes as business requirements evolve


CSS3 has new user interface features such as resizing elements, outlines, and box sizing.
In this chapter you will learn about the following user interface properties:
resize
outline-offset
The numbers in the table specify the first browser version that fully supports the property.
Numbers followed by -webkit- or -moz- specify the first version that worked with a prefix.
| Property | |||||
|---|---|---|---|---|---|
| resize | 4.0 | Not supported |
5.0 4.0 -moz- |
4.0 | 15.0 |
| outline-offset | 4.0 | Not supported |
5.0 4.0 -moz- |
4.0 | 9.5 |
The resize
property specifies whether or not an element should be resizable by the user.
The following example lets the user resize only the width of a <div> element:
div {
resize: horizontal;
overflow: auto;
}
The following example lets the user resize only the height of a <div> element:
div {
resize: vertical;
overflow: auto;
}
The following example lets the user resize both the height and the width of a <div> element:
div {
resize: both;
overflow: auto;
}
The outline-offset
property adds space between an outline and the edge or border of an element.
Outlines differ from borders in two ways:
The following example uses the outline-offset property to add a 15px space between the border and the outline:
div {
border: 1px solid black;
outline: 1px solid red;
outline-offset: 15px;
}


No light pollution in the islands
The fish was caught that day, and the fruit was fresh and grew locally
Too hot? just lay down in the shade for a nap
A quick car ride to enjoy the rich culture
Thailand is a place rich in culture and activities for every type of traveler. There is a variety of landscapes ranging from beaches, mountains, rivers and dense urban city. The cuisine is one of the most popular in the world and the perfect place for a foodie. You can walk off all the food when you take a trek to visit one of the numerous temples or ruins. If all that isn't enough, you can find an awesome nightlife in the city!
 Start walking to get a great view


Busiest Airports
Powered by
WebGL Globe
Released under the
Apache License
Data from
Aviation Fanatic
processed by
Dario Scalabrin


{% if ticket.Status == 'resolved' or ticket.Status == 'closed' %}
Reopen this ticket
{% else %}
Reply to this ticket
{% endif %}
{% if ticket.Status != 'resolved' and ticket.Status != 'closed' %}
Close this ticket
{% endif %}
Return to ticket listing


There is probably no product in Steve’s career that was hurt more by his perfectionism than the NeXT Cube. No detail seemed too trivial to be overlooked; everything NeXT did had to be perfect.
First with software. When Steve started asking around to know what was the state of the art in computer operating system, he was told the most stable, modern software was called UNIX. It was a very complex but very powerful OS used in universities and by large companies in their mainframes.


| | |
- mpyc.sectypes.SecureObject(builtins.object)
-
- SecureFiniteGroup
-
- SecureClassGroupForm
- SecureEllipticCurvePoint
- SecureQuadraticResidue
- SecureSchnorrGroupElement
- SecureSymmetricGroupElement
class SecureClassGroupForm(SecureFiniteGroup) |
| |
SecureClassGroupForm(value=None)
Common base class for secure (secret-shared) class group forms. |
| |
- Method resolution order:
- SecureClassGroupForm
- SecureFiniteGroup
- mpyc.sectypes.SecureObject
- builtins.object
Methods defined here:
- __getitem__(self, key)
- __init__(self, value=None)
- Ensure all coefficients are of secure type.
Enforce value is a tuple.
- set_share(self, value)
- Set share to the given value.
The share is set directly (or recursively, for a composite SecureObject),
using callbacks if value contains Futures that are not yet done.
Class methods defined here:
- decode(M, Z) from builtins.type
- equality(f1, f2, /) from builtins.type
- Return a == b.
- inversion(f, /) from builtins.type
- Return @-inverse of a (written ~a).
- operation(f1, f2, /) from builtins.type
- Return a @ b.
- operation2(f, /) from builtins.type
- Return a @ a.
Data and other attributes defined here:
- __annotations__ = {}
Methods inherited from SecureFiniteGroup:
- __add__(self, other)
- __eq__(self, other)
- Return self==value.
- __invert__(self)
- __matmul__(self, other)
- __mul__(self, other)
- __ne__(self, other)
- Return self!=value.
- __neg__(self)
- __pow__(self, other)
- __radd__(self, other)
- __rmatmul__(self, other)
- __rmul__(self, other)
- __rsub__(self, other)
- __rtruediv__(self, other)
- __sub__(self, other)
- __truediv__(self, other)
- __xor__(self, other)
- inverse(self)
- For ease of use.
Class methods inherited from SecureFiniteGroup:
- if_else(c, a, b) from builtins.type
- Secure selection based on binary condition c between group elements a and b.
Condition c must be of a secure number type compatible with the group,
and its value should be 0 or 1. Input a must be compatible with the group as
well, either of the secure type cls or of type cls.group. Same for input b.
- repeat(a, x) from builtins.type
- Return xth @-power of a (written a^x), for any integral number x.
Base a is either a public or a secure group element.
Exponent x is either a public or a secure integral number.
Possibly a, x are lists (of same length)
- repeat_public(a, x) from builtins.type
Data and other attributes inherited from SecureFiniteGroup:
- __hash__ = None
- identity = None
Methods inherited from mpyc.sectypes.SecureObject:
- __array_function__(self, func, types, args, kwargs)
- Redirect __array_function__ call to array class, if any.
To support calls like np.block([[secint(9), -1], [1, secint(7)]]).
- __array_ufunc__(self, ufunc, method, *inputs, **kwargs)
- Delegate __array_ufunc__ call to corresponding operator call.
Provisional support for calls like np.less(secint(9), 10).
- __bool__(self)
- Use of secret-shared objects in Boolean expressions makes no sense.
- __deepcopy__(self, memo)
- Let SecureObjects behave as immutable objects.
Introduced for github.com/meilof/oblif.
Data descriptors inherited from mpyc.sectypes.SecureObject:
- share
Data and other attributes inherited from mpyc.sectypes.SecureObject:
- binary_ops = {<ufunc 'less'>: <built-in function lt>, <ufunc 'less_equal'>: <built-in function le>, <ufunc 'equal'>: <built-in function eq>, <ufunc 'not_equal'>: <built-in function ne>, <ufunc 'greater'>: <built-in function gt>, <ufunc 'greater_equal'>: <built-in function ge>, <ufunc 'add'>: <built-in function add>, <ufunc 'subtract'>: <built-in function sub>, <ufunc 'multiply'>: <built-in function mul>, <ufunc 'divide'>: <built-in function truediv>, ...}
- unary_ops = {<ufunc 'negative'>: <built-in function neg>, <ufunc 'positive'>: <built-in function pos>, <ufunc 'absolute'>: <built-in function abs>}
|
class SecureEllipticCurvePoint(SecureFiniteGroup) |
| |
SecureEllipticCurvePoint(value=None)
Common base class for secure (secret-shared) elliptic curve points. |
| |
- Method resolution order:
- SecureEllipticCurvePoint
- SecureFiniteGroup
- mpyc.sectypes.SecureObject
- builtins.object
Methods defined here:
- __getitem__(self, key)
- __init__(self, value=None)
- Ensure all coefficients are of secure field type.
Enforce value is a tuple.
- normalize(self)
- set_share(self, value)
- Set share to the given value.
The share is set directly (or recursively, for a composite SecureObject),
using callbacks if value contains Futures that are not yet done.
Class methods defined here:
- decode(M, Z, gap=256) from builtins.type
- equality(a, b, /) from builtins.type
- Return a == b.
- inversion(a, /) from builtins.type
- Return @-inverse of a (written ~a).
- operation(a, b, /) from builtins.type
- Return a @ b.
Data and other attributes defined here:
- __annotations__ = {}
Methods inherited from SecureFiniteGroup:
- __add__(self, other)
- __eq__(self, other)
- Return self==value.
- __invert__(self)
- __matmul__(self, other)
- __mul__(self, other)
- __ne__(self, other)
- Return self!=value.
- __neg__(self)
- __pow__(self, other)
- __radd__(self, other)
- __rmatmul__(self, other)
- __rmul__(self, other)
- __rsub__(self, other)
- __rtruediv__(self, other)
- __sub__(self, other)
- __truediv__(self, other)
- __xor__(self, other)
- inverse(self)
- For ease of use.
Class methods inherited from SecureFiniteGroup:
- if_else(c, a, b) from builtins.type
- Secure selection based on binary condition c between group elements a and b.
Condition c must be of a secure number type compatible with the group,
and its value should be 0 or 1. Input a must be compatible with the group as
well, either of the secure type cls or of type cls.group. Same for input b.
- operation2(a, /) from builtins.type
- Return a @ a.
- repeat(a, x) from builtins.type
- Return xth @-power of a (written a^x), for any integral number x.
Base a is either a public or a secure group element.
Exponent x is either a public or a secure integral number.
Possibly a, x are lists (of same length)
- repeat_public(a, x) from builtins.type
Data and other attributes inherited from SecureFiniteGroup:
- __hash__ = None
- identity = None
Methods inherited from mpyc.sectypes.SecureObject:
- __array_function__(self, func, types, args, kwargs)
- Redirect __array_function__ call to array class, if any.
To support calls like np.block([[secint(9), -1], [1, secint(7)]]).
- __array_ufunc__(self, ufunc, method, *inputs, **kwargs)
- Delegate __array_ufunc__ call to corresponding operator call.
Provisional support for calls like np.less(secint(9), 10).
- __bool__(self)
- Use of secret-shared objects in Boolean expressions makes no sense.
- __deepcopy__(self, memo)
- Let SecureObjects behave as immutable objects.
Introduced for github.com/meilof/oblif.
Data descriptors inherited from mpyc.sectypes.SecureObject:
- share
Data and other attributes inherited from mpyc.sectypes.SecureObject:
- binary_ops = {<ufunc 'less'>: <built-in function lt>, <ufunc 'less_equal'>: <built-in function le>, <ufunc 'equal'>: <built-in function eq>, <ufunc 'not_equal'>: <built-in function ne>, <ufunc 'greater'>: <built-in function gt>, <ufunc 'greater_equal'>: <built-in function ge>, <ufunc 'add'>: <built-in function add>, <ufunc 'subtract'>: <built-in function sub>, <ufunc 'multiply'>: <built-in function mul>, <ufunc 'divide'>: <built-in function truediv>, ...}
- unary_ops = {<ufunc 'negative'>: <built-in function neg>, <ufunc 'positive'>: <built-in function pos>, <ufunc 'absolute'>: <built-in function abs>}
|
class SecureFiniteGroup(mpyc.sectypes.SecureObject) |
| |
SecureFiniteGroup(value=None)
Abstract base class for secure (secret-shared) finite groups elements. |
| |
- Method resolution order:
- SecureFiniteGroup
- mpyc.sectypes.SecureObject
- builtins.object
Methods defined here:
- __add__(self, other)
- __eq__(self, other)
- Return self==value.
- __invert__(self)
- __matmul__(self, other)
- __mul__(self, other)
- __ne__(self, other)
- Return self!=value.
- __neg__(self)
- __pow__(self, other)
- __radd__(self, other)
- __rmatmul__(self, other)
- __rmul__(self, other)
- __rsub__(self, other)
- __rtruediv__(self, other)
- __sub__(self, other)
- __truediv__(self, other)
- __xor__(self, other)
- inverse(self)
- For ease of use.
Class methods defined here:
- equality(a, b, /) from builtins.type
- Return a == b.
- if_else(c, a, b) from builtins.type
- Secure selection based on binary condition c between group elements a and b.
Condition c must be of a secure number type compatible with the group,
and its value should be 0 or 1. Input a must be compatible with the group as
well, either of the secure type cls or of type cls.group. Same for input b.
- inversion(a, /) from builtins.type
- Return @-inverse of a (written ~a).
- operation(a, b, /) from builtins.type
- Return a @ b.
- operation2(a, /) from builtins.type
- Return a @ a.
- repeat(a, x) from builtins.type
- Return xth @-power of a (written a^x), for any integral number x.
Base a is either a public or a secure group element.
Exponent x is either a public or a secure integral number.
Possibly a, x are lists (of same length)
- repeat_public(a, x) from builtins.type
Data and other attributes defined here:
- __annotations__ = {'group': <class 'type'>, 'sectype': <class 'type'>}
- __hash__ = None
- identity = None
Methods inherited from mpyc.sectypes.SecureObject:
- __array_function__(self, func, types, args, kwargs)
- Redirect __array_function__ call to array class, if any.
To support calls like np.block([[secint(9), -1], [1, secint(7)]]).
- __array_ufunc__(self, ufunc, method, *inputs, **kwargs)
- Delegate __array_ufunc__ call to corresponding operator call.
Provisional support for calls like np.less(secint(9), 10).
- __bool__(self)
- Use of secret-shared objects in Boolean expressions makes no sense.
- __deepcopy__(self, memo)
- Let SecureObjects behave as immutable objects.
Introduced for github.com/meilof/oblif.
- __init__(self, value=None)
- Initialize share.
If value is None (default), the SecureObject starts out as an empty
placeholder (implemented as a Future).
- set_share(self, value)
- Set share to the given value.
The share is set directly (or recursively, for a composite SecureObject),
using callbacks if value contains Futures that are not yet done.
Data descriptors inherited from mpyc.sectypes.SecureObject:
- share
Data and other attributes inherited from mpyc.sectypes.SecureObject:
- binary_ops = {<ufunc 'less'>: <built-in function lt>, <ufunc 'less_equal'>: <built-in function le>, <ufunc 'equal'>: <built-in function eq>, <ufunc 'not_equal'>: <built-in function ne>, <ufunc 'greater'>: <built-in function gt>, <ufunc 'greater_equal'>: <built-in function ge>, <ufunc 'add'>: <built-in function add>, <ufunc 'subtract'>: <built-in function sub>, <ufunc 'multiply'>: <built-in function mul>, <ufunc 'divide'>: <built-in function truediv>, ...}
- unary_ops = {<ufunc 'negative'>: <built-in function neg>, <ufunc 'positive'>: <built-in function pos>, <ufunc 'absolute'>: <built-in function abs>}
|
class SecureQuadraticResidue(SecureFiniteGroup) |
| |
SecureQuadraticResidue(value=None)
Common base class for secure (secret-shared) quadratic residues. |
| |
- Method resolution order:
- SecureQuadraticResidue
- SecureFiniteGroup
- mpyc.sectypes.SecureObject
- builtins.object
Methods defined here:
- __init__(self, value=None)
- Ensure value is of secure field type.
- set_share(self, value)
- Set share to the given value.
The share is set directly (or recursively, for a composite SecureObject),
using callbacks if value contains Futures that are not yet done.
Class methods defined here:
- decode(M, Z, gap=128) from builtins.type
- equality(a, b, /) from builtins.type
- Return a == b.
- inversion(a, /) from builtins.type
- Return @-inverse of a (written ~a).
- operation(a, b, /) from builtins.type
- Return a @ b.
Data and other attributes defined here:
- __annotations__ = {}
Methods inherited from SecureFiniteGroup:
- __add__(self, other)
- __eq__(self, other)
- Return self==value.
- __invert__(self)
- __matmul__(self, other)
- __mul__(self, other)
- __ne__(self, other)
- Return self!=value.
- __neg__(self)
- __pow__(self, other)
- __radd__(self, other)
- __rmatmul__(self, other)
- __rmul__(self, other)
- __rsub__(self, other)
- __rtruediv__(self, other)
- __sub__(self, other)
- __truediv__(self, other)
- __xor__(self, other)
- inverse(self)
- For ease of use.
Class methods inherited from SecureFiniteGroup:
- if_else(c, a, b) from builtins.type
- Secure selection based on binary condition c between group elements a and b.
Condition c must be of a secure number type compatible with the group,
and its value should be 0 or 1. Input a must be compatible with the group as
well, either of the secure type cls or of type cls.group. Same for input b.
- operation2(a, /) from builtins.type
- Return a @ a.
- repeat(a, x) from builtins.type
- Return xth @-power of a (written a^x), for any integral number x.
Base a is either a public or a secure group element.
Exponent x is either a public or a secure integral number.
Possibly a, x are lists (of same length)
- repeat_public(a, x) from builtins.type
Data and other attributes inherited from SecureFiniteGroup:
- __hash__ = None
- identity = None
Methods inherited from mpyc.sectypes.SecureObject:
- __array_function__(self, func, types, args, kwargs)
- Redirect __array_function__ call to array class, if any.
To support calls like np.block([[secint(9), -1], [1, secint(7)]]).
- __array_ufunc__(self, ufunc, method, *inputs, **kwargs)
- Delegate __array_ufunc__ call to corresponding operator call.
Provisional support for calls like np.less(secint(9), 10).
- __bool__(self)
- Use of secret-shared objects in Boolean expressions makes no sense.
- __deepcopy__(self, memo)
- Let SecureObjects behave as immutable objects.
Introduced for github.com/meilof/oblif.
Data descriptors inherited from mpyc.sectypes.SecureObject:
- share
Data and other attributes inherited from mpyc.sectypes.SecureObject:
- binary_ops = {<ufunc 'less'>: <built-in function lt>, <ufunc 'less_equal'>: <built-in function le>, <ufunc 'equal'>: <built-in function eq>, <ufunc 'not_equal'>: <built-in function ne>, <ufunc 'greater'>: <built-in function gt>, <ufunc 'greater_equal'>: <built-in function ge>, <ufunc 'add'>: <built-in function add>, <ufunc 'subtract'>: <built-in function sub>, <ufunc 'multiply'>: <built-in function mul>, <ufunc 'divide'>: <built-in function truediv>, ...}
- unary_ops = {<ufunc 'negative'>: <built-in function neg>, <ufunc 'positive'>: <built-in function pos>, <ufunc 'absolute'>: <built-in function abs>}
|
class SecureSchnorrGroupElement(SecureFiniteGroup) |
| |
SecureSchnorrGroupElement(value=None)
Common base class for secure (secret-shared) Schnorr group elements. |
| |
- Method resolution order:
- SecureSchnorrGroupElement
- SecureFiniteGroup
- mpyc.sectypes.SecureObject
- builtins.object
Methods defined here:
- __init__(self, value=None)
- Ensure value is of secure field type.
- set_share(self, value)
- Set share to the given value.
The share is set directly (or recursively, for a composite SecureObject),
using callbacks if value contains Futures that are not yet done.
Class methods defined here:
- decode(M, Z) from builtins.type
- equality(a, b, /) from builtins.type
- Return a == b.
- inversion(a, /) from builtins.type
- Return @-inverse of a (written ~a).
- operation(a, b, /) from builtins.type
- Return a @ b.
Data and other attributes defined here:
- __annotations__ = {}
Methods inherited from SecureFiniteGroup:
- __add__(self, other)
- __eq__(self, other)
- Return self==value.
- __invert__(self)
- __matmul__(self, other)
- __mul__(self, other)
- __ne__(self, other)
- Return self!=value.
- __neg__(self)
- __pow__(self, other)
- __radd__(self, other)
- __rmatmul__(self, other)
- __rmul__(self, other)
- __rsub__(self, other)
- __rtruediv__(self, other)
- __sub__(self, other)
- __truediv__(self, other)
- __xor__(self, other)
- inverse(self)
- For ease of use.
Class methods inherited from SecureFiniteGroup:
- if_else(c, a, b) from builtins.type
- Secure selection based on binary condition c between group elements a and b.
Condition c must be of a secure number type compatible with the group,
and its value should be 0 or 1. Input a must be compatible with the group as
well, either of the secure type cls or of type cls.group. Same for input b.
- operation2(a, /) from builtins.type
- Return a @ a.
- repeat(a, x) from builtins.type
- Return xth @-power of a (written a^x), for any integral number x.
Base a is either a public or a secure group element.
Exponent x is either a public or a secure integral number.
Possibly a, x are lists (of same length)
- repeat_public(a, x) from builtins.type
Data and other attributes inherited from SecureFiniteGroup:
- __hash__ = None
- identity = None
Methods inherited from mpyc.sectypes.SecureObject:
- __array_function__(self, func, types, args, kwargs)
- Redirect __array_function__ call to array class, if any.
To support calls like np.block([[secint(9), -1], [1, secint(7)]]).
- __array_ufunc__(self, ufunc, method, *inputs, **kwargs)
- Delegate __array_ufunc__ call to corresponding operator call.
Provisional support for calls like np.less(secint(9), 10).
- __bool__(self)
- Use of secret-shared objects in Boolean expressions makes no sense.
- __deepcopy__(self, memo)
- Let SecureObjects behave as immutable objects.
Introduced for github.com/meilof/oblif.
Data descriptors inherited from mpyc.sectypes.SecureObject:
- share
Data and other attributes inherited from mpyc.sectypes.SecureObject:
- binary_ops = {<ufunc 'less'>: <built-in function lt>, <ufunc 'less_equal'>: <built-in function le>, <ufunc 'equal'>: <built-in function eq>, <ufunc 'not_equal'>: <built-in function ne>, <ufunc 'greater'>: <built-in function gt>, <ufunc 'greater_equal'>: <built-in function ge>, <ufunc 'add'>: <built-in function add>, <ufunc 'subtract'>: <built-in function sub>, <ufunc 'multiply'>: <built-in function mul>, <ufunc 'divide'>: <built-in function truediv>, ...}
- unary_ops = {<ufunc 'negative'>: <built-in function neg>, <ufunc 'positive'>: <built-in function pos>, <ufunc 'absolute'>: <built-in function abs>}
|
class SecureSymmetricGroupElement(SecureFiniteGroup) |
| |
SecureSymmetricGroupElement(value=None)
Common base class for secure (secret-shared) symmetric group elements. |
| |
- Method resolution order:
- SecureSymmetricGroupElement
- SecureFiniteGroup
- mpyc.sectypes.SecureObject
- builtins.object
Methods defined here:
- __init__(self, value=None)
- Ensure all coefficients of value are of secure field type.
Enforce value is a tuple.
- set_share(self, value)
- Set share to the given value.
The share is set directly (or recursively, for a composite SecureObject),
using callbacks if value contains Futures that are not yet done.
Class methods defined here:
- equality(p, q, /) from builtins.type
- Return a == b.
- inversion(p, /) from builtins.type
- Return @-inverse of a (written ~a).
- operation(p, q, /) from builtins.type
- First p then q.
Data and other attributes defined here:
- __annotations__ = {}
Methods inherited from SecureFiniteGroup:
- __add__(self, other)
- __eq__(self, other)
- Return self==value.
- __invert__(self)
- __matmul__(self, other)
- __mul__(self, other)
- __ne__(self, other)
- Return self!=value.
- __neg__(self)
- __pow__(self, other)
- __radd__(self, other)
- __rmatmul__(self, other)
- __rmul__(self, other)
- __rsub__(self, other)
- __rtruediv__(self, other)
- __sub__(self, other)
- __truediv__(self, other)
- __xor__(self, other)
- inverse(self)
- For ease of use.
Class methods inherited from SecureFiniteGroup:
- if_else(c, a, b) from builtins.type
- Secure selection based on binary condition c between group elements a and b.
Condition c must be of a secure number type compatible with the group,
and its value should be 0 or 1. Input a must be compatible with the group as
well, either of the secure type cls or of type cls.group. Same for input b.
- operation2(a, /) from builtins.type
- Return a @ a.
- repeat(a, x) from builtins.type
- Return xth @-power of a (written a^x), for any integral number x.
Base a is either a public or a secure group element.
Exponent x is either a public or a secure integral number.
Possibly a, x are lists (of same length)
- repeat_public(a, x) from builtins.type
Data and other attributes inherited from SecureFiniteGroup:
- __hash__ = None
- identity = None
Methods inherited from mpyc.sectypes.SecureObject:
- __array_function__(self, func, types, args, kwargs)
- Redirect __array_function__ call to array class, if any.
To support calls like np.block([[secint(9), -1], [1, secint(7)]]).
- __array_ufunc__(self, ufunc, method, *inputs, **kwargs)
- Delegate __array_ufunc__ call to corresponding operator call.
Provisional support for calls like np.less(secint(9), 10).
- __bool__(self)
- Use of secret-shared objects in Boolean expressions makes no sense.
- __deepcopy__(self, memo)
- Let SecureObjects behave as immutable objects.
Introduced for github.com/meilof/oblif.
Data descriptors inherited from mpyc.sectypes.SecureObject:
- share
Data and other attributes inherited from mpyc.sectypes.SecureObject:
- binary_ops = {<ufunc 'less'>: <built-in function lt>, <ufunc 'less_equal'>: <built-in function le>, <ufunc 'equal'>: <built-in function eq>, <ufunc 'not_equal'>: <built-in function ne>, <ufunc 'greater'>: <built-in function gt>, <ufunc 'greater_equal'>: <built-in function ge>, <ufunc 'add'>: <built-in function add>, <ufunc 'subtract'>: <built-in function sub>, <ufunc 'multiply'>: <built-in function mul>, <ufunc 'divide'>: <built-in function truediv>, ...}
- unary_ops = {<ufunc 'negative'>: <built-in function neg>, <ufunc 'positive'>: <built-in function pos>, <ufunc 'absolute'>: <built-in function abs>}
| |


What is Spleeter?
**Something Something**
Steps followed by the Spleeter Training
From command line, the Spleeter train command is input: spleeter train -p configs/musdb_config.json -d /path/to/musdb
The function 'main', from spleeter/_main_.py, is called.
After parsing the command, it checks to see whether it is a separate, train, or evaluate command. In this case, it is a train command.
The function 'entrypoint', from spleeter/commands/train.py, is imported.
The function 'load_configuration', from spleeter/utils/configuration.py, is called with input 'arguments.configuration'.
The function 'entrypoint', from spleeter/commands/train.py is called with inputs 'arguments' and 'params'.
From spleeter/audio/adapter.py, the get_audio_adapter function is called, takes input 'arguments.audio_adapter' and is attached to variable 'audio adapter'.
Loads the AVCon or FFMPEG audio adapter.
The function '_create_estimator', from spleeter/commands/train.py, is called with input 'arguments.audio_adapter'.


You have run out of energy. Depression makes it feel as though every action, no matter how small, takes a great amount of effort. Would you like to start over?
You have run out of mood. Feelings of helplessness and hopelessness are common with depression, and can prove to be very draining. Would you like to start over?
start over


@Draeth is bimetal an option? E.g.. nickel with copper veins?
1
Draeth08-May-19 02:55 AM
@smk762 - dracocanis ominator It is, i'm currently making a preliminary design and shot a message to some of my contacts at several manufacturers to see if what i'm wanting to do is viable(edited)
1
smk762 - dracocanis ominator08-May-19 02:59 AM
personally, I'd love a gold/silver bimetal, but understand minimum mint run would make that pretty expensive all up.
Draeth08-May-19 03:18 AM
yea, real silver alone is mad expensive. from the manufacturers i've talked to, a run of 50 coins, which is a minimum at most places that are really good at what they do, costs anywhere between $2800-$3400(edited)
i can only imagine what it would cost adding real gold to that would be
Draeth08-May-19 03:33 AM
@smk762 - dracocanis ominator can you send me a link or images of your logo and other assets?
smk762 - dracocanis ominator08-May-19 03:34 AM
@CrisF would be the best bloke for that, he's done the bulk of work on website etc
Draeth08-May-19 03:34 AM
gotcha
smk762 - dracocanis ominator08-May-19 03:34 AM
I might be interested in some dragonhound coins at some stage tho lol(edited)
Draeth08-May-19 03:35 AM
lol
i'm game
smk762 - dracocanis ominator08-May-19 03:38 AM
gezz that's a fair premium over silver spot for mintage, but the cost of making the stamp etc is fair enough. You'd need thousands of coins minted to spread that out. For these tho, not looking at nusmatic collector value, more of a faminly heirloom (edited)
CrisF08-May-19 06:04 AM
Hi @Draeth ,I'll get you a logo in a little bit.
blackjok3r08-May-19 06:05 AM
You received 2107571.36946405 in the last snapshot
Seems to be working pretty well so far.  How leaderboard?
blackjok3r08-May-19 07:29 AM
Yeah that may be a problem lol
Because there are so many address its hard to know who sent what to where... Would take a pretty comprehensive bloclchain analysis to work out. Have to get the list of starting address then follow each vout until u get to chain tip
smk762 - dracocanis ominator08-May-19 07:40 AM
guess can only tell if everyone merges to main address or posts it here. chain analysis seems a lot of loops otherwise.
Balance: 512472187.7402305
Addresses on chain : 3680
Using 1133 addresses to cluster around<PHONE_NUMBER>0000.
Snapshot Height: 8660
Block height: 7860
800 blocks remaining...
 Algorithms & DLT investigator.
Tweets
2292
Followers
1072
seems 192,7 nk parameters work
6
blackjok3r08-May-19 07:52 AM
Nice... So someone got it working with pools and GPU then?
From the looks of that @smk762 - dracocanis ominator your going to well and truly win if we don't let the game continue for a decent amount of time.
smk762 - dracocanis ominator08-May-19 07:56 AM
it was either automate or not sleep
blackjok3r08-May-19 07:58 AM
Well that was what I figured everyone would do. Its defiantly a game that would be dominated by bots if it were to become a thing. I guess I should either restart it now ppl know what to do, or call the end a week from today or maybe a few days less.
smk762 - dracocanis ominator08-May-19 07:59 AM
script is nothing more than using parts of shrapnel to act on getcurrentranks data
if my lead is high enough, will PR it
blackjok3r08-May-19 08:01 AM
Hahaha... No worries with you winning, was going yo give u some labs anyway. Do we know how many ppl actually split? I haven't really checked it much.
smk762 - dracocanis ominator08-May-19 08:01 AM
how many addresses created at start of game?
I have no staked4 airdrop, so gotta catch up!(edited)
1
CrisF08-May-19 08:02 AM
Thie prize for this will be more than my staked airdrop, haha.
I've tried - but we'll behind the curve and no automation.
CrisF08-May-19 08:03 AM
Back to the grind so busy as.
blackjok3r08-May-19 08:05 AM
OK. Well I guess we call it in 2 days. I'll need to figure out what block you should merge back to your starting address by a bit later on and post announcement here. I would say smk has a lead that cannot be beaten so continuing for too long is just wasting peoples time.
smk762 - dracocanis ominator08-May-19 08:06 AM
awww, I was enjoying domination
blackjok3r08-May-19 08:06 AM
This is a good first try, but I wasn't organised enough at all, far too rushed.
It did test payments though enough to know that chains sync and keep consensus with daily snapshots and releases.
gt08-May-19 08:17 AM
are we snap shotting latest labsrc or going with staked4?
blackjok3r08-May-19 08:18 AM
It will be staked 4, but I will be distributing some of my labs, 10k to winner here and probably 1k for anyone who actually tried to play, need to do some math on that though first.
gt08-May-19 08:20 AM
participation trophies
blackjok3r08-May-19 08:20 AM
Haha yeah, I figure its a fair way to get some labs to they guys who were not around in staked days.
2
smk762 - dracocanis ominator08-May-19 08:24 AM
if im , will peel off 2.5k for and 1k for
3
blackjok3r08-May-19 09:13 AM
Last snapshot will be at block: 11,520
That is 3 more snapshots from now. There will be snapshots with air drops at the following blocks: 8640, 10,080.
After the 10,080 snapshot and paymentsrelease has been made please send your total balance over all address back to the address you started with.
The top address will take the prize of 10K LABS, if that is smk762, he said he will share with 2nd and 3rd in post above, so its still worth participating if you have not already. I will not get a place for a prize, I am exempt from winning anything.
 If your balance has not been split for the airdrop @ 8640, you do not get anything That leaves approx 12H from now to split to be elegible to get a participation award
@LabsAssistant@PHBA2061@Strob(edited)
2
2
PHBA206108-May-19 09:23 AM
got it !
jorian08-May-19 09:30 AM
Better get to work then
gt08-May-19 09:34 AM
thanks !
CMaurice08-May-19 12:33 PM
erm, I have 9.9 CFEKPAY, average balance is 2661546, so no chance of win, right?
blackjok3r08-May-19 12:37 PM
Did u put up an address? If not ask @CrisF for a private key
CrisF08-May-19 12:39 PM
I have a public key for the game if you'd like @CMaurice .
(I'll also know the key, so you'll have to play some trust.)
CMaurice08-May-19 12:41 PM
yep, that'd be great @CrisF , more for learning wth is going on
Automated staker for PoS assetchains. Contribute to KMDLabs/pos64staker development by creating an account on GitHub.
set your address and variance in script, and make sure your list.json has more addresses than script needs for sending around the cluster
Alright08-May-19 11:52 PM
@LabsAssistant just a reminder that the 20vs22 poll is about half way done(deadline: 05/13/2019 @ 2:45am (UTC)), results say we've had 7 people vote so far. If you have voted, please look at the results in the TUI and confirm your vote has been counted.
Any feedback on the dapp is definitely appreciated, feature requests or suggestions as well
will be using it for bounty claims eventually, so it's a pretty important aspect of the project
@gt@smk762 - dracocanis ominator sent KMD to your testnet NN address for dependencies bounty
testnet NN, not labs NN
3
1
Draeth09-May-19 12:10 AM
Hey all! Here's what I was thinking for the front of the coin. The black portions are the raised parts of the coin, and the gold is like the gold in the reference picture that runs through the metal. What do you think? https://imgur.com/fRihewp
i may need to scoot the logo up a bit tho
Alright09-May-19 12:14 AM
@Draeth you said costs anywhere between $2800-$3400 for silver coins
what exactly was that quote for?
Draeth09-May-19 12:15 AM
for a .999 silver pirate coin i'm making
Alright09-May-19 12:16 AM
how many are you making, estimate on price/coin?

Draeth09-May-19 12:22 AM
I'm probably going to sell them for about $75-$80/coin


@(assignment: Assignment)
@main("Assignment") {
@assignment.name by @assignment.lecturer.getName
@assignment.description
Assignment File
@assignment.name
Submissions
@for(submission <- assignment.submissions) {
-
@submission.student.name
@submission.grade
}
@if(session.get("role").equals("Student")){
Add
}
}


The Aligned Rank Transform for nonparametric factorial ANOVAs as described by J. O. Wobbrock, L. Findlater, D. Gergle, & J. J. Higgins, "The Aligned Rank Transform for nonparametric factorial analyses using only ANOVA procedures", CHI 2011 <doi:10.1145/1978942.1978963>.
| Version: | 0.10.5 |
| Depends: | R (≥ 3.2) |
| Imports: | lme4, car (≥ 2.0-24), plyr, magrittr, dplyr |
| Suggests: | testthat (≥ 0.10.0), emmeans, knitr, rmarkdown, ggplot2, tidyr, pander, lmerTest, cluster, phia, survival, psych, stringi, DescTools |
| Published: | 2018-07-09 |
| Author: | Matthew Kay [aut, cre], Jacob O. Wobbrock [aut] |
| Maintainer: | Matthew Kay <mjskay at umich.edu> |
| BugReports: | https://github.com/mjskay/ARTool/issues/new |
| License: | GPL-2 | GPL-3 [expanded from: GPL (≥ 2)] |
| URL: | https://github.com/mjskay/ARTool |
| NeedsCompilation: | no |
| Citation: | ARTool citation info |
| CRAN checks: | ARTool results |
| Reference manual: | ARTool.pdf |
| Vignettes: |
Interaction Contrasts with ART Effect Sizes with ART |
| Package source: | ARTool_0.10.5.tar.gz |
| Windows binaries: | r-devel: ARTool_0.10.5.zip, r-release: ARTool_0.10.5.zip, r-oldrel: ARTool_0.10.5.zip |
| OS X binaries: | r-release: ARTool_0.10.5.tgz, r-oldrel: ARTool_0.10.5.tgz |
| Old sources: | ARTool archive |
Please use the canonical form https://CRAN.R-project.org/package=ARTool to link to this page.


Photos by ievenn
At least 8 million tons of plastic end up in our oceans every year, and make up 80% of all marine debris from surface waters to deep-sea sediments. ... Marine species ingest or are entangled by plastic debris, which causes severe injuries and deaths.
created with
Website Builder Software .


LSystemResult
public class LSystemResult
extension LSystemResult: LSystemRuleContextAwareSource
A result generated by an LSystem
-
The input element that was used in this results
Declaration
Swift
public let inputElement: LSystemElement
-
The iterations this results has performed so far
Declaration
Swift
internal var iterationsPerformed: Int
-
The current elements this result contains
Declaration
Swift
public var outputElements: [LSystemElement]
-
The separator used between each parameter
Declaration
Swift
public var parameterSeparator: String
-
The separator used between a parameter key and its value
Declaration
Swift
public var parameterKeyValueSeparator: String
-
The delimiter used to define the beginning of a list of parameters
Declaration
Swift
public var parameterStartDelimiter: String
-
The delimiter used to define the end of a list of parameters
Declaration
Swift
public var parameterEndDelimiter: String
-
The results in a string format, with its parameters
Declaration
Swift
public var stringWithParameters: String { get }
-
Creates an
LSystemResult
based on an initial elementDeclaration
Swift
init(initialElement: LSystemElement)
Parameters
initialElement
The initial element to use
-
The amount of iterations performed to create this
LSystemResult
Declaration
Swift
public var iterations: Int { get }
-
The
LSystemResult
in a string formatDeclaration
Swift
public var string: String { get }


In Woody Allen's "Crimes and Misdemeanors," a pompous filmmaker notes that "comedy is tragedy plus time." Arriving only days before the 25th anniversary of President Richard M. Nixon's resignation, "Dick" attempts to mine humor from the Watergate scandal, an event most of us who lived through it do not remember as being particularly uproarious. Although it eventually suffers a typically 1970s energy crisis, this satire of the early Seventies has its moments, thanks to the considerably charms of Michelle Williams and Kirsten Dunst as a pair of airheads who become unlikely White House insiders.
Although Dunst has proven her mettle as a comedienne before -- she was one of the few assets of the woebegone "Drop Dead Gorgeous" -- Williams' knack for getting laughs is a minor revelation since she certainly hasn't had many chances to show it off as the hard-partying Jen on TV's "Dawson's Creek." But she's thoroughly delightful here as Arlene, a nerdy 15-year-old who abandons her crush on Bobby Sherman ("he cares about people, but also about nature and ecology") to devote all her time to worshipping the President. Eventually, this Monica-in-training will go so far as to croon a tuneless cover of Olivia Newton-John's "I Honestly Love You" into one of Nixon's many hidden tape recorders. Betsy (Dunst) is slightly brainier, although you wouldn't want to live on the difference.
During a field trip to the White House, the duo accidentally stumbles upon evidence of the bumbled Watergate burglary and are grilled by the paranoid H.R. Haldeman (Dave Foley), who asks them if they think "friendly thoughts" when they think of Nixon. After assuring him of their loyalty, Betsy and Arlene are appointed Presidential dog walkers, which gives them the chance to share their views on foreign policy with Nixon (Dan Hedaya) and Henry Kissinger (Saul Rubinek). "I just think people would like you better if you stopped the war," Arlene tells Nixon, who decides to heed her good advice.
The first two-thirds of "Dick" are often clever, with oodles of great background music (Hot Butter's "Popcorn," Stories' "Brother Louie," etc.) and amusing clips from TV of the period, including Alka Seltzer's classic "I Can't Believe I Ate the Whole Thing" spot. The wardrobe department obviously had a field day putting Dunst and Williams into a series of polyester nightmares, most of which look like a cross between K-Mart and the counterculture.
Unfortunately, around the time our heroines realize they've been betrayed by Tricky Dick and his associates, the movie begins to seem more silly than funny. A gag about marijuana-laced cookies is run into the ground, an attempt to make fun of Bob Woodward and Carl Bernstein never really works and the story comes to a disappointingly feeble finale. Williams and Dunst, however, remain bubbly and beguiling throughout, adding some much needed zest to what turns out to be a rather half-baked comedy. James Sanford
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


- Assert - Class in edu.calpoly.testy
-
Various static methods to provide different test assertions.
- assertEquals(String, Object, Object) - Static method in class edu.calpoly.testy.Assert
-
Asserts that two objects are equal, as determined by
java.util.Objects.deepEquals()
.
- assertEquals(String, boolean, boolean) - Static method in class edu.calpoly.testy.Assert
-
Determine if two boolean values are equal.
- assertEquals(String, byte, byte) - Static method in class edu.calpoly.testy.Assert
-
Determine if two byte values are equal.
- assertEquals(String, char, char) - Static method in class edu.calpoly.testy.Assert
-
Determine if two char values are equal.
- assertEquals(String, int, int) - Static method in class edu.calpoly.testy.Assert
-
Determine if two int values are equal.
- assertEquals(String, long, long) - Static method in class edu.calpoly.testy.Assert
-
Determine if two long values are equal.
- assertEquals(String, short, short) - Static method in class edu.calpoly.testy.Assert
-
Determine if two short values are equal.
- assertEquals(String, double, double, double) - Static method in class edu.calpoly.testy.Assert
-
Determine if two double values are equal within a small tolerance.
- assertEquals(String, double[], double[], double) - Static method in class edu.calpoly.testy.Assert
-
Determine if two double arrays are equal, with the values checked within a
small tolerance
- assertEquals(String, double[][], double[][], double) - Static method in class edu.calpoly.testy.Assert
-
Determine if two double arrays are equal, with the values checked within a
small tolerance
- assertEquals(String, double[][][], double[][][], double) - Static method in class edu.calpoly.testy.Assert
-
Determine if two double arrays are equal, with the values checked within a
small tolerance
- assertEquals(String, double[][][][], double[][][][], double) - Static method in class edu.calpoly.testy.Assert
-
Determine if two double arrays are equal, with the values checked within a
small tolerance
- assertEquals(String, float, float, float) - Static method in class edu.calpoly.testy.Assert
-
Determine if two float values are equal within a small tolerance.
- assertEquals(String, float[], float[], float) - Static method in class edu.calpoly.testy.Assert
-
Determine if two float arrays are equal, with the values checked within a
small tolerance
- assertEquals(String, float[][], float[][], float) - Static method in class edu.calpoly.testy.Assert
-
Determine if two float arrays are equal, with the values checked within a
small tolerance
- assertEquals(String, float[][][], float[][][], float) - Static method in class edu.calpoly.testy.Assert
-
Determine if two float arrays are equal, with the values checked within a
small tolerance
- assertEquals(String, float[][][][], float[][][][], float) - Static method in class edu.calpoly.testy.Assert
-
Determine if two float arrays are equal, with the values checked within a
small tolerance
- assertEquals(Object, Object) - Static method in class edu.calpoly.testy.Assert
-
Asserts that two objects are equal, as determined by
java.util.Objects.deepEquals()
.
- assertEquals(boolean, boolean) - Static method in class edu.calpoly.testy.Assert
-
Determine if two boolean values are equal.
- assertEquals(byte, byte) - Static method in class edu.calpoly.testy.Assert
-
Determine if two byte values are equal.
- assertEquals(char, char) - Static method in class edu.calpoly.testy.Assert
-
Determine if two char values are equal.
- assertEquals(int, int) - Static method in class edu.calpoly.testy.Assert
-
Determine if two int values are equal.
- assertEquals(long, long) - Static method in class edu.calpoly.testy.Assert
-
Determine if two long values are equal.
- assertEquals(short, short) - Static method in class edu.calpoly.testy.Assert
-
Determine if two short values are equal.
- assertEquals(double, double, double) - Static method in class edu.calpoly.testy.Assert
-
Determine if two double values are equal within a small tolerance.
- assertEquals(double[], double[], double) - Static method in class edu.calpoly.testy.Assert
-
Determine if two double arrays are equal, with the values checked within a
small tolerance
- assertEquals(double[][], double[][], double) - Static method in class edu.calpoly.testy.Assert
-
Determine if two double arrays are equal, with the values checked within a
small tolerance
- assertEquals(double[][][], double[][][], double) - Static method in class edu.calpoly.testy.Assert
-
Determine if two double arrays are equal, with the values checked within a
small tolerance
- assertEquals(double[][][][], double[][][][], double) - Static method in class edu.calpoly.testy.Assert
-
Determine if two double arrays are equal, with the values checked within a
small tolerance
- assertEquals(float, float, float) - Static method in class edu.calpoly.testy.Assert
-
Determine if two float values are equal within a small tolerance.
- assertEquals(float[], float[], float) - Static method in class edu.calpoly.testy.Assert
-
Determine if two float arrays are equal, with the values checked within a
small tolerance
- assertEquals(float[][], float[][], float) - Static method in class edu.calpoly.testy.Assert
-
Determine if two float arrays are equal, with the values checked within a
small tolerance
- assertEquals(float[][][], float[][][], float) - Static method in class edu.calpoly.testy.Assert
-
Determine if two float arrays are equal, with the values checked within a
small tolerance
- assertEquals(float[][][][], float[][][][], float) - Static method in class edu.calpoly.testy.Assert
-
Determine if two float arrays are equal, with the values checked within a
small tolerance
- assertFalse(String, boolean) - Static method in class edu.calpoly.testy.Assert
-
Asserts that a condition is false.
- assertFalse(boolean) - Static method in class edu.calpoly.testy.Assert
-
Asserts that a condition is false.
- assertNotEquals(String, Object, Object) - Static method in class edu.calpoly.testy.Assert
-
Asserts that two objects are not equal, as determined by
java.util.Objects.deepEquals()
.
- assertNotEquals(String, boolean, boolean) - Static method in class edu.calpoly.testy.Assert
-
Determine if two boolean values are not equal.
- assertNotEquals(String, byte, byte) - Static method in class edu.calpoly.testy.Assert
-
Determine if two byte values are not equal.
- assertNotEquals(String, char, char) - Static method in class edu.calpoly.testy.Assert
-
Determine if two char values are not equal.
- assertNotEquals(String, int, int) - Static method in class edu.calpoly.testy.Assert
-
Determine if two int values are not equal.
- assertNotEquals(String, long, long) - Static method in class edu.calpoly.testy.Assert
-
Determine if two long values are not equal.
- assertNotEquals(String, short, short) - Static method in class edu.calpoly.testy.Assert
-
Determine if two short values are not equal.
- assertNotEquals(String, double, double, double) - Static method in class edu.calpoly.testy.Assert
-
Determine if two double values are not equal within a small tolerance.
- assertNotEquals(String, double[], double[], double) - Static method in class edu.calpoly.testy.Assert
-
Determine if two double arrays are not equal, with the values checked within a
small tolerance
- assertNotEquals(String, double[][], double[][], double) - Static method in class edu.calpoly.testy.Assert
-
Determine if two double arrays are not equal, with the values checked within a
small tolerance
- assertNotEquals(String, double[][][], double[][][], double) - Static method in class edu.calpoly.testy.Assert
-
Determine if two double arrays are not equal, with the values checked within a
small tolerance
- assertNotEquals(String, double[][][][], double[][][][], double) - Static method in class edu.calpoly.testy.Assert
-
Determine if two double arrays are not equal, with the values checked within a
small tolerance
- assertNotEquals(String, float, float, float) - Static method in class edu.calpoly.testy.Assert
-
Determine if two float values are not equal within a small tolerance.
- assertNotEquals(String, float[], float[], float) - Static method in class edu.calpoly.testy.Assert
-
Determine if two float arrays are not equal, with the values checked within a
small tolerance
- assertNotEquals(String, float[][], float[][], float) - Static method in class edu.calpoly.testy.Assert
-
Determine if two float arrays are not equal, with the values checked within a
small tolerance
- assertNotEquals(String, float[][][], float[][][], float) - Static method in class edu.calpoly.testy.Assert
-
Determine if two float arrays are not equal, with the values checked within a
small tolerance
- assertNotEquals(String, float[][][][], float[][][][], float) - Static method in class edu.calpoly.testy.Assert
-
Determine if two float arrays are not equal, with the values checked within a
small tolerance
- assertNotEquals(Object, Object) - Static method in class edu.calpoly.testy.Assert
-
Asserts that two objects are not equal, as determined by
java.util.Objects.deepEquals()
.
- assertNotEquals(boolean, boolean) - Static method in class edu.calpoly.testy.Assert
-
Determine if two boolean values are not equal.
- assertNotEquals(byte, byte) - Static method in class edu.calpoly.testy.Assert
-
Determine if two byte values are not equal.
- assertNotEquals(char, char) - Static method in class edu.calpoly.testy.Assert
-
Determine if two char values are not equal.
- assertNotEquals(int, int) - Static method in class edu.calpoly.testy.Assert
-
Determine if two int values are not equal.
- assertNotEquals(long, long) - Static method in class edu.calpoly.testy.Assert
-
Determine if two long values are not equal.
- assertNotEquals(short, short) - Static method in class edu.calpoly.testy.Assert
-
Determine if two short values are not equal.
- assertNotEquals(double, double, double) - Static method in class edu.calpoly.testy.Assert
-
Determine if two double values are not equal within a small tolerance.
- assertNotEquals(double[], double[], double) - Static method in class edu.calpoly.testy.Assert
-
Determine if two double arrays are not equal, with the values checked within a
small tolerance
- assertNotEquals(double[][], double[][], double) - Static method in class edu.calpoly.testy.Assert
-
Determine if two double arrays are not equal, with the values checked within a
small tolerance
- assertNotEquals(double[][][], double[][][], double) - Static method in class edu.calpoly.testy.Assert
-
Determine if two double arrays are not equal, with the values checked within a
small tolerance
- assertNotEquals(double[][][][], double[][][][], double) - Static method in class edu.calpoly.testy.Assert
-
Determine if two double arrays are not equal, with the values checked within a
small tolerance
- assertNotEquals(float, float, float) - Static method in class edu.calpoly.testy.Assert
-
Determine if two float values are not equal within a small tolerance.
- assertNotEquals(float[], float[], float) - Static method in class edu.calpoly.testy.Assert
-
Determine if two float arrays are not equal, with the values checked within a
small tolerance
- assertNotEquals(float[][], float[][], float) - Static method in class edu.calpoly.testy.Assert
-
Determine if two float arrays are not equal, with the values checked within a
small tolerance
- assertNotEquals(float[][][], float[][][], float) - Static method in class edu.calpoly.testy.Assert
-
Determine if two float arrays are not equal, with the values checked within a
small tolerance
- assertNotEquals(float[][][][], float[][][][], float) - Static method in class edu.calpoly.testy.Assert
-
Determine if two float arrays are not equal, with the values checked within a
small tolerance
- assertNotNull(String, Object) - Static method in class edu.calpoly.testy.Assert
-
Determine if object != null.
- assertNotNull(Object) - Static method in class edu.calpoly.testy.Assert
-
Determine if object != null.
- assertNotSame(String, Object, Object) - Static method in class edu.calpoly.testy.Assert
-
Determine if expected != actual.
- assertNotSame(Object, Object) - Static method in class edu.calpoly.testy.Assert
-
Determine if expected != actual.
- assertNull(String, Object) - Static method in class edu.calpoly.testy.Assert
-
Determine if object == null.
- assertNull(Object) - Static method in class edu.calpoly.testy.Assert
-
Determine if object == null.
- assertSame(String, Object, Object) - Static method in class edu.calpoly.testy.Assert
-
Determine if expected == actual.
- assertSame(Object, Object) - Static method in class edu.calpoly.testy.Assert
-
Determine if expected == actual.
- assertTrue(String, boolean) - Static method in class edu.calpoly.testy.Assert
-
Asserts that a condition is true.
- assertTrue(boolean) - Static method in class edu.calpoly.testy.Assert
-
Asserts that a condition is true.


The biometric passport, also known as an electronic passport, is an identity document that, in addition to the use of security paper, contains a polycarbonate sheet with an electronic circuit embedded in it, and uses biometrics to authenticate travelers' citizenship.
More informationThe United Nations establishes the use of a chip to identify everyone in the world. The system collects facials, iris, and biometric fingerprint data, establishing itself in the only official documentation for refugees.
More informationA biochip is a small-scale device, analogous to an integrated circuit, assembled or used to analyze organic molecules associated with living organisms. In theory a biochip is a bee built of large organic molecules, such as proteins, capable of performing the functions of a computer (data storage, processing).
More information


Mzamomtsha Primary School is located between Khayelistha Township and Umfuleni Township in the Western Cape Province of the Republic of South Africa. The schools headmaster, Mr. Simphiwe Khuze, joined in 2007. The school is located in a semi-township called Drift Sands which started off as an informal settlement. Drift Sands has since been developed and with support from the South African government it turned into a sprawling township with state of the art housing units. Mzamomtsha Primary School is plays a key role in Drift Sands and is supporting the local community. The school was initially created for primary school students from grade 1 to grade 7, but due to the rapid population growth (births and migration) the school is also enrolling higher grades. Students are allowed up to grade 12 - which is the metric year. The rapid growth has lead to a series of problems for the Mzamomtsha Primary School. There are not enough classrooms to begin with and Mzamomtsha Primary School has no online presence. Besides, they can not find sufficient staff members to match the continuous growth. The school has 700 learners and a staff of 20 teachers.
Our vision at Mzamomtsha Primary School is to empower students to acquire, demonstrate, articulate and value knowledge and skills that will support them, as life-long learners, to participate in and contribute to the global world and practice the core values of the school: respect, tolerance & inclusion, and excellence.
Our mission is to develop students with active and creative minds, a sense of understanding and compassion for others, and the courage to act on their beliefs. We stress the total development of each child: spiritual, moral, intellectual, social, emotional, and physical.


2017
Lorem ipsum dolor sit amet, quo ei simul congue exerci, ad nec admodum perfecto mnesarchum, vim ea mazim fierent detracto. Ea quis iuvaret expetendis his, te elit voluptua dignissim per, habeo iusto primis ea eam.
XFINITUM relays everything going on in your phone to a device that now makes laptops obsolete. With one single touch, XFINITUM enables you to transform your smartphone into a full laptop replacement. Connect your XFINITUM wirelessly to any iOS or Android Smartphone and the XFINITUM will use your Smartphone as a processing unit.
With both live crowdfunding campaigns and innovative products shipping now, there’s no better place to start the hunt for cool and clever innovations that surprise and delight. Indiegogo is where new launches.
Find, fund, and shop the next big thing
What we doLorem ipsum dolor sit amet, quo ei simul congue exerci, ad nec admodum perfecto mnesarchum, vim ea mazim fierent detracto. Ea quis iuvaret expetendis his, te elit voluptua dignissim per, habeo iusto primis ea eam.
Lorem ipsum dolor sit amet, quo ei simul congue exerci, ad nec admodum perfecto mnesarchum, vim ea mazim fierent detracto. Ea quis iuvaret expetendis his, te elit voluptua dignissim per, habeo iusto primis ea eam.
Lorem ipsum dolor sit amet, quo ei simul congue exerci, ad nec admodum perfecto mnesarchum, vim ea mazim fierent detracto. Ea quis iuvaret expetendis his, te elit voluptua dignissim per, habeo iusto primis ea eam.
Lorem ipsum dolor sit amet, quo ei simul congue exerci, ad nec admodum perfecto mnesarchum, vim ea mazim fierent detracto. Ea quis iuvaret expetendis his, te elit voluptua dignissim per, habeo iusto primis ea eam.
Lorem ipsum dolor sit amet, quo ei simul congue exerci, ad nec admodum perfecto mnesarchum, vim ea mazim fierent detracto. Ea quis iuvaret expetendis his, te elit voluptua dignissim per, habeo iusto primis ea eam.
Lorem ipsum dolor sit amet, quo ei simul congue exerci, ad nec admodum perfecto mnesarchum, vim ea mazim fierent detracto. Ea quis iuvaret expetendis his, te elit voluptua dignissim per, habeo iusto primis ea eam.
Enter username and password to log on.
| Username | ||
| Password | ||
...or login with
Fill in the form below to get instant access.
Adopting 8th-Gen Intel Core i7 / i5 CPU w/ AMD Radeon Graphics, it can replace your full size tower.
Get up to 200-inch crisp HD image from our 3.5-inch projector. Stream content from all your devices.
100% Waterproof, Bluetooth 5, 32-Hour Battery, Ultra-High Def Speakers, Noise Cancellation Earbuds
Adopting 8th-Gen Intel Core i7 / i5 CPU w/ AMD Radeon Graphics, it can replace your full size tower.
Get up to 200-inch crisp HD image from our 3.5-inch projector. Stream content from all your devices.
100% Waterproof, Bluetooth 5, 32-Hour Battery, Ultra-High Def Speakers, Noise Cancellation Earbuds
Adopting 8th-Gen Intel Core i7 / i5 CPU w/ AMD Radeon Graphics, it can replace your full size tower.
Get up to 200-inch crisp HD image from our 3.5-inch projector. Stream content from all your devices.
100% Waterproof, Bluetooth 5, 32-Hour Battery, Ultra-High Def Speakers, Noise Cancellation Earbuds


I joined the ACCU about 6 years ago. At the time I was working at one of the large investment banks and was mourning the recent loss of the C/C++ Users Journal on the company’s chat system. I much prefer the paper based journals and, what with the demise of C++ Report and Windows Developer Journal in previous years too, my rucksack was getting lighter on my daily commute. Naturally the channel I posted on was about C/C++ and it was suggested that I take a look at the ACCU. Little did I know there was also a dedicated ACCU channel on that chat system too…
If someone had asked me in an interview, before joining the ACCU, how I rated myself as a programmer, out of ten, I’d probably have gone for a 7. I got a good start to my professional career working with smart people and in a culture where continuous learning was promoted. Various journals were circulated, as were books like Code Complete and Writing Solid Code. After leaving the company to go freelance I quickly realised I missed the journals and books and so took out my own subscriptions and started to build up my own library.
By the time I had joined the ACCU I felt pretty confident that I knew what I was doing. I had worked with plenty of people and at a few different organisations so felt I could gauge roughly where I sat on this hypothetical “programmer scale”. My focus had always been on learning the technology as that what was interested me most – my bookshelf was mostly filled with the collective works of Jeffrey Richter. Although I had been “doing OO and C++” for the last 10 years I actually didn’t own any of the fundamental C++ texts, such as Stroustrup or Josuttis, instead favouring the Essential and Exceptional book series as a paper form of Lint.
And then I started going to the monthly ACCU London meetings and tagging along to the lunches. There I got to put faces to some of the names in the chat window and meet some of the other members that had graced the pages of the journals I had started reading. Up to that point most of the articles and books I had read were written by US based authors, but now I was starting to come face-to-face with these people. That was scary, and yet obviously cool at the same time. What started to become apparent was that maybe I didn’t know quite as much as perhaps I thought I did. One particular conversation stands out as a watershed moment.
I had just been to see Paul Grenyer do his
Boiler Plating Database Resource Cleanup talk for ACCU London. As was the natural
order of things, we went to the pub afterwards to chat about the talk and other
stuff. I had just read Michael Feathers excellent book Working Effectively with
Legacy Code and so was keen to canvas opinion. I started talking to
And then I went to my first ACCU Conference in 2008. Before going I had definitely dropped a notch or two on the scale, but what the conference did was to magnify the effects of those branch meetings and lunches ten fold. The team I was currently working in were certainly as capable a bunch of programmers as any, but they weren’t all the passionate kind. Suddenly I found myself surrounded by like-minded individuals and quite a few authors of the books on my desk. Now we’re talking scary, but oh-so awesome too. Is it any wonder I didn’t go to bed for the next 4 nights for fear of missing out on another mind-blowing revelation?
By the end of my first conference, I was definitely down to a 3 or even 2. No, what I realised is that The Programmer Scale is not linear – it’s exponential! There is just so much more stuff to learn. I really hope that nobody actually asks me to rate myself in an interview because I’m not sure 2 is the answer they’re looking for and they probably don’t know what the far end of the scale looks like either.
What anyone who’s ever read one of my reviews of the ACCU conference will have hopefully picked up on, is that everyone there is so approachable and eager to share. Yes, we all have to earn a crust, but it doesn’t feel like you’re in competition with anyone else, instead it feels like everyone there wants to advance The Cause together, where that cause is to be the best programmer we can.
 Yes, there is a lot of new cool
technology to learn, but there are also the basics that we use every day and
yet might not fully appreciate. Hearing some “respected” individuals arguing at
Ah, yes, confidence. Some people seem to
have it in spades, almost to the point where a little humility wouldn’t go a
miss now and then. At the other end of the spectrum are those of us that need
constant validation and reassurance that we’re heading in the right direction,
or that we have a worthy contribution to make. The agile practitioners tell us
that face-to-face communication is worth so much more than a requirements
document, and so it is with learning.
As I write this my first proper article is about to be published in Overload. I started it well over 3 years ago, and even though I was pretty confident of the subject matter, I still felt uneasy about putting it forward. Instead I decided to take smaller steps, firstly by starting a blog and then by succumbing to “light pressure” from the C Vu editor and doing the write-ups for the ACCU London meets and annual conference. At the conference a couple of years ago I dipped my toe in the water and did a 5 min lightning talk which seemed to go down well. The following year I found myself hosting an ACCU London meet for 60 mins, and then doing a 90 min session at the conference a few months later. This year I’m presenting again and have started moving ideas from the “possible blog post list” to the “potential ACCU article list”.
After being a professional programmer for almost 20 years you’d have thought things would have settled down by now. And yet I’ve probably learnt more about programming in the last 10 years than during the first 10. I’ve certainly learnt more about myself, and look forward to learning even more about both.
I’m in no doubt that joining the ACCU has had a profound effect on both my career and my personality. That has only been possible because certain people put their time and effort into ensuring that the organisation continues to function and hopefully flourish. Sadly I only get to thank some of those in person once a year at the conference. Luckily though a few others I get to meet a little more regularly and two of those in particular have been instrumental in providing the reassurance I needed to get off my backside and start to explore my own potential. Perhaps it’s because they are the editors of the two ACCU publications that it gives them a license to cajole, coax and entice us into making a contribution. But you know what, that’s just what some of us need and for that, Fran & Steve, I thank you.
Chris Oldwood
30 January 2013
Bio
Chris started out as a bedroom coder in the 80s, writing assembler on 8-bit micros. These days it’s C++ and C# on Windows in big plush corporate offices. He is also the commentator for the Godmanchester Gala Day Duck Race and can be contacted via<EMAIL_ADDRESS>or @chrisoldwood.


Already have an account ?
Log In Here
Don't remember your password ?
Let us help
Don't have an account ?


Use find
instead of ls
to better handle non-alphanumeric filenames.
ls -l | grep " $USER " | grep '\.txt$'
NUMGZ="$(ls -l *.gz | wc -l)"
find . -maxdepth 1 -name '*.txt' -user "$USER" # Using the names of the files
gz_files=(*.gz)
numgz=${#gz_files[@]} # Sometimes, you just need a count
`
ls
is only intended for human consumption: it has a loose, non-standard format and may "clean up" filenames to make output easier to read.
Here's an example:
$ ls -l
total 0
-rw-r----- 1 me me 0 Feb 5 20:11 foo?bar
-rw-r----- 1 me me 0 Feb 5 2011 foo?bar
-rw-r----- 1 me me 0 Feb 5 20:11 foo?bar
It shows three seemingly identical filenames, and did you spot the time format change? How it formats and what it redacts can differ between locale settings, ls
version, and whether output is a tty.
ls
with find
ls
can usually be replaced by find
if it's just the filenames, or a count of them, that you're after. Note that if you are using ls
to get at the contents of a directory, a straight substitution of find
may not yield the same results as ls
. Here is an example:
$ ls -c1 .snapshot
rnapdev1-svm_4_05am_6every4hours.2019-04-01_1605
rnapdev1-svm_4_05am_6every4hours.2019-04-01_2005
rnapdev1-svm_4_05am_6every4hours.2019-04-02_0005
rnapdev1-svm_4_05am_6every4hours.2019-04-02_0405
rnapdev1-svm_4_05am_6every4hours.2019-04-02_0805
rnapdev1-svm_4_05am_6every4hours.2019-04-02_1205
snapmirror.1501b4aa-3f82-11e8-9c31-00a098cef13d_2147868328.2019-04-01_190000
versus
$ find .snapshot -maxdepth 1
.snapshot
.snapshot/rnapdev1-svm_4_05am_6every4hours.2019-04-02_0005
.snapshot/rnapdev1-svm_4_05am_6every4hours.2019-04-02_0405
.snapshot/rnapdev1-svm_4_05am_6every4hours.2019-04-02_0805
.snapshot/rnapdev1-svm_4_05am_6every4hours.2019-04-01_1605
.snapshot/rnapdev1-svm_4_05am_6every4hours.2019-04-01_2005
.snapshot/rnapdev1-svm_4_05am_6every4hours.2019-04-02_1205
.snapshot/snapmirror.1501b4aa-3f82-11e8-9c31-00a098cef13d_2147868328.2019-04-01_190000
You can see two differences here. The first is that the find
output has the full paths to the found files, relative to the current working directory from which find
was run whereas ls
only has the filenames. You may have to adjust your code to not add the directory to the filenames as you process them when moving from ls
to find
, or (with GNU find) use -printf '%P\n'
to print just the filename.
The second difference in the two outputs is that the find
command includes the searched directory as an entry. This can be eliminated by also using -mindepth 1
to skip printing the root path, or using a negative name option for the searched directory:
$ find .snapshot -maxdepth 1 ! -name .snapshot
.snapshot/rnapdev1-svm_4_05am_6every4hours.2019-04-02_0005
.snapshot/rnapdev1-svm_4_05am_6every4hours.2019-04-02_0405
.snapshot/rnapdev1-svm_4_05am_6every4hours.2019-04-02_0805
.snapshot/rnapdev1-svm_4_05am_6every4hours.2019-04-01_1605
.snapshot/rnapdev1-svm_4_05am_6every4hours.2019-04-01_2005
.snapshot/rnapdev1-svm_4_05am_6every4hours.2019-04-02_1205
.snapshot/snapmirror.1501b4aa-3f82-11e8-9c31-00a098cef13d_2147868328.2019-04-01_190000
Note: If the directory argument to find
is a fully expressed path (/home/somedir/.snapshot
), then you should use basename
on the -name
filter:
$ theDir="$HOME/.snapshot"
$ find "$theDir" -maxdepth 1 ! -name "$(basename $theDir)"
/home/matt/.snapshot/rnapdev1-svm_4_05am_6every4hours.2019-04-02_0005
/home/matt/.snapshot/rnapdev1-svm_4_05am_6every4hours.2019-04-02_0405
/home/matt/.snapshot/rnapdev1-svm_4_05am_6every4hours.2019-04-02_0805
/home/matt/.snapshot/rnapdev1-svm_4_05am_6every4hours.2019-04-01_1605
/home/matt/.snapshot/rnapdev1-svm_4_05am_6every4hours.2019-04-01_2005
/home/matt/.snapshot/rnapdev1-svm_4_05am_6every4hours.2019-04-02_1205
/home/matt/.snapshot/snapmirror.1501b4aa-3f82-11e8-9c31-00a098cef13d_2147868328.2019-04-01_190000
If trying to parse out any other fields, first see whether stat
(GNU, OS X, FreeBSD) or find -printf
(GNU) can give you the data you want directly. When trying to determine file size, try: wc -c
. This is more portable as wc
is a mandatory unix command, unlike stat
and find -printf
. It may be slower as unoptimized wc -c
may read the entire file rather than just checking its properties. On some systems, wc -c
adds whitespace to the file size which can be trimmed by double expansion: $(( $(wc -c < "filename") ))
If the information is intended for the user and not for processing (ls -l ~/dir | nl; echo "Ok to delete these files?"
) you can ignore this error with a [[directive]].


Telangana DGP promises ‘severest of punishment’ for woman officer’s killers after Vijaya Reddy burnt alive in her office
by JKR StaffTelangana Director General of Police (DGP) Mahender Reddy has termed the brutal killing of a woman tehsildar in the state a ‘barbaric’ act and said that her killers will face the wrath of law at the earliest.
Reddy said in a statement, “Condemn the brutal murder of Ms Vijaya, Tehsildar Abdullahpurmet.  We shall bring the culprit to book and ensure that the severest of punishment is awarded at the earliest. Justice will be rendered to victim and her family members.”
Vijaya Reddy, who was in her 30s, was allegedly burnt alive on Monday over a suspected land dispute. Quoting revenue officials, news agency PTI reported that Vijaya died on the spot with her suspected killers also sustaining burn injuries. They have been admitted in a hospital.
According to media reports, one local, identified as Suresh, entered Vijaya’s chamber on Monday afternoon when Vijaya Reddy was alone at her house. He poured petrol on her before setting her ablaze. and set her afire. “We heard a loud sound from Madam’s chamber and ran towards it and saw madam in flames. We tried to save her,” PTI quoted an eye-witness as saying.
A number of her colleagues staged a protest when Vijaya’s body was being taken to the hospital.


☰
Login
Join
Mentors
Sessions
Home
×
Home
Sessions
Mentors
Join
Login
LOGIN
Keep me signed in
Don't have account yet ?
×
Modal Header


Built in the memory of late Shri N T Rama Rao, former and one of the most popular chief ministers of Andhra Pradesh, NTR Memorial Gardens are one of the famous sightseeing places of Hyderabad. Spread across an area of 36 acres, NTR Gardens present a soothing atmosphere and refreshing setting to spend some time. The garden has been built with an approximate cost of Rs. 40 crore. It was in 2002, when the NTR garden of Hyderabad was opened to the public. The Garden offers various kinds of recreational options as well. Some of these are boat ride, Japanese garden, Roaring Cascade, a Fountain, etc. There is a Children's playing area that keeps kids entertained. The massive entrance plaza with Nandi Bulls is also quite captivating.
A mini train on a single track takes the visitors all around the garden making your visit all the more enjoyable. Along with toy train, there is a wide array of recreational facilities at the NTR Garden. One of the latest additions to the NTR garden is the Desert Garden, brian child of Mr. Nitish Roy, who has designed this project. It is consisted of about 150 plant varieties, mainly of those plans which are commonly referred as desert plants such as cacti, succulents, etc. The plants, which also boast of medicinal importance and are used for various herbal remedies, have been brought to Hyderabad from various parts of the country like Kolkata, Shirdi, etc. The garden has been created in such a way that it offers a breathtaking natural surroundings along with ample of entertaining activities. Excellent facilities for food are also provided at the garden. Various eat out joints, car cafe and fruit restaurant which is a 2000-square-metre restaurant circumvented by three petal-shaped ponds offer not just mouth watering dishes but also beautiful setting to relish the same. The Car Cafes are primarily cafes with seating capacity of six and which are mobile. This offers visitors unique cafe experiences.
Another attraction is the ‘Machan Restaurant’ which is a multi storeyed restaurant that has been built on a tree shape. The trunk has been built by using massive concrete planks while the branches are created with fiberglass and painted with green colour, giving it the look of a real tree. Also try out local food items from the various stalls such as mirchi bajji while relaxing amid the beauty of this garden. It is near to the popular Hussain Sagar Lake, which makes visit to the park even more enjoyable. One can visit the till 9 in night as the NTR Garden timings are from 12:30 am- 9:00 pm. The entry fee for NTR Garden is affordable to almost everyone. It is Rs. 15 per person for adults while Rs.10 per person for kids. If you are keen on clicking some photos then you have to pay a fee of rs.30 per camera. For video camera, the price is Rs. 65 per camera.


Chris York
CEO and Founder
Chris has over 24 years in enterprise system implementations and practice management including leading North American delivery for SAP Retail. His track record, leadership style, and communication ability brings our clients a superior level of confidence and trust.


New? Get started. learn teach learn to code interactively start coding right away create interactive courses teach millions how to code


Components
Float labels Pure CSS
Icon rotators
Spaced lists
- This
- defaut
- item list
- looks well.
- But
- sometimes
- items need
- more spacing.
- Especially
- when
- using
- unstyled lists.
Striped backgrounds
.bg-striped
.bg-faded.bg-striped
.bg-primary.bg-striped
.bg-success.bg-striped
.bg-info.bg-striped
.bg-warning.bg-striped
.bg-danger.bg-striped
.bg-inverse.bg-striped
Background glowers
.bg-inverse.bg-glow-top
.bg-inverse.bg-glow-center


Transact-SQL (T-SQL)
Q1. Which answer is NOT a type of table index?
- [ ] nonclustered
- [ ] unique
- [x] heap
- [ ] hash
Q2. The keywords AND, IN, LIKE, and between all belong to a category called what?
- [ ] joining operations
- [ ] linking operations
- [ ] criteria operations
- [x] logical operations
Q3. What is the result of this series of statements?
BEGIN TRY
SELECT 'Foo' AS Result;
END TRY
BEGIN CATCH
SELECT 'Bar' AS Result;
END CATCH
- [x] Foo
- [ ] FooBar
- [ ] Foo Bar
- [ ] Bar
Q4. Given these two tables, which query generates a listing showing student names and the department office location where you could reach each student?
- [ ] SELECT Students.first_name, Students.last_name, Departments.office_location FROM Students, Departments;
- [x] SELECT Students.first_name, Students.last_name, Departments.office_location FROM Students JOIN Departments ON Students.department = Departments.department;
- [ ] SELECT Students.first_name, Students.last_name, Departments.office_location FROM Students JOIN Departments;
- [ ] SELECT Students.first_name, Students.last_name, Departments.office_location FROM Students ON Students.department = Departments.department;
Q5. What is an example of a DDL command in SQL?
- [ ] TRUNCATE TABLE
- [ ] DELETE
- [ ] MERGE
- [x] DROP
Q6. Given the Games table pictured, which query generates the results shown?
- [ ] SELECT GameType, MaxPlayers, count(*) AS NumberOfGames FROM Games GROUP BY MaxPlayers, GameType ORDER BY MaxPlayers, GameType;
- [x] SELECT GameType, MaxPlayers, count(*) AS NumberOfGames FROM Games GROUP BY GameType, MaxPlayers ORDER BY GameType;
- [ ] SELECT GameType, count(Players) AS MaxPlayers, NumberOfGames FROM Games GROUP BY GameType, MaxPlayers ORDER BY GameType;
- [ ] SELECT GameType, MaxPlayers, count(*) AS NumberOfGames FROM Games GROUP BY GameType ORDER BY MaxPlayers;
Q7. Which answer is a possible result of the sequence of commands below?
DECLARE @UniqueID uniqueidentifier = NEWID();
SELECT @UniqueID AS Result;
- [ ] 1
- [x] bb261196-66a5-43af-815d-123fc593cf3a
- [ ] z350mpj1-62lx-40ww-9ho0-4u1875rt2mx4
- [ ] 0x2400001155F04846674AD4590F832C0
Q8. You need to find all students that are not on the "Chemistry Cats" team. Which query does NOT work for this task?
 You need to write a query that returns all Employees that have a LastName starting with the letter A. Which WHERE clause should you use to fill in the blank in this query?
- [ ] WHERE LastName = A*
- [ ] WHERE LastName = LIKE ‘%A%'
- [x] WHERE LastName LIKE ‘A%'
- [ ] WHERE LastName IN (‘A*')
Q10. Which query shows the first name, department, and team of all students with the two lowest points?
- [ ] SELECT LIMIT(2) first_name, department, team FROM Students ORDER BY points ASC;
- [ ] SELECT TOP(2) first_name, deprtment, team FROM Students ORDER BY points DESC;
- [x] SELECT TOP(2) WITH TIES first_name, department, team FROM Students ORDER BY points;
- [ ] SELECT BOTTOM(2) first_name, department, team FROM Students ORDER BY points ASC;
the picture of table is important here and there it can be seen that there are only two value with min points. Secondly, the previous answer was wrong because order by DESC will put highest points into the beginning of result list and TOP(2) will take first two highest points, and we need the lowest points.
Q11. What is the result of this statement?
SELECT FLOOR(-1234.321)
- [ ] -1234.3 - [ ] -1234 - [✅] -1235 - [ ] 1234.321
Q12. Which is the best approach to update the last name of the student Donette Figgins to Smith
- [ ] UPDATE Students SET last_name = ‘Smith' WHERE email =<EMAIL_ADDRESS>- [ ] UPDATE Students SET last_name = ‘Figgins' WHERE email =<EMAIL_ADDRESS>- [ ] UPDATE Students SET last_name = ‘Figgins' WHERE last_name = ‘Smith' AND first-name = ‘Donette';
- [x] UPDATE Students SET last_name = ‘Smith' WHERE last_name = ‘Figgins' AND first-name = ‘Donette';
Q13. Which of these data types is an approximate numeric?
- [x] real
- [ ] bit
- [ ] decimal
- [ ] numeric
Q14. You need to remove all data from a table name Products. Which query fully logs the removal of each record?
- [ ] TRUNCATE FROM Products *;
- [x] DELETE FROM Products;
- [ ] DELETE * FROM Products;
- [ ] TRUNCATE TABLE Products;
Q15. What is the result of the following query? SELECT 1 / 2 AS Result;
- [ ] 0.5
- [ ] error
- [x] 0
- [ ] 2
Q16. which data type will most efficiently store a person's age in years?
- [ ] float
- [ ] int
- [x] tinyint
- [ ] bigint
Q17. What is the result of this query?
SELECT 'abc\
def' AS Result;
- [x] abc\def
- [ ] abcdef
- [ ] error
- [ ] abc def
Q18. To select a random student from the table, which statement could you use?
- [x] SELECT TOP(1) first_name, last_name FROM Students ORDER BY NEWID();
- [ ] SELECT TOP(1) RAND(first_name, last_name) FROM Student;
- [ ] SELECT TOP(1) first_name, last_name FROM Student;
- [ ] SELECT TOP(1) first_name, last_name FROM RAND(Student);
https://www.petefreitag.com/item/466.cfm
Q19. What result is returned after executing the following commands?
DECLARE @MyVariable int;
SET @MyVariable = 1;
GO
SELECT @MyVariable;
- [x] error
- [ ] 1
- [ ] null
- [ ] @MyVariable
Q20. Which statement creates a new database schema named Sales and establish Sharon as the owner?
- [ ] ALTER USER Sharon WITH DEFAULT_SCHEMA = Sales;
- [ ] ALTER USER Sharon SET SCHEMA Sales;
- [x] CREATE SCHEMA Sales SET OWNER Sharon;
- [ ] CREATE SCHEMA Sales AUTHORIZATION Sharon;
Q21. The result of a CROSS JOIN between a table with 4 rows, and one with 5 rows, will give with ____ rows.
- [ ] 1024
- [x] 20
- [ ] 0
- [ ] 9
Q22. You need to write a query that returns all products that have a SerialNumber ending with "10_3". Which WHERE clause should you use to fill in the blank in this query?
SELECT ProductID, ProductName, SerialNumber
FROM Products______ ;
- [x]
WHERE SerialNumer LIKE '%10_3'
- [ ]
WHERE SerialNumer LIKE ('%10'+'_'+'3')
- [ ]
WHERE SerialNumer LIKE '%10"_"3'
- [ ]
WHERE SerialNumer LIKE '%10[_]3'
Q23. When no join type between multiple tables in a query's FROM clause is specified, what type of join is assumed?
- [x] INNER
- [ ] RIGHT
- [ ] LEFT
- [ ] FULL
Q24. How many bytes of storage does the int data type consume?
- [ ] 1 byte
- [ ] 2 bytes
- [x] 4 bytes
- [ ] 8 bytes
Q25. What does a RIGHT JOIN ensure?
- [ ] that only records from the rightmost table will be displayed
- [ ] that no records from the rightmost table are displayed if the records dont have corresponding records in the left table
- [ ] that records from the rightmost table will be displayed only if the records have a corresponding value in the leftmost table
- [x] that all records from the rightmost table are represented in the result, even if there are no corresponding records in the left table
Q26. You execute the following three queries. What is the result?
Create table students(id int identity(1000,1), firstname varchar(20),
lastname varchar(30));
insert into students(firstname,lastname)values('mark','twain');
select * from students;
[ ] studentid firstname lastname 1 1001 mark twain
[ ] studentid firstname lastname 1 1 mark twain
[x] studentid firstname lastname 1 1000 mark twain
[ ] studentid firstname lastname 1 null mark twain
Q27. Which Query returns all student names with the highest grade?
create table students( studentname varchar(50), grade int);
- [ ] select studentname from students where grade=max(grade); - [ ] select top(1) studentname from students order by grade; - [✅] select top(1) with ties studentname from students order by grade desc; - [ ] select studentname,max(grade) from students order by grade desc;
top(1) with ties will take the highest grade and all other students with the same grade (because they are order by grade) and matches the highest grade.
Q28. What role does "inventory" play?
select bookid, boooktitle, bookauthor,quantityonhand from inventory.books;
- [ ] you only want to see results from books currently in inventory - [✅] it instructs the query engine to find the books table in the inventory schema - [ ] it instructs the query engine to find the books table in the inventory database - [ ] it instructs the query engine to join the books table to the inventory schema
select * from dbo.books here dbo is a schema and the inventory is also schema; if we'd like to specify a database we should use db_name.schema_name.table_name


Logged in as {{.User.Name}}. Logout. Change course / lab. History.
Remember to click pause at the end of a pair programming session, otherwise the system will keep logging over lunch, over night or even over the weekend!


|
Bullet Collision Detection & Physics Library
|
Enabling USE_SEPDISTANCE_UTIL2 requires 100% reliable distance computation. More...
#include <btConvexConvexAlgorithm.h>
Classes | |
| struct | CreateFunc |
Additional Inherited Members | |
| Protected Member Functions inherited from btActivatingCollisionAlgorithm | |
| btActivatingCollisionAlgorithm (const btCollisionAlgorithmConstructionInfo &ci) | |
| btActivatingCollisionAlgorithm (const btCollisionAlgorithmConstructionInfo &ci, const btCollisionObjectWrapper *body0Wrap, const btCollisionObjectWrapper *body1Wrap) | |
| Protected Attributes inherited from btCollisionAlgorithm | |
| btDispatcher * | m_dispatcher |
Enabling USE_SEPDISTANCE_UTIL2 requires 100% reliable distance computation.
However, when using large size ratios GJK can be imprecise so the distance is not conservative. In that case, enabling this USE_SEPDISTANCE_UTIL2 would result in failing/missing collisions. Either improve GJK for large size ratios (testing a 100 units versus a 0.1 unit object) or only enable the util for certain pairs that have a small size ratio The convexConvexAlgorithm collision algorithm implements time of impact, convex closest points and penetration depth calculations between two convex objects. Multiple contact points are calculated by perturbing the orientation of the smallest object orthogonal to the separating normal. This idea was described by Gino van den Bergen in this forum topic http://www.bulletphysics.com/Bullet/phpBB3/viewtopic.php?f=4&t=288&p=888#p888
Definition at line 41 of file btConvexConvexAlgorithm.h.
| btConvexConvexAlgorithm::btConvexConvexAlgorithm | ( | btPersistentManifold * | mf, |
| const btCollisionAlgorithmConstructionInfo & | ci, | ||
| const btCollisionObjectWrapper * | body0Wrap, | ||
| const btCollisionObjectWrapper * | body1Wrap, | ||
| btConvexPenetrationDepthSolver * | pdSolver, | ||
| int | numPerturbationIterations, | ||
| int | minimumPointsPerturbationThreshold | ||
| ) |
cache separating vector to speedup collision detection
Definition at line 184 of file btConvexConvexAlgorithm.cpp.
|
virtual |
Definition at line 201 of file btConvexConvexAlgorithm.cpp.
|
virtual |
Rather then checking ALL pairs, only calculate TOI when motion exceeds threshold
Linear motion for one of objects needs to exceed m_ccdSquareMotionThreshold col0->m_worldTransform,
Convex0 against sphere for Convex1
Simplification, one object is simplified as a sphere
Sphere (for convex0) against Convex1
Simplification, one object is simplified as a sphere
Implements btCollisionAlgorithm.
Definition at line 792 of file btConvexConvexAlgorithm.cpp.
|
inlinevirtual |
should we use m_ownManifold to avoid adding duplicates?
Implements btCollisionAlgorithm.
Definition at line 69 of file btConvexConvexAlgorithm.h.
|
inline |
Definition at line 78 of file btConvexConvexAlgorithm.h.
|
virtual |
btBoxShape is an exception: its vertices are created WITH margin so don't subtract it
Implements btCollisionAlgorithm.
Definition at line 273 of file btConvexConvexAlgorithm.cpp.
| void btConvexConvexAlgorithm::setLowLevelOfDetail | ( | bool | useLowLevel | ) |
Definition at line 210 of file btConvexConvexAlgorithm.cpp.
|
private |
Definition at line 53 of file btConvexConvexAlgorithm.h.
|
private |
Definition at line 52 of file btConvexConvexAlgorithm.h.
|
private |
Definition at line 56 of file btConvexConvexAlgorithm.h.
|
private |
Definition at line 55 of file btConvexConvexAlgorithm.h.
|
private |
Definition at line 51 of file btConvexConvexAlgorithm.h.
|
private |
Definition at line 46 of file btConvexConvexAlgorithm.h.
|
private |
Definition at line 48 of file btConvexConvexAlgorithm.h.
|
private |
Definition at line 49 of file btConvexConvexAlgorithm.h.


Note: You can also set a hotkey through the Chrome settings page. Do this if other extensions are interfering with the Backtick hotkey, or vice versa.
Commands you or someone else create that aren't officially supported.
Learn how to create and add custom commands.Curated Commands created by the Backtick team or contributed and reviewed. These commands are considered safe and are officially supported.


Let's make your own bookshelf.
Add book
This work is licensed under a Creative Commons Attribution 4.0 International License.


QuoteFix is a plug-in for Mail.app which fixes some issues with replying to e-mail:
It also provides customized attributions for replies and forwards.
Before installing the plug-in, you'll need to make sure that Mail.app's plug-in support is turned on. For this, execute the following two commands in Terminal.app:
defaults write com.apple.mail EnableBundles -bool true
defaults write com.apple.mail BundleCompatibilityVersion -string 3
Next, perform the following steps:
~/Library/Mail/
Bundles
folder doesn't yet exist, create an
empty one
QuoteFix.mailbundle
into the Bundles
folderLastly, quit Mail.app if it's running, and start it up again.
In case you run into any problems, or want to
uninstall QuoteFix, just remove QuoteFix.mailbundle
from
the bundle-folder and restart Mail.app.
After installation, QuoteFix is enabled. It will perform its magic automatically when you reply to, or forward, messages.
The behaviour of the plug-in is customizable via its preferences. QuoteFix has it's own preference pane in the preferences window of Mail.app. Most preferences speak for themselves, or have a useful tooltip which pops up when you hover the cursor above it.
If you temporarily want to turn off QuoteFix, but don't want to
uninstall it, check off the QuoteFix is
enabled checkbox. As of version 2.3.1, (de)activating
QuoteFix can be done from a menu item in the Mail
menu. You could use the
standard way of assigning a keyboard shortcut to a menu item in
Mac OS X to enable or disable QuoteFix with a keyboard
shortcut.
QuoteFix also provides the ability to define your own attribution
lines (the first line of a reply/forward, usually looking something
like On SOME DATE, at SOME TIME, SOMEONE wrote:
).
Customized attributions work by way of templates: you define a template in the preferences, and parts of the template will – at the time of replying or forwarding – be replaced by values reflecting parts of the message you are replying to or forwarding.
Templating works by replacing template variables with values.
A template variable looks like this:
${VARIABLE}
. It will be replaced with a value
depending on what VARIABLE
contains.
A (non-exhaustive) list of variables you can use:
| ${message.from} |
Name and e-mail address of sender of message: Your Friend<EMAIL_ADDRESS>|
| ${message.from.name} |
Name of sender of message: Your Friend |
| ${message.from.email} |
E-mail address of sender of message<EMAIL_ADDRESS>|
| ${message.to} |
Your e-mail address (this is the address that was used for
the message to reach you). This is more like the
Delivered-To header than the To
header (for that, see ${message.recipients} )
|
| ${message.recipients} |
A list of all the recipients of the message, as mentioned in
both the To and Cc headers.
|
| ${message.recipients.to} |
A list of the recipients of the message mentioned in
the To header.
|
| ${message.recipients.cc} |
A list of the recipients of the message mentioned in
the Cc header.
|
| ${message.subject} | The subject of the message. |
|
${message.sent} ${message.received} |
Sent/received timestamps. If you want more finegrained
control over formatting timestamps, these variables split
into separate fields: year , month ,
day , hour , hour12 ,
ampm , minute , second ,
weeknumber , monthshort ,
monthlong , dayshort ,
daylong , date , time .Use these like so: ${message.sent.year} .
|
If you want even more freedom in formatting attribution lines, there's an experimental feature (which can be enabled in the Advanced preferences) which enables conditional statements, string/date formatting, and much more. This is based on a modified version of the pyratemp templating library for Python written by Roland Koebler.
A small example of what's possible:
From: ${message.from}
{% if message.recipients.to %}
To: ${message.recipients.to.join("; ", "name")}
{% end %}
{% if message.recipients.cc %}
Cc: ${message.recipients.cc.join("; ", "name")}
{% end %}
Subject: ${message.subject.lower()}
Sent-Date: ${message.sent.strftime("%d-%m-%Y")}
You can also enable HTML-formatting for your custom attributions. For this to work, the (outgoing) message format should be Rich Text. You can have QuoteFix automatically convert a message to Rich Text if your attribution should be interpreted in HTML. Otherwise, QuoteFix will issue a warning.
If you want to mimic the attribution generated by Outlook, try this
(with HTML-formatting enabled):
From: ${message.from}
Date: ${message.received}
To: ${message.to}
Subject: ${message.subject}
When you're editing your customized attribution, QuoteFix will generate an approximate preview as tooltip of the text field you're entering the attribution in.
If you want even more finegrained control over the formatting of
dates and times, you can enable "advanced templating" in the
Advanced preferences, after which date/time variables like
message.sent
and message.received
will
have .format
and .strftime
methods with
which you can format the output of the objects.
Functionally, these two methods perform the same operation — namely formatting date/time objects — the difference is in the formatting strings used:
.strftime
uses the common Unix function with
the same name for formatting. Look
here for more information.
.format
uses the Unicode date format patterns.
Look here for more information.
An example:
${message.sent.format("EEE MMM dd yyyy HH:mm:ss")}
This will output: Sun Nov 06 2011 10:19:34
However: the output will be generated in the current locale, which means that it will be formatted according to your local language settings. See below on how to use a different locale.
Similarly, with .strftime
:
${message.sent.strftime("%a %b %d %Y %H:%M:%S")}
Both methods accept a second argument: a locale identifier. You can use it to convert the output to a certain locale, instead of the default locale (which can be changed in the System Preferences of Mac OS X: Language & Text > Formats).
The same example as above, but with a different locale:
${message.sent.format("EEE MMM dd yyyy HH:mm:ss", 'fr_FR')}
The output: dim. nov. 06 2011 10:19:34
If you want the default format, just in a different locale,
use the .locale
method:
${message.sent.locale('fr_FR')}
QuoteFix has various ways of turning off its behaviour, short of uninstalling it:
Option
whilst
initiating a Reply/Forward action. That is:
Option
will enable QuoteFix for that particular message only;
Option
will disable QuoteFix for that particular message only;
See the Wiki for a list of frequently asked questions, and their answers.
This plugin is written by Robert Klep and is provided "as-is", without any warranties whatsoever.
QuoteFix' downloads and support is hosted by GitHub at https://github.com/robertklep/quotefixformac
QuoteFix uses the Sparkle framework from Andy Matuschak to provide software updates, which comes with the following permission notice:
See also http://sparkle.andymatuschak.org/


Symmetrical three phases systems of currents (or voltages) consists of three sinusoidal sine waves with an angular displacement of .
,
Electrical three phase machines have (usually) symmetrical three phase windings which excite spatial magnetic potential with a spacial displacement of - with respect to the fundamental wave, see [Laughton02]. Such a symmetrical three phase system of currents (or voltages) can be represented by phasors, as depicted in Fig. 1(a). The associated three phase winding is depicted in Fig. 2(a). The winding axis are displaced by :
So there is a strong coherence between angular displacement in the time and spatial domain which also applies to multi phase systems.
In symmetrical multi phase systems odd and even phase numbers have to be distinguished.
For a symmetrical multi phase system with phases the displacement in the time and spatial domain is , as depicted in Fig. 1 and 2.
Mathematically, this symmetry is expressed in terms of phase currents by:
The orientation of the winding axis of such winding is given by:
In the current implementation of the FundamentalWave library, phase numbers equal to the power of two are not supported. However, any other multi phase system with even an phase number, , can be recursively split into various symmetrical systems with odd phase numbers, as depicted in Fig. 3 and 4. The displacement between the two symmetrical systems is . A function for calculating the symmetricOrientation is available.
In a fully symmetrical machine, the orientation of the winding axes and the symmetrical currents (or voltages) phasors have different signs; see Fig. 1 and 2 for odd phase numbers and Fig. 3 and 4 for even phase numbers.