node_id int64 0 76.9k | label int64 0 39 | text stringlengths 13 124k | neighbors listlengths 0 3.32k | mask stringclasses 4
values |
|---|---|---|---|---|
10,586 | 9 | Comparison_of_programming_languages_(basic_instructions):comparison programming languages basic instructions comparison programming languages common topic discussion among software engineers basic instructions several programming languages compared bold literal code non-bold interpreted reader statements guillemets « … » optional indicates necessary indent whitespace standard constants codice_1 codice_2 used determine many 'codice_3 'codice_4 usefully prefixed 'codice_5 'codice_6 actually size 'codice_5 'codice_8 'codice_6 available constants codice_10 codice_11 codice_12 etc standard constants codice_39 codice_40 used determine many 'codice_3 'codice_4 usefully prefixed 'codice_43 'codice_44 actually size 'codice_43 'codice_46 'codice_44 available constants codice_48 codice_49 codice_50 etc constants codice_51 codice_52 codice_53 available type machine epsilon value n provided codice_54 intrinsic function specifically strings arbitrary length automatically managed language separate character type characters represented strings length 1 expressions except codice_65 codice_66 operators values array types c automatically converted pointer first argument see c syntax arrays details syntax pointer operations classes supported pascal declaration blocks see comparison programming languages basic instructions functions types regular objects assign single instruction written line following colon multiple instructions grouped together block starts newline indentation required conditional expression syntax follow rule codice_74 n used change loop interval codice_74 omitted loop interval 1 common lisp allows codice_80 codice_81 codice_82 define restarts use codice_83 unhandled conditions may cause implementation show restarts menu user unwinding stack pascal declaration blocks see comparison programming languages basic instructions functions see reflection calling declaring functions strings string signed decimal number br algol 68 additionally unformatted transput routines codice_91 codice_92 br codice_93 codice_94 read unformatted text stdin use gets recommended fortran 2008 newer | [
10752,
8582,
1931,
2062,
6414,
6160,
5521,
10510,
8854,
3736,
1435,
155,
9245,
6558,
5663,
11555,
3876,
5796,
428,
5165,
5677,
5806,
9008,
3765,
2102,
7479,
10043,
10684,
3904,
963,
8644,
8262,
5961,
1610,
1611,
8524,
3577,
8397,
847,
980... | Train |
10,587 | 9 | Behat_(computer_science):behat computer science behat test framework behavior-driven development written php programming language behat created konstantin kudryashov development hosted github behat intended aid communication developers clients stakeholders software development process allows clear documentation testable examples software intended behaviour behat test scenarios written gherkin business-readable domain-specific language following defined patterns tests run point new code introduced codebase confirm regressions within existing test coverage introduced integrated selenium browser emulators generate screenshots failures like bdd frameworks behat scenarios series given steps explain business case definition steps exist within method annotations class extends behatcontext preconditions given correspond php method name execute | [
1034,
6154,
9614,
2465,
2348,
7983,
190,
6338,
2372,
8644,
1353,
4171,
11221,
11357,
3553,
7785,
7147,
5612,
4853,
11259,
7293
] | None |
10,588 | 5 | Publius_(publishing_system):publius publishing system publius web protocol developed lorrie cranor avi rubin marc waldman gives individuals ability publish information web anonymously high guarantee publications censored modified third party nine design goals publius development team publius web system consists following agents publius system relies static list web servers publisher wishes add contents web first encrypts using random symmetric key k k split n shares parts least k n shares required reconstruction k see also secret sharing subset servers receives another share k encryption result using key k e k br retriever wishes obtain original contents follows generated url corresponds contents combined portion k appears subset servers list gathering k different shares copy e k allows retriever reconstruct key k shares decrypt e k back modification removal server hosted contents issued original publishers using combination password hosting server domain name present publius supports hosting html pages images file formats pdfs postscripts publius protocol allows following operations publisher wishes add web contents publius web publius client software publius client proxy executes following steps br diagram describing selection servers servers list hold encrypted contents hashed directory names publish operation done chosen server location formula_6 servers list holds following files directory named formula_7 retriever wishes browse web contents publius web publius client software publius client proxy executes following steps delete operation implemented invoking cgi script running servers server hash result formula_22 namely md5 hash result concatenation server domain name publisher password sent along corresponding formula_7 string compared one already stored password file directory formula_7 match file file removed directory update operation similarly uses hashed concatenation server domain name publisher password order authenticate original ownership hosted contents operation update done adding additional update file formula_7 contains new publius url matching updated contents recall publius url tied published contents share encryption key verified contents retrieved fact update operation equivalent publish operation addition adding update file old formula_7 directory redirecting future retrieve request new url retrieve operation issued old url publius proxy client redirected fetch new url done rest k -1 chosen servers k resulting urls match another set k servers chosen retrieval encrypted web contents publius protocol traceable publius urls following format formula_27 formula_28 concatenation hash results original contents combined key share described publish operation previous section options section url 16 bits represented two characters ascii string containing | [
225,
4490,
8627,
8628,
2485,
1501
] | Test |
10,589 | 5 | IL_(network_protocol):il network protocol internet link protocol il connection-based transport layer protocol designed bell labs originally part plan 9 operating system used carry 9p assigned internet protocol number 40 similar tcp much simpler main features fourth edition plan 9 2003 il deprecated favor tcp/ip n't handle long-distance connections well | [
10242,
3847,
649,
9868,
3218,
9365,
10005,
11413,
5402,
5531,
3742,
10271,
8610,
9380,
2085,
9381,
3751,
3752,
10924,
562,
2996,
9909,
10171,
4797,
5181,
3133,
3006,
5437,
7364,
2887,
8265,
2509,
4687,
5843,
2904,
5469,
5470,
5471,
5472,
... | None |
10,590 | 2 | RSX-11:rsx-11 rsx-11 discontinued family multi-user real-time operating systems pdp-11 computers created digital equipment corporation widespread use late 1970s early 1980s rsx-11 influential development later operating systems vms windows nt designed mainly used process control also popular program development rsx-11 began port pdp-11 architecture earlier rsx-15 operating system pdp-15 minicomputer first released 1971 main architect rsx-15 later renamed xvm/rsx dan brevick commenting rsx acronym brevik says porting effort first produced small paper tape based real-time executives rsx-11a rsx-11c later gained limited support disks rsx-11b rsx-11b evolved fully fledged rsx-11d disk-based operating system first appeared pdp-11/40 pdp-11/45 early 1973 project leader rsx-11d version 4 henry krejci rsx-11d completed digital set adapt small memory footprint giving birth rsx-11m first released 1973 1971 1976 rsx-11m project spearheaded noted operating system designer dave cutler first project principles first tried rsx-11m appear also later designs led cutler dec vms microsoft windows nt direction ron mclean derivative rsx-11m called rsx-20f developed run pdp-11/40 front-end processor kl10 pdp-10 cpu meanwhile rsx-11d saw developments direction garth wolfendale project leader 1972–1976 system redesigned saw first commercial release support 22-bit pdp-11/70 system added wolfendale originally uk also set team designed prototyped ias operating system uk ias variant rsx-11d suitable time sharing later development release ias led andy wilson digital uk facilities estimated release dates rsx-11 ias data taken printing date associated documentation general availability date expected come closely manuals different printing dates latest date used rsx-11s proper subset rsx-11m release dates always assumed corresponding version rsx-11m side rsx-11m plus enhanced version rsx-11m expected later corresponding version rsx-11m rsx-11 proprietary software copyright asserted binary files source code documentation alike entirely developed internally digital therefore part open source however copy kernel source comments removed present every rsx distribution used system generation process notable exception rule micro-rsx came pre-generated autoconfiguring binary kernel commented kernel source code available separate product already binary license reference purposes ownership rsx-11s rsx-11m rsx-11m plus micro/rsx transferred digital mentec inc. march 1994 part broader agreement mentec inc. us subsidiary mentec limited irish firm specializing pdp-11 hardware software support december 2006 mentec inc. acquired irish firm calyx sell pdp-11 related services goods new commercial licenses therefore legally unobtainable hobbyists run rsx-11m version 4.3 earlier rsx-11m plus version 3.0 earlier simh emulator thanks free license granted may 1998 mentec inc. legal ownership rsx-11a rsx-11b rsx-11c rsx-11d ias never changed hands therefore passed compaq acquired digital 1998 hewlett-packard 2002 late 2015 hewlett-packard split two separate companies hp inc. hewlett packard enterprise current owner firmly established new commercial licenses issued least since october 1979 rsx-11a rsx-11b rsx-11c 1990 ias one operating systems ever licensed hobbyist use 1968 soviet government decided manufacturing copies ibm mainframes dec minicomputers cooperation comecon countries practical pursuing original designs cloning dec designs began 1974 name sm-evm cyrillic см эвм см эвм acronym 'система малых электронно-вычислительных машин russian 'system small electronic computing machines happened es evm mainframes based system/360 architecture russians allies sometimes significantly modified western designs therefore every sm-evm machine compatible dec offerings time clone rsx-11m operating system ran romanian-made coral family computers coral 2030 clone pdp-11 rsx-11 often used general-purpose timeshare computing even though target market competing rsts/e operating system rsx-11 provided features ensure better maximum necessary response time peripheral device input i.e real-time processing original intended use features included ability lock process called task rsx memory part system boot assign process higher priority would execute processes lower priority order support large programs within pdp-11 relatively small virtual address space 64 kb sophisticated semi-automatic overlay system used given program overlay scheme produced rsx taskbuilder program called tkb overlay scheme especially complex taskbuilding could take rather long time hours days standard rsx prompt mcr monitor console routine commands shortened first three characters entered correspondingly commands unique first three characters login command hello executed user yet logged hello chosen login command first three characters hel relevant allows non-logged user execute help command run certain pdp-11 processors dec operating system displays characteristic light pattern processor console panel system idle patterns created idle task running lowest level rsx-11m light pattern two sets lights sweep outwards left right center console inwards ind indirect command file processor program currently running contrast ias light pattern single bar lights swept leftwards correspondingly jumbled light pattern reflecting memory fetches visible indication computer load idle task executed pdp-11 operating systems rsts/e distinctive patterns console lights | [
2560,
6155,
10257,
6675,
7187,
10776,
25,
8729,
4637,
9759,
9762,
4643,
6180,
7217,
6194,
10803,
10809,
6207,
576,
2625,
3650,
8262,
6221,
3160,
10333,
97,
11363,
5220,
1126,
1638,
6760,
10856,
9835,
7285,
4727,
9335,
11383,
634,
1147,
31... | Test |
10,591 | 0 | Parody_generator:parody generator parody generators computer programs generate text syntactically correct usually meaningless often style technical paper particular writer also called travesty generators random text generators purpose often satirical intending show little difference generated text real examples many work using techniques markov chains reprocess real text examples alternatively may hand-coded generated texts vary essay length paragraphs tweets term quote generator also used software randomly selects real quotations | [
6208,
2440,
5098,
1652,
5278
] | Test |
10,592 | 2 | Motd_(Unix):motd unix /etc/motd file unix-like systems contains message day used send common message users efficient manner sending e-mail message systems might also motd feature motd info segment multics contents file /etc/motd displayed unix login command successful login executes login shell newer unix-like systems may generate message dynamically host boots user logs motd also become common feature online component windows pc games half-life call duty battlefield similar feature called motd displayed logging irc servers | [
5435,
5492,
5397,
7325
] | Test |
10,593 | 9 | Parser_(CGI_language):parser cgi language parser free server-side cgi web scripting language developed art lebedev studio released gpl originally parser merely simple macro processing language latest 3rd revision march 2006 introduced object-oriented programming features compiler language developed c++ studio employees konstantin morshnev alexander petrosyan automate often repeated tasks especially maintenance already existing websites used many web projects studio since revision 3 released free software used websites mostly russia according partial list language website language supports technologies needed common web design tasks xml document object model dom perl compatible regular expressions pcre others | [
9345,
10506,
5612,
7983,
9780,
2485,
5399,
479
] | None |
10,594 | 4 | Rick_Francona:rick francona lieutenant colonel rick francona born 31 august 1951 author commentator media military analyst retired united states air force intelligence officer experience middle east including tours duty national security agency defense intelligence agency central intelligence agency contract nbc news appeared regularly nbc msnbc cnbc well radio canada media 2013 became military analyst cnn francona served 27 years u.s. air force middle east fluent arabic served region national security agency defense intelligence agency central intelligence agency bachelor degree chapman college chapman university government arabic language master degree troy state university international relations concentration middle east studies cousin current cleveland indians manager terry francona francona wife emily also retired air force intelligence officer reside port orford oregon francona enlisted united states air force 1970 served vietnamese linguist 1973 conducting combat aerial reconnaissance missions vietnam laos variety strategic tactical aircraft arabic language training served variety locations middle east 1975 1977 supported evacuation u.s. embassy beirut lebanon 1976 1978 became arabic language instructor defense language institute monterey california following commissioning 1979 francona instructor air force intelligence school denver colorado 1982 1984 middle east operations officer national security agency united states overseas 1984 assigned advisor royal jordanian air force amman jordan 1987 assigned defense intelligence agency assistant defense intelligence officer middle east assignment spent much 1987 1988 u.s. embassy baghdad iraq liaison officer iraqi armed forces directorate military intelligence francona worked observer iraqi combat operations iranian forces flew sorties iraqi air force observations key discovery iraqi chemical weapons capabilities ballistic missile modifications immediately following iraqi invasion kuwait august 1990 gulf war francona deployed gulf interpreter advisor iraqi armed forces commander chief u.s. central command general norman schwarzkopf jr. lead interpreter ceasefire talks iraqi military safwan iraq march 1991 end gulf war francona served office secretary defense principal author department defense report congress conduct gulf war 1992 selected first air attaché u.s. embassy damascus syria returning united states 1995 1995 1996 francona served central intelligence agency participated variety sensitive operations middle east one operations survived attempt life iraqi intelligence service agents later awarded cia bronze seal medallion service cia 1996 selected lead development joint services counterterrorism intelligence branch direct result success creating special task force asked lead special operations team supporting nato forces bosnia late 1997 returned united states retired active duty 1998 decorations include defense distinguished service medal defense superior service medal bronze star nine air medals well campaign awards service vietnam persian gulf balkans francona awarded central intelligence agency seal medallion service agency 2006 francona inducted defense language institute hall fame francona media analyst middle east political-military events formerly contract nbc news appeared regularly nbc nightly news today show msnbc hardball chris matthews scarborough country countdown keith olbermann others also writes articles msnbc council foreign relations blog middle east perspectives frequently speaks conventions public service audiences 2010 francona appeared subject matter expert iraqi military saddam hussein episode spike tv deadliest warrior 2013 began working military analyst cnn commenting syrian civil war chemical warfare issues 2014 deteriorating situation iraq april 2008 documents obtained new york times reporter david barstow revealed francona recruited one 75 retired military officers involved pentagon military analyst program participants appeared television radio news shows military analysts and/or penned newspaper op/ed columns program launched early 2002 then-assistant secretary defense public affairs victoria clarke idea recruit key influentials help sell wary public possible iraq invasion | [
7887
] | Validation |
10,595 | 3 | SPARCstation_LX:sparcstation lx sparcstation lx sun 4/30 workstation designed manufactured sold sun microsystems based sun4m architecture enclosed lunchbox chassis shares code name sunergy low-end range sparcclassic sparcclassic x sparcstation zx sparcstation zx sparcstation lx sun zx leo 24-bit color framebuffer sparcstation lx single 50 mhz microsparc processor three banks two dsimm slots official maximum configuration uses 16mb modules first bank also hold 32mb modules giving maximum 128mb memory hold one internal 50-pin single ended fast-narrow scsi drive floppy drive also supports external scsi devices ide/atapi support comes on-board amd lance ethernet chipset providing 10baset networking standard 10base2 10base5 via aui transceiver openboot rom able boot network using rarp tftp like sparcstation systems ssc holds system information mac address serial number nvram battery chip dies system able boot possible set mac address manually boot sparcstation lx accelerated cg6 framebuffer compared sparcclassic cg3 lx also features 16-bit audio opposed 8-bit audio sparcclassic motherboards two systems otherwise similar use chassis following operating systems run sparcstation lx | [
9665,
9955,
10436,
878,
11440,
823
] | Test |
10,596 | 6 | AdvFS:advfs advfs also known tru64 unix advanced file system file system developed late 1980s mid-1990s digital equipment corporation osf/1 version unix operating system later digital unix/tru64 unix june 2008 released free software gnu gplv2 license advfs used high-availability systems fast recovery downtime essential advfs uses relatively advanced concept storage pool called file domain logical file systems called file sets file domain composed number block devices could partitions lvm lsm devices file set logical file system created single file domain administrators add remove volumes active file domain providing enough space remaining file domain case removal one trickier original features implement data metadata residing disk removed first migrated online disks prior removal file sets balanced meaning file content file sets balanced across physical volumes particular files file set striped across available volumes administrators take snapshot clone active inactive file set allows easy on-line backups another feature allows administrators add remove block devices file domain file domain active users add/remove feature allows migration larger devices migration potentially failing hardware without system shutdown features include linux advfs supports additional ‘ ’ syncv ’ ’ system call atomically commit changes multiple files advfs also known tru64 unix advanced file system developed digital equipment corporation engineers late 1980s mid-1990s bellevue wa decwest previously worked earlier cancelled mica ozix projects first delivered dec osf/1 system later digital unix/tru64 unix time development moved teams located bellevue wa nashua nh versions always one version number behind operating system version thus dec osf/1 v3.2 advfs v2.x digital unix 4.0 advfs v3.x tru64 unix 5.x advfs v4.x generally considered advfs v4 matured production level stability sufficient set tools get administrators kind trouble original team enough confidence log based recovery release without fsck style recovery utility assumption file system journal would always allocated mirrored drives 1996 lee thekkath described use advfs top novel disk virtualisation layer known petal later paper thekkath et al describe file system frangapani built top petal compare performance advfs running storage layer shapiro miller compared performance files stored advfs oracle rdbms version 7.3.4 blob storage compaq sierra parallel file system pfs created cluster file system based multiple local advfs filesystems testing carried lawrence livermore national laboratory llnl 2000–2001 found underlying advfs filesystem adequate performance albeit high cpu utilisation pfs clustering layer top performed poorly june 23 2008 source code released hewlett-packard gnu general public license version 2 instead recently released gplv3 sourceforge order compatible also gplv2 licensed linux kernel license | [
5120,
2564,
6669,
3598,
10257,
9236,
6677,
5142,
8214,
3611,
9249,
9762,
5158,
7225,
11323,
8772,
1109,
2135,
4708,
9836,
7789,
9333,
6263,
9335,
9343,
7818,
654,
2193,
2194,
2197,
2199,
11419,
6309,
1190,
5286,
10405,
5293,
7344,
2230,
5... | None |
10,597 | 7 | Univa_Grid_Engine:univa grid engine univa grid engine batch-queuing system forked sun grid engine sge software schedules resources data center applies policy management tools product deployed run on-premises using cloud computing hybrid cloud environment roots grid engine commercial product date back 1993 names codine later variation product grd comprehensive genealogy product described sun grid engine grid engine first distributed genias software 1999 company merger gridware inc 2000 sun microsystems acquired gridware sun renamed codine/grd sun grid engine later year released open-source 2001 2010 oracle corporation acquired sun thus renamed sge oracle grid engine oracle grid engine 6.2u6 source code included binaries changes put back project source repository response grid engine community started open grid scheduler son grid engine projects continue develop maintain free implementation grid engine january 18 2011 univa announced hired principal engineers sun grid engine team univa grid engine development led cto fritz ferstl founded grid engine project ran business within sun/oracle past 10 years october 22 2013 univa announced acquired oracle grid engine assets intellectual property making sole commercial provider grid engine software june 24 2018 univa announced massive scalability operating single cluster 1 million cores aws univa grid engine 8.0 first version released april 12 2011 forked sge 6.2u5 last open source release adds improved third party application integration license policy management enhanced support software hardware platforms cloud management tools univa grid engine 8.0.1 released october 4 2011 adds improved support multi-core hardware integration nvidia gpus new job submission verifier extensions additional bug fixes univa grid engine 8.1.0 announced may 2 updated latest release level 8.1.3 nov 15 2012 8.1.x releases deliver important new functionality job classes postgres spooling resource maps fair urgency deterministic wildcard pe selection improved diagnostics pre-configured mpi integations improved apache hadoop integration well many bug fixes performance improvements univa grid engine 8.1.6 announced oct 14 2013 update include improvements grid engine scheduler larger clusters qmaster stability improvements spooling qalter commands univa grid engine 8.2.0 released sept 02 2014 new univa grid engine version 8.2 includes native windows support univa grid engine 8.3.0 released june 22 2015 new preemption feature univa grid engine 8.3.0 allows users set priorities different work higher priority application must use resources currently allocated lower priority application lower priority application effectively “ paused ” —not lost—and work automatically resume higher priority application completed among handful new features added grid engine 8.3.0 improve overall reliability efficiency cluster new run time modification resources feature run time modification resources feature means much efficient use cluster resources univa grid engine 8.3.1 released august 28 2015 release contained new features univa grid engine 8.3.0 additional fixes enhancements identified since release 8.3.0 univa grid engine 8.4.0 released may 31 2016 release supports docker containers automatically dispatch run jobs user specified docker image univa grid engine 8.5.0 released march 7 2017 release univa grid engine 2x faster open source grid engine 6.2u5 grid engine 8.5.0 also includes significant improvement docker support including mobility gpu apps within cluster 8.6.0 released july 17 2018 univa grid engine supports nvidia docker 2.0 new univa grid engine docker integration allows flexibility running docker containers univa grid engine environment univa grid engine 8.6.1 released august 8 2018 providing improved control gpu devices new affinity features allowing jobs gravitate towards away certain compute nodes 8.6.2 released august 16 2018 univa grid engine performance scalability improved several key areas network communications job submission memory allocation scheduler optimizations update also improved univa grid engine job dispatch information 8.6.3 released september 27 2018 new update provided bulk configuration changes univa grid engine hosts new bulk configuration commands perform operations many hosts simultaneously makes easier manage large univa grid engine cluster 8.6.4 released november 23 2018 providing new core binding strategies make easier distribute nodes cores jobs also providing flexibility new affinity-based job placement policy included update jobs submitted using affinity either packed close together “ positive affinity ” “ negative affinity ” across cluster based resources requested new univa grid engine resource maps control access host devices nvidia gpus allows jobs request gpus gpu exclusively assigned job univa grid engine also directly communicates nvidia data center gpu manager collect gpu metrics scheduling accounting univa grid engine 8.6.5 released may 6 2019 new key features 8.6.7 released august 5 2019 among numerous enhancements univa grid engine 8.6.7 offers red hat linux 8 support nvidia gpu dcgm job usage | [
9665,
4194,
9602,
5956,
8702,
330,
1995,
5612,
3055,
7248,
7983,
2710,
3449,
2910
] | None |
10,598 | 4 | DollarRevenue:dollarrevenue dollarrevenue adware program made company name displays advertisements infected pc installs ucmore toolbar track internet searches usually comes bundled another program december 2007 dutch government agency opta fined two unnamed individuals three companies eur 1 million infecting 22 million computers worldwide june 2013 dutch corporate appeals court cbb overturned around eur 1 million worth fines imposed opta dollarrevenue cbb said opta adequately establish happened infected pcs | [
7515,
877
] | Test |
10,599 | 2 | Series_80_(software_platform):series 80 software platform series 80 formerly crystal short-lived mobile software platform enterprise professional level smartphones made nokia introduced 2000 uses symbian os common physical properties symbian os user interface type screen resolution 640×200 pixels full qwerty keyboard series 80 used large size communicator screens best effect needed separate development relatively small market nokia 9300i announced 2005 final series 80 device nokia use series 80 platform final communicator nokia e90 | [
1537,
10754,
11271,
529,
3089,
10770,
5143,
2072,
5659,
4132,
40,
3626,
9262,
7727,
10802,
7220,
5175,
9784,
1083,
9292,
7246,
1615,
5201,
7253,
3162,
5211,
6748,
607,
1633,
2658,
6763,
109,
8316,
8829,
11391,
6276,
3205,
9359,
1687,
1039... | None |
10,600 | 4 | Federal_Office_for_Information_Security:federal office information security federal office information security abbreviated bsi german upper-level federal agency charge managing computer communication security german government areas expertise responsibility include security computer applications critical infrastructure protection internet security cryptography counter eavesdropping certification security products accreditation security test laboratories located bonn 600 employees current president since 1 february 2016 former business executive arne schönbohm took presidency michael hange bsi predecessor cryptographic department germany foreign intelligence agency bnd bsi still designs cryptographic algorithms libelle cipher initiated development gpg4win cryptographic suite bsi similar role unlike organizations bsi focused it-security rather part organisation general it-standards remit bsi separate germany signals intelligence part military foreign intelligence service bnd december 2018 arne schönbohm stated bsi yet seen evidence chinese telecommunications company huawei used equipment conduct espionage behalf china | [
9375,
5693,
3941,
8904,
5353,
11368,
880,
11088,
4083,
5373,
4379,
10303,
4957,
2558,
383
] | Validation |
10,601 | 3 | BogoMips:bogomips bogomips bogus mips unscientific measurement cpu speed made linux kernel boots calibrate internal busy-loop often-quoted definition term number million times per second processor absolutely nothing bogomips value used verify whether processor question proper range similar processors i.e bogomips represents processor clock frequency well potentially present cpu cache usable performance comparisons among different cpus 1993 lars wirzenius posted usenet message explaining reasons introduction linux kernel comp.os.linux approximate guide bogomips pre-calculated following table given rating typical cpu current applicable linux version index ratio bogomips per clock speed cpu intel 386dx cpu comparison purposes source complete list refer bogomips mini-howto 2.2.14 linux kernel caching setting cpu state moved behind bogomips calculation although bogomips algorithm n't changed kernel onward bogomips rating current pentium cpus twice rating change changed bogomips outcome effect real processor performance linux command visualization bogomips cat /proc/cpuinfo kernel 2.6.x bogomips implemented codice_1 kernel source file computes linux kernel timing parameter codice_2 see jiffy value explanation source code codice_2 used implement codice_4 delay microseconds codice_5 delay nanoseconds functions functions needed drivers wait hardware note busy waiting technique used kernel effectively blocked executing codice_5/codice_4 functions i386 architecture codice_8 implemented codice_9 equivalent following assembler code rewritten c-pseudocode full complete information details bogomips hundreds reference entries found outdated bogomips mini-howto 2012 arm contributed new codice_4 implementation allowing system timer built many armv7 cpus used instead busy-wait loop implementation released version 3.6 linux kernel timer-based delays robust systems use frequency scaling dynamically adjust processor speed runtime codice_11 values may necessarily scale linearly also since timer frequency known advance calibration needed boot time one side effect change bogomips value reflect timer frequency cpu core frequency typically timer frequency much lower processor maximum frequency users may surprised see unusually low bogomips value comparing systems use traditional busy-wait loops | [
7299,
3462,
6151,
7302,
7305,
8711,
7313,
5523,
2070,
3350,
7836,
2081,
10658,
3882,
3883,
10548,
1461,
823,
1849,
6352,
10966,
4569,
9964,
1005,
3565,
10734,
1776,
4465,
499,
1911,
3323,
8700,
1399
] | Test |
10,602 | 8 | Topsy_Labs:topsy labs topsy labs social search analytics company based san francisco california company certified twitter partner maintained comprehensive index tweets numbering hundreds billions dating back twitter inception 2006 topsy made products search analyze draw insights conversations trends public social websites including twitter google+ company acquired apple inc. december 2013 shut december 16 2015 topsy founded 2007 vipul ved prakash rishab aiyer ghosh gary iwatani justin foutts company raised usd 27 million venture capital bluerun ventures ignition partners founders fund scott banister investors company 40 employees offices san francisco washington dc operating data centers december 2013 topsy acquired apple inc. reported value around 225 million december 16 2015 topsy service shut website redirected apple support page discussing search functionality ios 9 topsy.com real-time search engine social posts socially shared content primarily twitter google plus service ranked results using proprietary social influence algorithm measured social media authors much others supported saying service also provided access metrics term mentioned twitter via free analytic service analytics.topsy.com users could compare three terms content past hour day week month announced september 2013 topsy would include every public tweet ever published twitter search analysis topsy pro analytics commercial web dashboard application allowed users conduct interactive analysis keywords authors activity influence exposure sentiment language geography users could discover relevant tweets links photos videos term topsy ’ index hundreds billions tweets users able group terms saved topics setup customized alerts daily activity digests topsy pro analytics version topsy pro analytics product government agencies intended purpose product facilitate disaster response quantify political issues detect disease outbreak monitor global anomalies topsy provided set rest apis programmatically access twitter data metrics users could also access data via ad-hoc report requests index co-developed twitter topsy debuted august 2012 originally compared social sentiment two primary american presidential candidates index also co-developed twitter topsy debuted january 2013 originally compared social sentiment films nominated academy awards six categories best picture best actor best actress best supporting actor best supporting actress best director topsy sentiment analysis used index correctly predicted five six award recipients march 2013 mashable topsy co-produced mashable sxsw trendspotter mobile-enabled website visitors could see trending sxsw event based real-time analysis twitter conversations sxsw trendspotter provided analysis | [
10755,
9732,
1549,
7697,
11289,
6186,
6700,
1074,
9784,
8253,
576,
8783,
4180,
10838,
9826,
5733,
8806,
3691,
2676,
6264,
7806,
2686,
6783,
10878,
8842,
5784,
1177,
4251,
2207,
11430,
171,
2735,
3248,
4283,
7869,
7359,
9922,
713,
3790,
73... | Validation |
10,603 | 3 | Modified_Harvard_architecture:modified harvard architecture modified harvard architecture variation harvard computer architecture unlike pure harvard architecture allows contents instruction memory accessed data modern computers documented harvard architecture fact modified harvard architecture original harvard architecture computer harvard mark employed entirely separate memory systems store instructions data cpu fetched next instruction loaded stored data simultaneously independently contrast von neumann architecture computer instructions data stored memory system without complexity cpu cache must accessed turn physical separation instruction data memory sometimes held distinguishing feature modern harvard architecture computers microcontrollers entire computer systems integrated onto single chips use different memory technologies instructions e.g flash memory data typically read/write memory von neumann machines becoming popular true distinction harvard machine instruction data memory occupy different address spaces words memory address uniquely identify storage location von neumann machine also necessary know memory space instruction data address belongs computer von neumann architecture advantage pure harvard machines code also accessed treated data vice versa allows example data read disk storage memory executed code self-optimizing software systems using technologies just-in-time compilation write machine code memory later execute another example self-modifying code allows program modify disadvantage methods issues executable space protection increase risks malware software defects addition systems notoriously difficult document code flow also make debugging much difficult accordingly pure harvard machines specialty products modern computers instead implement modified harvard architecture modifications various ways loosen strict separation code data still supporting higher performance concurrent data instruction access harvard architecture common modification builds memory hierarchy cpu cache separating instructions data unifies except small portions data instruction address spaces providing von neumann model programmers never need aware fact processor core implements modified harvard architecture although benefit speed advantages programmers write instructions data memory need aware issues cache coherency another change preserves separate address space nature harvard machine provides special machine operations access contents instruction memory data data directly executable instructions machines always viewed modified harvard architecture harvard architecture processors maxq execute instructions fetched memory segment – unlike original harvard processor execute instructions fetched program memory segment processors like harvard architecture processors – unlike pure von neumann architecture – read instruction read data value simultaneously 're separate memory segments since processor least two separate memory segments independent data buses obvious programmer-visible difference kind modified harvard architecture pure von neumann architecture – executing instruction one memory segment – memory segment simultaneously accessed data three characteristics may used distinguish modified harvard machines pure harvard von neumann machines pure harvard machines address zero instruction space refers instruction storage location separate address zero data space refers distinct data storage location contrast von neumann split-cache modified harvard machines store instructions data single address space address zero refers one location whether binary pattern location interpreted instruction data defined program written however like pure harvard machines instruction-memory-as-data modified harvard machines separate address spaces separate addresses zero instruction data space therefore distinguish type modified harvard machines pure harvard machines point pure modified harvard machines co-exist flexible general von neumann architecture separate memory pathways cpu allow instructions fetched data accessed time improving throughput pure harvard machines separate pathways separate address spaces split-cache modified harvard machines separate access paths cpu caches tightly coupled memories unified address space covers rest memory hierarchy von neumann processor unified address space programmer point view modified harvard processor instruction data memories share address space usually treated von neumann machine cache coherency becomes issue self-modifying code program loading confusing issues usually visible systems programmers integrators modified harvard machines like pure harvard machines regard original harvard machine mark stored instructions punched paper tape data electro-mechanical counters however entirely due limitations technology available time today harvard machine pic microcontroller might use 12-bit wide flash memory instructions 8-bit wide sram data contrast von neumann microcontroller arm7tdmi modified harvard arm9 core necessarily provides uniform access flash memory sram 8 bit bytes cases outside applications cacheless dsp microcontroller required modern processors cpu cache partitions instruction data also processors harvard machines rigorous definition program data memory occupy different address spaces modified weak sense operations read and/or write program memory data example lpm load program memory spm store program memory instructions atmel avr implement modification similar solutions found microcontrollers pic z8encore many families digital signal processors ti c55x cores instruction execution still restricted program address space processors unlike von neumann machines separate address spaces creates certain difficulties programming high-level languages directly support notion tables read-only data might different address space normal writable data thus need read using different instructions c programming language support multiple address spaces either non-standard extensions standardized extensions support embedded processors | [
7173,
9739,
2066,
7699,
5655,
10779,
10781,
6181,
8231,
2605,
3630,
6705,
7218,
8761,
2623,
2113,
7234,
3142,
2638,
1122,
3175,
8815,
630,
8822,
6268,
3197,
7313,
6815,
8352,
5793,
6818,
6821,
682,
7852,
9391,
2224,
2226,
7858,
9911,
8890... | None |
10,604 | 8 | Web_counter:web counter web counter hit counter computer software program indicates number visitors hits particular webpage received set counters incremented one every time web page accessed web browser number usually displayed inline digital image plain text image rendering digits may use variety fonts styles classic example wheels odometer counter often accompanied date set last reset without becomes impossible estimate within time number page loads counted occurred web counters simply web bugs used webmasters track hits included visible on-page elements counters popular 1990s later replaced web traffic measures self-hosted scripts like analog later remote systems used javascript like google analytics systems typically include on-page elements displaying count thus seeing web counter modern web page one example retrocomputing internet one seo spamming technique companies pay site listed html code free hit counter thus user puts page small link appear bottom quick way sites accumulate inbound links often performed sites competitive web fields like online gambling 2008 google removed number high-ranking mesothelioma sites using counters top results | [
6273,
3462,
2312,
3401,
3688,
6576,
5524,
4917,
4797,
8639
] | Test |
10,605 | 3 | Pumpkin_Adventure_III:_The_Hunt_for_the_Unknown:pumpkin adventure iii hunt unknown pumpkin adventure iii hunt unknown video game msx created umax released 1995 sunrise foundation role-playing game turn-based fighting system los angeles attack strange creatures nobody knows creatures sent last hope l.a. government sets special police team s.o.d.o.m even s.o.d.o.m able stop threat last resort brilliant professor steinein uses time machine find brave people history people steve damien bishop stopped lucifer taking world pumpkin adventure 2 three together s.o.d.o.m member jeff tates start quest find source creatures destroy | [
10931,
9006
] | Test |
10,606 | 3 | Gdium:gdium gdium subnotebook netbook computer produced emtec gdium product distinguished unique loongson mips processor use usb key primary storage device gdium netbook marketed interface device gdium learning community —a website provides hardware support mips builds open-source software linux computing tips educational resources targeted towards teachers students within k-12 demographic emtec gdium liberty 1000 built stmicroelectronics loongson 2f mips microprocessor uses proprietary form-factored usb key called g-key primary storage medium g-key fits specially designed usb slot recessed within unit available 8gb 16gb capacities key generates noise less susceptible mechanical shock damage hard drives also includes sd card reader provides support mmc sd sdhc cards supplemental storage gdium uses mandriva sole operating system boots approximately 30 seconds desktop uses metacity window manager lxplanel idesk-based interface like modern linux distributions open-source software applications openoffice.org mozilla firefox thunderbird gimp included default installation compilations microsoft windows os x ubuntu available mips architecture e.g debian offers packages compiled mips emtec gdium liberty 1000 specifications follows website went around sept 2013 unsure community still alive elsewhere | [
1537,
3585,
7938,
2308,
6797,
11405,
1682,
405,
11418,
5019,
1952,
6178,
7983,
5681,
9266,
823,
1849,
1728,
7234,
10820,
11337,
10192,
5339,
2784,
3300,
2285,
2420,
9851,
10109
] | None |
10,607 | 9 | Inductive_data_type:inductive data type inductive data type may refer | [] | Train |
10,608 | 2 | IPad_Air:ipad air ipad air first-generation ipad air tablet computer designed developed marketed apple inc announced october 22 2013 released november 1 2013 ipad air features thinner design similarities contemporaneous ipad mini 2 64-bit apple a7 processor m7 coprocessor discontinued launch 9.7 inch ipad pro march 21 2016 successor ipad air 2 announced october 16 2014 sold discontinuation march 21 2017 ipad air name brought back announcement third-generation ipad air march 18 2019 june 3 2019 apple announced ipados supporting ipad air first generation stay ios 12 ipad air announced keynote yerba buena center arts october 22 2013 keynote named 'we still lot cover ipad air came ios 7 operating system released september 18 2013 jonathan ive designer ios 7 new elements described update bringing order complexity highlighting features refined typography new icons translucency layering physics gyroscope-driven parallaxing major changes design design ios 7 os x mavericks version 10.9 noticeably depart skeuomorphic elements green felt game center wood newsstand leather calendar favor flat colourful design act hotspot carriers sharing internet connection wi-fi bluetooth usb also access apple app store digital application distribution platform ios service allows users browse download applications itunes store developed xcode ios sdk published apple app store garageband imovie iphoto iwork apps pages keynote numbers available ipad air comes several applications including siri safari mail photos video music itunes app store maps notes calendar game center photo booth contacts like ios devices ipad sync content data mac pc using itunes although ios 5 later managed backed without computer although tablet designed make phone calls cellular network users use headset built-in speakers microphone place phone calls wi-fi cellular using voip application skype device dictation application using voice recognition technology iphone 4s enables users speak ipad types say screen though ipad must internet connection via wi-fi cellular network speech processed apple servers apple also began giving away popular ilife iphoto imovie garageband iwork pages keynote numbers apps device june 8 2015 announced wwdc ipad air would support ios 9 new features released q3 2015 air users ios 9 able take advantage two features called slide picture picture slide allows user slide second app side screen smaller window display information alongside initial app picture picture allows user watch video small resizable moveable window remaining another app another feature dubbed split view allows user run two apps simultaneously 50/50 view supported air instead run ipad air 2 announced wwdc 2016 ipad air along various ios devices support ios 10 announced wwdc 2017 ipad air support latest version ios ios 11 dropping support immediate predecessor 4th generation ipad apple announced ipad air together apple a7 powered devices support ios 12 update making ipad air one longest supported ios device support six major versions ios ios 7 way ios 12 june 2019 apple announced drop support ipad air release ipados ipad air marks first major design change ipad since ipad 2 thinner design 7.5 millimeters thick smaller screen bezel similar ipad mini apple reduced overall volume ipad air using thinner components resulting 22 reduction weight ipad 2 though still uses 9.7-inch retina display previous ipad model improved front-facing camera makes using facetime much clearer new front-facing camera capable video 720p hd includes face detection backside illumination rear camera received upgrade well called isight camera addition functions front camera also contains 5mp cmos hybrid ir filter fixed ƒ/2.4 aperture device available space gray silver colors previous generations apple continued use recyclable materials enclosure ipad air milled solid block aluminum making 100 recyclable ipad air also free harmful materials bfrs pvc although air inherits hardware components iphone 5s 64-bit apple a7 system-on-chip apple m7 motion processor uses home button built previous ipad models therefore support touch id fingerprint sensor a7 present ipad air slightly different however use pop design stacks ram top soc also features metal heat spreader compensate slightly faster clock speed better thermal management air also includes 5 megapixel rear-facing camera isight facetime hd front-facing camera support 802.11n estimated 10 hours battery life boots faster previous ipad model previous generations iphone ipad hardware four buttons one switch ipad air device portrait orientation home button face device display returns user home screen wake/sleep button top edge device two buttons upper right side device performing volume up/down functions switch whose function varies according device settings functioning either switch device silent mode lock/unlock orientation screen addition wifi version weighs 469 grams cellular model weighs 478 grams – 25 lighter respective predecessors display responds sensors ambient light sensor adjust screen brightness 3-axis accelerometer sense orientation switch portrait landscape modes unlike iphone ipod touch built-in applications work three orientations portrait landscape-left landscape-right ipad built-in applications support screen rotation four orientations including upside-down consequently device intrinsic native orientation relative position home button changes ipad air available 16 32 64 128 gb internal flash memory expansion option apple also sells camera connection kit sd card reader used transfer photos videos announcement ipad pro 9.7-inch march 21 2016 ipad air discontinued models connect wireless lan offer dual band wi-fi support tablet also manufactured either without capability communicate cellular network ipad air ipad mini 2 cellular model comes two variants support nano-sims quad-band gsm penta-band umts dual-band cdma ev-do rev b. additionally one variant also supports lte bands 1-5 7 8 13 17-20 25 26 variant supports lte bands 1-3 5 7 8 18-20 td-lte bands 38 39 40 apple ability handle many different bands one device allowed offer first time single ipad variant supports cellular bands technologies deployed major north american wireless providers time device introduction audio playback ipad air stereo two speakers located either side lightning connector ipad air received mainly positive reviews writing anandtech anand lal shimpi writes ipad air feels like true successor ipad 4 praising reduced weight size shimpi states air hits balance features design ergonomics n't think 've ever seen ipad uk editor-in-chief techradar patrick goss gave ipad air positive review giving praise a7 chip camera upgrades well crisp colorful display concludes stating hard put words much apple improved ipad offering stunning level detail power build quality unrivalled christina bonnington wired awarded air rating 8 10 calling performance outstanding noting high-definition video streams gaming animations smooth stutter free also praised loading speeds safari web browser bonnington criticized speakers slightly muddled apple inc. co-founder steve wozniak criticized focus decreasing size weight rather increasing storage space stated want ipad air fit personal needs dave smith international business times wrote two less positive reviews air arguing device nice bring anything new ipad smith strongly criticized lack touch id noted updates increased speed decreased size weight slight improvements launch date ipad air see large turnout usual apple products however expected analysts due delayed release ipad mini 2 air sold hong kong two hours becoming available online | [
10755,
9732,
1549,
5647,
7697,
4114,
6165,
11289,
7706,
8222,
1057,
6183,
1576,
6186,
4139,
6700,
7211,
1074,
8754,
9784,
8253,
576,
1090,
8783,
4180,
10838,
1623,
3672,
10840,
9312,
3681,
9826,
5733,
8806,
3691,
2673,
6258,
2676,
10357,
... | Validation |
10,609 | 1 | MyAnimeList:myanimelist myanimelist often abbreviated mal anime manga social networking social cataloging application website site provides users list-like system organize score anime manga facilitates finding users share similar tastes provides large database anime manga site claims 4.4 million anime 775,000 manga entries 2015 site received 120 million visitors month site launched april 2006 garrett gyssler maintained solely 2008 originally website called animelist garret gyssler decided incorporate possessive beginning following fashion important social network years myspace august 4 2008 craveonline men entertainment lifestyle site owned atomiconline purchased myanimelist undisclosed sum money 2015 dena announced purchased myanimelist craveonline would partner anime consortium japan stream anime service via daisuki myanimelist announced april 2016 embed episodes crunchyroll hulu directly onto site 20,000 episodes made available site april 2017 myanimelist added king avatar first chinese animation site database march 8 2018 myanimelist opened online manga store partnership kodansha comics viz media allowing users purchase manga digitally website service originally launched canada later expanded united states united kingdom several english-speaking countries mal became inaccessible several days may june 2018 site staff took offline maintenance citing security privacy concerns site operators also disabled api third-party apps rendering unusable moves done efforts conform european union gdpr program myanimelist acquired media january 2019 purchase announced intention focus marketing e-book sales strengthen site myanimelist lists anime japanese animation aeni korean animation donghua chinese animation similarly myanimelist information manga japanese comics manwha korean comics manhua chinese comics well dōjinshi fan comics light novels users create lists strive complete users submit reviews write recommendations blogs post site forum create clubs unite people similar interests subscribe rss news feed anime manga related news mal also starts challenges users complete 'lists myanimelist allows users score anime manga list scale 1 10 scores aggregated give show database rank best worst show rank calculated twice day using following formula formula_1 formula_2 stands total number user votes formula_3 average user score formula_4 minimum number votes required get calculated score currently 50 formula_5 average score across entire anime/manga database scores user completed least 20 anime/manga calculated | [
2156,
8204,
735
] | Test |
10,610 | 0 | Treebank:treebank linguistics treebank parsed text corpus annotates syntactic semantic sentence structure construction parsed corpora early 1990s revolutionized computational linguistics benefitted large-scale empirical data exploitation treebank data important ever since first large-scale treebank penn treebank published however although originating computational linguistics value treebanks becoming widely appreciated linguistics research whole example annotated treebank data crucial syntactic research test linguistic theories sentence structure large quantities naturally occurring examples term treebank coined linguist geoffrey leech 1980s analogy repositories seedbank bloodbank syntactic semantic structure commonly represented compositionally tree structure term parsed corpus often used interchangeably term treebank emphasis primacy sentences rather trees treebanks often created top corpus already annotated part-of-speech tags turn treebanks sometimes enhanced semantic linguistic information treebanks created completely manually linguists annotate sentence syntactic structure semi-automatically parser assigns syntactic structure linguists check necessary correct practice fully checking completing parsing natural language corpora labour-intensive project take teams graduate linguists several years level annotation detail breadth linguistic sample determine difficulty task length time required build treebank treebanks follow specific linguistic theory syntactic annotation e.g bultreebank follows hpsg try less theory-specific however two main groups distinguished treebanks annotate phrase structure example penn treebank ice-gb annotate dependency structure example prague dependency treebank quranic arabic dependency treebank important clarify distinction formal representation file format used store annotated data treebanks necessarily constructed according particular grammar grammar may implemented different file formats example syntactic analysis john loves mary shown figure right may represented simple labelled brackets text file like following penn treebank notation type representation popular light resources tree structure relatively easy read without software tools however corpora become increasingly complex file formats may preferred alternatives include treebank-specific xml schemes numbered indentation various types standoff notation computational perspective treebanks used engineer state-of-the-art natural language processing systems part-of-speech taggers parsers semantic analyzers machine translation systems computational systems utilize gold-standard treebank data however automatically parsed corpus corrected human linguists still useful provide evidence rule frequency parser parser may improved applying large amounts text gathering rule frequencies however obvious process correcting completing corpus hand possible identify rules absent parser knowledge base addition frequencies likely accurate corpus linguistics treebanks used study syntactic phenomena example diachronic corpora used study time course syntactic change parsed corpus contain frequency evidence showing common different grammatical structures use treebanks also provide evidence coverage support discovery new unanticipated grammatical phenomena another use treebanks theoretical linguistics psycholinguistics interaction evidence completed treebank help linguists carry experiments decision use one grammatical construction tends influence decision form others try understand speakers writers make decisions form sentences interaction research particularly fruitful layers annotation e.g semantic pragmatic added corpus possible evaluate impact non-syntactic phenomena grammatical choices semantic treebank collection natural language sentences annotated meaning representation resources use formal representation sentence semantic structure semantic treebanks vary depth semantic representation notable example deep semantic annotation groningen meaning bank developed university groningen annotated using discourse representation theory example shallow semantic treebank propbank provides annotation verbal propositions arguments without attempting represent every word corpus logical form deep syntax treebank treebank lying interface syntax semantics representation structure interpreted graph representing subject infinitival phrases extraction it-clef construction shared subject ellipsis extend many syntactic treebanks developed wide variety languages facilitate researches multilingual tasks researchers discussed universal annotation scheme cross-languages way people try utilize merge advantages different treebanks corpora instance universal annotation approach dependency treebanks universal annotation approach phrase structure treebanks one key ways extract evidence treebank search tools search tools parsed corpora typically depend annotation scheme applied corpus user interfaces range sophistication expression-based query systems aimed computer programmers full exploration environments aimed general linguists wallis 2008 discusses principles searching treebanks detail reviews state art | [
1890,
5667,
4070,
5478,
5639,
3721,
10,
8297,
7599,
5399,
3608,
8218,
479
] | Validation |
10,611 | 8 | CERN_httpd:cern httpd cern httpd later also known w3c httpd early discontinued web server http daemon originally developed cern 1990 onwards tim berners-lee ari luotonen henrik frystyk nielsen implemented c first ever web server software cern httpd originally developed next computer running nextstep later ported unix-like operating systems openvms systems unix emulation layers e.g os/2 emx+gcc could also configured web proxy server version 0.1 released june 1991 august 1991 berners-lee announced usenet newsgroup alt.hypertext availability source code server daemon world wide web software cern ftp site server presented hypertext 91 conference san antonio part cern program library cernlib later versions server based libwww library development cern httpd later taken world wide web consortium w3c last release version 3.0a 15 july 1996 1996 onwards w3c focused development java-based jigsaw server initial version public domain software last one mit license | [
1920,
11650,
4485,
7430,
7943,
8070,
9229,
7567,
7695,
1937,
5907,
7443,
5397,
8350,
7455,
4768,
7457,
3746,
8994,
2596,
3237,
9125,
6775,
10791,
11682,
7338,
9387,
44,
5677,
7983,
10800,
11439,
2485,
6714,
10622,
7364,
11386,
1991,
11134,
... | Test |
10,612 | 3 | Barrel_processor:barrel processor barrel processor cpu switches threads execution every cycle cpu design technique also known interleaved fine-grained temporal multithreading unlike simultaneous multithreading modern superscalar architectures generally allow execution multiple instructions one cycle like preemptive multitasking thread execution assigned program counter hardware registers thread architectural state barrel processor guarantee thread execute one instruction every n cycles unlike preemptive multitasking machine typically runs one thread execution tens millions cycles threads wait turn technique called c-slowing automatically generate corresponding barrel processor design single-tasking processor design n -way barrel processor generated way acts much like n separate multiprocessing copies original single-tasking processor one running roughly 1/ n original speed one earliest examples barrel processor i/o processing system cdc 6000 series supercomputers executed one instruction portion instruction 10 different virtual processors called peripheral processors returning first processor one motivation barrel processors reduce hardware costs case cdc 6x00 ppus digital logic processor much faster core memory rather ten separate processors ten separate core memory units ppus share single set processor logic another example honeywell 800 8 groups registers allowing 8 concurrent programs instruction processor would cases switch next active program sequence barrel processors also used large-scale central processors tera mta 1988 large-scale barrel processor design 128 threads per core mta architecture seen continued development successive products cray urika-gd originally introduced 2012 yarcdata urika targeted data-mining applications barrel processors also found embedded systems particularly useful deterministic real-time thread performance example xmos xcore xs1 2007 four-stage barrel processor eight threads per core xs1 found ethernet usb audio control devices applications i/o performance critical barrel processors also used specialized devices eight-thread ubicom ip3023 network i/o processor 2004 8-bit microcontrollers padauk technology feature barrel processors 8 threads per core single-tasking processor spends lot time idle anything useful whenever cache miss pipeline stall occurs advantages employing barrel processors single-tasking processors include disadvantages barrel processors | [
7173,
9739,
7699,
5655,
10781,
8231,
7218,
2623,
2113,
7234,
3142,
2638,
1122,
3175,
2155,
8815,
630,
8822,
7313,
6815,
8352,
5793,
6818,
8863,
6821,
7852,
9391,
2226,
7858,
9911,
8890,
4286,
2241,
2243,
5329,
10966,
731,
7911,
10985,
996... | Test |
10,613 | 4 | Norton_Power_Eraser:norton power eraser norton power eraser npe small portable executable uses norton insight in-the-cloud application ratings scan computer system program matches application found user computer list trusted malicious applications list trusted applications power eraser leaves system list bad applications marked deletion unknown list reported suspicious marked removal instead program recommends remote scan upload file symantec servers check virus definitions power eraser aggressive unknown threats whitelisted instead marked removal sent analysis tool also features rootkit scanning requires system restart threat removal also performed restart next boot avoid self-protection viruses trojans | [
9569,
10756,
8398,
10872,
9791
] | Train |
10,614 | 4 | Petname:petname petname systems naming systems claim possess three naming properties zooko triangle global secure memorable software uses system satisfy three requirements systems used enhance security preventing phishing attacks unlike traditional identity systems focus service provider petname systems decentralized designed facilitate needs enduser interact multiple services though petname model formally described 2005 mark stiegler potential system discovered several people successively capdesk – desktop environment petname tool extension available firefox allows petnames assigned secure websites use extension help prevent phishing attacks petname markup language pnml proposal embedding petname information systems using custom markup language pnml consists two tags | [
256,
4034,
7480,
10146,
10813,
2951,
5503,
5483,
5612,
7884,
11596,
7983,
10835,
3700,
5078,
728,
6813,
3999
] | Test |
10,615 | 7 | Dell_Technologies:dell technologies dell technologies inc. american multinational technology company headquartered round rock texas formed result september 2016 merger dell emc corporation later became dell emc dell products include personal computers servers smartphones televisions computer software computer security network security well information security services dell ranked 35th 2018 fortune 500 rankings largest united states corporations total revenue approximately 50 company revenue derived united states dell operates 3 divisions follows dell also owns 5 separate businesses rsa security pivotal software secureworks virtustream boomi inc. october 12 2015 dell announced intent acquire emc corporation enterprise software storage company 67 billion transaction labeled highest-valued tech acquisition history addition michael dell singapore temasek holdings silver lake partners major dell shareholders supported transaction september 7 2016 dell inc. completed merger emc corp. involved issuance 45.9 billion debt 4.4 billion common stock dell services dell software group dell emc enterprise content divisions sold shortly thereafter proceeds 7.0 billion used repay debt october 2017 reported dell would invest 1 billion iot research development dell inc. returned private ownership 2013 claiming faced bleak prospects would need several years public eye rebuild business emc pressured elliott management corporation hedge fund holding 2.2 emc stock reorganize unusual federation structure emc divisions effectively run independent companies elliott argued structure deeply undervalued emc core emc ii data storage business increasing competition emc ii vmware products confusing market hindering companies wall street journal estimated 2014 dell revenue 27.3 billion personal computers 8.9 billion servers emc 16.5 billion emc ii 1bn rsa security 6bn vmware 230 million pivotal software emc owned around 80 stock vmware acquisition maintained vmware separate company held via new tracking stock rest emc rolled dell acquisition required dell publish quarterly financial results ceased going private 2013 dell technologies products services field scale-out architecture converged infrastructure private cloud computing january 29 2018 reported dell technologies considering reverse merger vmware subsidiary order take company public december 28 2018 dell technologies became public company | [
6153,
11146,
272,
10643,
939,
9137,
54,
8515,
10951,
2123,
7126,
8022,
4194,
1638,
2154,
1400,
3323,
5373,
2558
] | Test |
10,616 | 9 | Partial_evaluation:partial evaluation computing partial evaluation technique several different types program optimization specialization straightforward application produce new programs run faster originals guaranteed behave way computer program prog seen mapping input data output data formula_2 static data part input data known compile time partial evaluator transforms formula_3 formula_4 precomputing static input compile time formula_5 called residual program run efficiently original program act partial evaluation said residualize formula_6 formula_5 particularly interesting example use partial evaluation first described 1970s yoshihiko futamura prog interpreter programming language source code designed run inside said interpreter partial evaluation interpreter respect data/program produces prog* version interpreter runs source code written implementation language interpreter require source code resupplied runs faster original combination interpreter source case prog* effectively compiled version technique known first futamura projection three furthermore applying tool 3 yields tool quine first described futamura 1983 | [
2595,
6536,
393,
7273,
5997,
10618,
1488,
9680,
9714,
5684,
1685,
9914,
10043,
2620
] | Test |
10,617 | 9 | Bertrand_Meyer:bertrand meyer bertrand meyer born 21 november 1950 french academic author consultant field computer languages created eiffel programming language idea design contract bertrand meyer received master degree engineering école polytechnique paris second master degree stanford university phd université de nancy technical managerial career nine years électricité de france three years member faculty university california santa barbara october 2001 early 2016 professor software engineering eth zürich swiss federal institute technology pursued research building trusted components reusable software elements guaranteed level quality chair eth computer science department 2004 2006 13 years 2003–2015 taught introduction programming course taken eth computer science students resulting widely disseminated programming textbook touch class springer currently professor polytechnic university milan arrived erc advanced investigator grant project meyer activities include associate professorships innopolis university 2015–16 chair excellence university toulouse 1998 2003 adjunct professor monash university melbourne australia member french academy technologies also active consultant object-oriented system design architectural reviews technology assessment trainer object technology software topics conference speaker many years meyer active issues research education policy founding president 2006–2011 informatics europe association european computer science departments meyer pursues ideal simple elegant user-friendly computer languages one earliest vocal proponents object-oriented programming oop book object-oriented software construction widely considered best work presenting case oop books written include eiffel language description eiffel language object success discussion object technology managers reusable software discussion reuse issues solutions introduction theory programming languages touch class authored numerous articles edited conference proceedings initial designer eiffel method language continued participate evolution originator design contract development method experiences object technology simula language well early work abstract data types formal specification including z notation provided background development eiffel eiffel influential development languages including java c python 2005 meyer senior award winner first aito dahl-nygaard award prize named two creators object technology awarded annually senior junior researchers made significant technical contributions field object orientation meyer received honorary doctorates itmo university saint petersburg russia 2004 university york uk 2015 2006 meyer received software system award acm impact software quality recognition design eiffel 2008 fellow acm also 2009 recipient harlan mills award ieee computer society 28 december 2005 anonymous user falsely announced meyer death german wikipedia biography meyer hoax reported five days later heise news ticker article immediately corrected many major news media outlets germany switzerland picked story meyer went publish positive evaluation wikipedia concluding system succumbed one potential flaws quickly healed n't affect big picture like rumors wikipedia downfall grossly exaggerated | [
9345,
4483,
9351,
4107,
6160,
3733,
5677,
9264,
6454,
4412,
11457,
10568,
3529,
11339,
333,
10061,
5585,
2011,
7775,
10471,
8554,
2283,
11242,
9710,
1783,
3196,
511
] | None |
10,618 | 9 | Eager_evaluation:eager evaluation computer programming eager evaluation also known strict evaluation greedy evaluation evaluation strategy used traditional programming languages eager evaluation expression evaluated soon bound variable opposite alternative eager evaluation lazy evaluation expressions evaluated dependent expression evaluated depending upon defined evaluation strategy effects eager evaluation include imperative programming languages order execution implicitly defined structure source code almost always use eager evaluation order avoid unexpected behaviour occur certain contexts out-of-order execution e.g using multithreaded software concurrent execution code etc. unexpected behaviour result data races atomicity violations potentially unwanted hard control bugs effects many modern compilers capable re-ordering execution better optimize processor resources often eliminate unnecessary expressions executed entirely determined results expressions visible rest program however divert flow compiled program away evaluation strategy defined programming language compiled code written notable exception potential bugs introduced compiler avoid problem modern high-level languages provide constructs allow programmer direct compiler regards optimisations example using block-level construct lock c allows programmer define code block executed order defined source code effectively barring compiler performing re-order operations code block church encoding eager evaluation operators maps strict evaluation functions reason strict evaluation sometimes called eager | [
6536,
9224,
6926,
8722,
6815,
6817,
8738,
5684,
1333,
10043,
2620,
6718,
10819,
8262,
2381,
727,
7386,
6502,
8815,
10616
] | Test |
10,619 | 2 | SureType:suretype suretype qwerty-based character input method cell phones used blackberry pearl suretype combines traditional telephone keypad qwerty-based keyboard create non-standard way input text cell phone addition suretype contains list 35,000 english words user types beginning word possible words start letters show screen additional words also added word list suretype developed blackberry vendor research motion | [
2208,
9101,
6271
] | None |
10,620 | 3 | RdRand:rdrand codice_1 previously known bull mountain instruction returning random numbers intel on-chip hardware random number generator seeded on-chip entropy source codice_1 available ivy bridge processors part intel 64 ia-32 instruction set architectures amd added support instruction june 2015 random number generator compliant security cryptographic standards nist sp 800-90a fips 140-2 ansi x9.82 intel also requested cryptography research inc. review random number generator 2012 resulted paper analysis intel ivy bridge digital random number generator codice_3 similar codice_1 provides higher level access entropy hardware codice_3 generator processor instruction codice_6 available intel broadwell cpus amd zen cpus codice_7 instruction used check whether central processing unit cpu supports codice_1 instruction amd intel cpus supported bit 30 ecx register set calling cpuid standard function codice_9 amd processors checked feature using test codice_3 availability checked intel cpus similar manner codice_3 supported bit 18 ebx register set calling cpuid standard function codice_12 opcode codice_1 codice_14 followed modrm byte specifies destination register optionally combined rex prefix 64 bit mode intel secure key intel name codice_1 instruction underlying random number generator rng hardware implementation codenamed bull mountain development intel calls rng digital random number generator drng generator takes pairs 256-bit raw entropy samples generated hardware entropy source applies advanced encryption standard aes cbc-mac mode conditioner reduces single 256-bit conditioned entropy sample deterministic random-bit generator called ctr_drbg defined nist sp 800-90a seeded output conditioner providing cryptographically secure random numbers applications requesting via codice_1 instruction hardware issue maximum 511 128-bit samples changing seed value using codice_3 operation provides access conditioned 256-bit samples aes-cbc-mac codice_3 instruction added intel secure key seeding another pseudorandom number generator available broadwell cpus entropy source codice_3 instruction runs asynchronously self-timed circuit uses thermal noise within silicon output random stream bits rate 3 ghz slower effective 6.4gbit/s obtainable codice_1 rates shared cores threads codice_3 instruction intended seeding software prng arbitrary width whereas codice_1 intended applications merely require high-quality random numbers cryptographic security required software prng xorshift usually faster intel core i7-7700k 4500 mhz 45 x 100 mhz processor kaby lake-s microarchitecture single codice_1 codice_3 instruction takes 110ns 463 clock cycles regardless operand size 16/32/64 bits number clock cycles applies processors skylake kaby lake microarchitecture silvermont microarchitecture processors instructions take around 1472 clock cycles regardless operand size ivy bridge processors codice_1 takes 117 clock cycles amd ryzen cpu instructions takes around 1200 clock cycles 16-bit 32-bit operand around 2500 clock cycles 64-bit operand astrophysical monte carlo simulator examined time generate 10 64-bit random numbers using codice_1 quad-core intel i7-3740 qm processor found c implementation codice_1 ran 2x slower default random number generator c 20x slower mersenne twister although python module codice_1 constructed found 20x slower default random number generator python gcc 4.6+ clang 3.2+ provide intrinsic functions rdrand -mrdrnd specified flags also setting __rdrnd__ allow conditional compilation newer versions additionally provide codice_29 wrap built-ins functions compatible version 12.1+ intel c compiler functions write random data location pointed parameter return 1 success option generate cryptographically-secure random numbers using codice_1 codice_3 openssl help secure communications first scientific application rdrand found astrophysics radio observations low-mass stars brown dwarfs revealed number emit bursts radio waves radio waves caused magnetic reconnection process causes solar flares sun rdrand used generate large quantities random numbers monte carlo simulator model physical properties brown dwarfs effects instruments observe found 5 brown dwarfs sufficiently magnetic emit strong radio bursts also evaluated performance rdrand instruction c python compared random number generators september 2013 response new york times article revealing nsa effort weaken encryption theodore ts publicly posted concerning use rdrand /dev/random linux kernel linus torvalds dismissed concerns use rdrand linux kernel pointed used source entropy /dev/random rather used improve entropy combining values received rdrand sources randomness however taylor hornby defuse security demonstrated linux random number generator could become insecure backdoor introduced rdrand instruction specifically targets code using hornby proof-of-concept implementation works unmodified linux kernel prior version 3.13 developers changed freebsd kernel away using rdrand via padlock directly comment freebsd 10 going backtrack remove rdrand padlock backends feed yarrow instead delivering output directly /dev/random still possible access hardware random number generators rdrand padlock etc. directly inline assembly using openssl userland required trust | [
8065,
5380,
2821,
9092,
4491,
6924,
4237,
5649,
7313,
4886,
6038,
6808,
9369,
9500,
2719,
420,
2088,
9391,
10675,
8120,
8506,
1085,
5309,
8125,
8126,
833,
7234,
5444,
9541,
3142,
5326,
6352,
977,
2514,
3537,
2516,
5844,
7893,
9428,
4603,
... | None |
10,621 | 0 | Zipf–Mandelbrot_law:zipf–mandelbrot law /math probability theory statistics zipf–mandelbrot law discrete probability distribution also known pareto-zipf law power-law distribution ranked data named linguist george kingsley zipf suggested simpler distribution called zipf law mathematician benoit mandelbrot subsequently generalized probability mass function given formula_6 given may thought generalization harmonic number formula formula_8 rank data formula_9 formula_10 parameters distribution limit formula_11 approaches infinity becomes hurwitz zeta function formula_12 finite formula_11 formula_14 zipf–mandelbrot law becomes zipf law infinite formula_11 formula_14 becomes zeta distribution distribution words ranked frequency random text corpus approximated power-law distribution known zipf law one plots frequency rank words contained moderately sized corpus text data versus number occurrences actual frequencies one obtains power-law distribution exponent close one see powers 1998 gelbukh sidorov 2001 zipf law implicitly assumes fixed vocabulary size harmonic series =1 converge zipf-mandelbrot generalization 1 furthermore evidence closed class functional words define language obeys zipf-mandelbrot distribution different parameters open classes contentive words vary topic field register ecological field studies relative abundance distribution i.e graph number species observed function abundance often found conform zipf–mandelbrot law within music many metrics measuring pleasing music conform zipf–mandelbrot distributions | [
7599,
10527,
3694,
6279
] | None |
10,622 | 8 | Caddy_(web_server):caddy web server caddy sometimes clarified caddy web server mostly open source http/2-enabled web server written go uses go standard library http functionality one caddy notable features enabling https default author matthew holt began developing caddy december 2014 released april 2015 since advanced two hundred developers adding example support quic caddy supports variety web technologies available statically-compiled binaries windows mac linux android bsd operating systems i386 amd64 arm architectures variety web site technologies served caddy also act reverse proxy load balancer caddy features implemententations found go library enhancements available middleware exposed directives caddyfile text file used configure caddy caddy vulnerable number widespread cves including heartbleed drown poodle beast addition caddy uses tls_fallback_scsv prevent protocol downgrade attacks june 2 2015 version 0.7.1 released patch vulnerability timing attacks caddy basic authentication middleware regards protocols cipher suites caddy uses tls 1.0-1.2 prefers ecdhe ecdsa aes-256 gcm sha-384 although dozen different ciphers supported caddy also used cloudflare platform serve experimental tls 1.3 implementation traditional privilege de-escalation performed c programs non-trivial possible go programs caddy activates https default sites qualifying domain names names tls certificate negotiated via acme protocol redirects http requests https obtains certificates needed startup keeps renewed lifetime server let encrypt default certificate authority user may customize acme ca used often necessary testing configurations q1 2016 caddy accounted 2 certificates issued let encrypt alternate configuration allows caddy obtain certificates needed tls handshakes rather startup feature dubbed on-demand tls enable feature user must specify maximum number certificates issued way caddy receives request hostname yet certificate negotiate new certificate via acme serve immediately caching obtained certificate memory storing disk process usually takes seconds subject tight rate limits serving tls caddy automatically rotate session ticket keys periodically help preserve perfect forward secrecy starting version 0.11 caddy telemetry opt-in disabled default downloading caddy official website opt-out enabled default building source | [
1920,
4485,
7430,
1937,
11154,
7443,
1556,
2709,
1688,
1435,
8350,
7457,
3746,
8994,
11682,
3237,
9125,
7338,
9387,
44,
11693,
7983,
10800,
11439,
2485,
823,
6714,
8122,
64,
1991,
3657,
5834,
4561,
8273,
595,
1363,
2003,
11134,
11221,
354... | None |
10,623 | 6 | Comparison_of_file_archivers:comparison file archivers following tables compare general technical information number file archivers please see individual products articles information neither all-inclusive entries necessarily date unless otherwise specified footnotes section comparisons based stable versions— without add-ons extensions external programs note archivers names purple longer development basic general information archivers creator/company license/price etc operating systems archivers run without emulation compatibility layer linux ubuntu gui archive manager example open create many archive formats including rar archives even extent splitting parts encryption ability read native program presumably compatibility layer notes information common archiver features implemented natively without third-party add-ons notes information archive formats archivers read external links lead information support future versions archiver extensions provide functionality note gzip bzip2 xz rather compression formats archive formats notes information archive formats archivers write create external links lead information support future versions archiver extensions provide functionality note gzip bzip2 xz rather compression formats archive formats notes peazip full support various lpaq paq formats quad balz highly efficient rolz based compressors freearc format native pea format 7-zip includes read support .msi cpio xar plus apple dmg/hfs disk images deb/.rpm package distribution formats beta versions 9.07 onwards full support lzma2-compressed .xz format | [
6022,
10121,
1420,
6797,
1940,
5397,
3222,
9880,
7325,
3496,
3114,
10027,
5293,
7983,
8114,
950,
823,
6713,
10169,
9151,
321,
2755,
11076,
965,
1352,
4296,
10317,
1358,
4174,
10575,
4561,
722,
2395,
11614,
1631,
3296,
9953,
5858,
6759,
50... | None |
10,624 | 2 | .NET_Framework_version_history:.net framework version history microsoft started development .net framework late 1990s originally name next generation windows services ngws late 2001 first beta versions .net 1.0 released first version .net framework released 13 february 2002 bringing managed code windows nt 4.0 98 2000 xp since first version microsoft released nine upgrades .net framework seven released along new version visual studio two upgrades .net framework 2.0 4.0 upgraded common language runtime clr new versions .net framework replace older versions clr version .net framework family also includes two versions mobile embedded device use reduced version framework .net compact framework available windows ce platforms including windows mobile devices smartphones additionally .net micro framework targeted severely resource-constrained devices first version .net framework released 13 february 2002 windows 98 nt 4.0 2000 xp mainstream support version ended 10 july 2007 extended support ended 14 july 2009 exception windows xp media center tablet pc editions 19 june 2001 tenth anniversary release visual basic .net framework 1.0 beta 2 released .net framework 1.0 supported windows 98 nt 4.0 2000 xp server 2003 applications utilizing .net framework 1.0 also run computers .net framework 1.1 installed supports additional operating systems .net framework 1.0 service pack 1 released 18 march 2002 .net framework 1.0 service pack 2 released 7 february 2005 .net framework 1.0 service pack 3 released 30 august 2004 version 1.1 first minor .net framework upgrade available redistributable package software development kit published 3 april 2003 also part second release visual studio .net 2003 first version .net framework included part windows operating system shipping windows server 2003 mainstream support .net framework 1.1 ended 14 october 2008 extended support ended 8 october 2013 .net framework 1.1 last version support windows nt 4.0 provides full backward compatibility version 1.0 except rare instances application run checks version number library changes 1.1 include .net framework 1.1 supported windows 98 nt 4.0 2000 xp server 2003 vista server 2008 .net framework 1.1 service pack 1 released 30 august 2004 version 2.0 released 22 january 2006 also released along visual studio 2005 microsoft sql server 2005 biztalk 2006 software development kit version released 29 november 2006 last version support windows 98 windows changes 2.0 include .net framework 2.0 supported windows 98 2000 xp server 2003 vista server 2008 server 2008 r2 applications utilizing .net framework 2.0 also run computers .net framework 3.0 3.5 installed supports additional operating systems .net framework 2.0 service pack 1 released 19 november 2007 .net framework 2.0 service pack 2 released 16 january 2009 requires windows 2000 sp4 plus kb835732 kb891861 update windows xp sp2 plus windows installer 3.1 last version support windows 2000 although unofficial workarounds use subset functionality version 3.5 windows 2000 .net framework 3.0 formerly called winfx released 21 november 2006 includes new set managed code apis integral part windows vista windows server 2008 also available windows xp sp2 windows server 2003 download major architectural changes included release .net framework 3.0 uses clr .net framework 2.0 unlike previous major .net releases .net compact framework release made counterpart version version 3.0 .net framework shipped windows vista also shipped windows server 2008 optional component disabled default .net framework 3.0 consists four major new components .net framework 3.0 supported windows xp server 2003 vista server 2008 server 2008 r2 applications utilizing .net framework 3.0 also run computers .net framework 3.5 installed supports additional operating systems .net framework 3.0 service pack 1 released 19 november 2007 .net framework 3.0 service pack 2 released 22 february 2010 version 3.5 .net framework released 19 november 2007 .net framework 3.0 version 3.5 uses common language runtime clr 2.0 version .net framework version 2.0 addition .net framework 3.5 also installs .net framework 2.0 sp1 3.0 sp1 later 3.5 sp1 instead installing 2.0 sp2 3.0 sp2 adds methods properties bcl classes version 2.0 required version 3.5 features language integrated query linq changes affect applications written version 2.0 however previous versions new .net compact framework 3.5 released tandem update order provide support additional features windows mobile windows embedded ce devices source code framework class library version partially released debugging reference microsoft reference source license .net framework 3.5 supported windows xp server 2003 vista server 2008 7 server 2008 r2 8 server 2012 8.1 server 2012 r2 10 server 2016 .net framework 3.5 service pack 1 released 11 august 2008 release adds new functionality provides performance improvements certain conditions especially wpf 20–45 improvements expected two new data service components added ado.net entity framework ado.net data services two new assemblies web development system.webabstraction system.webrouting added used asp.net mvc framework reportedly used future release asp.net forms applications service pack 1 included sql server 2008 visual studio 2008 service pack 1 also featured new set controls called visual basic power packs brought back visual basic controls line shape version 3.5 sp1 .net framework shipped windows 7 also shipped windows server 2008 r2 optional component disabled default .net framework 3.5 sp1 also new variant .net framework called .net framework client profile 28 mb significantly smaller full framework installs components relevant desktop applications however client profile amounts size using online installer windows xp sp2 .net frameworks installed using windows update using off-line installer os download size still 250 mb key focuses release .net framework 4.0 supported windows xp service pack 3 windows server 2003 vista server 2008 7 server 2008 r2 applications utilizing .net framework 4.0 also run computers .net framework 4.5 4.6 installed supports additional operating systems .net framework 4.0 last version support windows xp windows server 2003 microsoft announced intention ship .net framework 4 29 september 2008 public beta released 20 may 2009 28 july 2009 second release .net framework 4 beta made available experimental software transactional memory support functionality available final version framework 19 october 2009 microsoft released beta 2 .net framework 4 time microsoft announced expected launch date .net framework 4 22 march 2010 launch date subsequently delayed 12 april 2010 10 february 2010 release candidate published version rc 12 april 2010 final version .net framework 4.0 launched alongside final release microsoft visual studio 2010 18 april 2011 version 4.0.1 released supporting customer-demanded fixes windows workflow foundation design-time component requires visual studio 2010 sp1 adds workflow state machine designer 19 october 2011 version 4.0.2 released supporting new features microsoft sql server version 4.0.3 released 4 march 2012 release .net framework 4 microsoft released set enhancements named windows server appfabric application server capabilities form appfabric hosting in-memory distributed caching support .net framework 4.5 released 15 august 2012 set new improved features added version .net framework 4.5 supported windows vista later .net framework 4.5 uses common language runtime 4.0 additional runtime features .net framework 4.5 supported windows vista server 2008 7 server 2008 r2 8 server 2012 8.1 server 2012 r2 applications utilizing .net framework 4.5 also run computers .net framework 4.6 installed supports additional operating systems metro-style apps originally designed specific form factors leverage power windows operating system two subset .net framework available building metro-style apps using c visual basic one windows 8 windows 8.1 called .net apis windows 8.x store apps another universal windows platform uwp called .net apis uwp version .net framework well runtime libraries used metro-style apps part windows runtime new platform development model metro-style apps ecosystem houses many platforms languages including .net framework c++ html5 javascript managed extensibility framework mef library creating lightweight extensible applications allows application developers discover use extensions configuration required also lets extension developers easily encapsulate code avoid fragile hard dependencies mef allows extensions reused within applications across applications well release .net framework 4.5.1 announced 17 october 2013 along visual studio 2013 version requires windows vista sp2 later included windows 8.1 windows server 2012 r2 new features .net framework 4.5.1 release .net framework 4.5.2 announced 5 may 2014 version requires windows vista sp2 later windows forms applications improvements made high dpi scenarios asp.net higher reliability http header inspection modification methods available new way schedule background asynchronous worker tasks .net framework 4.6 announced 12 november 2014 released 20 july 2015 supports new just-in-time compiler jit 64-bit systems called ryujit features higher performance support sse2 avx2 instruction sets wpf windows forms received updates high dpi scenarios support tls 1.1 tls 1.2 added wcf version requires windows vista sp2 later cryptographic api .net framework 4.6 uses latest version windows cng cryptography api result nsa suite b cryptography available .net framework suite b consists aes sha-2 family hashing algorithms elliptic curve diffie–hellman elliptic curve dsa .net framework 4.6 supported windows vista server 2008 7 server 2008 r2 8 server 2012 8.1 server 2012 r2 10 server 2016 however .net framework 4.6.1 4.6.2 drops support windows vista server 2008 .net framework 4.6.2 drops support windows 8 release .net framework 4.6.1 announced 30 november 2015 version requires windows 7 sp1 later new features apis include preview .net framework 4.6.2 announced march 30 2016 released august 2 2016 version requires windows 7 sp1 later new features include 5 april 2017 microsoft announced .net framework 4.7 integrated windows 10 creators update promising standalone installer windows versions update visual studio 2017 released date add support targeting .net framework 4.7 promised standalone installer windows 7 later released 2 may 2017 prerequisites included package new features .net framework 4.7 include .net framework 4.7 supported windows 7 server 2008 r2 server 2012 8.1 server 2012 r2 10 server 2016 server 2019 .net framework 4.7.1 released 17 october 2017 amongst fixes new features corrects d3dcompiler dependency issue also adds compatibility .net standard 2.0 box .net framework 4.7.2 released 30 april 2018 amongst changes improvements asp.net bcl clr clickonce networking sql wcf windows forms workflow wpf version included server 2019 .net framework 4.8 released 18 april 2019 includes additional enhancements high-resolution displays performance updates security enhancements .net framework 4.8 supported windows 7 server 2008 r2 server 2012 8.1 server 2012 r2 10 server 2016 server 2019 most-recent release 4.8.0 build 3928 released july 25 2019 offline installer size 111mb digital signature date july 25 2019 | [
10624,
3076,
9348,
3462,
4231,
1802,
6411,
11283,
11030,
3224,
3736,
4505,
5403,
3997,
3102,
4384,
8609,
10145,
8227,
10020,
11559,
3496,
3881,
2603,
9263,
3250,
3894,
321,
65,
1347,
1348,
4174,
847,
5844,
9434,
731,
4316,
1501,
5470,
713... | None |
10,625 | 7 | Job_Submission_Description_Language:job submission description language job submission description language extensible xml specification global grid forum description simple tasks non-interactive computer execution systems currently version 1.0 released november 7 2005 specification focuses description computational task submissions traditional high-performance computer systems like batch schedulers jsdl describes submission aspects job attempt describe state running historic jobs instead jsdl includes descriptions following software known currently support jsdl | [
5414,
198,
8702,
479,
8030,
7935,
8339,
11353,
222,
7615
] | None |
10,626 | 5 | V5_interface:v5 interface v5 family telephone network protocols defined etsi allow communications telephone exchange also known specifications local exchange le local loop potentially thousands subscribers connected le problem physically managing thousands wires local subscribers costs associated prior specification v5 manufacturers exchange equipment proprietary solutions problem solutions inter-operate meant tied single manufacturer method exchange v5 provided standard set protocols subscriber le access network defined reference point signalling point le standardised therefore allowed multiple vendor solution provided specifications followed resulted single link case v5.2 multiple links le reducing need many lines along point likely need proprietary solution manage single link final link local loop remained digital signalling isdn analogue signalling basic telephony also known pots industry protocols based principle common-channel signaling message-based signalling subscribers uses signalling channel rather separate channels existing different subscribers v5 comes two forms v5.1 supports control pstn isdn protocols v5.2 also supports bcc link control protection protocols v5 layer 3 protocols transported layer 2 protocol called lapv5 variation lap-d link access procedures channel isdn transport layer v5 protocol stack controls circuit-switched communication paths portions v5 re-used new service known narrowband multimedia delivery service nmds particular pstn protocol re-used combined isdn provide service subscriber allowed digital connection subscribers house re-use analogue phones across digital connection reference point replaced isdn-like nte nte managed analogue service basic rate isdn service subscribers home | [
6068,
3156,
5029
] | Test |
10,627 | 2 | Novell_S-Net:novell s-net s-net aka sharenet network operating system set network protocols used talk client machines network released novell 1983 s-net operating system entirely proprietary operating system written motorola 68000 processor used star network topology s-net also called netware 68 68 denoting 68000 processor superseded netware 86 written intel 8086 processor 1985 | [
7269,
7983,
11184,
6675,
3007
] | None |
10,628 | 1 | Primary_key:primary key relational model databases primary key specific choice minimal set attributes columns uniquely specify tuple row relation table informally primary key attributes identify record simple cases simply single attribute unique id formally primary key choice candidate key minimal superkey candidate key alternate key primary key may consist real-world observables case called natural key attribute created function key used identification outside database called surrogate key example database people given nationality time location birth could natural key.national identification number another example attribute may used natural key although mainly used today relational database context term primary key pre-dates relational model also used database models relational database terms primary key differ form function key n't primary practice various different motivations may determine choice one key primary another designation primary key may indicate preferred identifier data table primary key used foreign key references tables may indicate technical rather semantic feature table languages software special syntax features used identify primary key e.g primary key constraint sql relational model expressed relational calculus relational algebra distinguish primary keys kinds keys primary keys added sql standard mainly convenience application programmer primary keys defined iso sql standard primary key constraint syntax add constraint existing table defined like primary key also specified directly table creation sql standard primary keys may consist one multiple columns column participating primary key implicitly defined null note rdbms require explicitly marking primary key columns codice_1 primary key consists single column column marked using following syntax circumstances natural key uniquely identifies tuple relation may cumbersome use software development example may involve multiple columns large text fields cases surrogate key used instead primary key situations may one candidate key relation candidate key obviously preferred surrogate key may used primary key avoid giving one candidate key artificial primacy others since primary keys exist primarily convenience programmer surrogate primary keys often used many cases exclusively database application design due popularity surrogate primary keys many developers cases even theoreticians come regard surrogate primary keys inalienable part relational data model largely due migration principles object-oriented programming model relational model creating hybrid object-relational model orm like active record pattern additional restrictions placed primary keys however neither restrictions part relational model sql standard due diligence applied deciding immutability primary key values database application design database systems even imply values primary key columns changed using codice_2 sql statement typically one candidate key chosen primary key candidate keys become alternate keys may unique index assigned order prevent duplicates duplicate entry valid unique column alternate keys may used like primary key single-table select filtering clause typically used join multiple tables | [
8195,
3591,
10632,
7053,
2068,
11674,
8230,
7080,
2217,
7339,
10413,
10292,
9397,
3004,
2369,
11457,
9286,
2512,
2901,
10326,
2009,
347,
2780,
2026,
10737,
9075,
9467
] | None |
10,629 | 8 | PeerIndex:peerindex peerindex london-based company providing social media analytics based footprints use major social media services currently facebook linkedin quora twitter part emerging group social media analytics providers peerindex helps social media contributors assess score influence benefit social capital built peerindex currently tracks approximately 45 million twitter profiles making company one leaders sector peerindex founded 2009 azeem azhar former journalist reuters executive ditlev schwanenflügel former mckinsey consultant bill emmott former editor-in-chief economist backed number internet investors peerindex measures influence measuring activity audience authority metrics chosen maximize relevance insight minimizing vulnerability gaming spambots noise authority measures relevant activity community authority measure boosted whenever others like comment and/or engage activity audience measures reach relative rest population activity measures activity compared rest population | [
5461,
735
] | Validation |
10,630 | 9 | Lisp_reader:lisp reader programming language lisp reader codice_1 function parser converts textual form lisp objects corresponding internal object structure original lisp s-expressions consisted symbols integers list constructors codice_2 codice_3 later lisps culminating common lisp added literals floating-point complex rational numbers strings constructors vectors reader responsible parsing list structure interning symbols converting numbers internal form calling read macros reader controlled codice_4 defines meaning character unlike programming languages lisp supports parse-time execution programs called read macros reader macros used extend syntax either universal program-specific ways example quoted form codice_5 operator abbreviated codice_6 codice_7 operator defined read macro reads following list wraps codice_8 similarly backquote operator defined read macro | [
11488,
6502,
5031,
2056,
2062,
4799
] | Test |
10,631 | 2 | OpenSSH:openssh openssh also known openbsd secure shell suite secure networking utilities based secure shell ssh protocol provides secure channel unsecured network client–server architecture openssh started fork free ssh program developed tatu ylönen later versions ylönen ssh proprietary software offered ssh communications security openssh first released 1999 currently developed part openbsd operating system openssh single computer program rather suite programs serve alternatives unencrypted protocols like telnet ftp openssh integrated several operating systems portable version available package systems openssh created openbsd developers alternative original ssh software tatu ylönen proprietary software although source code available original ssh various restrictions imposed use distribution openssh created fork björn grönvall ossh fork tatu ylönen original free ssh 1.2.12 release last one license suitable forking openssh developers claim application secure original due policy producing clean audited code released bsd license open source license word open name refers openssh first appeared openbsd 2.6 first portable release made october 1999 developments since included addition ciphers e.g. chacha20-poly1305 6.5 january 2014 cutting dependency openssl 6.7 october 2014 extension facilitate public key discovery rotation trusted hosts transition dsa ed25519 public host keys version 6.8 march 2015 19 october 2015 microsoft announced openssh natively supported microsoft windows accessible powershell releasing early implementation making code publicly available openssh-based client server programs included windows 10 since version 1803 ssh client key agent enabled available default ssh server optional feature-on-demand openssh developed part openbsd operating system rather including changes operating systems directly openssh separate portability infrastructure maintained openssh portability team portable releases made periodically infrastructure substantial partly openssh required perform authentication capability many varying implementations model also used openbsd projects openntpd openssh suite includes following command-line utilities daemons openssh server authenticate users using standard methods supported ssh protocol password public-key authentication using per-user keys host-based authentication secure version host trust relationships using public keys keyboard-interactive generic challenge-response mechanism often used simple password authentication also make use stronger authenticators tokens kerberos/gssapi server makes use authentication methods native host operating system include using bsd authentication system pluggable authentication modules pam enable additional authentication methods one-time passwords however occasionally side-effects using pam openssh must run root root privileges typically required operate pam openssh versions 3.7 16 september 2003 allow pam disabled run-time regular users run sshd instances openbsd openssh uses dedicated user default drop privileges perform privilege separation accordance principle least privilege applied throughout operating system including xenocara x server openssh includes ability set secured channel data sent local client-side unix domain sockets local client-side tcp ports may forwarded sent across secured channel routing server side forwarding set server instructed send forwarded data socket tcp host/port host could server localhost host may computer appears computer server originator data forwarding data bidirectional meaning return communication forwarded back client-side manner known ssh tunnel used multiplex additional tcp connections single ssh connection since 2004 conceal connections encrypt protocols otherwise unsecured circumvent firewalls sending/receiving manner data one port allowed firewall example x window system tunnel may created automatically using openssh connect remote host protocols http vnc may forwarded easily tunneling tcp- encapsulating payload ppp tcp-based connection ssh port forwarding known tcp-over-tcp induce dramatic loss transmission performance problem known tcp meltdown virtual private network software may instead use tunnel connection protocol simpler tcp however often problem using openssh port forwarding many use cases entail tcp-over-tcp tunneling meltdown avoided openssh client processes local client-side tcp connection order get actual payload sent sends payload directly tunnel tcp connection server side openssh server similarly unwraps payload order wrap routing final destination addition third-party software includes support tunnelling ssh include distcc cvs rsync fetchmail operating systems remote file systems mounted ssh using tools sshfs using fuse ad hoc socks proxy server may created using openssh allows flexible proxying possible ordinary port forwarding beginning version 4.3 openssh implements osi layer 2/3 tun-based vpn flexible openssh tunnelling capabilities allowing applications transparently access remote network resources without modifications make use socks case using default configuration attacker success probability recovering 14 bits plaintext 2 openssh 5.2 release modified behavior openssh server mitigate vulnerability privilege escalation vulnerability existed openssh 6.8 6.9 cve-2015-6565 due world-writable 622 tty devices believed denial service vulnerability use tiocsti ioctl possible inject characters users terminals execute arbitrary commands linux malicious compromised openssh servers could steal private login keys systems using vulnerability relies undocumented connection-resuming feature openssh client called roaming enabled default client supported openssh server applies versions 5.4 released 8 march 2010 7.1 openssh client fixed openssh 7.1p2 released 14 january 2016 cve numbers associated vulnerability cve-2016-0777 information leak cve-2016-0778 buffer overflow february 2001 tatu ylönen chairman cto ssh communications security informed openssh development mailing list company intended assert ownership ssh secure shell trademarks sought change references protocol secsh secsh order maintain control ssh name proposed openssh change name order avoid lawsuit suggestion developers resisted openssh developer damien miller replied urging ylönen reconsider arguing ssh since long generic trademark time ssh secure shell ssh appeared documents proposing protocol open standard hypothesised without marking within proposal registered trademarks ylönen relinquishing exclusive rights name means describing protocol improper use trademark allowing others use trademark incorrectly results trademark becoming generic term like kleenex aspirin opens mark use others study uspto trademark database many online pundits opined term ssh trademarked merely logo using lower case letters ssh addition six years company creation time began defend trademark openssh receiving threats legal repercussions weighed trademark validity developers openssh ylönen members ietf working group developing new standard several meetings group denied ylönen request rename protocol citing concerns would set bad precedent trademark claims ietf participants argued secure shell ssh generic terms could trademarks | [
2050,
4100,
3590,
9223,
2568,
11,
3602,
6674,
8725,
7702,
8729,
546,
2083,
9762,
9764,
6702,
10801,
9780,
4663,
9281,
7238,
8266,
8778,
1101,
4174,
10831,
10835,
7252,
8283,
10850,
10851,
1637,
9318,
10341,
9320,
5230,
1647,
9839,
7794,
9... | None |
10,632 | 1 | Foreign_key:foreign key context relational databases foreign key set attributes subject certain kind inclusion dependency constraint specifically constraint tuples consisting foreign key attributes one relation r must also exist necessarily distinct relation furthermore attributes must also candidate key s. simpler words foreign key set attributes references candidate key example table called team may attribute member_name foreign key referencing candidate key employee_name employee table since member_name foreign key value existing name member team must also exist employee name employee table table containing foreign key called child table table containing candidate key called referenced parent table database relational modeling implementation candidate key set zero attributes values guaranteed unique tuple row relation value combination values candidate key attributes tuple duplicated tuple relation since purpose foreign key identify particular row referenced table generally required foreign key equal candidate key row primary table else value null value. rule called referential integrity constraint two tables violations constraints source many database problems database management systems provide mechanisms ensure every non-null foreign key corresponds row referenced table example consider database two tables customer table includes customer data order table includes customer orders suppose business requires order must refer single customer reflect database foreign key column added order table e.g. customerid references primary key customer e.g id primary key table must unique customerid contains values primary key field may assume value customerid identify particular customer placed order however longer assumed order table kept date rows customer table deleted id column altered working tables may become difficult many real world databases work around problem 'inactivating rather physically deleting master table foreign keys complex update programs modify references foreign key change needed foreign keys play essential role database design one important part database design making sure relationships real-world entities reflected database references using foreign keys refer one table another another important part database design database normalization tables broken apart foreign keys make possible reconstructed multiple rows referencing child table may refer row referenced parent table case relationship two tables called one many relationship referenced table referencing table addition child parent table may fact table i.e foreign key refers back table foreign key known self-referencing recursive foreign key database management systems often accomplished linking first second reference table table may multiple foreign keys foreign key different parent table foreign key enforced independently database system therefore cascading relationships tables established using foreign keys likewise foreign keys defined part codice_1 sql statement foreign key single column column marked using following syntax foreign keys defined stored procedure statement database management system enforces referential constraints must ensure data integrity rows referenced table deleted updated dependent rows referencing tables still exist references considered specifies 5 different referential actions shall take place occurrences whenever rows master referenced table deleted updated respective rows child referencing table matching foreign key column deleted updated well called cascade delete update value updated deleted row exists referencing child table references value referenced table similarly row deleted long reference referencing child table understand restrict cascade better may helpful notice following difference might immediately clear referential action cascade modifies behavior child table word cascade used example delete cascade effectively says referenced row deleted table master table delete also however referential action restrict modifies behavior master table child table although word restrict appears child table master table delete restrict effectively says someone tries delete row table master table prevent deletion table course also n't delete main point restrict supported microsoft sql 2012 earlier action restrict much alike main difference action restrict action referential integrity check done trying alter table restrict check trying execute update delete statement referential actions act referential integrity check fails update delete statement result error words update delete statement executed referenced table using referential action action dbms verifies end statement execution none referential relationships violated different restrict assumes outset operation violate constraint using action triggers semantics statement may yield end state foreign key relationships violated time constraint finally checked thus allowing statement complete successfully general action taken dbms set null set default delete update value affected referencing attributes changed null set null specified default value set default referential actions generally implemented implied triggers i.e triggers system-generated names often hidden subject limitations user-defined triggers order execution relative triggers may need considered cases may become necessary replace referential action equivalent user-defined trigger ensure proper execution order work around mutating-table limitations another important limitation appears transaction isolation changes row may able fully cascade row referenced data transaction see therefore cascade onto example transaction attempting renumber customer account simultaneous transaction attempting create new invoice customer cascade rule may fix invoice rows transaction see keep consistent renumbered customer row wo n't reach another transaction fix data database guarantee consistent data two transactions commit one forced roll back often first-come-first-served basis first example illustrate foreign keys suppose accounts database table invoices invoice associated particular supplier supplier details name address kept separate table supplier given 'supplier number identify invoice record attribute containing supplier number invoice 'supplier number primary key supplier table foreign key invoices table points primary key relational schema following primary keys marked bold foreign keys marked italics corresponding data definition language statement follows | [
8195,
3591,
8201,
2068,
1049,
5658,
9248,
10793,
10286,
11324,
9286,
2632,
9290,
8788,
10326,
7767,
8291,
9828,
10340,
8808,
2669,
1146,
3196,
6782,
10389,
4255,
4263,
8871,
10413,
9397,
7868,
6850,
2246,
8393,
2780,
734,
10471,
6383,
7412,... | None |
10,633 | 4 | Syhunt:syhunt syhunt world wide web network security software company headquarters rio de janeiro brazil syhunt founded august 2003 felipe daragon network security specialist company operations currently centered development software relating assessment web servers web applications 2003 syhunt released web application security assessment software known sandcat focuses open web application security project owasp sans institute vulnerabilities syhunt also produced number security software utilities including worm removal tools worm outbreaks server hardening log analysis tools today company still engaged development web application security assessment software also participates common vulnerabilities exposures cve initiative | [
10437,
939,
9293,
2739,
2709,
5404
] | Test |
10,634 | 0 | Referring_expression_generation:referring expression generation referring expression generation reg subtask natural language generation nlg received scholarly attention nlg concerned conversion non-linguistic information natural language reg focuses creation referring expressions noun phrases identify specific entities called targets task split two sections content selection part determines set properties distinguish intended target linguistic realization part defines properties translated natural language variety algorithms developed nlg community generate different types referring expressions referring expression linguistics noun phrase surrogate noun phrase whose function discourse identify individual object thing event ... technical terminology identify differs great deal one school linguistics another widespread term probably refer thing identified referent example work john lyons linguistics study reference relations belongs pragmatics study language use though also matter great interest philosophers especially wishing understand nature knowledge perception cognition generally various devices used reference determiners pronouns proper names ... reference relations different kinds referents real imaginary world discourse may singular plural collective simplest type referring expressions pronoun linguistics natural language processing communities developed various models predicting anaphor referents centering theory ideally referring-expression generation would based models however nlg systems use much simpler algorithms example using pronoun referent mentioned previous sentence sentential clause entity gender mentioned sentence considerable amount research generating definite noun phrases big red book much builds model proposed dale reiter extended various ways example krahmer et al present graph-theoretic model definite np generation many nice properties recent years shared-task event compared different algorithms definite np generation using tuna corpus recently research generating referring expressions time space references tend imprecise exact meaning tonight also interpreted different ways different people hence may necessary explicitly reason false positive vs false negative tradeoffs even calculate utility different possible referring expressions particular task context ideally good referring expression satisfy number criteria reg goes back early days nlg one first approaches done winograd 1972 developed incremental reg algorithm shrdlu program afterwards researchers started model human abilities create referring expressions 1980s new approach topic influenced researchers appelt kronfeld created programs kamp bertrand considered referring expressions parts bigger speech acts interesting findings fact referring expressions used add information beyond identification referent well influence communicative context gricean maxims referring expressions furthermore skepticism concerning naturalness minimal descriptions made appelt kronfeld research foundation later work reg search simple well-defined problems changed direction research early 1990s new approach led dale reiter stressed identification referent central goal like appelt discuss connection gricean maxims referring expressions culminant paper also propose formal problem definition furthermore reiter dale discuss full brevity greedy heuristics algorithms well incremental algorithm ia became one important algorithms reg 2000 research began lift simplifying assumptions made early reg research order create simple algorithms different research groups concentrated different limitations creating several expanded algorithms often extend ia single perspective example relation many simplifying assumptions still place begun worked also combination different extensions yet done called non-trivial enterprise krahmer van deemter another important change 2000 increasing use empirical studies order evaluate algorithms development took place due emergence transparent corpora although still discussions best evaluation metrics use experimental evaluation already led better comparability algorithms discussion goals reg task-oriented research furthermore research extended range related topics choice knowledge representation kr frameworks area main question kr framework suitable use reg remains open answer question depends well descriptions expressed found lot potential kr frameworks left unused far different approaches usage dale reiter 1995 think referring expressions distinguishing descriptions define entity domain characterised set attribute-value pairs example formula_1type dogformula_2 formula_1gender femaleformula_2 formula_1age 10 yearsformula_2 problem defined follows let formula_7 intended referent formula_8 contrast set set formula_9 attribute–value pairs represent distinguishing description following two conditions hold words generate referring expression one looking set properties apply referent distractors problem could easily solved conjoining properties referent often leads long descriptions violating second gricean maxim quantity another approach would find shortest distinguishing description like full brevity algorithm yet practice common instead include condition referring expressions produced algorithm similar human-produced ones possible although often explicitly mentioned full brevity algorithm always finds minimal distinguishing description meaning shorter distinguishing description regard properties used therefore iterates formula_24 checks every description length formula_25 properties distinguishing description found two problems arise way creating referring expressions firstly algorithm high complexity meaning np-hard makes impractical use secondly human speakers produce descriptions minimal many situations greedy heuristics algorithm approximates full brevity algorithm iteratively adding distinguishing property description distinguishing property means property rules remaining distractors greedy heuristics algorithm efficient full brevity algorithm dale reiter 1995 present following algorithm greedy heuristic let formula_9 set properties realised description let formula_27 set properties known true intended referent formula_7 assume formula_27 non-empty let formula_8 set distractors contrast set initial conditions thus follows order describe intended referent formula_7 respect contrast set formula_8 following incremental algorithm ia dale reiter influential algorithm 2000 based idea preferential order attributes properties speakers go order run incremental algorithm first preference order attributes given algorithm follows order adds properties description rule remaining distractors furthermore dale reiter stress attribute type always included descriptions even rule distractors also type values part subsumption hierarchy including basic level values example pet domain chihuahua subsumed dog dog animal dog defined basic level dog would preferred algorithms chihuahua rule distractors incremental algorithm easy implement also computationally efficient running polynomial time description generated ia contain redundant properties superfluous later added properties creators consider weakness rather making expressions less psycholinguistically implausible following algorithm simplified version dale reiter ’ incremental algorithm krahmer van deemter takes input referent r containing collection domain objects domain-specific ordered list pref preferred attributes notation l description c context set distractors function rulesout returns set objects value different v attribute 2000 evaluation reg systems theoretical nature like one done dale reiter recently empirical studies become popular mostly based assumption generated expressions similar human-produced ones corpus-based evaluation began quite late reg due lack suitable data sets still corpus-based evaluation dominant method moment though also evaluation human judgement first distinction text corpora experimental corpora made text corpora like gnome corpus contain texts kind domains reg used evaluate realization part algorithms content selection part reg hand requires corpus contains properties domain objects well properties used references typically fully semantically transparent created experiments using simple controlled settings experimental corpora separated general-purpose corpora collected another purpose analysed referring expressions dedicated corpora focus specifically referring expressions examples general-purpose corpora pear stories map task corpus coconut corpus bishop corpus drawer corpus tuna corpus count dedicated corpora tuna corpus contains web-collected data two domains furniture people used three shared reg challenges already measure correspondence corpora results reg algorithms several metrics developed measure content selection part dice coefficient masi measuring agreement set-valued items metric used measure overlap properties two descriptions evaluation scores usually averaged references made different human participants corpus also sometimes measure called perfect recall percentage prp accuracy used calculates percentage perfect matches algorithm-produced human-produced reference linguistic realization part reg overlap strings measured using metrics like bleu nist problem occurs string-based metrics example small monkey measured closer small donkey little monkey time consuming way evaluate reg algorithms letting humans judge adequacy clear description fluency description given good clear english generated expression also belz gatt evaluated referring expressions using experimental setup participants get generated description click target extrinsic metrics reading time identification time error rate could evaluated | [
2440,
7599
] | Test |
10,635 | 3 | Lira_512:lira 512 lira 512 also known lira xt ibm pc xt compatible computer made yugoslav serbian company ei niš late 1980s first presented public april 1988 “ kompjuter ‘ 88 ” computer show belgrade soon lira 512 also presented yugoslav computer press separates lira 512 xt compatibles keyboard included case together 3.5 ’ ’ floppy drive made similar appearance original atari st amiga 500 lira two display adapters monochrome hercules compatible color cga compatible active video adapter chosen back-panel switch 40w power adapter also installed case main purpose lira 512 used computer classrooms lira xt tower released year release original lira 512 realized 512 compact case limits hardware expansion address issue especially allow installation hard disk case changed slimline tower time lira xt tower new lira released similar looking slimline tower case lira compatible ibm pc equipped intel 80286 cpu 1mb ram ega compatible video adapter 2x3.5 floppy drives 40mb hard disk serial production lira started december 1989 1990 design lira 386 based intel 80386 cpu ready production | [
9606,
1515,
780,
6859,
10635,
6129,
7665,
10356
] | Test |
10,636 | 8 | Mint_(software):mint software mint server-based web analytics tool tracks traffic trends http referrers search trends developer shaun inman discontinued sales support december 24 2016 | [
1943,
3688,
6576,
119
] | Test |
10,637 | 4 | Vba32_AntiVirus:vba32 antivirus vba32 virus block ada 32 antivirus software vendor virusblokada personal computers running microsoft windows detects neutralizes computer viruses computer worms trojan horses malware backdoors adware spyware etc real time demand vba32 used one antivirus engines virustotal virusblokada antivirus software vendor established 1997 belarus 2010 discovered stuxnet first malware attacks supervisory control data acquisition scada systems 2009 judit papp assessed vba32 antivirus product could detect 26 percent unknown malware compared 67 percent detected avira antivir premium 8 percent detected microworld escan anti-virus | [
2049,
7809,
131,
3843,
10756,
1417,
6797,
4374,
10392,
1052,
156,
2721,
2213,
550,
1318,
6823,
2601,
8614,
2859,
3243,
6699,
8615,
6834,
4403,
10166,
704,
9537,
7362,
10308,
4421,
202,
1355,
1994,
5069,
10574,
7251,
10708,
2005,
11225,
12... | Test |
10,638 | 9 | Martin_Richards_(computer_scientist):martin richards computer scientist martin richards born 21 july 1940 british computer scientist known development bcpl programming language part early research portable software ancestor b programming language invented ken thompson early versions unix dennis ritchie turn used basis widely used c programming language richards studied mathematics undergraduate student university cambridge took cambridge diploma computer science phd programming language design implementation senior lecturer university cambridge computer laboratory retirement 2007 addition bcpl richards work includes development tripos portable operating system awarded ieee computer society computer pioneer award 2003 pioneering system software portability programming language bcpl richards fellow st johns college university cambridge | [
1952,
1349,
8262,
8140,
7983,
1783,
6075,
2045
] | Test |
10,639 | 3 | Vigilante_(video_game):vigilante video game game takes place downtown new york city game plot involves lone professional martial artist became vigilante fight evil gang called skinheads ruled man known giant devil order protect turf save female hostage named madonna kidnapped players control titular character using punches kicks defeat skinheads 2d platform manner sometimes picking using nunchaku players get hurt holding nunchuku become unarmed five stages order appearance street junkyard brooklyn bridge back street scene top building construction skinheads mohawk spiked hairdo attack vigilante knives chains motorbikes rifles kinds weapons also cling stands close arcade game later ported several different home computers consoles sega master system version ported arc system works published exclusively north america europe sega one several games console include fm sound switch enhanced music quality sega master system version madonna renamed maria skinheads called rogues ones commodore 64 zx spectrum atari st amiga amstrad cpc reprogrammed emerald software published u.s. gold mostly europe msx version ported published korean company clover turbografx-16 version ported published japan january 14 1989 irem published north america nec year port matches arcade ports turbografx-16 version later re-released globally nintendo virtual console wii north america february 5 2007 japan february 6 2007 europe february 9 2007 australia july 6 2007 delisted march 30 2012 march 31 europe returned september 2013 also released wii u virtual console japan february 10 2015 north america september 14 2017 europe october 5 2017 sinclair summarised game pretty standard beat 'em 've probably seen buy 're addicted genre 've already got better ones | [
8355,
11557,
9006
] | None |
10,640 | 7 | Virtual_IP_address:virtual ip address virtual ip address vip vipa ip address n't correspond actual physical network interface uses vips include network address translation especially one-to-many nat fault-tolerance mobility one-to-many nat vip address advertised nat device often router incoming data packets destined vip address routed different actual ip addresses address translation vip addresses several variations implementation scenarios including common address redundancy protocol carp proxy arp addition multiple actual ip addresses load balancing performed part nat vip addresses also used connection redundancy providing alternative fail-over options one machine work host run interior gateway protocol like open shortest path first ospf appear router rest network advertises virtual links connected via actual network interfaces one network interface fails normal ospf topology reconvergence cause traffic sent via another interface vip address used provide nearly unlimited mobility example application ip address physical subnet application moved host subnet vip addresses advertised subnet application moved anywhere reachable network without changing addresses | [
10279,
3751,
8969,
5486,
6480
] | Test |
10,641 | 3 | Argonne_National_Laboratory:argonne national laboratory argonne national laboratory science engineering research national laboratory operated university chicago argonne llc united states department energy located lemont illinois outside chicago largest national laboratory size scope midwest argonne initially formed carry enrico fermi work nuclear reactors part manhattan project designated first national laboratory united states july 1 1946 post-war era lab focused primarily non-weapon related nuclear physics designing building first power-producing nuclear reactors helping design reactors used usa nuclear navy wide variety similar projects 1994 lab nuclear mission ended today maintains broad portfolio basic science research energy storage renewable energy environmental sustainability supercomputing national security uchicago argonne llc operator laboratory brings together expertise university chicago sole member llc jacobs engineering group inc. argonne part expanding illinois technology research corridor argonne formerly ran smaller facility called argonne national laboratory-west simply argonne-west idaho next idaho national engineering environmental laboratory 2005 two idaho-based laboratories merged become idaho national laboratory argonne five main areas focus goals stated doe 2008 consist argonne began 1942 metallurgical laboratory university chicago became part manhattan project met lab built chicago pile-1 world first nuclear reactor stands university chicago sports stadium considered unsafe 1943 cp-1 reconstructed cp-2 today known red gate woods argonne forest cook county forest preserve district near palos hills lab named surrounding argonne forest turn named forest argonne france u.s. troops fought world war i. fermi pile originally going constructed argonne forest construction plans set motion labor dispute brought project halt since speed paramount project moved squash court stagg field football field campus university chicago fermi told sure calculations said would lead runaway reaction would contaminated city activities added argonne next five years july 1 1946 metallurgical laboratory formally re-chartered argonne national laboratory cooperative research nucleonics request u.s. atomic energy commission began developing nuclear reactors nation peaceful nuclear energy program late 1940s early 1950s laboratory moved larger location unincorporated dupage county illinois established remote location idaho called argonne-west conduct nuclear research quick succession laboratory designed built chicago pile 3 1944 world first heavy-water moderated reactor experimental breeder reactor chicago pile 4 built idaho lit string four light bulbs world first nuclear-generated electricity 1951 complete list reactors designed cases built operated argonne viewed reactors designed argonne page knowledge gained argonne experiments conducted reactors 1 formed foundation designs commercial reactors currently used throughout world electric power generation 2 inform current evolving designs liquid-metal reactors future commercial power stations conducting classified research laboratory heavily secured employees visitors needed badges pass checkpoint many buildings classified laboratory fenced guarded alluring secrecy drew visitors authorized—including king leopold iii belgium queen frederica greece—and unauthorized shortly past 1 a.m. february 6 1951 argonne guards discovered reporter paul harvey near perimeter fence coat tangled barbed wire searching car guards found previously prepared four-page broadcast detailing saga unauthorized entrance classified hot zone brought federal grand jury charges conspiracy obtain information national security transmit public indicted nuclear technology went developing reactors however designing scanner reactor fuel elements 1957 argonne physicist william nelson beck put arm inside scanner obtained one first ultrasound images human body remote manipulators designed handle radioactive materials laid groundwork complex machines used clean contaminated areas sealed laboratories caves 1964 janus reactor opened study effects neutron radiation biological life providing research guidelines safe exposure levels workers power plants laboratories hospitals scientists argonne pioneered technique analyze moon surface using alpha radiation launched aboard surveyor 5 1967 later analyzed lunar samples apollo 11 mission addition nuclear work laboratory maintained strong presence basic research physics chemistry 1955 argonne chemists co-discovered elements einsteinium fermium elements 99 100 periodic table 1962 laboratory chemists produced first compound inert noble gas xenon opening new field chemical bonding research 1963 discovered hydrated electron high-energy physics made leap forward argonne chosen site 12.5 gev zero gradient synchrotron proton accelerator opened 1963 bubble chamber allowed scientists track motions subatomic particles zipped chamber 1970 observed neutrino hydrogen bubble chamber first time meanwhile laboratory also helping design reactor world first nuclear-powered submarine u.s.s nautilus steamed 513,550 nautical miles 951,090 km next nuclear reactor model experimental boiling water reactor forerunner many modern nuclear plants experimental breeder reactor ii ebr-ii sodium-cooled included fuel recycling facility ebr-ii later modified test reactor designs including fast-neutron reactor 1982 integral fast reactor concept—a revolutionary design reprocessed fuel reduced atomic waste withstood safety tests failures triggered chernobyl three mile island disasters 1994 however u.s. congress terminated funding bulk argonne nuclear programs argonne moved specialize areas capitalizing experience physics chemical sciences metallurgy 1987 laboratory first successfully demonstrate pioneering technique called plasma wakefield acceleration accelerates particles much shorter distances conventional accelerators also cultivated strong battery research program following major push then-director alan schriesheim laboratory chosen site advanced photon source major x-ray facility completed 1995 produced brightest x-rays world time construction 19 march 2019 reported chicago tribune laboratory constructing world powerful supercomputer costing 500 million processing power 1 quintillion flops applications include analysis stars improvements power grid course history 13 eminent scientists served argonne director argonne builds maintains scientific facilities would expensive single company university construct operate facilities used scientists argonne private industry academia national laboratories international scientific organizations argonne welcomes members public age 16 older take guided tours scientific engineering facilities grounds tours last two half hours children 16 argonne offers range hands-on learning activities suitable k–12 field trips scout outings laboratory also hosts educational science engineering outreach schools surrounding area argonne scientists engineers help advance science engineering mathematics education united states taking part training nearly 1,000 college graduate students post-doctoral researchers every year part research development activities significant portions 1996 chase film chain reaction shot zero gradient synchrotron ring room former continuous wave deuterium demonstrator laboratory | [
512,
4612,
5767,
9095,
1933,
11661,
15,
1823,
5283,
6950,
1454,
8502,
8378,
9915,
1480,
4809,
7497,
2135,
6365,
4194,
105,
3960,
6906,
3323,
7935
] | Train |
10,642 | 2 | Pia_Andrews:pia andrews pia andrews née pia smith also formerly known pia waugh born 1979 open government leader executive director digital government new south wales department finance services innovation andrews spearheaded growth australian open government community organising events govhack govcamp events bring together diverse range citizens want see government data made open reuse previously andrews known work australian free software advocate past positions include presidency software freedom international presidency vice-presidency linux australia andrews employed services company volante several years 2005 andrews appointed research co-ordinator australian service knowledge open source software ask-oss project 2006 andrews then-husband jeff waugh director waugh partners australian open source consultancy waugh partners 2007 nsw state pearcey award young achievers work promoting free software australian ict industry project leader member board directors one laptop per child australia program launched 2008 andrews self-taught computer specialist also studied politics tertiary level involved several projects events promoting ict careers children women april 2009 andrews announced appointment policy advisor kate lundy announced role stepping aside leadership advocacy roles community groups would longer work waugh partners november 2012 andrews joined australian government information management office agimo director coordination gov 2.0 technology procurement division finance john sheridan cto australia charge australian national open data site http //data.gov.au/ 2014 andrews recognised innovation named one australia 100 women influence 2014 australian financial review westpac 100 women influence awards andrews included 2018 list world 100 influential people digital government apolitical group august 2018 andrews appointed executive director digital government news south wales australia andrews held several positions free software community | [
1026,
5644,
4367,
8848,
657,
1939,
2581,
3478,
6808,
7450,
6302,
7584,
802,
5410,
6691,
6947,
8354,
5931,
8364,
1717,
823,
2109,
11069,
10687,
10822,
8263,
843,
589,
6352,
4177,
11602,
8787,
4437,
6489,
3802,
4831,
9696,
11232,
7793,
1394... | Validation |
10,643 | 2 | Jeff_Bonwick:jeff bonwick jeff bonwick invented led development zfs file system used oracle corporation zfs storage products well startups including nexenta delphix joyent datto inc. bonwick also inventor slab allocation used many operating systems including macos linux lzjb compression algorithm roles included sun fellow sun storage cto oracle vice president 2010 bonwick co-founded small company called dssd mike shapiro bill moore became chief technical officer co-invented dssd system hardware architecture software developed dssd whole-system simulator enabled team explore possible hardware topologies software algorithms dssd acquired emc corporation 2014 became part dell technologies 2016 end 2016 bill moore left company bonwick remained cto dssd product called d5 cancelled march 2017 | [
9665,
10615,
2123,
823,
1422,
8599,
9343
] | None |
10,644 | 3 | Donkey_Kong_(video_game):donkey kong video game game latest series efforts nintendo break north american market hiroshi yamauchi nintendo president time assigned project first-time video game designer named shigeru miyamoto drawing wide range inspirations including popeye beauty beast king kong miyamoto developed scenario designed game alongside nintendo chief engineer gunpei yokoi two men broke new ground using graphics means characterization including cutscenes advance game plot integrating multiple stages gameplay although nintendo american staff initially apprehensive donkey kong succeeded commercially critically north america japan nintendo licensed game coleco developed home console versions numerous platforms companies cloned nintendo hit avoided royalties altogether miyamoto characters appeared cereal boxes television cartoons dozens places lawsuit brought universal city studios later universal studios alleging donkey kong violated trademark king kong ultimately failed success donkey kong nintendo victory courtroom helped position company video game market dominance release 1981 late 1990s following 1980 space panic donkey kong one earliest examples platform game genre even prior term coined u.s. gaming press used climbing game games platforms ladders first platform game feature jumping donkey kong requires player jump gaps obstacles approaching enemies setting template future platform genre four unique stages donkey kong complex arcade game time release one first arcade games feature multiple stages following 1980 phoenix 1981 gorf scramble competitive video gamers referees stress game high level difficulty compared classic arcade games winning game requires patience ability accurately time mario ascent addition presenting goal saving pauline game also gives player score points awarded following leaping obstacles destroying objects hammer power-up collecting items hats parasols purses presumably belonging pauline removing rivets platforms completing stage determined steadily decreasing bonus counter player typically receives three lives bonus awarded 7,000 points although modified via game built dip switches one life lost whenever mario touches donkey kong enemy object falls far gap end platform lets bonus counter reach zero game divided four different single-screen stages represents 25 meters structure donkey kong climbed one stage 25 meters higher previous final stage occurs 100 meters stage one involves mario scaling construction site made crooked girders ladders jumping hammering barrels oil drums tossed donkey kong stage two involves climbing five-story structure conveyor belts transport cement pans third stage involves player riding elevators avoiding bouncing springs fourth final stage requires mario remove eight rivets platforms supporting donkey kong removing final rivet causes donkey kong fall hero reunited pauline four stages combine form level upon completion fourth stage level increments game repeats stages progressive difficulty example donkey kong begins hurl barrels faster sometimes diagonally fireballs speed victory music alternates levels 1 2 fourth level however consists 5 stages final stage 125 meters 22nd level colloquially known kill screen due error game programming kills mario seconds effectively ending game donkey kong considered earliest video game storyline visually unfolds screen eponymous donkey kong character game de facto villain hero carpenter originally unnamed japanese arcade release later named jumpman mario donkey kong kidnaps mario girlfriend originally known lady later renamed pauline player must take role mario rescue first occurrence damsel distress scenario would provide template countless video games come game uses graphics animation vehicles characterization donkey kong smirks upon mario demise pauline pink dress long hair speech balloon crying help appears frequently beside mario depicted red overalls red cap everyman character type common japan graphical limitations low pixel resolution small sprites prompted design drawing mouth pixels infeasible character given mustache programmers could animate hair got cap make arm movements visible needed colored overalls artwork used cabinets promotional materials make cartoon-like character designs even explicit pauline example depicted disheveled like king kong fay wray torn dress stiletto heels donkey kong first example complete narrative told video game form like 1980 pac-man employs cutscenes advance plot game opens gorilla climbing pair ladders top construction site sets pauline stomps feet causing steel beams change shape moves final perch sneers melody plays level stage starts brief animation sets scene adds background gameplay first video games upon reaching end stage another cutscene begins heart appears mario pauline donkey kong grabs climbs higher causing heart break narrative concludes mario reaches end rivet stage pauline reunited short intermission plays gameplay loops beginning higher level difficulty without formal ending late 1980 early 1981 nintendo efforts expand north america failed culminating attempted export otherwise successful radar scope left large number unsold radar scope machines company president hiroshi yamauchi thought simply converting something new approached young industrial designer named shigeru miyamoto working nintendo since 1977 see could design replacement miyamoto said could yamauchi appointed nintendo head engineer gunpei yokoi supervise project nintendo budget development game 100,000 sources also claim ikegami tsushinki involved development played role game creation concept hired provide mechanical programming assistance fix software created nintendo time nintendo also pursuing license make game based popeye comic strip license attempt failed nintendo took opportunity create new characters could marketed used later games miyamoto came many characters plot concepts eventually settled love triangle gorilla carpenter girlfriend mirrors rivalry bluto popeye olive oyl bluto became ape miyamoto said nothing evil repulsive would pet main character funny hang-loose kind guy miyamoto also named beauty beast 1933 film king kong influences although origin comic strip license played major part donkey kong marked first time storyline video game preceded game programming rather simply appended afterthought unrelated popeye games would eventually released nintendo game watch following month arcades 1982 yamauchi wanted primarily target north american market mandated game given english title though many games point english titles anyway miyamoto decided name game ape felt strongest character story miyamoto came name donkey kong varies false urban myth says name originally meant monkey kong misspelled misinterpreted due blurred fax bad telephone connection another credible story claims miyamoto looked japanese-english dictionary something would mean stubborn gorilla donkey meant convey silly stubborn kong common japanese slang gorilla rival claim worked nintendo export manager come title donkey meant represent stupid goofy end miyamoto stated thought name would convey thought stupid ape miyamoto high hopes new project lacked technical skills program alone instead came concepts consulted technicians see possible wanted make characters different sizes move different manners react various ways yokoi thought miyamoto original design complex though difficult suggestions using see-saws catapult hero across screen eventually found hard program though similar concept would appear aforementioned popeye arcade game miyamoto thought using sloped platforms barrels ladders specified game would multiple stages four-man programming team complained essentially asking make game repeatedly nevertheless followed miyamoto design creating total approximately 20 kilobytes content yukio kaneoka composed simple soundtrack serve background music levels story events circuit board radar scope restructured donkey kong radar scope hardware originally inspired namco galaxian hardware designed large number enemies moving around high speeds donkey kong require development team removed unnecessary functions reduced scale circuit board gameplay graphics reworked updated rom chips existing cpu sound hardware monitor left intact character set scoreboard upper hud display font almost identical radar scope palette differences donkey kong hardware memory capacity displaying 128 foreground sprites 16x16 pixels 256 background tiles 8x8 pixels mario moving objects use single sprites taller pauline uses two sprites larger donkey kong uses six sprites hiroshi yamauchi thought game going sell well phoned inform minoru arakawa head nintendo operations u.s. nintendo american distributors ron judy al stone brought arakawa lawyer named howard lincoln secure trademark game sent nintendo america testing sales manager disliked different maze shooter games common time judy lincoln expressed reservations strange title still arakawa adamantly believed would hit american staff began translating storyline cabinet art naming characters chose pauline lady polly james wife nintendo redmond washington warehouse manager james name jumpman name originally chosen similarity popular brands walkman pac-man eventually changed mario likeness mario segale landlord original office space nintendo america character names printed american cabinet art used promotional materials donkey kong ready release stone judy convinced managers two bars seattle washington set donkey kong machines managers initially showed reluctance saw sales 30 day—or 120 plays—for week straight requested units redmond headquarters skeleton crew composed arakawa wife yoko james judy phillips stone set gutting 2,000 surplus radar scope machines converting donkey kong motherboards power supplies japan game officially went sale july 1981 actor harris shore created first live-action mario television advertisements colecovision hand-held donkey kong donkey kong junior video games makers video game consoles also interested taito offered considerable sum buy rights donkey kong nintendo turned three days discussion within company rivals coleco atari approached nintendo japan united states respectively end yamauchi granted coleco exclusive console tabletop rights donkey kong believed hungriest company addition arakawa believed established company u.s. coleco could better handle marketing return nintendo would receive undisclosed lump sum plus 1.40 per game cartridge sold 1 per tabletop unit december 24 1981 howard lincoln drafted contract included language coleco would held liable anything game cartridge unusual clause licensing agreement arakawa signed document next day february 1 1982 yamauchi persuaded coleco representative japan sign without review company lawyers coleco offer game cartridge stand-alone instead bundled colecovision console went sale august 1982 six months later coleco offered atari 2600 intellivision versions company port atari 5200 system comparable opposed less powerful 2600 intellivision coleco sales doubled 500 million earnings quadrupled 40 million coleco console versions donkey kong sold six million cartridges total grossing 153 million earning nintendo 5 million royalties coleco also released stand-alone mini-arcade tabletop versions donkey kong along pac-man galaxian frogger sold three million units combined meanwhile atari got license computer versions donkey kong released atari 400 800 coleco unveiled adam computer running port donkey kong 1983 consumer electronics show chicago illinois atari protested violation licensing agreement yamauchi demanded arnold greenberg coleco president withdraw adam port version game cartridge-based thus violation nintendo license atari still greenberg complied ray kassar atari fired next month home pc version donkey kong released 1983 atari released several computer versions atarisoft label computer ports cement factory level console versions none home versions intermission animations arcade game donkey kong left side screen barrel level arcade game others right side miyamoto created greatly simplified version game watch multiscreen handheld device ports include apple ii atari 7800 intellivision commodore vic-20 famicom disk system ibm pc booter zx spectrum amstrad cpc msx atari 8-bit family mini-arcade versions two separate distinct ports developed commodore 64 first published atarisoft 1983 second ocean software 1986 game ported nintendo family computer famicom console released japan july 15 1983 one system three launch games also early game famicom international redesign nintendo entertainment system nes launched june 1 1986 north america october 15 1986 europe game ported famicom nes developer nintendo research development 2 arcade classics series nes games cement factory level included however cutscenes since initial rom cartridges enough memory available however port includes new song composed yukio kaneoka title screen donkey kong sequel donkey kong jr. included 1988 nes compilation donkey kong classics complete remake original arcade game game boy titled donkey kong referred donkey kong '94 development contains levels original donkey kong donkey kong jr. arcades starts damsel-in-distress premise four basic locations arcade game progresses 97 additional puzzle-based levels first game built-in enhancement super game boy accessory nes version re-released unlockable game animal crossing gamecube also published virtual console wii wii u nintendo 3ds wii u version also last game released celebrate 30-year anniversary japanese version nes famicom original arcade version game appears nintendo 64 game donkey kong 64 must beaten finish game nintendo released nes version e-reader game boy advance classic nes series 2002 2004 respectively 2004 namco released arcade cabinet contains donkey kong donkey kong jr. mario bros. donkey kong original edition port based nes version reinstates cement factory stage includes intermission animations absent original nes version ever released virtual console preinstalled 25th anniversary pal region red wii systems first released europe october 29 2010 japan download code game nintendo 3ds virtual console sent users purchased new super mario bros. 2 nintendo eshop july 28 september 2 2012 north america download code game nintendo 3ds virtual console sent users purchased one five select 3ds games nintendo eshop registered club nintendo october 1 2012 january 6 2013 europe australia released purchase nintendo 3ds eshop released september 18 2014 europe september 19 2014 australia original arcade version re-released part arcade archives series nintendo switch june 14 2018 nes version re-released one launch titles nintendo switch online september 19 2018 1982 book video invaders steve bloom described donkey kong another bizarre cartoon game courtesy japan donkey kong however extremely popular united states canada game initial 2,000 units sold orders made arakawa began manufacturing electronic components redmond waiting shipments japan taking long october donkey kong selling 4,000 units month late june 1982 nintendo sold 60,000 donkey kong machines overall earned 180 million judy stone worked straight commission became millionaires arakawa used nintendo profits buy land redmond july 1982 nintendo earned another 100 million game second year release totaling 280 million remained nintendo top seller mid-1983 donkey kong also sold steadily japan electronic games speculated june 1983 game home versions contributed arcade version extended popularity compared four six months average game lasted january 1983 1982 arcade awards gave best single-player video game award certificate merit runner-up coin-op game year ed driscoll reviewed atari vcs version donkey kong space gamer 59 edwards commented faults really outweigh plusses especially 've got 'donkey kong fever addicted cure lies elsewhere still play game occasionally never may like cartridge however play store copy try friend buy september 1982 arcade express reviewed colecovision port scored 9 10 creative computing video arcade games 1983 stated coleco fabulous job donkey kong best console first five games faithful adaptation original video game seen magazine danny goodman stated coleco three console versions one colecovision best followed surprisingly atari intellivision order computer video games reviewed colecovision port september 1984 issue scored 4 4 four categories action graphics addiction theme famicom version game sold 840,000 units japan april 1982 sid sheinberg seasoned lawyer president mca universal city studios learned game success suspected might trademark infringement universal king kong april 27 1982 met arnold greenberg coleco threatened sue coleco home version donkey kong coleco agreed may 3 1982 pay royalties universal 3 donkey kong net sale price worth 4.6 million meanwhile sheinberg revoked tiger license make king kong game o. r. rissman refused acknowledge universal claim trademark universal threatened nintendo howard lincoln nintendo refused cave preparation court battle ahead universal agreed allow tiger continue producing king kong game long distinguished donkey kong universal sued nintendo june 29 1982 announced license coleco company sent cease desist letters nintendo licensees agreed pay royalties universal except milton bradley ralston purina universal city studios inc. v. nintendo co. ltd. heard united states district court southern district new york judge robert w. sweet seven days universal counsel new york firm townley updike argued names king kong donkey kong easily confused plot game infringement films nintendo counsel john kirby countered universal argued previous case king kong scenario characters public domain judge sweet ruled nintendo favor awarding company universal profits tiger game 56,689.41 damages attorney fees universal appealed trying prove consumer confusion presenting results telephone survey examples print media people allegedly assumed connection two kongs october 4 1984 however court upheld previous verdict nintendo licensees filed counterclaims universal may 20 1985 judge sweet awarded nintendo 1.8 million legal fees lost revenues expenses however denied nintendo claim damages licensees paid royalties nintendo universal parties appealed judgment verdict upheld july 15 1986 nintendo thanked john kirby gift 30,000 sailboat named donkey kong exclusive worldwide rights use name sailboats later nintendo protagonist named kirby honor court battle also taught nintendo could compete larger entertainment industry companies 1996 next generation listed arcade atari 7800 cancelled coleco adam versions number 50 top 100 games time commenting even ignoring massive historical significance donkey kong stands great game due demanding challenges graphics manage elegantly delineate entire scenario single screen february 2006 nintendo power rated 148th best game made nintendo system today donkey kong fifth popular arcade game among collectors donkey kong inspiration 1983 platform game home computers jumpman according game creator super smash bros. brawl features music game arranged hirokazu hip tanaka stage called 75m almost exact replica donkey kong namesake stage contains items pauline missing perch top stage crazy kong officially licensed nintendo manufactured falcon non-us markets nevertheless crazy kong machines found way american arcades often installed cabinets marked congorilla nintendo quick take legal action distributing game us bootleg copies donkey kong also appeared north america france crazy kong konkey kong donkey king names 1982 logger arcade game century electronics direct clone donkey kong large bird standing ape rolling logs instead barrels 1981 o. r. rissman president tiger electronics obtained license use name king kong universal city studios title tiger created handheld game scenario gameplay based directly nintendo creation many home computer clones directly borrowed gorilla theme killer gorilla bbc micro 1983 killer kong zx spectrum 1983 crazy kong 64 commodore 64 1983 kongo kong commodore 64 1983 donkey king trs-80 color computer 1983 kong ti-99/4a 1983 one first releases electronic arts hard hat mack apple ii 1983 three-stage game without ape using construction site setting donkey kong clones recast game different characters cannonball blitz apple ii 1982 soldier cannonballs replacing ape barrels american southwest-themed canyon climber atari 8-bit 1982 epyx jumpman atari 8-bit 1983 reuses prototypical name mario character donkey kong magazine ad game tagline liked donkey kong 'll love jumpman jumpman along miner 2049er atari 8-bit 1982 mr robot robot factory atari 8-bit 1984 focuses traversing platforms level collecting scattered objects instead climbing top many games multiple ladder platforms stages 1983 electronic games described nintendo popeye game yet another variation theme become familiar since success donkey kong year sega released donkey kong clone called congo bongo arcades although using isometric perspective structure gameplay similar atari 8-bit computer port donkey kong contains one longest-undiscovered easter eggs video game programmer landon dyer initials appear player died certain conditions returned title screen remained undiscovered 26 years dyer revealed blog stating easter egg totally worth n't remember bring anyway steps required trigger later discovered hodges used emulator debugger trace game code donkey kong spawned sequel donkey kong jr. 1982 player controlling donkey kong son attempt save father now-evil mario 1983 spinoff mario bros. introduced mario brother luigi single-screen cooperative game set sewer launched mario franchise also 1983 donkey kong 3 appeared form fixed shooter exterminator ridding ape—and insects—from greenhouse nintendo revived donkey kong franchise 1990s series platform games spin-offs developed rare beginning donkey kong country 1994 2004 nintendo released mario vs. donkey kong sequel game boy donkey kong mario must chase donkey kong get back stolen mini-mario toys follow-up donkey kong falls love pauline kidnaps mario uses mini-mario toys help rescue donkey kong racing gamecube development rare canceled microsoft purchased company 2004 nintendo released first donkey konga games rhythm-based game series uses special bongo controller donkey kong jungle beat 2005 unique platform action game uses bongo controller accessory 2007 donkey kong barrel blast released nintendo wii originally developed gamecube game would used bongo controller delayed released exclusively wii game support bongo accessory donkey kong appears game wii u game nes remix features multiple nes games sometimes remixes presenting significantly modified versions games challenges one challenge features link legend zelda traveling first screen save pauline difficulty increased compared original donkey kong link jump zelda late june 1982 donkey kong success prompted 50 parties u.s. japan license game characters mario simian nemesis appeared cereal boxes board games pajamas manga 1983 animation studio ruby-spears produced donkey kong cartoon well donkey kong jr. saturday supercade program cbs show mystery crime-solving plots mode scooby-doo framed around premise mario pauline chasing donkey kong voiced soupy sales escaped circus show lasted two seasons since original release donkey kong success entrenched game american popular culture 1982 buckner garcia r. cade video victims recorded songs donkey kong donkey kong respectively based game artists like dj jazzy jeff fresh prince trace adkins referenced game songs episodes television series simpsons futurama crank yankers fairly oddparents also contained references game even today sound effects atari 2600 version often serve generic video game sounds films television series phrase like donkey kong used various works popular culture november 2010 nintendo applied trademark phrase united states patent trademark office billy mitchell considered hold donkey kong record 1982 august 2000 surpassed tim sczerby 2007 documentary tells story steve wiebe attempts break donkey kong world record early 2010s hank chien set new record 1,138,600 broken four years later robbie lakeman current world record set robbie lakeman february 2 2018 score 1,247,700 2018 mitchell stripped records twin galaxies banned submitting new scores twin galaxies concluded mitchell illicitly used emulators achieve scores twin galaxies prohibits use emulators high scores publish allow undetectable cheating | [
9006,
7151,
1776,
10287,
6546,
7283,
10576,
7734,
4312,
3039
] | Test |
10,645 | 2 | Google_Goggles:google goggles google goggles image recognition mobile app developed google used searches based pictures taken handheld devices example taking picture famous landmark searches information taking picture product barcode would search information product google goggles developed use google android operating system mobile devices initially available beta version android phones google announced plans enable software run platforms notably iphone blackberry devices google discuss non-handheld format google product manager shailesh nalawadi indicated google wanted goggles application platform much like google maps single product october 5 2010 google announced availability google goggles devices running ios 4.0 may 2014 update google mobile ios google goggles feature removed google i/o 2017 similar app google lens announced similar functions goggles uses google assistant app officially discontinued august 20 2018 last update directing users download google lens google photos upon launching app system could identify various labels landmarks allowing users learn items without needing text-based search system could identify products barcodes labels allow users search similar products prices save codes future reference similar cuecat late 1990s system also recognized printed text uses optical character recognition ocr produce text snippet cases even translate snippet another language metropolitan museum art announced december 2011 collaboration google use google goggles providing information artworks museum direct links website metropolitan museum art | [
4096,
9732,
5637,
8719,
3600,
7700,
9244,
11294,
1578,
10284,
5677,
3633,
1083,
6212,
69,
8262,
4683,
4685,
11343,
3664,
8280,
8285,
2658,
8821,
11391,
1670,
7816,
5262,
6800,
11408,
10393,
8858,
7835,
2208,
673,
7841,
8870,
1191,
1203,
7... | Test |
10,646 | 7 | Joli_OS:joli os joli os ubuntu-based linux distribution developed french company jolicloud also name operating system version 1.2 joli os open source project source code hosted github 22 november 2013 developers decided discontinue joli os keep source code open jolicloud discontinued april 1 2016 project launched 2008 netvibes founder tariq krim romain huet krim originally wanted build laptop using environmentally friendly manufacturing methods two co-founders refocused effort building operating system purchasing netbooks renewing acquaintance linux rented office space montorgueil area paris later joined another developer tristan groléat alpha version built help developers kernel hackers designers venture capital firms atomico ventures mangrove capital partners provided 4.2 million funding version 1.0 released july 2010 version 1.1 released 7 december 2010 version 1.2 released 9 march 2011 joli os beginning built top ubuntu netbook edition linux distribution tweaked netbooks computers limited disk storage memory screen size joli os built top ubuntu customized kernel joli os designed easy installation wi-fi bluetooth 3g modem support included operating system supports major netbooks including models asus acer dell hp msi samsung sony jolicloud claims os supports 98 netbooks out-of-the-box compatibility also works large number devices 10 years old laptops desktops tablets version 1.0 operating system incorporates user interface built primarily html5 includes application launcher library compatible applications one-click installation removal display machines associated user account social activity stream enables users compare installed applications launcher displays applications supported library identical configuration viewed machine running joli os account management available computer html5-compatible browser jolicloud html5 implementation chromium web browser serves middleware web rendering reviewers evaluating joli os differed appraisals depending whether writing user new linux experienced operating system writing condé nast traveler blog mike haney called joli os easy free os n't code-monkey install everything need netbook quickly put lenovo netbook weekend running like molasses windows 7 'm convert joli os first operating system designed linux targeted beginning netbooks first n't feel like 're using linux funky install procedures code accessing special directories find apps compared joli os look function ios operating system used apple ipad well iphone ipod touch though folders files conventional computer computerworld serdar yegulalp wrote joli os 1.0 feels like second beta 1.0 release needs work truly useful instead one step curiosity yegulalp reported problems launching applications including google chrome browser vlc media player inability peer-to-peer mesh networking power button getting blocked open windows hibernation mode even computer supports noted comparable performance windows 7 slightly faster boot times zdnet reporter david meyer disagreed performance assessment running jolicloud nokia booklet 3g order take advantage device unusual 720p screen resolution wrote device lousy atom z530 processor ... really struggles windows 7 starter edition flies jolicloud ... 'm struggling think rival linux distro easily picked run average user ars technica ryan paul wrote lot good ideas display jolicloud joli os 1.0 nascent product still feels incomplete saw reason linux users particularly ubuntu users switch ubuntu unity environment sophisticated much better integration native applications underlying platform though joli os might better choice users interested web applications noting joli os 1.0 foundation ubuntu 9.04 nearing end support cycle canonical paul wrote real challenge continuing expand scope joli os differentiating features ... ensuring jolicloud users benefit ubuntu steady stream new features tariq krim defended decision stay ubuntu 9.04 joli os 1.0 arguing later ubuntu versions less stable required user-initiated software installations fully functional examples jolicloud developers additional work ensure out-of-the-box functionality include support poulsbo gma500 drivers touchscreens 3g said company moving away ubuntu solution could fit user needs better looking closely chrome os november 2010 jolicloud shipped netbook computer called jolibook ran operating system box computer manufactured uk-based vye computers featured 10.1-inch screen dual core 1.5 ghz intel atom n550 1gb ram 250gb hard drive artwork lid included slogan fast fun connected machine available united kingdom selling £280 via shop.vyepc.com amazon.co.uk longer manufactured jolicloud released version 1.1 december 2010 new version based ubuntu 10.04 lts lucid future patches planned 10.10 maverick among improvements claimed company faster boot times 10–20 seconds devices tested 15 percent battery life improvements tested clevo m1100 netbook intel atom n450 processor three-cell battery support pcs netbooks version 1.2 announced march 2011 renamed joli os new version featured new boot screen auto guest mode log-ins local file system integrated within desktop remote access desktop html5-capable browser optional background updates support latest chromium 10 browser flash 10.2 version 1.2 also includes dropbox integration app creation wizard file browser access local files preview dropbox files edit using google docs uses 2.2 gb disk space installed | [
7938,
9732,
8837,
5384,
5386,
6539,
7435,
4623,
10127,
2321,
5397,
4887,
10394,
673,
3745,
10530,
3109,
9253,
10021,
10149,
11305,
7854,
5681,
2738,
4790,
439,
56,
8122,
59,
3903,
4673,
1346,
708,
2375,
4039,
8907,
11221,
1110,
9693,
2914... | Test |
10,647 | 5 | Link_access_procedure:link access procedure link access procedure lap protocols data link layer protocols framing transmitting data across point-to-point links lap originally derived hdlc high-level data link control later updated renamed lapb lap balanced lapb data link protocol x.25 related lap protocols | [
7360,
10947,
1127,
5021,
4543
] | Test |
10,648 | 1 | Hospital_Records_Database:hospital records database hospital records database database provided wellcome trust uk national archives provides information existence location records uk hospitals includes location dates administrative clinical records existence catalogues links online hospital catalogues website proposed resource month royal society medicine 2009 | [] | Validation |
10,649 | 9 | SPARK_(programming_language):spark programming language spark formally defined computer programming language based ada programming language intended development high integrity software used systems predictable highly reliable operation essential facilitates development applications demand safety security business integrity originally three versions spark language spark83 spark95 spark2005 based ada 83 ada 95 ada 2005 respectively fourth version spark language spark 2014 based ada 2012 released april 30 2014 spark 2014 complete re-design language supporting verification tools spark language consists well-defined subset ada language uses contracts describe specification components form suitable static dynamic verification spark83/95/2005 contracts encoded ada comments ignored standard ada compiler processed spark examiner associated tools spark 2014 contrast uses ada 2012 built-in aspect syntax express contracts bringing core language main tool spark 2014 gnatprove based gnat/gcc infrastructure re-uses almost entirety gnat ada 2012 front-end spark aims exploit strengths ada trying eliminate potential ambiguities insecurities spark programs design meant unambiguous behavior required unaffected choice ada compiler goals achieved partly omitting ada problematic features unrestricted parallel tasking partly introducing contracts encode application designer intentions requirements certain components program combination approaches meant allow spark meet design objectives consider ada subprogram specification subprogram actually pure ada could virtually anything – might increment codice_1 one one thousand might set global counter codice_1 return original value counter codice_1 might absolutely nothing codice_1 spark 2014 contracts added code provide additional information regarding subprogram actually example may alter specification say specifies codice_5 procedure use neither update read global variable data item used calculating new value codice_1 codice_1 alternatively designer might specify specifies codice_5 use global variable codice_9 package codice_5 exported value codice_9 depends imported values codice_9 codice_1 exported value codice_1 depend variables derived constant data gnatprove run specification corresponding body subprogram analyse body subprogram build model information flow model compared specified annotations discrepancies reported user extend specifications asserting various properties either need hold subprogram called preconditions hold execution subprogram completed postconditions example could say following specifies codice_1 derived alone also codice_5 called codice_1 must strictly less last possible value type afterwards codice_1 equal initial value codice_1 plus one gnatprove also generate set verification conditions vcs vcs used attempt establish certain properties hold given subprogram minimum gnatprove generate vcs attempting establish run-time errors occur within subprogram postcondition assertions added subprogram gnatprove also generate vcs require user show properties hold possible paths subprogram hood gnatprove uses why3 intermediate language vc generator cvc4 z3 alt-ergo theorem provers discharge vcs use provers including interactive proof checkers also possible components why3 toolset first version spark based ada 83 produced university southampton uk ministry defence sponsorship bernard carré trevor jennings subsequently language progressively extended refined first program validation limited praxis critical systems limited 2004 praxis critical systems limited changed name praxis high integrity systems limited january 2010 company became altran praxis early 2009 praxis formed partnership adacore released spark pro terms gpl followed june 2009 spark gpl edition 2009 aimed floss academic communities june 2010 altran-praxis announced spark programming language would used software us lunar project cubesat expected completed 2015 january 2013 altran-praxis changed name altran first pro release spark 2014 announced april 30 2014 quickly followed spark 2014 gpl edition aimed floss academic communities spark used several high profile safety-critical systems covering commercial aviation rolls-royce trent series jet engines arinc acams system lockheed martin c130j military aviation eurofighter typhoon harrier gr9 aermacchi m346 air-traffic management uk nats ifacts system rail numerous signalling applications medical lifeflow ventricular assist device space applications vermont technical college cubesat project spark also used secure systems development users include rockwell collins turnstile secureone cross-domain solutions development original multos ca nsa tokeneer demonstrator secunet multi-level workstation muen separation kernel august 2010 rod chapman principal engineer altran praxis implemented skein one candidates sha-3 spark wanted compare performance spark c implementations careful optimization managed spark version 5 10 slower c. later improvement ada middle-end gcc implemented eric botcazou adacore closed gap spark code matching c performance exactly | [
9345,
6797,
1952,
5796,
428,
5677,
7983,
823,
963,
8262,
7889,
6228,
4572,
11625,
8554,
8810,
5612,
7671,
5880,
3705
] | Test |
10,650 | 9 | Variable_Data_Intelligent_Postscript_Printware:variable data intelligent postscript printware variable data intelligent postscript printware open language xerox enables highest-performance output variable-data postscript documents used freeflow vi suite vipp front end vipp originally called xgf simply groups postscript dictionaries provide macros simplify writing complex postscript commands postscript powerful language allows variable data printing personalization data stream right commands implement features programmer write sometimes many lines code xerox developed macro procedures postscript language dictionaries make page control easier example merge graphic form data stream requires understanding postscript commands according adobe postscript language reference manual plrm otherwise known red book xerox gives feature simple command formname setform formname name form accessible xerox printer controller docusp freeflow print server several vipp commands identical postscript commands vipp originally written couple xerox systems analysts switzerland enable highest speed postscript printers time 50 pages per minute features xerox proprietary production printing languages pdl fdl provide simple variable data printing xerox corporation adopted idea developed work putting procedures sun microsystems hosts adobe interpreter also resides together modules give complete control printing engine data stream vipp used four different modes database mode line mode xml mode native mode database mode programmer quickly implement printing solution example billing application delimited database file line mode existing print application enhanced form overlays font selection color features offered modern laser printers xml mode xml file turned readable document modes vipp offers conditional logic manipulation data example multi-page bill could printed duplex two-sided mode first page selected paper tray loaded perforated sheet remittance return back side printed disclosures instructions subsequent pages billing detail printed plain paper vipp programmer might even insert ocr micr line remittance processing complete check digit xerox markets interactive development environment vipp called freeflow vi designer freeflow vipp pro publisher help programmer code applications rapidly vipp freeflow vipp pro publisher plugin popular adobe indesign product enabling wysiwyg vipp development vipp licensed specific printer controllers running solaris microsoft windows operating system including postscript capable office devices non-volatile memory hard disk vipp capable installed device postscript interpreter freeflow print server ffps formerly docusp vipp enabled limited producing 200 pages appropriately licensed | [
5857,
8628,
6797,
9665
] | Test |
10,651 | 4 | UDP_Unicorn:udp unicorn udp unicorn free open source dos attack software software attacks computer network connection repeatedly sending udp packets garbage data udp unicorn uses winsock create sockets send udp packets | [
2409,
7983,
11413,
2045,
7102
] | None |
10,652 | 2 | IBM_XCF:ibm xcf ibm mainframes cross-system coupling facility xcf component z/os manages communications applications sysplex applications may system different systems systems communicate using messages transported one two mechanisms parallel sysplex decisions two transport mechanisms use routing specific message made dynamically within single z/os system messages transported using cross-memory services rather routed either physical transport mechanisms applications join specific groups individual members joining group member send receive messages individual messages assigned specific transport classes based message size transport class owns input output buffers routing decisions made transport class level | [
2168,
7053,
9838
] | Validation |
10,653 | 5 | BIC_TCP:bic tcp bic tcp binary increase congestion control one congestion control algorithms used transmission control protocol tcp bic optimized high speed networks high latency so-called long fat networks networks bic significant advantage previous congestion control schemes correcting severely underutilized bandwidth bic implements unique congestion window cwnd algorithm algorithm tries find maximum cwnd searching three parts binary search increase additive increase slow start network failure occurs bic uses multiplicative decrease correcting cwnd bic tcp implemented used default linux kernels 2.6.8 default implementation changed cubic tcp 2.6.19 version define following variables every rtt interval update cwnd following packets dropped congestion window cwnd increases three distinct ways binary search increase additive increase slow start step one used increment one step increasing cwnd one packets dropped cwnd reduced using multiplicative decrease requires β used decreasing cwnd 100×β case two flows one large cwnd small cwnd fast convergence used decrease greater cwnd flow w greater rate smaller cwnd flow allow faster convergence greater cwnd flow increasing cwnd one step decreasing cwnd | [
7017,
10924,
941,
2934,
823,
5817,
9021,
3006
] | None |
10,654 | 2 | Microsoft_Foundation_Class_Library:microsoft foundation class library microsoft foundation class library mfc c++ object-oriented library developing desktop applications windows mfc introduced microsoft 1992 quickly gained widespread use microsoft introduced alternative application frameworks since mfc remains widely used mfc introduced 1992 microsoft c/c++ 7.0 compiler use 16-bit versions windows extremely thin object-oriented c++ wrapper windows api c++ beginning replace c development commercial application software time mfc program direct windows api calls rarely needed instead programs create objects microsoft foundation class classes call member functions belonging objects many functions share names corresponding api functions one quirk mfc use afx prefix many functions macros standard precompiled header name stdafx.h early development became mfc called application framework extensions abbreviated afx name microsoft foundation classes mfc adopted late release cycle change references mfc 8.0 released visual studio 2005 mfc 9.0 released visual studio 2008 april 7 2008 microsoft released update mfc classes out-of-band update visual studio 2008 mfc 9 update features new user interface constructs including ribbons associated ui widgets fully customizable toolbars docking panes either freely floated docked side document tabs mfc initially feature commercial versions visual studio included freeware visual c++ express community edition visual studio introduced 2014 however includes mfc object windows library owl designed use borland turbo c++ compiler competing product introduced borland around time eventually borland discontinued owl development licensed distribution mfc headers libraries dlls microsoft short time though never offered fully integrated support mfc borland later released visual component library replace owl framework mfc library wraps portions windows api c++ classes including functionality enables use default application framework classes defined many handle-managed windows objects also predefined windows common controls time introduction mfc provided c++ macros windows message-handling via message maps exceptions run-time type identification rtti serialization dynamic class instantiation macros message-handling aimed reduce memory consumption avoiding gratuitous virtual table use also provide concrete structure various visual c++-supplied tools edit manipulate code without parsing full language message-handling macros replaced virtual function mechanism provided c++ macros serialization exceptions rtti predated availability features microsoft c++ number years 32-bit versions mfc windows nt 3.1 later windows operating systems used compilers implemented language features updated macros simply wrap language features instead providing customized implementations realizing upward compatibility mfc ribbon resource editor allows developer design ribbon graphically instead use xml-based declarative markup like ribbonx api optionally ribbon components may programmed directly calling new set ribbon class methods developer may mix graphical programmatic ribbon development convenient mfc application wizard also upgraded support new features including check-box select whether application use ribbon docking panes new functionality provided new classes old applications still continue run update building top bcgsoft ’ bcgcontrolbar library professional edition microsoft imposed additional licensing requirements users ribbons include requirement adhere microsoft ui design guidelines anti-competition clause prohibiting use ui applications compete microsoft office mfc used linking static library adding mfc dll | [
10243,
2062,
10769,
9234,
1043,
9755,
9245,
1055,
2083,
8227,
1577,
2603,
5165,
5677,
3631,
4143,
9263,
4658,
11316,
1077,
8246,
576,
8771,
4173,
4174,
4178,
9813,
10841,
603,
2145,
2658,
5743,
8303,
2673,
8304,
1656,
9848,
5754,
7292,
93... | Train |
10,655 | 2 | Zen_Bound:zen bound zen bound puzzle game ios android maemo platforms nokia n900 developed secret exit announced september 5 2008 via company discussion board officially released via app store february 24 2009 via ovi store june 16 2010 port android announced part humble bundle android 2 march 19 2012 game received press attention unique gameplay lite version game also released free featured 2 levels game goal game paint various objects level player given object attached rope varies length depending level using mouse touch screen tilt controls player attempts wrap object rope time rope laid object area near rope gets covered paint challenge getting required percentage object painted finite length rope three targets level minimum medium maximum coverage levels require nails protruding objects entwined rope rather cover object surface 5th imgawards international mobile gaming awards 2008 excellence 3d game extremely well received reviews upon release following review scores websites pocketgamer 10/10 platinum award ign 9.5/10 slidetoplay 4/4 time game highest rated gamerankings.com score 97.86 overtaken grand theft auto v 2014 | [
482,
3300,
9063,
823
] | Test |
10,656 | 4 | Columbitech:columbitech columbitech founded 2000 provides wireless security secure mobile devices support wlan public networks including 3g 4g wimax company headquartered stockholm sweden offices new york city columbitech mobile vpn provides remote network access field mobility users corporate wlan users telecommuters – mobilizing enterprise solution encrypted standards-based wireless transport layer security wtls holds fips 140-2 certification technology utilized retail industry meet pci dss requirements industries mobile devices used wireless networks | [
1160,
420,
9640
] | Test |
10,657 | 4 | Slenfbot:slenfbot slenfbot classification family malicious software malware infects files microsoft windows systems slenfbot first discovered 2007 since numerous variants followed slightly different characteristics new additions worm payload ability provide attacker unauthorized access compromised host slenfbot primarily spreads luring users follow links websites contain malicious payload slenfbot propagates via instant messaging applications removable drives and/or local network via network shares code slenfbot appears closely managed may provide attribution single group and/or indicate large portion code shared amongst multiple groups inclusion malware families variants well continuous evolution makes slenfbot highly effective downloader propensity cause even damage compromised systems majority antivirus a/v vendors use following naming conventions referring family malware end names wildcard possible classifications and/or distinctions malware family none publicly known slenfbot worm spreads using links websites containing malicious software malware via instant messaging programs may include msn/windows live messenger aol instant messenger aim yahoo messenger google chat facebook chat icq skype worm propagates automatically via removable drives shares local network windows file sharing service i.e. server lanmanserver service slenfbot also contains backdoor capabilities allow unauthorized access affected machine. ref name= microsoft_win32/slenfbot /ref ref name= microsoft_worm win32/stekct.a /ref ref name= microsoft_worm win32/stekct.b /ref ref name= win32/slenfbot-just_another_irc_bot /ref ref name= ca_win32/slenfbot /ref ref name= win32/slenfbot.ad /ref code appears closely controlled may provide attribution one group and/or malware authors share significant portion code slenfbot seen wild since 2007 obtained new features capabilities time subsequent variants systematically gained similar feature sets slenfbot continues operate effective infector dynamic downloader additional malware thus making highly functional delivery mechanism spyware information stealers spam bots well malware executed slenfbot copies duplicate malicious payload system folder filename varies per particular variant sets attributes copy read hidden system hide contents windows explorer worm makes changes registry maintain persistence malware executes duplicate copy subsequent startup system e.g copying malicious executable hklm\software\microsoft\windows\currentversion\run subkey several variants may modify registry installation add malware list applications authorized access internet thus allowing malware communicate without raising windows security alerts run unimpeded windows firewall cases variants may instead modify registry install malicious payload debugger benign system file ctfmon.exe ctfmon.exe executes system startup leads execution malware cases slenfbot attempt delete original copy worm variants may make additional modifications registry order delete originally executed copy worm system restarts slenfbot variants may initial execution test see msn/windows live messenger currently running looking window class name msblwindowclass worm finds window malware may display fake error message slenfbot launched removable drive variants may open windows explorer display contents affected drive certain slenfbot variants may inject thread explorer.exe periodically checks presence malware system folder file found malware downloads new copy specified server launches new copy slenfbot uses instant messaging attack vector spread worm accounts contacts remote attacker may use worm ’ backdoor capabilities instruct slenfbot spread via msn/windows live messenger aol instant messenger aim yahoo messenger google chat facebook chat icq skype worm connects remote server sends copy url contains list possible messages send randomly creates zip archive contains copy malware sends zip archive instant messaging client contacts following examples messages worm may spread zip file includes file name slenfbot executable may also contain url file download situations attacker instructs worm send arbitrary file slenfbot may spread removable drives creating directory called “ recycler ” root directory removable drive malware create subdirectory “ recycler ” folder e.g “ s-1-6-21-1257894210-1075856346-012573477-2315 ” copy malicious payload directory using different name executable e.g “ folderopen.exe ” slenfbot may also create autorun.inf file root directory drive worm may execute drive connected another system certain variants may download updated copy slenfbot location specified worm write file directory e.g using name “ ~secure ” locations worm copies slenfbot sets hidden system attributes respective directories files circumstances due programming issue slenfbot may create one directory rather two e.g “ e \recyclers-1-6-21-1257894210-1075856346-012573477-2315\folderopen.exe ” slenfbot may spread accessible shares upon successful compromise system worm may also spread file print shares exploiting known vulnerabilities ms06-040 ms10-061 pertain issues server print spooler services respectively attacker would instruct worm spread remote system via exploit instant messaging order continue propagation slenfbot following steps may help prevent infection slenfbot uses stealth measures maintain persistence system thus may need boot trusted environment order remove slenfbot may also make changes computer changes windows registry makes difficult download install and/or update virus protection also since many variants slenfbot attempt propagate available removable/remote drives network shares important ensure recovery process thoroughly detects removes malware known/possible locations one possible solution would use microsoft ’ windows defender offline beta detect remove slenfbot system information windows defender offline go http //windows.microsoft.com/en-us/windows/what-is-windows-defender-offline | [
3072,
10756,
3724,
6797,
3347,
4883,
2325,
278,
9630,
2213,
4648,
939,
46,
10297,
3643,
7739,
7996,
11583,
9664,
9154,
8133,
10952,
81,
8789,
10457,
7515,
988,
3807,
8032,
3941,
10477,
4462,
2041,
10875,
3581,
5886,
9087
] | Validation |
10,658 | 3 | Graphics_processing_unit:graphics processing unit graphics processing unit gpu specialized electronic circuit designed rapidly manipulate alter memory accelerate creation images frame buffer intended output display device gpus used embedded systems mobile phones personal computers workstations game consoles modern gpus efficient manipulating computer graphics image processing highly parallel structure makes efficient general-purpose central processing units cpus algorithms process large blocks data parallel personal computer gpu present video card embedded motherboard certain cpus embedded cpu die term gpu coined sony reference playstation console toshiba-designed sony gpu 1994 term popularized nvidia 1999 marketed geforce 256 world first gpu presented single-chip processor integrated transform lighting triangle setup/clipping rendering engines rival ati technologies coined term visual processing unit vpu release radeon 9700 2002 arcade system boards using specialized graphics chips since 1970s early video game hardware ram frame buffers expensive video chips composited data together display scanned monitor fujitsu mb14241 video shifter used accelerate drawing sprite graphics various 1970s arcade games taito midway gun fight 1975 sea wolf 1976 space invaders 1978 namco galaxian arcade system 1979 used specialized graphics hardware supporting rgb color multi-colored sprites tilemap backgrounds galaxian hardware widely used golden age arcade video games game companies namco centuri gremlin irem konami midway nichibutsu sega taito home market atari 2600 1977 used video shifter called television interface adaptor atari 8-bit computers 1979 antic video processor interpreted instructions describing display list —the way scan lines map specific bitmapped character modes memory stored need contiguous frame buffer 6502 machine code subroutines could triggered scan lines setting bit display list instruction antic also supported smooth vertical horizontal scrolling independent cpu nec µpd7220 first implementation pc graphics display processor single large scale integration lsi integrated circuit chip enabling design low-cost high-performance video graphics cards number nine visual technology became best known graphics processing unit mid-1980s first fully integrated vlsi large-scale integration metal-oxide-semiconductor nmos graphics display processor pcs supported 1024x1024 resolution laid foundations emerging pc graphics market used number graphics cards licensed clones intel 82720 first intel graphics processing units williams electronics arcade games robotron 2084 joust sinistar bubbles released 1982 contain custom blitter chips operating 16-color bitmaps 1984 hitachi released artc hd63484 first major cmos graphics processor pc artc capable displaying 4k resolution monochrome mode used number pc graphics cards terminals late 1980s 1985 commodore amiga featured custom graphics chip blitter unit accelerating bitmap manipulation line draw area fill functions also included coprocessor simple instruction set capable manipulating graphics hardware registers sync video beam e.g per-scanline palette switches sprite multiplexing hardware windowing driving blitter 1986 texas instruments released tms34010 first fully programmable graphics processor could run general-purpose code graphics-oriented instruction set 1990-1992 chip would become basis texas instruments graphics architecture tiga windows accelerator cards 1987 ibm 8514 graphics system released one first video cards ibm pc compatibles implement fixed-function 2d primitives electronic hardware sharp x68000 released 1987 used custom graphics chipset 65,536 color palette hardware support sprites scrolling multiple playfields eventually serving development machine capcom cp system arcade board fujitsu later competed fm towns computer released 1989 support full 16,777,216 color palette 1988 first dedicated polygonal 3d graphics boards introduced arcades namco system 21 taito air system ibm proprietary video graphics array vga display standard introduced 1987 maximum resolution 640×480 pixels november 1988 nec home electronics announced creation video electronics standards association vesa develop promote super vga svga computer display standard successor ibm proprietary vga display standard super vga enabled graphics display resolutions 800×600 pixels 36 increase 1991 s3 graphics introduced s3 86c911 designers named porsche 911 indication performance increase promised 86c911 spawned host imitators 1995 major pc graphics chip makers added 2d acceleration support chips time fixed-function windows accelerators surpassed expensive general-purpose graphics coprocessors windows performance coprocessors faded away pc market throughout 1990s 2d gui acceleration continued evolve manufacturing capabilities improved level integration graphics chips additional application programming interfaces apis arrived variety tasks microsoft wing graphics library windows 3.x later directdraw interface hardware acceleration 2d games within windows 95 later early- mid-1990s real-time 3d graphics becoming increasingly common arcade computer console games led increasing public demand hardware-accelerated 3d graphics early examples mass-market 3d graphics hardware found arcade system boards sega model 1 namco system 22 sega model 2 fifth-generation video game consoles saturn playstation nintendo 64 arcade systems sega model 2 namco magic edge hornet simulator 1993 capable hardware l transform clipping lighting years appearing consumer graphics cards systems used dsps accelerate transformations fujitsu worked sega model 2 arcade system began working integrating l single lsi solution use home computers 1995 fujitsu pinolite first 3d geometry processor personal computers released 1997 first hardware l gpu home video game consoles nintendo 64 reality coprocessor released 1996 1997 mitsubishi released 3dpro/2mp fully featured gpu capable transformation lighting workstations windows nt desktops ati utilized firegl 4000 graphics card released 1997 term gpu coined sony reference 32-bit sony gpu designed toshiba playstation video game console released 1994 pc world notable failed first tries low-cost 3d graphics chips s3 virge ati rage matrox mystique chips essentially previous-generation 2d accelerators 3d features bolted many even pin-compatible earlier-generation chips ease implementation minimal cost initially performance 3d graphics possible discrete boards dedicated accelerating 3d functions lacking 2d gui acceleration entirely powervr 3dfx voodoo however manufacturing technology continued progress video 2d gui acceleration 3d functionality integrated one chip rendition verite chipsets among first well enough worthy note 1997 rendition went step collaborating hercules fujitsu thriller conspiracy project combined fujitsu fxg-1 pinolite geometry processor vérité v2200 core create graphics card full l engine years nvidia geforce 256 card designed reduce load placed upon system cpu never made market opengl appeared early '90s professional graphics api originally suffered performance issues allowed glide api step become dominant force pc late '90s however issues quickly overcome glide api fell wayside software implementations opengl common time although influence opengl eventually led widespread hardware support time parity emerged features offered hardware offered opengl directx became popular among windows game developers late 90s unlike opengl microsoft insisted providing strict one-to-one support hardware approach made directx less popular standalone graphics api initially since many gpus provided specific features existing opengl applications already able benefit leaving directx often one generation behind see comparison opengl direct3d time microsoft began work closely hardware developers started target releases directx coincide supporting graphics hardware direct3d 5.0 first version burgeoning api gain widespread adoption gaming market competed directly many more-hardware-specific often proprietary graphics libraries opengl maintained strong following direct3d 7.0 introduced support hardware-accelerated transform lighting l direct3d opengl capability already exposed inception 3d accelerator cards moved beyond simple rasterizers add another significant hardware stage 3d rendering pipeline nvidia geforce 256 also known nv10 first consumer-level card released market hardware-accelerated l professional 3d cards already capability hardware transform lighting already existing features opengl came consumer-level hardware '90s set precedent later pixel shader vertex shader units far flexible programmable nvidia first produce chip capable programmable shading geforce 3 code named nv20 pixel could processed short program could include additional image textures inputs geometric vertex could likewise processed short program projected onto screen used xbox console competed playstation 2 used custom vector dsp hardware accelerated vertex processing commonly referred vu0/vu1 earliest incarnations shader execution engines used xbox general purpose could execute arbitrary pixel code vertices pixels processed different units resources pixel shaders much tighter constraints executed much higher frequencies vertices pixel shading engines actually akin highly customizable function block n't really run program many disparities vertex pixel shading would n't addressed much later unified shader model october 2002 introduction ati radeon 9700 also known r300 world first direct3d 9.0 accelerator pixel vertex shaders could implement looping lengthy floating point math quickly becoming flexible cpus yet orders magnitude faster image-array operations pixel shading often used bump mapping adds texture make object look shiny dull rough even round extruded introduction geforce 8 series produced nvidia new generic stream processing unit gpus became generalized computing device today parallel gpus begun making computational inroads cpu subfield research dubbed gpu computing gpgpu general purpose computing gpu found way fields diverse machine learning oil exploration scientific image processing linear algebra statistics 3d reconstruction even stock options pricing determination gpgpu time precursor call compute shaders e.g cuda opencl directcompute actually abused hardware degree treating data passed algorithms texture maps executing algorithms drawing triangle quad appropriate pixel shader obviously entails overheads since involve units like scan converter n't really needed even care triangles except invoke pixel shader years energy consumption gpus increased manage several techniques proposed nvidia cuda platform first introduced 2007 earliest widely adopted programming model gpu computing recently opencl become broadly supported opencl open standard defined khronos group allows development code gpus cpus emphasis portability opencl solutions supported intel amd nvidia arm according recent report evan data opencl gpgpu development platform widely used developers us asia pacific 2010 nvidia began partnership audi power cars dashboards tegra gpus powering cars dashboard offering increased functionality cars navigation entertainment systems advancements gpu technology cars helped push self-driving technology amd radeon hd 6000 series cards released 2010 2011 amd released 6000m series discrete gpus used mobile devices kepler line graphics cards nvidia came 2012 used nvidia 600 700 series cards new feature new gpu microarchitecture included gpu boost technology adjusts clock-speed video card increase decrease according power draw kepler microarchitecture manufactured 28 nm process ps4 xbox one released 2013 use gpus based amd radeon hd 7850 7790 nvidia kepler line gpus followed maxwell line manufactured process 28 nm chips nvidia manufactured tsmc taiwan semiconductor manufacturing company manufacturing using 28 nm process time compared 40 nm technology past new manufacturing process allowed 20 percent boost performance drawing less power virtual reality headsets high system requirements vr headset manufacturers recommended gtx 970 r9 290x better time release pascal next generation consumer graphics cards nvidia released 2016 geforce 10 series cards generation graphics cards made using 16 nm manufacturing process improves upon previous microarchitectures nvidia released one non-consumer card new volta architecture titan v. changes titan xp pascal high-end card include increase number cuda cores addition tensor cores hbm2 tensor cores cores specially designed deep learning high-bandwidth memory on-die stacked lower-clocked memory offers extremely wide memory bus useful titan v intended purpose emphasize titan v gaming card nvidia removed geforce gtx suffix adds consumer gaming cards new generation rtx turing gpus unveiled august 20 2018 add ray-tracing cores gpus improving performance lighting effects polaris 11 polaris 10 gpus amd fabricated 14-nanometer process release results substantial increase performance per watt amd video cards amd also released vega gpus series high end market competitor nvidia high end pascal cards also featuring hbm2 like titan v. many companies produced gpus number brand names 2009 intel nvidia amd/ati market share leaders 49.4 27.8 20.6 market share respectively however numbers include intel integrated graphics solutions gpus counting nvidia amd control nearly 100 market 2018 respective market shares 66 33 addition s3 graphics matrox produce gpus modern smartphones also using mostly adreno gpus qualcomm powervr gpus imagination technologies mali gpus arm modern gpus use transistors calculations related 3d computer graphics addition 3d hardware today gpus include basic 2d acceleration framebuffer capabilities usually vga compatibility mode newer cards like amd/ati hd5000-hd7000 even lack 2d acceleration emulated 3d hardware gpus initially used accelerate memory-intensive work texture mapping rendering polygons later adding units accelerate geometric calculations rotation translation vertices different coordinate systems recent developments gpus include support programmable shaders manipulate vertices textures many operations supported cpus oversampling interpolation techniques reduce aliasing high-precision color spaces computations involve matrix vector operations engineers scientists increasingly studied use gpus non-graphical calculations especially suited embarrassingly parallel problems emergence deep learning importance gpus increased research done indigo found training deep learning neural networks gpus 250 times faster cpus explosive growth deep learning recent years attributed emergence general purpose gpus level competition area asics prominently tensor processing unit tpu made google however require changes existing code gpus still popular gpus made since 1995 support yuv color space hardware overlays important digital video playback many gpus made since 2000 also support mpeg primitives motion compensation idct process hardware accelerated video decoding portions video decoding process video post-processing offloaded gpu hardware commonly referred gpu accelerated video decoding gpu assisted video decoding gpu hardware accelerated video decoding gpu hardware assisted video decoding recent graphics cards even decode high-definition video card offloading central processing unit common apis gpu accelerated video decoding dxva microsoft windows operating system vdpau vaapi xvmc xvba linux-based unix-like operating systems except xvmc capable decoding videos encoded mpeg-1 mpeg-2 mpeg-4 asp mpeg-4 part 2 mpeg-4 avc h.264 divx 6 vc-1 wmv3/wmv9 xvid opendivx divx 4 divx 5 codecs xvmc capable decoding mpeg-1 mpeg-2 video decoding processes accelerated today modern gpu hardware personal computers two main forms gpus many synonyms gpus designed specific usage real-time 3d graphics mass calculations gpus powerful class typically interface motherboard means expansion slot pci express pcie accelerated graphics port agp usually replaced upgraded relative ease assuming motherboard capable supporting upgrade graphics cards still use peripheral component interconnect pci slots bandwidth limited generally used pcie agp slot available dedicated gpu necessarily removable necessarily interface motherboard standard fashion term dedicated refers fact dedicated graphics cards ram dedicated card use fact dedicated gpus removable ram usually specially selected expected serial workload graphics card see gddr sometimes systems dedicated discrete gpus called dis systems opposed uma systems see next section dedicated gpus portable computers commonly interfaced non-standard often proprietary slot due size weight constraints ports may still considered pcie agp terms logical host interface even physically interchangeable counterparts technologies sli nvidia crossfire amd allow multiple gpus draw images simultaneously single screen increasing processing power available graphics integrated graphics processing unit igpu integrated graphics shared graphics solutions integrated graphics processors igp unified memory architecture uma utilize portion computer system ram rather dedicated graphics memory igps integrated onto motherboard part chipset die cpu like amd apu intel hd graphics certain motherboards amd igps use dedicated sideport memory separate fixed block high performance memory dedicated use gpu early 2007 computers integrated graphics account 90 pc shipments less costly implement dedicated graphics processing tend less capable historically integrated processing often considered unfit play 3d games run graphically intensive programs could run less intensive programs adobe flash examples igps would offerings sis via circa 2004 however modern integrated graphics processors amd accelerated processing unit intel hd graphics capable handling 2d graphics low stress 3d graphics gpu extremely memory intensive integrated processing may find competing cpu relatively slow system ram minimal dedicated video memory igps 29.856 gb/s memory bandwidth system ram whereas graphics card may 264 gb/s bandwidth ram gpu core memory bus bandwidth limit performance gpu though multi-channel memory mitigate deficiency older integrated graphics chipsets lacked hardware transform lighting newer ones include newer class gpus competes integrated graphics low-end desktop notebook markets common implementations ati hypermemory nvidia turbocache hybrid graphics cards somewhat expensive integrated graphics much less expensive dedicated graphics cards share memory system small dedicated memory cache make high latency system ram technologies within pci express make possible solutions sometimes advertised much 768mb ram refers much shared system memory becoming increasingly common use general purpose graphics processing unit gpgpu modified form stream processor vector processor running compute kernels concept turns massive computational power modern graphics accelerator shader pipeline general-purpose computing power opposed hard wired solely graphical operations certain applications requiring massive vector operations yield several orders magnitude higher performance conventional cpu two largest discrete see dedicated graphics cards gpu designers amd nvidia beginning pursue approach array applications nvidia amd teamed stanford university create gpu-based client folding home distributed computing project protein folding calculations certain circumstances gpu calculates forty times faster conventional cpus traditionally used applications gpgpu used many types embarrassingly parallel tasks including ray tracing generally suited high-throughput type computations exhibit data-parallelism exploit wide vector width simd architecture gpu furthermore gpu-based high performance computers starting play significant role large-scale modelling three 10 powerful supercomputers world take advantage gpu acceleration gpu supports api extensions c programming language opencl openmp furthermore gpu vendor introduced api works cards amd app sdk cuda amd nvidia respectively technologies allow specified functions called compute kernels normal c program run gpu stream processors makes possible c programs take advantage gpu ability operate large buffers parallel still using cpu appropriate cuda also first api allow cpu-based applications directly access resources gpu general purpose computing without limitations using graphics api since 2005 interest using performance offered gpus evolutionary computation general accelerating fitness evaluation genetic programming particular approaches compile linear tree programs host pc transfer executable gpu run typically performance advantage obtained running single active program simultaneously many example problems parallel using gpu simd architecture however substantial acceleration also obtained compiling programs instead transferring gpu interpreted acceleration obtained either interpreting multiple programs simultaneously simultaneously running multiple example problems combinations modern gpu readily simultaneously interpret hundreds thousands small programs modern workstation gpus nvidia quadro workstation cards using volta turing architectures feature dedicating processing cores tensor-based deep learning applications nvidia current series gpus cores called tensor cores gpus usually significant flops performance increases utilizing 4x4 matrix multiplication division resulting hardware performance 128 tflops applications tensor cores also supposed appear consumer cards running turing architecture possibly navi series consumer cards amd external gpu graphics processor located outside housing computer external graphics processors sometimes used laptop computers laptops might substantial amount ram sufficiently powerful central processing unit cpu often lack powerful graphics processor instead less powerful energy-efficient on-board graphics chip on-board graphics chips often powerful enough playing latest games graphically intensive tasks editing video therefore desirable able attach gpu external bus notebook pci express bus commonly used purpose port may example expresscard mpcie port pcie ×1 5 2.5 gbit/s respectively thunderbolt 1 2 3 port pcie ×4 10 20 40 gbit/s respectively ports available certain notebook systems official vendor support external gpus gained traction recently one notable milestone apple ’ decision officially support external gpus mac os high sierra 10.13.4 also several major hardware vendors hp alienware razer releasing thunderbolt 3 egpu enclosures support continued fuel egpu implementations enthusiasts 2013 438.3 million gpus shipped globally forecast 2014 414.2 million | [
4098,
8196,
2081,
8231,
4139,
2097,
8250,
2113,
6213,
10316,
8296,
8301,
4211,
10361,
6266,
8315,
6268,
10393,
8352,
4257,
4258,
8355,
6311,
4270,
2224,
4276,
4283,
2237,
4286,
2241,
2243,
196,
10440,
2277,
4334,
10485,
2294,
8438,
249,
6... | Test |
10,659 | 5 | Constrained_Application_Protocol:constrained application protocol constrained application protocol coap specialized internet application protocol constrained devices defined rfc 7252 enables constrained devices called nodes communicate wider internet using similar protocols coap designed use devices constrained network e.g. low-power lossy networks devices general nodes internet devices different constrained networks joined internet coap also used via mechanisms sms mobile communication networks coap service layer protocol intended use resource-constrained internet devices wireless sensor network nodes coap designed easily translate http simplified integration web also meeting specialized requirements multicast support low overhead simplicity multicast low overhead simplicity extremely important internet things iot machine-to-machine m2m devices tend deeply embedded much less memory power supply traditional internet devices therefore efficiency important coap run devices support udp udp analogue internet engineering task force ietf constrained restful environments working group core done major standardization work protocol order make protocol suitable iot m2m applications various new functionalities added core protocol specified rfc 7252 important extensions various stages standardization process nodes often 8-bit microcontrollers small amounts rom ram constrained networks ipv6 low-power wireless personal area networks 6lowpans often high packet error rates typical throughput 10s kbit/s protocol designed machine-to-machine m2m applications smart energy building automation core group designed coap following features mind mapping coap http also defined allowing proxies built providing access coap resources via http uniform way introduction coap complete networking stack open-standard protocols suitable constrained devices environments becomes available architecture point view coap server installed end node could sensor hand coap client installed controller manages several end nodes registration meanings behind coap code options content type handled iana shown smallest coap message 4 bytes length omitting token options payload coap makes use two message types requests responses using simple binary base header format base header may followed options optimized type-length-value format coap default bound udp optionally dtls providing high level communications security bytes headers packet considered message body length message body implied datagram length bound udp entire message must fit within single datagram used 6lowpan defined rfc 4944 messages fit single ieee 802.15.4 frame minimize fragmentation three significant bits form number known class analogous class http status codes five least significant bits form code communicates detail request response entire code typically communicated form codice_1 find latest coap request/response codes though list gives examples easily extract information fixed header c via macros many coap application domains essential ability address several coap resources group instead addressing resource individually e.g turn coap-enabled lights room single coap request triggered toggling light switch address need ietf developed optional extension coap form experimental rfc group communication coap rfc 7390 extension relies ip multicast deliver coap request group members use multicast certain benefits reducing number packets needed deliver request members however multicast also limitations poor reliability cache-unfriendly alternative method coap group communication uses unicasts instead multicasts relies intermediary groups created clients send group requests intermediary turn sends individual unicast requests group members collects replies sends back aggregated reply client although protocol standard includes provisions mitigating threat ddos amplification attacks provisions implemented practice resulting presence 580,000 targets primarily located china attacks 320gbps | [
10242,
3847,
649,
9868,
3218,
9365,
10005,
11413,
5402,
1435,
5531,
3742,
10271,
9380,
2085,
9381,
3751,
3752,
10924,
10159,
562,
2996,
9909,
10171,
4797,
3133,
3006,
5181,
5437,
5700,
7364,
2887,
8265,
2509,
4687,
6993,
5843,
2904,
5469,
... | Test |
10,660 | 4 | Truecaller:truecaller truecaller smartphone application features caller-identification call-blocking flash-messaging call-recording chat voice uses internet service requires users provide standard cellular mobile number registering service developed swedish company true software scandinavia ab app available android ios blackberry symbian windows mobile windows phone truecaller developed true software scandinavia ab privately held company stockholm sweden founded alan mamedi nami zarringhalam 2009 initially launched blackberry 1 july 2009 good response users launched symbian microsoft windows mobile released android apple iphone 23 september 2009 rim blackberry 27 february 2012 windows phone 1 march 2012 nokia series 40 3 september 2012 truecaller five million users performing 120 million searches telephone number database every month 22 january 2013 truecaller reached 10 million users january 2017 truecaller reached 250 million users worldwide 18 september 2012 techcrunch announced openocean venture capital fund led former mysql nokia executives including michael widenius founder mysql investing us 1.3 million truecaller push truecaller ’ global reach truecaller said intended use new funding expand footprint key markets —specifically north america asia middle east february 2014 truecaller received 18.8 million funding sequoia capital alongside existing investor openocean truecaller chairman stefan lennhammer unnamed private investor also announced partnership yelp use yelp api data help identify business numbers call smartphone october year received 60 million niklas zennstrom atomico investment firm kleiner perkins caufield byers 7 july 2015 truecaller launched sms app called truemessenger exclusively india truemessenger enables users identify sender sms messages launch aimed increasing company user base india 17 july 2013 truecaller servers allegedly hacked syrian electronic army group claimed twitter handle recovered 459 gbs database primarily due older version wordpress installation servers 18 july 2013 truecaller issued statement blog stating website indeed hacked claiming attack disclose passwords credit card information | [
2208,
11170,
9572,
488,
3626,
7022,
7983,
11347,
1083
] | None |
10,661 | 7 | Apache_ORC:apache orc apache orc optimized row columnar free open-source column-oriented data storage format apache hadoop ecosystem similar columnar-storage file formats available hadoop ecosystem rcfile parquet compatible data processing frameworks hadoop environment february 2013 optimized row columnar orc file format announced hortonworks collaboration facebook month later apache parquet format announced developed cloudera twitter apache orc comparable rcfile parquet file formats -- -all three fall category columnar data storage within hadoop ecosystem better compression encoding improved read performance cost slower writes | [
9344,
10377,
8460,
7567,
1296,
6161,
1047,
8217,
11161,
6555,
8860,
6943,
3877,
11303,
1327,
7983,
4919,
5047,
4538,
1851,
6074,
7485,
7742,
9789,
7233,
6338,
4419,
1222,
1991,
4294,
7750,
5066,
8139,
4944,
1363,
5332,
7767,
8408,
9179,
7... | Validation |
10,662 | 4 | Biclique_attack:biclique attack biclique attack variant meet-in-the-middle mitm method cryptanalysis utilizes biclique structure extend number possibly attacked rounds mitm attack since biclique cryptanalysis based mitm attacks applicable block ciphers iterated hash-functions biclique attacks known broken full aes full idea though slight advantage brute force also applied kasumi cipher preimage resistance skein-512 sha-2 hash functions biclique attack still best publicly known single-key attack aes computational complexity attack formula_1 formula_2 formula_3 aes128 aes192 aes256 respectively publicly known single-key attack aes attacks full number rounds previous attacks attacked round reduced variants typically variants reduced 7 8 rounds computational complexity attack formula_1 theoretical attack means security aes broken use aes remains relatively secure biclique attack nevertheless interesting attack suggests new approach performing cryptanalysis block ciphers attack also rendered information aes brought question safety-margin number rounds used therein original mitm attack first suggested diffie hellman 1977 discussed cryptanalytic properties des argued key-size small reapplying des multiple times different keys could solution key-size however advised using double-des suggested triple-des minimum due mitm attacks mitm attacks easily applied double-des reduce security formula_5 formula_6 since one independently bruteforce first second des-encryption plain- ciphertext since diffie hellman suggested mitm attacks many variations emerged useful situations basic mitm attack inapplicable biclique attack variant first suggested dmitry khovratovich rechberger savelieva use hash-function cryptanalysis however bogdanov khovratovich rechberger showed apply concept bicliques secret-key setting including block-cipher cryptanalysis published attack aes prior mitm attacks aes many block ciphers received little attention mostly due need independent key bits two 'mitm subciphers order facilitate mitm attack — something hard achieve many modern key schedules aes general explanation biclique structure see article bicliques mitm attack keybits formula_7 formula_8 belonging first second subcipher need independent need independent else matched intermediate values plain- ciphertext computed independently mitm attack variants mitm attacks blocks shared key-bits see 3-subset mitm attack property often hard exploit larger number rounds due diffusion attacked cipher br simply put rounds attack larger subciphers larger subciphers fewer independent key-bits subciphers bruteforce independently course actual number independent key-bits subcipher depends diffusion properties key-schedule way biclique helps tackling allows one instance attack 7 rounds aes using mitm attacks utilizing biclique structure length 3 i.e covers 3 rounds cipher map intermediate state start round 7 end last round e.g 10 aes128 thus attacking full number rounds cipher even possible attack amount rounds basic mitm attack meaning biclique thus build structure effectively map intermediate value end mitm attack ciphertext end ciphertext intermediate state gets mapped end course depends key used encryption key used map state ciphertext biclique based keybits bruteforced first second subcipher mitm attack essence biclique attacks thus besides mitm attack able build biclique structure effectively depending keybits formula_7 formula_8 map certain intermediate state corresponding ciphertext get formula_11 intermediate states formula_11 ciphertexts compute keys maps requires formula_13 key-recoveries since intermediate state needs linked ciphertexts preliminary br remember function biclique map intermediate values formula_14 ciphertext-values formula_15 based key formula_16 br formula_17 procedure br step one intermediate state formula_18 ciphertext formula_19 key formula_20 chosen formula_21 formula_22 function maps intermediate state ciphertext using given key denoted base computation step two two sets related keys size formula_11 chosen keys chosen words br input difference 0 map output difference formula_28 key difference formula_31 differences respect base computation br input difference formula_29 map output difference 0 key difference formula_33 differences respect base computation step three since trails share non-linear components s-boxes trails combined get br formula_34 br conforms definitions differentials step 2 br trivial see tuple formula_35 base computation also conforms definition differentials differentials respect base computation substituting formula_36 formula_20 two definitions yield formula_38 since formula_39 formula_40 br means tuple base computation also xor'ed combined trails formula_41 step four trivial see br formula_42 br formula_43 br formula_44 br substituted combined differential trails result br formula_45 br definition earlier biclique br formula_17 thus possible create biclique size formula_13 formula_13 since formula_11 keys first set keys combined formula_11 keys second set keys means biclique size formula_13 created using formula_52 computations differentials formula_28 formula_29 formula_22 formula_56 formula_57 keys formula_16 also different biclique way biclique constructed leading biclique attack aes practical limitations constructing bicliques technique longer biclique rounds differential trails cover diffusion properties cipher thus plays crucial role effectiveness constructing biclique bogdanov khovratovich rechberger also describe another way construct biclique called 'interleaving related-key differential trails article biclique cryptanalysis full aes step one attacker groups possible keys key-subsets size formula_13 formula_60 key group indexed formula_16 matrix size formula_62 attacker splits cipher two sub-ciphers formula_22 formula_64 formula_65 normal mitm attack set keys sub-ciphers cardinality formula_11 called formula_67 formula_68 combined key sub-ciphers expressed aforementioned matrix formula_69 step two attacker builds biclique group formula_13 keys biclique dimension-d since maps formula_11 internal states formula_72 formula_11 ciphertexts formula_74 using formula_13 keys section build biclique suggests build biclique using independent related-key differentials biclique case built using differentials set keys formula_67 formula_68 belonging sub-ciphers step three attacker takes formula_11 possible ciphertexts formula_74 asks decryption-oracle provide matching plaintexts formula_80 step four attacker chooses internal state formula_72 corresponding plaintext formula_80 performs usual mitm attack formula_22 formula_64 attacking internal state plaintext step five whenever key-candidate found matches formula_72 formula_80 key tested another plain-/ciphertext pair key validates pair highly likely correct key following example based biclique attack aes paper biclique cryptanalysis full aes br descriptions example uses terminology authors attack used i.e variable names etc br simplicity attack aes128 variant covered below. br attack consists 7-round mitm attack biclique covering last 3 rounds key-space partitioned formula_87 groups keys group consist formula_88 keys br formula_87 groups unique base-key formula_20 base-computation selected br base-key two specific bytes set zero shown table represents key way aes 4x4 matrix aes128 br remaining 14 bytes 112 bits key enumerated yields formula_87 unique base-keys one group keys br ordinary formula_88 keys group chosen respect base-key chosen nearly identical base-key vary 2 bytes either formula_94 formula_95 shown 4 bytes br gives formula_97 formula_98 combined gives formula_88 different keys formula_16 formula_88 keys constitute keys group respective base key formula_87 bicliques constructed using independent related-key differentials technique described construct biclique section br requirement using technique forward- backward-differential trails need combined share active non-linear elements known case br due way keys step 1 chosen relation base key differential trails formula_28 using keys formula_67 never share active s-boxes non-linear component aes differential trails formula_29 using key formula_68 therefore possible xor differential trails create biclique bicliques created mitm attack almost begin mitm attack formula_11 intermediate values plaintext br formula_108 br formula_11 intermediate values ciphertext br formula_110 br corresponding intermediate states sub-keys formula_67 formula_68 precomputed stored however mitm attack carried order test key formula_16 necessary recalculate parts cipher known vary formula_108 formula_115 backward computation formula_72 formula_117 4 s-boxes needs recomputed forwards computation formula_80 formula_119 3 in-depth explanation amount needed recalculation found biclique cryptanalysis full aes paper example taken intermediate values match key-candidate formula_16 formula_80 formula_72 found key-candidate tested another plain-/ciphertext pair attack lowers computational complexity aes128 formula_123 3–5 times faster bruteforce approach data complexity attack formula_124 memory complexity formula_125 | [
7556,
2567,
3084,
2957,
7056,
658,
660,
1173,
1941,
4128,
4389,
169,
11185,
2357,
10806,
1847,
9528,
2110,
9541,
10315,
6863,
8273,
7635,
212,
9556,
10963,
11349,
2265,
7643,
9697,
8674,
229,
618,
1898,
881,
1654,
7161,
7034,
892
] | None |
10,663 | 3 | UMC_Green_CPU:umc green cpu umc green cpu x86-compatible microprocessor produced umc taiwanese semiconductor company early- mid-1990s offered alternative intel 80486 pin compatible enabling installed 80486 motherboards models power management features intended reduce electricity consumption umc green cpu available different features physical characteristics clock speeds sold limited quantities models feature 8 kb level 1 cache operate clock speeds 25 mhz 33 mhz 40 mhz functionally models except u5d identical differed intended application voltage rating physical packaging u5sd contain floating point unit indistinguishable u5s chips operation though unusual features 486dx pinout opposed common 486sx pinout versions would allow installation certain older motherboards may upgrade sockets hardwired fit 486dx chips one largest chip foundry owners taiwan umc owns several fabrication plants allowed fabricate designs whereas manufacturers notably cyrix contract process third parties ibm texas instruments available models green cpu produced 0.6 μm cmos process chips available plastic ceramic packages different applications majority pqfp variants sold motherboard manufacturers low-cost embedded solution umc u5 series design focused microcode optimizations equivalently clocked intel amd processor required 40 cycles perform integer division whereas umc processors required 7 allowing instruction complete significantly faster performance generally observed higher competing processors clock-for-clock basis 40 mhz u5s model comparable amd am486sx2 66 mhz correctly configured motherboards due error microcode microsoft windows 98 second edition identifies processors intel pentium mmx could cause operating system software running within crash exhibit undefined behavior umc produced small quantity clock doubling processors labeled u486dx2 processors designed compete clock doubling solutions intel 80486dx2 amd am486dx2 cyrix cx486dx2 due ongoing legal troubles umc withdrew u486dx2 production processor ever produced engineering sample never made market manufactured 0.35 μm cmos process contained within ceramic package 1994 intel alleged umc infringed upon patent 80486 microprocessor filed complaints umc distributors umc countered claims anti-trust suit case eventually settled court umc withdrawing product ceasing production 80486-compatible microprocessors result dispute processors prohibited sale within united states visibly labeled placement label varies ceramic u5s u5d models typically display u.s. sale import part silkscreen top chip u5sx u5sd models usually u.s. sale printed onto golden die cover underside package labeling often absent plastic packages | [
499,
10734,
3323
] | Test |
10,664 | 4 | Power_virus:power virus power virus computer program executes specific machine code reach maximum cpu power dissipation thermal energy output central processing units computer cooling apparatus designed dissipate power thermal design power rather maximum power power virus could cause system overheat logic stop processor may cause permanent physical damage power viruses malicious often suites test software used integration testing thermal testing computer components design phase product product benchmarking stability test applications similar programs effect power viruses high cpu usage stay user control used testing cpus example overclocking spinlock poorly written program may cause similar symptoms lasts sufficiently long different micro-architectures typically require different machine code hit maximum power examples machine code appear distributed cpu reference materials | [
3882,
4334,
1776,
7515,
7739
] | Test |
10,665 | 4 | Confederation_of_European_Data_Protection_Organisations:confederation european data protection organisations confederation european data protection organisations cedpo european umbrella organisation data protection organisations cedpo founded september 2011 national data protection organisations european umbrella organisation far 2014 without explicit legal form cedpo pursues promote role data protection officer provide advice balanced practicable effective data protection addition cedpo aims contribute better harmonisation data protection law practices european union eu european economic area eea four founder members cedpo association française des correspondants à la protection des données à caractère personnel afcdp france asociación profesional española de privacidad apep spain gesellschaft für datenschutz und datensicherheit e.v gdd germany nederlands genootschap van functionarissen voor de gegevensbescherming ngfg netherlands present legal entities cedpo include | [
2818
] | Validation |
10,666 | 9 | SuperBASIC:superbasic superbasic advanced variant basic programming language many structured programming additions developed sinclair research jan jones early 1980s originally superbasic intended home computer code-named superspectrum development project later cancelled however superbasic subsequently included rom firmware sinclair ql microcomputer announced january 1984 also serving command line interpreter ql qdos operating system notable first second-generation basic integrated microcomputer operating system making latter user-extendable—as exemplified linus torvalds formative years example illustrates last eight features entering statements entering print fri screen cleared e.g entering new function iso act like extension operating system similarly according ql user guide many operating system commands defined procedures auto 11,2 | [
3718,
7691,
1805,
9997,
786,
11412,
22,
3736,
3481,
9881,
797,
3233,
11683,
5925,
8101,
4136,
8494,
303,
7343,
7983,
11315,
315,
7355,
7486,
7870,
4160,
4674,
8642,
11204,
10750,
712,
847,
5455,
6352,
1879,
92,
11229,
2915,
9188,
5733,
... | Train |
10,667 | 5 | Rsocket:rsocket rsocket application protocol initially developed netflix supports reactive streams motivation behind development replace hypertext transfer protocol http inefficient many tasks microservices communication protocol less overhead rsocket binary protocol use byte stream transports tcp websockets aeron enables following symmetric interaction models via async message passing single connection supports session resumption allow resuming long-lived streams across different transport connections particularly useful mobile‹–›server communication network connections drop switch reconnect frequently | [
9834,
1051
] | None |
10,668 | 9 | Kenneth_E._Iverson:kenneth e. iverson kenneth eugene iverson 17 december 1920 – 19 october 2004 canadian computer scientist noted development programming language apl honored turing award 1979 pioneering effort programming languages mathematical notation resulting computing field knows apl contributions implementation interactive systems educational uses apl programming language theory practice ken iverson born 17 december 1920 near camrose town central alberta canada parents farmers came alberta north dakota ancestors came trondheim norway world war ii served first canadian army royal canadian air force received b.a degree queen university m.sc ph.d. degrees harvard university career worked harvard ibm i. p. sharp associates jsoftware inc. née iverson software inc. iverson suffered stroke working computer new j lab 16 october 2004 died 19 october 2004 age 83 iverson began school 1 april 1926 one-room school initially grade 1 promoted grade 2 3 months grade 4 end june 1927 left school grade 9 depths great depression work family farm thought schooling led becoming schoolteacher desire become one age 17 still school enrolled correspondence course radios de forest training chicago learned calculus self-study textbook world war ii serving royal canadian air force took correspondence courses toward high school diploma war iverson enrolled queen university kingston ontario taking advantage government support ex-servicemen threat air force buddy said would beat brains grasp opportunity graduated 1950 top student bachelor degree mathematics physics continuing education harvard university began department mathematics received master degree 1951 switched department engineering applied physics working howard aiken wassily leontief howard aiken developed harvard mark one first large-scale digital computers wassily leontief economist developing input–output model economic analysis work would later receive nobel prize leontief model required large matrices iverson worked programs could evaluate matrices harvard mark iv computer iverson received ph.d. applied mathematics 1954 dissertation based work harvard iverson met eoin whitney 2-time putnam fellow fellow graduate student alberta future ramifications iverson stayed harvard assistant professor implement world first graduate program automatic data processing period iverson developed notation describing analyzing various topics data processing teaching classes writing brooks automatic data processing appalled find conventional mathematical notation failed fill needs began work extensions notation suitable particular adopted matrix algebra used thesis work systematic use matrices higher-dimensional arrays tensor analysis operators sense heaviside treatment maxwell equations higher-order functions function argument function result notation also field-tested business world 1957 6-month sabbatical spent mckinsey company first published paper using notation description finite sequential processes initially report number 23 bell labs later revised presented fourth london symposium information theory august 1960 iverson stayed harvard five years failed get tenure n't published anything one little book iverson joined ibm research 1960 doubled salary preceded ibm fred brooks advised stick whatever really wanted management starved ideas anything clearly crazy would find support particular allowed finish publish programming language brooks automatic data processing two books described used notation developed harvard automatic data processing programming language began one book material grew magnitude level separation proved wise ibm iverson soon met adin falkoff worked together next twenty years chapter 2 programming language used iverson notation describe ibm 7090 computer early 1963 falkoff later joined iverson ed sussenguth proceeded use notation produce formal description ibm system/360 computer design result published 1964 double issue ibm systems journal thereafter known grey book grey manual book used course computer systems design ibm systems research institute consequence formal description attracted interest bright young minds one hotbed interest stanford university included larry breed phil abrams roger moore charles brenner mike jenkins later made contributions apl donald mcintyre head geology pomona college first general customer installation 360 system used formal description become expert ibm systems engineer assigned pomona completion formal description falkoff iverson turned attention implementation work brought rapid fruition 1965 larry breed phil abrams joined project produced fortran-based implementation 7090 called ivsys iverson system autumn 1965 first batch mode later early 1966 time-shared interactive mode subsequently breed dick lathwell ex university alberta roger moore i. p. sharp associates produced system/360 implementation three received grace murray hopper award 1973 work design implementation apl\360 setting new standards simplicity efficiency reliability response time interactive systems 360 implementation work underway iverson notation renamed apl falkoff workspace 1 cleanspace saved 1966-11-27 22.53.58 utc apl\360 service began within ibm several weeks outside ibm 1968 additional information implementation apl\360 found acknowledgements apl\360 user manual appendix chronology apl development design apl formal description especially implementation drove evolution language process consolidation regularization typography linearization syntax function definition described apl\360 history design apl evolution apl two treatises period conventions governing order evaluation algebra language apologias apl notation notation used falkoff iverson teach various topics various universities ibm systems research institute 1964 iverson used notation one-semester course seniors fox lane high school later swarthmore high school apl became available first application teach formal methods systems design nasa goddard also used hotchkiss school lower canada college scotch plains high school atlanta public schools among others one school students became eager broke school hours get apl computer time another apl enthusiasts steered newbies basic maximize apl time 1969 iverson apl group inaugurated ibm philadelphia scientific center 1970 named ibm fellow used funding came ibm fellow bring visiting teachers professors various fields including donald mcintyre pomona jeff shallit summer student period several months visitors would start using apl expositions fields hope later would continue use apl home institutions iverson work time centered several disciplines including collaborative projects circuit theory genetics geology calculus psc closed 1974 group transferred california others including iverson remained east later transferring back ibm research iverson received turing award 1979 following table lists publications iverson authored co-authored ibm reflect two main strands work 1980 iverson left ibm i. p. sharp associates apl time-sharing company preceded ibm colleagues paul berry joey tuttle dick lathwell eugene mcdonnell ipsa apl language systems group managed eric iverson ken iverson son roger moore one apl\360 implementers vice president iverson worked develop extend apl lines presented operators functions language work gained impetus 1981 arthur whitney iverson produced model apl written apl time working ipsa oag database iverson introduced arthur whitney son eoin whitney apl 11-years-old 1974 recommended summer student position ipsa calgary model apl syntax driven 11-by-5 table whitney also invented rank operator process language design simplified extended rationalized apl january 1983 multiple editions dictionary apl language 1984 1987 dictionary apl september 1987 within ipsa phrase dictionary apl came use denote apl specified dictionary apl referred dictionary dictionary apl syntax controlled 9-by-6 table parsing process precisely succinctly described table 2 primitive monadic ⊥ modeled apl word formation lexing 1970s 1980s main apl vendors ibm stsc ipsa three active developing extending language ibm apl2 based work jim brown work apl2 proceeded intermittently 15 years actual coding starting 1971 apl2 becoming available iup installed user program ibm product classification 1982 stsc experimental apl system called nars designed implemented bob smith nars apl2 differed fundamental respects dictionary apl differed i.p sharp implemented new apl ideas stages complex numbers enclosed boxed arrays match composition operators 1981 determinant operator 1982 rank operator link left right identity functions 1983 however domains operators still restricted primitive functions subsets thereof 1986 ipsa developed sax sharp apl/unix written c based implementation stsc language specified dictionary restrictions domains operators alpha version sax became available within i.p sharp around december 1986 early 1987 education iverson developed sharp apl minicourse used teach ipsa clients use apl applied mathematics programmers mathematics programming used computer science courses t.h twente publications iverson authored co-authored i. p. sharp associates iverson retired i. p. sharp associates 1987 kept busy jobs regarding language design significant activities period invention fork 1988 years struggled find way write f+g calculus scalar operators 1978 til operator 1982 catenation reshape operators 1984 union intersection operators 1987 yoke 1988 finally forks 1988 forks defined follows moreover f g p q r ←→ f g p q r thus write f+g calculus one write f+g apl iverson eugene mcdonnell worked details long plane rides apl88 conference sydney australia iverson coming initial idea waking nap iverson presented rationale work post 1987 follows roger hui described final impetus got j started appendix implementation j hui classmate whitney university alberta studied dictionary apl language jobs modelled parsing process least two different ways investigated uses dictionary apl diverse applications well january 1987 august 1989 access sax later part period used daily basis j initially took dictionary apl specification j interpreter built around table 2 dictionary c data program structures designed parse table c corresponded directly parse table dictionary retrospect iverson apl87 paper apl87 five pages prescribed essential steps writing apl interpreter particular sections word formation parsing arthur whitney addition one-page thing contributed j development suggesting primitives oriented leading axis agreement generalization scalar extension prefix instead suffix total array ordering defined one objectives implement fork turned rather straightforward inclusion one additional row parse table choice implement forks fortuitous fortunate realized later forks made tacit expressions operator expressions complete following sense sentence involving one two arguments use arguments operand written tacitly fork compose left right identity functions constant functions two obvious differences j apl dialects use terms natural languages instead mathematics computer science practice began dictionary apl noun verb adverbs alphabet word formation sentence ... instead array function operator character set lexing expression ... b use 7-bit ascii characters instead special symbols differences j apl described j apl programmer apl j j source code available jsoftware gnu general public license version 3 gpl3 commercial alternative eric iverson founded iverson software inc. february 1990 provide improved sharp apl/pc product quickly became obvious shared interests goals may 1990 iverson hui joined iverson software inc. later joined chris burke company soon became j name changed jsoftware inc. april 2000 publications iverson authored co-authored iverson software inc. jsoftware inc. | [
6529,
5635,
7048,
9993,
10508,
11020,
6160,
8599,
1178,
667,
8987,
1702,
2216,
2482,
1976,
4921,
9019,
4799,
4800,
10049,
4930,
11075,
70,
8262,
3529,
1099,
7630,
2519,
1883,
11099,
7775,
9825,
8695,
9315,
11625,
6378,
2283,
4331,
11242,
... | None |
10,669 | 3 | Explicitly_parallel_instruction_computing:explicitly parallel instruction computing explicitly parallel instruction computing epic term coined 1997 hp–intel alliance describe computing paradigm researchers investigating since early 1980s paradigm also called independence architectures basis intel hp development intel itanium architecture hp later asserted epic merely old term itanium architecture epic permits microprocessors execute software instructions parallel using compiler rather complex on-die circuitry control parallel instruction execution intended allow simple performance scaling without resorting higher clock frequencies 1989 researchers hp recognized reduced instruction set computer risc architectures reaching limit one instruction per cycle began investigation new architecture later named epic basis research vliw multiple operations encoded every instruction processed multiple execution units one goal epic move complexity instruction scheduling cpu hardware software compiler instruction scheduling statically help trace feedback information eliminates need complex scheduling circuitry cpu frees space power functions including additional execution resources equally important goal exploit instruction level parallelism ilp using compiler find exploit additional opportunities parallel execution vliw least original forms several short-comings precluded becoming mainstream epic architecture evolved vliw architecture retained many concepts superscalar architecture epic architectures add several features get around deficiencies vliw epic architecture also includes grab-bag architectural concepts increase ilp itanium architecture also added rotating register files tool useful software pipelining since avoids manually unroll rename registers investigations epic architectures directly tied development itanium architecture | [
7173,
9739,
4108,
9741,
5649,
2066,
7699,
5655,
10779,
10781,
6181,
8231,
3630,
6705,
7218,
2623,
2113,
7234,
3142,
2638,
7770,
1119,
1122,
3175,
4204,
8815,
8820,
630,
8822,
4217,
6268,
3197,
8325,
7313,
8851,
6804,
6815,
8352,
5793,
681... | Test |
10,670 | 9 | Guido_van_Rossum:guido van rossum guido van rossum born 31 january 1956 dutch programmer best known author python programming language benevolent dictator life bdfl stepped position july 2018 currently member python steering council van rossum born raised netherlands received master degree mathematics computer science university amsterdam 1982 brother van rossum type designer programmer designed typeface used python powered logo guido lives belmont california wife kim knapp son according home page dutch naming conventions van name capitalized referred surname alone using first last name together working centrum wiskunde informatica cwi van rossum wrote contributed glob routine bsd unix 1986 helped develop abc programming language stated try mention abc influence 'm indebted everything learned project people worked also created grail early web browser written python engaged discussions html standard worked various research institutes including centrum wiskunde informatica cwi netherlands u.s. national institute standards technology nist corporation national research initiatives cnri 2000 2003 worked zope corporation 2003 van rossum left zope elemental security worked custom programming language organization 2005 december 2012 worked google spent half time developing python language january 2013 started working dropbox december 1989 van rossum looking hobby programming project would keep occupied week around christmas office closed decided write interpreter new scripting language thinking lately descendant abc would appeal unix/c hackers attributes choosing name python slightly irreverent mood big fan monty python flying circus explained python predecessor abc inspired setl noting abc co-developer lambert meertens spent year setl group nyu coming final abc design july 2018 van rossum announced would stepping position bdfl python programming language 1999 van rossum submitted funding proposal darpa called computer programming everybody defined goals python python grown become popular programming language 2018 third popular language github social coding website behind javascript java according programming language popularity survey consistently amongst top 10 mentioned languages job postings furthermore python consistently top 10 popular languages according tiobe programming community index google van rossum developed mondrian web-based code review system written python used within company named software dutch painter piet mondrian named another related software project gerrit rietveld dutch designer 2013 van rossum started working cloud file storage company dropbox | [
4483,
7684,
3462,
4623,
9875,
6947,
5677,
9151,
5699,
1611,
716,
595,
11221,
10584,
11497,
8554,
8301,
9714,
5492,
8057,
2045,
8446
] | None |
10,671 | 4 | Richard_Menta:richard menta richard menta american journalist publisher mp3 newswire known decade commentary followed evolution digital media intellectual property protection menta also information security professional 1990s menta worked various publishers including simon schuster american lawyer media built business models designed leverage offline content online world included early experimentation digital audio video oversaw eventually led found mp3 newswire 1999 menta steered mp3 newswire original content making place knowledgeable professionals share opinions | [
5373
] | Test |
10,672 | 9 | Architecture_description_language:architecture description language architecture description languages adls used several disciplines system engineering software engineering enterprise modelling engineering system engineering community uses architecture description language language and/or conceptual model describe represent system architectures software engineering community uses architecture description language computer language create description software architecture case so-called technical architecture architecture must communicated software developers functional architecture communicated various stakeholders users adls developed acme developed cmu aadl standardized sae c2 developed uci sbc-adl developed national sun yat-sen university darwin developed imperial college london wright developed cmu iso/iec/ieee 42010 document systems software engineering—architecture description defines architecture description language form expression use architecture descriptions specifies minimum requirements adls enterprise modelling engineering community also developed architecture description languages catered enterprise level examples include archimate standard open group demo abacus developed university technology sydney languages necessarily refer software components etc however refer application architecture architecture communicated software engineers writing refers primarily perspective software engineering community standard notation adl representing architectures helps promote mutual communication embodiment early design decisions creation transferable abstraction system architectures past largely represented box-and-line drawing annotated things nature component properties semantics connections overall system behavior adls result linguistic approach formal representation architectures address shortcomings also important sophisticated adls allow early analysis feasibility testing architectural design decisions adls classified three broad categories box-and-line informal drawings formal architecture description language uml unified modeling language -based notations box-and-line long time predominant means describing sas providing useful documentation level informality limited usefulness architecture description rigorous way describing sas required quoting allen garlan 1997 box-and-line descriptions may provide useful documentation current level informality limits usefulness since generally imprecise meant architectural descriptions may impossible analyze architecture consistency determine non-trivial properties moreover way check system implementation faithful architectural design similar conclusion drawn perry wolf 1992 reports aside providing clear precise documentation primary purpose specifications provide automated analysis documents expose various kinds problems would otherwise go undetected since thread research formal languages sa description carried tens formal adls proposed characterized different conceptual architectural elements different syntax semantics focusing specific operational domain suitable different analysis techniques example domain-specific adls presented deal embedded real-time systems aadl east-adl eadl control-loop applications diaspec product line architectures koala dynamic systems π-adl analysis-specific adls proposed deal availability reliability security resource consumption data quality real-time performance analysis aadl behavioral analysis fractal trustworthiness analysis tadl however efforts seen desired adoption industrial practice reasons lack industry adoption analyzed woods hilliard pandey clements others formal adls rarely integrated software life-cycle seldom supported mature tools scarcely documented focusing specific needs leaving space extensions enabling addition new features way overcome limitations uml indicated possible successor existing adls many proposals presented use extend uml properly model software architectures fact highlighted recent study conducted practitioners whilst practitioners generally satisfied design capabilities provided languages use dissatisfied architectural language analysis features abilities define extra-functional properties architectural languages used practice mostly originate industrial development instead academic research formality better usability required architectural language large variety adls developed either academic industrial groups many languages intended adl turn suitable representing analyzing architecture principle adls differ requirements languages adls rooted solution space whereas requirements describe problem spaces differ programming languages adls bind architectural abstractions specific point solutions modeling languages represent behaviors adls focus representation components however domain specific modeling languages dsmls focus representation components minimal requirements language must adls common adls differ ability adl community generally agrees software architecture set components connections among different kind architectures like adls implement interface connection architecture architecture context software systems roughly divided categories primarily software architecture network architecture systems architecture within categories tangible fuzzy distinction architecture design draw distinction universally clearly possible best consider design noun rather verb comparison two nouns design abstraction specification patterns organs functionality implemented architecture degree higher abstraction granularity consequentially architecture also topological nature design specifies major components meet relate one another architecture focuses partitioning major regions functionality high level components physically virtually reside off-the-shelf components may employed effectively general interfaces component expose protocols employed practices high level patterns may best meet extensibility maintainability reliability durability scalability non-functional objectives design detailing choices concrete clarification functional requirements met delegation pieces functionality granular components smaller components organized within larger ones oftentimes portion architecture done conceptualization application system network may appear non-functional sections requirement documentation canonically design specified requirements rather driven process defining architecture may involve heuristics acquired architect architectural team experience within domain design architecture often evolves series iterations wisdom high level design often tested low level design implementation occurs wisdom architecture tested specification high level design cases wisdom specification called question detailing another iteration either architecture design case may may become necessary summary primary differences architecture design ones granularity abstraction consequentially chronology architecture generally precedes design although overlap circular iteration common reality list gives candidates best adl date up-to-date list currently existing architectural languages please refer up-to-date list adls approaches architecture | [
9345,
2374,
987,
8262,
9926,
4042,
8975,
6032,
305,
1459,
6420,
7444,
9780,
3159,
7802,
187
] | None |
10,673 | 2 | Access_token:access token computer systems access token contains security credentials login session identifies user user groups user privileges cases particular application typically one may asked enter access token example 40 character long gibberish rather usual password therefore kept secret like password access token object encapsulating security identity process thread token used make security decisions store tamper-proof information system entity token generally used represent security information capable holding additional free-form data attached token created tokens duplicated without special privilege example create new token lower levels access rights restrict access launched application access token used windows process thread tries interact objects security descriptors securable objects windows access token represented system object type codice_1 access token generated logon service user logs system credentials provided user authenticated authentication database authentication database contains credential information required construct initial token logon session including user id primary group id groups part information token attached initial process created user session inherited subsequent processes created initial process whenever process opens handle resource access control enabled windows reconciles data target object security descriptor contents current effective access token result access check evaluation indication whether access allowed operations read write/modify etc calling application allowed perform two types tokens available token composed various fields including | [
5643,
1551,
4624,
537,
540,
3102,
9762,
2083,
8227,
8740,
10281,
7729,
2101,
10812,
3648,
7754,
10828,
4173,
4174,
9808,
9813,
10839,
603,
9819,
93,
6750,
3170,
622,
9839,
4210,
7796,
7290,
4731,
10879,
8841,
3723,
2193,
9874,
10900,
4248... | Test |
10,674 | 2 | List_of_Sony_Ericsson_products:list sony ericsson products following list products manufactured sony ericsson brand models released multiple names depending region release currently usually indicated letter added end model number international north america c mainland china indicated mostly older models slightly differing model number typically one version european us market another asian market however models yet versions walkman branded models also released non-walkman version sony ericsson w580 s500 versions usually differ slightly phones boldface indicates phone smartphone status p indicates production discontinued u indicates upcoming sony ericsson c902 released second quarter 2008 java based feature device running sony ericsson proprietary a200 platform special feature presence 8 touch sensitive keys using capacitive technology camera mode camera technology includes face detection music player similar system used company walkman series handsets phone first sony ericsson new 'cyber-shot c-series phones designed successor popular k800i k850 c902 featured james bond film quantum solace praised user interface design build quality although device received favourable reviews analysts expect reach level popularity sales predecessor k800i intended flagship model sony ericsson g700 announced mobile world congress formerly 3gsm congress february 2008 based symbian os 9.1 uiq 3.0 platform handset average reviews lot reviewers criticizing phone priced high better equipped g900 price bracket others lamented fact sony ericsson chose implement technology presented late 2006 p1 business edition also exists sony ericsson g700 camera announced 2008 mobile world congress formerly 3gsm congress february year g900 mid-to-high-end smartphone based symbian 9.1 uiq 3.0 platform phone sports high quality sound 3g wi-fi clear 5.0-megapixel camera phones cyber-shot branding first entertainment unlimited phones announced launched 2009 creating new category benefits audio images combined smart good-looking high-performing devices apart first-rate audio-visual strength products common differentiating factors user interface borrowing wider sony group ui-developments aino first product connects world sony playstation remotely via remote media play vivaz first sony ericsson phone supporting high definition hd video capture note lists intended inclusive information may missing date note lists incomplete information may missing sun visor handsfree bluetooth hch- xx phone holder following speaker drain power fastport batteries wall socked needed newer products without fastport fastport models trrs 4-pole 3.5 mm jack omtp models | [
1121,
11271,
1833,
10674,
1083,
8285
] | Validation |
10,675 | 3 | Multi-core_processor:multi-core processor multi-core processor computer processor integrated circuit two separate processing units called cores reads executes program instructions computer several processors instructions ordinary cpu instructions add move data branch single processor run instructions separate cores time increasing overall speed programs support multithreading parallel computing techniques manufacturers typically integrate cores onto single integrated circuit die known chip multiprocessor cmp onto multiple dies single chip package microprocessors currently used almost personal computers multi-core multi-core processor implements multiprocessing single physical package designers may couple cores multi-core device tightly loosely example cores may may share caches may implement message passing shared-memory inter-core communication methods common network topologies interconnect cores include bus ring two-dimensional mesh crossbar homogeneous multi-core systems include identical cores heterogeneous multi-core systems cores identical e.g big.little heterogeneous cores share instruction set amd accelerated processing units cores n't even share instruction set single-processor systems cores multi-core systems may implement architectures vliw superscalar vector multithreading multi-core processors widely used across many application domains including general-purpose embedded network digital signal processing dsp graphics gpu improvement performance gained use multi-core processor depends much software algorithms used implementation particular possible gains limited fraction software run parallel simultaneously multiple cores effect described amdahl law best case so-called embarrassingly parallel problems may realize speedup factors near number cores even problem split enough fit within core cache avoiding use much slower main-system memory applications however accelerated much unless programmers invest prohibitive amount effort re-factoring whole problem parallelization software significant ongoing topic research terms multi-core dual-core commonly refer sort central processing unit cpu sometimes also applied digital signal processors dsp system chip soc terms generally used refer multi-core microprocessors manufactured integrated circuit die separate microprocessor dies package generally referred another name multi-chip module article uses terms multi-core dual-core cpus manufactured integrated circuit unless otherwise noted contrast multi-core systems term multi-cpu refers multiple physically separate processing-units often contain special circuitry facilitate communication terms many-core massively multi-core sometimes used describe multi-core architectures especially high number cores tens thousands systems use many soft microprocessor cores placed single fpga core considered semiconductor intellectual property core well cpu core manufacturing technology improves reducing size individual gates physical limits semiconductor-based microelectronics become major design concern physical limitations cause significant heat dissipation data synchronization problems various methods used improve cpu performance instruction-level parallelism ilp methods superscalar pipelining suitable many applications inefficient others contain difficult-to-predict code many applications better suited thread-level parallelism tlp methods multiple independent cpus commonly used increase system overall tlp combination increased available space due refined manufacturing processes demand increased tlp led development multi-core cpus several business motives drive development multi-core architectures decades possible improve performance cpu shrinking area integrated circuit ic reduced cost per device ic alternatively circuit area transistors could used design increased functionality especially complex instruction set computing cisc architectures clock rates also increased orders magnitude decades late 20th century several megahertz 1980s several gigahertz early 2000s rate clock speed improvements slowed increased use parallel computing form multi-core processors pursued improve overall processing performance multiple cores used cpu chip could lead better sales cpu chips two cores example intel produced 48-core processor research cloud computing core x86 architecture since computer manufacturers long implemented symmetric multiprocessing smp designs using discrete cpus issues regarding implementing multi-core processor architecture supporting software well known additionally order continue delivering regular performance improvements general-purpose processors manufacturers intel amd turned multi-core designs sacrificing lower manufacturing-costs higher performance applications systems multi-core architectures developed alternatives especially strong contender established markets integration peripheral functions chip proximity multiple cpu cores die allows cache coherency circuitry operate much higher clock rate possible signals travel off-chip combining equivalent cpus single die significantly improves performance cache snoop alternative bus snooping operations put simply means signals different cpus travel shorter distances therefore signals degrade less higher-quality signals allow data sent given time period since individual signals shorter need repeated often assuming die physically fit package multi-core cpu designs require much less printed circuit board pcb space multi-chip smp designs also dual-core processor uses slightly less power two coupled single-core processors principally decreased power required drive signals external chip furthermore cores share circuitry like l2 cache interface front-side bus fsb terms competing technologies available silicon die area multi-core design make use proven cpu core library designs produce product lower risk design error devising new wider-core design also adding cache suffers diminishing returns multi-core chips also allow higher performance lower energy big factor mobile devices operate batteries since core multi-core cpu generally energy-efficient chip becomes efficient single large monolithic core allows higher performance less energy challenge however additional overhead writing parallel code maximizing usage computing resources provided multi-core processors requires adjustments operating system os support existing application software also ability multi-core processors increase application performance depends use multiple threads within applications integration multi-core chip lower chip production yields also difficult manage thermally lower-density single-core designs intel partially countered first problem creating quad-core designs combining two dual-core ones single die unified cache hence two working dual-core dies used opposed producing four cores single die requiring four work produce quad-core cpu architectural point view ultimately single cpu designs may make better use silicon surface area multiprocessing cores development commitment architecture may carry risk obsolescence finally raw processing power constraint system performance two processing cores sharing system bus memory bandwidth limits real-world performance advantage 2009 report dr jun ni showed single core close memory-bandwidth limited going dual-core might give 30 70 improvement memory bandwidth problem 90 improvement expected however amdahl law makes claim dubious would possible application used two cpus end running faster single-core one communication cpus limiting factor would count 100 improvement trend processor development towards ever-increasing number cores processors hundreds even thousands cores become theoretically possible addition multi-core chips mixed simultaneous multithreading memory-on-chip special-purpose heterogeneous asymmetric cores promise performance efficiency gains especially processing multimedia recognition networking applications example big.little core includes high-performance core called 'big low-power core called 'little also trend towards improving energy-efficiency focusing performance-per-watt advanced fine-grain ultra fine-grain power management dynamic voltage frequency scaling i.e laptop computers portable media players chips designed outset large number cores rather evolved single core designs sometimes referred manycore designs emphasising qualitative differences composition balance cores multi-core architecture show great variety architectures use one core design repeated consistently homogeneous others use mixture different cores optimized different heterogeneous role article cpu designers debate multi-core future rick merritt ee times 2008 includes comments outdated version anti-virus application may create new thread scan process gui thread waits commands user e.g cancel scan cases multi-core architecture little benefit application due single thread heavy lifting inability balance work evenly across multiple cores programming truly multithreaded code often requires complex co-ordination threads easily introduce subtle difficult-to-find bugs due interweaving processing data shared threads see thread-safety consequently code much difficult debug single-threaded code breaks perceived lack motivation writing consumer-level threaded applications relative rarity consumer-level demand maximum use computer hardware although threaded applications incur little additional performance penalty single-processor machines extra overhead development difficult justify due preponderance single-processor machines also serial tasks like decoding entropy encoding algorithms used video codecs impossible parallelize result generated used help create next result entropy decoding algorithm given increasing emphasis multi-core chip design stemming grave thermal power consumption problems posed significant increase processor clock speeds extent software multithreaded take advantage new chips likely single greatest constraint computer performance future developers unable design software fully exploit resources provided multiple cores ultimately reach insurmountable performance ceiling telecommunications market one first needed new design parallel datapath packet processing quick adoption multiple-core processors datapath control plane mpus going replace traditional network processors based proprietary microcode picocode parallel programming techniques benefit multiple cores directly existing parallel programming models cilk plus openmp openhmpp fastflow skandium mpi erlang used multi-core platforms intel introduced new abstraction c++ parallelism called tbb research efforts include codeplay sieve system cray chapel sun fortress ibm x10 multi-core processing also affected ability modern computational software development developers programming newer languages might find modern languages support multi-core functionality requires use numerical libraries access code written languages like c fortran perform math computations faster newer languages like c intel mkl amd acml written native languages take advantage multi-core processing balancing application workload across processors problematic especially different performance characteristics different conceptual models deal problem example using coordination language program building blocks programming libraries higher-order functions block different native implementation processor type users simply program using abstractions intelligent compiler chooses best implementation based context managing concurrency acquires central role developing parallel applications basic steps designing parallel applications hand server side multi-core processors ideal allow many users connect site simultaneously independent threads execution allows web servers application servers much better throughput vendors may license software per processor give rise ambiguity processor may consist either single core combination cores embedded computing operates area processor technology distinct mainstream pcs technological drives towards multi-core apply indeed many cases application natural fit multi-core technologies task easily partitioned different processors addition embedded software typically developed specific hardware release making issues software portability legacy code supporting independent developers less critical case pc enterprise computing result easier developers adopt new technologies result greater variety multi-core processing architectures suppliers multi-core network processors become mainstream companies freescale semiconductor cavium networks wintegra broadcom manufacturing products eight processors system developer key challenge exploit cores devices achieve maximum networking performance system level despite performance limitations inherent symmetric multiprocessing smp operating system companies 6wind provide portable packet processing software designed networking data plane runs fast path environment outside operating system network device digital signal processing trend applies texas instruments three-core tms320c6488 four-core tms320c5441 freescale four-core msc8144 six-core msc8156 stated working eight-core successors newer entries include storm-1 family stream processors inc 40 80 general purpose alus per chip programmable c simd engine picochip three-hundred processors single die focused communication applications heterogeneous computing system uses one kind processor cores multi-core solutions becoming common xilinx zynq ultrascale+ mpsoc quad-core arm cortex-a53 dual-core arm cortex-r5 software solutions openamp used help inter processor communication mobile devices may use arm big.little architecture research development multicore processors often compares many options benchmarks developed help evaluations existing benchmarks include splash-2 parsec cosmic heterogeneous systems | [
3586,
9732,
7173,
9224,
9739,
4108,
4622,
5649,
2066,
7697,
7699,
5655,
10779,
10781,
6181,
10277,
8231,
6184,
10789,
4139,
8237,
3630,
9774,
5681,
6705,
7218,
9782,
4664,
4669,
2623,
2113,
7234,
7745,
3142,
2635,
4173,
2638,
9302,
10838,
... | Test |
10,676 | 2 | Myarc_Disk_Operating_System:myarc disk operating system mdos short myarc disk operating system operating system commercialized myarc designed implemented specifically geneve 9640 paul charlton mdos designed fully emulate ti-99/4a computer providing advanced time virtual memory operating environment full support mouse gui complex mathematical applications mdos written specifically tms9995 16-bit cpu yamaha v9938 video display processor | [
2179,
10499,
10883,
394,
3978,
1804,
6797,
273,
7057,
6675,
7187,
11539,
9366,
11667,
6296,
25,
10776,
8092,
4637,
7325,
9887,
10016,
9762,
421,
5158,
10235,
2345,
7983,
3248,
7217,
11184,
6837,
823,
9784,
4409,
10809,
6075,
7483,
6078,
2... | Test |
10,677 | 4 | Ticket_(IT_security):ticket security security ticket number generated network server client delivered different server means authentication proof authorization easily forged usage word originated mit kerberos protocol 1980s tickets may either transparent meaning recognized without contacting server generated opaque meaning original server must contacted verify issued ticket magic cookies provide functionality ticket | [
7368,
4490,
6098,
8760,
5433,
2558
] | Test |
10,678 | 4 | IBM_4765:ibm 4765 ibm 4765 pcie cryptographic coprocessor hardware security module hsm includes secure cryptoprocessor implemented high-security tamper resistant programmable pcie board specialized cryptographic electronics microprocessor memory random number generator housed within tamper-responding environment provide highly secure subsystem data processing cryptography performed ibm 4765 validated fips pub 140-2 level 4 highest level certification achievable commercial cryptographic devices ibm 4765 data sheet describes coprocessor detail ibm supplies two cryptographic-system implementations toolkits custom application development also available applications may include financial pin transactions bank-to-clearing-house transactions emv transactions integrated circuit chip based credit cards general-purpose cryptographic applications using symmetric key algorithms hashing algorithms public key algorithms operational keys symmetric rsa private generated coprocessor saved either keystore file application memory encrypted master key coprocessor coprocessor identical master key use keys ibm supports 4765 ibm z ibm power systems ibm-approved x86 servers linux microsoft windows may 2011 ibm 4765 superseded ibm 4764 discontinued ibm 4765 discontinued platforms successor 4765 ibm 4767 introduced ibm server platforms links point various relevant cryptographic standards iso 13491 secure cryptographic devices https //www.iso.org/standard/61137.html iso 9564 pin security https //www.iso.org/standard/68669.html ansi x9.24 part 1 key management using symmetric techniques https //webstore.ansi.org/recorddetail.aspx sku=ansi+x9.24-1-2017 ansi x9.24 part 2 key management using asymmetric techniques https //webstore.ansi.org/recorddetail.aspx sku=ansi+x9.24-2-2016 fips 140-2 https //nvlpubs.nist.gov/nistpubs/fips/nist.fips.140-2.pdf | [
6797,
2382,
823
] | Test |
10,679 | 3 | Indiana_Jones_and_the_Last_Crusade:_The_Action_Game:indiana jones last crusade action game indiana jones last crusade action game published 1989 lucasfilm games based film name game released zx spectrum amstrad cpc commodore 64 atari st amiga ibm pc msx master system nes game boy sega genesis game gear different game also released 1989 also different game nintendo entertainment system titled indiana jones last crusade released taito 1991 movie player quest find holy grail en route player must find cross coronado knight first crusade shield indiana father grail diary computer gaming world gave game negative review said another search recover game little indiana jones review praised graphics sound found fight sequences easy short since enemies could defeated one hit turned backs shortly attacking player compute liked commodore 64 version approving graphics describing gameplay quite addicting criticizing lack savegame replay value zx spectrum sales charts reached number two behind robocop number one every month year nintendo power reviewing nes version praised action gameplay noted music levels helped recreate feel movie nintendo power impressed character graphics stated animation quite good nes nintendo power praised game boy version graphics password system challenging gameplay criticized poor hit detection time limits level made game difficult action game features six levels password feature game players rated nes version 52 percent | [
5400,
9166,
973,
9006
] | None |
10,680 | 9 | BLISS:bliss bliss system programming language developed carnegie mellon university w. a. wulf d. b. russell a. n. habermann around 1970 perhaps best known systems programming language right c made debut years later since c took bliss faded obscurity c infancy projects within bell labs debating merits bliss vs. c. bliss typeless block-structured language based expressions rather statements includes constructs exception handling coroutines macros include goto statement name variously said short basic language implementation system software system software implementation language backwards sometimes called bill language implementing system software bill wulf original carnegie mellon compiler notable extensive use optimizations formed basis classic book design optimizing compiler dec developed maintained bliss compilers pdp-10 pdp-11 vax dec prism mips dec alpha intel ia-32 language become popular among customers compiler dec used heavily in-house 1980s utility programs vms operating system written bliss-32 acquisition dec compaq developed maintained bliss compiler intel ia-64 bliss language following characteristics following example taken verbatim bliss language manual | [
512,
9345,
2179,
5380,
4998,
7561,
8474,
1952,
7337,
7983,
2619,
2620,
7234,
3142,
8262,
1611,
11219,
11604,
7134,
5855,
4069,
5612,
8435,
9331,
757,
4092,
2045
] | Train |
10,681 | 1 | Amazon_Relational_Database_Service:amazon relational database service amazon relational database service amazon rds distributed relational database service amazon web services aws web service running cloud designed simplify setup operation scaling relational database use applications administration processes like patching database software backing databases enabling point-in-time recovery managed automatically scaling storage compute resources performed single api call aws offer ssh connection rds instances amazon rds first released 22 october 2009 supporting mysql databases followed support oracle database june 2011 november 2014 aws announced amazon aurora mysql-compatible database offering enhanced high availability performance october 2017 postgresql-compatible database offering launched.. march 2019 aws announced support postgresql 11 rds five months official release new database instances launched aws management console using amazon rds apis amazon rds offers different features support different use cases major features may 2010 amazon announced multi-availability zone deployment support amazon rds multi-availability zone az allows users automatically provision maintain synchronous physical logical “ standby ” replica depending database engine different availability zone independent infrastructure physically separate location multi-az database instance developed creation time modified run multi-az deployment later multi-az deployments aim provide enhanced availability data durability mysql mariadb oracle postgresql sql server instances targeted production environments event planned database maintenance unplanned service disruption amazon rds automatically fails up-to-date standby allowing database operations resume without administrative intervention multi-az rds instances optional cost associated creating rds instance user asked would like use multi-az rds instance multi-az rds deployments backups done standby instance i/o activity suspended time may experience elevated latencies minutes backups read replicas allow different uses case scale read-heavy database workloads available five replicas mysql mariadb postgresql instances use native asynchronous replication functionality respective database engines backups configured default accessible used read scaling mysql mariadb read replicas made writeable since october 2012 postgresql read replicas support replicas done database server level support replication database instance table level performance metrics amazon rds available aws management console amazon cloudwatch api december 2015 amazon announced optional enhanced monitoring feature provides expanded set metrics mysql mariadb aurora database engines amazon rds instances priced similarly amazon elastic compute cloud ec2 rds charged per hour comes two packages on-demand db instances reserved db instances on-demand instances ongoing hourly usage rate reserved db instances require up-front one-time fee turn provide discount hourly usage charge instance apart hourly cost running rds instance users charged amount storage provisioned data transfers input output operations performed aws introduced provisioned input output operations user define many io per second required application iops contribute significantly total cost running rds instance part aws free tier amazon rds free tier helps new aws customers get started managed database service cloud free use amazon rds free tier develop new applications test existing applications simply gain hands-on experience amazon rds amazon rds creates saves automated backups rds db instances first snapshot db instance contains data full db instance subsequent snapshots incremental maximum retention period 35 days multi-az rds deployments backups done standby instance i/o activity suspended amount time may experience elevated latencies minutes backups database instances managed aws management console using amazon rds apis using aws cli since 1 june 2017 stop aws rds instances aws management console aws cli 7 days time 7 days automatically started since september 2018 rds instances protected accidental deletion increase db space supported decrease allocated space additionally least six-hour period new allocation done december 2017 amazon rds supports 36 db instance types 27 latest generation support different types workloads several vendors provide cloud database services similar amazon rds oracle offers oracle cloud database service supporting oracle database technology microsoft offers windows azure sql service supporting microsoft sql relational databases competitors supporting mysql include rackspace cloud databases google cloud sql hp cloud mysql xeround cloud database cleardb | [
11392,
8962,
2051,
8451,
6027,
4236,
10893,
911,
1935,
4623,
8592,
2965,
11030,
2328,
1816,
4377,
8986,
5660,
11038,
6307,
10020,
11556,
3366,
2170,
5159,
2217,
9766,
6444,
10286,
7983,
8495,
3121,
7352,
2496,
4289,
11201,
9286,
1224,
5960,... | None |
10,682 | 4 | LDAP_injection:ldap injection computer security ldap injection code injection technique used exploit web applications could reveal sensitive user information modify information represented ldap lightweight directory access protocol data stores ldap injection exploits security vulnerability application manipulating input parameters passed internal search add modify functions application fails properly sanitize user input possible attacker modify ldap statement ldap injection occurs user input properly sanitized used part dynamically generated ldap filter results potential manipulation ldap statements performed ldap server either view modify bypass authentication credentials ldap injection known attack prevented simple measures client supplied input must checked/sanitized characters may result malicious behavior input validation verify input checking presence special characters part ldap query language known data types legal values etc white list input validation also used detect unauthorized input passed ldap query example query constructed validate user credentials purpose logging codice_1 typical use case user would provide user credentials filter would used validate credentials however attacker enter crafted input variable codice_2 codice_3 value password finished query become codice_4 first portion query processed ldap server codice_5 always evaluates true allowing attacker gain access system without needing provide valid user credentials | [
899,
5404,
2558
] | Test |
10,683 | 9 | Jython:jython jython implementation python programming language designed run java platform implementation formerly known jpython 1999 jython programs import use java class except standard modules jython programs use java classes instead python modules jython includes almost modules standard python programming language distribution lacking modules implemented originally c. example user interface jython could written swing awt swt jython compiles java bytecode intermediate language either demand statically jython initially created late 1997 replace c java performance-intensive code accessed python programs moving sourceforge october 2000 python software foundation awarded grant january 2005 jython 2.5 released june 2009 recent release jython 2.7.1 released 1 july 2017 compatible python 2.7 although jython implements python language specification differences incompatibilities cpython reference implementation python version 2.2 jython including standard library released python software foundation license v2 older versions covered jython 2.0 2.1 license jpython 1.1.x software license command line interpreter available apache software license | [
3712,
7684,
2181,
4358,
7176,
910,
10526,
5031,
7980,
5677,
7983,
6067,
9011,
5048,
6074,
10683,
572,
7485,
10173,
3519,
5567,
9665,
10684,
7750,
4171,
6860,
7887,
3920,
10193,
1363,
4960,
1250,
2658,
5987,
3560,
3561,
3562,
7146,
5612,
8... | Test |
10,684 | 9 | Comparison_of_C_Sharp_and_Java:comparison c sharp java article compares two programming languages c java focus article mainly languages features comparison necessarily also consider features platforms libraries detailed comparison platforms please see comparison java .net platforms c java similar languages typed statically strongly manifestly object-oriented designed semi-interpretation runtime just-in-time compilation curly brace languages like c c++ languages statically typed class-based object orientation java primitive types special object-oriented could defined using language also share common ancestor reference types java reference types derive common root type c unified type system types besides unsafe pointers ultimately derive common root type consequently types implement methods root type extension methods defined object type apply types even primitive int literals delegates allows c unlike java support objects encapsulation reference types java compound types synonymous reference types methods defined type unless also class reference type c concepts encapsulation methods decoupled reference requirement type support methods encapsulation without reference type reference types support virtual methods specialization however languages support many built-in types copied passed value rather reference java calls types primitive types called simple types c primitive/simple types typically native support underlying processor architecture c simple types implement several interfaces consequently offer many methods directly instances types even literals c type names also merely aliases common language runtime clr types c system.int64 type exactly type long type difference former canonical .net name latter c alias java offer methods directly primitive types instead methods operate primitive values offered companion primitive wrapper classes fixed set wrapper classes exist wraps one fixed set primitive types example java long type reference type wraps primitive long type type however java c support signed integers bit widths 8 16 32 64 bits use name/aliases types except 8-bit integer called byte java sbyte signed byte c c supports unsigned addition signed integer types unsigned types byte ushort uint ulong 8 16 32 64 bit widths respectively unsigned arithmetic operating types supported well example adding two unsigned integers uints still yields uint result long signed integer java feature unsigned integer types particular java lacks primitive type unsigned byte instead java byte type sign extended common source bugs confusion unsigned integers left java deliberately james gosling believed programmers would understand unsigned arithmetic works.in programming language design one standard problems language grows complex nobody understand one little experiments tried asking people rules unsigned arithmetic c. turns nobody understands unsigned arithmetic c works obvious things people understand many people n't understand c type literal notation high-precision 28 decimal digits decimal arithmetic appropriate financial monetary calculations contrary float double data types decimal fractional numbers 0.1 represented exactly decimal representation float double representations numbers often non-terminating binary expansions making representations prone round-off errors java lacks built-in type java library feature arbitrary precision decimal type considered language type support usual arithmetic operators rather reference type must manipulated using type methods see arbitrary-size/precision numbers languages offer library-defined arbitrary-precision arithmetic types arbitrary-size integers decimal point calculations java data type arbitrary precision decimal point calculations c type working complex numbers languages number operations performed advanced numeric types limited compared built-in ieee 754 floating point types instance none arbitrary-size types support square root logarithms c allows library-defined types integrated existing types operators using custom implicit/explicit conversions operator overloading see example section integration library-defined types languages feature native char character datatype simple type although char type used bit-wise operators performed promoting char value integer value operation thus result bitwise operation numeric type character languages languages treat strings immutable objects reference type languages type contains several methods manipulate strings parse format etc languages regular expressions considered external feature implemented separate classes languages libraries define classes working dates calendars different cultures java java.util.date mutable reference type whereas c system.datetime struct value type c additionally defines timespan type working time periods languages support date time arithmetic according different cultures c allows programmer create user-defined value types using struct keyword unlike classes like standard primitives value types passed assigned value rather reference also part object either field boxed stored array without memory indirection normally exists class types value types notion null value used arrays without initialization always come implicit default constructor essentially fills struct memory space zeroes programmer define additional constructors one arguments value types virtual method tables fixed memory footprint implicitly sealed however value types frequently implement interfaces example built-in integer types implement several interfaces apart built-in primitive types java include concept value types languages define enumerations implemented fundamentally different ways enumerations one area tools designed automatically translate code two languages java c converters fail c implemented enumerations manner similar c wrappers around bit-flags implemented primitive integral types int byte short etc. performance benefits improves interaction c/c++ compiled code provides fewer features lead bugs low-level value types directly cast enumeration type allowed c language therefore seen syntactic sugar contrast java implements enumerations full featured collection instances requiring memory aiding interaction c/c++ code providing additional features reflection intrinsic behavior implementation language described table c java programmers use enumerations switch statement without conversion string primitive integer type however c disallows implicit fall-through unless case statement contain code common cause hard-to-find bugs fall-through must explicitly declared using goto statement c implements object-oriented method pointers form delegates delegate special type capture type-safe reference method reference stored delegate-type variable passed method delegate parameter later invocation c delegates support covariance contravariance hold reference signature-compatible static method instance method anonymous method lambda expression delegates confused closures inline functions concepts related reference closure/inline function must captured delegate reference useful delegate always reference inline function also reference existing static instance methods delegates form basis c events confused either delegates deliberately left java considered unnecessary detrimental language potential performance issues instead alternative mechanisms used wrapper pattern resembles delegates c allows client access one client-defined methods known interface one mechanism another use adapter objects using inner classes designers java argued better solution bound method references see also example c delegates equivalent java constructs c allows value/primitive/simple types lifted allow special null value addition type native values type lifted adding suffix type name equivalent using nullable generic type type lifted conversions implicitly defined convert values base lifted type lifted type compared null tested hasvalue also lifted operators implicitly automatically defined based non-lifted base — exception boolean operators — null argument propagate result java support type lifting concept built-in primitive types corresponding wrapper types support null value virtue reference types classes according java spec attempt dereference null reference must result exception thrown run-time specifically nullpointerexception would make sense dereference otherwise definition points object memory also applies attempting unbox variable wrapper type evaluates null program throw exception object unboxed thus boxed value take part subsequent computation following example illustrates different behavior c lifted*operator propagates null value operand java unboxing null reference throws exception c lifted operators defined propagate null unconditionally one operands null specifically boolean operators lifted support ternary logic thus keeping impedance sql java boolean operators support ternary logic implemented base class library c features late bound dynamic type supports no-reflection dynamic invocation interoperability dynamic languages ad-hoc binding example document object models dynamic type resolves member access dynamically runtime opposed statically/virtual compile time member lookup mechanism extensible traditional reflection fall-back mechanism several use cases dynamic type c java support late-bound type use cases c dynamic type different corresponding constructs java see also example interoperability dynamic languages java precludes pointers pointer-arithmetic within java runtime environment java language designers reasoned pointers one main features enable programmers put bugs code chose support java allow directly passing receiving objects/structures to/from underlying operating system thus need model objects/structures specific memory layout layouts frequently would involve pointers java communication underlying operating system instead based upon java native interface jni communication with/adaptation underlying operating system handled external glue layer c allow use pointers corresponding pointer arithmetic c language designers concerns pointers could potentially used bypass strict rules object access thus c default also precludes pointers however pointers needed calling many native functions pointers allowed explicit unsafe mode code blocks methods use pointers must marked unsafe keyword able use pointers compiler requires /unsafe switch allow compiling code assemblies compiled using /unsafe switch marked may execute explicitly trusted allows using pointers pointer arithmetic directly pass receive objects to/from operating system native apis using native memory layout objects also isolating potentially unsafe code specifically trusted assemblies languages references central concept instances classes reference directly evident language syntax per se languages support concept weak references instance referenced weak references eligible garbage collection references languages feature exposed associated libraries even though really core runtime feature along weak references java soft references much like weak references jvm deallocate softly-referenced objects memory needed arrays collections concepts featured languages syntax used declare access arrays identical except c added syntax declaring manipulating multidimensional arrays multidimensional arrays cases increase performance increased locality one pointer dereference instead one every dimension array case jagged arrays however since array element access multidimensional array requires multiplication/shift two dimensions advantage random access scenarios another difference entire multidimensional array allocated single application operator new jagged arrays require loops allocations every dimension however java provides syntactic construct allocating jagged array regular lengths loops multiple allocations performed virtual machine need explicit source level languages feature extensive set collection types includes various ordered unordered types lists maps/dictionaries sets etc java also supports syntax c/c++ languages allow automatic boxing unboxing i.e allow implicit casting primitive types corresponding reference types c primitive types subtypes object type java true given primitive type corresponding wrapper type specific relationship except autoboxing unboxing act syntactic sugar interchanging done intentionally maintain backward compatibility prior versions java automatic casting allowed programmer worked two separate sets types primitive types wrapper reference type hierarchy difference following consequences first c primitive types define methods override object tostring method java task accomplished primitive wrapper classes secondly java extra cast needed whenever one tries directly dereference primitive value boxed automatically expression integer 42 .tostring convert integer literal string java 42.tostring performs operation c latter one instance call primitive value 42 former one instance call object type java.lang.integer finally another difference java makes heavy use boxed types generics see languages considered curly brace languages c/c++ family overall syntaxes languages similar syntax statement expression level almost identical obvious inspiration c/c++ tradition type definition level classes interfaces minor differences exist java explicit extending classes implementing interfaces c infers kind types new class/interface derives c supports features java extent also evident syntax specifies keywords grammar rules java languages evolved language designers languages faced situations wanted extend languages new keywords syntax new keywords particular may break existing code source level i.e older code may longer compile presented compiler later version language language designers keen avoid regressions designers two languages following different paths addressing problem java language designers avoided new keywords much possible preferring instead introduce new syntactic constructs legal reuse existing keywords new contexts way n't jeopardize backward compatibility example former found loop extended accept iterable types example latter found extends especially super keywords reused specifying type bounds generics introduced java 1.5 one time java 1.4 new keyword assert introduced reserved keyword potential render previously valid code invalid instance code used assert identifier designers chose address problem four-step solution 1 introducing compiler switch indicates java 1.4 later used 2 marking assert keyword compiling java 1.4 later 3 defaulting 1.3 avoid rendering previous non 1.4 aware code invalid 4 issue warnings keyword used java 1.3 mode order allow developers change code c language designers introduced several new keywords since first version however instead defining keywords global keywords define context sensitive keywords means even introduced among others partial yield keywords c 2.0 use words identifiers still valid clash possible use keyword use identifier given context thus present c syntax fully backward compatible source code written previous version without specifying language version used c java designed ground object-oriented languages using dynamic dispatch syntax similar c++ c++ turn derives c neither language superset c c++ however c allows class definition split across several source files using feature called partial classes part must marked keyword partial parts must presented compiler part single compilation parts reference members parts parts implement interfaces one part define base class feature useful code generation scenarios user interface ui design code generator supply one part developer another part compiled together developer thus edit part without risk code generator overwriting code later time unlike class extension mechanism partial class allows circular dependencies among parts guaranteed resolved compile time java corresponding concept languages allow inner classes class defined lexically inside another class however language inner classes rather different semantics java unless inner class declared static reference instance inner class carries reference outer class result code inner class access static non-static members outer class create instance non-static inner class instance embracing outer class must named done via new new-operator introduced jdk 1.3 outerclassinstance.new outer.innerclass done class reference instance outer class c inner class conceptually normal class sense outer class acts namespace thus code inner class access non-static members outer class unless explicit reference instance outer class programmers declare inner class private allow outer class access java provides another feature called local classes anonymous classes defined within method body generally used implement interface one two methods typically event handlers however also used override virtual methods superclass methods local classes access outer method local variables declared final c satisfies use-cases providing anonymous delegates see event handling c also provides feature called anonymous types/classes rather different java concept name allows programmer instantiate class providing set names properties class expression initialize types properties inferred types expressions implicitly-declared classes derived directly object c multicast-delegates used events events provide support event-driven programming implementation observer pattern support specific syntax define events classes operators register unregister combine event handlers see information events implemented java operator overloading user-defined casts separate features aim allow new types become first-class citizens type system using features c types complex decimal integrated usual operators like addition multiplication work new types unlike c++ c restrict use operator overloading prohibiting operators new || variations compound statements like += compound operators call overloaded simple operators like -= calling java include operator overloading custom conversions order prevent abuse feature keep language simple c also includes indexers considered special case operator overloading like c++ operator parameterized get/set properties indexer property named uses one parameters indexes indices objects type java include indexers common java pattern involves writing explicit getters setters c programmer would use indexer c java object fields initialized either variable initializers expressions assigned variables defined constructors special subroutines executed object created addition java contains instance initializers anonymous blocks code arguments run explicit implicit call superclass constructor constructor executed c initializes object fields following order creating object fields may applicable e.g object static fields derived fields defined object direct class base field term fields defined one object superclasses note object representation memory contains fields defined class superclasses even fields superclasses defined private guaranteed field initializers take effect constructors called since instance constructor object class superclasses called field initializers called however potential trap object initialization virtual method called base constructor overridden method subclass may reference field defined subclass field may initialized constructor subclass contains field initialization called constructor base class java order initialization follows like c new object created calling specific constructor within constructor first statement may invocation another constructor omitted call argumentless constructor superclass added implicitly compiler otherwise either another overloaded constructor object class called explicitly superclass constructor called former case called constructor call another constructor either object class subclass chain sooner later ends call one constructors superclass another constructor called causes direct invocation superclass constructor forth object class instance variables defined object class initialized even variable initializers explicitly defined variables variables initialized default values note instance variables defined superclasses already initialized point initialized superclass constructor called either constructor code variable initializers performed constructor code implicitly default values java variable initializers executed according textual order source file finally constructor body executed ensures proper order initialization i.e fields base class finish initialization initialization fields object class begins two main potential traps java object initialization first variable initializers expressions contain method calls since methods reference variable defined class method called variable initializer reference variable defined variable initialized since initialization order corresponds textual order variable definitions variable would initialized value prescribed initializer would contain default value another potential trap method overridden derived class called base class constructor lead behavior programmer would expect object derived class created according initialization order body base class constructor executed variable initializers evaluated body derived class constructor executed overridden method called base class constructor however reference variables defined derived class yet initialized values specified initializers set derived class constructor latter issue applies c well less critical form since c methods overridable default languages mainly use garbage collection means reclaiming memory resources rather explicit deallocation memory cases object holds resources different kinds memory file handles graphical resources etc. must notified explicitly application longer uses c java offer interfaces deterministic disposal c java since java 7 feature automatic resource management statements automatically invoke disposal/close methods interfaces using special designator first parameter method c allows method act member method type first parameter extension foreign class purely syntactical extension method must declared static defined within purely static class method must obey member access restriction like method external class thus static methods break object encapsulation extension active within scopes namespace static host class imported since java 8 java similar feature called default methods methods body declared interfaces opposed c extension methods java default methods instance methods interface declare definition default methods classes implement interface optional class define method default definition used instead c extension methods java default methods allow class override default implementation extension/default method respectively languages override achieved defining method class use alternate implementation method c scope rules defines matching method found class takes precedence matching extension method java class declared implement interface default method assumed default methods implementions unless class implements method related partial classes c allows partial methods specified within partial classes partial method intentional declaration method several restrictions signature restrictions ensure definition provided class part method every call safely erased feature allows code provide large number interception points like template method gof design pattern without paying runtime overhead extension points used another class part compile time java corresponding concept methods c non-virtual default must declared virtual explicitly desired java non-static non-private methods virtual virtuality guarantees recent override method always called incurs certain runtime cost invocation invocations normally inlined require indirect call via virtual method table however jvm implementations including oracle reference implementation implement inlining commonly called virtual methods java methods virtual default although sealed using final modifier disallow overriding way let derived classes define new unrelated method name means default java explicitly enabled c new methods may defined derived class name signature base class method called superclass reference object deepest overridden implementation base class method called according specific subclass object referenced cases subclass introduces method name signature method already present base class problems occur java mean method derived class implicitly override method base class even though may intent designers either class mitigate c requires method intended override inherited method override keyword must specified otherwise method hide inherited method keyword absent compiler warning effect issued silenced specifying new keyword avoids problem arise base class extended non-private method i.e inherited part namespace whose signature already use derived class java similar compiler check form override method annotation compulsory absence compilers provide comment method overridden java possible prevent reassignment local variable method parameter using keyword applying keyword primitive type variable causes variable become immutable however applying reference type variable prevents another object assigned prevent data contained object mutated c 7 possible prevent reassignment method parameter using keyword however keyword used local variables java applying parameter prevents parameter reassigned different value still possible mutate data contained object languages support essential feature const-correctness exists c/c++ makes method constant java defines word constant arbitrarily field variables capital-only variables names separated underscore parameter considered constant although may case primitive data type immutable class like c method declared returning ienumerable ienumerator generic versions interfaces implemented using yield syntax form limited compiler-generated continuations drastically reduce code needed traverse generate sequences although code generated compiler instead feature also used implement infinite sequences e.g. sequence fibonacci numbers java equivalent feature instead generators typically defined providing specialized implementation well-known collection iterable interface compute element demand generator used statement must implement interface java.lang.iterable see also example fibonacci sequence c also explicit interface implementation allows class specifically implement methods interface separate class methods provide different implementations two methods name signature inherited two base interfaces either language method property c specified name signature multiple interfaces members clash class designed implements interfaces implementation default implement common method interfaces separate implementations needed methods serve separate purposes return values differ interfaces c explicit interface implementation solve problem though allowing different results method depending current cast object java way solve problem refactoring one interfaces avoid name clashes arguments primitive types e.g int double method passed value java whereas objects passed reference means method operates copies primitives passed instead actual variables contrary actual objects cases changed following example object string changed object class changed c possible enforce reference ref keyword similar c++ sense c. feature c particularly useful one wants create method returns one object java trying return multiple values method unsupported unless wrapper used case named ref java supports checked exceptions along unchecked exceptions c supports unchecked exceptions checked exceptions force programmer either declare exception thrown method catch thrown exception using try-catch clause checked exceptions encourage good programming practice ensuring errors dealt however anders hejlsberg chief c language architect argues extent experiment java shown worthwhile except small example programs one criticism checked exceptions encourage programmers use empty catch block catch exception e silently swallows exceptions rather letting exceptions propagate higher-level exception-handling routine cases however exception chaining applied instead re-throwing exception wrapper exception example object changed access database instead file could caught re-thrown since caller may need know inner workings object however programmers agree stance james gosling others maintain checked exceptions useful misusing caused problems silently catching exceptions possible yes must stated explicitly exception versus unchecked exceptions allow nothing default ignored code must written explicitly ignore also differences two languages treating try-finally statement finally block always executed even try block contains control-passing statements like throw return java may result unexpected behavior try block left return statement value finally block executed afterward also left return statement different value c resolves problem prohibiting control-passing statements like return break finally block common reason using try-finally blocks guard resource managing code thus guaranteeing release precious resources finally block c features using statement syntactic shorthand common scenario dispose method object using always called rather subtle difference moment stack trace created exception thrown java stack trace created moment exception created exception statement always contain constructor stack-trace matter often foo called c hand stack-trace created moment throw executed code exception contain stack-trace first throw-line catching exception two options case exception rethrown throw rethrow original exception original stack throw e would created new stack trace java allows flow control leave finally block try statement regardless way entered cause another control flow statement return terminated mid-execution example code return statement within try block causes control leave thus finally block executed actual return happens however finally block also performs return thus original return caused entered executed method returns 1 rather 0 informally speaking tries return 0 finally returns 1 c allow statements allow control flow leave finally block prematurely except throw particular return allowed goto allowed target label outside finally block continue break allowed nearest enclosing loop outside finally block field generics two languages show superficial syntactical similarity deep underlying differences generics java language-only construction implemented compiler generated classfiles include generic signatures form metadata allowing compiler compile new classes runtime knowledge generic type system generics part jvm instead generics classes methods transformed compiling via process termed type erasure compiler replaces generic types raw version inserts casts/checks appropriately client code type methods used resulting byte code contain references generic types parameters see also generics java language specification intentionally prohibits certain uses generics necessary allow implementing generics type erasure allow migration compatibility c builds support generics virtual execution system i.e. language feature language merely front-end cross-language generics support clr compiling generics verified correctness code generation implement generics deferred class-load time client code code invoking generic methods/properties fully compiled safely assume generics type-safe called reification runtime unique set type parameters generic class/method/delegate encountered first time class loader/verifier synthesize concrete class descriptor generate method implementations generation method implementations reference types considered one type reference types safely share implementations merely purpose implementing code different sets reference types still unique type descriptors method tables merely point code following list illustrates differences java c managing generics exhaustive c allows generics directly primitive types java instead allows use boxed types type parameters e.g. list integer instead list int comes cost since values need boxed/unboxed used need heap-allocated however generic type specialized array type primitive type java example list int allowed several third-party libraries implemented basic collections java backing primitive arrays preserve runtime memory optimization primitive types provide java type erasure design motivated design requirement achieve migration compatibility confused backward compatibility particular original requirement … clean demonstrable migration path collections apis introduced java 2 platform designed new generic collections passable methods expected one pre-existing collection classes c generics introduced language preserving full backward compatibility preserve full migration compatibility old code pre c 2.0 runs unchanged new generics-aware runtime without recompilation migration compatibility new generic collection classes interfaces developed supplemented non-generic .net 1.x collections rather replacing addition generic collection interfaces new generic collection classes implement non-generic collection interfaces possible prevents use new generic collections pre-existing non-generic aware methods methods coded use collection classes covariance contravariance supported languages java use-site variance allows single generic class declare members using co- contravariance c define-site variance generic interfaces delegates variance unsupported directly classes supported implementation variant interfaces c also use-site covariance support methods delegates closure inline function captures variables lexical scope c supports closures anonymous methods lambda expressions full-featured closure semantics java anonymous inner classes remain preferred way emulate closures java 8 become new standard verbose construction approach also differences compared real closures notably controlled access variables enclosing scopes final members referenced java 8 however introduces lambdas fully inherit current scope fact introduce new scope reference method passed around later execution problem arises method references variables/parameters lexical scope c closures access variable/parameter lexical scope java anonymous inner classes references final members lexical scope allowed thus requiring developer mark variables make available state possibly requiring boxing c java feature special type in-line closures called lambdas anonymous methods signature body name mainly used specify local function-valued arguments calls methods technique mainly associated functional programming c unlike java allows use lambda functions way define special data structures called expression trees whether seen executable function data structure depends compiler type inference type variable parameter assigned cast lambdas expression trees play key roles language integrated query linq c namespaces similar c++ unlike package names java namespace way tied location source file strictly necessary java source file location mirror package directory structure conventional organization languages allow importing classes e.g. import java.util java allowing class referenced using name sometimes classes name exist multiple namespaces packages classes referenced using fully qualified names importing selected classes different names java allows importing single class e.g. import java.util.list c allows importing classes new local name using following syntax using console system.console also allows importing specializations classes form using intlist system.collections.generic.list int languages static import syntax allows using short name static methods/fields class e.g. allowing foo bar foo statically imported another class c static class syntax confused static inner classes java restricts class contain static methods c 3.0 introduces extension methods allow users statically add method type e.g. allowing foo.bar bar imported extension method working type foo sun microsystems java compiler requires source file name must match public class inside c allows multiple public classes file puts restrictions file name c 2.0 later allows splitting class definition several files using partial keyword source code java public class always source file c source code files logical units separation tightly related unlike java c implements conditional compilation using preprocessor directives also provides conditional attribute define methods called given compilation constant defined way assertions provided framework feature method debug.assert evaluated debug constant defined since version 1.4 java provides language feature assertions turned runtime default enabled using -enableassertions -ea switch invoking jvm languages include thread synchronization mechanisms part language syntax .net framework 4.0 new task-based programming model introduced replace existing event-based asynchronous model api based around task task classes tasks composed chained convention every method returns task name postfixed async c 5 set language compiler extensions introduced make easier work task model language extensions included notion async methods await statement make program flow appear synchronous syntactic sugar c compiler generates state-machine handles necessary continuations without developers think java supports threads since jdk 1.0 java offers high versatility running threads often called tasks done implementing functional interface java.lang.runnable interface defining single void no-args method demonstrated following example similar c java higher level mechanism working threads executors execute asynchronous tasks also manage group subprocesses threads executorservices instance handled pool executorservice instance reused hood revenant tasks possible runs many concurrent tasks programmer wants throughout life-cycle application using single executor service instance first thread-example looks like using executors executorservice instance also supports callable interface another single method interface like runnable signature contained method callable returns value way lambda expression must also return value calling method get blocks current thread waits callable completes returning value example web page content adequately support applications field mathematical financial computation several language features exist java strictfp keyword enables strict floating-point calculations region code strict floating-point calculations require even platform offers higher precision calculations intermediate results must converted single/double ensures strict floating-point calculations return exactly result platforms without strict floating-point platform implementation free use higher precision intermediate results calculation c allows implementation given hardware architecture always use higher precision intermediate results available i.e c allow programmer optionally force intermediate results use potential lower precision single/double although java floating-point arithmetic largely based ieee 754 standard binary floating-point arithmetic certain features unsupported even using strictfp modifier exception flags directed roundings abilities mandated ieee standard 754 see criticism java floating point arithmetic c provides built-in decimal type higher precision less range java/c double decimal type 128-bit data type suitable financial monetary calculations decimal type represent values ranging 1.0 × 10 approximately 7.9 × 10 28-29 significant digits structure uses c operator overloading decimals manipulated using operators *and like primitive data types types provided java allow arbitrary-precision representation decimal numbers integer numbers respectively java standard library classes deal complex numbers biginteger complex types provided c allow representation manipulation arbitrary-precision integers complex numbers respectively structures use c operator overloading instances manipulated using operators like primitive data types c standard library classes deal arbitrary-precision floating point numbers see software arbitrary-precision arithmetic c help mathematical applications checked unchecked operators allow enabling disabling run-time checking arithmetic overflow region code c language integrated query linq set features designed work together allow in-language querying abilities distinguishing feature c java linq consists following features java native interface jni feature allows java programs call non-java code however jni require code called follow several conventions imposes restrictions types names used means extra adaption layer legacy code java often needed adaption code must coded non-java language often c c++ java native access jna allows easier calling native code requires writing java code comes performance cost addition third party libraries provide java-component object model com bridging e.g. jacob free j-integra com proprietary .net platform invoke p/invoke offers ability allowing calls c microsoft terms unmanaged code metadata attributes programmer control exactly parameters results marshalled thus avoiding external glue code needed equivalent jni java p/invoke allows almost complete access procedural apis win32 posix limited access c++ class libraries addition .net framework also provides .net-com bridge allowing access com components first-class .net objects c also allows programmer disable normal type-checking safety features clr enables use pointer variables using feature programmer must mark code using unsafe keyword jni p/invoke unsafe code equally risky features exposing possible security holes application instability advantage unsafe managed code p/invoke jni allows programmer continue work familiar c environment accomplish tasks otherwise would require calling unmanaged code assembly program library using unsafe code must compiled special switch marked enables runtime environments take special precautions executing potentially harmful code java programming language designed execute java platform via java runtime environment jre java platform includes java virtual machine jvm common set libraries jre originally designed support interpreted execution final compiling option jre environments execute fully least partially compiled programs possibly adaptive optimization java compiler produces java bytecode upon execution bytecode loaded java runtime either interpreted directly compiled machine instructions executed c designed execute common language runtime clr clr designed execute fully compiled code c compiler produces common intermediate language instructions upon execution runtime loads code compiles machine instructions target architecture example illustrating copy text one line time one file another using languages c allows library-defined types integrated existing types operators using custom implicit/explicit conversions operator overloading illustrated following example example illustrates java c used create invoke instance class implemented another programming language deepthought class implemented using ruby programming language represents simple calculator multiply two input values b calculate method invoked addition conventional way java graalvm virtual machine capable run implemented programming language example illustrates fibonacci sequence implemented using two languages c version takes advantage c generator methods java version takes advantage stream interface method references java c examples use k r style code formatting classes methods statements | [
2048,
6160,
541,
9245,
5677,
566,
572,
8262,
1610,
1611,
9804,
2658,
7273,
7274,
3705,
3736,
155,
5796,
10413,
5806,
3761,
3765,
10435,
716,
6860,
8397,
7894,
5872,
2804,
2304,
4358,
5896,
9482,
6411,
6414,
10510,
10011,
10526,
11559,
900... | Test |
10,685 | 4 | Biometric_passport:biometric passport biometric passport also known e-passport epassport digital passport traditional passport embedded electronic microprocessor chip contains biometric information used authenticate identity passport holder uses contactless smart card technology including microprocessor chip computer chip antenna power chip communication embedded front back cover centre page passport passport critical information printed data page passport repeated machine readable lines stored chip public key infrastructure pki used authenticate data stored electronically passport chip making expensive difficult forge security mechanisms fully correctly implemented many countries moving towards issue biometric passports malaysia first country issue biometric passports 1998 december 2008 60 countries issuing passports increasing 120 june 2017 currently standardised biometrics used type identification system facial recognition fingerprint recognition iris recognition adopted assessment several different kinds biometrics including retinal scan document chip characteristics documented international civil aviation organization icao doc 9303 icao9303 icao defines biometric file formats communication protocols used passports digital image usually jpeg jpeg2000 format biometric feature actually stored chip comparison biometric features performed outside passport chip electronic border control systems e-borders store biometric data contactless chip includes minimum 32 kilobytes eeprom storage memory runs interface accordance iso/iec 14443 international standard amongst others standards intend interoperability different countries different manufacturers passport books national identity cards netherlands albania brazil fully icao9303 compliant biometric travel documents however others united states passport card biometric passports protection mechanisms avoid and/or detect attacks assure interoperability functionality security mechanisms listed icao german federal office information security bsi specified several test cases test specifications updated every new protocol covering details starting paper used ending chip included since introduction biometric passports several attacks presented demonstrated privacy proponents many countries question protest lack information exactly passports chip contain whether impact civil liberties main problem point data passports transferred wireless rfid technology become major vulnerability although could allow id-check computers obtain person information without physical connection may also allow anyone necessary equipment perform task personal information passport numbers chip encrypted information might wind wrong hands 15 december 2006 bbc published article british epassport citing stories adding adding future identity information society fidis network research team body security experts funded european union also come epassport scheme ... stating european governments forced document people dramatically decreases security increases risk identity theft security measures designed untrusted citizens provers scientific security community recently also addressed threats untrustworthy verifiers corrupt governmental organizations nations using poorly implemented unsecure electronic systems new cryptographic solutions private biometrics proposed mitigate threats mass theft identity scientific study yet implemented biometric passports planned except denmark ireland uk eu passports would digital imaging fingerprint scan biometrics placed rfid chips combination biometrics aims create unrivaled level security protection fraudulent identification papers technical specifications new passports established european commission specifications binding schengen agreement parties i.e eu countries except ireland uk three four european free trade association countries – iceland norway switzerland countries obliged implement machine readable facial images passports 28 august 2006 fingerprints 29 june 2009 european data protection supervisor stated current legal framework fails address possible relevant issues triggered inherent imperfections biometric systems currently british irish biometric passports use digital image fingerprinting german passports printed 1 november 2007 contain two fingerprints one hand addition digital photograph romanian passports also contain two fingerprints one hand netherlands also takes fingerprints eu member plans store fingerprints centrally according eu requirements nations signatories schengen acquis required add fingerprint biometrics eu nations passport prices issued since may 2009 costs 7500 lekë €60 valid 10 years contains fingerprints bearer photo data written passport issued since 5 january 2012 valid 10 years adults 5 years minors issued since june 2012 costs 1.500,00 pesos valid 10 years issued since july 2012 contains digital images fingerprints photo electronic signature passport holder valid 10 years issued since october 2005 costs au 293.. contains personal information colour photo page including digitized photograph australia use fingerprinting incoming passengers valid 10 years adults 5 years minors 16 years issued since september 2013 contains information passport holder facial features well finger palm prints issued since april 2010 costing ৳ 3450 valid 10 years electronic microprocessor chip embedded e-passport thirty-eight different security features including holographic images embossed thin film laminate change colour light demographic biometric information bearer including fingerprints ten fingers iris scan digital signature stored passport government bangladesh issues three different types e-passports diplomatic passports red cover official passports blue cover regular ordinary passports green cover issued since 15 october 2009 costing 50 km €25.65 valid 10 years adults 5 years younger 18 1 june 2010 bosnia herzegovina issued first eac passport issued since 1 feb 2019 costing 550 bob usd79.13 valid 6 years bolivian epassport functions biometric passports regulations oasi issued since 8 march 2010 issued since december 2006 however december 2010 began issue passports microchips first capital brasília goiás state since end january 2011 last available issued brazil valid 5 years adults costs r 156.07 approximately €35 december 2014 federal police department extended validity document five ten years issued since 17 february 2007 bruneian epassport functions biometric passports issued since 17 july 2014 cost 5-year passport issued children aged five us 80 10-year passport issued people older five costs us 100 issued since 1 july 2013 contains bearer name gender date place birth digital portrait face issued since 26 january 2016 costing €50 noted scheme gradually expand cape verdean diplomatic missions boston lisbon future issued since 2 september 2013 valid 5 years 30 january 2011 ministry foreign affairs people republic china launched trial issuance e-passports public affairs face fingerprint biometric features passport holder digitalized stored pre-installed contactless smart chip passport 1 july 2011 ministry began issuing biometric passports individuals conducting public affairs work overseas behalf chinese government ordinary biometric passports introduced ministry public security starting 15 may 2012 cost passport 200 cny approximately us 31 first-time applicants china 220 cny us 35 renewals passports issued abroad effective july 1 2017 cost biometric ordinary passport reduced 160 cny approximately us 24 first-time applicants renewal april 2017 china issued 100 million biometric ordinary passports issued since 1 september 2015 costing cop 166.000 approx us 51 issued since may 2004 however dominican biometric passports carry chip inside symbol january 2010 cost passport 1,250 dop us 35–40 date issued since 5 february 2007 issued since 21 august 2006 issued since 23 january 2014 issued since 2010 valid 10 years adults costing 100 lari issued tehth business day day issuance cost 205 lari price photo 3 lari needs paid additionally discounts e.g 50 discount persons age 18 issued since 1 march 2010 costing gh¢ 50.00–100.00 adults children passports contain several technological characteristics biometric technology however ghanaian biometric passports carry chip inside symbol mandatory icao-standard electronic passports 2006 immigration department announced unihub limited pccw subsidiary company heading consortium suppliers including keycorp tender provide technology produce biometric passports february 2007 first biometric passport introduced cover new biometric passport remains essentially previous versions addition electronic passport logo bottom however design inner pages changed substantially design conforms document design recommendations international civil aviation organization new epassport featured 2008 stockholm challenge event finalist stockholm challenge award public administration category hong kong sar epassport design praised account multiple state-of-the-art technologies seamlessly integrated sophisticated electronic passport system e-passport system cost hksar passport hk 370 us 48 32-page passport hk 460 us 59 48-page passport issued since 23 may 2006 costing isk5100 isk1900 18 67 india recently initiated first phase deployment biometric e-passport passport holders india abroad new passports designed indigenously central passport organization india security press nashik iit kanpur passport contains security chip personal data digital images initially new passports 64kb chip photograph passport holder subsequently include holder fingerprint biometric passport tested passport readers abroad noted 4-second response time – less us passport 10 seconds passport need carried metal jacket security reasons first needs passed reader generates access keys unlock chip data reader access india also given contract tata consultancy services issuing e-passports passport seva kendra india plans open 77 centers across country issue passports 25 june 2008 indian passport authority issued first e-passport president india pratibha patil e-passport first phase deployment initially restricted diplomatic passport holders available ordinary citizens 2017 onwards issued since 26 january 2011 passport costs rp655,000 66 48-page valid 5 years rp405,000 41 24-page passport valid 5 years issued since july 2007 diplomatic service passports 20 february 2011 ordinary biometric passports cost new passport approximately us 37 irr1,125,000 issued since 1 february 2010 costing 25,000 dinars usd20 issued since october 16 2006 issued since july 2013 2-year pilot period biometric database law optional august 2013 passport expiring 2 years replaced biometric one upon request free charge passports expiring within 2 years charged full fee program review supposed concluded 2015 postponed order minister interior later date due controversy regarding creation biometric database rather storing biometric data within passport chip practice many countries since 2015 pilot period extended 2017 may 2017 pilot period ended newly issued passports required biometric obtain biometric passport applicant must appear interior ministry office photographed special camera records information facial bone structure distance one eyes ears eyes ratio facial features one another one also fingerprinted information contained new high-tech electronic passport issued since march 2006 passports meet requirements us visa waiver program calls countries roll biometric passports 26 october 2006 kazakhstan presented concept implementing biometric passport 2009 issued since 1 september 2017 contain fingerprints facials signature including vital information icao compliant currently likely travel back kenya capture biometric data passport manufacture kenya plans invalidate old style passports 31 august 2020 issued since 31 october 2011 issued since march 2017 late 2018 older non-biometric passports longer valid use issued since september 2016 issued since august 1 2016 date introduction uncertain however enabling statute tabled november 2016 issued since 1 september 2009 issued since 2014 costs 110,000 ariary since september 2014 mandatory malagasy citizens depart country biometric passport issued since 1998 malaysia however member visa waiver program vwp first biometric passport conform standards vwp biometric document malaysian biometric passport issued several years ahead vwp requirement difference lies storage fingerprint template instead fingerprint image chip rest technologies also biometric passport designed read receiving country authorisation malaysian immigration department malaysia started issuing icao compliant passports february 2010 malaysia used issue passports validity 2 years 5 years passport 2 years validity withdrawn since january 2015 pricing malaysian passport rm 200 approximately usd 50 5 years validity rm100 approximately usd 25 senior citizens children 12 hajj pilgrims students 21 studying abroad rm100 free disabled citizens issued since 26 july 2006 new passport follows completely new design features passport holder facial fingerprint information biometric identifiers 32-page ordinary passport cost rf350 64-page ordinary passport cost rf600 children age 10 years people applying passports diplomatic missions abroad issued 32-page non-electronic ordinary passport cost rf250 issued since 2005 smom diplomatic service passports include biometric features compliant icao standards issued since 1 january 2008 costing approximately 760 mdl €45 obligatory 1 january 2011 passport republic moldova biometric data contains chip holds digital information including holder signature well traditional information valid 7 years persons 7 4 years persons less 7 respectively introduced request european union safeguard borders e.u republic moldova issued since 2008 costing approximately €40 issued since end 2016 issued since 6 may 2011 costs us 115.68 valid 5 years issued since 2008 trial general since 25 september 2009 costs 300dh approximately €27 issued since september 2014 issuance passports suspended 40 days later resumed february 2015 issued since 8 january 2018 issued since november 2005 like australia us new zealand using facial biometric identifier two identifying factors small symbol front cover indicating electronic chip embedded passport polycarbonate leaf front version 2009 book inside chip located like australia new zealand installed smartgates airports allow new zealand epassport epassport holders 4 countries australia canada uk us clear immigration controls rapidly facial recognition technology installed immigration gates cost nz 140 applying person nz 124.50 applying online—available already holding passport adults nz 81.70 children valid five years issued december 2015 however 2015 new zealand government approved reinstatement 10-year validity period passports passports issued december 2015 valid 10 years issued since 2007 harmonized ecowas smart electronic passport issued nigerian immigrations service powered biometric technology tandem international civil aviation organization icao specifications international travels travellers data captured biometric passport accessed instantly read security agent spot globe integrated network systems configured linked centrally-coordinated passport data bank managed nigerian immigrations service issued since 2 april 2007 costs 1500 mkd c. €22 issued since 2005 costs nok 450 adults c. €50 nok 270 children 2007 norwegian government launched ‘ multi-modal ’ biometric enrolment system supplied motorola motorola new system enabled multiple public agencies digitally capture store fingerprints 2d facial images signatures passports visas norwegian biometrics company idex asa begun development electronic id cards eid fingerprint security technology use throughout eu issued since end 2014 issued since 2004 without chip inside symbol compliant icao standards since 2012 may 2016 pakistan interior minister launched project officially promised epassports would available fully 2017 citizens issued since 2014 costs 100 21 february 2016 superintendencia nacional de migraciones announced first peruvian biometric passports would delivered 26 february 2016 features new cover along several security improvements order exempted visas schengen area cost pen98.50 approximately usd28 making cheapest passport latin america issued since 11 august 2009 costs ₱950 issued since 20 april 2008 costs qr200 issued since 2006 since august 3 2018 cost 5,000 rubles approximately us 80 use printed data photo fingerprints bac-encrypted biometric passports issued 1 march 2010 valid 10 years russian biometric passports currently issued within russia consulates 1 january 2015 passports contain fingerprints issued since 27 june 2019 compliance new east african community technical specifications well international civil aviation organisation icao among new features include microchip making tamper-proof issued since 4 march 2014 saudi arabia issue biometric passports 26 march 2018 issued since 7 july 2008 costs 3.600 rsd approximately €32 valid 10 years 5 years children aged 3 14 3 years children aged 3 less issued since 15 august 2006 costs 70 sgd applied online mail ica deposit box 80 sgd applied via singapore overseas mission valid 5 years passport complies us visa waiver program issued since 10 october 2006 costs us 100 applied inside somalia us 150 abroad issued since 25 august 2008 costs 55,000 us 55 validity 5 10 years issued since 3 january 2012 new passport valid five years issued since 2008 latest version issued 2014 contains contactless chip biodata card meets icao specifications issued since 10 august 2015 october 2016 new passports require thumbs scanned digital facial mapping photograph taken issuing process issued since may 2009 costs sdg250 approximately us 100 sdg200 students sdg100 children valid 5 years 7 years commercial passport issued since 4 september 2006 costs chf 140.00 adults chf 60.00 children 18 years.. since 1 march 2010 issued passports biometric containing photograph two fingerprints recorded electronically issued since 29 december 2008 costs nt 1,600 ordinary passport either 3 5 10 years validity issued since 1 february 2010 diplomats government officials passports issued 26 may 2005 1 june 2005 limited quantity 100 passports day issued thai citizens however 1 august 2005 full operational service installed thailand became first country asia issue icao compliant biometric passport issued since august 2009 cost 30,000 cfa francs togolese residing abroad price varies tunisia ministry interior stated start issuing biometric passports end year 2016 happen turkish passports compatible european union standards available since 1 june 2010 colours new biometric passports also changed accordingly regular passports claret red special passports bottle green diplomatic passports wrap black colours recently turkish minister state announced government printing new passports government minting office since private contractor failed deliver june 2018 cost issuing 10-year passport turkey ₺764 approximately us 160 turkmenistan became first country ex-ussr mid-asia region issue icao-compliant biometric passport passport available since 10 july 2008 according law ukraine supposed issue biometric passports identity cards 1 january 2013 however become available two years later january 2015 fully compatible european union standards united arab emirates ministry interior began issue biometric passports 11 december 2011 making second gcc state launch biometric passports qatar biometric version u.s. passport sometimes referred electronic passport descriptive data digitized passport photo contactless chips fingerprint information placed onto contactless chip however chip large enough 64 kilobytes inclusion biometric identifiers u.s. department state first issued passports 2006 since august 2007 issues biometric passports non-biometric passports valid expiration dates although system able perform facial-recognition match bearer image stored contactless chip desired unclear system deployed u.s. department homeland security ports entry high level security became priority united states attacks 11 september 2001 high security required cracking counterfeit passports october 2004 production stages high-tech passport commenced u.s. government printing office gpo issued awards top bidders program awards totaled roughly 1,000,000 startup development testing driving force initiative u.s enhanced border security visa entry reform act 2002 also known border security act states smartcard identity cards able replace visas foreigners travelling u.s. wish enter u.s. visa-free visa waiver program vwp required possess machine-readable passports comply international standards additionally travellers holding valid passport issued 26 october 2006 passport must biometric passport used enter u.s. visa-free vwp november 2018 hartsfield-jackson atlanta international airport delta air lines opened nation first curb-to-gate biometric terminal promised improve aviation security moving travelers faster screening uruguayan ministry interior started issue biometric passports uruguayan citizens 16 october 2015 new passport complies standards set forth visa waiver program united states uzbekistan 23 june 2009 islam karimov issued presidential decree measures improve passport system republic uzbekistan 29 december 2009 president uzbekistan signed decree change dates phased exchange populations existing passport biometric passport accordance decree biometric passports phased beginning 1 january 2011 first phase biometric passport issued employees ministries departments agencies republic individuals travel abroad outside country well citizens receive passport connection achievement certain age grounds provided law second phase rest population able get new passports period 2012 2015 issued july 2007 venezuela first latin american country issuing passports including rfid chips along major security improvements chip photo fingerprints data introduced june 2017 icao passport standards related materials open source free tools | [
3456,
11138,
8038,
7402,
3629,
3566,
10831,
880,
9745,
10163,
3128,
4313,
3612,
10207
] | Test |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.