text
stringlengths 0
128k
|
|---|
/**
* @license
* Copyright 2016-2020 Balena Ltd.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
import { flags } from '@oclif/command';
import type { IArg } from '@oclif/parser/lib/args';
import Command from '../../command';
import * as cf from '../../utils/common-flags';
import { getBalenaSdk, stripIndent } from '../../utils/lazy';
import { getExpandedProp } from '../../utils/pine';
interface FlagsDef {
help: void;
}
interface ArgsDef {
uuid: string;
releaseToPinTo?: string;
}
export default class DevicePinCmd extends Command {
public static description = stripIndent`
Pin a device to a release.
Pin a device to a release.
Note, if the commit is omitted, the currently pinned release will be printed, with instructions for how to see a list of releases
`;
public static examples = [
'$ balena device pin 7cf02a6',
'$ balena device pin 7cf02a6 91165e5',
];
public static args: Array<IArg<any>> = [
{
name: 'uuid',
description: 'the uuid of the device to pin to a release',
required: true,
},
{
name: 'releaseToPinTo',
description: 'the commit of the release for the device to get pinned to',
},
];
public static usage = 'device pin <uuid> [releaseToPinTo]';
public static flags: flags.Input<FlagsDef> = {
help: cf.help,
};
public static authenticated = true;
public async run() {
const { args: params } = this.parse<FlagsDef, ArgsDef>(DevicePinCmd);
const balena = getBalenaSdk();
const device = await balena.models.device.get(params.uuid, {
$expand: {
should_be_running__release: {
$select: 'commit',
},
belongs_to__application: {
$select: 'slug',
},
},
});
const pinnedRelease = getExpandedProp(
device.should_be_running__release,
'commit',
);
const appSlug = getExpandedProp(device.belongs_to__application, 'slug');
const releaseToPinTo = params.releaseToPinTo;
if (!releaseToPinTo) {
console.log(
`${
pinnedRelease
? `This device is currently pinned to ${pinnedRelease}.`
: 'This device is not currently pinned to any release.'
} \n\nTo see a list of all releases this device can be pinned to, run \`balena releases ${appSlug}\`.`,
);
} else {
await balena.models.device.pinToRelease(params.uuid, releaseToPinTo);
}
}
}
|
The packet goes through the other router
I want to connect two hosts in parallel with two different models of virtual routers.
These are made redundant by VRRP.
Originally, packets are sent through only one of the routers.
However, when the packet is sent, it goes through two routers. This results in duplicate ping packets.The traceroute now looks like this.
host1：$ traceroute -I <IP_ADDRESS>
<IP_ADDRESS>
<IP_ADDRESS>
<IP_ADDRESS>
Why do the packets go through the other router?
The network configuration is shown below.
Host1(Ubuntu20.04)
IP Address:<IP_ADDRESS>
gateway:<IP_ADDRESS>
Host2(Ubuntu20.04)
IP Address:<IP_ADDRESS>
gateway:<IP_ADDRESS>
Physical Router(Ubuntu20.04)
There are two virtual routers created by vagrant and Virtualbox inside.
Virtual Router(Vyos)
Use vagrant box "kun432/vyos"
eth1:<IP_ADDRESS>
eth2:<IP_ADDRESS>
Virtual Router(vSRX)
Use vagrant box "juniper/ffp-12.1X47-D15.4-packetmode"
ge-0/0/1:<IP_ADDRESS>
ge-0/0/2:<IP_ADDRESS>
<IP_ADDRESS>/24 network Virtual IP Address: <IP_ADDRESS>
<IP_ADDRESS>/24 network Virtual IP Address: <IP_ADDRESS>
NetworkBridge: bridge-utils
◆VRRP
Networking:
This doesn't seem the way VRRP works. Normally it doesn't get packet duplicated. Please, provide the details: a network diagram, what software you use to build your virtual routers and its configuration; you may mask sensitive information like public names or public IP addresses.
Sorry, I hadn't noticed a picture because of bad formatting. Thanks to @Rob who fixed it.
@NikitaKipriyanov
Thank you for your comment. Detailed network settings are shown. The image is in bad format because it has no more than 10 reputations. Our apologies.
What is the vrrp configuration? What does logs show? Do they indicate that VRRP is functioning? Or does both routers assume the other router is down?
@vidarlo
Thank you for your comment.
In this network configuration, we are dynamically changing the VRRP priority value to verify that the router through which host 1 switches to host 2.
To perform VRRP switching, we have configured a common Virtual IP address of <IP_ADDRESS> for eth1 on Vyos and ge-0/0/1 on vSRX, and <IP_ADDRESS> for eth2 on Vyos and ge-0/0/2 on vSRX. Both routers are up and running, one acting as master and the other as backup.
Have you actually verified that they can see each other and have the correct status for the other router?
@vidarlo
Yes, I have checked the communication between arp -a and ping on vyos and vsrx. However, ping packets from vsrx to vyos seem to be duplicated. Also, when vsrx is the master, ping packets from host1 to host2 are not duplicated.
for me it looks like a homework assignment... could this be?
@djdomi
Sorry, does that mean that the network configuration shown in the attached image is not feasible?
we help businesses administrators to fix the real network. And not trainees that want to cheat and shortcut on there home works from school ;)
|
User:Anapaula.medeiros.12576
Progress
* Case:
* Level:
* Rank:
Favorite Cases
* Replace this content with your favorite cases of the game.
|
Universally adjustable pipe coupling with exterior loc king means
m pus-au- July 10, 1956 c; v. FRUSHOUR 2,754,139
UNIVERSALLE ADJUSTABLE PIPE COUPLING WITH EXTERIOR LOCKING MEANS Filed Oct. 50, 1952 3 Sheets-Sheet l E) Maw gale/123a July 10, 1956 G. v.FRUSHOUR 2,754,139 UNIVERSALLY ADJUSTABLE PIPE COUPLING WITH EXTERIORLOCKING MEANS Filed Oct. 30, 1952 IS Sheets-Sheet 2 y 10, 1956 G. v.FRUSHOUR 2,754,139
UNIVERSALLY ADJUSTABLE PIPE COUPLING WITH EXTERIOR LOCKING MEANS 3SheetsSheet 3 Filed Oct. 30, 1952 Q/vw Mo/z/ ale/9a. D. gmkom v WWWUnited States Patent UNIVERSALLY ADJUSTABLE PIPE COUPLING WITH EXTERIORLOCKING MEANS George V. Frushour, La Porte, Ind., assiguor to Allis-Clialmers Manufacturing Company, Milwaukee, Wis.
Application October 30, 1952, Serial No. 317,794 Claims. (Cl. 2s5 1s4This invention relates to pipe couplings and more particularly to a universally adjustable pipe coupling for use in connection with a material blower or the like.
In the use of material blowers for filling silos on the farm it is usually impractical or impossible to position the blower sufiicientlyclose to the silo so that the pipe line leading to the top of the silo can be erected in a true vertical direction. Often the base of the si lois enlarged for purposes of strength, and the power pulley is located onthe blower in such a position that the pipe line must be somewhat inclined in order to provide adequate clearance between silo and pulley and proper overhang of the discharge boot of the silo filler with respect to the base of the silo.
Generally, it is an object of this invention to provide an improved universally adjustable pipe coupling which will take care of thehereinabove outlined requirements for a silo filling pipe line in a practical and entirely satisfactory manner.
Another object of this invention is to provide a pipe coupling of thehereinabove outlined character which affords a desirable degree offlexibiilty without causing interference with the flow of material through the coupling.
Another object of this invention is to provide a universally adjustable pipe coupling which lends itself for use in a pipe system for blowing hay or grain horizontally into a barn or bin, and which can readily and effectively be locked in any angularly adjusted position.
It is a further object of this invention to provide a swivel joint assembly in a pipe system which is substantially as strong as the conventional pipe and coupling elements in the pipe system.
It is a further object of this invention to provide a universally adjustable pipe coupling which is readily assembled, disassembled and adjusted.
Accordingly, the present invention may be considered as comprising the various features of construction and combination of elements as is more fully set forth in the following detailed description and appended claims, reference being had to the accompanying drawings, wherein:
Fig. l is a side elevation view of a silo and silo filling equipment,illustrating an embodiment of the invention;
Fig. 2 is an enlarged section view of a universally adjustable pipe coupling shown in Fig. 1;
Fig. 3 is a view taken on line III-III of Fig. 2;
Fig. 4 is a view similar to Fig. 2 with the component parts of the pipe coupling shown in a different position of adjustment;
Fig. 5 is a view taken on line V-V of Fig. 4;
Fig. 6 is a side elevation view of a material blower and appropriate piping for discharging material horizontally, as through an opening in a barn; and
Fig. 7 is a side elevation view of a silo filler and appropriate pipingembodying the invention, and demonstrating a change-over of the piping from one position to another for filling two silos standing next to eachother.
Referring to the drawings, it is seen that a silo filler 2,754,139Patented July 10, 1956 1 having a discharge boot 2 attached to a fan housing 3 is positioned adjacent a silo 4 in condition for blowing material into the open top of the silo. Attached to an upper portion of boot 2 is a coupling band 6 (see Figs. 2 and 4). Telescopic ally received over the upper end of boot 2 is a coupling assembly 7 including at its lower end a coupling band 8 joined to coupling band 6 by detachable conventional means such as nuts and bolts. An inner pipe member 9 is attached at its lower end to coupling band 8 by conventional means suchas rivets 11. A swivel joint socket 12 is provided with a skirt portion having an upper concave ly spherical bearing surface 13 and is also attached to coupling band 8 by rivets 11. Spherical surface 13 is formed with a radius R substantially equal to the effective length of inner pipe member 9 (see Fig. 2). Socket 12 is provided with four radiallyextending slots 14 positioned 90 apart (see Figs. 3 and 5).
A swivel joint ring 16 is provided with a skirt portion having a lowerconvexly spherical surface bearing portion 17 complement ary to spherical surface 13 and is positioned with the aforesaid spherical bearing surfaces in contact with each other and for relative movement to eachother. Ring 16 is provided with four arcuate, circumferential slots 18positioned at 90 center spacings and adjacent to the periphery of ring16 (see Figs. 3 and 5). Ring 16 is adjustably joined to socket 12 by means of bolts 19 which extend through overlapping pairs of radial slots14 and circumferential slots 18 and by means of nuts such as wing nuts21. Attached to an inner peripheral surface of ring 16 is afrusto-conical ly shaped outer pipe member 22 which has attached to its smaller end a conventional coupling band 23. A discharge pipe section 24has a coupling band 26 attached at its lower end. Coupling bands 23 and26 are detachably joined by conventional means such as nuts and bolts.
Figure 4 shows coupling 7 adjusted so that discharge pipe section 24extends vertically. Fig. 2 shows coupling 7 adjusted so that the discharge pipe sections connected to the upper end thereof will have an angular displacement of approximately 5 from the vertical. It is to be noted that the adjustment of ring 16 relative to socket 12 does not change the position of inner pipe member 9 and the adjustment of the swivel ring does not change the material discharge area of pipes 2, 9 or24 but merely slightly changes the direction of material movement at thejuncture where the upper end of inner pipe member 9 is in proximaterelation with discharge pipe section 24. Furthermore, no obstructions inthe form of pockets or projections are present to prevent the easy flow of material through the pipes.
To adjust coupling 7 from the position shown in Fig. 4 to the position shown in Fig. 2 to provide a desired angularity (a convenience infilling a silo) wing nuts 21 are loosened and outer pipe member 22 and swivel joint ring 16 are moved orbitally relative to socket 12 unt il the desired angle of adjustment is secured, at which time the wing nuts 21are tightened preventing any further relative movement of ring 16 to socket 12.
It is to be noted that in any position of adjustment the area of contactor bearing area between ring 16 and socket 12 remains constant thereby providing a uniformly strong support for the pipe sections extending above coupling 7 and which area is substantially equal to the contact area provided by the conventional coupling bands 23 and 26, whereas in some of the prior art constructions the bearing area in a swivel coupling is greater on one '3 -band-while"socket-iris"attachednotheoutside of the band with these same rivets. A ring 16 isriveted or otherwise fixedly attached to the outside base portion o fema-stat de er p fm fi be a li vin I an emi band 23fat'ta hd to the inner aspect e small end thereof. This"outer pi E mein Ber ass'einblycanreadilybe 'slid over the top "of the innerzpipe -member iiritii the"bearingsurfaccsjof' ring "16 and socket "-12 are in contact afv/hichtime 'bolts- '19' can be inserted tliroiiglifslots"14 and' lsfandWingmuts 21 tightened 'up -':on bolts 19 unt il relative movement'ofringio and socket l P' nt dt As the"1ip"er"and lower eraser coupling7" are provid'ed 'conventional' 'coppling ha" s13 and '23,respec'tively; is seen'thaFthe iisefof assembly 7 is not rej strictedto: that "p art of a "pipesysftem directly adjacentfanicasing"discharge boot but can be' used at any point betyveenpipdsec'tions (see Fig. 6 )'fw he re a slight angularity isfdesired asivhen horizontally filling a barn or bin. "Under'su'chconditionstheadjustment of angularity is accomplished in the same manner as previously 'described, that is wing" 'nuts 21"are" lo'os'iied'and ring "16 is moved relative: to socket 12 unt ilgthe desired degree of fangula'rityis' obtained, Wingnuts'l "a" "then tightened to"prey ent'further""relative"'niovrfient of ring "16 to socket 112. I
fFigQTShoWS af special situationwlieie tv vo silosaie f positioned close together, In this situation tlie blovver fcan'be located in onepositiomandboth' silos 'fill'ed by swinging the pipes "from" one""silo"to "the istnerwaabm moving the blower. After one silo is .fil l'ed,thiseanibe f'acc'oniplished 'by"reinoving wing nurse; and 'bolts19 moving ring 161 and the pipes attachedlliereto rehtive to sockeflz'u'nt il discharge 'pipe' 27 is'properly positioned overthe seconds'il'o.:'Bolts"19a"re thenreinserted through the slots in ring"1*6faiid-'socket12, iiving'nutszl "are then tightened up on bolts 19ii'nt il r lativeniovement between ring" 16 and socket I2is"'pr'event ed,
In general terms, the'herein disclosed universally adjustable joint'asse'mblyf co mprisesfa coupling fb i i d, as e presented by the coupling'ba'nd 's, fv'vhichf is r'eiriovably 'attached to a first pipe section as represeiitedby the'boot '2. The inner pipe member9 'is attached atone end to "the coupling band "8 and forms 'an' extension of the first pipe section 2. The socket'r'nember 1 2 Which'is' attached to'the coupling'ba'ndS presents a spherically concave bearingfsurface' 13 on an annu lar skirt p'or'tion'thereof surrounding the inner pipe'member'9, and aringimember, as re presented by the"ririg1'6,-has an inner periphery in surrounding relation to and "of substantially larger diameter than the inner'pipe member '9 and presents a spherically convex bearing'surfaceonan "annu lar 'skirt portion thereof in contact with and complement ary tothe spherically concave bearing surface '13. 'An outer pip'e 'member as re presented 'by the I frus to-conical ly shaped pipe '22, is mounted'about th'e inner pipe/mem her 9, and the outer pipe member 22is attached'at one end thereof to the ring'member 1'6'in wa'r'dly of the second mentioned skirt portion which presents the spherical- 1y convex bearing surface. Th'e other end of the'outer pipe member has another coupling band, such as the coupling band-23, attached to a 'second'pipe section,-such as the pipe section 24, and the inner periphery of said other coupling band and the other end of said inner pipe member are of substantially the same size and located substantially in a 'plane including 'the center of the spherically concave and of the sphericallyconvex b earing surfaces. Adjustable loc king means, which in theillustrat ed embodiment of the invention include the slots 14, 18, bolts19 and Wing nuts 21, are operatively associated with the skirt portion(of the 'so cketime rn ber 12 and with the skirt portion of the ring member {flexterior ly of the outer pipe member 22 for loc king the ring member 16 in orbitally and rotatively adjusted relation to the socket member 12.
4 It isto"be"'1ind'e"rsf6od; that it is tiohdesired to limit the invention to the particular features and details described herein forthe purposes of illustration and that the invention is to be considered as including such other forms and modifications as are fairly embraced within the scope of the appended claims.
Itis claimedtand desired to secure by Letters. Rate nt: 1. universallyadjpstable; joint assembly comprising a coupling band removably attached to a first pipe section, an inner" pipe member m ss age one end to. said coupling" band and""forrning an extension of said first pipe section, a socket member attached to said coupling band and presenting asphericallyconcave bearing surface on an annu lar skirt-portion -thereof surrounding said inner pipe member, said skirt portion presenting a plurality of radial slots circumferentially spaced from each. other, a ring me mberpositioned aboutsaidinner pipe member and presenting a sphericallyconvex bear- "ing' surface on anannu lar skirt portion thereof in contact'v'vi thf said spherically concave bearing surface and I being oi nr'npleme'nt ary thereto said skirt portion of said"ring"presentingperipherally extending arcuate slots in "overlapping relation, respectively, to said radially extending slots, an'outer pipeniern ber'mounted about said inner pipe member and being attached atone end thereof toj'said ring'r'nember, said outer pipe member having af coupling band attached to thefother end thereof for atk 'tachnient witha coupling b and on a second pipe section, said inner pipe member having its other end positioned in proximate'relation to the coupling band on said second pipe section, and adjustable loc king :means; passing through overlapping pairs of radially and, peripherally "extending slotsforl oc king said ring member in orbital- 1y androtatively adjusted relation to: said socket member. 2. A universally "adjustable joint assembly comprising a coupling band attached to the'upper endofafirstpipe section fan inner pipe member attached at its lower-end to-said coupling b and pa socket member attached to said coupling band and presenting an upper spherically concaveBeai-in sur rm on an annu lar skirt portion thereof surrounding said inner pipe member, said upper surface being formed with a radius substantially equal to the effective length of said "inner pipe member and presenting a plurality ofcircumferentially spaced radial slots in the skirt portion thereof, aring membenpositioned about said inner pipe member and presenting a lower spherically convex bearing surface onan annu lar skirt portion thereof in contact with saidconcavesurface and being complement ary thereto, said ring member skirt portion being provided with peripherallyextending arcuate 'slot sin overlapping relation, respectively, to saidradially extending slots, an outer frusto-conical ly shaped pipe member attached at its larger end to said ring member, said outer pipe member having. a coupling band about its smaller end attached to a, second pipe section, said inner pipe member having; its upper end in proximaterelation to the coupling bandon the smaller end of said outer pipe member, "and adjustable loc king means passing ou O er a n p i s of a al in pe p al y extending slots for loc king said member in orbitally adjusted relation to said socket member, p p
3. A universally adjustable joint assembly comprising a firstcoupling band detachably connected to a second coup lii ig band attached to the uppervend ofi a first v pipe section, an inner pipe member attached at-one end to said first coupling band, a socket attached to said first coupling band and presenting a spherically concave hearing surface on an annu lar skirt portion thereof surrounding said inner pipe member, said 'spherical surface being formed with a radiussubstantiallyequalto the effective length of said inner pipe member,said skirt portion presenting a plurality of circumferentially spaced radial slots, a ring member positioned about said inner pipe member and presenting aspherically convex bearing surface on an annu lar skirt portion thereof in contact with said concave surface and being complement ary thereto, said ring member skirt portion being provided with peripherally extending arcuate slots in overlapping relation,respectively, to said radially extending slots, said contacting bearing surfaces being substantially of the same area as the areas of contact between said coupling bands, said contacting surfaces being uniform in size about said ring and said socket, an outer frusto-conical ly shaped pipe member mounted about said inner pipe member and being attached atone end thereof to said ring member, said outer pipe member having a third coupling band on its other end attached to a fourth coupling bandon a second pipe section, said inner pipe member having its other end positioned in proximate relation to said fourth coupling band on said second pipe section, and adjustable loc king means passing through overlapping pairs of radially and peripherally extending slots for loc king said ring member in orbitally adjusted relation to said socket.
4. A universally adjustable joint assembly comprising a coupling band attached to a first pipe section, an inner pipe member attached at one end to said coupling band and forming an extension of said first pipe section, a socket member attached to said coupling band and presenting aspherically concave bearing surface on an annu lar skirt portion thereof surrounding said inner pipe member, a ring member having an inner periphery in surrounding relation to and of substantially larger diameter than said inner pipe member and presenting a spherically convex bearing surface on an annu lar skirt portion thereof in contact with saidspherically concave bearing surface and being complement ary thereto, an outer pipe member mounted about said inner pipe member and being attached at one end thereof to said ring member in ward ly of said second mentioned skirt portion, the other end of said outer pipe member having another coupling band attached to a second pipe section, and the inner periphery of said other coupling band and the other end of said inner pipe member being of sub stantially the same size and located substantially in a plane including the center of said spherical surfaces,
and adjustable loc king means operatively associated with said skirt portion of said socket member and with said skirt portion of said ring member exterior ly of said outer pipe member for loc king said ring member in orbitally and rotatively adjusted relation to said socket member.
5. A universally adjustable joint assembly compris ing a coupling band attached to a first pipe section, an inner pipe member attached at one end to said coupling. band and forming an extension of said first pipe section, a socket member attached to said coupling band and pre--senting a spherically concave bearing surface on an an-- nu lar skirt portion thereof surrounding said inner pipe: member, a ring member having an inner periphery in. surrounding relation to and of substantially larger diameter than said inner pipe member and presenting a spherically convex bearing surface on an annu lar skirt portion thereof in contact with said spherically concave bearing, surface and being complement ary thereto, an outer frusto-- conical ly shaped pipe member mounted about said inner pipe member and being attached at its large end to said ring member in ward ly of said second mentioned skirt portion,said outer pipe member having another coupling, band about its small end attached to a second pipe sec-- tion, and the inner periphery of said other coupling band and the other end of said inner pipe member being of' substantially the same size and located substantially in a plane including the center of said spherical surfaces, and adjustable loc king means operatively associated with. said skirt portion of said socket member and with said skirt portion of said ring member exterior ly of said outer pipe member for loc king said ring member in orbitally' androtatively adjusted relation to said socket member,
References Cited in the file of this patent UNITED STATES PATENTS1,202,687 Elkerton Oct. 24, 1916 1,703,670 Hoeft Feb. 26, 1929'2,300,247 Dion Oct. 27, 1942 FOREIGN PATENTS 925,288 France Mar. 24,1947
|
Walter R. Beddeo v. State of Nebraska.
Filed December 14, 1909.
No. 16,057.
Case Pollowed. Holmes v. State, ante, p. 506, followed.
Error to the district -court for Harlan county: Harry S. Dungan, Judge.
Reversed.
J. G. Thompson, for plaintiff in error.
William T. Thompson, Attorney General, and George W. Ayres, contra.
Barnes, J.
Walter R. Beddeo has prosecuted error from the district court for Harlan county in a case wherein he was convicted of the crime of assault and battery. One of his assignments is that the court erred in giving the eighth paragraph of his instructions to the jury. An examination of the record discloses that the instruction complained of is a literal copy of the one on which our reversal of Holmes v. State, ante, p. 506, was predicated, and therefore the judgment herein complained of is reversed and the cause is remanded for further proceedings.
Reversed.
|
<?php
namespace App\Http\Controllers;
use Illuminate\Http\Request;
use Illuminate\Support\Facades\Input;
use Illuminate\Support\Facades\DB;
use Illuminate\Support\Facades\Redirect;
use Illuminate\Support\Facades\Auth;
use Illuminate\Support\Facades\URL;
use App;
use Illuminate\Foundation\Application;
class TaskController extends Controller
{
/**
* Create a new controller instance.
*
* @return void
*/
public function __construct()
{
$this->middleware('auth');
}
/**
* Show the application dashboard.
*
* @return \Illuminate\Http\Response
*/
public function otvoriIzbornik(){
$loggedUser = DB::table('users')->where('email', Auth::user()->email)->first();
App::setlocale($loggedUser->locale);
return view('add_task');
}
public function dodajRad(){
$naziv_rada = Input::get('naziv_rada');
$naziv_rada_eng = Input::get('naziv_rada_eng');
$zadatak_rada = Input::get('zadatak_rada');
$tip_stud = Input::get('tip_stud');
$profesor = Input::get('profesor');
DB::table('tasks')->insert(
[
'naziv_rada' => $naziv_rada,
'naziv_na_engleskom' => $naziv_rada_eng,
'zadatak_rada' => $zadatak_rada,
'tip_studija' => $tip_stud,
'profesor' => $profesor
]
);
return redirect('/home');
}
public function prihvatiStudenta(){
$task_id = Input::get('taskId');
$tasksData = DB::table('tasks')->get()->where('id', $task_id);
foreach ($tasksData as $task) {
$students = array();
$appliedStudents = array();
array_push($appliedStudents,$task->studenti);
$appliedStudentsParts = explode(',', $appliedStudents[0]);
foreach($appliedStudentsParts as $part){
array_push($students, $part);
}
}
return view('detalji_task', ['tasksData' => $tasksData, 'students' => $students]);
}
}
|
"""
FLI.device.py
Object-oriented base interface for handling FLI USB devices
author: Craig Wm. Versek, Yankee Environmental Systems
author_email: [email protected]
"""
__author__ = 'Craig Wm. Versek'
__date__ = '2012-08-16'
import sys, time
import ctypes
from ctypes import pointer, POINTER, byref, c_char, c_char_p, c_long, c_ubyte,\
c_double, c_size_t
from lib import FLILibrary, FLIError, FLIWarning, flidomain_t, flidev_t,\
FLIDOMAIN_USB
###############################################################################
DEBUG = False
BUFFER_SIZE = 64
###############################################################################
class USBDevice(object):
""" base class for all FLI USB devices"""
#load the DLL
_libfli = FLILibrary.getDll(debug=DEBUG)
_domain = flidomain_t(FLIDOMAIN_USB)
def __init__(self, dev_name, model):
self.dev_name = dev_name
self.model = model
#open the device
self._dev = flidev_t()
self._libfli.FLIOpen(byref(self._dev),dev_name,self._domain)
def __del__(self):
self._libfli.FLIClose(self._dev)
def get_serial_number(self):
serial = ctypes.create_string_buffer(BUFFER_SIZE)
self._libfli.FLIGetSerialString(self._dev,serial,c_size_t(BUFFER_SIZE))
return serial.value
@classmethod
def find_devices(cls):
"""locates all FLI USB devices in the current domain and returns a
list of USBDevice objects"""
tmplist = POINTER(c_char_p)()
cls._libfli.FLIList(cls._domain, byref(tmplist)) #allocates memory
devs = []
#process list only if it is not NULL
if tmplist:
i = 0
while tmplist[i]: #process members only if they are not NULL
dev_name, model = tmplist[i].split(";")
devs.append(cls(dev_name=dev_name,model=model)) #create device objects
i += 1
cls._libfli.FLIFreeList(tmplist) #frees memory
#finished processing list
return devs
@classmethod
def locate_device(cls, serial_number):
"""locates the FLI USB devices in the current domain that matches the
'serial_number' string
returns None if no match is found
raises FLIError if more than one device matching the serial_number
is found, i.e., there is a conflict
"""
dev_match = None
devs = cls.find_devices()
for dev in devs:
dev_sn = dev.get_serial_number()
if dev_sn == serial_number: #match found
if dev_match is None: #first match
dev_match = dev
else: #conflict
msg = "Device Conflict: there are more than one devices matching the serial_number '%s'" % serial_number
raise FLIError(msg)
return dev_match
###############################################################################
# TEST CODE
###############################################################################
if __name__ == "__main__":
devs = USBDevice.find_devices()
|
---
title: Blog 4
layout: post
author: nabeel.ahmed
permalink: /blog-4/
source-id: 1aE-tQ6omc-nwtjx7gs1NxNz3wiZY3opAdw2fXovHJ_o
published: true
---
<table>
<tr>
<td></td>
<td>Blog 4</td>
<td>Date</td>
<td>01/10/18</td>
</tr>
</table>
<table>
<tr>
<td>Starting point:</td>
<td>Knowing the basics on how to function the fuze </td>
</tr>
<tr>
<td>Target for this lesson?</td>
<td>Expanding knowledge on how to function the fuze</td>
</tr>
<tr>
<td>Did I reach my target? </td>
<td>N/A</td>
</tr>
</table>
<table>
<tr>
<td>Lesson Review</td>
</tr>
<tr>
<td>How did I learn? What strategies were effective? </td>
</tr>
<tr>
<td>N/A</td>
</tr>
<tr>
<td>What limited my learning? Which habits do I need to work on? </td>
</tr>
<tr>
<td>N/A</td>
</tr>
<tr>
<td>What will I change for next time? How will I improve my learning?</td>
</tr>
<tr>
<td>N/A</td>
</tr>
</table>
|
Add comment to subtitle on Whisper model size
Add comment in SRT file on transcribed date and Whisper model size
Suggested format:
# Transcribed 2023-11-10 with medium model size
This allows proofreading contributors to identify the accuracy of a raw transcription file
Fixed by: feb1649
|
'use strict';
/**
* @fileoverview Enforce spies to be declared in before/after/it blocks
*/
const TSLint = require('tslint');
const ts = require('typescript');
const findParentFromNode = require('../helpers/findParentFromNode');
const WHITELIST = /^(((before|after)(All|Each)?)|((f|i|x)?it))$/;
const hasWhitelistedParent = function hasWhitelistedParent(node) {
const whitelistedParent = findParentFromNode(node, parent => (
ts.isCallExpression(parent) &&
WHITELIST.test(parent.expression.text)
));
return !!whitelistedParent;
}
const isSpy = node => (
node.expression.text === 'spyOn' ||
(
ts.isPropertyAccessExpression(node.expression) &&
node.expression.expression.text === 'jasmine' &&
(
node.expression.name.text === 'createSpy' ||
node.expression.name.text === 'createSpyObj'
)
)
);
const walk = function walk(ctx) {
const checkNode = function checkNode(node) {
if (
ts.isCallExpression(node) &&
isSpy(node) &&
!hasWhitelistedParent(node)
) {
return ctx.addFailureAtNode(node, Rule.FAILURE_STRING);
}
return ts.forEachChild(node, checkNode);
};
return ts.forEachChild(ctx.sourceFile, checkNode);
};
class Rule extends TSLint.Rules.AbstractRule {
apply(sourceFile) {
return this.applyWithFunction(sourceFile, walk);
}
}
Rule.FAILURE_STRING = 'Spy declared outside of before/after/it block.';
exports.Rule = Rule;
|
Board Thread:ROLEPLAY/@comment-30744559-20180917135005/@comment-30719236-20180930181223
Specimen #5: oh it's true look you are already see the proof including 12 and 13
|
The Wolf Man
The Wolf Man
Frankenstein Meets the Wolfman
House of Frankenstein
While the monster would return, Dr. Niemann is at last dead.
House of Dracula
Van Helsing (2004)
Main article: The Wolfman (Van Helsing)
Remake timeline
Main article: Sir John Talbot
|
/*jshint sub:true*/
var _ = require('lodash');
var fs = require('fs');
var path = require('path');
var osdf_utils = require('osdf_utils');
var logger = osdf_utils.get_logger();
// The main data structure to hold our ACL information.
var acl = {};
var namespace_user_acls = {};
// Initialize the handler by scanning the 'acls' directory in each namespace
// directory, reading the files therein, and adding the contents to a datastructure
// in memory for faster lookups during runtime.
exports.init = function(emitter) {
logger.info("In " + path.basename(__filename) + " init().");
var acl_reader = function(namespaces) {
// Initialize the master ACL hash with a key for each namespace
_.each(namespaces, function(namespace) {
acl[namespace] = {};
namespace_user_acls[namespace] = {};
});
// Now, iterate over the namespaces and scan the ACL files for each one.
osdf_utils.async_for_each(namespaces, function(namespace, cb) {
var acl_dir = path.join(osdf_utils.get_working_dir(), 'namespaces',
namespace, 'acls');
fs.readdir(acl_dir, function(err, files) {
if (err) {
throw err;
}
// Reject any hidden files/directories, such as .svn directories
files = _.reject(files, function(file) {
return file.substr(0, 1) === '.';
});
// So, if we're here, the scan has been completed and the 'files'
// array is populated without incident.
logger.debug("Found " + files.length + " ACL files for namespace " + namespace);
osdf_utils.async_for_each(files, function(file, file_cb) {
var acl_file = path.join(acl_dir, file);
fs.readFile(acl_file, 'utf-8', function(err, data) {
if (err) {
throw err;
}
var members = data.split('\n');
// Reject any strange members
members = _.reject(members, function(member) {
return member === null || member.length === 0 || member === "all";
});
// Remove any that have spaces in them.
members = _.reject(members, function(member) {
return osdf_utils.has_white_space(member);
});
// Sort them
members = _.sortBy(members, function(member) { return member; });
// Remove any duplicates...
members = _.uniq(members, true);
// Populate the acl object
acl[namespace][file] = members;
// Populate the namespace_user_acls object
_.each(members, function(member) {
if (!namespace_user_acls[namespace][member]) {
namespace_user_acls[namespace][member] = [];
}
namespace_user_acls[namespace][member].push(file);
});
file_cb();
});
}, function() { cb(); });
});
}, function() {
emitter.emit('perms_handler_initialized');
});
};
osdf_utils.get_namespace_names(function(namespaces) {
acl_reader(namespaces);
});
};
// Given a user and a node, determine if the user can read (retrieve)
// the node. Returns true or false.
exports.has_read_permission = function(user, node) {
if (! (node.hasOwnProperty('ns') && node.hasOwnProperty('node_type') &&
node.hasOwnProperty('acl') && node.hasOwnProperty('linkage'))) {
throw "Invalid node.";
}
var can_read = false;
var read_acls = node['acl']['read'];
// Do the easiest/fastest thing first. Is 'all' in the read acl?
// If so, our job is done.
if (_.includes(read_acls, "all")) {
return true;
}
// Okay, look at them in more detail. For that we'll need the node's
// namespace.
var namespace = node['ns'];
if (acl.hasOwnProperty(namespace)) {
var acl_idx;
for (acl_idx = 0; acl_idx < read_acls.length; acl_idx++) {
var read_acl = read_acls[acl_idx];
if (_.includes(acl[namespace][read_acl], user)) {
can_read = true;
break;
}
}
} else {
logger.warn("Unknown namespace: " + namespace);
}
return can_read;
};
// Given a user and a node, determine if the user can write to
// (that is, update or delete) the node. Returns true or false.
exports.has_write_permission = function(user, node) {
if (! (node.hasOwnProperty('ns') && node.hasOwnProperty('node_type') &&
node.hasOwnProperty('acl') && node.hasOwnProperty('linkage') )) {
throw "Invalid node.";
}
var write_acls = node['acl']['write'];
// Do the easiest/fastest thing first. Is 'all' in the write acl?
// If so, our job is done.
if (_.includes(write_acls, "all")) {
return true;
}
// Okay, look at them in more detail. For that we'll need the node's
// namespace.
var namespace = node['ns'];
var can_write = false;
if (acl.hasOwnProperty(namespace)) {
var acl_idx;
for (acl_idx = 0; acl_idx < write_acls.length; acl_idx++) {
var write_acl = write_acls[acl_idx];
if (_.includes(acl[namespace][write_acl], user)) {
can_write = true;
break;
}
}
} else {
logger.warn("Unknown namespace: " + namespace);
}
return can_write;
};
exports.get_user_acls = function(namespace, user) {
var user_acls = ["all"];
// If namespace/user has valid acls, return them with prepended "all"
// otherwise, simply return "all"
if (namespace_user_acls[namespace] && namespace_user_acls[namespace][user]) {
user_acls.concat(namespace_user_acls[namespace][user]);
}
return user_acls;
};
|
We study, by numerical simulations on a lattice, the dependence of the
gauge-invariant two-point field-strength correlators in QCD on the path used to
perform the color parallel transport between the two points.
|
Question NW394 to the Minister of Transport
Share this page:
14 March 2022 - NW394
Mabhena, Mr TB to ask the Minister of Transport
(1)Whether, with reference to (a) the incident where an empty Transnet Freight Rail Blue train derailed at the Union Station Loop in Germiston on Sunday, 7 November 2021 and (b) two Blue train coaches derailing within the Salvokop Blue Train train-yard in January 2022, the Railway Safety Regulator can guarantee the safety of the public on these blue train coaches; if not, why not; if so, what are the relevant details; (2) whether the safety permits are still valid and in place; if not, why not; if so, on what date is it anticipated that the permits will be reviewed?
Source file
|
<?php
namespace App\Http\Controllers;
use App\Detallepagos;
use Illuminate\Http\Request;
use App\Alumnos;
use App\Personas;
use App\Cuotas;
use App\Inscripciones;
use App\Recibos;
use App\Cursadas;
use App\Tipopagos;
use DB;
class DetallepagosController extends Controller
{
/**
* Display a listing of the resource.
*
* @return \Illuminate\Http\Response
*/
public function index()
{
//
$datos= DB::table('alumnos')
->join('personas','personas.id','=','alumnos.persona_id')
->select('personas.nombre','personas.dni','personas.apellido','personas.cuil','personas.telefono','personas.correo','alumnos.id')
->orderBy('nombre','asc')
->get();
//$datos['alumnos']=Alumnos::all();
return view('detallepagos.index',compact('datos'));
}
/**
* Show the form for creating a new resource.
*
* @return \Illuminate\Http\Response
*/
public function create()
{
//
//$alumnos = Alumnos::all();
//return view('detallepagos.create',compact('alumnos'));
}
/**
* Store a newly created resource in storage.
*
* @param \Illuminate\Http\Request $request
* @return \Illuminate\Http\Response
*/
public function store(Request $request)
{
//
$fecha_cobro= date('Y-m-d');//optengo la fecha actual
dd($request->cuota);
dd($request->fechapago);// esto es el id de la cuota
dd($request->cuota);// esta mostrando las cuotas osea pasa el valor del array
$nuevoDetallepago = new Detallepagos;
$nuevoDetallepago->alumno_id = $request->alumno_id;//este bien
$nuevoDetallepago->monto = $request->total_venta;//este bien
//$nuevoDetallepago->recibo_id = ?????????;//////verrrrrrrrrr
$nuevoDetallepago->inscripcion_id = $request->alumno_id;////////ver
$nuevoDetallepago->cuota_id = $request->cuota_id;//ver esteee
//------------------Recibo---------------------
$nuevoRecibo = new Recibos;
$nuevoRecibo->fecha = $fecha_cobro;//este bien
$nuevoRecibo->nrorecibo = $nrorecibo;//genera este campo consultando cn la BD..
}
/**
* Display the specified resource.
*
* @param \App\Detallepagos $detallepagos
* @return \Illuminate\Http\Response
*/
public function show(Detallepagos $detallepagos)
{
//
}
/**
* Show the form for editing the specified resource.
*
* @param \App\Detallepagos $detallepagos
* @return \Illuminate\Http\Response
*/
public function edit($id)
{
//
$tipopagos = Tipopagos::all();
$cuotasss= Cuotas::all();
$persona= DB::table('alumnos')
->join('personas','personas.id','=','alumnos.persona_id')
->select('personas.nombre','personas.dni','personas.apellido','personas.cuil','personas.telefono','personas.correo','alumnos.id')
->where('alumnos.id','=',$id)
->orderBy('nombre','asc')
->first();
//selecciona las cuotas y suma el total
$cuotas = DB::table('cuotas')
->join('ofertas','ofertas.id','=','cuotas.oferta_id')
->join('cursadas','cursadas.oferta_id','=','ofertas.id')
->join('inscripciones','inscripciones.cursada_id','=','cursadas.id')
->join('alumnos','alumnos.id','=','inscripciones.alumno_id')
->select('ofertas.titulacion','cuotas.id','enero','febrero','marzo','abril','mayo','junio', 'julio', 'agosto','septiembre','octubre', 'noviembre','diciembre','mes1','mes2','mes3','mes4','mes5','mes6','mes7','mes8','mes9','mes10','mes11','mes12', DB::raw('SUM(enero + febrero + marzo + abril + mayo + junio + julio + agosto + septiembre + octubre + noviembre + diciembre) as total'))
->where('alumnos.id','=',$id)
->groupBy('enero','febrero', 'marzo','abril','mayo','junio', 'julio', 'agosto','septiembre','octubre', 'noviembre','diciembre','mes1','mes2','mes3','mes4','mes5','mes6','mes7','mes8','mes9','mes10','mes11','mes12','cuotas.id','ofertas.titulacion')
->get();
//dd($total);
/*
$detallepago= DB::table('detallepagos')
->join('alumnos','alumnos.id','=','detallepagos.alumno_id')
->join('inscripciones','inscripciones.id','=','detallepagos.inscripcion_id')
->join('recibos','recibos.id','=','detallepagos.recibo_id')
->join('cuotas','cuotas.id','=','detallepagos.cuota_id')
->join('cursos','cursos.id','=','cursadas.curso_id')
->join('divisiones','divisiones.id','=','cursadas.division_id')
->join('turnos','turnos.id','=','cursadas.turno_id')
->select('anios.nombre as anio','ofertas.titulacion','ofertas.numero','cursos.nombre as curso','divisiones.nombre as division','turnos.nombre as turno','cursadas.plazas as plaza','inscripciones.id', 'alumnos.Apellido as apellido', 'alumnos.nombre as nombre', 'alumnos.dni as dni')
->where('alumnos.id','=',$id)
->orderBy('titulacion','asc')->get();
*/
return view('detallepagos.edit', compact('persona','cuotas','tipopagos'));
}
/**
* Update the specified resource in storage.
*
* @param \Illuminate\Http\Request $request
* @param \App\Detallepagos $detallepagos
* @return \Illuminate\Http\Response
*/
public function update(Request $request, Detallepagos $detallepagos)
{
//
}
/**
* Remove the specified resource from storage.
*
* @param \App\Detallepagos $detallepagos
* @return \Illuminate\Http\Response
*/
public function destroy(Detallepagos $detallepagos)
{
//
}
}
|
import { NextFunction, Request, Response } from "express";
export const validPaginate = (req: Request, res: Response, next: NextFunction) => {
try {
if (!req.query.skip) { throw new Error("Paginate: invalid skip"); }
if (!req.query.limit) { throw new Error("Paginate: invalid limit"); }
req.query.skip = parseInt(req.query.skip, 10);
req.query.limit = parseInt(req.query.limit, 10);
if (req.query.limit > 256) { throw new Error("Limit is too big"); }
next();
} catch (e) {
res.send({ status: "failed", payload: e.message });
}
};
|
**4. Inflammatory cytokines in inflammatory process**
Cytokines are tiny secreted proteins (<40 kDa) that virtually every cell produces to control and affect immune response [20]. The discharge of pro-inflammatory cytokines causes immune cell initiation and development, along with the discharge of additional cytokines [61]. When the word "cytokine storm" first appeared, it was used to describe inflammation as a rapid immediate discharge of cytokines to activate an inflammatory mechanism [62]. Current work of scientists suggests that in every immune reaction, the simultaneous release of pro- and anti-inflammatory cytokines is needed [63]. Interleukins, chemokines, and growth factors are only some of the terms used to describe cytokines [64]. Super families of cytokines exist, which do not actually describe common genes but rather related structures [64]. Furthermore, the same cytokine may be generated by various cell populations. Cytokines have pleiotropic effects and their effects are dependent on the cell they are targeting [65]. Furthermore, various cytokines may have the same impact, making them redundant. However, they could have a synergistic influence. Finally, they can initiate signaling cascades, allowing even tiny amounts of protein to have catastrophic consequences [66].
|
"""
Remote authentication support for the HXL Proxy.
Started 2015-12 by David Megginson.
"""
import random
import requests
from flask import session
from hxl_proxy import app
def get_hid_login_url ():
"""Construct the URL for logging into Humanitarian ID."""
state = str(random.randint(1, 100000))
session['state'] = state
return '{base_url}/oauth/authorize?response_type=code&client_id={client_id}&scope=profile&redirect_uri={redirect_uri}&state={state}'.format(
base_url = app.config.get('HID_BASE_URL'),
client_id = requests.utils.quote(app.config.get('HID_CLIENT_ID')),
redirect_uri = requests.utils.quote(app.config.get('HID_REDIRECT_URI')),
state = requests.utils.quote(state)
)
def get_hid_user (code):
"""Look up a user from Humanitarian.ID based on an authorization token"""
# Stage 1: get an access token
params = {
'client_id': app.config.get('HID_CLIENT_ID'),
'client_secret': app.config.get('HID_CLIENT_SECRET'),
'grant_type': 'authorization_code',
'redirect_uri': app.config.get('HID_REDIRECT_URI'),
'code': code
}
headers = {
#'Authorization': 'Basic {secret}'.format(secret=app.config.get('HID_CLIENT_SECRET'))
}
response = requests.post(
'{base_url}/oauth/access_token'.format(
base_url = app.config.get('HID_BASE_URL')
),
headers=headers,
data=params
)
if response.status_code != 200:
raise Exception("Failed to get access token: {}".format(response.reason))
# Stage 2: get the user data
access_data = response.json()
response = requests.get(
'{base_url}/account.json?access_token={access_token}'.format(
base_url = app.config.get('HID_BASE_URL'),
access_token = requests.utils.quote(access_data['access_token'])
)
)
return response.json()
# end
|
Thread:King Dragonhoff/@comment-12690164-20161214092735
Hi KD, I am here to report a user we have found harrassing on the Clash Royale Wikia Live Chat.
I hope you can look into the matter and take whatever actions appropriate. Thank you!
LucasH181 (talk)
|
Divide a line into two segments based on Phi, Golden Ratio
I have a line length I'm dividing into two segments. Rather than spit in half or use some other arbitrary value, I wish to use Phi, or the Golden Ratio, to determine the length of each segment.
For example, given a height value of 100, I need the return of 61.8 and 38.2.
In this case I'm programming a dynamically generated SVG shape using JavaScript. A form is used to provide the inputs, for example height of the shape. There are corners at the bottom that use Bezier curves. I wish to start the bezier curve at a point along the side determined by the Golden Ratio, or "phi" which is approximately 1.618.
<svg width="600" height="600" viewBox="0 0 0 0">
<path d="" />
</svg>
<script>
let height = 100
let vertical = 38.2
let corner = 61.8
// d = "m 300 300 v 38.2 c 0 100 38.2 100 100 100"
document.querySelector('path').setAttribute("d",
"m 300 300 v " + vertical + " c 0 " + corner + " " + vertical + " " + corner + " " + corner + " " + corner
)
</script>
Two Golden Ratio (or "phi", which is a ratio of approximately 1.618) formulas—of a line made up of line segments a and b, consecutively—are:
// a b
// X---------X-----X
a/b = 1.618...
// and
(a + b) / a = 1.618...
Having neither a nor b, but having the total line length, the second ratio is used to determine first a, then b:
// 1) Starting with formula:
(a + b) / a = 1.618...
// 2) Rename (a + b) to represent the known value:
(total_line_length) / a = 1.618...
// 3) Isolate variable a:
total_line_length / a * a = a * 1.618... // multiply each side by a
total_line_length = a * 1.618...
total_line_length / 1.618... = a * 1.618... / 1.618... // divide each side by 1.618...
a = total_line_length / 1.618...
// 4) Get b:
b = total_line_length - a
Using the last two equations write a Javascript function that accepts the total line length:
function getPhiSegs (total_line_length) {
let major = total_line_length / 1.61803398874989484820
let minor = total_line_length - major
return {"phi_major": rndH(major), "phi_minor": rndH(minor)}
}
function rndH(val) { // round value to nearest hundreth
return Math.round(val * 100) / 100
}
Returns:
> getPhiSegs(100)
> { phi_major: 61.8, phi_minor: 38.2 }
Using getPhiSegs function to define an SVG path:
let height = document.forms[0].elements['height'].value
let height_phi_segments = getPhiSegs(height)
let vertical = height_phi_segments.phi_minor
let corner = height_phi_segments.phi_major
document.querySelector('path').setAttribute("d",
"m 300 300 v " + vertical + " c 0 " + corner + " " + vertical + " " + corner + " " + corner + " " + corner
)
You need to solve the equation that defines phi, first of all. From wikipedia:
const phi = (1 + Math.sqrt(5)) / 2;
console.log(phi);
const getSegments=(h)=>{return {'a': h/phi, 'b': h-h/phi};}
console.log(getSegments(100));
So in context of your existing code:
const phi = (1 + Math.sqrt(5)) / 2;
const getSegments=(h)=>{return {'a': h/phi, 'b': h-h/phi};}
let height = 100;
let segments = getSegments(height);
let pathDef =
`m 300 300 v ${segments.b}
c 0 ${segments.a} ${segments.b}
${segments.a} ${segments.a} ${segments.a}`;
console.log(pathDef);
document.querySelector('path').setAttribute("d", pathDef);
<svg width="12cm" height="4cm"
viewBox="0 0 300 600"
xmlns="http://www.w3.org/2000/svg"
version="1.1"
>
<path d=""
fill="none" stroke="blue"
stroke-width="20"
/>
</svg>
Thanks for your answer. Please explain the benefit of solving phi over hard coding the solution? In other words, why use (1 + Math.sqrt(5)) / 2 instead of 1.618033988749895 ?
phi = (1 + Math.sqrt(5)) / 2 is nearly as simple to write as phi = 1.618033988749895 and while the accuracy (I assume) is either the same or so close to the same that you will never notice, I think the equation is more semantically significant. The solution is well known, so it doesn't really take any effort to find, as a matter of fact, no more effort than it would take to find the value to 15 digits.
|
using System;
using System.Threading;
using System.Threading.Tasks;
namespace Disqord.Http
{
public interface IHttpClient : IDisposable
{
/// <summary>
/// Gets or sets the base url for HTTP requests.
/// </summary>
Uri BaseUri { get; set; }
/// <summary>
/// Sets a default header value for HTTP requests.
/// </summary>
/// <param name="name"> The name of the header. </param>
/// <param name="value"> The value of the header. </param>
void SetDefaultHeader(string name, string value);
/// <summary>
/// Sends a HTTP request and returns the response.
/// </summary>
/// <param name="request"> The HTTP request. </param>
/// <param name="cancellationToken"> The cancellation token. </param>
/// <returns>
/// The HTTP response.
/// </returns>
Task<IHttpResponse> SendAsync(IHttpRequest request, CancellationToken cancellationToken = default);
}
}
|
Talk:Better When I’m Dancin'/@comment-24051831-20151115014811/@comment-24051831-20151115015350
Oh, sorry. I didn't know.
|
Upload Media from Heroku to Amazon S3
New to Heroku & Amazon S3, so bear with me. Uploaded my Django app onto Heroku, and having a problem with user media uploads. The model is below:
#models.py
class Movie(models.Model):
title = models.CharField(max_length = 500)
poster = models.ImageField(upload_to = 'storages.backends.s3boto')
pub_date = models.DateTimeField(auto_now_add = True)
author = models.ForeignKey(User)
The poster attribute is the one where the image is uploaded. I had it running fine locally, and now on Heroku there is an error. So I added 'storages.backends.s3boto', as numerous other posts have told me to. (not sure if right).
My Settings.py file looks like this right now, kind of a mess:
#settings.py
PROJECT_ROOT = os.path.abspath(os.path.dirname(__file__))
PROJECT_DIR = os.path.join(PROJECT_ROOT, '../qanda')
DEFAULT_FILE_STORAGE = 'storages.backends.s3boto.S3BotoStorage'
STATICFILES_STORAGE = 'storages.backends.s3boto.S3BotoStorage'
AWS_ACCESS_KEY_ID = '****************'
AWS_SECRET_ACCESS_KEY = '************'
AWS_STORAGE_BUCKET_NAME = 'mrt-assets'
AWS_PRELOAD_METADATA = True
MEDIA_ROOT = os.path.join(PROJECT_ROOT, 'qanda/media/movie_posters/)
MEDIA_URL = '/media'
STATIC_ROOT = os.path.join(PROJECT_ROOT, 'staticfiles')
STATIC_URL = 'https://mrt-assets.s3.amazonaws.com/static/'
STATICFILES_DIRS = (os.path.join(PROJECT_DIR, 'static'),)
My bucket is called mrt-assets, and there are 2 folders in there static (css, js, images and media. I'm not too worried about the static files for now, as I've hardcoded the CSS/JS files into my HTML files*, but how do I get my user uploaded media (images of any kind) into mrt-assets/media?
*although if someone wanted to help with STATIC files too that would be great. But user uploaded media more urgent.
EDIT (per Yuji's comment):
Have tried a number of options, and none of them working. I've gone back and deleted a lot of changes, and this is now my Settings
#settings.py
PROJECT_ROOT = os.path.abspath(os.path.dirname(__file__))
MEDIA_ROOT = 'http://s3.amazonaws.com/mrt-assets/media/'
MEDIA_URL = '/media/'
STATIC_ROOT = 'http://s3.amazonaws.com/mrt-assets/static/'
STATIC_URL = '/static/'
ADMIN_MEDIA_PREFIX = STATIC_URL + 'admin/'
TEMPLATE_DIRS = (os.path.join(PROJECT_ROOT, "templates"),)
#models.py
#same as before, but now have changed the poster directory
poster = models.ImageField().
Not really sure what to do, need to connect my Heroku app to S3 so user media uploads are saved there.
Have now changed my S3 Bucket to this
mrt-assets
static
css
js
images
media
(empty)
Chris, what is the error? I had issues with a particular S3Boto and had to revert to an older version for Heroku
Yuji, will edit question to fill in on current status. Thanks in advance!
tried using link Django s3 folder storage. followed the instructions in git, added to INSTALLED_APPS tuple, added to requirements.txt, but got error s3 folder storage.
Chris, I still don't see an error message. What is the python stack trace you're getting when there is an error? For future reference, this is extremely important to post when asking a question about an error.
The trick of getting your media to upload into <bucket>/media and your static assets into <bucket>/static is to create two different default storage backends for the two asset types or to explicitly instantiate your model fields with a storage object taking a location parameter.
Instantiating model field with custom storage
from storages.backends.s3boto import S3BotoStorage
class Movie(models.Model):
title = models.CharField(max_length=500)
poster = models.ImageField(storage=S3BotoStorage(location='media'))
pub_date = models.DateTimeField(auto_now_add=True)
author = models.ForeignKey(User)
Giving S3BotoStorage a location will prefix all uploads with its path.
Creating custom storage backends for media and static assets
This is almost the same as explicitly defining a storage backend with
location, but instead we'll be using settings.MEDIA_ROOT and
settings.STATIC_ROOT to apply a path prefix globally.
# settings.py
STATIC_ROOT = '/static/'
MEDIA_ROOT = '/media/'
DEFAULT_FILE_STORAGE = 'app.storage.S3MediaStorage'
STATICFILES_STORAGE = 'app.storage.S3StaticStorage'
# app/storage.py
from django.conf import settings
from storages.backends.s3boto import S3BotoStorage
class S3MediaStorage(S3BotoStorage):
def __init__(self, **kwargs):
kwargs['location'] = kwargs.get('location',
settings.MEDIA_ROOT.replace('/', ''))
super(S3MediaStorage, self).__init__(**kwargs)
class S3StaticStorage(S3BotoStorage):
def __init__(self, **kwargs):
kwargs['location'] = kwargs.get('location',
settings.STATIC_ROOT.replace('/', ''))
super(S3StaticStorage, self).__init__(**kwargs)
Refining it
You can refine the above code to take advantage of
Heroku config vars
to make it more portable:
# settings.py
import os
STATIC_ROOT = os.environ.get('STATIC_ROOT',
os.path.join(os.path.dirname(__file__), 'static'))
MEDIA_ROOT = os.environ.get('MEDIA_ROOT',
os.path.join(os.path.dirname(__file__), 'media'))
DEFAULT_FILE_STORAGE = os.environ.get('DEFAULT_FILE_STORAGE',
'django.core.files.storage.FileSystemStorage')
STATICFILES_STORAGE = os.environ.get('STATICFILES_STORAGE',
'django.contrib.staticfiles.storage.StaticFilesStorage')
Couple the above settings with a .env file and you can use the
default storage backends locally for development and testing and when
deploying on Heroku you'll automatically switch to
app.storage.S3MediaStorage and app.storage.S3StaticStorage respectively:
# .env
STATIC_ROOT=static
MEDIA_ROOT=media
DEFAULT_FILE_STORAGE=app.storage.S3MediaStorage
STATICFILES_STORAGE=app.storage.S3StaticStorage
|
Pandas average of columns from first non zero values
I have a data about client sales for 12 months.Need to calculate average but with condition - only from the first month when client ordered something (including zero sales after the month client bought something for the first time)
Using .mean function doesnt give a correct result
Have you given it a try? Also could you add a minimal example as code in your question instead of an image?
Use a mask (where with a cummax to propagate the booleans to the right) to only keep the values after the first non-zero:
df.where(df.ne(0).cummax(axis=1)).mean(axis=1)
Example:
df = pd.DataFrame([[0, 1, 2, 3], # mean = 2
[0, 0, 1, 2], # mean = 1.5
[1, 0, 0, 0]]) # mean = 0.25
df.where(df.ne(0).cummax(axis=1)).mean(axis=1)
Output:
0 2.00
1 1.50
2 0.25
dtype: float64
|
At Ease with Coleman Hawkins
At Ease with Coleman Hawkins (also referred to as Moodsville 7) is an album by saxophonist Coleman Hawkins which was recorded in 1960 and released on the Moodsville label.
Reception
Scott Yanow of AllMusic states, "this CD is more successful as pleasant background music than as creative jazz".
Track listing
* 1) "For You, For Me, For Evermore" (George Gershwin, Ira Gershwin) – 6:07
* 2) "While We're Young" (William Engvick, Morty Palitz, Alec Wilder) – 3:33
* 3) "Then I'll Be Tired of You" (Yip Harburg, Arthur Schwartz) – 5:08
* 4) "Mighty Like a Rose" (Ethelbert Nevin, Frank Lebby Stanton) – 4:00
* 5) "At Dawning" (Charles Wakefield Cadman) – 4:39
* 6) "Trouble Is a Man" (Alec Wilder) – 5:25
* 7) "Poor Butterfly" (John Golden, Raymond Hubbell) – 6:06
* 8) "I'll Get By (As Long as I Have You)" (Fred E. Ahlert, Roy Turk) – 6:36
Personnel
* Coleman Hawkins – tenor saxophone
* Tommy Flanagan – piano
* Wendell Marshall – bass
* Osie Johnson – drums
|
Antennas for Licensed Shared Access in 5G Communications with LTE Mid- and High-Band Coverage
Two novel antennas are presented for mobile devices to enable them to access both licensed shared access (LSA) bands (1452–1492 and 2300–2400 MHz) and all the long-term evolution (LTE) mid (1427–2690 MHz) and high (3400–3800 MHz) bands, together with the GSM1800, GSM1900, UMTS, and 3.3 GHz WiMAX bands. These antennas do not require any passive or active lumped elements for input impedance matching. One of them is a dual-band antenna and the other is a wideband antenna. Both antennas have high efficiency in all the LSA bands, as well as the mid- and high-LTE bands, and nearly omnidirectional radiation patterns in the mid band. In the high band, the radiation patterns of the wideband antenna are less directional than those of the dual-band antenna. The wideband antenna was fabricated and tested and the measurements demonstrated that it had good wideband performance in a wide frequency range from 1.37 to 4 GHz, covering all the above-mentioned bands.
Introduction
The rapidly growing demands of mobile traffic can be supported by fifth-generation (5G) wireless communication systems [1][2][3][4][5][6]. An application of cognitive radio technology named licensed shared access (LSA) has been proposed for 5G mobile communication systems to allow the sharing of spectrum among mobile network operators [7][8][9][10]. In Europe, a 1.5 GHz band (1452-1492 MHz) and a 2.3 GHz band (2300-2400 MHz) have been allocated for LSA service. The proposed LSA service has been tested in the 2.3 GHz band in Europe and more bands are expected to be allocated in the future [8,11,12].
Antennas with very large bandwidths are required in mobile devices to cover many bands, including, for example, the long-term evolution (LTE) mid (1427-2690 MHz) band, LTE high (3400-3800 MHz) band, DCS/GSM1800, and PCS/GSM1900 bands. The LTE mid and high bands consist of 16 frequency-division duplexing (FDD) bands (LTE 1-4, 7, 9-11, 15, 16, 21-25, 30) and 11 time-division duplexing (TDD) bands (LTE 33-43) [13]. Several antennas have been proposed with multiband or wideband operation for wireless wide-area network (WWAN)/LTE hand-held devices to cover the frequency range from 1710 to 2690 MHz [14][15][16][17][18]. The antenna presented in [19] covers a wide frequency band from 1585 to 2195 MHz. However, this antenna covers only a part of the LTE mid band, and the performance of the antenna has not been verified after integrating the antenna into the substrate of a mobile phone. On the other hand, metal-framed antennas are reported in [20,21]. The antenna in [21] covers only the LTE mid band, whereas the antenna in [20] covers both the LTE mid and high bands. Some antennas have been reported to cover both the 1710-2690 MHz (LTE mid) and 3400-3800 MHz (LTE high) frequency ranges [22][23][24][25][26]. Recently, an antenna was presented in [27] that covers both frequency bands. However, in order to achieve acceptable impedance matching (|S 11 | < −6 dB) in the above-mentioned
A Planar Antenna for LSA Bands
This section presents a planar antenna (Ant#1) for the 1.5 and 2.3 GHz LSA bands.
Antenna Configuration
This printed antenna (Ant#1) is designed to operate in the 1452-1492 and 2300-2400 MHz LSA bands and its detailed geometry with top and bottom views is shown in Figure 1. The total area of the antenna is 40 mm × 15 mm, or 0.18λ 0 × 0.07λ 0 , where λ 0 is the free-space wavelength at 1.38 GHz. For the simulation, the antenna is assumed to be fed by an SMA connector at the bottom. To ensure isolation between the ground plane and the center pin of the SMA connector, a circular portion of copper with radius r is etched off from the ground plane, as shown in Figure 1b. The antenna is placed in the top-right corner of a mobile device substrate with dimensions of 120 mm × 70 mm. A substrate commonly used in mobile devices is FR-4, with a relative permittivity ( r ) and loss tangent (tan δ) of 4.3 and 0.025, respectively. Its thickness is assumed to be 0.8 mm. The overall area of the ground plane is equal to the area of the substrate. A segment of copper with dimensions of 50 mm × 11 mm is removed from the top-right corner of the ground plane, as shown in Figure 1b. The proposed antenna is composed of two elements: an L-shaped element to the left of the feed point (left element) to cover the 1.5 GHz LSA band and an L-shaped element to the right (right element) to cover the 2.3 GHz LSA band. CST Microwave Studio is used for the design and analyses of the antenna. The dimensions are optimized using a parameter analysis conducted in CST for good impedance matching.
Design Procedure and Working Principle
The design of this LSA antenna starts with a simple L-shaped antenna, which is shown as Step 1 in Figure 2. This antenna has a −6 dB reflection coefficient bandwidth of 670 MHz (1.39-2.06 GHz), as shown in Figure 2, and resonates at 1.58 GHz. The effective length of the antenna (Step-1) is 44 mm. Step-1 Step-2 Step-1 Step-2 In the next step, our target is to achieve an operating band that could cover the higher LSA band (2.3 GHz band), together with the lower LSA band (1.5 GHz band). In order to have another resonance at the higher LSA band, an L-shaped right element is added to the antenna element in Step 1, and the reflection coefficient curve is shown in Figure 2. The second antenna (Step 2) has a wide −6 dB reflection coefficient bandwidth of 1170 MHz (1.38-2.55 GHz) and covers both LSA bands, together with 12 FDD and 7 TDD LTE bands in the LTE mid band. The antenna resonates at 1.71 and 2.38 GHz within the 1.5 and 2.3 GHz LSA bands, respectively. The effective length of the right element is 31 mm, which is equal to a quarter wavelength at 2.38 GHz, and that of the left element is 44 mm, which is equal to a quarter wavelength at 1.71 GHz. Note that the electrical lengths are calculated with respect to the free-space wavelength. Now let us study the surface current distribution, as shown in Figure 3, at 1.8 and 2.6 GHz in order to further understand the operation of the antenna. At both frequencies, the surface current is at a maximum around the feed point and a minimum at the end of the left or right element, meaning that the antenna resonates in the quarter-wavelength modes at both frequencies. The left element has strong currents at 1.8 GHz and the right element has strong currents at 2.6 GHz. However, in both cases, moderate currents are observed in the ground plane close to the antenna structure. This planar antenna covers both the LSA bands but only a part of the mid-LTE band. In the next section, a dual-band antenna is presented to cover the entire LTE mid and high bands, together with the two LSA bands.
Radiation Performance
The antenna gain variation within the reflection coefficient bandwidth is 2.3 dB and the minimum and maximum antenna gains are 1.3 and 3.6 dBi, respectively. The minimum and maximum efficiencies are 66% and 89%, respectively. The efficiency and gain variation within the reflection coefficient bandwidth are shown in Figure 5 shows the normalized E φ and E θ radiation patterns of Ant#1 in the three principal planes at 1.8 and 2.6 GHz. Here, the patterns are normalized with respect to the maximum of the corresponding principal plane. From the presented results, no nulls can be observed at 1.8 GHz but a null can be observed at 2.6 GHz in the x-y plane radiation patterns. The E φ radiation in the y-z plane at 1.8 GHz is more uniform (i.e., somewhat omnidirectional) compared to the E φ radiation in the same plane at 2.6 GHz. An almost directed E φ radiation pattern can be observed in the x-z plane at 2.6 GHz.
x-z plane y-z plane x-y plane
Dual-Band Antenna for LSA Bands and LTE Mid and High Bands
In this section, the design and performance of a dual-band antenna (Ant#2) are described.
Antenna Configuration
The dual-band antenna is designed to operate in the 1427-2690 and 3300-3800 MHz bands to support LSA, TDD/FDD LTE, UMTS, DCS, PCS, GSM1800, GSM1900, WLAN (2.4 GHz), and WiMAX (2.5 and 3.3 GHz), as shown in Figure 6. There is a small vertical plate in the antenna, which is shown as unfolded along the +y-axis in Figure 6 for better presentation. The substrate size, positioning of the antenna, feed arrangement, ground clearance, and back view are similar to Ant#1, as shown in Figure 1. The overall dimensions of the antenna are 39 mm × 15 mm × 4 mm or 0.18λ 1 × 0.08λ 1 × 0.02λ 1 , where λ 1 is the free-space wavelength at 1.39 GHz (the lowest frequency of the antenna's first operating band, i.e., the mid band). Although the antenna has a small vertical plate, the area occupied by this antenna is 3% less than that occupied by Ant#1. This antenna is composed of three elements: an L-shaped element MNO in the middle, a U-shaped large element GQUH loaded with the vertical plate on the left, and an L-shaped element VKL on the right. Here, the vertical plate is aligned with the edge GQ. The dimensions are optimized using a parameter analysis conducted in CST for good impedance matching. The optimized design parameters of the dual-band antenna (Ant#2) are listed in Table 1. Table 1. Design parameters of the dual-band antenna (Ant#2). All dimensions are in millimeters.
Design Procedure and Working Principle
The design procedure of Ant#2 is divided into two main steps. The first step is to design an antenna for the 1427-2690 MHZ band. The second step is to add a new element to cover the high (3300-3800 MHz) band. These two steps are divided into four basic steps that illustrate the working principle. The evolution of the antenna and the corresponding predicted reflection coefficients are shown in Figures 7 and 8, respectively. Step-1 Step-2 Step-3 Step Step-1 Step-2 Step-3 Step-4
Mid-band
High-band In Step 1, the middle element MNO (inset of Figure 6) is designed and optimized. The effective length of this element is l ILE = l 1 + l 2 + (w 1 + w 2 + w 3 )/2 = 14.2 mm. Step 1 is completed by adding an L-shaped strip OQG with an effective length of w 3 /2 + w 5 + w 7 /2 + l 3 = 26.8 mm to the edge OQ so that the antenna covers the mid (1427-2690 MHz) band. The antenna then resonates at 1.67 GHz, as shown in Figure 8 (Step 1 curve). The effective length of the antenna (l ILE + 26.8 = 41 mm) is close to a quarter wavelength at 1.67 GHz. In Step 2, an L-shaped strip OUH with a length of w 3 /2 + w 6 + w 8 /2 + l 4 = 15.7 mm is attached to the edge OU of the feed element, extending the length of the antenna by 29.9 mm. As can be seen in Figure 8 (Step 2 curve), the antenna then resonates at two frequencies, 1.98 and 2.68 GHz, because of the two different electrical paths MNOQG and MNOUH, respectively. In this step, the −6 dB reflection coefficient bandwidth of the antenna in the lower band is 1.35 GHz (1.51-2.86 GHz).
However, the lower-frequency limit needed to be shifted to 1.42 GHz to cover all the LTE mid and LSA bands. To achieve this, a vertical plate of height h 1 is loaded onto the edge GQ in Step 3. The vertical plate shifts the lower frequency limit to 1.41 GHz, with a negligible variation in the upper-frequency limit (2.85 GHz).
Our next target is to cover the high band (3300-3800 MHz), together with the mid band, with the same antenna. To achieve this, an L-shaped element VKL with an effective length of w 2 + l 5 + w 12 + l 6 is introduced into the top of the middle element MN in The current distributions of this antenna at the three frequencies are shown in Figure 9 to illustrate the working modes. For better presentation, the vertical plate is unfolded along the +y-axis. It can be seen in Figure 9a that the current is at a minimum close to G and a maximum close to M, meaning that the antenna resonates in the quarter-wavelength mode at 1.8 GHz. In addition, strong currents can be observed in the arm OUH at 1.8 GHz, meaning that the arm OUH is radiating at this frequency. At 2.6 GHz, the current is at a maximum close to M and there are two minima at H and G, as shown in Figure 9b, which also indicates that the antenna is resonating in the half-wavelength mode. Figure 9c illustrates that the antenna resonates in the quarter-wavelength mode at 3.6 GHz since the current is at a maximum at M and a minimum at edge KL.
Radiation Performance
The predicted antenna efficiency and gain as a function of frequency are shown in Figure 10. The maximum antenna efficiencies in the mid and high bands are 90% and 88%, respectively, and the minimum antenna efficiencies are 62% and 66%, respectively. The realized gain varies between 1.4 and 3.4 dBi in the mid band, and between 4.2 and 6.1 dBi in the high band. The normalized E θ and E φ radiation patterns in the three principal planes at 1.8, 2.6, and 3.6 GHz are shown in Figure 11. The radiation patterns are normalized with respect to the maximum of the corresponding principal plane. The E φ pattern in the x-z plane at 3.6 GHz is more uniform (nearly omnidirectional) than the E φ pattern in the same plane at 1.8 and 2.6 GHz. A uniform E φ pattern can be observed in the y-z plane at 1.8 GHz. Strong E φ radiation can be observed along the y-axis at 3.6 GHz compared to the z-axis. In addition, the E φ pattern is more uniform in the x-y plane at 1.8 GHz than the E φ pattern at 3.6 GHz. The E φ pattern in the x-y plane has two nulls at 3.6 GHz and one null at 2.6 GHz. Overall, the E φ component is always stronger than E θ in the y-z and x-y planes at 1.8 and 2.6 GHz and in the x-z and x-y planes at 3.6 GHz. In addition, the E φ and E θ levels are comparable in the x-z plane at 1.8 and 2.6 GHz and in the y-z plane at 3.6 GHz, an additional benefit of practical applications with complex propagation environments [18,24,26].
x-z plane y-z plane x-y plane Figure 11. Normalized radiation patterns of the dual-band antenna (Ant#2) at 1.8, 2.6, and 3.6 GHz.
Wideband Antenna for LSA Bands and LTE Mid and High Bands
A wideband antenna (Ant#3) is presented in this section. Unlike the previous dualband antenna (Ant#2), this is a wideband antenna covering both the mid and high bands. In addition, Ant#3 is smaller than both Ant#2 and Ant#1. Figure 12 shows the configuration of the novel wideband antenna (Ant#3). The overall size of the antenna is 34 mm × 15 mm × 4 mm or 0.16λ 2 × 0.07λ 2 × 0.02λ 2 , where λ 2 is the free-space wavelength at 1.41 GHz. This indicates that the area occupied by the wideband antenna is 15% and 13% smaller than that occupied by Ant#1 and Ant#2, respectively. The substrate size, ground clearance, positioning of the antenna, feed arrangement, and back view are similar to Ant#1, as shown in Figure 1. Ant#3 is composed of three elements: a U-shaped large element PQOR loaded with an L-shaped vertical plate (aligned with the edge PQ) on the left to cover the mid band, an L-shaped loop element NSTS on the right to cover the high band, and an L-shaped element MNO. It is worth mentioning here that the element MNO is the same as that used in Ant#2. The optimized design parameters of Ant#3 are listed in Table 2. The parameters of the mid-element MNO are presented in Table 1. Table 2. Design parameters of the wideband antenna (Ant#3). All dimensions are in millimeters.
Design Procedure and Working Principle
In this design approach, our target is to design a more compact antenna than the previous two antennas (Ant#1 and Ant#2) and also remove the nulls from the radiation patterns. The four main steps of the evolution of this antenna are shown in Figure 13. The predicted reflection coefficients for each step are shown in Figure 14. Step-1 Step-2 Step-4 Step Step-1 Step-2 Step-3 Step-4 Loop STS with MNO
Mid-band
High-band The working principle of the antenna can be easily described by the design steps. The design of Ant#3 started with a simple planar antenna, where an L-shaped strip UOQP is imposed on the middle element MNO, as shown in Figure 13 (Step 1). This antenna has a −6 dB reflection coefficient bandwidth of 1.58 GHz (1.73-3.31 GHz) and resonated at 2.66 GHz, as shown in Figure 14 (Step 1 curve). Therefore, the antenna is unable to cover the whole LTE mid-band since the lower frequency limit of the LTE mid-band is 1.42 GHz. The effective length of the antenna is l ILE + w 14 /2 + l 9 + w 15 /2 + g 1 + w 16 = 32.7 mm, which is equal to a quarter-wavelength at 2.66 GHz.
In Step 2, an L-shaped bent plate is loaded onto the antenna for tuning the lowerfrequency limit, together with the operating bandwidth. First, an I-shaped vertical plate with a thickness of 0.4 mm is added to the edge PQ, which is aligned with the edge point Q, as shown in Figure 13 (Step-2). The length and height of this vertical plate are l 9 + l 10 and h 2 , respectively. Later, a top plate with a size of l 9 mm × w t mm × 0.4 mm is loaded onto the top of the vertical plate, which is also aligned with the edge point Q, as shown in Figure 13 (Step-2). This antenna resonates at 1.82 GHz and had a −6 dB reflection bandwidth of 1.46 GHz (1.46-2.92 GHz), as shown in Figure 14 (Step-2 curve).
Our next aim is to shift the lower-frequency limit further and generate a second resonant mode in the high band. In Step 3, first, an I-shaped patch OR with a size of (l 11 + l 12 ) × w 16 is coupled to the L-shaped strip UQP, maintaining a gap of g 1 and g 2 along the y-and x-directions, respectively. Second, a triangle-shaped element with a base and height of l 11 and w 17 , respectively, is added to the bottom-right corner of the element OR. At the end of Step 3, a strip with dimensions of g 2 × w 18 is added to the left of the element UQ. The predicted reflection coefficient (Step 3 curve in Figure 14) shows that a second resonance appears at 3.86 GHz, with a dip in magnitude of −13 dB, and the lower-frequency limit shifts from 1.46 to 1.43 GHz. At the second resonance (3.86 GHz), the antenna resonates in the half-wavelength mode since the effective length of the U-slot antenna POR fed by MNO is l ILA + w 14 + 2(l 11 + l 12 + g 2 ) = 39.7 mm. The −6 dB reflection bandwidths in the first and second operating bands are 1.67 GHz (1.43-3.1 GHz) and 300 MHz (3.68-3.98 GHz), respectively. The top plate over the element PQ and coupled element OR not only improves the operating bandwidth but also reduces the nulls in the x-y plane radiation patterns at frequencies close to the upper limit of the LTE mid band. Although it improves the x-y plane radiation pattern nulls within the frequency band of 3.7-4 GHz, there is still room for improvement.
Finally, to expand the reflection bandwidth of the antenna at the second resonance in order to cover the high band and to fine-tune the lower-frequency limit of the mid band, an L-shaped loop NSTS with a strip width of w 23 is integrated into the right side of the middle element in Step 4, as shown in Figure 13. The reflection coefficient curve (Figure 14 (Step 4 curve)) shows that the lower-frequency limit further shifted from 1.43 to 1.41 GHz and the −6 dB reflection coefficient bandwidth of the antenna is 2.59 GHz (1.41-4 GHz) with two resonances at 1.81 and 3.64 GHz. The effective length of the element MNSTS is 41 mm, which is equal to a half-wavelength at 3.65 GHz. The NSTS loop improves the operating bandwidth in the LTE high band and also helps to achieve null-free x-y plane radiation. Now, let us study the reflection coefficient of the L-shaped loop element NSTS excited by the middle element MNO, as shown in Figure 14 (loop STS with MNO curve), in order to further understand the operation of the right-hand element. This antenna resonates at 3.45 GHz, which is close to the half-wavelength mode since the effective length is 41 mm. In this study, the elements on the left side of QOU (Figure 12b) are removed from the design.
The predicted current distributions of this antenna at three frequencies, 1.8, 2.6, and 3.6 GHz, are shown in Figure 15. For better presentation, the vertical L-shaped load is unfolded along the +y axis. It can be seen from Figure 15a that the antenna resonates in the quarter-wavelength mode at 1.8 GHz since only one minimum can be observed (in the vertical plate close to the edge point P). Weak currents can be seen in the loop NSTS at this resonant mode but no nulls is observed. Two minima can be seen (in the vertical plate close to the edge QP and in the upper arms of the loop STS), meaning that the antenna resonates in the half-wavelength mode at 2.6 GHz, as shown in Figure 15b. The current distributions in Figure 15c illustrate that the directions of the currents are the same for the upper and lower arms of the loop STS and a null can be seen at point T. Hence, the loop monopole antenna resonates in the half-wavelength mode at 3.6 GHz. In addition, the left element PQUR has a strong current at 3.6 GHz but no null can be observed.
Measured and Predicted Results
This section presents the measured reflection coefficient, efficiency, gain, and radiation patterns of the wideband antenna (Ant#3), which are compared with the predicted results. The radiation performance of the fabricated antenna was measured using the NSI700S-50 near-field range at the Australian Antenna Measurement Facility, CSIRO, Marsfield, N.S.W., and the reflection coefficients were measured using an Agilent Network Analyzer PNA-X N5242A at Macquarie University, Australia. The top and bottom views of the prototype are shown in Figure 16.
Reflection Coefficient
The measured reflection coefficient of Ant#3 is shown in Figure 17, together with the predicted results. Excellent agreement is observed between the measured and the predicted results. The −6 dB (VSWR < 3) reflection coefficient bandwidth of the prototyped antenna (Ant#3) is 2.63 GHz (1.37-4 GHz), which covers the two LSA, 16 FDD LTE, 11 TDD LTE, UMTS, DCS/GSM1800, PCS/GSM1900, 2.4 GHz WLAN, and 3.3 GHz WiMAX frequency bands.
Radiation Performance
The measured efficiency and gain, together with the predicted results of the wideband antenna (Ant#3), are shown in Figure 18. A gain comparison method was used for the antenna gain measurements. Again, a good agreement between the measured and predicted results is observed. The measured maximum efficiencies of this antenna in the mid and high bands are 96% and 94%, respectively, and the minimum efficiencies are 66% and 79%, respectively. The measured maximum gains within the reflection coefficient bandwidth (VSWR < 3) of this antenna in the mid and high bands are 2.9 and 5.6 dBi, respectively, and the minimum gains are 1.6 and 4.2 dBi, respectively. The measured E θ and E φ radiation patterns in the three principal planes at 1.8, 2.6, and 3.6 GHz are shown in Figure 19 and compared with the predicted results. The radiation patterns are normalized with the maximum value of the corresponding plane. A good agreement between the predicted and measured results is found. At 1.8 and 2.6 GHz, strong E φ radiation is observed in the x-y and y-z planes compared to E θ radiation, and at 3.6 GHz, strong E φ radiation is observed in the x-z and x-y planes compared to E θ radiation. The radiation is nearly omnidirectional in the y-z and x-y planes in the mid band and in the x-z and z-y planes in the high band. In addition, there are no nulls in the radiation patterns of the mid and high bands. In addition, the E θ and E φ levels are comparable in both the x-z plane at the mid-band frequencies and the y-z plane at the high-band frequencies, which makes the antenna suitable for practical applications with complex propagation environments [18,24,26].
x-z plane y-z plane x-y plane
Comparison of Antennas
The properties of the dual-band antenna (Ant#2) and the wideband antenna (Ant#3) proposed in this paper are summarized, together with the LSA antenna (Ant#1), in Table 3. The efficiency of Ant#3 is higher than that of Ant#2 in both the mid and high bands. The gain variations of Ant#3 are 1.3 and 1.4 dB in the mid and high bands, respectively, whereas the variations are 2 and 1.9 dB, respectively, for Ant#2. The radiation patterns in the mid band are nearly omnidirectional for both antennas (Ant#2 and Ant#3). However, in the high band, Ant#2 had nearly omnidirectional radiation patterns with two nulls in the x-y plane radiation patterns. On the other hand, Ant#3 had a nearly omnidirectional pattern in the high band without any nulls. A comparison of the fabricated antenna (Ant#3) and the reference antennas is provided in Table 4 in terms of performance and the area occupied on the substrate to verify the suitability of the proposed antennas for hand-held devices. The comparison in Table 4 shows that Ant#3 has high efficiency and a large bandwidth than most of the reference antennas to cover the mid and high bands while occupying a smaller area. * M and H stand for the mid and high bands, respectively. Area = length × width (mm 2 ). The antenna height is in millimeters.
Conclusions
First, a planar antenna was designed for application in mobile devices. The operating bandwidth of the planar antenna is 1170 MHz (1.38-2.55 GHz), which covers both LSA frequency bands. Then, two novel antennas were designed to cover both LSA bands (1452-1492 and 2300-2400 MHz) and the mid-(1427-2690 MHz) and high-LTE (3300-3800 MHz) bands. Although these antennas have a small vertical plate at the edge of the radiating element, the areas occupied by the dual-band and wideband antennas are 3% and 15% smaller than most of the reference planar antennas. There are nulls in the radiation patterns of the planar antenna and the dual-band antenna. The radiation patterns of the wideband antenna do not have any nulls. Finally, in order to prove the concept, the wideband antenna was fabricated and measured. The measured −6 dB impedance bandwidth of the prototype is 1.37-4 GHz, which covers all the targeted frequency bands.
|
Talk:British Champions Sprint Stakes
Red links
The following red links have been excluded from this article and are placed here for reference. Zafonic (talk) 14:35, 27 August 2012 (UTC)
Horses
Abadan Abergwaun Absalom Acclamation Al Sylah Ampney Princess Arcandy Baron's Pit Bianconi Bold Edge Catrail Chummy's Favourite Combined Operations Cool Jazz Creetown Crystal Castle Diffident Djelal Gordon Lord Byron Great Bear Haatef Hallgate Home Guard Honeyblest Indian King Jack and Jill King Bruce King's Apostle La Belle Lady of the Desert Lucasland Maarek Majority Blue Nice One Clare Pivotal Point Realm Roman Warrior Ron's Victory Rose Coral] Salieri Sammy Davis Sampower Star Satan Sayif Secret Ray Set Fair Shalford Solonaway Song Sovereign Rose Swingtime Zanzibar
Jockeys and trainers
Neville Callaghan Gerald Cottrell Olivier Douieb Alain Falourd Sally Hall Tom Hogan Ryan Jarvis Liam Jones Edward Lynam Peter Makin David Peter Nagle Pip Payne Kevin Prendergast Archie Watson
The same race?
It's questionable whether the earlier winners of this race should be listed with the winners from 2011 onwards - the current British Champions race shares very little in common with the Diadem Stakes apart from the course & distance and time of year. Would it be better to split the two races into separate articles? --Bcp67 (talk) 10:47, 8 April 2015 (UTC)
* I would keep it as one article. As you say it's over the same course and distance and time of year, and despite the increased prize money, attracts very much the same kind of horse. You could do a break in the table after 2010 I suppose. I think that the Champion Stakes has undergone a more radical change, but kept the same name and article title. Tigerboy1966 22:11, 8 April 2015 (UTC)
|
Prompted automatic online payments
ABSTRACT
A system, method and computer program product are disclosed for providing automatic recurring online payments. According to the method, an automatic recurring online payment configuration is received from a user. A notification is sent to the user of a pending automatic payment based on the automatic recurring online payment configuration, and it is determined whether or not to execute the pending automatic payment based on at least one of a response to the notification received from the user and a lack of a response to the notification from the user. In one embodiment, if the response authorizes the pending automatic payment, the pending automatic payment is executed according to the automatic recurring online payment configuration, if the response modifies the pending automatic payment, the pending automatic payment is executed as modified, and if the response cancels the pending automatic payment, the automatic recurring online payment is canceled.
BACKGROUND OF THE INVENTION
1. Field of the Invention
This invention generally relates to the field of online banking and more specifically to automatic online payments.
2. Description of Related Art
Consumers commonly use online banking systems to manage their funds. Online banking systems often provide the user with a method for paying bills electronically, i.e., online payments. Consumers typically have multiple bills that occur repeatedly. For instance, mortgages are typically billed monthly at the same amount. For convenience, many of the current online banking systems provide the ability for consumers to set up automatically recurring electronic payments, i.e., automatic recurring online payments. A user typically provides an amount and an interval for the automatic recurring online payment.
Such automatic payment systems have become important for banks not only as a means for providing enhanced functionality to their customers, but also for reducing their costs. Online payments are less costly to process than traditional payments such as checks. However, many consumers feel that such automatic payment systems require yielding too much control of their funds. Automatic recurring online payments simply happen at a particular date even in the case of special circumstances, such as a lack of funds. Thus, some consumers consider the automatic payment systems risky and do not create automatic recurring online payments. Consumers feel more at risk of mistakenly having insufficient funds in their accounts at the time an automatic recurring online payment is made. The fundamental convenience that automatic recurring online payments offer, that the user can essentially forget about the payments, is also the fundamental barrier to adoption since users are forced to still consider these payments to avoid overdraft.
Additionally, there currently is an automatic payment system located at www.paymybills.com, which is operated by Pay Trust, Inc. This system receives the bills and sends a notification whenever a bill arrives and to allow a user to pay the bill quickly. This system even ensures a user's account balance is sufficient before allowing payment. This system, however, requires that a bill is received in order to prompt a payment of the bill. Thus, this system requires that bills are sent to the automatic payment system in order to prompt a payment of the bill. This reduces privacy and adds cost. Another drawback of this system is that automatic recurring online payments cannot be created and configured by the user.
Therefore a need exists to overcome the problems discussed above, and particularly for a way to more efficiently provide automatic online payments to consumers.
SUMMARY OF THE INVENTION
Briefly, in accordance with the present invention, disclosed is a system, method and computer program product for providing automatic recurring online payments. In a method according to a preferred embodiment of the present invention, an automatic recurring online payment configuration is received from a user. A notification is sent to the user of a pending automatic payment based on the automatic recurring online payment configuration, and it is determined whether or not to execute the pending automatic payment based on a response to the notification received from the user and/or based on a lack of a response to the notification from the user. In one embodiment, if the response authorizes the pending automatic payment, the pending automatic payment is executed according to the automatic recurring online payment configuration, if the response modifies the pending automatic payment, the pending automatic payment is executed as modified, and if the response cancels the pending automatic payment, the automatic recurring online payment is canceled.
Also disclosed is a computer system for providing automatic recurring online payments. In one embodiment, the computer system includes a receiver that receives from a user an automatic recurring online payment configuration, and a transmitter that sends a notification to the user of a pending automatic payment based on the automatic recurring online payment configuration. The computer system also includes a processor that determines whether or not to execute the pending automatic payment based on a response to the notification received from the user and/or based on a lack of a response to the notification from the user.
The foregoing and other features and advantages of the present invention will be apparent from the following more particular description of the preferred embodiments of the invention, as illustrated in the accompanying drawings.
BRIEF DESCRIPTION OF THE DRAWINGS
The subject matter, which is regarded as the invention, is particularly pointed out and distinctly claimed in the claims at the conclusion of the specification. The foregoing and other features and also the advantages of the invention will be apparent from the following detailed description taken in conjunction with the accompanying drawings. Additionally, the left-most digit of a reference number identifies the drawing in which the reference number first appears.
FIG. 1 is a block diagram illustrating the overall system architecture of one embodiment of the present invention.
FIG. 2 is a flowchart depicting the overall operation and control flow of a conventional automatic online payment system.
FIG. 3 is a flowchart depicting the overall operation and control flow of one embodiment of the present invention.
FIG. 4 is a flowchart depicting the operation and control flow of the verification process of one embodiment of the present invention.
FIG. 5 is a screenshot of an exemplary user interface for configuring a recurring automatic online payment.
FIG. 6 is a screenshot of an exemplary user interface for viewing a notification of a recurring automatic online payment.
FIG. 7 is a block diagram of a computer system useful for implementing the present invention.
DESCRIPTION OF THE PREFERRED EMBODIMENTS
1. Introduction
The present invention, according to a preferred embodiment, overcomes problems with the prior art by providing an efficient and easy-to-implement method for providing prompted automatic recurring online payments.
In the automatic recurring online payment process of the preferred embodiment, instead of immediately sending a payment when it is scheduled to be sent an electronic notification (such as an email, voice mail, text message, instant message or the like) is first sent asking for confirmation or verification of the payment. When a user sees the notification, a payment can be verified or canceled by, for example, logging onto the banking system and issuing a command.
One advantage of the present invention is the convenience of having the banking system remember recurring payments each month. Another advantage of the present invention is that control is maintained by the user as well. The user can easily cancel or verify a payment. The system of the present invention can be set up so that a payment is either automatically canceled or automatically verified if no response is received from the user after a predetermined time has passed.
The preferred embodiment of the present invention can be implemented by adding the option of verification to current online banking payment systems. Present online banking payment systems may, for example, add the functionality of sending to a user an email notification with a link to a payment confirmation Web page. The user can then visit the Web page to confirm the payment. Proper authentication would be required before the user authorizes the payment. In another example, the user may send an encrypted reply to the notification email wherein the reply specifies confirmation or cancellation of the payment for the given month. The response to the notification preferably may also modify the payment amount for the given month.
In one embodiment of the present invention, a user, or payer, can set up a recurring automatic online payment to a payee, where the payer is prompted for approval each time a payment is to be sent to the payee as part of the recurring payment. The recurring automatic online payment can include, for example, an amount to pay and an interval between each payment. Instead of sending the payment immediately to the payee when the interval for a payment is reached, a notification is sent to the payer for the pending payment. The payer has the option of canceling the pending payment, allowing it to proceed or modifying it.
In one embodiment of the present invention, the user creates a recurring automatic online payment via a user interface such as a Web browser or an automated voice response system. The user is prompted to provide information pertaining to the payee. This information may come from a database of payee information, may be automatically determined by having received a bill creation request from a payee, or may be manually input by the payer. The user is also prompted for the amount of each recurring automatic online payment.
In one alternative, the recurring automatic online payment information may be automatically determined by having received a bill creation request from a payee. The payment amount may adjust between actual payments of the recurring payment order. The user is also prompted for the time interval between each payment. This time interval may be entered manually or may be automatically determined via a bill creation request. The user submits this information as well as any other information that may be needed to complete a payment (such as passwords and account numbers). This information is submitted into a database of recurring payments for the user. The system then actively waits for the time interval to pass.
When the interval has passed and it comes time to make a recurring automatic online payment, the user is sent a notification of imminent payment. This notification can be sent using a bi-directional communication medium, such as email, such that the payer may respond to the notification with instructions to either proceed with the payment, suspend the payment, modify the payment or cancel the payment all together. In one alternative, the user may respond with a variety of instructions such as moving money between accounts, delaying the payment, modifying the amount of the payment, etc.
In one example, the present invention may send a notification via email, which contains a URL (Uniform Resource Locator). This URL leads the user, via a Web browser, to a web page where the user may, after supplying security credentials, perform the appropriate actions to allow, cancel, suspend or modify the payment. In another example, the user may reply to the notification email message and indicate his instructions in the reply text of the email. Authentication in such an implementation can be done using digital signatures.
2. Overview of the System
FIG. 1 is a block diagram illustrating the overall system architecture of one embodiment of the present invention. FIG. 1 shows client computers 102 and 104 operated by users. FIG. 1 also shows bank server 108, which provides banking services to the client computers 102 and 104 over a network 106. A recurring payment module 110, which resides within the bank server 108 and is described in greater detail below, encompasses the functions of processing and executing recurring automatic online payments. The bank server 108 comprises any commercially available server system that allows client computers 102 and 104 to exist in a client-server relationship with the bank server 108.
In one embodiment of the present invention, the computer systems of client computers 102 and 104 and bank server 108 are one or more Personal Computers (PCs) (e.g., IBM or compatible PC workstations running the Microsoft Windows operating system, Macintosh computers running the Mac OS operating system, or equivalent), Personal Digital Assistants (PDAs), hand held computers, palm top computers, smart phones, game consoles or any other information processing devices. In another embodiment, the computer systems of at least one of client computers 102 and 104 and bank server 108 are a server system (e.g., SUN Ultra workstations running the SunOS operating system or IBM RS/6000 workstations and servers running the AIX operating system). In one embodiment of the present invention, the network 106 is a circuit switched network, such as the Public Service Telephone Network (PSTN). In another embodiment, the network is a packet switched network. The packet switched network is a wide area network (WAN), such as the global Internet, a private WAN, a local area network (LAN), a telecommunications network or any combination of the above-mentioned networks. In yet another embodiment, the network is a wired network, a wireless network, a broadcast network or a point-to-point network.
Although bank server 108 and recurring payment module 110 are shown as integrated entities in FIG. 1, the functions of both entities may be separated among more than one entity. Further, although FIG. 1 shows two client computers 102 and 104, the present invention supports any number of client computers.
3. The Conventional Process
FIG. 2 is a flowchart depicting the overall operation and control flow of a conventional automatic online payment system. The operation and control flow of FIG. 2 depicts the overall processes of a conventional automatic online payment system as it processes and executes a recurring automatic online payment. The operation and control flow of FIG. 2 begins with step 202 and proceeds directly to step 204.
In step 204, a user utilizing a client computer, such as client computer 102, sets up or configures an automatic recurring online payment. Configuring an automatic recurring online payment includes providing a set of information pertaining to the automatic recurring online payment, such as a monetary amount, a source account of the payment, a recipient or payee of the payment, a date of the payment, a time interval between payments, and a monthly date for the payment.
In step 206, a predetermined time interval, such as a day or a week, is allowed to pass. In step 208, it is determined whether the current date is an appropriate date for executing the automatic recurring online payment that was configured in step 204. If the current date is an appropriate date for executing the automatic recurring online payment that was configured in step 204, then control flows to step 210. If the current date is not an appropriate date for executing the automatic recurring online payment, then control flows back to step 206 where another time interval is allowed to pass before step 208 is executed again. In step 210, the bank server executes the automatic recurring online payment that was configured in step 204. Consequently, control flows back to step 206 where another time interval is allowed to pass before step 208 is executed again.
4. Prompted Automatic Payments
FIG. 3 is a flowchart depicting the overall operation and control flow of one embodiment of the present invention. The operation and control flow of FIG. 3 begins with step 302 and proceeds directly to step 304.
In step 304, a user utilizing a client computer, such as client computer 102, sets up or configures an automatic recurring online payment with the bank server 108. Configuring an automatic recurring online payment includes providing a set of information pertaining to the automatic recurring online payment, such as a monetary amount, a source account of the payment, a recipient or payee of the payment, a date of the payment, a time interval between payments, and a monthly date for the payment.
The user may accomplish the task of configuring an automatic recurring online payment in a variety of ways. One way of accomplishing this task is for the user to interact with a user interface of the bank server 108, such as through a Web browser. A Web browser configured for this task is described in more detail with reference to FIG. 5. Another way of accomplishing this task is for the user to send the automatic recurring online payment to the bank server 108 via email or another method.
Alternatively, the task of configuring an automatic recurring online payment can be performed by sending the automatic recurring online payment information to the bank server 108 in a variety of ways including email, instant messaging, File Transfer Protocol (FTP), Hypertext Transfer Protocol (HTTP) or any other method for sending and receiving information over a network. In another alternative, the information is sent over a connection between the client computer 102 and the bank server 108. Such a connection can be a Virtual Private Network (VPN) connection, a Transfer Control Protocol/Internet Protocol (TCP/IP) connection or any other network connection.
In addition to configuring an automatic recurring online payment, in step 204, the user may also configure other aspects of the payment system. For example, the user may configure the manner in which to notify the user (e.g., via email, instant message, telephone message or text message), how many days before the scheduled payment the notification should be sent out, how long to wait for a response from the user and the default action that should be taken if the user does not respond (e.g., cancel the payment, suspend the payment for a certain number of payments, make the payment or make the payment only if there are sufficient funds to cover the payment).
In step 306, a predetermined time interval, such as a day or a week, is allowed to pass. In step 308, it is determined whether the current date is an appropriate date for executing the automatic recurring online payment that was configured in step 304. If the current date is an appropriate date for executing the automatic recurring online payment that was configured in step 304, then control flows to step 310. If the current date is not an appropriate date for executing the automatic recurring online payment, then control flows back to step 306 where another time interval is allowed to pass before step 308 is executed again.
In step 310, the bank server 108 sends a notification of the automatic recurring online payment to the user. As explained above, the notification may be an email, an instant message, a telephone message or a text message. The notification may include a variety of information such as a current account balance, an amount of the payment, a source account of the payment, a recipient of the payment and a date of the payment. The notification may also include an explanation of how the user may respond to the notification. The notification may include, for example, a URL that links the user to the Web page where the user may authorize, cancel, suspend or modify the payment.
In one alternative, the notification sent to the user can be protected cryptographically. For example, the notification can be encrypted by the bank server 108 or digitally signed by the bank server 108. This ensures that the notification received by the user is genuine.
In step 312, the bank server 108 determines how to proceed with the automatic recurring online payment based on the user's response to the notification. The user preferably may respond in a variety of ways, including via email, an instant message, a telephone message, a text message or by interacting with a user interface such as a Web page of the bank server 108. The user may authorize, cancel, suspend or modify the payment via a response (or lack of response) to the notification. In step 314, the bank server 108 executes or does not execute the automatic recurring online payment that was configured in step 304 based on the user's response to the notification. Consequently, control flows back to step 306 where another time interval is allowed to pass before step 308 is executed again. The functions of steps 312 and 314 will now be described in greater detail with reference to FIG. 4.
FIG. 4 is a flowchart depicting the operation and control flow of the verification process of one embodiment of the present invention. The operation and control flow of FIG. 4 provides more detail of the functions of steps 312 and 314 of FIG. 3.
In step 404, the bank server 108 determines whether the current automatic recurring online payment has already been suspended. This may have occurred when the user suspended the automatic recurring online payment for a certain number of payments in a response to a previous notification. If the current automatic recurring online payment has already been suspended, then control flows to step 424. If the current automatic recurring online payment has not been suspended, then control flows to step 406.
In step 406, the bank 108 determines whether the client has responded to the notification. As explained above, preferably the user may respond to a notification via email, an instant message, a telephone message, a text message or by interacting with a user interface such as a Web page of the bank server 108. In one alternative, the user's response can be protected cryptographically. For example, the user's response can be encrypted by the user or digitally signed by the user. This ensures that the user's response received by the bank 108 is genuine.
The user may authorize, cancel, suspend or modify the payment via the response or lack of response to the notification. If the user authorizes the payment, then control flows to step 408. If the user modifies the payment, then control flows to step 410. If the user suspends the payment, then control flows to step 412. If the user cancels the payment, then control flows to step 414.
In step 408, the user has authorized the payment, and thus in step 416 the bank server 108 executes the current automatic recurring online payment as originally planned. In step 410, the user has modified the payment. Preferably, the user may modify any information pertaining to an automatic recurring online payment including a monetary amount of the payment, a source account of the payment, a recipient or payee of the payment, a date of the payment, a time interval between payments, and a monthly date for the payment. In step 418, the bank server 108 executes the current automatic recurring online payment as modified by the user.
In step 412, the user has suspended the payment, and thus in step 420 the bank server 108 suspends the current automatic recurring online payment for one or more intervals, depending on what the user has specified. In step 414, the user has canceled the payment, and thus in step 422 the bank 108 cancels the current automatic recurring online payment. In step 424, the control flow of FIG. 4 stops.
5. Exemplary Web Implementation
FIG. 5 is a screenshot of an exemplary user interface for configuring a recurring automatic online payment. FIG. 5 shows a user interface 500 consisting of a Web browser for viewing a Web page identified by the URL 502, wherein the Web page allows a user to configure a recurring automatic online payment. The Web page is located at the Web site of the bank server 108 and viewing of the Web page can be encrypted using, for example, Secure Socket Layer. This ensures that the user's bank account information is secure.
The Web page includes a drop down menu 504 (or alternatively a text box) for identifying the name of the payee that the user wishes to pay. Also shown is a text field 506 for identifying the payee's account number for the user Text box 508 allows the user to enter the amount to pay. Drop down menus 510 and 512 allow the user to specify how often the payment will occur. Checkbox 514 allows a user to specify whether to be notified of the recurring automatic online payment before it occurs. Text field 516 allows the user to specify how many days before the payment to be notified. The user can specify an email notification with checkbox 518 and specify the email address in text field 520. The user can specify a telephone notification with checkbox 522 and specify the telephone number in text field 524. The user can specify a text message notification with checkbox 526 and specify the address in text field 528.
In text field 530, the user can specify how many days to wait before a default action is taken due to a lack of response by the user to the notification. If checkbox 532 is selected, then the recurring automatic online payment is executed as the default action. If checkbox 534 is selected, then the recurring automatic online payment is executed as the default action only if there are sufficient funds in the user's bank account. If checkbox 536 is selected, then the recurring automatic online payment is not executed as the default action.
A submit button 538 is displayed to allow the user to submit the information in the Web page and create a recurring automatic online payment. A reset button 540 allows the user to clear the information in the Web page and start anew.
FIG. 6 is a screenshot of an exemplary user interface for viewing a notification of a recurring automatic online payment. FIG. 6 shows a user interface 600 consisting of a window for viewing an email notification regarding a recurring automatic online payment that was sent by the bank server 108. In one alternative, the email viewed in FIG. 6 is protected cryptographically. For example, the email can be encrypted by the bank server 108 or digitally signed by the bank server 108. This ensures that the email received by the user is genuine.
FIG. 6 shows a short message 602 reminding the user about a recurring automatic online payment that was previously configured. Also included in the email is a URL 604 that links the user to a Web page where the user may authorize, cancel, suspend or modify the payment. This is described in greater detail above. FIG. 6 further shows a short message 606 whereby the user is told the default action of the bank server 108 if a response is not received form the user within a specified period of time. Also included is the name of the payee 608, the user's current account balance 610 and the amount of the payment 612. Optionally, also shown is a short message 614 that indicates that the user's current account balance is not sufficient to cover the payment amount 612.
6. Exemplary Implementations
The present invention can be realized in hardware, software, or a combination of hardware and software. A system according to a preferred embodiment of the present invention can be realized in a centralized fashion in one computer system, or in a distributed fashion where different elements are spread across several interconnected computer systems. Any kind of computer system—or other apparatus adapted for carrying out the methods described herein—is suited. A typical combination of hardware and software could be a general-purpose computer system with a computer program that, when being loaded and executed, controls the computer system such that it carries out the methods described herein.
An embodiment of the present invention can also be embedded in a computer program product, which comprises all the features enabling the implementation of the methods described herein, and which—when loaded in a computer system—is able to carry out these methods. Computer program means or computer program as used in the present invention indicates any expression, in any language, code or notation, of a set of instructions intended to cause a system having an information processing capability to perform a particular function either directly or after either or both of the following a) conversion to another language, code or, notation; and b) reproduction in a different material form.
A computer system may include, inter alia, one or more computers and at least a computer program product on a computer readable medium, allowing a computer system, to read data, instructions, messages or message packets, and other computer readable information from the computer readable medium. The computer readable medium may include non-volatile memory, such as ROM, Flash memory, Disk drive memory, CD-ROM, and other permanent storage. Additionally, a computer readable medium may include, for example, volatile storage such as RAM, buffers, cache memory, and network circuits. Furthermore, the computer readable medium may comprise computer readable information in a transitory state medium such as a network link and/or a network interface, including a wired network or a wireless network, that allow a computer system to read such computer readable information.
FIG. 7 is a block diagram of a computer system useful for implementing an embodiment of the present invention. The computer system of FIG. 7 includes one or more processors, such as processor 704. The processor 704 is connected to a communication infrastructure 702 (e.g., a communications bus, cross-over bar, or network). Various software embodiments are described in terms of this exemplary computer system. After reading this description, it will become apparent to a person of ordinary skill in the relevant art(s) how to implement the invention using other computer systems and/or computer architectures.
The computer system can include a display interface 708 that forwards graphics, text, and other data from the communication infrastructure 702 (or from a frame buffer not shown) for display on the display unit 710. The computer system also includes a main memory 706, preferably random access memory (RAM), and may also include a secondary memory 712. The secondary memory 712 may include, for example, a hard disk drive 714 and/or a removable storage drive 716, representing a floppy disk drive, a magnetic tape drive, an optical disk drive, etc. The removable storage drive 716 reads from and/or writes to a removable storage unit 718 in a manner well known to those having ordinary skill in the art. Removable storage unit 718, represents, for example, a floppy disk, magnetic tape, optical disk, etc. which is read by and written to by removable storage drive 716. As will be appreciated, the removable storage unit 718 includes a computer usable storage medium having stored therein computer software and/or data.
In alternative embodiments, the secondary memory 712 may include other similar means for allowing computer programs or other instructions to be loaded into the computer system. Such means may include, for example, a removable storage unit 722 and an interface 720. Examples of such may include a program cartridge and cartridge interface (such as that found in video game devices), a removable memory chip (such as an EPROM, or PROM) and associated socket, and other removable storage units 722 and interfaces 720 which allow software and data to be transferred from the removable storage unit 722 to the computer system.
The computer system may also include a communications interface 724. Communications interface 724 allows software and data to be transferred between the computer system and external devices. Examples of communications interface 724 may include a modem, a network interface (such as an Ethernet card), a communications port, a PCMCIA slot and card, etc. Software and data transferred via communications interface 724 are in the form of signals which may be, for example, electronic, electromagnetic, optical, or other signals capable of being received by communications interface 724. These signals are provided to communications interface 724 via a communications path (i.e., channel) 726. This channel 726 carries signals and may be implemented using wire or cable, fiber optics, a phone line, a cellular phone link, an RF link, and/or other communications channels.
In this document, the terms “computer program medium,” “computer usable medium,” and “computer readable medium” are used to generally refer to media such as main memory 706 and secondary memory 712, removable storage drive 716, a hard disk installed in hard disk drive 714, and signals. These computer program products are means for providing software to the computer system. The computer readable medium allows the computer system to read data, instructions, messages or message packets, and other computer readable information from the computer readable medium. The computer readable medium, for example, may include non-volatile memory, such as Floppy, ROM, Flash memory, Disk drive memory, CD-ROM, and other permanent storage. It is useful, for example, for transporting information, such as data and computer instructions, between computer systems. Furthermore, the computer readable medium may comprise computer readable information in a transitory state medium such as a network link and/or a network interface, including a wired network or a wireless network, that allow a computer to read such computer readable information.
Computer programs (also called computer control logic) are stored in main memory 706 and/or secondary memory 712. Computer programs may also be received via communications interface 724. Such computer programs, when executed, enable the computer system to perform the features of the present invention as discussed herein. In particular, the computer programs, when executed, enable the processor 704 to perform the features of the computer system. Accordingly, such computer programs represent controllers of the computer system.
Although specific embodiments of the invention have been disclosed, those having ordinary skill in the art will understand that changes can be made to the specific embodiments without departing from the spirit and scope of the invention. The scope of the invention is not to be restricted, therefore, to the specific embodiments. Furthermore, it is intended that the appended claims cover any and all such applications, modifications, and embodiments within the scope of the present invention.
1. A method for providing automatic recurring online payments, the method comprising the steps of: receiving, from a user, an automatic recurring online payment configuration; sending a notification to the user of a pending automatic payment based on the automatic recurring online payment configuration; and determining whether or not to execute the pending automatic payment based on at least one of a response to the notification received from the user and a lack of a response to the notification from the user.
2. The method of claim 1, wherein the automatic recurring online payment configuration includes a source account for the automatic recurring online payment, a recipient of the automatic recurring online payment, and at least one payment date.
3. The method of claim 1, wherein the notification comprises at least one of an email message and an instant message.
4. The method of claim 1, wherein the determining step comprises the sub-steps of: receiving the response to the notification from the user; and if the response from the user authorizes the pending automatic payment, executing the pending automatic payment according to the automatic recurring online payment configuration.
5. The method of claim 4, wherein the determining step further comprises the sub-step of: if the response from the user modifies the pending automatic payment, executing the pending automatic payment as modified.
6. The method of claim 4, wherein the determining step further comprises the sub-step of: if the response from the user suspends the pending automatic payment, suspending the pending automatic payment.
7. The method of claim 4, wherein the determining step further comprises the sub-step of: if the response from the user cancels the pending automatic payment, canceling the automatic recurring online payment.
8. The method of claim 1, wherein in the determining step, if a response to the notification is not received from the user, it is determined to execute the pending automatic payment.
9. The method of claim 1, wherein in the determining step, if a response to the notification is not received from the user, it is determined to suspend the pending automatic payment or cancel the automatic recurring online payment.
10. A computer program product for providing an automatic online payment, the computer program product comprising: a storage medium readable by a processing circuit and storing instructions for execution by the processing circuit for performing a method comprising the steps of: receiving, from a user, an automatic recurring online payment configuration; sending a notification to the user of a pending automatic payment based on the automatic recurring online payment configuration; and determining whether or not to execute the pending automatic payment based on at least one of a response to the notification received from the user and a lack of a response to the notification from the user.
11. The computer program product of claim 10, wherein the notification comprises at least one of an email message and an instant message.
12. The computer program product of claim 10, wherein the determining step comprises the sub-steps of: receiving the response to the notification from the user; and if the response from the user authorizes the pending automatic payment, executing the pending automatic payment according to the automatic recurring online payment configuration.
13. The computer program product of claim 12, wherein the determining step further comprises the sub-step of: if the response from the user modifies the pending automatic payment, executing the pending automatic payment as modified.
14. The computer program product of claim 12, wherein the determining step further comprises the sub-steps of: if the response from the user suspends the pending automatic payment, suspending the pending automatic payment; and if the response from the user cancels the pending automatic payment, canceling the automatic recurring online payment.
15. The computer program product of claim 10, wherein in the determining step, if a response to the notification is not received from the user, it is determined to execute the pending automatic payment.
16. The computer program product of claim 10, wherein in the determining step, if a response to the notification is not received from the user, it is determined to suspend the pending automatic payment or cancel the automatic recurring online payment.
17. A computer system for providing automatic recurring online payments, the computer system comprising: a receiver receiving, from a user, an automatic recurring online payment configuration; a transmitter sending a notification to the user of a pending automatic payment based on the automatic recurring online payment configuration; and a processor determining whether or not to execute the pending automatic payment based on at least one of a response to the notification received from the user and a lack of a response to the notification from the user.
18. The computer system of claim 17, wherein the response to the notification is received from the user, and if the response from the user authorizes the pending automatic payment, the processor executes the pending automatic payment according to the automatic recurring online payment configuration.
19. The computer system of claim 18, wherein if the response from the user modifies the pending automatic payment, the processor executes the pending automatic payment as modified.
20. The computer system of claim 18, wherein if the response from the user suspends the pending automatic payment, the processor suspends the pending automatic payment, and if the response from the user cancels the pending automatic payment, the processor cancels the automatic recurring online payment.
|
User talk:<IP_ADDRESS>
{| id="w" width="100%" style="background: transparent; "
Welcome to the wiki!
Here are some links that you may find helpful:
* The forums are a good place to ask any questions you may have, or start your own discussion.
We hope you enjoy editing here, and look forward to seeing you around!
* -- KATANAGOD (Talk) 11:03, July 24, 2012
* }
|
CXF + SSL + WebLogic 9.10
I im developing a web application, its a servlet which basically acts as a front end for a web service, im using CXF for the web service client, the application is running on a WebLogic 9.10 server, every thing was working ok until the project owner decided to add ssl supprt, no big problem, since im using cxf whitout spring, i managed to configure the TLS parameters in the http conduit of the service client,also configured a keystore whit the server key, ca root certificate and a client certificate, tested under a development tomcat instance and worked fine.
Problems started when redeployed the app to the weblogic server again and started getting weird errors, first one was:
java.lang.ClassCastException: com.sun.xml.ws.client.sei.SEIStub cannot be cast to org.apache.cxf.frontend.ClientProxy
at org.apache.cxf.frontend.ClientProxy.getClient
then i realized than weblogic was loading its own implementation of JAX-WS, ok no probelm, just added a weblogic.xml whit "prefer-web-inf-classes" set to true, redeployed and now i got this exception:
java.lang.LinkageError: loader constraint violation: when resolving method "javax.xml.ws.Service.<init>(Ljava/net/URL;Ljavax/xml/namespace/QName;)V" the class loader (instance of weblogic/utils/classloaders/ChangeAwareClassLoader) of the current class, com/adinfi/imgsvc/cm/service/CMBGenericWebServiceService, and the class loader (instance of <bootloader>) for resolved class, javax/xml/ws/Service, have different Class objects for the type javax/xml/namespace/QName used in the signature
That one got me, i thought something was wrong whit the class path,so i started removing jars from the application and still got some more linkage errors, last one i got is this:
java.lang.LinkageError: loader constraint violation: loader (instance of <bootloader>) previously initiated loading for a different type with name "org/w3c/dom/UserDataHandler"
and this is how the "Web-Inf/lib/" directory of my application looks like now:
classes12.jar
classes12.zip
common.jar
common.resources.jar
commons-beanutils-1.8.0.jar
commons-discovery.jar
commons-logging-1.1.1.jar
commons-logging-api.jar
commons-logging-api-1.1.1.jar
cxf-2.2.5.jar
log4j-1.2.8.jar
ras.jar
runtimefw.jar
wsdl4j-1.6.2.jar
wss4j-1.5.8.jar
xalan-2.7.1.jar
xml-resolver-1.2.jar
XmlSchema-1.4.5.jar
xmlsec-1.4.3.jar
Any idea what im doing wrong? thanks in advance
Rollback the prefer-web-inf-classes stuff and follow the WebLogic specific instructions from the Application Server Specific Configuration Guide of CXF's documentation.
More precisely, provide a weblogic-application.xml as explained in the second option Pack war in an ear, deploy the ear with weblogic-application.xml with the following content:
<?xml version="1.0" encoding="UTF-8"?>
<weblogic-application xmlns="http://www.bea.com/ns/weblogic/90">
<application-param>
<param-name>webapp.encoding.default</param-name>
<param-value>UTF-8</param-value>
</application-param>
<prefer-application-packages>
<package-name>javax.jws.*</package-name>
</prefer-application-packages>
</weblogic-application>
Follow the additional steps of this post if required.
Wow somehow managed to miss that piece of documentation....right now im off to my work, will try immediately, thanks for reply =)
I am not sure to remember how I solved it.
I think the issue disappeared after removing the import of stax-api in my pom.xml file.
More precisely, in my case I had to exclude it from poi-ooxml.
<dependency>
<groupId>org.apache.poi</groupId>
<artifactId>poi-ooxml</artifactId>
<version>3.9</version>
<exclusions>
<exclusion>
<groupId>stax</groupId>
<artifactId>stax-api</artifactId>
</exclusion>
</exclusions>
</dependency>
|
[Federal Register Volume 67, Number 69 (Wednesday, April 10, 2002)]
[Pages 17458-17459]
[FR Doc No: 02-8634]
-----------------------------------------------------------------------
DEPARTMENT OF THE INTERIOR
National Park Service
National Register of Historic Places; Notification of Pending
Nominations
Nominations for the following properties being considered for
listing in the National Register were received by the National Park
Service before March 30, 2002. Pursuant to section 60.13 of 36 CFR part
60 written comments concerning the significance of these properties
under the National Register criteria for evaluation may be forwarded by
United States Postal Service, to the National Register of Historic
Places, National Park Service, 1849 C St., NW., NC400, Washington, DC
20240; by all other carriers, National Register of Historic Places,
National Park Service, 800 N. Capitol St., NW., Suite 400, Washington
DC 20002; or by fax, 202-343-1836 . Written or faxed comments should be
submitted by April 25, 2002.
Patrick Andrus,
Acting Keeper of the National Register of Historic Places.
GEORGIA
Cobb County
Bethel AME Church, 4683 Bell St., Acworth, 02000453
Early County
Blakely Court Square Historic District, Bounded by Powell St., Smith
Ave., and Church and Bay Sts., Blakely, 02000452
Worth County
Sylvester Commercial Historic District (Boundary Increase), Approx.
the jct. of Main St., and Liberty St., Sylvester, 02000454
ILLINOIS
Douglas County
Arcola Carnegie Public Library, (Illinois Carnegie Libraries MPS)
407 E. Main St., Arcola, 02000459
Edgar County
Paris Carnegie Public Library, (Illinois Carnegie Libraries MPS) 207
S. Main St., Paris, 02000464
Ford County
Paxton Carnegie Public Library, (Illinois Carnegie Libraries MPS)
254 S. Market St., Paxton, 02000463
Franklin County
West Frankfort City Hall, 108 N. Emma St., West Frankfort, 02000460
Jackson County
Illinois Central Railroad Passenger Depot, 111 S. Illinois Ave,
Carbondale, 02000457
Macon County
Roosevelt Junior High School, 701 W. Grand Ave., Decatur, 02000462
Sangamon County
Route 66 by Carpenter Park, (Route 66 through Illinois MPS) Old
Route 66 bet. Cabin Smoke Trail and N bank of the Sangamon R.,
Springfield, 02000461
Vermilion County
Hoopeston Carnegie Public Library, (Illinois Carnegie Libraries MPS)
110 N. Fourth St., Hoopeston, 02000458
IOWA
Linn County
Perkins, Charles W. and Nellie, House, 1228 3rd Ave., SE, Cedar
Rapids, 02000456
Pottawattamie County
100 Block of West Broadway Historic District, W. Broadway, First
St., and Fourth St., Council Bluffs, 02000455
LOUISIANA
Orleans Parish
South Lakeview Historic District, Bounded roughly by Navarre St.,
Gen. Diaz, Weiblen and Hawthorne Pl., New Orleans, 02000465
MISSOURI
Gentry County
Opera Hall Block, 101-03 W. Vermont/101-03 S. Connecticut, King
City, 02000472
Jackson County
Faultless Starch Company Building, (Railroad Related Historic
Commercial and Industrial Resources in Kansas City, Missouri MPS)
1025 W. 8th St., Kansas City, 02000470
Sewall Paint and Glass Company Building, (Railroad Related Historic
Commercial and Industrial Resources in Kansas City, Missouri MPS)
1009-1013 W. 8th St., Kansas City, 02000469
St. Louis Independent city Eastman Kodak Building, 1009 Olive St.,
St. Louis (Independent City), 02000468
Kulage, Otto, House, 1904 E. College Ave., St. Louis (Independent
City), 02000467
Miltenberger, Eugene and Mary A., House, 3218 Osceola St., St. Louis
(Independent City), 02000471
West Pine--Laclede Historic District, Roughly bounded by Euclid,
Lindell, Sarah and Forest Park Parkway, St. Louis (Independent
City), 02000466
NEW YORK
Nassau County
Jericho Friends Meeting House Complex, 6 Old Jericho Turnpike,
Jericho, 02000473
NORTH DAKOTA
Stutsman County
Franklin School, 308 Second St., SW., Jamestown, 02000474
PENNSYLVANIA
Bucks County
Willow Mill Complex, 570, 559, and 569 Bustleton Pike, Richboro,
02000476
Lancaster County
Evans, Ann Cunningham, House, 6132 Twenty-eighth Division Hwy.,
Caernarvon, 02000475
SOUTH CAROLINA
Richland County
Elmwood Park Historic District (Boundary Increase), 2113 Park St.,
Columbia, 02000477
A request for a MOVE has been made for the following resource:
COLORADO
Grand County
Timber Creek Road Camp Barn (Rocky Mountain National Park MRA),
Timber Creek Rd., Estes Park vicinity, 87001134
A request for REMOVAL has been made for the following resources:
IOWA
Black Hawk County
Central Hall, University of Northern Iowa campus, Cedar Falls,
84001204
Davis County
Clay Avenue Bridge (Highway Bridges of Iowa MPS), Clay Ave., and
118th St., over intermittent stream, Drakesville vicinity, 98000795
Winneshiek County
Clarksville Diner, 504 Heivly St., Decorah, 93001356
[FR Doc. 02-8634 Filed 4-9-02; 8:45 am]
BILLING CODE 4310-70-P
|
Jose H. BARAHONA, a/k/a Jose Herman Barahona, a/k/a Jose Hernan Barahona, Petitioner, v. Eric H. HOLDER, Jr., Attorney General, Respondent.
No. 11-2046.
United States Court of Appeals, Fourth Circuit.
Argued: May 15, 2012.
Decided: Aug. 13, 2012.
ARGUED: Kristina Michelle Campbell, University of the District of Columbia, Washington, D.C., for Petitioner. Ethan B. Kanter, United States Department of Justice, Washington, D.C., for Respondent. ON BRIEF: Tony West, Assistant Attorney General, Civil Division, Michael P. Lindemann, Chief, National Security Unit, United States Department of Justice, Washington, D.C., for Respondent.
Before TRAXLER, Chief Judge, and KING and WYNN, Circuit Judges.
Petition for review denied by published opinion. Judge KING wrote the majority opinion, in which Chief Judge TRAXLER joined. Judge WYNN wrote a dissenting opinion.
OPINION
KING, Circuit Judge:
Petitioner José H. Barahona, a native and citizen of -El Salvador, petitions this Court for review of the final order of the Board of Immigration Appeals (the “BIA”), dated September 2, 2011, which affirmed his ineligibility for a “special rule” cancellation of removal under section 203 of the Nicaraguan and Central American Relief Act of 1997 (the “NACARA”). Barahona contends that the BIA erred by deeming him ineligible for NACARA relief because he had provided material support to a terrorist organization in the early 1980s by allowing anti-government Salvadoran guerrillas of the so-called “FMLN” (the Frente Farabundo Marti para la Liberción Nacional) the use of the kitchen of his Salvadoran home. As explained below, we reject Barahona’s contentions and deny the petition for review.
I.
A.
Barahona entered the United States illegally in 1985. He filed his first application for asylum in 1987, pursuant to 8 U.S.C. § 1158(a), and it was denied on July 15, 1988. Barahona was then given thirty days to leave the United States. Barahona nevertheless remained in this country and applied again for asylum in 1995. On May 9, 2007, his second asylum application was referred to an immigration judge (“IJ”) for adjudication in removal proceedings. On November 11, 2007, Barahona was arrested in Prince William County, Virginia, and charged with a state felony for maliciously causing “bodily injury to Maria Barahona, his. wife, with the intent to maim, disfigure, disable, or kill.” J.A. 164-65 (citing Va.Code Ann. § 18.2-51.2). On December 11, 2007, Barahona pleaded guilty to a misdemeanor offense of domestic assault and battery, receiving a term of probation.
In December 2007, Barahona’s asylum proceedings were administratively closed for failure to prosecute. His case was recalendared in May 2009 for the resolution of allegations that he was removable under 8 U.S.C. § 1182(a)(6), as an alien present in the United States without lawful admission or parole. During the subsequent IJ proceedings, conducted in late 2009, Barahona was found to be removable, but was accorded an opportunity to apply for a “special rule” cancellation of removal. Such a cancellation of removal is authorized by section 203 of the NACARA, as codified in 8 U.S.C. § 1229b(b), under which the Attorney General is empowered to “cancel removal of ... an alien who is inadmissible or deportable from the United States, if the alien” satisfies certain criteria, including not being either “inadmissible or deportable” under other provisions of the INA. See 8 U.S.C. § 1229b(b), (c)(4). The IJ’s evidentiary hearing was conducted on March 22, 2011, and Barahona was the only witness to present evidence.
B.
Barahona testified before the IJ that he was born in 1960 in the city of Carolina, in the San Miguel department of El Salvador. Prior to the outbreak of violence incident to a twelve-year civil war between the military government of El Salvador and the FMLN guerillas, Barahona worked on a small farm in San Miguel. In about 1984, the FMLN guerillas took control of Carolina, and that seizure gave rise to local violence. Due to the FMLN’s seizure and frequent labor disputes, Barahona was unable to continue working. For nearly a year, the FMLN guerillas took control of Barahona’s home — using it as their needs arose, mainly for preparing food in its kitchen, but occasionally sleeping overnight when the weather was unfavorable.
Barahona confirmed that the FMLN guerillas would arrive at his home and announce that they were going to use the kitchen. He explained that, if he had refused to allow the FMLN access and use of his residence, they would have considered him the enemy. In that event, he would have been given twelve hours to vacate his home city or be killed. Indeed, Barahona’s father and cousin had both been executed by the FMLN guerillas, and his father had not been accorded the option of leaving. From early 1984 until Barahona’s departure for the United States in February 1985, as many as 200 FMLN guerillas used Barahona’s kitchen. They generally utilized the water and cooking facilities of his home, but always brought their own food. On several occasions, Barahona gave the guerrillas directions through the jungle to other locations.
In early 1985, when he was twenty-four years of age, Barahona left El Salvador for this country. In doing so, he travelled by bus through Guatemala and Mexico. Barahona entered the United States in Texas, without being inspected or properly admitted.
C.
After his March 22, 2011 evidentiary hearing, the IJ rendered an oral decision (the “IJ Decision”) denying Barahona’s asylum application. The IJ Decision credited Barahona’s testimony, and found that the criteria for a special rule cancellation were — except for one — entirely satisfied. The sole INA provision underlying the Id’s rejection of the special rule cancellation specifies that an alien is inadmissible if he has engaged in terrorist activity by providing “material support” to a terrorist organization. See 8 U.S.C. § 1182(a)(3)(B)(i)(I). “Terrorist activity” is defined by the INA, and includes committing “an act that [the person] knows, or reasonably should know, affords material support ... to a terrorist organization.” Id. § 1182(a)(3)(B)(iv)(VI)(cc). “Material support” includes providing “a safe house, transportation, communications, funds, transfer of funds or other material financial benefit, false documentation or identification, weapons ..., explosives, or training.” Id. § 1182(a)(3)(B)(iv)(VI) (hereinafter the “Material Support Bar”) (emphasis added).
Acknowledging the difficulty of deciding whether Barahona, in accommodating the FMLN guerrillas, had provided material support to a terrorist organization, the IJ Decision nevertheless ruled against him. In so ruling, the IJ concluded that Barahona, in allowing the FMLN guerrillas to use his kitchen for nearly a year, had provided “material support” under the INA. The IJ accepted the fact that Barahona was under duress when he accommodated the guerrillas, and the IJ recognized that Barahona had no choice but to allow the guerrillas to use his kitchen. The IJ reasoned, however, that there is no exception for duress or involuntariness under the Material Support Bar. As a result, the IJ Decision denied Barahona’s application for a special rule cancellation, and ordered Barahona removed to El Salvador.
D.
Barahona thereafter appealed the IJ Decision to the BIA, asserting three grounds for relief. First, Barahona claimed that allowing the FMLN the use of his kitchen constituted support that was de minimis only, and thus immaterial. Second, he asserted that he was acting under duress and that his support of the FMLN was entirely involuntary. Finally, Barahona contended that the IJ Decision contravened international law. The BIA filed its order on September 2, 2011 (the “BIA Order”), agreeing with the IJ and affirming the IJ Decision.
The BIA Order rejected Barahona’s first contention, finding no error in the IJ’s conclusion that Barahona’s support was material, and agreeing that there is no exception in the Material Support Bar for de minimis activities on behalf of a terrorist organization. Similarly, rejecting Barahona’s second contention, the BIA explained that the Material Support Bar “does not contain any language to support an exception to terrorist support where an alien can establish duress or involuntary contributions, and we decline to find one at this time.” BIA Order 2. Finally, the BIA declined to find a violation of international law. According to the BIA, the INA provides for a discretionary waiver, subject to some limitations, that authorizes the Secretary of State or the Secretary of Homeland Security to grant a waiver of the Bar. See 8 U.S.C. § 1182(d)(3)(A). Such a waiver may apply in instances where removal would violate international law. The BIA recognized, however, that “it is well-established that Congress may enact statutes that conflict with international law.” BIA Order 2. In the end, the BIA Order dismissed Barahona’s appeal.
II.
Where, as here, the BIA has adopted and supplemented the IJ’s decision, we review both rulings. See Cervantes v. Holder, 597 F.3d 229, 232 (4th Cir.2010); see also Kourouma v. Holder, 588 F.3d 234, 239-40 (4th Cir.2009) (“When the BIA and [IJ] both issue decisions in a case, we review both decisions upon appeal.”). Pursuant to section 202(f) of the NACARA, “[a] determination by the Attorney General as to whether an alien satisfies the requirements of [cancellation of removal] is final and shall not be subject to review by any court.” 8 U.S.C. § 1101; see Ixcot v. Holder, 646 F.3d 1202, 1213-14 (9th Cir.2011) (recognizing that court is precluded from reviewing agency’s factual determination that alien is ineligible for special rule cancellation of removal under NACARA). Notwithstanding the foregoing legal principle, a court of appeals has jurisdiction to review constitutional claims and questions of law arising from denials of relief under the NACARA, even though such a court “cannot review discretionary determinations regarding requests for special rule cancellation of removal under NA-CARA, absent legal or constitutional error.” Gonzalez-Ruano v. Holder, 662 F.3d 59, 63 (1st Cir.2011); see 8 U.S.C. § 1252(a)(2)(D). Barahona’s primary contention in this case — that the Material Support Bar excludes involuntary support, or support of a terrorist organization under duress — presents a question of law only, as to which we possess jurisdiction.
III.
In his petition for review, Barahona maintains that his contacts with the FMLN guerrillas do not fall under the Material Support Bar. He asserts that the use of his kitchen by the FMLN guerrillas “occurred under duress, and as such do[es] not rise to the level of providing ‘material support.’ ” Br. of Pet’r 13. Restated, Barahona’s position is that he did not provide material support to the FMLN because he was forced, under threat of execution, to allow the guerrillas to use his kitchen.
Barahona admits that the Material Support Bar is silent on whether voluntariness is a requirement thereof. He asserts, however, that such silence renders the statute ambiguous. Relying on Negusie v. Holder, 555 U.S. 511, 129 S.Ct. 1159, 173 L.Ed.2d 20 (2009), Barahona argues that we must decide whether a lack of voluntariness is relevant to the Material Support Bar determination. If it is relevant, Barahona argues, the fact that his support of the FMLN was provided under duress precludes the Bar from applying to him.
In its Negusie decision, the BIA rejected the claim of an alien that there was a duress exception to the so-called “Persecutor Bar.” See 8 U.S.C. § 1101(a)(42). The Persecutor Bar prevents an alien from obtaining immigration relief if he participated in the persecution of another person. The BIA’s Negusie ruling had relied on an earlier Supreme Court decision, Fedorenko v. United States, 449 U.S. 490, 101 S.Ct. 737, 66 L.Ed.2d 686 (1981), which declined to read an involuntariness exception into the Displaced Persons Act. The result of the BIA’s Negusie ruling was to render inadmissible European refugees after World War II who had served as guards at Nazi concentration camps. The Supreme Court’s Negusie decision was that the BIA had erred in relying on Fedorenko to reject the alien’s asserted duress exception to the Persecutor Bar. That is, the Negusie Court held that “[t]he BIA is not bound to apply the Fedorenko rule that motive and intent are irrelevant to the [Persecutor Bar].” Negusie, 555 U.S. at 522-23, 129 S.Ct. 1159. As a result, the Court reversed the BIA and remanded for further proceedings.
Unlike the situation in Negusie, however, the BIA in this case did not rely on precedent interpreting a different statute when it dismissed Barahona’s appeal. Rather, the BIA carefully examined the Material Support Bar and determined that it “does not contain any language to support an exception to terrorist support where an alien can establish duress or involuntary contributions.” BIA Order 2. Remaining faithful to the statutory scheme, the BIA declined to read such an exception into the Material Support Bar.
Because the issue before us turns on an interpretation of the INA, we must “afford the BIA deference under the familiar Chevron standard.” Midi v. Holder, 566 F.3d 132, 136 (4th Cir.2009) (citing Chevron U.S.A., Inc. v. NRDC, Inc., 467 U.S. 837, 844, 104 S.Ct. 2778, 81 L.Ed.2d 694 (1984)). Under the Chevron standard, “we initially examine the statute’s plain language; if Congress has spoken clearly on the precise question at issue, the statutory language controls. If, however, the statute is silent or ambiguous, we defer to the agency’s interpretation if it is reasonable.” Midi, 566 F.3d at 136-37 (citations omitted).
The Material Support Bar contains no express exception for material support provided to a terrorist organization either involuntarily or under duress. Congress has created, however, a general waiver provision for aliens who are otherwise inadmissible. Under § 1182(d)(3)(A) of Title 8, an alien who is inadmissible may seek approval for admission from the Secretary of State or the Secretary of Homeland Security despite his inadmissibility. A statutory limitation is placed on the use of that waiver, however, in that it may not be extended to an alien who has voluntarily supported terrorist activities. See 8 U.S.C. § 1182(d)(3)(B). Thus, Barahona, or any similarly situated alien who has supported a terrorist organization under duress, possesses an alternative avenue of relief from inadmissibility. Notably, Congress included voluntary support of terrorist activities in its exception to the waiver provision contained in § 1182(d)(3)(B), but made no distinction between voluntary and involuntary conduct in the Material Support Bar. We therefore assume that Congress did not intend to create an involuntariness exception to the Material Support Bar, otherwise the voluntary support exception to the waiver provision would be rendered superfluous. See Bilski v. Kappos, — U.S.-, 130 S.Ct. 3218, 3228, 177 L.Ed.2d 792 (2010) (recognizing “canon against interpreting any statutory provision in a manner that would render another provision superfluous”); Russello v. United States, 464 U.S. 16, 23, 104 S.Ct. 296, 78 L.Ed.2d 17 (1983) (“[WJhere Congress includes particular language in one section of a statute but omits it in another section of the same Act, it is generally presumed that Congress acts intentionally and purposely in the disparate inclusion or exclusion.” (internal quotation marks omitted)).
This proceeding bears several similarities to the recent situation faced by the First Circuit in Gonzalez v. Holder, 673 F.3d 35 (1st Cir.2012). Gonzalez petitioned the court of appeals for review of the BIA’s denial of a special rule cancellation under the NACARA. The BIA had ruled that Gonzalez was barred from NA-CARA relief because he had last entered the United States as a crewman, and section 240A(c) of the INA (the “Crewman Bar”) renders an alien who entered as a crewman ineligible for cancellation of removal. Gonzalez contended in the court of appeals that the Crewman Bar does not apply to an alien who has established eligibility for NACARA relief prior to entering this country as a crewman. As relevant here, the First Circuit declined to read into the Crewman Bar any such exception, holding that “the statute simply does not contain any exceptions.... We cannot rewrite the statute.” Gonzalez, 673 F.3d at 40.
Put simply, the terms of the Material Support Bar encompass both voluntary and involuntary support and, like those of the Crewman Bar, fail to provide for the exception under which Barahona seeks relief. See De Osorio v. INS, 10 F.3d 1034, 1042-43 (4th Cir.1993) (deferring to BIA’s permissible statutory construction where statute was silent with respect to exception to “Aggravated Felony Bar”). Moreover, Congress has vested discretionary waiver authority in the Secretary of State and the Secretary of Homeland Security for an alien who has provided material support, but has excepted from such a waiver those who voluntarily provided material support. By excepting only voluntary supporters from the waiver authorization, Congress has created an alternative avenue of relief for an alien who is inadmissible because he involuntarily provided material support to a terrorist organization. It was thus reasonable for the BIA, in its decision here, to decline to create an involuntariness exception from the Material Support Bar. We therefore defer to the BIA’s interpretation of the Bar, as we must under Chevron. See Asika v. Ashcroft, 362 F.3d 264, 270 (4th Cir.2004) (recognizing that “we are bound by Chevron to defer to the [BIA’s] construction of the Act so long as it is reasonable”).
In sum, Barahona’s support of the FMLN guerrillas falls under the Material Support Bar and his petition for review must be denied, even though that support was rendered involuntarily and was provided to the FMLN guerrillas under duress — namely, the threat of execution. As such, we recognize that our ruling today could be reasonably viewed as yielding a harsh result. Barahona’s testimony before the IJ, taken at face value and accepted as credible by the IJ, is compelling in many ways. We are constrained in our disposition of this proceeding, however, by the terms of the Material Support Bar and the BIA’s reasonable interpretation thereof. As the First Circuit recently explained, “[w]e cannot rewrite the statute,” see Gonzalez, and the fact that the BIA has reached a seemingly harsh result does not vitiate the clear statutory provisions. If the governing legal principles are to be altered, that obligation rests with the legislative branch of our government, rather than with the judiciary.
IV.
Pursuant to the foregoing, we deny Barahona’s petition for review.
PETITION FOR REVIEW DENIED.
WYNN, Circuit Judge,
dissenting:
Per the majority opinion, Petitioner José Barahona is ineligible for relief from an order of deportation because over twenty-five years ago, during the twelve-year civil war in El Salvador, he was “forced ... under threat of execution, to allow the guerrillas to use his kitchen.” I, however, would hold that this passive acquiescence to the crimes of terrorists does not constitute an “act” that “affords material support ... to a terrorist organization” under the plain language of 8 U.S.C. § 1182(a)(3)(B)(iv)(VI) (the “Material Support Bar”). Accordingly, I must respectfully dissent.
I.
Under the Material Support Bar, an alien is inadmissible if he has engaged in terrorist activity by providing “material support” to a terrorist organization. See 8 U.S.C. § 1182(a)(3)(B)(i)(I). “Terrorist activity” is in turn defined to include the commission of “an act that [the person] knows, or reasonably should know, affords material support ... to a terrorist organization.” Id. § 1182(a)(3)(B)(iv)(VI)(cc) (emphasis added).
As noted by the majority opinion, the statute does not provide any type of “duress” exception for an “act” committed under the type of violence and intimidation all parties acknowledge Barahona faced in this case. Ante at 354-55. However, the requirement of an “act” — “something done or performed,” Black’s Law Dictionary 27 (9th ed. 2009), should not be conflated with an excuse for conduct for which an individual would otherwise be liable:
If a person manipulates the hand of another in such a way as to cause a crime to be committed, the latter person is guilty of no crime because he has performed, no act. On the other hand, if a person threatens another with harm unless he commits a crime, and thereby causes the crime to be committed, the coerced person has performed an act, [though duress may excuse the act],
1 Charles E. Torcía Wharton’s Criminal Law § 52 (15th ed. 2011) (emphasis added). Moreover, our justice system has long distinguished between committing an act and failing to act. See, e.g., 1 Wayne R. LaFave, Substantive Criminal Law § 6.2 (2d ed. 2008) (“For criminal liability to be based upon a failure to act it must be found that there is a duty to act — a legal duty and not simply a moral duty.”); Restatement (Second) of Torts § 314 (“The fact that the actor realizes or should realize that action on his part is necessary for another’s aid or protection does not of itself impose upon him a duty to take such action.”).
Here, the Immigration Judge, whose decision was adopted and supplemented by the Board of Immigration Appeals, made the following factual findings:
The material support at issue in this particular case ... is [Barahona] has testified that the guerrillas did make use of his kitchen to cook their food ... during approximately one year. I will state also that he did state that he gave guerrillas directions and showed them shortcuts, but it is the opinion of the Court that would not have constituted material support to the guerrillas. There is no evidence he was trying to help them on any military missions.... I will make a factual finding that [Barahona] was living in occupied territory of the guerrillas, that he had no choice as to whether or not to let them use his house ... and, therefore, I would find, as a factual matter, that there was duress in this case.
J.A. 327-28. The Immigration Judge concluded that because, “[u]nfortunately, the law as it stands today, provides no defense for duress,” Barahona had violated the Material Support Bar and was, consequently, ineligible for relief. The Board of Immigration Appeals agreed and ruled that, due to the lack of a duress exception or voluntariness requirement, Barahona violated the Material Support Bar by allowing the guerrillas to use his kitchen. It is this legal conclusion, affirmed by the majority opinion, with which I take issue, as I find that Barahona need not plead either duress or involuntariness when he can be “guilty of no crime because he has performed no act.” Torcía, supra § 52. Nowhere in the record before this Court is there any suggestion that Barahona took any affirmative step, or otherwise performed or did any deed, that he “kn[ew], or reasonably should [have known], afford[ed] material support” to the guerillas. 8 U.S.C. § 1182(a)(3)(B)(iv)(VI)(ce).
Rather, the Immigration Judge and the Board of Immigration Appeals essentially found that — under threat of death — Barahona did not prevent the guerillas from occupying his home and using his kitchen to prepare their meals for approximately a year. Yet the plain language of the statute refers only to whether the individual “commit[s] an act,” 8 U.S.C. § 1182(a)(3)(B)(iv)(VI)(ec) (emphasis added). A failure to act should not be equated with — or read into — that phrase. See e.g., Midi v. Holder, 566 F.3d 132, 136-37 (4th Cir.2009) (noting that under the standard from Chevron v. Natural Resources Defense Council, Inc., 467 U.S. 837, 844, 104 S.Ct. 2778, 81 L.Ed.2d 694 (1984), “we initially examine the statute’s plain language; if Congress has spoken clearly on the precise question at issue, the statutory language controls.”).
To apply the Material Support Bar to a failure to act, such as in Barahona’s case, runs contrary both to our justice system’s longstanding distinction between committing an act and failing to act, discussed above, and to the well-established tenet that we should construe statutes to avoid absurd results. Griffin v. Oceanic Contractors, Inc., 458 U.S. 564, 575, 102 S.Ct. 3245, 73 L.Ed.2d 973 (1982) (“[interpretations of a statute which would produce absurd results are to be avoided if alternative interpretations consistent with the legislative purpose are available.”).
Consider, for example, that the majority opinion’s holding would still bar Barahona from relief even had he immediately fled his home and never returned, and the guerillas had used his home in his absence, yet he reasonably should have known they would occupy and use his home once he left. Likewise, he would not be eligible for relief even if he had taken some sort of action to prevent the guerillas from being able to prepare meals, such as sabotaging his stove, if they instead used his fireplace. Such cannot be the intent of Congress, when the statute specifically provides that an individual must “commit an act” that “affords material support.”
II.
José Barahona lost his home, members of his family, and his homeland to guerilla terrorists. Under today’s ruling, he will now lose his adopted country. Because I find that the plain language of the Material Support Bar requires that Barahona have “committed] an act” — beyond simply being the unfortunate victim of terrorists — to deny the relief he seeks, I must respectfully dissent.
. The NACARA, which was enacted in 1997 by Public Law 105-100, 111 Stat. 2160, 2193-96, and amended that year by Public Law 105-139, 111 Stat. 2644, is codified in several titles of the United States Code, including Title 8. See Peralta v. Gonzales, 441 F.3d 23, 24 (1st Cir.2006). The NACARA amended the Illegal Immigration Reform and Immigrant Responsibility Act of 1996, which had amended the Immigration and Nationality Act (the “INA”) by rendering certain groups of aliens inadmissible. See Cheruku v. Attorney Gen., 662 F.3d 198, 203-04 (3d Cir.2011). Thus, the NACARA effectively amended the INA, which constitutes this country's basic statutory enactment relating to immigration.
. Citations herein to "J.A. -" refer to the contents of the Joint Appendix filed by the parties in this matter.
. The IJ Decision is found at J.A. 322-29.
. The parties agree that the FMLN is a terrorist organization for purposes of the INA.
. Although the IJ Decision found that material support was provided to the FMLN by Barahona, the Decision never expressly links that support to any aspect of the statutory definition of “material support.” We assume, for purposes of our decision today, that such a link includes at least "a safe house.”
. The BIA Order is found at J.A. 438-40.
. In his petition for review, Barahona appears to have abandoned his earlier claim of a violation of international law. Barahona reiterates, however, that his support of the FMLN guerrillas was de minimis and that, as such, it could not amount to material support. Inasmuch as this contention challenges a finding of fact, we lack jurisdiction to reach or address it. See Ixcot, 646 F.3d at 1213-14.
. Barahona’s lawyer advised at oral argument that her client had already applied for relief under the waiver provision, and that such relief was denied by the Secretary of Homeland Security in March 2012.
. Section 1182(a)(3)(D) of Title 8, which bars the admission of any immigrant who has been affiliated with the Communist or another totalitarian party, contains an exception for aliens who "establishf ] ... that the membership or affiliation is or was involuntary.” § 1182(a)(3)(D)(ii). The inclusion of this exception in a bar to admissibility, titled "Exception for involuntary membership,” provides further support for the proposition that Congress never intended to create an involuntariness exception in the Material Support Bar.
. Other relevant legal definitions of act include: (1) from criminal law, "a bodily movement whether voluntary or involuntary,” Model Penal Code § 1.13; and from civil law, "an external manifestation of the actor’s will,” Restatement (Second) of Torts § 2.
. The Immigration Judge further remarked that: "I want to make clear were it not for this material support issue I would have found the respondent meets the criteria of relief under [section] 203 of NACARA, and I would urge whoever is making the decision, Department of Homeland Security, to allow the duress exception.” J.A. 328.
. Indeed, every case cited by the Board of Immigration Appeals, in support of its duress analysis or otherwise, involves the commission of an act. See, e.g., Arias v. Gonzales, 143 Fed.Appx. 464, 466-68 (3d Cir.2005) (making voluntary payments); Matter of S-K-, 23 I. & N. Dec. 936, 937 (BIA 2006) (donating money); Singh-Kaur v. Ashcroft, 385 F.3d 293, 298 (3d Cir.2004) (providing food).
|
package ie.curiositysoftware.modellerstorage.dto;
public class ModellerFile {
public enum FileTypeEnum {
Model,
PageObject,
PageModule,
TestInsightsPool,
GlobalVariables,
RawFile,
DataActivity;
}
public enum RawFileTypeEnum {
Basic,
DataSheet,
Config;
}
protected Long id;
protected String fileName;
protected String displayName;
protected FileTypeEnum fileType;
protected RawFileTypeEnum rawFileType;
protected Long fileResourceId;
protected String assigneeUserId;
protected String state;
protected String priority;
protected Integer complexity;
protected Long parentFolder;
protected Long release;
public void setRelease(Long release) {
this.release = release;
}
public Long getRelease() {
return release;
}
public void setId(Long id) {
this.id = id;
}
public Long getId() {
return id;
}
public void setFileName(String fileName) {
this.fileName = fileName;
}
public String getFileName() {
return fileName;
}
public FileTypeEnum getFileType() {
return fileType;
}
public Integer getComplexity() {
return complexity;
}
public Long getFileResourceId() {
return fileResourceId;
}
public Long getParentFolder() {
return parentFolder;
}
public RawFileTypeEnum getRawFileType() {
return rawFileType;
}
public String getAssigneeUserId() {
return assigneeUserId;
}
public String getDisplayName() {
return displayName;
}
public String getPriority() {
return priority;
}
public String getState() {
return state;
}
public void setAssigneeUserId(String assigneeUserId) {
this.assigneeUserId = assigneeUserId;
}
public void setComplexity(Integer complexity) {
this.complexity = complexity;
}
public void setDisplayName(String displayName) {
this.displayName = displayName;
}
public void setFileResourceId(Long fileResourceId) {
this.fileResourceId = fileResourceId;
}
public void setFileType(FileTypeEnum fileType) {
this.fileType = fileType;
}
public void setParentFolder(Long parentFolder) {
this.parentFolder = parentFolder;
}
public void setPriority(String priority) {
this.priority = priority;
}
public void setRawFileType(RawFileTypeEnum rawFileType) {
this.rawFileType = rawFileType;
}
public void setState(String state) {
this.state = state;
}
}
|
<?php
namespace Thinktomorrow\Chief\Plugins\Tags\App\Presets;
use Closure;
use Illuminate\Database\Eloquent\Builder;
use Illuminate\Http\Request;
use Illuminate\Support\Collection;
use Thinktomorrow\Chief\ManagedModels\Filters\Filter;
use Thinktomorrow\Chief\ManagedModels\Filters\FilterType;
use Thinktomorrow\Chief\Plugins\Tags\App\Read\TagRead;
use Thinktomorrow\Chief\Plugins\Tags\App\Read\TagReadRepository;
class TagsFilter implements Filter
{
protected string $type;
protected string $queryKey;
protected ?Closure $query;
protected ?string $view = null;
protected ?string $label;
protected ?string $description = null;
protected ?string $placeholder = null;
/** @var null|mixed */
protected $value;
private $default = null;
/** @var string all|used|category */
private string $optionType;
private Collection $tags;
private array $tagGroupIds = [];
private array $ownerTypes = [];
final public function __construct(string $queryKey = 'tags', ?Closure $query = null)
{
$this->queryKey = $queryKey;
$this->query = $query;
$this->optionType = 'used';
$this->tags = collect();
$this->label = $this->description = $this->placeholder = $this->value = null;
}
public function applicable(Request $request): bool
{
return ($request->filled($this->queryKey) || $this->value);
}
public function queryKey(): string
{
return $this->queryKey;
}
public function query(): Closure
{
return function (Builder $builder, $value) {
$builder->whereHas('tags', function ($query) use ($value) {
$query->whereIn('id', (array)$value);
});
};
}
public function view(string $view): self
{
$this->view = $view;
return $this;
}
public function label(string $label): self
{
$this->label = $label;
return $this;
}
public function description(string $description): self
{
$this->description = $description;
return $this;
}
public function default($default): self
{
$this->default = $default;
return $this;
}
public function render(): string
{
$path = $this->view ?? 'chief-tags::.filters.tags';
return view($path, $this->viewData())->render();
}
public function tags(Collection $tags): static
{
$this->tags = $tags;
return $this;
}
public function filterByUsedTags(): static
{
$this->optionType = 'used';
return $this;
}
public function filterByOwnerTypes(array|string $ownerTypes): static
{
$this->optionType = 'owner_type';
$this->ownerTypes = (array)$ownerTypes;
return $this;
}
public function filterByTagCategory(array|string|int $tagGroupIds): static
{
$this->optionType = 'category';
$this->tagGroupIds = (array)$tagGroupIds;
return $this;
}
private function getTags(): Collection
{
if (! $this->tags->isEmpty()) {
return $this->tags;
}
return match ($this->optionType) {
'used' => app(TagReadRepository::class)->getAll()->reject(fn (TagRead $tagRead) => $tagRead->getUsages() < 1),
'owner_type' => app(TagReadRepository::class)->getAll()->filter(function (TagRead $tagRead) {
return $tagRead->getOwnerReferences()->contains(fn ($pivotRow) => in_array($pivotRow->owner_type, $this->ownerTypes));
}),
'category' => app(TagReadRepository::class)->getAll()->filter(fn (TagRead $tagRead) => in_array($tagRead->getTagGroupId(), $this->tagGroupIds)),
default => app(TagReadRepository::class)->getAll(),
};
}
protected function viewData(): array
{
return [
'id' => $this->queryKey,
'name' => $this->queryKey,
'label' => $this->label,
'description' => $this->description,
'value' => old($this->queryKey, request()->input($this->queryKey, $this->value)),
'default' => $this->default,
'tags' => $this->getTags(),
];
}
public function getType(): string
{
return FilterType::TAGS;
}
}
|
Rate-based congestion control in packet communications networks
ABSTRACT
A congestion control system for packet communications networks in which access to the network is controlled to prevent such congestion. Packets within the prespecified statistical description of each packet source are marked as high priority ("green" packets) while packets exceeding the pre-specified characteristics are marked with a lower priority ("red" packets). The overall red packet rate is limited to prevent red packet saturation of the network. Packets are marked red for a continuous train of successive red packets. The introduction of red packets into the network is subjected to a degree of hysteresis to provide better interaction with higher layer error recovery protocols. The amount of hysteresis introduced into the red packet marking can be fixed or varied, depending on the statistics of the incoming data packets at the entry point to the network.
TECHNICAL FIELD
This invention relates to packet communications networks and, more particularly, to the control of user access to the network in order to minimize congestion in such networks.
BACKGROUND OF THE INVENTION
In high-speed packet switching networks, several classes of traffic share the common resources of the network. Multimedia services such as text, image, voice and video generate traffic at widely varying rates. The traffic characteristics of such different sources, moreover, vary dramatically over time. The transport network must nevertheless guarantee a bandwidth and a quality of service to each connection regardless of these differences. Managing the available bandwidth to avoid congestion and to provide such guaranteed Grades of Service (GOS) for connections with potentially dramatic differences in their statistical behavior is therefore of extreme importance in such networks. For example, while data traffic can usually be slowed down in order to cope with network congestion, real time traffic, such as voice, video or image, has an intrinsic rate determined by external factors; the ability to slow down such sources is usually very limited. Real time traffic therefore requires some level of guaranteed service and hence the allocation of resources for such connections is mandatory. The traffic must be managed, not only to guarantee the availability of resources such as link bandwidth, buffer space, switch capacity, processing resources, and so forth, but also to allocate these resources among the contending traffic streams in a "fair" manner. Network resources are finite, valuable and must be utilized in an optimal manner.
Conventional mechanisms for controlling congestion in a network rely on end-to-end control messages for regulating the flow of traffic. In high speed networks, however, the propagation delays across the network typically dominate the switching and queuing delays. The congestion control feedback messages from the network are therefore usually so outdated that any action taken by the source in response to such messages is too late to resolve the congestion which caused the messages to be initiated in the first place. Conventional end-to-end congestion control mechanisms are simply incapable of deaf ing realistically with congestion in today's high speed global networks.
Due to the stochastic nature of the packet arrival process, for transitory periods during the connection, the parameters of a source vary from the values determined at the connection setup time. In addition, congestion may arise in the network for brief periods during the course of the connection due to statistical variances in the multiplexing process. It is therefore important not only to regulate the access to the network at the source, but also to regulate traffic flow within the network by buffer management and scheduling functions. These traffic regulation mechanisms enforce the pre-specified classes of service. Since all congestion control procedures used in high speed networks must be available in real time, however, such procedures must be computationally simple.
In order to achieve these goals, the network must regulate the rate of traffic flow from each source into the network. Such rate-based access control mechanisms are preferable over link-by-link flow controls because such access control mechanisms maximize the speed of information transfer over the network. One well-known congestion preventive rate-based access control technique is based on the so-called buffered "leaky bucket" scheme. Such leaky bucket schemes restrict the data transmission, on the average, to the allowable rate, but permit some degree of burstiness diverging from the average. Leaky bucket schemes are disclosed in "Congestion Control Through Input Rate Regulation," by M. Sidi, W-Z. Liu, I. Ci don and I. Gopal, Proceedings of Globecom '89, pages 49.2.1-49.2.5, Dallas, 1989, "The `Leaky Bucket` Policing Method in the ATM (Asynchronous Transfer Mode) Network," by G. Niestegge, International Journal of Digital and Analog Communications Systems, Vol. 3, pages 187-197, 1990, and "Congestion Control for High Speed Packet Switched Networks," by K. Bala, I. Ci don and K. Sohraby, Proceedings of Infocom '90, pages 520-6, San Francisco, 1990. Some of these leaky bucket congestion control schemes involve the marking of packets entering the network to control the procedures used in the network in handling those packets.
In the Bala et al. article, for example, packets leaving a source are marked with one of two different "colors," red and green. Green packets represent traffic that is within the connection's reserved bandwidth, and are guaranteed a prespecified grade of service based on some level of delay and loss probability within the network. The green packets are therefore transmitted at a rate determined at call setup time. Red packets, on the other hand, represent traffic sent over and above the reserved rate and can be viewed as an emergency relief mechanism coming into play during an overload period where the instantaneously offered traffic is above the reserved bandwidth. In other words, the amount of traffic in excess of the allocated bandwidth is marked red and sent into the network, instead of being dropped at the source. Red packets allow a source to exploit any unused network bandwidth in order to improve the efficiency of the statistical multiplexing.
The network nodes operate to store and forward packets. Green and red packets are treated differently, however. The intermediate nodes will discard red packets first at times of congestion, using a low discard threshold. As a result, red packets have a higher loss probability at the intermediate nodes, and, moreover, do not degrade the performance of the green packets to any significant extent.
One leaky bucket mechanism is described in detail in the co pending application of the present applicant Ser. No. 07/932,440, filed Aug. 19, 1992, and assigned to applicants' assignee. It is of considerable importance in leaky bucket access control schemes that the red packets do not degrade the performance of the green packets. Moreover, it is also desirable that the red packets make as much use as possible of the available bandwidth on the network. For example, if the amount of red traffic is not controlled, it is possible that the red packets can destructively interfere with each other, resulting in a lower red packet throughput than the network would have otherwise permitted. These problems are of extreme concern in very large national or international networks where traffic is heavy, demand great and the efficiency of the network of paramount importance.
SUMMARY OF THE INVENTION
In accordance with the illustrative embodiment of the present invention, a buffered leaky bucket access control mechanism is provided for access to a packet network using a packet marking scheme. Packets within the reserved bandwidth of the connection are marked with a high ("green") priority marking while packets not within the reserved bandwidth of the connection are marked with a lower ("red") priority marking. More particularly, in accordance with the illustrative embodiment of the present invention, the bandwidth available to the red packets in the leaky bucket access control mechanism is controlled for every connection to prevent saturation of the network with such red packets. Such saturation would cause the red packets to interfere with each other and with the higher priority green packets. Furthermore, in order to improve interaction with higher layer error recovery protocols, a certain amount of hysteresis is built into the packet marking mechanism. That is, it is arranged such that several low priority red packets are transmitted back-to-back instead of continuously alternating between red and green packets.
In accordance with a first embodiment of the present invention, a spacer is also used to introduce some spacing between packets and achieve some level of smoothing. At the same time, a red traffic limiter limits the number of red packets which can be transmitted during a given time interval. Meanwhile, a hysteresis counter insures that, once red packet marking is initiated, that such red packet marking continues for a fixed number of data units to form a continuous red packet train. Green packets are, of course, transmitted when enough green tokens are present in a fixed-size green token pool into which green tokens are introduced at a fixed rate. The red traffic limiter prevents the network links from being saturated with red packets while the hysteresis counter avoids too frequent alterations of red and green marking periods.
In accordance with a second embodiment of the present invention, the hysteresis mechanism is made dynamic by substituting a variable number of successive red data units for the fixed number in the first embodiment. The number of such successive red data units, moreover, is dependent on the distribution of the incoming packets. This avoids certain problems that might arise in the first embodiment. For example, if the number of successive red data units is too short, there will not be a sufficient accumulation of green tokens to permit a green packet to be transmitted between bursts of red packets. On the other hand, if the number of successive red data units is too large, the loss probability of the red packets at the intermediate nodes increases.
Another problem can arise with a fixed amount of hysteresis. If the number is large enough to permit adequate green token accumulation and thereby permit adequate separation of red packet bursts, it is possible that the red marking interval will continue after the green token pool is full. In accordance with the second embodiment of the invention, the red marking process is tu med off when the number of green tokens has reached a threshold (the green resume threshold) to insure that green packets can be transmitted when the green token pool reaches the threshold. Both embodiments of the present invention have the advantage of optimizing the use of red packets by assembling trains of such red packets while, at the same time, limiting the total number of such red packets in any given period of time.
BRIEF DESCRIPTION OF THE DRAWINGS
A complete understanding of the present invention may be gained by considering the following detailed description in conjunction with the accompanying drawings, in which:
FIG. 1 shows a general block diagram of a packet communications system in which the buffered leaky bucket mechanisms in accordance with the present invention might find use;
FIG. 2 shows a more detailed block diagram of typical decision point in the network of FIG. 1 at which packets enter the network or are forwarded along the route to a destination for that packet, and at which a leaky bucket mechanism in accordance with the present invention would be located;
FIG. 3 shows a general block diagram of a buffered leaky bucket access mechanism in accordance with the present invention using a fixed value of hysteresis in the red packet marking process, to be used in the network access controller of FIG. 2;
FIG. 4 shows a flow chart of the operation of the leaky bucket access control mechanism of FIG. 3;
FIG. 5 shows a general block diagram of a buffered leaky bucket access control mechanism in accordance with the present invention using a variable amount of hysteresis in the red packet marking process, to be used in the network access controller of FIG. 2; and
FIG. 6 shows a flow chart of the operation of the leaky bucket access control mechanism of FIG. 5.
To facilitate reader understanding, identical reference numerals are used to designate elements common to the figures.
DETAILED DESCRIPTION
Referring more particularly to FIG. 1, there is shown a general block diagram of a packet transmission system 10 comprising eight network nodes 11 numbered 1 through 8. Each of network nodes 11 is linked to others of the network nodes 11 by one or more communication links A through L. Each such communication link may be either a permanent connection or a selectively enabled (dial-up) connection. Any or all of network nodes 11 may be attached to end nodes, network node 2 being shown as attached to end nodes 1, 2 and 3, network node 7 being shown as attached to end nodes 4, 5 and 6, and network node 8 being shown as attached to end nodes 7, 8 and 9. Network nodes 11 each comprise a data processing system which provides data communications services to all connected nodes, network nodes and end nodes, as well as decision points within the node. The network nodes 11 each comprise one or more decision points within the node, at which incoming data packets are selectively routed on one or more of the outgoing communication links terminated within that node or at another node. Such routing decisions are made in response to information in the header of the data packet. The network node also provides ancillary services such as the calculation of routes or paths between terminal nodes, providing access control to packets entering the network at that node, and providing directory services and maintenance of network topology data bases used to support route calculations and packet buffering.
Each of end nodes 12 comprises either a source of digital data to be transmitted to another end node, a utilization device for consuming digital data received from another end node, or both. Users of the packet communications network 10 of FIG. 1 utilize an end node device 12 connected to the local network node 11 for access to the packet network 10. The local network node 11 translates the user's data into packets formatted appropriately for transmission on the packet network of FIG. 1 and generates the header which is used to route the packets through the network 10.
In order to transmit packets on the network of FIG. 1, it is necessary to calculate a feasible path or route through the network from the source node to the destination node for the transmission of such packets. To avoid overload on any of the links on this route, the route is calculated in accordance with an algorithm that insures that adequate bandwidth is available for the new connection, using statistical multiplexing techniques. That is, given the statistical properties of each data source, a plurality of signals from such sources are multiplexed on the transmission links A-L, reserving sufficient bandwidth to carry each signal if that signal stays within its statistically described properties. One such algorithm is disclosed in the co pending application, Ser. No. 07/874,917, filed, Apr. 28, 1992, and assigned to applicants' assignee. Once such a route is calculated, a connection request message is launched on the network, following the computed route and updating the bandwidth occupancy of each link along the route to reflect the new connection.
In FIG. 2 there is shown a general block diagram of a typical packet network decision point such as is found in the network nodes 11 of FIG. 1. The decision point of FIG. 2 comprises a high speed packet switching fabric 33 onto which packets arriving at the decision point are entered. Such packets arrive over transmission links via transmission adapters 34, 35, . . . , 36, or originate in user applications in end nodes via application adapters 30, 31, . . . , 32. It should be noted that one or more of the transmission adapters 34-36 can be connected to intra node transmission links connected to yet other packet switching fabrics similar to fabric 33, thereby expanding the switching capacity of the node. The decision point of FIG. 2 thus serves to connect the packets arriving at the decision point to a local user (for end nodes) or to a transmission link leaving the decision point (for network nodes and end nodes). The adapters 30-32 and 34-36 may include queuing circuits for queuing packets prior to or subsequent to switching on fabric 33. A route controller 37 is used to calculate optimum routes through the network for packets originating at one of the user application adapters 30-32 in the decision point of FIG. 2. Network access controllers 39, one for each connection originating at the decision point of FIG. 2, are used to regulate the launching of packets onto the network so as to prevent congestion. That is, if the transient rate of any connection exceeds the statistical values assumed in making the original connection, the controllers 39 slow down the input to the network so as to prevent congestion. Both route controller 37 and access controllers 39 utilize the statistical description of the new connection in calculating routes or controlling access. These descriptions are stored in topology data base 38. Indeed, network topology data base 38 contains information about all of the nodes and transmission links of the network of FIG. 1 which information is necessary for controller 37 to operate properly.
The controllers 37 and 39 of FIG. 2 may comprise discrete digital circuitry or may preferably comprise properly programmed digital computer circuits. Such a programmed computer can be used to generate headers for packets originating at user applications in the decision point of FIG. 2 or connected directly thereto. Similarly, the computer can also be used to calculate feasible routes for new connections and to calculate the necessary controls to regulate access to the network in order to prevent congestion. The information in data base 38 is updated when each new link is activated, new nodes are added to the network, when links or nodes are dropped from the network or when link loads change due to the addition of new connections. Such information originates at the network node to which the resources are attached and is exchanged with all other nodes to assure up-to-date topological information needed for route and access control calculations. Such data can be carried throughout the network on packets very similar to the information packets exchanged between end users of the network.
The incoming transmission links to the packet decision point of FIG. 2 may comprise links from local end nodes such as end nodes 12 of FIG. 1, or links from adjacent network nodes 11 of FIG. 1. In any case, the decision point of FIG. 2 operates in the same fashion to receive each data packet and forward it on to another local or remote decision point as dictated by the information in the packet header. The packet network of FIG. 1 thus operates to enable communication between any two end nodes of FIG. 1 without dedicating any transmission or node facilities to that communication path except for the duration of a single packet. In this way, the utilization of the communication facilities of the packet network is optimized to carry significantly more traffic than would be possible with dedicated transmission links for each communication path.
Referring more particularly to FIG. 3, there is shown a general block diagram of the major components of an access control module in accordance with the present invention which may comprise special purpose circuitry, but preferably is embodied in a programmed computer. The access control module of FIG. 3 comprises a user packet source 40 which generates packets of data having a given set of statistical characteristics. These packets are entered into an admission buffer 41 having a length marker 42 which is used to initiate red marking when insufficient green tokens are available. Packets at the head (bottom) of admission buffer 41 leave buffer 41 through gating circuits 43 under the control of green token pool 46, hysteresis counter 47, red token pool 48 and spacer token pool 49. More particularly, the access control circuit of FIG. 3 operates to launch packets into the packet network with green tags so long as the source 40 remains within the statistical parameters originally assigned to source 40, and transmits packets with red tags whenever the source 40 exceeds the originally assigned statistical parameters. To this end, green bucket 46 is loaded with green tokens at a fixed rate from green token source 45 until the green token pool is full. As an added protection, spacer token pool 49 is loaded with a number of spacer tokens proportional to the length of the packet just launched. Spacer tokens are removed from spacer token pool 49 by spacer token sink 44 at a fixed rate (p). Only when spacer token pool 49 is empty is the next packet allowed to be launched into the packet network, thereby adding a certain level of smoothing of the packet transmission process. When red marking is initiated, hysteresis counter 47 insures that a fixed number of data units are marked as red packets to form a continuous train of red packets in order to better interact with higher layer error recovery protocols. Red token source 140 loads M_(r) red tokens into red token pool 48 every T period. The limited token count in red token pool 48 limits the number of red data units transmitted during a given time interval to the preselected value M_(r), thereby insuring that the red traffic does not saturate the transmission links of the network.
The various parameters used and identified in FIG. 3 can be defined as follows:
T:The time interval after which the red token pool is refreshed.
γ_(g) :The green token generation rate.
M_(g) :The size of the green token pool. M_(g) depends upon the burstiness of the traffic from source 40 and is typically chosen to achieve transparency of the leaky bucket to the user traffic. In general, a large M_(g) will let more packets enter the network as they arrive (limited only by the rate allowed by the spacer). For a given input traffic, the output green traffic will be smoother as M_(g) becomes smaller. A small M_(g), however, will introduce larger admission delays, or cause a larger number of packets to be marked red. M_(g) must always be large enough to hold sufficient tokens to permit the transmission of the maximum sized packet. M_(g) is chosen heuristically to best satisfy these contending requirements.
The rate of emptying the spacer packet pool. β determines the peak rate that the packets may enter the network, and thus affects the smoothness of the packet launching process. If β is equal to the peak input rate, the user packets from source 40 will only be queued in admission buffer 41 if no transmission tokens (red or green) are available. However, in order to protect the network, β may be chosen to be no higher than the slowest link speed in the packet path. β can be further reduced beyond this level, however, to achieve any desired level of smoothing and reserved bandwidth.
M_(r) :The total number of red tokens available in time interval T. M_(r) therefore forms the upper bound on the amount of the user traffic which is marked red when launched on the packet network during the time interval T.
K:The threshold 42 in admission buffer 41 used to initiate red marking when insufficient green tokens are available.
L:The number of tokens which determines the total number of data units that are marked red once red marking is initiated.
Using the definitions given above and the components shown in FIG. 3, the operation of the access control procedure with fixed hysteresis is shown in the flow chart of FIG. 4. In FIG. 4, the leaky bucket access control mechanism with static hysteresis is initiated, starting at start box 50, whenever a user packet reaches the head (bottom) of admission buffer 42. At that time, decision box 51 is entered to determine if the spacer pool 49 is empty. If not, decision box 51 is repeatedly re-entered until the spacer pool 49 is empty. At that time, decision box 52 is entered where it is determined if the red marking flag is off. If so, decision box 53 is entered where it is determined whether enough green tokens have been accumulated in green token pool 46 to accommodate the packet at the head of admission buffer 41. If enough green tokens have been accumulated in green pool 46, box 54 is entered where the packet is marked green and, in box 66, the green pool 46 is updated by subtracting the number N of tokens from the green pool 46 necessary to account for the data units in the green packet. Box 55 is then entered where the green packet is transmitted on the network and the process terminated for that packet in terminal box 56. Start box 50 is re-entered when the next packet arrives at the head of admission buffer 41.
If it is determined in decision box 53 that a sufficient number of green tokens are not available in green pool 46 to accommodate this packet, decision box 57 is entered to determine if the buffer 41 length is less than K, the red marking threshold. If the length of buffer 41 is less than the threshold K, decision box 53 is re-entered to wait for either enough green tokens to be accumulated to accommodate the packet (decision box 53) or the length of the buffer 41 to exceed threshold K (decision box 57). If enough green tokens are accumulated to accommodate the packet before the buffer threshold length K is reached, box 54 is entered to mark the packet green, update the green pool 46 (box 66) and transmit the green packet (box 55). If, however, the buffer length threshold K is reached before enough green tokens are accumulated, box 58 is entered to subtract a fixed hysteresis value L from the red token pool 48. That is, the red token pool is reduced by the number of red tokens needed to transmit the next desired serial train of red packets.
After decrementing the red token pool 48 in box 58, decision box 59 is entered to determine if the red token count M_(r) has been decremented to below zero. If so, decision box 53 is re-entered to await the accumulation of sufficient green tokens or the refreshing of the red token pool 48. That is, if there are insufficient accumulated red tokens to accommodate the next serial train of red packets, the system recycles to await the accumulation of enough green tokens to mark the packet green or the refreshing of the red token pool.
If the red count M_(r) is not less than zero, as determined in decision box 59, box 60 is entered to turn the red marking flag on and box 61 entered to preset the count in the hysteresis counter 47 to the fixed value L, representing the number of red tokens necessary to transmit the desired serial sequence of red packets. Box 62 is then entered to reduce the hysteresis count in counter 47 by the value N, representing the number of tokens required to accommodate the current packet at the head of admission buffer 41. In decision box 63, the value of the remaining count in hysteresis counter 47 is compared to zero. If the value in hysteresis counter 47 is less than zero, box 64 is entered to turn the red marking flag off since the tokens in counter 47 are insufficient to accommodate another red packet. Box 65 is then entered to mark the current packet red. If the value in hysteresis counter 47 is not less than zero, box 65 is entered directly, without fuming the red flag off, but marking the current packet red. Box 67 is then entered to re-initialize the spacer pool 49 and then box 55 is entered to transmit the red packet. The process is terminated in terminal box 56 for the current packet. Start box 50 is re-entered when the next packet reaches the head of admission buffer 41.
If it is determined in decision box 52 that the red flag is not off, box 62 is entered to decrement the hysteresis count by N and continue on through boxes 63, 64, 65, 67 and 55 to transmit the next packet as a red packet. The red flag is thus on long enough to exhaust the hysteresis counter 47 (via box 62) and thus transmit the desired train of red packets. Note that the count in hysteresis counter 47 is eventually decremented below zero in box 62 and hence the red packet train is always somewhat longer than the length suggested by the value L.
It can be seen that the procedure outlined in the flow chart of FIG. 4 operates to transmit green packets so long as the arrival of source packets is equal to or less than the green token generation rate in green token source 45. When the arrival rate of source packets exceeds the green token generation rate, there will not be sufficient green tokens to transmit green packets and the red marking flag will be tu med on. Once turned on, the red marking flag remains on until the hysteresis count in counter 47 is exhausted, thus insuring a continuous train of red packets of sufficient length to accommodate error recovery protocols. Meanwhile, at the same time that green and red packet marking is taking place, the spacer pool 49 insures a reasonable smoothing to the packet launching process. In addition, the red packet pool 48 limits the number of red data units launched in a fixed period of time. Together, these procedures insure that congestion will not occur in the network due to the launching of excessive numbers of packets from one or more packet sources.
The procedure described in connection with FIGS. 3 and 4 can be summarized as follows. Each packet at the head of the admission buffer 41 is serviced as follows:
1. Each packet waits until the spacer token pool 49 is empty.
2. If there are enough green tokens in the green token pool 46 and if the red marking flag is off, then the packet is marked green and the green token pool 46 is updated.
3. If there are not enough green tokens in green token pool 46 to service the packet and if the admission buffer length is less than K and if red marking is not turned on, then the packet must wait until enough green tokens are accumulated.
4. If there are not enough green tokens in green token pool 46 to service the packet, and if the admission buffer 41 length >K and M_(r) ≧L, then red marking is turned on and the packet is marked red. The hysteresis counter 47 is initialized tO L and decremented by the number of tokens needed to accommodate this packet. When the value (LCOUNT) in hysteresis counter 47=<0, then red marking is turned off.
5. If the number of green tokens in green token pool 46 is insufficient to service this packet and the admission buffer 41 length ≧K and M_(r) <0, then the packet waits until there are enough tokens available to mark the packet one color or the other.
The number of red data units launched in a serial train of packets in FIGS. 3 and 4 is close to and determined by the value L. This number may be too high for some rates of input source packets and may be too low for other rates of input source packets. That is, the lower the input source rate, the more time is available for transmitting red packets and hence the longer the serial red packet train can be. Similarly, the higher the input source rate, the less time is available for transmitting the serial red packet train. On the other hand, the shorter the serial red packet train, the less time available to accumulate green tokens while the red packet train is being transmitted, and sufficient green tokens may not be accumulated to transmit a green packet between bursts of red packets. Moreover, if the number of red packets in the train is too large, the probability of losing red packets at intermediate nodes is larger. These contending requirements for the length of the red packet train can be resolved by making the length of the red packet train vary in response to the rate of arrival of input source packets. A congestion control scheme utilizing such a variable amount of hysteresis is disclosed in FIGS. 5 and 6.
Referring more particularly to FIG. 5, there is shown a general block diagram of the major components of another access control module in accordance with the present invention utilizing variable hysteresis in the red packet marking process. As with FIG. 3, FIG. 5 can be realized with special purpose circuitry, but is preferably embodied in a programmed digital computer. The access control module of FIG. 5 comprises a user packet source 70 which generates input packets of data units having a given set of statistical characteristics. These packets are entered into admission buffer 71. Although admission buffer 71 may have a red-initiating threshold K like threshold 42 in buffer 41 in FIG. 3, such a threshold has been omitted in FIG. 71 for simplicity. Green token source 75 feeds a green token pool 76 having a green resume threshold 72 (R_(off)) which is used to turn off red marking when the number of green tokens approaches a number sufficient to allow green packet marking. As in the arrangement of FIG. 3, a red token source 74 loads M_(r) red tokens into red token pool 78 every T period, thus limiting the number of red data units which can be transmitted in the time period T. A spacer pool 79, emptied by spacer token sink 77, insures a minimum space between packets launched into the packet network. The only new parameter in the access control module of FIG. 5 is the green resume threshold R_(off). This parameter can be defined as follows:
R_(off) :The green resume threshold R_(off) is a fraction of M_(g) and provides a dynamic hysteresis between the red and green marking of packets. This is accomplished by turning off red marking if the number of green tokens exceeds a preselected threshold (R_(off)) and thus limiting the length of the red packet train in dependence on the number of green tokens available. R_(off), of course, has to be large enough to exceed the number of tokens necessary to transmit a maximum-sized packet.
Using the definition of R_(off) given above and the definitions of the other parameters given in connection with FIG. 3, the operation of the dynamic hysteresis access control arrangements of FIG. 5 is shown in the flow chart of FIG. 6. In FIG. 6, the dynamic hysteresis access control arrangement of FIG. 5 is started whenever a user packet reaches the head (bottom) of the admission buffer 71. Starting at start box 80, decision box 81 is entered to determine if the spacer pool 79 is empty. If not, decision box 81 is continually re-entered until spacer pool 79 is empty, thus insuring the minimum space between successive packets launched into the network.
When the spacer pool 79 is empty, as determined by decision box 81, decision box 82 is entered to determine if the packet at the head of the admission buffer 71 has been premarked green. This green pre marking capability is built into the system of FIGS. 5 and 6 to allow the packet source 70 to mark specified packets as "green" (and hence to be transmitted with guaranteed delay or loss probabilities) regardless of the access control mechanism of FIG. 5. It is possible, of course, to provide the same pre marking capability in the access control arrangements of FIGS. 3 and 4. If the packet is premarked green, decision box 96 is entered to determine if sufficient green tokens have been accumulated to transmit the packet. If not, box 88 is entered to await the accumulation of more tokens, and decision box 82 re-entered to check for preset green marking and decision box 96 is re-entered to check for the accumulation of sufficient green tokens. When sufficient green tokens have been accumulated to transmit the preset green packet, box 97 is entered where the packet is marked green and, in box 98, the green token pool 76 is updated by subtracting the number of tokens necessary to accommodate the preset green packet. The spacer pool is reinitialized in box 93 and the packet transmitted onto the packet network in box 94. The process terminates for that packet in terminal box 95.
If the packet at the head of the packet buffer 71 is not preset green, as determined by decision box 82, decision box 83 is entered to determine if the red marking flag is off. If the red marking flag is off, as determined by decision box 83, decision box 84 is entered to determine if sufficient green tokens have been accumulated to accommodate this packet. If so, box 97 is re-entered to mark this packet green, update the green token pool 76 in box 98, reinitialize the spacer pool 79 in box 93, transmit the green packet in box 94 and terminate the process for this packet in terminal box 95.
If the red marking flag is turned on, as determined by decision box 83, decision box 84 is entered to determine whether a sufficient number of green tokens have been accumulated in green token pool 76 to accommodate this packet. If sufficient green tokens are available, as determined by decision box 84, box 97 is entered as described above to mark the packet green (box 97), decrement the green token pool 76 (box 98), initialize the spacer pool 79 (box 93), transmit the packet (box 94) and terminate the process for this packet (box 95). If, on the other hand, sufficient green tokens have not been accumulated to accommodate this packet, as determined by decision box 84, decision box 87 is entered to determine if sufficient red tokens are available to transmit the packet. The procedure which takes place in decision box 87 will be described below.
If the red marking flag is not turned off, as determined by decision box 83, decision box 85 is entered to determine if the number of tokens in green token pool 76 (N_(g)) is equal to or greater than the green resume threshold 72 (R_(off)). If the number of green tokens equals or exceeds the green resume threshold 72 (R_(off)), box 86 is entered to turn the red marking flag off. Decision box 84 is then entered to determine if sufficient green tokens have been accumulated to accommodate the transmission of this packet. At this time, the answer in decision box 84 should always be "YES" since the number of green tokens is greater than R_(off), as determined in decision box 85. Box 97 is therefore entered to mark this packet green, update the green pool in box 98, initialize the spacer pool in box 98, transmit the packet in box 94 and terminate the process in box 95.
If the number of green tokens in pool 72 is below the green resume threshold 72, as determined by decision box 85, or if sufficient green tokens are not available to transmit this packet, as determined by decision box 84, decision box 87 is entered to determine if sufficient red tokens have been accumulated in red token pool 78 to accommodate this packet. If so, box 90 is entered to turn the red marking flag on, box 91 is entered to mark this packet red, and box 92 is entered to update the red token pool 78 by subtracting the number of tokens necessary to accommodate this packet. Thereafter, box 93 is entered to reinitialize the spacer token pool 79 and box 94 is entered to transmit the red packet. The procedure for this packet then terminates in terminal box 95. Note that the red flag may already be turned on when box 90 is entered, due to previous traversals of the flow chart when processing a previous packet. In that case, the red flag is left on and box 91 is entered as before.
If insufficient red tokens have been accumulated in red token pool 78 to accommodate this packet, as determined by decision box 87, box 89 is entered to turn the red marking flag off. Box 88 is then entered to await the accumulation of more green or red tokens. Decision box 82 is thereafter entered to reinitiate the red-green marking process of FIG. 6, as described above, for
It can be seen that the flow chart of FIG. 6 details the procedure for utilizing a variable amount of hysteresis in the red marking process. More particularly, the green resume threshold 72 (R_(off)) terminates the red marking process if the packet source process produces packets sufficiently slowly so that the green token pool 76 reaches the green resume threshold 72 by the time the next packet is available at the head of buffer register 71. This allows red marking to be initiated and to continue only until the green resume threshold is reached.
The procedure carried out in the flow chart of FIG. 6 can be summarized as follows:
1. A packet at the head of the input buffer 78 first looks to see if the spacer token pool is empty. If not, it waits in the buffer until the token pool becomes empty.
2. Upon finding (or waiting for) an empty spacer token pool, a packet checks if there are enough green tokens in the green token pool to allow its transmission into the network.
3. In case there are not enough green tokens when the spacer pool is empty, the actions to be taken depend on whether or not the packet at the head of the admission buffer 78 is premarked green.
If the packet is premarked green, the packet waits at the head of the admission buffer 78 until enough green tokens have been generated, thereby possibly holding other unmarked packets waiting behind it in the admission buffer 78.
If the packet is not premarked green, red tokens can be used for its transmission. The red marking is then turned on, if it was not already on, and the packet is sent as red if there are enough red tokens left. After the red marking has been tu med on, all the successive unmarked packets are sent marked red until either R_(off) green tokens have been accumulated in the green token pool 76, or not enough red tokens remain to send the next packet, since almost all of the red tokens have already been used to send red packets.
Note that when the spacer token removal rate β is equal to the input peak rate, queuing at the admission buffer 78 occurs only because of premarked green packets, or because the red tokens have been exhausted. If admission buffer 71 had a threshold K, as in FIG. 3, packets could also be waiting for this threshold K tO be reached.
4. In order to limit the number of red packets sent into the network, an upper bound M_(r) is imposed on the maximum number of data units that can be sent as red in any given time interval T. The number of red tokens available is refreshed to its maximum value M_(r) at the beginning of every period T.
With the above procedure of FIG. 6, at transient periods of long bursts of input packets, blocks of red packets will again be interleaved with blocks of green packets. The threshold R_(off) is made large enough to provide sufficient hysteresis to avoid alternating between green and red packets being launched into the packet network. The parameters M_(r), T and β are chosen so that there is sufficient time separation between the blocks of red packets and that the amount of red packets sent into the network in a short period of time does not significantly increase the loss probability of the red packets at intermediate network nodes.
It should also be clear to those skilled in the art that further embodiments of the present invention may be made by those skilled in the art without departing from the teachings of the present invention.
What is claimed is:
1. A system for a source of user data packets to control access to a packet communications network comprisingmeans for marking each packet launched on said network with a high priority marking when the data packets from said source stay within a predefined range of statistical parameters, means for marking each packet launched on said network with a lower priority marking when the data packets from said source fall outside of said predefined range of statistical parameters, and means for prolonging, once started, the marking of packets launched on said network with said lower priority to produce a serial train of packets with said lower priority marking.
2. The system to control access to a packet communications network according to claim 1 further comprisingmeans for limiting the total number of packets with said lower priority marking for each successive fixed time interval.
3. The system to control access to a packet communications network according to claim 1 further comprisingmeans for maintaining at least a minimum space between successive packets launched on said network regardless of their priority markings.
4. The system to control access to a packet communications network according to claim 1 further comprising a network admission buffer having a low priority marking threshold therein for queuing said user data packets, and means for enabling said low priority marking means when the contents of said admission buffer exceeds said threshold.
5. The system to control access to a packet communications network according to claim 1 further comprisingmeans for generating high and low priority tokens for enabling the marking of any one of said packets when sufficient numbers of one or the other of said priority tokens are available to accommodate the number of data units in said one packet, means for storing said tokens for said high priority marking in a high priority token pool, said high priority token storage means having a high priority resume threshold, and means for terminating low priority marking of said packets when said high priority resume threshold is exceeded.
6. A packet communication network including a system for controlling the access to said network at each access point to said network, said access controlling system comprisingmeans for marking each packet launched on said network at each of said access point to said network with a high priority marking when the data packets at said each access point stay within a predefined range of statistical parameters, means for marking each packet launched on said network with a lower priority marking when the data packets at said corresponding each access point fall outside of said predefined range of statistical parameters, and means for prolonging, once started, the marking of packets launched on said network with said lower priority to produce a serial train of packets with said lower priority marking.
7. The packet communications network according to claim 6 further comprisingmeans for limiting the total number of packets with said lower priority marking for each successive fixed time interval.
8. The packet communications network according to claim 6 further comprisingmeans for maintaining at least a minimum space between successive packets launched on said network regardless of their priority markings.
9. The packet communications network according to claim 6 further comprising a network admission buffer having a low priority marking threshold therein for queuing said user data packets, and means for enabling said low priority marking means when the contents of said admission buffer exceeds said threshold.
10. The packet communications network according to claim 6 further comprisingmeans for generating high and low priority tokens for enabling the marking of any one of said packets when sufficient numbers of one or the other of said priority tokens are available to accommodate the number of data units in said one packet, means for storing said tokens for said high priority marking in a high priority token pool, said high priority token storage means having a high priority resume threshold, and means for terminating low priority marking of said packets when said high priority resume threshold is exceeded.
11. A method controlling the access to a packet communications network at each access point to said network, said method comprising the steps of marking each packet launched on said network at each of said access points to said network with a high priority marking when the data packets at said each access point stay within a predefined range of statistical parameters, marking each packet launched on said network with a lower priority marking when the data packets at said each access point fall outside of said predefined range of statistical parameters, and prolonging, once started, the marking of packets launched on said network with said lower priority to produce a serial train of packets with said lower priority marking.
12. The method according to claim 11 further comprising the step of limiting the total number of packets with said lower priority marking for each successive fixed time interval.
13. The method according to claim 11 further comprising the step of maintaining at least a minimum space between successive packets launched on said network regardless of their priority markings.
14. The method according to claim 11 further comprising the steps of queuing said user data packets in a network admission buffer having a low priority marking threshold therein, and enabling said low priority marking means when the contents of said admission buffer exceeds said threshold.
15. The method according to claim 11 further comprising the steps of generating high and low priority tokens for enabling the marking of any one of said packets when sufficient numbers of one or the other of said priority tokens are available to accommodate the number of data units in said any one packet, storing said tokens for said high priority marking in a high priority token pool, said high priority token pool having a high priority resume threshold, and terminating low priority marking of said packets when said high priority resume threshold is exceeded.
|
Same seed, different OS, different random numbers in R
I was experiencing inconsistent results between two machines and a linux server, until I realized that fixing the seed was having different effects. I am running different R versions in all of them, all above 3.3.0. Here are the examples:
Linux 1
> set.seed(10); rnorm(1)
[1] -0.4463588
> version
_
platform x86_64-pc-linux-gnu
arch x86_64
os linux-gnu
system x86_64, linux-gnu
status
major 3
minor 3.0
year 2016
month 05
day 03
svn rev 70573
language R
version.string R version 3.3.0 (2016-05-03)
nickname Supposedly Educational
Linux 2
> set.seed(10); rnorm(1)
[1] 0.01874617
> version
_
platform x86_64-pc-linux-gnu
arch x86_64
os linux-gnu
system x86_64, linux-gnu
status
major 3
minor 4.2
year 2017
month 09
day 28
svn rev 73368
language R
version.string R version 3.4.2 (2017-09-28)
nickname Short Summer
Mac OS
> set.seed(10); rnorm(1)
[1] 0.01874617
> version
_
platform x86_64-apple-darwin15.6.0
arch x86_64
os darwin15.6.0
system x86_64, darwin15.6.0
status
major 3
minor 4.3
year 2017
month 11
day 30
svn rev 73796
language R
version.string R version 3.4.3 (2017-11-30)
nickname Kite-Eating Tree
Windows
> set.seed(10); rnorm(1)
[1] 0.01874617
> version
_
platform x86_64-w64-mingw32
arch x86_64
os mingw32
system x86_64, mingw32
status
major 3
minor 4.1
year 2017
month 06
day 30
svn rev 72865
language R
version.string R version 3.4.1 (2017-06-30)
nickname Single Candle
Linux gives a different random number generation from the same seed, thus making the result of a script run on it not fully reproducible (depending on the OS in which they are re-run, the results will agree or not). This is annoying.
I do not know what is happening here. Particularly:
(1) Is it an issue with R's versions or something more involved?
(2) How can this inconsistent behaviour be avoided? Any help is appreciated.
EDIT originated from @Jesse Tweedle answer (output in Linux 1 in a new session):
> set.seed(10); rnorm(1)
[1] -0.4463588
> set.seed(10); rnorm(1)
[1] -0.4463588
> set.seed(102); rnorm(1)
[1] 0.05752965
> set.seed(10, kind = "Mersenne-Twister"); rnorm(1)
[1] 0.01874617
> set.seed(10); rnorm(1)
[1] 0.01874617
> set.seed(102); rnorm(1)
[1] 0.1805229
See https://stackoverflow.com/questions/47199415/is-set-seed-consistent-over-different-versions-of-r-and-ubuntu for someone who finds consistent random numbers using set.seed across OSes / Rs.
So you know how R was installed on linux 1? Built from source? Did it use use custom flags during compilation? If using a standard build I would expect the random numbers to be the same across all (recent) builds. I don't think this has changed in R in a long time.
@MrFlick Unfortunately I do not know how R was installed on Linux 1.
From docs:
Random docs:
RNGversion can be used to set the random generators as they were in an earlier R version (for reproducibility).
So try this on all systems:
set.seed(10, kind = "Mersenne-Twister", normal.kind = "Inversion"); rnorm(1)
[1] 0.01874617
So if you call RNGkind() on "Linux 1" it says [1] "Mersenne-Twister" "Inversion"?
This! I still do not know what was happening exactly, but this does the trick. (I edit the question for proper format). To your comment: yes it does.
Ok, great. I forgot to add normal.kind argument at first (since you're generating random normals, and the second argument is specifically for normals).
@epsilone Please see the answer here for an explanation of why the two Linux results differ. https://stackoverflow.com/a/56381613/5373794
|
How can I speed up the process of integrating a complex function?
import numpy as np
from scipy import integrate
import matplotlib.pyplot as plt
import datetime
start = datetime.datetime.now()
plt.rcParams['axes.grid'] = True
XX=[None, 11.3, 14.8, 7.6, 10.5, 12.7, 3.9, 11.2, 5.4, 8.5, 5.0, 4.4, 7.3, 2.9, 5.7, 6.2, 7.3, 3.3, 4.2, 5.5, 4.2]
I = [None,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20]
N=20
# Задаем G-ю функцию которая включает в себя произведения плотностей вероятности
# каждого независимого результата Xi в которых МО и СКО изменяются по линейной зависимости
def G(M1, Mn, S1, Sn):
def loc (M1, Mn, i, n):
return (M1*(n-i)/(n-1)) + (Mn*(i-1)/(n-1))
def scale (S1, Sn, i, n):
return (S1*(n-i)/(n-1)) + (Sn*(i-1)/(n-1))
def fnorm (x):
return (np.exp((-x**2)/2))/(np.sqrt(2*np.pi))
def y (M1, Mn, S1, Sn, i, n, x):
return (x-loc(M1,Mn,i,n))/scale(S1,Sn,i,n)
def F (M1, Mn, S1, Sn, i, n, x):
return (fnorm(y(M1, Mn, S1, Sn, i, n, x)))/scale(S1, Sn, i, n)
# Распаковка значений x и i из глобальных переменных
x = XX[1:]
i = I[1:]
n=N
# Вычисляем значение функции F для каждого x и i
values=[F(M1, Mn, S1, Sn, i_val, n, x_val) for i_val, x_val in zip(i, x)]
# Вычисляем произведение всех значений
result = np.prod(values)
return result
# находим сомножитель К для получения общей ПВ оценок
options={'epsrel':1e-20, 'epsabs':1e-20}
K, errorK = integrate.nquad(G, ranges=[[0, 30],[0, 10],[0, 10],[0, 10]], opts=[options, options, options, options])
# K = 2.9613332457351404e-18 errorK = 9.999171231431291e-21
# формируем ПВ оценок
def pdf(Mn, S1, Sn, M1):
return (G(M1, Mn, S1, Sn) / K)
# строим график автономной ПВ оценок для параметра М1 (уменьшаем значения ошибок для оперативности)
def pdf_m1 (M1):
return [(integrate.tplquad(pdf, 0, 10, 0, 10, 0, 10, args=(m,), epsabs=0.1, epsrel=0.1)[0]) for m in M1]
x = np.arange(4, 16, 0.2)
plt.plot(x, pdf_m1(x), 'k', lw=3)
plt.ylim(bottom=0)
plt.title('Fm1(m1)')
plt.show()
# находим несмещенную оценку М1 и её ско sm1 (примерные значения по методу ММП М1 = 9.66)
def F1 (M1):
return integrate.tplquad(pdf, 0, 10, 0, 10, 0, 10, args=(M1,))[0]
M1, _ = integrate.quad(lambda M1: M1 * F1(M1), 4, 16)
print(M1)
Dm1, _ = integrate.quad (lambda x: ((x-M1)**2) * F1(x), 4, 16)
sm1 = np.sqrt(Dm1)
print(sm1)
print("Время вычисления М1 и СКОм1:", datetime.datetime.now()-start)
The problem is efficiency. The code is running for so long, taking up to 15 hours! The task is mostly based on integrating functions. The example only considers integration for one variable, but in reality, you need to integrate for every variable specified in the PDF.
I use the Spyder IDE for this project.
I need to integrate functions with 4 variables or more.
Just few tips: 1. remove the plotting stuff, 2. create smaller example (that runs in shorter time), 3. use cProfile to determine where your code spends the most time, 4. make the comments in english. If you identify the bottlenecks I suggest to [edit] your question with the findings.
Alexey, depending on the number of dimensions, you might need to consider different algorithms. In a small number of dimensions, repeated 1-d methods and their generalizations are effective, but the number of function evaluations increases exponentially. In a large number of dimensions, Monte Carlo methods are the only workable approach from what I know. In between, maybe around 4 to 6, I forget, there is a spot where quasi-MC (also called low discrepancy sequences) is more efficient than MC. Good luck and have fun.
I edited according to your comments and used qmc. Values of K = 0
TLDR: avoid impossible tolerances and consider QMC integration.
One thing that would help is to avoid specifying tolerances that cannot possibly be achieved. Double precision floats have an epsilon on the order of 1e-16, so you cannot possibly hope to achieve 1e-20 relative error, but it has a huge impact on your runtime.
Consider, for instance:
from time import perf_counter
from scipy.stats import multivariate_normal
from scipy.integrate import nquad
rng = np.random.default_rng(23925340854238936)
options={'epsrel':1e-20, 'epsabs':1e-20}
for d in range(1, 4):
cov = rng.random((d, d))
cov = cov @ cov.T
dist = multivariate_normal(cov=cov)
x = np.asarray([(0, 1)]*d)
tic = perf_counter()
res = nquad(lambda *x: dist.pdf(x), x)
# res = nquad(lambda *x: dist.pdf(x), x, opts=[options]*d)
toc = perf_counter()
print(toc - tic)
ref = dist.cdf(x[:, 1], lower_limit=x[:, 0])
# 0.0012877020001269557
# 0.08465272499984167
# 0.5809959000000617
The execution time of numerical integration scales very poorly with dimensionality, and the curse is exacerbated by the tight tolerances. When we use your tolerances, the runtimes look like:
# 0.004921189000015147
# 0.4714967869999782
#<PHONE_NUMBER>7999994
And all that time gave very little in terms of improved accuracy. With no option, the error of the 3d integral is res[0] - ref = 4.969670549248573e-07, and when we use the tolerances, the error is -3.4931814399397076e-07.
In fact, for your quadruple integral, we can already see:
# K = 2.9613332457351404e-18 errorK = 9.999171231431291e-21
The second number is an absolute error estimate. I'm not sure what the true error is, but this means that the estimated relative error is around 3e-3. If you're not achieving great accuracy anyway, you might as well use scipy.integrate.qmc_quad, which can get reasonable accuracy in much less time.
from time import perf_counter
import numpy as np
from scipy.integrate import nquad, qmc_quad
from scipy.stats import multivariate_normal
rng = np.random.default_rng(23925340854238936)
d = 4
cov = rng.random((d, d))
cov = cov @ cov.T
dist = multivariate_normal(cov=cov)
x = np.asarray([(0, 1)]*d)
ref = dist.cdf(x[:, 1], lower_limit=x[:, 0])
tic = perf_counter()
res = nquad(lambda *x: dist.pdf(x), x)
toc = perf_counter()
print(f"nquad | Time: {toc - tic}, Error: {abs((res[0] - ref)/ref)})")
tic = perf_counter()
res = qmc_quad(lambda x: dist.pdf(x.T), *x.T)
toc = perf_counter()
print(f"qmc_quad | Time: {toc - tic}, Error: {abs((res[0] - ref)/ref)})")
# nquad | Time: 13.483493682000244, Error: 2.8983787517192293e-05)
# qmc_quad | Time: 0.0281571279997479, Error: 0.000120747399615769)
If you need better accuracy from qmc_quad in the same amount of time (at the expense of error estimate accuracy), decrease n_estimates and increase n_points by the same factor. If you can spare time for increased accuracy - since this is already a massive speedup - just increase n_points.
Thanks!!! I edited according to your comments and used qmc. But I have values of K = 0 ((( Look please.
That's a different question. This question is about speeding up high dimensional integral calculations, and it sounds like you have your answer. I would suggest writing a new question in which you give a minimal reproducible example (https://stackoverflow.com/help/minimal-reproducible-example) of using qmc_quad and getting an integral of zero where that is unexpected. To show that the problem is specific to qmc_quad, show that nquad gives a finite nonzero result for the same problem. Include all code required to run the example and no more.
I'd also recommend reverting your recent changes to the question. You completely changed the code, so it is no longer consistent with the title or the answer. S.O. is about creating a repository of questions and answers that are useful to others, not just solving your problem.
|
Bell Globemedia
Background
(2001-December 31, 2006)
Variants:
* There is a short version of this logo.
* On a TSN SportsCentre airing, a very short version of this logo is used.
Technique: CGI.
Music/Sounds: The theme from the 1998-2011 CTV rebrand, with some whooshes.
|
LED lights become darker?
I build myself a light with many small LEDs. They are quite powerful. I superglued ever LED board (the LEDs where in parts of 3 on a small circuit board) to an aluminium piece to dissipate the heat.
But I think they got darker after the first month of usage (approximately 6 h a day) and the are getting quite hot.
Is it possible that the LEDs are loosing their brightness because they can't dissipate the heat well enough through the superglue?
How are you driving those LED's? What power and current rating do they have?
Junk LEDs? Driven too hard? Do they have a brown spot in the middle of the phosphor? Superglue is not a good thermal conductor. How hot are the LEDs?
So the LEDs are from Samsung and are driven by one of those constant current sources for LEDs with 350mA. Indeed some have a darker touch to them in the middle. I wasn't able to measure the heat but I would guess around 60°C
the superglue isn't ideal, but it's not terrible either if kept thin; you probably need to lower the amount of power fed to the LEDs, even if you find better adhesive.
Yes that is possible. Use a thermally conductive glue. It also helps to maximise the copper area connected to the LEDs to spread out the heat over a larger area - the copper will conduct the heat a lot better than the PCB material or the glue. Use a lot of vias to conduct it to the backside of the PCB where it is glued.
Also make sure, that you are driving the LEDs according to their specification - cheap circuits might make the problem worse the hotter the LED gets (thermal runaway).
Yes, I think that's the way. I used some high grade Samsung LEDs and a constant current source of 350mA. This should be good for my LEDs, so I think they are correctly supplied. I will look for a thermal glue.
|
ggplot2 fails to load
ggplot fails to load. I uninstalled ggplot2 and reinstalled. Then uninstalled ggplot2 again, uninstalled R 3.2.2, reinstalled R 3.2.2, reinstalled ggplot2. Same errors. scales.rdb corrupted, internal error -3.
This is the first time I attempted to use ggplot2 with Windows 10 OS. Error message + sessionInfo below. I see that the sessionInfo has R running under Windows 8, but Windows 10 is installed. I don't know if that is meaningful.
Any feedback is appreciated.
I figured it out. the scales.rdb file was corrupted. re-installing scales as install.packages("scales") did not work. install.packages("scales", dependencies = TRUE) did work.
> library(ggplot2)
Error in get(Info[i, 1], envir = env) :
lazy-load database 'C:/Users/sbmack/Documents/R/win-library/3.2/scales/R/scales.rdb' is corrupt
In addition: Warning message:
In get(Info[i, 1], envir = env) : internal error -3 in R_decompress1
Error: package or namespace load failed for ‘ggplot2’
> sessionInfo()
R version 3.2.2 (2015-08-14)
Platform: x86_64-w64-mingw32/x64 (64-bit)
Running under: Windows 8 x64 (build 9200)
locale:
[1] LC_COLLATE=English_United States.1252 LC_CTYPE=English_United States.1252 LC_MONETARY=English_United States.1252
[4] LC_NUMERIC=C LC_TIME=English_United States.1252
attached base packages:
[1] graphics grDevices utils datasets stats methods base
other attached packages:
[1] tidyr_0.3.1 dplyr_0.4.3
loaded via a namespace (and not attached):
[1] Rcpp_0.12.1 digest_0.6.8 assertthat_0.1 grid_3.2.2 plyr_1.8.3 R6_2.1.1 gtable_0.1.2 DBI_0.3.1
[9] magrittr_1.5 stringi_1.0-1 reshape2_1.4.1 proto_0.3-10 tools_3.2.2 stringr_1.0.0 munsell_0.4.2 parallel_3.2.2
[17] colorspace_1.2-6
Reinstall package scales?
reinstalling doesn't help
I had a similar issue with my R studio This worked for me--
Tools->Check for Package updates-->select all and update
Restart R session with .rs.restartR()
install ggplot2 again and problem solved!
For a more detailed discussion and other solutions, please refer to this thread--Error in fetch(key) : lazy-load database
|
Minor tweaks and multi-GPU example
I tweaked the output of a few places to use warnings instead of print() and added a toy multi-GPU example. I was working on getting my code going on multiple GPUs and had adapted the toy example as a test, so it might be instructional to others.
Thanks a lot for adding that example (as well as for the small tweaks)
Does your run learn something reasonable? I was running the code and only got quite bad segmentations:
How does yours look?
It had been working for me on another computer but this was using a previous version of DLTK. I was able to reproduce your issue on other computers and it took a while to figure out the differences. At some point the definition of dice_loss() has been changed to no longer function correctly with one class. See the previous definition here: https://github.com/DLTK/DLTK/blob/5f78c9ce5318819dfe1639f8255df3d95d651e86/dltk/core/modules/losses.py
If I copy-paste that version of dice_loss() into either toy examples they work again. I guess the change got lost in someone's commit that was slightly outdated?
Oh alright! Sorry about that - I must have missed that when merging some things in recently. I'll merge your PR and fix the issue ASAP.
Thanks for spotting this :)
No worries! I had made up the example as a test so it's doing it's job.
|
Can you add more icons which contain "Facebook Lite, Facebook, Messenger, Messenger Lite"
Can you add more icons which contain "Facebook Lite, Facebook, Messenger, Messenger Lite"
Hello! It would appear that this icon request doesnʼt include the package names of some or all of the apps for which icons have been requested. In addition, we are switching to a new system for icon requests. The apps for which package names have been provided (if such apps exist in this icon request) have been added to the new icon request database, meaning no action is required. For the apps for which package names havenʼt been provided, please submit an icon request via the new icon request form: https://forms.gle/Fx8vZAiWdW1Tyjo57.
|
using System;
using System.Collections.Generic;
using System.Linq;
using System.Reflection;
using Microsoft.EntityFrameworkCore;
using Reinforced.Tecture.Aspects.DirectSql.Infrastructure;
namespace Reinforced.Tecture.Runtimes.EFCore.Aspects.DirectSql.Runtime
{
class EfCoreMapper : IMapper
{
private readonly ILazyDisposable<DbContext> _context;
public EfCoreMapper(ILazyDisposable<DbContext> context)
{
_context = context;
}
public string GetTableName(Type t)
{
var mapping = _context.Value.Model.FindEntityType(t);
if (mapping==null)
throw new EfCoreDirectSqlException($"Mapping for '{t}' was not found");
var tableName = mapping.GetTableName();
return tableName;
}
public string GetColumnName(Type t, PropertyInfo property)
{
var mapping = _context.Value.Model.FindEntityType(t);
if (mapping == null)
throw new EfCoreDirectSqlException($"Mapping for '{t}' was not found");
var p = mapping.GetProperties().FirstOrDefault(x=>x.Name==property.Name);
if (p==null)
throw new EfCoreDirectSqlException($"Column '{property.Name}' was not found in mapping for '{t}'");
return p.GetColumnName();
}
public bool IsEntityType(Type t)
{
return _context.Value.Model.FindEntityType(t) != null;
}
public IEnumerable<AssociationFields> GetJoinKeys(Type sourceEntity, PropertyInfo sourceColumn)
{
var mdl = _context.Value.Model.FindEntityType(sourceEntity);
var fks = mdl.GetForeignKeys();
foreach (var foreignKey in fks)
{
if (foreignKey.DependentToPrincipal.PropertyInfo == sourceColumn)
{
for (int i = 0; i < foreignKey.Properties.Count; i++)
{
var fkProperty = foreignKey.Properties[i];
var pkProperty = foreignKey.PrincipalKey.Properties[i];
yield return new AssociationFields()
{
To = fkProperty.GetColumnName(),
From = pkProperty.GetColumnName()
};
}
}
}
}
}
}
|
Thomas Rundqvist
Per Thomas Rundqvist (born 4 May 1960 in Vimmerby, Sweden) is a retired Swedish professional ice hockey player and now sporting director of Färjestads BK.
Rundqvist started his senior ice hockey career in 1978 with the Swedish club Färjestads BK. He played with the club until 1984, when he crossed the Atlantic and signed with the Montreal Canadiens (who had drafted him in 1983 (10th round, 198th pick overall)). But Rundqvist played only two games with the Canadiens in the 1984–85 season, the rest of the year he played with Sherbrooke Canadiens in the AHL. So after only one year he went back to Sweden and Färjestad. He played six more season with them, but in 1993 he and his teammate in Färjestad Bengt-Åke Gustafsson signed for the Austrian team Feldkirch VEU. Rundqvist played there for five years and ended his career in 1998. Now (2006) he is working in the Färjestads BK's organisation.
Färjestads BK has retired Rundqvist's jersey number, #9.
Rundqvist was inducted into the IIHF Hall of Fame in 2007.
Achievements
* Swedish Championship winner: 3 (1981, 1986, 1988)
* Austrian Championship winner: 5 (1994, 1995, 1996, 1997, 1998)
* World Championships winner: 2 (1987, 1991)
* World Championships second place: 3 (1986, 1990, 1993)
* Olympic bronze medal: 2 (1984, 1988)
* Canada Cup third place: 2 (1987, 1991)
|
Prove $k$-regular graph with odd number of vertices has $\chi'(G) \geq k+1$
Prove $k$-regular graph with odd number of vertices has $\chi'(G) \geq k+1$, where $\chi'(G)$ is the edge-coloring number of graph $G$.
Here's what I've done so far:
Let $G=\langle V,E\rangle$ be a $k$-regular graph with $n=2m+1$ vertices. Since the sum of degrees of a graph is even, $kn$ is even, which means $k$ must be even. So $k=2\ell$ for some $\ell$, so the number of edges for $G$ is $$\frac{kn}2=\frac{2\ell(2m+1)}2=\ell(2m+1)$$
I'm stuck at here, how should I proceed next? Thanks for any help.
Possible duplicate of Graph theory: Prove $k$-regular graph $#V$ = odd, $\chi'(G)> k$
We know the number of edge endpoints is $kn$.
If there are $c$ colors, then some color must have at least $kn/c$ edge endpoints.
What is the maximum number of endpoints $M$ a single color can have? We must have $kn/c \leq M$. And what happens when $c=k$?
|
Impairments, health conditions and health risk behaviors: occurrence and associations, in the National Health Survey, Brazil, 2019
ABSTRACT Objective To analyze association of visual, hearing, mental/intellectual, physical and multiple impairments with health conditions and health risk behaviors in Brazil. Methods This was a cross-sectional study, using data from the 2019 National Health Survey; associations between impairments and presence of cardiovascular disease (CVD), hypertension, diabetes mellitus (DM), high cholesterol, alcohol abuse and smoking were estimated using logistic regression, thus obtaining the odds ratios (OR). Results Impairment was reported by 7.6% of the 90,846 participants. Having a impairment was associated with greater odds of reporting chronic conditions, especially CVD (OR = 2.11; 95%CI 1.76;2.54) and DM (OR = 1.78; 95%CI 1.56;2.02 ); visual impairment was associated with greater odds of smoking (OR = 1.52; 95%CI 1.28;1.81); mental/intellectual impairment was inversely related to smoking (OR = 0.45; 95%CI 0.30;0.67) and alcohol abuse (OR = 0.13; 95%CI 0.06;0.26). Conclusion Having any of the impairments studied may be associated with greater odds of having chronic health conditions.
INTRODUCTION
In 2019, approximately 1.5 billion people worldwide lived with some type of impairment, according to data relating mainly to low-and middle-income countries such as Brazil. 1 Furthermore, generally speaking, levels of poverty and social exclusion are higher among people with impairments, which makes them even more vulnerable to health problems.Impairments may imply less access to health services, as these services often present physical accessibility and communication barriers associated with the stigma to be faced by this segment of the population. 2 P e o p l e w i t h p h y s i c a l a n d m e n t a l impairments have greater difficulty in adopting health-promoting behaviors; 3,4 for example, such impairments can lead to diff iculties in purchasing food, impacting their food choices, 5 in addition to diff iculties in doing physical activities, due to environmental barriers and specific conditions of people with impairments. 4A study conducted in the United States, between 2002 and 2010, showed that people with physical and mental impairments were more prone to all types of substance abuse, including alcoholic beverages and tobacco. 6In this sense, having risk behaviorsi.e.use of these substances -could contribute to an increase in chronic health conditions. 2,3,7e United Nations Convention on the Rights of Persons with Impairments advocates people with impairments having the right to an adequate standard of living and social protection. 8Although it is more common for the impact of chronic diseases on the occurrence of impairments to be analyzed, the inverse relationship has been increasingly studied, based on social mechanisms that produce adverse health events in people with impairments. 9ere are few studies that investigate association between th e presen ce of impairment(s) and their multiple occurrence with unhealthy behaviors. 4However, the studies we did f ind were conducted in developed countries. 4,6One of those studies was conducted in the United States based on data f rom the national survey on drug use and health between 2002 and 2010, investigating the presence of impairments, without specifying the type of impairment, as well as the presence of multiple impairments, together with the occurrence of smoking, alcohol abuse and other drugs.Another of those studies was conducted in Australia using data from the 2015 National Health Survey.It investigated the relationship between physical, visual, hearing and mental impairments; but did not evaluate the simultaneous presence of these events with alcohol abuse, smoking, physical activity and obesity.The conclusion reached by both studies was that people with impairments are more prone to unhealthy behaviors. 4,6derstanding the association of different impairments with chronic health conditions and health risk behaviors offers a framework of essential information for health service management, including discussion of possible shortcomings in providing and ensuring access to health services and information.Studying possible association helps to understand which population profile most needs attention, based on the assumption of equity in health care and the permanent quest for better quality of life and longevity for the population.
The objective of this study was to analyze association of visual, hearing, mental/ intellectual, physical and multiple impairments with health conditions and health risk behaviors in Brazil.
METHODS
This was a cross-sectional study using data from the 2019 National Health Survey (Pesquisa Nacional de Saúde -PNS), conducted by the Brazilian Institute of Geography and Statistics (Instituto Brasileiro de Geografia e Estatística -IBGE), the Brazilian Ministry of Health and the Oswaldo Cruz Foundation (Fiocruz). 10The survey covered people aged 15 years or more. 10e National Health Survey uses a complex sampling plan, originating f rom a master sample, consisting of a plan comprised of clusters, with three selection stages, covering the entire national territory.The detailed description of the 2019 National Health Survey sampling def inition methodology and the study design can be found in a specif ic publication. 11Data were collected from 94,114 households, with a 96.5% response rate.The inclusion criteria were: being aged 18 or over, availability of sociodemographic information and information on the occurrence of impairments, lifestyle, diseases and chronic health conditions.Participants under the age of 18 were excluded from the analysis; as were those who self-reported Indigenous race/skin color, as recommended by the IBGE, since they are small in number and their coefficient of variation is high.The final study population consisted of 90,846 participants.The freely accessible National Health Survey database can be found on the IBGE website [https://www.ibge.gov.br(accessed on December 18, 2022)]. 10e study outcomes were cardiovascular disease (CVD), hypertension, diabetes mellitus (DM), high cholesterol, alcohol abuse and smoking.Information about these outcomes was obtained by directly asking the participants the following questions: The answer option for all these questions was "yes" or "no".
The exposure variables were presence of visual, hearing, physical, mental/intellectual and multiple impairments -"yes" or "no" -, reported by means of the following questions: The "multiple impairment" exposure variable was considered to exist when the person had two or more impairments (visual, hearing, physical; mental or intellectual). 12 they were related, both to exposures and to outcomes, the following variables were used for adjustments: a) age (at last birthday: 18 The characteristics of the population were presented using means or frequencies, with respective 95% confidence intervals (95%CI).The prevalence rates and 95%CI of health conditions and health risk behaviors were described according to the presence of visual, hearing, physical (upper and/or lower limbs), mental or intellectual impairment, and multiple impairments.The magnitudes of associations between types of impairments, as well as the occurrence of one or more impairments simultaneously, and health conditions and health risk behaviors were estimated by logistic regression, obtaining the odds ratios (OR) and their respective 95%CI as measures of effect, based on a 5% significance level.
Multivarible analysis of associations was performed using a hierarchical model, organized into three blocks of sequential adjustments, namely: a) the f irst model included social aspect variables, such as age, race/skin color and sex -proximal level; b) the second model was adjusted for demographic variables, such as schooling, income, Brazilian macro-region and area of residence -intermediate level; and c) in the third model the two health-related variables were: a visit by a community health worker or Family Health team in the last 12 months; and having health insurance -distal level (Figure 1).
The analyses were adjusted according to these levels, taking a 5% significance level.
The Hosmer & Lemeshow test was used to estimate the fit of the multivarible models.The statistical analyses were performed using Stata 15.0 (Stata Corporation, College Station, Estados Unidos), whereby complex sampling effects were considered using the survey command.
RESULTS
Out of 94,114 people eligible for the study, 90,846 participants comprised the final sample.Losses corresponded to 3.5% that did not meet the inclusion criteria.Table 1 shows the characteristics of the population studied.There was a higher proportion of people in the 35-44 age group (20.5%), female sex (53.0%), mixed race (44.4%) and schooling level equivalent to incomplete elementary education (34.3%).Furthermore, 29.2% reported receiving between ½ and 1 minimum wage monthly; most of the interviewees (85.9%) lived in urban areas and 43.1% lived in the Southeast macro-region (Table 1).
Table 2 describes health conditions and health risk behaviors among those who reported having impairment.In all types of impairment, hypertension, followed by high cholesterol, were the chronic health conditions with the highest prevalence, in particular with regard to physical impairment [hypertension = 58.4% (95%CI 56.2;60.6)and high cholesterol, 32.4% (95%CI 30.2;34.6)].Alcohol abuse and smoking had lower prevalence, particularly among those with mental/intellectual impairment [alcohol abuse = 1.7% (95%CI 0.9;2.9)and smokers = 7.5% (95%CI 5.5;10.3)].Higher prevalence of health conditions and lower risk behaviors was found among those who reported more than one impairment, compared to those with only one impairment.
Table 3 shows the associations between types of impairments and health conditions and health risk behaviors.After sequential adjustments for sex, age, race/skin color, schooling, income, Brazilian macro-region, rural/urban area and access to health services, the odds of people with physical impairment having CVD, hypertension, DM and high cholesterol were 2.39 (95%CI 1.99; 2.87), 1.78 (95%CI 1.56;2.03),1.95 (95%CI 1.66;2.30)and 1.60 (95%CI 1.39;1.84), respectively, when compared to those without impairments.Similar results were found for visual impairment and when there was one impairment, or two or more impairments.Presence of mental/intellectual impairment was associated with lower odds of alcohol abuse (OR = 0.13; 95%CI 0.06;0.26)and smoking (OR = 0.45; 95%CI 0.30;0.67).Lower odds of alcohol abuse were also found when there was one physical impairment (OR = 0.48; 95%CI 0.38;0.60)and when there were multiple impairments (OR = 0.44; 95%CI 0.30;0.64).
ORIGINAL ARTICLE
Impairments and risk behaviors
DISCUSSION
In this study based on national data, it could be seen that having some type of impairment, such as visual, hearing, physical, mental/ intellectual impairment, may be associated with greater odds of having CVD, hypertension, DM and high cholesterol.Some magnitudes of association were stronger when two or more impairments were present simultaneously.An inverse association was found between presence of physical, mental/intellectual and multiple impairments, and smoking.Furthermore, presence of the impairments mentioned above was associated with lower odds of alcohol abuse.The results suggest that people who have some type of impairment may be more susceptible to developing chronic health conditions, compared to those without impairments.These findings reinforce what is presented in the National Health Policy for People with Impairments (Política Nacional de Saúde da Pessoa com Deficiência), 13 namely that impairments can be risk factors for the development of health conditions, and thus point to the need for impairments to be the object of specific policies.
The differences found in this study can be explained, in part, by socioeconomic aspects related to impairments, since they have already been associated with lower levels of schooling, lower employment rates, lower income and consequently, more precarious access to health systems and rehabilitation services, these being important factors related to the management of good health conditions. 14Furthermore, socioeconomic factors have been identified as being relevant in association of physical/ sensory impairments with health conditions, also leading to an increase in social exclusion and stress. 2,15orer living conditions have also been identif ied as being associated with the development of depression, anxiety and other mental disorders. 16This situation can result in behaviors that are harmful to health, such as abusive use of drugs (tobacco, alcohol) and excessive consumption of foods with high energy density, these being factors that are also related to the development of chronic health conditions. 16 United States study, carried out 465 participants from the Psychology Department of the Louisiana State University in 2019, identif ied that anxiety is more common in people with visual impairment than in the general population. 17Taking this into consideration, anxiety could be a mediator between this impairment and smoking, as it has been related to the use of electronic cigarettes and tobacco in the general population. 18me physiological conditions underlying impairments themselves could also play an important role in the relationship between impairments and greater odds of having cardiovascular disease, hypertension, diabetes mellitus and high cholesterol.[21] When analyzing association between impairments and alcohol abuse, it can be seen that physical impairment and mental/ intellectual impairment contribute to reducing the odds of adopting this behavior.Population studies carried out in the United States in 2011, and in Australia in 2015, showed that people with impairment were less prone to alcohol abuse. 4,6his f inding can be related to limitations caused by impairment, such as reduced mobility, in some cases, greater dependence on third parties, and lower income, 15,22 23 identified that people with physical impairments consumed 20% more medications than people without impairments; and that diuretics and analgesics were among the most used medications, 24 with which alcohol could interact.As this is a possible factor in reducing alcohol consumption,
ORIGINAL ARTICLE
Impairments and risk behaviors new research is needed in order to deepen knowledge on the topic.
Environmental barriers to access to health services are also something to question, as a contributory factor to the greater vulnerability of the health conditions of people with impairments, since impairment can limit access and thus hinder seeking care. 14,22,25A study carried out in Chile, with data from the 2013 National Health Survey, demonstrated that people with physical impairment were three times more likely to report mobility difficulties in getting care at health services. 25In Brazil, a survey carried out in 38,811 primary health centers in 5,543 municipalities, between 2012 and 2013, showed that only 21% of services had professionals trained to care for service users with sensory impairments, and only 1% of health centers had auditory resources and support material available. 15As such, people with impairments could encounter difficulties in accessing health information, which would also contribute to greater vulnerability in relation developing chronic health conditions and adopting health risk behaviors.
This study has some limitations.Standing out among them is reverse causality, which does not allow a causal relationship to be established between exposures and outcomes.Therefore, it is possible that the health conditions investigated appeared temporally, before the occurrence of impairments.In the 2019 edition of the National Health Survey no data were collected regarding the nature of impairments (congenital or acquired), which could clarify the temporal relationship between exposures and outcomes assessed.Furthermore, as the information on impairments gathered by the National Health Survey was self-reported, i.e. provided by the participants themselves, this could lead to distor tions such as underestimation or overestimation, due to inadequate understanding of the questions, especially in the case of participants with more pronounced mental or intellectual impairments.
Despite the aforementioned limitations, this study has strengths to be considered, with emphasis on investigation of multiple i m p a i rm e n t s a n d t h e i r s i m u l t a n e o u s relationship, shedding light on the possible cumulative impacts of these impairments on the outcomes found.Furthermore, several outcomes were analyzed, which could help to gain a better understanding of the relationship between impairments, chronic health conditions and risk behaviors.It is worth highlighting that, even after adjusting for possible confounding elements, the associations found remained, which indicates the robustness of the findings.
In conclusion, impairments were associated with greater risk of chronic health conditions, a possible result of shortcomings in health information accessibility and access to services.Positive and negative associations were found with regard to adopting health risk behaviors, indicating that some impairments can protect against alcohol abuse and smoking.Thus, in order to achieve greater equity in comprehensive health care for people with impairments, it is necessary to take a more discerning look at the control and prevention of chronic health conditions and health risk behaviors, with the aim of ensuring healthy aging, with greater functioning for those with impairment.
Palabras clave: Personas con Discapacidad; Enfermedad Crónica; Comportamientos de Riesgo para la Salud; Estudios Transversales
a) 95%CI: 95% confidence interval; b) Model 0 = without adjustment (crude model); c) Model 1 = Model 0 + adjustment for age, race/skin color and sex; d) Model 2 = Model 1 + adjustment for schooling, income, Brazilian macro-region and area of residence; e) Model 3 = Model 2 + visit by community health worker (agente comunitário de saúde -ACS) or Family Health team in the last 12 months + health insurance.Note: Values in bold type correspond to odds ratios (ORs) with p-value < 0.05.
The 2019 National Health Survey project was submitted to the National Health Council National Research Ethics Committee, and was approved as per Opinion No. 3.529.376,dated August 23, 2019.
Table 2 -Prevalence of health conditions and health risk behaviors according to visual impairment, hearing impairment, physical impairment (upper and/or lower limbs), mental/ intellectual impairment and multiple impairment in the study population (N = 90,846), National Health Survey, Brazil, 2019
a) 95%CI: 95% confidence interval.
|
Syllepte atrisquamalis
Syllepte atrisquamalis is a moth in the family Crambidae. It was described by George Hampson in 1912. It is endemic to Tanzania.
The wingspan is about 32 mm. The forewings are yellowish white with small spots formed of aggregated black scales beyond the lower angle of the cell below veins 5, 4 and 3. The hindwings are yellowish white with an irroration of large black scales in, beyond and below the end of the cell.
|
We derive a theoretical relation between $R_{BLR}$, the size of the
broad-emission-line region of active galactic nuclei, and the observed soft
X-ray luminosity and spectrum. We show that in addition to the well known
$R_{BLR}\sim L^{1/2}$ scaling, $R_{BLR}$ should depend also on the soft X-ray
spectral slope and derive the expected relation between $R_{BLR}$ and the X-ray
luminosity and spectral index. Applying this relation to calculate a predicted
BLR radius for ten AGN with reverberation data, we show that including the
dependence on the spectrum improves the agreement between the calculated BLR
radius and the radius independently determined from reverberation mapping.
Similarly, we evaluate an expression for the line width, and show that
including the dependence on the spectrum significantly improves the agreement
between the calculated BLR velocity dispersion and the observed FWHM of the
H$\beta$ line.
|
Page:Confederate Military History - 1899 - Volume 7.djvu/709
218 Stephens, Colonel Dyer, Colonel Adair and Major Magee were wounded, and Col. W. W. Witherspoon was killed. Four Mississippi regiments lost their colors under the most gallant circumstances. The color-bearers of the Third and Twenty-second, General Featherston reported, planted their colors on the enemy's works and were wounded and captured. The color-bearer of the Thirty-third was killed some fifteen paces from the works, when Lieut. H. C. Shaw carried them forward, and when in the act of planting them on the works was killed, his body falling in the trench, the colors in the works. The flag of the Fifteenth was also lost, after four men had been shot down in bearing it. Sears' brigade, foremost amid the forlorn hope, fought with wonderful intrepidity. The names of the officers and men of this brigade who reached the main line of the enemy's works are now honorably recorded in the war records of a reunited people. With the same heroism the Mississippians of Cleburne's division had fought, and many of them died with Cleburne. Colonel Tison and Col. John Weir were among the severely wounded.
The division of Gen. Edward Johnson came up to the battlefield in the darkness of the evening and charged upon the works, moving against the enemy under a heavy fire of artillery and musketry, and gaining portions of the intrenched line. Gen. S. D. Lee reported: "The brigades of Sharp and Brantly (Mississippians) and Deas (Alabamians) particularly distinguished themselves. Their dead were mostly in the trenches and on the works of the enemy, where they nobly fell in a desperate hand-to-hand conflict. Sharp captured three stand of colors. Brantly was exposed to a sharp enfilade fire. These noble brigades never faltered in this terrible night struggle." Among the killed were Col. W. H. Bishop and Maj. G. W. Reynolds. Lieut.-Col. W. H. Sims, Capt. J. M. Hicks, Lieut.-Col. J. M. Johnson, all
|
Posting XML data to a Web Service via Console App
I have a web service in my QA box that accepts and process an XML string, send an email and then returns another XML string. To test it, I want to overload it by making a console app to call it by sending it an XML, making make a loop in the console app so it sends it 1,000 times in one shoot. I seen a lot of sample in the internet but I can't get them to work.
This is what I have:
using System;
using System.Collections.Generic;
using System.IO;
using System.Linq;
using System.Net;
using System.Text;
using System.Threading.Tasks;
using System.Xml;
using System.Xml.Linq;
namespace WSStressTest
{
class Program
{
static void Main()
{
ASCIIEncoding encoding = new ASCIIEncoding();
string postData = "<?xml version='1.0'?><ROOT><SOMETHING></SOMETHING></ROOT>";
HttpWebRequest request = (HttpWebRequest)WebRequest.Create("http://url:1111/WebService.asmx/ProcessWebService");
request.Method = "POST";
byte[] data = encoding.GetBytes(postData);
request.ContentType = "application/x-www-form-urlencoded";
request.ContentLength = data.Length;
Stream dataStream = request.GetRequestStream();
dataStream.Write(data, 0, data.Length);
dataStream.Close();
HttpWebResponse response = (HttpWebResponse)request.GetResponse();
Console.WriteLine(((HttpWebResponse)response).StatusDescription);
dataStream = response.GetResponseStream();
StreamReader reader = new StreamReader(dataStream);
string responseFromServer = reader.ReadToEnd();
Console.WriteLine(responseFromServer);
reader.Close();
dataStream.Close();
response.Close();
//Console.ReadLine();
}
}
}
I always get an 500 error in HttpWebResponse. Now, looking at the code the only thing I can think that is missing is the name of the parameter for POST. What I mean, if I make a form
<form method="post" action="http://url:1111/WebService.asmx/ProcessWebService">
<input type="text" name="sXML" /> <input type="submit" value="submit" />
</form>
placing the xml in the input and submit will work. But I'm naming the data post to the web service sXML. How do I name the xml post in the console app sXML? Is that what I'm missing or is there another error in my code?
Additional question: What would be the best way to get this to run 1,000 times. I was thinking of putting the call inside a while <1000. Is there a better way for it?
Thanks!
Have you looked at tools like SoapUI? This sort of thing has already been written :)
I can't install it in the box.
How come? Can you not get it installed by the IT department, or whoever is responsible for software policy? It's crazy to write software that has already been written, with logging and stuff built-in...
I could push it and get install. But by then at least two weeks would have past, I need to test this today.
Understood - I've worked at big organizations before - never again ;-) My best suggestion is to use a web-debugging tool (Chrome, IExplore F12 Tools, Fiddler) to see what a working request looks like, then compare it to what you are sending. Not sure if that is permissible in your environment though.
Can you post some server code? The way you would handle a parameter (sXml) vs just a string would differ.
Hi Chad. A bit confused by your question, but, like I said,if I do
and post the xml in the textbox it works.
|
The exact determination of ground states of small systems is used in a
scaling study of the random-field Ising model. While three variants of the
model are found to be in the same universality class in 3 dimensions, the
Gaussian and bimodal models behave distinctly in 4 dimensions with the latter
apparently having a discontinuous jump in the magnetization. A finite-size
scaling analysis is presented for this transition.
|
Robert HULTZ et al., Appellants, v. John C. BONNER et al., Appellees.
No. 46393.
Supreme Court of Mississippi.
Nov. 8, 1971.
Jim Phyfer, Jackson, for appellants.
Laurel G. Weir, Philadelphia, for appel-lees.
PER CURIAM.
Affirmed,
|
two: Avoid branch in computation of idx2
I haven't been able to find any changes in the benchmarks so far. The generated code looks better though.
I'm a bit surprised GHC doesn't undo this optimization.
Yeah, GHC is pretty eager to generate a branch here. E.g. idx2 = fromEnum (... < ...) would still generate the branch.
We have
index :: Hash -> Shift -> Int
index w s = fromIntegral $ unsafeShiftR w s .&. subkeyMask
So I think another option would be to shift the subKeyMask left and use the result for both hashes. I dunno if that would be better, worse, or exactly the same.
Yes, there are more low-level tweaks that can be applied here. https://github.com/haskell-unordered-containers/unordered-containers/issues/468#issuecomment-1129040465 is related.
|
Emmett Lee MILLER, Appellant, v. The CHEMSTRAND CORPORATION, Appellee.
No. 20990.
United States Court of Appeals Fifth Circuit.
May 5, 1964.
Charles L. Howard, Jr., Rogers, Howard, Redden & Mills, Birmingham, Ala., for appellant.
William B. Eyster, John A. Caddell, John H. Moores, Eyster & Eyster, Peach, Caddell & Shanks, Decatur, Ala., for ap-pellee.
Before CAMERON and BELL, Circuit Judges, and INGRAHAM, District Judge.
Judge Cameron participated in the hearing of this case, but died before this opinion was written.
PER CURIAM:
Emmett Lee Miller, plaintiff-appellant, -sued the Chemstrand Corporation, defendant-appellee, to recover damages .arising from his employment by the defendant, The Chemstrand Corporation. The complaint was predicated on four ■causes of action: 1) negligent failure of the defendant to use due care to furnish and provide plaintiff with a reasonably safe place in which to work resulting in injury and disability of the plaintiff when he contracted toxic hepatitis; 2) damages resulting from the breach by the defendant of a promise to pay medical expenses; 3) damages for breach by the defendant of an agreement to provide the plaintiff with employment, income, and to maintain his seniority; 4) damages resulting from breach by the defendant of an oral agreement to provide the plaintiff with a reasonably safe place in which to work and to perform his duties. In answer, the defendant pleaded, among other defenses, the Alabama one year statute of limitation. Plaintiff denied the applicability of the one year statute of limitation, further claiming that, if applicable, the defendant was estopped to plead the one year statute of limitation.
Upon oral motion of the defendant, after the plaintiff had rested his case, the district court directed a verdict for the defendant and entered judgment thereon.
This is a diversity case and we are bound by State law. The case turned upon the application of the Alabama one year statute of limitation, which was properly pleaded by the defendant. The plaintiff claimed that the defendant was guilty of fraud and therefore estopped to plead the statute of limitation.
We are of the opinion that plaintiff’s cause of action was barred by the Alabama one year statute of limitation and that the testimony offered by the plaintiff does not raise the issue of fraud.
The trial judge in his opinion and order denying plaintiff’s motion for new trial, which is set out in full in the footnotes, reviews the matters in contention before us fully and correctly. The judgment of the district court is therefore affirmed.
. The plaintiff has filed a motion to set aside judgment and for a new trial in this cause, which motion was heard on Thursday, May 16, 1963. Since that date the Court Reporter has transcribed the testimony of the plaintiff Miller, which is the only part of the evidence relevant to the issues presented by the motion.
At the conclusion of the plaintiff’s testimony, upon the oral motion of the defendant, the Court directed a verdict for the defendant.
One of the defenses asserted herein was the Alabama statute of limitations of one year. The case was tried before the jury on the second amended Count I, filed February 3, 1962, and on amended Counts II, III and IV, filed on January 3, 1962. The significant dates involved are as follows: Plaintiff last worked for the defendant on the 5th day of October, 1959. He was medically terminated on the 2nd day of November, I960, effective November 9, 1960. He filed suit on November 2, 1961. Plaintiff seeks to avoid the bar of the one-year statute of limitations, based upon what he terms “an agreement” more particularly shown from the quotations from the testimony hereinafter set out. On direct examination, plaintiff testified as follows:
“Q Now, when did you first become aware of the fact, Mr. Miller, that you were developing or had toxic hepatitis, or hepatitis ?
“A I believe the latter part of August. “THE COURT: What year was that?
“A 1959.
* * * * *
“Q On occasions in the hospital, when Mr. Hurst visited with you, and you say Dr. Payne came to see you, did you have any conversation with either or both of those gentlemen?
“A I had a conversation with both, yes, sir.
“Q And what was said, if anything, in relation to your situation?
“A Mr. Tom told me not to worry about anything, that everything would be taken care of concerning my medical bill while I was there, and the 20 per cent that the insurance didn’t cover, that the company would cover.
íjc *jí :¡: *J» ^
“A They told me I had been medically terminated.
“Q And when did they tell you that you had been medically terminated?
“A Either the 3rd or 5th.
“Q Of November?
“A Yes, sir.
“Q To refresh your recollection, was it November 2, 1960, or do you remember exactly?
“A I don’t know the exact date. I know it was a week or 10 days.
* * * * *
“A When he told me that, of course, it upset me, and I asked Mr. Hurst why I was terminated. He said the company did not feel like I would be able to work for them any more, due to my condition.
“Q Did you ask him about your payments ?
“A About what?
“Q Your payments, your bills?
“A. He said that the company had taken care of all that they felt that they owed.
“Q He said at that time that they had taken care of all that they felt they owed? Is that right?
“A Yes, sir.
“A Well, one of the gentlemen, Mr. Hurst, I believe, said that it had been rumored at the plant I had filed suit, and I told him, no, sir, I hadn’t, not as long as they lived up to what he had told me, and that I was satisfied, and he told me, said, don’t worry about nothing. Said your job and seniority is going right on.
* :¡; t'fi ¡¡t #
“A It was about May of 1960.
❖ ::: * -¡- *
“Q And what was said with refer-erenee to compiensation at that time?
“A That they didn’t want to enter it as a compensation case, they were going-to — ”
On cross examination, plaintiff established the date of the conversation at which the “agreement” was made by Mr. Hurst and Dr. Payne as having occurred before he took his vacation in April, 1960, testifying as follows:
“Q Is it not a fact — let’s go back a. minute to this conversation that you; say occurred with you and Mr. Hurst and Dr. Payne. When is it you say-that occurred, Mr. Miller?
* •!• * :¡s *
“Q What is your best judgment about-it?
“A I believe it was before the two weeks; vacation.
“Q You now tell me it was before the-two weeks vacation that Mr. Hurst and Dr. Payne came to you and made-the agreement you have just told' the jury about?
“A Yes, sir. I can’t remember exact-dates.
“THE COURT: Do you have a-judgment about it?
“A The best of my judgment would be right before my two weeks vacation.
“Q Assuming your vacation began about April 11, 1960, would it be shortly-beforo that?
“A Yes, sir.
“Q And that’s the only time such was ever mentioned to you before you were terminated, in the conversation on November 9, 1960?
■“A Yes, sir.
*1* St* *{* *1*
“MR. EYSTER. As we have it in the company records, from April 10, 1960, for two weeks, Your Honor.
“Q Now, was that the only conversation about this?
“A That is the only time it occurred; and I told them that I hadn’t even thought of such. They said it was rumored at the plant.”
In April, 1960, plaintiff’s sick leave was extended, and plaintiff was advised that the group insurance would take care of 80 per cent only, since he had a back condition and that the balance would have to be paid by him personally. (Tr. p. 76.) The plaintiff understood this fact. (Tr. p. 79.)
As far back as 1954 or 1955, plaintiff and other employees were advised that the chemicals which were being used could possibly cause hepatitis. (Tr. pp. 91 and 92.) Preceding the medical termination of the plaintiff and during October, 1960, he had a disc operation which had been giving him a lot of trouble in his back. The disc condition did not arise from the hepatitis, although plaintiff did testify that his back gave him trouble from overweight due to the hepatitis diet.
On re-direct examination, the plaintiff testified that he did not remember the exact dates of the visits of Mr. Hurst during 1960. The date of the latest of any conversation that plaintiff had with Mr. Hurst appears to have been in the latter part of the summer of 1960 (Tr. p. 133), at which time the plaintiff testified that Mr. Hurst asked him if he was satisfied with the arrangement, to which he replied:
“Mr. Hurst asked me if I was still satisfied, and I told him yes, as long as the company lived up to their agreement.”
The burden of proof on the statute of limitations is upon the plaintiff. The Supreme Court of Alabama, in Lord et al. v. Calhoun, 162 Ala. 444, at 446, 50 So. 402, said:
“When the statute of limitations is pleaded, the burden rests upon the plaintiff to prove the cause of action within the period of the bar. In each case the plaintiff must show facts which avoid the effect of the plea, and, if he relies on a parol contract, the burden is on him to establish a contract not required by the statute to be in writing.”
Assuming the correctness of the plaintiff’s testimony, the statute of limitations would run against the promise. Such was the holding of the Supreme Court, in Cameron v. Cameron, 95 Ala. 344, at 347, 10 So. 506, at 507, where the plaintiff relied on a promise that a bill-single (note) “would never run out of date.” The Supreme Court said:
“It was only a promise not to plead the statute of limitations, and the statute runs against that promise as well as against the bill single itself.”
Unless the promise was to run to a certain date, such promise was no different from, as respecting the statute of limitations, a note payable on demand, which accrues when made. North Birmingham American Bank v. White, 225 Ala. 72, 142 So. 47.
The plaintiff testified very positively, after being pinned down on cross-examination, that he only had one conversation with Dr. Payne and Mr. Hurst and that that was before he went on his vacation in April, 1960. Even taking the date as of late summer, 1960, a year expired before the suit was filed, and from the evidence it appears that all that was said on the latter date was whether the plaintiff was satisfied with the arrangement. There was nothing to show that there was any promise made at that time.
The plaintiff contends that the defendant was guilty of fraud or was equitably estopped to plead the statute. He relied on Section 42, Title 7, Alabama Code of 1940, which provides :
“In actions seeking relief on the ground of fraud where the statute has created a bar, the cause of action must not be considered as having accrued until the discovery by the aggrieved party of the fact constituting the fraud, after which he must have one year within which to prosecute his suit.”
According the most favorable construction of plaintiff’s testimony, that testimony does not establish fraud. At most, there was just a promise to look after the welfare of the plaintiff while he was sick. In the Court’s opinion, fraud cannot be read into the acts of the defendant, assuming that Dr. Payne and Mr. Hurst had authority to speak for the defendant. It was to meet just such contentions that the legislature enacted Section 40 of Title 7, Code of Alabama of 1940, which provides as follows:
“No act, promise, or acknowledgment is sufficient to remove the bar to a suit created by the provisions of this chapter, or is evidence of a new and continuing contract, except a partial payment made upon the contract by the pyrty sought to be charged before the bar is complete, or an unconditional promise in writing, signed by the party to be charged thereby.”
In Whitfield v. Hatch et al, 235 Ala. 38, 40, 177 So. 149, the Supreme Court of Alabama, referring to this section, said:
“This statute is clear and unequivocal; says what it means and means what it says. It is of long standing first appearing in the Code of 1852, § 2490. Jordan’s Adm’r v. Hubbard, 26 Ala. 433, 438.
“It was intended not only to clarify the law, theretofore much in confusion, touching the words or acts which would constitute such new promise, express or implied, as to intercept the running of the statute of limitations, but also to specify the admissible evidence.”
In Warren v. Hearne, 82 Ala. 554, 556, 2 So. 491, 493, the Supreme Court of Alabama said:
“All acts, promises, and acknowledgments, other than therein expressed, the statutes declare insufficient; and it is not our province to extend it, by construction, beyond the clearly expressed terms.”
It is true that the company continued to pay the plaintiff sick leave, but such was not a partial payment made upon a contract, which is the only exception to removal of the bar by an “act”. There is no dispute in the evidence that there was no promise in writing of any kind. There was no attempt to conceal any cause of action from the plaintiff or to misrepresent any facts to him. He knew that he had a right to file suit as far back as October 5, 1959.
In Lewis v. Ford, 67 Ala. 143, 146-147, the Court, referring to Section 40, said:
“Where such is the case, we consider it settled, both by weight of respectable authority and of sound reason, that no mere verbal promise, express or implied, to waive, or not to plead the statute of limitations can be valid. This would be to suspend the statute by another act or promise than that specified by the lawmaking power, which would be against the policy of the statute itself, and not, for this reason permissible. Shapely [Shapley] v. Abbott, 42 N.Y. 443 (1 Amer.Rep. 548.)
“Besides, an estoppel in pais must relate to some matter of fact, which has been previously admitted or denied by the party claimed to be stopped, which he is precluded from averring to the contrary, on the ground that his conduct has deceived or misled to another’s injury. 1 Brick. Dig. p. 796, # 10 (cases cited.) “Here, there is no ignorance of fact alleged, no deception practiced, no misstatement made, nor even improper silence averred, which has induced appellant to alter his previous position, to his injury. He was charged with a knowledge of the law, and must have known that his claim was barred by lapse of time. We do not hold that a party may not be estopped from pleading the statute of limitations, where there is a concealment, or misrepresentation, of a fact of which the party injured was ignorant, and by which conduct he was misled to his prejudice.
* !j¡ Ji
It follows that the second amended Count I, being grounded in tort, is barred by the statute of limitations of one year.
Count H, as amended, is based upon breach of promise to pay all expenses incurred as a result of plaintiff’s treatments by doctors and for hospitalization. The defendant moved for a directed verdict as to this count. The Court is of the opinion that there was no proof to sustain this count. There was one bill which the Court finally admitted which purported to be a doctor’s bill for $150.40. However, there was no proof of the reasonableness of the bill. Unless the value of the services is of common knowledge, the burden is on the plaintiff to establish the reasonable and proper amount of the services. Birmingham Amusement Co. v. Norris, 216 Ala. 138, 112 So. 633. The plaintiff stated he had received this bill in August, 1962. He did not pay the bill and he did not offer any evidence as to his liability to pay.
In the Norris case, supra, the Court said:
“ * * * what would be a reasonable and proper charge for the surgical and medical attendance had by plaintiff was not a matter of common knowledge, but was clearly a matter for expert opinion. There being nothing in the evidence to show that the charge made was reasonable, or to show what would have been reasonable, there was no proper basis for a finding by the jury in allowance of the claims * *
In Hartley v. Alabama National Bank, 247 Ala. 651, 657, 25 So.2d 680, 684, an administrator, without prior contract, paid a physician $1,000 for appearing in a will contest on two occasions, giving testimony as to the sanity of the testator. An heir contested the item on final settlement. The Court said:
“It has already been said that for the implied contract to be valid and sustainable in court the compensation must be shown to have been reasonable. There was here an entire absence of this element of proof to sustain such contract and the order of the trial court adjudicating the services as reasonable is without foundation. In this we think there was error which necessitates a reversal of the cause. If the item were a matter of •common knowledge and the nature of the charge or expense were known, the sum paid might serve as some evidence of the reasonable value in the absence of proof to the contrary. Birmingham Ry., L. & P. Co. v. Humphries, 172 Ala. 495, 497, 55 So. 307.
“But the same principle is inapplicable to matters not of common knowledge, as professional services now under consideration, and the law requires evidence to show what is a reasonable amount. City of Birmingham v. Norwood, 220 Ala. 497, 498(5), 126 So. 619; Birmingham Amusement Co. v. Norris, 216 Ala. 138, 112 So. 633, 53 A.L.R. 840, 844.”
There was no attempt to prove any surgical or hospital bills, and the Court is of the opinion that the proof to the extent offered did not meet the requirements of the rule referred to, and that the verdict was properly directed as to Count II, as amended.
Count III, as amended, is based upon an alleged offer of the defendant to “always provide a job for the plaintiff and to hold the plaintiff harmless from any loss of income or seniority in his position” in consideration of plaintiff refraining from placing any suit at law against the defendant for damages; that said defendant breached said contract and the plaintiff has lost substantial income and will continue to lose income from any employment. The plaintiff’s testimony, in the most favorable light, does not establish this third cause of action.
A contract, if it can be called a contract, such as pleaded in Count III, is void for uncertainty. In Birmingham Electric Co. v. Praytor, 22 Ala.App. 45, 111 So. 895, the Court stated that a contract whereby a person was employed at a definite monthly salary without specification of the length of period for the contract’s continuance was void for uncertainty and no damages could be recovered thereunder by the employee. In support of its conclusion, the Court quoted the following from the Supreme Court of Alabama:
“In * * * Howard v. [East Tennessee, Va. & Ga.] Railroad Co., 91 Ala. 268, 8 South. 868, we laid down the principle that, when no breach of a contract could be assigned which could be compensated by any criterion of damages to be furnished by the contract itself, the contract is void for uncertainty.” Pulliam v. Schimpf, 109 Ala. 179, 19 So. 428.
And “In Howard v. E. Tenn., Va. & Ga. R. R. Co., 91 Ala. 268, 8 South. 868, the railroad company employed the plaintiff as its land agent at a stipulated monthly salary, * * *. No period of time for its continuance was specified. It was held void for uncertainty.” Christie, Lowe & Heyworth et al. v. Patton, 148 Ala. 324, 42 So. 614.
And, “Contracts may be so uncertain as to parties or subject-matter as to be incapable of specific performance, or to support an action for damages for breach thereof.” Shannon v. Wisdom, 171 Ala. 409, 55 So. 102, citing Howard v. E. Tenn., Va. & Ga. R. Co., supra.
The record is wholly silent as to any loss the plaintiff has sustained or would likely sustain. Any such purported contract, in the Court’s opinion, was void for uncertainty and there was an entire lack of proof of damages under the count.
The Fourth Cause of Action was based upon the breach of a contract to furnish the plaintiff a safe place to work. There is no proof whatever of any such agreement. A reading of the count reveals that the action is, in fact, based upon the breach of a legal duty. Plaintiff does not aver that there was any express or implied contract. He does aver that there was a breach of contract arising out of the breach of a legal duty. In short, this count states no more than a tort action. See Marsh v. Southern Airways, 5 Cir., 316 F.2d 91, decided April 19,1963, wherein the Court quoted from Wilkinson v. Moseley, 18 Ala. 288, as follows:
“Perhaps the best criterion is this: if the cause of action, as stated in the declaration, arises from a breach of promise, the action is ex contractu; but if the cause of action arises from a breach of duty, growing out of the contract, it is in form, ex delicto, and case.”
This being a count in tort, the statement of the Court with respect to the second amended Count I is applicable to this count. Further, there was no proof that there was any such contract entered into. The motion for a directed verdict as to this count was properly given.
Based upon the foregoing, the Court is of the opinion that the plaintiff’s motion for new trial is due to be overruled.
It is, therefore, ordered, adjudged and decreed that the plaintiff’s motion for new trial be and the same is hereby overruled and denied.
|
TRIFIDyE. 379
occasionally on the trunks oi' trees, and far more frequently among the long wood-grasses close to the ground. At dusk it flies freely to flowers of bramble, Angelica, and other plants, and comes willingly to sugar. Its home in this country is in South Yorkshire, in the large woods round Sheffield and Rotherham ; there it is sometimes abundant, but it has a rather wide range with us. A single specimen was taken a good many years ago at Hythe, Kent, by Mr. McLachlan, another was found at Saltwood in the same county, and there is a record in Cornwall ; in Devon it has been taken in the woods of Dartmoor ; also found rarely in Dorset. Upwards of twenty years ago it was taken in some plenty, both in the imago and larva states, in the woods of Hampstead and Highgate, lying just north of London, and it has continued to exist there, in spite of collectors, up to a very recent period. It may now increase again, since the woods — so far as they still exist — are not available for collecting in. As already stated, Professor Meldola used to take this species in Surrey; and it still occurs in the middle and west of the county ; and has once been taken at Lewisham, Kent, in the south-east suburbs of London, by Mr. Fenn. It is also met with very locally in Berks, Oxfordshire, Somerset, Herefordshire, Buckinghamshire, Suffolk, Norfolk ; and more frequently in Sherwood Forest, Notts ; also in Derbyshire, Staffordshire and Cumberland, and very rarely in Lancashire. I find no record of its capture in Scotland, Ireland or Wales. Abroad its range is more southern — Central Europe, North Italy, South Sweden, and apparently some portions of the mountain regions of Central Asia.
Genus 34. APAMEA.
Antennse of the male ciliated ; eyes naked, provided with short lashes at the back ; thorax with the top crest small, sometimes hardly noticeable, back crest small and short ;
|
// interlude.js - loads all game assets
import BaseScene from './base-scene';
import Globals from '../globals';
import Audio from '../audio';
import Controls from '../controls';
import * as KPPL from '../shaders/pipeline';
import * as Scenes from './index';
class LoadLevel extends BaseScene {
constructor() {
super('LoadLevel');
}
init(data) {
// test
// data = {
// endgame: true,
// name: 'EndGame',
// next: 'MainMenu'
// };
if (data.next) {
this.config = data;
if (data.endgame) {
this.config.text = 'W E L L D O N E'
}
} else {
this.config = { next: 'Level1', text: 'L E V E L 1' };
}
}
create() {
// pre-init
KPPL.setPipeline('noise');
super.enableShaders();
const { width, height } = Globals.game.config;
// background
const backg = this.add.tileSprite(0, 0, width * 2, height * 2, 'bkg-blue');
backg.setDepth(0);
const cx = width * 0.5;
const cy = height * 0.5;
let titleX = cx - 190;
if (this.config.endgame) {
titleX = cx - 250;
}
this.addTitle(titleX, cy - 150, this.config.text, 48, () => {
this.addText(cx - 330, height - 150, 'Press attack key to continue ...', 24);
this.controls = this.controls = new Controls(this, true);
if (this.config.endgame) {
this.addText(cx - 240, cy + 50, 'The galaxy is safe ...for now!', 20);
}
});
this.audio = new Audio(this);
// always last
super.create();
}
update(time, delta) {
super.update(time, delta);
if (this.controls && (this.controls.action1 || this.controls.action2)) {
this.audio.fadeOut(() => {
// stop all sfx
this.audio.stop();
// camera out
this.cameras.main.once('camerafadeoutcomplete', (camera) => {
if (this.config.next !== 'MainMenu') {
// load scene here, because any old refs were removed
this.scene.add(this.config.next, Scenes[this.config.next]);
this.scene.start(this.config.next);
} else {
this.scene.start(this.config.next);
}
});
this.cameras.main.fadeOut(1000);
});
}
}
addText(x, y, text, size = 24) {
this.add.bitmapText(x, y, Globals.bitmapFont, text, size);
}
addTitle(x, y, text, size = 24, cb) {
this.addRect(x, y + size * 1.15, Globals.game.config.width * 2, size * 1.2);
const bitmap = this.add.bitmapText(x, y, Globals.bitmapFont, text, size);
bitmap.alpha = 0;
this.tweens.add({
targets: [bitmap],
alpha: 1,
duration: 800,
ease: 'Easing.Bounce.Out',
onComplete: cb
});
}
addRect(x, y, w, h) {
const rect = this.add.graphics().setVisible(false);
rect.fillStyle(0x090909);
rect.fillRect(0, 0, w, h);
const name = 'r' + w + h;
rect.generateTexture(name, w, h);
const img = this.add.image(x, y, name);
img.alpha = 0.4;
return img;
}
}
export { LoadLevel };
|
Board Thread:Summer/@comment-4146635-20140725153440/@comment-25053614-20140726172713
2 points Lucy Gluckman page.
* 1) 55 Her voice is out of this world!
|
export interface OrderItemInterface {
_id?: String;
order_id?: String;
product_title?: String;
product_id?: String;
product_img?: String;
product_price?: Number;
product_num?: Number;
add_time?: Number;
}
|
Input into child component giving error, but sometime loads
I have an object that I am passing from a parent component to a child component. When I run ng serve, I get an error that the object which was passed cannot be found. However, if I save a file the system will occasionally rerun the build and build correctly and serve the app. The object does indeed work correctly.
I believe that the cause is related to the fact that the data which I am passing comes from a service fetching data. If this is true, what can I do about it?
Parent component:
@Component({
selector: 'app-design-studio',
templateUrl: './design-studio.component.html',
styleUrls: ['./design-studio.component.scss']
})
export class DesignStudioComponent implements AfterViewInit {
designData: any;
// Private
private _unsubscribeAll: Subject<any>;
constructor(private _studio: DesignStudioService) {
// Set the defaults
this.searchInput = new FormControl('');
// Set the private defaults
this._unsubscribeAll = new Subject();
this._studio.onDesignChanged
.pipe(takeUntil(this._unsubscribeAll))
.subscribe(response => {
this.designData = response;
// Prepend and append the cost and menu data
this.designData.menu.unshift(this.projectMenu);
this.designData.menu.push(this.costMenu);
// Add the array to hide/show the side menus
this.designData.menuShow = [];
this.designData.menu.forEach((value, index) => {
this.designData.menuShow[index] = false;
});
});
}
ngOnInit() {
this._studio.onDesignChanged
.pipe(takeUntil(this._unsubscribeAll))
.subscribe(response => {
this.designData = response;
// Prepend and append the cost and menu data
this.designData.menu.unshift(this.projectMenu);
this.designData.menu.push(this.costMenu);
// Add the array to hide/show the side menus
this.designData.menuShow = [];
this.designData.menu.forEach((value, index) => {
this.designData.menuShow[index] = false;
});
});
}
}
Child Component:
import { Component, OnInit, Input } from '@angular/core';
@Component({
selector: 'design-sidebar',
templateUrl: './sidebar.component.html',
styleUrls: ['./sidebar.component.scss']
})
export class SidebarComponent implements OnInit {
//designData: any;
@Input() designData: designData;
constructor() { }
ngOnInit(): void {
}
}
Error is on the child component: (second designData is underlined in error)
ERROR in src/app/main/design-studio/sidebar/sidebar.component.ts:12:22 - error TS2304: Cannot find name 'designData'.
@Input() designData: designData;
Where did you declare/define the designData interface/class (the second one that you say is underlined)? I don't see anything in your child component that either declares or imports designData. If you change it to any, just like you have it in parent component, it should fix your problem.
Thanks. I believe that I looked at an old example and was not reading it correctly. I relooked at the official docs and that was the mistake that I made.
Change the underlined interface to any, just like you have it in the parent component, it should fix your problem.
Also, looking at the code, a couple of points:
You have duplicate code (maybe because it's WIP) in the constructor and in ngOnInit() - ideally, you would just have everything in ngOnInit().
You need to unsubscribe from the subscription, usually in ngOnDestroy() to avoid memory leaks.
|
MediaWiki 1.27
MediaWiki 1.27 is a future release.
Consult the file for the full list of changes.
InstantCommons made easier and cheaper
More documentation translation
Breaking changes
|
Board Thread:General Discussion/@comment-4962906-20151102040111/@comment-6175354-20151102143313
1. The Bear and the Bow
2. The Price
3. The Broken Kingdom
4. Siege Perilous
5. The Dark Swan
6. Dreamcatcher
|
Refinement of object works and it doesn't
I created a few tiny examples, one per demo function:
Playground link
In particular, these two:
function demoV1(thing: unknown): void {
if (thing === null || typeof thing !== 'object') {
throw new Error('not an object');
}
// ERROR: thing is object || null
const obj: object = thing;
}
function demoV2(thing: unknown): void {
if (typeof thing !== 'object') {
throw new Error('not an object');
}
if (thing === null) {
throw new Error('not an object');
}
// WORKS
const obj: object = thing;
}
So... TypeScript does not understand an or operator "||" to test twp things in the same if()?
Okay... so I found that the order of the individual tests matters, which is just as strange so I see no reason to close the issue.
function demoV1(thing: unknown): void {
if (typeof thing !== 'object' || thing === null) {
throw new Error('not an object');
}
// WORKS
const obj: object = thing;
}
function demoV2(thing: unknown): void {
if (thing === null) {
throw new Error('not an object');
}
if (typeof thing !== 'object') {
throw new Error('not an object');
}
// ERROR: thing is object || null
const obj: object = thing;
}
Duplicate of #28131
|
[Snyk] Security upgrade netlify-cli from 17.10.1 to 17.29.0
This PR was automatically created by Snyk using the credentials of a real user.
Snyk has created this PR to fix 1 vulnerabilities in the yarn dependencies of this project.
Snyk changed the following file(s):
package.json
Note for zero-installs users
If you are using the Yarn feature zero-installs that was introduced in Yarn V2, note that this PR does not update the .yarn/cache/ directory meaning this code cannot be pulled and immediately developed on as one would expect for a zero-install project - you will need to run yarn to update the contents of the ./yarn/cache directory.
If you are not using zero-install you can ignore this as your flow should likely be unchanged.
⚠️ Warning
```
Failed to update the yarn.lock, please update manually before merging.
```
Vulnerabilities that will be fixed with an upgrade:
Issue
Score
Denial of Service (DoS) SNYK-JS-WS-7266574
768
[!IMPORTANT]
Check the changes in this PR to ensure they won't cause issues with your project.
Max score is 1000. Note that the real score may have changed since the PR was raised.
This PR was automatically created by Snyk using the credentials of a real user.
Note: You are seeing this because you or someone else with access to this repository has authorized Snyk to open fix PRs.
For more information:
🧐 View latest project report
📜 Customise PR templates
🛠 Adjust project settings
📚 Read about Snyk's upgrade logic
Learn how to fix vulnerabilities with free interactive lessons:
🦉 Denial of Service (DoS)
👷 Deploy Preview for effortless-cendol-07821c processing.
Name
Link
🔨 Latest commit
fb79040d3c063c9fbceff6ea0d598a3814995d42
🔍 Latest deploy log
https://app.netlify.com/sites/effortless-cendol-07821c/deploys/66751667e9b36500086da7fa
|
Wikipedia:Articles for deletion/Realm of Garo
The result was delete. ♠PMC♠ (talk) 23:29, 11 May 2022 (UTC)
Realm of Garo
* – ( View AfD View log | edits since nomination)
Description of a fictional universe. Unsourced fancruft, consisting only of plot summary (WP:NOTPLOT). Such content is unsuited to Wikipedia and belongs on fan wikis. Sandstein 16:48, 4 May 2022 (UTC)
* Note: This discussion has been included in the list of Fictional elements-related deletion discussions. Sandstein 16:48, 4 May 2022 (UTC)
* Delete Pure FANDOM style material lacking reliable sources. ᴢxᴄᴠʙɴᴍ (ᴛ) 20:28, 4 May 2022 (UTC)
* Delete. Unredeemable WP:FANCRUFT. --Piotr Konieczny aka Prokonsul Piotrus| reply here 10:51, 5 May 2022 (UTC)
|
Adaptive control for immersive experience delivery
ABSTRACT
A combined video of a scene may be generated for applications such as virtual reality or augmented reality. In one method, a data store may store video data with a first portion having a first importance metric, and a second portion having a second importance metric, denoting that viewing of the first portion is more likely and/or preferential to viewing of the second portion. The subset may be retrieved and used to generate viewpoint video from a virtual viewpoint corresponding to a viewer's viewpoint. The viewpoint video may be displayed on a display device. One of storing the video data, retrieving the subset, and using the subset to generate the viewpoint video may include, based on the difference between the first and second importance metrics, expediting and/or enhancing performance of the step for the first portion, relative to the second portion.
CROSS-REFERENCE TO RELATED APPLICATIONS
The present application is related to U.S. application Ser. No. ______/______ for “Vantage Generation and Interactive Playback,” (Atty. Docket No. LYT265), filed on the same date as the present application, the disclosure of which is incorporated herein by reference.
The present application is also related to U.S. application Ser. No. ______/_____ for “Spatial Random Access Enabled Video System with a Three-Dimensional Viewing Volume,” (Atty. Docket No. LYT266), filed on the same date as the present application, the disclosure of which is incorporated herein by reference.
The present application is also related to U.S. application Ser. No. ______/______ for “Wedge-Based Light-Field Video Capture,” (Atty. Docket No. LYT267), filed on the same date as the present application, the disclosure of which is incorporated herein by reference.
TECHNICAL FIELD
The present document relates to the use of importance metrics to streamline the capture, storage, delivery, and/or rendering of video data for an immersive experience such as virtual reality or augmented reality.
BACKGROUND
As better and more immersive display devices are created for providing virtual reality (VR) and augmented reality (AR) environments, it is desirable to be able to capture high quality imagery and video for these systems. In a stereo VR environment, a user sees separate views for each eye; also, the user may turn and move his or her head while viewing. As a result, it is desirable that the user receive high-resolution stereo imagery that is consistent and correct for any viewing position and orientation in the volume within which a user may move his or her head.
The most immersive virtual reality and augmented reality experiences have six degrees of freedom, parallax, and view-dependent lighting. The resulting video data can be quite voluminous, requiring significant resources in terms of storage, delivery bandwidth, and/or processing power. These resources are often constrained, for example, by the processing power of the user's computer, the storage capacity of the user's computer, the bandwidth of the user's connection to a data source, and/or other factors. Such factors significantly limit the quality of the viewer's experience.
SUMMARY
Various embodiments of the described system and method utilize importance metrics to indicate the relative likelihood and/or desirability of viewing different portions of video data. For example, a first portion of the video data for a virtual reality or augmented reality experience may have a first importance metric, and a second portion of the video data may have a second importance metric. A difference between the first and second importance metrics may denote that the first portion is more likely to be viewed and/or preferred for viewing, relative to the second portion.
A subset of the video data may be retrieved and used to generate viewpoint video from a virtual viewpoint corresponding to a viewer's actual viewpoint. Storage, retrieval, and/or generation of the viewpoint video may be carried out with respect to the importance metrics, such that one or more of these tasks are expedited and/or enhanced for the first portion, relative to the second portion.
In some embodiments, the video data may be divided into a plurality of vantage video data sets, each of which represents a view from one of a plurality of vantages within a viewing volume containing the virtual viewpoint. The position of the viewer's viewpoint may be used to determine which vantage video data sets will be used to generate the viewpoint video. The first and second portions of the video data may each include one or more of the vantages, such that some vantages are expedited and/or enhanced for storage, retrieval, and/or processing, relative to other vantages.
Additionally or alternatively, the first portion of the video data may be for a first region of the viewing volume, and the second portion of the video data may be for a second region of the viewing volume. Various parameters such as a number of vantages, a density of vantages, locations of vantages, a number of vantages used to generate the viewpoint video, lighting applied to vantages, and resolution of vantages may be enhanced for the first region, relative to the second volume.
Further, each vantage may be divided into a plurality of tiles, each of which represents the view from the vantage along a viewing direction. The orientation of the viewer's viewpoint may be used to determine which tiles will be used to generate the viewpoint video. The first and second portions of the video data may each include one or more of the tiles for each of a plurality of the vantages, such that some tiles are expedited and/or enhanced for storage, retrieval, and/or processing, relative to other tiles.
Additionally or alternatively, the first portion of the video data may be for a first set of tiles oriented along a first set of viewing directions, and the second portion of the video data may be for a second set of tiles oriented along a second set of viewing directions. Various parameters such as tile spatial resolution, tile temporal resolution, tile color depth, and tile bit rate may be enhanced for the first set of tiles, relative to the second set of tiles.
The importance metrics may be established in a wide variety of ways. For example, the importance metric may be based on viewing data indicating which portions of the experience have been viewed or preferred by more viewers, user input from an author of the experience indicating which portions are more likely or desirable for viewing and/or which portions correspond to other stimuli presented as part of the experience, and/or analysis of the video data and/or accompanying audio data that determines which portions are more likely or desirable for viewing.
BRIEF DESCRIPTION OF THE DRAWINGS
The accompanying drawings illustrate several embodiments. Together with the description, they serve to explain the principles of the embodiments. One skilled in the art will recognize that the particular embodiments illustrated in the drawings are merely exemplary, and are not intended to limit scope.
FIG. 1 is a flow diagram depicting a method for delivering video for a virtual reality or augmented reality experience, according to one embodiment.
FIG. 2 is a screenshot diagram depicting a frame from a viewpoint video of a virtual reality experience, according to one embodiment.
FIG. 3 is a screenshot diagram depicting the screenshot diagram of FIG. 2, overlaid with a viewing volume for each of the eyes, according to one embodiment.
FIG. 4 is a screenshot diagram depicting the view after the headset has been moved forward, toward the scene of FIG. 2, according to one embodiment.
FIG. 5 is a screenshot diagram depicting the color channel from a single vantage, such as one of the vantages of FIG. 3, according to one embodiment.
FIG. 6 is a diagram depicting the manner in which the tiles of a vantage, such as one of the vantages of FIG. 3, may be selected, according to one embodiment.
FIG. 7 is a screenshot diagram depicting the depth channel from the vantage used to provide the screenshot diagram of FIG. 5, according to one embodiment.
FIG. 8 is a diagram depicting a portion of a scene in which two objects are positioned such that an occluded area exists behind the objects, according to one embodiment.
FIG. 9 is a diagram depicting the portion of the scene of FIG. 9, in which another vantage has been added to enhance viewing of the occluded area, according to one embodiment.
FIG. 10 is a screenshot diagram depicting the vantages traversed by a single viewer and accumulated over time, according to one embodiment.
FIG. 11 is a screenshot diagram depicting the vantages traversed by multiple viewers and accumulated over time, according to one embodiment.
FIG. 12 is a diagram depicting a vantage, according to one embodiment.
DETAILED DESCRIPTION
Multiple methods for capturing image and/or video data in a light-field volume and creating virtual views from such data are described. The described embodiments may provide for capturing continuous or nearly continuous light-field data from many or all directions facing away from the capture system, which may enable the generation of virtual views that are more accurate and/or allow viewers greater viewing freedom.
Definitions
For purposes of the description provided herein, the following definitions are used:
- - Augmented reality: an immersive viewing experience in which images presented to the viewer are based on the location and/or orientation of the viewer's head and/or eyes, and are presented in conjunction with the viewer's view of actual objects in the viewer's environment. - Conventional image: an image in which the pixel values are not, collectively or individually, indicative of the angle of incidence at which light is received on the surface of the sensor. - Depth: a representation of distance between an object and/or corresponding image sample and the entrance pupil of the optics of the capture system. - Image: a two-dimensional array of pixel values, or pixels, each specifying a color. - Importance metric: an indicator of the importance of a subset of video data. - Input device: any device that receives input from a user. - Light-field camera: any camera capable of capturing light-field images. - Light-field data: data indicative of the angle of incidence at which light is received on the surface of the sensor. - Light-field image: an image that contains a representation of light-field data captured at the sensor, which may be a four-dimensional sample representing information carried by ray bundles received by a single light-field camera. - Light-field volume: the combination of all light-field images that represents, either fully or sparsely, light rays entering the physical space defined by the light-field volume. - Processor: any processing device capable of processing digital data, which may be a microprocessor, ASIC, FPGA, or other type of processing device. - Ray bundle, “ray,” or “bundle”: a set of light rays recorded in aggregate by a single pixel in a photosensor. - Scene: an arrangement of objects and/or people to be filmed. - Sensor, “photosensor,” or “image sensor”: a light detector in a camera capable of generating images based on light received by the sensor. - Stereo virtual reality: an extended form of virtual reality in which each eye is shown a different view of the virtual world, enabling stereoscopic three-dimensional perception. - Tile: a portion of a vantage video data set corresponding to a particular viewing direction. - Vantage: a position in three-dimensional space with associated video data. - Vantage video data set: the portion of video data associated with a particular vantage. - Video data: a collection of data comprising imagery and/or audio components that capture a scene. - Viewing data: data that records aspects of viewing of an experience by one or more viewers. - Viewing volume: a three-dimensional region from within which virtual views of a scene maybe generated. - Viewpoint video: imagery and/or sound comprising one or more virtual views. - Virtual reality: an immersive viewing experience in which images presented to the viewer are based on the location and/or orientation of the viewer's head and/or eyes. - Virtual view: a reconstructed view, typically for display in a virtual reality or augmented reality headset, which may be generated by resampling and/or interpolating data from a captured light-field volume. - Virtual viewpoint: the location, within a coordinate system and/or light-field volume, from which a virtual view is generated.
In addition, for ease of nomenclature, the term “camera” is used herein to refer to an image capture device or other data acquisition device. Such a data acquisition device can be any device or system for acquiring, recording, measuring, estimating, determining and/or computing data representative of a scene, including but not limited to two-dimensional image data, three-dimensional image data, and/or light-field data. Such a data acquisition device may include optics, sensors, and image processing electronics for acquiring data representative of a scene, using techniques that are well known in the art. One skilled in the art will recognize that many types of data acquisition devices can be used in connection with the present disclosure, and that the disclosure is not limited to cameras. Thus, the use of the term “camera” herein is intended to be illustrative and exemplary, but should not be considered to limit the scope of the disclosure. Specifically, any use of such term herein should be considered to refer to any suitable device for acquiring image data.
In the following description, several systems and methods for capturing video are described. One skilled in the art will recognize that these various systems and methods can be performed singly and/or in any suitable combination with one another. Further, many of the configurations and techniques described herein are applicable to conventional imaging as well as light-field imaging. Further, although the ensuing description focuses on video capture for use in virtual reality or augmented reality, the systems and methods described herein may be used in a much wider variety of video applications.
Importance Metrics
As described previously, delivery of a virtual reality or augmented reality experience may push the limits of bandwidth, storage, and/or processing capabilities of known computing and display systems. Accordingly, it is desirable to give priority, in terms of such system resources, to the content that is most desirable and/or most likely to be viewed by the viewer. This may be accomplished, in some embodiments, by assigning different importance metrics to different portions of video data for a virtual reality or augmented reality experience. The importance metrics may denote which portions are most important, and therefore should be prioritized for delivery to the viewer. One exemplary method for using such importance metrics will be shown and described in connection with FIG. 1.
Referring to FIG. 1, a flow diagram depicts a method 100 for delivering video for a virtual reality or augmented reality experience, according to one embodiment. As shown, the method 100 may start 110 with a step 120 in which video data is stored. The video data may encompass video from multiple viewpoints and/or viewing directions within a viewing volume that can be selectively delivered to the viewer based on the position and/or orientation of the viewer's head within the viewing volume, thus providing an immersive experience for the viewer.
The video data may be divided into a plurality of vantages, each of which is for one of a plurality of positions within the viewing volume. Each vantage may be divided into a plurality of tiles, each of which is for one of a plurality of possible viewing directions. Vantages and tiles will be described in greater subsequently, and are also described in the above-cited related U.S. Application for “Spatial Random Access Enabled Video System with a Three-Dimensional Viewing Volume,” (Atty. Docket No. LYT266), filed on the same date as the present application, the disclosure of which is incorporated herein by reference in its entirety.
In a step 130, importance metrics may be assigned to different portions of the video data. For example, the video data may be broken down into different regions within the viewing volume, some of which receive higher priority than others. Additionally or alternatively, the video data may be broken down into different sets of tiles, representing different viewing directions. The regions and/or sets of tiles may be determined based one or more factors, which may include, but are not limited to, the following:
- - The likelihood that the viewer will position his or her head in the region and/or orient his or her head along the viewing direction; - The locations of any points of interest likely to be visited by the viewer, including but not limited to featured portions of a virtual reality experience and real-life locations likely to be of interest in an augmented reality experience; - The quality of the experience as viewable from within the region and/or from along the viewing direction, which may include factors such as the visual quality of the content, the degree of parallax, the level of interactivity for augmented reality experience, and the like; and - The presence or absence of additional sensory content, such as an auditory, olfactory, or tactile stimulus coordinated with the region and/or along the viewing direction.
The determination of the importance metric for any given region and/or set of tiles may be made, for example, through the use of one or more approaches including, but not limited to:
- - Viewing data obtained from historical viewings of the experience, indicating that viewers prefer or more frequently one region and/or set of tiles over another; - Receipt of input from a user, such as a viewer or director, setting importance metrics for one or more regions and/or tile sets; and - Analysis of the video data to determine the quality and/or likelihood of viewing of a given region and/or set of tiles.
These approaches will each be described in greater detail below.
In order to capture viewing data, the movement of a viewer's head may be measured as he or she views a particular segment of the experience. Viewing position and/or direction may be tracked and logged as the viewer experiences the segment. Where the video data is divided into vantages and/or tiles, the particular vantage and/or tile being delivered to the viewer may be logged.
Less frequently viewed vantages and/or tiles may receive a lesser importance metric (an importance metric indicating they are less important than other vantages and/or tiles). Based on the lesser importance metric, these vantages and/or tiles may be compressed with lesser quality, delivered after other vantages and/or tiles, processed after other vantages and/or tiles, omitted from the experience altogether, and/or otherwise de-prioritized in the delivery of the experience.
If desired, the actions of the same and/or different viewers may be measured across time and/or across multiple viewings to determine behavior. It is likely that a viewer will look at different places on their second or third viewing of the same content. Viewing statistics, such as vantage and/or tile viewing statistics, may be gathered offline and/or online to inform the compression algorithm and/or other modules that control the capture, storage, delivery, and/or processing of the experience.
Some viewers may have a special preference for a particular actor, athlete, or other performer in a sports broadcast, movie, concert, or other event. Compression quality and/or other delivery parameters may be set for the viewer based on his or her preferences. This may be done automatically by observing the viewing actions taken by the viewer.
In the alternative, explicit input may be received from the viewer to indicate such preferences. For example, the viewer may select particular performers, particular types of scenes, particular portions of an experience, and/or other aspects of an experience to be prioritized or de-prioritized for viewing.
In some examples, the viewer may explicitly select regions of the experience to be prioritized. A testing method such as A/B testing may be used to determine which resource allocation parameters provide the best experience for the viewer.
According to still other embodiments, a content producer or other person involved with the generation of the experience may provide input to explicitly assign importance metrics. For example, a director may indicate the most optimal or intended viewing experience and assign higher importance metrics to those vantage tile paths. This may be used to drive the viewer to the path chosen by the director. Thus, importance metrics may be used to subtly encourage viewers to view the content as indicated by the director.
In some embodiments, importance metrics may be assigned based on the presence or absence of additional sensory content. Such additional sensory content may include, but is not limited to, sounds, smells, tactile content such as haptic feedback or other vibrations, and the like. Such sensory content may be timed to coincide with a key portion of the video data, which may have a high likelihood of being viewed by a viewer, or may desirably be rendered with higher quality. Such sensory content may further provide an impulse to the viewer to look in a particular direction, strengthening the likelihood that the associated video data will be viewed by the viewer.
As another alternative, the video data may be analyzed, for example, by a computing device, to automatically set importance metrics. The importance metrics may be calculated using one or more objective measures. Such objective measures may be computed using attributes such as, but not limited to, the following:
- - Pixel coverage of the three-dimensional scene, for example, as in Vázquez, P. P., Feixas, M., S bert, M. and Heidrich, W. (2003), Automatic View Selection Using Viewpoint Entropy and its Application to Image-Based Modelling. Computer Graphics Forum, 22: 689-300. doi:10.1111/j.1467-8659.2003.00717.x; - Quality metrics, such as PSNR, SSIM, for example, as in Wang, Zhou, et al. “Image quality assessment: from error visibility to structural similarity.” IEEE transactions on image processing 13.4 (2004): 200-612, AQM, for example, as in Myszkowski, Karol, Przemyslaw Rokita, and Takehiro Tawara. “Perception-based fast rendering and antialiasing of walkthrough sequences.” IEEE Transactions on Visualization and Computer Graphics 6.4 (2000): 360-379, and absolute differences; - Saliency, for example, as in Itti, Laurent, Christof Koch, and Ernst Nie bur. “A model of saliency-based visual attention for rapid scene analysis.” IEEE Transactions on pattern analysis and machine intelligence 20.11 (1998): 1254-1259 or Lee, Chang Ha, Amitabh Varshney, and David W. Jacobs. “Mesh saliency.”ACM transactions on graphics (TOG). Vol. 24. No. 3. ACM, 2005; - Contrast sensitivity analysis, for example, as in Robson, J. G. “Spatial and temporal contrast-sensitivity functions of the visual system.” Josa 56.8 (1966): 1141-1142; - Image entropy; and - Motion.
The importance metric may be calculated in a wide variety of ways, through the use of data obtained from any of the foregoing methods. Such methods may be carried out across the vantages of the video data by comparing vantages with each other, and/or across the tiles of one or more vantage by comparing the tiles of each vantage with each other. For example, for a given tile, the importance metric may be calculated as the change in quality measure when resource allocation parameters of the given tile are changed. One can also formulate the resource allocation as an optimization problem with the importance metrics as the objective function and the resource allocation parameters as the input parameters, constraining by available system resources. Such optimization may be carried out as set forth in Everett III, Hugh. “Generalized Lagrange multiplier method for solving problems of optimum allocation of resources.” Operations research 11.3 (1963): 399-417.
Importance metrics may be in any of a variety of forms, including but not limited to:
- - Numeric scores such as one through ten, which may be rounded to the nearest integer or expressed as a floating point number; - Importance categories such as least important, moderately important, and most important; and - Letter scores, such as a, b, c, and d.
Importance metrics may assign vantages and/or tiles to two categories such as “more important” and “less important.” Alternatively, more than two distinct importance metrics may be assignable to provide a broader spectrum of importance levels. Importance metrics may be stored in association with the video data, for example, in metadata stored in files of the video data.
In some embodiments, the step 130 may be carried out prior to the step 120, and the step 120 may then be carried out with reference to the importance metrics of the video data. For example, some or all of the video data may be compressed, and the compression used for vide data with a high importance metric may be different from that of the video data with a low importance metric. Specifically, the video data with a higher importance metric may be encoded and/or compressed in a manner that provides higher quality, faster retrieval, faster processing, and/or the like, by comparison with the video data with a lower importance metric.
Additionally or alternatively, the video data may be captured in a manner that references the importance metrics. For example, more video data may be captured proximate locations of interest in the immersive experience, or the video data captured may be captured at higher quality at those locations. This may enhance the quality of the video data that is available for generation of virtual viewpoints proximate the locations of interest.
Once the importance metrics have been assigned to the video data, the virtual reality or augmented reality experience may be initiated. In a step 140, viewpoint data may be received to indicate the position and/or orientation of the viewer's head, indicating the viewer's actual viewpoint. The actual viewpoint may be converted into a virtual viewpoint within the viewing volume of the video data.
In a step 150, a subset of the video data may be retrieved. The subset may be selected to include all of the video data likely to be needed to render a virtual view of the scene captured by the video data, from the virtual viewpoint corresponding to the viewpoint data received in the step 140. The contents of the subset may be determined based, in part, on the importance metrics; video data corresponding to particular vantages and/or tiles may optionally be excluded from the subset if the importance metric for those vantages and/or tiles is below a threshold. Additionally or alternatively, the order in which the video data within the subset is retrieved may be determined based on the importance metrics, with the video data within the subset having lower importance metrics retrieved after that having higher importance metrics.
In a step 160, the subset of the video data retrieved in the step 150 may be used to generate viewpoint video data, representing a view of the scene from the viewer's viewpoint. Generation of the viewpoint video may also be carried out with reference to the importance metrics. For example, decompression of the portion of the subset having a higher importance metric may be carried out before and/or with higher quality than decompression of the portion of the subset having a lower importance metric. Additionally or alternatively, the portion of the subset with a higher importance metric may be rendered for viewing before and/or with higher quality than rendering of the portion of the subset having a lower importance metric.
In a step 170, the viewpoint video may be displayed for the viewer on a display device. In some embodiments, the display device may be part of a virtual reality or augmented reality headset. The viewpoint video may include sound, which may be played for the viewer via an output device such as one or more speakers or headphones. As indicated previously, the experience may additional sensory content such as sounds, smells, tactile content, and the like. If desired, virtual reality or augmented reality equipment may include other output devices, such as vibration or scent-producing elements, that provide such additional sensory content.
Pursuant to a query 180, a determination may be made as to whether the experience has been completed. If not, the method 100 may return to the step 140, in which the viewpoint data may again be captured to obtain the position and/or orientation for a new virtual viewpoint from which the scene is to be rendered for display for the viewer. The step 140, the step 150, the step 160, and the step 170 may be repeated until the query 180 is answered in the affirmative, representing that the experience is complete. The method 100 may then end 190.
The steps of the method 100 may be reordered, omitted, replaced with alternative steps, and/or supplemented with additional steps not specifically described herein. The steps set forth above will be described in greater detail subsequently in the discussion of vantages and tiles.
Virtual Reality Display
Referring to FIG. 2, a screenshot diagram 200 depicts a frame from a viewpoint video of a virtual reality experience, according to one embodiment. As shown, the screenshot diagram 200 depicts a left headset view 210, which may be displayed for the viewer's left eye, and a right headset view 220, which may be displayed for the viewer's right eye. The differences between the left headset view 210 and the right headset view 220 may provide a sense of depth, enhancing the viewer's perception of immersion in the scene.
Vantages
As indicated previously, the video data for a virtual reality or augmented reality experience may be divided into a plurality of vantages, each of which represents the view from one location in the viewing volume. More specifically, a vantage is a view of a scene from a single point in three-dimensional space. A vantage can have any desired field-of-view (e.g. 90° horizontal×90° vertical, or 360° horizontal×180° vertical) and pixel resolution. A viewing volume may be populated with vantages in three-dimensional space at some density.
Based on the position of the viewer's head, which may be determined by measuring the position of the headset worn by the viewer, the system may interpolate from a set of vantages to render the viewpoint video in the form of the final left and right eye view, such as the left headset view 210 and the right headset view 220 of FIG. 2. A vantage may contain extra data such as depth maps, edge information, and/or the like to assist in interpolation of the vantage data to generate the viewpoint video.
The vantage density may be uniform throughout the viewing volume, or may be non-uniform. A non-uniform vantage density may enable the density of vantages in any region of the viewing volume to be determined based on the likelihood the associated content will be viewed, the quality of the associated content, and/or the like. Thus, if desired, importance metrics may be used to establish vantage density for any given region of a viewing volume.
Referring to FIG. 3, a screenshot diagram 300 depicts the screenshot diagram 200 of FIG. 2, overlaid with a viewing volume 310 for each of the eyes, according to one embodiment. Each viewing volume 310 may contain a plurality of vantages 320, each of which defines a point in three-dimensional space from which the scene may be viewed by the viewer. Viewing from between the vantages 320 may also be carried out by combining and/or extrapolating data from vantages 320 adjacent to the viewpoint.
Referring to FIG. 4, a screenshot diagram 400 depicts the view after the headset has been moved forward, toward the scene of FIG. 2, according to one embodiment. Again, a left headset view 410 and a right headset view 420 are shown, with the vantages 320 of FIG. 3 superimposed. Further, for each eye, currently and previously traversed vantages 430 are highlighted, as well as the current viewing direction 440.
Tiles
Referring to FIG. 5, a screenshot diagram 500 depicts the color channel from a single vantage, such as one of the vantages 320 of FIG. 3, according to one embodiment. As shown, each vantage 320 may have a wide angle field-of-view of the scene, encompassing many possible viewing directions. For a full 360° horizontal×180° vertical vantage, the viewer is only looking at a certain portion of vantage at any given time. The portion may be defined by the headset's field-of-view for each eye.
To be efficient for rendering performance, data input/output performance, and/or data compression/decompression, vantages may be tiled into smaller areas. Uniformly-sized rectangular tiles may be used in some embodiments. For example, as depicted in FIG. 5, the color channel for one of the vantages 320 may be divided into a rectangular grid of tiles 520, with thirty-two columns of tiles, and sixteen rows of tiles. This is merely exemplary, as different numbers of tiles may be used, such as sixteen columns by eight rows. The tiles 520 are also depicted in rectilinear space, but may, in alternative embodiments, be defined in the latitudinal/longitudinal space defined by wrapping the screenshot diagram 500 around a sphere.
Referring to FIG. 12, a diagram 1200 depicts a vantage 1210 according to one embodiment. The vantage 1210 may have a center 1220 and image data, such as an RGB channel and/or a depth channel, which may define a sphere 1230 encircling the center 1220. A field-of-view may be represented by four vectors 1240 extending outward from the center 1220 to pass through the surface of the sphere 1230. A semi spherical area 1250 (shown in red hatching) on the surface of the sphere 1230, between the locations at which the vectors 1240 pass through the surface of the sphere 1230, may represent the portion of the RGB channel of the vantage 1210 that is to be viewed currently and/or used in combination with other vantage data to generate viewpoint video.
Referring to FIG. 6, a diagram 600 depicts the manner in which the tiles of a vantage, such as one of the vantages 320 of FIG. 3, may be selected, according to one embodiment. The vantages 320 have any of a wide variety of shapes, including but not limited to spherical and cylindrical shapes. The diagram 600 depicts vantages 320 as having spherical shapes, by way of example.
The top row depicts four side views of a sphere representing the vantage 320. A field-of-view 610 is oriented along the viewing direction 620 currently being viewed by the viewer. The field-of-view 610 is depicted in the same orientation in each view of the top row because the field-of-view 610 is depicted, in each case, from its left side. The middle row depicts four top views of the sphere representing the vantage 320, depicting the field-of-view 610 in various orientations.
The bottom row depicts the color channel 630 for the vantage 320, divided into tiles as in FIG. 5. A subset 640 of the tiles of the color channel 630 may be fetched to correspond to the viewer's viewpoint, permitting the viewpoint video to be rendered. The subset 640 may move, for example, to the right, within the color channel 630, as the viewer pivots his or her head to the right, as can be seen by viewing the first row, then the second row, then the third row, and then the fourth row of FIG. 6. Tiles may also be fetched from other vantages proximate the viewers viewpoint and combined with the subset 640 to render the viewpoint video.
In alternative embodiments, non-uniformly sized and/or non-rectangular tiles may be used. The sizes and/or shapes of the tiles may be dependent on the content depicted in those tiles. For example, more tiles may be positioned areas of vantages with higher importance metrics than the surrounding areas, enabling the more important viewing directions to be rendered in greater detail.
Depth Channel
Referring to FIG. 7, a screenshot diagram 700 depicts the depth channel from the vantage used to provide the screenshot diagram 500 of FIG. 5, according to one embodiment. Depth information may be encoded into each vantage to provide proper parallax and/or other visual effects.
Vantage-Based and Tile-Based Usage of Importance Metrics
As indicated previously, vantages, such as the vantages 320 of FIG. 3, may have different importance metrics to indicate the relative importance of the vantages 320. Further, tiles, such as the tiles 520 of FIG. 5, can have different importance metrics indicating the relative importance of the tiles. The importance metrics may be used in a variety of ways to prioritize and/or enhance delivery of more important content to the viewer.
In some embodiments, the importance metrics may be used to guide the compression algorithms to allocate more bits/quality to the more important portions and less bits/quality to the less important portions of the viewpoint provided by a vantage 320. As each of the tiles 520 represents a direction into the scene as well as a position in space, importance levels of tiles may vary along either or both of the X and Y axes.
Such importance metrics may guide a vantage-based video system in the allocation of resources such as, but not limited to, the number of vantages, vantage density, vantage placement, bits and encoding/decoding complexity, in order to meet system constraints, such as bandwidth, storage, CPU resources, and/or GPU resources.
For example, to maximize perceived quality, the system can allocate more resources to more important regions of the viewing volume and/or more important tiles than less important regions and/or tiles. If a limit on the maximal number of vantage must be adhered to in order to meet system requirements, the importance metrics may be used to determine the optimal location of the vantages. Thus, importance metrics may be used to place vantages or tiles in the video data in the step 120 of the method 100 of FIG. 1.
The importance metric for vantage tiles may be applied to caching strategy for playback, for example, on a personal computer or mobile device. In such applications, where disk input/output and/or network streaming bandwidth may be constrained, it may be desirable to pre-fetch the most important vantage tiles ahead of time. Any number of known predictive caching techniques may be used to accomplish this. The importance metrics may be referenced to prioritize more important video data for predictive caching.
A system can utilize an importance map to allocate system resources for capturing, encoding, decoding, storing, pre-processing, post-processing, delivering, and/or playing content. The parameters used for resource allocation may include, but are not limited to the following, and may be applied to each individual tile or vantage, a subset of tiles or vantages and/or globally:
- - The number of vantages in the viewing volume and/or a region of the viewing volume; - Vantage density in the viewing volume and/or a region of the viewing volume; - The position of vantages relative to content; - The location of vantages; - The number, complexity, and location of view-dependent variations, such as variations in lighting and resolution; - The spatial resolution of tiles; - The temporal resolution of tiles; - The color/depth bit-sampling of tiles; - The bitrate of tiles; - The quality and/or rate of rendering; - The number of vantages used for generating a viewpoint; - The density of meshes, for example, for rendered three-dimensional models; - The density of cameras used to capture the scene; - The manner in which various portions of the video data are prioritized (which portions of the video data to process, store, render, and/or transmit when resources are constrained); - The extent of pre-processing to be carried out for various portions of the video data; and - Other codec-related parameters used for encoding/decoding image data.
Those of skill in the art will recognize that the list set forth above is merely exemplary. The parameters listed above may be modified singly or in combination with each other. In other embodiments, other system resource parameters may be modified based on the importance metrics of the corresponding video data.
Vantage Density and Position
The density with which vantages are arranged (uniformly or non-uniformly) within a viewing volume, or a region of a viewing volume, may be an important resource allocation parameter. Based on how important a particular vantage and/or tile is, more vantages can be allocated to that region of the viewing volume. Optimal positions may be found to cover dis occlusions that may be very content-dependent and/or scene-dependent. Parallax and view-dependent lighting may be taken into account in the assignment of importance metrics, since having the correct vantage density and position may greatly enhance provision of parallax and view dependent lighting.
Referring to FIG. 8, a diagram 800 depicts a portion of a scene in which two objects 810 are positioned such that an occluded area 820 exists behind the objects 810, according to one embodiment. A keyhole 830 may exist between the objects 810, through which the occluded area 820 may be viewable from a viewing volume 840. A plurality of vantages 850 with a viewing volume 840 are positioned proximate the objects 810. The vantages 850 may be cylindrical or spherical vantages, or may have any other shape, as discussed in connection with FIG. 6.
None of the vantages 850 within the viewing volume 840 are aligned with the keyhole 830, as shown by the fields-of-view 860 centered at the vantages 850 and oriented toward the objects 810. Accordingly, the corresponding video data may not contain accurate imagery depicting the occluded area 820. A viewer positioning his or head between the vantages 850 in an attempt to view the occluded area 820 may view viewpoint video that lacks detail regarding the occluded area 820 because the viewpoint video may be generated based on the tiles from the vantages 850; none of these tiles effectively depicts the occluded area 820.
Referring to FIG. 9, a diagram 900 depicts the portion of the scene of FIG. 9, in which another vantage 950 has been added to enhance viewing of the occluded area 820, according to one embodiment. A field-of-view 960 from the vantage 950, oriented toward the keyhole 830, enables the viewer to view a portion of the occluded area 820.
This illustration of keyhole dis occlusion depicts one manner in which vantage density and/or placement may help to determine the quality of the viewing experience. Each additional vantage adds to the quantity of video data that needs to be stored, retrieved, and/or processed; accordingly, it is beneficial to conserve system resources by using a smaller vantage density for less important portions of the video data.
One method of optimizing vantage density and position is for content creators to place vantages manually and adjust them based on quick feedback. A fixed vantage density may initially be used, and the output may be viewed in a virtual reality headset. Then, the vantages may be manually moved and adjusted vantages, either singly or in groups, until the final output quality is satisfactory. This process may be repeated for each frame in time.
To save editing time, the content creator may “pin” a set of vantages to a particular region of the viewing volume. Optical flow methods and/or the like may be applied to track these regions over time to provide the content creators with a better starting set of vantage positions. This may reduce the amount of editing that needs to be done.
Another method is to place the vantages automatically using a software algorithm that analyzes the scene and generates the optimal vantage density and/or position for the final output. In some embodiments, a mixture of the two methods (manual and automated vantage placement) may be carried out. For example, the automated method may generate a starting vantage placement for each frame. The content creator may make further adjustments in each frame, if necessary.
Viewing Data
As mentioned above, viewing data may be collected and used to set importance metrics. The viewing data may come from viewing by the content creator to set vantage densities and/or positions, as set forth in the preceding section. Alternatively, the viewing data may come from other viewers (such as consumers who are unaffiliated with the content creator) who view the experience subsequent to its creation, as described in the description of FIG. 1. The viewing data may be used not just to set vantage position and/or density, but also to set any of the system resource parameters listed previously.
Referring to FIG. 10, a screenshot diagram 1000 depicts the vantages 1010 traversed by a single viewer and accumulated over time, according to one embodiment. The vantages 1010 traversed by the viewer may be assigned higher importance metrics, relative to the importance metrics assigned to vantages that the viewer did not traverse.
In some embodiments, other aspects of viewing data may be recorded in connection with the information presented in FIG. 10. For example, the number of times a vantage was traversed by the viewer, the amount of time the viewer spent traversing each vantage, and/or viewing data for particular tiles of the vantages 1010 may be recorded and factored into the importance metrics to be assigned.
In some embodiments, more explicit viewer feedback may also be received and recorded. For example, a viewer may fill out a survey indicating which aspects of the virtual reality or augmented reality experience were the most enjoyable. Additionally or alternatively, biometric data (such as pulse rate, blood pressure, brain activity, etc.) may be tracked to glean information regarding the viewer's level of engagement with each portion of the experience.
In some examples, viewing data from multiple viewers may be recorded and aggregated to assign importance metrics. One such example will be shown and described in connection with FIG. 11.
Referring to FIG. 11, a screenshot diagram 1100 depicts the vantages 1110 traversed by multiple viewers and accumulated over time, according to one embodiment. Vantages 1120 that have been viewed more frequently and/or for longer periods of time may be shown in a darker color, thereby presenting vantage viewing in the form of a “heat map.” This may be extended in time so that changes over time in the volume and/or “heat” of the heat map may be visualized. Such information may be used to facilitate assignment of the importance metrics.
The above description and referenced drawings set forth particular details with respect to possible embodiments. Those of skill in the art will appreciate that the techniques described herein may be practiced in other embodiments. First, the particular naming of the components, capitalization of terms, the attributes, data structures, or any other programming or structural aspect is not mandatory or significant, and the mechanisms that implement the techniques described herein may have different names, formats, or protocols. Further, the system may be implemented via a combination of hardware and software, as described, or entirely in hardware elements, or entirely in software elements. Also, the particular division of functionality between the various system components described herein is merely exemplary, and not mandatory; functions performed by a single system component may instead be performed by multiple components, and functions performed by multiple components may instead be performed by a single component.
Reference in the specification to “one embodiment” or to “an embodiment” means that a particular feature, structure, or characteristic described in connection with the embodiments is included in at least one embodiment. The appearances of the phrase “in one embodiment” in various places in the specification are not necessarily all referring to the same embodiment.
Some embodiments may include a system or a method for performing the above-described techniques, either singly or in any combination. Other embodiments may include a computer program product comprising a non-transitory computer-readable storage medium and computer program code, encoded on the medium, for causing a processor in a computing device or other electronic device to perform the above-described techniques.
Some portions of the above are presented in terms of algorithms and symbolic representations of operations on data bits within a memory of a computing device. These algorithmic descriptions and representations are the means used by those skilled in the data processing arts to most effectively convey the substance of their work to others skilled in the art. An algorithm is here, and generally, conceived to be a self-consistent sequence of steps (instructions) leading to a desired result. The steps are those requiring physical manipulations of physical quantities. Usually, though not necessarily, these quantities take the form of electrical, magnetic or optical signals capable of being stored, transferred, combined, compared and otherwise manipulated. It is convenient at times, principally for reasons of common usage, to refer to these signals as bits, values, elements, symbols, characters, terms, numbers, or the like. Furthermore, it is also convenient at times, to refer to certain arrangements of steps requiring physical manipulations of physical quantities as modules or code devices, without loss of generality.
It should be borne in mind, however, that all of these and similar terms are to be associated with the appropriate physical quantities and are merely convenient labels applied to these quantities. Unless specifically stated otherwise as apparent from the following discussion, it is appreciated that throughout the description, discussions utilizing terms such as “processing” or “computing” or “calculating” or “displaying” or “determining” or the like, refer to the action and processes of a computer system, or similar electronic computing module and/or device, that manipulates and transforms data represented as physical (electronic) quantities within the computer system memories or registers or other such information storage, transmission or display devices.
Certain aspects include process steps and instructions described herein in the form of an algorithm. It should be noted that the process steps and instructions of described herein can be embodied in software, firmware and/or hardware, and when embodied in software, can be downloaded to reside on and be operated from different platforms used by a variety of operating systems.
Some embodiments relate to an apparatus for performing the operations described herein. This apparatus may be specially constructed for the required purposes, or it may comprise a general-purpose computing device selectively activated or reconfigured by a computer program stored in the computing device. Such a computer program may be stored in a computer readable storage medium, such as, but is not limited to, any type of disk including floppy disks, optical disks, CD-ROMs, magnetic-optical disks, read-only memories (ROMs), random access memories (RAMs), EPROMs, EEPROMs, flash memory, solid state drives, magnetic or optical cards, application specific integrated circuits (ASICs), and/or any type of media suitable for storing electronic instructions, and each coupled to a computer system bus. Further, the computing devices referred to herein may include a single processor or may be architectures employing multiple processor designs for increased computing capability.
The algorithms and displays presented herein are not inherently related to any particular computing device, virtualized system, or other apparatus. Various general-purpose systems may also be used with programs in accordance with the teachings herein, or it may prove convenient to construct more specialized apparatus to perform the required method steps. The required structure for a variety of these systems will be apparent from the description provided herein. In addition, the techniques set forth herein are not described with reference to any particular programming language. It will be appreciated that a variety of programming languages may be used to implement the techniques described herein, and any references above to specific languages are provided for illustrative purposes only.
Accordingly, in various embodiments, the techniques described herein can be implemented as software, hardware, and/or other elements for controlling a computer system, computing device, or other electronic device, or any combination or plurality thereof. Such an electronic device can include, for example, a processor, an input device (such as a keyboard, mouse, touchpad, trackpad, joystick, trackball, microphone, and/or any combination thereof), an output device (such as a screen, speaker, and/or the like), memory, long-term storage (such as magnetic storage, optical storage, and/or the like), and/or network connectivity, according to techniques that are well known in the art. Such an electronic device may be portable or nonportable. Examples of electronic devices that may be used for implementing the techniques described herein include: a mobile phone, personal digital assistant, smartphone, kiosk, server computer, enterprise computing device, desktop computer, laptop computer, tablet computer, consumer electronic device, television, set-top box, or the like. An electronic device for implementing the techniques described herein may use any operating system such as, for example: Linux; Microsoft Windows, available from Microsoft Corporation of Redmond, Washington; Mac OS X, available from Apple Inc. of Cupertino, Calif.; iOS, available from Apple Inc. of Cupertino, Calif.; Android, available from Google, Inc. of Mountain View, Calif.; and/or any other operating system that is adapted for use on the device.
In various embodiments, the techniques described herein can be implemented in a distributed processing environment, networked computing environment, or web-based computing environment. Elements can be implemented on client computing devices, servers, routers, and/or other network or non-network components. In some embodiments, the techniques described herein are implemented using a client/server architecture, wherein some components are implemented on one or more client computing devices and other components are implemented on one or more servers. In one embodiment, in the course of implementing the techniques of the present disclosure, client(s) request content from server(s), and server(s) return content in response to the requests. A browser may be installed at the client computing device for enabling such requests and responses, and for providing a user interface by which the user can initiate and control such interactions and view the presented content.
Any or all of the network components for implementing the described technology may, in some embodiments, be communicatively coupled with one another using any suitable electronic network, whether wired or wireless or any combination thereof, and using any suitable protocols for enabling such communication. One example of such a network is the Internet, although the techniques described herein can be implemented using other networks as well.
While a limited number of embodiments has been described herein, those skilled in the art, having benefit of the above description, will appreciate that other embodiments may be devised which do not depart from the scope of the claims. In addition, it should be noted that the language used in the specification has been principally selected for readability and instructional purposes, and may not have been selected to delineate or circumscribe the inventive subject matter. Accordingly, the disclosure is intended to be illustrative, but not limiting.
What is claimed is:
1. A method for delivering video for a virtual reality or augmented reality experience, the method comprising: at a data store, storing video data for a virtual reality or augmented reality experience, the video data comprising a first portion having a first importance metric and a second portion having a second importance metric; at a processor, receiving viewpoint data indicative of a position and/or an orientation of a viewer's viewpoint; at the processor, retrieving a subset of the video data from the data store, the subset comprising at least the first portion of the video data; at the processor, using the subset to generate viewpoint video of the virtual reality or augmented reality experience, from a virtual viewpoint corresponding to the viewer's viewpoint; and on a display device, displaying the viewpoint video; wherein a difference exists between the first importance metric and the second importance metric, the difference denoting that viewing of the first portion is more likely and/or preferential to viewing of the second portion; and wherein performing one step selected from the group consisting of storing the video data, retrieving the subset, and using the subset to generate the viewpoint video comprises, based on the difference, expediting and/or enhancing performance of the step for the first portion, relative to the second portion.
2. The method of claim 1, wherein: the video data comprises a plurality of vantage video data sets, each of which represents a view from one of a plurality of vantages within a viewing volume; the virtual viewpoint is within the viewing volume; the viewpoint data is indicative of the position of the viewer's viewpoint; and using the subset to generate the viewpoint video comprises using one or more of the vantage video data sets for one or more of the vantages positioned proximate the virtual viewpoint.
3. The method of claim 2, wherein: the first portion comprises a first vantage video data set of the vantage video data sets, the first vantage video data set representing a view from a first vantage of the plurality of vantages; the second portion comprises a second vantage video data set of the vantage video data sets, the second vantage video data set representing a view from a second vantage of the plurality of vantages; and the first importance metric denotes that the first vantage video data set is more likely to be included in the subset than the second vantage video data set.
4. The method of claim 2, wherein: the first portion represents one or more views from within a first region of the viewing volume; the second portion represents one or more views from within a second region of the viewing volume; and expediting and/or enhancing performance of the step for the first portion, relative to the second portion, comprises storing the video data such that at least one of a number of vantages, a density of vantages, locations of vantages, a number of vantages used to generate the viewpoint video, lighting applied to vantages, and resolution of vantages is enhanced within the first region, relative to the second region.
5. The method of claim 2, wherein: each of the vantage video data sets comprises a plurality of tiles, each representing a view from a corresponding vantage of the plurality of vantages, along a viewing direction; the viewpoint data is further indicative of the orientation of the viewer's viewpoint; and using the subset to generate the viewpoint video comprises using one or more of the tiles, with one or more viewing directions corresponding to the orientation, for each of the one or more of the vantages positioned proximate the virtual viewpoint.
6. The method of claim 5, wherein: the first portion comprises a first tile of the plurality of tiles of a first vantage video data set of the vantage vide data sets, the first tile representing a view from a first vantage of the plurality of vantages, along a first viewing direction; the second portion comprises a second tile of the plurality of tiles of the first vantage video data set, the second tile representing a view from the first vantage, along a second viewing direction different from the first viewing direction; and the first importance metric denotes that the first tile is more likely to be included in the subset than the second tile.
7. The method of claim 5, wherein: the first portion represents a first set of tiles of the plurality of vantages, that are oriented along a first set of viewing directions of the one or more viewing directions; the second portion represents a second set of tiles of the plurality of vantages, that are oriented along a second set of viewing directions of the one or more viewing directions; and expediting and/or enhancing performance of the step for the first portion, relative to the second portion, comprises storing the video data such that at least one of a tile spatial resolution, tile temporal resolution, tile color depth, and tile bit rate is enhanced for the first set of tiles, relative to the second set of tiles.
8. The method of claim 1, wherein: the subset comprises the first portion and the second portion of the video data; and expediting and/or enhancing performance of the step for the first portion, relative to the second portion, comprises retrieving the subset of the video data such that the first portion is retrieved prior to retrieval of the second portion.
9. The method of claim 1, wherein: the subset comprises the first portion and the second portion of the video data; and expediting and/or enhancing performance of the step for the first portion, relative to the second portion, comprises using the subset to generate the viewpoint video such that a first segment of the viewpoint video incorporating the first portion of the video data is generated prior to generation of a second segment of the viewpoint video incorporating the second portion of the video data.
10. The method of claim 1, wherein: the subset comprises the first portion and the second portion of the video data; and expediting and/or enhancing performance of the step for the first portion, relative to the second portion, comprises using the subset to generate the viewpoint video such that a first segment of the viewpoint video incorporating the first portion of the video data has a higher level of quality than a second segment of the viewpoint video incorporating the second portion of the video data.
11. The method of claim 1, further comprising: at the data store, receiving viewing data indicating that one or more viewers prefer or more frequently view the first portion of the video data over the second portion of the video data; at the processor, based on the viewing data, assigning the first importance metric to the first portion of the video data; and at the processor, based on the viewing data, assigning the second importance metric to the second portion of the video data.
12. The method of claim 1, further comprising: at an input device, receiving user input indicating that viewing of the first portion is more likely and/or preferential to viewing of the second portion; at the processor, based on the user input, assigning the first importance metric to the first portion of the video data; and at the processor, based on the user input, assigning the second importance metric to the second portion of the video data.
13. The method of claim 12, wherein: the user input indicates that viewing of the first portion is more likely than viewing of the second portion; and the method further comprises, at an output device distinct from the display device, delivering an auditory, olfactory, or tactile stimulus to the viewer to prompt the viewer to position or orient the viewer's viewpoint in a manner that causes the first portion of the video data to be included in the subset.
14. The method of claim 1, further comprising: at the processor, carrying out analysis of one or both of the video data and audio data that accompanies the video data to determine that viewing of the first portion is more likely and/or preferential to viewing of the second portion; at the processor, based on the analysis, assigning the first importance metric to the first portion of the video data; and at the processor, based on the analysis, assigning the second importance metric to the second portion of the video data.
15. A non-transitory computer-readable medium for delivering video for a virtual reality or augmented reality experience, comprising instructions stored thereon, that when executed by a processor, perform the steps of: causing a data store to store video data for a virtual reality or augmented reality experience, the video data comprising a first portion having a first importance metric and a second portion having a second importance metric; receiving viewpoint data indicative of a position and/or an orientation of a viewer's viewpoint; retrieving a subset of the video data from the data store, the subset comprising at least the first portion of the video data; using the subset to generate viewpoint video of the virtual reality or augmented reality experience, from a virtual viewpoint corresponding to the viewer's viewpoint; and causing a display device to display the viewpoint video; wherein a difference exists between the first importance metric and the second importance metric, the difference denoting that viewing of the first portion is more likely and/or preferential to viewing of the second portion; and wherein performing one step selected from the group consisting of storing the video data, retrieving the subset, and using the subset to generate the viewpoint video comprises, based on the difference, expediting and/or enhancing performance of the step for the first portion, relative to the second portion.
16. The non-transitory computer-readable medium of claim 15, wherein: the video data comprises a plurality of vantage video data sets, each of which represents a view from one of a plurality of vantages within a viewing volume; the virtual viewpoint is within the viewing volume; the viewpoint data is indicative of the position of the viewer's viewpoint; and using the subset to generate the viewpoint video comprises using one or more of the vantage video data sets for one or more of the vantages positioned proximate the virtual viewpoint.
17. The non-transitory computer-readable medium of claim 16, wherein: the first portion comprises a first vantage video data set of the vantage video data sets, the first vantage video data set representing a view from a first vantage of the plurality of vantages; the second portion comprises a second vantage video data set of the vantage video data sets, the second vantage video data set representing a view from a second vantage of the plurality of vantages; and the first importance metric denotes that the first vantage video data set is more likely to be included in the subset than the second vantage video data set.
18. The non-transitory computer-readable medium of claim 16, wherein: the first portion represents one or more views from within a first region of the viewing volume; the second portion represents one or more views from within a second region of the viewing volume; and expediting and/or enhancing performance of the step for the first portion, relative to the second portion, comprises storing the video data such that at least one of a number of vantages, a density of vantages, locations of vantages, a number of vantages used to generate the viewpoint video, lighting applied to vantages, and resolution of vantages is enhanced within the first region, relative to the second region.
19. The non-transitory computer-readable medium of claim 16, wherein: each of the vantage video data sets comprises a plurality of tiles, each representing a view from a corresponding vantage of the plurality of vantages, along a viewing direction; the viewpoint data is further indicative of the orientation of the viewer's viewpoint; and using the subset to generate the viewpoint video comprises using one or more of the tiles, with one or more viewing directions corresponding to the orientation, for each of the one or more of the vantages positioned proximate the virtual viewpoint.
20. The non-transitory computer-readable medium of claim 19, wherein: the first portion comprises a first tile of the plurality of tiles of a first vantage video data set of the vantage vide data sets, the first tile representing a view from a first vantage of the plurality of vantages, along a first viewing direction; the second portion comprises a second tile of the plurality of tiles of the first vantage video data set, the second tile representing a view from the first vantage, along a second viewing direction different from the first viewing direction; and the first importance metric denotes that the first tile is more likely to be included in the subset than the second tile.
21. The non-transitory computer-readable medium of claim 19, wherein: the first portion represents a first set of tiles of the plurality of vantages, that are oriented along a first set of viewing directions of the one or more viewing directions; the second portion represents a second set of tiles of the plurality of vantages, that are oriented along a second set of viewing directions of the one or more viewing directions; and expediting and/or enhancing performance of the step for the first portion, relative to the second portion, comprises storing the video data such that at least one of a tile spatial resolution, tile temporal resolution, tile color depth, and tile bit rate is enhanced for the first set of tiles, relative to the second set of tiles.
22. The non-transitory computer-readable medium of claim 15, wherein: the subset comprises the first portion and the second portion of the video data; and expediting and/or enhancing performance of the step for the first portion, relative to the second portion, comprises performing at least one selection from the group consisting of: retrieving the subset of the video data such that the first portion is retrieved prior to retrieval of the second portion; using the subset to generate the viewpoint video such that a first segment of the viewpoint video incorporating the first portion of the video data is generated prior to generation of a second segment of the viewpoint video incorporating the second portion of the video data; and using the subset to generate the viewpoint video such that a first segment of the viewpoint video incorporating the first portion of the video data has a higher level of quality than a second segment of the viewpoint video incorporating the second portion of the video data.
23. The non-transitory computer-readable medium of claim 15, further comprising instructions stored thereon, that when executed by a processor, perform the steps of: causing the data store to receive viewing data indicating that one or more viewers prefer or more frequently view the first portion of the video data over the second portion of the video data; based on the viewing data, assigning the first importance metric to the first portion of the video data; and based on the viewing data, assigning the second importance metric to the second portion of the video data.
24. The non-transitory computer-readable medium of claim 15, further comprising instructions stored thereon, that when executed by a processor, perform the steps of: causing an input device to receive user input indicating that viewing of the first portion is more likely and/or preferential to viewing of the second portion; based on the user input, assigning the first importance metric to the first portion of the video data; and processor, based on the user input, assigning the second importance metric to the second portion of the video data.
25. The non-transitory computer-readable medium of claim 15, further comprising instructions stored thereon, that when executed by a processor, perform the steps of: carrying out analysis of one or both of the video data and audio data that accompanies the video data to determine that viewing of the first portion is more likely and/or preferential to viewing of the second portion; based on the analysis, assigning the first importance metric to the first portion of the video data; and based on the analysis, assigning the second importance metric to the second portion of the video data.
26. A system for delivering video for a virtual reality or augmented reality experience, the system comprising: a data store configured to store video data for a virtual reality or augmented reality experience, the video data comprising a first portion having a first importance metric and a second portion having a second importance metric; a processor, communicatively connected to the data store, configured to: receive viewpoint data indicative of a position and/or an orientation of a viewer's viewpoint; retrieve a subset of the video data from the data store, the subset comprising at least the first portion of the video data; and use the subset to generate viewpoint video of the virtual reality or augmented reality experience, from a virtual viewpoint corresponding to the viewer's viewpoint; and a display device, communicatively coupled to the processor, configured to display the viewpoint video; wherein a difference exists between the first importance metric and the second importance metric, the difference denoting that viewing of the first portion is more likely and/or preferential to viewing of the second portion; and wherein the data store and/or the processor are further configured to perform one step selected from the group consisting of storing the video data, retrieving the subset, and using the subset to generate the viewpoint video by, based on the difference, expediting and/or enhancing performance of the step for the first portion, relative to the second portion.
27. The system of claim 26, wherein: the video data comprises a plurality of vantage video data sets, each of which represents a view from one of a plurality of vantages within a viewing volume; the virtual viewpoint is within the viewing volume; the viewpoint data is indicative of the position of the viewer's viewpoint; and the processor is further configured to use the subset to generate the viewpoint video by using one or more of the vantage video data sets for one or more of the vantages positioned proximate the virtual viewpoint.
28. The system of claim 27, wherein: the first portion comprises a first vantage video data set of the vantage video data sets, the first vantage video data set representing a view from a first vantage of the plurality of vantages; the second portion comprises a second vantage video data set of the vantage video data sets, the second vantage video data set representing a view from a second vantage of the plurality of vantages; and the first importance metric denotes that the first vantage video data set is more likely to be included in the subset than the second vantage video data set.
29. The system of claim 27, wherein: the first portion represents one or more views from within a first region of the viewing volume; the second portion represents one or more views from within a second region of the viewing volume; and the processor and/or the data store are further configured to expedite and/or enhance performance of the step for the first portion, relative to the second portion, by storing the video data such that at least one of a number of vantages, a density of vantages, locations of vantages, a number of vantages used to generate the viewpoint video, lighting applied to vantages, and resolution of vantages is enhanced within the first region, relative to the second region.
30. The system of claim 27, wherein: each of the vantage video data sets comprises a plurality of tiles, each representing a view from a corresponding vantage of the plurality of vantages, along a viewing direction; the viewpoint data is further indicative of the orientation of the viewer's viewpoint; and the processor is further configured to use the subset to generate the viewpoint video by using one or more of the tiles, with one or more viewing directions corresponding to the orientation, for each of the one or more of the vantages positioned proximate the virtual viewpoint.
31. The system of claim 30, wherein: the first portion comprises a first tile of the plurality of tiles of a first vantage video data set of the vantage vide data sets, the first tile representing a view from a first vantage of the plurality of vantages, along a first viewing direction; the second portion comprises a second tile of the plurality of tiles of the first vantage video data set, the second tile representing a view from the first vantage, along a second viewing direction different from the first viewing direction; and the first importance metric denotes that the first tile is more likely to be included in the subset than the second tile.
32. The system of claim 30, wherein: the first portion represents a first set of tiles of the plurality of vantages, that are oriented along a first set of viewing directions of the one or more viewing directions; the second portion represents a second set of tiles of the plurality of vantages, that are oriented along a second set of viewing directions of the one or more viewing directions; and the processor and/or the data store are further configured to expedite and/or enhance performance of the step for the first portion, relative to the second portion, by storing the video data such that at least one of a tile spatial resolution, tile temporal resolution, tile color depth, and tile bit rate is enhanced for the first set of tiles, relative to the second set of tiles.
33. The system of claim 26, wherein: the subset comprises the first portion and the second portion of the video data; and the processor and/or the data store are further configured to expedite and/or enhance performance of the step for the first portion, relative to the second portion, by performing at least one of: retrieving the subset of the video data such that the first portion is retrieved prior to retrieval of the second portion; using the subset to generate the viewpoint video such that a first segment of the viewpoint video incorporating the first portion of the video data is generated prior to generation of a second segment of the viewpoint video incorporating the second portion of the video data; and using the subset to generate the viewpoint video such that a first segment of the viewpoint video incorporating the first portion of the video data has a higher level of quality than a second segment of the viewpoint video incorporating the second portion of the video data.
34. The system of claim 26, wherein: the data store is further configured to receive viewing data indicating that one or more viewers prefer or more frequently view the first portion of the video data over the second portion of the video data; and the processor is further configured, based on the viewing data, to: assign the first importance metric to the first portion of the video data; and assign the second importance metric to the second portion of the video data.
35. The system of claim 26, further comprising an input device configured to receive user input indicating that viewing of the first portion is more likely and/or preferential to viewing of the second portion; wherein the processor is further configured to, based on the user input: assign the first importance metric to the first portion of the video data; and assign the second importance metric to the second portion of the video data.
36. The system of claim 26, wherein the processor is further configured to: carry out analysis of one or both of the video data and audio data that accompanies the video data to determine that viewing of the first portion is more likely and/or preferential to viewing of the second portion; based on the analysis, assign the first importance metric to the first portion of the video data; and based on the analysis, assign the second importance metric to the second portion of the video data.
|
Efficient Bus Loading
This is something I did for a bus travel company a long time ago, and I was never happy with the results. I was thinking about that old project recently and thought I'd revisit that problem.
Problem:
Bus travel company has several buses with different passenger capacities (e.g. 15 50-passenger buses, 25 30-passenger buses ... etc). They specialized in offering transportation to very large groups (300+ passengers per group). Since each group needs to travel together they needed to manage their fleet efficiently to reduce waste.
For instance, 88 passengers are better served by three 30-passenger buses (2 empty seats) than by two 50-passenger buses (12 empty seats). Another example, 75 passengers would be better served by one 50-passenger bus and one 30-passenger bus, a mix of types.
What's a good algorithm to do this?
Not to be picky, but I would suspect from the bus company point of view, 2 50 passenger buses would be more efficient since the gas costs are only going towards 2 buses instead of 3. So is this actually how you did it?
This sounds like the knapsack problem, which is NP-hard. In practice, your search space for a given route should be pretty small.
@Dunk - I will be the first to admit that I have no idea about bus and tour logistics, but that was their requirement. They even had a highly paid consultant who did it manually.
Empty seats are irrelevant, what counts are operating costs. Thus look at philosodad's answer.
@LorenPechtel - Like I said before, I don't dictate the business rules, I just implement them.
This is (sort of) an example of the bin packing problem, which is frequently confused with the knapsack problem. In bin packing, you have bins of a certain capacity, and you are trying to distribute objects of various sizes into the bins. The idea is to use the least possible number of bins.
You aren't exactly trying to minimize the number of bins, though, you are trying to minimize the number of empty seats. And it is possible that you are trying to minimize the number of empty seats across the fleet, that is, you have four tour groups of various sizes, and you want to accomodate all of them with the fewest number of empty seats. I can't think of an instance right off the bat, but I imagine it might be possible to construct a fleet and a set of tour groups such that you would be better off with a substandard solution for some group because it allowed you to avoid using an even worse solution for some other group.
It gets worse. What if you have 20,30, and 50 passenger busses. Each one uses different amounts of fuel, but it is more efficient to run one 50 than it is to run a 20 and a 30. But from our single measure (least number of empty seats), it makes sense to run either for a 50 passenger tour.
Also, buses with weird numbers, like 28 or 39, would skew a lot of our shortcuts.
So, depending on the complexity of the situation, you could do one of two things:
First, and exhaustive search tree: use every possible combination of buses. If you only have 3 or 4 bus sizes, this is probably a reasonable solution. Otherwise, something like Best fit decreasing would yield reasonable, but not optimal, results.
I can't imagine why this answer got downvoted. Upvoting to compensate. Well done.
Here's a quick-and-dirty solution in Python:
def add50(passengers, buses):
proposed = buses + [50]
if sum(proposed) < passengers:
return add50(passengers, proposed)
return proposed
def add30(passengers, buses):
proposed = buses + [30]
if sum(proposed) < passengers:
proposed30 = add30(passengers, proposed)
proposed50 = add50(passengers, proposed)
return proposed30 if sum(proposed30) < sum(proposed50) else proposed50
return proposed
print add30(88, [])
print add30(75, [])
print add30(105, [])
When I run it, I get:
[30, 30, 30]
[30, 50]
[30, 30, 50]
The code is doing a depth-first search through the possible scenarios. Since order doesn't matter ([30, 50] is the same as [50, 30]), we can make the search space a lot smaller by only adding buses of the same size or larger. That's why add30() can call add50(), but not the other way around.
I'm going to answer this from the customer perspective. I would not want a hard coded algorithm for this application. There are too many variables that can change over time. Although nothing about your buses may change the weights of the factors could change or new factors could be discovered that I never thought of (e.g. over-time, laws, and other driver costs).
Because of this, I would want to be able to create my own lookup table based on a range of the number of passengers requested and I would create my own settings for the best bus combinations. Example: 31-50 = 1 X 50, 51-60 = 2 X 30. Does this really need to be calculated? Easier to change settings than a bunch of formulas factoring seats, gas and drivers. Figure out the best combination and be done with it and have plenty of room for the user to change these settings as they see fit.
New factors could be discovered. Do larger buses pay an exponentially higher rate on tolls? Can I get less expensive drivers for small buses when a new law for extra certification and licensing goes up on drivers of buses over 30 passengers?
They hire a new consultant with a different logic to their formula and your app may need to be rewritten. You mean you have to factor cost of parking?
This doesn't work: 31-50 = 50 seat bus, unless they're already used for other groups, or out of service, or unavailable for other reasons. The bus company from the question, with 15 50-passenger buses is very likely going to have multiple customers at a time.
|
package uk.co.gresearch.siembol.configeditor.testcase.model;
import com.fasterxml.jackson.annotation.JsonProperty;
import com.github.reinert.jjschema.Attributes;
@Attributes(title = "test assertion", description = "Test assertion used in test case")
public class TestAssertionDto {
@JsonProperty("assertion_type")
@Attributes(required = true, description = "The type of assertion")
private AssertionTypeDto assertionType;
@JsonProperty("json_path")
@Attributes(required = true, description = "Json path for obtaing an actual value for assertion evaluation")
private String jsonPath;
@JsonProperty("expected_pattern")
@Attributes(required = true, description = "Regular expression pattern of expectedPattern value")
private String expectedPattern;
@Attributes(description = "The pattern is negatedPattern")
@JsonProperty("negated_pattern")
private Boolean negatedPattern = false;
@Attributes(description = "The description of the assertion")
private String description;
@Attributes(description = "The pattern is active and included in test case evaluation")
Boolean active = true;
public AssertionTypeDto getAssertionType() {
return assertionType;
}
public void setAssertionType(AssertionTypeDto assertionType) {
this.assertionType = assertionType;
}
public String getJsonPath() {
return jsonPath;
}
public void setJsonPath(String jsonPath) {
this.jsonPath = jsonPath;
}
public String getExpectedPattern() {
return expectedPattern;
}
public void setExpectedPattern(String expectedPattern) {
this.expectedPattern = expectedPattern;
}
public Boolean getNegatedPattern() {
return negatedPattern;
}
public void setNegatedPattern(Boolean negatedPattern) {
this.negatedPattern = negatedPattern;
}
public String getDescription() {
return description;
}
public void setDescription(String description) {
this.description = description;
}
public Boolean getActive() {
return active;
}
public void setActive(Boolean active) {
this.active = active;
}
}
|
2002
This page covers every sets, books and video-games that came out in the year 2002.
Sets
4711 Flying Lesson | Pieces: 23 (Includes Harry Potter and Draco Malfoy as minifigures)
4712 Troll on the loose | Pieces: 71 (Includes Harry Potter as a minifigure)
4727 Aragog in the Dark Forest | Pieces: 178 (Includes Harry Potter and Ron Weasley as minifigures)
4731 Dobby's Release | Pieces: 70 (Includes Lucius Malfoy and Dobby as minifigures)
4735 Slytherin | Pieces: 90 (Includes Harry Potter, Ron Weasley and Draco Malfoy as minifigures)
KCCHP Harry Potter Coca Cola Gift Set | Pieces: 540
TRU01 Quidditch Tower (TRU Event Exclusive) | Pieces: 38
Video-Games
Creator: Harry Potter and the Chamber of Secrets is released
|
package org.firstinspires.ftc.teamcode;
import com.qualcomm.robotcore.eventloop.opmode.Autonomous;
// import com.qualcomm.robotcore.eventloop.opmode.TeleOp;
import com.qualcomm.robotcore.eventloop.opmode.LinearOpMode;
import com.qualcomm.robotcore.hardware.DcMotor;
import com.qualcomm.robotcore.hardware.DcMotorSimple;
import com.qualcomm.robotcore.hardware.Servo;
import com.qualcomm.robotcore.util.ElapsedTime;
import com.qualcomm.robotcore.util.Range;
public abstract class Time_Autonomous_Base extends LinearOpMode {
DcMotor FLMotor;
DcMotor FRMotor;
DcMotor BLMotor;
DcMotor BRMotor;
public void init_motors () {
FLMotor = hardwareMap.dcMotor.get("flmotor");
FRMotor = hardwareMap.dcMotor.get("frmotor");
BLMotor = hardwareMap.dcMotor.get("blmotor");
BRMotor = hardwareMap.dcMotor.get("brmotor");
FLMotor.setDirection(DcMotor.Direction.REVERSE);
BLMotor.setDirection(DcMotor.Direction.REVERSE);
}
public void mcdrive (double speed, int time) {
speed = Range.clip(speed, -1, 1);
FLMotor.setPower(speed);
FRMotor.setPower(speed);
BLMotor.setPower(speed);
BRMotor.setPower(speed);
sleep(time);
FLMotor.setPower(0.00);
FRMotor.setPower(0.00);
BLMotor.setPower(0.00);
BRMotor.setPower(0.00);
}
public void mcstrafe (double speed, int time) {
speed = Range.clip(speed, -1, 1);
FLMotor.setPower(-speed);
FRMotor.setPower(speed);
BLMotor.setPower(speed);
BRMotor.setPower(-speed);
sleep(time);
FLMotor.setPower(0.00);
FRMotor.setPower(0.00);
BLMotor.setPower(0.00);
BRMotor.setPower(0.00);
}
public void mcturn (double speed, int time) {
speed = Range.clip(speed, -1, 1);
FLMotor.setPower(-speed);
FRMotor.setPower(speed);
BLMotor.setPower(-speed);
BRMotor.setPower(speed);
sleep(time);
FLMotor.setPower(0.00);
FRMotor.setPower(0.00);
BLMotor.setPower(0.00);
BRMotor.setPower(0.00);
}
}
|
Angular Material MatTableModule - How can I access the returned data from component.ts file from outside the mat-table in the template?
I'm working on an Angular 5 project and I have a table with data that I'm displaying. The table is a MatTableModule from angular material. This is a two part question.
I have a service that fires a GET request to my API and returns all the data, which I'm handling in my component.ts file below. All this works fine but the table is not responsive on smaller screens hence I need to be able to loop through the returned data and display it in another, non-tabular format on smaller screens. However, I can't figure out how to.
import { Component, OnInit } from '@angular/core';
import { Observable } from 'rxjs/Observable';
import { DataSource } from '@angular/cdk/collections';
import { RoutesService } from '../../services/routes/routes.service';
import { Routes } from '../../services/models/routes.model';
@Component({...})
export class RoutesComponent implements OnInit {
public displayedColumns = ['from', 'to', 'departures', 'duration', 'price'];
public dataSource = new RoutesDataSource(this.routesService);
constructor(private routesService: RoutesService) { }
ngOnInit() { }
}
export class RoutesDataSource extends DataSource<any> {
public iterable: string[] = ["foo", "bar"];
constructor(private routes: RoutesService) {
super();
}
connect(): Observable<Routes[]> {
return this.routes.getRoutes();
}
disconnect() {}
}
My template file
<mat-table [dataSource]="dataSource">
<!-- From Column -->
<ng-container matColumnDef="from">
<mat-header-cell *matHeaderCellDef> From </mat-header-cell>
<mat-cell *matCellDef="let route"> {{route.from}} </mat-cell>
</ng-container>
<!-- To Column -->
<ng-container matColumnDef="to">
<mat-header-cell *matHeaderCellDef> To </mat-header-cell>
<mat-cell *matCellDef="let route"> {{route.to}} </mat-cell>
</ng-container>
<!-- Departures Column -->
<ng-container matColumnDef="departures">
<mat-header-cell *matHeaderCellDef> Departures </mat-header-cell>
<mat-cell *matCellDef="let route">{{route.departures}}</mat-cell>
</ng-container>
<!-- Duration Column -->
<ng-container matColumnDef="duration">
<mat-header-cell *matHeaderCellDef> Duration </mat-header-cell>
<mat-cell *matCellDef="let route"> {{route.duration}} </mat-cell>
</ng-container>
<!-- Price Column -->
<ng-container matColumnDef="price">
<mat-header-cell *matHeaderCellDef> Avg_price </mat-header-cell>
<mat-cell *matCellDef="let route">
<button mat-raised-button color="primary">{{route.avg_price}}</button>
</mat-cell>
</ng-container>
<mat-header-row *matHeaderRowDef="displayedColumns"></mat-header-row>
<mat-row *matRowDef="let row; columns: displayedColumns;"></mat-row>
</mat-table>
What I'd like to do is be able to loop over the returned data from outside mat-table. Apparently binding dataSource to the mat-table somehow automatically subscribes to the service and I'm able to access the values in there. I just need to be able to do the same outside mat-table.
And while at it, I also would like to know how I can access that iterable property in the RoutesDataSource class from inside the Component class. How do I do that?
And I can't figure out how to add syntax highlighting on this code!
Any help would be greatly appreciated. Thanks.
Found a work around to this problem.
I added a class property items like so...
public items: Array<any> = []
then in the ngOnInit() method...
ngOnInit() {
this.routesService.getRoutes().subscribe((data) => {
if (data) {
this.items = data;
}
});
}
Hence, I was able to access and loop over the 'items' in my template and get my desired outcome. The only issue with this is that you end up subscribing to the same service twice in one component but otherwise, it works just fine.
|
package com.myIsoland.enums;
public enum UserCorpStsType {
REJECT(-1),//拒绝申请
UNAUDITED(0),//未审核
ADOPT(1),//采纳通过
DELETE(-2);//删除
private Integer value;
UserCorpStsType(Integer value){this.value=value;}
public Integer getValue() {
return value;
}
public UserCorpStsType valueOf(int value) {
switch (value) {
case -2:
return UserCorpStsType.DELETE;
case -1:
return UserCorpStsType.REJECT;
case 0:
return UserCorpStsType.UNAUDITED;
case 1:
return UserCorpStsType.ADOPT;
default:
return null;
}
}
}
|
Delicious fragrance and fine coloring make Hyacinths delightful both as winter pot plants and as early outdoor flowers in spring. They are among the easiest bulb flowers to grow in the house, and when properly planted and cared for outdoors they are as hardy as Tulips and Daffodils.
House Culture
Plant from September to December in well-drained pots of light, rich, sandy soil. Place each bulb so that the top is just below the surface. Have the soil fine and loose so that the bulbs will not push out when the roots begin to grow. Water thoroughly, and set the pots in a cool dark place for several weeks until a strong root growi;h has formed. Water occasionally if the soil dries out. Bring the pots into the light gradually after top growth begins, keep at a temperature of 60 to 70 degrees, and water often. Hyacinths can also be gro^vm successfully in glasses. Large size bulbs are best for house culture.
Garden Culture
Plant bulbs any time from October until the ground freezes. In light soil, set bulbs four or five inches deep; in heavy soil, not more than two or three inches. An inch or two of sand beneath each bulb will take care of excess moisture. Always cover hyacinth beds with straw or leaves before freezing weather. In severe climates mulching to a depth of three or four inches is necessary.
|
Naminé
Kingdom Hearts: Chain of Memories
A young witch who, under orders from Marluxia, rewrote much of Sora's memory.
But truth be told, the two had never met before Castle Oblivion.
* Reverse/Rebirth
A young witch who can manipulate memories.
Now she watches over Sora until the reconstruction of his memories is complete.
Kingdom Hearts II
A girl with the power to manipulate memories.
She seems to have some strong connection to Sora.
Birth
Castle Oblivion
However, like Sora, he believes that Naminé is his long lost friend, and that he made the same promise to Naminé that Sora did, and even has an identical lucky charm (though this one is merely a transformed card). Naminé's conscience eventually allows her to overcome her loneliness and fears, and she goes to reveal herself to Sora after being released by the two-faced Axel. She appears to Sora in the memory version of Destiny Islands as he is conversing with the memory version of Naminé. She tells him that she had never been in his heart, despite what his memories show him, and to look for a faint glimmer of light in the deepest regions of his heart, for that light is the person special to him.
Reverse/Rebirth
Kingdom Hearts 358/2 Days
A Year Later
Capture
The World That Never Was
Personality
She particularly feels close to Roxas, often helping him as best as she can.
Examples of Naminé's emotional capacity are as follows:
* She willingly threw herself between Sora and Larxene to keep Larxene from killing Sora.
* She showed genuine remorse and guilt for what she had done to Sora, Donald, and Goofy.
* She was frozen in fear when Axel said he would kill her to get to Marluxia.
* She angrily refused to destroy Sora's heart even with the penalty of death from Marluxia.
* She began to cry after she put Sora into stasis.
* She was willing to go against DiZ's orders to assist Roxas.
* She happily smiled at Roxas through Kairi in the FMV ending of the second game.
Appearance
Memory Manipulation
Darkness
Quotes
* "No...The girl you really care for...The one who was always with you...It’s not me. It’s her..."
* "But what if he needs those memories in order to wake up? What if they're the key?"
* "If his memories become her memories... she will never survive it."
Trivia
* In Japanese, while Kai means "Sea", Nami means "Wave".
Naminé
|
2010 San Francisco Giants season
The 2010 San Francisco Giants season marked their 128th year in Major League Baseball, their 53rd year in San Francisco since their move from New York following the 1957 season, and their 11th in AT&T Park. The Giants won the National League West for the first time since the 2003 season and both the NLDS and NLCS for the first time since the 2002 season. They would go on to win the World Series, their first championship since moving to San Francisco in 1958. Giants catcher Buster Posey was awarded the National League Rookie of the Year Award.
On October 7, the Giants played their first playoff game since 2003. In the first game of their NLDS against the Atlanta Braves, Tim Lincecum struck out fourteen in a 1–0 victory over Derek Lowe, setting a franchise postseason strikeout record. On October 11, the Giants won their series against Atlanta, advancing to the National League Championship Series against the Philadelphia Phillies. On October 23, the Giants defeated the Phillies to advance to the World Series where they faced the Texas Rangers. On November 1, the Giants defeated the Rangers in Game 5 to win their first championship since.
Notable events
* December 29, 2009 — Giants sign free agent Mark DeRosa
* January 13 — Giants sign free agent Aubrey Huff
* April 15 — Giants trade outfielder Fred Lewis to the Toronto Blue Jays for a player to be named later or cash considerations
* May 29 — Giants promote catcher Buster Posey from AAA-Fresno and sign free agent outfielder Pat Burrell
* June 30 — Giants trade catcher Bengie Molina to the Texas Rangers for relief pitcher Chris Ray and a player to be named later
* July 4 — Pitchers Tim Lincecum and Brian Wilson are named to the 2010 Major League Baseball All-Star Game
* July 15 — Giants sign free agent Dontrelle Willis to a minor league deal
* July 31 — Giants trade pitcher Joe Martinez and minor-league outfielder John Bowker to the Pittsburgh Pirates for left-handed relief pitcher Javier López
* July 31 — Giants trade minor league pitcher Daniel Turpen to the Boston Red Sox in exchange for right-handed relief pitcher Ramón Ramírez
* August 11 — Giants trade minor league outfielder Evan Crawford to the Chicago Cubs for infielder Mike Fontenot
* August 13 — Giants acquire outfielder José Guillén from the Kansas City Royals for a player to be named later and cash
* August 23 — Giants claim outfielder Cody Ross off of waivers from the Florida Marlins
* October 23 — Giants defeat Philadelphia 3–2, winning the NLCS 4–2 and advancing to face the Texas Rangers in the 2010 World Series
* November 3 — The Giants and their fans celebrate the World Series victory with a parade from the Financial District to Civic Center in downtown San Francisco.
* November 15 — Buster Posey is named the National League Rookie of the Year
Offseason and spring training
The Giants 23–12 record was good enough for second place in the Cactus League standings and was the best spring training record among National League teams.
April
The Giants opened the season with a 5–2 win over the Houston Astros and won their first four games, including a thrilling 5–4 win over the Atlanta Braves in 13 innings in their home opener at AT&T Park. But they failed to put together a winning streak longer than 2 games for the rest of the month, losing four straight games between the 18th and 21st, though strong pitching often kept them in games despite an inconsistent offense. After a tough 7–6 loss to the Phillies in 11 innings on the 28th, the Giants rebounded for a 5–2 win over the Colorado Rockies to close out the month.
May
After taking two out of three from the Rockies, the Giants traveled to Florida to start a three-game series with the Marlins. They led the first game 5–3 behind Tim Lincecum's 13 strikeouts, but fell behind 6–5 in the eighth. Down to their last out, Aaron Rowand hit a home run to tie the game. The Giants won 9–6 in 12 innings and went on to sweep the series.
The team then went through a rough stretch, losing two out of three to the Mets before getting swept by the NL West leading San Diego Padres. They recovered a bit by sweeping the Astros, and splitting a two-game series with the Padres but then went on a five-game losing streak before snapping it with a win over the Washington Nationals. On May 29, Buster Posey was called up to the Giants and had three hits and three runs batted in during a 12–1 win over the Arizona Diamondbacks. That same day, the team signed Bay Area native Pat Burrell to a minor league contract. Padres CEO Jeff Moorad, Burrell's friend and his former agent, would later say he regretted not recruiting Burrell to the Padres. Originally signed as a bench player, Burrell played his way into the starting lineup and wound up hitting .266 with 18 home runs and 51 runs batted in over 96 games. The team would end May with a flourish, winning 5 of their last 7 games.
June
The Giants continued their strong play into the month of June. Though they lost the first series of the month to the Rockies, they won 3 out of their next 4 series, including completing a sweep of the Oakland Athletics, who had swept them the previous month. In the second half of the month, the team collapsed, losing their next 5 series in a row and ended the month with a 5-game losing streak culminating in a three-game sweep by the rival Dodgers. On June 30, the Giants traded Bengie Molina to the Texas Rangers, clearing the way for Buster Posey to become the everyday catcher.
July
The month of July marked a very strong comeback for the team, although it did not start off well. The Giants started the month with a 4-game series against the Rockies and lost the first two, extending their losing streak to 7. After coming back to win the third game despite losing a six-run lead early on, the Giants suffered an arduous 15-inning defeat to Colorado in the fourth game on July 4, putting their record at 41–40. The Giants immediately bounced back and went on a surge, coming back to sweep a 4-game series against the Brewers. They went on to win six of the next seven series during the month, including a sweep against the Diamondbacks, with the only blemish being a 4-game split with the Marlins, the most noteworthy of the four being a game in which the Giants led 9–2 at one point only to see the Marlins battle back to tie it. The game was won by the Giants in the bottom of the 10th inning when Andrés Torres hit a game-winning single for his fourth hit of the game, making the final score 10–9. On July 20, the Giants beat the Dodgers 7–5 at Dodger Stadium after trailing 5–1 at one point. On July 31, Burrell hit a 2-run home run in the eighth inning to lead the Giants to another comeback win over the Dodgers. Overall, the team went 20–8 during the month, finishing July with a 60–45 record. Pitchers Tim Lincecum and Brian Wilson were selected for the All-Star Game.
August
After their strong July, the Giants stumbled throughout August. Ace starting pitcher Tim Lincecum, who started the month with an 11–4 record and a 3.15 ERA, lost his edge, going 0–5 with a 7.82 ERA over the month. The Giants lost series against the Braves, Cardinals, Phillies, and Diamondbacks, though they took three out of four from the Chicago Cubs early in the month. After scoring blowout wins in the first two games of a three-game series against the Cincinnati Reds, the Giants trailed 10–1 in the third game but scored six runs in the eighth and ended up taking an 11–10 lead. But the Reds came back to tie it in the top of the 9th after Drew Stubbs reached 2nd base on a throwing error by Pablo Sandoval, and Brian Wilson gave up a game-tying single to Paul Janish. Then in the top of the 12th inning, Barry Zito, in a rare relief appearance, gave up the go-ahead hit to Joey Votto. Though the Giants got the tying run to third base on singles by Sandoval and Mike Fontenot in the bottom of the inning, they did not score and lost the game 12–11. The Giants then lost three of their next five games, ending the month 13–15 overall, as the calendar turned to September. The Padres, however, would go on a 10-game losing streak starting on August 26. Three days prior to the start of the Padres losing streak, the Giants acquired Cody Ross off waivers from the Florida Marlins to block him going to the Padres. Ross didn't do much offensively for the rest of the regular season but would become a major factor in the postseason.
September
On September 10, the Giants defeated the Padres to tie for first place in the NL West after trailing the Padres by 7 and a half games on July 4. For the next 15 days, each team traded the top spot. Then the Giants began a four-game winning streak to take over first place, taking the lead for good on September 26. Their lead would grow to three games entering the final three games of the season against the Padres as the Giants won 18 of the 26 games they played during the month. Lincecum also rebounded from his poor August, posting a record of 5–1 and striking out fifty two while walking only six.
The Giants pitching staff posted historic numbers for the month of September, going a record 18 straight games giving up 3 runs or less. (The last team to accomplish that feat was the 1917 Chicago White Sox.) Their 1.78 team ERA was the lowest in a month since divisional play started in 1969.
October
The Giants entered the three-game series with the Padres needing just one win to clinch the NL West. They lost the first two games by scores of 6–4 and 4–2 before clinching the NL West with a 3–0 win on the final day of the regular season, finishing with a 92–70 record. It was the Giants' first NL West division title since 2003. Because the Atlanta Braves also defeated the Phillies that day, they clinched the NL Wild Card, eliminating the Padres from contention. The Giants would face the Braves in the NLDS starting October 7.
National League Division Series
The NLDS was a close, hard-fought series. Tim Lincecum tossed a complete game two-hit shutout and struck out a franchise postseason record 14 in the opener as the Giants won 1–0. In game two, the Giants took a 4–0 lead behind Matt Cain's stellar pitching and Pat ("The Bat") Burrell's first inning three-run homer. But the Braves fought back, tying the score with three runs in the eighth, then winning in the 11th inning 5–4 on Rick Ankiel's home run as the series shifted to Atlanta.
In game three Jonathan Sánchez struck out 11 and carried a no-hitter into the sixth inning. The Giants led 1–0 in the eighth until Eric Hinske's pinch-hit two-run homer gave the Braves the lead. Rookie righthander Craig Kimbrel came out of the bullpen to start the top of the ninth for the Braves, relieving Jonny Venters who had struck out the side the previous inning. Kimbrel retired Cody Ross on a popout to Brooks Conrad for the first out. Travis Ishikawa pinch-hit for reliever Sergio Romo and drew a walk. After striking out leadoff man Andrés Torres, Kimbrel gave up a two-strike single to second baseman Freddy Sanchez and was lifted, leaving runners on first and second with two outs. Another rookie Brave, lefty Michael Dunn, came on and gave up a two-strike, game-tying single to Aubrey Huff. Right-hander Peter Moylan relieved Dunn and induced a grounder from Buster Posey which bounced through Conrad's legs, the second baseman's third error of the game. Sanchez scored on the play, giving the Giants a 3–2 lead. Kyle Farnsworth came on and got the third out, but the damage was done. The Giants brought in their closer Brian Wilson for the bottom of the ninth. He held the lead, giving up a single to Brian McCann but retiring Nate McLouth on a grounder to end the game and earn a clutch save.
With their backs against the wall, the Braves sent Derek Lowe to the mound on three days' rest. They scored first in the bottom of the third when Brian McCann's sacrifice fly drove in Omar Infante.
Lowe took a no-hitter into the sixth inning, but the Giants tied the game with one out on Cody Ross' first-pitch homer off a Lowe cutter. Brian McCann answered with another in the bottom of the inning off Giants' rookie starter Madison ("Mad Bum") Bumgarner to take back the lead. After Lowe walked Aubrey Huff and allowed an infield single to Buster Posey with one out in the seventh, Bobby Cox, managing his last game after a long and distinguished career in Toronto and Atlanta, went to the mound apparently to remove Lowe from the game. But after talking to him, Cox elected to leave Lowe in, prompting huge cheers from the Atlanta fans.
The next batter, Pat Burrell, walked on a 3–1 pitch near the inside corner, and Lowe's night was done after striking out eight while allowing only two hits and walking two. Relievers Peter Moylan and Jonny Venters couldn't hold the lead, as the Giants promptly scored two runs on Juan Uribe's RBI fielder's choice and Cody Ross' RBI single. The Braves might have been able to escape the one-out, bases-loaded jam unscathed and still ahead 2–1 if not for shortstop Álex González's bases-loading throwing error, his second in the game. Both errors were debatable. The first was a ball hit in the hole he didn't field cleanly with the speedy Andrés Torres running, earlier in the game. The second call was more controversial. With two on and one out and fielding a weakly hit groundball, González elected to throw to second but threw high to second baseman Omar Infante, who was ruled to have come off the base jumping for the throw.
Left-handed Giants reliever Javier López entered the game with two outs in the eighth and pinch-runner Nate McLouth the potential tying run at second base, and struck out slugging rookie sensation Jason Heyward. In the bottom of the ninth, the Braves had one last chance to rally. With one out, Giants closer Brian Wilson walked Rick Ankiel and Eric Hinske to put the potential tying and winning runs on base. But Omar Infante struck out swinging and Melky Cabrera grounded out to end the game and the series in Cox's final game as a manager, both teams giving him a standing ovation after the final out, which was almost not made: slick-fielding Travis Ishikawa had to stretch up and out as far as he could while just managing to keep his toe on the bag as he snow-coned the high, wide throw from third near the tip of the pocket of his first baseman's mitt.
National League Championship Series
The Giants then advanced to the NLCS to face the heavily favored Philadelphia Phillies, who were looking for their third straight pennant. Behind two home runs by NLCS MVP Cody Ross and a strong start from Tim Lincecum, the Giants won Game 1, 4–3. The Phillies easily took Game 2 with a 6–1 win over Jonathan Sánchez before the series shifted to San Francisco for the next three games. Matt Cain and the Giants won Game 3, 3–0, for a 2–1 series lead.
A heart-stopping, crucial Game 4 saw the Giants take an early 2–0 lead. After the Phillies scored four runs in the top of the fifth, the Giants got a run back on an Aubrey Huff single up the middle in the bottom of the fifth, which scored Andrés Torres. In the sixth inning, Pat Burrell drew a leadoff walk and advanced to third on a Cody Ross double. Pablo Sandoval came to the plate and appeared to double down the right field line, but the ball hugged the line and was called foul. Four pitches later, however, Sandoval lined a two-run double sharply into the left-center field gap, scoring Burrell and Ross and giving the Giants a 5–4 lead.
The Phillies tied the score in the top of the eighth with back-to-back doubles by Ryan Howard and Jayson Werth. Giants reliever Sergio Romo recovered to retire the next three Phillies and strand Werth at second, retaining the 5–5 tie. Giants closer Brian Wilson retired the Phillies 1-2-3 in the top of the ninth.
In the bottom of the ninth, Game 2 winner Roy Oswalt volunteered for a rare relief appearance. With one out Huff singled past a diving Howard. Posey followed with a single to right —- his fourth hit of the game -— that enabled Huff to reach third. Juan Uribe, batting for Wilson, followed with a sacrifice fly to deep left field that scored Huff with the winning run. The victory gave the Giants a commanding 3–1 series lead.
With a chance to wrap up the NL pennant at home, Lincecum got the start in game 5. Although the Giants scored first, Philadelphia took a 4–2 win, aided by a series of Giants defensive miscues that allowed the Phillies to score three runs in the third inning, to send the series back to Philadelphia.
Game 6 saw Giant starter Jonathan Sánchez give up two early runs, but San Francisco rallied against Phillies starter Roy Oswalt in the third inning. Sánchez led off with a single, and took second when leadoff man Andrés Torres' long fly to the wall in center was dropped by Shane Victorino. Freddy Sanchez sacrificed the runners to second and third, and Aubrey Huff hit a single up the middle, which scored Sánchez before Victorino nailed Torres at home. But Huff took second base on the throw home and eventually scored on second baseman Plácido Polanco's throwing error to tie it up at 2–2. In the bottom of the inning, Sánchez lost his control by yielding a leadoff walk and then hitting Chase Utley with a pitch; Sanchez then lost his poise, prompting both benches to empty and glare at one another before order was restored. Replacing Sanchez, Lefty Jeremy Affeldt escaped the jam and retired six in a row. Manager Bruce Bochy then called on starter Madison Bumgarner, who survived two rocky innings without allowing a run, and Javier López, who retired the side in order in the seventh. With two outs in the top of the eighth, Juan Uribe hit an opposite field drive just over the right field barrier for a solo home run to give the Giants their first lead at 3–2.
Starter Tim Lincecum, who had pitched 7 innings two days earlier, then entered the game in a relief role. He struck out Werth after falling behind 2–0, but then yielded back-to-back singles to Victorino and Raúl Ibáñez, prompting Bochy to bring in closer Brian Wilson. First baseman Huff then atoned for a critical Game 5 error by gloving a sharp line drive from Carlos Ruiz and easily doubling off Victorino at second to end the inning.
In the bottom of the ninth Wilson got pinch-hitter Ross Gload to ground out, but then walked leadoff man Jimmy Rollins. Plácido Polanco grounded to Uribe, who forced Rollins at second. Utley then drew a walk, moving the potential tying run to second and putting the potential winning run on first. With a full count and the runners moving on the pitch, Wilson froze slugger Ryan Howard with a called third strike on a cutter that just caught the bottom of the strike zone to send the Giants on to the World Series.
World Series
The 2010 World Series pitted the Giants against the Texas Rangers, who had just won their first pennant. Game 1, in San Francisco because the National League had won the All-Star Game, saw Lincecum face lefty Cliff Lee, who had had a stellar first postseason for the Phillies the year before. Texas took a 1–0 lead in the first, but Lincecum induced a double play to limit the damage. Lee wasn't sharp, though, and gave up seven runs, one of them unearned because Rangers manager Ron Washington had gambled on putting veteran slugging designated hitter Vladimir Guerrero ("Bad Vlad") in AT&T Park's super-spacious right field which he simply could not cover and misplayed more than one would-be single into extra bases. Uribe hit a three-run home run in the sixth to extend a 5–2 lead to 8–2. Entering the ninth, the Giants were up 11–4 before the Rangers scored three essentially meaningless runs to make the final score 11–7.
Game 2 was a pitcher's duel between Matt Cain and lefty C. J. Wilson. The game was scoreless until the bottom of the fifth, when Édgar Rentería hit a solo home run. Cain went 7 2⁄3 innings, allowing only four hits. Uríbe singled in another run in the seventh to extend the lead to 2–0, but in the eighth things fell apart for the Rangers as their bullpen imploded and the Giants scored seven runs. The Giants won Game 2, 9–0.
The series shifted to Texas for the next (which proved to be the last) three games. Behind a solo home run by superstar slugger Josh Hamilton and an earlier three-run blast by rookie first baseman Mitch Moreland in support of a strong start by Colby Lewis, the Rangers defeated Jonathan Sánchez in Game 3, 4–2. Game 4 was played on a hot, sultry Halloween night. Designated hitter Huff in the third (with a man on) and catcher Posey in the eighth hit home runs, while Bumgarner pitched eight shutout innings as the Giants won 4–0, Wilson finishing up in a non-save situation.
Game 5 was a pitching rematch of Game 1 between former Cy Young Award winners Cliff Lee and Tim Lincecum. Down 3–1 in the series, the Rangers needed a win in their ballpark to send the Series back to San Francisco or the Giants would return home as champions. What resulted was the pitching duel anticipated, but not realized, in Game 1. Both Lee and Lincecum pitched six shutout innings, with Lincecum allowing only two hits and Lee three. In the top of the seventh inning, Ross and Uríbe singled back to back to put two runners on with none out. The next hitter, Huff, who had never laid down a bunt in his major league career, sacrificed successfully, with only a quick pickup and crisp, accurate throw by Lee to just get Huff at first saved a bases-loaded, nobody out dilemma for Texas. Runners were now at second and third with one out for Burrell, whom Lee struck out after a struggle for the second out, preserving the scoreless tie for the moment. Shortstop Édgar Rentería, who had hit a walk-off single in Game 7 off Cleveland's Charles Nagy to win the 1997 World Series for Jim Leyland and his Florida Marlins in extra innings, now came to the plate. His two years with San Francisco had been considered a major disappointment, marred by injuries and slumps, but here in the World Series he became an unlikely hero by launching a three-run homer to left. After Nelson Cruz answered with a solo homer in the seventh, Lincecum shut the door on the Rangers, giving up just three hits and striking out ten in eight innings of work. Brian Wilson then retired the side in order in the ninth for the Series-winning save and first-time baseball world championships not just for the Giants (for the first time in 56 years) but for San Francisco, since the Giants' five other world championships were won in New York (in 1905, 1921, 1922, 1933 and 1954). Rentería was named World Series MVP for hitting .412 with two home runs (including the Series winner) and six RBI. It was Bochy's first world championship as a player or manager, having played as a second-string catcher for eight years and having managed the Padres and Giants for sixteen.
The firsts with the championship were:
* Giants:
* Championship since, when in New York.
* Championship since moving to San Francisco.
* City and County of San Francisco:
* World Series championship.
* Major sports championship since the 49ers won Super Bowl XXIX in 1995.
* San Francisco Bay Area:
* World Series championship since the Oakland Athletics swept the Giants in.
* Major sports championship since the 49ers win in Super Bowl XXIX.
In summing up the firsts, Larry Baer, the president of the Giants and a fourth generation resident of San Francisco, said that the team dedicated the championship to everyone who has worn a Giants uniform, and all Giants fans since the team's move to San Francisco, honoring 53 years of baseball in the city.
Batting
Note: G = Games played; AB = At bats; R = Runs scored; H = Hits; 2B = Doubles; 3B = Triples; HR = Home runs; RBI = Runs batted in; AVG = Batting average; SB = Stolen bases
Pitching
Note: W = Wins; L = Losses; ERA = Earned run average; G = Games pitched; GS = Games started; SV = Saves; IP = Innings pitched; R = Runs allowed; ER = Earned runs allowed; BB = Walks allowed; K = Strikeouts
Batting
Note: G = Games played; AB = At Bats; R = Runs scored; H = Hits; 2B = Doubles; 3B = Triples; HR = Home runs; RBI = Runs batted in; AVG = Batting average; SB = Stolen bases
Pitching
Note: W = Wins; L = Losses; ERA = Earned run average; G = Games pitched; GS = Games started; SV = Saves; IP = Innings pitched; R = Runs allowed; ER = Earned runs allowed; BB = Walks allowed; K = Strikeouts
Farm system
LEAGUE CHAMPIONS: San Jose
|
Asking questions in Chinese often fails.
Hello friend, I have a very strange problem. When I ask the question in English, it goes well. But when I ask the question in Chinese, it hardly returns results.
](url)
Hello friend, I have a very strange problem. When I ask the question in English, it goes well. But when I ask the question in Chinese, it hardly returns results.
](url)
你用的UE 5.2 还是什么版本，我用UE 5.2 安装了这个插件，打开项目直接报错：
|
# preciseTADhub
An ExperimentHub package that contains pre-trained random forest models
associated with the [preciseTAD](https://github.com/dozmorovlab/preciseTAD) R package.
Stilianoudakis, Spiro, and Mikhail G. Dozmorov. "preciseTAD: A machine learning framework for precise 3D domain boundary prediction at base-level resolution." bioRxiv (2020). https://doi.org/10.1101/2<IP_ADDRESS>2186
|
Faceless
Faceless may refer to:
Films
* Faceless (1988 film), French slasher film
* Faceless (2007 film), Austrian/British science fiction film
* Faceless (2016 film), Canadian-Afghan action film
Music
* Faceless (Godsmack album), 2003 album
* The Faceless, American death metal group
* Faceless (Buried in Verona album), 2014 album
* "Faceless" (EP), 1991 EP by Impetigo, or the title song
* "Faceless" (song), 2010 song by Red
Literature
* Faceless, 2001 novel by Martina Cole
* Faceless, 2003 novel by Amma Darko
|
Hyper-spectral means and method for detection of stress and emotion
ABSTRACT
A system and method for detecting physiological stress in a person is provided which includes an imagining device and a processor. The processor receives an output from the imagining device representative of the. The processor identifies a characteristic of the person in the image which indicates that the person is not experiencing stress and a second characteristic which indicates the person is experiencing stress. A comparator compares the image of the subject and the two characteristics and the processor extrapolates from the comparison whether or not the person is experiencing a heightened state of stress or nervousness. If so the processor provides an output to activate an alarm or otherwise signal this condition to other individuals involved in monitoring a given area.
FIELD OF THE INVENTION
The present invention relates to the detection of stress in human beings, and more particularly to using hyperspectral methods to detect physiological stress in human beings.
BACKGROUND OF THE INVENTION
Sep. 11, 2001 vastly increased the need to unobtrusively detect stress in human beings, particularly in individuals about to commit an atrocity. If the individuals responsible for the destruction that occurred on Sep. 11, 2001 could have been detected based on observable signs of stress without the individuals noticing the surveillance, events of that day may have been far different.
More mundane needs to detect human stress also exist. For instance, heavy equipment operators who are becoming fatigued experience stress before they subjectively notice their fatigue. Likewise pilots, truck drivers, air traffic controllers, and mass transit and public transportation drivers are similarly situated. Generally, any worker who might endanger others may become tired and therefore pose a hazard to others and also to property. Automatic, objective means to detect the stress associated with their fatigue could save innumerable lives and untold sums otherwise expended in repairing and replacing damaged property.
In particular, unobtrusive means to detect stress would also be highly desirable. In the related applications of stress detection in anti terror and law enforcement efforts, knowledge of the stress detection system would likely cause the subject to alter his/her behavior to avoid stress detection and subsequent identification as a target or suspect. In fatigue detection applications, typical subjects might find the presence of monitoring equipment offensive or insulting. Moreover, in all of these situations innocent third parties possess civil rights which shield them from intrusive violations of their privacy. Thus, a long felt need exists to unobtrusively detect stress.
Human subjects react to transient physiological stress in a variety of ways including increased pulse rate, muscle tremor, perspiration, and sub-dermal blow. By monitoring the subject for these stress symptoms the presence of the stress may be detected. Polygraph machines monitor pulse, respiration, and galvanic skin response while the subject is interrogated. His/her responses as measured allow, to an extent, an observer to evaluate the truthfulness of his/her responses to an extent. Unfortunately, polygraph machines remain difficult to use, stressful for the subjects, require a highly trained operator, and are difficult to miniaturize sufficiently to become portable. The fatal flaw possessed by polygraph machines, though, lies in their untrustworthiness.
In the alternative, fMRI (functional magnetic resonance imaging) machines have been used to detect stress. However fMRI machines also remain large and expensive. These disadvantages prohibit use of fMRI machines to detect stress in many situations including detecting terrorists at airports and other locations, interrogation of witnesses, and many other applications.
Hyper-spectral image processing has been used for long range unobtrusive reconnaissance but not for detecting stress. Hyper-spectral imaging involves the monitoring of a scene of interest at one or more selected wavelengths of electromagnetic radiation. The selected wavelengths are chosen because the scene is likely to contain a subject of interest which is clearly visible at those wavelengths. Clarity may occur because of the intensity of the particular subject, or because of the contrast of the subject with the background, at the selected wavelength. Additionally, the wavelength selected may be chosen because the background is unlikely to contain other objects which emit or reflect radiation at that wavelength. In the alternative, it may be that the subject is camouflaged, usually imperfectly. If the imperfections allow radiation of a particular wavelength to escape, then that wavelength can be advantageously monitored.
Because hyper-spectral image processors only monitor select wavelengths, the processing power required may be greatly reduced over devices monitoring large bands of the entire spectrum. Accordingly, a less powerful (and less expensive) processor may be used. In the alternative, a greater number of targets may be monitored or the monitored scene may be expanded. Moreover, because hyper-spectral imaging may be accomplished with machine vision systems, no human intervention is necessary. Though human participation may be desirable to supplement the unobtrusive hyper-spectral processor.
While observers of a stressed person can readily detect the presence of that stress, a need exists for an apparatus which automatically detects observable symptoms of stress and which triggers an alarm. Additionally, because human sensory perceptions possess limited abilities to discern subtle changes, a need exists for a more sensitive detection system for such stress. Moreover, because observers can err, tire, or be distracted, a need exists for an automated method to accomplish stress detection.
Such unobtrusive stress detection could be advantageously employed in numerous other applications. For instance, law enforcement personnel investigating crimes could benefit from knowing when a witness or target of an investigation is under stress due to attempting to tell a lie. Retail store owners could benefit from detecting suspected shoppers who are experiencing stress due to their attempt to steal merchandise. Even children with behavioral or learning disorders could benefit from early, reliable detection of stress whereby their care givers can intervene early. Thus a long felt need exists to unobtrusively detect stress.
SUMMARY OF THE INVENTION
The present invention uses techniques from hyper-spectral processing to detect transient changes of sub-dermal blood flow and dermal hydration (i.e. a stress induced blush causing reddened sweaty skin). Hyper-spectral imaging is a technology in which a given scene is viewed generally in a large number of selected wavelengths and the images recorded for later processing. Immediate, real-time processing may also be used. In some wavelength ranges, features of an observed scene will appear which are easily detectable and obvious, whereas these same features might exhibit low contrast and visibility at other wavelengths. Thus, wavelengths are selected for use in hyper-spectral systems according to whether they convey information in which the observer is interested.
Usually the subject will be observed against a complex background that tends to mask the presence of the subject. For instance, the background may reflect or emit a spectrum including a variety of ranges which over lap the selected wavelengths. For instance, marijuana growing in a forest may be masked from law enforcement surveillance by the various shades of green of the forest, unless the surveillance occurs at a “green” wavelength unique to marijuana. More particularly, some targets will employ techniques to mask their presence by using aids to alter their reflected spectrum. An example of such a situation would be the use of camouflage netting to conceal a command post or artillery battery.
An underlying principle of the present invention is that the “color,” or reflectance spectrum, of the skin of a person is modified as a result of transient changes in dermal hydration and sub-dermal hemoglobin flow associated with the emergence of a blush. The blush may be induced by stress or other physiological arousal. In accordance with the present invention, these changes may be passively and unobtrusively detected.
While observers of the blushing person can readily detect the blush once it progresses far enough, a need exists for an apparatus which can automatically detect the emergence of a blush and trigger an alarm. Additionally, because the human eye is limited in its ability to discern subtle changes in coloration (the reflection spectrum) a need exists for automated detection of physiological stress. Moreover, because observers can err, tire, or be distracted, a need exists for a machine to accomplish stress detection.
In addition to satisfying those needs, the present invention accounts for intervening reasons which may alter the reflectance spectrum of a person's skin. A database which characterizes typical skin types (i.e. colors) under controlled conditions and subject to a variety of factors (such as age, sex, cultural background and ethnicity) may be consulted to improve the accuracy of the hyper-spectral processing system. Accordingly, the database enables the identification of a hyper-spectral signature for stress despite the presence of these intervening factors.
The present invention also provides a hyper-spectral system which monitors wavelengths selected based on the considerations discussed herein. Image processing software, decision making software, and display and communication interfaces are also included in accordance with preferred embodiments of the present invention. A spectral instrument, in accordance with a preferred embodiment of the present invention, may be implemented in a portable configuration which operates passively and unobtrusively without physical contact with the subject or his/her awareness of surveillance.
In accordance with a preferred embodiment of the present invention a circuit for detecting physiological stress in a specimen is provided which includes an input and a processor. The input receives an image from a camera and provides it to the processor. The processor identifies two characteristics of a subject who is within the image. The first characteristic indicates that the subject is not experiencing stress and the second characteristic indicates the subject is experiencing stress. A comparator compares the image of the subject and the two characteristics. If the subject appears to be stressed an alarm is signaled.
In accordance with a second preferred embodiment of the present invention a method of detecting physiological stress of a subject is provided. The method includes observing the subject who includes a first spectral characteristic when unstressed and a second spectral characteristic when stressed. The image is compared to the first and the second characteristics to determine whether the subject is stressed.
In accordance with a third preferred embodiment of the present invention a circuit for detecting physiological stress in a subject is provided. The circuit includes a processor which receives an image of the subject. Two areas of the subject's skin are identified by the processor. One area of skin is unlikely to blush and the other area is likely to blush. By comparing the two areas of skin, the processor identifies attenuation of one of the areas of skin which is indicative of a blush.
Further areas of applicability of the present invention will become apparent from the detailed description provided hereinafter. It should be understood that the detailed description and specific examples are intended for purposes of illustration only and are not intended to limit the scope of the invention.
BRIEF DESCRIPTION OF THE DRAWINGS
FIG. 1 is a block diagram of a stress detection system in accordance with a preferred embodiment of the present invention;
FIG. 2 is a graph of typical reflectance spectra from a variety of human skin types;
FIG. 3 is a graph of a typical reflectance spectrum of human skin;
FIG. 4 is a graph of the absorption spectrum of human hemoglobin;
FIG. 5 is a graph of the extinction coefficient of water; and
FIG. 6 is a flowchart of a method in accordance with a preferred embodiment of the present invention.
DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
The following description of the preferred embodiment(s) is merely exemplary in nature and is in no way intended to limit the invention, its application, or uses.
Normally ambient light reflected from a person's skin determines the spectrum of light which an observer sees and interprets as color. It should be noted that light, herein, refers to more than visible light. For the term light encompasses electromagnetic radiation, in particular visible and near infrared radiation in the ranges of approximately 350 to 700 nanometers and 700 to 1500 nanometers respectively.
Those experiencing physiological stress exhibit a number of conditions observable via such radiation. Colloquially, they tend to blush and perspire. The red, sweaty face of a blushing person belies his/her stress. In more scientific terms a blush is an increase in the sub-dermal hemoglobin (blood) flow. More particularly, the hemoglobin visible seen during a blush is generally oxygenated hemoglobin (i.e. red blood).
Dermal hydration, or an increase in perspiration, also typically accompanies a blush. That perspiration, or sweat, contains mostly water with sodium chloride (disassociated sodium and chlorine ions), potassium, magnesium, skin oils, and other trace chemicals in solution. Thus, during a blush a thin film of water tends to cover the skin.
To understand the present invention it is useful to review how light reflects off of skin. Instead of merely reflecting off of skin, ambient light penetrates the epidermis, the upper layer of skin, and is reflected back to the surface. During a blush, incident light approaches the epidermis through the film of perspiration. The film may be infinitesimally thin to about a tenth of an inch deep (where a drop or rivulet has formed). Because water blocks certain wavelengths of electromagnetic radiation, the film of perspiration alters the spectrum of the incident radiation. Notably the perspiration attenuates the intensity of the radiation at those wavelengths at which it absorbs the radiation.
Once the incident radiation enters the epidermis, the epidermis scatters and absorbs some radiation. The remainder it reflects back toward the surface of the skin. It should be noted that normal ambient light only penetrates the epidermis to a depth of about 0.08 inches. Within that region it begins encountering hemoglobin filled capillaries within about the first 0.001 inches. For neonates, as opposed to adults, the amount of blood content ranged from about 4 to about 12 milligram of hemoglobin per gram of tissue (equivalent to about 0.8 to about 2.4% by volume) and the average depth of blood ranged from about 250 to about 425 micrometers as reported by S. L. Jacques, I. S. Saidi, and F. K. Tittel, Average Depth of Blood Vessels in Skin and Lesions Deduced By Optical Fiber Spectroscopy, Society of Photo-Optical Instrumentation Engineers Proceedings of Laser Surgery: Advanced Characterization. Therapeutics, and Systems IV, edited by R. R. Anderson, 2128, 231-237 (1994).
Because of the capillaries, hemoglobin also absorbs a portion of the incident radiation proportional to the amount of hemoglobin which the radiation encounters. Once reflected out of the epidermis, the reflected radiation again encounters the perspiration which absorbs still more of the incident (now reflected) radiation. Thus, the reflected radiation carries, within its altered spectrum, information indicative of the amount of perspiration and sub-dermal hemoglobin present. In particular, the reflected radiation shows a proportional decrease in intensity at the wavelengths absorbed by water and by hemoglobin. Accordingly, the reflected spectrum indicates the degree to which the person is blushing. Since a blush indicates stress, the reflected spectrum indicates the extent to which the person is under stress.
Referring in general to the figures and in particular to FIG. 1, a hyper-spectral system 10 in accordance with a preferred embodiment of the present invention for detecting physiological stress may be seen. The system 10 views, observes, or surveys a scene 12 of interest. Within the scene 12 a subject 14 may be surveyed. Also, as part of a background 18, other non suspect persons 16 may be present as well as vegetation, equipment, and other objects. The subject 14 (or specimen suspect, or target) may be experiencing stress and accordingly may be blushing to some degree. In particular, the subject 14 may be attempting to suppress his/her blush. Yet, because blushing is a partially involuntary reaction to stress, the subject 14 will not be entirely successful in suppressing his/her blush. To aid in the detection of full, and even partial blushes, a data base of numerous varied subjects may be collected which would include data defining their normal, non blushing, skin reflectance spectra and their skin reflectance spectra as altered by the presence of a full blush. Moreover, the data may reflect the subjects as seen in various environments to enable statistical analysis of the spectra in the data base and also that of the spectra captured from images of the subject(s) 14.
To illuminate the scene 12 a visible light source 20 may be included or augmented to illuminate the scene 12. While the light source 20 may be a conventional light source, it may also contain an infrared radiation source. In the alternative, the source 20 could be natural or even diffuse light. Electromagnetic radiation from the source 20, including visible light and preferentially near infrared radiation, illuminates the subject 14. Subject 14 in turn reflects the radiation while altering the spectrum of the incident radiation because of inherent and transient characteristics of his/her skin. More particularly, dermal hydration and oxygenated hemoglobin, indicative of a blush, may attenuate certain wavelengths of radiation in the reflected spectrum.
To receive an image 22 of the scene 12, including the subject 14, the system 10 has a lens or other optical device 24 which focuses the image 22 on a receptor within a hyper-spectral imaging camera 26. Camera 26 may be any type of electronic camera readily available such as a charge coupled device (CCD) or a complementary metal oxide system (CMOS) device capable of sensing either, or both, visible and infrared radiation. The camera 26 captures the image 22 as an array of pixels 27. Note should be made that the camera 26 may operate with ambient, indoor radiation alone. In particular, no laser or other high intensity radiation source need be employed to capture the image 22. Though such high intensity sources, or additional conventional sources, may be employed if it is desired to increase the signal to noise ration of the image, particularly at the selected wavelengths.
From the camera 26, the pixel array 27 is sent to a signal processor 28 as shown in FIG. 1. Note that the camera 26 or the signal processor 28 may filter the image so that only those frequencies of interest may be selectively examined. More particularly, the selected frequencies may be only those at which a blush changes the skin reflectance spectra or just one of these frequencies. Though, other frequencies could be examined also, or ignored, without departing from the spirit or scope of the present invention.
Within the image processor 28 a machine vision application may recognize the shape of human beings. Once the processor 28 recognizes one or more humans it may then prioritize them for further scrutiny. In one embodiment, the system allows a user to select the prioritization scheme. These schemes include prioritization factors such as proximity to the camera 26, proximity to a security station (e.g. checkpoint), similarity to a pre selected photograph, or the presence of indicia of membership in some group (e.g. military insignia), particularly terrorist groups.
Once a target or subject 14 has been selected, the image processor 28 searches for exposed areas of the skin of the subject 14. Such a search may be based upon identifying areas of the image 22 with spectrum similar to those shown in FIG. 2. In the alternative a user with a computer mouse, joystick, light pen or other pointing device may direct the image processor 28 to an area to scrutinize.
Returning now to FIG. 1, once the image processor 28 has identified an area of exposed skin, the image processor 28 may attempt to determine which inherent skin type (i.e. color) the subject 14 possesses. The determination of the skin type may be based on the overall albedo of the subject 14 and a look up table of different skin types according to albedo. In the alternative, the skin type determination may be by way of a hyper-spectral analysis of the reflected ambient light from the subject 14 and comparison to the skin types of, for example, FIG. 2 which may be stored in a database. Either way, the processor 28 obtains a skin reflectance spectrum (such as spectrum 34) against which to compare a spectrum which might exhibit a blush.
The former alternative (albedo based approach) allows for a quicker, less computationally intensive examination while the latter alternative improves the accuracy of the system. In one preferred alternative the albedo based approach executes first to provide a quick assessment. The hyper-spectral analysis approach then executes (or executes in parallel with the albedo based approach) to confirm the results of the quicker approach.
After, or in parallel with, determining the inherent skin type, the image processor 28 then performs a hyper-spectral examination of another area of the skin of the subject 14. With the knowledge of the two partial spectra gained from the examinations the processor compares the two partial spectra searching for difference between the two areas of skin indicative of a blush.
Having completed the comparison, the image processor 28 may then forward the results of the comparison (including the associated images) to a display and alarm device 30 for the user to view or may forward the results to a computer network 31. If the results prove negative (no blush) security personnel may allow the prior subject 14 to pass since his/her classification may now change to that of a non suspect person 16. However, if the results prove positive (the subject 14 is blushing) the image processor 28 may alert security personnel via the display 30 or an alarm.
Moreover, the image 22 may be sent to the network 31 of FIG. 1 for filing and subsequent data processing. In particular, time, date, and location information may be associated with the image 22 to allow subsequent intelligence analysis of the image 22 and subject 14. Thus, the network 31 may connect to intelligence, law enforcement, and other appropriate computers via the internet and other connection schemes.
Since it may be advantageous to allow even a blushing subject 14 to proceed on his/her way (e.g. to expose the remainder of his/her support network or accomplices), the system 10 may be concealed in, or near, the scene 12. In this manner the subject 14 proceeds unaware of the surveillance and his/her potential identification as an individual under stress. Such an unobtrusive surveillance system allows security personnel to check the target's appearance and take further action as may be required. In the alternative, security personnel may choose to allow a stressed person they deem to be innocent to proceed with out complication.
While the present invention has heretofore been described as operating with electromagnetic radiation, the present invention is not so restricted. Any energy which radiates in waves, such as sound, may be utilized to detect signs of stress in the subject in accordance with the present invention. Notably, hyper-spectral analysis of sound may be used to detect an increased pulse of the subject as discussed in U.S. Pat. No. 5,867,257 issued to Rice et al and incorporated herein by reference in its entirety.
Turning now to the image 22 in more detail, reference is made to FIG. 2. FIG. 2 appeared in Elli Angelopoulou, The Reflectance Spectrum of Human Skin, Technical Report MS-CIS-99-29 (December 1999) (unpublished manuscript on file with the Technical Reports Librarian, Department of Computer and Information Science, University of Pennsylvania, 200 S. 33rd Street, Philadelphia, Pa. 19104-6389). FIG. 2 shows the reflectance spectra for the back of the hand for various types of skin. Because the extremities tend to not participate in blushes the back of the hand is of particular use in the present invention. By a spectral examination of the back of the subject's hand, the image processor 28 may observe, identify, and characterize a typical base line, non blushing, skin reflectance spectrum 34 (FIG. 3) for the particular subject 14.
In particular, because the back of the hand and the face of the subject 14 are likely to be exposed to approximately equal amounts of ultraviolet radiation (e.g. the sun or tanning booths), the amount of melatonin, which dominates which type of skin the subject 14 has, will be approximately equal between the hand and the face. That is to say, the face and the back of the hand will be tanned approximately equally, thereby avoiding one intervening factor, tanning, which may cause the system 10 to detect false positive or negative blushes.
For subjects 14 with skin containing high amounts of melatonin obtaining a real-time non blushing spectrum is of particular importance in suppressing false alarms. That result follows from the tendency of high melatonin skin to have a flatter reflectance spectrum than other skins. Accordingly, these skins attenuate the incident radiation to a greater degree with or without a blush present. As an aside, because people tend to swing their hands slightly as they walk, a machine vision application associated with the image processor 28 may be easily programmed to detect the hand by the swinging motion.
Note should be made of several characteristics of human skin shown in FIG. 2. First the skin reflectance intensity 36 generally tends to increase with increasing wavelength. Though a local maximum 38 tends to occur near 500 nanometers with corresponding local minimums 29 and 40 near 375 and 575 nanometers respectively. A plateau 42 also tends to occur at and above 600 nanometers with a high derivative area 44 connecting the local minimum with the plateau 42. By searching for these features of the image 22 of the subject 14, the image processor 28 may determine areas of skin visible on the subject 14. From these areas, the image processor may then extract at least one base line, skin reflectance spectrum 34 (see FIG. 3). Extracting more than one base line, skin reflectance spectrum 34 may be useful in mitigating the presence of scars, skin grafts, tattoos, port wine stains, and deliberate skin alterations to camouflage the subject 14.
While the features 29, 38, 40, 42, and 44 tend to appear in all skin types shown in FIG. 2, darker skin types exhibit a flatter, less intense spectrum than other skins. Thus, the image processor 28 may contain or access a database of other features of the spectra 32 (shown in FIG. 2) to aid in distinguishing skin from other objects in the image 22 and to enable the selection of a base line reflectance spectrum 34. With regard to the spectrum, it will be understood by those skilled in the art that the mention of specific wavelengths herein will be understood to include a sufficient tolerance to accommodate measurement inaccuracy, variations between skin types, variations between individuals, and variations between different areas of the subject's body, and variations of the subject's skin over time.
As mentioned previously, the processor 28 could measure the overall albedo of the subject 14 and then look up a skin type with a corresponding albedo to improve the speed of the system. However, one albedo may correspond closely with several skin types 32 having different spectrum. To account for such a possibility, an algorithm to choose between the alternatives may be executed by the processor 28. However, a full spectral analysis of a non blushing area of the subject 14 allows the processor 28 to make the blush determination using the subject's current skin type. Thus tanning, skin bleaching, and other attempts to camouflage the subject 14 may be more easily defeated.
It should be noted, prior to discussing the comparison between a blushing and non blushing area of skin, that the typical base line, skin reflectance spectrum 34 (of FIG. 3) may exhibit some hemoglobin caused attenuation. The reason for the attenuation is that even when the subject 14 is nominally unstressed, his/her skin contains some oxygenated hemoglobin. Thus, three local minimums occur on the base line, skin reflectance spectrum 34: minimums 35, 37, and 40. These minimums correspond to the peaks 49, 50, and 53 which appear on the hemoglobin absorption spectrum 46 of FIG. 4. Whereas, if the subject 14 had little or no oxygenated hemoglobin in his/her skin (i.e. the subject is cold or dead) his/her base line, skin reflectance spectrum 3 would resemble a line sloping up to the left.
Nonetheless, once a base line, skin reflectance spectrum 34 (e.g. see FIG. 3) has been identified by the signal processor 28, comparisons between the base line, skin, reflectance spectrum 34 and other areas of the target's skin may be performed. Though only one other area need be examined. These other areas should be selected for their vulnerability to full participation in a blush.
For instance, in adults, the ears tend to blush relatively easily with the face and neck also susceptible to blushing. Additionally, because of the crenulated or ribbed structure of the ear, machine vision systems may require less processing to identify the ear than other blushing areas might require. Furthermore, the ears will likely contain about the same amount of melatonin as the face and hands. Accordingly, the image processor 28 may select the ears of the subject 14 for further scrutiny.
As previously noted a blush consists of an increase in dermal hydration and sub-dermal hemoglobin flow indicating that the subject 14 is experiencing physiological stress. The oxygenated hemoglobin tends to absorb incident radiation as shown by the oxygenated hemoglobin absorption spectrum 46 shown in FIG. 4. In particular, a low wavelength maximum 49 in the absorption spectrum causes a relatively large attenuation in a corresponding range of the skin reflectance during a blush. Local maxima 50 and 53 also cause similar attenuation s in the ranges corresponding to the local maxima 50 and 53.
Thus, the typical blushing reflectance spectrum will include a low wavelength, low intensity range (corresponding to maximum 49) and a pair of mid wavelength, low reflectance ranges (corresponding to maxima 50 and 53). These attenuated areas of the blushing skin reflectance spectrum are caused by the increased hemoglobin absorbing radiation according to FIG. 4. Thus, it is the increased attenuation, over that of non blushing skin, exhibited at the attenuated regions (corresponding to maxima 49, 50, and 53) upon which the processor 28 bases the determination that a blush is present.
To aid in detecting the increased attenuation caused by a blush, a data base (not shown) may be accessed by the processor 28. From the data base the processor may extract normal, non blushing, and blushing skin reflectance data from one or more subjects similar in skin type to that of the subject 14. From the data, the processor may more precisely determine the range of wavelengths at which blush caused attenuation would occur and further characterize the amount of increased attenuation likely to be observed during a full blush. Accordingly, the system 10 may make a highly accurate determination of the presence of even a partial blush.
It should also be noted too that the palms have a more reddish tint than other areas of the body. Thus, per the present invention, if the image 22 contains an image of the palm, the palm spectrum can be used to verify that a blush has been positively identified. If the increased attenuation of the identified blushing spectrum resembles, or exceeds, the increased attenuation of the palm spectrum a high likelihood exists that the blush determination was successful. Note that the data base discussed above may also include data for the skin reflectance data for numerous, varied skin types thereby further enabling the system 10 to make a highly accurate blush determination.
In addition, or in the alternative, the effect dermal hydration has on the reflected skin spectrum may be used to determine if a subject 14 is blushing. In particular, FIG. 5 shows a graph of the extinction coefficient of water. Since perspiration largely consists of water, the properties of perspiration will largely resemble the properties of water.
Also, of note, FIG. 5 shows the extinction coefficient of water 60 as opposed to a graph of the absorption coefficient (as shown for hemoglobin in FIG. 4). However, because the extinction coefficient is the sum of the absorption coefficient and the scattering coefficient, similar reasoning applies to the attenuation caused by hemoglobin and the attenuation caused by thermal hydration. It will be understood also that the extinction coefficient is usually given in terms of the fraction of light lost over a given distance.
Thus, as indicated in FIG. 5, dermal hydration will cause attenuation in the skin reflectance spectrum in ranges of high absorption 62 and 64. The effects, including those of a high derivative range associated with areas 62 and 64, may be used by the image processor 28 to determine or confirm that a blush has been identified.
One notable difference between the light absorption by hemoglobin and dermal hydration is that hemoglobin absorbs strongly in ranges of the visible spectrum. In contrast, perspiration is largely transparent to visible radiation. Instead perspiration absorbs strongly in ranges of the near infrared spectrum.
Accordingly, the presence of perspiration on the selected area of the subject 14 will cause attenuation of the skin reflectance spectrum 34 (shown in FIG. 3) in a range 62 near 1400 nanometer and especially in a range 64 above about 1700 nanometers. Thus, image processor 28 may determine, or confirm, the presence of a blush and stress by examining the intensity of the reflected spectrum for a selected area near 1400 nanometers and above 1700 nanometers for attenuation in a manner similar to that set forth herein with reference to hemoglobin. If dermal hydration is found, then the image processor 28 may determine or confirm that a blush is occurring.
At least one advantage of the present invention arises because of the examination of visible radiation for hemoglobin attenuation and infrared radiation for dermal hydration. Some unsophisticated subjects 14 may be aware enough of the possibility of surveillance to attempt masking their skin with material (e.g. makeup) effective in the visible spectrum yet totally ineffective in the infrared spectrum or visa versa. Thus, the present invention which may examine wavelengths in both ranges provides a mechanism to penetrate attempted camouflage.
In a preferred embodiment of the present invention, a method 66 may be seen depicted in FIG. 6. The method 66 consists of identifying a human subject 14 for subsequent examination in step 68. An area indicative of a blush and an area indicative of the subject's inherent skin type may then be selected in parallel, or series, in steps 70 and 72 respectively. Statistical comparisons of the spectrum from the two areas of skin may then be made to determine by how much one may vary from the other due to factors other than a blush as in step 74. Of course these statistical comparisons should be made outside of the ranges of interest (e.g. ranges near 542, 560, 576, 1400, and above 1700 nanometers) where large changes are to be expected due to blushing. Such a statistical comparison may suppress false alarms due to variations between the two areas of skin on the same subject. For instance, if the area subject to blushing happens to be in shade, the lessened intensity might otherwise be construed as blushed induced attenuation.
In step 76, the spectrum from the two areas may then be compared. In particular comparisons may be made near at least one of 542, 560, 576, 1400, and above 1700 nanometers to determine if a blush is present. If desired, in step 80, the result may be confirmed by more detailed analysis (e.g. high derivative areas 55, 56, and 57 may be examined) or the palm reflectance spectrum may be used. Based on the comparisons, if the blush susceptible area shows attenuation in one or more of the selected ranges a blush may be declared in step 82. If no attenuation, not enough attenuation, or attenuation in too few of the selected wavelengths is observed then a target is declared to be non-stressed.
As will be appreciated by those skilled in the art, the present invention provides a reliable system with which to detect physiological stress in human beings. Moreover, because of the image processing software according to the present invention, subtle changes in skin reflectance spectra indicative of an emerging blush may be detected before the human eye would notice the change. Additionally, methods to defeat camouflage or masking of a subject's skin have been presented.
While various preferred embodiments have been described, those skilled in the art will recognize modifications or variations which might be made without departing from the inventive concept. The examples illustrate the invention and are not intended to limit it. Therefore, the description and claims should be interpreted liberally with only such limitation as is necessary in view of the pertinent prior art.
1. A system for detecting physiological stress in a subject, the system comprising: a processor adapted to receive an image of the subject from a camera, adapted to identify a first spectral characteristic of the subject when the subject is unstressed and adapted to identify a second spectral characteristic of the subject when stressed, and, the processor further adapted to compare an area of the image with the first and the second spectral characteristics and adapted to indicate whether the subject is experiencing physiological stress based on which of the spectral characteristics the image more closely coincides with.
2. The system according to claim 1, the second characteristic further comprising being coincident with one of a spectrum of sub-dermal blood flow and a spectrum of dermal hydration, whereby the second characteristic indicates a blush.
3. The system according to claim 1, wherein the first and the second spectral characteristics differ at a frequency selected from the group consisting of about 542 nanometers, about 560 nanometers, about 576 nanometers, about 1400 nanometers, and about 1700 nanometers, and whereby the difference indicates a blush.
4. The system according to claim 1, the processor coupled to the camera.
5. The system according to claim 1, wherein the processor is coupled to an alarm and activates the alarm if the area of the image more closely coincides with the second spectral characteristic.
6. The system according to claim 5, wherein the processor is coupled to a time source, a date source, and a location source to enable the processor to associate the time, date, and location with the image.
7. The system according to claim 5, the wherein the system is installed in one of an airport, an interrogation room, and a store.
8. The system according to claim 1, wherein the processor identifies the first spectral characteristic from the image to detect an unstressed condition of the subject in real time.
9. The system according to claim 8, wherein the processor is adapted to identify the first spectral characteristic from a back of the hand of the subject.
10. The system according to claim 1, wherein the processor identifies the second spectral characteristic from the image to detect a stressed condition of the subject in real time.
11. The system according to claim 10, wherein the processor identifies the second spectral characteristic from a palm of the hand of the subject.
12. A method for detecting physiological stress of a subject, the method comprising: observing an image of the subject with a system, the subject to include a first spectral characteristic when the subject is unstressed and a second spectral characteristic when the subject is stressed; comparing an area of the image to the first spectral characteristic with the system; comparing the area of the image to the second spectral characteristic with the system; and determining with the system which of the spectral characteristics the area of the image more closely coincides with to detect if the subject is experiencing stress.
13. The method according to claim 12, further comprising selecting the second spectral characteristic from the group consisting of a spectrum of sub-dermal blood flow and a spectrum of dermal hydration and wherein the second spectral characteristic indicates a blush.
14. The method according to claim 12, wherein the comparisons further comprise comparing the image with the first and the second spectral characteristics near a frequency selected from the group consisting of about 542 nanometers, about 560 nanometers, about 576 nanometers, about 1400 nanometers, and about 1700 nanometers to determine a difference indicative of a blush of the subject.
15. The method according to claim 12, further comprising coupling a camera to the system whereby the camera inputs the image to the system.
16. The method according to claim 12, further comprising activating an alarm if the area of the image more closely coincides with the second spectral characteristic than the first spectral characteristic.
17. The method according to claim 16, further comprising associating a time, a date, and a location with the image.
18. The method according to claim 16, further comprising installing the system in one of an airport, an interrogation room, and a store.
19. The method according to claim 12, the method further comprising identifying the first spectral characteristic from the image in real time.
20. The method according to claim 19, the method further comprising identifying the first spectral characteristic from a back of a hand of the subject.
21. The method according to claim 12, further comprising identifying the second spectral characteristic from the image in real time.
22. The method according to claim 21, further comprising identifying the second spectral characteristic from a palm of a hand of the subject.
23. A system for detecting physiological stress in a subject, comprising: a processor adapted to receive an image of a subject and adapted to identify a first and a second area of skin of the subject, the first area to be unlikely to blush, the second area to be likely to blush, and the processor further adapted to compare the first and the second areas of skin and adapted to indicate whether the subject is experiencing physiological stress based on an attenuation at a pre selected frequency of a spectrum between the first and the second areas of skin.
24. The system according to claim 23, wherein the attenuation is representative of a change in one of a spectrum of sub-dermal blood flow and a spectrum of dermal hydration and wherein the attenuation indicates a blush.
25. The system according to claim 23, wherein the attenuation occurs near a frequency selected from the group consisting of about 542 nanometers, about 560 nanometers, about 576 nanometers, about 1400 nanometers, and about 1700 nanometers, whereby the difference indicates a blush.
26. The system according to claim 23, wherein the processor activates an alarm if the comparison indicates a blush.
27. The system according to claim 26, wherein the processor associates a time, a date, and a location of the subject with the image.
28. The system according to claim 26, wherein the system is installed in one of an airport, an interrogation room, and a store.
|
Justin Olam
Justin Olam (born 23 December 1993) is a Papua New Guinean professional rugby league footballer who plays for Wests Tigers in the NRL and Papua New Guinea at international level.
In 2020 Olam won an NRL premiership with the Melbourne Storm and in the following year he was awarded the Dally M centre of the year. He is the second Papua New Guinean local rugby league player to play in the NRL without having played junior rugby league in Australia, emulating his countryman, and former Melbourne Storm 1999 NRL premiership winner, Marcus Bai.
Early life
Justin Olam was born and raised in Gon, a small village in the Sinesine Yonggomugl District of the mountainous Chimbu Province, Papua New Guinea.
He was not able to play much rugby league due to both of his parents wanting him to prioritise his education.
Olam was educated at Rosary (Kondiu) Secondary School in Chimbu and attended the Papua New Guinea University of Technology in Lae Morobe Province where he graduated with a Bachelor's Degree in Applied Physics. Whilst studying for his degree, Olam began playing rugby league for the Unitech Spartans in the PNG Universities competition.
In 2015, during his final year at the Papua New Guinea University of Technology, he went on to play for the Lae Snax Tigers in the Papua New Guinea National Rugby League.
2016
After impressive performance in the Digicel Cup for the Lae Snax Tigers in the Papua New Guinea National Rugby League, he was signed by the PNG Hunters for the 2016 Queensland Cup season. He played for them for one year in the Queensland Cup. He went on to make his international debut for Papua New Guinea Kumuls at the 2016 Pacific Test against Fiji Bati. With a successful 2016 campaign, Olam signed a contract with the Melbourne Storm for the 2017 and 2018 season in the NRL.
2017
In 2017, he played in every game for the Melbourne Storm feeder club Sunshine Coast Falcons in the Intrust Super Cup competition through to the grand final loss against his former team PNG Hunters who came from behind to score in the dying minutes and won 12–10 at Suncorp Stadium. He was still patient for an opportunity to make the Melbourne Storm first grade team. He also continued to represent Papua New Guinea Kumuls in the 2017 Pacific Test and 2017 Rugby League World Cup.
2018
In round 9 of the 2018 NRL season Olam made his NRL debut in the centres for the Melbourne Storm against the St George Illawarra Dragons at Jubilee Oval where he set up a try for his winger Josh Addo-Carr. He had his Melbourne jersey (cap number 187) presented to him by fellow Melbourne Storm player Billy Slater.
He then played two further games at the end of the season in round 24 against Gold Coast Titans and round 25 against Penrith Panthers in the NRL season. He continued international representation for his beloved Papua New Guinea Kumuls in the Pacific Test against Fiji Bati in Sydney and two end of year test against the England Knights in Lae and Port Moresby. His contract was extended for another two years after impressive string of performance in the reserve grade which will keep him at the Melbourne Storm till the end of the 2020 NRL season.
2019
In round 24 of the 2019 NRL season Olam scored his first ever NRL hat-trick in his 13th game against Manly-Warringah Sea Eagles at Lottoland Brookvale Oval. He finished off strongly in the 2019 season with him playing in 14 games and scored 7 tries at the back end of the season, and touted by many as one of the most Improved NRL player of the modern era. His continuous rising in the top grade kept the likes of Will Chambers, Sandor Earl, Curtis Scott, Solomone Kata and Marion Seve on the bench or cooling their heels off in reserve grade. On 2 October, Olam was named in the Papua New Guinea Kumuls team for the inaugural 2019 Rugby League World Cup 9s. During the two days Downer Rugby League World Cup 9s tournament at the Bankwest Stadium in Sydney, he played in all of their three pool matches against the USA Hawks, the New Zealand Kiwis and the Australia Kangaroos, where Olam scored one try against the New Zealand Kiwis. On 23 October, he was again named in the Papua New Guinea Kumuls squad for the 2019 Oceania Cup (rugby league) Pool B Ox & Palm Pacific Invitational Test against Fiji Bati at Christchurch Stadium in New Zealand on 9 November 2019, and Great Britain Lions on 16 November 2019 at the National Football Stadium in Port Moresby Papua New Guinea. In the game against the Great Britain Lions he played at left centre and scored one try as the Kumuls defeated the GB Lions 28–10.
2020
On 14–15 February 2020, Olam played for Melbourne in the NRL Nines tournament in Perth. He also played in the pre-season NRL trial matches against New Zealand Warriors and North Queensland. He performed very strongly in both defence and attack in these games, which resulted in him cementing the left centre spot for the Storm. With his current scintillating form he was rewarded with a two-year contract on May 22 to keep him at Melbourne until the end of 2022.
Affectionately known as 'the human brick', by his teammates, Olam plays with seemingly no sense of self-preservation. He scored his first try of the 2020 season in round four against South Sydney. In round 16 he scored his second career hat-trick against Manly-Warringah.On October 16, in Melbourne's Preliminary Final game against the Canberra Raiders at Suncorp Stadium, Olam scored a try in the 23rd minute off a kick from teammate Ryan Papenhuyzen, miraculously leaping over both Papenhuyzen and Canberra player Hudson Young while avoiding the arm of Nick Cotric to catch the ball mid-air before grounding it. Melbourne went on to win the match 30-10 and qualified for the Grand Final. On the 25 October, Melbourne went on to win the Grand final, beating the Penrith Panthers 26–20 in which Olam scored a penalty try in the fourth minute of the match.
2021
Olam played a total of 25 games for Melbourne in the 2021 NRL season as the club won 19 matches in a row and claimed the Minor Premiership. Olam played in all three final matches including the preliminary final where Melbourne suffered a surprise 10–6 loss against eventual premiers Penrith Panthers. Afterwards, Melbourne star Cameron Munster took to Instagram to vent his frustration at teammate Olam being snubbed for consideration in the Dally M team of the year. "I'm not usually one for a rant, but pretty disappointed my PNG brother Justin Olam didn't even get nominated for Centre of the year!" Munster wrote on his Instagram story. "He's easily a top-three Centre. Don't come at me. The system needs a change, NRL". Olam was one of the biggest surprises when the nominees for every position were announced on the Monday night ahead of the second night of the prestigious event, which was held at Brisbane's Howard Smith Wharves. According to reports there was a last-minute backflip from the NRL to grant Olam an invite to the event where the NRL would announce the best Centre of the 2021 season, alongside the Player of the Year Award. The Courier-Mail first reported the league did a U-turn on extending an invite to Olam for Monday's ceremony after first claiming an “administrative oversight” was behind the failure to recognise Olam's performances in 2021.The Papua New Guinea star has had a breakout season leading to recognition from NRL immortal Andrew Johns that he was the “best Centre in the world” earlier this year. He was later invited and awarded the well deserved Dally M Centre of the year award.
2022
In the 2022 NRL season, Olam played 24 matches for Melbourne and scored ten tries. Olam played for Melbourne in their elimination final loss to Canberra. In late 2022, Olam represented Papua New Guinea at the 2021 Rugby League World Cup playing all four games before they were eliminated by England at the quarter-final stage.
2023
On 14 February, it was announced that Olam would miss the opening six rounds of the 2023 NRL season due to an arm injury he sustained during the clubs pre-season trial against the Sydney Roosters. Olam played 17 games for Melbourne in the 2023 NRL season as the club finished third on the table. Olam was called into the Melbourne side for their semi-final against the Sydney Roosters after not being selected for the qualifying final against Brisbane. In the preliminary final against Penrith, Olam scored a try in the first half but also lost the ball close to an open line when the scores were tied at 4-4. Melbourne would go on to lose the match 38-4.
2024
On 12 January, Olam signed a three-year deal with the Wests Tigers. As part of the deal, Wests Tigers player Shawn Blore headed to Melbourne on a three-year deal in a player swap. In round 3 of the 2024 NRL season, Olam made his club debut for the Wests Tigers and scored a try as they defeated Cronulla 32-6. In round 15, Olam scored two tries for the club as they defeated the Gold Coast 18-10. This also ended a nine-game losing streak in the process.
Statistics
* denotes season competing
source:
Highlights
* Junior Club: Unitech Spartans
* Won the PNG Unitech VC Cup in 2015 with the AP Photons (Applied Physics Students) as captain of the team
* Played for the PNG Prime Minister's XIII (2015,2016,2018)
* International Test Debut: v Fiji Bati, May 17, 2016
* First Grade Debut: Round 9, Melbourne Storm v St George Illawarra Dragons at Jubilee Oval, Sun 6 May 2018
* First NRL Try: Round 17, Melbourne Storm v Cronulla-Sutherland Sharks at AAMI Park, Sat 13 Jul 2019
* First NRL Hat-trick: Round 24, Melbourne Storm v Manly Warringah Sea Eagles at Brookvale Oval Aug 31 2019
* Played in the Papua New Guinea Kumuls team that beat the Great Britain Lions at Port Moresby National Football Stadium PNG, Sat 16 Nov 2019
* 2019: (Melbourne Storm) NRL Minor Premiership winner (J J Giltinan Shield)
* 2020: (Melbourne Storm) NRL Premiership winner (Provan-Summons Trophy)
* 2021: (Melbourne Storm) NRL Minor Premiership winner (J J Giltinan Shield)
Individual Accolades
* 2016: Queensland Cup XXXX People's Choice Award winner
* 2017: Queensland Cup Best of the year Award Winner
* 2020: NRL Melbourne Storm Most Improved Player of the year Award Winner
* 2021: NRL Dally M. Medal of the year Award Winner
|
Klaziki
Name: Klaziki
Gender: Female
Channel Description
Animation History
Klaziki has created several Maplestory series.
In chronological order, they are:
* No Matter What (Jan. 4, 2008 - Mar 27, 2008)
* Demonic Wings (Mar. 17, 2008 - Aug. 3, 2008)
* No Matter What II (Sept. 9, 2008 - Jan. 27, 2009)
* When the Snow Melts (Dec. 14, 2008) [NOW UNLISTED] When the Snow Melts playlist
* Scarlet Chains, aka Demonic Wings II (Oct. 26, 2008 - Oct. 10, 2009)
* Freezing (Nov. 10, 2008 - present)
* October Children (Oct. 6, 2010 - present)
Current Series
Klaziki is currently working on "Freezing" and "October Children".
Animation Information
[First series, made with WMM]
[Genre: Romance, Comedy, Adventure, Fantasy]
[First series]
[Themes: MapleStory]
Status : Finished
[Second series, made with Sony Vegas]
[Genre: Romance, Fantasy]
Status : Finished
[Fourth series, made with Sony Vegas.]
[Genre: Romance, Comedy, Adventure, Fantasy]
|
/*
* Copyright 2020 McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written consent of McGraw-Hill Education.
*/
#include <string>
#define API_VER 2
#include "common.h"
#include "console_printer.h"
#include "interface.h"
struct CLIArgs
{
uint32_t print_level = DEFAULT_PRINT_LEVEL;
bool enable_liberal_asm = false;
};
bool endsWith(std::string const & search, std::string const & suffix)
{
if(suffix.size() > search.size()) { return false; }
return std::equal(suffix.rbegin(), suffix.rend(), search.rbegin());
}
int main(int argc, char *argv[])
{
CLIArgs args;
std::vector<std::pair<std::string, std::string>> parsed_args = parseCLIArgs(argc, argv);
for(auto const & arg : parsed_args) {
if(std::get<0>(arg) == "print-level") {
args.print_level = std::stoi(std::get<1>(arg));
} else if(std::get<0>(arg) == "enable-liberal-asm") {
args.enable_liberal_asm = true;
} else if(std::get<0>(arg) == "h" || std::get<0>(arg) == "help") {
std::cout << "usage: " << argv[0] << " [OPTIONS] FILE [FILE...]\n";
std::cout << "\n";
std::cout << " -h,--help Print this message\n";
std::cout << " --print-level=N Output verbosity [0-9]\n";
std::cout << " --enable-liberal-asm Enable liberal assembly mode\n";
return 0;
}
}
lc3::ConsolePrinter printer;
lc3::as assembler(printer, args.print_level, args.enable_liberal_asm);
lc3::conv converter(printer, args.print_level);
for(int i = 1; i < argc; i += 1) {
std::string filename(argv[i]);
if(filename[0] != '-') {
if(endsWith(filename, ".bin")) {
converter.convertBin(filename);
} else {
assembler.assemble(filename);
}
}
}
return 0;
}
|
TABLE 6 Determination of the minimum infectious dose for H. felis in mice. Identification of H. felis infection in mice at 2 wk post-inoculation Inoculum dose* Urease activity^(§) Culture¶ (no. of bacteria) (no.) (no.) 10¹ 0/5 0/5 10² 4/5 3/5 10³ 5/5 4/5 10⁴ 5/5 3/5 10⁵ 4/5 4/5 *To determine cell density, various dilutions of a stock H. felis culture (which contained predominantly helical-shaped forms) were prepared. Viable H. felis bacteria were then enumerated under phase contrast microscopy (magnification factor, 400 x), using a Malassez chamber. Mice were inoculated oro gastrically with 0.1 ml of the appropriate inoculum containing virulent H. felis bacteria. ^(§)Urease activity was detected in murine gastric biopsies (see Materials and Methods). ¶H. felis bacteria were isolated from gastric tissue biopsies after incubation on blood agar plates under microaerobic conditions for 5-7 days, at 37° C.
Whilst an inoculum containing c. 10¹ bacteria was found to be insufficient to colonize mice, gastric infection in mice was achieved with inocula containing at least 10² bacteria (the minimum infectious dose). A challenge inoculum equivalent to 100 times the minimum infectious dose (i.e. 10⁴ bacteria) was subsequently chosen for all immunoprotection studies.
2. Protection Against H. felis Infection in Mice by Immunization with Recombinant HSPs from H. py lori.
To demonstrate the presence of HSP homologs in H. felis, whole-cell extracts of the organism were immunoblotted and then reacted with hyperimmune rabbit antisera raised against H. py lori MalE-HspA and MalE-HspB fusions. Cross-reactive antigens were detected in the H. felis extract: the denatured antigens had approximate molecular weights of 15 kDa and 58 kDa, respectively, which corresponded to those of the H. py lori HSPs (FIGS. 20A, B). Interestingly, it appeared that the HspA homologs of both H. py lori and H. felis exist in dimeric forms and these multimeric forms appeared to be resistant to the denaturing effects of SDS.
Recombinant H. py lori HSP antigens were assessed for their potential to induce protective mucosal responses in the H. felis mouse model. Mice were immunized once per wk (wks 0 to 3) with 50 μg antigen (or 1 mg H. felis whole-cell sonicate) and 5 μg cholera toxin. At wk 5, the mice were challenged with an inoculum containing c. 10⁴ H. felis bacteria. At wk 7, the mice were sacrificed. The results are reported in Table 7.
TABLE 7 Immunization of mice against H. felis infection using H. py lori antigens H. felis infectious status of mice Grade of gastritis^(g) Infected Not Not Antigens (no.) infected^(f) Infected infected^(f) MalE (M) 14/20 30% 2.57 ± 0.65 (14) 1.0 ± 0 (6) sonicate^(a) 1/17 94 3 (1) 1.31 ± 0.79 (16) M-HspA^(b) 4/20 80 3 (4) 1.19 ± 0.83 (16) M-HspB^(c) 3/10 70 3 (3) 1.0 ± 0.82 (7) M-UreB^(d) 3/21 86 2.3 (3) 1.17 ± 0.38 (18) M-HspA/UreB^(e) 0/19 100 (h) 1.53 ± 0.70 (19) Σ 2.68 ± 0.56 (25)^(h) 1.28 ± 0.71 (82)i ^(a)P = 0.0003; ^(b)P = 0.0042; ^(c)P = 0.0904; ^(d)P = 0.001; ^(e)P = 0.0001 compared with the MalE group of animals. ^(f)Mice were considered “not infected” when the biopsy urease test was negative, and no H. felis bacteria were detected in coded histological sections (see Materials and Methods). ^(g)Gastitis was scored from 0 to 3 (see Materials and Methods). Mean scores ± S.D. are presented. Numbers in paragraphs refer to the numbers of animals per group. ^(g)Gastitis was scored from 0 to 3 (see Materials and Methods). Mean scores ± S.D. are presented. Numbers in paragraphs refer to the numbers of animals per group. ^(h)No mice from this group were infected. ^(i)Comparison of score frequencies between immunized animals that became infected and those that were protected (P = 0.0001). ^(h)Comparison of individual scores between immunized animals that became infected and those that were protected (P = 0.0001).
Immunization with HspA- or HspB-MalE fusions protected 80% and 70%, respectively, of mice against H. felis infection (Table 7). In comparison, 30% of MalE-immunized control mice did not become infected when challenged with the H. felis inoculum (P=0.0042 and P=0.0904, respectively).
Co-administration of recombinant H. py lori UreB (SEQ ID NO:26) and HspA (SEQ ID NO:29) antigens to mice resulted in 100% protection, which compared with a protection rate of 86% in those animals that had received the UreB antigen alone (Table 7). The level of protection afforded by the co-administration of MalE-UreB and MalE-HspA was equivalent to that obtained in the group of H. felis sonicate-immunized animals (P=0.955; Table 7).
3. Serological Responses Following Immunization with Recombinant HSPs and Urease Polypeptides:
Measurement of H. py lori-specific IgG antibodies in the serum of immunized mice demonstrated that virtually all of the animals developed strong humoral responses to the administered H. py lori urease and heat-shock antigens. As would be predicted of a mucosal immune response, serum antibodies directed against these antigens appeared to be primarily of the IgG₁ idiotype (FIG. 19). This finding was indicative of a predominantly type 2 T-helper cell (Th-2) response. Consistent with this, serum levels of H. py lori-specific IgG_(2a) antibodies, which are normally associated with Th-1 type responses, were relatively low and varied depending upon the antigen administered: HspA appeared to induce particularly weak IgG_(2a) serum responses (FIG. 19). These differences were considered to be specific to the H. py lori antigenic components of the recombinant proteins, since approximately equivalent levels of IgG₁ and IgG_(2a) antibody idiotypes were detected when MalE-specific antibodies were measured (unpublished data). No qualitative nor quantitative differences could be found between IgG serum responses and the infectious status of the mice at sacrifice.
4. Cellular Responses Induced in Mice following Immunization:
Histological assessment of gastric mucosa tissue from the immunized mice revealed low levels of mononuclear cells (mean inflammation score: 1.28±0.71) for those mice which were protected from an H. felis infection (Table 7). In contrast, those immunized animals that became infected tended to have a significantly more severe form of lymphocytic gastritis in which lymphoid follicular structures were often observed (mean score: 2.68±0.56; P=0.0001). Large numbers of mononuclear cells were observed in the gastric tissue of H. felis-colonized mice from the MalE-immunized group.
In this study, we tested an antigenic preparation consisting of two recombinant proteins, H. py lori UreB (SEQ ID NO:26) and HspA (SEQ ID NO:29), and showed that, under identical experimental conditions, it was as effective as a whole-cell extract of H. felis in protecting against H. felis infection in mice. We observed in both this study, and in an independent one in which immunized mice were not challenged with H. felis (unpublished data), that the administration of H. py lori Hsp antigens did not appear to be associated with an unduly severe pathology.
The evidence to date suggests that a mild gastric inflammation may be a necessary prerequisite for a successful oro gastric immunization. Michetti et al., Gastroenterology 107, 1002-1011 (1994); Ferrero (1994). Activation of a Th-2 immune response is normally associated with the migration of both IgA-secreting B lymphocytes and T_(H) lymphocytes to effector tissue sites. Staats et al., Curr. Opin. Immunol. 6, 572-583 (1994). It is, therefore, perhaps not surprising that oro gastric immunization of mice results in a mild degree of lymphocytic gastritis. Administration of cholera toxin may contribute to this inflammation: in vitro experiments showed that cholera toxin alone increased the proliferation of murine B and T lymphocytes. Elson, Infect. Immun. 60, 2874-2879 (1992). It is also likely that the antigenic load provided by the H. felis bacterial challenge exacerbates the inflammation: immunized mice that became infected with H. felis displayed a higher degree of gastritis than those immunized animals that were protected against H. felis infection. However, as this difference was also observed amongst the MalE-immunized group of mice, it is unlikely that cross-reactivity between the recombinant H. py lori antigens and the H. felis bacteria accounted for the severe pathology seen in those immunized mice that were not protected. Eaton and Krakow ka also observed that immunized piglets, which were not protected against H. py lori infection, developed severe gastritis. Eaton et al., Gastroenterology 103, 1580-1586 (1992).
H. py lori HspA (SEQ ID NO:29) is particularly appealing as a vaccine component because, in contrast with HspB (SEQ ID NO:30), it possesses a unique domain at its C-terminus, which is absent from other known heat-shock homologs, including those of eucaryotic organisms. The C-terminus of H. py lori HspA (SEQ ID NO:29) consists of a series of 26 amino acids (out of a total of 118 amino acids), and undoubtedly confers a unique conformational structure to this polypeptide. The capacity of H. py lori HspA (SEQ ID NO:29) to bind to nickel ions should facilitate the large-scale purification of this polypeptide by metal affinity chromatography.
Evidence from the immunoprotection studies and immunoblot analyses suggest that H. felis produces a GroES homolog. Whether this protein also contains the C-terminal nickel-binding domain is currently a subject of investigation in our laboratory. It is noteworthy that these Helicobacter GroES homologs seem to exist as dimeric forms, a feature that has also been described for other known nickel-binding proteins, such as the Ur eE proteins from Proteus mirabilis, Sriwanthana et al., J. Bacteriol, 176, 6836-6841 (1994), and Klebsiella aerogenes, Lee et al., Protein Sci. 2, 1042-1052 (1993).
Thus, the immunization composition of this invention preferably contains H. py lori UreB (SEQ ID NO:26) and HspA (SEQ ID NO:29) as immunogens. The UreB (SEQ ID NO:26) and HspA (SEQ ID NO:29) can be isolated from H. py lori lysates or sonicates, but are preferably free of other H. py lori antigens, including multimeric urease. Thus, in one embodiment of the invention the UreB (SEQ ID NO:26) and HspA (SEQ ID NO:29) are substantially free of UreA (SEQ ID NO:22). It is particularly preferred that the UreB (SEQ ID NO:26) and the HspA (SEQ ID NO:29) be prepared by recombinant techniques. The resulting recombinant antigens are substantially free of multimeric urease and other H. py lori antigens.
The immunization composition of the invention can also include an adjuvant in an amount sufficient to enhance the magnitude or duration of the immune response in the host, or to enhance the qualitative response in the subject, such as by stimulating antibodies of different immunoglobulin classes than those stimulated by the immunogen. The adjuvant should efficiently elicit cell-mediated or humoral immune responses to antigens without systemic or localized irritation of the host system. Preferably, the adjuvant has low pyrogenicity.
Well known adjuvant formulations for human or veterinary applications can be employed. Such adjuvants can be based on emulsions, with or without mycobacteria, or adjuvants based on adsorption of antigens to aluminum salts, especially aluminum hydroxide or aluminum phosphate. Among these adjuvants are oil adjuvants based on mineral, animal, and vegetable oils. Oil based adjuvants are useful for increasing humoral responses of animals to vaccine antigens, and certain oil-based adjuvants have been tested for human use. Typical adjuvants are Freund's complete adjuvant and Freund's incomplete adjuvant.
Suitable adjuvants that have been developed more recently, include liposomes, immune-stimulating complexes (ISCOMs), and squalene or squalene emulsions. Surface active agents having adjuvant activity can also be employed. These include saponin-like Qui lA® (saponin extract from the bark of the Quillaja saponaria tree) molecules in ISCOMs and Pluronic® (non-ionic detergent) block copolymers that are used to make stable squalene emulsions. Saponins are surface-active agents widely distributed in plants.
Analogs of muramyl dipeptide (MDP) or muramyl tripeptide (MTP), such as threonine analog of MDP and lipopolysaccharide (LPS) having adjuvant activity and reduced side effects, are also suitable for use as adjuvants. Synthetic analogs of MDP and the monophosphoryl derivative of lipid A are also known for their adjuvant activity and reduced pyrogenicity. A particularly suitable formulation is Syntex Adjuvant Formulation-1 or SAF-1, which combines the threonyl analog of MDP in a vehicle comprised of Pluronic® L-121 tri block polymer with squalene and a small proportion of Tween 80 as an emulsifying detergent. The preferred adjuvants for use in humans are MDP and its analogs, with or without squalene, saponins, and the monophosphoryl derivative of lipid A. When an adjuvant is combined with the immunogen in the composition and method of the invention, a further enhancement in immune response is observed.
A preferred route of administering the composition of the invention to a host is mucosal. Oral administration is the particularly preferred mode of administration because of its simplicity and because it is relatively non-invasive. It will be understood that the immunization composition of the invention can also be employed in a vaccine.
The composition of the invention can be incorporated into any suitable delivery system. For example, the antigen and adjuvant can be combined with a pharmaceutically acceptable liquid vehicle, such as water, buffered saline, or edible animal or vegetable oil. The composition can be combined with one or more suitable pharmaceutically acceptable excipients or core materials, such as cellulose, cellulose derivatives, sucrose, gelatin, Starch 1500, Nu Tab, lactose, malto-dextrin, talc, Cabo sil, magnesium stearate, alginate, Actisol, PEG 400, Myvacet, Triacetine, syrup, oil, sorbitol, mannitol, and Plasdone. This list is not intended to be exhaustive or limiting; alternative or additional excipients or core materials can also be used.
It will also be understood that the compositions of the invention can be formulated to include chemical agents that are capable of neutralizing stomach pH. Suitable neutralizing agents include H₂ antagonists, proton pump inhibitors, bicarbonate of soda, calcium carbonate, and aluminum hydroxide.
The composition of the invention can be utilized in the form of elixirs, solutions, suspensions, syrups, aerosols, and the like. The composition can also be prepared in dosage units suitable for oral or parenteral administration, such as particles, granules, beads, tablets, hard gelatin capsules, and soft gelatin capsules.
The immunogen and adjuvant are employed in a combined amount to provide an immune response against an infectious agent. This can be determined by estimating seroconversion, that is, the levels of antibody before and after immunization. If the host has a preexisting antibody titer to the antigen, the success of immunization can be determined by the extent of increase in the level of specific antibody. In cases where there is no correlation between seroconversion and protection, cell-mediated immune response can be monitored.
The amount of antigen and adjuvant per dosage unit will depend on the desired dose and the frequency of administration. In one embodiment, each dosage unit contains an amount of antigen effective to protect the animal against disease following exposure to the pathogen. The dose can be defined as the amount of immunogen necessary to raise an immune response against H. py lori infection in an individual. As an example, the immunization schedule in animals (mice) consists of 4 steps. Each oral dose unit (one per week) comprises 250 to 900 micrograms of UreB and 250 to 900 micrograms of HspA and 25 to 90 micrograms of adjuvant. A suitable ratio of UreB:HspA:adjuvant is 1:1:0.1, but it will be understood that other ratios of ingredients can be employed. The average weight of a mouse is 20 g and one can calculate for one kilogram of other animal or a human patient to be immunized the equivalent dose unit. The precise composition will necessarily vary depending on the antigen and adjuvant selected, the species to be immunized, and other factors, and it is within the capacity of one with ordinary skill in the art to search for an optimal formulation.
The immunogenic composition can be administered before or after infection. A booster dose can comprise the antigen in an amount sufficient to enhance the initial immune response. It has to be adapted to each protocol depending on the antigen and the host. Multiple doses may be more appropriate for children and for individuals with no known prior exposure.
The immunogenic composition containing UreB and HspA can be administered to an infected or non-infected animal. Thus, it will be understood that this invention can be employed for the prophylactic, therapeutic, or curative treatment of any animal in need thereof, such as dogs, cats, poultry, pigs, horses, and cattle, and especially mammals, such as primates, including humans, using UreB and HspA or the species equivalent thereof.
Finally, a preferred embodiment of the previously described antibodies of the invention comprises monoclonal antibodies, polyclonal antibodies, or fragments of such antibodies that immunologically recognize UreB, HspA, or mixtures of UreB and HspA. Antibodies and antibody fragments that are specific for these polypeptides and their immunologically recognizable fragments can be prepared by the techniques described above.
Inasmuch as the present invention is subject to many variations, modifications, and changes in details, it is intended that all subject matter discussed above or shown in the accompanying drawings be interpreted as illustrative and not in a limiting sense. Such modifications and variations are included within the scope of this invention as defined by the following claims.
REFERENCES
Boyer, H. W., and Roulland-Dussoix, D (1969) A complementation analysis of the restriction and modification of DNA in Escherichia coli. J Mol Biol 41: 459-472.
Chen, M., Lee, A., and Hazell, S. L. (1992) Immunization against gastric helicobacter infection in a mouse/Helicobacter felis model. Lancet 339: 1120-1121.
Corthesy-Theulaz, I. et al (1993), Acta Gastro-Enter ol. Belgica Suppl., vol. 56, p 64 (VIth Workshop on Gastroduodenal pathology and H. py lori).
Cover, T. L., Puryear, W.; Perez-Perez, G.J., and Blaser, M. (1991) Effect of urease on HeLa cell vacuolation induced by Helicobacter py lori cytotoxin. Infect Immun 59: 1264-1270.
Cussac, V., Ferrero, R. L., and Labigne, A. (1992) Expression of Helicobacter py lori urease genes in Escherichia coli grown under nitrogen-limiting conditions. J Bacteriol 174: 2466-2473.
Davin, C. et al., Abstract A-304, Gastroenterology 1993 (Abstract supplement).
Dick-Hegedus, E., and Lee, A. (1991) The use of a mouse model to examine anti-licobacter py lori agents. Scand J Gastroenterol 26: 909-915.
Dick E., Lee A., Watson G., and O'Rourke J. (1989) Use of the mouse for the isolation and investigation of stomach-associated, spiral-helical shaped bacteria from man and other animals. J Med Microbiol 29: 55-62.
Dunn, B. E., R. M., Roop II, C.-C. Sung, S. A. Sharma, G. I. Perez-Perez, and M. J. Blaser, 1992. Identification and purification of a cpn60 heat shock protein homolog from Helicobacter py lo)Xri. Infect Immun. 60: 1946-1951.
Eaton, K. A., Brooks, C. L., Morgan, D. R., and Krakow ka, S. (1991) Essential role of urease in pathogenesis of gastritis induced by Helicobacter py lori in gnotobiotic piglets. Infect Immun 59: 2470-2475.
Evans, D. J., Evans, D. G., Engstrand, L. and Graham, D. Y. (1992) Hat shock protein of Helicobacter py lori. Infect Immun 60: 2125-2127.
Ferrero, R. L., and Lee, A. (1991) The importance of urease in acid protection for the gastric-colonising bacteria Helicobacter py lori and Helicobacter felis sp. nov. Microb Ecol Hlth Dis 4:121-134.
Ferrero, R. L., Cussac, V., Courcoux, P. and Labigne, A. (1992) Construction of isogenic urease-negative mutants of Helicobacter py lori by allelic exchange. J Bacteriol 174:4212-4217.
Ferrero, R. L. and Labigne, A. (1993) Molec. Microbiol. 9, 323-333.
Freed burg, A. S., and Barron, L. E. (1940) The presence of spirochetes in human gastric mucosa. American Journal of Digestive Diseases 7:443-445.
Goodwin, C. S., Zrmstrong, J. A., Chilvers, T., Peters, M., Collins, M. D., Sly, L., McConnell, W., and Harper, W. E. S.(1989) Transfer of Campy lobacter py lori comb. nov. and Helicobacter mustelae comb. nov., respectively. Int J Syst Bacteriol 39: 397-405.
Hazell, S. L., and Lee, A. (1986) Campy lobacter py lori dis, urease, hydrogen ion back diffusion, and gastric ulcers. Lancet ii: 15-17.
Hazell, S. L., Boro dy, T. J., Gal, A., and Lee, A. (1987) Campy lobacter py lori dis gastritis I: Detection of urease as a marker of bacterial colonization and gastritis. Am J Gastroenterol 82: 292-296.
Hu, L-T, Foxall, P. A., Russell, R., and Mobley, H. L. T. (1992) Purification of recombinant Helicobacter py lori urease apo enzyme encoded by ureA and ureB. InfectImmun. 60:2657-2666.
Jones, B. D., and Mobley, H. L. T. (1989) Proteus mirabilis urease: nucleotide sequence determination and comparison with jack bean urease. J Bacteriol 171:6414-6422.
Krakow ka, S., Morgan D. R., Kraft W. G., and Leu nk R. D. (1987) Establishment of gastric Campy lobacter py lori infection in the neonatal gnotobiotic piglet. Infect Immun 55:2789-2796.
Labigne-Roussel, A., Courcoux, P., and Tompkins, L. (1988) Gene disruption and replacement as a feasible approach for mutagenesis of Campy lobacter jejuni. J Bacteriol 170:1704-1708.
Labigne, A., Ces sac, V., and Courcoux, P. (1991) Shuttle cloning and nucleotide sequences of Helicobacter py lori genes responsible for urease activity. J Bacteriol 173:1920-1931.
Labigne, A., Courcoux, P., and Tompkins, L. (1992) Cloning of Campy lobacter jejuni genes required for leucine biosynthesiz, and construction of leu-negative mutant of C. jejuni by shuttle transposon mutagenesis. Res Microb 143: 15-26.
Laemmli, E. K. (1970) Cleavage of structural proteins during the assembly of the head of bacteriophage T4. Nature 227: 680-685.
Lee, A., Hazell, S. L., O'Rourke, J., and Kouprach, S. (1988) Isolation of a spiral-shaped bacterium from the cat stomach. Infect Immun 56: 2843-2850.
Lee, A., Fox, J. G., Otto, G., and Murphy, J. (1990) A small animal model of human Helicobacter py lori active chronic gastritis. Gastroenterol 99: 1315-1323.
Lee, M. H., Mulrooney, S. B., Renner, M. J., Marckowicz, Y., and Hausinger, R. P. (1992) Klebsiella aerogenes urease gene cluster: Sequence of ure D and demonstration that four accessory genes (ure D, ure E, ure F, and ure G) are involved in nikel metallocenter biosynthesis. J Bacteriol 174: 4324-4330.
Luger, A., and Neuberger, H. (1921) Uber spirochatenbefunde im magensaft und der diagnostische Bedeutung für das carcinoma ventriculi. Zeit Klin Med 92: 54.
Mai, U. E. H., Perez-Perez, G. I., Allen, J. B., Wahl, S. M., Blaser, M. J., and Smith, P. D. (1992) surface proteins from Helicobacter py lori exhibit chemotactic activity for human leukocytes and are present in gastric mucosa. J Exp Med 175: 517-525.
Maniatis, T., Fritsch, E., and Sambrook, J. (1983) Molecular cloning: a laboratory manual. Cold spring Harbor Laboratory, Cold spring Harbor N.Y.
Marshall, B. J., Royce, H., Annear, D. I., Goodwin, C. D., Pearman, J. W., Warren, J. R., and Armstrong, J. A. (1984) Original isolation of Campy lobacter py lori dis from human gastric mucosa. Micro bios Lett 25: 83-88.
Marshall, B. J., Barrett, L. J., Prakash, C., McCall em, R. W., and Guerrant, R. L. (1990) Urea protects Helicobacter (Campy lobacter) py lori from the bactericidal effect of acid. Gastroenterol 99: 697-702.
Meissing, J., and Vieira, J. (1982) A new pair of M13 vectors for selecting either DNA strand of double-digest restriction fragments. Gene 19: 269-276.
Mobley, H. L. T., and Hausinger, R. P. (1989) Microbial ureases: significance, regulation, and molecular characterisation. Microbiol Rev 53: 85-108.
Newell, D. G., Lee, A., Hawtin, P. R., Hudson, M. J., Stacey, A. R., and Fox, J. (1989) Antigenic conservation of the ureases of spiral- and helical-shaped bacteria colonising the stomachs of man and animals. FEMS Microbiol Lett 65:183-186.
Nomura, A., Stermmermann, G. N., Gh you, P-H., Kato, I., Perez-Perez, G. I., and Blaser, M. J. (1991) Helicobacter py lori infection and gastric carcinoma among Japanese Americans in Hawaii. N Eng J Med 325: 1132-1136.
Par sonnet, J., Friedman, G. D., Vanderstee, D. P., Chang, Y., Vogel man, J. H., Orentreich, N., and R. Sibley (1991) Helicobacter py lori infection and the risk of gastric carcinoma. N Eng J Med 325: 1127-1131.
Paster, B. J., Lee, A., Dewhirst, F. E., Fox, J. G., Tordoff, L. A., Fraser, G. J., O'Rourke, J. L., Taylor, N. S., and Ferrero, R. (1990) The phylogeny of Helicobacter felis sp. nov., Helicobacter mustalae, and related bacteria. Int J Syst Bacteriol 41: 31-38.
Peterson, W. L. (1991) Helicobacter py lori and peptic ulcer disease. N Engl J Med 324: 1043-1047.
Radin, J. M., Eaton, K. A., Krakow ka, S., Morgan, D. R., Lee, A., Otto, G., and Fox, J. G. (1990) Helicobacter py lori infection in gnotobiotic dogs. Infect Immun 58: 2606-2612.
Salomon, H. (1896) Ueber das Spirillem des Saugetiermagens und sein Verhalten zu den Belegzellen. Zentral Bakteriol Parasite n Infektion 19: 433-442.
Sanger, F., Nicklen, S., and Coulson, A. R. (1977) DNA sequencing with chain terminating inhibitors. Proc Natl Acad Sci USA 74: 5463-5467.
Shine, J., and Dalgarno, L. (1974) The 3'-terminal sequence of Escherichia coli 16S ribosomal RNA: complementarity to nonsense triplets and ribosome binding sites. Proc Natl Acad Sci USA 71: 1342-1346.
Sidebotham, R. L., and Baron, J. H. (1990) Hypothesis: Helicobacter py lori, urease, mucus, and gastric ulcer. Lancet 335: 193-195.
Smoot, D. T., Mobley, H. L. T., Chippendale, G. R., Lewinson, J. F., and Res au, J. H. (1990) Helicobacter py lori urease activity is toxic to human gastric epithelial cells. Infect Immun 58: 1992-1994.
Sol nick, J. V., et al., Infec. and Immunity, May 1994, p 1631-1638.
Towbin, H., Staehelin, T., and Gordon, J. (1979) Electrophoretic transfer of proteins from polyacrylamide gels to nitrocellulose sheets: procedure and some applications. Proc Natl Acad Sci 76: 4350-4354.
Turbett, G. R., Nandapalan, N., Campbell, I. G., Nikoletti, S. M., and Mee, B. J. (1991) Characterization of the urease from Helicobacter py lori and Comparison with the ureases from related spiral gastric bacteria. FEMS Microbiol Immunol 76: 19-24.
Turbett, G. R., Hoj, P., Horne, R., and Mee, B. J. (1992) Purification and characterization of the urease enzymes of Helicobacter species from humans and animals. Infect Immun 60: 5259-5266.
44 27 amino acids amino acid unknown linear protein unknown 1 Gly Ser Cys Cys His Thr Gly Asn His Asp His Lys His Ala Lys Glu 1 5 10 15 His Glu Ala Cys Cys His Asp His Lys Lys His 20 25 27 base pairs nucleic acid single linear DNA (genomic) unknown misc_feature one-of(6, 15, 24) /note= “N=(A or C or g or T/U) or (unknown or other).” misc_feature one-of(9, 12, 21) /note= “R=A or G.” misc_feature one-of(13, 18, 22) /note= “Y=C or T/U.” 2 CAUCCNAARG ARYTNGAYAA RYTNATG 27 30 base pairs nucleic acid single linear DNA (genomic) unknown misc_feature one-of(1, 4, 19) /note= “Y=C or T/U.” misc_feature one-of(7, 10, 13) /note= “N=(A or C or G or T/U) or (unknown or other).” misc_feature one-of(14) /note= “S= C or G.” misc_feature one-of(15) /note= “W=A or T/U.” 3 YTCYTTNCGN CGNSWDATYT TYTTCATCUA 30 38 base pairs nucleic acid single linear DNA (genomic) unknown misc_feature 6..11 /note= “Restriction site introduced in the amplified fragment (EcoRI).” 4 CCGGAGAATT CATTAGCAGA AAAGAATATG TTTCTATG 38 38 base pairs nucleic acid single linear DNA (genomic) unknown misc_feature 6..11 /note= “Restriction site introduced in the amplified fragment (PstI).” 5 ACGTTCTGCA GCTTACGAAT AACTTTTGTT GCTTGAGC 38 20 base pairs nucleic acid single linear DNA (genomic) unknown misc_feature 1..6 /note= “Restriction site introduced in the amplified fragment (BamHI).” 6 GGATCCAAAA AGATTTCACG 20 30 base pairs nucleic acid single linear DNA (genomic) unknown misc_feature 3..8 /note= “Restriction site introduced in the amplified fragment (HindIII).” misc_feature 9..14 /note= “Restriction site introduced in the amplified fragment (PstI).” 7 GGAAGCTTCT GCAGGTGTGC TTCCCCAGTC 30 22 base pairs nucleic acid single linear DNA (genomic) unknown misc_feature one-of(3, 21) /note= “N=the four nucleotides” misc_feature one-of(6, 9, 15) /note= “R= A and G.” misc_feature one-of(18) /note= “Y= T and C.” misc_feature one-of(12) /note= “H= T, C, and A.” 8 GCNAARGARA THAARTTYTC NG 22 8 amino acids amino acid single linear peptide unknown 9 Ala Lys Glu Ile Lys Phe Ser Asp 1 5 22 base pairs nucleic acid single linear DNA (genomic) unknown misc_feature one-of(7, 13) /note= “K= G and T.” 10 CRTTNCKNCC NCKNGGNCCC AT 22 8 amino acids amino acid single linear peptide unknown 11 Met Gly Pro Arg Gly Arg Asn Val 1 5 14 amino acids amino acid single linear peptide unknown 12 Met Gly Gly Met Gly Gly Met Gly Gly Met Gly Gly Met Met 1 5 10 16 base pairs nucleic acid single linear DNA (genomic) unknown 13 CTTGTTCGCA CCTTCC 16 13 base pairs nucleic acid single linear DNA (genomic) unknown 14 TAACTCGCTT GAA 13 38 base pairs nucleic acid single linear DNA (genomic) unknown misc_feature 6..11 /note= “Restriction site EcoRI.” 15 CCGGAGAATT CAAGTTTCAA CCATTAGGAG AAAGGGTC 38 38 base pairs nucleic acid single linear DNA (genomic) unknown misc_feature 6..11 /note= “Restriction site PstI.” 16 ACGTTCTGCA GTTTAGTGTT TTTTGTGATC ATGACAGC 38 38 base pairs nucleic acid single linear DNA (genomic) unknown misc_feature 6..11 /note= “Restriction site EcoRI.” 17 CCGGAGAATT CGCAAAAGAA ATCAAATTTT CAGATAGC 38 38 base pairs nucleic acid single linear DNA (genomic) unknown misc_feature 6..11 /note= “Restriction site PstI.” 18 ACGTTCTGCA GATGATACCA AAAAGCAAGG GGGCTTAC 38 2619 base pairs nucleic acid double linear DNA (genomic) unknown misc_feature 31..36 /standard_name= “Shine-Dalgarno sequence.” misc_feature 756..759 /standard_name= “Shine-Dalgarno sequence.” 19 TGATAGCTTG GCTACCAATA GAAATTCAAT AAGGAGTTTA GGATGAAACT AACGCCTAAA 60 GAACTAGACA AGTTAATGCT CCATTATGCG GGCAGATTGG CAGAAGAACG CTTGGCGCGT 120 GGTGTGAAAC TCAATTACAC CGAAGCGGTC GCGCTCATTA GCGGGCGTGT GATGGAAAAG 180 GCGCGTGATG GTAATAAAAG CGTGGCGGAT TTGATGCAAG AAGGCAGGAC TTGGCTTAAA 240 AAAGAAAATG TGATGGACGG CGTAGCAAGC ATGATTCATG AAGTGGGGAT TGAAGCTAAC 300 TTCCCCGATG GAACCAAGCT TGTAACTATC CACACTCCGG TAGAGGATAA TGGCAAATTA 360 GCCCCCGGCG AGGTCTTCTT AAAAAATGAG GACATTACTA TTAACGCCGG CAAAGAAGCC 420 ATTAGCTTGA AAGTGAAAAA TAAAGGCGAT CGTCCTGTGC AGGTGGGATC ACATTTCCAC 480 TTCTTCGAAG TGAATAAGCT CTTGGACTTC GATCGCGCAA AAAGCTTTTG CAAACGCCTA 540 GACATTGCAT CTGGAACAGC GGTGCGCTTT GAACCCGGGG AGGAAAAAAG TGTGGAACTC 600 ATTGACATCG GCGGGAATAA GCGCATCTAT GGCTTTAATT CTTTGGTGGA TCGCCAAGCC 660 GATGCCGATG GTAAAAAACT CGGCTTAAAA CGCGCTAAAG AAAAAGGTTT TGGGTCTGTA 720 AACTGCGGTT GTGAAGCGAC TAAAGATAAA CAATAAGGAA AAACCATGAA AAAGATTTCA 780 CGAAAAGAAT ATGTTTCTAT GTATGGTCCC ACTACCGGGG ATCGTGTTAG ACTCGGCGAC 840 ACTGATTTGA TCTTAGAAGT GGAGCATGAT TGCACCACTT ATGGTGAAGA GATCAAATTT 900 GGGGGCGGTA AAACTATCCG TGATGGGATG AGTCAAACCA ATAGCCCTAG CTCTTATGAA 960 TTAGATTTGG TGCTCACTAA CGCCCTCATT GTGGACTATA CGGGCATTTA CAAAGCCGAC 1020 ATTGGGATTA AAGACGGCAA GATTGCAGGC ATTGGCAAGG CAGGCAATAA GGACATGCAA 1080 GATGGCGTAG ATAATAATCT TTGCGTAGGT CCTGCTACAG AGGCTTTGGC AGCTGAGGGC 1140 TTGATTGTAA CCGCTGGTGG CATCGATACG CATATTCACT TTATCTCTCC CCAACAAATC 1200 CCTACTGCTT TTGCCAGCGG GGTTACAACC ATGATTGGAG GAGGCACAGG ACCTGCGGAT 1260 GGCACGAATG CGACCACCAT CACTCCCGGA CGCGCTAATC TAAAAAGTAT GTTGCGTGCA 1320 GCCGAAGAAT ACGCCATGAA TCTAGGCTTT TTGGCTAAGG GGAATGTGTC TTACGAACCC 1380 TCTTTACGCG ATCAGATTGA AGCAGGGGCG ATTGGTTTTA AAATCCACGA AGACTGGGGA 1440 AGCACACCTG CAGCTATTCA CCACTGCCTC AATGTCGCCG ATGAATACGA TGTGCAAGTG 1500 GCTATCCACA CCGATACCCT TAACGAGGCG GGCTGTGTAG AAGACACCCT AGAGGCGATT 1560 GCCGGGCGCA CCATCCATAC CTTCCACACT GAAGGGGCTG GGGGTGGACA CGCTCCAGAT 1620 GTTATCAAAA TGGCAGGGGA ATTTAACATT CTACCCGCCT CTACTAACCC GACCATTCCT 1680 TTCACCAAAA ACACTGAAGC CGAGCACATG GACATGTTAA TGGTGTGCCA CCACTTGGAT 1740 AAAAGTATCA AGGAAGATGT GCAGTTTGCC GATTCGAGGA TTCGCCCCCA AACTATCGCG 1800 GCTGAAGACC AACTCCATGA CATGGGGATC TTTTCTATCA CCAGCTCCGA CTCTCAGGCT 1860 ATGGGACGCG TAGGCGAGGT GATCACACGC ACTTGGCAGA CAGCAGACAA AAACAAAAAA 1920 GAGTTTGGGC GCTTGAAAGA GGAAAAAGGC GATAACGACA ACTTCCGCAT CAAACGCTAC 1980 ATCTCTAAAT ACACCATCAA CCCCGGGATC GCGCATGGGA TTTCTGACTA TGTGGGCTCT 2040 GTGGAAGTGG GCAAATACGC CGACCTCGTG CTTTGGAGTC CGGCTTTCTT TGGCATTAAG 2100 CCCAATATGA TTATTAAGGG CGGATTTATT GCGCTCTCTC AAATGGGCGA TGCCAATGCG 2160 TCTATTCCCA CCCCTCAGCC CGTCTATTAC CGTGAAATGT TTGGACACCA TGGGAAAAAC 2220 AAATTCGACA CCAATATCAC TTTCGTGTCC CAAGCGGCTT ACAAGGCAGG GATCAAAGAA 2280 GAACTAGGGC TAGATCGCGC GGCACCGCCA GTGAAAAACT GTCGCAATAT CACTAAAAAG 2340 GACCTCAAAT TCAACGATGT GACCGCACAT ATTGATGTCA ACCCTGAAAC CTATAAGGTG 2400 AAAGTGGATG GCAAAGAGGT AACCTCTAAA GCAGCAGATG AATTGAGCCT AGCGCAACTT 2460 TATAATTTGT TCTAGGAGGC TAAGGAGGGG GATAGAGGGG GTTAATTTAG AGGGGAGTCA 2520 TTGATTTACC TTTGCTAGTT TATAATGGAT TTAAGAGAGG TTTTTTTTCG TGTTTTATAC 2580 CGCGTTGAAA CCCTCAAATC TTTACCAAAA GGATGGTAA 2619 237 amino acids amino acid single linear peptide unknown Protein 1..237 /note= “URE A - FIGURE 3.” 20 Met Lys Leu Thr Pro Lys Glu Leu Asp Lys Leu Met Leu His Tyr Ala 1 5 10 15 Gly Arg Leu Ala Glu Glu Arg Leu Ala Arg Gly Val Lys Leu Asn Tyr 20 25 30 Thr Glu Ala Val Ala Leu Ile Ser Gly Arg Val Met Glu Lys Ala Arg 35 40 45 Asp Gly Asn Lys Ser Val Ala Asp Leu Met Gln Glu Gly Arg Thr Trp 50 55 60 Leu Lys Lys Glu Asn Val Met Asp Gly Val Ala Ser Met Ile His Glu 65 70 75 80 Val Gly Ile Glu Ala Asn Phe Pro Asp Gly Thr Lys Leu Val Thr Ile 85 90 95 His Thr Pro Val Glu Asp Asn Gly Lys Leu Ala Pro Gly Glu Val Phe 100 105 110 Leu Lys Asn Glu Asp Ile Thr Ile Asn Ala Gly Lys Glu Ala Ile Ser 115 120 125 Leu Lys Val Lys Asn Lys Gly Asp Arg Pro Val Gln Val Gly Ser His 130 135 140 Phe His Phe Phe Glu Val Asn Lys Leu Leu Asp Phe Asp Arg Ala Lys 145 150 155 160 Ser Phe Cys Lys Arg Leu Asp Ile Ala Ser Gly Thr Ala Val Arg Phe 165 170 175 Glu Pro Gly Glu Glu Lys Ser Val Glu Leu Ile Asp Ile Gly Gly Asn 180 185 190 Lys Arg Ile Tyr Gly Phe Asn Ser Leu Val Asp Arg Gln Ala Asp Ala 195 200 205 Asp Gly Lys Lys Leu Gly Leu Lys Arg Ala Lys Glu Lys Gly Phe Gly 210 215 220 Ser Val Asn Cys Gly Cys Glu Ala Thr Lys Asp Lys Gln 225 230 235 569 amino acids amino acid single linear peptide unknown Protein 1..569 /note= “URE B - FIGURE 3.” 21 Met Lys Lys Ile Ser Arg Lys Glu Tyr Val Ser Met Tyr Gly Pro Thr 1 5 10 15 Thr Gly Asp Arg Val Arg Leu Gly Asp Thr Asp Leu Ile Leu Glu Val 20 25 30 Glu His Asp Cys Thr Thr Tyr Gly Glu Glu Ile Lys Phe Gly Gly Gly 35 40 45 Lys Thr Ile Arg Asp Gly Met Ser Gln Thr Asn Ser Pro Ser Ser Tyr 50 55 60 Glu Leu Asp Leu Val Leu Thr Asn Ala Leu Ile Val Asp Tyr Thr Gly 65 70 75 80 Ile Tyr Lys Ala Asp Ile Gly Ile Lys Asp Gly Lys Ile Ala Gly Ile 85 90 95 Gly Lys Ala Gly Asn Lys Asp Met Gln Asp Gly Val Asp Asn Asn Leu 100 105 110 Cys Val Gly Pro Ala Thr Glu Ala Leu Ala Ala Glu Gly Leu Ile Val 115 120 125 Thr Ala Gly Gly Ile Asp Thr His Ile His Phe Ile Ser Pro Gln Gln 130 135 140 Ile Pro Thr Ala Phe Ala Ser Gly Val Thr Thr Met Ile Gly Gly Gly 145 150 155 160 Thr Gly Pro Ala Asp Gly Thr Asn Ala Thr Thr Ile Thr Pro Gly Arg 165 170 175 Ala Asn Leu Lys Ser Met Leu Arg Ala Ala Glu Glu Tyr Ala Met Asn 180 185 190 Leu Gly Phe Leu Ala Lys Gly Asn Val Ser Tyr Glu Pro Ser Leu Arg 195 200 205 Asp Gln Ile Glu Ala Gly Ala Ile Gly Phe Lys Ile His Glu Asp Trp 210 215 220 Gly Ser Thr Pro Ala Ala Ile His His Cys Leu Asn Val Ala Asp Glu 225 230 235 240 Tyr Asp Val Gln Val Ala Ile His Thr Asp Thr Leu Asn Glu Ala Gly 245 250 255 Cys Val Glu Asp Thr Leu Glu Ala Ile Ala Gly Arg Thr Ile His Thr 260 265 270 Phe His Thr Glu Gly Ala Gly Gly Gly His Ala Pro Asp Val Ile Lys 275 280 285 Met Ala Gly Glu Phe Asn Ile Leu Pro Ala Ser Thr Asn Pro Thr Ile 290 295 300 Pro Phe Thr Lys Asn Thr Glu Ala Glu His Met Asp Met Leu Met Val 305 310 315 320 Cys His His Leu Asp Lys Ser Ile Lys Glu Asp Val Gln Phe Ala Asp 325 330 335 Ser Arg Ile Arg Pro Gln Thr Ile Ala Ala Glu Asp Gln Leu His Asp 340 345 350 Met Gly Ile Phe Ser Ile Thr Ser Ser Asp Ser Gln Ala Met Gly Arg 355 360 365 Val Gly Glu Val Ile Thr Arg Thr Trp Gln Thr Ala Asp Lys Asn Lys 370 375 380 Lys Glu Phe Gly Arg Leu Lys Glu Glu Lys Gly Asp Asn Asp Asn Phe 385 390 395 400 Arg Ile Lys Arg Tyr Ile Ser Lys Tyr Thr Ile Asn Pro Gly Ile Ala 405 410 415 His Gly Ile Ser Asp Tyr Val Gly Ser Val Glu Val Gly Lys Tyr Ala 420 425 430 Asp Leu Val Leu Trp Ser Pro Ala Phe Phe Gly Ile Lys Pro Asn Met 435 440 445 Ile Ile Lys Gly Gly Phe Ile Ala Leu Ser Gln Met Gly Asp Ala Asn 450 455 460 Ala Ser Ile Pro Thr Pro Gln Pro Val Tyr Tyr Arg Glu Met Phe Gly 465 470 475 480 His His Gly Lys Asn Lys Phe Asp Thr Asn Ile Thr Phe Val Ser Gln 485 490 495 Ala Ala Tyr Lys Ala Gly Ile Lys Glu Glu Leu Gly Leu Asp Arg Ala 500 505 510 Ala Pro Pro Val Lys Asn Cys Arg Asn Ile Thr Lys Lys Asp Leu Lys 515 520 525 Phe Asn Asp Val Thr Ala His Ile Asp Val Asn Pro Glu Thr Tyr Lys 530 535 540 Val Lys Val Asp Gly Lys Glu Val Thr Ser Lys Ala Ala Asp Glu Leu 545 550 555 560 Ser Leu Ala Gln Leu Tyr Asn Leu Phe 565 237 amino acids amino acid single linear protein unknown 22 Met Lys Leu Thr Pro Lys Glu Leu Asp Lys Leu Met His Tyr Ala Gly 1 5 10 15 Glu Leu Ala Lys Lys Arg Lys Glu Lys Gly Ile Lys Leu Asn Tyr Val 20 25 30 Glu Ala Val Ala Leu Ile Ser Ala His Ile Met Glu Glu Ala Arg Ala 35 40 45 Gly Lys Lys Thr Ala Ala Glu Leu Met Gln Glu Gly Arg Thr Leu Leu 50 55 60 Lys Pro Asp Asp Val Met Asp Gly Val Ala Ser Met Ile His Glu Val 65 70 75 80 Gly Ile Glu Ala Met Phe Pro Asp Gly Thr Lys Leu Val Thr Val His 85 90 95 Thr Pro Ile Glu Ala Asn Gly Lys Leu Val Pro Gly Glu Leu Phe Leu 100 105 110 Lys Asn Glu Asp Ile Thr Ile Asn Glu Gly Lys Lys Ala Val Ser Val 115 120 125 Lys Val Lys Asn Val Gly Asp Arg Pro Val Gln Ile Gly Ser His Phe 130 135 140 His Phe Phe Glu Val Asn Arg Cys Leu Asp Phe Asp Arg Glu Lys Thr 145 150 155 160 Phe Gly Lys Arg Leu Asp Ile Ala Ser Gly Thr Ala Val Arg Phe Glu 165 170 175 Pro Gly Glu Glu Lys Ser Val Glu Leu Ile Asp Ile Gly Gly Asn Arg 180 185 190 Arg Ile Phe Gly Phe Asn Ala Leu Val Asp Arg Gln Ala Asp Asn Glu 195 200 205 Ser Lys Lys Ile Ala Leu His Arg Ala Lys Glu Arg Gly Phe His Gly 210 215 220 Ala Lys Ser Asp Asp Asn Tyr Val Lys Thr Ile Lys Glu 225 230 235 100 amino acids amino acid single linear protein unknown 23 Met Glu Leu Thr Pro Arg Glu Lys Asp Lys Leu Leu Leu Phe Thr Ala 1 5 10 15 Gly Leu Val Ala Glu Arg Arg Leu Ala Lys Gly Leu Lys Leu Asn Tyr 20 25 30 Pro Glu Arg Val Ala Leu Ile Ser Cys Ala Ile Met Glu Gly Ala Arg 35 40 45 Glu Gly Lys Thr Val Ala Gln Leu Met Ser Glu Gly Arg Thr Val Leu 50 55 60 Thr Ala Glu Gln Val Met Glu Gly Val Pro Glu Met Ile Lys Asp Val 65 70 75 80 Gln Val Glu Cys Thr Phe Pro Asp Gly Thr Lys Leu Val Ser Ile His 85 90 95 Ser Pro Ile Val 100 109 amino acids amino acid single linear protein unknown 24 Met Ile Pro Gly Glu Ile Arg Val Asn Ala Ala Leu Gly Asp Ile Glu 1 5 10 15 Leu Asn Ala Gly Arg Glu Thr Lys Thr Ile Gln Val Ala Asn His Gly 20 25 30 Asp Arg Pro Val Gln Cys Gly Ser His Tyr His Phe Tyr Glu Val Asn 35 40 45 Glu Ala Leu Arg Phe Ala Arg Lys Glu Thr Leu Gly Phe Arg Leu Asn 50 55 60 Ile Pro Ala Gly Met Ala Val Arg Phe Glu Pro Gly Gln Ser Arg Thr 65 70 75 80 Val Asp Glu Leu Val Ala Phe Ala Gly Lys Arg Glu Ile Tyr Gly Phe 85 90 95 His Gly Lys Val Met Gly Lys Leu Glu Ser Glu Lys Lys 100 105 840 amino acids amino acid single linear protein unknown 25 Met Lys Leu Ser Pro Arg Glu Val Glu Lys Leu Gly Leu His Asn Ala 1 5 10 15 Gly Tyr Leu Ala Gln Lys Arg Leu Ala Arg Gly Val Arg Leu Asn Tyr 20 25 30 Thr Glu Ala Val Ala Leu Ile Ala Ser Gln Ile Met Glu Tyr Ala Arg 35 40 45 Asp Gly Glu Lys Thr Val Ala Gln Leu Met Cys Leu Gly Gln His Leu 50 55 60 Leu Gly Arg Arg Gln Val Leu Pro Ala Val Pro His Leu Leu Asn Ala 65 70 75 80 Val Gln Val Glu Ala Thr Glu Pro Asp Gly Thr Lys Leu Val Thr Val 85 90 95 His Asp Pro Ile Ser Arg Glu Asn Gly Glu Leu Gln Glu Ala Leu Phe 100 105 110 Gly Ser Leu Leu Pro Val Pro Ser Leu Asp Lys Phe Ala Glu Thr Lys 115 120 125 Glu Asp Asn Arg Ile Pro Gly Glu Ile Leu Cys Glu Asp Glu Cys Leu 130 135 140 Thr Leu Asn Ile Gly Arg Lys Ala Val Ile Leu Lys Val Thr Ser Lys 145 150 155 160 Gly Asp Arg Pro Ile Gln Val Gly Ser His Tyr His Phe Ile Glu Val 165 170 175 Asn Pro Tyr Leu Thr Phe Asp Arg Arg Lys Ala Tyr Gly Met Arg Leu 180 185 190 Asn Ile Ala Ala Gly Thr Ala Val Arg Phe Glu Pro Gly Asp Cys Lys 195 200 205 Ser Val Thr Leu Val Ser Ile Glu Gly Asn Lys Val Ile Arg Gly Gly 210 215 220 Asn Ala Ile Ala Asp Gly Pro Val Asn Glu Thr Asn Leu Glu Ala Ala 225 230 235 240 Met His Ala Val Arg Ser Arg Gly Phe Gly His Glu Glu Glu Lys Asp 245 250 255 Ala Pro Glu Gly Phe Thr Lys Glu Asp Pro Asn Cys Ser Phe Asn Thr 260 265 270 Phe Ile His Arg Lys Glu Tyr Ala Asn Lys Tyr Gly Pro Thr Thr Gly 275 280 285 Asp Lys Ile Arg Leu Gly Asp Thr Asn Leu Leu Ala Glu Ile Glu Lys 290 295 300 Asp Tyr Ala Leu Tyr Gly Asp Glu Cys Val Phe Gly Gly Gly Lys Val 305 310 315 320 Ile Arg Asp Gly Met Gly Gln Ser Cys Gly His Pro Pro Ala Ile Ser 325 330 335 Leu Asp Thr Val Ile Thr Asn Ala Val Ile Ile Asp Tyr Thr Gly Ile 340 345 350 Ile Lys Ala Asp Ile Gly Ile Lys Asp Gly Leu Ile Ala Ser Ile Gly 355 360 365 Lys Ala Gly Asn Pro Asp Ile Met Asn Gly Val Phe Ser Asn Met Ile 370 375 380 Ile Gly Ala Asn Thr Glu Val Ile Ala Gly Glu Gly Leu Ile Val Thr 385 390 395 400 Ala Gly Gly Ile Asp Cys His Ile His Tyr Ile Cys Pro Gln Leu Val 405 410 415 Tyr Glu Ala Ile Ser Ser Gly Ile Thr Thr Leu Val Gly Gly Gly Thr 420 425 430 Gly Pro Ala Ala Gly Thr Arg Ala Thr Thr Cys Thr Pro Ser Pro Thr 435 440 445 Gln Met Arg Leu Met Leu Gln Ser Thr Asp Asp Leu Pro Leu Asn Phe 450 455 460 Gly Phe Thr Gly Lys Gly Ser Ser Ser Lys Pro Asp Glu Leu His Glu 465 470 475 480 Ile Ile Lys Ala Gly Ala Met Gly Leu Lys Leu His Glu Asp Trp Gly 485 490 495 Ser Thr Pro Ala Ala Ile Asp Asn Cys Leu Thr Ile Ala Glu His His 500 505 510 Asp Ile Gln Ile Asn Ile His Thr Asp Thr Leu Asn Glu Ala Gly Phe 515 520 525 Val Glu His Ser Ile Ala Ala Phe Lys Gly Arg Thr Ile His Thr Tyr 530 535 540 His Ser Glu Gly Ala Gly Gly Gly His Ala Pro Asp Ile Ile Lys Val 545 550 555 560 Cys Gly Ile Lys Asn Val Leu Pro Ser Ser Thr Asn Pro Thr Arg Pro 565 570 575 Leu Thr Ser Asn Thr Ile Asp Glu His Leu Asp Met Leu Met Val Cys 580 585 590 His His Leu Asp Arg Glu Ile Pro Glu Asp Val Ala Phe Ala His Ser 595 600 605 Arg Ile Arg Lys Lys Thr Ile Ala Ala Glu Asp Val Leu His Asp Ile 610 615 620 Gly Ala Ile Ser Ile Ile Ser Ser Asp Ser Gln Ala Met Gly Arg Val 625 630 635 640 Gly Glu Val Ile Ser Arg Thr Trp Gln Thr Ala Asp Lys Asn Lys Ala 645 650 655 Gln Thr Gly Pro Leu Lys Cys Asp Ser Ser Asp Asn Asp Asn Phe Arg 660 665 670 Ile Lys Arg Tyr Ile Ala Lys Tyr Thr Ile Asn Pro Ala Ile Ala His 675 680 685 Gly Ile Ser Gln Tyr Val Gly Ser Val Glu Val Gly Lys Leu Ala Asp 690 695 700 Leu Val Leu Trp Lys Pro Ser Phe Phe Gly Thr Lys Pro Glu Met Val 705 710 715 720 Ile Lys Gly Gly Met Val Ala Trp Ala Asp Ile Gly Asp Pro Asn Ala 725 730 735 Ser Ile Pro Thr Pro Gln Pro Val Lys Met Arg Pro Met Tyr Gly Thr 740 745 750 Leu Gly Lys Ala Gly Gly Ala Leu Ser Ile Ala Phe Val Ser Lys Ala 755 760 765 Ala Leu Asp Gln Arg Val Asn Val Leu Tyr Gly Leu Asn Lys Arg Val 770 775 780 Glu Ala Val Ser Asn Val Arg Lys Leu Thr Lys Leu Asp Met Lys Leu 785 790 795 800 Asn Asp Ala Leu Pro Glu Ile Thr Val Asp Pro Glu Ser Tyr Thr Val 805 810 815 Lys Ala Asp Gly Lys Leu Leu Cys Val Ser Glu Ala Thr Thr Val Pro 820 825 830 Leu Ser Arg Asn Tyr Phe Leu Phe 835 840 569 amino acids amino acid single linear protein unknown 26 Met Lys Lys Ile Ser Arg Lys Glu Tyr Val Ser Met Tyr Gly Pro Thr 1 5 10 15 Thr Gly Asp Lys Val Arg Leu Gly Asp Thr Asp Leu Ile Ala Glu Val 20 25 30 Glu His Asp Tyr Thr Ile Tyr Gly Glu Glu Leu Lys Phe Gly Gly Gly 35 40 45 Lys Thr Leu Arg Glu Gly Met Ser Gln Ser Asn Asn Pro Ser Lys Glu 50 55 60 Glu Leu Asp Leu Ile Ile Thr Asn Ala Leu Ile Val Asp Tyr Thr Gly 65 70 75 80 Ile Tyr Lys Ala Asp Ile Gly Ile Lys Asp Gly Lys Ile Ala Gly Ile 85 90 95 Gly Lys Gly Gly Asn Lys Asp Met Gln Asp Gly Val Lys Asn Asn Leu 100 105 110 Ser Val Gly Pro Ala Thr Glu Ala Leu Ala Gly Glu Gly Leu Ile Val 115 120 125 Thr Ala Gly Gly Ile Asp Thr His Ile His Phe Ile Ser Pro Gln Gln 130 135 140 Ile Pro Thr Ala Phe Ala Ser Gly Val Thr Thr Met Ile Gly Gly Gly 145 150 155 160 Thr Gly Pro Ala Asp Gly Thr Asn Ala Thr Thr Ile Thr Pro Gly Arg 165 170 175 Arg Asn Leu Lys Trp Met Leu Arg Ala Ala Glu Glu Tyr Ser Met Asn 180 185 190 Leu Gly Phe Leu Ala Lys Gly Asn Ala Ser Asn Asp Ala Ser Ala Arg 195 200 205 Asp Gln Ile Glu Ala Gly Ala Ile Gly Phe Lys Ile His Glu Asp Trp 210 215 220 Gly Thr Thr Pro Ser Ala Ile Asn His Ala Leu Asp Val Ala Asp Lys 225 230 235 240 Tyr Asp Val Gln Val Ala Ile His Thr Asp Thr Leu Asn Glu Ala Gly 245 250 255 Cys Val Glu Asp Thr Met Ala Ala Ile Ala Gly Arg Thr Met His Thr 260 265 270 Phe His Thr Glu Gly Ala Gly Gly Gly His Ala Pro Asp Ile Ile Lys 275 280 285 Val Ala Gly Glu His Asn Ile Leu Pro Ala Ser Thr Asn Pro Thr Ile 290 295 300 Pro Phe Thr Val Asn Thr Glu Ala Glu His Met Asp Met Leu Met Val 305 310 315 320 Cys His His Leu Asp Lys Ser Ile Lys Glu Asp Val Gln Phe Ala Asp 325 330 335 Ser Arg Ile Arg Pro Gln Thr Ile Ala Ala Glu Asp Thr Leu His Asp 340 345 350 Met Gly Ile Phe Ser Ile Thr Ser Ser Asp Ser Gln Ala Met Gly Arg 355 360 365 Val Gly Glu Val Ile Thr Arg Thr Trp Gln Thr Ala Asp Lys Asn Lys 370 375 380 Lys Glu Phe Gly Arg Leu Lys Glu Glu Lys Gly Asp Asn Asp Asn Phe 385 390 395 400 Arg Ile Lys Arg Tyr Leu Ser Lys Tyr Thr Ile Asn Pro Ala Ile Ala 405 410 415 His Gly Ile Ser Glu Tyr Val Gly Ser Val Glu Val Gly Lys Val Ala 420 425 430 Asp Leu Val Leu Trp Ser Pro Ala Phe Phe Gly Val Lys Pro Asn Met 435 440 445 Ile Ile Lys Gly Gly Phe Ile Ala Leu Ser Gln Met Gly Asp Ala Asn 450 455 460 Ala Ser Ile Pro Thr Pro Gln Pro Val Tyr Tyr Arg Glu Met Phe Gly 465 470 475 480 His His Gly Lys Ala Lys Tyr Asp Arg Asn Ile Thr Phe Val Ser Gln 485 490 495 Ala Ala Tyr Asp Lys Gly Ile Lys Glu Glu Leu Gly Leu Glu Arg Gln 500 505 510 Val Leu Pro Val Lys Asn Cys Arg Asn Ile Thr Lys Lys Asp Met Gln 515 520 525 Phe Asn Asp Thr Thr Ala His Ile Glu Val Asn Pro Glu Thr Tyr His 530 535 540 Val Phe Val Asp Gly Lys Glu Val Thr Ser Lys Pro Ala Asn Lys Val 545 550 555 560 Ser Leu Ala Gln Leu Phe Ser Ile Phe 565 569 amino acids amino acid single linear protein unknown 27 Met Lys Thr Ile Ser Arg Gln Ala Tyr Ala Asp Met Phe Gly Pro Thr 1 5 10 15 Thr Gly Asp Arg Leu Arg Leu Ala Asp Thr Glu Leu Phe Leu Glu Ile 20 25 30 Glu Lys Asp Phe Thr Thr Tyr Gly Glu Glu Val Lys Phe Gly Gly Gly 35 40 45 Lys Val Ile Arg Asp Gly Met Gly Gln Ser Gln Val Val Ser Ala Glu 50 55 60 Cys Val Asp Val Leu Ile Thr Asn Ala Ile Ile Leu Asp Tyr Trp Gly 65 70 75 80 Ile Val Lys Ala Asp Ile Gly Ile Lys Asp Gly Arg Ile Val Gly Ile 85 90 95 Gly Lys Ala Gly Asn Pro Asp Val Gln Pro Asn Val Asp Ile Val Ile 100 105 110 Gly Pro Gly Thr Glu Val Val Ala Gly Glu Gly Lys Ile Val Thr Ala 115 120 125 Gly Gly Ile Asp Thr His Ile His Phe Ile Cys Pro Gln Gln Ala Gln 130 135 140 Glu Gly Leu Val Ser Gly Val Thr Thr Phe Ile Gly Gly Gly Thr Gly 145 150 155 160 Pro Val Ala Gly Thr Asn Ala Thr Thr Val Thr Pro Gly Ile Trp Asn 165 170 175 Met Tyr Arg Met Leu Glu Ala Val Asp Glu Leu Pro Ile Asn Val Gly 180 185 190 Leu Phe Gly Lys Gly Cys Val Ser Gln Pro Glu Ala Ile Arg Glu Gln 195 200 205 Ile Thr Ala Gly Ala Ile Gly Leu Lys Ile His Glu Asp Trp Gly Ala 210 215 220 Thr Pro Met Ala Ile His Asn Cys Leu Asn Val Ala Asp Glu Met Asp 225 230 235 240 Val Gln Val Ala Ile His Ser Asp Thr Leu Asn Glu Gly Gly Phe Tyr 245 250 255 Glu Glu Thr Val Lys Ala Ile Ala Gly Arg Val Ile His Thr Phe His 260 265 270 Thr Glu Gly Ala Gly Gly Gly His Ala Pro Asp Val Ile Lys Ser Val 275 280 285 Gly Glu Pro Asn Ile Leu Pro Ala Ser Thr Asn Pro Thr Met Pro Tyr 290 295 300 Thr Ile Asn Thr Val Asp Glu His Leu Asp Met Leu Met Val Cys His 305 310 315 320 His Leu Asp Pro Ser Ile Pro Glu Asp Val Ala Phe Ala Glu Ser Arg 325 330 335 Ile Arg Arg Glu Thr Ile Ala Ala Glu Asp Ile Leu His Asp Met Gly 340 345 350 Ala Ile Ser Val Met Ser Ser Asp Ser Gln Ala Met Gly Arg Val Gly 355 360 365 Glu Val Ile Leu Arg Thr Trp Gln Cys Ala His Lys Asn Lys Leu Gln 370 375 380 Arg Gly Thr Leu Ala Gly Asp Ser Ala Asp Asn Asp Asn Asn Arg Ile 385 390 395 400 Lys Arg Tyr Ile Ala Lys Tyr Thr Ile Asn Pro Ala Leu Ala His Gly 405 410 415 Ile Ala His Thr Val Gly Ser Ile Glu Lys Gly Lys Leu Ala Asp Ile 420 425 430 Val Leu Trp Asp Pro Ala Phe Phe Gly Val Lys Pro Ala Leu Ile Ile 435 440 445 Lys Gly Gly Met Val Arg Tyr Ala Pro Met Gly Asp Ile Asn Ala Ala 450 455 460 Ile Pro Thr Pro Gln Pro Val His Tyr Arg Pro Met Tyr Ala Cys Leu 465 470 475 480 Gly Lys Ala Lys Tyr Gln Thr Ser Met Ile Phe Met Ser Lys Ala Gly 485 490 495 Ile Glu Ala Gly Val Pro Glu Lys Leu Gly Leu Lys Ser Leu Ser Leu 500 505 510 Ile Gly Arg Val Glu Gly Cys Arg His Ile Thr Lys Ala Ser Met Ile 515 520 525 His Asn Asn Tyr Val Pro His Ile Glu Leu Asp Pro Gln Thr Tyr Ile 530 535 540 Val Lys Ala Asp Gly Val Pro Leu Val Cys Glu Pro Ala Thr Glu Leu 545 550 555 560 Pro Met Ala Gln Arg Tyr Phe Leu Phe 565 2284 base pairs nucleic acid double linear DNA (genomic) unknown 28 ACAAACATGA TCTCATATCA GGGACTTGTT CGCACCTTCC CTAAAAATGC GCTATAGTTG 60 TGTCGCTTAA GAATACTAAG CGCTAAATTT CTATTTTATT TATCAAAACT TAGGAGAACT 120 GAAATGAAGT TTCAACCATT AGGAGAAAGG GTCTTAGTAG AAAGACTTGA AGAAGAGAAC 180 AAAACCAGTT CAGGCATCAT CATCCCTGAT AACGCTAAAG AAAAGCCTTT AATGGGCGTA 240 GTCAAAGCGG TTAGCCATAA AATCAGTGAG GGTTGCAAAT GCGTTAAAGA AGGCGATGTG 300 ATCGCTTTTG GCAAATACAA AGGCGCAGAA ATCGTTTTAG ATGGCGTTGA ATACATGGTG 360 CTAGAACTAG AAGACATTCT AGGTATTGTG GGCTCAGGCT CTTGCTGTCA TACAGGTAAT 420 CATGATCATA AACATGCTAA AGAGCATGAA GCTTGCTGTC ATGATCACAA AAAACACTAA 480 AAAACATTAT TATTAAGGAT ACAAAATGGC AAAAGAAATC AAATTTTCAG ATAGCGCAAG 540 AAACCTTTTA TTTGAAGGCG TAAGACAACT CCATGACGCT GTCAAAGTAA CCATGGGGCC 600 AAGAGGCAGG AACGTGTTGA TCCAAAAAAG CTATGGCGCT CCAAGCATCA CCAAAGACGG 660 CGTGAGCGTG GCTAAAGAGA TTGAATTAAG TTGCCCCGTG GCTAACATGG GCGCTCAGCT 720 CGTTAAAGAA GATGCGAGCA AAACCGCTGA TGCCGCCGGC GATGGCACGA CCACAGCGAC 780 CGTGCTGGCT TATAGCATTT TTAAAGAGGG CTTGAGGAAT ATCACGGCTG GGGCTAACCC 840 TATTGAAGTG AAACGAGGCA TGGATAAAGC GCCTGAAGCG ATCATTAATG AGCTTAAAAA 900 AGCGAGCAAA AAAGTGGGCG GTAAAGAAGA AATCACCCAA GTAGCGACCA TTTCTGCAAA 960 CTCCGATCAC AATATCGGGA AACTCATCGC TGACGCTATG GAAAAAGTGG GTAAAGACGG 1020 CGTGATCACC GTTGAAGAAG CTAAGGGCAT TGAAGATGAA TTAGATGTCG TAGAAGGCAT 1080 GCAATTTGAT AGAGGCTACC TCTCCCCTTA CTTTGTAACC AACGCTGAGA AAATGACCGC 1140 TCAATTGGAT AACGCTTACA TCCTTTTAAC GGATAAAAAA ATCTCTAGCA TGAAAGACAT 1200 TCTCCCGCTA CTAGAAAAAA CCATGAAAGA GGGCAAACCG CTTTTAATCA TCGCTGAAGA 1260 CATTGAGGGC GAAGCTTTAA CGACTCTAGT GGTGAATAAA TTAAGAGGCG TGTTGAATAT 1320 CGCAGCGGTT AAAGCTCCAG GCTTTGGGGA CAGGAGAAAA GAAATGCTCA AAGACATCGC 1380 TGTTTTAACC GGCGGTCAAG TCATTAGCGA AGAATTGGGC TTGAGTCTAG AAAACGCTGA 1440 AGTGGAGTTT TTAGGCAAAG CGAAGATTGT GATTGACAAA GACAACACCA CGATCGTAGA 1500 TGGCAAAGGC CATAGCCATG ACGTCAAAGA CAGAGTCGCG CAAATCAAAA CCCAAATTGC 1560 AAGCACGACA AGCGATTACG ACAAAGAAAA ATTGCAAGAA AGATTGGCCA AACTCTCTGG 1620 CGGTGTGGCT GTGATTAAAG TGGGCGCTGC GAGTGAAGTG GAAATGAAAG AGAAAAAAGA 1680 CCGGGTGGAT GACGCGTTGA GCGCGACTAA AGCGGCGGTT GAAGAAGGCA TTGTGATTGG 1740 GGGCGGTGCG GCCCTCATTC GCGCGGCCCA AAAAGTGCAT TTGAATTTAC ACGATGATGA 1800 AAAAGTGGGC TATGAAATCA TCATGCGCGC CATTAAAGCC CCATTAGCTC AAATCGCTAT 1860 CAATGCCGGT TATGATGGCG GTGTGGTCGT GAATGAAGTA GAAAAACACG AAGGGCATTT 1920 TGGTTTTAAC GCTAGCAATG GCAAGTATGT GGACATGTTT AAAGAAGGCA TTATTGACCC 1980 CTTAAAAGTA GAAAGGATCG CTTTACAAAA TGCGGTTTCG GTTTCAAGCC TGCTTTTAAC 2040 CACAGAAGCC ACCGTGCATG AAATCAAAGA AGAAAAAGCG GCCCCAGCAA TGCCTGATAT 2100 GGGTGGCATG GGCGGAATGG GAGGCATGGG CGGCATGATG TAAGCCCCCT TGCTTTTTGG 2160 TATCATCTGC TTTTAAAATC CATCTTCTAG AATCCCCCCT TCTAAAATCC CTTTTTTGGG 2220 GGGTGCTTTT GGTTTGATAA AACCGCTCGC TTTTAAAAAC GCGCAACAAA AAACTCTGTT 2280 AAGC 2284 118 amino acids amino acid single linear protein unknown Protein 1..118 /product= “H. py lori - Hsp A.” 29 Met Lys Phe Gln Pro Leu Gly Glu Arg Val Leu Val Glu Arg Leu Glu 1 5 10 15 Glu Glu Asn Lys Thr Ser Ser Gly Ile Ile Ile Pro Asp Asn Ala Lys 20 25 30 Glu Lys Pro Leu Met Gly Val Val Lys Ala Val Ser His Lys Ile Ser 35 40 45 Glu Gly Cys Lys Cys Val Lys Glu Gly Asp Val Ile Ala Phe Gly Lys 50 55 60 Tyr Lys Gly Ala Glu Ile Val Leu Asp Gly Val Glu Tyr Met Val Leu 65 70 75 80 Glu Leu Glu Asp Ile Leu Gly Ile Val Gly Ser Gly Ser Cys Cys His 85 90 95 Thr Gly Asn His Asp His Lys His Ala Lys Glu His Glu Ala Cys Cys 100 105 110 His Asp His Lys Lys His 115 545 amino acids amino acid single linear protein unknown Protein 1..545 /product= “H. py lori - Hsp B.” 30 Met Ala Lys Glu Ile Lys Phe Ser Asp Ser Ala Arg Asn Leu Leu Phe 1 5 10 15 Glu Gly Val Arg Gln Leu His Asp Ala Val Lys Val Thr Met Gly Pro 20 25 30 Arg Gly Arg Asn Val Leu Ile Gln Lys Ser Tyr Gly Ala Pro Ser Ile 35 40 45 Thr Lys Asp Gly Val Ser Val Ala Lys Glu Ile Glu Leu Ser Cys Pro 50 55 60 Val Ala Asn Met Gly Ala Gln Leu Val Lys Glu Asp Ala Ser Lys Thr 65 70 75 80 Ala Asp Ala Ala Gly Asp Gly Thr Thr Thr Ala Thr Val Leu Ala Tyr 85 90 95 Ser Ile Phe Lys Glu Gly Leu Arg Asn Ile Thr Ala Gly Ala Asn Pro 100 105 110 Ile Glu Val Lys Arg Gly Met Asp Lys Ala Pro Glu Ala Ile Ile Asn 115 120 125 Glu Leu Lys Lys Ala Ser Lys Lys Val Gly Gly Lys Glu Glu Ile Thr 130 135 140 Gln Val Ala Thr Ile Ser Ala Asn Ser Asp His Asn Ile Gly Lys Leu 145 150 155 160 Ile Ala Asp Ala Met Glu Lys Val Gly Lys Asp Gly Val Ile Thr Val 165 170 175 Glu Glu Ala Lys Gly Ile Glu Asp Glu Leu Asp Val Val Glu Gly Met 180 185 190 Gln Phe Asp Arg Gly Tyr Leu Ser Pro Tyr Phe Val Thr Asn Ala Glu 195 200 205 Lys Met Thr Ala Gln Leu Asp Asn Ala Tyr Ile Leu Leu Thr Asp Lys 210 215 220 Lys Ile Ser Ser Met Lys Asp Ile Leu Pro Leu Leu Glu Lys Thr Met 225 230 235 240 Lys Glu Gly Lys Pro Leu Leu Ile Ile Ala Glu Asp Ile Glu Gly Glu 245 250 255 Ala Leu Thr Thr Leu Val Val Asn Lys Leu Arg Gly Val Leu Asn Ile 260 265 270 Ala Ala Val Lys Ala Pro Gly Phe Gly Asp Arg Arg Lys Glu Met Leu 275 280 285 Lys Asp Ile Ala Val Leu Thr Gly Gly Gln Val Ile Ser Glu Glu Leu 290 295 300 Gly Leu Ser Leu Glu Asn Ala Glu Val Glu Phe Leu Gly Lys Ala Lys 305 310 315 320 Ile Val Ile Asp Lys Asp Asn Thr Thr Ile Val Asp Gly Lys Gly His 325 330 335 Ser His Asp Val Lys Asp Arg Val Ala Gln Ile Lys Thr Gln Ile Ala 340 345 350 Ser Thr Thr Ser Asp Tyr Asp Lys Glu Lys Leu Gln Glu Arg Leu Ala 355 360 365 Lys Leu Ser Gly Gly Val Ala Val Ile Lys Val Gly Ala Ala Ser Glu 370 375 380 Val Glu Met Lys Glu Lys Lys Asp Arg Val Asp Asp Ala Leu Ser Ala 385 390 395 400 Thr Lys Ala Ala Val Glu Glu Gly Ile Val Ile Gly Gly Gly Ala Ala 405 410 415 Leu Ile Arg Ala Ala Gln Lys Val His Leu Asn Leu His Asp Asp Glu 420 425 430 Lys Val Gly Tyr Glu Ile Ile Met Arg Ala Ile Lys Ala Pro Leu Ala 435 440 445 Gln Ile Ala Ile Asn Ala Gly Tyr Asp Gly Gly Val Val Val Asn Glu 450 455 460 Val Glu Lys His Glu Gly His Phe Gly Phe Asn Ala Ser Asn Gly Lys 465 470 475 480 Tyr Val Asp Met Phe Lys Glu Gly Ile Ile Asp Pro Leu Lys Val Glu 485 490 495 Arg Ile Ala Leu Gln Asn Ala Val Ser Val Ser Ser Leu Leu Leu Thr 500 505 510 Thr Glu Ala Thr Val His Glu Ile Lys Glu Glu Lys Ala Ala Pro Ala 515 520 525 Met Pro Asp Met Gly Gly Met Gly Gly Met Gly Gly Met Gly Gly Met 530 535 540 Met 545 548 amino acids amino acid single linear protein unknown 31 Met Ala Lys Glu Leu Arg Phe Gly Asp Asp Ala Arg Leu Gln Met Leu 1 5 10 15 Ala Gly Val Asn Ala Leu Ala Asp Ala Val Gln Val Thr Met Gly Pro 20 25 30 Arg Gly Arg Asn Val Val Leu Glu Lys Ser Tyr Gly Ala Pro Thr Val 35 40 45 Thr Lys Asp Gly Val Ser Val Ala Lys Glu Ile Glu Phe Glu His Arg 50 55 60 Phe Met Asn Met Gly Ala Gln Met Val Lys Glu Val Ala Ser Lys Thr 65 70 75 80 Ser Asp Thr Ala Gly Asp Gly Thr Thr Thr Ala Thr Val Leu Ala Arg 85 90 95 Ser Ile Leu Val Glu Gly His Lys Ala Val Ala Ala Gly Met Asn Pro 100 105 110 Met Asp Leu Lys Arg Gly Ile Asp Lys Ala Val Leu Ala Val Thr Lys 115 120 125 Lys Leu Gln Ala Met Ser Lys Pro Cys Lys Asp Ser Lys Ala Ile Ala 130 135 140 Gln Val Gly Thr Ile Ser Ala Asn Ser Asp Glu Ala Ile Gly Ala Ile 145 150 155 160 Ile Ala Glu Ala Met Glu Lys Val Gly Lys Glu Gly Val Ile Thr Val 165 170 175 Glu Asp Gly Asn Gly Leu Glu Asn Glu Leu Tyr Val Val Glu Gly Met 180 185 190 Gln Phe Asp Arg Gly Tyr Ile Ser Pro Tyr Phe Ile Asn Asn Gln Gln 195 200 205 Asn Met Ser Cys Glu Leu Glu His Pro Phe Ile Leu Leu Val Asp Lys 210 215 220 Lys Val Ser Ser Ile Arg Glu Met Leu Ser Val Leu Glu Gly Val Ala 225 230 235 240 Lys Ser Gly Arg Pro Leu Leu Ile Ile Ala Glu Asp Ile Glu Gly Glu 245 250 255 Ala Leu Ala Thr Leu Val Val Asn Asn Met Arg Gly Ile Val Lys Val 260 265 270 Cys Ala Val Lys Ala Pro Gly Phe Gly Asp Arg Arg Lys Ala Met Leu 275 280 285 Gln Asp Ile Ala Ile Leu Thr Lys Gly Gln Val Ile Ser Glu Glu Ile 290 295 300 Gly Lys Ser Leu Glu Gly Ala Thr Leu Glu Asp Leu Gly Ser Ala Lys 305 310 315 320 Arg Ile Val Val Thr Lys Glu Asn Thr Thr Ile Ile Asp Gly Glu Gly 325 330 335 Lys Ala Thr Glu Ile Asn Ala Arg Ile Ala Gln Ile Arg Ala Gln Met 340 345 350 Glu Glu Thr Thr Ser Asp Tyr Asp Arg Glu Lys Leu Gln Glu Arg Val 355 360 365 Ala Lys Leu Ala Gly Gly Val Ala Val Ile Lys Val Gly Ala Ala Thr 370 375 380 Glu Val Glu Met Lys Glu Lys Lys Ala Arg Val Glu Asp Ala Leu His 385 390 395 400 Ala Thr Arg Ala Ala Val Glu Glu Gly Ile Val Ala Gly Gly Gly Val 405 410 415 Ala Leu Ile Arg Ala Gln Lys Ala Leu Asp Ser Leu Lys Gly Asp Asn 420 425 430 Asp Asp Gln Asn Met Gly Ile Asn Ile Leu Arg Arg Ala Ile Glu Ser 435 440 445 Pro Met Arg Gln Ile Val Thr Asn Ala Gly Tyr Glu Ala Ser Val Val 450 455 460 Val Asn Lys Val Ala Glu His Lys Asp Asn Tyr Gly Phe Asn Ala Ala 465 470 475 480 Thr Gly Glu Tyr Gly Asp Met Val Glu Met Gly Ile Leu Asp Pro Thr 485 490 495 Lys Val Thr Arg Met Ala Leu Gln Asn Ala Ala Ser Val Ala Ser Leu 500 505 510 Met Leu Thr Thr Glu Cys Met Val Ala Asp Leu Pro Lys Lys Glu Glu 515 520 525 Gly Val Gly Ala Gly Asp Met Gly Gly Met Gly Gly Met Gly Gly Met 530 535 540 Gly Gly Met Met 545 548 amino acids amino acid single linear protein unknown 32 Met Ala Ala Lys Asp Val Lys Phe Gly Asn Asp Ala Arg Val Lys Met 1 5 10 15 Leu Arg Gly Val Asn Val Leu Ala Asp Ala Val Lys Val Thr Leu Gly 20 25 30 Pro Lys Gly Arg Asn Val Val Leu Asp Lys Ser Phe Gly Ala Pro Thr 35 40 45 Ile Thr Lys Asp Gly Val Ser Val Ala Arg Glu Ile Glu Leu Glu Asp 50 55 60 Lys Phe Glu Asn Met Gly Ala Gln Met Val Lys Glu Val Ala Ser Lys 65 70 75 80 Ala Asn Asp Ala Ala Gly Asp Gly Thr Thr Thr Ala Thr Val Leu Ala 85 90 95 Gln Ala Ile Ile Thr Glu Gly Leu Lys Ala Val Ala Ala Gly Met Asn 100 105 110 Pro Met Asp Leu Lys Arg Gly Ile Asp Lys Ala Val Thr Ala Ala Val 115 120 125 Glu Glu Leu Lys Ala Leu Ser Val Pro Cys Ser Asp Ser Lys Ala Ile 130 135 140 Ala Gln Val Gly Thr Ile Ser Ala Asn Ser Asp Glu Thr Val Gly Lys 145 150 155 160 Leu Ile Ala Glu Ala Met Asp Lys Val Gly Lys Glu Gly Val Ile Thr 165 170 175 Val Glu Asp Gly Thr Gly Leu Gln Asp Glu Leu Asp Val Val Glu Gly 180 185 190 Met Gln Phe Asp Arg Gly Tyr Leu Ser Pro Tyr Phe Ile Asn Lys Pro 195 200 205 Glu Thr Gly Ala Val Glu Leu Glu Ser Pro Phe Ile Leu Leu Ala Asp 210 215 220 Lys Lys Ile Ser Asn Ile Arg Glu Met Leu Pro Val Leu Glu Ala Val 225 230 235 240 Ala Lys Ala Gly Lys Pro Leu Leu Ile Ile Ala Glu Asp Val Glu Gly 245 250 255 Glu Ala Leu Ala Thr Ala Val Val Asn Thr Ile Arg Gly Ile Val Lys 260 265 270 Val Ala Ala Val Lys Ala Pro Gly Phe Gly Asp Arg Arg Lys Ala Met 275 280 285 Leu Gln Asp Ile Ala Thr Leu Thr Gly Gly Thr Val Ile Ser Glu Glu 290 295 300 Ile Gly Met Glu Leu Glu Lys Ala Thr Leu Glu Asp Leu Gly Gln Ala 305 310 315 320 Lys Arg Val Val Ile Asn Lys Asp Thr Thr Thr Ile Ile Asp Gly Val 325 330 335 Gly Glu Glu Ala Ala Ile Gln Gly Arg Val Ala Gln Ile Arg Gln Gln 340 345 350 Ile Glu Glu Ala Thr Ser Asp Tyr Asp Arg Glu Lys Leu Gln Glu Arg 355 360 365 Val Ala Lys Leu Ala Gly Gly Val Ala Val Ile Lys Val Gly Ala Ala 370 375 380 Thr Glu Val Glu Met Lys Glu Lys Lys Ala Arg Val Glu Asp Ala Leu 385 390 395 400 His Ala Thr Arg Ala Ala Val Glu Glu Gly Val Val Ala Gly Gly Gly 405 410 415 Val Ala Leu Ile Arg Val Ala Ser Lys Leu Ala Asp Leu Arg Gly Gln 420 425 430 Asn Glu Asp Gln Asn Val Gly Ile Lys Val Ala Leu Arg Ala Met Glu 435 440 445 Ala Pro Leu Arg Gln Ile Val Leu Asn Cys Gly Glu Glu Pro Ser Val 450 455 460 Val Ala Asn Thr Val Lys Gly Gly Asp Gly Asn Tyr Gly Tyr Asn Ala 465 470 475 480 Ala Thr Glu Glu Tyr Gly Asn Met Ile Asp Met Gly Ile Leu Asp Pro 485 490 495 Thr Lys Val Thr Arg Ser Ala Leu Gln Tyr Ala Ala Ser Val Ala Gly 500 505 510 Leu Met Ile Thr Thr Glu Cys Met Val Thr Asp Leu Pro Lys Asn Asp 515 520 525 Ala Ala Asp Leu Gly Ala Ala Gly Gly Met Gly Gly Met Gly Gly Met 530 535 540 Gly Gly Met Met 545 544 amino acids amino acid single linear protein unknown 33 Met Ala Ala Lys Asn Ile Lys Tyr Asn Glu Asp Ala Arg Lys Lys Ile 1 5 10 15 His Lys Gly Val Lys Thr Leu Ala Glu Ala Val Lys Val Thr Leu Gly 20 25 30 Pro Lys Gly Arg His Val Val Ile Asp Lys Ser Phe Gly Ser Pro Gln 35 40 45 Val Thr Lys Asp Gly Val Thr Val Ala Lys Glu Ile Glu Leu Glu Asp 50 55 60 Lys His Glu Asn Met Gly Ala Gln Met Val Lys Glu Val Ala Ser Lys 65 70 75 80 Thr Ala Asp Lys Ala Gly Asp Gly Thr Thr Thr Ala Thr Val Leu Ala 85 90 95 Glu Ala Ile Tyr Ser Glu Gly Leu Arg Asn Val Thr Ala Gly Ala Asn 100 105 110 Pro Met Leu Asp Lys Arg Gly Ile Asp Lys Ala Val Lys Val Val Val 115 120 125 Asp Glu Ile Lys Lys Ile Ser Lys Pro Val Gln His His Lys Glu Ile 130 135 140 Ala Gln Val Ala Thr Ile Ser Ala Asn Asn Asp Ala Glu Ile Gly Asn 145 150 155 160 Leu Ile Ala Glu Ala Met Glu Lys Val Gly Lys Asn Gly Ser Ile Thr 165 170 175 Val Glu Glu Ala Lys Gly Phe Glu Thr Val Leu Asp Val Val Glu Gly 180 185 190 Met Asn Phe Asn Arg Gly Tyr Leu Ser Ser Tyr Phe Ser Thr Asn Pro 195 200 205 Glu Thr Gln Glu Cys Val Leu Glu Glu Ala Leu Val Leu Ile Tyr Asp 210 215 220 Lys Lys Ile Ser Gly Ile Lys Asp Phe Leu Pro Val Leu Gln Gln Val 225 230 235 240 Ala Glu Ser Gly Arg Pro Leu Leu Ile Ile Ala Glu Asp Ile Glu Gly 245 250 255 Glu Ala Leu Ala Thr Leu Val Val Asn Arg Leu Arg Ala Gly Phe Arg 260 265 270 Val Cys Ala Val Lys Ala Pro Gly Phe Gly Asp Arg Arg Lys Ala Met 275 280 285 Leu Glu Asp Ile Ala Ile Leu Thr Gly Gly Gln Leu Ile Ser Glu Glu 290 295 300 Leu Gly Met Lys Leu Glu Asn Thr Thr Leu Ala Met Leu Gly Lys Ala 305 310 315 320 Lys Lys Val Ile Val Ser Lys Glu Asp Thr Thr Ile Val Glu Gly Leu 325 330 335 Gly Ser Lys Glu Asp Ile Glu Ser Arg Cys Glu Ser Ile Lys Lys Gln 340 345 350 Ile Glu Asp Ser Thr Ser Asp Tyr Asp Lys Glu Lys Leu Gln Glu Arg 355 360 365 Leu Ala Lys Leu Ser Gly Gly Val Ala Val Ile Arg Val Gly Ala Ala 370 375 380 Thr Glu Ile Glu Met Lys Glu Lys Lys Asp Arg Val Asp Asp Ala Gln 385 390 395 400 His Ala Thr Leu Ala Ala Val Glu Glu Gly Ile Leu Pro Gly Gly Gly 405 410 415 Thr Ala Leu Val Arg Cys Ile Pro Thr Leu Glu Ala Phe Ile Pro Ile 420 425 430 Leu Thr Asn Glu Asp Glu Gln Ile Gly Ala Arg Ile Val Leu Lys Ala 435 440 445 Leu Ser Ala Pro Leu Lys Gln Ile Ala Ala Asn Ala Gly Lys Glu Gly 450 455 460 Ala Ile Ile Cys Gln Gln Val Leu Ser Arg Ser Ser Ser Glu Gly Tyr 465 470 475 480 Asp Ala Leu Arg Asp Ala Tyr Thr Asp Met Ile Glu Ala Gly Ile Leu 485 490 495 Asp Pro Thr Lys Val Thr Arg Cys Ala Leu Glu Ser Ala Ala Ser Val 500 505 510 Ala Gly Leu Leu Leu Thr Thr Glu Ala Leu Ile Ala Asp Ile Pro Glu 515 520 525 Glu Lys Ser Ser Ser Ala Pro Ala Met Pro Gly Ala Gly Met Asp Tyr 530 535 540 541 amino acids amino acid single linear protein unknown 34 Met Ala Lys Thr Ile Ala Tyr Asp Glu Glu Ala Arg Arg Gly Leu Glu 1 5 10 15 Arg Gly Leu Asn Ser Leu Ala Asp Ala Val Lys Val Thr Leu Gly Pro 20 25 30 Lys Gly Arg Asn Val Val Leu Glu Lys Lys Trp Gly Ala Pro Thr Ile 35 40 45 Thr Asn Asp Gly Val Ser Ile Ala Lys Glu Ile Glu Leu Glu Asp Pro 50 55 60 Tyr Glu Lys Ile Gly Ala Glu Leu Val Lys Glu Val Ala Lys Lys Thr 65 70 75 80 Asp Asp Val Ala Gly Asp Gly Thr Thr Thr Ala Thr Val Leu Ala Gln 85 90 95 Ala Leu Val Lys Glu Gly Leu Arg Asn Val Ala Ala Gly Ala Asn Pro 100 105 110 Leu Gly Leu Lys Arg Gly Ile Glu Lys Ala Val Asp Lys Val Thr Glu 115 120 125 Thr Leu Leu Lys Asp Ala Lys Glu Val Glu Thr Lys Glu Gln Ile Ala 130 135 140 Ala Thr Ala Ala Ile Ser Ala Gly Asp Gln Ser Ile Gly Asp Leu Ile 145 150 155 160 Ala Glu Ala Met Asp Lys Val Gly Asn Glu Gly Val Ile Thr Val Glu 165 170 175 Glu Ser Asn Thr Phe Gly Leu Gln Leu Glu Leu Thr Glu Gly Met Arg 180 185 190 Phe Asp Lys Gly Tyr Ile Ser Gly Tyr Phe Val Thr Asp Ala Glu Arg 195 200 205 Gln Glu Ala Val Leu Glu Glu Pro Tyr Ile Leu Leu Val Ser Ser Lys 210 215 220 Val Ser Thr Val Lys Asp Leu Leu Pro Leu Leu Glu Lys Val Ile Gln 225 230 235 240 Ala Gly Lys Ser Leu Leu Ile Ile Ala Glu Asp Val Glu Gly Glu Ala 245 250 255 Leu Ser Thr Leu Val Val Asn Lys Ile Arg Gly Thr Phe Lys Ser Val 260 265 270 Ala Val Lys Ala Pro Gly Phe Gly Asp Arg Arg Lys Ala Met Leu Gln 275 280 285 Asp Met Ala Ile Leu Thr Gly Ala Gln Val Ile Ser Glu Glu Val Gly 290 295 300 Leu Thr Leu Glu Asn Thr Asp Leu Ser Leu Leu Gly Lys Ala Arg Lys 305 310 315 320 Val Val Met Thr Lys Asp Glu Thr Thr Ile Val Glu Gly Ala Gly Asp 325 330 335 Thr Asp Ala Ile Ala Gly Arg Val Ala Gln Ile Arg Thr Glu Ile Glu 340 345 350 Asn Ser Asp Ser Asp Tyr Asp Arg Glu Lys Leu Gln Glu Arg Leu Ala 355 360 365 Lys Leu Ala Gly Gly Val Ala Val Ile Lys Ala Gly Ala Ala Thr Glu 370 375 380 Val Glu Leu Lys Glu Arg Lys His Arg Ile Glu Asp Ala Val Arg Asn 385 390 395 400 Ala Lys Ala Ala Val Glu Glu Gly Ile Val Ala Gly Gly Gly Val Thr 405 410 415 Leu Leu Gln Ala Ala Pro Ala Leu Asp Lys Leu Lys Leu Thr Gly Asp 420 425 430 Glu Ala Thr Gly Ala Asn Ile Val Lys Val Ala Leu Glu Ala Pro Leu 435 440 445 Lys Gln Ile Ala Phe Asn Ser Gly Met Glu Pro Gly Val Val Ala Glu 450 455 460 Lys Val Arg Asn Leu Ser Val Gly His Gly Leu Asn Ala Ala Thr Gly 465 470 475 480 Glu Tyr Glu Asp Leu Leu Lys Ala Gly Val Ala Asp Pro Val Lys Val 485 490 495 Thr Arg Ser Ala Leu Gln Asn Ala Ala Ser Ile Ala Gly Leu Phe Leu 500 505 510 Thr Thr Glu Ala Val Val Ala Asp Lys Pro Glu Lys Thr Ala Ala Pro 515 520 525 Ala Ser Asp Pro Thr Gly Gly Met Gly Gly Met Asp Phe 530 535 540 547 amino acids amino acid single linear protein unknown 35 Tyr Met Ala Asp Val Lys Phe Gly Ala Asp Ala Arg Ala Leu Met Leu 1 5 10 15 Gln Gly Val Asp Leu Leu Ala Asp Ala Val Ala Val Thr Met Gly Pro 20 25 30 Lys Gly Arg Thr Val Ile Ile Glu Gln Ser Trp Gly Ser Pro Lys Val 35 40 45 Thr Lys Asp Gly Val Thr Val Ala Lys Ser Ile Asp Leu Lys Asp Lys 50 55 60 Tyr Lys Asn Ile Gly Ala Lys Leu Val Gln Asp Val Ala Asn Asn Thr 65 70 75 80 Asn Glu Glu Ala Gly Asp Gly Thr Thr Thr Ala Thr Val Leu Ala Arg 85 90 95 Ser Ile Ala Lys Glu Gly Phe Glu Lys Ile Ser Lys Gly Ala Asn Pro 100 105 110 Val Glu Ile Arg Arg Gly Val Asp Leu Ala Val Asp Ala Val Ile Ala 115 120 125 Glu Leu Lys Lys Gln Ser Lys Pro Val Thr Thr Pro Glu Glu Ile Ala 130 135 140 Gln Val Ala Thr Ile Ser Ala Asn Gly Asp Lys Glu Ile Gly Asn Ile 145 150 155 160 Ile Ser Asp Ala Met Lys Lys Val Gly Arg Lys Gly Val Ile Thr Val 165 170 175 Lys Asp Gly Lys Thr Leu Asn Asp Glu Leu Glu Ile Ile Glu Gly Met 180 185 190 Lys Phe Asp Arg Gly Tyr Ile Ser Pro Tyr Phe Ile Asn Thr Ser Lys 195 200 205 Gly Gln Lys Cys Glu Phe Gln Asp Ala Tyr Val Leu Leu Ser Glu Lys 210 215 220 Lys Ile Ser Ser Ile Gln Ser Ile Val Pro Ala Leu Glu Ile Ala Asn 225 230 235 240 Leu Val Leu Asn Arg Leu Lys Val Gly Leu Gln Val Val Ala Val Lys 245 250 255 Ala Pro Gly Phe Leu Val Leu Asn Arg Leu Lys Val Gly Leu Gln Val 260 265 270 Val Ala Val Lys Ala Pro Gly Phe Gly Asp Asn Arg Lys Asn Gln Leu 275 280 285 Lys Asp Met Ala Ile Ala Thr Gly Gly Ala Val Phe Gly Glu Glu Gly 290 295 300 Leu Thr Leu Asn Leu Glu Asp Val Gln Pro His Asp Leu Gly Lys Val 305 310 315 320 Gly Glu Val Ile Val Thr Lys Asp Asp Ala Met Leu Leu Lys Gly Lys 325 330 335 Gly Asp Lys Ala Gln Ile Glu Lys Arg Ile Gln Glu Ile Ile Glu Gln 340 345 350 Leu Asp Val Thr Thr Ser Glu Tyr Glu Lys Glu Lys Leu Asn Glu Arg 355 360 365 Leu Ala Lys Leu Ser Asp Gly Val Ala Val Leu Lys Val Gly Gly Thr 370 375 380 Ser Asp Val Glu Val Asn Glu Lys Lys Asp Arg Val Thr Asp Ala Leu 385 390 395 400 Asn Ala Thr Arg Ala Ala Val Glu Glu Gly Ile Val Leu Gly Gly Gly 405 410 415 Cys Ala Leu Leu Arg Cys Ile Pro Ala Leu Asp Ser Leu Thr Pro Ala 420 425 430 Asn Glu Asp Gln Lys Ile Gly Ile Glu Ile Ile Lys Arg Thr Leu Lys 435 440 445 Ile Pro Ala Met Thr Ile Ala Lys Asn Ala Gly Val Asp Gly Ser Leu 450 455 460 Ile Val Glu Lys Ile Met Gln Ser Ser Ser Glu Val Gly Tyr Asp Ala 465 470 475 480 Met Ala Gly Asp Phe Val Asn Met Val Glu Lys Gly Ile Ile Asp Pro 485 490 495 Thr Lys Val Val Arg Thr Ala Leu Leu Asp Ala Ala Ser Val Ala Ser 500 505 510 Leu Leu Thr Thr Ala Glu Val Val Val Thr Glu Ile Pro Glu Glu Lys 515 520 525 Asp Pro Gly Met Gly Ala Met Gly Gly Met Gly Gly Gly Met Gly Gly 530 535 540 Gly Met Phe 545 93 amino acids amino acid single linear protein unknown 36 Pro Leu Glu Asp Lys Ile Leu Val Gln Ala Gly Glu Ala Glu Thr Met 1 5 10 15 Thr Pro Ser Gly Leu Val Ile Pro Glu Asp Ala Lys Glu Lys Pro Gln 20 25 30 Glu Gly Thr Val Val Ala Val Gly Pro Gly Arg Trp Asp Glu Asp Gly 35 40 45 Ala Lys Arg Ile Pro Val Asp Val Ser Glu Gly Asp Ile Val Ile Tyr 50 55 60 Ser Lys Tyr Gly Gly Thr Glu Ile Lys Tyr Asn Gly Glu Glu Tyr Leu 65 70 75 80 Ile Leu Ser Ala Arg Asp Val Leu Ala Val Val Ser Lys 85 90 94 amino acids amino acid single linear protein unknown 37 Met Lys Ile Arg Pro Leu His Asp Arg Val Val Val Arg Arg Met Glu 1 5 10 15 Glu Glu Arg Thr Thr Ala Gly Gly Ile Val Ile Pro Asp Ser Ala Thr 20 25 30 Glu Lys Pro Met Arg Gly Glu Ile Ile Ala Val Gly Ala Gly Lys Val 35 40 45 Leu Glu Asn Gly Asp Val Arg Ala Val Lys Val Gly Asp Val Val Leu 50 55 60 Phe Gly Lys Tyr Ser Gly Thr Glu Val Val Val Asp Gly Lys Glu Leu 65 70 75 80 Val Val Met Arg Glu Asp Asp Ile Met Gly Val Ile Glu Lys 85 90 94 amino acids amino acid single linear protein unknown 38 Met Leu Lys Pro Leu Gly Asp Arg Ile Val Ile Glu Val Val Glu Thr 1 5 10 15 Glu Asn Lys Thr Ala Ser Gly Ile Val Leu Pro Asp Thr Ala Lys Glu 20 25 30 Lys Pro Gln Glu Gly Arg Val Val Ala Val Gly Ala Gly Arg Val Leu 35 40 45 Asp Asn Gly Gln Arg Ile Gly Arg Lys Ser Lys Val Gly Asp Arg Val 50 55 60 Ile Phe Ser Lys Tyr Ala Gly Thr Glu Val Lys Tyr Asp Gly Lys Glu 65 70 75 80 Tyr Met Ile Leu Arg Glu Ser Asp Ile Leu Ala Val Ile Arg 85 90 94 amino acids amino acid single linear protein unknown 39 Met Ser Ile Lys Pro Leu Gly Asp Arg Val Val Ile Lys Arg Leu Glu 1 5 10 15 Ala Glu Glu Thr Thr Lys Ser Gly Ile Ile Val Thr Gly Thr Ala Lys 20 25 30 Glu Arg Pro Gln Glu Ala Glu Val Val Ala Val Gly Pro Gly Ala Ile 35 40 45 Val Asp Gly Lys Arg Thr Glu Met Glu Val Lys Ile Gly Asp Lys Val 50 55 60 Leu Tyr Ser Lys Tyr Ala Gly Thr Glu Val Lys Phe Glu Gly Glu Glu 65 70 75 80 Tyr Thr Ile Leu Arg Gln Asp Asp Ile Leu Ala Ile Val Glu 85 90 97 amino acids amino acid single linear protein unknown 40 Met Asn Ile Arg Pro Leu His Asp Arg Val Ile Val Lys Arg Lys Glu 1 5 10 15 Val Glu Thr Lys Ser Ala Gly Gly Ile Val Leu Thr Gly Ser Ala Ala 20 25 30 Ala Lys Ser Thr Arg Gly Glu Val Leu Ala Val Gly Asn Gly Arg Ile 35 40 45 Leu Glu Asn Gly Glu Val Lys Pro Leu Asp Val Lys Val Gly Asp Ile 50 55 60 Val Ile Phe Asn Asp Gly Tyr Gly Val Lys Ser Glu Lys Ile Asp Asn 65 70 75 80 Glu Glu Val Leu Ile Met Ser Glu Ser Asp Ile Leu Ala Ile Val Glu 85 90 95 Ala 591 base pairs nucleic acid double linear DNA (genomic) unknown 41 ATGTTAGGTC TTGTGTTATT GTATGTTGCG GTCGTGCTGA TCAGCAACGG AGTTAGTGGG 60 CTTGCAAATG TGGATGCCAA AAGCAAAGCC ATCATGAACT ACTTTGTGGG GGGGGACTCT 120 CCATTGTGTG TAATGTGGTC GCTATCATCT TATTCCACTT TCCACCCCAC CCCCCCTGCA 180 ACTGGTCCAG AAGATGTCGC GCAGGTGTCT CAACACCTCA TTAACTTCTA TGGTCCAGCG 240 ACTGGTCTAT TGTTTGGTTT TACCTACTTG TATGCTGCCA TCAACAACAC TTTCAATCTC 300 GATTGGAAAC CCTATGGCTG GTATTGCTTG TTTGTAACCA TCAACACTAT CCCAGCGGCC 360 ATTCTTTCTC ACTATTCCGA TGCGCTTGAT GATCACCGCC TCTTAGGAAT CACTGAGGGC 420 GATTGGTGGG CTTTCATTTG GCTTGCTTGG GGTGTTTTGT GGCTCACTGG TTGGATTGAA 480 TGCGCACTTG GTAAGAGTCT AGGTAAATTT GTTCCATGGC TTGCCATCGT CGAGGGCGTG 540 ATCACCGCTT GGATTCCTGC TTGGCTACTC TTTATCCAAC ACTGGTCTTG A 591 196 amino acids amino acid single linear peptide unknown 42 Met Leu Gly Leu Val Leu Leu Tyr Val Ala Val Val Leu Ile Ser Asn 1 5 10 15 Gly Val Ser Gly Leu Ala Asn Val Asp Ala Lys Ser Lys Ala Ile Met 20 25 30 Asn Tyr Phe Val Gly Gly Asp Ser Pro Leu Cys Val Met Trp Ser Leu 35 40 45 Ser Ser Tyr Ser Thr Phe His Pro Thr Pro Pro Ala Thr Gly Pro Glu 50 55 60 Asp Val Ala Gln Val Ser Gln His Leu Ile Asn Phe Tyr Gly Pro Ala 65 70 75 80 Thr Gly Leu Leu Phe Gly Phe Thr Tyr Leu Tyr Ala Ala Ile Asn Asn 85 90 95 Thr Phe Asn Leu Asp Trp Lys Pro Tyr Gly Trp Tyr Cys Leu Phe Val 100 105 110 Thr Ile Asn Thr Ile Pro Ala Ala Ile Leu Ser His Tyr Ser Asp Ala 115 120 125 Leu Asp Asp His Arg Leu Leu Gly Ile Thr Glu Gly Asp Trp Trp Ala 130 135 140 Phe Ile Trp Leu Ala Trp Gly Val Leu Trp Leu Thr Gly Trp Ile Glu 145 150 155 160 Cys Ala Leu Gly Lys Ser Leu Gly Lys Phe Val Pro Trp Leu Ala Ile 165 170 175 Val Glu Gly Val Ile Thr Ala Trp Ile Pro Ala Trp Leu Leu Phe Ile 180 185 190 Gln His Trp Ser 195 199 amino acids amino acid single linear protein unknown 43 Lys Gly Trp Met Leu Gly Leu Val Leu Leu Tyr Val Ala Val Val Leu 1 5 10 15 Ile Ser Asn Gly Val Ser Gly Leu Ala Asn Val Asp Ala Lys Ser Lys 20 25 30 Ala Ile Met Asn Tyr Phe Val Gly Gly Asp Ser Pro Leu Cys Val Met 35 40 45 Trp Ser Leu Ser Ser Tyr Ser Thr Phe His Pro Thr Pro Pro Ala Thr 50 55 60 Gly Pro Glu Asp Val Ala Gln Val Ser Gln His Leu Ile Asn Phe Tyr 65 70 75 80 Gly Pro Ala Thr Gly Leu Leu Phe Gly Phe Thr Tyr Leu Tyr Ala Ala 85 90 95 Ile Asn Asn Thr Phe Asn Leu Asp Trp Lys Pro Tyr Gly Trp Tyr Cys 100 105 110 Leu Phe Val Thr Ile Asn Thr Ile Pro Ala Ala Ile Leu Ser His Tyr 115 120 125 Ser Asp Ala Leu Asp Asp His Arg Leu Leu Gly Ile Thr Glu Gly Asp 130 135 140 Trp Trp Ala Phe Ile Trp Leu Ala Trp Gly Val Leu Trp Leu Thr Gly 145 150 155 160 Trp Ile Glu Cys Ala Leu Gly Lys Ser Leu Gly Lys Phe Val Pro Trp 165 170 175 Leu Ala Ile Val Glu Gly Val Ile Thr Ala Trp Ile Pro Ala Trp Leu 180 185 190 Leu Phe Ile Gln His Trp Ser 195 195 amino acids amino acid single linear protein unknown 44 Met Leu Gly Leu Val Leu Leu Tyr Val Gly Ile Val Leu Ile Ser Asn 1 5 10 15 Gly Ile Cys Gly Leu Thr Lys Val Asp Pro Lys Ser Thr Ala Val Met 20 25 30 Asn Phe Phe Val Gly Gly Leu Ser Ile Ile Cys Asn Val Val Val Ile 35 40 45 Thr Tyr Ser Ala Leu Asn Pro Thr Ala Pro Val Glu Gly Ala Glu Asp 50 55 60 Ile Ala Gln Val Ser His His Leu Thr Asn Phe Tyr Gly Pro Ala Thr 65 70 75 80 Gly Leu Leu Phe Gly Phe Thr Tyr Leu Tyr Ala Ala Ile Asn His Thr 85 90 95 Phe Gly Leu Asp Trp Arg Pro Tyr Ser Trp Tyr Ser Leu Phe Val Ala 100 105 110 Ile Asn Thr Ile Pro Ala Ala Ile Leu Ser His Tyr Ser Asp Met Leu 115 120 125 Asp Asp His Lys Val Leu Gly Ile Thr Glu Gly Asp Trp Trp Ala Ile 130 135 140 Ile Trp Leu Ala Trp Gly Val Leu Trp Leu Thr Ala Phe Ile Glu Asn 145 150 155 160 Ile Leu Lys Ile Pro Leu Gly Lys Phe Thr Pro Trp Leu Ala Ile Ile 165 170 175 Glu Gly Ile Leu Thr Ala Trp Ile Pro Ala Trp Leu Leu Phe Ile Gln 180 185 190 His Trp Val 195
We claim:
1. An immunogenic composition, which induces antibodies against Helicobacter infection, comprising a purified, synthetic, or recombinant Helicobacter HspA polypeptide or a fragment thereof, wherein said fragment has at least 6 amino acids and is immunogenic.
2. The immunogenic composition according to claim 1, wherein the Hsp polypeptide has the amino acid sequence depicted in FIG. 6 (SEQ ID NO: 29), or a fragment thereof, wherein said fragment has at least 6 amino acids and is immunogenic.
3. The immunogenic composition according to claim 1, wherein the HspA is encoded by the HspA gene of plasmid pILL689 (CNCM I-1356) or a fragment thereof, wherein said fragment has at least 6 amino acids and is immunogenic.
4. The immunogenic composition according to claim 1, further comprising a Helicobacter HspB polypeptide or a fragment thereof, wherein said fragment has at least 6 amino acids and is immunogenic.
5. The immunogenic composition according to claim 4, wherein the HspB is encoded by the HspB gene of plasmid pILL689 (CNCM I-1356) or a fragment thereof, wherein said fragment has at least 6 amino acids and is immunogenic.
6. Proteinaceous material comprising purified, synthetic, or recombinant HspA of Helicobacter py lori or a fragment thereof, wherein said fragment has at least 6 amino acids and is immunogenic.
7. The proteinaceous material according to claim 6, wherein the material comprises the Helicobacter HspA polypeptide having the amino acid sequence illustrated in FIG. 6 (SEQ ID NO: 29) or a fragment thereof, wherein said fragment has at least 6 amino acids and is immunogenic.
8. The proteinaceous material according to claim 6, wherein the material comprises HspA C-terminal sequence: GSCCHTGNHDHKHAKEHEACCHDHKKH (SEQ ID NO: 1) or a fragment thereof, wherein said fragment has at least 6 amino acids and is immunogenic.
9. The proteinaceous material according to claim 6 further comprising a Helicobacter HspB polypeptide or a fragment thereof, wherein said fragment has at least 6 amino acids and is immunogenic.
10. Proteinaceous material comprising a fusion protein, wherein the fusion protein comprises at least one Helicobacter HspA or a fragment thereof as defined in any one of claims 6-9 and at least one polypeptide selected from the group consisting of a Helicobacter py lori urease structural polypeptide or fragment thereof, wherein said fragment is recognized by antibodies to H. felis urease, and a Helicobacter felis urease structural polypeptide or immunogenic fragment thereof.
11. An immunogenic composition, which induces antibodies against Helicobacter infection, comprising at least one sub-unit of a purified, synthetic, or recombinant Helicobacter felis urease structural polypeptide selected from the group of polypeptides consisting of SEQ ID NO: 20 and SEQ ID NO: 21, and a heat shock protein (Hsp) from Helicobacter or a fragment thereof, wherein the Hsp protein is HspA or HspA and HspB encoded by the HspA/HspB genes of plasmid pILL689 (CNCM I-1356), and wherein said fragment has at least 6 amino acids and is immunogenic.
12. The immunogenic composition according to claim 11, wherein the Hsp protein is Helicobacter HspA or Hsp A and HspB having amino acid sequence(s) depicted in FIG. 6 (SEQ ID NOS: 29-30), or a fragment thereof, wherein said fragment has at least 6 amino acids and is immunogenic.
13. The immunogenic composition according to claim 11 or claim 12, which induces protective antibodies.
14. A pharmaceutical composition comprising the immunogenic composition of any one of claims 1-5, 11 or 12, in combination with physiologically acceptable excipient(s) and, optionally, furter comprising a pharmaceutically acceptable adjuvant.
15. A method for treatment or prevention of Helicobacter infection in a mammal comprising the step of administering the immunogenic composition of claim 13 to said mammal.
16. An immunogenic composition, capable of inducing antibodies against Helicobacter infection, comprising at least one sub-unit of a purified, synthetic, or recombinant Helicobacter felis urease structural polypeptide selected from the group of polypeptides consisting of SEQ ID NO: 20 and SEQ ID NO: 21, further comprising at least one heat shock protein (Hsp) from Helicobacter, wherein the Hsp protein is HspA, HspB, or HspA and HspB encoded by the HspA/HspB genes of plasmid pILL689 (CNCM I-1356), or a fragment thereof, wherein said fragment has at least 6 amino acids and is capable of generating antibodies.
|
Vance HARTKE, Defendant-Appellant, v. MOORE-LANGEN PRINTING AND PUBLISHING CO., INC., Plaintiff-Appellee.
No. 4-1282A385A.
Court of Appeals of Indiana, Fourth District.
Feb. 9, 1984.
Judith T. Kirtland, Lewis, Bowman, St. Clair & Wagner, Indianapolis, for defendant-appellant.
Robert L. McLaughlin, Wooden, McLaughlin & Sterner, James F. Hillis, Dunbar & Hillis, Indianapolis, for plaintiff-appellee.
YOUNG, Judge.
Vance Hartke appeals a judgment requiring him to pay for printing done by Moore-Langen Printing and Publishing Co., Inc. during his campaign for reelection to the United States Senate.
He contends that the evidence was insufficient to support the judgment.
We affirm.
Hartke appointed Jacques LeRoy his campaign manager and formed a committee to receive and expend money in his bid to be reelected. LeRoy ordered Moore-Langen, an Indianapolis printing firm, to print campaign materials, the content and quality of which were subject to Hartke's approval. After the campaign, there were no funds in the committee to pay Moore-Langen's bill, and they sued both Hartke and the committee for payment. The trial judge gave a money judgment against both in the sum of $8,285.68, the amount of Moore-Langen's bill. Hartke appeals.
The trial court correctly determined that Hartke was liable to Moore-Langen in quasi-contract and under the principles of agency.
The test for determining an agency relationship is set forth in Lewis v. Davis, (1980) Ind.App., 410 N.E.2d 18683, 1866:
An agency relationship is one which results from a "manifestation of consent by one person to another that the other shall act on his behalf and subject to his control, and consent by the other so to act." Department of Treasury v. Ice Service (1942), 220 Ind. 64, 41 N.E.2d 201, 208. It arises from the consent of the parties, out of a contractual agreement between the parties. It is not nee-essary that the contract or the authority of the agent to act be in writing. Department of Treasury, supra. Itis nee essary that the agent be subject to the control of the principal with respect to the details of the work. Western Adjust. & Insp. Co. v. Gross Income Tax Div. (1957), 236 Ind. 639, 142 N.E.2d 630.
The evidence here showed Hartke and Le-Roy agreed that LeRoy would act on Hartke's behalf in Hartke's campaign. The evidence also showed LeRoy and the committee were subject to Hartke's control in their work. Hartke approved all proofs submitted by Moore-Langen; he exercised veto power over what was used; he allocated the expenditure of campaign funds. Further, Moore-Langen's president testified that LeRoy identified himself as Hartke's agent and requested that Moore-Langen deal exclusively with him. This evidence was sufficient to support the trial judge's conclusion that LeRoy was Hartke's agent and that Moore-Langen reasonably believed Hartke would be bound by LeRoy's agreement to pay. See Stuteville v. Downing, (1979) 181 Ind.App. 197, 391 N.E.2d 629.
The evidence was also sufficient to support the trial judge's finding that Hartke was liable under the principles of quasi-contract. A quasi-contract does not arise from the parties' express agreement, but is implied by law in order to remedy the wrongful enrichment of one party at the expense of another. Dyer Construction Co. v. Ellas Construction Co., (1972) 153 Ind.App. 804, 287 N.E.2d 262. The evidence here showed Hartke approved and accepted all the printing work done by Moore-Langen on his behalf. Further, there was testimony that Hartke ordered a large portion of the committee's funds spent on last-minute television and radio commercials, leaving insufficient funds to pay Moore-Langen. On these facts, the trial court properly found a contract implied in law was necessary to prevent Hartke from being unjustly enriched at Moore-Langen's expense.
Affirmed.
CONOVER, P.J., and MILLER, J., concur.
|
Kadischi/LiveCD
News
* 29/08/2006 - BobJensen announced Live Spins made by Kadischi
Participating in the Fedora Live CD project
If you are interested in participating in this project:
* Join the mailing list
* Join the IRC channel: #fedora-livecd on freenode
Weekly status meetings are held on #fedora-livecd at 20:00 GMT on Wednesdays.
Existing Live CDs
Existing Fedora-based Live CDs can be found on the LiveCDs page.
Some external LiveCD projects for comparison can be found in External Projects page.
|
Continuous compounding in practice
A common explanation for the mathematical constant e (2.71828...) is that it is the factor by which an investment would grow at 100% interest rate over a period if it is continuously compounded.
In other words, if you were to invest 1 million dollars for one year at a rate of 100%, after one year, the balance would show about 2.71 M$ (or e M$)
However, it is not a case I have ever seen. We often see monthly compounding, sometimes daily, but I've never seen continuous compounding.
Does continuous compounding exist in practice? Is it ever part of a financial product offering? If so, in which cases might it be used?
I think the point is for you to adjust the variables in that formula to a real world scenario.
Continuous compounding at an interest rate of 100% is unlikely to be used in practice. More generally, if the interest rate is x% per annum and interest is compounded n times during the year (so that at the end of each sub-interval,
the amount increases by a factor of (1 + (x/100)/n) ), then the amount has
increased over the year by a factor of
(1 + (x/100)/n)^n which is approximately e^(x/100) = 1 + (x/100) + (x/100)^2/2 + (x/100)^3/6 + .... when n is large.
Mathematically, e^(x/100) is the limiting value of (1+(x/100)/n)^n as n
tends to infinity.
Heuristically, (1 + (x/100)/n)^n gets closer and closer to e^(x/100)
as n gets larger and
larger (from quarterly to monthly to daily to hourly .... compounding).
So, let us turn the problem around. If the annual percentage
yield (not the same as the APR) is specified as y% per annum,
then let x be the solution to the equation
e^(x/100) - 1 = (y/100)
which gives x = 100 log_e (1 + y/100)% as the rate that would be quoted
as the APR for continuous compounding while the APR for monthly
compounding would be quoted as the solution to
(1 + (x/100)/12)^12 = 1 + y/100
which gives x = 12 times 100 times the 12th root of (1 + y/100) % as the APR.
As a comparison, an annual percentage yield of 5% per annum corresponds to a
quoted rate (APR) of 4.88894...% per annum compounded monthly and 4.8790...% per
annum compounded continuously. Weekly and daily compounding would
result in quotes somewhere in between these two figures, but as
you can see, for a given annual percentage yield, continuous compounding
really does
not make that the APR significantly smaller than the more
common monthly compounding used for mortgages, auto loans, and
the like.
+1 what a beautiful explanation, an upvote and hat tip, Dilip.
If you want 5% gain over the year and want to compound using n intervals you will get 105% at the year end by using initial*(interestPerPeriod + 1)^n where interestPerPeriod = (x + 1)^(1/n) - 1 and x = 0.05. That's the maths at least. The APR method appears to be something different. If I didn't get 105% I'd be worried.
@ChrisDegnen You are working things backwards. Normally, interest rates are quoted as x% per annum compounded z-ly where z could be "annual, quarter, month, week, dai, hour" etc. in which case at the end of the n periods comprising a year, you will get (1+x/100n)^n = 1+y/100 and the APR is y%. You are starting with an APR of y% and asking, if the interest is computed n times in the year, what is the interest-per-period (IPP)? When you solve for IPP, you can get the "quoted rate" as (n times IPP %) compounded n-ly). The APR is required by law to be stated on all loans, but what is used is IPP.
The cause of this misunderstanding is that in the European Union, APR (annual percentage rate) is the effective annual rate, or annual percentage yield as you put it (5%). The APR you quote (4.879%) is the nominal rate, or logarithmic rate, which is not quoted in the EU. In the EU monthly rates are calculated as (APR/100 + 1)^(1/12) - 1, which in this example would be 0.4074%. Or from log return, e^(0.04879*1/12) - 1 = 0.4074%.
@ChrisDegnen Yes, APR seem to mean different things in the US and the EU. The 5% annual percentage yield (APY) of the US can, as I said, be stated as an APR of 4.88894...% per annum compounded monthly, making the per-month rate to be 4.88894/12 = 0.4074116..%. which is exactly what you get from the EU APR of 5% via (1+APR)^{1/12}-1.
Here are some calculations for an investment which yields a final value of $ e million ($2,718,282) from an initial value of $ 1 m.
The logarithmic or continuously compounded return is given as:-
Vf = 2,718,282
Vi = 1,000,000
rlog = ln(Vf/Vi) = 1.0 = 100 %
This is a logarithmic return, or nominal return (continuously compounded) of 100%.
The effective annual rate can be calculated by:-
where i is the logarithmic or continuously compounded nominal rate.
i = rlog = 1.0 = 100%
r = e^i - 1 = 1.718282 = 171.8282 %
An effective annual return of 171.8282% produces the final value of $ e million.
Of course, the effective return can also be calculated as:
r = Vf/Vi - 1 = 1.718282 = 171.8282 %
Now considering monthly periodic returns
The effective annual rate calculated from a periodically compounded nominal return is:
where n is the number of compounding periods.
Rearranging this formula, and using the previously calculated effective annual rate (which produced $ e million), the annual nominal rate compounded monthly is calculated:
r = 1.718282 = 171.8282 %
n = 12
i = n*((r + 1)^(1/n) - 1) = 1.0428486 = 104.28486 %
Note how this differs from the 100% calculated for the continuously compounded nominal rate. As n increases the periodic nominal rate approaches the continuously compounded nominal rate, as demonstrated by the limit formula:
For example, the nominal rate compounded daily (with n = 365) is 100.137%, which is somewhat closer to 100% than the nominal rate compounded monthly.
From the annual nominal rate compounded monthly, the monthly compounding rate can be found:
m = i/n = 1.0428486/12 = 0.08690405 = 8.690405 %
Checking by compounding for 12 months: (m + 1)^n - 1 = 1.718282
The monthly compounding rate can also be calculated directly from the logarithmic rate, or annual continuously compounded nominal rate:
i = rlog = 1.0 = 100 %
n = 12
m = e^(i/n) - 1 = 8.690405 %
|
The Series
A list of all known stories told through a variety of mediums.
Webseries
Write the first section of your page here.
Written works
roses-painted-gold.tumblr.com <-- Roseline's blog, lore heavy
hangingonwords.tumblr.com <-- Jeremy's blog, horror themed/plot-progression
puppers-and-sunshine.tumblr.com <-- Scott's blog, horror themed/plot-progression
june-for-the-junette.tumblr.com <-- Nathaniel's blog, horror themed/plot-progression
|
WikiHorseWorld Tack Shop
Sterling Silver Horse Charm, 1 inch wide
• Buy New: $42.37
• as of 5/26/2017 07:53 CDT details
In Stock
• Seller:Sabrina Silver
• ASIN:B001GTQ93G
Availability:Usually ships in 24 hours
Features:
• Solid Sterling Silver
• Nice Detail & Workmanship
Editorial Reviews:
Synopsis
This beautiful pendant is made of solid Sterling Silver, antique finished to show the nice detail, NO Chain Included
CERTAIN CONTENT THAT APPEARS ON THIS SITE COMES FROM AMAZON SERVICES LLC. THIS CONTENT IS PROVIDED ‘AS IS’ AND IS SUBJECT TO CHANGE OR REMOVAL AT ANY TIME.
Did You Know?
Modern horse breeds developed in response to a need for "form to function", the necessity to develop certain physical characteristics in order to perform a certain type of work... More...
The Gypsy Cob was originally bred to be a wagon horse and pulled wagons or caravans known as Vardos; a type of covered wagon that people lived in... More...
Archaeological evidence indicates that the Arabian horse bloodline dates back 4,500 years. Throughout history, Arabian horses spread around the world by both war and trade.... More...
That the term "Sporthorse" is a term used to describe a type of horse rather than any particular breed... More...
|
"""Test init of Nut integration."""
from unittest.mock import patch
from homeassistant.components.nut.const import DOMAIN
from homeassistant.config_entries import ConfigEntryState
from homeassistant.const import CONF_HOST, CONF_PORT, STATE_UNAVAILABLE
from homeassistant.core import HomeAssistant
from .util import _get_mock_pynutclient
from tests.common import MockConfigEntry
async def test_async_setup_entry(hass: HomeAssistant) -> None:
"""Test a successful setup entry."""
entry = MockConfigEntry(
domain=DOMAIN,
data={CONF_HOST: "mock", CONF_PORT: "mock"},
)
entry.add_to_hass(hass)
mock_pynut = _get_mock_pynutclient(
list_ups={"ups1": "UPS 1"}, list_vars={"ups.status": "OL"}
)
with patch(
"homeassistant.components.nut.PyNUTClient",
return_value=mock_pynut,
):
await hass.config_entries.async_setup(entry.entry_id)
await hass.async_block_till_done()
assert len(hass.config_entries.async_entries(DOMAIN)) == 1
assert entry.state is ConfigEntryState.LOADED
state = hass.states.get("sensor.ups1_status_data")
assert state is not None
assert state.state != STATE_UNAVAILABLE
assert state.state == "OL"
assert await hass.config_entries.async_unload(entry.entry_id)
await hass.async_block_till_done()
assert entry.state is ConfigEntryState.NOT_LOADED
assert not hass.data.get(DOMAIN)
async def test_config_not_ready(hass: HomeAssistant) -> None:
"""Test for setup failure if connection to broker is missing."""
entry = MockConfigEntry(
domain=DOMAIN,
data={CONF_HOST: "mock", CONF_PORT: "mock"},
)
entry.add_to_hass(hass)
with patch(
"homeassistant.components.nut.PyNUTClient.list_ups",
return_value=["ups1"],
), patch(
"homeassistant.components.nut.PyNUTClient.list_vars",
side_effect=ConnectionResetError,
):
await hass.config_entries.async_setup(entry.entry_id)
await hass.async_block_till_done()
assert entry.state is ConfigEntryState.SETUP_RETRY
|
and so on in lopnlnr succession. Now the phice for hiuls is in tho nxils of the leaves {(urilluni hmln, 58), and at the rnd of tlio stem {(rniiina/hmf, 57): sotlu'se are also the jilaecs from wlildi llowers spring. Fi«;. i^^8 is 11 'riillium, with its
l|i)Wt'r f'nnitia/y that is, from thf summit of tht' stem. Ki^. 139 is a piece of Moneywort, witli aj-Hhtni flowoi*s, /.'. , from the axils of the h'avcs. The Moriiin^'-(5lory (Fi;,'. 4) also has its (lowors axillary.
whenever the lilossoms are more numerous or closer, and the ac companying leaves are le.ss con sj)icuous. Fifj. 140 is a cluster (like that of Lily of the Valley, Fig. 3) of the kind called a
Fig. 139, we may percene that it differs maiidy in having the leaves, one under each hlo.s.som-stalk, red oed to little scales, which are inconspiciU)Us. In both, the Howers really spring fi-om the axils of leaves. So they do in all the follow ing kinds of flower-clusters, until we reach the Cyme.
172. The leaves of a flower-cluster take the name of IlracJ^. The.se are generally very different from the ordinary leaves of the plant, commonly nnich smaller, and often very small indeed, as in Fig. 140. In the figures 141 to 144, the bracts are larger, and more leaf-like. They aie the leaves from whose axil the flower ari.ses, Sometimes there are bracts ahso on the .separate flower-stalks (as ou the lower ones in Fig. 140) : to distinguish these we cull them Bmctlets.
|
<?php
namespace Quanta\Qtags;
/**
* Creates a link to edit a specific node, if user has rights.
*/
class Edit extends Link {
public $link_class = array('edit-link');
protected $html_body = '✎';
/**
* Render the Qtag.
*
* @return string
* The rendered Qtag.
*/
public function render() {
$nodeobj = \Quanta\Common\NodeFactory::loadOrCurrent($this->env, $this->getTarget());
$this->setTarget($nodeobj->getName());
if (\Quanta\Common\NodeAccess::check($this->env, \Quanta\Common\Node::NODE_ACTION_EDIT, array('node' => $nodeobj))) {
$title = \Quanta\Common\Api::filter_xss(empty($nodeobj->getTitle()) ? $nodeobj->getName() : $nodeobj->getTitle());
if (!isset($this->attributes['tooltip'])) {
$this->attributes['tooltip'] = t('Edit !title...', array('!title' => $title));
}
$this->attributes['redirect'] = isset($this->attributes['redirect']) ? $this->attributes['redirect'] : '';
return parent::render();
}
}
}
|
Title: Recidivism Preferred
You are not logged in. If you create a free account and sign in, you will be able to customize what is displayed.
Title: Recidivism Preferred Title Record # 63409
Author: John Jakes
Date: 1962-02-00
Type: SHORTFICTION
Length: short story
Language: English
User Rating: This title has no votes. VOTE
Current Tags: None Add Tags
Publications
Title Date Author/Editor Publisher/Pub. Series ISBN/Catalog# Price Pages Format Type Cover Artist Verif
Amazing Stories, February 1962 1962-02-00 ed. Cele Goldsmith Ziff-Davis Publishing Company $0.35 148 digest mag Alex Schomburg
Great Science Fiction, Fall 1967 1967-09-00 ed. uncredited Ultimate Publishing Co., Inc. $0.50 132 digest mag Leo Summers
The Best of John Jakes 1977-06-00 John Jakes DAW Books (DAW Collectors #244) 0-87997-302-1 $1.75 252 pb coll Jack Gaughan
The Best of John Jakes 1977-06-00 John Jakes DAW Books / New American Library of Canada 0-87997-302-1 C$1.75 252 pb coll Jack Gaughan
View all covers for Recidivism Preferred (logged in users can change User Preferences to always display covers on this page)
Copyright (c) 1995-2016 Al von Ruff.
ISFDB Engine - Version 4.00 (04/24/06)
|
Dasypus novemcinctus, L.j Cachichame, BufF. X, xxxvii ; Ta tou d longue queue, Id. Supp. Ill, Iviii ; Tatuete, Schreb. Ixxiii ; Tatupeba, Marcg. (The Nine-banded Armadillo.) With nine, sometimes eight intermediate bands, generally blackish ; the body fifteen inches in length, and the tail the same.
Das. 7-cinctus; Schreb. LXXII ; Tatou mulet, Azzar. (The Seven-banded Armadillo.) But seven bands, and is smaller ; its tail also is proportionably shorter. Those of the
Apara, Cuv.,
Have the toes of the Cachicami, and nine or ten teeth throughout. Das. tricinctus, L. ; Tatou Jlpara, Marcg. ; Jlpar, Buff. ; Mafaco, Azzar.; Schreb. LXXI, A. (The Three-banded Armadillo.) Three intermediate bands ; tail very short, and the compart ments regularly tuberculated. By enclosing its head and feet be tween its plates, it possesses the faculty of rolling itself into a complete ball, like certain species of Oniscus. It is from Para guay and Brazil, and is one of those found farthest to the south. Size, middling. In other Tatous, such as the
Encoubertus, Cuv.,
There are five toes to the fore feet, the three middle of which are the longest. The greater part of their tail is covered with scales, arranged in quincunx. There are nine or ten teeth throughout. In this subdivision is
Dasyp. sexcinctus and octodecimcinctiis, L. ; Encoubert and Cir quinson, Buff.;(l) Tatou poyou, Azzar.; Buff. X, xlii, and Supp. Ill, xlii. (The Six-banded Armadillo.) Distinguished from all the rest of the genu^ by having a tooth on each side in the in termaxillary bone. The shell has six or seven bands ; its com partments are large, smooth and angular ; the tail is of a mid dling length, and annulated only at the base ; there are five toes to each foot. The Pichiy of Azzara resembles this species, except that there are no intermaxillary teeth, that its posterior shield is denticulated, and that the parts not defended by the
(1) The Weasel-headed Tatou of Grew; Cirquinson of BufF.; Das. octodecimdnC' tus, L., is the Encoubert, or Six-tjanded Jirmadillo , but Grew considered the rows of scales on the croup as movable. If we count them we shall find but sixteen, and his own figure exhibits no more.
|
Issue #505: iDRAC changes in FAQ.md
Issues Resolved by this Pull Request
Fixes #505
Description of the Solution
iDRAC changes in FAQ.md
Suggested Reviewers
@lwilson @j0hnL
@all-contributors add @abhishek-s-a for documentation
|
Breslin v. Mooney et al., Appellants.
Argued April 11, 1932.
Before Frazer, C. J., Simpson, Kephart, Schaffer, Maxey, Drew and Linn, JJ.
M. S. DePierro, with him Conrad A. Falvello, for appellants.
— In the instant case, a jury should be permitted to find and determine the question of fraud or bad faith on the part of the holder from all the facts and circumstances attending the purchase of the judgment by him: Kaier v. O’Brien, 202 Pa. 153.
One who takes a bill or a note after it is due, takes it subject to all objections in respect to want of consideration, illegality, and all other objections and equities affecting the instrument itself and to which it was liable in the hands of the person from whom he takes it: Wilson v. Bank, 45 Pa. 488, 494; Liebig Mfg. Co. v. Hill, 9 Pa. Superior Ct. 469; Thompson’s Case, 284 Fed. 65.
Adrian H. Jones, for appellee.
— Where all preliminary negotiations, conversations and verbal agreements are merged in and superseded by the subsequent written contract, and unless fraud, accident or mistake be averred, the writing constitutes the agreement between the parties, and its terms cannot be added to nor subtracted from by parol evidence: Gianni v. Russell & Co., Inc., 281 Pa. 320; Hooversville Bank v. Sagerson, 283 Pa. 406; Evans v. Edelstein, 276 Pa. 516; Second Nat. Bank v. Yeager, 268 Pa. 167.
This agreement does more than vary the written instrument, it destroys it: Clarke v. Allen, 132 Pa. 40, 42; Irvin v. Irvin, 142 Pa. 271, 286; Zeigler v. McFarland, 147 Pa. 607, 610; Plunkett v. Roehm, 12 Pa. Superior Ct. 83, 86; Butler v. Keller, 19 Pa. Superior Ct. 472: First Nat. Bank v. Baer, 277 Pa. 184; Evans v. Edelstein, 276 Pa. 516; Second Nat. Bank v. Yeager, 268 Pa. 167.
Whether defendants who signed the note without receiving any value themselves, but for the purpose of lending their name to the silk company, are liable on the note to the assignee of the payee bank, where the bank loaned the money to the silk company, and the assignee paid value for the note, does not affect this plaintiff: Diffenbacher’s Est., 31 Pa. Superior Ct. 35; Chambers v. McLean, 24 Pa. Superior Ct. 567; Peale v. Addicks, 174 Pa. 543.
May 9, 1932:
Opinion by
Mr. Justice Schaffer,
This appeal by the defendants from the refusal of the court below to open a judgment against them is without merit.
The two appellants were, with four others, directors of a corporation. To aid in its financing, they endorsed a note to the Berwick National Bank for a loan of $10,000 made by the bank. Subsequently, when this obligation matured, they executed a new note to the bank as makers in the amount of $10,504. This renewal contained a confession of judgment in pursuance of which the bank caused judgment to be entered. Thereafter it assigned the judgment to the plaintiff, John F. Breslin. When he attempted to collect the judgment from appellants, they instituted this proceeding to open it, alleging that when they executed the first note, and contemporaneously therewith, there had been an agreement entered into with other persons, also interested in the corporation (not with the bank) that they, the defendants, and the other directors, one of whom was the father of plaintiff, would not be called upon to pay it, and that the plaintiff knew of this arrangement and is by reason thereof precluded from collecting the judgment. That two-thirds of the amount due has already been paid seems to have been admitted by plaintiff, and the lower court in its opinion so stated.
It is not claimed that the agreement was made with the bank, but with a third person, Edward Bosak. Just how this could affect the bank or its assignee, even if the latter did know of it, passes comprehension. By the assignment the plaintiff acquired all the rights of the bank and as to it the so-called agreement amounted to nothing. Furthermore, the testimony of the defendants fails to make out an agreement. All that their testimony amounts to is that because of what Bosak said they did not expect to pay the note or understood it would be taken care of by the corporation, that they were so led to believe. This could not defeat recovery on it. Even had there been such an agreement as they contend for, that although they had signed the note, they were not to be liable for its payment, this would not avail them under the law as laid down by us in First Natl. Bank of Hooversville v. Sagerson, 283 Pa. 406; Evans v. Edelstein, 276 Pa. 516; Second Natl. Bank of Reading v. Yeager, 268 Pa. 167, and other cases which have followed in their wake, the last of which is Myers v. Gibson, 304 Pa. 249.
So far as the amount paid on account of the note is concerned, this was taken care of by the court below in its order which opened the judgment as to all in excess of $3,501.20, which is the remaining one-third of the indebtedness yet undischarged.
The decree is affirmed at appellants’ cost.
|
//------------------------------------------------------------------------------
// Torque Game Builder
// Copyright (C) GarageGames.com, Inc.
//------------------------------------------------------------------------------
function EditBehaviorLocalPointList(%object, %behavior, %field)
{
BehaviorLocalPointListEditor.sourceBehavior = %behavior;
BehaviorLocalPointListEditor.sourceField = %field;
BehaviorLocalPointListEditor.open(%object);
}
function BehaviorLocalPointListEditor::getLocalPoints(%this)
{
if (isObject(%this.sourceBehavior))
{
%lplist = %this.sourceBehavior.getFieldValue(%this.sourceField);
for (%i=0; %i<getWordCount(%lplist); %i+=2)
{
%this.createNewLocalPoint(getWords(%lplist, %i, %i+1));
}
}
}
function BehaviorLocalPointListEditor::save(%this)
{
if (isObject(%this.sourceBehavior))
{
%length = getWordCount(%this.localPoints);
%newPoints = "";
for (%i=0; %i<getWordCount(%this.localPoints); %i++)
{
%obj = getWord(%this.localPoints, %i);
%objX = getWord(%obj.position, 0);
%objY = getWord(%obj.position, 1);
%newPoints = setWord(%newPoints, %i*2, %objX);
%newPoints = setWord(%newPoints, %i*2+1, %objY);
}
// register change with undo system.
%oldPointList = %this.sourceBehavior.getFieldValue(%this.sourceField);
%undo = new UndoScriptAction()
{
class = BehaviorLocalPointListEditorUndo;
actionName = "Modify behavior point list";
object = %this.baseObject;
sourceBehavior = %this.sourceBehavior;
sourceField = %this.sourceField;
oldList = %oldPointList;
newList = %newPoints;
};
%undo.addToManager(LevelBuilderUndoManager);
%this.sourceBehavior.setFieldValue(%this.sourceField, %newPoints);
%this.close();
}
}
function BehaviorLocalPointListEditorUndo::undo(%this)
{
%this.sourceBehavior.setFieldValue(%this.sourceField, %this.oldList);
}
function BehaviorLocalPointListEditorUndo::redo(%this)
{
%this.sourceBehavior.setFieldValue(%this.sourceField, %this.newList);
}
|
/**
* Forgot Password API
*/
import API from './api';
import C from '../constants';
export default class forgotPasswordAPI extends API {
constructor(email, timeout = 2000) {
super('GET', timeout, false);
this.type = C.FORGOT_PASSWORD;
this.email = email;
this.forgotPasswordRes = '';
}
toString() {
}
processResponse(res) {
super.processResponse(res);
if (res.status===1) {
this.forgotPasswordRes = res;
return true
}
return false
}
getPayload() {
return this.forgotPasswordRes;
}
getBody() {
return {}
}
apiEndPoint() {
return `${super.apiEndPoint()}/forgotPassword?email=${this.email}`
}
getHeaders() {
return {
headers: {
'Content-Type': 'application/json'
}
}
}
}
|
---
published: true
layout: post
---
##
```python
f = open('temperatures.csv')
header = f.readline().strip().split(',') # then f does not include first row anymore??
data = []
for l in f:
data.append(l.strip().split(','))
```
## Python: import data
[datacamp](https://campus.datacamp.com/courses/importing-data-in-python-part-1/introduction-and-flat-files-1?ex=5)
## Importing text files line by line
For large files, we may not want to print all of their content to the shell: you may wish to print only the first few lines. Enter the readline() method, which allows you to do this. When a file called file is open, you can print out the first line by executing file.readline(). If you execute the same command again, the second line will print, and so on.
In the introductory video, Hugo also introduced the concept of a context manager. He showed that you can bind a variable file by using a context manager construct:
> with open('huck_finn.txt') as file:
While still within this construct, the variable file will be bound to open('huck_finn.txt'); thus, to print the file to the shell, all the code you need to execute is:
> with open('huck_finn.txt') as file:
> print(file.read())
- Flat files consist of rows and each row is called a record.
- A record in a flat file is composed of fields or attributes, each - of which contains at most one item of information.
Flat files are pervasive in data science.
## Why we like flat files and the Zen of Python
In PythonLand, there are currently hundreds of Python Enhancement Proposals, commonly referred to as PEPs. PEP8, for example, is a standard style guide for Python, written by our sensei Guido van Rossum himself. It is the basis for how we here at DataCamp ask our instructors to style their code. Another one of my favorites is PEP20, commonly called the Zen of Python. Its abstract is as follows:
> Long time Pythoneer Tim Peters succinctly channels the BDFL's guiding principles for Python's design into 20 aphorisms, only 19 of which have been written down.
If you don't know what the acronym BDFL stands for, I suggest that you look here. You can print the Zen of Python in your shell by typing import this into it! You're going to do this now and the 5th aphorism (line) will say something of particular interest.
In [1]: import this
The Zen of Python, by Tim Peters
Beautiful is better than ugly.
Explicit is better than implicit.
Simple is better than complex.
Complex is better than complicated.
Flat is better than nested.
Sparse is better than dense.
Readability counts.
Special cases aren't special enough to break the rules.
Although practicality beats purity.
Errors should never pass silently.
Unless explicitly silenced.
In the face of ambiguity, refuse the temptation to guess.
There should be one-- and preferably only one --obvious way to do it.
Although that way may not be obvious at first unless you're Dutch.
Now is better than never.
Although never is often better than *right* now.
If the implementation is hard to explain, it's a bad idea.
If the implementation is easy to explain, it may be a good idea.
Namespaces are one honking great idea -- let's do more of those!
There is another function, np.genfromtxt(), which can handle such structures. If we pass dtype=None to it, it will figure out what types each column should be.
Import 'titanic.csv' using the function np.genfromtxt() as follows:
> data = np.genfromtxt('titanic.csv', delimiter=',', names=True, dtype=None)
Here, the first argument is the filename, the second specifies the delimiter , and the third argument names tells us there is a header. Because the data are of different types, data is an object called a structured array.
Because numpy arrays have to contain elements that are all the same type, the **structured array**solves this by being a 1D array, where each element of the array is a row of the flat file imported. You can test this by checking out the array's shape in the shell by executing np.shape(data).
Acccessing rows and columns of structured arrays is super-intuitive: to get the ith row, merely execute data[i] and to get the column with name 'Fare', execute data['Fare'].
### MARGINALIZATION FOR MANY RANDOM VARIABLES (COURSE NOTES)
What happens when we have more than two random variables? Let's build on our earlier example and suppose that in addition to weather W and temperature T, we also had a random variable H for humidity that takes on values in the alphabet {dry, humid}. Then having a third random variable, we can draw out a 3D joint probability table for random variables W, T, and H. As an example, we could have the following:
<EMAIL_ADDRESS>
Here, each of the cubes/boxes stores a probability. Not visible are two of the cubes in the back left column, which for this particular example both have probability values of 0.
Then to marginalize out the humidity H, we would add values as follows:
<EMAIL_ADDRESS>
The result is the joint probability table for weather W and temperature T, shown still in 3D cubes with each cube storing a single probability.
As an equation:
pW,T(w,t)=∑hpW,T,H(w,t,h).
In general, for three random variables X, Y, and Z with joint probability table pX,Y,Z, we have
pX,Y(x,y)=∑zpX,Y,Z(x,y,z),pX,Z(x,z)=∑ypX,Y,Z(x,y,z),pY,Z(y,z)=∑xpX,Y,Z(x,y,z).
Note that we can marginalize out different random variables in succession. For example, given joint probability table pX,Y,Z, if we wanted the probability table pX, we can get it by marginalizing out the two random variables Y and Z:
$$p_ X(x) = \sum _{y} p_{X,Y}(x,y) = \sum _{y} \Big( \sum _{z} p_{X,Y,Z}(x,y,z) \Big).$$
Even with more than three random variables, the idea is the same. For example, with four random variables W, X, Y, and Z with joint probability table pW,X,Y,Z, if we want the joint probability table for X and Y, we would do the following:
pX,Y(x,y)=∑w(∑zpW,X,Y,Z(w,x,y,z)).
If we marginalize out Z first and then Y, or if we marginalize out Y first and then Z, we get the same answer for the probability table
### CONDITIONING: RANDOMNESS OF A VARIABLE GIVEN THAT ANOTHER VARIABLE TAKES ON A SPECIFIC VALUE (COURSE NOTES)
When we observe that a random variable takes on a specific value (such as W=rainy from earlier for which we say that we condition on random variable W taking on the value “rainy"), this observation can affect what we think are likely or unlikely values for another random variable.
When we condition on W=rainy, we do a two-step procedure; first, we only keep the row for W corresponding to the observed value:
<EMAIL_ADDRESS>
Second, we “normalize" the table so that its entries add up to 1, which corresponds to dividing it by the sum of the entries, which is equal to pW(rainy) in this case:
<EMAIL_ADDRESS>
**Notation**: The resulting probability table pT∣W(⋅∣rainy) is associated with the random variable denoted (T∣W=rainy); we use “∣" to denote that we're conditioning on things to the right of “∣" happening (these are things that we have observed or that we are given as having happened). We read “T∣W=rainy" as either “T given W is rainy" or “T conditioned on W being rainy". To refer to specific entries of the table, we write, for instance,
pT∣W(cold∣rainy)=P(T=cold∣W=rainy)=45.
In general:
**Conditioning**: Consider two random variables X and Y (that take on values in the sets X and Y respectively) with joint probability table pX,Y (from which by marginalization we can readily compute the marginal probability table pY). For any x∈X and y∈Y such that pY(y)>0, the conditional probability of event X=x given event Y=y has happened is
$$p_{X\mid Y}(x\mid y)\triangleq \frac{p_{X,Y}(x,y)}{p_{Y}(y)}.$$
pX∣Y(x∣y)≜pX,Y(x,y)pY(y).
For example,
pT∣W(cold∣rainy)=pW,T(rainy,cold)pW(rainy)=21516=45.
**Computational interpretation**: To compute pX∣Y(x∣y), take the entry pX,Y(x,y) in the joint probability table corresponding to X=x and Y=y, and then divide the entry by pY(y), which is an entry in the marginal probability table pY for random variable Y.
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.