text stringlengths 1 22.8M |
|---|
Automated teller machines (ATMs) are targets for fraud, robberies and other security breaches. In the past, the main purpose of ATMs was to deliver cash in the form of banknotes, and to debit a corresponding bank account. However, ATMs are becoming more complicated and they now serve numerous functions, thus becoming a high priority target for robbers and hackers.
Introduction
Modern ATMs are implemented with high-security protection measures. They work under complex systems and networks to perform transactions. The data processed by ATMs are usually encrypted, but hackers can employ discreet hacking devices to hack accounts and withdraw the account's balance. As an alternative, unskilled robbers threaten bank patrons with a weapon to loot their withdrawn money or account.
Methods of looting ATMs
ATM vandals can either physically tamper with the ATM to obtain cash, or employ credit card skimming methods to acquire control of the user's credit card account. Credit card fraud can be done by inserting discreet skimming devices over the keypad or credit card reader. The alternative way to credit card fraud is to identify the PIN directly with devices such as cameras concealed near the keypad.
Security measures of ATMs
PIN validation schemes for local transactions
On-Line PIN validation
The validation of on-line PIN occurs if the terminal in question is connected to the central database. The PIN supplied by the customer is always compared with the recorded reference PIN in the financial institutions. However, one disadvantage is that any malfunction of the network renders the ATM unusable until it is fixed.
Off-Line PIN validation
In off-line PIN validation, the ATM is not connected to the central database. A condition for off-line PIN validation is that the ATM should be able to compare the customer's entered PIN against the PIN of reference. the terminal must be able to perform cryptographic operations and it must have the required encryption keys at its disposal.
The offline validation scheme is extremely slow and inefficient. Offline PIN validation is now obsolete, as the ATMs are connected to the central server over protected networks.
PIN validation for interchange transactions
There are three PIN procedures for the operation of a high-security interchange transaction. The supplied PIN is encrypted at the entry terminal, during this step, a secret cryptographic key is used. In addition to other transaction elements, the encrypted PIN is transmitted to the acquirer's system. Then, the encrypted PIN is routed from the acquirer's system to a hardware security module. Within it, the PIN is decrypted. With a cryptographic key used for interchange, the decrypted key is immediately re-encrypted and is routed to the issuer's system over normal communications channels. Lastly, the routed PIN is decrypted in the issuer's security module and then validated on the basis of the techniques for on-line local PIN validation.
Shared ATMs
There are different transaction methods used in shared ATMs with regards to the encipherment of PIN, and message authentication among them is so-called "zone encryption". In this method, a trusted authority is appointed to operate on behalf of a group of banks so they could interchange messages for ATM payment approvals.
Hardware security module
For successful communication between banks and ATMs, the incorporation of a cryptographic module, usually called a security module is a critical component in maintaining proper connections between banks and the machines. The security module is designed to be tamper resistant. The security module performs a plethora of functions, and among them is PIN verification, PIN translation in interchange, key management and message authentication. The use of PIN in interchanges is causing concerns in security as the PIN can be translated by the security module to the format used for interchange. Moreover, the security module is to generate, protect and maintaining all keys associated with the user's network.
Authentication and data integrity
The personal verification process begins with the user's supply of personal verification information. This information includes a PIN and the provided customer's information which is recorded on the bank account. In cases where there is a storage of a cryptographic key on the bank card, it is called a personal key (PK). Personal identification processes can be done by the authentication parameter (AP). It is capable of operating in two ways. The first option is where an AP can be time-invariant. The second option is where an AP can be time-variant. There is the case where there is an IP which is based on both time-variant information and on the transaction request message. In such a case where an AP can be used as a message authentication code (MAC), the use of message authentication is made recourse to find out stale or bogus messages which might be routed both into the communication path and the detection of modified messages which are fraudulent and which can traverse non-secure communication systems. In such cases, the AP serves two purposes.
Security
Security breaches in electronic funds transfer systems can be done without delimiting their components. Electronic funds transfer systems have three components; which are communication links, computers, and terminals (ATMs). First, communication links are prone to attacks. Data can be exposed by passive means or direct means where a device is inserted to retrieve the data. The second component is computer security. There are different techniques that can be used to acquire access to a computer such as accessing it via a remote terminal or other peripheral devices such as the card reader. The hacker had gained unauthorized access to the system, so programs or data can be manipulated and altered by the hacker. Terminal security is a significant component in cases where cipher keys reside in terminals. In the absence of physical security, an abuser may probe for a key that substitutes its value.
See also
ATMIA (ATM Industry Association)
References
External links
https://www.lightbluetouchpaper.org/ - Security Research, Computer Laboratory University of Cambridge
Data security
Automated teller machines |
The Guangzhou Ballet Troupe is a classical ballet company based in Guangzhou, China. In addition to works from the classical European ballet repertoire, the company performs works of classical and contemporary Chinese ballet. The company is one of the top four ballet companies in China. It was founded in 1974, and is currently headed by dancer Zhang Dandan. The company tours internationally.
History
Guangzhou Ballet was founded in 1974 by Zhang Dandan, a former dancer with the National Ballet of China. The current company has many members who are graduates from the Beijing Dance Academy. Notable dancers in the company include Zou Guang, Tong Shusheng, Zhang Dandan Guo Fei and Qiu Lu.
Members of the company are trained in the Vaganova method, following the tradition of Russian ballet introduced to China following the Communist Revolution. The Vaganova method has its origins at the Imperial Russian ballet in St. Petersburg.
Guangzhou Ballet is also involved in cultural exchanges with foreign ballet choreographers, dancers, and instructors. Foreign artists and ballet coaches from France, Canada, USA, Russia, Britain, Germany and Sweden have participated in projects with the Guangzhou Ballet Troupe.
Guangzhou Ballet School
Guangzhou Ballet School is a boarding school providing classes to students age 10 to 18. The school facilities include 16 studios, academic classrooms, a cafeteria, and a pointe shoe factory.
Repertoire
Guangzhou Ballet has staged many ballet classics including productions of Coppélia, Don Quixote, Le Corsaire, Swan Lake, La Sylphide, the Butterfly Lovers, ballet dramas Anna Karenina, La Traviata and Romeo and Juliet, and selected scenes from Amelia Goes to the Ball, in addition to works by Ramuntcho, Rachmaninov and Bartók. Contemporary foreign works performed by the Guangzhou Ballet include Theme and Variations and Serenade by George Balanchine.
Guangzhou Ballet has also staged the Chinese-style ballets That Day, This Moment, Lan Huahua, Goddess of the Luo River, and in 1997 The Celestial Phoenix, which won several awards from the Fifth China Drama Festival. Dancing over the Xiaoxiang River was staged in 1993 as a newly choreographed work. The Yellow River and The Dream of the Red Chamber are other Chinese ballet works performed by the company.
See also
Dance in China
References
Culture in Guangzhou
Ballet companies in China
Performing groups established in 1974 |
You Only Die Twice may refer to:
You Only Die Twice, an Israeli documentary film.
"You Only Die Twice", an episode from American TV series Scarecrow and Mrs. King
"You Only Die Twice", a 1984 Rogue Trooper story in British comic 2000 AD
You Only Die Twice, a novel by Ryan Hughes based on the video game Shadow Warrior
You Only Die Twice, a 2001 Britt Montero Series novel by Edna Buchanan
The Genius Files: You Only Die Twice, book 3 of the Genius Files series by American author Dan Gutman
See also
You Only Live Twice (disambiguation), a James Bond novel and film that most of the above titles reference |
```xml
export * from "./clear-clipboard";
export * from "./copy-to-clipboard-command";
export * from "./generate-password-to-clipboard-command";
``` |
Lamprobityle mariae is a species of beetle in the family Cerambycidae. It was described by Vives in 2009.
References
Apomecynini
Beetles described in 2009 |
Highland Oaxaca Chontal, or Chontal de la Sierra de Oaxaca, is one of the Chontal languages of Oaxaca, Mexico. It is sometimes called Tequistlatec, but is not the same as Tequistlatec proper, which is extinct.
Background
Highland Oaxaca Chontal (or Chontal de la Sierra de Oaxaca) is one of three Tequistlatecan languages family groups. The other two are Huamelultec (Lowland Oaxaca Chontal) and Tequistlatec (extinct). They are spoken or once spoken by the Chontal people of Oaxaca State, Mexico. Tequistlatecan language is also referred to as the Chontal of Oaxaca. The distinct breakdown in the dialect of the Chontal of Oaxaca is as follows: Highland Chontal (the mountainous terrain) and Lowland Chontal (of Pacific coast). The best way to hear and remember Highland Chontal is through the beautiful myths that the native speakers share, a method used by the locals to converse the language.
It was spoken by 4,400 people in 2010.
Phonology
Consonants
Highland Chontal has a medium-sized inventory of 23 native consonants, along with four borrowed consonants from Spanish /β ð ɾ r/. It distinguishes ejective consonants, including the cross-linguistically unusual ejective labiodental fricative /f'/.
Turner (1966) transcribes the ejective lateral affricate [] as an ejective fricative //. It is not clear whether the ejective labiodental fricative // might likewise be a phonetic affricate [p̪fʼ] or similar.
The placeless voiceless nasal /ɴ̥/ assimilates to the place of articulation of the consonant following it, e.g. /ɴ̥t/ > [n̥t]. Thus it has four allophones [m̥ n̥ ɲ̊ ŋ̊]. Its place of articulation before glottal consonants, vowels or pause is unclear, if it occurs in these environments at all.
Vowels
Highland Chontal has an inventory of five vowels, an arrangement similar to Spanish and many other world languages:
The distinction between /e/ and /a/ is neutralized before /j/.
There is no vowel hiatus (since all syllables begin with a consonant), nor any phonemic diphthongs.
In the Highland Chontal also has stressed vowels which are /í é á ó ú/.
Orthography
In Highland Chontal, phonemes correspond to orthographic conventions which are in angled brackets <>.
Syntax
The structure for highland Chontal is formatted but, not limited to: Verb-Subject-Object or VSO, another order is SVO. Rules for prefixes depend on the tense used,
Example: in the first-person plural for an object, if it is present in a sentence, it does not allow subject prefix. The order for certain words like adjectives and nouns can change, the examples below can be used for reference:
Suffixes
Identifying a singular person object in a sentence is marked by a suffix, plural objects in sentences are always suffixes.
Morphemes
The morpheme in the sentence structure determines which roots are used by verb stems. Readers can identify nouns in sentences by "limiters", these are described as prefixes. Limiters can be in a sentence structures as initial words and also be present if possession prefixes are present.
The Highland Chontal of Tequistlatecan has a complex system of verbal prefix system. According to Gregory Richter, the author of "Highland Chontal Morphology: Some New Perspectives", the current morphological structure for Highland Chontal is that there are distinct verb classes and they each have a set of corresponding prefixes. Highland Chontal can be differentiated from Lowland with its tense and subject prefixes, the sets of rules for prefixes in highland is not found with lowland chontal.
Morphological structure: VERB--> (NPST-) (PREFIX-) ROOT (-SUFFIX)
The tables above show the one to one correspondence between segments of a prefix and its underlying representation.
The table shows the changes in the paradigm of /inu/ (run) when appended to the particle /l/ (when).with yes/no are used by rising the pitch of speech in speaking. Examples:
Particles
Highland Chontal contains three main interrogative particles for inquiring more information, the particles are:
be- ‘where’, nai- ‘who’, and te ‘what’
LIM:limiter
RCT:recent
IMPF:imperfective
References
External links
Highland Oaxaca Chontal basic lexicon at the Global Lexicostatistical Database
Tequistlatecan languages
Endangered indigenous languages of the Americas |
```java
/*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
package com.haulmont.cuba.gui.model.impl;
import com.haulmont.cuba.gui.model.CollectionPropertyContainer;
import java.util.List;
/**
* Standard implementation of sorting {@link CollectionPropertyContainer}s.
*/
public class CollectionPropertyContainerSorter extends BaseContainerSorter {
public CollectionPropertyContainerSorter(CollectionPropertyContainer container) {
super(container);
}
@Override
public CollectionPropertyContainer getContainer() {
return (CollectionPropertyContainer) super.getContainer();
}
@SuppressWarnings("unchecked")
@Override
protected void setItemsToContainer(List list) {
getContainer().setDisconnectedItems(list);
}
}
``` |
The Melbourne University Regiment (MUR) is an officer training unit in the Australian Army Reserve (ARes). It has a depot at Grattan Street, Carlton, Melbourne, Australia.
History
MUR traces its origins to 1884 as D Company, 4th Battalion of the Victorian Rifles, also known as Mount Alexander Rifles, founded in Bendigo on 30 June 1858, at which time it was known as the University Company. General Sir John Monash was a Colour Sergeant of this unit before taking a commission in the colonial and later Commonwealth militia.
The unit became the Melbourne University Rifles in 1910, providing military training for members of Melbourne University and the public schools of Melbourne and Geelong.
As a University Regiment the unit did not deploy with the AIF in either of the world wars and as such, it carries no Battle Honours on its Colours. However, many officers and soldiers of AIF units had received their initial military training or commissions with the University Rifles. In 1927, the regiment adopted the motto of (I will grow by the praise of posterity), the same motto as the University itself.
During the Second World War the regiment was disbanded; this occurred in 1942. In the post-war structure of the Australian Army the University Rifles was reformed as the present Melbourne University Regiment, officially raised on 1 April 1948. In 1953, the regimental march – The Thin Red Line – was approved.
Post Plan Beersheba, Monash University Regiment (MonUR) was disbanded and adsorbed into MUR in 2013.
Currently, MUR is a unit of 8th Brigade (8 Bde) where its headquarters is located in Sydney. MUR is a direct command unit of 8 Bde and as part of the 2nd Division, responsible for training of ARes officer cadets (OCDTs) and other ranks (ORs). MUR consist of three sub-units, these are Monash Company, Herring Company and Rhoden Company. MUR conducts training at three separate facilities: OCDT training at the former Monash University Regiment (MonUR) depot in Mt Waverley, Regimental headquarters and training company located in the Grattan Street, Carlton depot and newly established RIC at Simpson Barracks at Watsonia. It is one of the busiest Reserve units in Victoria where it conducts training courses throughout the year.
Prominent former members of MUR
General Sir John Monash
Sir Robert Menzies, the former Australian Prime Minister and founder of the Liberal Party
Sir Ninian Stephen, the former judge of the High Court and Governor-General of Australia
Sir Henry Winneke, the former Chief Justice of the Supreme Court of Victoria and Governor of Victoria
Sir Rupert Hamer, the former Premier of Victoria.
Barry Humphries, the comedian
Notes
References
Further reading
Peacock, R.K. (n.d). Outline of History of Melbourne University Rifles 1884–1936
External links
https://www.army.gov.au
Melbourne University Regiment Memoirs updated
Melbourne University Regimental Association
Regiments of Australia
Military units and formations established in 1884 |
Doutreleau is a French surname. Notable people with the surname include:
Louis Doutreleau (1909–2005), French Jesuit priest
Stephen Doutreleau (1693–after 1747), French Jesuit missionary
Victoire Doutreleau (born 1934), French fashion model
French-language surnames |
Chenming Calvin Hu (; born 1947) is a Taiwanese-American electronic engineer who specializes in microelectronics. He is TSMC Distinguished Professor Emeritus in the electronic engineering and computer science department of the University of California, Berkeley, in the United States. In 2009, the Institute of Electrical and Electronics Engineers described him as a “microelectronics visionary … whose seminal work on metal-oxide semiconductor MOS reliability and device modeling has had enormous impact on the continued scaling of electronic devices”.
Education and career
Hu completed his bachelor's degree at the National Taiwan University in Taipei in 1968, and completed master's and doctoral degrees at the University of California, Berkeley in 1970 and 1973, respectively.
Currently Professor Emeritus, he has been a professor of electrical engineering and computer science at the University of California, Berkeley since 1976.
He has made significant contributions in microelectronics research. He was one of the developers of the FinFET, a multi-gated MOSFET device, and was among the creators of the Berkeley Short‐Channel IGFET Model family of MOSFETs. Since the 1980s, Hu has written extensively on the reliability of the silicon oxide layer in semi-conductors.
Hu was elected a member of the National Academy of Engineering in 1997 for contributions to the modeling integration-circuit devices and to the reliability and performance of VLSI systems.
Between 2001 and 2004 Hu was the chief technology officer of Taiwan Semiconductor Manufacturing Company. He has sat on the board of several companies, including Inphi Corporation, FormFactor, MoSys and SanDisk; he was chairman of the board of Celestry Design Solutions, which he founded.
Awards and honors
1997: elected to the United States National Academy of Engineering
1997: IEEE Jack Morton Award, "for outstanding contributions to semiconductor devices and technology"
2002: IEEE Solid-State Circuits Award (for developing the first international standard transistor model BSIM)
2002: IEEE Paul Rappaport Award
2009: IEEE Jun-ichi Nishizawa Medal, "for technical contributions to MOS device reliability, scaling of CMOS and compact device modeling"
2011: Asian American Engineer of the year award,
2011: National Taiwan University Distinguished Alumni Award,
2011: Semiconductor Industry Association Award,
2013: Phil Kaufman Award for Distinguished Contributions to EDA,
2014: National Medal of Technology and Innovation, given at the White House by Barack Obama in 2016.
2015: SEMI Award for North America, for the BSIM transistor family.
2016: Pan Wen Yuan Award, by the Industrial Technology Research Institute.
2020: IEEE Medal of Honor Award.
References
1947 births
Living people
Electrical engineering academics
Taiwanese emigrants to the United States
UC Berkeley College of Engineering alumni
Members of the United States National Academy of Engineering
UC Berkeley College of Engineering faculty
Foreign members of the Chinese Academy of Sciences
Taiwanese people from Beijing
Chinese emigrants to the United States
Engineers from Beijing
IEEE Medal of Honor recipients |
```css
/*!
* Font Awesome Free 6.6.0 by @fontawesome - path_to_url
*/
:root, :host {
--fa-style-family-classic: 'Font Awesome 6 Free';
--fa-font-solid: normal 900 1em/1 'Font Awesome 6 Free'; }
@font-face {
font-family: 'Font Awesome 6 Free';
font-style: normal;
font-weight: 900;
font-display: block;
src: url("../webfonts/fa-solid-900.woff2") format("woff2"), url("../webfonts/fa-solid-900.ttf") format("truetype"); }
.fas,
.fa-solid {
font-weight: 900; }
``` |
Zane Leo Scotland (born 17 July 1982) is an English professional golfer.
Scotland was born in Manchester and educated at The John Fisher School in Surrey. In 1997 he won a competition to find a British Tiger Woods. He went on to have a successful amateur career, winning several tournaments and gaining many representative honours, in addition to becoming the youngest English player ever to qualify for The Open Championship in 1999. He turned professional in 2003 but a car crash that resulted in an injury to his neck severely affected his early career.
Scotland finally earned his place on the European Tour by finishing inside the top 120 on the Order of Merit in 2007 despite having limited playing opportunities. However he failed to establish himself during his maiden season in 2008 and was back competing on the second tier Challenge Tour the following year. Scotland later played in lower-tier tours including PGA EuroPro Tour and the Dubai-based MENA Golf Tour, winning the MENA Tour's Order of Merit in 2013. Scotland played in the European Tour's Q School in 2013 and made it to the final stage, but finished 57th. Scotland has ten wins on the MENA Tour, the most by any player.
Scotland is the nephew of former Attorney General Baroness Scotland.
In March 2022, Scotland was appointed Diversity Ambassador to The Royal and Ancient Golf Club of St Andrews.
Amateur wins
2000 Peter McEvoy Trophy
Professional wins (11)
PGA EuroPro Tour wins (1)
MENA Tour wins (10)
Results in major championships
CUT = missed the halfway cut
"T" = tied
Note: Scotland only played in The Open Championship.
Team appearances
Amateur
European Youths' Team Championship (representing England): 2000 (winners), 2002
Jacques Léglise Trophy (representing Great Britain & Ireland): 1999 (winners), 2000 (winners)
St Andrews Trophy (representing Great Britain & Ireland): 2002 (winners)
References
External links
English male golfers
European Tour golfers
Golfers from London
Golfers from Manchester
People from Wallington, London
Sportspeople from the London Borough of Sutton
People educated at The John Fisher School
1982 births
Living people |
```java
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
package org.flowable.common.engine.impl.logging;
public interface CmmnLoggingSessionConstants {
String TYPE_CASE_STARTED = "caseStarted";
String TYPE_CASE_COMPLETED = "caseCompleted";
String TYPE_CASE_TERMINATED = "caseTerminated";
String TYPE_PLAN_ITEM_CREATED = "planItemCreated";
String TYPE_PLAN_ITEM_NEW_STATE = "planItemNewState";
String TYPE_SERVICE_TASK_ENTER = "serviceTaskEnter";
String TYPE_SERVICE_TASK_EXIT = "serviceTaskExit";
String TYPE_SERVICE_TASK_BEFORE_TRIGGER = "serviceTaskBeforeTrigger";
String TYPE_SERVICE_TASK_AFTER_TRIGGER = "serviceTaskAfterTrigger";
String TYPE_SERVICE_TASK_WRONG_TRIGGER = "serviceTaskWrongTrigger";
String TYPE_SERVICE_TASK_EXCEPTION = "serviceTaskException";
String TYPE_SERVICE_TASK_ASYNC_JOB = "serviceTaskAsyncJob";
String TYPE_SERVICE_TASK_EXECUTE_ASYNC_JOB = "serviceTaskExecuteAsyncJob";
String TYPE_SERVICE_TASK_LOCK_JOB = "serviceTaskLockJob";
String TYPE_SERVICE_TASK_UNLOCK_JOB = "serviceTaskUnlockJob";
String TYPE_HUMAN_TASK_CREATE = "humanTaskCreate";
String TYPE_HUMAN_TASK_SET_ASSIGNEE = "humanTaskSetAssignee";
String TYPE_HUMAN_TASK_SET_OWNER = "humanTaskSetOwner";
String TYPE_HUMAN_TASK_SET_GROUP_IDENTITY_LINKS = "humanTaskSetGroupIdentityLinks";
String TYPE_HUMAN_TASK_SET_USER_IDENTITY_LINKS = "humanTaskSetUserIdentityLinks";
String TYPE_HUMAN_TASK_COMPLETE = "humanTaskComplete";
String TYPE_EVALUATE_SENTRY = "evaluateSentry";
String TYPE_EVALUATE_SENTRY_FAILED = "evaluateSentryFailed";
String TYPE_VARIABLE_CREATE = "variableCreate";
String TYPE_VARIABLE_UPDATE = "variableUpdate";
String TYPE_VARIABLE_DELETE = "variableDelete";
String TYPE_COMMAND_CONTEXT_CLOSE = "commandContextClose";
String TYPE_COMMAND_CONTEXT_CLOSE_FAILURE = "commandContextCloseFailure";
}
``` |
Skyness is the second album by Dan Costa. Recorded in Italy, the album features several renowned artists, such as bossa nova icon Roberto Menescal, Romero Lubambo, Nelson Faria and Seamus Blake. It was considered "rare and luxurious" by All About Jazz.
Reception
All About Jazz praises the album for its "lovely melodies, sophisticated harmonies, and soulful contributions of seven world- class artists", while Raul da Gama from World Music Report considers Costa "deeply gifted". The track "Compelling (ft. Teco Cardoso)" was dubbed 'uplifting' and featured by JAZZIZ magazine in their summer album., while Leitão commends the album for "excellent music and exceptional artistic quality".
Track listing
"Prologue"
"Tempos Sentidos" (featuring Roberto Menescal & Jorge Helder)
"Compelling" (featuring Teco Cardoso)
"Lisbon Skyline" (featuring Custodio Castelo)
"Intracycle"
"Sete Enredos" (featuring Romero Lubambo)
"Iremia"
"Lume" (featuring Nelson Faria)
"Skyness" (featuring Seamus Blake)
Personnel
Piano, compositions, production - Dan Costa
Acoustic guitar - Roberto Menescal
Double bass - Jorge Helder
Flute - Teco Cardoso
Portuguese guitar - Custodio Castelo
Acoustic guitar - Romero Lubambo
Electric guitar - Nelson Faria
Tenor sax - Seamus Blake
References
2018 albums |
```xml
import _ from "lodash";
import seedrandom from "seedrandom";
import { describe, expect, test } from "vitest";
import * as ad from "../types/ad.js";
import { eqList, randList } from "../utils/Util.js";
import {
compile,
fns,
genGradient,
logAD,
problem,
variable,
} from "./Autodiff.js";
import {
add,
div,
ifCond,
lt,
max,
mul,
sin,
squared,
sub,
} from "./AutodiffFunctions.js";
describe("problem tests", () => {
const f = (x: ad.Num, y: ad.Num) => add(squared(sub(x, y)), squared(x));
test("no freeze", async () => {
const x = variable(1);
const y = variable(2);
const p = await problem({ objective: f(x, y) });
const run = p.start({}).run({});
expect(run.converged).toBe(true);
for (const [z, a] of run.vals) z.val = a;
expect(x.val).toBeCloseTo(0);
expect(y.val).toBeCloseTo(0);
});
test("freeze", async () => {
const x = variable(1);
const y = variable(2);
const p = await problem({ objective: f(x, y) });
const run = p.start({ freeze: (z) => z === x }).run({});
expect(run.converged).toBe(true);
for (const [z, a] of run.vals) z.val = a;
expect(x.val).toBe(1);
expect(y.val).toBeCloseTo(1);
});
});
describe("compile tests", () => {
test("no outputs", async () => {
const f = await compile([]);
const v = f((x) => x.val);
expect(v).toEqual([]);
});
test("simple", async () => {
const x = variable(3);
const y = variable(4);
const f = await compile([add(x, y), mul(x, y)]);
const v = f((x) => x.val);
expect(v).toEqual([7, 12]);
});
});
// df/f[x] with finite differences about xi
export const _gradFiniteDiff = (f: (args: number[]) => number) => {
return (xs: number[]): number[] => {
const EPSG = 10e-5;
// Scalar estimate (in 1D)
// const dfxi = (f, x) => (f(x + EPSG / 2.) - f(x - EPSG / 2.)) / EPSG;
const xsDiff = xs.map((e, i) => {
const xsLeft = [...xs];
xsLeft[i] = xsLeft[i] - EPSG / 2;
const xsRight = [...xs];
xsRight[i] = xsRight[i] + EPSG / 2;
return (f(xsRight) - f(xsLeft)) / EPSG;
});
return xsDiff;
};
};
const NUM_SAMPLES = 5; // Number of samples to evaluate gradient tests at
describe("symbolic differentiation tests", () => {
test("grad finite diff", () => testGradFiniteDiff());
test("graph 0", () => testGradSymbolic(0, gradGraph0()));
test("graph 1", () => testGradSymbolic(1, gradGraph1()));
test("graph 2", () => testGradSymbolic(2, gradGraph2()));
test("graph 3", () => testGradSymbolic(3, gradGraph3()));
test("graph 4", () => testGradSymbolic(4, gradGraph4()));
test("graph 5", () => testGradSymbolic(5, gradGraph5()));
test("graph 6", () => testGradSymbolic(6, gradGraph6()));
test("graph 7", () => testGradSymbolic(7, gradGraph7()));
});
//#region Functions for testing numeric and symbolic gradients
const assert = (b: boolean, s: any[]) => {
const res = b ? "passed" : "failed";
logAD.trace("Assertion", res, ": ", ...s);
return b;
};
const testGradFiniteDiff = () => {
const rng = seedrandom("testGradFiniteDiff");
// Only tests with hardcoded functions
const f = (ys: number[]) => _.sum(_.map(ys, (e: number) => e * e));
const df = (ys: number[]) => _.map(ys, (e: number) => 2 * e);
const testResults = [];
for (let i = 0; i < NUM_SAMPLES; i++) {
const xs = randList(rng, 4);
const gradEstRes = _gradFiniteDiff(f)(xs);
const expectedRes = df(xs);
const testRes = eqList(gradEstRes, expectedRes);
testResults.push(testRes);
}
testResults.forEach((result) => {
expect(result).toBeTruthy();
});
};
interface GradGraph {
inputs: ad.Var[];
output: ad.Num;
}
const gradGraph1 = (): GradGraph => {
// Build energy/gradient graph
const x0 = variable(-5);
const x1 = variable(6);
const a = sub(x0, x1);
const b = squared(a);
const c = sin(a);
const z = mul(b, c);
return { inputs: [x0, x1], output: z };
};
// Test addition of consts to graph (`c`)
const gradGraph2 = (): GradGraph => {
// Build energy/gradient graph
const x0 = variable(-5);
const x1 = variable(6);
const a = sub(x0, x1);
const b = squared(a);
const c = add(a, 3);
const z = mul(b, c);
return { inputs: [x0, x1], output: z };
};
// Test vars w/ no grad
const gradGraph3 = (): GradGraph => {
// Build energy/gradient graph
const x0 = variable(100);
const x1 = variable(-100);
const head = squared(x0);
return { inputs: [x0, x1], output: head };
};
// Test toPenalty
const gradGraph4 = (): GradGraph => {
// Build energy/gradient graph
const x0 = variable(100);
const head = fns.toPenalty(x0);
return { inputs: [x0], output: head };
};
// Test ifCond
const gradGraph5 = (): GradGraph => {
logAD.info("test ifCond");
// Build energy/gradient graph
const x0 = variable(100);
const x1 = variable(-100);
const head = ifCond(lt(x0, 33), squared(x1), squared(x0));
return { inputs: [x0, x1], output: head };
};
// Test max
const gradGraph6 = (): GradGraph => {
logAD.info("test max");
// Build energy/gradient graph
const x0 = variable(100);
const head = max(squared(x0), 0);
return { inputs: [x0], output: head };
};
// Test div
// TODO < Test all ops automatically
const gradGraph7 = (): GradGraph => {
logAD.info("test div");
// Build energy graph
const x0 = variable(100);
const x1 = variable(-100);
const head = div(x0, x1);
return { inputs: [x0, x1], output: head };
};
const makeFunc = async (
g: GradGraph,
): Promise<(xs: number[]) => { output: number; gradient: number[] }> => {
const f = await genGradient(g.inputs, [g.output], []);
return (xs: number[]) => {
const masks = {
inputMask: g.inputs.map(() => true),
objMask: [true],
constrMask: [],
};
const grad = new Float64Array(g.inputs.length);
const { phi } = f(masks, new Float64Array(xs), 0, grad);
return { output: phi, gradient: Array.from(grad) };
};
};
// Compile the gradient and check it against numeric gradients
// TODO: Currently the tests will "fail" if the magnitude is greater than `eqList`'s sensitivity. Fix this.
const testGradSymbolic = async (
testNum: number,
graph: GradGraph,
): Promise<void> => {
const rng = seedrandom(`testGradSymbolic graph ${testNum}`);
// Synthesize energy and gradient code
const f0 = await makeFunc(graph);
const f = (xs: number[]) => f0(xs).output;
const gradGen = (xs: number[]) => f0(xs).gradient;
// Test the gradient at several points via evaluation
const gradEst = _gradFiniteDiff(f);
const testResults = [];
for (let i = 0; i < NUM_SAMPLES; i++) {
const xsTest = randList(rng, graph.inputs.length);
const gradEstRes = gradEst(xsTest);
const gradGenRes = gradGen(xsTest);
const testRes = eqList(gradEstRes, gradGenRes);
testResults.push(testRes);
}
testResults.forEach((result) => {
expect(result).toBeTruthy();
});
};
const gradGraph0 = (): GradGraph => {
// Build energy/gradient graph
// f(x) = x^2, where x is 100
// Result: (2 * 100) * 1 <-- this comes from the (new) parent node, dx/dx = 1
const ref = variable(100);
const head = squared(ref);
// Print results
logAD.trace(
"computational graphs for test 1 (input, output, gradient)",
ref,
head,
);
return { inputs: [ref], output: head };
};
//#endregion
``` |
Tauranga is a New Zealand parliamentary electorate, returning one Member of Parliament to the New Zealand House of Representatives. The current MP for Tauranga is Sam Uffindell of the National Party, who won the seat in the 2022 Tauranga by-election, following the resignation of the previous MP, Simon Bridges of the National Party.
Population centres
The previous electoral redistribution was undertaken in 1875 for the 1875–1876 election. In the six years since, New Zealand's European population had increased by 65%. In the 1881 electoral redistribution, the House of Representatives increased the number of European representatives to 91 (up from 84 since the 1875–76 election). The number of Māori electorates was held at four. The House further decided that electorates should not have more than one representative, which led to 35 new electorates being formed, including Tauranga, and two electorates that had previously been abolished to be recreated. This necessitated a major disruption to existing boundaries.
The electorate includes Tauranga, Mt Maunganui and Omanu Beach, but excluding Hairini, Maungatapu, Matapihi and Welcome Bay.
History
Tauranga electorate was created for the 1881 election, which determined the composition of the 8th Parliament. Initially, it existed until the 1890 election and during that time, it was represented by four MPs.
The 1881 election was hotly contested. Four candidates were nominated: George Morris, who had previously represented the electorate; George Vesey Stewart, then the owner of the Bay of Plenty Times; William Kelly, who had also previously represented the East Coast electorate; and Henry Thomas Rowe, a surveyor and commission agent. Rowe announced his retirement from the contest on 6 December three days out from election day, urging his supporters to vote for Stewart instead. The unofficial results were released the day after the election (Saturday, 10 December) and Morris had a majority of 13 votes over Stewart, with the official declaration to be made on 12 December. This was deferred until 14 December, with Morris ahead by 10 votes. Stewart stood for the Tauranga mayoralty a few months later and was elected the town's first mayor.
Morris was re-elected in the , but resigned in April 1885, as he had been appointed to the Legislative Council. The resulting by-election on 22 May was won by John Sheehan, who died on 12 June 1885. The second by-election on 11 July was won by Lawrence Grace, who represented the electorate until the end of the term in 1887. The was won by William Kelly, who represented the electorate until the end of the term in 1890, at which time the electorate was abolished.
The electorate was recreated in 1908. William Herries was the first representative, elected at the ; he had since the represented the electorate. He became a member of the Reform Party when it formed itself in the following year. Herries represented the electorate until his death on 22 February 1923.
The resulting by-election was won by Charles MacMillan, who also represented the Reform Party. MacMillan won the three subsequent general elections before he was beaten in the by Labour's Charles Burnett. At the next election held in , Burnett was beaten by National's Frederick Doidge, who held the electorate until his retirement in 1951.
Doidge was succeeded by George Walsh, who won the . Walsh served for seven terms and retired in 1972. Keith Allen was the next representative, first elected in and an MP until his death shortly before the .
Allen's death did not cause a by-election, as it occurred within six months of the next general election. The 1984 election was won by Winston Peters, who had previously represented the electorate. In 1990 until March 1991, Peters was Minister of Māori Affairs, but he was sacked from Cabinet by Prime Minister Jim Bolger in October 1991 after repeatedly criticising his National Party leadership. Peters remained as a National backbencher, continuing to criticise the party. In late 1992, when the National Party was considering possible candidates for the elections in the following year, it was decided that Peters would not be allowed to seek renomination for the Tauranga electorate. Peters unsuccessfully challenged this decision in the High Court, and in early 1993, he chose to resign from the party and from Parliament. This prompted a by-election in Tauranga some months before the scheduled general election. Peters stood as an independent and won with over 90% of the vote, assisted by the major parties not standing candidates against him. Shortly before the 1993 election, Peters established New Zealand First and retained the Tauranga electorate. He continued to represent Tauranga until he was defeated in the by National's Bob Clarkson.
Clarkson's defeat of Winston Peters was significant, as this resulted in New Zealand First losing its only electorate seat. The party still gained parliamentary representation by polling over the five percent threshold, however. Clarkson retired at the end of the parliamentary term. He was succeeded by National's Simon Bridges, who won the , with Peters coming a distant second. Bridges was re-elected in .
Members of Parliament
Key
List MPs
Members of Parliament elected from party lists in elections where that person also unsuccessfully contested the Tauranga electorate. Unless otherwise stated, all MPs terms began and ended at general elections.
Election results
2022 by-election
2020 election
2017 election
2014 election
2011 election
Electorate (as at 26 November 2011): 48,133
2008 election
2005 election
2002 election
1999 election
1996 election
1993 election
1993 by-election
1990 election
1987 election
1984 election
1981 election
1978 election
1975 election
1972 election
1969 election
1966 election
1963 election
1960 election
1957 election
1954 election
1951 election
1949 election
1946 election
1943 election
1938 election
1935 election
1931 election
Table footnotes:
1928 election
Table footnotes:
1923 by-election
1919 election
1881 election
Table footnotes
References
Bibliography
External links
Electorate profile, Parliamentary Library
New Zealand electorates
Tauranga
1881 establishments in New Zealand
1908 establishments in New Zealand
1890 disestablishments in New Zealand
Politics of the Bay of Plenty Region |
Zera Yisrael ( "Seed [of] Israel"), known also as Zera Kadosh ("Seed [of] Holiness") is a legal category in Halakha that denotes the blood descendants of Jews who, for one reason or another, are not legally Jewish according to religious criteria. This is usually due to a lack of matrilineal Jewish ancestry.
Who is Zera Yisrael
Patrilineal Jews
Traditionally, Rabbinic Judaism has understood Jewishness to be passed down matrilineally. Although contemporary denominations have varying precedents regarding lineal descent, Orthodox and Conservative Judaism that only those born from a Jewish mother are considered to be Jewish by birth. Because of this, those born to a Jewish father and a gentile mother are considered to be Zera Yisrael by religiously conservative sects of Judaism, though they may be considered Jewish by religiously liberal sects, especially if they were raised Jewish and identify as such.
Although Rabbinic Judaism follows matrilineal lines to determine an individual's Jewish status, there is evidence to suggest that this was a shift that occurred during the second century, and that pre-diaspora Judaism was patrilineal. Some small and formerly isolated ethnic groups of Jews, such as the Kaifengs and Beta Israel, have traditionally practiced a patrilineal form of Judaism. While many have assimilated into the mainstream matrilinealism of Rabbinic Judaism, the Karaite movement of Judaism continues to reject maternal lines in favor of paternal ones. Individuals from these circles may also be considered patrilineal Jews or Zera Yisrael, if they fail to prove an unbroken maternal chain.
Bnei Anusim
Bnei Anusim ( "children [of the] forced ones") is a Hebrew term referring to the descendants of Jews who were forced to conceal their Jewish identity or convert to a different religion. While broadly referring to anyone with such lineage, it specifically pertains to the Sephardic Bnei Anusim, and has developed conceptually alongside a movement for the descendants of conversos and Crypto-Jews to reconnect with their Jewish ancestry. Other groups, such those descended from the Jews of the Soviet Union, may be considered halakhically similar to the Bnei Anusim.
Others
Other individuals with insufficient ancestry can be considered Zera Yisrael. This includes, for example, someone with one Jewish grandparent.
Religious significance
Mysticism
Zera Yisrael have often been ascribed a level of spiritual significance in Judaism, mostly within the realm of Kabbalistic thought. It has been claimed by practitioners of Judaism that those with undiscovered Jewish ancestry have a natural affinity for the religion, and that reconnecting with their Jewish heritage serves as a method of redeeming the holy Lurianic sparks that have fallen into the material world. They are said to already have Jewish-adjacent souls, and contribute to the fulfillment of the ingathering of the exiles.
Chassidic Rabbi Zadok HaKohen wrote in his work Resisei Layla that "the root of the soul of the seed of Israel can never be upended". According to him, Isaiah was talking about Zera Yisrael when he spoke of the "lost ones" prophesized to join the Jewish people. This idea has been referenced frequently among contemporary Jewish theologians that tackle the topic of Zera Yisrael and descendants of Jews.
Conversion efforts
Because of the unique status of Zera Yisrael in Jewish theology, as well as their growing prominence in Israel, some rabbis (such as Isser Yehuda Unterman, Chaim Ozer Grodzinski, David Tzvi Hoffman, Benzion Uziel, and Haim Amsalem) have suggested adopting more lenient policies that allow people descended from Jews to convert with only a basic understanding and acceptance of Jewish law. In addition to securing an unambiguous religious status as Jewish, a conversion accepted by the Israeli government would also serve the pragmatic purposes of allowing the converts protections under Israeli law, such as marriage rights.
Despite criticism from opponents, there have been cases of pro forma conversions for Zera Yisrael, as well as rabbinical authorities declaring groups of them halakhically Jewish. An alternative suggestion has been to convert gentile mothers of Zera Yisrael children, so as to "keep the children in the Jewish fold."
See also
Anusim
Crypto-Judaism
Ten Lost Tribes
Who is a Jew?
Jewish adjacent
References
External links
Zera Israel Foundation Official Website
Ethno-cultural designations
Jewish genetics
Jewish law
Judaism-related controversies |
```xml
<?xml version="1.0" encoding="utf-8"?>
<shape xmlns:android="path_to_url"
android:shape="oval"
android:useLevel="false">
<solid android:color="#000000" />
<size
android:width="20dp"
android:height="20dp" />
</shape>
``` |
The transmission disequilibrium test (TDT) was proposed by Spielman, McGinnis and Ewens (1993) as a family-based association test for the presence of genetic linkage between a genetic marker and a trait. It is an application of McNemar's test.
A specificity of the TDT is that it will detect genetic linkage only in the presence of genetic association.
While genetic association can be caused by population structure, genetic linkage will not be affected, which makes the TDT robust to the presence of population structure.
The case of trios: one affected child per family
Description of the test
We first describe the TDT in the case where families consist of trios (two parents and one affected child). Our description follows the notations used in Spielman, McGinnis & Ewens (1993).
The TDT measures the over-transmission of an allele from heterozygous parents to affected offsprings.
The n affected offsprings have 2n parents. These can be represented by the transmitted and the non-transmitted alleles and at some genetic locus. Summarizing the data in a 2 by 2 table gives:
The derivation of the TDT shows that one should only use the heterozygous parents (total number b+c).
The TDT tests whether the proportions b/(b+c) and c/(b+c) are compatible with probabilities (0.5, 0.5).
This hypothesis can be tested using a binomial (asymptotically chi-square) test with one degree of freedom:
Outline of the test derivation
A derivation of the test consists of using a population genetics model to obtain the expected proportions for the quantities and in the table above. In particular, one can show that under nearly all disease models the expected proportion of and are identical. This result motivates the use of a binomial (asymptotically ) test to test whether these proportions are equal.
On the other hand, one can also show that under such models the proportions and are not equal to the product of the marginals probabilities , and , . A rewording of this statement would be that the type of the transmitted allele is not, in general, independent of the type of the non-transmitted allele. A consequence is that a test for homogeneity/independence does not test the appropriate hypothesis, and thus, only heterozygous parents are included.
Extension to two affected child per family
Extension of the test
The TDT can be readily extended beyond the case of trios. We keep following the notations of Spielman, McGinnis & Ewens (1993). Consider a total of heterozygous parents. We use the fact that the transmission to different children are independent. The information can be then summarized in three categories:
= number of parents who transmit to both children.
= number of parents who transmit to one child and to another.
= number of parents who transmit to both children.
Using the notations of the previous paragraph we have:
leading to the chi-squared test statistic:
Relation with another linkage statistic
The comparison with the more traditional (at least at the time when the TDT was proposed) linkage test proposed by Blackwelder and Elston 1985 is informative.
The Blackwelder and Elston approach uses the total number of haplotypes identical by descent (mean haplotype sharing). This measure ignores the allelic state of a marker and simply compares the number of times a parent transmits the same allele to both affected children with the number of times a different allele is transmitted.
The test statistic is:
Under the null hypothesis of no linkage the expected proportions of (i, h − i − j, j) are (0.25, 0.5, 0.25). One can derive a simple chi-square statistic with 2 degrees of freedom:
It clearly appears that the total statistic (with two degree of freedom) is the sum of two independent components: one is the traditional linkage measure and the other is the TDT statistic.
Modified version
More recently, Wittkowski KM, Liu X. (2002/2004) proposed a modification to the TDT that can be more powerful under some alternatives, although the asymptotic properties under the null hypothesis are equivalent.
The motivating idea for this modification is the fact that, while the transmissions of both allele from parents to a child are independent, the effects of other filial genetic or environmental covariates on penetrance are the same for both alleles transmitted to the same child. This situation can be important if, for example, the genetic marker is linked to a disease locus with a strong selection against heterozygous individuals. This observation suggests to shift the statistical model from a set of independent transmissions to a set of independent children (see Sasieni (1997) for the corresponding problem in case-control association tests). While this observation does not affect the distribution under the null hypothesis of no linkage, it allows, for some disease models, to design a more powerful test.
In this modified TDT test the children are stratified by parental type and the modified test statistic becomes:
where is the number of PQ children from parents with the PQ and QQ types.
Software for computing TDT
Beagle
References
Genetics |
In literary criticism, stream of unconsciousness is a narrative mode that portrays an individual's point of view by transcribing the author's unconscious dialogue or somniloquy during sleep, in connection to their actions within a dream.
Stream of unconsciousness is characterized by disjointed leaps in ideation and story line, bizarre new word creation, loss of self-censorship, one sided conversations and punctuation that can make the prose both disturbing and difficult to follow. Despite the name, the stream of unconsciousness occurs more in the form of waves than an actual continuous running stream of dialogue. The stream of unconsciousness is one of several forms of dramatic monologue, where the speaker is addressing an audience or a third person. Such monologues are commonly used in poetry and drama, but with the stream of unconsciousness, the audience or third persons are 'unknowingly' imaginary. It is primarily a fictional device and often takes the form of a tragedy. The term was introduced to the field of literary studies from that of the independent music industry, where it was defined by author and artist Bryan Lewis Saunders in 2005. For nearly a century the term has been both a misnomer and a malapropism for the stream of consciousness.
History
The audio recordings of Dion McGregor (1922–1994) can be perceived as one of the precursors of the 'stream of unconsciousness' (narrative mode), although his monologues and somniloquy were never transcribed and presented as such. "Dreams" (1995) by contemporary American artist Jim Shaw is a collection of illustrations and extremely detailed dream descriptions. "Experiment with Dreams" by Leif Elggren and Thomas Liljenberg (Stockholm Feb. 1996) may also be attributed to the formation of this method.
Notable works
Examples of notable works employing the stream of unconsciousness narrative mode are:
"Le Bobcat" Bryan Lewis Saunders and Raymond Dijkstra. Short Story on Cassette (Fragment Factory 2010)
"The Reasons Why I Dream With Knives" Bryan Lewis Saunders. Nonfiction Book (Stand-Up Tragedy 2010)
"The Confessor" is a book on tape composed of 24 album chapters on 12 audio cassettes. With each album serving as a chapter, over 24 musicians and experimental sound artists created music for the unconscious epic poem by Bryan Lewis Saunders. "The Confessor" was created from app. 30 nights of somniloquy and dream descriptions. Poem and Book on Tape (Stand-Up Tragedy 2011)
"Protective Geometry" Ed Pinsent and Bryan Lewis Saunders. Comic Book. (2012)
References
External links
Glossolalia Episode 5: Recent Sleep Works
Bryan Lewis Saunders Sleep Works
Experiment with Dreams
Dion McGregor Discogs
Narrative techniques
Narratology
Fiction
Style (fiction)
Poetry movements |
Geart Aeilco Wumkes or G.A. Wumkies (4 September 1869, Joure – 7 May 1954, Huizum) was a Protestant West Frisian language Bible translator, historian, and preacher of the Dutch Reformed Church.
Major work
His major work was the translation of the Bible into West Frisian, with the New Testament (West Frisian: Nije Testamint) being published in 1933 and the Old Testament (West Frisian: Alde Testamint) in 1943. The Old Testament was completed with the help of E. B. Folkertsma. The complete Bible (West Frisian: Bibel) was published in 1943.
Other translations
In 1953 he translated John Bunyan's The Pilgrim's Progress into West Frisian: De Pylgerreize.
External links
Wumkes.nl mei ûnder oaren de Stads- en Dorpskroniek (West Frisian)
Dutch Calvinist and Reformed theologians
People from Skarsterlân
Translators of the Bible into Frisian
1869 births
1954 deaths |
Stephanie McMillan (born 1965) is an American political cartoonist, editorialist, and activist from South Florida. A granddaughter of the German commercial animator Hans Fischerkoesen and the sister of Alexander Fischerkoesen, McMillan aspired to become a cartoonist from the age of ten. During her high school years, she began organizing protests against capitalism and imperialism. The Comics Journal describes McMillan's comics and cartoons as being "on the far left" of the American political spectrum, and as being focused on "anti-corporate activism."
Early life and career
McMillan graduated from the Tisch School of the Arts at New York University in 1987 with a BFA in film. During her time at NYU, she studied animation under Richard Protovin and John Canemaker, and received an award for her student film. In 1992, McMillan was offered her first professional cartooning opportunity as an editorial assistant at XS- magazine/City Link, an alt-newsweekly. By 1999, McMillan began self-syndicating her cartoons, as well as providing exclusive comic features and illustrations for hundreds of publications worldwide. Her work has appeared in many publications, including the Los Angeles Times, Daily Beast, South Florida Sun-Sentinel, Yes! Magazine, Comic Relief, Amarillo Globe-News, Funny Times, Yahoo.com, and the San Francisco Bay Guardian.
Beyond her professional cartooning, McMillan has been an organizer against capitalism and imperialism all her life. The groups she has worked with include One Struggle, Refuse and Resist!, the Occupy movement throughout the country, U.S. Hands Off the Haitian People's Coalition, and the Revolutionary Communist Youth Brigade. In 2012, McMillan won the Robert F. Kennedy Journalism Award for Editorial Cartoonists for her work as a political cartoonist.
McMillan’s daily comic strip, Minimum Security, was syndicated online at Universal Uclick’s gocomics.com in the early 2010s. From 2009 to 2011, McMillan also drew Code Green, a weekly editorial cartoon that focused "exclusively on the environmental emergency." McMillan has been an editor and designer for The Notebook (Association of American Editorial Cartoonists), and does freelance illustration and writing. Her own books include Capitalism Must Die! A Basic Introduction: What capitalism is, why it sucks, and how to crush it (INIP—Idées Nouvelles Idées Prolétariennes, 2014), The Beginning of the American Fall (Seven Stories Press, 2012), and As The World Burns: 50 Simple Things You Can Do to Stay in Denial with Derrick Jensen (Seven Stories Press, 2007).
Books
2012 — Capitalism Must Die! A Basic Introduction: What capitalism is, why it sucks, and how to crush it (text with comics), INIP (Idées Nouvelles Idées Prolétariennes)
2013 — The Minimum Security Chronicles: Resistance to Ecocide (graphic novel), Seven Stories Press
2012 — The Beginning of the American Fall (comics journalism about the Occupy protests), Seven Stories Press
2012 — The Knitting Circle Rapist Annihilation Squad (novel with Derrick Jensen), PM Press/Flashpoint
2010 — Mischief in the Forest: A Yarn Yarn (children’s book with Derrick Jensen), PM Press/Flashpoint
2010 — Pendant Que la Planète Flambe (French edition of As the World Burns), La Boîte à Bulles
2009 — Excessive Force (anthology), Last Hours, UK
2007 — As the World Burns: 50 Simple Things You Can Do to Stay in Denial (graphic novel with Derrick Jensen), Seven Stories Press (Nominated by National Library Association as a Great Graphic Novel for Teens, 2008)
2005 —Attitude Presents Minimum Security (cartoon collection), NBM Publishing
2002 — Attitude: The New Subversive Cartoonists (anthology), NBM Publishing
Various textbooks, and several books in the Opposing Viewpoints series by Gale Publishing Group
Awards
2012 — Robert F. Kennedy Journalism Award for Editorial Cartoons
2011 — Scripps Howard Award for Editorial Cartooning (Finalist)
2010 — Sigma Delta Chi Award for editorial cartoons, Society of Professional Journalists
2010 — Press Action Cartoonist of the Year
2008 — Press Action Dynamic Dozen
2005 and 2003 — First Place, Excellence in Postal Union Journalism, APWU National Postal Press Association
2000 — Honorable Mention, Creative Resistance Contest, Adbusters
1997 and 1994 — First Place, General Excellence in Editorial Cartooning, Florida Press Club
1996 — Second Place, General Excellence in Artist Illustration, Florida Press Club
References
External links
Official website
Profile at Editorialcartoonists.com
Onestrugglesouthflorida.wordpress.com
1965 births
Living people
Activists from Florida
American anti-capitalists
American social activists
American women cartoonists
Political artists
Tisch School of the Arts alumni
Date of birth missing (living people)
Place of birth missing (living people)
American cartoonists |
```smalltalk
/*
This file is part of the iText (R) project.
Authors: Apryse Software.
This program is offered under a commercial and under the AGPL license.
For commercial licensing, contact us at path_to_url For AGPL licensing, see below.
AGPL licensing:
This program is free software: you can redistribute it and/or modify
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
along with this program. If not, see <path_to_url
*/
using System;
using System.Collections.Generic;
using iText.Kernel.Geom;
using iText.StyledXmlParser.Css.Pseudo;
using iText.StyledXmlParser.Node;
using iText.Test;
namespace iText.StyledXmlParser.Css.Page {
[NUnit.Framework.Category("UnitTest")]
public class PageMarginBoxContextNodeTest : ExtendedITextTest {
[NUnit.Framework.Test]
public virtual void DefaultBehaviourTest() {
String marginBoxName = "someName";
PageMarginBoxContextNode pageMarginBoxContextNode = new PageMarginBoxContextNode(new PageContextNode(), marginBoxName
);
NUnit.Framework.Assert.AreEqual(marginBoxName, pageMarginBoxContextNode.GetMarginBoxName());
NUnit.Framework.Assert.AreEqual(PageMarginBoxContextNode.PAGE_MARGIN_BOX_TAG, pageMarginBoxContextNode.Name
());
NUnit.Framework.Assert.Catch(typeof(NotSupportedException), () => pageMarginBoxContextNode.GetLang());
NUnit.Framework.Assert.IsNull(pageMarginBoxContextNode.GetAdditionalHtmlStyles());
NUnit.Framework.Assert.Catch(typeof(NotSupportedException), () => pageMarginBoxContextNode.AddAdditionalHtmlStyles
(new Dictionary<String, String>()));
IAttributes attributes = pageMarginBoxContextNode.GetAttributes();
NUnit.Framework.Assert.IsNotNull(attributes);
NUnit.Framework.Assert.AreEqual(0, attributes.Size());
String someKey = "someKey";
String someValue = "someValue";
NUnit.Framework.Assert.Catch(typeof(NotSupportedException), () => attributes.SetAttribute(someKey, someValue
));
NUnit.Framework.Assert.IsNull(attributes.GetAttribute(someKey));
NUnit.Framework.Assert.IsNull(pageMarginBoxContextNode.GetAttribute(someKey));
NUnit.Framework.Assert.IsNull(pageMarginBoxContextNode.GetContainingBlockForMarginBox());
Rectangle someRectangle = new Rectangle(100, 100);
pageMarginBoxContextNode.SetContainingBlockForMarginBox(someRectangle);
NUnit.Framework.Assert.AreEqual(someRectangle, pageMarginBoxContextNode.GetContainingBlockForMarginBox());
NUnit.Framework.Assert.IsNull(pageMarginBoxContextNode.GetPageMarginBoxRectangle());
Rectangle someRectangle2 = new Rectangle(200, 200);
pageMarginBoxContextNode.SetPageMarginBoxRectangle(someRectangle2);
NUnit.Framework.Assert.AreEqual(someRectangle2, pageMarginBoxContextNode.GetPageMarginBoxRectangle());
}
[NUnit.Framework.Test]
public virtual void ParentNotPageTest() {
// Create some invalid node
PageContextNode pageContextNode = new PageContextNode();
CssPseudoElementNode pseudoElementNode = new CssPseudoElementNode(pageContextNode, "test");
// Pass this mode to the constructor
Exception e = NUnit.Framework.Assert.Catch(typeof(ArgumentException), () => new PageMarginBoxContextNode(pseudoElementNode
, "test"));
NUnit.Framework.Assert.AreEqual("Page-margin-box context node shall have a page context node as parent.",
e.Message);
}
}
}
``` |
Johnson is a village in the town of Johnson in Lamoille County, Vermont, United States. The population was 1,332 at the 2020 census.
Geography
According to the United States Census Bureau, the village has a total area of 1.2 square miles (3.2 km2), all land.
Demographics
As of the census of 2000, there were 1,420 people, 469 households, and 186 families residing in the village. The population density was 1,166.9 people per square mile (449.4/km2). There were 494 housing units at an average density of 406.0/sq mi (156.3/km2). The racial makeup of the village was 95.63% White, 0.92% Black or African American, 0.07% Native American, 1.34% Asian, 0.28% from other races, and 1.76% from two or more races. Hispanic or Latino of any race were 1.06% of the population.
There were 469 households, out of which 20.9% had children under the age of 18 living with them, 25.6% were married couples living together, 10.9% had a female householder with no husband present, and 60.3% were non-families. 39.4% of all households were made up of individuals, and 12.6% had someone living alone who was 65 years of age or older. The average household size was 2.11 and the average family size was 2.88.
In the village, the population was spread out, with 13.2% under the age of 18, 46.4% from 18 to 24, 20.1% from 25 to 44, 11.9% from 45 to 64, and 8.4% who were 65 years of age or older. The median age was 22 years. For every 100 females, there were 99.7 males. For every 100 females age 18 and over, there were 100.8 males.
The median income for a household in the village was $23,846, and the median income for a family was $40,089. Males had a median income of $25,104 versus $19,861 for females. The per capita income for the village was $11,651. About 8.3% of families and 23.6% of the population were below the poverty line, including 18.8% of those under age 18 and 15.4% of those age 65 or over.
References
Incorporated villages in Vermont
Johnson
Villages in Lamoille County, Vermont |
This is a list of people named after Abraham, the Biblical patriarch ( Ashkenazi Avrohom or Avruhom); the father of the Abrahamic religions: Judaism, Christianity and Islam.
As recounted in the Torah, his name was originally Avram which means "High Father" - "ab" (אב) "father", "ram" (רם) "high" - with the "ha" (ה) added in mark of his covenant with God.
In the Russian language, the name is used in the following forms: (Avraam), (Avraamy), (Avramy), (Abram), (Abramy), (Avram), (Obram), and (Abrakham).
Given name
Abraham of Kashkar, Mar Abraham I, bishop of the Church of the East (148–171 AD)
Abraham (Egyptian saint), martyred in Egypt with John of Samanoud and James of Manug
Saint Abraham (Ethiopian), a saint of the Ethiopian Orthodox Tewahedo Church, part of the martyrs Abraham, Ethnus, Acrates, James, and John venerated in Ethiopia as saints
Abraham (Persian saint), 4th century Christian saint, martyred with Sapor of Bet-Nicator
Abraham of Arbela (died c. 348), Syrian bishop, martyr, and saint
Abraham of Arazd, 5th century Armenian Christian priest, hermit, and saint 5th century Armenian Christian priest, hermit, and saint
Abraham of Bet-Parsaje, 4th century Persian Christian saint, martyred with Mana of Bet-Parsaje
Abraham of Clermont (died c.485), Syrian-French abbot, founder of the abbey of St. Cirgues in Clermont
Abraham of Cyrrhus (died 442), Syrian-born, Anatolian Roman Catholic saint
Abraham of Egypt, a monk and saint of the Coptic Church
Abraham of Farshut or Abraham (Copt) (lived 5th or 6th century), a saint of the Coptic Church
Abraham of the High Mountain (died 446), 5th century Christian saint
Abraham of Kiev, a monk and Ukrainian Roman Catholic saint
Abraham of Kratia (c.474–c.558), a Christian monk and saint
Mar Abraham, a saint of the Syriac Orthodox Church
Abraham of Nethpra, a 6th century saint of the Assyrian Church of the East
Abraham of Scetes, a monk and saint of the Coptic Church
Abraham the Great of Kaskhar, (492–586), saint and monastic reformer of the Assyrian Church of the East
Abraham the Great of Kidunja (died c.366), a Christian hermit, priest and saint
Abraham the Writer, a saint of the Syrian Orthodox Church
Abraha, a variant form, King of Saba'
9th to 13th centuries
Pope Abraham of Alexandria (died 978), Syrian Coptic Pope
Abraham II (Nestorian patriarch), Patriarch of the Church of the East from 837 to 850
Abraham III (Nestorian patriarch), Abraham III Abraza, Patriarch of the Church of the East from 906 to 937
Abraham of Bulgaria (died 1229), a Russian convert from Islam to Eastern Orthodoxy, martyr, Christian saint
Abraham of Miroshsk (died 1158), abbot of the Holy Redeemer monastery in Pskow
Abraham of Strathearn (died 1220s), Catholic bishop of Dunblane
Abraham of Smolensk (died 1221), Russian Eastern Orthodox monk and saint
Abraham bar Hiyya (1070–1145), Jewish mathematician, astronomer and philosopher
Abraham ben David (~1125–1198), Provençal rabbi, author and critic
Abraham ibn Daud (~1110–~1180), Spanish-Jewish astronomer, historian, and philosopher
Abraham ibn Ezra (1089–1164), Spanish-Jewish philosopher, astronomer/astrologer, mathematician, poet, and linguistics scholar
14th to 17th centuries
Abraham of Angamaly (died c. 1597) (Mar Abraham), Church of the East bishop
Abraham Angermannus (died 1607), Swedish Lutheran archbishop
Abraham a Sancta Clara (1644–1709), Austrian Augustinian friar
Abraham von Franckenberg (1593–1652), German mystic, author, poet and hymn-writer
Abraham of Galich (died 1375), saint and founder of four Russian monasteries
Abram Petrovich Gannibal (1696–1781), African slave
Abraham and Coprius of Griasowetzk (for Abraham of Griasowetzk), 15th century abbot and saint
Abraham the Laborious, a 14th century monk and saint of Ukraine
Abraham Paleostrowski (died c. 1460), an abbot and saint of the Russian Orthodox Church
Ignatius Abraham bar Gharib (), Syriac Orthodox patriarch of Mardin
18th to 19th centuries
Abraham II of Armenia or Abraham Khoshabetzi, Catholicos of the Armenian Apostolic Church between 1730 and 1734
Abraham III of Armenia or Abraham of Crete or Abraham Kretatsi (d. 1737), Catholicos of the Armenian Apostolic Church between 1734 and 1737
Abraham Abraham (1843–1911), American department store magnate
Abraham Abramson (c.1753–1811), Prussian coiner
Abraham H. Cannon (1859–1896), American Latter-day Saint apostle
Abraham Cole (died 1890), American politician
Abraham Greenberg (1881–1941), American lawyer and politician
Abraham Hatfield (1867–1957), American businessman, philanthropist, and philatelist
Abraham Hochmuth (1816–1889), Hungarian rabbi
Avraham Kalmanowitz (1891–1964), European Rav, founder and rosh yeshiva of Mir yeshiva in Brooklyn
Abraham Khalfon (1741–1819), Tripoli Jewish community leader, historian, and paytan
Abraham Lansing (1835–1899), American lawyer and politician in New York
Abraham Lincoln (1809–1865), U.S. President
Abraham Robertson (1751–1826), English mathematician
Abraham Barak Salem (1882–1967), Indian Jewish lawyer, independence activist, and Zionist
Abraham "Bram" Stoker (1847–1912), Irish novelist best known for his novel Dracula
Abraham Van Vorhes (1793–1879), American politician
Abraham O. Woodruff (1872–1904), American Latter-day Saint apostle
Avrohom Yaakov Friedman (first Sadigura rebbe) (1820–1883)
Avrohom Yaakov Friedman (third Sadigura rebbe) (1884–1961)
20th century to present
Abraham Almonte (born 1989), Dominican baseball player
Abraham Bankier (1910–1956), Polish Jewish businessman who helped with Oskar Schindler's wartime rescue activities
Avraham Even-Shoshan (1906–1984), Israeli Hebrew linguist and lexicographer
Abraham Beame (1906–2001), first Jewish mayor of New York City
Abraham Beem (1934–1944), Dutch Jewish child gassed to death in Auschwitz concentration camp
Abraham Blum (1905–1943), Polish-Jewish activist
Abram Cohen (1924–2016), American Olympic fencer
Abraham Cykiert (1926–2009), Australian Holocaust survivor and Melburnian playwright and Zionist activist of the 1970s
Abraham González Casanova (born 1985), Catalan (Spanish) association football player
Abraham Goodman, known as Abby Mann (1927–2008), American film writer and producer
Abraham Gutt (born 1944), Israeli basketball player
Abraham Joshua Heschel (1907–1972), Polish-American rabbi, philosopher and Jewish theologian
Abraham Hoffman (1938-2015), Israeli basketball player
Abraham Kurland (1912–1999), Danish Olympic medalist in wrestling
Abraham Lucas (born 1998), American football player
Abraham Lunggana (1959–2021), Indonesian politician
Abraham Maslow (1908–1970), American psychologist
Abraham Mateo, Spanish actor and pop singer
Abraham Nava (born 1964), Mexican association football player
Abraham Olano (born 1970), Spanish former professional cyclist
Abraham Razack (born 1945), a legislative councillor in Hong Kong
Abraham Robinson (1918–1974), Jewish mathematician, the founder of non-standard analysis
Abraham Roqueñi (born 1978), Spanish kickboxer
Abraham Samad (born 1966), Indonesian lawyer
Abraham Shakespeare (1966–2009), lottery winner and apparent murder victim
Avraham Shlonsky (1900–1973), Israeli poet and editor
Abraham Shneior (1928–1998), Israeli Olympic basketball player
Abraham Tokazier (1909–1976), Finnish sprinter
Abraham Toro (born 1996), Canadian baseball player
Abraham Torres (born 1968), Venezuelan boxer
Abraham Wickelgren (born 1969), American lawyer
Avrohom Yaakov Friedman (fifth Sadigura rebbe) (1928–2013)
Abraham Zangen, Israeli scientist
See also
Abiram
References
Notes
Sources
В. А. Никонов (V. A. Nikonov). "Ищем имя" (Looking for a Name). Изд. "Советская Россия". Москва, 1988.
Н. А. Петровский (N. A. Petrovsky). "Словарь русских личных имён" (Dictionary of Russian First Names). ООО Издательство "АСТ". Москва, 2005.
[1] А. В. Суперанская (A. V. Superanskaya). "Современный словарь личных имён: Сравнение. Происхождение. Написание" (Modern Dictionary of First Names: Comparison. Origins. Spelling). Айрис-пресс. Москва, 2005.
[2] А. В. Суперанская (A. V. Superanskaya). "Словарь русских имён" (Dictionary of Russian Names). Издательство Эксмо. Москва, 2005.
English-language masculine given names
English masculine given names
Masculine given names
Danish masculine given names
Dutch masculine given names
French masculine given names
Finnish masculine given names
German masculine given names
Hebrew masculine given names
Icelandic masculine given names
Irish masculine given names
Norwegian masculine given names
Scottish masculine given names
Spanish masculine given names
Swedish masculine given names |
```smalltalk
The source code in this file is covered under a dual-license scenario:
- RCL: for OPC Foundation Corporate Members in good-standing
- GPL V2: everybody else
This source code is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
*/
using System;
using System.Collections.Generic;
using System.Text;
namespace Opc.Ua
{
partial class ExclusiveLimitStateMachineState
{
#region Initialization
/// <summary>
/// Initializes the object as a collection of counters which change value on read.
/// </summary>
protected override void OnAfterCreate(ISystemContext context, NodeState node)
{
base.OnAfterCreate(context, node);
UpdateStateVariable(context, Objects.ExclusiveLimitStateMachineType_High, CurrentState);
UpdateTransitionVariable(context, 0, LastTransition);
}
#endregion
#region Overridden Members
/// <summary>
/// The table of states belonging to the state machine.
/// </summary>
protected override ElementInfo[] StateTable
{
get { return s_StateTable; }
}
/// <summary>
/// A table of valid states.
/// </summary>
private ElementInfo[] s_StateTable = new ElementInfo[]
{
new ElementInfo(Objects.ExclusiveLimitStateMachineType_HighHigh, BrowseNames.HighHigh, 1),
new ElementInfo(Objects.ExclusiveLimitStateMachineType_High, BrowseNames.High, 2),
new ElementInfo(Objects.ExclusiveLimitStateMachineType_Low, BrowseNames.Low, 3),
new ElementInfo(Objects.ExclusiveLimitStateMachineType_LowLow, BrowseNames.LowLow, 4)
};
/// <summary>
/// The table of transitions belonging to the state machine.
/// </summary>
protected override ElementInfo[] TransitionTable
{
get { return s_TransitionTable; }
}
/// <summary>
/// A table of valid transitions.
/// </summary>
private ElementInfo[] s_TransitionTable = new ElementInfo[]
{
new ElementInfo(Objects.ExclusiveLimitStateMachineType_HighHighToHigh, BrowseNames.HighHighToHigh, 1),
new ElementInfo(Objects.ExclusiveLimitStateMachineType_HighToHighHigh, BrowseNames.HighToHighHigh, 2),
new ElementInfo(Objects.ExclusiveLimitStateMachineType_LowLowToLow, BrowseNames.LowLowToLow, 3),
new ElementInfo(Objects.ExclusiveLimitStateMachineType_LowToLowLow, BrowseNames.LowToLowLow, 4)
};
/// <summary>
/// The mapping between transitions and their from and to states.
/// </summary>
protected override uint[,] TransitionMappings
{
get { return s_TransitionMappings; }
}
/// <summary>
/// A table of the to and from states for the transitions.
/// </summary>
private uint[,] s_TransitionMappings = new uint[,]
{
{ Objects.ExclusiveLimitStateMachineType_HighHighToHigh, Objects.ExclusiveLimitStateMachineType_HighHigh, Objects.ExclusiveLimitStateMachineType_High, 0 },
{ Objects.ExclusiveLimitStateMachineType_HighToHighHigh, Objects.ExclusiveLimitStateMachineType_High, Objects.ExclusiveLimitStateMachineType_HighHigh, 0 },
{ Objects.ExclusiveLimitStateMachineType_LowLowToLow, Objects.ExclusiveLimitStateMachineType_LowLow, Objects.ExclusiveLimitStateMachineType_Low, 0 },
{ Objects.ExclusiveLimitStateMachineType_LowToLowLow, Objects.ExclusiveLimitStateMachineType_Low, Objects.ExclusiveLimitStateMachineType_LowLow, 0 }
};
#endregion
}
}
``` |
Elise Ringen (born 21 November 1989) is a Norwegian former biathlete.
Her greatest achievements include a bronze medal in the relay at the 2012 World Championships, and a World Cup victory in the relay in Hochfilzen during the 2011–12 season.
Ringen retired after the 2015–16 season.
Biathlon results
All results are sourced from the International Biathlon Union.
Olympic Games
World Championships
1 medal (1 bronze)
*During Olympic seasons competitions are only held for those events not included in the Olympic program.
References
External links
1989 births
Living people
Norwegian female biathletes
Biathletes at the 2014 Winter Olympics
Olympic biathletes for Norway
Biathlon World Championships medalists
21st-century Norwegian women |
```swift
//
// WebCodeBuilder+createGetTextAction.swift (Detox)
// Created by Asaf Korem (Wix.com) on 2024.
//
/// Extends `WebCodeBuilder` with the ability to create a web get text action JS code.
extension WebCodeBuilder {
/// Creates a JS code that gets the text of an given element.
func createGetTextAction(selector: String) -> String {
return """
((element) => {
if (!element) {
throw new Error('Element not found');
}
return element.textContent.length > 0 ? element.textContent : element.value;
})(\(selector));
"""
}
}
``` |
The Reformed Evangelical Church of Indonesia (; ), abbreviated GRII, also Indonesian Reformed Evangelical Church, is a Reformed Christian church that is headquartered in Jakarta, Indonesia. It was founded by Stephen Tong, a Chinese-born Indonesian evangelist.
History
Andrew Gih of the Evangelize China Fellowship established the Southeast Bible Seminary in Malang, East Java in 1952, and Tong graduated from it in 1961, establishing the church in 1989 following many years of preaching and evangelism.
Timeline
In 1974 Tong conducts seminars in Surabaya and 2 years later become a guest lecturer in China Evangelical Seminary.
Later in 1984 turned to Jakarta to uphold the Spirit of Reformed and Evangelical theology. Two years later in 1986 he was the co-founder of Reformed Evangelical School of Theology in Jakarta and Surabaya, and library and printing station that provides Christian Books.
In 1989 Tong founded the Institute of Reformed Evangelical Indonesia the LRII, which become Gereja Reformed Injili Indonesia.
1991 - 2007 Tong serves as Rector in the Reformed Evangelical Divinity School in indonesia
In 1996 Stephen Tong become the chairman of the church Synod and in 1998 heserved as a Rector in The Reformed Institute in Indonesia
In 2008 Tong received an honorary degree from Westminster Theological Seminary in Philadelphia, PA.
Stephen Tong founded the Reformed Evangelical Church of Indonesia in 1989 to establish a Reformed theology-based church and congregations who are committed to evangelism.
The GRII is headquartered in the Reformed Millennium Center, in Sawah Besar, Jakarta, where it has its largest church, the Messiah Cathedral. It has congregations in other major cities in Indonesia, as well as in Singapore, Malaysia, Australia, China, Taiwan, Germany and the USA.
Beliefs
The church subscribes to the Reformed confessions generally accepted by Reformed churches, but it has its own unique confession of faith.
Some churches use the Westminster Confession of Faith and the Heidelberg Catechism.
Church organization
Stephen Tong is currently the Head of Synod of the Reformed Evangelical Church of Indonesia.
The Reformed Evangelical Church of Indonesia and its affiliated institutions have female evangelists, lecturers, and church council members. They are allowed to preach and assume authoritative roles, although they are not ordained.
Benyamin Intan, pastor, is a member of the board of directors for the World Reformed Fellowship.
FIRES (Fellowship of Indonesian Reformed Evangelical Students) lead by Preacher Edward Oei.
STEMI (Stephen Tong Evangelistic Ministries International) lead by Preacher Stephen Tong as movement to reach international community in Christ.
Recent issues
Stephen Tong has preached the Gospel to 1,5 million Indonesians in 2012. According to the International Evangelism Fellowship's adaptation of the press release by the Indonesian Evangelical Reformed Church until November 2012 the Reformed Evangelical Church's sermons have reached 1,5 millions.
700 preaching assemblies that was led by Stephen Tong were held. In October 200,000 people were able to hear the Gospel. The church reaped great evangelisation work in 2012.
Indonesia is populated by about 250 million people, in which the majority are Muslims. Thus, evangelisation there is a long process. As Pastor Tong noted, if the GRII preaches to 1 million people per year it would take 218 years for all Indonesians to hear the Gospel.
Therefore, he urged the church to not be proud of its accomplishments, because there is great distance towards the evangelisation of the entire country.
In a four-days evangelistic outreach in December 2012 Tong preached in the Messiah Cathedral in Jakarta to 30,000 attenders.
On December 28, 2019, at the National Reformed Evangelical Convention (NREC), an annually held convention in Indonesia, Pastor Tong brought up an issue that the church was currently experiencing: a crisis of male servants to serve as Sunday school teachers and a vacant of fatherly authority in children's life because Sunday school teachers are predominantly women. He called for the young generation, especially men, to surrender themselves as servants of God to serve as Sunday school teachers in their respective churches.
Worship center
In 2008, a new building for the Reformed Evangelical Church in Jakarta called Reformed Millennium Center of Indonesia (RMCI), which includes The Messiah Cathedral (a 4800-seat auditorium), was finished. It took 16 years to persuade the Indonesian government to issue a permit to build the church. The church building was personally designed by Tong himself. It is one of the largest Chinese Christian evangelical church facilities in the world, with of space. In the Calvin auditorium, concerts were held in the opening of the Cathedral in 2008. The building also includes a theological seminary, STT Reformed Injili Internasional, founded by the Synod of Reformed Evangelical Church of Indonesia in cooperation with Reformed Institute for Christianity and the 21st Century (Stephen Tong Evangelistic Ministries International). The seminary has a strong relation with Westminster Theological Seminary.
Other centers
There are churches in Jakarta, Bandung, Yogyakarta, Semarang, Surabaya, Malang, Denpasar, Palembang, Medan, Batam, Samarinda, Singapore, Balikpapan, Kuala Lumpur, Melbourne, Sydney, Perth, Taipei, Taichung, Guangzhou, Beijing, Shanghai, Xiamen, Hong Kong, Berlin, Hamburg, München, Toronto, Boston, Los Angeles, and Tokyo. The church has approximately 56 congregations.
Notable churches
INDONESIA
Jakarta
GRII Pusat
GRII Bintaro
GRII Karawaci
GRII Pondok Indah
GRII Kelapa Gading
GRII Buaran
GRII Cikarang
GRII Kebon Jeruk
GRII BSD
GRII Kuningan
GRII Depok
GRII Cibubur
GRII Bogor
GRII Pantai Indah Kapuk
MRII Gading Serpong
PRII Harapan Indah
Java & Bali
GRII Andhika Surabaya
GRII Ngagel Surabaya
GRII Malang
GRII Bandung
GRII Semarang
GRII Denpasar
GRII Kertajaya
GRII Citra Raya
GRII Sidoarjo
GRII Graha Famili
MRII Yokyakarta
MRII Solo
PRII Kediri
Sumatra
GRII Medan
GRII Palembang
GRII Batam
MRII Lampung
Sulawesi & Maluku
MRII Manado
MRII Makasar
PRII Ternate
Kalimantan
GRII Samarinda
MRII Balikpapan
MRII Pontianak
PRII Banjarmasin
Nusa Tenggara Timur
PRII Kupang
ASIA
GRII Singapore
MRII Kuala Lumpur
MRII Kuching
GRII Taipei
GRII Guangzhou
GRII Shanghai
MRII Taichung
MRII Beijing
MRII Xiamen
MRII Xindian
MRII Hong Kong
MRII Tokyo
PRII Fuzhou
PRII Tianjin
PRII Hangzhou
PRII Nanjing
PRII Hong Kong
AUSTRALIA & NEW ZEALAND
GRII Sydney
GRII Melbourne
GRII Perth
MRII Auckland
EUROPE
MRII Berlin
MRII Hamburg
MRII Munich
MRII Bern
PRII Stockholm
International organisations
Member of the World Reformed Fellowship.
See also
Stephen Tong
Messiah Cathedral
References
External links
NREC (National Reformed Evangelical Convention) https://nrec.stemi.id
NRETC (National Reformed Evangelical Teen Convention) https://nretc.stemi.id
BCN (Bible Camp National) http://bcn.stemi.id
Calvinist denominations established in the 20th century
Evangelical denominations in Asia
Members of the World Reformed Fellowship
Reformed denominations in Indonesia
Christian organizations established in 1989 |
```javascript
const electron = require("electron");
const ipc = electron.ipcRenderer;
const $ = window.jQuery = require('../jquery-2.2.3.min.js');
ipc.on("set-about-data", (event, data) => {
$("#version-inky").text("Inky version: "+data.inkyVersion);
$("#version-ink").text("ink version: "+data.inkVersion);
$("#version-inkjs").text("inkjs version: "+data.inkjsVersion);
});
function updateTheme(event, newTheme) {
let themes = ["dark", "contrast", "focus"];
themes = themes.filter(e => e !== newTheme);
if (newTheme && newTheme.toLowerCase() !== 'main')
{
$(".body").addClass(newTheme);
}
for (const theme of themes) {
$(".body").removeClass(theme);
}
}
updateTheme(null, window.localStorage.getItem("theme"));
ipc.on("change-theme", updateTheme);
``` |
The Revd Theophilus Leigh, D.D. (1691 – 3 January 1785) was an 18th-century Oxford academic of aristocratic descent.
Life
Elected Master of Balliol College, Oxford on 12 May 1726, through the influence of his uncle, Lord Chandos, Dr Leigh remained in post until his death in 1785, the longest incumbent in office. Appointed Rector of Broadwell, Gloucestershire in 1718, Leigh served as Vice-Chancellor of Oxford University from 1738 until 1741.
A relative of the Barons Leigh and great-uncle of Jane Austen, he married Anne Bee (died 1766), only daughter of Edward Bee, of Beckley Park, Oxfordshire; they had two daughters, Mary (who married, her first cousin, Rev Thomas Leigh BCL) and Cassandra (who married Rev Samuel Cooke).
See also
Balliol College
Leigh baronets
References
External links
www.burkespeerage.com
1691 births
1785 deaths
Alumni of Corpus Christi College, Oxford
Masters of Balliol College, Oxford
Vice-Chancellors of the University of Oxford |
```javascript
/**
* @license Apache-2.0
*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing, software
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
*/
'use strict';
// MODULES //
var bench = require( '@stdlib/bench' );
var pow = require( '@stdlib/math/base/special/pow' );
var isUint16Array = require( '@stdlib/assert/is-uint16array' );
var pkg = require( './../package.json' ).name;
var Uint16Array = require( './../lib' );
// FUNCTIONS //
/**
* Creates a benchmark function.
*
* @private
* @param {PositiveInteger} len - array length
* @returns {Function} benchmark function
*/
function createBenchmark( len ) {
var arr = new Uint16Array( len );
return benchmark;
/**
* Benchmark function.
*
* @private
* @param {Benchmark} b - benchmark instance
*/
function benchmark( b ) {
var out;
var i;
b.tic();
for ( i = 0; i < b.iterations; i++ ) {
out = arr.subarray();
if ( typeof out !== 'object' ) {
b.fail( 'should return an object' );
}
}
b.toc();
if ( !isUint16Array( out ) ) {
b.fail( 'should return a Uint16Array' );
}
b.pass( 'benchmark finished' );
b.end();
}
}
// MAIN //
/**
* Main execution sequence.
*
* @private
*/
function main() {
var len;
var min;
var max;
var f;
var i;
min = 1; // 10^min
max = 6; // 10^max
for ( i = min; i <= max; i++ ) {
len = pow( 10, i );
f = createBenchmark( len );
bench( pkg+':subarray:len='+len, f );
}
}
main();
``` |
Round Copse is a Local Nature Reserve in Reading in Berkshire. It is owned and managed by Reading Borough Council.
Geography and site
Round Copse is a small woodland, and is contiguous with another local nature reserve called McIlroy Park.
History
The site was designated a local nature reserve in 2002.
Fauna
The site has the following fauna:
Birds
European green woodpecker
Eurasian nuthatch
Great spotted woodpecker
Lesser spotted woodpecker
Eurasian treecreeper
Common blackbird
Flora
The site has the following flora:
Trees
Hazel
References
Parks and open spaces in Reading, Berkshire
Nature reserves in Berkshire
Local Nature Reserves in Berkshire |
```ruby
# Reference: path_to_url
class Macvim < Formula
desc "GUI for vim, made for macOS"
homepage "path_to_url"
url "path_to_url"
version "9.1.0"
sha256 your_sha256_hash
license "Vim"
head "path_to_url", branch: "master"
# The stable Git tags use a `release-123` format and it's necessary to check
# the GitHub release description to identify the Vim version from the
# "Updated to Vim 1.2.3456" text.
livecheck do
url :stable
regex(/Updated\s+to\s+Vim\s+v?(\d+(?:\.\d+)+)/i)
strategy :github_latest do |json, regex|
match = json["body"]&.match(regex)
next if match.blank?
match[1]
end
end
bottle do
sha256 cellar: :any, arm64_sonoma: your_sha256_hash
sha256 cellar: :any, arm64_ventura: your_sha256_hash
sha256 cellar: :any, arm64_monterey: your_sha256_hash
sha256 cellar: :any, sonoma: your_sha256_hash
sha256 cellar: :any, ventura: your_sha256_hash
sha256 cellar: :any, monterey: your_sha256_hash
end
depends_on "gettext" => :build
depends_on "libsodium" => :build
depends_on xcode: :build
depends_on "cscope"
depends_on "lua"
depends_on :macos
depends_on "python@3.12"
depends_on "ruby"
conflicts_with "ex-vi", because: "both install `vi` and `view` binaries"
conflicts_with "vim", because: "both install vi* binaries"
def install
# Avoid issues finding Ruby headers
ENV.delete("SDKROOT")
# MacVim doesn't have or require any Python package, so unset PYTHONPATH
ENV.delete("PYTHONPATH")
# We don't want the deployment target to include the minor version on Big Sur and newer.
# path_to_url
ENV["MACOSX_DEPLOYMENT_TARGET"] = MacOS.version
# make sure that CC is set to "clang"
ENV.clang
system "./configure", "--with-features=huge",
"--enable-multibyte",
"--enable-perlinterp",
"--enable-rubyinterp",
"--enable-tclinterp",
"--enable-terminal",
"--with-tlib=ncurses",
"--with-compiledby=Homebrew",
"--with-local-dir=#{HOMEBREW_PREFIX}",
"--enable-cscope",
"--enable-luainterp",
"--with-lua-prefix=#{Formula["lua"].opt_prefix}",
"--enable-luainterp",
"--enable-python3interp",
"--disable-sparkle",
"--with-macarchs=#{Hardware::CPU.arch}"
system "make"
prefix.install "src/MacVim/build/Release/MacVim.app"
bin.install_symlink prefix/"MacVim.app/Contents/bin/mvim"
# Create MacVim vimdiff, view, ex equivalents
executables = %w[mvimdiff mview mvimex gvim gvimdiff gview gvimex]
executables += %w[vi vim vimdiff view vimex]
executables.each { |e| bin.install_symlink "mvim" => e }
end
test do
output = shell_output("#{bin}/mvim --version")
assert_match "+ruby", output
assert_match "+gettext", output
assert_match "+sodium", output
# Simple test to check if MacVim was linked to Homebrew's Python 3
py3_exec_prefix = shell_output(Formula["python@3.12"].opt_libexec/"bin/python-config --exec-prefix")
assert_match py3_exec_prefix.chomp, output
(testpath/"commands.vim").write <<~EOS
:python3 import vim; vim.current.buffer[0] = 'hello python3'
:wq
EOS
system bin/"mvim", "-v", "-T", "dumb", "-s", "commands.vim", "test.txt"
assert_equal "hello python3", (testpath/"test.txt").read.chomp
end
end
``` |
```objective-c
#ifndef DLIB_fHOG_Hh_
#define DLIB_fHOG_Hh_
#include "fhog_abstract.h"
#include "../matrix.h"
#include "../array2d.h"
#include "../array.h"
#include "../geometry.h"
#include "assign_image.h"
#include "draw.h"
#include "interpolation.h"
#include "../simd.h"
namespace dlib
{
// your_sha256_hash------------------------
namespace impl_fhog
{
template <typename image_type, typename T>
inline typename dlib::enable_if_c<pixel_traits<typename image_type::pixel_type>::rgb>::type get_gradient (
const int r,
const int c,
const image_type& img,
matrix<T,2,1>& grad,
T& len
)
{
matrix<T, 2, 1> grad2, grad3;
// get the red gradient
grad(0) = (int)img[r][c+1].red-(int)img[r][c-1].red;
grad(1) = (int)img[r+1][c].red-(int)img[r-1][c].red;
len = length_squared(grad);
// get the green gradient
grad2(0) = (int)img[r][c+1].green-(int)img[r][c-1].green;
grad2(1) = (int)img[r+1][c].green-(int)img[r-1][c].green;
T v2 = length_squared(grad2);
// get the blue gradient
grad3(0) = (int)img[r][c+1].blue-(int)img[r][c-1].blue;
grad3(1) = (int)img[r+1][c].blue-(int)img[r-1][c].blue;
T v3 = length_squared(grad3);
// pick color with strongest gradient
if (v2 > len)
{
len = v2;
grad = grad2;
}
if (v3 > len)
{
len = v3;
grad = grad3;
}
}
template <typename image_type>
inline typename dlib::enable_if_c<pixel_traits<typename image_type::pixel_type>::rgb>::type get_gradient (
const int r,
const int c,
const image_type& img,
simd4f& grad_x,
simd4f& grad_y,
simd4f& len
)
{
simd4i rleft((int)img[r][c-1].red,
(int)img[r][c].red,
(int)img[r][c+1].red,
(int)img[r][c+2].red);
simd4i rright((int)img[r][c+1].red,
(int)img[r][c+2].red,
(int)img[r][c+3].red,
(int)img[r][c+4].red);
simd4i rtop((int)img[r-1][c].red,
(int)img[r-1][c+1].red,
(int)img[r-1][c+2].red,
(int)img[r-1][c+3].red);
simd4i rbottom((int)img[r+1][c].red,
(int)img[r+1][c+1].red,
(int)img[r+1][c+2].red,
(int)img[r+1][c+3].red);
simd4i gleft((int)img[r][c-1].green,
(int)img[r][c].green,
(int)img[r][c+1].green,
(int)img[r][c+2].green);
simd4i gright((int)img[r][c+1].green,
(int)img[r][c+2].green,
(int)img[r][c+3].green,
(int)img[r][c+4].green);
simd4i gtop((int)img[r-1][c].green,
(int)img[r-1][c+1].green,
(int)img[r-1][c+2].green,
(int)img[r-1][c+3].green);
simd4i gbottom((int)img[r+1][c].green,
(int)img[r+1][c+1].green,
(int)img[r+1][c+2].green,
(int)img[r+1][c+3].green);
simd4i bleft((int)img[r][c-1].blue,
(int)img[r][c].blue,
(int)img[r][c+1].blue,
(int)img[r][c+2].blue);
simd4i bright((int)img[r][c+1].blue,
(int)img[r][c+2].blue,
(int)img[r][c+3].blue,
(int)img[r][c+4].blue);
simd4i btop((int)img[r-1][c].blue,
(int)img[r-1][c+1].blue,
(int)img[r-1][c+2].blue,
(int)img[r-1][c+3].blue);
simd4i bbottom((int)img[r+1][c].blue,
(int)img[r+1][c+1].blue,
(int)img[r+1][c+2].blue,
(int)img[r+1][c+3].blue);
simd4i grad_x_red = rright-rleft;
simd4i grad_y_red = rbottom-rtop;
simd4i grad_x_green = gright-gleft;
simd4i grad_y_green = gbottom-gtop;
simd4i grad_x_blue = bright-bleft;
simd4i grad_y_blue = bbottom-btop;
simd4i rlen = grad_x_red*grad_x_red + grad_y_red*grad_y_red;
simd4i glen = grad_x_green*grad_x_green + grad_y_green*grad_y_green;
simd4i blen = grad_x_blue*grad_x_blue + grad_y_blue*grad_y_blue;
simd4i cmp = rlen>glen;
simd4i tgrad_x = select(cmp,grad_x_red,grad_x_green);
simd4i tgrad_y = select(cmp,grad_y_red,grad_y_green);
simd4i tlen = select(cmp,rlen,glen);
cmp = tlen>blen;
grad_x = select(cmp,tgrad_x,grad_x_blue);
grad_y = select(cmp,tgrad_y,grad_y_blue);
len = select(cmp,tlen,blen);
}
// your_sha256_hash--------------------
template <typename image_type>
inline typename dlib::enable_if_c<pixel_traits<typename image_type::pixel_type>::rgb>::type get_gradient(
const int r,
const int c,
const image_type& img,
simd8f& grad_x,
simd8f& grad_y,
simd8f& len
)
{
simd8i rleft((int)img[r][c - 1].red,
(int)img[r][c].red,
(int)img[r][c + 1].red,
(int)img[r][c + 2].red,
(int)img[r][c + 3].red,
(int)img[r][c + 4].red,
(int)img[r][c + 5].red,
(int)img[r][c + 6].red);
simd8i rright((int)img[r][c + 1].red,
(int)img[r][c + 2].red,
(int)img[r][c + 3].red,
(int)img[r][c + 4].red,
(int)img[r][c + 5].red,
(int)img[r][c + 6].red,
(int)img[r][c + 7].red,
(int)img[r][c + 8].red);
simd8i rtop((int)img[r - 1][c].red,
(int)img[r - 1][c + 1].red,
(int)img[r - 1][c + 2].red,
(int)img[r - 1][c + 3].red,
(int)img[r - 1][c + 4].red,
(int)img[r - 1][c + 5].red,
(int)img[r - 1][c + 6].red,
(int)img[r - 1][c + 7].red);
simd8i rbottom((int)img[r + 1][c].red,
(int)img[r + 1][c + 1].red,
(int)img[r + 1][c + 2].red,
(int)img[r + 1][c + 3].red,
(int)img[r + 1][c + 4].red,
(int)img[r + 1][c + 5].red,
(int)img[r + 1][c + 6].red,
(int)img[r + 1][c + 7].red);
simd8i gleft((int)img[r][c - 1].green,
(int)img[r][c].green,
(int)img[r][c + 1].green,
(int)img[r][c + 2].green,
(int)img[r][c + 3].green,
(int)img[r][c + 4].green,
(int)img[r][c + 5].green,
(int)img[r][c + 6].green);
simd8i gright((int)img[r][c + 1].green,
(int)img[r][c + 2].green,
(int)img[r][c + 3].green,
(int)img[r][c + 4].green,
(int)img[r][c + 5].green,
(int)img[r][c + 6].green,
(int)img[r][c + 7].green,
(int)img[r][c + 8].green);
simd8i gtop((int)img[r - 1][c].green,
(int)img[r - 1][c + 1].green,
(int)img[r - 1][c + 2].green,
(int)img[r - 1][c + 3].green,
(int)img[r - 1][c + 4].green,
(int)img[r - 1][c + 5].green,
(int)img[r - 1][c + 6].green,
(int)img[r - 1][c + 7].green);
simd8i gbottom((int)img[r + 1][c].green,
(int)img[r + 1][c + 1].green,
(int)img[r + 1][c + 2].green,
(int)img[r + 1][c + 3].green,
(int)img[r + 1][c + 4].green,
(int)img[r + 1][c + 5].green,
(int)img[r + 1][c + 6].green,
(int)img[r + 1][c + 7].green);
simd8i bleft((int)img[r][c - 1].blue,
(int)img[r][c].blue,
(int)img[r][c + 1].blue,
(int)img[r][c + 2].blue,
(int)img[r][c + 3].blue,
(int)img[r][c + 4].blue,
(int)img[r][c + 5].blue,
(int)img[r][c + 6].blue);
simd8i bright((int)img[r][c + 1].blue,
(int)img[r][c + 2].blue,
(int)img[r][c + 3].blue,
(int)img[r][c + 4].blue,
(int)img[r][c + 5].blue,
(int)img[r][c + 6].blue,
(int)img[r][c + 7].blue,
(int)img[r][c + 8].blue);
simd8i btop((int)img[r - 1][c].blue,
(int)img[r - 1][c + 1].blue,
(int)img[r - 1][c + 2].blue,
(int)img[r - 1][c + 3].blue,
(int)img[r - 1][c + 4].blue,
(int)img[r - 1][c + 5].blue,
(int)img[r - 1][c + 6].blue,
(int)img[r - 1][c + 7].blue);
simd8i bbottom((int)img[r + 1][c].blue,
(int)img[r + 1][c + 1].blue,
(int)img[r + 1][c + 2].blue,
(int)img[r + 1][c + 3].blue,
(int)img[r + 1][c + 4].blue,
(int)img[r + 1][c + 5].blue,
(int)img[r + 1][c + 6].blue,
(int)img[r + 1][c + 7].blue);
simd8i grad_x_red = rright - rleft;
simd8i grad_y_red = rbottom - rtop;
simd8i grad_x_green = gright - gleft;
simd8i grad_y_green = gbottom - gtop;
simd8i grad_x_blue = bright - bleft;
simd8i grad_y_blue = bbottom - btop;
simd8i rlen = grad_x_red*grad_x_red + grad_y_red*grad_y_red;
simd8i glen = grad_x_green*grad_x_green + grad_y_green*grad_y_green;
simd8i blen = grad_x_blue*grad_x_blue + grad_y_blue*grad_y_blue;
simd8i cmp = rlen > glen;
simd8i tgrad_x = select(cmp, grad_x_red, grad_x_green);
simd8i tgrad_y = select(cmp, grad_y_red, grad_y_green);
simd8i tlen = select(cmp, rlen, glen);
cmp = tlen > blen;
grad_x = select(cmp, tgrad_x, grad_x_blue);
grad_y = select(cmp, tgrad_y, grad_y_blue);
len = select(cmp, tlen, blen);
}
// your_sha256_hash--------------------
template <typename image_type, typename T>
inline typename dlib::disable_if_c<pixel_traits<typename image_type::pixel_type>::rgb>::type get_gradient (
const int r,
const int c,
const image_type& img,
matrix<T, 2, 1>& grad,
T& len
)
{
grad(0) = (int)get_pixel_intensity(img[r][c+1])-(int)get_pixel_intensity(img[r][c-1]);
grad(1) = (int)get_pixel_intensity(img[r+1][c])-(int)get_pixel_intensity(img[r-1][c]);
len = length_squared(grad);
}
template <typename image_type>
inline typename dlib::disable_if_c<pixel_traits<typename image_type::pixel_type>::rgb>::type get_gradient (
int r,
int c,
const image_type& img,
simd4f& grad_x,
simd4f& grad_y,
simd4f& len
)
{
simd4i left((int)get_pixel_intensity(img[r][c-1]),
(int)get_pixel_intensity(img[r][c]),
(int)get_pixel_intensity(img[r][c+1]),
(int)get_pixel_intensity(img[r][c+2]));
simd4i right((int)get_pixel_intensity(img[r][c+1]),
(int)get_pixel_intensity(img[r][c+2]),
(int)get_pixel_intensity(img[r][c+3]),
(int)get_pixel_intensity(img[r][c+4]));
simd4i top((int)get_pixel_intensity(img[r-1][c]),
(int)get_pixel_intensity(img[r-1][c+1]),
(int)get_pixel_intensity(img[r-1][c+2]),
(int)get_pixel_intensity(img[r-1][c+3]));
simd4i bottom((int)get_pixel_intensity(img[r+1][c]),
(int)get_pixel_intensity(img[r+1][c+1]),
(int)get_pixel_intensity(img[r+1][c+2]),
(int)get_pixel_intensity(img[r+1][c+3]));
grad_x = right-left;
grad_y = bottom-top;
len = (grad_x*grad_x + grad_y*grad_y);
}
// your_sha256_hash--------------------
template <typename image_type>
inline typename dlib::disable_if_c<pixel_traits<typename image_type::pixel_type>::rgb>::type get_gradient(
int r,
int c,
const image_type& img,
simd8f& grad_x,
simd8f& grad_y,
simd8f& len
)
{
simd8i left((int)get_pixel_intensity(img[r][c - 1]),
(int)get_pixel_intensity(img[r][c]),
(int)get_pixel_intensity(img[r][c + 1]),
(int)get_pixel_intensity(img[r][c + 2]),
(int)get_pixel_intensity(img[r][c + 3]),
(int)get_pixel_intensity(img[r][c + 4]),
(int)get_pixel_intensity(img[r][c + 5]),
(int)get_pixel_intensity(img[r][c + 6]));
simd8i right((int)get_pixel_intensity(img[r][c + 1]),
(int)get_pixel_intensity(img[r][c + 2]),
(int)get_pixel_intensity(img[r][c + 3]),
(int)get_pixel_intensity(img[r][c + 4]),
(int)get_pixel_intensity(img[r][c + 5]),
(int)get_pixel_intensity(img[r][c + 6]),
(int)get_pixel_intensity(img[r][c + 7]),
(int)get_pixel_intensity(img[r][c + 8]));
simd8i top((int)get_pixel_intensity(img[r - 1][c]),
(int)get_pixel_intensity(img[r - 1][c + 1]),
(int)get_pixel_intensity(img[r - 1][c + 2]),
(int)get_pixel_intensity(img[r - 1][c + 3]),
(int)get_pixel_intensity(img[r - 1][c + 4]),
(int)get_pixel_intensity(img[r - 1][c + 5]),
(int)get_pixel_intensity(img[r - 1][c + 6]),
(int)get_pixel_intensity(img[r - 1][c + 7]));
simd8i bottom((int)get_pixel_intensity(img[r + 1][c]),
(int)get_pixel_intensity(img[r + 1][c + 1]),
(int)get_pixel_intensity(img[r + 1][c + 2]),
(int)get_pixel_intensity(img[r + 1][c + 3]),
(int)get_pixel_intensity(img[r + 1][c + 4]),
(int)get_pixel_intensity(img[r + 1][c + 5]),
(int)get_pixel_intensity(img[r + 1][c + 6]),
(int)get_pixel_intensity(img[r + 1][c + 7]));
grad_x = right - left;
grad_y = bottom - top;
len = (grad_x*grad_x + grad_y*grad_y);
}
// your_sha256_hash--------------------
template <typename T, typename mm1, typename mm2>
inline void set_hog (
dlib::array<array2d<T,mm1>,mm2>& hog,
int o,
int x,
int y,
const float& value
)
{
hog[o][y][x] = value;
}
template <typename T, typename mm1, typename mm2>
void init_hog (
dlib::array<array2d<T,mm1>,mm2>& hog,
int hog_nr,
int hog_nc,
int filter_rows_padding,
int filter_cols_padding
)
{
const int num_hog_bands = 27+4;
hog.resize(num_hog_bands);
for (int i = 0; i < num_hog_bands; ++i)
{
hog[i].set_size(hog_nr+filter_rows_padding-1, hog_nc+filter_cols_padding-1);
rectangle rect = get_rect(hog[i]);
rect.top() += (filter_rows_padding-1)/2;
rect.left() += (filter_cols_padding-1)/2;
rect.right() -= filter_cols_padding/2;
rect.bottom() -= filter_rows_padding/2;
zero_border_pixels(hog[i],rect);
}
}
template <typename T, typename mm1, typename mm2>
void init_hog_zero_everything (
dlib::array<array2d<T,mm1>,mm2>& hog,
int hog_nr,
int hog_nc,
int filter_rows_padding,
int filter_cols_padding
)
{
const int num_hog_bands = 27+4;
hog.resize(num_hog_bands);
for (int i = 0; i < num_hog_bands; ++i)
{
hog[i].set_size(hog_nr+filter_rows_padding-1, hog_nc+filter_cols_padding-1);
assign_all_pixels(hog[i], 0);
}
}
// your_sha256_hash--------------------
template <typename T, typename mm>
inline void set_hog (
array2d<matrix<T,31,1>,mm>& hog,
int o,
int x,
int y,
const float& value
)
{
hog[y][x](o) = value;
}
template <typename T, typename mm>
void init_hog (
array2d<matrix<T,31,1>,mm>& hog,
int hog_nr,
int hog_nc,
int filter_rows_padding,
int filter_cols_padding
)
{
hog.set_size(hog_nr+filter_rows_padding-1, hog_nc+filter_cols_padding-1);
// now zero out the border region
rectangle rect = get_rect(hog);
rect.top() += (filter_rows_padding-1)/2;
rect.left() += (filter_cols_padding-1)/2;
rect.right() -= filter_cols_padding/2;
rect.bottom() -= filter_rows_padding/2;
border_enumerator be(get_rect(hog),rect);
while (be.move_next())
{
const point p = be.element();
set_all_elements(hog[p.y()][p.x()], 0);
}
}
template <typename T, typename mm>
void init_hog_zero_everything (
array2d<matrix<T,31,1>,mm>& hog,
int hog_nr,
int hog_nc,
int filter_rows_padding,
int filter_cols_padding
)
{
hog.set_size(hog_nr+filter_rows_padding-1, hog_nc+filter_cols_padding-1);
for (long r = 0; r < hog.nr(); ++r)
{
for (long c = 0; c < hog.nc(); ++c)
{
set_all_elements(hog[r][c], 0);
}
}
}
// your_sha256_hash--------------------
template <
typename image_type,
typename out_type
>
void impl_extract_fhog_features_cell_size_1(
const image_type& img_,
out_type& hog,
int filter_rows_padding,
int filter_cols_padding
)
{
const_image_view<image_type> img(img_);
// make sure requires clause is not broken
DLIB_ASSERT( filter_rows_padding > 0 &&
filter_cols_padding > 0 ,
"\t void extract_fhog_features()"
<< "\n\t Invalid inputs were given to this function. "
<< "\n\t filter_rows_padding: " << filter_rows_padding
<< "\n\t filter_cols_padding: " << filter_cols_padding
);
/*
This function is an optimized version of impl_extract_fhog_features() for
the case where cell_size == 1.
*/
// unit vectors used to compute gradient orientation
matrix<float,2,1> directions[9];
directions[0] = 1.0000, 0.0000;
directions[1] = 0.9397, 0.3420;
directions[2] = 0.7660, 0.6428;
directions[3] = 0.500, 0.8660;
directions[4] = 0.1736, 0.9848;
directions[5] = -0.1736, 0.9848;
directions[6] = -0.5000, 0.8660;
directions[7] = -0.7660, 0.6428;
directions[8] = -0.9397, 0.3420;
if (img.nr() <= 2 || img.nc() <= 2)
{
hog.clear();
return;
}
array2d<unsigned char> angle(img.nr(), img.nc());
array2d<float> norm(img.nr(), img.nc());
zero_border_pixels(norm,1,1);
// memory for HOG features
const long hog_nr = img.nr()-2;
const long hog_nc = img.nc()-2;
const int padding_rows_offset = (filter_rows_padding-1)/2;
const int padding_cols_offset = (filter_cols_padding-1)/2;
init_hog_zero_everything(hog, hog_nr, hog_nc, filter_rows_padding, filter_cols_padding);
const int visible_nr = img.nr()-1;
const int visible_nc = img.nc()-1;
// First populate the gradient histograms
for (int y = 1; y < visible_nr; y++)
{
int x;
for (x = 1; x < visible_nc - 7; x += 8)
{
// v will be the length of the gradient vectors.
simd8f grad_x, grad_y, v;
get_gradient(y, x, img, grad_x, grad_y, v);
float _vv[8];
v.store(_vv);
// Now snap the gradient to one of 18 orientations
simd8f best_dot = 0;
simd8f best_o = 0;
for (int o = 0; o < 9; o++)
{
simd8f dot = grad_x*directions[o](0) + grad_y*directions[o](1);
simd8f_bool cmp = dot>best_dot;
best_dot = select(cmp, dot, best_dot);
dot *= -1;
best_o = select(cmp, o, best_o);
cmp = dot > best_dot;
best_dot = select(cmp, dot, best_dot);
best_o = select(cmp, o + 9, best_o);
}
int32 _best_o[8]; simd8i(best_o).store(_best_o);
norm[y][x + 0] = _vv[0];
norm[y][x + 1] = _vv[1];
norm[y][x + 2] = _vv[2];
norm[y][x + 3] = _vv[3];
norm[y][x + 4] = _vv[4];
norm[y][x + 5] = _vv[5];
norm[y][x + 6] = _vv[6];
norm[y][x + 7] = _vv[7];
angle[y][x + 0] = _best_o[0];
angle[y][x + 1] = _best_o[1];
angle[y][x + 2] = _best_o[2];
angle[y][x + 3] = _best_o[3];
angle[y][x + 4] = _best_o[4];
angle[y][x + 5] = _best_o[5];
angle[y][x + 6] = _best_o[6];
angle[y][x + 7] = _best_o[7];
}
// Now process the right columns that don't fit into simd registers.
for (; x < visible_nc; x++)
{
matrix<float,2,1> grad;
float v;
get_gradient(y,x,img,grad,v);
// snap to one of 18 orientations
float best_dot = 0;
int best_o = 0;
for (int o = 0; o < 9; o++)
{
const float dot = dlib::dot(directions[o], grad);
if (dot > best_dot)
{
best_dot = dot;
best_o = o;
}
else if (-dot > best_dot)
{
best_dot = -dot;
best_o = o+9;
}
}
norm[y][x] = v;
angle[y][x] = best_o;
}
}
const float eps = 0.0001;
// compute features
for (int y = 0; y < hog_nr; y++)
{
const int yy = y+padding_rows_offset;
for (int x = 0; x < hog_nc; x++)
{
const simd4f z1(norm[y+1][x+1],
norm[y][x+1],
norm[y+1][x],
norm[y][x]);
const simd4f z2(norm[y+1][x+2],
norm[y][x+2],
norm[y+1][x+1],
norm[y][x+1]);
const simd4f z3(norm[y+2][x+1],
norm[y+1][x+1],
norm[y+2][x],
norm[y+1][x]);
const simd4f z4(norm[y+2][x+2],
norm[y+1][x+2],
norm[y+2][x+1],
norm[y+1][x+1]);
const simd4f temp0 = std::sqrt(norm[y+1][x+1]);
const simd4f nn = 0.2*sqrt(z1+z2+z3+z4+eps);
const simd4f n = 0.1/nn;
simd4f t = 0;
const int xx = x+padding_cols_offset;
simd4f h0 = min(temp0,nn)*n;
const float vv = sum(h0);
set_hog(hog,angle[y+1][x+1],xx,yy, vv);
t += h0;
t *= 2*0.2357;
// contrast-insensitive features
set_hog(hog,angle[y+1][x+1]%9+18,xx,yy, vv);
float temp[4];
t.store(temp);
// texture features
set_hog(hog,27,xx,yy, temp[0]);
set_hog(hog,28,xx,yy, temp[1]);
set_hog(hog,29,xx,yy, temp[2]);
set_hog(hog,30,xx,yy, temp[3]);
}
}
}
// your_sha256_hash--------------------
template <
typename image_type,
typename out_type
>
void impl_extract_fhog_features(
const image_type& img_,
out_type& hog,
int cell_size,
int filter_rows_padding,
int filter_cols_padding
)
{
const_image_view<image_type> img(img_);
// make sure requires clause is not broken
DLIB_ASSERT( cell_size > 0 &&
filter_rows_padding > 0 &&
filter_cols_padding > 0 ,
"\t void extract_fhog_features()"
<< "\n\t Invalid inputs were given to this function. "
<< "\n\t cell_size: " << cell_size
<< "\n\t filter_rows_padding: " << filter_rows_padding
<< "\n\t filter_cols_padding: " << filter_cols_padding
);
/*
This function implements the HOG feature extraction method described in
the paper:
P. Felzenszwalb, R. Girshick, D. McAllester, D. Ramanan
Object Detection with Discriminatively Trained Part Based Models
IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 32, No. 9, Sep. 2010
Moreover, this function is derived from the HOG feature extraction code
from the features.cc file in the voc-releaseX code (see
path_to_url~rbg/latent/) which is has the following
license (note that the code has been modified to work with grayscale and
color as well as planar and interlaced input and output formats):
Permission is hereby granted, free of charge, to any person obtaining
a copy of this software and associated documentation files (the
"Software"), to deal in the Software without restriction, including
without limitation the rights to use, copy, modify, merge, publish,
distribute, sublicense, and/or sell copies of the Software, and to
permit persons to whom the Software is furnished to do so, subject to
the following conditions:
The above copyright notice and this permission notice shall be
included in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*/
if (cell_size == 1)
{
impl_extract_fhog_features_cell_size_1(img_,hog,filter_rows_padding,filter_cols_padding);
return;
}
// unit vectors used to compute gradient orientation
matrix<float,2,1> directions[9];
directions[0] = 1.0000, 0.0000;
directions[1] = 0.9397, 0.3420;
directions[2] = 0.7660, 0.6428;
directions[3] = 0.500, 0.8660;
directions[4] = 0.1736, 0.9848;
directions[5] = -0.1736, 0.9848;
directions[6] = -0.5000, 0.8660;
directions[7] = -0.7660, 0.6428;
directions[8] = -0.9397, 0.3420;
// First we allocate memory for caching orientation histograms & their norms.
const int cells_nr = (int)((float)img.nr()/(float)cell_size + 0.5);
const int cells_nc = (int)((float)img.nc()/(float)cell_size + 0.5);
if (cells_nr == 0 || cells_nc == 0)
{
hog.clear();
return;
}
// We give hist extra padding around the edges (1 cell all the way around the
// edge) so we can avoid needing to do boundary checks when indexing into it
// later on. So some statements assign to the boundary but those values are
// never used.
array2d<matrix<float,18,1> > hist(cells_nr+2, cells_nc+2);
for (long r = 0; r < hist.nr(); ++r)
{
for (long c = 0; c < hist.nc(); ++c)
{
hist[r][c] = 0;
}
}
array2d<float> norm(cells_nr, cells_nc);
assign_all_pixels(norm, 0);
// memory for HOG features
const int hog_nr = std::max(cells_nr-2, 0);
const int hog_nc = std::max(cells_nc-2, 0);
if (hog_nr == 0 || hog_nc == 0)
{
hog.clear();
return;
}
const int padding_rows_offset = (filter_rows_padding-1)/2;
const int padding_cols_offset = (filter_cols_padding-1)/2;
init_hog(hog, hog_nr, hog_nc, filter_rows_padding, filter_cols_padding);
const int visible_nr = std::min((long)cells_nr*cell_size,img.nr())-1;
const int visible_nc = std::min((long)cells_nc*cell_size,img.nc())-1;
// First populate the gradient histograms
for (int y = 1; y < visible_nr; y++)
{
const float yp = ((float)y+0.5)/(float)cell_size - 0.5;
const int iyp = (int)std::floor(yp);
const float vy0 = yp - iyp;
const float vy1 = 1.0 - vy0;
int x;
for (x = 1; x < visible_nc - 7; x += 8)
{
simd8f xx(x, x + 1, x + 2, x + 3, x + 4, x + 5, x + 6, x + 7);
// v will be the length of the gradient vectors.
simd8f grad_x, grad_y, v;
get_gradient(y, x, img, grad_x, grad_y, v);
// We will use bilinear interpolation to add into the histogram bins.
// So first we precompute the values needed to determine how much each
// pixel votes into each bin.
simd8f xp = (xx + 0.5) / (float)cell_size + 0.5;
simd8i ixp = simd8i(xp);
simd8f vx0 = xp - ixp;
simd8f vx1 = 1.0f - vx0;
v = sqrt(v);
// Now snap the gradient to one of 18 orientations
simd8f best_dot = 0;
simd8f best_o = 0;
for (int o = 0; o < 9; o++)
{
simd8f dot = grad_x*directions[o](0) + grad_y*directions[o](1);
simd8f_bool cmp = dot>best_dot;
best_dot = select(cmp, dot, best_dot);
dot *= -1;
best_o = select(cmp, o, best_o);
cmp = dot > best_dot;
best_dot = select(cmp, dot, best_dot);
best_o = select(cmp, o + 9, best_o);
}
// Add the gradient magnitude, v, to 4 histograms around pixel using
// bilinear interpolation.
vx1 *= v;
vx0 *= v;
// The amounts for each bin
simd8f v11 = vy1*vx1;
simd8f v01 = vy0*vx1;
simd8f v10 = vy1*vx0;
simd8f v00 = vy0*vx0;
int32 _best_o[8]; simd8i(best_o).store(_best_o);
int32 _ixp[8]; ixp.store(_ixp);
float _v11[8]; v11.store(_v11);
float _v01[8]; v01.store(_v01);
float _v10[8]; v10.store(_v10);
float _v00[8]; v00.store(_v00);
hist[iyp + 1][_ixp[0]](_best_o[0]) += _v11[0];
hist[iyp + 1 + 1][_ixp[0]](_best_o[0]) += _v01[0];
hist[iyp + 1][_ixp[0] + 1](_best_o[0]) += _v10[0];
hist[iyp + 1 + 1][_ixp[0] + 1](_best_o[0]) += _v00[0];
hist[iyp + 1][_ixp[1]](_best_o[1]) += _v11[1];
hist[iyp + 1 + 1][_ixp[1]](_best_o[1]) += _v01[1];
hist[iyp + 1][_ixp[1] + 1](_best_o[1]) += _v10[1];
hist[iyp + 1 + 1][_ixp[1] + 1](_best_o[1]) += _v00[1];
hist[iyp + 1][_ixp[2]](_best_o[2]) += _v11[2];
hist[iyp + 1 + 1][_ixp[2]](_best_o[2]) += _v01[2];
hist[iyp + 1][_ixp[2] + 1](_best_o[2]) += _v10[2];
hist[iyp + 1 + 1][_ixp[2] + 1](_best_o[2]) += _v00[2];
hist[iyp + 1][_ixp[3]](_best_o[3]) += _v11[3];
hist[iyp + 1 + 1][_ixp[3]](_best_o[3]) += _v01[3];
hist[iyp + 1][_ixp[3] + 1](_best_o[3]) += _v10[3];
hist[iyp + 1 + 1][_ixp[3] + 1](_best_o[3]) += _v00[3];
hist[iyp + 1][_ixp[4]](_best_o[4]) += _v11[4];
hist[iyp + 1 + 1][_ixp[4]](_best_o[4]) += _v01[4];
hist[iyp + 1][_ixp[4] + 1](_best_o[4]) += _v10[4];
hist[iyp + 1 + 1][_ixp[4] + 1](_best_o[4]) += _v00[4];
hist[iyp + 1][_ixp[5]](_best_o[5]) += _v11[5];
hist[iyp + 1 + 1][_ixp[5]](_best_o[5]) += _v01[5];
hist[iyp + 1][_ixp[5] + 1](_best_o[5]) += _v10[5];
hist[iyp + 1 + 1][_ixp[5] + 1](_best_o[5]) += _v00[5];
hist[iyp + 1][_ixp[6]](_best_o[6]) += _v11[6];
hist[iyp + 1 + 1][_ixp[6]](_best_o[6]) += _v01[6];
hist[iyp + 1][_ixp[6] + 1](_best_o[6]) += _v10[6];
hist[iyp + 1 + 1][_ixp[6] + 1](_best_o[6]) += _v00[6];
hist[iyp + 1][_ixp[7]](_best_o[7]) += _v11[7];
hist[iyp + 1 + 1][_ixp[7]](_best_o[7]) += _v01[7];
hist[iyp + 1][_ixp[7] + 1](_best_o[7]) += _v10[7];
hist[iyp + 1 + 1][_ixp[7] + 1](_best_o[7]) += _v00[7];
}
// Now process the right columns that don't fit into simd registers.
for (; x < visible_nc; x++)
{
matrix<float, 2, 1> grad;
float v;
get_gradient(y,x,img,grad,v);
// snap to one of 18 orientations
float best_dot = 0;
int best_o = 0;
for (int o = 0; o < 9; o++)
{
const float dot = dlib::dot(directions[o], grad);
if (dot > best_dot)
{
best_dot = dot;
best_o = o;
}
else if (-dot > best_dot)
{
best_dot = -dot;
best_o = o+9;
}
}
v = std::sqrt(v);
// add to 4 histograms around pixel using bilinear interpolation
const float xp = ((double)x + 0.5) / (double)cell_size - 0.5;
const int ixp = (int)std::floor(xp);
const float vx0 = xp - ixp;
const float vx1 = 1.0 - vx0;
hist[iyp+1][ixp+1](best_o) += vy1*vx1*v;
hist[iyp+1+1][ixp+1](best_o) += vy0*vx1*v;
hist[iyp+1][ixp+1+1](best_o) += vy1*vx0*v;
hist[iyp+1+1][ixp+1+1](best_o) += vy0*vx0*v;
}
}
// compute energy in each block by summing over orientations
for (int r = 0; r < cells_nr; ++r)
{
for (int c = 0; c < cells_nc; ++c)
{
for (int o = 0; o < 9; o++)
{
norm[r][c] += (hist[r+1][c+1](o) + hist[r+1][c+1](o+9)) * (hist[r+1][c+1](o) + hist[r+1][c+1](o+9));
}
}
}
const float eps = 0.0001;
// compute features
for (int y = 0; y < hog_nr; y++)
{
const int yy = y+padding_rows_offset;
for (int x = 0; x < hog_nc; x++)
{
const simd4f z1(norm[y+1][x+1],
norm[y][x+1],
norm[y+1][x],
norm[y][x]);
const simd4f z2(norm[y+1][x+2],
norm[y][x+2],
norm[y+1][x+1],
norm[y][x+1]);
const simd4f z3(norm[y+2][x+1],
norm[y+1][x+1],
norm[y+2][x],
norm[y+1][x]);
const simd4f z4(norm[y+2][x+2],
norm[y+1][x+2],
norm[y+2][x+1],
norm[y+1][x+1]);
const simd4f nn = 0.2*sqrt(z1+z2+z3+z4+eps);
const simd4f n = 0.1/nn;
simd4f t = 0;
const int xx = x+padding_cols_offset;
// contrast-sensitive features
for (int o = 0; o < 18; o+=3)
{
simd4f temp0(hist[y+1+1][x+1+1](o));
simd4f temp1(hist[y+1+1][x+1+1](o+1));
simd4f temp2(hist[y+1+1][x+1+1](o+2));
simd4f h0 = min(temp0,nn)*n;
simd4f h1 = min(temp1,nn)*n;
simd4f h2 = min(temp2,nn)*n;
set_hog(hog,o,xx,yy, sum(h0));
set_hog(hog,o+1,xx,yy, sum(h1));
set_hog(hog,o+2,xx,yy, sum(h2));
t += h0+h1+h2;
}
t *= 2*0.2357;
// contrast-insensitive features
for (int o = 0; o < 9; o+=3)
{
simd4f temp0 = hist[y+1+1][x+1+1](o) + hist[y+1+1][x+1+1](o+9);
simd4f temp1 = hist[y+1+1][x+1+1](o+1) + hist[y+1+1][x+1+1](o+9+1);
simd4f temp2 = hist[y+1+1][x+1+1](o+2) + hist[y+1+1][x+1+1](o+9+2);
simd4f h0 = min(temp0,nn)*n;
simd4f h1 = min(temp1,nn)*n;
simd4f h2 = min(temp2,nn)*n;
set_hog(hog,o+18,xx,yy, sum(h0));
set_hog(hog,o+18+1,xx,yy, sum(h1));
set_hog(hog,o+18+2,xx,yy, sum(h2));
}
float temp[4];
t.store(temp);
// texture features
set_hog(hog,27,xx,yy, temp[0]);
set_hog(hog,28,xx,yy, temp[1]);
set_hog(hog,29,xx,yy, temp[2]);
set_hog(hog,30,xx,yy, temp[3]);
}
}
}
// your_sha256_hash--------------------
inline void create_fhog_bar_images (
dlib::array<matrix<float> >& mbars,
const long w
)
{
const long bdims = 9;
// Make the oriented lines we use to draw on each HOG cell.
mbars.resize(bdims);
dlib::array<array2d<unsigned char> > bars(bdims);
array2d<unsigned char> temp(w,w);
for (unsigned long i = 0; i < bars.size(); ++i)
{
assign_all_pixels(temp, 0);
draw_line(temp, point(w/2,0), point(w/2,w-1), 255);
rotate_image(temp, bars[i], i*-pi/bars.size());
mbars[i] = subm(matrix_cast<float>(mat(bars[i])), centered_rect(get_rect(bars[i]),w,w) );
}
}
} // end namespace impl_fhog
// your_sha256_hash------------------------
// your_sha256_hash------------------------
// your_sha256_hash------------------------
// your_sha256_hash------------------------
template <
typename image_type,
typename T,
typename mm1,
typename mm2
>
void extract_fhog_features(
const image_type& img,
dlib::array<array2d<T,mm1>,mm2>& hog,
int cell_size = 8,
int filter_rows_padding = 1,
int filter_cols_padding = 1
)
{
impl_fhog::impl_extract_fhog_features(img, hog, cell_size, filter_rows_padding, filter_cols_padding);
// If the image is too small then the above function outputs an empty feature map.
// But to make things very uniform in usage we require the output to still have the
// 31 planes (but they are just empty).
if (hog.size() == 0)
hog.resize(31);
}
template <
typename image_type,
typename T,
typename mm
>
void extract_fhog_features(
const image_type& img,
array2d<matrix<T,31,1>,mm>& hog,
int cell_size = 8,
int filter_rows_padding = 1,
int filter_cols_padding = 1
)
{
impl_fhog::impl_extract_fhog_features(img, hog, cell_size, filter_rows_padding, filter_cols_padding);
}
// your_sha256_hash------------------------
template <
typename image_type,
typename T
>
void extract_fhog_features(
const image_type& img,
matrix<T,0,1>& feats,
int cell_size = 8,
int filter_rows_padding = 1,
int filter_cols_padding = 1
)
{
dlib::array<array2d<T> > hog;
extract_fhog_features(img, hog, cell_size, filter_rows_padding, filter_cols_padding);
feats.set_size(hog.size()*hog[0].size());
for (unsigned long i = 0; i < hog.size(); ++i)
{
const long size = hog[i].size();
set_rowm(feats, range(i*size, (i+1)*size-1)) = reshape_to_column_vector(mat(hog[i]));
}
}
// your_sha256_hash------------------------
template <
typename image_type
>
matrix<double,0,1> extract_fhog_features(
const image_type& img,
int cell_size = 8,
int filter_rows_padding = 1,
int filter_cols_padding = 1
)
{
matrix<double, 0, 1> feats;
extract_fhog_features(img, feats, cell_size, filter_rows_padding, filter_cols_padding);
return feats;
}
// your_sha256_hash------------------------
// your_sha256_hash------------------------
inline point image_to_fhog (
point p,
int cell_size = 8,
int filter_rows_padding = 1,
int filter_cols_padding = 1
)
{
// make sure requires clause is not broken
DLIB_ASSERT( cell_size > 0 &&
filter_rows_padding > 0 &&
filter_cols_padding > 0 ,
"\t point image_to_fhog()"
<< "\n\t Invalid inputs were given to this function. "
<< "\n\t cell_size: " << cell_size
<< "\n\t filter_rows_padding: " << filter_rows_padding
<< "\n\t filter_cols_padding: " << filter_cols_padding
);
// There is a one pixel border around the image.
p -= point(1,1);
// There is also a 1 "cell" border around the HOG image formation.
return p/cell_size - point(1,1) + point((filter_cols_padding-1)/2,(filter_rows_padding-1)/2);
}
// your_sha256_hash------------------------
inline rectangle image_to_fhog (
const rectangle& rect,
int cell_size = 8,
int filter_rows_padding = 1,
int filter_cols_padding = 1
)
{
// make sure requires clause is not broken
DLIB_ASSERT( cell_size > 0 &&
filter_rows_padding > 0 &&
filter_cols_padding > 0 ,
"\t rectangle image_to_fhog()"
<< "\n\t Invalid inputs were given to this function. "
<< "\n\t cell_size: " << cell_size
<< "\n\t filter_rows_padding: " << filter_rows_padding
<< "\n\t filter_cols_padding: " << filter_cols_padding
);
return rectangle(image_to_fhog(rect.tl_corner(),cell_size,filter_rows_padding,filter_cols_padding),
image_to_fhog(rect.br_corner(),cell_size,filter_rows_padding,filter_cols_padding));
}
// your_sha256_hash------------------------
inline point fhog_to_image (
point p,
int cell_size = 8,
int filter_rows_padding = 1,
int filter_cols_padding = 1
)
{
// make sure requires clause is not broken
DLIB_ASSERT( cell_size > 0 &&
filter_rows_padding > 0 &&
filter_cols_padding > 0 ,
"\t point fhog_to_image()"
<< "\n\t Invalid inputs were given to this function. "
<< "\n\t cell_size: " << cell_size
<< "\n\t filter_rows_padding: " << filter_rows_padding
<< "\n\t filter_cols_padding: " << filter_cols_padding
);
// Convert to image space and then set to the center of the cell.
point offset;
p = (p+point(1,1)-point((filter_cols_padding-1)/2,(filter_rows_padding-1)/2))*cell_size + point(1,1);
if (p.x() >= 0 && p.y() >= 0) offset = point(cell_size/2,cell_size/2);
if (p.x() < 0 && p.y() >= 0) offset = point(-cell_size/2,cell_size/2);
if (p.x() >= 0 && p.y() < 0) offset = point(cell_size/2,-cell_size/2);
if (p.x() < 0 && p.y() < 0) offset = point(-cell_size/2,-cell_size/2);
return p + offset;
}
// your_sha256_hash------------------------
inline rectangle fhog_to_image (
const rectangle& rect,
int cell_size = 8,
int filter_rows_padding = 1,
int filter_cols_padding = 1
)
{
// make sure requires clause is not broken
DLIB_ASSERT( cell_size > 0 &&
filter_rows_padding > 0 &&
filter_cols_padding > 0 ,
"\t rectangle fhog_to_image()"
<< "\n\t Invalid inputs were given to this function. "
<< "\n\t cell_size: " << cell_size
<< "\n\t filter_rows_padding: " << filter_rows_padding
<< "\n\t filter_cols_padding: " << filter_cols_padding
);
return rectangle(fhog_to_image(rect.tl_corner(),cell_size,filter_rows_padding,filter_cols_padding),
fhog_to_image(rect.br_corner(),cell_size,filter_rows_padding,filter_cols_padding));
}
// your_sha256_hash------------------------
// your_sha256_hash------------------------
template <
typename T,
typename mm1,
typename mm2
>
matrix<unsigned char> draw_fhog(
const dlib::array<array2d<T,mm1>,mm2>& hog,
const long cell_draw_size = 15,
const float min_response_threshold = 0.0
)
{
// make sure requires clause is not broken
DLIB_ASSERT( cell_draw_size > 0 && hog.size()==31,
"\t matrix<unsigned char> draw_fhog()"
<< "\n\t Invalid inputs were given to this function. "
<< "\n\t cell_draw_size: " << cell_draw_size
<< "\n\t hog.size(): " << hog.size()
);
dlib::array<matrix<float> > mbars;
impl_fhog::create_fhog_bar_images(mbars,cell_draw_size);
// now draw the bars onto the HOG cells
matrix<float> himg(hog[0].nr()*cell_draw_size, hog[0].nc()*cell_draw_size);
himg = 0;
for (unsigned long d = 0; d < mbars.size(); ++d)
{
for (long r = 0; r < himg.nr(); r+=cell_draw_size)
{
for (long c = 0; c < himg.nc(); c+=cell_draw_size)
{
const float val = hog[d][r/cell_draw_size][c/cell_draw_size] +
hog[d+mbars.size()][r/cell_draw_size][c/cell_draw_size] +
hog[d+mbars.size()*2][r/cell_draw_size][c/cell_draw_size];
if (val > min_response_threshold)
{
set_subm(himg, r, c, cell_draw_size, cell_draw_size) += val*mbars[d%mbars.size()];
}
}
}
}
const float thresh = mean(himg) + 4 * stddev(himg);
if (thresh != 0)
return matrix_cast<unsigned char>(upperbound(round(himg*255/thresh),255));
else
return matrix_cast<unsigned char>(himg);
}
// your_sha256_hash------------------------
template <
typename T
>
matrix<unsigned char> draw_fhog (
const std::vector<matrix<T> >& hog,
const long cell_draw_size = 15,
const float min_response_threshold = 0.0
)
{
// make sure requires clause is not broken
DLIB_ASSERT( cell_draw_size > 0 && hog.size()==31,
"\t matrix<unsigned char> draw_fhog()"
<< "\n\t Invalid inputs were given to this function. "
<< "\n\t cell_draw_size: " << cell_draw_size
<< "\n\t hog.size(): " << hog.size()
);
// Just convert the input into the right object and then call the above draw_fhog()
// function on it.
dlib::array<array2d<T> > temp(hog.size());
for (unsigned long i = 0; i < temp.size(); ++i)
{
temp[i].set_size(hog[i].nr(), hog[i].nc());
for (long r = 0; r < hog[i].nr(); ++r)
{
for (long c = 0; c < hog[i].nc(); ++c)
{
temp[i][r][c] = hog[i](r,c);
}
}
}
return draw_fhog(temp,cell_draw_size, min_response_threshold);
}
// your_sha256_hash------------------------
template <
typename T,
typename mm
>
matrix<unsigned char> draw_fhog(
const array2d<matrix<T,31,1>,mm>& hog,
const long cell_draw_size = 15,
const float min_response_threshold = 0.0
)
{
// make sure requires clause is not broken
DLIB_ASSERT( cell_draw_size > 0,
"\t matrix<unsigned char> draw_fhog()"
<< "\n\t Invalid inputs were given to this function. "
<< "\n\t cell_draw_size: " << cell_draw_size
);
dlib::array<matrix<float> > mbars;
impl_fhog::create_fhog_bar_images(mbars,cell_draw_size);
// now draw the bars onto the HOG cells
matrix<float> himg(hog.nr()*cell_draw_size, hog.nc()*cell_draw_size);
himg = 0;
for (unsigned long d = 0; d < mbars.size(); ++d)
{
for (long r = 0; r < himg.nr(); r+=cell_draw_size)
{
for (long c = 0; c < himg.nc(); c+=cell_draw_size)
{
const float val = hog[r/cell_draw_size][c/cell_draw_size](d) +
hog[r/cell_draw_size][c/cell_draw_size](d+mbars.size()) +
hog[r/cell_draw_size][c/cell_draw_size](d+mbars.size()*2);
if (val > min_response_threshold)
{
set_subm(himg, r, c, cell_draw_size, cell_draw_size) += val*mbars[d%mbars.size()];
}
}
}
}
const float thresh = mean(himg) + 4 * stddev(himg);
if (thresh != 0)
return matrix_cast<unsigned char>(upperbound(round(himg*255/thresh),255));
else
return matrix_cast<unsigned char>(himg);
}
// your_sha256_hash------------------------
}
#endif // DLIB_fHOG_Hh_
``` |
```xml
export { avatarVariables as avatarLabelVariables } from './avatarVariables';
``` |
```ruby
# frozen_string_literal: true
module Decidim
module Admin
# A command with all the business logic when a user unreports a resource.
class UnreportResource < Decidim::Command
# Public: Initializes the command.
#
# reportable - A Decidim::Reportable
# current_user - the user performing the action
def initialize(reportable, current_user)
@reportable = reportable
@current_user = current_user
end
# Executes the command. Broadcasts these events:
#
# - :ok when everything is valid, together with the resource.
# - :invalid if the resource is not reported
#
# Returns nothing.
def call
return broadcast(:invalid) unless @reportable.reported?
unreport!
broadcast(:ok, @reportable)
end
private
def unreport!
Decidim.traceability.perform_action!(
"unreport",
@reportable.moderation,
@current_user,
extra: {
reportable_type: @reportable.class.name
}
) do
@reportable.moderation.destroy!
end
end
end
end
end
``` |
Pharmacis carna is a moth of the family Hepialidae. It is mainly found in mountainous areas, mostly in the Alps and the Carpathian Mountains, although it is also present in Hungary.
The wingspan is 32–44 mm for females and 25–34 mm for males. Adults are on wing from June to August in one generation.
The larvae feed on the roots of various grass species.
External links
Fauna Europaea
Lepiforum.de
schmetterlinge-deutschlands.de
Hepialidae
Moths of Europe
Taxa named by Michael Denis
Taxa named by Ignaz Schiffermüller
Moths described in 1775 |
The autonomic nerve is a small nerve which carries postganglionic sympathetic and parasympathetic neurons from the zygomaticotemporal nerve; a branch of the maxillary nerve, to the lacrimal nerve; a branch of the ophthalmic nerve. These neurons derive from the superior cervical ganglion and the pterygopalatine ganglion respectively. They will travel to the lacrimal gland via the lacrimal nerve. Parasympathetic will induce lacrimation and vice versa.
References
Nerves |
Ręczyn is a village in the administrative district of Gmina Zgorzelec, within Zgorzelec County, Lower Silesian Voivodeship, in south-western Poland, close to the German border.
It lies approximately south of Zgorzelec, and west of the regional capital Wrocław.
Gallery
References
Villages in Zgorzelec County |
Amber-Paris Hall (born 7 January 1995) is a New Zealand rugby league footballer who plays for the Brisbane Broncos in the NRL Women's Premiership.
Primarily a , she is a New Zealand representative.
Playing career
In 2012, Hall, a Richmond Roses player, was named in New Zealand's 2012 training squad, although no games were played that season. In 2013, she made her debut for New Zealand at the 2013 Women's Rugby League World Cup, playing two games.
On 10 August 2018, Hall represented Auckland in a trial game against the New Zealand Warriors NRL Women's Premiership team.
2019
On 11 June, she signed with the Brisbane Broncos NRLW team. On 22 June, after a six-year absence, Hall started at for New Zealand in their 46–8 win over Samoa.
In Round 1 of the 2019 NRL Women's season, Hall made her debut for the Broncos, scoring a try in a 14–4 win over the St George Illawarra Dragons. On 6 October, she started at in the Broncos' 30–6 Grand Final win over the Dragons.
On 25 October, Hall started at for New Zealand in their 8–28 loss to Australia.
2020
In Round 2 of the 2020 NRL Women's season, she was charged with Grade 1 dangerous contact on Dragons' Isabelle Kelly and was suspended for one game. On 25 October, she started at and scored a try in the Broncos' 20–10 Grand Final win over the Sydney Roosters. She was named Player of the Match, winning the Karyn Murphy Medal.
On 27 November, at the Broncos' end of season awards, Hall won the Player of the Year, Players' Player and Best Forward awards.
2022
In late September, Hall was named in the Dream Team announced by the Rugby League Players Association. The team was selected by the players, who each cast one vote for each position. In October she was selected for the New Zealand squad at the delayed 2021 Women's Rugby League World Cup in England.
Achievements and accolades
Individual
Karyn Murphy Medal: 2020
Brisbane Broncos Player of the Year: 2020
Brisbane Broncos Players' Player: 2020
Brisbane Broncos Best Forward: 2020
Team
2019 NRLW Grand Final: Brisbane Broncos – Winners
2020 NRLW Grand Final: Brisbane Broncos – Winners
References
External links
Brisbane Broncos profile
1995 births
Living people
New Zealand female rugby league players
New Zealand women's national rugby league team players
Rugby league props
Rugby league second-rows
Brisbane Broncos (NRLW) players |
```java
package com.yahoo.config.model.application.provider;
import com.yahoo.config.model.api.ConfigDefinitionRepo;
import com.yahoo.io.IOUtils;
import java.util.logging.Level;
import com.yahoo.vespa.config.ConfigDefinitionKey;
import com.yahoo.vespa.config.buildergen.ConfigDefinition;
import com.yahoo.vespa.config.util.ConfigUtils;
import com.yahoo.vespa.defaults.Defaults;
import java.io.File;
import java.io.IOException;
import java.util.Collections;
import java.util.LinkedHashMap;
import java.util.Map;
/**
* A global pool of all config definitions that this server knows about. These objects can be shared
* by all tenants, as they are not modified.
*
* @author Ulf Lilleengen
*/
public class StaticConfigDefinitionRepo implements ConfigDefinitionRepo {
private static final java.util.logging.Logger log = java.util.logging.Logger.getLogger(StaticConfigDefinitionRepo.class.getName());
private final Map<ConfigDefinitionKey, ConfigDefinition> configDefinitions = new LinkedHashMap<>();
private static final String DEFAULT_SERVER_DEF_DIR = Defaults.getDefaults().underVespaHome("share/vespa/configdefinitions");
public StaticConfigDefinitionRepo() {
this(new File(DEFAULT_SERVER_DEF_DIR));
}
public StaticConfigDefinitionRepo(File definitionDir) {
initialize(definitionDir);
}
private void initialize(File definitionDir) {
if ( ! definitionDir.exists()) return;
for (File def : definitionDir.listFiles((dir, name) -> name.matches(".*\\.def")))
addConfigDefinition(def);
}
private void addConfigDefinition(File def) {
try {
ConfigDefinitionKey key = ConfigUtils.createConfigDefinitionKeyFromDefFile(def);
addConfigDefinition(key, def);
} catch (IOException e) {
log.log(Level.WARNING, "Exception adding config definition " + def, e);
}
}
private void addConfigDefinition(ConfigDefinitionKey key, File defFile) throws IOException {
String payload = IOUtils.readFile(defFile);
configDefinitions.put(key, new ConfigDefinition(key.getName(), payload.split("[\\r\\n]+")));
}
@Override
public Map<ConfigDefinitionKey, ConfigDefinition> getConfigDefinitions() {
return Collections.unmodifiableMap(configDefinitions);
}
@Override
public ConfigDefinition get(ConfigDefinitionKey key) { return configDefinitions.get(key); }
}
``` |
Strike Back: Vendetta (sometimes referred to as Strike Back: The Final Season) is a ten-part British-American action television series, and serves as the eighth and final series of Strike Back. The series features returning cast members Daniel MacPherson, Warren Brown, Alin Sumarwata, Jamie Bamber and Varada Sethu. The series made its premiere on 14 February 2020.
Vendetta takes place some time after the events of Revolution. Section 20 are given a mission to stop two brothers from unleashing a series of terrorist attacks against the West, but gradually uncover a conspiracy between Western intelligence agencies.
Cast
Section 20
Daniel MacPherson as Sergeant Samuel Wyatt, US Joint Special Operations Command
Warren Brown as Sergeant Thomas "Mac" McAllister, British Army (ex-United Kingdom Special Forces)
Alin Sumarwata as Lance Corporal Gracie Novin, Australian Army Special Operations Command
Jamie Bamber as Colonel Alexander Coltrane, British Army, the commanding officer of Section 20
Varada Sethu as Lance Corporal Manisha Chetri, British Army
Law enforcement and government officials
John Michie as Sir James Spencer, the Deputy Chief of MI6
Jacob Fortune-Lloyd as Constable Yoni Spiegel, Israel Police
Lorraine Burroughs as Carolyn Fortier, Senior Supervisor of the CIA Directorate of Operations
Yasemin Allen as Katrina Zarkova, a former Captain within the FSB's Alpha Group
Russian Military
John Albasiny as Lieutenant Colonel Lev Kogan, deputy director of the Combined Armed Centre for Electronic Warfare
Semir Krivić as Sebastian Levkin, Foreign Intelligence Service
Antagonists
Goran Bogdan as Edon Demachi, the leader of the Demachi crime family
Ivana Miličević as Arianna Demachi/Elena Stabokina, Edon's wife and the Demarchi family matriarch, who is also a deep-cover agent for Russia.
Maxim Baldry as Loric Demachi, Edon and Arianna's son
Tomi May as Jovan Nishani/Branko Hajrovic, a former Bosnian Serb Army officer and enforcer for the Demarchi family
Alec Secareanu as Zayef Hiraji, a Bosnian Muslim terrorist, and Mahir's younger brother
Bamshad Abedi-Amin as Mahir Hiraji, a Bosnian Muslim terrorist and Zayef's older brother
Arty Froushan as Nadav Topal, a Palestinian drug dealer and taxi driver
Daniel Donskoy as Danny Dahan, an Israeli drug runner
Thomas Levin as Yada Haim, an Israeli crime boss and property developer
Marjan Radanovich as Sluchevsky, a Russian sniper and assassin
Yayan Ruhian as Kabul, a CIA asset tasked with assassinating Section 20 to cover up the agency's war crimes.
Episodes
References
2020 American television seasons
2020 British television seasons
E |
Cleon John (born 25 October 1981) is a Trinidad and Tobago international footballer who plays for North East Stars, as a goalkeeper.
Career
John has played club football for San Juan Jabloteh and North East Stars.
He made his international debut for Trinidad and Tobago in 2013.
References
1981 births
Living people
Trinidad and Tobago men's footballers
Trinidad and Tobago men's international footballers
Men's association football goalkeepers
San Juan Jabloteh F.C. players
AC Port of Spain players
TT Pro League players |
The Eastern Oklahoma Railway was incorporated under the laws of Oklahoma Territory on July 24, 1899. The railroad constructed much of its own track. This included Guthrie junction (Eastern Oklahoma junction) to Cushing junction, 47.9 miles, in the 1900-1902 timeframe; Ripley to Esau Junction (passing through Pawnee), 40.4 miles, also in the 1900-1902 timeframe; Newkirk to Pauls Valley (via Ralston, Cushing and Shawnee), 182.5 miles, in the 1900-1904 timeframe; and, Davis to Sulphur, 9.3 miles, in 1906.
But the railroad also acquired a number of other lines. Purchases included the Guthrie and Western Railway, which had a line from Seward to Cashion,10.6 miles, acquired on June 16, 1902; the Kiowa, Chickasha and Fort Smith Railway, which had a line from Pauls Valley to Lindsay, 24.2 miles, acquired on March 14, 1904; and, the Denver, Enid and Gulf Railroad, which had constructed line from Guthrie to the Oklahoma-Kansas state line near Kiowa, Kansas, 112.1 miles, acquired on May 22, 1907.
The railroad was operated by the Atchison, Topeka and Santa Fe Railway (AT&SF) from its opening day of January 1, 1900. It was sold to the AT&SF, which owned all its capital stock, on June 20, 1907, at which point it had about 477 miles of track. The sale had been previously approved by Congress.
Much of the trackage has since been abandoned.
References
Oklahoma railroads
Defunct Oklahoma railroads |
Teófilo José Jaime María Le Guillou (May 4, 1790 – July 9, 1843) was the founder of the municipality of Vieques, Puerto Rico.
Early years
Le Guillou was born in Quimperlé, France. He immigrated from France to the Island of Guadeloupe in the French West Indies where he became a land owner.
Founder of Vieques Municipality
In 1823, Le Guillou went to the island of Vieques with the intention of purchasing hardwoods. The island at the time had a few residents who were dedicated woodcutters. He was impressed with the island of Vieques and saw the agricultural potential of the island. He returned the following year and purchased lands from a woodcutter named Patricio Ramos. Soon, he established the largest sugar plantation on the island which he named "La Pacience". He then got rid of the pirates and those involved in contraband activities an action which in itself pleased the Spanish colonial government. Le Guillou is considered to be the founder of the municipality of Vieques.
Military commander of Vieques
In 1832, Le Guillou succeeded Francisco Rosello as the military commander of Vieques after Rosello's death. Between 1832 and 1843, Le Guillou who had been given the title of "Political and Military Governor of the Spanish Island of Vieques" by the Spanish Crown, developed a plan for the political and economic organization of the island. He established five sugar plantations in the island named Esperanza, Resolucion, Destino, Mon Repos and Mi Reposo.
French immigrants
Le Guillou, who was the most powerful landlord and owner of slaves in the island, requested from the Spanish Crown permission to allow the immigration of French families from the Caribbean Islands of Martinique and Guadalupe which at the time were French possessions. Attracted by the offer of free land as one of the concessions stipulated in the revised Spanish Royal Decree of 1815, dozens of French families, among them the Mouraille, Martineau and Le Brun families, immigrated to Vieques and, with the use of slave labor, established sugar plantations. By 1839, there were 138 "habitaciones," from the French word "habitation," meaning plantation. These habitaciones were located from Punta Mulas to Punta Arenas.
Later years
Le Guillou died in 1843 and is buried in Las Tumbas de Le Guillou in Isabel Segunda, Vieques Municipality. The town of Isabel II of Vieques was founded in 1844. His wife Madame Guillermina Ana Susana Poncet died in 1855 and is buried alongside Le Guillou. The cemetery where Le Guillou and his wife are buried was officially named "Las Tumbas de J. J. María le Guillou" by the United States Department of the Interior and was listed in the National Register of Historic Places on August 26, 1994, reference #94000923.
See also
List of Puerto Ricans
French immigration to Puerto Rico
References
1790 births
1843 deaths
Puerto Rican people of French descent
Political history of Puerto Rico
19th-century Puerto Rican people |
Ancylolomia umbonella is a moth in the family Crambidae. It was described by Wang and Sung in 1981. It is found in China (Yunnan).
References
Ancylolomia
Moths described in 1981
Moths of Asia |
Cascadia and Cascadian are terms that derive from the Cascade Range and may refer to:
Places
Cascadia, Oregon
Tehaleh, Washington, formerly known as Cascadia
Cascadia State Park
Diocese of Cascadia
Regional
Cascadia Channel, a deep-sea channel in the Pacific Ocean
Cascadia (region) or Pacific Northwest, a region of North America
Cascadia (bioregion), the environmental interactivity of the Pacific Northwest of North America
Cascadia movement, a bioregional movement based within the Cascadia bioregion of the Pacific Northwest of North America
Cascadia subduction zone, a convergent plate boundary that separates the Juan de Fuca and North America plates
Other uses
Cascadia (board game), by Randy Flynn and Shawn Stankewich
Cascadian (horse), a racehorse
Cascadian (train), a named train of the Great Northern Railway (U.S.) on its route between Seattle and Spokane, Washington
Cascadia Code, a monospaced font from Microsoft
Freightliner Cascadia, a semi truck
METAtropolis: Cascadia, a science fiction story collection audiobook
Cascadia, a former plant genus now included in Saxifraga
Cascadia, the codename of Windows Terminal
Cascadia, a fictional country in the video game Project Wingman
Cascadia, a fictional country in the video game Mirror's Edge Catalyst
See also
Acadia
Cascada (disambiguation)
Cascade (disambiguation)
1700 Cascadia earthquake, a magnitude 8.7 to 9.2 megathrust earthquake that occurred in the Cascadia subduction zone on January 26, 1700 |
Calicina mariposa is a species of armoured harvestman in the family Phalangodidae. It is found in North America.
References
Further reading
Harvestmen
Articles created by Qbugbot
Animals described in 1968 |
```javascript
// Spectrum Colorpicker
// Simplified Chinese (zh-cn) localization
// path_to_url
(function ( $ ) {
var localization = $.spectrum.localization["zh-cn"] = {
cancelText: "",
chooseText: "",
clearText: ""
};
$.extend($.fn.spectrum.defaults, localization);
})( jQuery );
``` |
Hisar Mosque (Hisar Camii, meaning the "Fort Mosque") or Hisarönü Mosque (Hisarönü Camii) is a historical Mosque in İzmir, Turkey. It has been recorded to have been constructed by Ottoman governor Aydınoğlu Yakup Bey who was Bey of İzmir between 1592 and 1598. The 16th century Mosque is one of the biggest in the city centre and its interior contains one of the most striking examples of Ottoman Islamic artwork in İzmir.
Architecture
The Mosque has one main dome in the centre facing the entrance supported by eight large pillars along with three large domes on either side. There are three smaller domes at the back of the top. The courtyard has a series of seven domes on the sides. There is a şadırvanı (fountain used for Islamic ritual washing) overlooking the courtyard. The Mosque has been restored in 1813, 1881, 1927 and 1980 after damage.
References
Ottoman mosques in İzmir
Religious buildings and structures completed in 1598
Mosque buildings with domes
Kemeraltı
16th-century mosques |
Wanya Jacques-Keyshawn Morris (born October 10, 2000) is an American football offensive tackle for the Kansas City Chiefs of the National Football League (NFL). He played college football at Tennessee and Oklahoma.
Early life
Morris was born in Grayson, Georgia, and was named for the singer bearing the same name. He attended Grayson High School and was a highly-regarded offensive lineman, being ranked a consensus five-star recruit and receiving attention from nearly every school nationally. Several agencies ranked him among the top-50 recruits nationally. Morris initially committed to Florida State, but then de-committed and switched to Tennessee.
College career
As a true freshman in 2019, Morris started 12 of 13 games for Tennessee at left tackle, earning freshman All-SEC as well as freshman All-America honors. The following year, he posted seven starts, appearing in a further two games, out of 10. After coach Jeremy Pruitt was fired prior to the 2021 season, Morris transferred to Oklahoma. In his first year with the team, he appeared in just six games with no starts, playing only as a backup.
Morris appeared in nine games as a senior in 2022, starting eight and helping lead an offensive line that allowed Eric Gray to run for 1,364 yards and Dillon Gabriel to throw for 2,925 yards with 24 touchdowns. Although he missed two games due to a suspension and one for unspecified reasons, he was able to earn second-team All-Big 12 honors for his play. After the regular season, Morris opted to skip the team's bowl game and declare for the NFL Draft.
Professional career
Morris was drafted by the Kansas City Chiefs in the third round (92nd overall) of the 2023 NFL Draft.
References
2000 births
Living people
American football offensive linemen
Players of American football from Gwinnett County, Georgia
Tennessee Volunteers football players
Oklahoma Sooners football players
Kansas City Chiefs players |
This is a list of notable Presbyterian churches in the United States, where a church is notable either as a congregation or as a building. In the United States, numerous churches are listed on the National Register of Historic Places or are noted on state or local historic registers. Also more than 300 Presbyterian historic sites have been listed by the Presbyterian Historical Society onto the American Presbyterian/Reformed Historic Sites Registry (APRHS); those sites which are churches are ... in progress ... being added here.
This article also includes related other items, such as various former Presbyterian meetinghouse sites, or cemeteries or parsonages that are NRHP-listed where the corresponding church building is more modern and not NRHP-listed.
Alabama
Alaska
Arizona
Arkansas
California
Colorado
Connecticut
Delaware
District of Columbia
Florida
Georgia
Idaho
Illinois
Indiana
Iowa
Kansas
Kentucky
Louisiana
Maryland
Massachusetts
Michigan
Minnesota
Mississippi
Missouri
Montana
Nebraska
Nevada
New Hampshire
New Jersey
New Mexico
New York
North Carolina
North Dakota
Ohio
Oklahoma
Oregon
Pennsylvania
South Carolina
South Dakota
Tennessee
Texas
Utah
Virginia
Washington
West Virginia
Wisconsin
Wyoming
See also
List of Presbyterian churches, worldwide
References
Presbyterian |
```javascript
import React from 'react';
import SvgIcon from '../../SvgIcon';
const EditorFormatTextdirectionRToL = (props) => (
<SvgIcon {...props}>
<path d="M10 10v5h2V4h2v11h2V4h2V2h-8C7.79 2 6 3.79 6 6s1.79 4 4 4zm-2 7v-3l-4 4 4 4v-3h12v-2H8z"/>
</SvgIcon>
);
EditorFormatTextdirectionRToL.displayName = 'EditorFormatTextdirectionRToL';
EditorFormatTextdirectionRToL.muiName = 'SvgIcon';
export default EditorFormatTextdirectionRToL;
``` |
```php
<?php
/**
* FecShop file.
*
* @link path_to_url
* @license path_to_url
*/
namespace fecshop\app\console\modules\Product\controllers;
use Yii;
use yii\console\Controller;
/**
* @author Terry Zhao <2358269014@qq.com>
* @since 1.0
*/
class MysqldatatomongoController extends Controller
{
public $numPerPage = 10;
public function init()
{
parent::init();
Yii::$service->product->changeToMysqlStorage();
}
/**
* 1.
* fecshopmongodb
* mysql
* mongodbmysqlmongodbjoinjoinmongodb
* mongodb
* mongodbmysql
* 2.
* 2.1mysql product_flat_qty mongodb product_flatqty
*/
public function actionSync($pageNum = 1)
{
$filter = [
'numPerPage' => $this->numPerPage,
'pageNum' => $pageNum,
'orderBy' => ['id' => SORT_ASC],
'asArray' => false,
];
$data = Yii::$service->product->coll($filter);
$coll = $data['coll'];
//
$productPrimaryKey = Yii::$service->product->getPrimaryKey();
foreach ($coll as $k=>$product) {
$product_id = $product[$productPrimaryKey];
$categoryIds = Yii::$service->product->getCategoryIdsByProductId($product_id);
$coll[$k]['category'] = is_array($categoryIds) ? $categoryIds : [];
}
// mongodb storage
Yii::$service->product->changeToMongoStorage();
foreach ($coll as $product) {
$arr = [];
foreach ($product as $k => $v) {
if ($k != 'attr_group_info') {
$arr[$k] = $v;
} else if ($k == 'attr_group_info' && is_array($v)) {
foreach ($v as $attr_group_key => $attr_group_val) {
$arr[$attr_group_key] = $attr_group_val;
}
}
}
$arr['category'] = $product['category'];
Yii::$service->product->sync($arr);
}
}
//
public function actionSynccount()
{
$count = Yii::$service->product->collCount();
echo $count ;
}
//
public function actionSyncpagenum()
{
$count = Yii::$service->product->collCount();
echo ceil($count / $this->numPerPage);
}
}
``` |
The Lofa or Loffa is a river whose headwaters originate in eastern Guinea northeast of Macenta. The river runs southwest through northeastern Liberia before draining into the North Atlantic Ocean. Historically it has also been known as the Little Cape Mount River. The Lawa River enters the Lofa River in Liberia's Lofa County.
Indigenous species include the pygmy hippopotamus. Several diamond mining concessions along the Lofa River were granted in the late 1950s and early 1960s.
Notes
Rivers of Guinea
Rivers of Liberia
International rivers of Africa |
The Makings of Me is the fifth studio album by American singer Monica. It was released by J Records on October 3, 2006, in the United States. Built upon the hip hop, gospel and modern quiet storm styles of its predecessor, After the Storm (2003), Monica envisioned her follow-up project to sound as close knit and intimate as her previous project. Consequently, she enlisted frequent collaborators Missy Elliott, Bryan Michael Cox, and Jermaine Dupri to work with her on the album, with the latter serving as its executive producer, as well as new partners such as The Underdogs, Tank, The Runners, LRoc, Swizz Beatz, and Sean Garrett.
The album was released to mostly positive reception from music critics, who applauded Monicas's vocal performances and cited the album a solid addition to her catalogue. Criticism mainly targeted the trendchasing character of snap-influenced lead single "Everytime tha Beat Drop", as well as the album's occasionally unremarkable production. The Makings of Me debuted at number eight on the US Billboard 200 and topped the Billboards Top R&B/Hip-Hop Albums chart—becoming her first album to do so, with first week sales of 93,000 copies. As of 2010 the album has sold 328,000 copies, according to Billboard.
The Makings of Me produced four commercial singles, with "Everytime tha Beat Drop", a collaboration with rap group Dem Franchize Boyz, becoming the album's only entry on the Billboard Hot 100. Subsequent singles such as "A Dozen Roses (You Remind Me)" and "Sideline Ho" failed to chart on the Hot 100 or sell noticeably on any other chart. Disappointed by its performance, Monica later expressed her discontent of the album's promotional campaign. The Makings of Me earned a Soul Train Music Award nomination in the Best R&B/Soul Album – Female category and was reissued in April 2007, featuring free ringtones for "The First Night", a free cellphone wallpaper, and a blow-in card was sold by Walmart.
Background
In June 2003, following several revamps and numerous delays, J Records released Monica's fourth studio album After the Storm in the United States. It debuted at number one on the US Billboard 200, her first album to do so, and produced three singles that attained Billboard chart success, including chart topper "So Gone". The following year, she announced that she was expecting her first child. While most of her fifth album was not recorded before the birth of her son Rocko in May 2005, the singer met several producers and songwriters in preparation of her album during her pregnancy, involving Missy Elliott and her regular co-producers Cainon Lamb and Craig Brockman as well as Bryan Michael Cox and Jermaine Dupri, with Dupri again taking over executive production duties alongside Monica after Elliott had replaced him in this position on After the Storm following the retooling of original album All Eyez on Me (2002).
While both Elliott and Dupri contributed most to the album, Monica was anxious to keep the number of collaborators close knit and intimate and thus, settled on working with a small amount of additional producers, including Sean Garrett, Harold Lilly, Swizz Beatz, Tank and The Underdogs. In total, their sessions resulted in forty finished records. At different times, Monica also recorded with duo Dre & Vidal as well as Tricky Stewart, Scott Storch, Jazze Pha, No I.D., and rappers Mannie Fresh, Akon and Young Jeezy, though none of the songs produced with them eventually made the final track listing. Some of them, however, such as "Ain't Nothing", "So in Love", and "Why Lie", appeared on her 2007 mixtape Greg Street Present......Monica Made: The Mixtape or were later leaked onto the internet.
Although the project was tentatively titled Street Butterfly, Raw, or A Dozen Roses at one time or another, the album was eventually named after Curtis Mayfield's song "The Makings of You" from his solo debut album Curtis (1970), which is sampled in the Elliott-produced song "A Dozen Roses (You Remind Me)": "With a dozen roses / Such will astound you / The joy of children laughing around you / These are the makings of you." When asked about the meaning of the title, Monica elaborated in a 2006 interview with Billboard that "this album is really the makings of me because it talks about so many different scenarios, both good and bad, that have pretty much brought me to the point where I'm at mentally," she said, comparing it with a "musical diary where people can really see me in a lot of different lights for once."
Lyrical themes
Although Monica received neither a producing nor a songwriting credit on The Makings of Me, the album was widely addressed as her most personal effort yet. The singer attributed the personal sound of the album to the words of her self-written poetries, she has started writing in the late 1990s and of which about half of the songs on the album are based on. Having used the writings before to inspire the themes of the tracks for previous albums All Eyez on Me (2002) and After the Storm (2003), it was actually the first time she handed the poems over to her songwriters. "That was kind of private [to hand over]," Monica said in an interview with Deseret News. "It was going into the hands of about seven or eight people. It was difficult to do something like that the first time around." Feeling obligated to unveil her true thoughts about past relationships, writers Tank, Manuel Seal and others crafted songs such as "Sideline Ho" and "Why Her", which were inspired by the poems or their backstories.
The album contains several references to Atlanta, Georgia and alludes to contemporary fashion labels such as Gucci, and automobile manufacturers Bentley and Mercedes Benz. On "A Dozen Roses (You Remind Me)", singers R. Kelly and Gladys Knight are mentioned. Although Monica intended for the album to include some light recordings, she stated that The Makings of Me "is not an album for kids". "This album is very, very different from the other ones, because of me personally. Now, at 26, the way I look at things, even relationships, I was really able to involve more of my life experiences in the album," Monica said to MTV News, adding: "I had to tell my story [...] There are too many people who have been in the same situation as me and really don't know their way out. Hopefully through my words, what I say can open a door."
Music
"Everytime tha Beat Drop", one of the last songs recorded for The Makings of Me, was chosen as the lead single to show "something that appears on the outside to be different from" Monica and, in addition, represents her hometown Atlanta. Greatly influenced by snap music, the track incorporates beats of Nelly's 2005 single "Grillz" and a sample of the 2006 single "Lean wit It, Rock wit It", as performed by Dem Franchize Boyz. The song received lukewarm reviews, noted as "a decent but ultimately forgettable [...] obligatory club track", and was a mediocre success, reaching the top twenty on the U.S. Billboard Hot R&B/Hip-Hop Songs chart only. The second single, Elliott-penned "A Dozen Roses (You Remind Me)", underperformed. The song, a modern rework of Curtis Mayfield's 1972 single "The Makings of You", was the last music video-accompanied release from the album.
"Sideline Ho", the third track, was written and produced by fellow R&B musician Tank. Based upon a self-written poem by Monica, the lyrics of the song were inspired by an ex who cheated on her with a video model. It was released as the album's third single, and although the song saw a comparatively successful debut on the charts, J Records refused to agree on producing a music video for the song, with ideas for a video treatment being eventually scrapped. The fourth track, Jermaine Dupri-produced "Why Her", serves as a direct follow-up to "Sideline Ho" and was also inspired by a poem. "After all the anger and the smoke cleared, the next one that I wrote was Why Her. And I thought it was really clever [...] to create songs off of my poems like that," Monica said. The song received a generally positive reception from music critics, and was compared to Mariah Carey's 2005 recording "We Belong Together". "Hell No (Leave Home)", the fifth track, has Monica trading verses with fast-paced rapper Twista. The singer commented the recording of the rhymes as comical: "He [Twista] had so much patience with me and allowed me to learn his way of rapping. Of course, rapping isn't what I do, but I did enjoy the experience. The way I learned best was with him in the booth." Released as the final single from the album, it was released to no commercial success.
"Doin' Me Right", built around a sample of The Whispers' 1976 "Chocolate Girl", was noted as one of the "few songs about good men" on The Makings of Me, alongside Underdogs-crafted "My Everything". Considered as this album's "Knock Knock" (the second single from 2003's After the Storm), it was praised by critics who called the track "another sweet twist on a soft-soul classic." The seventh track, "Raw", features production and guest vocals by Swizz Beatz and was noted the only upbeat track on the album next to "Everytime tha Beat Drop". It chronicles the protagonist's lament on so-called "playas" over a speaker-jarring 808 beat, and received mixed reviews. "Gotta Move On", the ninth track, incorporates minor elements of oriental music. Featuring backing vocals by singer Tweet, it was declared "a kiss-off dipped in honey" by Allmusic. The closing track, "Getaway", is an all-piano song, except for a few accents from a snare drum briefly throughout the tune. It discusses the witnessing of Monica's former boyfriend Jarvis Weems' death in 2000.
Singles and promotion
Altogether The Makings of Me spawned four singles: The lead album's first single, Dupri-produced "Everytime tha Beat Drop" barely made it to top fifty on the US Billboard Hot 100 chart with a peak position of number forty-eight only, becoming Monica's least successful lead single since 2002's "All Eyez on Me". It, however, reached number eleven on the Hot R&B/Hip-Hop Songs chart, and number seven on the World R&B Top 30 Singles chart. The second and third singles from the album, "A Dozen Roses (You Remind Me)" and "Sideline Ho", underquoted this success with peak positions of number forty-eight and forty-five respectively on the Hot R&B/Hip-Hop Songs, never making it to the official Billboard Hot 100. A fourth single, "Hell No (Leave Home)" was serviced to U.S. radios on May 14, 2007, achieving similar success. In support of the singles releases, Monica appeared on BET's 106 & Park and Blueprint, and performed on The Ellen DeGeneres Show.
Critical reception
The Makings of Me received generally positive reviews from most professional music critics. Andy Kellman of AllMusic gave the album four stars out of five and called it a "concise and mostly sweet (if occasionally unremarkable) set of songs", especially praising Elliott's input on the album. Ryan Dombal of Entertainment Weekly declared it "a solid addition" to Monica's discography, and although he saw her faltering on ballads such as "My Everything", he added: "the singer hints at mature contentment on her fourth CD — while retaining some angry edge, [...] scoring tough-talking venom." USA Today writer Steve Jones, on the other hand, wrote: "Sweet ballads like 'My Everything' and the Curtis Mayfield-laced 'A Dozen Roses (You Remind Me)' find her nicely contented having found the one. But do her wrong or play her soft and she'll unleash a torrent of scorn [...] In the mid-90s, she was the sassy 14-year-old Miss Thang. Now she's full grown and not to be fooled with. Still, she can get the dancefloor popping."
People magazine gave the album three stars out of four. It found that "her fourth disc, demonstrates why the singer has been able to outlast many an R&B ingenue." In a mixed review, Clover Hope of Billboard magazine wrote that "while The Makings of Me has its needless trendchasing moments, her rich voice and prime subject are the main draw". He criticized the album for its "avoidable" lead single "Everytime tha Beat Drop", writing that "Monica is good enough without the fluff." In his review for About.com, Mark Edward Nero noted The Makings of Me "a very personal album that listening to it is almost like reading a diary", and while he applauded the songwriting and song production as "excellent", he cited a "lack of emotion" in Monica's voice: "She cuts loose, but for the most part, Monica seems more concerned with pitch-perfect singing than singing with genuine emotion. In addition, he also criticised the shortness of the album. USA Today gave the album three stars out of four and called Monica "full grown and not to be fooled with", while Ebony hailed the album as "full of variety, depth, and maturity."
Commercial performance
During the week of October 21, 2006, The Makings of Me debuted and peaked at number eight on the Billboard 200 chart, with first week sales of 93,000 copies. On the Top R&B/Hip-Hop Albums chart, the album, debuted at number-one, becoming Monica's first album to reach the top spot on the R&B/Hip-Hop Albums chart. By December 2008, the album had sold 314,000 copies, and as of 2010 it has sold over 328,000 copies domestically. This album marks the first album by Monica to not receive a certification by the Recording Industry Association of America (RIAA) to date. Outside of the United States, the album debuted at number seventy-five on the Japanese Albums Chart.
With The Makings of Me comprising an outweighing slower set of mid-tempo recording and ballads, J Records's decision to release up-tempo record "Everytime tha Beat Drop", an eleventh-hour addition to the album that had originally been recorded for a different project, to lead it, was met with mixed reaction from Monica's team. While she considered the song a not unwelcome breakaway from her sound, Monica later blamed the selection on the album's overall performance since she felt that "Everytime tha Beat Drop" did not speak to her core audience and was a poor representation of the album as a whole. After The Makings of Mes commercial underperformance, she felt obliged to follow a more authentic approach on her next project Still Standing which abandoned "all the different gimmicks and trends" in favor of a record that lived up to the sound her previous hits, particularly those from the 1990s.
Track listing
Notes
denotes co-producer
Sample credits
"Everytime tha Beat Drop" contains a samples of Dem Franchize Boyz' 2006 "Lean wit It, Rock wit It".
"A Dozen Roses (You Remind Me)" contains a samples of Curtis Mayfield's 1972 "The Makings of Me".
"Doin' Me Right" contains a samples of The Whispers' 1976 "Chocolate Girl".
Personnel
Credits are taken from The Makings of Me liner notes.
Managerial
Monica Arnold – album producer, executive producer
Clive Davis – album producer
Melinda Dancil – associate executive producer
Jermaine Dupri – executive producer
Lary Jackson – album producer
Performance credits
Monica Arnold – lead vocals (tracks 1–2, 5–7, 9), background vocals (2, 5–6), All vocals (3–4, 8, 10)
Swizz Beatz – vocal assistance (track 7)
Dem Franchize Boyz – vocal assistance, sampled background vocals (track 1)
Missy Elliott – background and additional lead vocals (tracks 2, 6, 9)
Tweet – background vocals (track 9)
Twista – vocal assistance (track 5)
Visuals and imagery
Jane Morledge – design
Chris Lebeau – art direction
Markus Klinko and Indrani – photography
GK Reid – styling
Technical and production
Angel Aponte – recording engineer (track 7)
Corte Ellis – recording engineer (tracks 6, 9)
Paul J. Falcone – recording engineer (tracks 2, 6, 9), audio mixing (6)
John Horesco IV – recording engineer (tracks 1, 4, 10)
David Kutch – mastering
Samuel "Vaughan" Merrick – vocal recording engineer (track 5)
Tadd "Rowdy Rik" Mingo – recording engineer (tracks 1, 4, 10)
Vernon Mungo – recording engineer (track 7)
Sam Thomas – additional instrumental recording engineer, additional music editing (track 5)
Musicians
Adelaide Federici – violin (track 10)
Karen Freer – cello (track 10)
P. David Hancock – cello (track 10)
Helen Kim – violin (track 10)
Tom Knight – live drums (track 10)
Alice Lord – viola (track 10)
PJ Morton – live piano, keyboards (track 10)
Tania Maxwell Clements – viola (track 10)
Jackie Pickett – double bass (track 10)
Charts
Weekly charts
Year-end charts
Release history
References
2006 albums
Monica (singer) albums
J Records albums
Albums produced by Bryan-Michael Cox
Albums produced by Swizz Beatz
Albums produced by Jermaine Dupri
Albums produced by Missy Elliott
Albums produced by Sean Garrett
Albums produced by the Underdogs (production team) |
```c
/*********************************************************************/
/* All rights reserved. */
/* */
/* Redistribution and use in source and binary forms, with or */
/* without modification, are permitted provided that the following */
/* conditions are met: */
/* */
/* 1. Redistributions of source code must retain the above */
/* copyright notice, this list of conditions and the following */
/* disclaimer. */
/* */
/* 2. Redistributions in binary form must reproduce the above */
/* copyright notice, this list of conditions and the following */
/* disclaimer in the documentation and/or other materials */
/* provided with the distribution. */
/* */
/* THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY OF TEXAS AT */
/* AUSTIN ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, */
/* INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF */
/* MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE */
/* DISCLAIMED. IN NO EVENT SHALL THE UNIVERSITY OF TEXAS AT */
/* AUSTIN OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, */
/* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES */
/* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE */
/* GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR */
/* BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF */
/* LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT */
/* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT */
/* OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE */
/* POSSIBILITY OF SUCH DAMAGE. */
/* */
/* The views and conclusions contained in the software and */
/* documentation are those of the authors and should not be */
/* interpreted as representing official policies, either expressed */
/* or implied, of The University of Texas at Austin. */
/*********************************************************************/
#include <stdio.h>
#include "common.h"
int CNAME(BLASLONG m, BLASLONG n, FLOAT *a, BLASLONG lda, BLASLONG posX, BLASLONG posY, FLOAT *b){
BLASLONG i, js;
BLASLONG X;
FLOAT data01, data02, data03, data04, data05, data06, data07, data08;
FLOAT data09, data10, data11, data12, data13, data14, data15, data16;
FLOAT *ao1, *ao2, *ao3, *ao4;
js = (n >> 2);
if (js > 0){
do {
X = posX;
if (posX <= posY) {
ao1 = a + posX + (posY + 0) * lda;
ao2 = a + posX + (posY + 1) * lda;
ao3 = a + posX + (posY + 2) * lda;
ao4 = a + posX + (posY + 3) * lda;
} else {
ao1 = a + posY + (posX + 0) * lda;
ao2 = a + posY + (posX + 1) * lda;
ao3 = a + posY + (posX + 2) * lda;
ao4 = a + posY + (posX + 3) * lda;
}
i = (m >> 2);
if (i > 0) {
do {
if (X < posY) {
data01 = *(ao1 + 0);
data02 = *(ao1 + 1);
data03 = *(ao1 + 2);
data04 = *(ao1 + 3);
data05 = *(ao2 + 0);
data06 = *(ao2 + 1);
data07 = *(ao2 + 2);
data08 = *(ao2 + 3);
data09 = *(ao3 + 0);
data10 = *(ao3 + 1);
data11 = *(ao3 + 2);
data12 = *(ao3 + 3);
data13 = *(ao4 + 0);
data14 = *(ao4 + 1);
data15 = *(ao4 + 2);
data16 = *(ao4 + 3);
b[ 0] = data01;
b[ 1] = data05;
b[ 2] = data09;
b[ 3] = data13;
b[ 4] = data02;
b[ 5] = data06;
b[ 6] = data10;
b[ 7] = data14;
b[ 8] = data03;
b[ 9] = data07;
b[10] = data11;
b[11] = data15;
b[12] = data04;
b[13] = data08;
b[14] = data12;
b[15] = data16;
ao1 += 4;
ao2 += 4;
ao3 += 4;
ao4 += 4;
b += 16;
} else
if (X > posY) {
ao1 += 4 * lda;
ao2 += 4 * lda;
ao3 += 4 * lda;
ao4 += 4 * lda;
b += 16;
} else {
#ifdef UNIT
data05 = *(ao2 + 0);
data09 = *(ao3 + 0);
data10 = *(ao3 + 1);
data13 = *(ao4 + 0);
data14 = *(ao4 + 1);
data15 = *(ao4 + 2);
b[ 0] = ONE;
b[ 1] = data05;
b[ 2] = data09;
b[ 3] = data13;
b[ 4] = ZERO;
b[ 5] = ONE;
b[ 6] = data10;
b[ 7] = data14;
b[ 8] = ZERO;
b[ 9] = ZERO;
b[10] = ONE;
b[11] = data15;
b[12] = ZERO;
b[13] = ZERO;
b[14] = ZERO;
b[15] = ONE;
#else
data01 = *(ao1 + 0);
data05 = *(ao2 + 0);
data06 = *(ao2 + 1);
data09 = *(ao3 + 0);
data10 = *(ao3 + 1);
data11 = *(ao3 + 2);
data13 = *(ao4 + 0);
data14 = *(ao4 + 1);
data15 = *(ao4 + 2);
data16 = *(ao4 + 3);
b[ 0] = data01;
b[ 1] = data05;
b[ 2] = data09;
b[ 3] = data13;
b[ 4] = ZERO;
b[ 5] = data06;
b[ 6] = data10;
b[ 7] = data14;
b[ 8] = ZERO;
b[ 9] = ZERO;
b[10] = data11;
b[11] = data15;
b[12] = ZERO;
b[13] = ZERO;
b[14] = ZERO;
b[15] = data16;
#endif
ao1 += 4;
ao2 += 4;
ao3 += 4;
ao4 += 4;
b += 16;
}
X += 4;
i --;
} while (i > 0);
}
i = (m & 3);
if (i) {
if (X < posY) {
if (m & 2) {
data01 = *(ao1 + 0);
data02 = *(ao1 + 1);
data03 = *(ao2 + 0);
data04 = *(ao2 + 1);
data05 = *(ao3 + 0);
data06 = *(ao3 + 1);
data07 = *(ao4 + 0);
data08 = *(ao4 + 1);
b[ 0] = data01;
b[ 1] = data03;
b[ 2] = data05;
b[ 3] = data07;
b[ 4] = data02;
b[ 5] = data04;
b[ 6] = data06;
b[ 7] = data08;
ao1 += 2;
ao2 += 2;
ao3 += 2;
ao4 += 2;
b += 8;
}
if (m & 1) {
data01 = *(ao1 + 0);
data03 = *(ao2 + 0);
data05 = *(ao3 + 0);
data07 = *(ao4 + 0);
b[ 0] = data01;
b[ 1] = data03;
b[ 2] = data05;
b[ 3] = data07;
ao1 += 1;
ao2 += 1;
ao3 += 1;
ao4 += 1;
b += 4;
}
} else
if (X > posY) {
if (m & 2) {
ao1 += 2 * lda;
ao2 += 2 * lda;
b += 8;
}
if (m & 1) {
ao1 += lda;
b += 4;
}
} else {
#ifdef UNIT
data05 = *(ao2 + 0);
data09 = *(ao3 + 0);
data13 = *(ao4 + 0);
if (i >= 2) {
data10 = *(ao3 + 1);
data14 = *(ao4 + 1);
}
if (i >= 3) {
data15 = *(ao4 + 2);
}
b[ 0] = ONE;
b[ 1] = data05;
b[ 2] = data09;
b[ 3] = data13;
b += 4;
if(i >= 2) {
b[ 0] = ZERO;
b[ 1] = ONE;
b[ 2] = data10;
b[ 3] = data14;
b += 4;
}
if (i >= 3) {
b[ 0] = ZERO;
b[ 1] = ZERO;
b[ 2] = ONE;
b[ 3] = data15;
b += 4;
}
#else
data01 = *(ao1 + 0);
data05 = *(ao2 + 0);
data09 = *(ao3 + 0);
data13 = *(ao4 + 0);
if (i >= 2) {
data06 = *(ao2 + 1);
data10 = *(ao3 + 1);
data14 = *(ao4 + 1);
}
if (i >= 3) {
data11 = *(ao3 + 2);
data15 = *(ao4 + 2);
}
b[ 0] = data01;
b[ 1] = data05;
b[ 2] = data09;
b[ 3] = data13;
b += 4;
if(i >= 2) {
b[ 0] = ZERO;
b[ 1] = data06;
b[ 2] = data10;
b[ 3] = data14;
b += 4;
}
if (i >= 3) {
b[ 0] = ZERO;
b[ 1] = ZERO;
b[ 2] = data11;
b[ 3] = data15;
b += 4;
}
#endif
}
}
posY += 4;
js --;
} while (js > 0);
} /* End of main loop */
if (n & 2){
X = posX;
if (posX <= posY) {
ao1 = a + posX + (posY + 0) * lda;
ao2 = a + posX + (posY + 1) * lda;
} else {
ao1 = a + posY + (posX + 0) * lda;
ao2 = a + posY + (posX + 1) * lda;
}
i = (m >> 1);
if (i > 0) {
do {
if (X < posY) {
data01 = *(ao1 + 0);
data02 = *(ao1 + 1);
data05 = *(ao2 + 0);
data06 = *(ao2 + 1);
b[ 0] = data01;
b[ 1] = data05;
b[ 2] = data02;
b[ 3] = data06;
ao1 += 2;
ao2 += 2;
b += 4;
} else
if (X > posY) {
ao1 += 2 * lda;
ao2 += 2 * lda;
b += 4;
} else {
#ifdef UNIT
data05 = *(ao2 + 0);
b[ 0] = ONE;
b[ 1] = data05;
b[ 2] = ZERO;
b[ 3] = ONE;
#else
data01 = *(ao1 + 0);
data05 = *(ao2 + 0);
data06 = *(ao2 + 1);
b[ 0] = data01;
b[ 1] = data05;
b[ 2] = ZERO;
b[ 3] = data06;
#endif
ao1 += 2 * lda;
ao2 += 2 * lda;
b += 4;
}
X += 2;
i --;
} while (i > 0);
}
i = (m & 1);
if (i) {
if (X < posY) {
data01 = *(ao1 + 0);
data05 = *(ao2 + 0);
b[ 0] = data01;
b[ 1] = data05;
ao1 += 1;
ao2 += 1;
b += 2;
} else
if (X > posY) {
ao1 += lda;
ao2 += lda;
b += 2;
} else {
#ifdef UNIT
data05 = *(ao2 + 0);
b[ 0] = ONE;
b[ 1] = data05;
#else
data01 = *(ao1 + 0);
data05 = *(ao2 + 0);
b[ 0] = data01;
b[ 1] = data05;
#endif
ao1 += lda;
ao2 += lda;
b += 2;
}
}
posY += 2;
}
if (n & 1){
X = posX;
if (posX <= posY) {
ao1 = a + posX + (posY + 0) * lda;
} else {
ao1 = a + posY + (posX + 0) * lda;
}
i = m;
if (m > 0) {
do {
if (X < posY) {
data01 = *(ao1 + 0);
b[ 0] = data01;
ao1 += 1;
b += 1;
} else
if (X > posY) {
ao1 += lda;
b += 1;
} else {
#ifdef UNIT
b[ 0] = ONE;
#else
data01 = *(ao1 + 0);
b[ 0] = data01;
#endif
ao1 += lda;
b += 1;
}
X += 1;
i --;
} while (i > 0);
}
}
return 0;
}
``` |
```javascript
"use strict";
const CSSStyleDeclaration = require("cssstyle").CSSStyleDeclaration;
const notImplemented = require("./not-implemented");
const History = require("./history");
const VirtualConsole = require("../virtual-console");
const define = require("../utils").define;
const inherits = require("../utils").inheritFrom;
const EventTarget = require("../living/generated/EventTarget");
const namedPropertiesWindow = require("../living/named-properties-window");
const cssom = require("cssom");
const postMessage = require("../living/post-message");
const DOMException = require("../web-idl/DOMException");
const btoa = require("abab").btoa;
const atob = require("abab").atob;
const idlUtils = require("../living/generated/utils");
const internalConstants = require("../living/helpers/internal-constants");
const createFileReader = require("../living/file-reader");
const createXMLHttpRequest = require("../living/xmlhttprequest");
// NB: the require() must be after assigning `module.export` because this require() is circular
module.exports = Window;
const dom = require("../living");
const cssSelectorSplitRE = /((?:[^,"']|"[^"]*"|'[^']*')+)/;
const defaultStyleSheet = cssom.parse(require("./default-stylesheet"));
dom.Window = Window;
// NOTE: per path_to_url#Global, all properties on the Window object must be own-properties.
// That is why we assign everything inside of the constructor, instead of using a shared prototype.
// You can verify this in e.g. Firefox or Internet Explorer, which do a good job with Web IDL compliance.
function Window(options) {
EventTarget.setup(this);
const window = this;
///// INTERFACES FROM THE DOM
// TODO: consider a mode of some sort where these are not shared between all DOM instances
// It'd be very memory-expensive in most cases, though.
define(window, dom);
///// PRIVATE DATA PROPERTIES
// vm initialization is defered until script processing is activated (in level1/core)
this._globalProxy = this;
this.__timers = [];
// List options explicitly to be clear which are passed through
this._document = new dom.HTMLDocument({
parsingMode: options.parsingMode,
contentType: options.contentType,
cookieJar: options.cookieJar,
parser: options.parser,
url: options.url,
referrer: options.referrer,
cookie: options.cookie,
deferClose: options.deferClose,
resourceLoader: options.resourceLoader,
concurrentNodeIterators: options.concurrentNodeIterators,
pool: options.pool,
agentOptions: options.agentOptions,
userAgent: options.userAgent,
defaultView: this._globalProxy,
global: this
});
// Set up the window as if it's a top level window.
// If it's not, then references will be corrected by frame/iframe code.
this._parent = this._top = this._globalProxy;
// This implements window.frames.length, since window.frames returns a
// self reference to the window object. This value is incremented in the
// HTMLFrameElement init function (see: level2/html.js).
this._length = 0;
if (options.virtualConsole) {
if (options.virtualConsole instanceof VirtualConsole) {
this._virtualConsole = options.virtualConsole;
} else {
throw new TypeError(
"options.virtualConsole must be a VirtualConsole (from createVirtualConsole)");
}
} else {
this._virtualConsole = new VirtualConsole();
}
///// GETTERS
define(this, {
get length() {
return window._length;
},
get window() {
return window._globalProxy;
},
get frames() {
return window._globalProxy;
},
get self() {
return window._globalProxy;
},
get parent() {
return window._parent;
},
get top() {
return window._top;
},
get document() {
return window._document;
},
get location() {
return window._document._location;
}
});
namedPropertiesWindow.initializeWindow(this, dom.HTMLCollection);
///// METHODS for [ImplicitThis] hack
// See path_to_url
this.addEventListener = this.addEventListener.bind(this);
this.removeEventListener = this.removeEventListener.bind(this);
this.dispatchEvent = this.dispatchEvent.bind(this);
///// METHODS
this.setTimeout = function (fn, ms) {
return startTimer(window, setTimeout, clearTimeout, fn, ms);
};
this.setInterval = function (fn, ms) {
return startTimer(window, setInterval, clearInterval, fn, ms);
};
this.clearInterval = stopTimer.bind(this, window);
this.clearTimeout = stopTimer.bind(this, window);
this.__stopAllTimers = stopAllTimers.bind(this, window);
this.Image = function (width, height) {
const element = window._document.createElement("img");
element.width = width;
element.height = height;
return element;
};
function wrapConsoleMethod(method) {
return function () {
const args = Array.prototype.slice.call(arguments);
window._virtualConsole.emit.apply(window._virtualConsole, [method].concat(args));
};
}
this.postMessage = postMessage;
this.atob = function (str) {
const result = atob(str);
if (result === null) {
throw new DOMException(DOMException.INVALID_CHARACTER_ERR,
"The string to be decoded contains invalid characters.");
}
return result;
};
this.btoa = function (str) {
const result = btoa(str);
if (result === null) {
throw new DOMException(DOMException.INVALID_CHARACTER_ERR,
"The string to be encoded contains invalid characters.");
}
return result;
};
this.FileReader = createFileReader(this);
this.XMLHttpRequest = createXMLHttpRequest(this);
// TODO: necessary for Blob and FileReader due to different-globals weirdness; investigate how to avoid this.
this.ArrayBuffer = ArrayBuffer;
this.Int8Array = Int8Array;
this.Uint8Array = Uint8Array;
this.Uint8ClampedArray = Uint8ClampedArray;
this.Int16Array = Int16Array;
this.Uint16Array = Uint16Array;
this.Int32Array = Int32Array;
this.Uint32Array = Uint32Array;
this.Float32Array = Float32Array;
this.Float64Array = Float64Array;
this.stop = function () {
if (this._document[internalConstants.requestManager]) {
this._document[internalConstants.requestManager].close();
}
};
this.close = function () {
// Recursively close child frame windows, then ourselves.
const currentWindow = this;
(function windowCleaner(windowToClean) {
for (let i = 0; i < windowToClean.length; i++) {
windowCleaner(windowToClean[i]);
}
// We"re already in our own window.close().
if (windowToClean !== currentWindow) {
windowToClean.close();
}
}(this));
// Clear out all listeners. Any in-flight or upcoming events should not get delivered.
idlUtils.implForWrapper(this)._eventListeners = Object.create(null);
if (this._document) {
if (this._document.body) {
this._document.body.innerHTML = "";
}
if (this._document.close) {
// It's especially important to clear out the listeners here because document.close() causes a "load" event to
// fire.
this._document._listeners = Object.create(null);
this._document.close();
}
const doc = this._document;
delete this._document;
// Stops the connections after document deletion because the listeners will not be triggered once document deleted
if (doc[internalConstants.requestManager]) {
doc[internalConstants.requestManager].close();
}
}
stopAllTimers(currentWindow);
};
this.getComputedStyle = function (node) {
const s = node.style;
const cs = new CSSStyleDeclaration();
const forEach = Array.prototype.forEach;
function setPropertiesFromRule(rule) {
if (!rule.selectorText) {
return;
}
const selectors = rule.selectorText.split(cssSelectorSplitRE);
let matched = false;
for (const selectorText of selectors) {
if (selectorText !== "" && selectorText !== "," && !matched && matchesDontThrow(node, selectorText)) {
matched = true;
forEach.call(rule.style, property => {
cs.setProperty(property, rule.style.getPropertyValue(property), rule.style.getPropertyPriority(property));
});
}
}
}
function readStylesFromStyleSheet(sheet) {
forEach.call(sheet.cssRules, rule => {
if (rule.media) {
if (Array.prototype.indexOf.call(rule.media, "screen") !== -1) {
forEach.call(rule.cssRules, setPropertiesFromRule);
}
} else {
setPropertiesFromRule(rule);
}
});
}
readStylesFromStyleSheet(defaultStyleSheet);
forEach.call(node.ownerDocument.styleSheets, readStylesFromStyleSheet);
forEach.call(s, property => {
cs.setProperty(property, s.getPropertyValue(property), s.getPropertyPriority(property));
});
return cs;
};
///// PUBLIC DATA PROPERTIES (TODO: should be getters)
this.history = new History(this);
this.console = {
assert: wrapConsoleMethod("assert"),
clear: wrapConsoleMethod("clear"),
count: wrapConsoleMethod("count"),
debug: wrapConsoleMethod("debug"),
error: wrapConsoleMethod("error"),
group: wrapConsoleMethod("group"),
groupCollapse: wrapConsoleMethod("groupCollapse"),
groupEnd: wrapConsoleMethod("groupEnd"),
info: wrapConsoleMethod("info"),
log: wrapConsoleMethod("log"),
table: wrapConsoleMethod("table"),
time: wrapConsoleMethod("time"),
timeEnd: wrapConsoleMethod("timeEnd"),
trace: wrapConsoleMethod("trace"),
warn: wrapConsoleMethod("warn")
};
function notImplementedMethod(name) {
return function () {
notImplemented(name, window);
};
}
define(this, {
navigator: {
get userAgent() {
return options.userAgent;
},
get appName() {
return "Node.js jsDom";
},
get platform() {
return process.platform;
},
get appVersion() {
return process.version;
},
noUI: true,
get cookieEnabled() {
return true;
}
},
name: "nodejs",
innerWidth: 1024,
innerHeight: 768,
outerWidth: 1024,
outerHeight: 768,
pageXOffset: 0,
pageYOffset: 0,
screenX: 0,
screenY: 0,
screenLeft: 0,
screenTop: 0,
scrollX: 0,
scrollY: 0,
scrollTop: 0,
scrollLeft: 0,
screen: {
width: 0,
height: 0
},
alert: notImplementedMethod("window.alert"),
blur: notImplementedMethod("window.blur"),
confirm: notImplementedMethod("window.confirm"),
createPopup: notImplementedMethod("window.createPopup"),
focus: notImplementedMethod("window.focus"),
moveBy: notImplementedMethod("window.moveBy"),
moveTo: notImplementedMethod("window.moveTo"),
open: notImplementedMethod("window.open"),
print: notImplementedMethod("window.print"),
prompt: notImplementedMethod("window.prompt"),
resizeBy: notImplementedMethod("window.resizeBy"),
resizeTo: notImplementedMethod("window.resizeTo"),
scroll: notImplementedMethod("window.scroll"),
scrollBy: notImplementedMethod("window.scrollBy"),
scrollTo: notImplementedMethod("window.scrollTo"),
toString: () => {
return "[object Window]";
}
});
///// INITIALIZATION
process.nextTick(() => {
if (!window.document) {
return; // window might've been closed already
}
if (window.document.readyState === "complete") {
const ev = window.document.createEvent("HTMLEvents");
ev.initEvent("load", false, false);
window.dispatchEvent(ev);
} else {
window.document.addEventListener("load", () => {
const ev = window.document.createEvent("HTMLEvents");
ev.initEvent("load", false, false);
window.dispatchEvent(ev);
});
}
});
}
inherits(EventTarget.interface, Window, EventTarget.interface.prototype);
function matchesDontThrow(el, selector) {
try {
return el.matches(selector);
} catch (e) {
return false;
}
}
function startTimer(window, startFn, stopFn, callback, ms) {
const res = startFn(callback, ms);
window.__timers.push([res, stopFn]);
return res;
}
function stopTimer(window, id) {
if (typeof id === "undefined") {
return;
}
for (const i in window.__timers) {
if (window.__timers[i][0] === id) {
window.__timers[i][1].call(window, id);
window.__timers.splice(i, 1);
break;
}
}
}
function stopAllTimers(window) {
for (const t of window.__timers) {
t[1].call(window, t[0]);
}
window.__timers = [];
}
``` |
Munster is the southernmost province of Ireland, comprising the counties of Clare, Cork, Kerry, Limerick, Tipperary and Waterford.
Munster may also refer to:
Places
Australia
Munster, Western Australia, a suburb of Perth
Canada
Munster, Ontario, a neighbourhood in Ottawa
France
Munster, Haut-Rhin, a town in Alsace, France
Munster, Moselle, a village in Lorraine, France
Germany
Münster, an independent city in North Rhine-Westphalia
Munster, Lower Saxony, a town, site of military installations
Munster Training Area (Truppenübungsplatz Munster)
Ireland
Munster (European Parliament constituency)
South Africa
Munster, KwaZulu-Natal, a town on the south coast of KwaZulu-Natal, South Africa
United States
Munster, Illinois
Munster, Indiana
Munster Township, Pennsylvania, a locality in Cambria County
People with the surname
Cameron Munster (born 1994), Australian rugby league player
Jan van Munster (born 1939), Dutch artist
Tess Munster (born 1985), American plus-sized model
Other
The Munsters, a U.S. television series
Munster cheese, a French cheese
Munster GAA, one of the four provincial councils of the Gaelic Athletic Association
Munster Rugby, one of four provincial branches of the Irish Rugby Football Union and the professional rugby team operated by this body
MV Munster, a series of passenger ferries in the Epirotiki Line
See also |
Sonprayag is a village in the Rudraprayag district of Uttarakhand state in India. Approx. 73 Kilometres from Rudraprayag Town, the district headquarter. Situated on the banks of river Mandakini River, it is a proposed Y-forked railway junction on Chota Char Dham Railway for two different railways going to Kedarnath and Badrinath.
Geography
Nearby are Kedarnath and Badrinath, the holiest places of Hinduism called Chota Char Dham.
Transport
It is a terminating junction on the Karanprayag-Saikot-Sonprayag Kedarnath Railway route of Chota Char Dham Railway.
Demographics
India census, village has a small population.
References
External links
Cities and towns in Chamoli district |
```c
/*
*
* in the file LICENSE in the source distribution or at
* path_to_url
*/
#include <stdio.h>
#include <errno.h>
#include "bio_local.h"
#include "internal/cryptlib.h"
#include "internal/safe_math.h"
#if !defined(OPENSSL_NO_DGRAM) && !defined(OPENSSL_NO_SOCK)
OSSL_SAFE_MATH_UNSIGNED(size_t, size_t)
/* ===========================================================================
* Byte-wise ring buffer which supports pushing and popping blocks of multiple
* bytes at a time.
*/
struct ring_buf {
unsigned char *start; /* start of buffer */
size_t len; /* size of buffer allocation in bytes */
size_t count; /* number of bytes currently pushed */
/*
* These index into start. Where idx[0] == idx[1], the buffer is full
* (if count is nonzero) and empty otherwise.
*/
size_t idx[2]; /* 0: head, 1: tail */
};
static int ring_buf_init(struct ring_buf *r, size_t nbytes)
{
r->start = OPENSSL_malloc(nbytes);
if (r->start == NULL)
return 0;
r->len = nbytes;
r->idx[0] = r->idx[1] = r->count = 0;
return 1;
}
static void ring_buf_destroy(struct ring_buf *r)
{
OPENSSL_free(r->start);
r->start = NULL;
r->len = 0;
r->count = 0;
}
/*
* Get a pointer to the next place to write data to be pushed to the ring buffer
* (idx=0), or the next data to be popped from the ring buffer (idx=1). The
* pointer is written to *buf and the maximum number of bytes which can be
* read/written are written to *len. After writing data to the buffer, call
* ring_buf_push/pop() with the number of bytes actually read/written, which
* must not exceed the returned length.
*/
static void ring_buf_head_tail(struct ring_buf *r, int idx, uint8_t **buf, size_t *len)
{
size_t max_len = r->len - r->idx[idx];
if (idx == 0 && max_len > r->len - r->count)
max_len = r->len - r->count;
if (idx == 1 && max_len > r->count)
max_len = r->count;
*buf = (uint8_t *)r->start + r->idx[idx];
*len = max_len;
}
#define ring_buf_head(r, buf, len) ring_buf_head_tail((r), 0, (buf), (len))
#define ring_buf_tail(r, buf, len) ring_buf_head_tail((r), 1, (buf), (len))
/*
* Commit bytes to the ring buffer previously filled after a call to
* ring_buf_head().
*/
static void ring_buf_push_pop(struct ring_buf *r, int idx, size_t num_bytes)
{
size_t new_idx;
/* A single push/pop op cannot wrap around, though it can reach the end.
* If the caller adheres to the convention of using the length returned
* by ring_buf_head/tail(), this cannot happen.
*/
if (!ossl_assert(num_bytes <= r->len - r->idx[idx]))
return;
/*
* Must not overfill the buffer, or pop more than is in the buffer either.
*/
if (!ossl_assert(idx != 0 ? num_bytes <= r->count
: num_bytes + r->count <= r->len))
return;
/* Update the index. */
new_idx = r->idx[idx] + num_bytes;
if (new_idx == r->len)
new_idx = 0;
r->idx[idx] = new_idx;
if (idx != 0)
r->count -= num_bytes;
else
r->count += num_bytes;
}
#define ring_buf_push(r, num_bytes) ring_buf_push_pop((r), 0, (num_bytes))
#define ring_buf_pop(r, num_bytes) ring_buf_push_pop((r), 1, (num_bytes))
static void ring_buf_clear(struct ring_buf *r)
{
r->idx[0] = r->idx[1] = r->count = 0;
}
static int ring_buf_resize(struct ring_buf *r, size_t nbytes)
{
unsigned char *new_start;
if (r->start == NULL)
return ring_buf_init(r, nbytes);
if (nbytes == r->len)
return 1;
if (r->count > 0 && nbytes < r->len)
/* fail shrinking the ring buffer when there is any data in it */
return 0;
new_start = OPENSSL_realloc(r->start, nbytes);
if (new_start == NULL)
return 0;
/* Moving tail if it is after (or equal to) head */
if (r->count > 0) {
if (r->idx[0] <= r->idx[1]) {
size_t offset = nbytes - r->len;
memmove(new_start + r->idx[1] + offset, new_start + r->idx[1],
r->len - r->idx[1]);
r->idx[1] += offset;
}
} else {
/* just reset the head/tail because it might be pointing outside */
r->idx[0] = r->idx[1] = 0;
}
r->start = new_start;
r->len = nbytes;
return 1;
}
/* ===========================================================================
* BIO_s_dgram_pair is documented in BIO_s_dgram_pair(3).
*
* INTERNAL DATA STRUCTURE
*
* This is managed internally by using a bytewise ring buffer which supports
* pushing and popping spans of multiple bytes at once. The ring buffer stores
* internal packets which look like this:
*
* struct dgram_hdr hdr;
* uint8_t data[];
*
* The header contains the length of the data and metadata such as
* source/destination addresses.
*
* The datagram pair BIO is designed to support both traditional
* BIO_read/BIO_write (likely to be used by applications) as well as
* BIO_recvmmsg/BIO_sendmmsg.
*/
struct bio_dgram_pair_st;
static int dgram_pair_write(BIO *bio, const char *buf, int sz_);
static int dgram_pair_read(BIO *bio, char *buf, int sz_);
static int dgram_mem_read(BIO *bio, char *buf, int sz_);
static long dgram_pair_ctrl(BIO *bio, int cmd, long num, void *ptr);
static long dgram_mem_ctrl(BIO *bio, int cmd, long num, void *ptr);
static int dgram_pair_init(BIO *bio);
static int dgram_mem_init(BIO *bio);
static int dgram_pair_free(BIO *bio);
static int dgram_pair_sendmmsg(BIO *b, BIO_MSG *msg, size_t stride,
size_t num_msg, uint64_t flags,
size_t *num_processed);
static int dgram_pair_recvmmsg(BIO *b, BIO_MSG *msg, size_t stride,
size_t num_msg, uint64_t flags,
size_t *num_processed);
static int dgram_pair_ctrl_destroy_bio_pair(BIO *bio1);
static size_t dgram_pair_read_inner(struct bio_dgram_pair_st *b, uint8_t *buf,
size_t sz);
#define BIO_MSG_N(array, n) (*(BIO_MSG *)((char *)(array) + (n)*stride))
static const BIO_METHOD dgram_pair_method = {
BIO_TYPE_DGRAM_PAIR,
"BIO dgram pair",
bwrite_conv,
dgram_pair_write,
bread_conv,
dgram_pair_read,
NULL, /* dgram_pair_puts */
NULL, /* dgram_pair_gets */
dgram_pair_ctrl,
dgram_pair_init,
dgram_pair_free,
NULL, /* dgram_pair_callback_ctrl */
dgram_pair_sendmmsg,
dgram_pair_recvmmsg,
};
static const BIO_METHOD dgram_mem_method = {
BIO_TYPE_DGRAM_MEM,
"BIO dgram mem",
bwrite_conv,
dgram_pair_write,
bread_conv,
dgram_mem_read,
NULL, /* dgram_pair_puts */
NULL, /* dgram_pair_gets */
dgram_mem_ctrl,
dgram_mem_init,
dgram_pair_free,
NULL, /* dgram_pair_callback_ctrl */
dgram_pair_sendmmsg,
dgram_pair_recvmmsg,
};
const BIO_METHOD *BIO_s_dgram_pair(void)
{
return &dgram_pair_method;
}
const BIO_METHOD *BIO_s_dgram_mem(void)
{
return &dgram_mem_method;
}
struct dgram_hdr {
size_t len; /* payload length in bytes, not including this struct */
BIO_ADDR src_addr, dst_addr; /* family == 0: not present */
};
struct bio_dgram_pair_st {
/* The other half of the BIO pair. NULL for dgram_mem. */
BIO *peer;
/* Writes are directed to our own ringbuf and reads to our peer. */
struct ring_buf rbuf;
/* Requested size of rbuf buffer in bytes once we initialize. */
size_t req_buf_len;
/* Largest possible datagram size */
size_t mtu;
/* Capability flags. */
uint32_t cap;
/*
* This lock protects updates to our rbuf. Since writes are directed to our
* own rbuf, this means we use this lock for writes and our peer's lock for
* reads.
*/
CRYPTO_RWLOCK *lock;
unsigned int no_trunc : 1; /* Reads fail if they would truncate */
unsigned int local_addr_enable : 1; /* Can use BIO_MSG->local? */
unsigned int role : 1; /* Determines lock order */
unsigned int grows_on_write : 1; /* Set for BIO_s_dgram_mem only */
};
#define MIN_BUF_LEN (1024)
#define is_dgram_pair(b) (b->peer != NULL)
static int dgram_pair_init(BIO *bio)
{
struct bio_dgram_pair_st *b = OPENSSL_zalloc(sizeof(*b));
if (b == NULL)
return 0;
b->mtu = 1472; /* conservative default MTU */
/* default buffer size */
b->req_buf_len = 9 * (sizeof(struct dgram_hdr) + b->mtu);
b->lock = CRYPTO_THREAD_lock_new();
if (b->lock == NULL) {
OPENSSL_free(b);
return 0;
}
bio->ptr = b;
return 1;
}
static int dgram_mem_init(BIO *bio)
{
struct bio_dgram_pair_st *b;
if (!dgram_pair_init(bio))
return 0;
b = bio->ptr;
if (ring_buf_init(&b->rbuf, b->req_buf_len) == 0) {
ERR_raise(ERR_LIB_BIO, ERR_R_BIO_LIB);
return 0;
}
b->grows_on_write = 1;
bio->init = 1;
return 1;
}
static int dgram_pair_free(BIO *bio)
{
struct bio_dgram_pair_st *b;
if (bio == NULL)
return 0;
b = bio->ptr;
if (!ossl_assert(b != NULL))
return 0;
/* We are being freed. Disconnect any peer and destroy buffers. */
dgram_pair_ctrl_destroy_bio_pair(bio);
CRYPTO_THREAD_lock_free(b->lock);
OPENSSL_free(b);
return 1;
}
/* BIO_make_bio_pair (BIO_C_MAKE_BIO_PAIR) */
static int dgram_pair_ctrl_make_bio_pair(BIO *bio1, BIO *bio2)
{
struct bio_dgram_pair_st *b1, *b2;
/* peer must be non-NULL. */
if (bio1 == NULL || bio2 == NULL) {
ERR_raise(ERR_LIB_BIO, BIO_R_INVALID_ARGUMENT);
return 0;
}
/* Ensure the BIO we have been passed is actually a dgram pair BIO. */
if (bio1->method != &dgram_pair_method || bio2->method != &dgram_pair_method) {
ERR_raise_data(ERR_LIB_BIO, BIO_R_INVALID_ARGUMENT,
"both BIOs must be BIO_dgram_pair");
return 0;
}
b1 = bio1->ptr;
b2 = bio2->ptr;
if (!ossl_assert(b1 != NULL && b2 != NULL)) {
ERR_raise(ERR_LIB_BIO, BIO_R_UNINITIALIZED);
return 0;
}
/*
* This ctrl cannot be used to associate a BIO pair half which is already
* associated.
*/
if (b1->peer != NULL || b2->peer != NULL) {
ERR_raise_data(ERR_LIB_BIO, BIO_R_IN_USE,
"cannot associate a BIO_dgram_pair which is already in use");
return 0;
}
if (!ossl_assert(b1->req_buf_len >= MIN_BUF_LEN
&& b2->req_buf_len >= MIN_BUF_LEN)) {
ERR_raise(ERR_LIB_BIO, BIO_R_UNINITIALIZED);
return 0;
}
if (b1->rbuf.len != b1->req_buf_len)
if (ring_buf_init(&b1->rbuf, b1->req_buf_len) == 0) {
ERR_raise(ERR_LIB_BIO, ERR_R_BIO_LIB);
return 0;
}
if (b2->rbuf.len != b2->req_buf_len)
if (ring_buf_init(&b2->rbuf, b2->req_buf_len) == 0) {
ERR_raise(ERR_LIB_BIO, ERR_R_BIO_LIB);
ring_buf_destroy(&b1->rbuf);
return 0;
}
b1->peer = bio2;
b2->peer = bio1;
b1->role = 0;
b2->role = 1;
bio1->init = 1;
bio2->init = 1;
return 1;
}
/* BIO_destroy_bio_pair (BIO_C_DESTROY_BIO_PAIR) */
static int dgram_pair_ctrl_destroy_bio_pair(BIO *bio1)
{
BIO *bio2;
struct bio_dgram_pair_st *b1 = bio1->ptr, *b2;
ring_buf_destroy(&b1->rbuf);
bio1->init = 0;
/* Early return if we don't have a peer. */
if (b1->peer == NULL)
return 1;
bio2 = b1->peer;
b2 = bio2->ptr;
/* Invariant. */
if (!ossl_assert(b2->peer == bio1))
return 0;
/* Free buffers. */
ring_buf_destroy(&b2->rbuf);
bio2->init = 0;
b1->peer = NULL;
b2->peer = NULL;
return 1;
}
/* BIO_eof (BIO_CTRL_EOF) */
static int dgram_pair_ctrl_eof(BIO *bio)
{
struct bio_dgram_pair_st *b = bio->ptr, *peerb;
if (!ossl_assert(b != NULL))
return -1;
/* If we aren't initialized, we can never read anything */
if (!bio->init)
return 1;
if (!is_dgram_pair(b))
return 0;
peerb = b->peer->ptr;
if (!ossl_assert(peerb != NULL))
return -1;
/*
* Since we are emulating datagram semantics, never indicate EOF so long as
* we have a peer.
*/
return 0;
}
/* BIO_set_write_buf_size (BIO_C_SET_WRITE_BUF_SIZE) */
static int dgram_pair_ctrl_set_write_buf_size(BIO *bio, size_t len)
{
struct bio_dgram_pair_st *b = bio->ptr;
/* Changing buffer sizes is not permitted while a peer is connected. */
if (b->peer != NULL) {
ERR_raise(ERR_LIB_BIO, BIO_R_IN_USE);
return 0;
}
/* Enforce minimum size. */
if (len < MIN_BUF_LEN)
len = MIN_BUF_LEN;
if (b->rbuf.start != NULL) {
if (!ring_buf_resize(&b->rbuf, len))
return 0;
}
b->req_buf_len = len;
b->grows_on_write = 0;
return 1;
}
/* BIO_reset (BIO_CTRL_RESET) */
static int dgram_pair_ctrl_reset(BIO *bio)
{
struct bio_dgram_pair_st *b = bio->ptr;
ring_buf_clear(&b->rbuf);
return 1;
}
/* BIO_pending (BIO_CTRL_PENDING) (Threadsafe) */
static size_t dgram_pair_ctrl_pending(BIO *bio)
{
size_t saved_idx, saved_count;
struct bio_dgram_pair_st *b = bio->ptr, *readb;
struct dgram_hdr hdr;
size_t l;
/* Safe to check; init may not change during this call */
if (!bio->init)
return 0;
if (is_dgram_pair(b))
readb = b->peer->ptr;
else
readb = b;
if (CRYPTO_THREAD_write_lock(readb->lock) == 0)
return 0;
saved_idx = readb->rbuf.idx[1];
saved_count = readb->rbuf.count;
l = dgram_pair_read_inner(readb, (uint8_t *)&hdr, sizeof(hdr));
readb->rbuf.idx[1] = saved_idx;
readb->rbuf.count = saved_count;
CRYPTO_THREAD_unlock(readb->lock);
if (!ossl_assert(l == 0 || l == sizeof(hdr)))
return 0;
return l > 0 ? hdr.len : 0;
}
/* BIO_get_write_guarantee (BIO_C_GET_WRITE_GUARANTEE) (Threadsafe) */
static size_t dgram_pair_ctrl_get_write_guarantee(BIO *bio)
{
size_t l;
struct bio_dgram_pair_st *b = bio->ptr;
if (CRYPTO_THREAD_read_lock(b->lock) == 0)
return 0;
l = b->rbuf.len - b->rbuf.count;
if (l >= sizeof(struct dgram_hdr))
l -= sizeof(struct dgram_hdr);
/*
* If the amount of buffer space would not be enough to accommodate the
* worst-case size of a datagram, report no space available.
*/
if (l < b->mtu)
l = 0;
CRYPTO_THREAD_unlock(b->lock);
return l;
}
/* BIO_dgram_get_local_addr_cap (BIO_CTRL_DGRAM_GET_LOCAL_ADDR_CAP) */
static int dgram_pair_ctrl_get_local_addr_cap(BIO *bio)
{
struct bio_dgram_pair_st *b = bio->ptr, *readb;
if (!bio->init)
return 0;
if (is_dgram_pair(b))
readb = b->peer->ptr;
else
readb = b;
return (~readb->cap & (BIO_DGRAM_CAP_HANDLES_SRC_ADDR
| BIO_DGRAM_CAP_PROVIDES_DST_ADDR)) == 0;
}
/* BIO_dgram_get_effective_caps (BIO_CTRL_DGRAM_GET_EFFECTIVE_CAPS) */
static int dgram_pair_ctrl_get_effective_caps(BIO *bio)
{
struct bio_dgram_pair_st *b = bio->ptr, *peerb;
if (b->peer == NULL)
return 0;
peerb = b->peer->ptr;
return peerb->cap;
}
/* BIO_dgram_get_caps (BIO_CTRL_DGRAM_GET_CAPS) */
static uint32_t dgram_pair_ctrl_get_caps(BIO *bio)
{
struct bio_dgram_pair_st *b = bio->ptr;
return b->cap;
}
/* BIO_dgram_set_caps (BIO_CTRL_DGRAM_SET_CAPS) */
static int dgram_pair_ctrl_set_caps(BIO *bio, uint32_t caps)
{
struct bio_dgram_pair_st *b = bio->ptr;
b->cap = caps;
return 1;
}
/* BIO_dgram_get_local_addr_enable (BIO_CTRL_DGRAM_GET_LOCAL_ADDR_ENABLE) */
static int dgram_pair_ctrl_get_local_addr_enable(BIO *bio)
{
struct bio_dgram_pair_st *b = bio->ptr;
return b->local_addr_enable;
}
/* BIO_dgram_set_local_addr_enable (BIO_CTRL_DGRAM_SET_LOCAL_ADDR_ENABLE) */
static int dgram_pair_ctrl_set_local_addr_enable(BIO *bio, int enable)
{
struct bio_dgram_pair_st *b = bio->ptr;
if (dgram_pair_ctrl_get_local_addr_cap(bio) == 0)
return 0;
b->local_addr_enable = (enable != 0 ? 1 : 0);
return 1;
}
/* BIO_dgram_get_mtu (BIO_CTRL_DGRAM_GET_MTU) */
static int dgram_pair_ctrl_get_mtu(BIO *bio)
{
struct bio_dgram_pair_st *b = bio->ptr;
return b->mtu;
}
/* BIO_dgram_set_mtu (BIO_CTRL_DGRAM_SET_MTU) */
static int dgram_pair_ctrl_set_mtu(BIO *bio, size_t mtu)
{
struct bio_dgram_pair_st *b = bio->ptr, *peerb;
b->mtu = mtu;
if (b->peer != NULL) {
peerb = b->peer->ptr;
peerb->mtu = mtu;
}
return 1;
}
/* Partially threadsafe (some commands) */
static long dgram_mem_ctrl(BIO *bio, int cmd, long num, void *ptr)
{
long ret = 1;
struct bio_dgram_pair_st *b = bio->ptr;
if (!ossl_assert(b != NULL))
return 0;
switch (cmd) {
/*
* BIO_set_write_buf_size: Set the size of the ring buffer used for storing
* datagrams. No more writes can be performed once the buffer is filled up,
* until reads are performed. This cannot be used after a peer is connected.
*/
case BIO_C_SET_WRITE_BUF_SIZE: /* Non-threadsafe */
ret = (long)dgram_pair_ctrl_set_write_buf_size(bio, (size_t)num);
break;
/*
* BIO_get_write_buf_size: Get ring buffer size.
*/
case BIO_C_GET_WRITE_BUF_SIZE: /* Non-threadsafe */
ret = (long)b->req_buf_len;
break;
/*
* BIO_reset: Clear all data which was written to this side of the pair.
*/
case BIO_CTRL_RESET: /* Non-threadsafe */
dgram_pair_ctrl_reset(bio);
break;
/*
* BIO_get_write_guarantee: Any BIO_write providing a buffer less than or
* equal to this value is guaranteed to succeed.
*/
case BIO_C_GET_WRITE_GUARANTEE: /* Threadsafe */
ret = (long)dgram_pair_ctrl_get_write_guarantee(bio);
break;
/* BIO_pending: Bytes available to read. */
case BIO_CTRL_PENDING: /* Threadsafe */
ret = (long)dgram_pair_ctrl_pending(bio);
break;
/* BIO_flush: No-op. */
case BIO_CTRL_FLUSH: /* Threadsafe */
break;
/* BIO_dgram_get_no_trunc */
case BIO_CTRL_DGRAM_GET_NO_TRUNC: /* Non-threadsafe */
ret = (long)b->no_trunc;
break;
/* BIO_dgram_set_no_trunc */
case BIO_CTRL_DGRAM_SET_NO_TRUNC: /* Non-threadsafe */
b->no_trunc = (num > 0);
break;
/* BIO_dgram_get_local_addr_enable */
case BIO_CTRL_DGRAM_GET_LOCAL_ADDR_ENABLE: /* Non-threadsafe */
*(int *)ptr = (int)dgram_pair_ctrl_get_local_addr_enable(bio);
break;
/* BIO_dgram_set_local_addr_enable */
case BIO_CTRL_DGRAM_SET_LOCAL_ADDR_ENABLE: /* Non-threadsafe */
ret = (long)dgram_pair_ctrl_set_local_addr_enable(bio, num);
break;
/* BIO_dgram_get_local_addr_cap: Can local addresses be supported? */
case BIO_CTRL_DGRAM_GET_LOCAL_ADDR_CAP: /* Non-threadsafe */
ret = (long)dgram_pair_ctrl_get_local_addr_cap(bio);
break;
/* BIO_dgram_get_effective_caps */
case BIO_CTRL_DGRAM_GET_EFFECTIVE_CAPS: /* Non-threadsafe */
/* BIO_dgram_get_caps */
case BIO_CTRL_DGRAM_GET_CAPS: /* Non-threadsafe */
ret = (long)dgram_pair_ctrl_get_caps(bio);
break;
/* BIO_dgram_set_caps */
case BIO_CTRL_DGRAM_SET_CAPS: /* Non-threadsafe */
ret = (long)dgram_pair_ctrl_set_caps(bio, (uint32_t)num);
break;
/* BIO_dgram_get_mtu */
case BIO_CTRL_DGRAM_GET_MTU: /* Non-threadsafe */
ret = (long)dgram_pair_ctrl_get_mtu(bio);
break;
/* BIO_dgram_set_mtu */
case BIO_CTRL_DGRAM_SET_MTU: /* Non-threadsafe */
ret = (long)dgram_pair_ctrl_set_mtu(bio, (uint32_t)num);
break;
/*
* BIO_eof: Returns whether this half of the BIO pair is empty of data to
* read.
*/
case BIO_CTRL_EOF: /* Non-threadsafe */
ret = (long)dgram_pair_ctrl_eof(bio);
break;
default:
ret = 0;
break;
}
return ret;
}
static long dgram_pair_ctrl(BIO *bio, int cmd, long num, void *ptr)
{
long ret = 1;
switch (cmd) {
/*
* BIO_make_bio_pair: this is usually used by BIO_new_dgram_pair, though it
* may be used manually after manually creating each half of a BIO pair
* using BIO_new. This only needs to be called on one of the BIOs.
*/
case BIO_C_MAKE_BIO_PAIR: /* Non-threadsafe */
ret = (long)dgram_pair_ctrl_make_bio_pair(bio, (BIO *)ptr);
break;
/*
* BIO_destroy_bio_pair: Manually disconnect two halves of a BIO pair so
* that they are no longer peers.
*/
case BIO_C_DESTROY_BIO_PAIR: /* Non-threadsafe */
dgram_pair_ctrl_destroy_bio_pair(bio);
break;
/* BIO_dgram_get_effective_caps */
case BIO_CTRL_DGRAM_GET_EFFECTIVE_CAPS: /* Non-threadsafe */
ret = (long)dgram_pair_ctrl_get_effective_caps(bio);
break;
default:
ret = dgram_mem_ctrl(bio, cmd, num, ptr);
break;
}
return ret;
}
int BIO_new_bio_dgram_pair(BIO **pbio1, size_t writebuf1,
BIO **pbio2, size_t writebuf2)
{
int ret = 0;
long r;
BIO *bio1 = NULL, *bio2 = NULL;
bio1 = BIO_new(BIO_s_dgram_pair());
if (bio1 == NULL)
goto err;
bio2 = BIO_new(BIO_s_dgram_pair());
if (bio2 == NULL)
goto err;
if (writebuf1 > 0) {
r = BIO_set_write_buf_size(bio1, writebuf1);
if (r == 0)
goto err;
}
if (writebuf2 > 0) {
r = BIO_set_write_buf_size(bio2, writebuf2);
if (r == 0)
goto err;
}
r = BIO_make_bio_pair(bio1, bio2);
if (r == 0)
goto err;
ret = 1;
err:
if (ret == 0) {
BIO_free(bio1);
bio1 = NULL;
BIO_free(bio2);
bio2 = NULL;
}
*pbio1 = bio1;
*pbio2 = bio2;
return ret;
}
/* Must hold peer write lock */
static size_t dgram_pair_read_inner(struct bio_dgram_pair_st *b, uint8_t *buf, size_t sz)
{
size_t total_read = 0;
/*
* We repeat pops from the ring buffer for as long as we have more
* application *buffer to fill until we fail. We may not be able to pop
* enough data to fill the buffer in one operation if the ring buffer wraps
* around, but there may still be more data available.
*/
while (sz > 0) {
uint8_t *src_buf = NULL;
size_t src_len = 0;
/*
* There are two BIO instances, each with a ringbuf. We read from the
* peer ringbuf and write to our own ringbuf.
*/
ring_buf_tail(&b->rbuf, &src_buf, &src_len);
if (src_len == 0)
break;
if (src_len > sz)
src_len = sz;
if (buf != NULL)
memcpy(buf, src_buf, src_len);
ring_buf_pop(&b->rbuf, src_len);
if (buf != NULL)
buf += src_len;
total_read += src_len;
sz -= src_len;
}
return total_read;
}
/*
* Must hold peer write lock. Returns number of bytes processed or negated BIO
* response code.
*/
static ossl_ssize_t dgram_pair_read_actual(BIO *bio, char *buf, size_t sz,
BIO_ADDR *local, BIO_ADDR *peer,
int is_multi)
{
size_t l, trunc = 0, saved_idx, saved_count;
struct bio_dgram_pair_st *b = bio->ptr, *readb;
struct dgram_hdr hdr;
if (!is_multi)
BIO_clear_retry_flags(bio);
if (!bio->init)
return -BIO_R_UNINITIALIZED;
if (!ossl_assert(b != NULL))
return -BIO_R_TRANSFER_ERROR;
if (is_dgram_pair(b))
readb = b->peer->ptr;
else
readb = b;
if (!ossl_assert(readb != NULL && readb->rbuf.start != NULL))
return -BIO_R_TRANSFER_ERROR;
if (sz > 0 && buf == NULL)
return -BIO_R_INVALID_ARGUMENT;
/* If the caller wants to know the local address, it must be enabled */
if (local != NULL && b->local_addr_enable == 0)
return -BIO_R_LOCAL_ADDR_NOT_AVAILABLE;
/* Read the header. */
saved_idx = readb->rbuf.idx[1];
saved_count = readb->rbuf.count;
l = dgram_pair_read_inner(readb, (uint8_t *)&hdr, sizeof(hdr));
if (l == 0) {
/* Buffer was empty. */
if (!is_multi)
BIO_set_retry_read(bio);
return -BIO_R_NON_FATAL;
}
if (!ossl_assert(l == sizeof(hdr)))
/*
* This should not be possible as headers (and their following payloads)
* should always be written atomically.
*/
return -BIO_R_BROKEN_PIPE;
if (sz > hdr.len) {
sz = hdr.len;
} else if (sz < hdr.len) {
/* Truncation is occurring. */
trunc = hdr.len - sz;
if (b->no_trunc) {
/* Restore original state. */
readb->rbuf.idx[1] = saved_idx;
readb->rbuf.count = saved_count;
return -BIO_R_NON_FATAL;
}
}
l = dgram_pair_read_inner(readb, (uint8_t *)buf, sz);
if (!ossl_assert(l == sz))
/* We were somehow not able to read the entire datagram. */
return -BIO_R_TRANSFER_ERROR;
/*
* If the datagram was truncated due to an inadequate buffer, discard the
* remainder.
*/
if (trunc > 0 && !ossl_assert(dgram_pair_read_inner(readb, NULL, trunc) == trunc))
/* We were somehow not able to read/skip the entire datagram. */
return -BIO_R_TRANSFER_ERROR;
if (local != NULL)
*local = hdr.dst_addr;
if (peer != NULL)
*peer = hdr.src_addr;
return (ossl_ssize_t)l;
}
/* Threadsafe */
static int dgram_pair_lock_both_write(struct bio_dgram_pair_st *a,
struct bio_dgram_pair_st *b)
{
struct bio_dgram_pair_st *x, *y;
x = (a->role == 1) ? a : b;
y = (a->role == 1) ? b : a;
if (!ossl_assert(a->role != b->role))
return 0;
if (!ossl_assert(a != b && x != y))
return 0;
if (CRYPTO_THREAD_write_lock(x->lock) == 0)
return 0;
if (CRYPTO_THREAD_write_lock(y->lock) == 0) {
CRYPTO_THREAD_unlock(x->lock);
return 0;
}
return 1;
}
static void dgram_pair_unlock_both(struct bio_dgram_pair_st *a,
struct bio_dgram_pair_st *b)
{
CRYPTO_THREAD_unlock(a->lock);
CRYPTO_THREAD_unlock(b->lock);
}
/* Threadsafe */
static int dgram_pair_read(BIO *bio, char *buf, int sz_)
{
int ret;
ossl_ssize_t l;
struct bio_dgram_pair_st *b = bio->ptr, *peerb;
if (sz_ < 0) {
ERR_raise(ERR_LIB_BIO, BIO_R_INVALID_ARGUMENT);
return -1;
}
if (b->peer == NULL) {
ERR_raise(ERR_LIB_BIO, BIO_R_BROKEN_PIPE);
return -1;
}
peerb = b->peer->ptr;
/*
* For BIO_read we have to acquire both locks because we touch the retry
* flags on the local bio. (This is avoided in the recvmmsg case as it does
* not touch the retry flags.)
*/
if (dgram_pair_lock_both_write(peerb, b) == 0) {
ERR_raise(ERR_LIB_BIO, ERR_R_UNABLE_TO_GET_WRITE_LOCK);
return -1;
}
l = dgram_pair_read_actual(bio, buf, (size_t)sz_, NULL, NULL, 0);
if (l < 0) {
if (l != -BIO_R_NON_FATAL)
ERR_raise(ERR_LIB_BIO, -l);
ret = -1;
} else {
ret = (int)l;
}
dgram_pair_unlock_both(peerb, b);
return ret;
}
/* Threadsafe */
static int dgram_pair_recvmmsg(BIO *bio, BIO_MSG *msg,
size_t stride, size_t num_msg,
uint64_t flags,
size_t *num_processed)
{
int ret;
ossl_ssize_t l;
BIO_MSG *m;
size_t i;
struct bio_dgram_pair_st *b = bio->ptr, *readb;
if (num_msg == 0) {
*num_processed = 0;
return 1;
}
if (!bio->init) {
ERR_raise(ERR_LIB_BIO, BIO_R_BROKEN_PIPE);
*num_processed = 0;
return 0;
}
if (is_dgram_pair(b))
readb = b->peer->ptr;
else
readb = b;
if (CRYPTO_THREAD_write_lock(readb->lock) == 0) {
ERR_raise(ERR_LIB_BIO, ERR_R_UNABLE_TO_GET_WRITE_LOCK);
*num_processed = 0;
return 0;
}
for (i = 0; i < num_msg; ++i) {
m = &BIO_MSG_N(msg, i);
l = dgram_pair_read_actual(bio, m->data, m->data_len,
m->local, m->peer, 1);
if (l < 0) {
*num_processed = i;
if (i > 0) {
ret = 1;
} else {
ERR_raise(ERR_LIB_BIO, -l);
ret = 0;
}
goto out;
}
m->data_len = l;
m->flags = 0;
}
*num_processed = i;
ret = 1;
out:
CRYPTO_THREAD_unlock(readb->lock);
return ret;
}
/* Threadsafe */
static int dgram_mem_read(BIO *bio, char *buf, int sz_)
{
int ret;
ossl_ssize_t l;
struct bio_dgram_pair_st *b = bio->ptr;
if (sz_ < 0) {
ERR_raise(ERR_LIB_BIO, BIO_R_INVALID_ARGUMENT);
return -1;
}
if (CRYPTO_THREAD_write_lock(b->lock) == 0) {
ERR_raise(ERR_LIB_BIO, ERR_R_UNABLE_TO_GET_WRITE_LOCK);
return -1;
}
l = dgram_pair_read_actual(bio, buf, (size_t)sz_, NULL, NULL, 0);
if (l < 0) {
if (l != -BIO_R_NON_FATAL)
ERR_raise(ERR_LIB_BIO, -l);
ret = -1;
} else {
ret = (int)l;
}
CRYPTO_THREAD_unlock(b->lock);
return ret;
}
/*
* Calculate the array growth based on the target size.
*
* The growth factor is a rational number and is defined by a numerator
* and a denominator. According to Andrew Koenig in his paper "Why Are
* Vectors Efficient?" from JOOP 11(5) 1998, this factor should be less
* than the golden ratio (1.618...).
*
* We use an expansion factor of 8 / 5 = 1.6
*/
static const size_t max_rbuf_size = SIZE_MAX / 2; /* unlimited in practice */
static ossl_inline size_t compute_rbuf_growth(size_t target, size_t current)
{
int err = 0;
while (current < target) {
if (current >= max_rbuf_size)
return 0;
current = safe_muldiv_size_t(current, 8, 5, &err);
if (err)
return 0;
if (current >= max_rbuf_size)
current = max_rbuf_size;
}
return current;
}
/* Must hold local write lock */
static size_t dgram_pair_write_inner(struct bio_dgram_pair_st *b,
const uint8_t *buf, size_t sz)
{
size_t total_written = 0;
/*
* We repeat pushes to the ring buffer for as long as we have data until we
* fail. We may not be able to push in one operation if the ring buffer
* wraps around, but there may still be more room for data.
*/
while (sz > 0) {
size_t dst_len;
uint8_t *dst_buf;
/*
* There are two BIO instances, each with a ringbuf. We write to our own
* ringbuf and read from the peer ringbuf.
*/
ring_buf_head(&b->rbuf, &dst_buf, &dst_len);
if (dst_len == 0) {
size_t new_len;
if (!b->grows_on_write) /* resize only if size not set explicitly */
break;
/* increase the size */
new_len = compute_rbuf_growth(b->req_buf_len + sz, b->req_buf_len);
if (new_len == 0 || !ring_buf_resize(&b->rbuf, new_len))
break;
b->req_buf_len = new_len;
}
if (dst_len > sz)
dst_len = sz;
memcpy(dst_buf, buf, dst_len);
ring_buf_push(&b->rbuf, dst_len);
buf += dst_len;
sz -= dst_len;
total_written += dst_len;
}
return total_written;
}
/*
* Must hold local write lock. Returns number of bytes processed or negated BIO
* response code.
*/
static ossl_ssize_t dgram_pair_write_actual(BIO *bio, const char *buf, size_t sz,
const BIO_ADDR *local, const BIO_ADDR *peer,
int is_multi)
{
static const BIO_ADDR zero_addr;
size_t saved_idx, saved_count;
struct bio_dgram_pair_st *b = bio->ptr, *readb;
struct dgram_hdr hdr = {0};
if (!is_multi)
BIO_clear_retry_flags(bio);
if (!bio->init)
return -BIO_R_UNINITIALIZED;
if (!ossl_assert(b != NULL && b->rbuf.start != NULL))
return -BIO_R_TRANSFER_ERROR;
if (sz > 0 && buf == NULL)
return -BIO_R_INVALID_ARGUMENT;
if (local != NULL && b->local_addr_enable == 0)
return -BIO_R_LOCAL_ADDR_NOT_AVAILABLE;
if (is_dgram_pair(b))
readb = b->peer->ptr;
else
readb = b;
if (peer != NULL && (readb->cap & BIO_DGRAM_CAP_HANDLES_DST_ADDR) == 0)
return -BIO_R_PEER_ADDR_NOT_AVAILABLE;
hdr.len = sz;
hdr.dst_addr = (peer != NULL ? *peer : zero_addr);
hdr.src_addr = (local != NULL ? *local : zero_addr);
saved_idx = b->rbuf.idx[0];
saved_count = b->rbuf.count;
if (dgram_pair_write_inner(b, (const uint8_t *)&hdr, sizeof(hdr)) != sizeof(hdr)
|| dgram_pair_write_inner(b, (const uint8_t *)buf, sz) != sz) {
/*
* We were not able to push the header and the entirety of the payload
* onto the ring buffer, so abort and roll back the ring buffer state.
*/
b->rbuf.idx[0] = saved_idx;
b->rbuf.count = saved_count;
if (!is_multi)
BIO_set_retry_write(bio);
return -BIO_R_NON_FATAL;
}
return sz;
}
/* Threadsafe */
static int dgram_pair_write(BIO *bio, const char *buf, int sz_)
{
int ret;
ossl_ssize_t l;
struct bio_dgram_pair_st *b = bio->ptr;
if (sz_ < 0) {
ERR_raise(ERR_LIB_BIO, BIO_R_INVALID_ARGUMENT);
return -1;
}
if (CRYPTO_THREAD_write_lock(b->lock) == 0) {
ERR_raise(ERR_LIB_BIO, ERR_R_UNABLE_TO_GET_WRITE_LOCK);
return -1;
}
l = dgram_pair_write_actual(bio, buf, (size_t)sz_, NULL, NULL, 0);
if (l < 0) {
ERR_raise(ERR_LIB_BIO, -l);
ret = -1;
} else {
ret = (int)l;
}
CRYPTO_THREAD_unlock(b->lock);
return ret;
}
/* Threadsafe */
static int dgram_pair_sendmmsg(BIO *bio, BIO_MSG *msg,
size_t stride, size_t num_msg,
uint64_t flags, size_t *num_processed)
{
ossl_ssize_t ret, l;
BIO_MSG *m;
size_t i;
struct bio_dgram_pair_st *b = bio->ptr;
if (num_msg == 0) {
*num_processed = 0;
return 1;
}
if (CRYPTO_THREAD_write_lock(b->lock) == 0) {
ERR_raise(ERR_LIB_BIO, ERR_R_UNABLE_TO_GET_WRITE_LOCK);
*num_processed = 0;
return 0;
}
for (i = 0; i < num_msg; ++i) {
m = &BIO_MSG_N(msg, i);
l = dgram_pair_write_actual(bio, m->data, m->data_len,
m->local, m->peer, 1);
if (l < 0) {
*num_processed = i;
if (i > 0) {
ret = 1;
} else {
ERR_raise(ERR_LIB_BIO, -l);
ret = 0;
}
goto out;
}
m->flags = 0;
}
*num_processed = i;
ret = 1;
out:
CRYPTO_THREAD_unlock(b->lock);
return ret;
}
#endif
``` |
In the Buddha's first discourse, he identifies craving (tanha) as the cause of suffering (dukkha). He then identifies three objects of craving: the craving for existence; the craving for non-existence and the craving for sense pleasures (kama). Kama is identified as one of five hindrances to the attainment of jhana according to the Buddha's teaching. Throughout the Sutta Pitaka the Buddha often compares sexual pleasure to arrows or darts. So in the Kama Sutta (4.1) from the Sutta Nipata the Buddha explains that craving sexual pleasure is a cause of suffering.
The Buddha then goes on to say:
The 'flood' refers to the deluge of human suffering. The 'far shore' is nirvana, a state in which there is no sensual desire.
The meaning of the Kama Sutta is that sensual desire, like any habitual sense pleasure, brings suffering. To lay people the Buddha advised that they should at least avoid sexual misconduct (See Theravada definition below). From the Buddha's full-time disciples, the ordained monks and nuns, strict celibacy (called brahmacarya) had always been required.
Overview
Former Vice President of the Buddhist Society and Chairman of the English Sangha Trust, Maurice Walshe, wrote an essay called 'Buddhism and Sex' in which he presented Buddha's essential teaching on human sexuality and its relationship to the goal (nibbana). The third of the five precepts states:
Kamesu micchacara veramani sikkhapadam samadiyami,
The literal meaning of this statement is, "I undertake the course of training in refraining from wrong-doing in respect of sensuality." Walshe comments,
The Buddha's teaching arises out of a wish for others to be free from dukkha. According to the doctrine he taught, freedom from suffering involves freedom from sexual desires and the training (Pali: sikkha) to get rid of the craving involves to a great extent abstaining from those desires.
Monastic Buddhism
Apart from certain schools in Japan and Tibet, most who choose to practice Buddhism as ordained monks and nuns, also choose to live in celibacy.
Mainstream views
Sex is seen as a serious monastic transgression. Within Theravada Buddhism there are four principal transgressions which entail expulsion from the monastic Sangha: sex, theft, murder, and falsely boasting of superhuman perfections. Sexual misconduct for monks and nuns includes masturbation. In the case of monasticism, abstaining completely from sex is seen as a necessity in order to reach enlightenment. The Buddha's criticism of a monk who broke his celibate vows—without having disrobed first—is as follows:
Japanese Buddhism
Conversely to most tenets of Buddhism, Japanese Buddhist monks were strongly associated to the partaking of pleasure and sexual relationships. Many of them were known to maintain relationships with prostitutes and geishas, often maintaining long term liaisons with them. While those aspects were a popular target of criticism and satire as charge of moral corruption, both "by Japanese who often were ideologically hostile to Buddhism themselves or by Western observers inclined to view Buddhism as an obstacle to Christian missionary success in Japan", as well as other orthodox Buddhists, some adherents to this lifestyle sometimes claimed it to be actually part of their religious practice. As such, there were currents of local esoteric Buddhism, possibly influenced by non-Buddhist folk tradition, that valued sexuality positively.
The Japanese deva Kangiten, a Buddhicized form of the Hindu god Ganesha, was considered sexually symbolic, being represented as dual figures embracing. It received a wide worship, especially among geishas and people in the business of pleasure, and its esoteric sexuality meant its image had to be usually covered from public eyes. The 12th century saw the rise of the infamous Tachikawa-ryu sect, an extreme tantric sex school where human skulls and emission of sexual fluids were used in ritual, for which they were later persecuted and suppressed by mainstream Buddhists. Finally, even in non-tantric Buddhism, influential 15th century monk Ikkyu preached for sex and love as valid ways to reach Enlightenment. He is considered both a heretic and a saint within Zen.
Lay Buddhism
The most common formulation of Buddhist ethics are the Five Precepts and the Eightfold Path, which say that one should neither be attached to nor crave sensual pleasure. These precepts take the form of voluntary, personal undertakings, not divine mandate or instruction. The third of the Five Precepts is "To refrain from committing sexual misconduct.
Celibacy or Brahmacariya rules pertain only to the Eight precepts or the 10 monastic precepts.
According to the Theravada traditions there are some statements attributed to Gautama Buddha on the nature of sexual misconduct. In Everyman's Ethics, a collection of four specific suttas compiled and translated by Narada Thera, it is said that adultery is one of four evils the wise will never praise. Within the Anguttara Nikaya on his teachings to Cunda the Silversmith this scope of misconduct is described: "...one has intercourse with those under the protection of father, mother, brother, sister, relatives or clan, or of their religious community; or with those promised to someone else, protected by law, and even with those betrothed with a garland" (etc.- child/underage)
Bhikkhu Nyanamoli has provided an English Translation of the Majjhima Nikaya 41, "He is given over to misconduct in sexual desires: he has intercourse with such (women) as are protected by the mother, father, (mother and father), brother, sister, relatives, as have a husband, as entail a penalty, and also with those that are garlanded in token of betrothal."
Sexual yoga
According to some Tibetan authorities, the physical practice of sexual yoga is necessary at the highest level for the attainment of Buddhahood. The use of sexual yoga is highly regulated. It is only permitted after years of training. The physical practice of sexual yoga is and has historically been extremely rare. A great majority of Tibetans believe that the only proper practice of tantric sex is metaphorically, not physically, in rituals and during meditative visualizations. The dominant Gelug sect of Tibetan Buddhism holds that sexual yoga as an actual physical practice is the only way to attain Buddhahood in one lifetime. The founder of the sect Tsongkhapa did not, according to tradition, engage in this practice, but instead attained complete enlightenment at the moment of death, that being according to this school the nearest possible without sexual yoga. The school also taught that they are only appropriate for the most elite practitioners, who had directly realized emptiness and who had unusually strong compassion. The next largest school in Tibet, the Nyingma, holds that this is not necessary to achieve Buddhahood in one lifetime. The fourteenth Dalai Lama of the Gelug sect, holds that the practice should only be done as a visualization.
Homosexuality
Among Buddhists there is a wide diversity of opinion about homosexuality. Buddhism teaches that sensual enjoyment and desire in general, and sexual pleasure in particular, are hindrances to enlightenment, and inferior to the kinds of pleasure (see, e.g. pīti, a Pāli word often translated as "rapture") that are integral to the practice of jhāna. The Buddha Gotama once stated, “Just as rain ruins an ill-thatched hut, passion destroys an ill-trained mind.”
The third of the five precepts admonishes against "sexual misconduct"; however, "sexual misconduct" is a broad term, subject to interpretation according to followers' social norms. Early Buddhism appears to have been silent regarding homosexual relations.
According to the Pāli Canon and Āgama (the Early Buddhist scriptures), there is not any saying that same or opposite sex relations have anything to do with sexual misconduct, and some Theravada monks express that same-sex relations do not violate the rule to avoid sexual misconduct, which means not having sex with someone underage (thus protected by their parents or guardians), someone betrothed or married and who have taken vows of religious celibacy.
Some later traditions feature restrictions on non-vagina sex, though its situations seem involving coerced sex.
Conservative Buddhist leaders like Chan master Hsuan Hua have spoken against the act of homosexuality. Some Tibet Buddhist leaders like the 14th Dalai Lama spoke about the restrictions of how to use your sex organ to insert other's body parts based on Je Tsongkhapa's work.
The situation is different for monastics. For them, the Vinaya (code of monastic discipline) bans all sexual activity, but does so in purely physiological terms, making no moral distinctions among the many possible forms of intercourse.
See also
Buddhist ethics
Religion and sexuality
Tachikawa-ryu
Buddhist view of marriage
Buddhism and sexual orientation
Buddhism and romantic relationships
References
Bibliography
Further reading
External links
Buddhist Sexual Ethics: Main Issues – Alexander Berzin
Buddhist & Western Views on Sex – Alexander Berzin
Thinking through Texts: Toward a Critical Buddhist Theology of Sexuality by José Ignacio Cabezón, Public Lecture, Naropa University, September 23, 2008 |
Golemo Bucino is a village in Southern Bulgaria. The village is located in Pernik Municipality, Pernik Province. Аccording to the numbers provided by the 2020 Bulgarian census, Golemo Buchino currently has a population of around 800 people with a permanent address registration in the settlement.
Geography
Golemo Bucino is located in the foot of Lyulin mountain. Highway Trakia passes closely to the village. It is located 18 kilometers away from Sofia.
The air is clean mainly due to a mountain air current passing through the village.
Culture and Infrastructure
There is a monastery 1 kilometer away from the village. The Golemobucinski monastery “Vaznesenie Gospodne” dates back to the 18th century. It was partly renovated in the 19th century.
Buildings
The community hall and library “Lyulinski Izgrev 1903” was built in 1903
The church “Sveti Duh” was built in 2006 with donations from the villager
Ethnicity
According to the Bulgarian population census in 2011.
References
Villages in Pernik Province |
Brooks Sports, Inc., also known as Brooks Running, is an American sports equipment company that designs and markets high-performance men's and women's sneakers, clothing, and accessories. Headquartered in Seattle, Washington, Brooks products are available in 60 countries worldwide. It is a subsidiary of Berkshire Hathaway.
Brooks, founded in 1914, originally manufactured shoes for a broad range of sports. "White hot" in the mid-70s, the company faltered in the latter part of the decade, and filed for bankruptcy protection in 1981. In 2001, the product line was cut by more than 50% to focus the brand solely on running, and its concentration on performance technology was increased. Brooks Running became the top selling brand in the specialty running shoe market in 2011, and remained so through 2017 with a 25% market share.
Brooks shoes have been named "Best Women's Running Shoe" and "Best Winter Running Shoe" by publications including Runner's World and Sports Illustrated. The company has been recognized for environmental sustainability programs and technical innovation.
History
Early history: Founding, Bruxshu Gymnasium Shoes, Carmen Manufacturing
Brooks Sports, Inc. was founded in 1914 by John Brooks Goldenberg, following his purchase of the Quaker Shoe Company, a manufacturer of bathing shoes and ballet slippers. Based in Philadelphia, it operated as a partnership between John Goldenberg and his brothers, Michael and Frank. By 1920, Quaker Shoes had been renamed Brooks Shoe Manufacturing Co., Inc., and its shoes were sold under the brand name Bruxshu. In addition to bathing shoes and ballet slippers, it sold a gymnasium shoe, Ironclad Gyms. The company's innovations included the 1938 introduction of orthopedic shoes for children, Pedicraft, and rubber brakes for roller skates (then known as "quick stops"), patented in 1944.
In 1938, the Goldenbergs bought the Carmen Shoe Manufacturing Company in Hanover, Pennsylvania. Until 1957 a better grade leather was purchased, cut, stitched and fit in Philadelphia, while the same procedure in Hanover used lower grade materials. Both shoes were sold in Philadelphia under the Brooks name, and ranged from inexpensive to high-priced.
In 1956, after a series of operational changes, John notified his brother that he would not renew their partnership agreement, and Michael discussed expanding Carmen with his nephew, Frank's son Barton. In 1957, following the dissolution of the partnership, the existence of Brooks Shoe Manufacturing Company was terminated, and Michael and Barton each acquired 50% of Carmen. In 1958, Michael purchased Barton's interest in the company, and as the sole owner, he renamed Carmen the Brooks Manufacturing Company.
1970s: Introduction of EVA, the Vantage, Runner's World #1 running shoe
In 1975, Brooks worked with elite runners, including Marty Liquori, a former Olympian, to design a running shoe. The collaboration produced the Villanova, Brooks's first high-performance running shoe. It was the first running shoe to use EVA, an air-infused foam that was quickly adopted by other athletic brands. Brooks followed the Villanova with the Vantage, a running shoe constructed with a wedge to address overpronation. In 1977, based on newly developed measurements of cushioning, flexibility, and durability, the Vantage was ranked at #1 in the annual Runner's World running guide. Runners embraced Brooks' technology, and the demand "exploded". Towards the end of the decade Brooks was among the top three selling brands in the US. The Vanguard was another running shoe which appeared in this decade.
1980s: Bankruptcy, the Chariot, Brooks for Women
In 1980, as a result of production issues with Brooks's manufacturing facility in Puerto Rico, defective shoes began to arrive at sporting goods stores. Nearly 30 percent of the shoes were returned, and Brooks scrapped 50,000 pairs. The company filed for Chapter 11 bankruptcy, and was purchased at auction by footwear manufacturer Wolverine World Wide in 1981.
In 1982, stability became the top priority for runners, and Brooks introduced the Chariot, a medial post shoe that featured an angled wedge of harder-density foam in the midsole. Thicker on the inside of the shoe and tapered toward the outside, the Chariot represented a "sea change" in running-shoe design. In 1987, with Brooks for Women, it launched an anatomically adjusted line of shoes designed for women.
1990s: The Beast, Adrenaline, ownership changes, apparel, Run Happy
In 1992, Brooks launched the Beast, a motion control shoe that integrated diagonal rollbar technology. In 1994, the Adrenaline GTS—an abbreviation for go-to shoe—was released. With a firmer midsole density, the Adrenaline GTS was built on a semi-curve, an accommodation for runners with a high arch and wide forefoot. The Beast became a best seller, and the Adrenaline GTS went on to become one of the best-selling running shoes of all time.
Wolverine moved Brooks away from the niche running market to a generalist athletic brand. The "class to mass" strategy was unsuccessful, and Brooks was sold to Norwegian private equity company The Rokke Group for $21 million in 1993. Brooks moved to Rokke's Seattle location following its acquisition. In 1998, Rokke sold a majority interest in Brooks to J.H. Whitney & Co., a Connecticut private equity firm.
Brooks introduced a full-line of technical running and fitness apparel for women and men in the spring of 1997. It also expanded into the walking category with the introduction of performance walking shoes.
Brooks's Run Happy tag line first appeared in print advertising in 1999. Rather than depicting running as a grueling pursuit, as competitive brands did, Run Happy was based on the idea that runners love running, and suggested that Brooks products allowed "runners to have the running experience they were looking for".
2000s: Jim Weber, Berkshire Hathaway, BioMoGo
In 2001, Jim Weber, a former Brooks board member, was named president and CEO of the company. At the time, the company's market share was low, and bankruptcy had again become a concern. Weber cut lower-priced footwear from the Brooks product line, added an on-site lab and staff engineers, and focused the company on technical-performance running shoes. As the brand was rebuilt, its annual revenue fell to $20 million. Three years later, it was $69 million.
Brooks was acquired by Russell Athletic in 2004. In 2006, Russell was purchased by Fruit of the Loom and Brooks became a subsidiary of Fruit of the Loom's parent company, Berkshire Hathaway. It became an independent subsidiary of Berkshire Hathaway in 2011.
In the mid-2000s, Brooks introduced High Performance Green Rubber, a material it developed for outsoles that used sand rather than petroleum. It subsequently developed BioMoGo, the first biodegradable mid-sole for running shoes. It used a non-toxic, natural additive that increased the rate of biodegradation by encouraging microbes in the soil to break the material down into nutrients that could be used by plants and animals, biodegrading approximately 20 times faster than traditional soles. By using BioMoGo, Brooks estimated that it would cut more than 30 million pounds of landfill waste over a 20-year period. The BioMoGo technology was open source.
2010s: DNA, $500 million milestone, Brooks Heritage, 2017 awards, FitStation
Brooks DNA (and later Super DNA) was released in 2013. It provided customized cushioning, and adapted to the user's gender, weight and pace. Engineered from non-Newtonian liquid, it was another of Brooks's technological "firsts".
In 2011, Brooks became the leading running shoe in the specialty market. On its 100-year anniversary, with a 29% market share, Brooks revenue hit $500 million. Weber stated that based on the company's year-over-year growth, investments from Berkshire Hathaway and the support of its CEO, Warren Buffett, Brooks would become a billion dollar brand.
The Brooks Heritage Collection was launched in 2016, returning the Vanguard, the Chariot, and the Beast to the market. Only the technology was updated; the details of the original shoes, including the colorways, were replicated.
Brooks introduced the first customized performance running shoe based on personal biomechanics in the United States in December 2017. An in-store station that combines 3D foot scanning with gait analysis and pressure mapping, it was developed in partnership with HP and Superfeet.
In 2017, Brooks shoes were named Best Running Shoe (The Glycerine and the Launch, Sports Illustrated); Editor's Top Choice (The Adrenaline GTS 18, Runner's World); and Ten Best Running Shoes (The Levitate, Men's Fitness).
Shortly after, Brooks developed the DNA Flash—their first nitrogen-injected midsole technology—and applied it to silhouettes such as the Hyperion Tempo as well as a few easy everyday running shoes. The brand worked with nitrogen injection for about three and a half years before releasing its DNA Loft V3 nitrogen-injected foam, which was introduced in the Aurora BL sneaker.
Sustainability and social responsibility
Brooks Running has implemented environmentally conscious practices into their business and manufacturing practices. Several models of their shoes have High Performance Rubber Green (HPR Green) outsoles that are made with sand instead of petroleum. The company says that it uses recycled materials to make other parts of their shoes "whenever possible", including laces, fabrics, hangtags and packaging.
In 2014, the company partnered with Bluesign Technologies (stylized as bluesign technologies) to evaluate, manage, and eliminate priority chemicals used in the process of manufacturing apparel. Manufacturers that become Bluesign system partners are required to establish management systems for improving resource productivity, consumer safety, water emissions, air emissions, and occupational health and safety.
Brooks is also a member of the Sustainable Apparel Coalition, a global trade organization that works to reduce the environmental and social impact of apparel and footwear products. With the some collections, Brooks offers vegan products.
Built in 2014, the Brooks headquarters meet the environmental standards of Seattle's Deep Green Pilot Program. The building captures and reuses at least 50 percent of storm water on the site and uses 75 percent less energy than a typical commercial building in the city. As of 2016, it was "one of the greenest buildings in the world".
Brooks provides paid time annually to employees to volunteer for community organizations. Among other causes, Brooks employees have supported ConservationNEXT's Seattle Backyard Collective, Habitat for Humanity, Northwest Harvest, the Seattle Ronald McDonald House and the 2018 Special Olympic Games. "Run B'Cause" product donation grants are given annually to organizations who support a "healthier, Run Happier world".
It was announced in June 2017 that Brooks Running would partner with the 2018 Special Olympics USA Games to create limited-edition co-branded running shoes and apparel, with a portion of the proceeds benefiting the games, and provide free running shoes to athletes participating in the Special Olympics Healthy Athletes Fit Feet program, which offers athletes free podiatric screenings.
Sponsorship
Team sponsorships
Hansons-Brooks
Brooks Beasts Track Club
Brooks Mavericks
Brooks Run Happy Team
Sponsored athletes (partial list)
Notes
References
External links
Shoe companies of the United States
Clothing companies established in 1914
Athletic shoe brands
Sportswear brands
Manufacturing companies based in Seattle
1914 establishments in Pennsylvania
Wallingford, Seattle
Berkshire Hathaway |
Pizzul is a surname. Notable people with the surname include:
Bruno Pizzul (born 1938), Italian footballer and journalist
Filandia Elisa Pizzul (1902–1987), first woman to graduate from a school of architecture in Argentina
Luca Pizzul (born 1999), Italian footballer |
General elections were held in Montserrat in November 1978. The result was a victory for the People's Liberation Movement (PLM), which won all seven seats in the Legislative Council. PLM leader John Osborne became Chief Minister.
Campaign
A total of 18 candidates contested the elections; both the PLM and the ruling Progressive Democratic Party nominated seven candidates, with four independents also running.
Results
Elected MPs
References
Elections in Montserrat
Montserrat
General election
Montserratian general election
Montserrat |
Bhawani Prasad Khapung () (born 5 October 1961) is a Nepali politician. He was elected as a Member of Parliament (MP) in the House of Representatives from Terathum 1 (constituency) in the 2017 General Election. He is a member of the CPN (Unified Socialist).
See also
CPN (Unified Socialist)
References
Living people
Nepal MPs 2017–2022
Communist Party of Nepal (Unified Socialist) politicians
Members of the 2nd Nepalese Constituent Assembly
Communist Party of Nepal (Unified Marxist–Leninist) politicians
1961 births |
Ibtisam is an Arabic given name meaning "smile". Among Arabic speakers it is considered a feminine name, but among south Asian Muslims it is also used to name males.
Ibtisam Barakat, Palestinian-American writer, poet, and educator
Ibtisam Lutfi, Saudi Arabian female singer
Ibtisam Youssef Khalil Al-Nawafleh, Jordanian legislator
Ibtisam Sheikh, Pakistani cricketer
Ibtisam al-Samadi, Syrian poet and academic.
See also
Ibtissam
Arabic-language feminine given names
Feminine given names |
"I'm Comin' Over" is a song co-written and recorded by American country music artist Chris Young. It was released on May 11, 2015 as the lead single to his fifth studio album of the same name, which was released on November 13, 2015. The song was written by Young, Corey Crowder and Josh Hoge.
Reception
Critical
The song received positive reviews from critics. Taste of Country reviewed the song positively, saying that "New Chris Young is doubling down on the traditional. "I’m Comin' Over" is drenched in weeping pedal steel and familiar country themes. The song relies on Young's sturdy voice, which is as solid as a mountain on this power ballad." In 2017, Billboard contributor Chuck Dauphin put "I'm Comin' Over" at number ten on his top 10 list of Young's best songs.
Commercial
"I'm Comin' Over" debuted on the Billboard Hot 100 at number 57 and Hot Country Songs at number 8 on its first week of release. It was the second best-selling country songs with 71,000 copies sold. It became Young's sixth number one single on the Country Airplay chart dated November 28, 2015, and his first since "You" in February 2012. The song was certified Gold by the RIAA on September 23, 2015, and Platinum on January 11, 2016. It has sold 725,000 copies in the US as of February 2016.
Music video
The music video was directed by David McClister/Trey Fanjoy and premiered in May 2015.
Chart performance
Weekly chart
Year-end charts
Certifications
References
2015 songs
2015 singles
Country ballads
2010s ballads
Chris Young (singer) songs
RCA Records Nashville singles
Songs written by Corey Crowder (songwriter)
Songs written by Josh Hoge
Songs written by Chris Young (singer) |
```swift
import Foundation
import ReactiveSwift
extension DeletePaymentMethodEnvelope {
static func from(_ data: GraphAPI.DeletePaymentSourceMutation.Data) -> DeletePaymentMethodEnvelope? {
guard let storedCards = data.paymentSourceDelete?.user?.storedCards?.fragments.userStoredCardsFragment
.nodes else {
return nil
}
let allCards = storedCards.compactMap { card -> UserCreditCards.CreditCard? in
guard let node = card else { return nil }
return UserCreditCards.CreditCard(
expirationDate: node.expirationDate,
id: node.id,
lastFour: node.lastFour,
type: CreditCardType(rawValue: node.type.rawValue)
)
}
return DeletePaymentMethodEnvelope(storedCards: allCards)
}
static func producer(
from data: GraphAPI.DeletePaymentSourceMutation
.Data
) -> SignalProducer<DeletePaymentMethodEnvelope, ErrorEnvelope> {
guard let envelope = DeletePaymentMethodEnvelope.from(data) else {
return SignalProducer(error: ErrorEnvelope.couldNotParseJSON)
}
return SignalProducer(value: envelope)
}
}
``` |
```java
/*
*
*
* path_to_url
*
* Unless required by applicable law or agreed to in writing,
* "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
* specific language governing permissions and limitations
*/
package io.ballerina.cli.cmd;
import com.google.gson.Gson;
import com.google.gson.JsonObject;
import io.ballerina.projects.ProjectException;
import io.ballerina.projects.Settings;
import io.ballerina.projects.TomlDocument;
import io.ballerina.projects.internal.ProjectFiles;
import io.ballerina.projects.internal.SettingsBuilder;
import io.ballerina.projects.util.ProjectConstants;
import io.ballerina.projects.util.ProjectUtils;
import org.apache.commons.io.FileUtils;
import org.mockito.MockedStatic;
import org.mockito.Mockito;
import org.testng.Assert;
import org.testng.annotations.AfterMethod;
import org.testng.annotations.BeforeClass;
import org.testng.annotations.Test;
import org.wso2.ballerinalang.util.RepoUtils;
import picocli.CommandLine;
import java.io.BufferedReader;
import java.io.IOException;
import java.net.URI;
import java.net.URISyntaxException;
import java.nio.charset.StandardCharsets;
import java.nio.file.Files;
import java.nio.file.Path;
import java.nio.file.Paths;
import java.util.Objects;
import static io.ballerina.cli.cmd.CommandOutputUtils.getOutput;
import static io.ballerina.projects.util.ProjectConstants.BALA_EXTENSION;
/**
* Push command tests.
*
* @since 2.0.0
*/
//@PowerMockIgnore({"jdk.internal.reflect.*", "javax.net.*", "com.sun.*"})
public class PushCommandTest extends BaseCommandTest {
private static final String VALID_PROJECT = "validApplicationProject";
private static final String POM_EXTENSION = ".pom";
private Path testResources;
@BeforeClass
public void setup() throws IOException {
super.setup();
try {
this.testResources = super.tmpDir.resolve("build-test-resources");
URI testResourcesURI = Objects.requireNonNull(getClass().getClassLoader().getResource("test-resources"))
.toURI();
Files.walkFileTree(Paths.get(testResourcesURI),
new BuildCommandTest.Copy(Paths.get(testResourcesURI), this.testResources));
} catch (URISyntaxException e) {
Assert.fail("error loading resources");
}
}
@AfterMethod(alwaysRun = true)
@Override
public void afterMethod() throws IOException {
super.afterMethod();
Path validBalProject = Paths.get("build").resolve("validProjectWithTarget");
ProjectUtils.deleteDirectory(validBalProject);
validBalProject = Paths.get("build").resolve("tool-gayals");
ProjectUtils.deleteDirectory(validBalProject);
}
@Test(description = "Push package with invalid path")
public void testPushWithInvalidPath() throws IOException {
Path validBalProject = this.testResources.resolve(VALID_PROJECT);
PushCommand pushCommand = new PushCommand(validBalProject, printStream, printStream, false);
String invalidPath = "tests";
new CommandLine(pushCommand).parseArgs(invalidPath);
pushCommand.execute();
String buildLog = readOutput(true);
String actual = buildLog.replace("\r", "");
String expected = "path provided for the bala file does not exist: " + invalidPath + ".";
Assert.assertTrue(actual.contains(expected));
}
@Test (description = "Push a package to a custom remote repository")
public void testPushPackageCustom() throws IOException {
String org = "luheerathan";
String packageName = "pact1";
String version = "0.1.0";
String expected = "Successfully pushed src/test/resources/test-resources/custom-repo/" +
"luheerathan-pact1-any-0.1.0.bala to 'repo-push-pull' repository.\n";
Path mockRepo = Paths.get("build").resolve("ballerina-home").resolve("repositories").resolve("repo-push-pull");
Path balaPath = Paths.get("src", "test", "resources", "test-resources", "custom-repo",
"luheerathan-pact1-any-0.1.0.bala");
PushCommand pushCommand = new PushCommand(null, printStream, printStream, false, balaPath);
String[] args = { "--repository=repo-push-pull" };
new CommandLine(pushCommand).parseArgs(args);
try (MockedStatic<RepoUtils> repoUtils = Mockito.mockStatic(RepoUtils.class, Mockito.CALLS_REAL_METHODS)) {
repoUtils.when(RepoUtils::readSettings).thenReturn(readSettings(testResources.resolve("custom-repo")
.resolve("Settings.toml"), mockRepo.toAbsolutePath().toString()
.replace("\\", "/")));
pushCommand.execute();
}
String buildLog = readOutput(true);
String actual = buildLog.replace("\r", "");
Assert.assertEquals(actual.replace("\\", "/"), expected);
String artifact = packageName + "-" + version + BALA_EXTENSION;
String pomFile = packageName + "-" + version + POM_EXTENSION;
String pushPullPath = mockRepo.resolve(org).resolve(packageName).resolve(version).toAbsolutePath().toString();
for (String ext : new String[]{".sha1", ".md5", ""}) {
Assert.assertTrue(Paths.get(pushPullPath, artifact + ext).toFile().exists());
Assert.assertTrue(Paths.get(pushPullPath, pomFile + ext).toFile().exists());
}
}
@Test (description = "Push a package to a custom remote repository(not exist in Settings.toml)")
public void testPushPackageNonExistingCustom() throws IOException {
String expected = "ballerina: unsupported repository 'repo-push-pul' found. " +
"Only 'local' repository and repositories mentioned in the Settings.toml are supported.\n";
Path mockRepo = Paths.get("build").resolve("ballerina-home").resolve("repositories").resolve("repo-push-pull");
Path balaPath = Paths.get("src", "test", "resources", "test-resources", "custom-repo",
"luheerathan-pact1-any-0.1.0.bala");
PushCommand pushCommand = new PushCommand(null, printStream, printStream, false, balaPath);
String[] args = { "--repository=repo-push-pul" };
new CommandLine(pushCommand).parseArgs(args);
try (MockedStatic<RepoUtils> repoUtils = Mockito.mockStatic(RepoUtils.class, Mockito.CALLS_REAL_METHODS)) {
repoUtils.when(RepoUtils::readSettings).thenReturn(readSettings(testResources.resolve("custom-repo")
.resolve("Settings.toml"), mockRepo.toAbsolutePath().toString()));
pushCommand.execute();
}
String buildLog = readOutput(true);
String actual = buildLog.replaceAll("\r", "");
Assert.assertEquals(actual, expected);
}
private static Settings readSettings(Path settingsFilePath, String repoPath) {
try {
String settingString = Files.readString(settingsFilePath);
settingString = settingString.replaceAll("REPO_PATH", repoPath);
TomlDocument settingsTomlDocument = TomlDocument
.from(String.valueOf(settingsFilePath.getFileName()), settingString);
SettingsBuilder settingsBuilder = SettingsBuilder.from(settingsTomlDocument);
return settingsBuilder.settings();
} catch (IOException e) {
return Settings.from();
}
}
@Test(description = "Push package with invalid file extension")
public void testPushWithInvalidFileExtension() throws IOException {
Path validBalProject = this.testResources.resolve(VALID_PROJECT);
PushCommand pushCommand = new PushCommand(validBalProject, printStream, printStream, false);
String invalidExtensionFilePath = this.testResources.resolve("non-bal-file")
.resolve("hello_world.txt").toString();
new CommandLine(pushCommand).parseArgs(invalidExtensionFilePath);
pushCommand.execute();
String buildLog = readOutput(true);
String actual = buildLog.replaceAll("\r", "");
String expected = "file provided is not a bala file: " + invalidExtensionFilePath + ".";
Assert.assertTrue(actual.contains(expected));
}
@Test(description = "Push package with custom path")
public void testPushWithCustomPath() throws IOException {
Path validBalProject = Paths.get("build").resolve("validProjectWithTarget");
FileUtils.copyDirectory(
this.testResources.resolve("validProjectWithTarget").toFile(), validBalProject.toFile());
FileUtils.moveDirectory(
validBalProject.resolve("target-dir").toFile(), validBalProject.resolve("custom").toFile());
Path customTargetDirBalaPath = validBalProject.resolve("custom").resolve("bala")
.resolve("foo-winery-any-0.1.0.bala");
PushCommand pushCommand = new PushCommand(validBalProject, printStream, printStream, false,
customTargetDirBalaPath);
String[] args = { "--repository=local" };
new CommandLine(pushCommand).parseArgs(args);
Path mockRepo = Paths.get("build").resolve("ballerina-home");
try (MockedStatic<RepoUtils> repoUtils = Mockito.mockStatic(RepoUtils.class)) {
repoUtils.when(RepoUtils::createAndGetHomeReposPath).thenReturn(mockRepo);
repoUtils.when(RepoUtils::getBallerinaShortVersion).thenReturn("1.0.0");
repoUtils.when(RepoUtils::readSettings).thenReturn(Settings.from());
pushCommand.execute();
}
String buildLog = readOutput(true);
String actual = buildLog.replaceAll("\r", "");
String expected = "Successfully pushed " + customTargetDirBalaPath + " to 'local' repository.";
Assert.assertTrue(actual.contains(expected));
try {
ProjectFiles.validateBalaProjectPath(mockRepo.resolve("repositories").resolve("local").resolve("bala")
.resolve("foo").resolve("winery").resolve("0.1.0").resolve("any"));
} catch (ProjectException e) {
Assert.fail(e.getMessage());
}
}
@Test(description = "Push a tool to local repository")
public void testPushToolToLocal() throws IOException {
Path validBalProject = Paths.get("build").resolve("tool-gayals");
FileUtils.copyDirectory(
this.testResources.resolve("tool-gayals").toFile(), validBalProject.toFile());
FileUtils.moveDirectory(
validBalProject.resolve("target-dir").toFile(), validBalProject.resolve("custom").toFile());
Path customTargetDirBalaPath = validBalProject.resolve("custom").resolve("bala")
.resolve("gayaldassanayake-tool_gayal-java17-1.1.0.bala");
PushCommand pushCommand = new PushCommand(validBalProject, printStream, printStream, false,
customTargetDirBalaPath);
String[] args = { "--repository=local" };
new CommandLine(pushCommand).parseArgs(args);
Path mockRepo = Paths.get("build").resolve("ballerina-home");
try (MockedStatic<RepoUtils> repoUtils = Mockito.mockStatic(RepoUtils.class)) {
repoUtils.when(RepoUtils::createAndGetHomeReposPath).thenReturn(mockRepo);
repoUtils.when(RepoUtils::getBallerinaShortVersion).thenReturn("1.0.0");
repoUtils.when(RepoUtils::readSettings).thenReturn(Settings.from());
pushCommand.execute();
}
String buildLog = readOutput(true);
String actual = buildLog.replaceAll("\r", "");
String expected = "Successfully pushed " + customTargetDirBalaPath + " to 'local' repository.";
Assert.assertTrue(actual.contains(expected));
try {
ProjectFiles.validateBalaProjectPath(mockRepo.resolve("repositories").resolve("local")
.resolve("bala").resolve("gayaldassanayake").resolve("tool_gayal")
.resolve("1.1.0").resolve("java17"));
} catch (ProjectException e) {
Assert.fail(e.getMessage());
}
Path localToolJsonPath = mockRepo.resolve("repositories").resolve("local").resolve("bala")
.resolve("local-tools.json");
Assert.assertTrue(Files.exists(localToolJsonPath));
try (BufferedReader bufferedReader = Files.newBufferedReader(localToolJsonPath, StandardCharsets.UTF_8)) {
JsonObject localToolJson = new Gson().fromJson(bufferedReader, JsonObject.class);
JsonObject pkgDesc = localToolJson.get("luhee").getAsJsonObject();
Assert.assertEquals(pkgDesc.get("org").getAsString(), "gayaldassanayake");
Assert.assertEquals(pkgDesc.get("name").getAsString(), "tool_gayal");
}
}
@Test(description = "Push package without bala directory")
public void testPushWithoutBalaDir() throws IOException {
String expected = "cannot find bala file for the package: winery. Run "
+ "'bal pack' to compile and generate the bala.";
Path validBalProject = this.testResources.resolve(VALID_PROJECT);
PushCommand pushCommand = new PushCommand(validBalProject, printStream, printStream, false);
new CommandLine(pushCommand).parseArgs();
pushCommand.execute();
String buildLog = readOutput(true);
String actual = buildLog.replaceAll("\r", "");
Assert.assertTrue(actual.contains(expected));
}
@Test(description = "Push package without bala file")
public void testPushWithoutBala() throws IOException {
Path projectPath = this.testResources.resolve(VALID_PROJECT);
System.setProperty("user.dir", projectPath.toString());
// Build project
PackCommand packCommand = new PackCommand(projectPath, printStream, printStream, false, true);
new CommandLine(packCommand).parseArgs();
packCommand.execute();
String buildLog = readOutput(true);
Assert.assertEquals(buildLog.replaceAll("\r", ""), getOutput("compile-bal-project.txt"));
Assert.assertTrue(
projectPath.resolve("target").resolve("bala").resolve("foo-winery-any-0.1.0.bala").toFile().exists());
// Delete bala
Assert.assertTrue(
projectPath.resolve("target").resolve("bala").resolve("foo-winery-any-0.1.0.bala").toFile().delete());
// Push
String expected = "cannot find bala file for the package: winery. Run "
+ "'bal pack' to compile and generate the bala.";
PushCommand pushCommand = new PushCommand(projectPath, printStream, printStream, false);
new CommandLine(pushCommand).parseArgs();
pushCommand.execute();
buildLog = readOutput(true);
String actual = buildLog.replaceAll("\r", "");
Assert.assertTrue(actual.contains(expected));
}
@Test(description = "Test push command with argument and a help")
public void testPushCommandArgAndHelp() throws IOException {
Path validBalProject = this.testResources.resolve(VALID_PROJECT);
// Test if no arguments was passed in
String[] args = { "sample2", "--help" };
PushCommand pushCommand = new PushCommand(validBalProject, printStream, printStream, false);
new CommandLine(pushCommand).parseArgs(args);
pushCommand.execute();
Assert.assertTrue(readOutput().contains("ballerina-push - Push the Ballerina Archive (BALA)"));
}
@Test(description = "Test push command with help flag")
public void testPushCommandWithHelp() throws IOException {
Path validBalProject = this.testResources.resolve(VALID_PROJECT);
// Test if no arguments was passed in
String[] args = { "-h" };
PushCommand pushCommand = new PushCommand(validBalProject, printStream, printStream, false);
new CommandLine(pushCommand).parseArgs(args);
pushCommand.execute();
Assert.assertTrue(readOutput().contains("ballerina-push - Push the Ballerina Archive (BALA)"));
}
@Test
public void testPushToCustomRepo() throws IOException {
Path validBalProject = Paths.get("build").resolve("validProjectWithTarget");
FileUtils.copyDirectory(
this.testResources.resolve("validProjectWithTarget").toFile(), validBalProject.toFile());
FileUtils.moveDirectory(
validBalProject.resolve("target-dir").toFile(), validBalProject.resolve("target").toFile());
Path mockRepo = Paths.get("build").resolve("ballerina-home");
// Test if no arguments was passed in
String[] args = { "--repository=local" };
PushCommand pushCommand = new PushCommand(validBalProject, printStream, printStream, false);
new CommandLine(pushCommand).parseArgs(args);
try (MockedStatic<RepoUtils> repoUtils = Mockito.mockStatic(RepoUtils.class)) {
repoUtils.when(RepoUtils::createAndGetHomeReposPath).thenReturn(mockRepo);
repoUtils.when(RepoUtils::getBallerinaShortVersion).thenReturn("1.0.0");
repoUtils.when(RepoUtils::readSettings).thenReturn(Settings.from());
pushCommand.execute();
}
try {
ProjectFiles.validateBalaProjectPath(mockRepo.resolve("repositories").resolve("local").resolve("bala")
.resolve("foo").resolve("winery").resolve("0.1.0").resolve("any"));
} catch (ProjectException e) {
Assert.fail(e.getMessage());
}
}
@Test
public void testPushWithoutPackageMd() throws IOException {
Path projectPath = this.testResources.resolve(VALID_PROJECT);
System.setProperty("user.dir", projectPath.toString());
// Pack project
PackCommand packCommand = new PackCommand(projectPath, printStream, printStream, false, true);
new CommandLine(packCommand).parseArgs();
packCommand.execute();
Assert.assertTrue(
projectPath.resolve("target").resolve("bala").resolve("foo-winery-any-0.1.0.bala").toFile().exists());
// Push
String expected = "Package.md is missing in bala file";
PushCommand pushCommand = new PushCommand(projectPath, printStream, printStream, false);
new CommandLine(pushCommand).parseArgs();
pushCommand.execute();
String buildLog = readOutput(true);
String actual = buildLog.replaceAll("\r", "");
Assert.assertTrue(actual.contains(expected));
}
@Test (enabled = false)
public void testPushWithEmptyPackageMd() throws IOException {
Path projectPath = this.testResources.resolve(VALID_PROJECT);
System.setProperty("user.dir", projectPath.toString());
Files.createFile(projectPath.resolve(ProjectConstants.PACKAGE_MD_FILE_NAME));
// Pack project
PackCommand packCommand = new PackCommand(projectPath, printStream, printStream, false, true);
new CommandLine(packCommand).parseArgs();
packCommand.execute();
Assert.assertTrue(
projectPath.resolve("target").resolve("bala").resolve("foo-winery-any-0.1.0.bala").toFile().exists());
Files.delete(projectPath.resolve(ProjectConstants.PACKAGE_MD_FILE_NAME));
// Push
String expected = "md file cannot be empty";
PushCommand pushCommand = new PushCommand(projectPath, printStream, printStream, false);
new CommandLine(pushCommand).parseArgs();
pushCommand.execute();
String buildLog = readOutput(true);
String actual = buildLog.replaceAll("\r", "");
Assert.assertTrue(actual.contains(expected));
}
@Test
public void testPushToAnUnsupportedRepo() throws IOException {
Path projectPath = this.testResources.resolve("validLibraryProject");
// Build project
PackCommand packCommand = new PackCommand(projectPath, printStream, printStream, false, true);
new CommandLine(packCommand).parseArgs();
packCommand.execute();
Assert.assertTrue(
projectPath.resolve("target").resolve("bala").resolve("foo-winery-any-0.1.0.bala").toFile().exists());
String[] args = { "--repository=stdlib.local" };
PushCommand pushCommand = new PushCommand(projectPath, printStream, printStream, false);
new CommandLine(pushCommand).parseArgs(args);
pushCommand.execute();
String errMsg = "unsupported repository 'stdlib.local' found. Only 'local' repository and repositories " +
"mentioned in the Settings.toml are supported.";
Assert.assertTrue(readOutput().contains(errMsg));
}
}
``` |
Danny Detective Inc. is a 2021 Bengali language thriller and suspense web series written and directed by Anjan Dutt.
The series starring Barun Chanda, Ankita Chakraborty, Anjan Dutt, Samadarshi Dutta, Sudipa Basu, and Suprobhat Das are in lead roles.
The whole story of the series is based on the book "Danny Detective Inc" written by Anjan Dutt.
Music of the series is composed by Neel Dutt and cinematography is done by Pravatendu Mondal.
Cast
Barun Chanda
Ankita Chakraborty
Anjan Dutt
Sudipa Basu
Suprobhat Das
Samadarshi Dutta
Synopsis
Reporter Subrata Sharma quits his job to work for Kolkata's Danny Detective Inc., a small-time detective service. His supervisor, Danny, is slain while working on an abduction case. Subrata is compelled to take on the case by circumstances. He goes to Dooars to investigate a major criminal organisation and apprehends the murderer. He assumes control of the organisation.
Episodes
Soundtrack
1. Danny Detective INC (Original Score from the series)
References
External links
Indian thriller films
2021 films
Bengali-language web series
Indian web series |
Bevagna is a town and comune in the central part of the Italian province of Perugia (Umbria), in the flood plain of the Topino river.
Bevagna is south-east of Perugia, west of Foligno, north-north-west of Montefalco, south of Assisi and north-west of Trevi.
It has a population of c. 5,000, with the town of Bevagna proper accounting for about half of that. It is a member of the I Borghi più belli d'Italia ("The most beautiful villages of Italy") association.
History
The city was originally an Etrusco-Oscan settlement. Around 80-90 BC it became a Roman municipium, called Mevania, in the Augustan Regio VI. It lay on the western branch of the Via Flaminia, west-north-west of Forum Flaminii, where the branches rejoin. It is mentioned on several ancient itineraries, following the Vicus Martis Tudertium on the way out of Rome.
In 310 BC the consul Fabius broke the Umbrian forces here; but otherwise it is not mentioned until the 1st century AD. In 69 the army of Vitellius awaited here the advance of Vespasian.
Pastures near the Tinia river and the white oxen of the Clitumnus River (the modern Clitunno) are mentioned by Propertius, whose family was from the area (from Assisium, Hispellum, or Mevania itself): they may refer to Mevania. Mevania is specifically mentioned by the later writers Silius Italicus, Lucan and Statius.
There are important remains of a temple near the north gate, of a theatre built into modern houses in the (misnamed) via dell'Anfiteatro, lesser remains of a second temple in the church of San Vincenzo near the east gate, mosaics belonging to midsized baths in the via Porta Guelfa, and very scanty remains of an amphitheatre at some distance from the modern town. The original walls, which have disappeared, were, according to Pliny (Hist. Nat. xxxv.173), built of unbaked bricks. The town now has a complete circuit of medieval stone walls that are said to be very near, if not identical with, the Roman walls.
After the Lombard conquest, it became the seat of a gastald in the Duchy of Spoleto, and after the year 1000 it was a free comune. In 1152 Frederick Barbarossa set it on fire. In 1249 it was again destroyed by the Count of Aquino. The Trinci family ruled it from 1371 to 1439. Later it was part of the Papal States until the unification of Italy.
Francis of Assisi and the birds
The legendary account of Francis of Assisi preaching to the birds took place in a field outside Bevagna. The stone on which he allegedly stood when preaching to the birds is now in the Ciccoli Chapel of the Church of San Francesco.
Main sights
Palazzo dei Consoli, known from 1187, with Teatro F. Torti (1886)
Romanesque church of S. Michele Arcangelo (12th-13th centuries)
Romanesque church of S. Silvestro (1195).
Church of Sant'Agostino (1316).
Church of San Francesco (after 1275)
Church of San Nicolò.
Church of Santa Maria in Laurenzia, built in the 13th century and later enlarged.
Church of San Vincenzo (known from the 12th century).
The medieval walls.
Ruins of a Roman temple.
Ruins of a Roman theatre.
Roman thermae with mosaics of marine life.
Castle of Cantalupo.
Castle of Castelbuono.
Church of Limigiano.
Castle of Torre del Colle.
Culture
The main events held in Bevagna include:
Primavera medievale (April): exposition of local culinary and artistic products held by the Associazione Mercato delle Gaitte.
Arte in Tavola (end of April): Spring festival with exhibitions by local artists, concerts, exhibitions of local products and dishes with tastings.
Mercato delle Gaite (June): big summer festival with medieval banquets, processions, challenges between the four gaite (quarters – those of San Giorgio, San Giovanni, San Pietro, and Santa Maria) and taverns.
Notable residents
The painter Andrea Camassei (1602–1649) was born in Bevagna.
The singer and composer Odoardo Ceccarelli (c. 1600–1668) was born in Bevagna.
References
External links
Official website
Pro Loco Bevagna
Bevagna.Net
Mercato del Gaite - all about the festivals (in Italian)
Mercato del Gaite English Video
Mevania at LacusCurtius
Roman sites of Umbria
Roman towns and cities in Italy
Borghi più belli d'Italia |
```shell
#!/bin/bash
#test:disabled
set -euo pipefail
source $(dirname $0)/../../utils.sh
TEST_ID=$(generate_test_id)
echo "TEST_ID = $TEST_ID"
ROOT=$(dirname $0)/../../..
env=jvm-$TEST_ID
fn_n=jvm-hello-n-$TEST_ID
fn_p=jvm-hello-p-$TEST_ID
cleanup() {
echo "previous response" $?
log "Cleaning up..."
clean_resource_by_id $TEST_ID
}
if [ -z "${TEST_NOCLEANUP:-}" ]; then
trap cleanup EXIT
else
log "TEST_NOCLEANUP is set; not cleaning up test artifacts afterwards."
fi
cd $ROOT/examples/jvm/java
log "Creating the jar from application"
#Using Docker to build Jar so that maven & other Java dependencies are not needed on CI server
docker run -it --rm -v "$(pwd)":/usr/src/mymaven -w /usr/src/mymaven maven:3.5-jdk-8 mvn clean package -q
log "Creating environment for Java"
fission env create --name $env --image $JVM_RUNTIME_IMAGE --version 2 --keeparchive=true
log "Creating pool manager & new deployment function for Java"
fission fn create --name $fn_p --deploy target/hello-world-1.0-SNAPSHOT-jar-with-dependencies.jar --env $env --entrypoint io.fission.HelloWorld
fission fn create --name $fn_n --deploy target/hello-world-1.0-SNAPSHOT-jar-with-dependencies.jar --env $env --executortype newdeploy --entrypoint io.fission.HelloWorld
log "Creating route for pool manager function"
fission route create --name $fn_p --function $fn_p --url /$fn_p --method GET
log "Creating route for new deployment function"
fission route create --name $fn_n --function $fn_n --url /$fn_n --method GET
log "Waiting for router & pools to catch up"
sleep 5
log "Testing pool manager function"
timeout 60 bash -c "test_fn $fn_p 'Hello'"
log "Testing new deployment function"
timeout 60 bash -c "test_fn $fn_n 'Hello'"
log "Test PASSED"
``` |
Anolis maia is a species of lizard in the family Dactyloidae. The species is found in Panama.
References
Anoles
Reptiles described in 2015
Taxa named by Sebastian Lotzkat
Taxa named by Gunther Köhler
Endemic fauna of Panama
Reptiles of Panama |
Upper Greensand Hangers: Wyck to Wheatley is a biological Site of Special Scientific Interest east of Alton in Hampshire. It is part of the East Hampshire Hangers Special Area of Conservation.
This site is composed of woods on the steep rocky slopes of the Upper Greensand. Bare rocks are covered by lime-loving bryophytes such as Tortula marginata, Chiloscyphus pallescens and Fissidens gracilifolius. There is also a population of the nationally scarce mollusc Macrogastra rolphii.
References
Sites of Special Scientific Interest in Hampshire |
Cluedo – Das Mörderspiel is an interactive crime show by the private broadcaster Sat.1 based on the world-famous detective board game Cluedo. The Australian version of the game show of the same name, which was shown on the Nine Network channel from 1992 to 1993, served as the template for the twelve German episodes.
In Germany, the show was moderated by Gundis Zámbó and initially broadcast on Thursdays at 8:15 p.m. However, due to low ratings, those responsible took the show out of the program after only seven episodes, in order to broadcast the remaining five episodes later in the summer on Saturday afternoons. The music of the show was composed by Martin Böttcher.
Development
The German adaption, titled Cluedo – Das Mörderspiel [de], aired for a limited duration of one or two seasons in 1993. Created by Stefan Fuchs, the series was broadcast on the private network Sat.1. The narration was provided by Klaus Kindler, and Gundis Zambo hosted the show. The show's development coincided with Sat.1's efforts to establish its own identity and attract attention, leading to the exploration of innovative ideas and talent. The musical composition for the series was by Martin Böttcher. The show was set in a fictional version of Schloss Leonberg (Leonberg Castle), drawing inspiration from the actual Sünching Castle near Regensburg.
Each episode featured the classic Cluedo suspects and six potential crime scenes (drawing room, dining room, library, billiard room, study, and kitchen). While they remained consistent throughout the series, the weapons and motives varied between episodes. The format of the show, with episodes lasting 50 minutes, was innovative for German television at the time. Originally airing on Thursday evenings at 8:15 p.m., the show was temporarily removed from the schedule due to low ratings after seven episodes, with the remaining five episodes rescheduled for a summer broadcast on Saturday afternoons.
Plot and gameplay
The gameplay of the German adaptation differed from the British version, following Australia's model. Instead of celebrity teams, the audience directly interviewed suspects and aimed to solve the case for a holiday reward. The program's structure included a short film depicting an uninvited guest's arrival at the castle and the crime motives of the six suspects. The studio audience exclusively participated in clarifying the case, questioning suspects present in the studio about the events and making assumptions.
Interspersed between interrogations, the scene shifted to Leonberg Castle, where Chief Inspector Taller (played by Heinz Weiss) progressively resolved the murder case through stages and flashbacks. At the end of each episode, the perpetrator confessed, addressing all unresolved questions about the murder. The winner, the first to correctly identify the combination of perpetrator, murder weapon, and crime scene from the audience, received a prize of a flight to the Dominican Republic, the Balearic Islands, or the Canary Islands.
The six suspects were Pfarrer Clemens Grün (Klaus Barner), Oberst Friedrich Wilhelm von Gatow (Horst Frank), Gloria Thorbach (Cay Helmich), Peter Blohm (Till Topf), Caronin Elisabeth von Porz (Christine Wodetzky), and Helene Weiss (Inge Wolffberg). Crime scenes in each episode included the salon, dining room, library, billiard room, study, and kitchen. Later in the scenario, following the occurrence of the murder, Inspector Hauptkommissar Rolf Taller (Hanz Weiss) appeared to investigate the crime, revealing further details.
Episodes
Künstlerpech (28 Jan. 1993)
Schnüffler leben gefährlich (4 Feb. 1993)
Der letzte Kuss (11 Feb. 1993)
Tödliches Training (18 Feb. 1993)
First Lady (4 Mar. 1993)
Ein Engel kommt selten allein (11 Mar. 1993)
Eine heiße Story (1993)
Stimmen aus dem Jenseits (1993)
Satans Sänger (1993)
Blau ist dicker als Wasser (1993)
Machtwechsel in Schloß Leonberg (1993)
Der falsche Gast (1993)
Critical reception
Hanz Weiss's portrayal was noted by Tagesspiegel as a character the audience could rely on. Quotenmeter characterized the show as one of the "innovative, unconventional, and sometimes kitschy" programs brought to Sat.1 by Stefan Fuchs during his tenure, with some becoming popular among the audience. In 2013, MGTV hosted the show on its platform and observed that while the cast included well-known actors, the format itself did not achieve significant success.
References
External links
German Cluedo Das Mörderspiel TV Series Press Clippings: Christine Wodetzky, Horst Frank, Cay Helmich, Till Topf, Inge Wolffberg, Klaus Barner, Heinz Weiss, Gundis Zambo
Photos tv film
German television series
Sat.1 original programming |
Dmitri Aleksandrovich Pavlov is a Russian composer. He was born in St Petersburg in 1959, and graduated from St. Petersburg Conservatoire in 1982 class Theory and Composition. Acclaimed for his work as a film composer and perhaps best known for his score for the film The Cuckoo (Кукушка in Russian) directed by Aleksandr Rogozhkin.
Apart from music for film, Dmitri Pavlov has written for ballet, theatre and orchestra. He formed Pavlov Ballet in 1992, and also arranged for the 'Spirit of Mozart' concert in Vienna, commemorating 250th anniversary of Mozart's birth. One of his works is Concerto for piano, computer and orchestra, which breaks boundaries and successfully merges sampled computer generated sounds with classical.
He used the computer generated sounds in recording of another work The Fall of Babylon, biblical Allegory for Choir and Orchestra based on Old and New Testament Texts. ( This was recorded at St.Petersburg Radio and Television Studio, St.Petersburg Conservatoire Choir, St.Petersburg Philharmonic Orchestra, conductor Alexander Titov, solo violin-Alexander Shustin, recorder-Alexander Kiskachy, solo cello-Sergey Pechatin, electronics-Dmitri Pavlov, sound engineer-Vladimir Lukichev.)
Pavlov is married and has two children. He currently resides in Berlin.
Film music
Dmitri Pavlov written music for the following films:
1988 "Bells of the North", director - M Micheev
1988 "Requiem",director - K Artjuchov
1988 "Return", director - A Golovin
1989 "Alexander Nevsky", director - A Golovin
1989 "The Lost Soul", director - M Micheev
1990 "The Paternal House" The House of F Dostoievsky, director - M Micheev
1992 "Kolyma", director - M Micheev
1992 "Maximilian Voloshin" director - A Rjabokon
1993 "Tchekist", director A.Rogozhkin
1994 "Boule de Suif" film-ballet, produced by "Telefilm", director - Alexander Tikhonov
1994 "Cameo Gonzaga", 1994, director - L Volkov
1994 "Physiology of Russian Life " / Great Russian physiologist Ivan Pavlov, director - I Alimpiev
2002 "The Cuckoo", director A Rogozhkin
2003 "Sapiens"(short film),director A Rogozhkin
2004 "The one's strange life", music for a film serial, director A Rogozhkin
2006 "Peregon" director A Rogozhkin
2008 "Igra" (ORT), director A Rogozhkin
Awards
Pavlov has won many awards for his compositions, including the 2004 State Prize from the Russian Federation.
See also
The Cuckoo (film)
References
External links
Dmitri Pavlov website
The New York Times Movies
Russian male composers
Living people
1959 births
Composers from Saint Petersburg |
Kirsten Jane Reilly (born 20 August 1995) is a Scottish footballer who plays as a midfielder for Crystal Palace in the FA Women's Championship.
Early life and education
Born in Edinburgh to Kathryn and John Reilly, Kirsten was raised with her sibling Neil in Musselburgh where she attended Musselburgh Grammar School. As a youth, she played for Musselburgh Windsor and Heart of Midlothian.
Playing career
University of West Alabama Tigers, 2013–16
Reilly attended the University of West Alabama where she played for the UWA Tigers from 2013 to 2016. As a freshman, she was named to the Gulf South Conference All-Tournament Team, scored one goal and provided three assists. During her sophomore season, she scored three goals, including two game-winners, and recorded two assists. As a junior, Reilly scored nine goals during the 2015 season, including seven game winners that ranked second in the Gulf South Conference (GSC). Twice named GGSC Player of the Week, Reilly provided six assists on goals scored by other players.
Hibernian, 2018–19
Reilly signed with Hibernian ahead of the 2018 Scottish Women's Premier League season. She helped Hibs finish second in the league and qualify for the 2019–20 UEFA Women's Champions League, also winning two SWPL Cups and the Scottish Women's Cup in 2018.
Bristol City, 2019
On 13 September 2019, Reilly signed with Bristol City for the 2019–20 FA WSL season. She made her debut for the team the following week in a 3–0 League Cup win over London Bees and made her only FA WSL appearance coming on as an 89th minute substitute in a 3–3 draw with Reading.
Rangers, 2020–2022
On 21 December 2019, Reilly announced her return to the SWPL, signing an 18-month contract with Rangers ahead of the 2020 season.
References
External links
Bristol City player profile
University of West Alabama player profile
1995 births
Living people
Scottish women's footballers
Hibernian W.F.C. players
Rangers W.F.C. players
Bristol City W.F.C. players
Scottish Women's Premier League players
Women's Super League players
Women's association football midfielders
West Alabama Tigers women's soccer players
Scottish expatriate sportspeople in the United States
Scottish expatriate women's footballers
Expatriate women's soccer players in the United States
People educated at Musselburgh Grammar School
Footballers from Edinburgh
Footballers from Musselburgh |
Yi Hyoseok (, April 5, 1907 – May 5, 1942) was a Korean writer.
Life
Yi Hyoseok, who wrote under the pen-name 'Gasan' (가산) was born February 23, 1907 in Pyeongchang, Gangwon-do. Yi was deeply impressed by Chekhov and Thomas Mann and graduated first in his class at the Gyeongseong Imperial University. Yi Hyoseok enrolled in Gyeongseong Imperial University in 1925, the same year, his poem “Spring” (Bom) was published in the Daily News(매일신보). At Gyeongsong Yi published his poetry in a student magazine (Clear and Cool or Cheongnyang), and in a literary coterie journal (Friends in Literature or 무누). He graduated in 1930 with a degree in English Literature and worked for a short stint in the censorship section of the Police Affairs Division of the Japanese Government-General. Yi then moved to his wife's hometown of Gyeongseong, Hamgyeongbuk-do, where he worked as an English teacher. In 1934 he began teaching at Soongsil University in Pyeongyang. He died in May 1942 at the age of 35.
Work
Yi Hyoseok wrote more than 70 pieces of fiction and first attracted attention of the literary world in 1928 when his story City and Ghost (Dosi-wa yuryeong) was published in Light of Korea (Joseon jigwang). Yi published many other works including Unanticipated Meeting (Giu), Shattered Red Lantern (Kkaetteuryeojineun hongdeung) and At Sea Near Russia (Noryeong geunhae), all of which reflected his socialist sympathies. Yi's work was self-consciously political and frequently focused on the lives of unfortunate women forced into prostitution, often combining his political message with explorations of sexuality. In 1933, however, coincident with increased pressure from Japanese occupiers that literature not be political, Yi Hyoseok helped found the Group of Nine (Guin hoe), and abandoned political literature in favor of more aesthetic approaches. The Group of Nine included Jung Jiyong, Yi Sang, Kim Girim, Lee Taejun all of whom influenced Yi Hyoseok.
Yi continued to be concerned with eroticism, but his focus also turned largely to nature. In his story Pig, Yi writes of a man who raises a sow, with the intent of building a pig farm, but superimposes human sexuality over the rutting of the pigs. In Bunnyeo, Yi explored a sexually wanton character. When Buckwheat Flowers Bloom (also known as The Buckwheat Season in English), Yi's most famous story, follows the story of an itinerant trader and the love he feels for a younger man, his son as the result of a one-night stand. That story has been described as "outstanding" and a "modern classic", and has been adopted into a movie directed by Lee Song-gu in 1967.
Personal life
One of Yi's partners was the singer Wang Su-bok.
Yi Hyoseok Village and Festival
When Buckwheat Blossoms Bloom is set in Yi's hometown of Bongpyeong-myeon, Pyeongchang-gun, and the area is still famous for its buckwheat production. The town is surrounded by a ring of 1,500 meter tall mountains and the Yi Hyoseok Memorial Hall is located in the town inside the Yi Hyoseok Culture Village which, in 1990 was designated ‘the first national cultural village,’ by the Ministry of Culture and Tourism. The site features is a small river, a water mill house, a small thatched house and the inevitable miniature dioramas of the novel.
At the end of August to early September (the date differs each year) the annual Yi Hyoseok Cultural Festival takes place. The event is buckwheat themed and the events include an essay contest, a photo contest, a colorful parade and a variety of films and performances related to Buckwheat Blossoms. There is also an abundance of buckwheat based food, including excellent noodles and pancakes.
Works
When Buckwheat Flowers Bloom / The Buckwheat Season (메밀꽃 필 무렵)
KHI HOA KiẾU MẠCH NỚ (메밀꽃 필 무렵)
Cuando florece el alforfón (이효석 단편선)
Flower Dust
Pollen (화분)
Endless Blue Sky (벽공문한)
Collected Works of Yi Hyoseok (효석전집)
References
External links
Yi Hyoseok Memorial Hall (이효석 문학관)
1907 births
1942 deaths
Korean writers
Korean novelists
Korean male poets
20th-century novelists
20th-century Korean poets
20th-century male writers |
In human anatomy, the abdominal aorta is the largest artery in the abdominal cavity. As part of the aorta, it is a direct continuation of the descending aorta (of the thorax).
Structure
The abdominal aorta begins at the level of the diaphragm, crossing it via the aortic hiatus, technically behind the diaphragm, at the vertebral level of T12. It travels down the posterior wall of the abdomen, anterior to the vertebral column. It thus follows the curvature of the lumbar vertebrae, that is, convex anteriorly. The peak of this convexity is at the level of the third lumbar vertebra (L3).
It runs parallel to the inferior vena cava, which is located just to the right of the abdominal aorta, and becomes smaller in diameter as it gives off branches. This is thought to be due to the large size of its principal branches. At the 11th rib, the diameter is 122mm long and 55mm wide and this is because of the constant pressure. The abdominal aorta is clinically divided into 2 segments:
The suprarenal abdominal or paravisceral segment, inferior to the diaphragm but superior to the renal arteries.
The Infrarenal segment, inferior to the renal arteries and superior to the iliac bifurcation.
Branches
The abdominal aorta supplies blood to much of the abdominal cavity. It begins at T12 and ends at L4 with its bifurcation into the common iliac arteries and usually has the following branches:
The bifurcation (union) of the inferior vena cava is at L5 and therefore below that of the bifurcation of the aorta.
inferior phrenic a.
celiac a.
left gastric a.
splenic a.
short gastric arteries (6)
splenic arteries (6)
left gastroepiploic a.
pancreatic arteries
common hepatic a.
right gastric a.
gastroduodenal a.
right gastroepiploic a.
superior pancreaticoduodenal a.
right hepatic a.
cystic a.
left hepatic a.
superior mesenteric a.
inferior pancreaticoduodenal a.
jejunal and ileal arteries
middle colic a.
right colic a.
ileocolic a
anterior cecal a.
posterior cecal a. – appendicular a.
ileal a.
colic a.
middle suprarenal a.
renal a.
testicular or ovarian a.
four lumbar arteries
inferior mesenteric a.
left colic a.
sigmoid arteries (2 or 3)
superior rectal a.
median sacral a.
common iliac a.
external iliac a.
internal iliac a.
Relations
The abdominal aorta lies slightly to the left of the midline of the body. It is covered, anteriorly, by the lesser omentum and stomach, behind which are the branches of the celiac artery and the celiac plexus; below these, by the lienal vein (splenic vein), are the pancreas, the left renal vein, the inferior part of the duodenum, the mesentery, and the aortic plexus.
Posteriorly, it is separated from the lumbar vertebrae and intervertebral fibrocartilages by the anterior longitudinal ligament and left lumbar veins.
On the right side it is in relation above with the azygos vein, cisterna chyli, thoracic duct, and the right crus of the diaphragm—the last separating it from the upper part of the inferior vena cava, and from the right celiac ganglion; the inferior vena cava is in contact with the aorta below.
On the left side are the left crus of the diaphragm, the left celiac ganglion, the ascending part of the duodenum, and some coils of the small intestine.
Relationship with inferior vena cava
The abdominal aorta's venous counterpart, the inferior vena cava (IVC), travels parallel to it on its right side.
Above the level of the umbilicus, the aorta is somewhat posterior to the IVC, sending the right renal artery travelling behind it. The IVC likewise sends its opposite side counterpart, the left renal vein, crossing in front of the aorta.
Below the level of the umbilicus, the situation is generally reversed, with the aorta sending its right common iliac artery to cross its opposite side counterpart (the left common iliac vein) anteriorly.
Collateral circulation
The collateral circulation would be carried on by the anastomoses between the internal thoracic artery and the inferior epigastric artery; by the free communication between the superior and inferior mesenterics, if the ligature were placed between these vessels; or by the anastomosis between the inferior mesenteric artery and the internal pudendal artery, when (as is more common) the point of ligature is below the origin of the inferior mesenteric artery; and possibly by the anastomoses of the lumbar arteries with the branches of the internal iliac artery.
Clinical significance
Aneurysm
Additional images
See also
Cardiovascular system
Nutcracker syndrome
Aortocaval compression syndrome
References
External links
UCC
Arteries of the abdomen
Aorta |
```shell
Extracting the `public key` from the `private key`
Disable SSH password authentication
Track SSH log-in attempts
Best password generation utilities
**SELinux** modes
``` |
Matteo Moscardi is an Italian rugby union player.
His usual position is as a centre and he currently plays for Rugby Rovigo Delta in Italian Top10.
Moscardi signed for Zebre Parma in July 2022 ahead of the 2022–23 United Rugby Championship. He made his debut in Round 2 of EPCR Challenge Cup in the 2022–23 season against the .
He played for Zebre until January 2023.
In 2018 and 2019 he was named in Italy U20s squad for annual Six Nations Under 20s Championship. On 26 May 2022, for the match against Netherlands, he was named in the 30-man Emerging Italy squad, for the 2022 July rugby union tests. On 10 January 2023, he was named in Italy A squad for a uncapped test against Romania A.
References
External links
It's Rugby England Profile
All Rugby Profile
2000 births
People from Rovigo
Living people
Italian rugby union players
Rugby union centres
Rugby Rovigo Delta players
Zebre Parma players |
Dieselpoint, Inc. is a privately held enterprise search company headquartered in Chicago, IL. The company was founded in 1999 and develops software to search large datasets with both structured and unstructured elements.
The company focuses on scalable search and faceted navigation, which enables search results to be ordered and classified in multiple ways based on like attributes. Result sets of any size can then be navigated using dynamically-generated menus. Menus are generated from the underlying document attributes or metadata. These are designed to give users context-dependent browse capability, allowing them to see what options are available to them at each step.
Dieselpoint's software is used in a variety of applications including e-commerce, document search, site search, PLM, ECM and OEM. Dieselpoint's APIs and search platform are written entirely in Java to simplify implementation and enable interoperability within a range of environments.
In 2006, 2007 and 2008 Dieselpoint was recognized by KM World magazine as one of the "Top 100 Companies that Matter in Knowledge Management." Dieselpoint competitors include Autonomy Corporation, Fast Search & Transfer ASA and Endeca Technologies Inc.
References
External links
Company website
Dieselpoint description on SearchTools.com
Faceted search description on SearchTools.com
KMWorld.com 100 Companies that Matter
Software companies based in Illinois
Software companies established in 1999
Companies based in Chicago
Software companies of the United States
1999 establishments in Illinois |
Sunny Bank is a historic home located near South Garden, Albemarle County, Virginia. It was started in 1797, and is a two-story, frame Palladian style house. It features a two-level pedimented portico projecting from the center three bays. The wings were originally one-story, but later raised to two stories within 20 years of their original construction. Also on the property are a contributing one-story frame office, kitchen and laundry building, smokehouse, log shed, and family cemetery.
It was added to the National Register of Historic Places in 1976.
References
External links
Sunny Bank, State Route 712 vicinity, North Garden, Albemarle County, VA: 7 measured drawings and 7 data pages at Historic American Buildings Survey
Plantation houses in Virginia
Houses on the National Register of Historic Places in Virginia
Palladian Revival architecture in Virginia
Houses completed in 1797
Houses in Albemarle County, Virginia
National Register of Historic Places in Albemarle County, Virginia
Historic American Buildings Survey in Virginia |
```hack
/*
*/
/*
* This file is part of Scylla.
*
* Scylla is free software: you can redistribute it and/or modify
* (at your option) any later version.
*
* Scylla is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
*
* along with Scylla. If not, see <path_to_url
*/
#pragma once
#include <seastar/core/sstring.hh>
#include <seastar/core/future.hh>
#include <seastar/core/distributed.hh>
#include "auth/service.hh"
#include "db/config.hh"
#include "db/system_distributed_keyspace.hh"
#include "database.hh"
#include "log.hh"
namespace db {
class extensions;
}
extern logging::logger startlog;
class bad_configuration_error : public std::exception {};
void init_storage_service(distributed<database>& db, sharded<auth::service>&, sharded<db::system_distributed_keyspace>&);
struct init_scheduling_config {
scheduling_group streaming;
scheduling_group statement;
scheduling_group gossip;
};
void init_ms_fd_gossiper(sstring listen_address
, uint16_t storage_port
, uint16_t ssl_storage_port
, bool tcp_nodelay_inter_dc
, sstring ms_encrypt_what
, sstring ms_trust_store
, sstring ms_cert
, sstring ms_key
, sstring ms_tls_prio
, bool ms_client_auth
, sstring ms_compress
, db::seed_provider_type seed_provider
, size_t available_memory
, init_scheduling_config scheduling_config
, sstring cluster_name = "Test Cluster"
, double phi = 8
, bool sltba = false);
/**
* Very simplistic config registry. Allows hooking in a config object
* to the "main" sequence.
*/
class configurable {
public:
configurable() {
// We auto register. Not that like cycle is assumed to be forever
// and scope should be managed elsewhere.
register_configurable(*this);
}
virtual ~configurable()
{}
// Hook to add command line options and/or add main config options
virtual void append_options(db::config&, boost::program_options::options_description_easy_init&)
{};
// Called after command line is parsed and db/config populated.
// Hooked config can for example take this oppurtunity to load any file(s).
virtual future<> initialize(const boost::program_options::variables_map&) {
return make_ready_future();
}
virtual future<> initialize(const boost::program_options::variables_map& map, const db::config& cfg, db::extensions& exts) {
return initialize(map);
}
// visible for testing
static std::vector<std::reference_wrapper<configurable>>& configurables();
static future<> init_all(const boost::program_options::variables_map&, const db::config&, db::extensions&);
static future<> init_all(const db::config&, db::extensions&);
static void append_all(db::config&, boost::program_options::options_description_easy_init&);
private:
static void register_configurable(configurable &);
};
``` |
Paul Starrett Sample (September 14, 1896 in Louisville, Kentucky – February 26, 1974 in Norwich, Vermont) was an American artist who portrayed life in New England in the middle of the 20th Century with a style that showed elements of "Social Realism and Regionalism."
Early life
Sample was born in Louisville, Kentucky in 1896. After having moved across the country with his family on several occasions, Sample attended Dartmouth College in Hanover, New Hampshire. There he studied architecture and graduated in 1921 after a year in the Naval Reserve during World War I. While visiting his brother, Donald, at a sanatorium in Saranac Lake, New York, Sample contracted tuberculosis. He stayed for treatment of that disease in Saranac Lake for four years. There he met Sylvia Howland, whom he married in 1928.
Career
At Saranac Lake, Sample studied drawing and painting under Jonas Lie. He then studied at the Art Students League of Los Angeles, and the Otis Art Institute in Los Angeles, California. There his work reflected social issues connected with the Great Depression with two noted paintings in 1931. In 1926 Sample joined the faculty of the University of Southern California in the school of architecture, where he remained until 1938. In 1938, he returned to New Hampshire to become the artist in residence at Dartmouth College, a position which he held until 1962. In addition to his social and regional paintings, Sample produced artwork for various magazines during World War II.
Sample did the cover art for Carl Sandburg's 1948 novel Remembrance Rock.
In 1941 he was inducted into the National Academy.
References
Painters from New Hampshire
Painters from Kentucky
1896 births
1974 deaths
20th-century American painters
American male painters
Artists from Louisville, Kentucky
Dartmouth College alumni
Otis College of Art and Design alumni
University of Southern California faculty
Dartmouth College faculty
People from Norwich, Vermont
Treasury Relief Art Project artists
National Academy of Design members
20th-century American male artists |
```xml
import { Signature, compareVersions } from "./signature";
import { LoadoutFile, signature } from "./loadout";
import { Widget, WidgetType } from "./widget";
import { Readout, migrateReadout } from "./readout";
import { Graph, migrateGraph } from "./graph";
export function migrateLoadout(file: LoadoutFile): void {
if (file.signature.code !== signature.code) {
throw new Error(`wrong signature code in preferences migration: ${file.signature.code}`);
}
if (compareVersions(file.signature.version, signature.version) > 0) {
throw new Error(`error attempted migration from newer to older version: ${file.signature.version} => ${signature.version}`);
}
if (compareVersions(file.signature.version, signature.version) === 0) {
console.warn(`migrateLoadout called but version up to date ${file.signature.version}`);
return;
}
for (const widget of file.widgets) {
if (widget.widgetType === WidgetType.Graph) {
migrateGraph(widget as Graph, file.signature.version);
}
else if (widget.widgetType === WidgetType.Readout) {
migrateReadout(widget as Readout, file.signature.version);
}
else {
console.error('Unrecognized widget type in migrateLoadout');
}
}
}
``` |
Archbishop Kyprianos of Cyprus () was the head of the Cypriot Orthodox Church in the early 19th century at the time that the Greek War of Independence broke out.
Kyprianos was born in (the then village of) Strovolos in 1756. He served as a monk in Machairas monastery until 1783 when he left for Wallachia for further theological studies returning to Cyprus in 1802. He became archbishop of Cyprus in 1810. He founded the Pancyprian Gymnasium (originally called the Hellenic School) in 1812 which was the first secondary school on the island and which is still located opposite the archbishopric in Nicosia.
In 1818, Kyprianos was initiated into the Friendly Society (Philiki Etairia) which was preparing the ground for war and liberation from the Ottoman Empire. In 1820, Alexander Ypsilantis contacted the archbishop asking for Cyprus to join in the armed struggle. Kyprianos' reply was pragmatic: He suggested that Cyprus support the upcoming revolution with money and supplies as any armed struggle was bound to end in disaster. Cyprus, being an isolated island far from Greece, had no substantial navy and no tradition of Klepht warfare like other parts of the Greek world.
However, when the Greek War of Independence broke out on 25 March 1821, Cypriots left in large numbers to fight in Greece, while proclamations were distributed in every corner of the island. The local pasha, Küçük Mehmet, reacted with fury, calling in reinforcements, confiscating weapons and arresting several prominent Cypriots. Archbishop Kyprianos was urged (by his friends) to leave the island as the situation worsened but refused to do so. Finally, on 9 July 1821 Küçük Mehmet had the gates to the walled city of Nicosia closed and executed, by beheading or hanging, 470 important Cypriots amongst them Chrysanthos (bishop of Paphos), Meletios (bishop of Kition) and Lavrentios (bishop of Kyrenia). Archbishop Kyprianos was publicly hanged from a tree opposite the former palace of the Lusignan Kings of Cyprus. The events leading up to his execution were documented in an epic poem written in the Cypriot dialect by Vassilis Michaelides.
Kyprianos was outspoken on the issue of Freemasonry which he condemned.
Archbishop Kyprianos and the bishops Chrysanthos, Meletios and Lavrentios were buried in the crypt of the monument at the Faneromeni Church, Nicosia.
See also
New-martyr
References
1756 births
1821 deaths
Executed priests
Archbishops of Cyprus
Greek Cypriot people
Greek people of the Greek War of Independence
People from Nicosia
Eastern Orthodox Christians from Cyprus
Executed Cypriot people
People executed by the Ottoman Empire by hanging
19th-century executions by the Ottoman Empire
Members of the Filiki Eteria |
```objective-c
//
//
// This program is free software: you can redistribute it and/or modify
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
//
// along with this program. If not, see <path_to_url
//
#import <Foundation/Foundation.h>
@interface DHType : NSObject {
NSString *humanType;
NSString *humanTypePlural;
NSArray *aliases;
}
@property (retain) NSString *humanType;
@property (retain) NSString *humanTypePlural;
@property (retain) NSArray *aliases;
+ (DHType *)typeWithHumanType:(NSString *)aHumanType humanPlural:(NSString *)aHumanTypePlural aliases:(id)someAliases;
+ (DHType *)typeWithHumanType:(NSString *)aHumanType humanPlural:(NSString *)aHumanTypePlural;
@end
``` |
is a Japanese professional shogi player ranked 7-dan.
Early life
Yashiro was born on March 3, 1994, in Kamo District, Shizuoka. He learned how to play shogi from his father when he was a first-grade elementary school student, and was accepted into the Japan Shogi Association's apprentice school at the rank of 6-kyū in September 2005 under the guidance of shogi professional Teruichi Aono.
At first, Yashiro had some difficulty as an apprentice professional and even came close to being demoted in rank to 7-kyū; however, he started practicing regularly at the Kamata Shogi Cluba well-known shogi club where many strong amateurs, apprentence professionals, and even regular professionals would practiceand his results began to quickly improve. He was promoted to the rank of 1-dan in 2008, and then 3-dan in April 2010. He obtained full professional status and the rank of 4-dan in March 2012 after finishing runner up in the 50th 3-dan League (October 2011March 2012) with a record of 14 wins and 4 losses.
Shogi professional
Yashiro defeated Yasuaki Murayama to win the in February 2017 for his only shogi tournament championship to date. Yashiro was just twenty-two years old at the time which made him the then youngest player to ever have won the tournament. Yashiro's record, however, was broken the following year by Sōta Fujii who won the 11th Asahi Cup Open as a fifteen-year-old.
Promotion history
The promotion history for Yashiro is as follows:
6-kyū: September 2005
3-dan: April 2010
4-dan: April 1, 2012
5-dan: May 12, 2015
6-dan: February 11, 2017
7-dan: April 23, 2019
Titles and other championships
Yashiro has yet to make an appearance in a major title match, but he has won one non-major shogi championships during his career.
Awards and honors
Yashiro received the Japan Shogi Association Annual Shogi Award for "Best New Player" for the 201617 Shogi Year.
References
External links
ShogiHub: Professional Player Info · Yashiro, Wataru
Japanese shogi players
Living people
Professional shogi players from Shizuoka Prefecture
1994 births |
Romoaldo Braschi-Onesti (Cesena, 19 July 1753 – Rome, 30 April 1817) was a cardinal of the Roman Catholic Church.
Life
His uncle, Pope Pius VI, made him a cardinal on 18 December 1786, making him the last cardinal-nephew to date (in the narrow sense of a Pope appointing his nephew; if "cardinal-nephew" can mean any close relative, then the last was Giuseppe Pecci, appointed by his younger brother Pope Leo XIII.) A month later he became Cardinal-Deacon of San Nicola in Carcere. On 30 October 1800 he became Camerlengo of the Holy Roman Church, until 10 November 1801.
From 1807 until his death, he was Archpriest of St. Peter's Basilica.
Between 1784 and 1817, he was also Grand Prior of Rome of the Sovereign Military Order of Malta.
His elder brother was Luigi Braschi Onesti, who built the Palazzo Braschi in Rome.
At his death, his body was buried in St. Peter's Basilica, while his praecordia were buried in the Chapel of the Madonna of Clemency in the Pantheon.
See also
Catholic Church in Italy
References
External links
Romoaldo Braschi-Onesti page at The Cardinals of the Holy Roman Church website
Cardinal-nephews
18th-century Italian cardinals
Members of the Holy Office
Camerlengos of the Holy Roman Church
1753 births
1817 deaths
Cardinals created by Pope Pius VI
19th-century Italian cardinals |
Herbert Ernest Gregory (October 15, 1869 – January 23, 1952) was a Yale University geologist well known for his early 20th-century explorations of the Colorado Plateau in Arizona and Utah. One of his most important works is Colorado Plateau Region, published by the United States Geological Survey on the occasion of the United States sponsoring the 16th International Geological Congress.
Gregory was born October 15, 1869, in Middleville, Michigan to George A. Gregory and Jane Bross. He grew up in Crete, Nebraska and attended the Gates Academy. In 1890, he received his B.S. at Gates College located in Neligh, Nebraska. Gregory worked as a civil engineer for Boston & Maine Railroad from 1890–1891 before becoming an instructor at Chadron Academy from 1891–1893. He then taught at Gates College from 1893–1895 and graduated with an A.B. from Yale University in 1896. He was a student at Harvard University under American geographer William Morris Davis. He was the director of the geology department at Yale University, where he worked to expand the department to include a human geography emphasis. Gregory was elected to the American Academy of Arts and Sciences in 1917 and the American Philosophical Society in 1923. From 1919 to 1936 he served as director of the Bishop Museum in Hawaii, where, in 1961, after his death, he was honored by a medal named after him. The Herbert E. Gregory Medal is awarded every four years by the Pacific Science Association to a leading scientist in the Pacific Region.
His seminal work included mapping much of the bedrock geology of the Colorado Plateau, particularly in geologic monographs concentrating on what is now the Navajo Nation in northeastern Arizona and southeastern Utah. Among many other achievements, he was the first to name and describe the Upper Triassic Chinle Formation, which is famous for preserving extensive fossil evidence of Late Triassic terrestrial ecosystems, including fossilized logs.
In 1931, Gregory published the first geologic map of the Grand Staircase–Escalante National Monument. Gregory stated that no fossils had been discovered; however, many were later found.
Gregory died January 23, 1952 in Honolulu in the then Territory of Hawaii.
References
1869 births
1952 deaths
American geologists
American geographers
Harvard University alumni
Presidents of the American Association of Geographers
Bishop Museum
Yale University faculty
People from Barry County, Michigan
Members of the American Philosophical Society |
Caron Liza Geary (born 15 October 1963 in Paddington, London), known by various stage names, is an English female raggamuffin toaster. She was the first white female reggae/dancehall MC.
According to Geary, her first recorded appearance was on a cover of "Kid Ralph", a dancehall track by Little Twitch. The song talks about a "legendary" homosexual figure in Jamaica's prison system. She has subsequently worked as a solo artist and with other musicians, including Erasure and Boy George, who described her music as "the dirtiest 'slackest' reggae I'd heard since the seventies".
Background
Growing up in Marylebone, Geary lived adjacent to an after-hours party which blasted out reggae music; as a result, Geary was exposed to reggae from a very young age. It is these experiences which inspired her to write the controversial song "Everything Starts with an 'E'" as part of E-Zee Possee, which was banned by the BBC because of its lyrics and made No. 69 in the UK Singles Chart in 1989, leaving the chart after only one week; however it was re-released less than a year later in March 1990 and climbed to No. 15 on the UK chart, spending eight weeks in the chart.
Kinky's first solo single, the Apollo 440 produced "Get Over It", reached No. 95 on the UK Singles Chart. Her only solo top 75 hit, coming five years later, was Everybody, released under the name "Kinky", which charted at No. 71 on that chart.
Kinky has been touring underground, occasionally providing vocals for other artists. In 1997, she took a residency in Ibiza as "the Infidel", operating under the name for a week before writing an album called Cantankerous and taking up the name for herself. When a member of staff at Club Motherfucker described her sound as "feral pop", she became "Feral" and finally ended up with "Feral a.k.a. MC Kinky" and "FERALisKINKY"
Artistry
Descriptions of Geary's sound have varied from a "bass driven, vitriolic sonic hybrid of grimy electronic ragga, manic house and punk rock" to a "white female raggamuffin toaster". Kinky has denounced these descriptions, saying "I can't be bothered with people who spend large amounts of time trying to place people and music into small and narrow categories. I do what comes naturally to me, and it usually has a combination of influences."
Discography
Singles
Solo singles
As featured artist
Other songs
References
External links
Official website
YouTube channel
1963 births
Living people
English women rappers
British reggae musicians
British dancehall musicians
Musicians from Paddington
Musicians from Marylebone
Rappers from London
Singers from London
20th-century English musicians
21st-century English musicians
20th-century English women singers
20th-century English singers
21st-century English women musicians |
Floyd W. Jones Lebanon Airport is a city-owned public-use airport located three nautical miles (6 km) south of the central business district of Lebanon, a city in Laclede County, Missouri, United States. This airport is included in the National Plan of Integrated Airport Systems for 2011–2015, which categorized it as a general aviation airport.
Although most U.S. airports use the same three-letter location identifier for the FAA and IATA, this airport is assigned LBO by the FAA, but has no designation from the IATA (which assigned LBO to Lusambo Airport in the Democratic Republic of the Congo).
Facilities and aircraft
Floyd W. Jones Lebanon Airport covers an area of 277 acres (112 ha) at an elevation of 1,321 feet (403 m) above mean sea level. It has one runway designated 18/36 with an asphalt surface measuring 5,000 by 75 feet (1,524 x 23 m).
For the 12-month period ending August 31, 2010, the airport had 12,725 aircraft operations, an average of 34 per day:
94% general aviation, 5% air taxi, and 1% military. At that time there were 33 aircraft based at this airport: 76% single-engine, 9% multi-engine, and 15% jet.
See also
List of airports in Missouri
References
External links
Aerial image as of April 1995 from USGS The National Map
Airports in Missouri
Buildings and structures in Laclede County, Missouri |
In September 2018, a dam failure caused by Hurricane Florence led to the leakage of coal ash into the Cape Fear River about five miles northwest of Wilmington, North Carolina. The coal ash came from two storage areas (ash ponds) owned and operated by Duke Energy. Contaminants from the coal ash may have leached into the water source but long term testing has yet to be done by the U.S. Environmental Protection Agency or other environmental agencies. Clean up efforts were led by Duke Energy and mostly consisted of skimming the coal ash off the top of the water.
Incident
On September 14, 2018 Hurricane Florence hit the coast line of North Carolina. While the almost of water that the area received was bad for the dams and catch ponds of the area, the real issues came along when the storm moved inland, dumping more rain water into the Cape Fear River. The flood water produced by the storm damaged the earthen dams built around Sutton Lake, which is used as a reservoir for cooling water. The breach in the earthen dams allowed for water to rush into several coal ash storage areas where roughly of coal ash was stored. Once the water entered the storage areas the coal ash was able to flow out of the storage areas into the Sutton Lake and then into the Cape Fear River.
Environmental impact
There are a few major issues that come along with coal ash spills into large bodies of water. The most visible issue is the turbidity of the coal ash that is dissolved into the water. This is more of a long term issue for the lake than the river because in the lake the ash will be more likely to settle onto the lake bottom, and only run the risk of being stirred up again during the next major storm or other event that will stir up the lake bottom. The river is a high energy environment so it will be less likely to settle on the bottom and the coal ash will thus mostly flow along the river and eventually be deposited in the ocean. The second issue that arises from coal ash being introduced into the Cape Fear River is the high levels of heavy metals that will leach out of the coal ash. Examples of these metals are mercury, lead, selenium, all of which have negative effects on not only human health (when the water is used as drinking water, for example) but also on any wildlife that comes into contact with this contaminated water.
Duke Energy does not argue that coal ash has leaked into the water source but the company does argue whether the drinking water supplied by the Cape Fear has reached unsafe levels of heavy metals. Duke Energy implies that some of the research that is being released by environmental groups is creating uncalled for panic among the citizenry. According to Waterkeeper Alliance, the mercury levels in the present in Sutton Lake are over seventy times greater than safe levels.
Economic impact
The economic impact has yet to be analysed but analysis of similar spills such as the 2014 Dan River coal ash spill shows that even a six month economic impact study is only a short term review of the possible issues. There are multiple costs that need to be considered, Including the ecological and recreational costs that will be add to this event will cripple the areas economy for years to come. Some of the costs may be passed through to Duke Energy customers in the form of higher rates.
References
2018 in the environment
Environmental impact of the coal industry |
Snipe Peak () is a peak, 225 m, which is the main peak on Moe Island, situated close southwest of Signy Island in the South Orkney Islands. Surveyed in 1933 by DI personnel. The name, proposed by G. Robin of Falkland Islands Dependencies Survey (FIDS) following his survey in 1947, commemorates the first visit to Signy Island, in February 1948, of HMS Snipe (Commander J.G. Forbes, RN).
Mountains of the South Orkney Islands |
```python
"""
Project Euler Problem 234: path_to_url
For any integer n, consider the three functions
f1,n(x,y,z) = x^(n+1) + y^(n+1) - z^(n+1)
f2,n(x,y,z) = (xy + yz + zx)*(x^(n-1) + y^(n-1) - z^(n-1))
f3,n(x,y,z) = xyz*(xn-2 + yn-2 - zn-2)
and their combination
fn(x,y,z) = f1,n(x,y,z) + f2,n(x,y,z) - f3,n(x,y,z)
We call (x,y,z) a golden triple of order k if x, y, and z are all rational numbers
of the form a / b with 0 < a < b k and there is (at least) one integer n,
so that fn(x,y,z) = 0.
Let s(x,y,z) = x + y + z.
Let t = u / v be the sum of all distinct s(x,y,z) for all golden triples
(x,y,z) of order 35.
All the s(x,y,z) and t must be in reduced form.
Find u + v.
Solution:
By expanding the brackets it is easy to show that
fn(x, y, z) = (x + y + z) * (x^n + y^n - z^n).
Since x,y,z are positive, the requirement fn(x, y, z) = 0 is fulfilled if and
only if x^n + y^n = z^n.
By Fermat's Last Theorem, this means that the absolute value of n can not
exceed 2, i.e. n is in {-2, -1, 0, 1, 2}. We can eliminate n = 0 since then the
equation would reduce to 1 + 1 = 1, for which there are no solutions.
So all we have to do is iterate through the possible numerators and denominators
of x and y, calculate the corresponding z, and check if the corresponding numerator and
denominator are integer and satisfy 0 < z_num < z_den <= 0. We use a set "uniquq_s"
to make sure there are no duplicates, and the fractions.Fraction class to make sure
we get the right numerator and denominator.
Reference:
path_to_url
"""
from __future__ import annotations
from fractions import Fraction
from math import gcd, sqrt
def is_sq(number: int) -> bool:
"""
Check if number is a perfect square.
>>> is_sq(1)
True
>>> is_sq(1000001)
False
>>> is_sq(1000000)
True
"""
sq: int = int(number**0.5)
return number == sq * sq
def add_three(
x_num: int, x_den: int, y_num: int, y_den: int, z_num: int, z_den: int
) -> tuple[int, int]:
"""
Given the numerators and denominators of three fractions, return the
numerator and denominator of their sum in lowest form.
>>> add_three(1, 3, 1, 3, 1, 3)
(1, 1)
>>> add_three(2, 5, 4, 11, 12, 3)
(262, 55)
"""
top: int = x_num * y_den * z_den + y_num * x_den * z_den + z_num * x_den * y_den
bottom: int = x_den * y_den * z_den
hcf: int = gcd(top, bottom)
top //= hcf
bottom //= hcf
return top, bottom
def solution(order: int = 35) -> int:
"""
Find the sum of the numerator and denominator of the sum of all s(x,y,z) for
golden triples (x,y,z) of the given order.
>>> solution(5)
296
>>> solution(10)
12519
>>> solution(20)
19408891927
"""
unique_s: set = set()
hcf: int
total: Fraction = Fraction(0)
fraction_sum: tuple[int, int]
for x_num in range(1, order + 1):
for x_den in range(x_num + 1, order + 1):
for y_num in range(1, order + 1):
for y_den in range(y_num + 1, order + 1):
# n=1
z_num = x_num * y_den + x_den * y_num
z_den = x_den * y_den
hcf = gcd(z_num, z_den)
z_num //= hcf
z_den //= hcf
if 0 < z_num < z_den <= order:
fraction_sum = add_three(
x_num, x_den, y_num, y_den, z_num, z_den
)
unique_s.add(fraction_sum)
# n=2
z_num = (
x_num * x_num * y_den * y_den + x_den * x_den * y_num * y_num
)
z_den = x_den * x_den * y_den * y_den
if is_sq(z_num) and is_sq(z_den):
z_num = int(sqrt(z_num))
z_den = int(sqrt(z_den))
hcf = gcd(z_num, z_den)
z_num //= hcf
z_den //= hcf
if 0 < z_num < z_den <= order:
fraction_sum = add_three(
x_num, x_den, y_num, y_den, z_num, z_den
)
unique_s.add(fraction_sum)
# n=-1
z_num = x_num * y_num
z_den = x_den * y_num + x_num * y_den
hcf = gcd(z_num, z_den)
z_num //= hcf
z_den //= hcf
if 0 < z_num < z_den <= order:
fraction_sum = add_three(
x_num, x_den, y_num, y_den, z_num, z_den
)
unique_s.add(fraction_sum)
# n=2
z_num = x_num * x_num * y_num * y_num
z_den = (
x_den * x_den * y_num * y_num + x_num * x_num * y_den * y_den
)
if is_sq(z_num) and is_sq(z_den):
z_num = int(sqrt(z_num))
z_den = int(sqrt(z_den))
hcf = gcd(z_num, z_den)
z_num //= hcf
z_den //= hcf
if 0 < z_num < z_den <= order:
fraction_sum = add_three(
x_num, x_den, y_num, y_den, z_num, z_den
)
unique_s.add(fraction_sum)
for num, den in unique_s:
total += Fraction(num, den)
return total.denominator + total.numerator
if __name__ == "__main__":
print(f"{solution() = }")
``` |
KRMC (91.7 FM) is a Spanish language Christian radio station licensed to Douglas, Arizona. KRMC is owned by World Radio Network, Inc.
References
External links
KRMC website
RMC
RMC
Radio stations established in 1997 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.